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

ITSC 2006: 2006 IEEE Intelligent Transportation systems Conference

作者： Muhdi, Rani Garrett, Aaron Agarwal, Ravikant Davis, Jerry Dozier, Gerry Umphress, David Department of Industrial and Systems Engineering Auburn University Auburn AL 36849 United States Department of Computer Science and Software Engineering Auburn University Auburn AL 36849 United States

ISBN: (纸本)1424400945

Evacuation planning plays a significant role in building evacuation. The purpose of this paper is to demonstrate how an evolutionary computation technique in the form of an Estimation of Distribution Algorithm can be used in evacuation planning. This technique is used to evolve the number and location of exits in order to minimize overall evacuation time and reduce the number of casualties and injuries. The algorithm is applied to three day-care layouts, classified as playroom, lunchroom, and classroom settings. The algorithm generates an optimal or near-optimal configuration, and results across several trials can be used to determine the probability that an exit is needed for each possible location. The best exit configurations are presented for each of the three layouts, and a brief analysis is discussed. Although evacuation planning presented in this paper is focused on room layouts, evolutionary computation techniques have the potential to be implemented in large-scale evacuation planning. © 2006 IEEE.

关键词： Emergency traffic control

来源：评论

学校读者我要写书评

暂无评论

Resident participating GIS-based tsunami disaster control systems for local communities

Resident participating GIS-based tsunami disaster control sy...

引用

International Symposium on Communications and Information Technologies

作者： Muramoto, Takashi Nakayama, Ken Kobayashi, Yoshitake Maekawa, Mamoru Faculty of Business Hachinohe University Aomori Japan Department of Information Systems Design Graduate School of Information Systems University of Electro-Communications Tokyo Japan Grid Computing and Distributed Systems (GRIDS) Laboratory Department of Computer Science and Software Engineering University of Melbourne Australia

ISBN: (纸本)9780780397408

We propose and experiment a Social Networking Service (SNS) for local communities for tsunami disaster control. It is an easy-to-use GIS-based system with powerful GIS analysis capabilities. One of the features of the system is resident participation. The GIS layer structure proposed in this paper nicely supports this user participation. The system architecture and the use of the system for tsunami disaster control are discussed. We report ongoing developments in Hachinohe-City, Japan.

关键词： GIS tsunami disaster control internet application system design

来源：评论

学校读者我要写书评

暂无评论

Using genetic algorithms for early schedulability analysis and stress testing in real-time systems

引用

Genetic Programming and Evolvable Machines 2006年第2期7卷 145-170页

作者： Lionel C. Briand Yvan Labiche Marwa Shousha Software Quality Engineering Laboratory Department of Systems and Computer Engineering Carleton University Ottawa Canada

Reactive real-time systems have to react to external events within time constraints: Triggered tasks must execute within deadlines. It is therefore important for the designers of such systems to analyze the schedulability of tasks during the design process, as well as to test the system's response time to events in an effective manner once it is implemented. This article explores the use of genetic algorithms to provide automated support for both tasks. Our main objective is then to automate, based on the system task architecture, the derivation of test cases that maximize the chances of critical deadline misses within the system; we refer to this testing activity as stress testing. A second objective is to enable an early but realistic analysis of tasks' schedulability at design time. We have developed a specific solution based on genetic algorithms and implemented it in a tool. Case studies were run and results show that the tool (1) is effective at identifying test cases that will likely stress the system to such an extent that some tasks may miss deadlines, (2) can identify situations that were deemed to be schedulable based on standard schedulability analysis but that, nevertheless, exhibit deadline misses.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Pattern-based development of user-friendly web applications 06

Pattern-based development of user-friendly web applications

引用

Sixth International Conference on Web engineering, ICWE 2006

作者： Wentzlaff, Ina Specker, Markus University Duisburg-Essen Faculty of Engineering Department of Computer Science Software Engineering Oststraße 99 47057 Duisburg Germany University Duisburg-Essen Faculty of Engineering Department of Computer Science Interactive Systems and Interaction Design Lotharstraße 65 47057 Duisburg Germany

ISBN: (纸本)1595934359

