Future wireless communication systems must be able to accommodate a large number of users and simultaneously to provide the high data rates at the required quality of service. In this paper a method is proposed to perform the N-Discrete Hartley Transform (N-DHT) mapper, which are equivalent to 4-Quadrature Amplitude Modulation (QAM), 16-QAM, 64-QAM, 256-QAM, … etc. in spectral efficiency. The N-DHT mapper is chosen in the Multi Carrier Code Division Multiple Access (MC-CDMA) structure to serve as a data mapper instead of the conventional data mapping techniques like QPSK and QAM schemes. The proposed system is simulated using MATLAB and compared with conventional MC-CDMA for Additive White Gaussian Noise, flat, and multi-path selective fa

A chemical optical fiber sensor based on surface plasmon resonance (SPR) was developed and implemented using multimode plastic optical fiber. The sensor is used to detect and measure the refractive index and concentration of various chemical materials (Urea, Ammonia, Formaldehyde and Sulfuric acid) as well as to evaluate the performance parameters such as sensitivity, signal to noise ratio, resolution and figure of merit. It  was noticed that the value of the sensitivity of the optical fiber-based SPR sensor, with 60nm and 10 mm long, Aluminum(Al) and Gold (Au) metals film exposed sensing region, was 4.4 μm, while the SNR was 0.20, figure of merit was 20 and resolution 0.00045. In this work a multimode

Aggregate production planning (APP) is one of the most significant and complicated problems in production planning and aim to set overall production levels for each product category to meet fluctuating or uncertain demand in future. and to set decision concerning hiring, firing, overtime, subcontract, carrying inventory level. In this paper, we present a simulated annealing (SA) for multi-objective linear programming to solve APP. SA is considered to be a good tool for imprecise optimization problems. The proposed model minimizes total production and workforce costs. In this study, the proposed SA is compared with particle swarm optimization (PSO). The results show that the proposed SA is effective in reducing total production costs and req

Most Internet of Vehicles (IoV) applications are delay-sensitive and require resources for data storage and tasks processing, which is very difficult to afford by vehicles. Such tasks are often offloaded to more powerful entities, like cloud and fog servers. Fog computing is decentralized infrastructure located between data source and cloud, supplies several benefits that make it a non-frivolous extension of the cloud. The high volume data which is generated by vehicles’ sensors and also the limited computation capabilities of vehicles have imposed several challenges on VANETs systems. Therefore, VANETs is integrated with fog computing to form a paradigm namely Vehicular Fog Computing (VFC) which provide low-latency services to mo

Witnessing the global arena many changes in the political, economic, social, scientific and technological have left their mark on the world as a whole, these changes require necessarily Advancement of the profession of auditing, and improve their performance, especially after the mixer skepticism the health of approach and the method followed by a check in the major audit firms global view as for the external audit of an active role in providing services to members of the community in various sectors, were to be provide these services to the highest level of quality.To ensure the quality of the audit process to be a proper planning is based on a scientific basis to be the substrate a strong underlying different audit works, and if planni

Antimagic labeling of a graph  with  vertices and  edges is assigned the labels for its edges by some integers from the set , such that no two edges received the same label, and the weights of vertices of a graph  are pairwise distinct. Where the vertex-weights of a vertex  under this labeling is the sum of labels of all edges incident to this vertex, in this paper, we deal with the problem of finding vertex antimagic edge labeling for some special families of graphs called strong face graphs. We prove that vertex antimagic, edge labeling for strong face ladder graph , strong face wheel graph ,  strong face fan graph , strong face prism graph  and finally strong face friendship graph .