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

作者： 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

来源：评论

学校读者我要写书评

暂无评论

Bayesian Network Based Program Dependence Graph for Fault Localization

Bayesian Network Based Program Dependence Graph for Fault Lo...

引用

IEEE International Conference on software Reliability Engineering Workshops (ISSRE Wksp)

作者： Xiao Yu Jin Liu Zijiang James Yang Xiao Liu Xiaofei Yin Shijie Yi State Key Laboratory of Software Engineering Wuhan University Wuhan China Department of Computer Science Western Michigan University MI USA School of Information Technology Deakin University Melbourne Australia School of Computer Science and Information Engineering HuBei University Wuhan China

ISBN: (纸本)9781509036028

Some probabilistic graphical models such as probabilistic program dependence graph (PPDG) have been used in fault localization. However, PPDG is insufficient to reason across nonadjacent nodes and only support making inference about local anomaly. In this paper, we propose a novel probabilistic graphical model called Bayesian Network based Program Dependence Graph (BNPDG) that has the excellent inference capability for reasoning across nonadjacent nodes. We focus on applying the BNPDG to fault localization. Compared with the PPDG, our BNPDG-based fault localization approach overcomes the reasoning limitation across nonadjacent nodes and provides more precise fault localization by taking its output nodes as the common conditions to calculate the conditional probability of each non-output node. Experiment results show that our BNPDG-based fault localization approach outperforms its rivals.

关键词： Bayes methods Probabilistic logic Microwave integrated circuits Cognition Mutual information Graphical models Probability distribution

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Suspicious face detection based on key frame recognition under surveillance video

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2016年 9712 LNCS卷 645-652页

作者： Zheng, Xiaohui Ning, Yi Chen, Xianjun Zhan, Yongsong Guangxi Colleges and Universities Key Laboratory of Intelligent Processing of Computer Image and Graphics Guilin University of Electronic Technology GuilinGuangxi541004 China Guangxi Experiment Center of Information Science Guilin University of Electronic Technology GuilinGuangxi541004 China Guangxi Colleges and Universities Key Laboratory of Cloud Computing and Complex Systems Guilin University of Electronic Technology GuilinGuangxi541004 China Guangxi Key Laboratory of Trusted Software Guilin University of Electronic Technology GuilinGuangxi541004 China

ISBN: (纸本)9783319409993

Surveillance video is characterized by large amount of data and redundancy, which makes the suspicious face detection to be a problem. To solve the problem above we proposed suspicious face detection based on key frame. Surveillance video has the type of fixed background, so this paper used the frame difference method with low computational complexity and small computation to extract the key frame. We proposed a new method combined DPM with skin color detection to detect the suspicious face in the key frames. To solve the speed bottleneck of the traditional DPM, we proposed to use the fast HOG LUT feature extraction and the near optimal cost sensitive decision making improving the traditional method. Meanwhile we used YCrCb + otsu skin color segmentation. Since the otsu is easily affected by the illumination, we proposed an improved skin color detection. Experiment results show that the proposed algorithms are robust and accurate for real-time. © Springer International Publishing Switzerland 2016.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Big data in smart cities

引用

Science China(Information Sciences) 2015年第10期58卷 179-190页

作者： LI DeRen CAO JianJun YAO Yuan State Key Laboratory of Information Engineering in Surveying Mapping and Remote Sensing Wuhan University Collaborative Innovation Center of Geospatial Technology Geomatics Center of Gansu Province National Engineering Research Center for Multimedia Software Computer School Wuhan University

In this paper, we discuss the concept of the smart city, summarize its development, analyze the motivation and goals of building smart cities in China, and illustrate the supporting technologies of the smart city. Next, we propose a smart city infrastructure that is based on the concept of the digital city and integrates the Internet of Things and cloud computing technologies, thereby achieving automatic control and intelligence services for people and logistics in physical cities. We analyze the big data of smart cities according to ubiquitous sensor networks. Facing the problems and challenges caused by big data of smart cities, we propose a strategy to handle big data that focuses on cloud computing and data mining. In addition, we present a basic framework for cloud computing platforms and propose the establishment of an operating center for smart cities. In closing,we discuss the bright prospects of smart cities.

