Today in the digital realm, where images constitute the massive resource of the social media base but unfortunately suffer from two issues of size and transmission, compression is the ideal solution. Pixel base techniques are one of the modern spatially optimized modeling techniques of deterministic and probabilistic bases that imply mean, index, and residual. This paper introduces adaptive pixel-based coding techniques for the probabilistic part of a lossy scheme by incorporating the MMSA of the C321 base along with the utilization of the deterministic part losslessly. The tested results achieved higher size reduction performance compared to the traditional pixel-based techniques and the standard JPEG by about 40% and 50%,

This study rigorously investigates three 3d transition metal carbide (TMC) structures via LDA and GGA approximations. It examines cohesive energy (Ecoh), Vickers hardness (Hv), mechanical stability, and electronic properties. Notably, most 3d TMCs exhibit higher cohesive energy than nitrides, and rs-TiC demonstrates a Vickers hardness of 25.66 GPa, outperforming its nitride counterpart. The study employs theoretical calculations to expedite research, revealing mechanical stability in CrC and MnC (GGA) and CrC (LDA in cc structure), while all 3d TMCs in rs and seven in zb structures show stability. Charge transfer and bonding analysis reveal enhanced covalency along the series, influenced by the interplay between p orbitals of carbon and d o

Encryption of data is translating data to another shape or symbol which enables people only with an access to the secret key or a password that can read it. The data which are encrypted are generally referred to as cipher text, while data which are unencrypted are known plain text. Entropy can be used as a measure which gives the number of bits that are needed for coding the data of an image. As the values of pixel within an image are dispensed through further gray-levels, the entropy increases. The aim of this research is to compare between CAST-128 with proposed adaptive key and RSA encryption methods for video frames to determine the more accurate method with highest entropy. The first method is achieved by applying the "CAST-128" and

Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorith

The emphasis of Master Production Scheduling (MPS) or tactic planning is on time and spatial disintegration of the cumulative planning targets and forecasts, along with the provision and forecast of the required resources. This procedure eventually becomes considerably difficult and slow as the number of resources, products and periods considered increases. A number of studies have been carried out to understand these impediments and formulate algorithms to optimise the production planning problem, or more specifically the master production scheduling (MPS) problem. These algorithms include an Evolutionary Algorithm called Genetic Algorithm, a Swarm Intelligence methodology called Gravitational Search Algorithm (GSA), Bat Algorithm (BAT), T

BP algorithm is the most widely used supervised training algorithms for multi-layered feedforward neural net works. However, BP takes long time to converge and quite sensitive to the initial weights of a network. In this paper, a modified cuckoo search algorithm is used to get the optimal set of initial weights that will be used by BP algorithm. And changing the value of BP learning rate to improve the error convergence. The performance of the proposed hybrid algorithm is compared with the stan dard BP using simple data sets. The simulation result show that the proposed algorithm has improved the BP training in terms of quick convergence of the solution depending on the slope of the error graph.

Summary:

This research revolves around the probing of those whom Ibn Hajar said, "He has a vision", its significance, and the ruling on the connection and transmission to it.  The number of narrators reached fifty-one (51) narrators, among whom it was said, “He has a vision, whether it is definite or possibly. Some of them had a vision and companionship.”They are eleven (11) narrators, And among them were those who had visions and had no company, and their number was twenty-one (21) narrators, and among them were those who had no vision and nor company, and their number is nineteen (19) narrators.
As a result , whoever said about him “has a vision” and has companions, his hadith is connected, even i

Rate of penetration plays a vital role in field development process because the drilling operation is expensive and include the cost of equipment and materials used during the penetration of rock and efforts of the crew in order to complete the well without major problems. It’s important to finish the well as soon as possible to reduce the expenditures. So, knowing the rate of penetration in the area that is going to be drilled will help in speculation of the cost and that will lead to optimize drilling outgoings. In this research, an intelligent model was built using artificial intelligence to achieve this goal.  The model was built using adaptive neuro fuzzy inference system to predict the rate of penetration in

This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord