This work discusses the beginning of fractional calculus and how the Sumudu and Elzaki transforms are applied to fractional derivatives. This approach combines a double Sumudu-Elzaki transform strategy to discover analytic solutions to space-time fractional partial differential equations in Mittag-Leffler functions subject to initial and boundary conditions. Where this method gets closer and closer to the correct answer, and the technique's efficacy is demonstrated using numerical examples performed with Matlab R2015a.
The work in this paper focuses on the experimental confirming of the losses in photonic crystal fibers (PCF) on the transmission of Q-switched Nd:YAG laser. First HC-PCF was evacuated to 0.1 mbar then the microstructure fiber (PCF) was filled with He gas & gas. Second the input power and output power of Q-switched Nd:YAG laser was measured in hollow core photonic bandgap fiber (HCPCF). In this work loss was calculated in the hollow core photonic crystal fiber (HCPCF) filled with air then N2, and He gases respectively. It has bean observed that the minimum loss obtained in case of filling (HC-PCF) with He gas and its equal to 15.070 dB/km at operating wavelength (1040-1090) nm.
A QR code is a type of barcode that can hold more information than the familiar kind scanned at checkouts around the world. The “QR” stands for “Quick Response”, a reference to the speed at which the large amounts of information they contain can be decoded by scanners. They are being widely used for advertising campaigns, linking to company websites, contest sign-up pages and online menus. In this paper, we propose an efficient module to extract QR code from background and solve problem of rotation in case of inaccurate image taken from mobile camera.
The aim of this essay is to use a single-index model in developing and adjusting Fama-MacBeth. Penalized smoothing spline regression technique (SIMPLS) foresaw this adjustment. Two generalized cross-validation techniques, Generalized Cross Validation Grid (GGCV) and Generalized Cross Validation Fast (FGCV), anticipated the regular value of smoothing covered under this technique. Due to the two-steps nature of the Fama-MacBeth model, this estimation generated four estimates: SIMPLS(FGCV) - SIMPLS(FGCV), SIMPLS(FGCV) - SIM PLS(GGCV), SIMPLS(GGCV) - SIMPLS(FGCV), SIM PLS(GGCV) - SIM PLS(GGCV). Three-factor Fama-French model—market risk premium, size factor, value factor, and their implication for excess stock returns and portfolio return
... Show Moremodel is derived, and the methodology is given in detail. The model is constructed depending on some measurement criteria, Akaike and Bayesian information criterion. For the new time series model, a new algorithm has been generated. The forecasting process, one and two steps ahead, is discussed in detail. Some exploratory data analysis is given in the beginning. The best model is selected based on some criteria; it is compared with some naïve models. The modified model is applied to a monthly chemical sales dataset (January 1992 to Dec 2019), where the dataset in this work has been downloaded from the United States of America census (www.census.gov). Ultimately, the forecasted sales
Despite the principle of separation of powers brought by the French Revolution, which entrusted the task of drafting legislation and its amendment to the legislative authority and the task of settling disputes and settling them in the judiciary. However, since that date, the French judiciary has played a major role in the development of French civil law (In spite of all the economic and social developments that have taken place in French society throughout these years) since its promulgation until February of 2016, the date of the Legislative Decree No. 131 of the year 2016 A modification is the largest in the history of the French Civil Code (which was the judicial precedents in which a significant impact), was assisted by the French judic
... Show MoreTraditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).