检索结果-内蒙古大学图书馆

作者： Zhao, Yangyang Yang, Yibiao Lu, Hongmin Zhou, Yuming Song, Qinbao Xu, Baowen State Key Laboratory for Novel Software Technology Nanjing University China Department of Computer Science and Technology Nanjing University China Department of Computer Science and Technology Xi'An Jiaotong University China

Context: In a large object-oriented software system, packages play the role of modules which group related classes together to provide well-identified services to the rest of the system. In this context, it is widely believed that modularization has a large influence on the quality of packages. Recently, Sarkar, Kak, and Rama proposed a set of new metrics to characterize the modularization quality of packages from important perspectives such as inter-module call traffic, state access violations, fragile base-class design, programming to interface, and plugin pollution. These package-modularization metrics are quite different from traditional package-level metrics, which measure software quality mainly from size, extensibility, responsibility, independence, abstractness, and instability perspectives. As such, it is expected that these package-modularization metrics should be useful predictors for fault-proneness. However, little is currently known on their actual usefulness for fault-proneness prediction, especially compared with traditional package-level metrics. Objective: In this paper, we examine the role of these new package-modularization metrics for determining software fault-proneness in object-oriented systems. Method: We first use principal component analysis to analyze whether these new package-modularization metrics capture additional information compared with traditional package-level metrics. Second, we employ univariate prediction models to investigate how these new package-modularization metrics are related to fault-proneness. Finally, we build multivariate prediction models to examine the ability of these new package-modularization metrics for predicting fault-prone packages. Results: Our results, based on six open-source object-oriented software systems, show that: (1) these new package-modularization metrics provide new and complementary views of software complexity compared with traditional package-level metrics;(2) most of these new package-modul

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Detecting data races in interrupt-driven programs based on static analysis and dynamic simulation 15

Detecting data races in interrupt-driven programs based on s...

引用

7th Asia-Pacific Symposium on Internetware, Internetware 2015

作者： Wang, Yu Shi, Junjing Wang, Linzhang Zhao, Jianhua Li, Xuandong State Key Laboratory of Novel Computer Software Technology Nanjing University Nanjing 210023 China Jiangsu Novel Software Technology and Industrialization Nanjing 210023 China Department of Computer Science and Technology Nanjing University Nanjing 210023 China

ISBN: (纸本)9781450336413

Interrupt-driven programs are often embedded in safety-critical systems to perform hardware/resource dependent data operation tasks, such as data acquisition, processing, and transformation. The interrupt programs and tasks may happen in parallel which in a result causes indeterminist concurrent problems at runtime. Data race is one of the most popular problems challenging researchers and practitioners. Various static analysis, software testing approaches have been proposed to detect data races in source code, testing, and even production run. However, static analysis may report too many false positives due to the lack of execution information. Dynamic testing may miss some important races since it could not generate adequate test cases to test all possible execution scenarios. In this paper, we propose a hybrid approach to detect data races in interrupt-driven programs based on static analysis and dynamic simulation. We implemented a prototype tool and conducted a controlled experiment to demonstrate the applicability of our approach. © 2015 ACM.

关键词： software testing

来源：评论

学校读者我要写书评

暂无评论

NCov: A tool for measuring length-n subpath coverage 15

NCov: A tool for measuring length-n subpath coverage

引用

7th Asia-Pacific Symposium on Internetware, Internetware 2015

作者： Zhou, Yan Li, You Wang, Linzhang Li, Xuandong State Key Laboratory of Novel Computer Software Technology Nanjing University Nanjing210023 China Jiangsu Novel Software Technology and Industrialization Nanjing210023 China Department of Computer Science and Technology Nanjing University Nanjing210023 China

ISBN: (纸本)9781450336413

