Report on Secure Hardware Assurance Reference Dataset (SHARD) program

Fault in a software program can be detected by mutation testing. However, mutation testing is an expensive process in a software testing domain. In this paper, we have introduced a method based on genetic algorithm and mutation analysis for unit testing process. Software industry produces high quality software in which software testing has an important role. First, we make a program/software and intent some mutant in this program/software, find most critical path and optimise test cases using genetic algorithm for the unit testing. Initially generated test cases are refined using genetic algorithm. We use a mutant function for measuring the adequacy of the test case set. The given mutant function is used to calculate a mutant score. We have achieved 100% path coverage and boundary coverage using mutation testing. The objective is to produce a set of good test cases for killing one or more undesired mutants and produces different mutant from original software/program. Unlike simple algorithms, genetic algorithms provide suitability for reducing the data generation at a comparable cost. An optimised test case has been generated by proposed approach for cost reduction and revealing or killing undesired test cases.

Fault in a software program can be detected by mutation testing. However, mutation testing is an expensive process in a software testing domain. In this paper, we have introduced a method based on genetic algorithm and mutation analysis for unit testing process. Software industry produces high quality software in which software testing has an important role. First, we make a program/software and intent some mutant in this program/software, find most critical path and optimise test cases using genetic algorithm for the unit testing. Initially generated test cases are refined using genetic algorithm. We use a mutant function for measuring the adequacy of the test case set. The given mutant function is used to calculate a mutant score. We have achieved 100% path coverage and boundary coverage using mutation testing. The objective is to produce a set of good test cases for killing one or more undesired mutants and produces different mutant from original software/program. Unlike simple algorithms, genetic algorithms provide suitability for reducing the data generation at a comparable cost. An optimised test case has been generated by proposed approach for cost reduction and revealing or killing undesired test cases.

An interactive computer program for measurement of data obtained using the extra-stimulus technique during electrode-catheter studies

An incremental compiler, in response to a program change, recompiles only the part of the program affected by the change, resulting in more efficient use of system resources and in improved response time. Current incremental programming environments based on compilation do not combine a small incremental unit for recompilation with sophisticated local and global register allocation schemes. This dissertation studies the problems of incrementally allocating local and global registers and generating target code in response to program edits. The unit of change is an intermediate code statement, and the target code that is produced incrementally utilizes registers as efficiently as a non-incremental target code generator that uses the same register allocation heuristics. The first step in the design of an incremental target code generator is an analysis of the effects of program edits on existing local and global register allocation. From the analysis, a model of register histories is constructed that maintains the ideal and the actual register allocation for the program. The model is designed to be independent of the local and global register allocation heuristics that are used. However, it is particularly useful for the incremental allocation of both local and global registers using graph coloring. Using the analysis and the model, incremental techniques for allocating registers and generating target code are developed. To provide insight into the performance of the incremental target code generator, both incremental and non-incremental systems are implemented. Their performances are compared both in terms of the quality of the target code that is produced and in the time it takes to make changes incrementally rather than by completely regenerating the target code. The results of the experiments indicate that the same high-quality target code that is produced non-incrementally can be produced incrementally. Under certain conditions, the savings for incremental incorporation of changes are considerable. The savings in time depend on the amount of code that is changed and on the amount of disruption to the register allocation. For test cases that involve changes to global register allocation, the savings in time range from 34 to 96% when up to 16% of the program is changed.

Spectrum-based Fault Localization (SBFL) is an emerging debugging technique that assists software developers to locate faulty code in software. By utilizing code execution information (spectra), SBFL metrics rank lines of codes in software according to their likeliness to be faulty. However, recent studies showed that contradicting, duplicated or noisy spectra may deteriorate the ranking accuracy of SBFL metrics. In this paper, we propose and develop a novel SBFL tool with test case preprocessor to filter out test cases with contradicting, duplicated or other noisy spectra. Case studies conducted on real life faulty programs show that the proposed SBFL tool with test case preprocessor has successfully improved the performance of SBFL metrics in majority of the cases studied.

Frontiers Events is a rapidly growing calendar management system dedicated to the scheduling of academic events. This includes announcements and invitations, participant listings and search functionality, abstract handling and publication, related events and post-event exchanges. Whether an organizer or participant, make your event a Frontiers Event!

