In many applications such as production, planning, the decision maker is important in optimizing an objective function that has fuzzy ratio two functions which can be handed using fuzzy fractional programming problem technique. A special class of optimization technique named fuzzy fractional programming problem is considered in this work when the coefficients of objective function are fuzzy. New ranking function is proposed and used to convert the data of the fuzzy fractional programming problem from fuzzy number to crisp number so that the shortcoming when treating the original fuzzy problem can be avoided. Here a novel ranking function approach of ordinary fuzzy numbers is adopted for ranking of triangular fuzzy numbers with simpler and easier calculations as well as shortening in the procedures. The fuzzy fractional programming problem is the first reduced to a fractional programming problem and then solved with the technique to obtain the optimal solution. It has a power to give a best solution for supporting the solution theory proposed in this work, some numerical fuzzy fractional programming problem are included to ensure the advantage, efficiency and accuracy of the suggested algorithm. In addition, this research paper describes a comparison between our optimal solutions with other existing solutions for inequalities constrains fuzzy fractional program.
The decoration structure in calligraphy painting is one of the variables that characterized the structure of the calligraphic composition due to the artistic, aesthetic and expressive properties of the letters of the Arabic calligraphy, which are represented by flexibility, compliance and the ability to form. Therefore, the researcher defined his problem by asking the following question: What is the decorative structure in the calligraphic painting? The study aimed to reveal the structure of the ornamentation in the calligraphy painting, while the researcher dealt with in the second chapter three sections, the first (the ornamental concept and meaning) and the second topic (the structural characteristics of the Arabic letter in the calli
... Show MoreThe predilection for 5G telemedicine networks has piqued the interest of industry researchers and academics. The most significant barrier to global telemedicine adoption is to achieve a secure and efficient transport of patients, which has two critical responsibilities. The first is to get the patient to the nearest hospital as quickly as possible, and the second is to keep the connection secure while traveling to the hospital. As a result, a new network scheme has been suggested to expand the medical delivery system, which is an agile network scheme to securely redirect ambulance motorbikes to the nearest hospital in emergency cases. This research provides a secured and efficient telemedicine transport strategy compatible with the
... Show MoreBragg Reflectors consist of periodic dielectric layers having an optical path length of quarter wavelength for each layer giving them important properties and makes them suitable for optoelectronics applications. The reflectivity can be increased by increasing the number of layers of the mirror to get the required value. For example for an 8 layers Bragg mirror (two layers for each dielectric pair), the contrast of the refractive index has to be equal to 0.275 for reaching reflectivity > 99%. Doubling the number of layers results in a reflectivity of 99.99%. The high reflectivity is purely caused by multiple-interference effects. It can be analyzed by using different matrix methods such as the transfer matrix method (TMM) which is the
... Show MoreThis research include building mathematical models for aggregating planning and shorting planning by using integer programming technique for planning master production scheduling in order to control on the operating production for manufacturing companies to achieve their objectives of increasing the efficiency of utilizing resources and reduce storage and improving customers service through deliver in the actual dates and reducing delays.
In this paper, variable gain nonlinear PD and PI fuzzy logic controllers are designed and the effect of the variable gain characteristic of these controllers is analyzed to show its contribution in enhancing the performance of the closed loop system over a conventional linear PID controller. Simulation results and time domain performance characteristics show how these fuzzy controllers outperform the conventional PID controller when used to control a nonlinear plant and a plant that has time delay.
The performance quality and searching speed of Block Matching (BM) algorithm are affected by shapes and sizes of the search patterns used in the algorithm. In this paper, Kite Cross Hexagonal Search (KCHS) is proposed. This algorithm uses different search patterns (kite, cross, and hexagonal) to search for the best Motion Vector (MV). In first step, KCHS uses cross search pattern. In second step, it uses one of kite search patterns (up, down, left, or right depending on the first step). In subsequent steps, it uses large/small Hexagonal Search (HS) patterns. This new algorithm is compared with several known fast block matching algorithms. Comparisons are based on search points and Peak Signal to Noise Ratio (PSNR). According to resul
... Show MoreString matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that is created and kept by modern computational devices influences researchers to obtain even more powerful methods for coping with this problem. In this research, the Quick Search string matching algorithm are adopted to be implemented under the multi-core environment using OpenMP directive which can be employed to reduce the overall execution time of the program. English text, Proteins and DNA data types are utilized to examine the effect of parallelization and implementation of Quick Search string matching algorithm on multi-co
... Show MoreIdentification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed
... Show More