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

Congress on Evolutionary Computation

作者： Sanyou Zeng Hui Shi Guang Chen H. de Garis Lishan Kang Lixin Ding Department of Computer Science and Technology & Research Center for Space Science Technology China University of Geoscience Wuhan China Department of Computer Science and Technology Zhuzhou Institute of Technology Zhuzhou China International School of Software Wuhan University of China Wuhan China StateKey Laboratory of Software Engineering Wuhan University of China Wuhan Hubei China

An orthogonal hill-climbing algorithm for dynamic optimization problems with continuous variables (labeled ODHC ) is proposed in present paper. The local peak climber is not a solution x, but rather a "niche", a small hyperrectangle. An orthogonal design method is employed on the niches for the niche to climb a potentially peak fast. An archive is used to store the latest found higher peaks for the ODHC algorithm learning from the past search. The randomly creating niches implement the global search. Numerical experiments show that the ODHC algorithm performs a lot better than the SOS (self organizing scouts) algorithm [J. Branke, T. Kaufler, C. Schmidt, and H. Schmeck. A multipopulation approach to dynamic optimization problems. Adaptive Computing in Design and Manufacturing. Springer, 2000.].

关键词： Heuristic algorithms Space technology Design methodology Design optimization Algorithm design and analysis Evolutionary computation computer science Organizing Optimization methods Displays

来源：评论

学校读者我要写书评

暂无评论

Understanding free/open source software development processes

引用

software Process Improvement and Practice 2006年第2期11卷 95-105页

作者： Scacchi, Walt Feller, Joseph Fitzgerald, Brian Hissam, Scott Lakhani, Karim Institute for Software Research University of California Irvine United States Business Information Systems University College Cork Ireland Computer Science and Information Systems Limerick University Ireland Software Engineering Institute Carnegie-Mellon University United States Sloan School of Management Massachusetts Institute of Technology United States

This article introduces a special issue of software Process - Improvement and Practice focusing on processes found in free or open source software development (F/OSSD) projects. It seeks to provide a background overview of research in this area through a review of selected empirical studies of F/OSSD processes. The results and findings from a survey of empirical studies of F/OSSD give rise to an interesting variety of opportunities and challenges for understanding these processes, which are identified along the way. Overall, what becomes clear is that studies of F/OSSD processes reveal a more diverse set of different types of processes than have typically been examined in conventional software development projects. The articles in this special issue further advance understanding of what processes characterize and shape F/OSSD. Copyright © 2006 John Wiley & Sons, Ltd.

关键词： software engineering

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Multi-Objective Evolutionary Algorithm Based on an Orthogonal Design

A Dynamic Multi-Objective Evolutionary Algorithm Based on an...

引用

Congress on Evolutionary Computation

作者： Sang-you Zeng Guang Chen Liang Zheng Hui Shi H. de Garis Lixin Ding Lishan Kang Department of Computer Science and Technology & Research Center for Space Science and Technology China University of Geoscience Wuhan China Department of Computer Science and Technology Zhuzhou Institute of Technology Zhuzhou China International School of Software Wuhan University of China Wuhan China StateKey Laboratory of Software Engineering Wuhan University of China Wuhan Hubei China

There are rather few articles in the literature so far that deal with dynamic multi-objective optimization problems. This article introduces a dynamic orthogonal multi-objective evolutionary algorithm called "DOMOEA", that generalizes an earlier paper of ours (on an orthogonal multi-objective evolutionary algorithm (OMOEA-II) (Zeng et al., 2005)) to dynamic environments. DOMOEA solves a particular class of dynamic multi-objective optimization problems, namely those that have continuous decision variables. This new algorithm uses the evolutionary results, before any environmental change, as the initial population after the environmental change. It applies an "orthogonal design method" to enhance the fitness of the population during the static stages between two successive changes of environment. We obtained satisfactory results when testing this algorithm against the benchmark problems proposed in the literature. Our new algorithm is based on an ordinary evolutionary algorithm that does not have the capacity to detect environmental changes. Hence it has a comparatively simple structure, making comparisons with other dynamic multi-objective evolutionary algorithms relatively easy.

