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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An empirical analysis of package-modularization metrics: Implications for software fault-proneness

An empirical analysis of package-modularization metrics: Imp...

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Omnidirectional chargability with directional antennas

Omnidirectional chargability with directional antennas

引用

International Conference on Network Protocols

作者： Haipeng Dai Xiaoyu Wang Alex X. Liu Fengmin Zhang Yang Zhao Guihai Chen State Key Laboratory for Novel Software Technology Nanjing University Nanjing Jiangsu CHINA Department of Computer Science and Engineering Michigan State University East Lansing MI USA Shanghai key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Shanghai CHINA

ISBN: (纸本)9781509032822

Wireless Power Transfer (WPT) has received more and more attentions because of its convenience and reliability. In this paper, we first propose the notion of omnidirectional charging by which an area is omnidirectionally charged if a device with directional antennas at any position in the area with any orientation can be charged by directional chargers with power being no smaller than a given threshold. We present our empirical charging model based on field experimental results using off-the-shelf WPT products. Next, we consider the problem of detecting whether the target area achieves omnidirectional charging given a deterministic deployment of chargers. We develop piecewise constant approximation and area discretization techniques to partition the target area into subareas and approximate powers from chargers as constants. Then we propose the Minimum Coverage Set extraction technique which reduces the continuous search space to a discrete one and thereby allows a fast detection algorithm. Moreover, we consider the problem of determining the probability that the target area achieves omnidirectional charging given a random deployment of chargers. We first replace the target area by grid points on triangular lattices to reduce the search space from infinite to finite, then approximate chargers' power with reasonable relaxation, and derive an upper bound of the omnidirectional charging probability. Finally, we conduct both simulation and field experiments, and the results show that our algorithm outperforms comparison algorithms by at least 120%, and the consistency degree of our theoretical results and field experimental results is larger than 93.6%.

关键词： Wireless sensor networks Wireless communication Directional antennas Adaptation models Joining processes Conferences Protocols

来源：评论

学校读者我要写书评

暂无评论

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)

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Frequent Subgraph Based Familial Classification of Android Malware

Frequent Subgraph Based Familial Classification of Android M...

引用

International Symposium on software Reliability Engineering (ISSRE)

作者： Ming Fan Jun Liu Xiapu Luo Kai Chen Tianyi Chen Zhenzhou Tian Xiaodong Zhang Qinghua Zheng Ting Liu Department of Computer Science and Technology Xi'an Jiaotong University China Department of Computer The Hong Kong Polytechnic University China State Key Laboratory of Information Security Chinese Academy of Sciences China

ISBN: (纸本)9781467390033

The rapid growth of Android malware poses great challenges to anti-malware systems because the sheer number of malware samples overwhelm malware analysis systems. A promising approach for speeding up malware analysis is to classify malware samples into families so that the common features in malwares belonging to the same family can be exploited for malware detection and inspection. However, the accuracy of existing classification solutions is limited because of two reasons. First, since the majority of Android malware is constructed by inserting malicious components into popular apps, the malware's legitimate part may misguide the classification algorithms. Second, the polymorphic variants of Android malware could evade the detection by employing transformation attacks. In this paper, we propose a novel approach that constructs frequent subgraph (fregraph) to represent the common behaviors of malwares in the same family for familial classification of Android malware. Moreover, we propose and develop FalDroid, an automatic system for classifying Android malware according to fregraph, and apply it to 6,565 malware samples from 30 families. The experimental results show that FalDroid can correctly classify 94.5% malwares into their families using around 4.4s per app.

关键词： Malware Androids Humanoid robots Feature extraction Smart phones Frequency measurement Semantics

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：