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

IEEE Conference on Decision and Control

作者： X. Fu Y. Jia J. Du F. Yu Seventh Research Division and the Department of Systems and Control Beihang University Beijing China Beihang University Beijing CN Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia School of Computer Science and Technology Beijing University of Posts and Telecommunications Beijing China School of Electrical Engineering and Automation Henan Polytechnic University Jiaozuo Henan China

This paper is devoted to the problem of state estimation for a class of dynamic system with multiple nonlinear-linear (NL) mixing state constraints. A computational algorithm was developed by C. Yang and E. Blasch to incorporate a positive definite quadratic form equality constraint into the Kalman filtering for the ground vehicle tracking. However, when the target tracked in multidimensional space, a single positive definite quadratic form constraint is not enough due to the involvement of other surface such as hyperboloid, paraboloid, or even plane. A analytic method of incorporating multiple nonlinear-linear mixing state constraints into the Kalman filter is presented here, and a sufficient condition is obtained that guarantee the existence of solution. The constraints may be time varying. At each time step the unconstrained Kalman filter solution is projected onto the state constraints surface. This significantly improves the prediction accuracy of the filter. The use of this algorithm is demonstrated on a nonlinear-linear mixing spacecraft positioning problem.

关键词： Kalman filters Symmetric matrices state estimation Optimization Covariance matrix Noise

来源：评论

学校读者我要写书评

暂无评论

Aspect-Oriented Modeling and Verification with Finite state Machines

引用

Journal of computer science & technology 2009年第5期24卷 949-961页

作者：徐殿祥 Omar El-Ariss 许巍峰王林章 National Center for the Protection of the Financial Infrastructure Dakota State UniversityMadisonSD 57042 U.S.A. State Key Laboratory of Novel Software Technology Department of Computer Science and TechnologyNanjing University Department of Computer Science North Dakota State UniversityFargoND 58105 U.S.A Computer and Information Science Department Gannon University109 University SquareEriePA 16541 U.S.A

Aspect-oriented programming modularizes crosscutting concerns into aspects with the advice invoked at the specified points of program execution. Aspects can be used in a harmful way that invalidates desired properties and even destroys the conceptual integrity of programs. To assure the quality of an aspect-oriented system, rigorous analysis and design of aspects are highly desirable. In this paper, we present an approach to aspect-oriented modeling and verification with finite state machines. Our approach provides explicit notations （e.g., pointcut, advice and aspect） for capturing crosscutting concerns and incremental modification requirements with respect to class state models. For verification purposes, we compose the aspect models and class models in an aspect-oriented model through a weaving mechanism. Then we transform the woven models and the class models not affected by the aspects into FSP （Finite state Processes）, which are to be checked by the LTSA （Labeled Transition System Analyzer） model checker against the desired system properties. We have applied our approach to the modeling and verification of three aspect-oriented systems. To further evaluate the effectiveness of verification, we created a large number of flawed aspect models and verified them against the system requirements. The results show that the verification has revealed all flawed models. This indicates that our approach is effective in quality assurance of aspect-oriented state models. As such, our approach can be used for model-checking state-based specification of aspect-oriented design and can uncover some system design problems before the system is implemented.

关键词： aspect-oriented modeling finite state machines modeling verification model checking

来源：评论

学校读者我要写书评

暂无评论

Dynamical Trust Construction Schema with Fuzzy Decision in P2P Systems

引用

电子学报(英文版) 2009年第3期18卷 417-421页

作者： WANG Yang WANG Ruchuan HAN Zhijie College of Computer Science and Technology Nanjing University of Posts and Telecommunications Nanjing 210003 China Department of Computer Anhui Normal University Wuhu 241000 China State Key Laboratory for Novel Software Technology Nanjing University Nanjing 210093 China

The security problem for Peer-to-peer (P2P) systems has been gradually recognized as an important topic of P2P applications. Among existing solution for P2P security, how to establish trust relationship among peers is a key problem in demand. This paper proposes a novel dynamical trust construction schema based on fuzzy decision and Extended automated trust negotiation (EATN). The presented approach adopts fuzzy trust graph to describe the trust information in the P2P systems. Trust relationship among peers can be constructed by the combination of the fuzzy trust graph, fuzzy path search algorithm and EATN. The relevant application case indicates the schema is feasible. The simulations also show that the presented schema can improve the interactive success ratio by enhancing the trust relationship in the P2P systems.

