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

Research of constructing algorithm to create D2FA

Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications 2009年第SUPPL.期32卷 40-43+48页

作者： Zhou, Hao Liu, Zhen-Hua Zhao, Bao-Hua Department of Computer Science and Technology University of Science and Technology of China Hefei 230027 China Province Key Laboratory of Software in Computing and Communication Hefei 230027 China

Delayed input deterministic finite automata (D2FA) reduces the transition edges of deterministic finite automata (DFA) by introducing default edges. The relevance between DFA (∧X) and DFA (X) is analyzed to improve the efficiency of constructing algorithm to create D2FA. A constructing algorithm is presented to create D2FA from DFA. The algorithm expresses the state of DFA (X) with the state sequence of DFA (∧X), hence the choice of default edges is relayed on the state sequence, rather than creating actual DFA (X). Experiments show that the algorithm greatly reduces the complexity of constructing D2FA, meanwhile it ensures a lower time bounds of pattern match and capacity of reducing state transition.

关键词： Finite automata

来源：评论

学校读者我要写书评

暂无评论

Coalitional Planning in Game-like Domains via ATL Model Checking

Coalitional Planning in Game-like Domains via ATL Model Chec...

引用

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： Jun Wu Chongjun Wang Lei Zhang Junyuan Xie National Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University China National Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing China

Based on the planning via model checking paradigm, we address the problem of coalitional planning in this paper. Informally, coalitional planning is the problem of planning for a subset of agents in a multi-agent system to force the whole multi-agent system to satisfy some goals. We use the language of ATL as the goal language and the semantic structure of ATL, i.e., concurrent game structure, to formalize the planning domain. We separate the concept of goal and planning object and use execution structures to interpret the goals. And then, we define a algorithm for coalitional planning and formally prove its correctness. Distinguished from the previous work, in coalitional planning all the ATL formulas can be considered as goals, thus the expressive power of ATL is sufficiently applied.

关键词： Open systems Multiagent systems Logic technology planning Power system planning Printers Process planning Artificial intelligence software tools computer science

来源：评论

学校读者我要写书评

暂无评论

Enriched gabor feature based PCA for face recognition with one training image per person

Enriched gabor feature based PCA for face recognition with o...

引用

5th International Conference on Natural Computation, ICNC 2009

作者： Lu, Wei Sun, Wei Lu, Hongtao School of Information Science and Technology Guangdong Key Laboratory of Information Security Technology Sun Yat-sen University Guangzhou 510275 China School of Software Guangdong Key Laboratory of Information Security Technology Sun Yat-sen University Guangzhou 510275 China Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200240 China

ISBN: (纸本)9780769537368

Gabor feature based classification approaches are widely used in face recognition, because they are insensitive to changes in illumination and facial expression. However, most of strategies only use the magnitude of the Gabor wavelet representation of images to generate feature vectors. When only single training image per person is available, the performance of these methods may be limited. In this paper, by making use of the slope angle as well as the magnitude of the Gabor wavelet response, we propose a novel Enriched Gabor feature based Principal Component Analysis (EGPCA) algorithm for face recognition with one training image per person. Experiment results show that the algorithm has better performance than other methods such as (PC)2A, E(PC)2A and SVD perturbation in a face recognition task when using the FERET database. © 2009 IEEE.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Internetware computing: Issues and perspective 09

Internetware computing: Issues and perspective

引用

1st Asia-Pacific Symposium on Internetware, Internetware 2009

作者： Tsai, Wei-Tek Jin, Zhi Bai, Xiaoying Department of Computer Science and Engineering Arizona State University Tempe AZ 85287 United States Tsinghua University Beijing China Key Laboratory of High Confidence Software Technologies Peking University Beijing 100871 China Department of Computer Science and Technology Tsinghua University Beijing 100084 China

ISBN: (纸本)9781605588728

The Internetware is a new initiative to develop software on the web for web applications. The open and dynamic nature of Internet applications suggest new ways of thinking will be needed for this initiative. This paper discusses several important issues in Internetware and put forward to some relevant research directions. The relevant issues include lifecycle models, ontology and context systems, modeling and simulation, social networking, and adaptive control. Copyright 2009 ACM.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Model checking CTL based on complete abstraction interpretation

引用

Jisuanji Xuebao/Chinese Journal of computers 2009年第5期32卷 992-1001页

作者： Qian, Jun-Yan Xu, Bao-Wen School of Computer and Control Guilin University of Electronic Technology Guilin 541004 China State Key Laboratory for Novel Software Technology Nanjing University Nanjing 210093 China Department of Computer Science and Technology Nanjing University Nanjing 210093 China

Abstraction plays a fundamental role in combating state-space explosion in model checking. In a complete abstract interpretation-based view, the authors reduce the state space of a Kripke structure in order to obtain a minimal abstract state translation system that strongly preserves a given temporal specification language CTL. According to a relation between completeness of abstract interpretations and strong preservation of abstract model checking, the problem of minimally refining abstract model in order to make it strongly preserving CTL can be formulated as a minimal abstract domain refinement in abstraction interpretation in order to get completeness, and this refined complete abstract domain always exists. Given initial abstract domain, we can obtain a minimal abstract domain which is complete for the standard operators of CTL by the iterative computation of the fixpoint. Moreover, the corresponding partition is the coarsest partition which is strong preserving for CTL. The authors show that the abstract domain is complete for the standard operators of CTL iff it is complete for complement and standard predecessor transformer operators.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

