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

2015 International Conference on Artificial Intelligence and Industrial engineering(AIIE 2015)

作者： Rui Li Shilong Ma State Key Lab.Of Software Development Environment School of Computer Science & Engineering Beihang University

ISBN: (纸本)9781510806450

As we know, software testing is an important part of software development lifecycle. More than 50% of the whole system development work and total cost were spend on the software testing. And it's estimated that almost 60% of the total test time and cost were spent on the design of test cases. In recent years, the automated testing gradually replaces the traditional manual testing to become an important branch of software testing. In automated testing, the most important thing is to design and generate valid test case automatically. In this paper, In order to reduce the workload of testers on the test case generation, improve the test efficiency and makes test experiences be passed on, we design a common description method for the test case based on ontology;propose a semantic similarity measure method to retrieve the usable test cases from test case library based on Word Net;establish the relationship between the test case and test requirement though rules to modify the retrieved test case;generate the final test case sequence. At last, the practical applicability of the approach is evaluated through an experiment.

关键词： software testing ontology test case generation semantic similarity measure

来源：评论

学校读者我要写书评

暂无评论

Congestion-aware message forwarding in delay tolerant networks: A community perspective

Congestion-aware message forwarding in delay tolerant networ...

引用

作者： Wei, Kaimin Dong, Mianxiong Weng, Jian Shi, Guangzhou Ota, Kaoru Xu, Ke Department of Computer Science Jinan University Guangzhou China Department of Information and Electronic Engineering Muroran Institute of Technology Muroran Japan State Key Lab of Software Development Environment Beihang University Beijing China

Summary In delay tolerant networks, most of the existing message forwarding algorithms prefer to deliver messages to the nodes with a higher popularity or centrality in the hope of maximizing the delivery ratio or minimizing the end-to-end delay. This forwarding scheme is prone to cause unfair load distribution and further lead to network congestion, overlooked in the previous work. In this paper, we discuss the network congestion from a community perspective and take it into account the design of message forwarding algorithms. We first put forward a novel distributed community detection approach, which could track the evolution of communities. Based on the identified communities, we develop a congestion avoidance mechanism to divert the load away from the congested areas to the alternative custodians and further present a congestion-aware message forwarding algorithm where messages can avoid being transmitted to the congested nodes. We finally evaluate the effectiveness of distributed community detection and congestion-aware message forwarding through the extensive real-trace driven simulations. © 2015 John Wiley & Sons, Ltd.

关键词： Delay tolerant networks

来源：评论

学校读者我要写书评

暂无评论

GUIDED INTEGRAL FILTER FOR LIGHT FIELD STEREO MATCHING

GUIDED INTEGRAL FILTER FOR LIGHT FIELD STEREO MATCHING

引用

IEEE International Conference on Image Processing

作者： Hao Sheng Shuo Zhang Gengliang Zhu Zhang Xiong State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang University

ISBN: (纸本)9781479983407

Different from the traditional multi-view images, the sampling in angular resolution of light field images is continuous in each direction. Therefore, an angular sampling image, comprising of matching points extracted from each view, can be constructed at different possible depth for each point. In this paper, we prove that the angular sampling image of an occluded point at the correct depth is similar to the scene around the point. On this basis, a guided integral filter acquired from the reference view is proposed to weight the matching points for consistency measure, which predicts the probabilities of occlusions. The discrete lab.ling problem is then solved by a filter-based algorithm to approximate the optimal solution. Experimental results demonstrate that the proposed method outperforms the state-of-the-art methods for light field depth estimation both in occluded and ambiguous regions, and has no requirement for angular resolution.

关键词： Light Field Stereo Matching Depth Estimation Guided Integral Filter Occlusions Light fields ANGULAR RESOLUTION Occlusion occluding Filters Solar Terrestrial Relations Observatory images

来源：评论

学校读者我要写书评

暂无评论

Efficient Predicate Analysis of MISRAC Programs

Efficient Predicate Analysis of MISRAC Programs

引用

2015 Joint International Mechanical,Electronic and Information Technology Conference(JIMET 2015)

作者： Feng Gao Li Li Jie Luo State Key Lab of Software Development Environment Department of Computer Science and Engineering Beihang University

ISBN: (纸本)9781510817982

