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

Optimal evolutionary computational parameters for habitat structures optimization

Optimal evolutionary computational parameters for habitat st...

Earth and Space 2006 - 10th Biennial International Conference on engineering, Construction, and Operations in Challenging Environments

作者： Hull, Patrick V. Sansoucie, Michael Dozier, Gerry Tinker, Mike NASA Marshall Space Flight Center Spacecraft and Vehicle Systems Dept./EV11 Huntsville AL 35812 United States Applied Computational Intelligence Lab. Department of Computer Science Amd Software Engineering Auburn University Auburn AL 36849-5347

ISBN: (纸本)0784408300

Long-duration surface missions to the Moon and Mars will require bases to accommodate habitats for the astronauts, as well as indoor laboratory facilities, in-situ resource plants, power plants, and scientific/surface mobility equipment. Transporting the materials and equipment required to build the necessary habitats would be costly and difficult. However, the use of planetary resources to produce construction materials, or even as naturally found (such as lunar regolith utilized as an outer layer for radiation shielding, or regolith in bags as wall structure), could drastically reduce the upmass for habitats. The materials chosen for the habitat walls play a direct role in protection against each of the mentioned hazards. Choosing the best materials, their configuration, and the amount required is extremely difficult due to the immense size of the design region. For example a 3-layer habitat wall created from 20 possible materials all with varying thicknesses would have #number of layers(possible material types)∧(possible thicknesses) = 320∧inf possible solutions. Clearly, an optimization method is warranted for habitat wall design. Standard optimization techniques are not suitable for problems with such large search spaces. To overcome the large search regions, a habitat wall design tool using genetic algorithms has been developed. GAs use a "survival of the fittest" philosophy, where the most fit individuals are more likely to survive and reproduce, therefore transmitting their genes to the next generation. This paper focuses on finding optimal GA parameters for the habitat optimization tool. This tool is a multiobjective formulation of structural analysis, heat loss, radiation, and meteoroid protection. Some of the constraint calculations (i.e. safety factor, deflection, and heat loss) require long computation times. Even though each material has a designated thickness range, the number of different values within that range is near infinite;therefore, the searc

关键词： Lunar missions

来源：评论

学校读者我要写书评

暂无评论

Boosting for Learning Multiple Classes with Imbalanced Class Distribution

Boosting for Learning Multiple Classes with Imbalanced Class...

引用

IEEE International Conference on Data Mining (ICDM)

作者： Yanmin Sun Mohamed S. Kamel Yang Wang Department of Electrical and Computer Engineering University of Waterloo Waterloo ONT Canada Pattern Discovery Software Systems Limited Waterloo ONT Canada

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.

关键词： Boosting Iterative algorithms Data mining Cost function Testing Classification algorithms Sun software systems Drives software standards

来源：评论

学校读者我要写书评

暂无评论

Exploiting Data Mining Techniques for Improving the Efficiency of a Supply Chain Management Agent

Exploiting Data Mining Techniques for Improving the Efficien...

引用

Web Intelligence and Intelligent Agent Technology Workshops (WI-IAT)

作者： Andreas L. Symeonidis Vivia Nikolaidou Pericles A. Mitkas Intelligent Systems and Software Engineering Laboratory Informatics and Telematics Institute CERTH Thessaloniki Greece Electrical and Computer Engineering Department Aristotle University of Thessaloniki Thessaloniki Greece

Supply chain management (SCM) environments are often dynamic markets providing a plethora of information, either complete or incomplete. It is, therefore, evident that such environments demand intelligent solutions, which can perceive variations and act in order to achieve maximum revenue. To do so, they must also provide some sophisticated mechanism for exploiting the full potential of the environments they inhabit. Advancing on the way autonomous solutions usually deal with the SCM process, we have built a robust and highly-adaptable mechanism for efficiently dealing with all SCM facets, while at the same time incorporating a module that exploits data mining technology in order to forecast the price of the winning bid in a given order and, thus, adjust its bidding strategy. The paper presents our agent, Mertacor, and focuses on the forecasting mechanism it incorporates, aiming to optimal agent efficiency

