Photonic crystal fiber interferometers are used in many sensing applications. In this work, an in-reflection photonic crystal fiber (PCF) based on Mach-Zehnder (micro-holes collapsing) (MZ) interferometer, which exhibits high sensitivity to different volatile organic compounds (VOCs), without the needing of any permeable material. The interferometer is robust, compact, and consists of a stub photonic crystal fiber of large-mode area, photonic crystal fiber spliced to standard single mode fiber (SMF) (corning-28), this splicing occurs with optimized splice loss 0.19 dB In the splice regions the voids of the holey fiber are completely collapsed, which allows the excitation and recombination of core and cladding modes. The device reflection

In this paper mildly-regular topological space was introduced via the concept of mildly g-open sets. Many properties of mildly - regular space are investigated and the interactions between mildly-regular space and certain types of topological spaces are considered. Also the concept of strong mildly-regular space was introduced and a main theorem on this space was proved.

Dust is a frequent contributor to health risks and changes in the climate, one of the most dangerous issues facing people today. Desertification, drought, agricultural practices, and sand and dust storms from neighboring regions bring on this issue. Deep learning (DL) long short-term memory (LSTM) based regression was a proposed solution to increase the forecasting accuracy of dust and monitoring. The proposed system has two parts to detect and monitor the dust; at the first step, the LSTM and dense layers are used to build a system using to detect the dust, while at the second step, the proposed Wireless Sensor Networks (WSN) and Internet of Things (IoT) model is used as a forecasting and monitoring model. The experiment DL system

In multivariate survival analysis, estimating the multivariate distribution functions and then measuring the association between survival times are of great interest. Copula functions, such as Archimedean Copulas, are commonly used to estimate the unknown bivariate distributions based on known marginal functions. In this paper the feasibility of using the idea of local dependence to identify the most efficient copula model, which is used to construct a bivariate Weibull distribution for bivariate Survival times, among some Archimedean copulas is explored. Furthermore, to evaluate the efficiency of the proposed procedure, a simulation study is implemented. It is shown that this approach is useful for practical situations and applicable fo

In aspect-based sentiment analysis ABSA, implicit aspects extraction is a fine-grained task aim for extracting the hidden aspect in the in-context meaning of the online reviews. Previous methods have shown that handcrafted rules interpolated in neural network architecture are a promising method for this task. In this work, we reduced the needs for the crafted rules that wastefully must be articulated for the new training domains or text data, instead proposing a new architecture relied on the multi-label neural learning. The key idea is to attain the semantic regularities of the explicit and implicit aspects using vectors of word embeddings and interpolate that as a front layer in the Bidirectional Long Short-Term Memory Bi-LSTM. First, we

خلال الربع الأخير من القرن العشرين ، شهد الاقتصاد العالمي تحولا في مختلف المجالات التجارية والتكنولوجية والمالية التي غيرت هيكلها وأنتجت وضعا جديدا يتمثل بشكل رئيس في زيادة حركة رأس المال الأجنبي والتوسع السريع للإنتاج الدولي والتجارة بالإضافة إلى التطور التكنولوجي الهائل ونقل التكنولوجيا ، مما أدى إلى هوس الدول بالمنافسة على المستوى العالمي والسعي لدخول الأسواق الدولية وتحسين قدرتها التنافسية. وت

Several authors have used ranking function for solving linear programming problem. In This paper is proposed two ranking function for solving fuzzy linear programming and compare these two approach with trapezoidal fuzzy number .The proposed approach is very easy to understand and it can applicable, also the data were chosen from general company distribution of dairy (Canon company) was proposed test approach and compare; This paper prove that the second proposed approach is better to give the results and satisfy the minimal cost using Q.M. Software

يهدف البحث الى دراسة وتحليل الهندسة المتزامنة (CE) وتحسين التكلفة(CO)، واستعمال مخرجات الهندسة المتزامنة كمدخلات لتحسين التكلفة، وبيان دور الهندسة المتزامنة في تحسين جودة المنتوج، وتحقيق وفورات في وقت التصميم والتصنيع والتجميع وتخفيض التكاليف، فضلاً عن توظيف بعض النماذج لتحديد مقدار الوفورات في الوقت ومنها نموذج(Lexmark) ونموذج (Pert) لتحديد الوفورات في وقت التصميم وقت لتصنيع والتجميع.      ولتحقيق اهداف 

The expanding use of multi-processor supercomputers has made a significant impact on the speed and size of many problems. The adaptation of standard Message Passing Interface protocol (MPI) has enabled programmers to write portable and efficient codes across a wide variety of parallel architectures. Sorting is one of the most common operations performed by a computer. Because sorted data are easier to manipulate than randomly ordered data, many algorithms require sorted data. Sorting is of additional importance to parallel computing because of its close relation to the task of routing data among processes, which is an essential part of many parallel algorithms. In this paper, sequential sorting algorithms, the parallel implementation of man

n this research, several estimators concerning the estimation are introduced. These estimators are closely related to the hazard function by using one of the nonparametric methods namely the kernel function for censored data type with varying bandwidth and kernel boundary. Two types of bandwidth are used: local bandwidth and global bandwidth. Moreover, four types of boundary kernel are used namely: Rectangle, Epanechnikov, Biquadratic and Triquadratic and the proposed function was employed with all kernel functions. Two different simulation techniques are also used for two experiments to compare these estimators. In most of the cases, the results have proved that the local bandwidth is the best for all the types of the kernel boundary func