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

IEEE International Conference on Cyber technology in Automation, Control, and Intelligent Systems

作者： Yan Zhang Xuying Zhao Xiaokun Zhang Tian Zhang Department of Computer Science and Technology Beijing Electronic Science and Technology Institute Beijing China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing China

Defect measurement is an important method in the improvement of software quality. Recent approaches of defect measurement are inappropriate to small software organizations by reason of their intricacy. This paper gives a simple approach of defect measurement, which integrates the power of product metrics with process metrics, i.e., it can not only detect the defect-prone modules, but also find the problems in the software process. This approach uses the results of successive two rounds of testing to create the test effectiveness index constructively. A case study is conducted and the results indicate that the defect-prone modules can be identified and problems of testing process can be discovered by test effectiveness index.

关键词： Testing software software measurement Organizations Indexes software engineering

来源：评论

学校读者我要写书评

暂无评论

Packet Matching Algorithm Based on Improving Differential Evolution

引用

Wuhan University Journal of Natural sciences 2012年第5期17卷 447-453页

作者： WANG Zelin WU Zhijian ZHANG Buzhong State Key Laboratory of Software Engineering Wuhan University Wuhan 430072 Hubei China School of Computer Science and Technology Nantong University Nantong 226000 Jiangsu China School of Computer and Information Anqing Teachers College Anqing 246011 Anhui China

The performance of network equipments, such as firewall, router, etc., is decided by the efficiency of patch matching. It is difficult to adapt the speed of packet matching with packets linear forwarding by traditional algorithms. The purpose of this paper is to develop a novel algorithm of packet matching based on improving differential evolutionary algorithm, which also combines with classic packets matching algorithms to improve the performance of algorithm. For the sake of objectivity, the statistics method was used to compute the fitting value. Experiments showed that this new algorithm effectively improved the performance in the speed and storage space, as compared with the traditional one. For the first time, evolutionary algorithm is used to solve the network data packet forwarding, and packets can be forwarded at the linear speed. In addition, this new algorithm is universal, so it can be adapted for many equipment.

关键词： packet matching differential evolutionary algorithm coefficient of variation

来源：评论

学校读者我要写书评

暂无评论

The dimension of the space of smooth splines of degree 8 on tetrahedral partitions

The dimension of the space of smooth splines of degree 8 on ...

引用

13th International Conference on Approximation Theory, ICAT 2010

作者： Shi, Xiquan Kamau, Ben Liu, Fengshan Yin, Baocai Department of Mathematical Sciences Delaware State University Dover DE 19901 United States Mathematics Department Columbus State University Columbus GA 31907 United States Beijing Key Laboratory of Multimedia and Intelligent Software College of Computer Science and Technology Beijing University of Technology Beijing 100022 China

ISBN: (纸本)9781461407713

Let Ω R3be a connected polyhedral domain that is allowed to con-tain polyhedral holes and Δ be a tetrahedral partition of Ω. Given 0 ≤ r ≤ d, we define. the spline space of degree d and smoothness r, where Pd is the trivariate polynomial space of total degree not exceeding d. © Springer science+Business Media, LLC 2012.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Building decision trees for the multi-class imbalance problem

Building decision trees for the multi-class imbalance proble...

引用

16th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, PAKDD 2012

作者： Hoens, T. Ryan Qian, Qi Chawla, Nitesh V. Zhou, Zhi-Hua Department of Computer Science and Engineering University of Notre Dame Notre Dame IN 46556 United States National Key Laboratory for Novel Software Technology Nanjing University Nanjing 210046 China

ISBN: (纸本)9783642302169

