The issue of increasing the range covered by a wireless sensor network with restricted sensors is addressed utilizing improved CS employing the PSO algorithm and opposition-based learning (ICS-PSO-OBL). At first, the iteration is carried out by updating the old solution dimension by dimension to achieve independent updating across the dimensions in the high-dimensional optimization problem. The PSO operator is then incorporated to lessen the preference random walk stage's imbalance between exploration and exploitation ability. Exceptional individuals are selected from the population using OBL to boost the chance of finding the optimal solution based on the fitness value. The ICS-PSO-OBL is used to maximize coverage in WSN by converting regional monitoring into point monitoring utilizing the discretization method in WSN. In the experiments, the ICS-PSO-OBL with the standard CS and three CS variants (MACS, ICS-2, and ICS) are utilized to execute the simulation experiment under different numbers of nodes (20 and 30, respectively). The experimental results reveal that the optimized coverage of ICS-PSO-OBL is 18.36%, 7.894%, 15%, and 9.02% higher than that of standard CS, MACS, ICS-2, and ICS when the number of nodes is 20. Moreover, it is 16.94%, 9.61%, 12.27%, and 7.75% higher when the quantity of nodes is 30, the convergence speed of ICS-PSO-OBL, and the distribution of nodes is superior to others.
Some auditors may think that the audit process ends with discovering misstatements and informing management about them, while the discovery of misstatements may be classified by some as the first step in the phase of separating these distortions, as the auditor should collect these misstatements, evaluate them and detail them into misstatements involving errors or misstatements involving fraud Then evaluating it to material or immaterial according to what was stated in the international auditing standards and directing management to amend the essential ones. The importance of this research lies in identifying the concept of distortions and their types, identifying the method of evaluating distortions into substantial and non-essent
... Show MoreThis paper presents a hybrid genetic algorithm (hGA) for optimizing the maximum likelihood function ln(L(phi(1),theta(1)))of the mixed model ARMA(1,1). The presented hybrid genetic algorithm (hGA) couples two processes: the canonical genetic algorithm (cGA) composed of three main steps: selection, local recombination and mutation, with the local search algorithm represent by steepest descent algorithm (sDA) which is defined by three basic parameters: frequency, probability, and number of local search iterations. The experimental design is based on simulating the cGA, hGA, and sDA algorithms with different values of model parameters, and sample size(n). The study contains comparison among these algorithms depending on MSE value. One can conc
... Show MoreWireless sensor networks (WSNs) represent one of the key technologies in internet of things (IoTs) networks. Since WSNs have finite energy sources, there is ongoing research work to develop new strategies for minimizing power consumption or enhancing traditional techniques. In this paper, a novel Gaussian mixture models (GMMs) algorithm is proposed for mobile wireless sensor networks (MWSNs) for energy saving. Performance evaluation of the clustering process with the GMM algorithm shows a remarkable energy saving in the network of up to 92%. In addition, a comparison with another clustering strategy that uses the K-means algorithm has been made, and the developed method has outperformed K-means with superior performance, saving ener
... Show MoreAbstract: Data mining is become very important at the present time, especially with the increase in the area of information it's became huge, so it was necessary to use data mining to contain them and using them, one of the data mining techniques are association rules here using the Pattern Growth method kind enhancer for the apriori. The pattern growth method depends on fp-tree structure, this paper presents modify of fp-tree algorithm called HFMFFP-Growth by divided dataset and for each part take most frequent item in fp-tree so final nodes for conditional tree less than the original fp-tree. And less memory space and time.
The accession of countries to the World Trade Agreement and the openness of markets to each other without restrictions led to the emergence of the philosophy of "a world without borders and business units without countries", which required adapting the modern business environment to that philosophy, which is considered as objectives for the activities of the units that must be implemented in order to achieve competition. The objective of the units has changed from making profit to meeting the desires of customers, which is what imposed a new role for management accounting as a field of knowledge renewed in it visions of competitiveness between units. Because of the increasing needs for information in light of environmental change
... Show MoreThe Audit evedances represent the reconciliation tools between the Financial data shown on financial statements, and the level of satisfaction level of the Auditor about these statements. According that, the Auditor try to achieve the highest quantity of These evidances, and the most satisfactive of it…, but that will be so hard sometimes, when the internal controlling system is not good, and when the Auditor had some satisfied evidences, but not sharp… So, this research comes to inspect the relation between the quantity, and the level of satisfaction, and argument to prove that evidences gives. This research assumes that getting enough evidences leads to reduce faults, improves the auditing operation, and avoids risks. The research
... Show MoreThe alternating direction implicit method (ADI) is a common classical numerical method that was first introduced to solve the heat equation in two or more spatial dimensions and can also be used to solve parabolic and elliptic partial differential equations as well. In this paper, We introduce an improvement to the alternating direction implicit (ADI) method to get an equivalent scheme to Crank-Nicolson differences scheme in two dimensions with the main feature of ADI method. The new scheme can be solved by similar ADI algorithm with some modifications. A numerical example was provided to support the theoretical results in the research.
Recently Genetic Algorithms (GAs) have frequently been used for optimizing the solution of estimation problems. One of the main advantages of using these techniques is that they require no knowledge or gradient information about the response surface. The poor behavior of genetic algorithms in some problems, sometimes attributed to design operators, has led to the development of other types of algorithms. One such class of these algorithms is compact Genetic Algorithm (cGA), it dramatically reduces the number of bits reqyuired to store the poulation and has a faster convergence speed. In this paper compact Genetic Algorithm is used to optimize the maximum likelihood estimator of the first order moving avergae model MA(1). Simulation results
... Show More