software test adequacy criteria are used to determine whether the test on a software system is sufficient. Code coverage shows how thoroughly a program is tested according to corresponding testing adequacy criteria. There are many coverage criteria used in practice to measure the test adequacy at different granularity of the target program. Length-n subpath criterion is a systematic flexible coverage criterion at a fine granularity. In this paper, we present a prototype test coverage tool named nCov for measuring length-n subpath coverage based on control flow graph. For a C program and corresponding test suite, our tool can measure the length-n subpath coverage for various n, say 1 to 8. It can also be used to select test cases for satisfying length-n subpath coverage with specific n. In addition, to improve the scalability of the tool, we propose a loop compression algorithm to record the program trace. We have conducted a controlled experiment to demonstrate the feasibility and efficiency of our tool. © 2015 ACM.

关键词： software testing

来源：评论

学校读者我要写书评

暂无评论

Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model

Convergence of MCMC and Loopy BP in the Tree Uniqueness Regi...

引用

Annual IEEE Symposium on Foundations of computer science

作者： Charilaos Efthymiou Thomas P. Hayes Daniel Štefankovic Eric Vigoda Yitong Yin Mathematics Institute Goethe University Frankfurt am Main Germany Department Computer Science University of New Mexico Albuquerque NM USA Department of Computer Science University of Rochester Rochester NY USA School of Computer Science Georgia Institute of Technology Atlanta GA USA State Key Laboratory for Novel Software Technology Nanjing University Nanjing China

We study the hard-core (gas) model defined on independent sets of an input graph where the independent sets are weighted by a parameter (aka fugacity) λ > 0. For constant Δ, previous work of Weitz (2006) established an FPTAS for the partition function for graphs of maximum degree Δ when λ c(Δ). Sly (2010) showed that there is no FPRAS, unless NP=RP, when λ > λ c (Δ). The threshold λ c (Δ) is the critical point for the statistical physics phase transition for uniqueness/non-uniqueness on the infinite Δ-regular tree. The running time of Weitz's algorithm is exponential in log Δ. Here we present an FPRAS for the partition function whose running time is O* (n 2 ). We analyze the simple single-site Markov chain known as the Glauber dynamics for sampling from the associated Gibbs distribution. We prove there exists a constant Δ 0 such that for all graphs with maximum degree Δ > Δ 0 and girth > 7 (i.e., no cycles of length ≤ 6), the mixing time of the Glauber dynamics is O(nlog n) when λ c(Δ). Our work complements that of Weitz which applies for small constant Δ whereas our work applies for all Δ at least a sufficiently large constant Δ 0 (this includes Δ depending on n = IVI). Our proof utilizes loopy BP (belief propagation) which is a widely-used algorithm for inference in graphical models. A novel aspect of our work is using the principal eigenvector for the BP operator to design a distance function which contracts in expectation for pairs of states that behave like the BP fixed point. We also prove that the Glauber dynamics behaves locally like loopy BP. As a byproduct we obtain that the Glauber dynamics, after a short burn-in period, converges close to the BP fixed point, and this implies that the fixed point of loopy BP is a close approximation to the Gibbs distribution. Using these connections we establish that loopy BP quickly converges to the Gibbs distribution when the girth ≥ 6 and λ c(Δ).

关键词： Partitioning algorithms Approximation algorithms Algorithm design and analysis Heuristic algorithms Markov processes Couplings Electronic mail

来源：评论

学校读者我要写书评

暂无评论

Modeling and evaluating IaaS cloud using performance evaluation process algebra

Modeling and evaluating IaaS cloud using performance evaluat...

引用

Asia-Pacific Conference on Communications

作者： Jie Ding Leijie Sha Xiao Chen State Key Lab. for Novel Software Technology Nanjing University Nanjing China School of Information Engineering Yangzhou University Yangzhou China School of Computer Science and Telecommunication Engineering Jiangsu University Zheniian China

ISBN: (纸本)9781509006779