Learning in imbalanced datasets is a pervasive problem prevalent in a wide variety of real-world applications. In imbalanced datasets, the class of interest is generally a small fraction of the total instances, but misclassification of such instances is often expensive. While there is a significant body of research on the class imbalance problem for binary class datasets, multi-class datasets have received considerably less attention. This is partially due to the fact that the multi-class imbalance problem is often much harder than its related binary class problem, as the relative frequency and cost of each of the classes can vary widely from dataset to dataset. In this paper we study the multi-class imbalance problem as it relates to decision trees (specifically C4.4 and HDDT), and develop a new multi-class splitting criterion. From our experiments we show that multi-class Hellinger distance decision trees, when combined with decomposition techniques, outperform C4.4. © 2012 Springer-Verlag.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

A novel identity-based key management and encryption scheme for distributed system

A novel identity-based key management and encryption scheme ...

引用

4th International Symposium on Cyberspace Safety and Security, CSS 2012

作者： Yang, Geng Zhou, Qiang Xu, Xiaolong Xu, Jian Rong, Chunming College of Computer Nanjing University of Posts and Telecommunications Nanjing China College of Computer and Information Engineering Chuzhou University Chuzhou China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Department of Computer Science University of Stavanger Stavanger Norway

ISBN: (纸本)9783642353611

The paper proposes a Distributed Identity-Based Encryption (DIBE) scheme. The DIBE scheme extends the traditional IBE to a distributed system which consists of some homogenous or heterogeneous subsystems. Each subsystem has its own different master key and can communicate each other in a secure mode, instead of sharing a common master key as that in a traditional IBE scheme. The paper presents and analyzes the key distributing algorithms for a subsystem to join or leave a system, and also a user to joining or leave a subsystem. It shows that the DIBE scheme has the properties of scalability and adaptability. The paper also analyzes the security and performance of the proposed scheme, including the correctness, complexity and application examples. Some simulation results demonstrate the performance of the DIBE by using the PBC function packet. © 2012 Springer-Verlag.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

Formation learning algorithms for mobile agents subject to 2-D dynamically changing topologies

Formation learning algorithms for mobile agents subject to 2...

引用

American Control Conference

作者： Deyuan Meng Yingmin Jia Junping Du Jun Zhang Wenling Li Seventh Research Division and the Department of Systems and Control Beihang University (BUAA) Beijing 100191 P. R. China Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia School of Computer Science and Technology Beijing University of Posts and Telecommunications Beijing 100876 P. R. China School of Electronic and Information Engineering Beihang University (BUAA) Beijing 100191 P. R. China

ISBN: (纸本)9781479901777

In this paper, we consider a two-dimensional (2-D) formation problem for multi-agent systems subject to switching topologies that dynamically change along both a finite time axis and an infinite iteration axis. We present a distributed iterative learning control (ILC) algorithm via the nearest neighbor rules. By employing the 2-D approach, we develop both the asymptotic and exponentially fast convergence of our formation ILC, which can be guaranteed by conditions in terms of the spectral radius and the matrix norms, respectively.

关键词： Multi-agent systems ILC switching topologies formation learning algorithms learning algorithms Multi-agent systems International Labour Conference Mobile agents spectral radius

来源：评论

学校读者我要写书评

暂无评论

Convex and scalable weakly labeled SVMs

引用

The Journal of Machine Learning Research 2013年第1期14卷

作者： Kevin Murphy Bernhard Schölkopf Yu-Feng Li Ivor W. Tsang James T. Kwok Zhi-Hua Zhou Google MPI for Intelligent Systems National Key Laboratory for Novel Software Technology Nanjing University Nanjing China School of Computer Engineering Nanyang Technological University Singapore Department of Computer Science and Engineering Hong Kong University of Science & Technology Hong Kong

