Search

From time to time, we hear in the news about a breach or attack on some well-known companies as just news, but it is a serious problem because it is the privacy of citizens, their money in trade and managing their businesses and projects. In this paper, we offer a review of the honey encryption planner. Honey Encryption is the encryption system that ensures flexibility versus the brute-force attack through the provision of plain reasonable text, but false for each key is invalid utilized by a trespasser to decrypt a message, two key areas are open it is difficult to create a compelling message trap that's perfect enough to deceive the striker even when he believes that he has the message in its original form. The next problem, the typo issue, where a valid phony plain text seem to a lawful user when he accidentally enters the wrong key. Our goal is to have more satisfaction disguised tricks that are perfect enough to prevent a trespasser from getting the original message, We also need new security methods because the attackers are looking for new ways to attack the systems, so we proposed a new way to protect messages and passwords well and difficult to break and take all the possibilities of attack, including the brute-force, and then the data is hidden in an image with a public secret key.

Copyright of Arab Journal for Scientific Publishing is the property of Research & Development of Human Recourses Center (REMAH) and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

This paper presents basic neuropedagogical content knowledge )N-PCK( on the development of mathematical understanding in early childhood, in order to enable early childhood educators to understand neurological findings on mathematical development in the brain in an informed way and apply these findings to educational practice. The paper presents seven neuropedagogical principles surrounding mathematical development in early childhood, together with insights and practical examples that can be used to impact early childhood education. This review might also be used by teacher educators teaching courses on early numeracy, and as a basis for future research in this field. [ABSTRACT FROM AUTHOR]

Internet of Thing (IoT)" is a major and emerging technology where different devices are associated together to operate smartly deprived of human’s intervention. IoT has a great effect on economic, social and commercial life. The extremely large number of associated devices together through different protocols make it vulnerable to be threatened by several types of attacks, such as; Unauthorized Access and Authentication Attacks, Network Attacks, Data Privacy and Integrity Attacks, and Supply Chain Attacks. Building and developing lightweight authentication systems for IoT devices are indeed crucial due to several compelling reasons, including; Resource Constraints, Security Concerns, Scalability, Bandwidth Efficiency, Latency Considerations, Cost Reduction, Long Lifecycle and the overall User Experience. Blockchain and “Machine Learning (ML)” are emerging technologies that may be exploited in solving different security problems. This paper presents a survey of lightweight authentication protocols and schemes that are adopted and applied for IoT environment. The security issues in IoT environment are also discussed besides the different types of attacks that may face the network. The paper held a comparison between the selected works and studies in terms of different criteria including the benefits, the results, the used applications and technologies or methods.

Real-time systems play a major role in our today's life. They are used in essential control systems that rely on timely response and determined outcomes to work. The main real-time scheduling algorithms for both soft and hard real-time system is presented in this paper, both in processors uniprocessor and multiprocessor schemes. The effectiveness of scheduling is derived from various factors, including hardware configuration, real-time application type, and real-time problem complexity. This review presents a characterization of scheduling techniques to help the researcher to get enough knowledge in real-time systems with adequate scheduling schemes to reach their timeliness characteristic. In this paper, we aim to investigate the scheduling attributes and scope of research in real-time computing, and classify real-time system in two categories: algorithms for multiprocessor scheduling and algorithms for uniprocessor scheduling. Furthermore, gives special attention to characteristic and their task, that is one of the following original contributions to real-time scheduling algorithms.

Abstract—The graphs which are used in this paper are simple, finite and undirected. The first and second Zagreb indices for every non-adjacent vertices (also called first and second Zagreb coindices) are dependent only on the non-adjacent vertices degrees which interspersed the operations of addition and multiplication, respectively, for the degrees of non-adjacent vertices. The number of the edges incident on vertex v in a graph G is called the degree of a vertex v and the two vertices u and v are non-adjacent if it’s no common edge between them. In this paper, we found the first and second Zagreb coindices of chains of even cycles and also, gave some examples.

Copyright of Journal of Educational & Psychological Studies / Magallat Al-Dirasat Al-Tarbawiyyat Wa-Al-Bafsiyyat is the property of Sultan Qaboos University and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The Cuckoo Search (CS) algorithm is an effective swarm intelligence optimization algorithm whose important developments were presented by Yang and Deb in 2009. The CS algorithm has been used in many applications to solve optimization problems. This paper describes an overview of the applications of CS in the scope of image processing to solve optimization problems for the image during the years 2015-2021. The main categories reviewed that used CS in the field of image processing are: image segmentation, image optimization, image noise removal, image classification, feature extraction in images, image clustering and edge detection. The aim of this paper is to provide an overview and summarize the literature review of applying CS algorithm in these categories in order to extract which categories that applied this algorithm more than others. From this review we conclude that CS was mostly applied in the image segmentation category to optimize the threshold search.

Copyright of International Journal of Educational Psychological Studies (EPS) is the property of Refaad for Studies, Research & Development and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In this paper, new kinds of open sets inside ideal topological spaces are introduced; they are called ic - I - open,icc - I -open,weakly ic - I - open and weakly icc - I - open. Some properties and relations between these new classes are studied with examples. The concept of continuity in ideal topological spaces is also presented for these new classes. Theorems that provide an equivalence relation between these new classes are proved. Also, for ideal topological spaces (Ɲ, Ʈ, I) we show that all open sets are ic -I- open, icc - I - open, weakly ic - I - open, weakly icc - I - open . Finally, Assume Z ⊂ Ɲ of ideal Topological spaces (Ɲ,Ʈ,l ). Then 1) if Z is semi - I - open, then Zc is ic – I - open.2) if Z is open and ic - I - closed, then Z is semi - I - open.