关键词： Evolutionary computation Algorithm design and analysis Design optimization Space technology Design methodology Heuristic algorithms Change detection algorithms Constraint optimization computer science Convergence

来源：评论

学校读者我要写书评

暂无评论

On designing QoS for congestion control service using neural network predictive techniques

On designing QoS for congestion control service using neural...

引用

IEEE International Conference on Granular Computing (GRC)

作者： N. Xiong Y. Yang Jing He Yanxiang He School of Information Science Japan Advanced Institute of Science and Technology Japan Department of Computer Science Utah State University Logan UT USA State Key Laboratoryof Software Engineering Computer School Wuhan University of China China

来源：评论

学校读者我要写书评

暂无评论

Frameworks for Secured Business Process Management Systems

Frameworks for Secured Business Process Management Systems

引用

International Conference on software engineering Research, Management and Applications (SERA)

作者： Haeng-Kon Kim Roger Y. Lee Hae-Sool Yang Department of Computer Information & Communication Engineering Catholic University of Daegu South Korea Software Engineering & Information Technology Institute Central Michigan University USA Hoseo Graduate School of Venture South Korea

This paper formally defines a role-driven security and access control model of a business process in order eventually to provide a theoretical basis for realizing the secured business process management systems. That is, we propose a graphical representation and formal description of the mechanism that generates a set of role-driven security and access control models from a business process modeled by the information control net (ICN) modeling methodology that is a typical business process modeling approach for defining and specifying business processes. Based upon the mechanism, we are able to design and accomplish a secured business process management system that provides an unified resource access control mechanism of the business process management engine domains and the application domains. Finally, we strongly believe that the secured access control policies from the role-driven security and access control model can be easily transformed into the RBAC (role-based access control) model that is a standardized security technology for computer and communications systems of commercial and civilian government organizations

关键词： Business Access control Resource management Communication system security computer security Information security Engines Application software Communication systems Government

来源：评论

学校读者我要写书评

暂无评论

Routing Protocols for an Integrated Cellular and Ad-hoc Network with Flexible Access and Their Overhead Analysis

Routing Protocols for an Integrated Cellular and Ad-hoc Netw...

引用

International Conference on Innovative Computing, Information and Control (ICICIC)

作者： Yumin Wu Kun Yang Shaochun Zhong Wenyong Wang Jun Shen Department of Electronic Systems Engineering University of Essex Colchester UK School of Software Northeast Normal University Changchun China Department of Computer Science Beijing Institute of Technology Beijing China

This paper proposes an adaptive routing protocol called ARFA for an integrated cellular and ad hoc heterogeneous network with flexible access (iCAR-FA). An iCAR-FA system offers a flexible traffic diversion mechanism that allows a mobile host to utilize the bandwidth in another cell, as such easing the congestion problem and increasing the throughput in a cellular network. Based on the presentation of the iCAR-FA physical characteristics, the paper details the design issues and operation of ARFA. Detailed numerical analysis on routing overhead, which is along with some general evaluations, has indicated the effectiveness and efficiency of the ARFA protocol

关键词： Routing protocols Cellular networks Ad hoc networks Telecommunication traffic Land mobile radio cellular systems Bandwidth Numerical analysis Relays Frequency Systems engineering and theory

来源：评论

学校读者我要写书评

暂无评论

Facilitating global computing education through study abroad and collaborative projects 06

Facilitating global computing education through study abroad...

引用

ACM SIGCSE-SIGCUE Technical Symposium on computer Science and Education

作者： Cary Laxer Ursula Fuller Annegret Goold Alison Young Department of Computer Science and Software Engineering Rose-Hulman Institute of Technology Terre Haute IN Department of Computer Science University of Kent Canterbury U.K. School of Information Technology Deakin University Melbourne Australia School of Computing and Information Technology Unitec New Zealand Auckland New Zealand

ISBN: (纸本)9781920682347

This panel presents the results of the ITiCSE 2005 working group on facilitating student learning through study abroad and international projects. It discusses ways of adding international experiences to student learning, barriers to international learning, and how to do more. Dialogue with the attendees will broaden the discussion.

关键词： study abroad International(headers) Learning Students Education

来源：评论

