This paper proposes a novel method for generating True Random Numbers (TRNs) using electromechanical switches. The proposed generator is implemented using an FPGA board. The system utilizes the phenomenon of electromechanical switch bounce to produce a randomly fluctuated signal that is used to trigger a counter to generate a binary random number. Compared to other true random number generation methods, the proposed approach features a high degree of randomness using a simple circuit that can be easily built using off-the-shelf components. The proposed system is implemented using a commercial relay circuit connected to an FPGA board that is used to process and record the generated random sequences. Applying statistical testing on th

It has become necessary to change from a traditional system to an automated system in production processes, because it has high advantages. The most important of them is improving and increasing production. But there is still a need to improve and develop the work of these systems. The objective of this work is to study time reduction by combining multiple sequences of operations into one process. To carry out this work, the pneumatic system is designed to decrease\ increase the time of the sequence that performs a pick and place process through optimizing the sequences based on the obstacle dimensions. Three axes are represented using pneumatic cylinders that move according to the sequence used. The system is implemented and

In this work, new di-acid monomers 4, 4’-di-carboxillic-4”-bromo-2”, 6”-dimethyl triphenylamine (Ma), 4, 4’- di-carboxylic -4”-chloro-2”, 6”-dimethyl triphenylamine (Mb) and 4, 4’- di-carboxylic -2”,4”-dichloro-6”-methyl triphenylamine (Mc) were synthesized by reaction of p-cyanobenzofluride with three different aromatic amines (4-bromo,2,6-dimethyl aniline, 4-chloro,2,6-dimethyl aniline and 2,4 dichloro, 6- methyl aniline )  via aromatic nucleophilc substitution method to form three di cyano intermediates 4, 4’-Dicyano-4”-bromo-2”, 6”-dimethyl triphenylamine (Da), 4,

Among the metaheuristic algorithms, population-based algorithms are an explorative search algorithm superior to the local search algorithm in terms of exploring the search space to find globally optimal solutions. However, the primary downside of such algorithms is their low exploitative capability, which prevents the expansion of the search space neighborhood for more optimal solutions. The firefly algorithm (FA) is a population-based algorithm that has been widely used in clustering problems. However, FA is limited in terms of its premature convergence when no neighborhood search strategies are employed to improve the quality of clustering solutions in the neighborhood region and exploring the global regions in the search space. On the

        The research paper deals with the role of the place making in eco-tourism through a review of international experiences in the eco-tourism industry and its contribution to advancing the reality of tourism there, and attracting the largest number of tourists.  The study is divided into five axes: the first is a study of related concepts, and the second is a study of global experiences, which included three countries: (South Bank (Gabriel's Wharf) - London, Rotterdam in the Netherlands, and dealt with each of Happy Streets and Kendrick Mills, and then the Perak River tourist corridor - Malaysia).  As for the third axis, it is concerned with analyzing these experiences to reach th

As the bit rate of fiber optic transmission systems is increased to more than , the system will suffer from an important random phenomena, which is called polarization mode dispersion. This phenomenon contributes effectively to: increasing pulse width, power decreasing, time jittering, and shape distortion. The time jittering means that the pulse center will shift to left or right. So that, time jittering leads to interference between neighboring pulses. On the other hand, increasing bit period will prevent the possibility of sending high rates. In this paper, an accurate mathematical analysis to increase the rates of transmission, which contain all physical random variables that contribute to determine the transmission rates, is presen

Support vector machine (SVM) is a popular supervised learning algorithm based on margin maximization. It has a high training cost and does not scale well to a large number of data points. We propose a multiresolution algorithm MRH-SVM that trains SVM on a hierarchical data aggregation structure, which also serves as a common data input to other learning algorithms. The proposed algorithm learns SVM models using high-level data aggregates and only visits data aggregates at more detailed levels where support vectors reside. In addition to performance improvements, the algorithm has advantages such as the ability to handle data streams and datasets with imbalanced classes. Experimental results show significant performance improvements in compa

Intrusion detection systems detect attacks inside computers and networks, where the detection of the attacks must be in fast time and high rate. Various methods proposed achieved high detection rate, this was done either by improving the algorithm or hybridizing with another algorithm. However, they are suffering from the time, especially after the improvement of the algorithm and dealing with large traffic data. On the other hand, past researches have been successfully applied to the DNA sequences detection approaches for intrusion detection system; the achieved detection rate results were very low, on other hand, the processing time was fast. Also, feature selection used to reduce the computation and complexity lead to speed up the system

   Real life scheduling problems require the decision maker to consider a number of criteria before arriving at any decision. In this paper, we consider the multi-criteria scheduling problem of n jobs on single machine to minimize a function of five criteria denoted by total completion times (∑), total tardiness (∑), total earliness (∑), maximum tardiness () and maximum earliness (). The single machine total tardiness problem and total earliness problem are already NP-hard, so the considered problem is strongly NP-hard.

We apply two local search algorithms (LSAs) descent method (DM) and simulated annealing method (SM) for the 1// (∑∑∑