The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Product platforms are well-established in many industries in order to offer a wide variety of products while realizing economies of scale on the inside for development and production. Nevertheless a study performed by Laboratory for Machine Tools and Production Engineering (WZL) of RWTH Aachen University shows that most companies do not use release management to systematically introduce technical...
Utilizing state diagram based techniques, state-transition based testing is being widely applied to software testing for the detection of software defects. The state diagrams that includes high complex design and processing can enhance the productive and positive application of state diagrams in the area of software system development. However, many traditional methods for automatic software analysis...
The aim of this work is to design and develop an online screening tool for dyslexia based on kinesthetic perception without much of manual intervention. Existing methods available for testing Dyslexia are done manually. Also these tests require psychologists and specialists who are scarce. This research aims to exploit the use of multimedia tests for screening of fine motor movements for dyslexia...
While a substantial body of prior research has investigated the form and nature of production code, comparatively little attention has examined characteristics of test code, and, in particular, test smells in that code. In this paper, we explore the relationship between production code properties (at the class level) and a set of test smells, in five open source systems. Specifically, we examine whether...
In this paper, we propose a hierarchical SVM framework for multiclass classification problems. Use of multiple SVMs in a hierarchical structure has been a popular approach to handle multiclass classification by Support Vector Machines which are otherwise known to two-class classifiers. Among commonly-used hierarchical structures, binary tree structured SVM has computational advantages over other techniques...
We infer local influence relations between networked entities from data on outcomes and assess the value of temporal data by formulating relevant binary hypothesis testing problems and characterizing the speed of learning of the correct hypothesis via the Kullback-Leibler divergence, under three different types of available data: knowing the set of entities who take a particular action; knowing the...
A new method of high level test generation based on the concept of test groups to prove the correctness of a part of system functionality is proposed. High-level faults of any multiplicity are assumed to be present in the system, however, there will be no need to enumerate them. Unlike the known approaches, we do not target the faults as test objectives. The goal of using the test groups is to extend...
One of the basic problem in computer science is to arrange the items in lexicographic order. Sorting is one of the major research topic. There are number of sorting algorithms. This paper presents the implementation and detailed analysis of library sort. Library sort is also called gapped insertion sort. It is a sorting algorithm that uses insertion sort with gaps. Time taken by insertion sort is...
We suggest a technique to perform integration testing of Aspect-Oriented Programs (AOPs) using Module to Module path (MM-path). First, we construct a control flow graph (CFG) of the program annotating each edge with messages and identify the source nodes and sink nodes in each module. Then, we find out the feasible execution paths and design the test cases randomly. For each test case, the sequence...
Agile development consist of method such as eXtreme Programming and Scrum. Agile was formalized in 2001 by a group of software development practitioners. Agile is not a tool or a single methodology but it is a philosophy. Test driven development or test first approach is one of the approaches in Agile. Test first is a development process with the implementation of test cases before production code...
Currently multiple Domain Specific Languages (DSLs) are used for model-driven software development, in some specific domains. Software development methods, such as agile development, are test-centered, and their application in model-based frameworks requires model support for test development. We introduce a specific language to define generic test models, which can be automatically transformed into...
Regression testing is an activity during the maintenance phase to validate the changes made to the software and to ensure that these changes would not affect the previously verified code or functionality. Often, regression testing is performed with limited computing resources and time budget. So in this phase, it is infeasible to run the complete test suite Thus, test-case prioritization approaches...
Multi-class learning is an important task in Data Science. One of the ways to achieve good performance on this task is to use Error Correcting Output Codes (ECOC), which is a powerful ensemble learning method that transforms a multi-class problem into a series of binary classifiers which it uses indirectly to learn the original multi-class problem. A crucial component of ECOC is the design of the...
Many of the tools used today in semiconductor test engineering are single-point solutions that are concerned with the mechanics of translating test IP between domains and formats. There is no cohesive standardized framework to bind them all together; and workflow and application architecture choices are largely left up to the individual engineer. Learning from the state-of-the-art in other software...
We give a general unified method that can be used for L1 closeness testing of a wide range of university structured distribution families. More specifically, we design a sample optimal and computationally efficient algorithm for testing the equivalence of two unknown (potentially arbitrary) university distributions under the Ak-distance metric: Given sample access to distributions with density functions...
The lack of commitment to create quality work is a long-standing problem in education, and it is a direct negative driver of student performance, disturbing students' ability to: apply imparted concepts, build team quality work, and foster industry's economy. The quality of delivered work is poor mainly because students do not spend needed time and effort to review their own work; e.g., research papers,...
We study the problem of multi-class image classification with large number of classes, of which the one-vs-all based approach is prohibitive in practical applications. Recent state-of-the-art approaches rely on label tree to reduce classification complexity. However, building optimal tree structures and learning precise classifiers to optimize tree loss is challenging. In this paper, we introduce...
A local tester for a code probabilistically views a small set of coordinates of a given word and based on this local view accepts code words with probability one while rejecting words far from the code with constant probability. A local tester for a code is said to be "robust" if the local views of the tester are far from acceptable views when the word being tested is far from the code....
We show that every non-adaptive property testing algorithm making a constant number of queries, over a fixed alphabet, can be converted to a sample-based (as per [Gold Reich and Ron, 2015]) testing algorithm whose average number of queries is a fixed, smaller than 1, power of n. Since the query distribution of the sample-based algorithm is not dependent at all on the property, or the original algorithm,...
Kayal has recently introduced the method of shifted partial derivatives as a way to give the first exponential lower bound for computing an explicit polynomial as a sum of powers of constant-degree polynomials. This method has garnered further attention because of the work of Gupta, Kamath, Kayal and Saptharishi who used this method to obtain lower bounds that approach the "chasm at depth-4"...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.