Miracle-dz/UniFAR-FTUs huggingface dataset:
Adaptation of Software Testability Concept for Test Suite Generation - A Systematic Review

Context: Software testability, which is the degree to which a software artifact facilitates process of testing, is not only the indication of the test process effectiveness but also gives the new perspective on code development. Since more than fifty percent of total software development costs is related to testing process activities, Software testability has always been the improving area in software domain so that we can make the software development process effective with respect to test cases writing and fault detection process. Objectives: The research though this thesis will have the objective of proposing a conceptual framework considering the testability issues for the simpler test suite generation and facilitating the concerned persons with better effectiveness of testing. We investigate the testability factors and testability metrics basically with the help of the systematic literature review and the proposed framework’s feasibility is evaluated with case study. Methods: Initially, we conduct the literature review to get broad knowledge on this domain as well for the key documents. Then study starts with the systematic literature review process guided by the review protocol to collect the testability factors and measurements. The framework is validated with the case study. The research documents are included from highly trusted e-database including Compendex, Inspec, IEEE Xplore, ACM Digital Library, Springer Link and Scopus. Altogether 36 primary documents are included for the study and results are extracted. Results: From the results of systematic literature review, Software testability factors and associated measurements are found and the construction of framework for simple test generation as guidelines evaluate with case study. To make the test suite generation simpler, we propped a framework based on the FTA concepts and breakdown of high level testability factors to its simpler form of measureable level. Conclusions: Numbers of different software testability factors are presented in different researches in different perspectives. We collect important testability factors and associated measurement methods and we concluded the effect of testability in simpler test suite generation with the help of framework evaluated by case study.
Bounds-based loop performance analysis: application to validation and tuning

We consider the floating point microarchitecture support in high-end RISC superscalar processors. We propose a simple, yet effective bounds model to deduce the "bestcase" loop performance limits for these processors. We compare these bounds to simulation-based (and where available, hardware-based) performance measurements for actual compiler-generated code sequences. From this study, we identify loop tuning opportunities to bridge the gap between "best-case" and "actual" performance in a post-silicon setting. Some of the results of such analysis point to fundamental hardware performance bugs which may be removed through feasible microarchitectural changes. More frequently, the analysis is useful for suggesting compiler enhancements. The analysis methods described have been used in actual high-end processor development projects within our company. We report our experimental results in the context of a set of application-based loop test cases, designed to stress various resource limits in the core (infinite cache) microarchitecture.
The Distributed Assembly Parallel Machine Scheduling Problem with eligibility constraints.

In this paper we jointly consider realistic scheduling extensions: First we study the distributed unrelated parallel machines problems by which there is a set of identical factories with parallel machines in a production stage. Jobs have to be assigned to factories and to machines. Additionally, there is an assembly stage with a single assembly machine. Finished jobs at the manufacturing stage are assembled into final products in this second assembly stage. These two joint features are referred to as the distributed assembly parallel machine scheduling problem or DAPMSP. The objective is to minimize the makespan in the assembly stage. Due to technological constraints, machines cannot be left empty and some jobs might be processed on certain factories only. We propose a mathematical model and two high performing heuristics. The model is tested with two state-of-the-art solvers and, together with the heuristics, 2220 instances are solved in a comprehensive computational experiments. Results show that the proposed model is able to solve moderately-sized instances and one of the heuristics is fast, giving close to optimal solutions in less than half a second in the worst case.
Disparity search range estimation based on TOF-stereo fusion

Known disparity search range is a crucial parameter for many stereo matching algorithms. It is necessary to estimate the disparity search range automatically in real time systems. In this work, we present an approach to estimate disparity search range of each pixel to be matched. A dual-mode camera which can be used to take stereo images or coarse depth maps is developed in our work. Under the constraint of the coarse depth map with the same spatial resolution as the stereo pairs, expected disparity of each pixel is limited within a narrow search range. We demonstrate the effectiveness of the proposed approach on benchmark images with ground truth as well as on images captured in our lab.
Integrated Integration Definition Language 0 (IDEF) and coloured Petri nets (CPN) modelling and simulation tool: a study on mould-making processes