学校读者我要写书评

暂无评论

Discount Anonymous On Demand Routing for Mobile Ad hoc Networks

Discount Anonymous On Demand Routing for Mobile Ad hoc Netwo...

引用

International Conference on Security and Privacy for Emerging Areas in Communications Networks (SecureComm)

作者： Liu Yang Markus Jakobsson Susanne Wetzel Software Engineering College Sichuan University Chengdu China School of Informatics Indiana University Bloomington Bloomington IN USA Department of Computer Science Stevens Institute of Technology Hoboken NJ USA

Recent years have seen a large number of proposals for anonymity mechanisms operating on the application layer. Given that anonymity is no stronger than its weakest link, such proposals are only meaningful if one can offer anonymity guarantees on the communication layer as well. ANODR - or anonymous on demand routing - is one of the leading proposals to deal with this issue. In this paper, we propose a novel technique to address the same problem, but at a lower cost. Our proposal, which we dub discount-ANODR, is built around the same set of techniques as ANODR is. Our proposal has the benefit of achieving substantially lower computation and communication complexities at the cost of a slight reduction of privacy guarantees. In particular, discount-ANODR achieves source anonymity and routing privacy. A route is "blindly generated" by the intermediaries on the path between an anonymous source and an identified destination. Route requests in discount-ANODR bear strong similarities to route requests in existing source routing protocols, with the limitation that intermediaries only know the destination of the request and the identity of the previous intermediary - but not whether the latter was the originator of the request. The response to a route request protects the compiled route by means of iterated symmetric encryption, drawing on how messages are prepared before being submitted to a typical synchronous mix network (or onion router). The communication of data subsequently uses such "route onions" to channel the packet to the intended destination. We do not use any key exchange, nor do we utilize public key operations at any time; consequently, we do not need to rely on any PKI, CRL or related constructions

关键词： Mobile ad hoc networks Proposals Costs Privacy Mobile communication Complexity theory Routing protocols Protection Cryptography Public key

来源：评论

学校读者我要写书评

暂无评论

Exploiting shared ontology with default information for web agents

引用

Scalable Computing 2006年第1期7卷 11-22页

作者： Ma, Yinglong Jin, Beihong Zhou, Mingquan Computer Sciences and Technology Department North China Electric Power University Beijing102206 China Technology Center of Software Engineering Institute of Software Chinese Academy of Sciences P. O. Box 8718 Beijing100080 China School of Information Sciences Beijing Normal University Beijing100875 China

When different agents communicate with each other, there needs to be some way to ensure that the meaning of what one agent embodies is accurately conveyed to another agent. It has been argued that ontologies play a key role in communication among different agents. However, in some situations, because there exist terminological heterogeneities and incompleteness of pieces of information among ontologies used by different agents, communication among agents will be very complex and difficult to tackle. In this paper, we proposed a solution to the problem for these situations. We used distributed description logic to model the mappings between ontologies used by different agents and further make a default extension to the DDL for default reasoning. Then, base on the default extension of the DDL model, a complete information query can be reduced to cheeking default satisfiability of the complex concept corresponding to the query. © 2006 SWPS.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

A Simulink-to-FPGA Co-Design of Encryption Module

A Simulink-to-FPGA Co-Design of Encryption Module

引用

IEEE Asia-Pacific Conference on Circuits and Systems

作者： Xiaoying Li Fuming Sun Enhua Wu Department of Computer and Information Science FST University of Macau Macao China School of Information Engineering University of Science and Technology Beijing China State Key Laboratory of Computer Science Institute of Software Chinese Academy and Sciences Beijing China

In this paper, circuit design of an arithmetic module applied to cryptography - modulo multiplicative inverse is presented and implemented using FPGA hardware technology. This modular arithmetic function contains iterative computations of division, multiplication and accumulation with variable loop times. Besides standard HDL programming and schematic input, Simulink-to-FPGA has been tried as a different design flow. Experimental results are compared between different design methods with discussion of their pros and cons

关键词： Cryptography Circuit synthesis Field programmable gate arrays Mathematical model Hardware design languages Digital signal processing Arithmetic Design methodology Flowcharts Delay

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：