High reliability is an essential factor of modern software. At the same time, as software complexity is increasing day by day, bug counts and rate inevitably rises, leading to undermine software reliability. To avoid ...
详细信息
ISBN:
(纸本)9781510830028
High reliability is an essential factor of modern software. At the same time, as software complexity is increasing day by day, bug counts and rate inevitably rises, leading to undermine software reliability. To avoid this problem, programmers always use issue-finding tools(bug detection) to discover the defects from source code in development of software. Recently, software inspection has been shown to be an effective way to speed up the process of source code verification and to move a portion of discovered defects from test to coding phase. As we know, modern software is often developed over many years. During this time, the commit metadata is becoming an important source of social characteristics. In this paper, our aim is to devise an empirical method to assess the percentage and the types of the issues found by issue finding tools are actual defects of the software.
LESAP is a combustion simulation application capable of simulating the chemical reactions and supersonic flows in the scramjet engines. It can be used to solve practical engineering problems and involves a large amoun...
详细信息
Software projects are not developed in isolation but often build upon other open source resources. These projects form a kind of reference ecosystem regarded as a software world. Most of social computing works focus o...
详细信息
Software projects are not developed in isolation but often build upon other open source resources. These projects form a kind of reference ecosystem regarded as a software world. Most of social computing works focus on social networks such as Facebook and weibo to mine information. However, few previous works analyze Open Source Community which could help developers conduct collaborative development. In this paper, we model the Java reference ecosystem as a network based on the reuse relationships of Git Hub-hosted Java projects and analyze the characteristics and the patterns of this reference ecosystem by using community detection and pattern discovery algorithms. Our study indicates that(1) Developers prefer to reuse software limited in only a small part of projects with cross cutting functionality or advanced applications.(2)Developers usually select software reused with similar function widely depending on different requirements, resulting to different patterns. Based on these collective intelligence, our study opens up several possible future directions of reuse recommendation, which are considered as guidance of collaborative development.
A radiation hardening algorithm named as state-conservation on 2nd order clock and data recovery (CDR) system is presented in this paper. This proposed algorithm is used to resist the single event transient (SET) of C...
详细信息
—Human-machine systems required a deep understanding of human behaviors. Most existing research on action recognition has focused on discriminating between different actions, however, the quality of executing an acti...
详细信息
This paper studies the communication pattern of data-parallel applications from the perspective of job execution, and discovers multiple inter-coflow dependencies. These inter-coflow dependencies, collectively named a...
详细信息
ISBN:
(纸本)9781509036547
This paper studies the communication pattern of data-parallel applications from the perspective of job execution, and discovers multiple inter-coflow dependencies. These inter-coflow dependencies, collectively named as semantic flow (seflow), can expose job-level semantics. It is observed that most distributed computing frameworks describe their job execution as directed acyclic graphs (DAG). So a seflow comprises not only all the coflows of a job but also the DAG-based relationship between them. Seflow, coflow and flow can be viewed as the top-down abstractions for communication of jobs.
MIMO system is widely studied for its high performance in wireless communication, of which the THP algorithm is a bottleneck of performance. Generally the THP is implemented in ASIC for high performance, which unfortu...
详细信息
ISBN:
(纸本)9781467388399
MIMO system is widely studied for its high performance in wireless communication, of which the THP algorithm is a bottleneck of performance. Generally the THP is implemented in ASIC for high performance, which unfortunately makes it a difficulty for system updating. Compared to the ASIC solution, configurable processing, as its inherent flexibility and extension, becomes a promising solution for this difficulty, especially in the case of FPGA based systems where multi-core method is utilized to make up for the performance deficiency of soft cores. This paper explores a micro blaze based-multi-core system to increase the performance of THP algorithm while keeping the system flexibility. In support of the flexibility to update the algorithm, the effective adaption of this approach is demonstrated. Moreover, optimized application specific hardware is combined with data-level paralleled software modules in the multi-core embedded system, which increases the performance of THP algorithm to a 6× speed over all-soft single-core solution.
Virtual Machine(VM) allocation for multiple tenants is an important and challenging problem to provide efficient infrastructure services in cloud data centers. Tenants run applications on their allocated VMs, and th...
详细信息
Virtual Machine(VM) allocation for multiple tenants is an important and challenging problem to provide efficient infrastructure services in cloud data centers. Tenants run applications on their allocated VMs, and the network distance between a tenant's VMs may considerably impact the tenant's Quality of Service(Qo S). In this study, we define and formulate the multi-tenant VM allocation problem in cloud data centers, considering the VM requirements of different tenants, and introducing the allocation goal of minimizing the sum of the VMs' network diameters of all tenants. Then, we propose a Layered Progressive resource allocation algorithm for multi-tenant cloud data centers based on the Multiple Knapsack Problem(LP-MKP). The LP-MKP algorithm uses a multi-stage layered progressive method for multi-tenant VM allocation and efficiently handles unprocessed tenants at each stage. This reduces resource fragmentation in cloud data centers, decreases the differences in the Qo S among tenants, and improves tenants' overall Qo S in cloud data centers. We perform experiments to evaluate the LP-MKP algorithm and demonstrate that it can provide significant gains over other allocation algorithms.
Groupwise analytics on big data have been widely used in statistics, computer science, parallel computing and many other fields in recent years. At The same time, Aggregation queries is one of the most important analy...
详细信息
ISBN:
(纸本)9781509055227
Groupwise analytics on big data have been widely used in statistics, computer science, parallel computing and many other fields in recent years. At The same time, Aggregation queries is one of the most important analytics techniques. In big data eras, the aggregation queries on the ever-increasing data volumes will consumes much time, the traditional methods of traversing the entire dataset is not acceptable to users. Data sampling is a technique that only process a part of data to get an approximate result, the technique can save a lot of time when dealing with a vast amount of data with the sacrifice of accuracy. This paper will introduce several data sampling algorithms for approximate aggregation queries for big data, and analyze the shortcomings and advantages of each methods. Including the technique apply to the sparse data which meaning data has a limited population but a wide range.
Support Vector Machines (SVMs) are powerful classification tools. However, the model training is very time-consuming when meeting large scale data sets. Some efforts have been devoted to screening out non-support vect...
详细信息
ISBN:
(纸本)9781509044603
Support Vector Machines (SVMs) are powerful classification tools. However, the model training is very time-consuming when meeting large scale data sets. Some efforts have been devoted to screening out non-support vectors (non-SVs) to accelerate the training. But their processes rely on prior knowledge of other classifiers with different parameters to screen out non-SVs. In this paper, we propose Directional Indicator Support Vector Machines (DISVMs) to efficiently identify non-SVs. DISVMs employs a directional indicator, which points to the approximately orthogonal direction of the separating hyperplane, to qualitatively define the location of different samples and thus identify non-SVs. Furthermore, DISVMs leverages a two-stage algorithm: the first stage is to compute the directional indicator. The second stage is to identify non-SVs using the indicator. To avoid misjudgement, we propose CnSV method for non-SVs based on the majority rule. DISVMs screens out non-SVs with light computation and little accuracy loss. Experiments show that our approach significantly reduces the total computation cost.
暂无评论