关键词： Data mining Supply chain management Intelligent agent Delta modulation Supply chains Robustness Manufacturing Assembly Data engineering Intelligent systems

来源：评论

学校读者我要写书评

暂无评论

GeneCity: A Multi Agent Simulation Environment for Hereditary Diseases

GeneCity: A Multi Agent Simulation Environment for Hereditar...

引用

ACS/IEEE International Conference on computer systems and Applications

作者： D.G. Eliades A.L. Symeonidis P.A. Mitkas Electrical and Computer Engineering Department Aristotle University of Thessaloniki Thessaloniki Greece Intelligent Systems and Software Engineering Laboratory Informatics and Telematics Institute CERTH Thessaloniki Greece

来源：评论

学校读者我要写书评

暂无评论

Eliminating execution overhead of disabled optional features in connectors 1

引用

3rd European Workshop on software Architecture, EWSA 2006

作者： Bulej, LubomÍr Bure Š, TomÁš Distributed Systems Research Group Department of Software Engineering Charles University Malostranské nám. 25 Prague118 00 Czech Republic Institute of Computer Science Academy of Sciences of the Czech Republic Pod Vodárenskou věží 2 Prague182 07 Czech Republic

ISBN: (数字)9783540692720

ISBN: (纸本)9783540692713

Connectors are used to realize component interactions in component systems. Apart from their primary function, which is mediating the communication, their implementation can also support additional features that, while unrelated to the primary function, may benefit from their placement in connectors. Such features are often optional in the sense that they can be activated and deactivated at run-time. The problem is that even if they are disabled, their very presence in the connector incurs certain overhead. In this paper, we describe an approach to eliminate this overhead by reconfiguration of the connector implementation. Besides connectors, the approach is applicable to similar technologies such as reflective middleware and other architecture-based component systems and frameworks. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

Using Program Slicing to Identify Faults in software:

Using Program Slicing to Identify Faults in Software:

引用

Beyond Program Slicing 2005

作者： Black, Sue Counsell, Steve Hall, Tracy Wernick, Paul Centre for Systems and Software Engineering London South Bank University 103 Borough Road LondonSE1 0AA United Kingdom Department of Information Systems and Computing Brunel University Middlesex UxbridgeUB8 3PH United Kingdom School of Computer Science University of Hertfordshire Herts Hatfield United Kingdom

This study explores the relationship between program slices and faults. The aim is to investigate whether the characteristics of program slices can be used to identify faultprone software components. Slicing metrics and dependence clusters are used to characterise the slicing profile of a software component, then the relationship between the slicing profile of the component and the faults in that component are then analysed. Faults can increase the likelihood of a system becoming unstable causing problems for the development and evolution of the system. Identifying faultprone components is difficult and reliable predictors of fault-proneness not easily identifiable. Program slicing is an established software engineering technique for the detection and correction of specific faults. An investigation is carried out into whether the use of program slicing can be extended as a reliable tool to predict fault-prone software components. Preliminary results are promising suggesting that slicing may offer valuable insights into fault-proneness. © 2006 Dagstuhl Seminar Proceedings. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Simplification and analysis of transitive trust networks

引用

Web Intelligence and Agent systems 2006年第2期4卷 139-161页

作者： Jøsang, Audun Gray, Elizabeth Kinateder, Michael School of Software Engineering and Data Communications Queensland University of Technology Australia Computer Science Department Trinity College Dublin Ireland Institute of Parallel and Distributed Systems Faculty of Computer Science University of Stuttgart Germany

When transacting and interacting through open computer networks, traditional methods used in the physical world for establishing trust can no longer be used. Creating virtual network substitutes with which people, organisations and software agents can derive trust in other parties requires computerised analysis of the underlying trust networks. This article describes an approach to trust network analysis using subjective logic (TNA-SL), that consists of the three following elements. Firstly it uses a concise notation with which trust transitivity and parallel combination of trust paths can be expressed. Secondly it defines a method for simplifying complex trust networks so that they can be expressed in this concise form. Finally it allows trust measures to be expressed as beliefs, so that derived trust can be automatically and securely computed with subjective logic. We compare our approach with trust derivation algorithms that are based on normalisation such as PageRank and EigenTrust. We also provide a numerical example to illustrates how TNA-SL can be applied. © 2006 - IOS Press and the authors. All rights reserved.

