Software testing is a vital part of the software development life cycle. In many cases, the system under test has more than one input making the testing efforts for every exhaustive combination impossible (i.e. the time of execution of the test case can be outrageously long). Combinatorial testing offers an alternative to exhaustive testing via considering the interaction of input values for every t-way combination between parameters. Combinatorial testing can be divided into three types which are uniform strength interaction, variable strength interaction and input-output based relation (IOR). IOR combinatorial testing only tests for the important combinations selected by the tester. Most of the researches in combinatorial testing applied the uniform and the variable interaction strength, however, there is still a lack of work addressing IOR. In this paper, a Jaya algorithm is proposed as an optimization algorithm engine to construct a test list based on IOR in the proposed combinatorial test list generator strategy into a tool called CTJ. The result of applying the Jaya algorithm in input-output based combinatorial testing is acceptable since it produces a nearly optimum number of test cases in a satisfactory time range.
Banks face many of the various risks: which are of dangerous phenomena that cause the state achieved a waste of money and a threat to future development plans to be applied to reach the goals set by: prompting banks and departments to find appropriate solutions and fast: and it was within these solutions rely on Banking risk management and effective role in defining and identifying: measuring and monitoring risk and trying to control and take risks is expected to occur in order to encircle and make it in within acceptable limits: and try to avoid them in the future to reduce the losses that are likely to be exposed to the bank: and it began to emerge and dominate a lot of legislation that seeks to structure the year risk management and t
... Show MoreThe present study was undertaken to use individual terrestrial crustacean from Isopoda such as the species Porcellionides pruinosus (Brandt 1833) as environmental cleaner and that through the test of their abilities in decomposition of residues of some cellulosean wastes such as wood pieces which contain high ratio of urban wastes, and residue of Zea mays and particularly leaves as plant waste in agricultural fields and residue of Cynodon dactylon plants which compose the main wastes in most of gardens and parks. Experiments were conducted relatively in stable laboratory conditions to ensure environmental conditions similar to crustaceans' life. The results showed presence of good efficiency of these individuals in treating such wastes as
... Show MoreThe study aimed to test the hypothesis of Caldor to estimate the relationship between industrial production and GDP growth in Iraq using with Integration Framework and to determine the causal relationship in the short and long term using the error correction vector model for the period 1990-2016. the results showed a long-term equilibrium relationship between GDP and industrial output, while Ganger causality tests showed a causal relationship in the long run of GDP to output Subliminal thus illustrated the extent of the recession suffered by the industrial sector, which is supposed to be the driving force of the economy and the development and expansion of the productive base of the industry, so this study recommends attent
... Show MoreThe research aims to find out the effect of Cognitive Acceleration strategy and random excitement strategy in achievement of geography material and developing the reflective thinking for students of literary fifth class .
the researcher depended a partial control experimental design with the three groups(the competence groups of the pre & post tests), The sample is deliberately selected from first AL-Rusafah Directorate General of Education in Baghdad. AL.fardoos Interme
... Show MoreThere is a great deal of systems dealing with image processing that are being used and developed on a daily basis. Those systems need the deployment of some basic operations such as detecting the Regions of Interest and matching those regions, in addition to the description of their properties. Those operations play a significant role in decision making which is necessary for the next operations depending on the assigned task. In order to accomplish those tasks, various algorithms have been introduced throughout years. One of the most popular algorithms is the Scale Invariant Feature Transform (SIFT). The efficiency of this algorithm is its performance in the process of detection and property description, and that is due to the fact that
... Show MoreThis paper proposes a new method Object Detection in Skin Cancer Image, the minimum
spanning tree Detection descriptor (MST). This ObjectDetection descriptor builds on the
structure of the minimum spanning tree constructed on the targettraining set of Skin Cancer
Images only. The Skin Cancer Image Detection of test objects relies on their distances to the
closest edge of thattree. Our experimentsshow that the Minimum Spanning Tree (MST) performs
especially well in case of Fogginessimage problems and in highNoisespaces for Skin Cancer
Image.
The proposed method of Object Detection Skin Cancer Image wasimplemented and tested on
different Skin Cancer Images. We obtained very good results . The experiment showed that
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
... Show MoreScheduling 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
... Show More