In this paper, we study the problem of learning from weakly labeled data, where labels of the training examples are incomplete. This includes, for example, (i) semi-supervised learning where labels are partially known; (ii) multi-instance learning where labels are implicitly known; and (iii) clustering where labels are completely unknown. Unlike supervised learning, learning with weak labels involves a difficult Mixed-Integer Programming (MIP) problem. Therefore, it can suffer from poor scalability and may also get stuck in local minimum. In this paper, we focus on SVMs and propose the WELLSVM via a novel label generation strategy. This leads to a convex relaxation of the original MIP, which is at least as tight as existing convex Semi-Definite Programming (SDP) relaxations. Moreover, the WELLSVM can be solved via a sequence of SVM subproblems that are much more scalable than previous convex SDP relaxations. Experiments on three weakly labeled learning tasks, namely, (i) semi-supervised learning; (ii) multi-instance learning for locating regions of interest in content-based information retrieval; and (iii) clustering, clearly demonstrate improved performance, and WELLSVM is also readily applicable on large data sets.

关键词： clustering convex relaxation cutting plane multi-instance learning semi-supervised learning weakly labeled data

来源：评论

学校读者我要写书评

暂无评论

A Sufficient and Necessary Condition for the Convergence of B(o)hm-Like Trees

A Sufficient and Necessary Condition for the Convergence of ...

引用

2012年全国理论计算机科学学术年会(NCTCS2012)

作者： Haixing Hu Nan Wu Fangmin Song State Key Laboratory for Novel Software Technology Department of Computer Science and TechnologyNanjing University Nanjing 210093 China

this paper,we introduce the definitions of B(o)hm-like trees and B(o)hm-trees,and give a sufficient and necessary condition for the convergence of B(o)hm-like *** is shown that a B(o)hm-like tree is a B(o)hm-tree of a lambda term if and only if it is recursively enumerable and has finite many free variables,but the convergence of a B(o)hm-like tree is undecidable.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Active Learning with Transfer Learning 12

Active Learning with Transfer Learning

引用

Student Research Workshop

作者： Chunyong Luo Yangsheng Ji Xinyu Dai Jiajun Chen State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing 210046 China

ISBN: (纸本)9781622765942

In sentiment classification, unlabeled user reviews are often free to collect for new products, while sentiment labels are rare. In this case, active learning is often applied to build a high-quality classifier with as small amount of labeled instances as possible. However, when the labeled instances are insufficient, the performance of active learning is limited. In this paper, we aim at enhancing active learning by employing the labeled reviews from a different but related (source) domain. We propose a framework Active Vector Rotation (AVR), which adaptively utilizes the source domain data in the active learning procedure. Thus, AVR gets benefits from source domain when it is helpful, and avoids the negative affects when it is harmful. Extensive experiments on toy data and review texts show our success, compared with other state-of-the-art active learning approaches, as well as approaches with domain adaptation.

关键词： Experiential Learning Transfer (Psychology) Data sources automatic voltage regulator New products Domain

来源：评论

学校读者我要写书评

暂无评论

Low power aging-aware register file design by duty cycle balancing 12

Low power aging-aware register file design by duty cycle bal...

引用

Design, Automation and Test in Europe Conference and Exhibition

作者： Shuai Wang Tao Jin Chuanlei Zheng Guangshan Duan State Key Laboratory of Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing Jiangsu China

ISBN: (纸本)9783981080186

The degradation of CMOS devices over the lifetime can cause the severe threat to the system performance and reliability at deep submicron semiconductor technologies. The negative bias temperature instability (NBTI) is among the most important sources of the aging mechanisms. Applying the traditional guardbanding technique to address the decreased speed of devices is too costly. Due to presence of the narrow-width values, integer register files in high-performance microprocessors suffer a very high NBTI stress. In this paper, we propose an aging-aware register file (AARF) design to combat the NBTI-induced aging in integer register files. The proposed AARF design can mitigate the negative aging effects by balancing the duty cycle ratio of the internal bits in register files. By gating the leading bits of the narrow-width values during the register accesses, our AARF can also achieve a significantly power reduction, which will further reduce the temperature and NBTI degradation of integer register files. Our experimental results show that AARF can effectively reduce the NBTI stress with a 36.9% power saving for integer register files.

关键词： Registers Stress Aging Logic gates Degradation Reliability Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：