关键词： computer networks

来源：评论

学校读者我要写书评

暂无评论

A Unified Ontology-Based Process Model for software Maintenance and Comprehension 06

A Unified Ontology-Based Process Model for Software Maintena...

引用

Workshop and Symposia at MoDELS 2006

作者： Juergen Rilling Yonggang Zhang Wen Jun Meng René Witte Volker Haarslev Philippe Charland Department of Computer Science and Software Engineering Concordia University Montreal Canada System of Systems Section Defence R&D Canada Valcartier Canada

ISBN: (纸本)9783540694885

In this paper, we present a formal process model to support the comprehension and maintenance of software systems. The model provides a formal ontological representation that supports the use of reasoning services across different knowledge resources. In the presented approach, we employ our Description Logic knowledge base to support the maintenance process management, as well as detailed analyses among resources, e.g., the traceability between various software artifacts. The resulting unified process model provides users with active guidance in selecting and utilizing these resources that are context-sensitive to a particular comprehension task. We illustrate both, the technical foundation based on our existing SOUND environment, as well as the general objectives and goals of our process model.

关键词： software maintenance process modeling ontological reasoning software comprehension traceability text mining

来源：评论

学校读者我要写书评

暂无评论

A Context-Driven software Comprehension Process Model

A Context-Driven Software Comprehension Process Model

引用

International IEEE Workshop on software Evolvability

作者： Wen Jun Meng Juergen Rilling Yonggang Zhang Rene Witte Sudhir Mudur Philippe Charland Department of Computer Science and Software Engineering Concordia University Montreal Canada System of Systems Section Defence Research and Development Canada Val-Belair QUE Canada

ISBN: (纸本)9780769526980;0769526980

Comprehension is an essential part of software evolution. Only software that is well understood can evolve in a controlled manner. In this paper, we present a formal process model to support the comprehension of software systems by using ontology and description logic. This formal representation supports the use of reasoning services across different knowledge resources and therefore, enables us to provide users with guidance during the comprehension process that is context sensitive to their particular comprehension task. As part of the process model, we also adopt a new interactive story metaphor, to represent the interactions between users and the comprehension process

关键词： Context modeling Ontologies Logic software maintenance Information resources computer science software engineering Research and development software systems Context-aware services

来源：评论

学校读者我要写书评

暂无评论

GSAF: A Grid-based Services Transfer Framework

GSAF: A Grid-based Services Transfer Framework

引用

IEEE International Conference on Industrial Informatics (INDIN)

作者： Jun Tang Chunyan Miao Qifeng Lin Mi Zhang Wei Wang Baile Shi Department of Computing Information and Technology Fudan University China Divisions of Software Systems School of Computer Engineering Nanyang Technological University Singapore E-Business Research Center Software School Fudan University China

In recent years, traditional computing systems face the problems of scalability as the need for information processing services is ever increasing. Grid, as a pool of computing resources, solves the problem in some degree by providing an integrated computing and resources environment. Thus, there emerge many strategies related to grid resource allocation management (GRAM). However, almost all of these strategies focus on how to allocate the existing computing resources but overlook the possibility of controlling these resources. Therefore, services and computing nodes are always tightly coupled. In this paper, we describe a new framework called GSAF (a grid-based services transfer framework) to solve the problem. GSAF binds services and computing nodes dynamically through services migration and service cache to break the tight coupling. The migration of service components to more efficient computing nodes helps balance the processing burden and extends the computing abilities. In our experiment, we provide a prototype application of GSAF in the data mining system to demonstrate it.

关键词： Grid computing Resource management Containers Prototypes Data mining Runtime software systems Face Scalability Information processing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：