This study demonstrates how to control fluid flow in inclined and horizontal cavities. The equations governing the problem are established, including the two-dimensional nonlinear partial differential equations of energy, motion, and continuity. We use the successive implicit direction method (ADI) to numerically solve these equations. We discovered that the Rayleigh, Prandtl, Darcy, Eckert, and Reynolds numbers influenced the action of motion and energy equations. In addition to the effect of the problem's inclination angle. We solved this scheme by creating a computer program in MATLAB,we conclude that all equations can be solved to a stable state after a number of iterations, and at different angles 0, 30, and 90, the ADI method, as shown in the paper figures

In this paper, three types of rings were reviewed: invo-clean, invo-t-clean and invo-k-clean, the ring invo-clean is invo-t-clean and invo-k-clean. Since invo-t-clean ring is invo-k-clean when k=3. Various examples representing elements of the three rings were presented, as were other rings in Zn that satisfy the three types, especially for the invo-k-clean ring, where different examples of rings were taken at different values of k. There are properties that all rings share and others that differ among them, the most important of which is characteristic, where the invo-clean ring is 24, and the invo-t-clean ring is 120 while invo-k-clean there is difficulty in proving it.

Copyright of Journal of Special Education & Rehabilitation (2314-8608) is the property of Association of Arab Universities and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Currently, there are many approaches for image transformations that are developed to cover the new technology in the huge amount of data treatment. In this paper, a study on Curvelet transformation coefficients was performed based on the aerial image to apply segmentation. This paper applies a lot of modifications on cut off frequencies on the filters, which is used to decompose the image on curvelet transformation. Two approaches are proposed and tested to look for the best segmentation result; the first one is based on designing filters manually, while the second evaluates the filter coefficients depending on the selected shape of the filters. The first technique gives acceptable segmentation and the second reaches the optimal result. One of the most important results is that the cut of frequency has a high effect on the segmentation; in addition, choosing filter parameters depended on the coefficients dimension of the curvelet transformation. Finally, the results show that the first approach underperformed the second one.

This paper provides an efficient algorithm to generate three dimensional objects from simple uncomplicated 2D environment, lead to reduce processor effort, limit of using complex mathematical operations. Most of the previous researches used the idea of ​​drawing by vanishing point to generate 3D objects from 2D environment, But the algorithm designed in this paper provides an idea of ​​how to draw three-dimensional shapes from two-dimensional drawings when applying Cohen Sutherland Line clipping algorithm, so that a basic two-dimensional shape is inserted from a set of points connected with each other must be within vision borders with a vanishing point outside of vision that is connected with all points of basic shape to consist a group of lines with partial intersections. So that any point has specific limited vision border which represents one of its coordinates of depth vertex, finally 3d object is generated when all clipping processes are completed to obtain other coordinates for all points.