Infrastructure as a Service (IaaS) is a service mode of cloud, which provides Virtual Machines (VMs) to customers. With the increasingly fierce competition in market, cloud providers pay more attention to Quality of service (Qos). As the practical measurement costs a large amount of resource, deriving performance metrics from analytical model is a good choice. Recently, Stochastic Petri Net (SPN) has been used to construct analytical models, but they lack the ability to exhibit hierarchies of IaaS cloud. Compare to SPN, Performance Evaluation Process Algebra (PEPA) has the feature of compositionality, which imports the hierarchial strategy into the semantics. So, PEPA models of IaaS cloud are closed to actual architecture and can be more easily accepted by engineers. This paper provides a PEPA model of IaaS cloud and gives some numerical results.

关键词： Mathematical model Cloud computing Analytical models Switches Numerical models Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

ABC: Accelerated building of C/C++ projects 22

ABC: Accelerated building of C/C++ projects

引用

22nd Asia-Pacific software Engineering Conference, APSEC 2015

作者： Zhang, Ying Jiang, Yanyan Xu, Chang Ma, Xiaoxing Yu, Ping State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Department of Computer Science and Technology Nanjing University Nanjing China

ISBN: (纸本)9781467396448

software building is recurring and time-consuming. Based on the finding that a significant portion of compilations in incremental build is unnecessary, we propose bypath compilation, an efficient build technique that avoids unnecessary recompilation with automated detection of redundant dependencies and unessential changes in source files. The technique is lightweight and transparent to software developers, and can be easily applied to existing build systems. We evaluated our approach on a set of real-world open source projects. The results show that 83% ~ 97% of the recompilations are unnecessary and our approach can accelerate the incremental build up to 44.20%. © 2015 IEEE.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

Improing screen power usage model on android smartphones 22

Improing screen power usage model on android smartphones

引用

22nd Asia-Pacific software Engineering Conference, APSEC 2015

作者： Lu, Ziling Cao, Chun Tao, Xianping State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Department of Computer Science and Technology Nanjing University Nanjing China

ISBN: (纸本)9781467396448

With user experience becoming richer and richer on Android smartphones, limited battery capacity has become a major concern for users. It is a good practice for Android to tell users where the battery power has gone. Android achieves this by a power profile provided by OEMs that specifies the power usage rate for each system component staying at each specific state. According to a recent study, screen is one of the most dominant power-hungry system components on Android smartphones. However, the accuracy of Android's screen power usage model is to be improved, taking not only the brightness, but also the displayed content into account. We modified Android source code to improve its screen power usage model and verified this improvement with experiments. The results show that our new screen power usage model is more accurate to a significant extent and introduces little overhead. © 2015 IEEE.

关键词： Android (operating system)

来源：评论

学校读者我要写书评

暂无评论

Efficient anonymous category-level joint Tag estimation

Efficient anonymous category-level joint Tag estimation

引用

International Conference on Network Protocols

作者： Min Chen Jia Liu Shigang Chen Qingjun Xiao Department of Computer & Information Science & Engineering University of Florida Gainesville FL USA State Key Laboratory for Novel Software Technology Nanjing University P.R. China Key Laboratory of Computer Network & Information Integration Southeast University P.R. China

ISBN: (纸本)9781509032822

Radio-frequency identification (RFID) technologies have been widely used in many applications, including inventory management, supply chain, product tracking, transportation, logistics, etc. Tag estimation, which is to estimate the cardinality of a single tag set, is an important research topic. This paper expands the estimation research as follows: It performs joint estimation between two tag sets (which exist at different locations or at the same location but different times). More importantly the estimation is fine-grained in an effort to accommodate common practical scenarios, where each tag set consists of tags belonging to different categories. For any two given tag sets, we want to know the detailed information about the joint property of each category, instead of just the aggregate information of the whole sets. Furthermore, due to the open nature of RFID communications, it is often desirable that tag estimation can be performed in an anonymous way without revealing the tags' ID information. To support these requirements, we develop a new technique called mask bitmap that can encode a tag set without requiring the tags to report their IDs or category IDs. Any two mask bitmaps of different tag sets can be combined to perform category-level joint estimation. Through formal analysis, we determine how to set system parameters to meet a given accuracy requirement that can be arbitrarily set. Extensive simulation results confirm that the proposed solution can yield accurate category-level estimates in an efficient way, and preserve tags' anonymity as well.