The use of the Integrated Integration Definition Language 0 (IDEF) descriptive model or similar tools alone in the analysis of complicated processes like the mould-making process usually encounters difficulties due to the complexity of process. A quantitative analysis model thus seems necessary to supplement the IDEF0 tool for better modelling and simulation of complicated processes. The paper proposes to integrate the IDEF0 tool with the coloured Petri nets (CPN) tool for systematic analysis of complicated processes. It introduces an effective modelling and simulation language-hierarchical timed CPN-based workflow nets (HTCPNWF-nets). The rules for translating IDEF0 into HTCPNWF-nets have been developed. After mapping the IDEF0 model onto HTCPNWF-nets, several performance analyses can be achieved by simulation of HTCPNWF-nets model. The proposed methodologies have been successfully applied to the mould-making process. The paper presents the rationales and current progress of the proposed methodologies.
The Study on E-Business Authentication Approach in Distributed System

The most important and concerned problem with the Internet electronic registration is security problem. This contribution uses conic curve method to verify the generating license in servers. In order to ensure the validity and security of license, the process of license distribution apply a verifiable code distribution scheme based on conic curve to make the electronic registration process more secure. In this paper, we propose a distributed electronic authentication scheme based on conic curves. As an alternative algebra curve technology, we believe conic deserves the further study in cryptography.
Observer-based nonlinear friction compensation in servo drive system

This paper presents compensation schemes for nonlinear friction in servo drive systems to improve the control performance. The proposed control scheme uses a new disturbance observer which is designed on the basis of Coulomb friction characteristics. With this observer based compensation, delay-free motion control can be achieved. Experimental results and analytical studies show the significant performance improvement of the proposed scheme.
Development and Usage of Software as a Service for a Cloud and Non-Cloud Based Environment- An Empirical Study

Cloud computing is Internet-based computing, whereby shared resources, software, and information are provided to computers and other devices on demand. Cloud computing is a natural evolution of the widespread adoption of virtualization, service-oriented architecture and utility computing. The computer applications nowadays are becoming more and more complex; there is an ever increasing demand for computing resources. As this demand has risen, the concepts of cloud computing and grid computing have found many followers with more and more companies looking to outsource computing needs to a third party vendor. However, this growing dependence on third party providers is causing large corporations as well as research groups to look for alternative models that can support the increased demand for computing resources. The concerns of reliability, privacy, efficiency at the expense of resilience and environmental sustainability are at the forefront of such research. For application providers, cloud computing has the advantage that it reduces the administrative effort required to satisfy processing and storage requirements. However, to simplify the task of building scalable applications, some of the cloud computing platforms impose constraints on the application architecture, its implementation and tools that may be used in development. The changing scenario in education has given rise to need of technology in education. Information Technology has played a major part in improving the learning outcomes of individuals. Technologies like cloud computing has not only reduced the burden of economy as well as resources required. This paper has shown the different aspects of using cloud and non-cloud environment.
TIM: A Compact Architecture For A Real-Time Vision System

This paper discusses a proposed new parallel architecture, Torus Integrated Machine (TIM) which is designed to incorporate physical compactness, dedicated analog hardware and programmability. Since any typical short-range relaxation algorithm maps into the proposed hardware, the machine could be an ideal testbed for early-vision algorithms (e.g. edge detection, binocular stereo, motion, color, structure from motion.) The toroidal topology enables us to integrate, on a single panel, an entire set of dedicated algorithms, assembled into a self-feeding pipeline and executed in parallel. The result is a low-volume, portable vision machine thousands of times faster than current supercomputers.
The Analysis on Dimensionality Reduction Mathematical Model Based on Feedback Constraint for High-Dimensional Information