A Security Calculus of Concurrent Objects for Verifying Ad Hoc Network Protocols

A Security Calculus of Concurrent Objects for Verifying Ad H...

引用

International Conference on Network and System Security, NSS

作者： Qin Li Qingkai Zeng School of Computer Science Anhui University of Science and Technology China State Key Laboratory of Novel Software Technology Department of Computer Science and Technology Nanjing University China

We present a calculus of concurrent objects for specification and security analysis of ad hoc security protocols. The communicating nodes and the network are modeled by objects, while the interactions between them are modeled by asynchronous method invocations. The internal state of an object is represented by a constant method which can be overridden. The approach is complemented by a control flow analysis which can be used to automatically check properties such as security routing. The attacker model is integrated into the analysis as set values containing the knowledge of the attacker.

关键词： Calculus Ad hoc networks Routing protocols computer security Object oriented modeling computer science Telephony Automatic control Authentication Internet

来源：评论

学校读者我要写书评

暂无评论

Improvements on Teaching Methods and Contents for the "computer Organization and Architecture" Curriculum

Improvements on Teaching Methods and Contents for the "Compu...

引用

International Conference on Scalable Computing and Communications;International Conference on Embedded Computing, SCALCOM-EMBEDDEDCOM

作者： Chunfeng Yuan Yihua Huang Zhesheng Zhang Guihai Chen Wanchun Dou Department of Computer Science and Technology State Key Laboratory for Novel Software Technology Nanjing University Nanjing Jiangsu China

"computer Organization and Architecture" is one of the most important fundamental courses for those majoring in computer science and engineering. The contents of the curriculum are crucial for entire computer discipline and computer systems. As a result, the curriculum plays an important role in training computer science students. This paper begins with the discussion on principles and goals of the curriculum. Then, it describes teaching philosophy and methods, improvements of contents, along with their effects, for lectures and experiments of the curriculum. Finally we review some experiences from the development and teaching of the curriculum. This paper intends to share experiences in teaching the curriculum with other institutes in China and provide them with a potentially useful instructional model.

关键词： Education computer architecture Hardware Embedded computing computer science Operating systems computer interfaces Embedded software Program processors Instruction sets

来源：评论

学校读者我要写书评

暂无评论

Design pattern directed clustering for understanding open source code

Design pattern directed clustering for understanding open so...

引用

IEEE Workshop on Program Comprehension

作者： Zhixiong Han Linzhang Wang Liqian Yu Xin Chen Jianhua Zhao Xuandong Li State Key Laboratory of Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing Jiangsu China

Program understanding plays an important role in the maintenance and reuse of open source code. Rapid evolving and bad documentation makes the understanding and reusing difficult. Design patterns are widely employed in the open source code. In this paper, we propose a design pattern directed clustering approach to help understand the structure of open source code. According to the approach, we have implemented a prototype tool. We also conducted an experiment on an open source system to evaluate it.

关键词： Detectors Engines Visualization Open source software Documentation Prototypes Laboratories software maintenance computer science software prototyping

来源：评论

学校读者我要写书评

暂无评论

Building Prioritized Pairwise Interaction Test Suites with Ant Colony Optimization

Building Prioritized Pairwise Interaction Test Suites with A...

引用

International Conference on Quality software

作者： Xiang Chen Qing Gu Xin Zhang Daoxu Chen State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing Jiangsu China

ISBN: (纸本)9781424459124

Interaction testing offers a stable cost-benefit ratio in identifying faults. But in many testing scenarios, the entire test suite cannot be fully executed due to limited time or cost. In these situations, it is essential to take the importance of interactions into account and prioritize these tests. To tackle this issue, the biased covering array is proposed and the Weighted Density Algorithm (WDA) is developed. To find a better solution, in this paper we adopt ant colony optimization (ACO) to build this prioritized pairwise interaction test suite (PITS). In our research, we propose four concrete test generation algorithms based on Ant System, Ant System with Elitist, Ant Colony System and Max-Min Ant System respectively. We also implement these algorithms and apply them to two typical inputs and report experimental results. The results show the effectiveness of these algorithms.

关键词： Ant colony optimization software testing software quality Concrete System testing Partitioning algorithms Laboratories computer science Fault diagnosis Costs

来源：评论

学校读者我要写书评

暂无评论

A Decentralized Storage Scheme for Multi-Dimensional Range Queries over Sensor Networks

A Decentralized Storage Scheme for Multi-Dimensional Range Q...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

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

This paper presents the design of a decentralized storage scheme to support multi-dimensional range queries over sensor networks. We build a distributed k-d tree based index structure over sensor network, so as to efficiently map high dimensional event data to a two-dimensional space of sensors while preserving the proximity of events. We propose a dynamic programming based methodology to control the granularity of the index tree in an optimized approach, and an optimized routing scheme for range query processing to achieve best energy efficiency. The simulation results demonstrate the efficiency of the design.

关键词： Query processing Sensor phenomena and characterization Routing Distributed control Sensor systems Optimization methods Temperature sensors Laboratories Paper technology computer science

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：