关键词： P2P系统模糊决策建设动态信任协商信托安全解决方案信任关系认可制度

来源：评论

学校读者我要写书评

暂无评论

A decentralized storage scheme for multi-dimensional range queries over sensor networks

A decentralized storage scheme for multi-dimensional range q...

引用

15th International Conference on Parallel and Distributed Systems, ICPADS '09

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

ISBN: (纸本)9780769539003

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. © 2009 IEEE.

关键词： Sensor networks

来源：评论

学校读者我要写书评

暂无评论

TMAC: Taint-based memory protection via access control

TMAC: Taint-based memory protection via access control

引用

2009 2nd International Conference on Dependability, DEPEND 2009

作者： Lei, Wang Chen, Fang Bing, Mao Li, Xie State Key Laboratory for Novel Software Technology Department of Computer Science Nanjing University Nanjing China

ISBN: (纸本)9780769536668

Memory corruption attacks account for most parts of malicious attacks toward software security. Recently dynamic taint analysis is proposed and is gaining momentum. This proposed technique attempts to defeat attacks by checking the taintedness and integrity of pointers when accessing memory since vulnerabilities are always motivated by tainting pointers. Unfortunately, there exists some class of attacks without tainting pointers, such as array bounds violation attacks using pointers. In this paper, we propose a novel approach to defeat this kind of undetected attacks using taint-based tracking analysis. Our notion is based on the memory access control, that is, first, we will check the taintedness of the pointers when accessing memory like existing taint-based approaches, second, we will check whether or not the memory area is in the legitimate range of a pointer used to access this memory. Our implementation dose not need source code and is based on Valgrind, hence works on commodity software. To demonstrate our idea, we performed a preliminary empirical experiments, the results are quite promising: TMAC can effectively detect a wide range of attacks, and the average runtime overhead is close to Memcheck, a widely memory error detector. © 2009 IEEE.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

A hybrid approach to build prioritized pairwise interaction test suites

A hybrid approach to build prioritized pairwise interaction ...

引用

2009 International Conference on Computational Intelligence and software Engineering, CiSE 2009

作者： Chen, Xiang Gu, Qing Wang, Xinping Li, Ang Chen, Daoxu State Key Laboratory of Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing Jiangsu 210093 China

ISBN: (纸本)9781424445073

Traditional interaction testing aims to build test suites that cover all t-way interactions of inputs. But in many test scenarios, the entire test suites cannot be fully run due to the limited budget. Therefore it is necessary to take the importance of interactions into account and prioritize these tests of the test suite. In the paper, we use the hybrid approach to build prioritized pairwise interaction test suites (PITS). It adopts a one-test-at-a-time strategy to construct final test suites. But to generate a single test it firstly generates a candidate test and then applies a specific metaheuristic search strategy to enhance this test. Here we experiment four different metaheuristic search strategies. In the experiments, we compare our approach to weighted density algorithm (WDA). Meanwhile, we also analyze the effectiveness of four different search strategies and the effectiveness of the increasing iterations. Empirical results demonstrate the effectiveness of our proposed approach. ©2009 IEEE.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

Equality detection for linear arithmetic constraints

引用

Journal of Zhejiang University-science A(Applied Physics & Engineering) 2009年第12期10卷 1784-1789页

作者： Li LI Kai-duo HE Ming GU Xiao-yu SONG Department of Computer Science and Technology Tsinghua University Beijing 100084 China School of Software Tsinghua University Beijing 100084 China MOE Key Laboratory for Information System Security Beijing 100084 China Department of Electrical and Computer Engineering Portland State University Oregon 97207 USA

Satisfiability modulo theories (SMT) play a key role in verification applications. A crucial SMT problem is to combine separate theory solvers for the union of theories. In previous work, the simplex method is used to determine the solvability of constraint systems and the equalities implied by constraint systems are detected by a multitude of applications of the dual simplex method. We present an effective simplex tableau-based method to identify all implicit equalities such that the simplex method is harnessed to an irreducible minimum. Experimental results show that the method is feasible and effective.