Several computer programs are available to analyze culvert hydraulics, including HY-8, FishXing, Broken-back Culvert Analysis Program (BCAP), Hydraflow Express, CulvertMaster, Culvert, and Hydrologic Engineering Center River Analysis System (HEC-RAS). The use of slightly different methodologies to complete the analysis results in different estimates for headwater depth, flow control, and outlet velocity. This paper compares the available hydraulic features and tests the accuracy of these seven programs as part of an effort to update the HY-8 program. Four test cases were developed. The flow controls, headwater depths, and outlet velocities were compared with values obtained through calculations based on best practice as outlined in the FHWA publication, Hydraulic Design Series No. 5. Several limitations were identified. BCAP has limited ability to analyze straight barrel culverts operating under outlet control with high tailwater, CulvertMaster reports outlet control for some low discharges as a surrogate for what is referred to as “entrance control,” Culvert misidentifies the location of hydraulic control for lower discharges and overestimates headwater elevations, and HydraFlow Express incorrectly uses critical depth at the outlet for inlet control calculations. With the test cases used here, HY-8, HEC-RAS, and FishXing most consistently agreed with accepted empirical results. It is recommended that program providers improve their products to replicate better the hydraulic conditions simulated in this paper and to extend program capabilities to include more environmentally sensitive design considerations such as fish passage.

A spectrum stripping technique for qualitative activation analysis using monoenergetic gamma spectra

Two computer programs have been developed to model maturation parameters. The first program (referred to as K-MOD) relates thermal conductivity to interval velocity and then computes either geothermal gradient or heat flow, depending on which is known. The program can be run using interval velocities obtained from either well or seismic data. The second program (referred to as M-MOD) is a maturation modelling program based on time—temperature, theoretical kinetic equations. M-MOD requires burial history, interval geothermal gradients and unconformity data as input. The program then computes present-day equivalent vitrinite reflectance (R e ) values for up to 21 horizons along with palaeo-temperature, palaeo-depth and palaeo-R e values for designated time-stratigraphic horizons.

Computer programmes have been developed which calculate the reaction rate and second limit of H2+O2+N2 mixtures for a given set of velocity constant ratios. By coupling these to an optimization programme, a limited number of ratios can be adjusted to give minmum deviation between observed and calculated rates or limits. A more elaborate programme for reaction rate allows for consumption of reactants and permits the maximum reaction rate to be calculated. The use of these programmes both to establish a detailed mechanism and to obtain some velocity constant ratios over the temperature range 470–530°C is described. The best available values for the Arrhenius parameters of the reactions involved are summarized.

This paper presents a new coherency identification method for dynamic reduction of power system so that the changes in dynamic response of reduced equivalent system would be minimized. It is based on PAM algorithm and used to identify optimal coherent group of each generators using coherency. The coherency between generators is evaluated from nonlinear simulation time response and it is proposed as dissimilarity index in this paper. Using that index, optimal coherent generator group is determined to minimize sum of these indices for each group. To validate the effectiveness of the proposed generator clustering algorithm, test case is evaluated through IEEE 39-bus test system using PSS/E computer program. The clustering algorithm is compared with other coherency identification method and it show that proposed algorithm is a better estimate of original system.

Computer programming is a subject involving a large number of logic programming activities. A programmer is compulsory to master skills of algorithms, logic, and programming language to conduct programming. An automatic programming assessment tool is an automated tool used to assist instructors in assessing programming tasks. The technology used in this application is open-source based with an evaluation module that will evaluate the sent program code, assessment, and classification. The evaluation results were then processed in the assessment module, where a comparison process with the test case was performed along with the point calculation. The classification module was used to divide students into five groups based on the point of each practicum. This study used k-means clustering classification method. The entities included were lecturers, assistants, students, and compilers. This application had 2 levels of users namely admin and students. Scoring results were then used in the process of determining the classification of student’s performance based on the k-means clustering method. In connection with the classification test results with three iterations, three practicum scores resulted that the classification process was successfully carried out with student’s performance divided into five groups covering very good, good, sufficient, less, and very less. The data used in the clustering process consisted of 41 students with 10 attributes which were then grouped into 3 groups (clusters).