关键词： smart city big data digital city Internet of Things cloud computing data mining intelligence service

来源：评论

学校读者我要写书评

暂无评论

Mining knowledge on technical debt propagation 14

Mining knowledge on technical debt propagation

引用

14th Symposium on Programming Languages and software Tools, SPLST 2015

作者： Suovuo, Tomi'bgt' Holvitie, Johannes Smed, Jouni Leppänen, Ville TUCS - Turku Centre for Computer Science Software Development Laboratory and University of Turku Department of Information Technology Turku Finland

Technical debt has gained considerable traction both in the industry and the academia due to its unique ability to distinguish asset management characteristics for problematic software project trade-offs. Management of technical debt relies on separate solutions identifying instances of technical debt, tracking the instances, and delivering information regarding the debt to relevant decision making processes. While there are several of these solutions available, due to the multiformity of software development, they are applicable only in predefined contexts that are often independent from one another. As technical debt management must consider all these aspects in unison, our work pursues connecting the software contexts via unlimited capturing and explanation of technical debt propagation intra- and inter-software-contexts. We mine software repositories (MSR) for data regarding the amount of work as a function of time. Concurrently, we gather information on events that are clearly external to the programmers' own work on these repositories. These data are then combined in an effort to statistically measure the impact of these events in the amount of work. With this data, as future work, we can apply taxonomies, code analysis, and other analyses to pinpoint these effects into different technical debt propagation channels. Abstraction of the channel patterns into rules is pursued so that development tools may automatically maintain technical debt information with them (the authors have introduced the DebtFlag tool for this). Hence, successfully implementing this study would allow further understanding and describing technical debt propagation at both the high level (longitudinal technical debt propagation effects for the project) and the low level (artifact level effects describing the mechanism of technical debt value accumulation).

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

Modelling Propagation of Technical Debt

Modelling Propagation of Technical Debt

引用

Euromicro Conference on software Engineering and Advanced Applications (SEAA)

作者： Johannes Holvitie Sherlock A. Licorish Ville Leppänen Dept. of Information Technology University of Turku Turku Finland TUCS Turku Centre for Computer Science Software Development Laboratory Turku Finland Department of Information Science University of Otago Dunedin Otago New Zealand

Noting the overwhelming speed during software development, and particularly in environments where rapid delivery is the norm, the lack of accumulated technical debt information could result in ineffective management. We introduce technical debt propagation channels in this paper to advance software maintenance research on two accounts: (1) We describe the fundamental components for the channels, allowing identification of distinct channels, and (2) we describe a procedure to identify and abstract technical debt channels in order to produce technical debt propagation models. Our propagation models pursue automation of technical debt information maintenance with program analysis results, and translation of the maintained information between existing-and currently disconnected-technical debt management solutions. We expect the immediate technical debt information to enhance applicability and effectiveness of existing technical debt management approaches.

关键词： software Context Estimation computer bugs Biological system modeling Feature extraction Synchronization

来源：评论

学校读者我要写书评

暂无评论

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)

来源：评论

学校读者我要写书评

暂无评论

Towards Better Understanding of App Functions

引用

Journal of computer Science & technology 2015年第5期30卷 1130-1140页

作者：童咏昕余洁莹陈雷 State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang University Beijing 100191 China International Research Institute for Multidisciplinary Science Beihang University Beijing 100191 China Department of Computer Science and Engineering The Hong Kong University of Science and Technology Hong I(ong China

Apps are attracting more and more attention from both mobile and web platforms. Due to the self-organized nature of the current app marketplaces, the descriptions of apps are not formally written and contain a lot of noisy words and sentences. Thus, for most of the apps, the functions of them are not well documented and thus cannot be captured by app search engines easily. In this paper, we study the problem of inferring the real functions of an app by identifying the most informative words in its description. In order to utilize and integrate the diverse information of the app corpus in a proper way, we propose a probabilistic topic model to discover the latent data structure of the app corpus. The outputs of the topic model are further used to identify the function of an app and its most informative words. We verify the effectiveness of the proposed methods through extensive experiments on two real app datasets crawled from Google Play and Windows Phone Store, respectively.

关键词： app function docmnent topic model

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：