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.
An approach to error-based testing is described that uses simple programmer error models and focus-directed methods for detecting the effects of errors. Errors are associated with forgetting, ignorance, bandwidth and perversity. The focus-directed approach was motivated by the observation that focus is more important than methodology in detecting such errors. The strengths and weaknesses of error-based...
Lagrangian relaxation based methods (LR) are among the most successful approaches for solving hydrothermal scheduling problems (HTS). Standard subgradient method (SSM) has long been the widely accepted choice for solving the dual problem when LR is used to solve HTS. However, solution oscillations and slow convergence are often observed in implementation of SSM. In this paper, a revised subgradient...
The prime obstacle to automated defect testing has always been the generation of "correct" results against which to judge the behavior of the system under test - the "oracle problem". So called "back-to-back" testing techniques that exploit the availability of multiple versions of a system to solve the oracle problem have mainly been restricted to very special, safety...
In this paper, the personal financial assessment system of Industrial and Commercial Bank of China branch in Suzhou was used for a example, during the designing and testing in parallel, according to test results, we propose a method to calculate the satisfaction of the software system, to judge the performance of the system and to analysis the extent of the various stages of testing changes, then...
Software systems, which are dynamically composed from plug-and-play components, allow users to adapt an application to the working scenario at hand. While the testing of individual components is well understood, there are no systematic techniques that test if components can be assembled in arbitrary orders. This paper introduces a method and a tool for testing the dynamic composability of component-based...
In large, traditional software development projects, the number of defects can be considerably high. Agile methods promise code quality improvement, but while embracing the agile methods, software development organizations have realized that defects still do exist and must be managed. When the development is distributed over several sites, defect management can become even more challenging. In this...
When action rules of agents are created by evolutionary computation, it generally aims to create optimal individual which represents optimal rules. On the other hand, genetic network programming (GNP) with rule accumulation extracts a large number of rules throughout the generations and store them in the rule pools. In other words, the individuals of GNP with rule accumulation are regarded as rule...
In the field of software developing, project is almost the most common organizational form. But with the enhancement of software products' complexity and the constant change of customers' demand, the importance of communication in software development projects is increasingly prominent.Based on literature review about communication management and software development life cycle, the paper identified...
Theoretical bases are considered and the structure of the software package for calculation of queuing systems with the substantial role of the factor of time is grounded. Versions of a package are described.
The number of security errors and vulnerabilities can be reduced if a secure software development process (SSDP) is followed. Such a SSDP must cater for security aspects during each phase of development. In this paper, we present a new process that provides ways of addressing security concerns and incorporating security decisions throughout the software development process. Our process has two views:...
Software-based self-test (SBST) is increasingly used for testing processor cores embedded in SoCs, mainly because it allows at-speed, low-cost testing, while requiring limited (if any) hardware modifications to the original design. However, the method requires effective techniques for generating suitable test programs and for monitoring the results. In the case of processor core testing, a particularly...
We propose a benchmark for object-oriented unit testing, called the behavioural response. This is a normative set of state- and equivalence partition-based test cases. Metrics are then defined to measure the adequacy and effectiveness of a test set (with respect to the benchmark) and the efficiency of the testing method (with respect to the time invested). The metrics are applied to expert manual...
We introduce an architecture for unit tests that traces the values of output variables of JavaScript programming. We present an object model that describes the relationships between tracing and other programming components. We also present six types of tracing statements, implementation and automation approach. We created examples of XHTML and JavaScript programming to illustrate the implementation...
An algorithm is presented which reduces the problem of finding the irreducible factors of a bivariate polynomial with integer coefficients in polynomial time in the total degree and the coefficient lengths to factoring a univariate integer polynomial. Together with A. Lenstra's, H. Lenstra's and L. Lovasz' polynomial-time factorization algorithm for univariate integer polynomials and the author's...
Linear-time for Linear Programming in R2 and R3 are presented. The methods used are applicable for some other problems. For example, a linear-time algorithm is given for the classical problem of finding the smallest circle enclosing n given points in the plane. This disproves a conjecture by Shamos and Hoey that this problem requires Ω(n log n) time. An immediate consequence of the main result is...
This report describes the techniques used to obtain two three-variable universal logic blocks from NAND circuits. The emphasis for one of these ULB's is on minimizing NAND blocks; for the other ULB, it is on minimizing input pins. The techniques used for the three variable ULB realization are extended to handle realization of a four-variable ULB. Possible compromises to be made in the ULB approach...
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.