关键词： Estimation Radiofrequency identification Protocols Conferences Aggregates Simulation Servers

来源：评论

学校读者我要写书评

暂无评论

Learning with privileged information using Bayesian networks

引用

Frontiers of computer science 2015年第2期9卷 185-199页

作者： Shangfei WANG Menghua HE Yachen ZHU Shan HE Yue LIU Qiang JI School of Computer Science and Technology University of Science and Technology of China Hefei 230027 China Key Lab of Computing and Communicating Software of Anhui Province Hefei 230027 China School of Mathematical Sciences University of Science and Technology of China Hefei 230027 China Department of Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute Troy NY 12180-3590 USA

For many supervised learning applications, addi- tional information, besides the labels, is often available dur- ing training, but not available during testing. Such additional information, referred to the privileged information, can be exploited during training to construct a better classifier. In this paper, we propose a Bayesian network （BN） approach for learning with privileged information. We propose to in- corporate the privileged information through a three-node BN. We further mathematically evaluate different topologies of the three-node BN and identify those structures, through which the privileged information can benefit the classifica- tion. Experimental results on handwritten digit recognition, spontaneous versus posed expression recognition, and gender recognition demonstrate the effectiveness of our approach.

关键词： Bayesian network privileged information clas-sification maximum likelihood estimation

来源：评论

学校读者我要写书评

暂无评论

Unleashing the performance potential of CPU-GPU platforms for the 3D atmospheric Euler solver

Unleashing the performance potential of CPU-GPU platforms fo...

引用

International Conference on Application Specific Systems (ASAP), Architectures and Processors

作者： Haohuan Fu Jingheng Xu Lin Gan Chao Yang Wei Xue Wenlai Zhao Wen Shi Xinliang Wang Guangwen Yang National Supercomputing Center in Wuxi Ministry of Education Key Lab. for Earth System Modeling Center for Earth System Science Tsinghua University Department of Computer Science & Technology Tsinghua University Institute of Software and State Key Laboratory of Computer Science Chinese Academy of Sciences Tsinghua University Beijing Beijing CN

ISBN: (纸本)9781509015047

As a traditional application on various supercomputers, atmospheric modeling has long been suffering from the low performance efficiency. In this paper, we pick the 3D Euler equation solver (the most essential dynamic component for a non-hydrostatic atmospheric model) as the target application, and explore the maximum performance efficiency that can be achieved on CPU-GPU hybrid architectures. Besides presenting the suitable hybrid domain decomposition methodology and taking proper usage of tuning techniques for both the CPU and GPU parts, we further propose a novel GPU tuning technique, namely the customizable data caching mechanism with thread warp rescheduling scheme, which is specifically designed for the Euler solver. Combining all the optimizing approaches together, remarkable performance boost has been achieved on mainstream GPU architectures including Tesla Fermi C2050, K20×, K40 and K80. Especially, on the latest Tesla K80, we demonstrate a 31.64× speedup over the performance of 12-core E5-2697 CPU. In addition, based on a hybrid CPU-GPU node with two 12-core E5-2697 CPUs and two Tesla K80 GPUs, a sustained double-precision performance of 1.04 Tflops (16% of the peak) is achieved, which is remarkably higher than the efficiency of similar optimizing tasks based on heterogeneous platforms (strictly less than 10%, as demonstrated in the related work). In addition, a nearly linear weak scaling efficiency is achieved which demonstrate the effectiveness of our domain decomposition method.

关键词： Atmospheric modeling Graphics processing units Mathematical model Computational modeling computer architecture Tuning Three-dimensional displays

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：