DBN Rashid, 2012 - Cited by 2

The present study aims to identify the role of behavioral disorders (anxiety disorder, behavior disorder "behavior", confrontation and challenge disorder, aggressive behavior) in predicting bullying patterns (verbal, physical, electronic, school) in a sample of adolescents with autism spectrum disorder. For this purpose, the researcher developed scales to measure the behavioral disorders and the bullying patterns among adolescents with autism spectrum disorder. The researcher adopted the descriptive survey approach. The study sample consists of (80) adolescents with autism spectrum disorder with ages range from (15-19 years) and (45-53 years old) in association with israr association for people with special needs in the northern borders

This research after financial ratios in the detection of fraud to the financial statements published which enables specialists from the work of their studies and their conclusions to obtain the information they seek on the activities of the entity. Has provided researchers what these relics They then field study to test the validity and sincerity of the findings of the suggestions that have been upheld the need to study all financial ratios extracted in general, organized and used in decision-making processes necessary administrative.And that the financial management attention more financial analysis and extraction of financial ratios and compare them with industry standards taken from historical norms

While analytical solutions to Quadratic Assignment Problems (QAP) have indeed been since a long time, the expanding use of Evolutionary Algorithms (EAs) for similar issues gives a framework for dealing with QAP with an extraordinarily broad scope. The study's key contribution is that it normalizes all of the criteria into a single scale, regardless of their measurement systems or the requirements of minimum or maximum, relieving the researchers of the exhaustively quantifying the quality criteria. A tabu search algorithm for quadratic assignment problems (TSQAP) is proposed, which combines the limitations of tabu search with a discrete assignment problem. The effectiveness of the proposed technique has been compared to well-established a

Scheduling Timetables for courses in the big departments in the universities is a very hard problem and is often be solved by many previous works although results are partially optimal. This work implements the principle of an evolutionary algorithm by using genetic theories to solve the timetabling problem to get a random and full optimal timetable with the ability to generate a multi-solution timetable for each stage in the collage. The major idea is to generate course timetables automatically while discovering the area of constraints to get an optimal and flexible schedule with no redundancy through the change of a viable course timetable. The main contribution in this work is indicated by increasing the flexibility of generating opti

Moment invariants have wide applications in image recognition since they were proposed.

   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// (∑∑∑

Meerkat Clan Algorithm (MCA) that is a swarm intelligence algorithm resulting from watchful observation of the Meerkat (Suricata suricatta) in the Kalahari Desert in southern Africa. Meerkat has some behaviour. Sentry, foraging, and baby-sitter are the behaviour used to build this algorithm through dividing the solution sets into two sets, all the operations are performed on the foraging set. The sentry presents the best solution. The Flexible Job Shop Scheduling Problem (FJSSP) is vital in the two fields of generation administration and combinatorial advancement. In any case, it is very hard to accomplish an ideal answer for this problem with customary streamlining approaches attributable to the high computational unpredictability. Most