The possibilities of the algorithm for applying the boundary element method to solving boundary value problems are discussed on the example of the two-dimensional Poisson differential equation. The algorithm does not change significantly when the type of boundary conditions changes: the Dirichlet problem, the Neumann problem, or a mixed boundary value problem. The idea of the algorithm is taken from the work of John T. Katsikadelis [1]. The algorithm is described in detail in the next sequence of actions. 1) The boundary- value problem for a two-dimensional finite domain is formulated. The desired function in the domain, its values, and its normal derivative on the boundary contour are connected by means of the second Green formula. 2) We pass from the boundary value problem for the Poisson equation to the boundary value problem for the Laplace equation. This simplifies the process of constructing an integral equation. We obtain the integral equation on the boundary contour using the boundary conditions. 3) In the integral equation, we divide the boundary contour into a finite number of boundary elements. The desired function and its normal derivative are considered constant values on each boundary element. We compose a system of linear algebraic equations considering these values. 4) We modify the system of linear algebraic equations taking into account the boundary conditions. After that, we solve it using the Gauss method. The computer program has been developed according to the developed algorithm. We used it in the learning process. The software implementation of the algorithm takes into account the capabilities of modern computer technology and modern needs of the educational process. The work of the program is shown in the test case. Further modification of the described algorithm is possible

Introduction N methods for predicting generalized unsteady aerodynamic forces usually do not provide identical results. Experimental methods are rarely available to verify the accuracy of predicted generalized forces for complex configuration, and the flutter analyst must rely on calculated results. Convergence criteria generally are not available to enable the user to obtain the best results from a particular numerical method. This important issue was addressed recently by Rowe and Cunningham, and in a Comment by Stark followd by a Reply by Lottati. The usual way to tackle the accuracy of the method is by applying the code on several test cases and comparing these results against results obtained by other methods of computation (see Ref. 1). Another way is to use the existing relations for the aerodynamic forces developed on the configuration in direct and reverse flow. By comparison of the obtained results computed by direct and reverse flow, it is possible to assess the accuracy of the method. The general reverse-flow theorems for lifting-surface theory may also be applied to wings that undergo harmonic oscillation. The results of Ref. 1 emphasize the wavy character of the oscillatory pressure developed on an oscillating wing. The pressure distribution displayed in Ref. 1 aimed to alert users to the possible potential difficulties in obtaining an accurate solution due to the wavy character of the aerodynamic pressure on an oscillating wing. The pressure distribution becomes extremely wavy and more difficult to predict accurately as the reduced frequency k and the Mach number M get larger values. Reference 1 defined a wave number to assess the wayiness of the pressure distribution which might be useful in the estimation of relative difficulties in predicting converged aerodynamic forces. In this Note, the reverse-flow theorem will be applied to assess the accuracy of the computed unsteady aerodynamic forces for interference configuration. The computer program used to evaluate the unsteady aerodynamic forces on the configuration is the nonplanar piecewise continuous kernel function method (PCKFM).

Software testing allows programmers to determine and guarantee the quality of software system. It is one of the essential activities in software development process. Mutation analysis is a branch of software testing. It is classified as a fault-based software testing technology. Unlike other software testing technologies, mutation analysis assesses the quality of software test cases and therefore improves the efficiency of software testing by measuring and improving the quality of test cases set. Mutation analysis works by generating mutants, which describe the faults that may occur in the software programs, from original program. Mutants are generated by applying mutation operators on original software program. Mutation operator is a rule that specifies the syntactic variations of strings. There have been several works about mutation analysis support system for conventional languages such as C and FORTRAN. However, there are a few for object-oriented languages such as C++ and Java. This article aims to propose a novel approach to design and implement mutation operators for object-oriented programming language. The essential idea of proposed method is the usage of JavaML language as the intermediate representation to implement mutation operators: it first converts the original program into JavaML document; then implements mutation operator for JavaML document and gets the mutated JavaML document with the help of DOM — a tool to process JavaML document; finally it converts the mutated JavaML document into mutant program.