Using patterns to preserve common problem-solving knowledge is a very popular approach. Each computer science community applies its own techniques to document engineering principles for the handling of recurring software development questions using patterns. Thus various pattern collections were evolved for dealing with specific problems of the respective community. As a result comparable patterns or redundant pattern descriptions exist in different collections leading unintentionally to a "reinvention of the wheel" time and again. Taking the development of a chat application as an example, we present an approach for integrating patterns from different software engineering disciplines. We transform problem patterns (problem frames) into solution patterns (design patterns) by using a case-based reasoning methodology to achieve a pattern-based software development process which systematically leads from natural language requirements to semi-formal near code level descriptions. We particularly consider non-functional software properties by combining design patterns of human-computer interaction (HCI) with software engineering (SE) patterns in order to support the systematic development of user-friendly software applications.

关键词： software design

来源：评论

学校读者我要写书评

暂无评论

Synchronizing without locks is inherently expensive

Synchronizing without locks is inherently expensive

引用

25th Annual ACM Symposium on Principles of Distributed Computing 2006

作者： Attiya, Hagit Hendler, Danny Guerraoui, Rachid Kouznetsov, Petr Department of Computer Science Technion Israel Faculty of Industrial Engineering and Management Technion Israel Computer Science and Artificial Intelligence Laboratory School of Computer and Communication Sciences MIT Switzerland Max Planck Institute for Software Systems Germany

ISBN: (纸本)1595933840

It has been considered bon ton to blame locks for their fragility, especially since researchers identified obstruction-freedom: a progress condition that precludes locking while being weak enough to raise the hope for good performance. This paper attenuates this hope by establishing lower bounds on the complexity of obstruction-free implementations in contention-free executions: those where obstruction-freedom was precisely claimed to be effective. Through our lower bounds, we argue for an inherent cost of concurrent computing without locks. We first prove that obstruction-free implementations of a large class of objects, using only overwriting or trivial primitives in contention-free executions, have Ω(n) space complexity and Ω(log2 n) (obstruction-free) step complexity. These bounds apply to implementations of many popular objects, including variants of fetch&add, counter, compare&swap, and LL/SC. When arbitrary primitives can be applied in contention-free executions, we show that, in any implementation of binary consensus, or any perturbable object, the number of distinct base objects accessed and memory stalls incurred by some process in a contention free execution is Ω(√n). All these results hold regardless of the behavior of processes after they become aware of contention. We also prove that, in any obstruction-free implementation of a perturbable object in which processes are not allowed to fail their operations, the number of memory stalls incurred by some process that is unaware of contention is Ω(n). Copyright 2006 ACM.

关键词： Security systems

来源：评论

学校读者我要写书评

暂无评论

Using genetic algorithms for early schedulability analysis and stress testing in real-time systems

Using genetic algorithms for early schedulability analysis a...

引用

作者： Briand, Lionel C. Labiche, Yvan Shousha, Marwa Software Quality Engineering Laboratory Department of Systems and Computer Engineering Carleton University 1125 Colonel By Drive Ottawa Ont. K1S5B6 Canada

Reactive real-time systems have to react to external events within time constraints: Triggered tasks must execute within deadlines. It is therefore important for the designers of such systems to analyze the schedulability of tasks during the design process, as well as to test the system's response time to events in an effective manner once it is implemented. This article explores the use of genetic algorithms to provide automated support for both tasks. Our main objective is then to automate, based on the system task architecture, the derivation of test cases that maximize the chances of critical deadline misses within the system;we refer to this testing activity as stress testing. A second objective is to enable an early but realistic analysis of tasks' schedulability at design time. We have developed a specific solution based on genetic algorithms and implemented it in a tool. Case studies were run and results show that the tool (1) is effective at identifying test cases that will likely stress the system to such an extent that some tasks may miss deadlines, (2) can identify situations that were deemed to be schedulable based on standard schedulability analysis but that, nevertheless, exhibit deadline misses.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Traffic-aware stress testing of distributed systems based on UML models 06

Traffic-aware stress testing of distributed systems based on...

引用

28th International Conference on software engineering 2006, ICSE '06

作者： Garousi, Vahid Briand, Lionel G. Labiche, Yvan Carleton University Department of Systems and Computer Engineering Software Quality Engineering Laboratory 1125 Colonel By Drive Ottawa Ont. K1S5B6 Canada Simula Research Laboratory Department of Software Engineering Martin Linges v 17 Fornebu 1325 Lysaker Norway

ISBN: (纸本)1595933751