Data transmission, security and authenticity, nowadays is considered the major source of problems. To face these problems a suitable solution have to be forwarded . Steganography is forwarded one of the solutions as a technique among many. This paper includes proposal for using a new technique called (Quick Respond Codes) QR Codes . QR Codes technique is mainly used to convert and store messages since it has higher and large storage capacity, in addition to that we used, in this paper , the STR (Short Tandem Repeats) DNA sequence. STR DNA is very important because each person has its own DNA which means that security and authentication ) reliable ( are very high. The proposed method is to convert the hidden data (STR DNA sequence) to QR code that mean the security is at maximum. Then, by using the MD5 (Message Digest 5) Algorithm, the result data is converted to QR code and the data within the data areas are stored in an unusually large format to make retrieval difficult. Finally, STR DNA sequences were applied in different lengths and converted to QR code. By this method , the QR code is applied in different applications and it was very fast (3-4 second). To apply this technique and to reduce the cost, we use a webcam to get back the private (confidential) data from the QR code. The data were retrieved completely without any error because QR code is reliable and authentic. From the above result we suggest to use QR Code for indentification of the of the individual (ID).

In this paper, we present the idea of a strongly invo. T-clean rings, which we define as rings with every a in R having the formula a = t + v, where t is a tripotent and v is an order two unit that commute. Such rings fundamental properties are given, and its connection with other related rings is obtained. we consider a strongly Tri nil clean ring as a ring R with every element a in R can be expressed as a sum of a tripotent and a nilpotent that commute, and we explore the Jacobson radical over strongly Invo. T-clean ring.

In this paper, we investigated a new improved Conjugate Gradient (CG) algorithm of a Three-Term type (TTCG) based on Dai and Liao procedure to improve the CG algorithm of (Hamoda, Rivaie, and Mamat / HRM). The new CG-algorithm satisfies both the conjugacy condition and the sufficient descent condition. The step-size of this TTCG-algorithm would be computed by accelerating the Wolfe-Powell line search technique. The proposed new TTCG algorithms have demonstrated their global affinity in certain specific circumstances given in this paper.

In previous years, database applications were built in the form of a file system, but many disadvantages were found after that, such as: data replication , inconsistency while storing, difficulty in accessing data and need to write a new program to execute each new task in addition to isolating the data within multiple file formats ..... etc. All the above problems were solved by using database systems. This paper is an applied to demonstrate the effective role of the tax information system to establish and operate knowledge database as a knowledge management requirement by: the conceptualization of the income tax, knowledge management system and the development of the retirement information system. In this paper, the ACCESS database was created and linked with the Visual Basic language to calculate income tax of the employees. Where the information of employee is entered (such as the employee's name, number and social status as well as the nominal salary). The system has saved and modified information of employees , printing a report on one employee or more, as well as knowing the amount of tax that got from employees .

Information and communication technologies are witnessing tremendous developments in today's world. Which allowed many institutions and departments to adopt ICT in their administrative work. This research discusses the designing of an Electronic Archiving System Based on the Computer Network by using (Visual C #.NET) language and the development of a central database by using (SQL Server 2008). The Ninewa Health bureau has been chosen as a model for completion of the study. To address the problem of the traditional reality experienced by the institutions and departments of the state in Iraq, based on the limited use of information technology, while electronic archiving systems that have become the basic method in the institutions of developed countries. This system works on converting paper documents and attachments into an electronic format, and saving them in the database within indexed records according to the document number or book. The system also provides an integrated tool for the managing mail, and workflow, as well as the preparation of reports, and great flexibility in the management of system database (backup, update of administrative units as per the applicable structure of the bureau concerned), managing user accounts and granting them access permission. The study has showed that the electronic archiving system has a positive impact in the fields of administrative works, through facilitating the process of archiving and saving of documents and official correspondence book to provide office spaces consumed in the storage of paper files. As well as reduce the time and effort spent in the search for files. and the ease of exchanging documents through a local network by the adoption of the (client / server) model to connect the sections of the bureau with each other for integrated with the electronic archiving system. The study aims to strengthen the role of archiving to launch the e-government project by improving and simplifying official transactions procedures. Last but not least the research dealt with a theoretical framework on the archiving (concept, components, types), as well as the practical aspect of the analysis and design of the system and explain how it works. Finally, this research succeed in designing the system, and the system has been tested on real data represented by models of books and official documents in the bureau of Health Nineveh..

In this paper, we used the modified Adomian decomposition(MADM) method to solve integral equations of the Volterra and Fredholm type as well, and then the Adomian method was combined with the bee algorithm(ABC) and obtained values for the parameter that improved the results obtained by solving some examples and were more accurate than the default method, These results are illustrated by calculating the maximum absolute errors (MAE) and mean squared errors (MSE).

In this paper, specific forms of non-linear systems of integral equations have been solved using the Sumudu transform and the Adomian decomposition method. To illustrate the method, three examples of various forms in this class of functional equations have been developed. The method has produced an approximate-exact solution for several systems. The method's accuracy, efficiency, and simplicity are demonstrated by the results of applying it to various systems of these kinds of integral equations.

This paper introduces three members of a one-step optimized third derivative hybrid block method family for solving general second-order initial value problems. The methodology incorporates optimization into the derivation process to achieve enhanced accuracy. Through rigorous analysis, it is demonstrated that all the derived methods are found to be zero-stable, consistent, A-stable, and convergent. The implementation of these newly derived methods is validated through numerical experimentation, where the results exhibit superior accuracy compared to certain existing numerical methods explored in the study. All the newly derived optimized third derivative hybrid block methods possessed very small error constants with high order accuracy.

Mathieu proved that any prime algebra which is also C* - algebra is an ultraprime. Brešar shows that C* - algebra is an ultrasemiprime. This paper is give condtions to ultrasempirime algebras to get ultraprime. Mathieu defined ultraprime algebras by using four equivalent conditions. In his definition of ultraprime algebra, he used the ultrapower of algebra. In contrast, in other identical conditions, he once used sequences; in another occasion, he used a particular linear operator. Our proof adds a new condition by using the prime algebra to the ultrasemiprime algebra to get an equivalent condition to ultraprime algebras.

In this paper, the time-dependent Emden-Fowler type partial differential equations and wave-type equations with singular behavior at are analytically solved using the combined Laplace transform and Adomain decomposition method (LT-ADM). To avoid the singularity behavior for both models at , the benefit of this single global technique is used to present a solid framework. The method is shown to produce approximate-exact solutions to various kinds of problems in One-dimensional space. The results gained in each case demonstrate the dependability and effectiveness of this approach. To show the high accuracy of the approximate solution results (LT-ADM), compare the absolute errors obtained by the Padé approximation (PA) of order compared with the exact solution.

The process of improvement software quality began from early stages of software engineering development. It uses multiple quality metrics which are very important in software development. To calculate the standards quality of in software testing has been adopted. The software testing is focusing on the Software defect. In this paper is proposed new methods which combine the particle swarm optimization (PSO) to handle the best features Extraction with back-propagation networks to testing and evaluation of the data set . The paper depended database for NASA standards data. The result and experiment method improved quality performance for all classification methods used in the research"Combining Particle Swarm Optimization based Feature Selection and Bagging for Software Defect Prediction ".

In this paper, the analytical solution to the problem of heat transfer and fluid flow was obtained by using the quadruple Laplace transform method. Temperature distribution and fluid flow distribution were shown, temperature and fluid flow increase when the value of z increases, as well as the effect of the radiation parameter shown, it was concluded that the temperature increase with the increase in the value of the radiation coefficient . Matlab was used to plot the results.

Block cipher algorithms are a very important issue in the field of information security. Their simple structure and software-based encryption allow users to implement them in several applications such as: data security and cloud computing. In this paper, we reviewed 8 block ciphers that had been presented in the recently five years and were used in different applications. The 8 block ciphers are: DES, 3DES, Blowfish, Twofish, PRISENT, KLEIN, IDEA and AES. All of them are symmetric block ciphers with different designs. The comparative results showed that the block ciphers can still be used in different applications and fields. They showed that many modifications had been presented in which, chaotic maps had been implemented in key generation to enhance the robustness of the block ciphers and its randomness. The comparative results also showed that the AES is one of the block ciphers that is still unbroken algorithm and still modified to suit other new applications. Since less robust ciphers have continuous modification and enhancement in order to be more robust against some of probable attacks, the length of the key and its complexity and the structure of the ciphers are essential directions for improving block ciphers.

Restricted detour distance between two vertices and of a graph is the length of a longest u- v path for the induced condition (V (P))=P. The restricted detour polynomial depends on restricted detour distance and is denoted by D*(G,x) and defined by D*(G,x) = ∑{u,v}xD*(u,v) where the summation is taken over all unordered pairs (u,v) of distinct vertices of u and v of V(G). In this paper, we investigate the restricted detour polynomial of the straight chain of wheel graphs φ(WkB) and compute the restricted detour index of φ(WkB).

In this paper, we derive a new parameter µk-1 for the three-term CG (N3T) algorithm for solving unconstrained optimization problems. As demonstrated by its calculations and proof, the parameter µk-1 worth is determined by T , and the study mentions four different types of T . The search directions of this algorithm are always sufficiently descent when using strong Wolfe line search (SWC). Under reasonable assumptions, the proposed algorithm achieves global convergence. The numerical comparison demonstrates that our proposed method works well for solving unconstrained optimization problems.

Many speaker language detection systems depend on deep learning (DL) approaches, and utilize long recorded audio periods to achieve satisfactory accuracy. This study aims to extract features from short recording audio files that are convenient in order to detect the spoken languages under test successfully. This detection process is based on audio files of (1 or 2) seconds whereas most of the previous languages Classification systems were based on much longer time frames (from 3 to 10 seconds). This research defined and implemented many low-level features using Mel Frequency Cepstral Coefficients (MFCCs), the dataset compiled by the researcher containing speech files in three languages (Arabic, English. Kurdish), which is called M2L_dataset is the source of data used in this paper.A Bidirectional Long Short-Term Memory (BiLSTM) algorithm applied in this paper for detection speaker language and the result was perfect, binary language detection had a test accuracy of 100%, and three languages detection had a test accuracy of 99.19%.

In this paper, we study a reducible method which is called linearization(Linear-transform) for some non-linear stochastic differential equations (SDEs) to linear by using the Ito-integrated formula. And then finding their analytic solution, we compare the obtained solution for the nonlinear SDEs with the approximate solution by using numerical (Euler -Maruyama and Milstein) Methods.

In this paper, we study the extended graph theory in the sum group via Zpnq which is Zpnq by two distinct orders, the sum is greatest than the order of the group Zpnq where p,q are prime numbers. We have some results that the group sum graph of Zpnq are connected, cyclic, etc., if they satisfy some properties of the graph theory and compute all the degrees of graphs. Furthermore, we shall calculate the famous topological indices via generalized it.

This paper deals with the fuzzy initial value problem and how to solve a linear fuzzy differential equation of first order when the initial condition is a triangle fuzzy number. This problem is then developed to the case when the initial condition is a trapezoidal fuzzy number. The paper includes also the issue of the representation of a system of linear fuzzy differential equations, a more general system of linear fuzzy differential equations is then proposed and the solution of this system is also given. An illustrative examples are given in order to consolidate the raised ideals.

Copyright of Hebron University Research Journal (Humanities) is the property of Hebron University and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Melanoma is considered a serious health disease and one of the most dangerous and deadly types of skin cancer, due to its unlimited spread. Therefore, detection of this disease must be early and sound due to the high mortality rate. It is driven by researchers' desire to use computers to obtain accurate diagnostic systems to help diagnose and detect this disease early. Given the growing interest in cancer prediction, we have presented this paper, a systematic review of recent developments, using artificial intelligence focusing on melanoma skin lesion detection, particularly systems designed on neural networks. Using the neural networks for melanoma detection could be part of system of assistance for dermatologists who must make the final decision on whether to recommend a biopsy if at least one of the dermatologist's diagnoses and the support system (a helpful method) indicate melanoma or to investigate if another type of cancerous lesion exists. In the latter situation, the system can be trained to recognize distinct types of cancerous skin lesions. On the other hand, the system is incapable of making final decisions. Given neural networks' evolutionary patterns, updated, changed, and integrated networks are expected to increase the performance of such systems. Based on the decision fusion, theoretical and applied contributions were studied using traditional classification algorithms and multiple neural networks. The period 2018-2021 has been focused on new trends. Also for the detection of melanomas, the most popular datasets and how they're being used to train neural network models were presented. Furthermore, the field of research emphasized in order to promote better the subject during different directions. Finally, a research agenda was highlighted to advance the field towards the new trends.

Predicting heart attacks using machine learning is an important topic. Medical data sets contain different features, some of which are related to the target group for prediction and some are not. In addition, the data sets are excessively unbalanced, which leads to the bias of machine learning models when modeling heart attacks. To model the unbalanced heart attack data set, this paper proposes the hybridization of Particle swarm optimization (PSO), BAT, and Cuckoo Search (CS) to select the features and adopt the precision for minority classes as a fitness function for each swarm to select the influential features. In order to model the data, set in which the features were selected, it was proposed to use the boosting (Catboost) as a classifier for predicting heart attacks. The proposed method to select features has been compared with each of the three swarms, and the Catboost algorithm has been compared to traditional classification algorithms (naive Bayes, decision trees). The study found that the proposed method of hybridization of the results of the (PSO, BAT, and BCS) algorithms in selecting features is a promising solution in the field of selecting features and increases the accuracy of the system, and that traditional machine learning models are biased in the case of unbalanced data sets and that selecting the important features according to the target class has an impact on the performance of the models, In addition, the definition of hyperparameters reduces the bias of the selected model. The final model achieved an overall accuracy of 96% on the Accuracy scale and 56% on the Precision scale for the minority class

Retinal image analysis is crucial for The classification of retinal diseases such as “Age Related Macular Degeneration (AMD)”, “Diabetic Retinopathy (DR)”, “Retinoblastoma”, “Macular Bunker”, “Retinitis Pigmentosa”, and “Retinal Detachment”. The early detection of such diseases is important insofar as it contributes in mitigating future implications. Many approaches have been developed in the literature for auto-detecting of retinal landmarks and pathologies. The current revolution in deep learning techniques has opened the horizon for researchers in the field of ophthalmology. This paper is a comprehensive review of the deep learning techniques applied for the classification of retinal images, pathology, retinal landmarks, and disease classification. This review is based on indicators such as sensitivity, Area under ROC curve, specificity, F score, and accuracy.

With the development of the Internet of Things (IoT) technology, IoT devices are integrated into many of our daily lives, including industrial, security, medical, and personal applications. Many violations of IoT safety have appeared due to the critical physical infrastructure, and network vulnerabilities. Considering the nature of the restricted and limited resources of these devices in terms of size, capacity, and energy, Security is becoming increasingly important. Lightweight cryptography is one of the directions that offer security solutions in resource-constrained environments such as Radio-frequency identification (RFID) and wireless sensor network (WSN).This paper discusses the security issues of these resource-constrained IoT devices and reviews the most prominent Lightweight Bock Cipher suitable for software implementation. Through studying thespecifications and the inner structure for each cipher and their implementation of the performance evaluation on some kind of platform, we provide a design strategies guideline for cryptographic developers to design improved Lightweight Block cipher solutions and compact software implementation for resource-constrained environments.

In this paper three-dimensional heat conduction equation in cartesian coordinate has been solved in two different methods one of which depends on the separation of variables and the other depends on the integral transform .The results are got and plotted by using Matlab. And the results obtained showed the difference between the two methods that were used in the solution . That difference is evident in the illustrations . According to the results it was concluded that the integral transform method is the best because it has fewer steps to reached to the solution

In this paper an architecture has been proposed for the 2-D Discrete Wavelet Transform (DWT) and the Inverse Discrete Wavelet Transform (IDWT) based on the Convolution method of the Daubechies 5/3-tap Biorthogonal filter bank in the Algorithm transformto image processing, and implementation it on the FPGA (Field Programmable Gate Array) using VHDL, for benefiting from implementation advantages of these Hardware and save run-time. The processing results proved speed and Efficiency of the proposed architecture, where the employed number of slices is less. So it result to Frequency higher and less run-time.The type of the FPGA based in this paper is Xilinx XC3S500E Spartan-3E using Xilinx ISE 9.2i.

In this paper many algorithmswereapplied to" zoom –out" the images, like the traditional algorithm (Linear Averaging) algorithm, then this algorithm was developed to a proposed algorithm (Block Averaging) to be the new one in this paper. another algorithm is obtained from another application which is involved as an enhancement smoothing algorithms and will be used as a (zooming-out) scheme, this algorithm is the (Median) algorithm. The obtained results of these algorithms were compared together to sign the better one. The MATLAB language is used to apply the algorithms. .

This paper proposes a new intelligent off-line Arabic handwritten signature identification and verification system based on texture analysis. The system uses the texture as feature and back propagation neural network as classifier. The signature image is preprocessed by several operations (Noise removal, Conversion of the signature image to binary image, Finding outer rectangle, Thinning and Size normalization) then the fractal number and co-occurrence matrix are computed to estimate texture features. In this work, two off-line Arabic handwritten signature identification systems are constructed. The first one uses the nearest Euclidean distance, while the other uses back propagation neural network. The paper analyzes and compares the results obtained from the two proposed systems to show the robustness level of the proposed intelligence system. Furthermore, the proposed system was tested by using Genuine signatures and has achieved a CCR (Correct Classification Rate) of 100% in best cases, while it was tested by using Forged signatures it has achieved a CRR approximated to 96.3% in best cases. The experimental results showed that the proposed system is efficient and competent with other state-of-the-art texture-based off-line signature identification systems.

It is not easy to find the n-Hosoya polynomial of the compound graphs constructed in the form G1⊠G2 for any two disjoint connected graphs and .Therefore, in this paper, we obtain n-Hosoya polynomial of G1⊠G2 when is a complete graph and is a special graph such as a complete graph, a bipartite complete, a wheel, or a cycle. The n-Wiener index of each such composite graph is also obtained in this paper.

This paper present a new practical authentication system which is depend on one of the biometrics features Hand Geometry features. the proposed system Captures human hand image to extract 50 features then use these features in creating for database system authenticate users stage and recognition stage. The paper present a complete and clear study of the basic fundamentals open set principle and shown the effect of population size on the recognition rate. Good results was obtain that is more than 91% in this application. MATLAB7.9.0 (2009b) programming language has been used to execute the paper algorithms, because its facilities in processing digital images.

Estimation models in software engineering are used to predict some important and future features for software project such as effort estimation for developing software projects. Failures of software are mainly due to the faulty project management practices. software project effort estimation is an important step in the process of software management of large projects. Continuous changing in software project makes effort estimation more challenging. The main objective of this paper is find a model to get a more accurate estimation. In this paper we used the Intermediate COCOMO model which is categorized as the best of traditional Techniques in Algorithmic effort estimation methods. also we used an Artificial approaches which is presented in (FFNN,CNN,ENN,RBFN) because of the Ability of ANN(Artificial Neural Network) to model a complex set of relationship between the dependent variable (effort) and the independent variables (cost drivers)which makes it as a potential tool for estimation. This paper presents a performance analysis of ANNs used in effort estimation. We create and simulate this networks by MATLAB11 NNTool depending on NASA aerospace dataset which contains a features of 60 software project and its actual effort. the result of estimation in this paper shows that the neural networks in general enhance the performance of traditional COCOMO and we proved that the ENN was the best network between neural networks and the CNN was the next best network and the COCOMO have the worst between the used methods.

Recently the Wavelet Transform has gained a lot of popularity in the field of signal and image processing, this is due to its capability of providing both time and frequency information simultaneously.In this paper, focus on used Discrete Wavelet Transform 2-dimenssion )2D- DWT) based on conventional approach, convolution, to image processing and implementation by using FPGA(Field Programmable Gate Array) ,due to many researches were implemented on this Hardware in recent years ,using VHDL. In this paper, has been proposed two VHDL architectures to implementation the conventional of the Daubechies 5/3-tap biorthogonal filter bank, a simple – straightforward one and an optimized one, substituting the multipliers used for scaling with shift – add operations. The architecture of optimized approaches were designed and implemented on FPGA, type of Xilinx XC3S500E Spartan-3E.