Sequence covering array (SCA) generation is an active research area in recent years. Unlike the sequence-less covering arrays (CA), the order of sequence varies in the test case generation process. This paper reviews the state-of-the-art of the SCA strategies, earlier works reported that finding a minimal size of a test suite is considered as an NP-Hard problem. In addition, most of the existing strategies for SCA generation have a high order of complexity due to the generation of all combinatorial interactions by adopting one-test-at-a-time fashion. Reducing the complexity by adopting one-parameter- at-a-time for SCA generation is a challenging process. In addition, this reduction facilitates the supporting for a higher strength of coverage. Motivated by such challenge, this paper proposes a novel SCA strategy called Dynamic Event Order (DEO), in which the test case generation is done using one-parameter-at-a-time fashion. The details of the DEO are presented with a step-by-step example to demonstrate the behavior and show the correctness of the proposed strategy. In addition, this paper makes a comparison with existing computational strategies. The practical results demonstrate that the proposed DEO strategy outperforms the existing strategies in term of minimal test size in most cases. Moreover, the significance of the DEO increases as the number of sequences increases and/ or the strength of coverage increases. Furthermore, the proposed DEO strategy succeeds to generate SCAs up to t=7. Finally, the DEO strategy succeeds to find new upper bounds for SCA. In fact, the proposed strategy can act as a research vehicle for variants future implementation.
This paper presents the study and analysis, analytically and numerical of circular cylindrical shell pipe model, under variable loads, transmit fluid at the high velocity state (fresh water). The analytical analysis depended on the energy observation principle (Hamilton Principle), where divided all energy in the model to three parts , strain energy, kinetic energy and transmitted energy between flow and solid (kinetic to potential energy). Also derive all important equations for this state and approach to final equation of motion, free and force vibration also derived. the relations between the displacement of model function of velocity of flow, length of model, pipe thickness, density of flowed with location coordinate x-axis and angle
... Show MoreThe background subtraction is a leading technique adopted for detecting the moving objects in video surveillance systems. Various background subtraction models have been applied to tackle different challenges in many surveillance environments. In this paper, we propose a model of pixel-based color-histogram and Fuzzy C-means (FCM) to obtain the background model using cosine similarity (CS) to measure the closeness between the current pixel and the background model and eventually determine the background and foreground pixel according to a tuned threshold. The performance of this model is benchmarked on CDnet2014 dynamic scenes dataset using statistical metrics. The results show a better performance against the state-of the art
... Show MoreAt present, the ability to promote national economy by adjusting to political, economic, and technological variables is one of the largest challenges faced by organization productivity. This challenge prompts changes in structure and line productivity, given that cash has not been invested. Thus, the management searches for investment opportunities that have achieved the optimum value of the annual increases in total output value of the production line workers in the laboratory. Therefore, the application of dynamic programming model is adopted in this study by addressing the division of investment expenditures to cope with market-dumping policy and to strive non-stop production at work.
The purpose of this paper is to recognize the impact of database levels on fields of banking service (provision of remittance services and transfer of funds, save financial deposits, provision of personal loans services) in some of Iraqi banks using one-way multivariate analysis of variance. The paper population consisted of (120) employees, then a random stratified sample of (104) employees was taken. A questionnaire paper consists of (24) items were designed in order to analyze by one-Way multivariate analysis of variance (MANOVA) using SPSS.One of the main findings of the current paper is that there is an impact of database on fields of banking service in Iraqi banks (Al Rafidain and Al Rasheed).
Item Difficulty and Item Discrimination Coefficient for School and College Ability Tests (SCAT) Advanced Form in Classical Test Theory (CTT) and Item Response Theory (IRT) and the Correlation among Them Mohammad moqasqas Haifa T. Albokai Assistant Professor of Measurement and Evaluation Associate Professor of Measurement and Evaluation College of Education, Taibah University The aim of this study was to study the item difficulty and item discrimination of the SCAT (advance form) with CTT, and IRT, and to study the correlation among them. To do this, the researchers used the data of their previous study, which conducted in (2011). It consisted of (3943) subject. Then, they used two-statistical programs (TAP, Bilog-MG-3) to obtain the item
... Show MoreThe current world is observing huge developments in presenting the opportunity for organizations and administrative units to use information and communication technology and their adoption by administrative work due to its importance in the achievement of work with higher efficiency, speed, and facility of communication with all individuals and companies using various means of communication Depending on the Internet networks. Therefore, the research dealt with the study of electronic systems designed and adopted in the creation or construction of a database for archiving data, which is the main method in organizations and administrative units in developed countries. Where this system works to convert documents, and manual processes and t
... Show MoreA skip list data structure is really just a simulation of a binary search tree. Skip lists algorithm are simpler, faster and use less space. this data structure conceptually uses parallel sorted linked lists. Searching in a skip list is more difficult than searching in a regular sorted linked list. Because a skip list is a two dimensional data structure, it is implemented using a two dimensional network of nodes with four pointers. the implementation of the search, insert and delete operation taking a time of upto . The skip list could be modified to implement the order statistic operations of RANKand SEARCH BY RANK while maintaining the same expected time. Keywords:skip list , parallel linked list , randomized algorithm , rank.