Great care needs to be exercised when using C within safety-related systems. MISRA-C defines a suitable subset of C to be used in safety-related software development, which is easier for program analysis. Predicate abstraction refinement is one of the leading approaches to software verification. In this paper, we propose a procedure to analyze MISRA-C program with predicate abstraction efficiently. The efficiency of this process depends on lazy abstraction and imperative predicates set, which are designed for the program abstraction and predicate refinement procedures respectively. Besides, some features have been added to obtain the desired efficiency, such as initial predicates, pointer alias analysis and so on. Experiments show that it can result in a significant reduction of analysis time and improvement of memory usage compared to earlier methods.

关键词： MISRAC 7 Predicate Abstraction 7 Lazy Abstraction 7 CEGAR 7 Imperative Predicates

来源：评论

学校读者我要写书评

暂无评论

REPRESENTATION AND AUTOMATED TRANSFORMATION OF GEOMETRIC stateMENTS

引用

Journal of Systems science & Complexity 2014年第2期27卷 382-412页

作者： CHEN Xiaoyu State Key Laboratory of Software Development Environment School of Computer Science and EngineeringBeihang University

The emergence of a large quantity of digital resources in geometry, various geometric automated theorem proving systems, and kinds of dynamic geometry software systems has made geometric computation, reasoning, drawing, and knowledge management dynamic, automatic or interactive on computer. Integration of electronic contents and different systems is desired to enhance their accessibility and exploitability. This paper proposes an equivalent transformation framework for manipulating geometric statements availab.e in the literature by using geometry software systems. Such a framework works based on a newly designed geometry description language(GDL), in which geometric statements can be represented naturally and easily. The author discusses and presents key procedures of automatically transforming GDL statements into target system-native representations for *** author also demonstrates the framework by illustrating equivalent transformation processes and interfaces for compiling the transformation results into executable formats that can be interpreted by the target geometry software systems for automated theorem proving and dynamic diagram drawing.

关键词： Automated diagram drawing equivalent transformation formalized geometric statements geometric automated theorem proving.

来源：评论

学校读者我要写书评

暂无评论

GFT-FC: a scalab.e and fault tolerance hybrid fat tree network

引用

Journal of Computational Information Systems 2015年第6期11卷 1943-1953页

作者： Qin, Guangjun Zhu, Minfa Xiao, Limin Ruan, Li State Key Laboratory of Software Development Environment Beijing China School of Computer Science and Engineering Beihang University Beijing China

Fault tolerance is an important topic in modern data centers. In a traditional fat tree network, a single failure can cause to suspend communication if the routing algorithm doesn't support a backtracking tactic, and another disadvantage is the over-provisioned or oversubscribed problem. Thus, the aim of this paper is to design a scalab.e and fault-tolerant fat tree network meeting the need of the high-performance computing and the datacenter. For the purpose, our approach is to glue multiple generalized fat tree networks using another topology. The new topology is called as GFT-X, in which X is used to denote a gluing topology. Any other topologies can be employed as an X, for example, Mesh, Torus and Cube. Viewed from another perspective, a GFT-X network is a fat tree network with sidewise-links, and one of the main goals using X is to enhance the spatial locality to reduce the communication latency. Let X be a fully connected network to get a GFT-FC network. A GFT-FC network provides s alternative links to detour a faulty point, and can tolerate s fault points. The GFT-FC network, which allows the system to hold up many different cases of failures without requiring a system reboot, is meant to be tolerant of network errors. On the other hand, the sidewise-links are also helpful to extend the network. Using the same router chip, GFT-FC can build a larger size network than a typical fat tree topology. Copyright © 2015 Binary Information Press.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

A metadata cooperative caching architecture based on SSD and DRAM for file systems 15th

A metadata cooperative caching architecture based on SSD and...

引用

15th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2015

作者： Huo, Zhisheng Xiao, Limin Zhong, Qiaoling Li, Shupan Li, Ang Ruan, Li Wang, Shouxin Fu, Lihong State Key Laboratory of Software Development Environment Beihang University Beijing100191 China School of Computer Science and Engineering Beihang University Beijing100191 China Space Star Technology Co. Ltd. Beijing100086 China

ISBN: (纸本)9783319271217