This paper proposes a dimensionality reduction mathematical model based on feedback constraint for High-dimensional information. It uses feedback restriction technique to construct dimensionality reduction model for multidimensional product data. The data obtained is with high latitudes, where a large number of data are under components involved standardized restrictions. High-dimensional data participating in operation will increase the complexity of operation, and hence, we need to reduce its dimension. In this paper multi-constrained inverse regression model is adopted to reduce the dimension of cloud resource scheduling data in multi-constrained environments. Experimental results show that the proposed method increases the data coverage rate of high-dimensional data mining by 66%, and has great optimizing effect.
The Chaco user`s guide. Version 1.0

Graph partitioning is a fundamental problem in many scientific settings. This document describes the capabilities and operation of Chaco, a software package designed to partition graphs. Chaco allows for recursive application of any of several different methods for finding small edge separators in weighted graphs. These methods include inertial, spectral, Kernighan-Lin and multilevel methods in addition to several simpler strategies. Each of these methods can be used to partition the graph into two, four or eight pieces at each level of recursion. In addition, the Kernighan-Lin method can be used to improve partitions generated by any of the other methods. Brief descriptions of these methods are provided, along with references to relevant literature. The user interface, input/output formats and appropriate settings for a variety of code parameters are discussed in detail, and some suggestions on algorithm selection are offered.
A Stack-Based Register Set

Register windowing has become a common sight in high speed processors, reducing the memory traffic required to preserve register contents over subroutine invocations. However, approaches to register windowing have changed little since their introduction. In this article, the current windowing schemes (namely fixed-sized and variable-sized) are presented, along with methods of implementation. A number of disadvantages with these systems are identified, and the requirements for an improved register windowing mechanism defined. A new register windowing paradigm is presented, known as Shifting Register Windows, which is designed to meet these requirements. This windowing system is first given in overview, followed by a more detailed description of the underlying model. Finally, a performance analysis of the model is presented, and conclusions drawn on speed and efficiency.
Efficient GTS Allocation Method of Industrial IEEE 802.15.4 Network for Real-time Periodic I/O Data

In this paper, a dynamic GTS allocation method of wireless control networks is proposed for the use of factory automation using IEEE 802.15. 4 MAC protocol. A superframe of IEEE 802.15. 4 is applied to the transmission method of real-time periodic I/O data of wireless control systems within the limited time in factory environment. The method is proposed for efficient transmission of real-time periodic I/O traffic. The simulation results show the average network utilization and available I/O node numbers could be increased by the proposed method.
Potential exists to change, through breeding, the yield of individual primal carcass cuts in cattle without increasing overall carcass weight.

The ability to alter the morphology of cattle towards greater yields of higher value primal cuts has the potential to increase the value of animals at slaughter. Using weight records of 14 primal cuts from 31,827 cattle, the objective of the present study was to quantify the extent of genetic variability in these primal cuts; also of interest was the degree of genetic variability in the primal cuts adjusted to a common carcass weight. Variance components were estimated for each primal cut using animal linear mixed models. The coefficient of genetic variation in the different primal cuts ranged from 0.05 (bavette) to 0.10 (eye of round) with a mean coefficient of genetic variation of 0.07. When phenotypically adjusted to a common carcass weight, the coefficient of genetic variation of the primal cuts was lesser ranging from 0.02 to 0.07 with a mean of 0.04. The heritability of the 14 primal cuts ranged from 0.14 (bavette) to 0.75 (topside) with a mean heritability across all cuts of 0.48; the heritability estimates reduced, and ranged from 0.12 (bavette) to 0.56 (topside), when differences in carcass weight were accounted for in the statistical model. Genetic correlations between each primal cut and carcass weight were all ≥0.77; genetic correlations between each primal cut and carcass conformation score were, on average, 0.59 but when adjusted to a common carcass weight, the correlations weakened to, on average, 0.27. The genetic correlations among all 14 primal cut weights was, on average, strong (mean correlation of 0.72 with all correlations being ≥0.37); when adjusted to a common carcass weight, the mean of the genetic correlations among all primal cuts was 0.10. The ability of estimated breeding values for a selection of primal cuts to stratify animals phenotypically on the respective cut weight was demonstrated; the weight of the rump, striploin and fillet of animals estimated to be in the top 25% genetically for the respective cut, were 10-24%, 12-24% and 7-17% heavier than the weight of cuts from animals predicted to be in the worst 25% genetically for that cut. Significant exploitable genetic variability in primal carcass cuts was clearly evident even when adjusted to a common carcass weight. The high heritability of many of the primal cuts infers that large datasets are not actually required to achieve high accuracy of selection once the structure of the data and the number of progeny per sire is adequate.
E-Government Interoperability

E-Government continues to be recognized as a key strategy for improving government services and the effectiveness of public policies and programs. A key component of e-government initiatives is the ability of multiple government and nongovernment organizations to share and integrate information across their traditional organizational boundaries. E-Government interoperability represents a set of multidimensional, complementary, and dynamic capabilities needed among these networks of organizations in order to achieve successful information sharing. However, this view is complex and provides both researchers and practitioners with the challenge of understanding and developing multiple and very diverse interoperability capabilities. Researchers and practitioners alike are investing in efforts to build that understanding and to create new capability for coordinated action. Drawing on theories and research in the fields of enterprise architecture, capability maturity, information sharing, and system interoperability, the framework presented here provides unique value in both regards.
Realization of shot boundary detection based on a unique classifying method

A new shot boundary detection system based on a unique classifying method was proposed. The pixel matched difference algorithm was improved and two new features: pixel similarity degree and pixel mean difference were proposed. Also a new classifying method for shot boundary transition, including cut, fade out or in, short gradual transition, long gradual transition and other gradual transition was proposed. These improved features showed good performance in the detection; the algorithm based on classifying method traded off well between performance and cost, both of which were proved by the experiment.
Establishing an online community of inquiry at the Distance Education Centre, Victoria

This pilot intervention focused on three courses that were redesigned to utilize the online environment to establish an online community of inquiry (CoI). The setting for this research study was the Distance Education Centre, Victoria (DECV), an Australian co-educational school with approximately 3000 students who, for a variety of reasons, are studying one or more subjects via distance education. Despite the availability of information and communications technology, many students at the DECV remain socially isolated from their peers. The DECV recognizes that online student collaboration has the potential to bridge this divide. Results of this study suggest that the adaptation of these courses had led to improvements in students’ perception of their educational experience. These findings may be of use to other P–12 education providers who are attempting to promote online collaboration and student connectedness.
A hybrid time synchronization algorithm based on broadcast sequencing for wireless sensor networks

Abstract : In recent years, time synchronization has emerged as an essential research topic for wireless sensor networks. Numerous wireless network applications require a common reference time for collaborative data fusion and communications. Other time synchronization protocols have been proposed over the years, but none have eliminated the possibility of collisions associated with wireless packet transmissions while maintaining a precise level of synchronization for any given topology. In this thesis, we present a new hybrid time synchronization scheme that provides a high degree of network-wide synchronization and eliminates the possibility of collisions when transmitting timestamp messages. We propose an algorithm that allows a network to determine a broadcast sequence by which nodes transmit and forward messages and then conducts a network-wide synchronization based on received timestamp information. The proposed hybrid time synchronization scheme utilizes two existing protocols, namely relative referenceless receiver/receiver synchronization and ratio-based synchronization protocol, that provide a high degree of precision. We implement our broadcast sequencing algorithm in simulations and demonstrate its effective performance for a series of network topologies. We also present results demonstrating an improvement in network-wide synchronization using our hybrid scheme over other time synchronization protocols.
Mechanism and Phenomenology of an Oscillating Chemical Reaction

Chemical reactions, which are far from equilibrium, are capable of displaying oscillations in species concentrations and hence in colour, electrode potential, pH and/or temperature. The oscillations arise from the interplay between positive and negative kinetic feedback. Mechanisms for such reactions are presented, along with the rich phenomenology that these systems exhibit, from complex oscillations and chemical waves, to stationary concentration patterns. This review will focus on the Belousov-Zhabotinksy reaction but reference to other reactions will be made where appropriate.
On-line learning using hierarchical mixtures of experts

In the hierarchical mixtures of experts (HME) framework, outputs from several function approximators specializing in different parts of the input space are combined. Fast learning algorithms derived from the expectation-maximization algorithm have previously been proposed, but they are predominantly for batch learning. In this paper, several online learning algorithms are developed for the HME. Their performance in a piecewise linear regression task are compared according to criteria such as speed of convergence, quality of solutions, and storage and computational costs.
A SURVEY ABOUT TEACHING OF HYBRID SUBJECTS IN SCIENCE AND MATHEMATIC AND EVALUATION OF STUDENT SUCCESS

Aim of this reserch is to compose a hybryd in teaching science and maths subject together and evaluate the students according to traditional education methods. In this research, pre-test, post-test, experimental research model controlling group were used. In the experimental research group hybrid science and math learning method; yn control group traditional teaching methods are used. This research was done with 62 students in Kayseri-Melikgazi Hayriye Dabano? lu Primary School in 2006-2007 Educational Year. In the research quantitative and qualitative researc approach is adopted. Data of the research was gathered together with hybrid science and maths success test, hybrid science and maths attitude scale. In analysis of quantitative data of research arithmetic average, standard deviation, variance analysis, t-test, square test were used. Interview records were coded according to categories, and frequency percent was analyzed. As a result of this research; Hybrid science and maths teaching methods are much more effective in increasing students' success than traditionteaching methods. Experimental group which was educated by hybrid science and maths teaching method differs in a positive way from control group which was educated by traditional methods.