关键词： Model checking Satisfiability modulo theories （SMT） Linear arithmetic

来源：评论

学校读者我要写书评

暂无评论

SNN - A neural network based combination of software reliability growth models

SNN - A neural network based combination of software reliabi...

引用

1st International Conference on Information science and Engineering, ICISE2009

作者： Li, Ang Gu, Qing Feng, Guang-Cheng Chen, Dao-Xu State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing China School of Computer Science and Engineering University of Aizu Japan

ISBN: (纸本)9780769538877

Applying SRGMs (software Reliability Growth Models) to real projects is a major concern in software reliability. Sometimes, it is hard to decide the best model for a specific project. Researchers have made a first step on solving this problem by combination, but the effect was limited in accuracy and adaptability. Aiming to improve the usability of the SRGMs, we propose a neural network based combination method to build accurate and adaptive SNN (Selective Neural Network) model. It avoids relying on a single model, thus reduces the risk to produce inaccurate predictions and improves the average performance in accuracy. Neural network and multi-criteria model selection strategy enable the SNN model to be adapted to various projects, producing accurate predictions. Experiment results show that the SNN model makes a notable improvement in accuracy compared with its component models and other combinational models do. ©2009 IEEE.

关键词： software reliability

来源：评论

学校读者我要写书评

暂无评论

Evolutionary Games on Weighted Newman-Watts Small-World Networks

引用

Chinese Physics Letters 2009年第5期26卷 255-258页

作者：杜文博曹先彬赵琳周宏 Department of Computer Science and Technology University of Science and Technology of China Hefei 230026 Anhui Province Key Laboratory of Software in Computing and Communication University of Science and Technology of China Hefei 230026 School of Life Sciences University of Science and Technology of China Hefei 230026

We investigate the evolutionary prisoner＇s dilemma game （PDG） on weighted Newman-Watts （NW） networks. In weighted NW networks, the link weight ωij is assigned to the link between the nodes i and j as： ωij = （ki · kj）^β, where ki（kj） is the degree of node i（j） and β represents the strength of the correlations. Obviously, the link weight can be tuned by only one parameter β. We focus on the cooperative behavior and wealth distribution in the system. Simulation results show that the cooperator frequency is promoted by a large range of β and there is a minimal cooperation frequency around β = -1. Moreover, we also employ the Gini coefficient to study the wealth distribution in the population. Numerical results show that the Gini coefficient reaches its minimum when β≈ -1. Our work may be helpful in understanding the emergence of cooperation and unequal wealth distribution in society.

关键词： PRISONER'S dilemma game COOPERATIVENESS INCOME distribution SIMULATION methods & models GINI coefficient NUMERICAL analysis

来源：评论

学校读者我要写书评

暂无评论

Comparing and evaluating collection strategies in trust-based reputation systems in distributed environments

Comparing and evaluating collection strategies in trust-base...

引用

Symposia and Workshops on Ubiquitous, Autonomic and Trusted Computing in Conjunction with the UIC'09 and ATC'09 Conferences, UIC-ATC 2009

作者： Zong, Bo Xu, Feng Pan, Jing Lv, Jian State Key Laboratory for Novel Software Technology Nanjing 210093 China Department of Computer Science and Technology Nanjing University Nanjing 210093 China

ISBN: (纸本)9780769537375

Trust-based reputation system(TBRS) provides us an excellent decision-support tool for distributed environments. TBRS quantifies the trust relationships between entities based on the information that describes the entities' past behavior, so it is significant for TBRS to guarantee the quantity, the quality and the reliability of the collected information. In distributed environments, due to the lack of a central authority that is responsible for collecting global information, it is still a challenging work to design an effective and efficient information collection(IC) strategy. A variety of TBRS have been proposed in previous papers during recent years, however, there are few works on comparing and evaluating different IC strategies in TBRS. In this paper, we propose a formal model that is mainly focused on IC strategies in TBRS, classify existing IC strategies into three categories and describe their main features respectively. We propose a simulation framework based on the formal model and implement it for comparing and evaluating the performance of different IC strategies. We analyze the results of simulation and present the strength and weakness of different IC strategies. © 2009 IEEE.

关键词： Decision support systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：