The metadata IO plays a critical role in achieving the high IO scalab.lity and throughput to file systems. Due to the resource contention, the performance of the metadata IO is low. Adding the SSD into the storage system is a effective way to improve the performance of file systems, but the current methods mainly focus on the performance of the data server, rarely aim to the performance of the metadata IO. In this paper, we proposed a novel cooperative caching management algorithm based on DRAM and SSD named ACSH. By exploiting the temporal locality widely exhibited in most of the metadata workloads, ACSH can improve the performance of the metadata IO with reducing the write traffic to the SSD, and it includes a adaptive adjustment model, which can adjust the number of the cached metadata according to the locality strength of the metadata workload for improving the perforamcne and reducing the write traffic to the SSD cache layer further. ACSH has been evaluated based on the real-world workloads. Our experiments show that ACSH can reduce the latency by up to 1.5–3X in contrast with the original cache consisting of DRAM which has the same cost with ACSH. Compared with the recent study LARC, it can reduce the write traffic to the SSD by up to 23–30 %. © Springer International Publishing Switzerland 2015.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

Smart City: key Technologies and Practices

引用

ZTE Communications 2015年第4期13卷 1-2页

作者： Jianhua Ma Weifeng Lv Faculty of Computer and Information Sciences Hosei University School of Computer Science and Engineering Beihang University the State Key Laboratory of Software Development Environment China

Ubiquitous sensors, devices, networks, and information are paving the way to smart cities in which computation and intelligence are pervasive. This enables reliable, relevant intormation and services to he accessible to all people. Smart objects, homes, hospitals, manufacturing, and systerns will eventually be present in every city.

关键词： Smart City key Technologies and Practices high

来源：评论

学校读者我要写书评

暂无评论

Vehicle association among multiple cameras 4th

Vehicle association among multiple cameras

引用

4th International Conference on Electronics, Communications and Networks, CECNet2014

作者： Sheng, Hao Zhang, Xing Li, Chao Xiong, Zhang State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang University Beijing China Wenzhou Research Institute Beihang University Wenzhou China Shenzhen Key Laboratory of Data Vitalization Research Institute in Shenzhen Beihang University Shenzhen China

ISBN: (纸本)9781138028302

In this paper, we propose an active method to associate the behaviors of the target among multiple cameras. We place a sample collection of photographed vehicles in each camera, which is captured by its own. The captured target is used to calculate a set of distance vectors with the sample collection in each camera. To improve the accuracy of distance vectors matching between images from different viewpoints, we propose a method combined color histogram and ASIFT to obtain the distance vectors. Afterwards we compute the distance of the two vectors to determine whether the targets in two cameras are the same. In no overlapping region case, there may be some mistakes among similar vehicles-the latter cameras may associate with another object which has the exact same features with the target. In this article, we use a prediction method, which utilizes spatial and temporal properties to solve this problem. © 2015 Taylor & Francis Group, London.

关键词： Cameras

来源：评论

学校读者我要写书评

暂无评论

Discovering Event Evolution Chain in Microblog

Discovering Event Evolution Chain in Microblog

引用

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Zhongyu Lu Weiren Yu Richong Zhang Jianxin Li Hua Wei State Key Laboratory of Software Development Environment School of Computer Science & Engineering Beihang University Beijing China

ISBN: (纸本)9781479989386

Microblog, such as Weibo and Twitter, has become an important platform where people share their opinions. Much research has been done to detect topics and events in microblogs. Due to the dynamic nature of events, it is more crucial to monitor the evolution and trace the development of the events. People pay more attention to the whole evolution chain of the events rather than a single event. In this paper, we propose a method to automatically discover event evolution chain in microblogs based on multiple similarity measures including contents, locations and participants. We build a 5-tuple event description model specifically for events detected from microblogs and analyze their relationships. Inverted index and locality-sensitive hashing are used to improve the efficiency of the algorithm. Experiment shows that our method gain a 143.33% speed up against method without locality-sensitive hashing. In comparison with the ground truth and a baseline method, the result illustrates that it effectively covers ground truth and outperforms the baseline method especially in dealing with the long-term spanning events.

关键词： Indexes Event detection Twitter Monitoring Atmospheric measurements Particle measurements Buildings

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：