A stress test methodology aimed at increasing chances of discovering faults related to network traffic in distributed systems is presented. The technique uses the UML 2.0 model of the distributed system under test, augmented with timing information, and is based on an analysis of the control flow in sequence diagrams. It yields stress test requirements that are made of specific control flow paths along with time values indicating when to trigger them. Different variants of our stress testing technique already exist (they stress different aspects of a distributed system) and we focus here on one variant that is designed to identify and to stress test the system at the instant when data traffic on a network is maximal. Using a real-world distributed system specification, we design and implement a prototype distributed system and describe, for that particular system, how the stress test cases are derived and executed using our methodology. The stress test results indicate that the technique is significantly more effective at detecting network traffic-related faults when compared to test cases based on an operational profile. Copyright 2006 ACM.

关键词： Telecommunication traffic

来源：评论

学校读者我要写书评

暂无评论

Predicting fault-prone components in a Java legacy system

Predicting fault-prone components in a Java legacy system

引用

ISCE'06 - 5th ACM-IEEE International Symposium on Empirical software engineering

作者： Arisholm, Erik Briand, Lionel C. Simula Research Laboratory Department of Software Engineering Martin Linges v 17 Fornebu 1325 Lysaker Norway Carleton University Department of Systems and Computer Engineering Software Quality Engineering Laboratory 1125 Colonel By Drive Ottawa Ont. K1S5B6 Canada

ISBN: (纸本)1595932186

This paper reports on the construction and validation of fault-proneness prediction models in the context of an object-oriented, evolving, legacy system. The goal is to help QA engineers focus their limited verification resources on parts of the system likely to contain faults. A number of measures including code quality, class structure, changes in class structure, and the history of class-level changes and faults are included as candidate predictors of class fault-proneness. A cross-validated classification analysis shows that the obtained model has less than 20% of false positives and false negatives, respectively. However, as shown in this paper, statistics regarding the classification accuracy tend to inflate the potential usefulness of the fault-proneness prediction models. We thus propose a simple and pragmatic methodology for assessing the cost-effectiveness of the predictions to focus verification effort. On the basis of the cost-effectiveness analysis we show that change and fault data from previous releases is paramount to developing a practically useful prediction model. When our model is applied to predict faults in a new release, the estimated potential savings in verification effort is about 29%. In contrast, the estimated savings in verification effort drops to 0% when history data is not included. Copyright 2006 ACM.

关键词： Fault tolerant computer systems

来源：评论

学校读者我要写书评

暂无评论

Composition of a DIDS by integrating heterogeneous IDSs on grids

Composition of a DIDS by integrating heterogeneous IDSs on g...

引用

4th International Workshop on Middleware for Grid Computing (MGC'06) held at the ACM/IFIP/USENIX International Middleware Conference

作者： Silva, Paulo F. Westphall, Carlos B. Westphall, Carla M. Assunçao, Marcos D. Network and Management Laboratory Department of Computer Science and Statistics Federal University of Santa Catarina Florianópolis Brazil Department of Computer Science and Software Engineering Grid Computing and Distributed Systems Laboratory University of Melbourne Vic. 3053 Australia

This paper considers the composition of a DIDS (Distributed Intrusion Detection System) by integrating heterogeneous IDSs (Intrusion Detection systems). A Grid middleware is used for this integration. In addition, an ... 详细信息

ISBN: (纸本)1595935819

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

Boosting for learning multiple classes with imbalances class distribution

Boosting for learning multiple classes with imbalances class...

引用

6th International Conference on Data Mining, ICDM 2006

作者： Sun, Yanmin Kamel, Mohamed S. Wang, Yang Department of Electrical and Computer Engineering University of Waterloo Waterloo Ont. Canada Pattern Discovery Software Systems Ltd. 554 Parkside Drive Waterloo Ont. Canada

ISBN: (纸本)0769527019

Classification of data with imbalanced class distribution has posed a significant drawback of the performance attainable by most standard classifier learning algorithms, which assume a relatively balanced class distribution and equal misclassification costs. This learning difficulty attracts a lot of research interests. Most efforts concentrate on bi-class problems. However, bi-class is not the only scenario where the class imbalance problem prevails. Reported solutions for bi-class applications are not applicable to multi-class problems. In this paper, we develop a cost-sensitive boosting algorithm to improve the classification performance of imbalanced data involving multiple classes. One barrier of applying the cost-sensitive boosting algorithm to the imbalanced data is that the cost matrix is often unavailable for a problem domain. To solve this problem, we apply Genetic Algorithm to search the optimum cost setup of each class. Empirical tests show that the proposed cost-sensitive boosting algorithm improves the classification performances of imbalanced data sets significantly. © 2006 IEEE.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：