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

37th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2014

作者： Zhang, Peichao Zhang, Wei Li, Wu-Jun Guo, Minyi Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science and Engineering Shanghai Jiao Tong University China National Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University China

ISBN: (纸本)9781450322591

Due to its low storage cost and fast query speed, hashing has been widely adopted for approximate nearest neighbor search in large-scale datasets. Traditional hashing methods try to learn the hash codes in an unsupervised way where the metric (Euclidean) structure of the training data is preserved. Very recently, supervised hashing methods, which try to preserve the semantic structure constructed from the semantic labels of the training points, have exhibited higher accuracy than unsupervised methods. In this paper, we propose a novel supervised hashing method, called latent factor hashing (LFH), to learn similarity-preserving binary codes based on latent factor models. An algorithm with convergence guarantee is proposed to learn the parameters of LFH. Furthermore, a linear-time variant with stochastic learning optimization is proposed for training LFH on large-scale datasets. Experimental results on two large datasets with semantic labels show that LFH can achieve superior accuracy than state-of-the-art methods with comparable training time. Copyright 2014 ACM.

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

AZCVN: A novel energy equilibrium routing algorithm for WSNs

AZCVN: A novel energy equilibrium routing algorithm for WSNs

引用

2010 IEEE 12th International Conference on Communication technology, ICCT'2010

作者： Gu, Yueyue Bai, Guangwei Cao, Lei Department of Computer Science and Technology Nanjing University of Technology Nanjing 210009 China State Key Lab. for Novel Software Technology Nanjing University Nanjing 210093 China

ISBN: (纸本)9781424468690

This paper, based on the existing LEACH routing algorithm, proposes a novel adaptive zone-crossed and virtual node for multi-hop routing algorithm for large-scale wireless sensor networks. At first, we introduce the concepts of "zone" and "virtual node". On this basis, an equilibrium energy routing algorithm is proposed. The purpose is to optimize multi-hop routing by shortening distance. Our simulation experiment demonstrates that, compared to the LEACH protocol, this new solution could reduce the energy consumption of cluster heads significantly, prolong the lifetime of networks and distribute dead nodes more uniformly. © 2010 IEEE.

关键词： Routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Ackermann Functions --A Survey and Empirical Study

引用

计算机科学 2002年第z1期29卷 103-105页

作者： Li Yunpeng State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing 210093 China Institute of Command PLA University of Science and Technology Nanjing 210007 China

Ackermann functions are examples of nonprimitive recursive function which grow so fast with respect to their arguments. In this paper, we present Ackermann functions in detail and introduce its influence on theoretica... 详细信息

关键词： Ackermann functions Recursive function Operators Algorithm

来源：评论

学校读者我要写书评

暂无评论

Data dependence analysis in presence of inheritance and polymorphism 4

Data dependence analysis in presence of inheritance and poly...

引用

4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000

作者： Li, Xiaoming Chen, Daoxu Xie, Li State Key Laboratory of Novel Software Technology Department of Computer Science Nanjing University Nanjing210093 China

ISBN: (纸本)0769505902

The data dependence analysis is a hard problem, particularly in the presence of data structures similar to the pointer. The inheritance and the polymorphism in object-oriented languages provide program design and software engineering with new methods. But, at the same time, they bring about more barriers to dependence analysis for object-oriented languages. This paper proposes an object-oriented data dependence analysis model, ODAM. The model can present and analyze the specific concepts in OO languages. We mainly discuss the framework and the key techniques of ODAM, including the object hierarchy graph, the merging of the read-write set and dependence analysis based on the object hierarchy graph. © 2000 IEEE.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Emotion recognition from thermal infrared images using deep Boltzmann machine

引用

Frontiers of computer science 2014年第4期8卷 609-618页

作者： Shangfei WANG Menghua HE Zhen GAO Shan HE 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 Department of Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute Troy NY 12180-3590 USA

Facial expression and emotion recognition from thermal infrared images has attracted more and more attentions in recent years. However, the features adopted in current work are either temperature statistical parameters extracted from the facial regions of interest or several hand-crafted features that are commonly used in visible spectrum. Till now there are no image features specially designed for thermal infrared images. In this paper, we propose using the deep Boltzmann machine to learn thermal features for emotion recognition from thermal infrared facial images. First, the face is located and normalized from the thermal infrared im- ages. Then, a deep Boltzmann machine model composed of two layers is trained. The parameters of the deep Boltzmann machine model are further fine-tuned for emotion recognition after pre-tralning of feature learning. Comparative experimental results on the NVIE database demonstrate that our approach outperforms other approaches using temperature statistic features or hand-crafted features borrowed from visible domain. The learned features from the forehead, eye, and mouth are more effective for discriminating valence dimension of emotion than other facial areas. In addition, our study shows that adding unlabeled data from other database during training can also improve feature learning performance.

关键词： emotion recognition thermal infrared images deep Boltzmann machine

来源：评论

学校读者我要写书评

暂无评论

Incorporating latent semantic indexing into spectral graph transducer for text classification

Incorporating latent semantic indexing into spectral graph t...

引用

21th International Florida Artificial Intelligence Research Society Conference, FLAIRS-21

作者： Xinyu, Dai Baoming, Tian Junsheng, Zhou Jiajun, Chen State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University 210093 China Department of Computer Science Nanjing Normal University 210097 China

ISBN: (纸本)9781577353652

Spectral Graph Transducer(SGT) is one of the superior graph-based transductive learning methods for classification. As for the Spectral Graph Transducer algorithm, a good graph representation for data to be processed is very important. In this paper, we try to incorporate Latent Semantic Indexing(LSI) into SGT for text classification. Firstly, we exploit LSI to represent documents as vectors in a latent semantic space since we propose that the documents and their semantic relationships can be reflected more pertinently in this latent semantic space. Then, a graph needed by SGT is constructed. In the graph, a node corresponds to a vector from LSI. Finally, we apply the graph to Spectral Graph Transducer for text classification. The experiments gave us excellent results on both English and Chinese text classification datasets and demonstrated the validation of our assumption. Copyright © 2008, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Transducers

来源：评论

学校读者我要写书评

暂无评论

Detecting source code changes to maintain the consistence of behavioral model 12

Detecting source code changes to maintain the consistence of...

引用

4th Asia-Pacific Symposium on Internetware, Internetware 2012

作者： Li, Yuankui Wang, Linzhang Li, Xuandong Cai, Yuanfang Department of Computer Science and Technology State Key Laboratory for Novel Software Technology Nanjing University China Department of Computer Science Drexel University Philadelphia PA United States

ISBN: (纸本)9781450318884

It is well-known that as software system evolves, the source code tends to deviate from its design model so that main- taining their consistence is challenging. Our objective is to detect code changes that inuence designed program be- haviour which are referred as design level changes and up- date the behavioural model timely and automatically to maintain consistence. We propose an approach that filters out low-level source code changes that do not inuence pro- gram behaviour, abstracts code changes into updating oper- ations for behavioral model, and automates the integration and update of activity diagrams to maintain consistence. We've recognised that it is not uncommon for developers to introduce quick and dirty implementation that unneces- sarily increases program complexity or introduces subopti- mal behaviour changes. So while merging code changes into behaviour model, our approach also calculates cyclometric complexity variation before and after the process so that developers can be alerted of significant and/or detrimental changes. Our tool allows the user to approve the change in code before merging and updating the model. Copyright 2012 ACM.

关键词： Merging

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：