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

IEEJ Transactions on Electronics, information and systems 2010年第5期130卷 731-736页

作者： Gen, Mitsuo Kawakami, Hiroshi Tsujimura, Yasuhiro Handa, Hisashi Lin, Lin Okamoto, Azuma Fuzzy Logic Systems Institute Japan Department of System Science Graduate School of Informatics Kyoto University Japan Nippon Institute of Technology Japan Division of Industrial Innovation Sciences Graduate School of Natural Science and Technology Okayama University Japan School of Software Dalian University of Technology China Faculty of Software and Information Science Iwate Prefectural University Japan

As efficient utilization of computational resources is increasing, evolutionary technology based on the Genetic Algorithm (GA), Genetic Programming (GP), Evolution Strategy (ES) and other Evolutionary Computations (ECs) is making rapid progress, and its social recognition and the need as applied technology are increasing. This is explained by the facts that EC offers higher robustness for knowledge information processing systems, intelligent production and logistics systems, most advanced production scheduling and other various real-world problems compared to the approaches based on conventional theories, and EC ensures flexible applicability and usefulness for any unknown system environment even in a case where accurate mathematical modeling fails in the formulation. In this paper, we provide a comprehensive survey of the current state-of-the-art in the fundamentals and applications of evolutionary technologies. © 2010 The Institute of Electrical Engineers of Japan.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Robustify a job-shop schedule according to the payload of the machine

Robustify a job-shop schedule according to the payload of th...

引用

International Conference on Services systems and Services Management, ICSSSM

作者： Zhiyang You Zhigang Sun Xibin Zhao Daxin Zang Department of Computer Science and Technology Tsinghua University Beijing China School of Software Tsinghua University Beijing China Key Laboratory of Information System Security Ministry of Education School of Software Tsinghua University Beijing China Software Engineering Institute Beijing Aeronautics and Astronautics University Beijing China

Robust scheduling is an effective way to solve job-shop scheduling problem (JSP) under a dynamic and stochastic environment with uncertainties, which may lead to numerous schedule disruptions. Maintaining the optimization obtained, the robust schedule is more stable in execution. The vast majority of the researches on robust scheduling concentrate on the development of the robustness and stabilization with an optimization target that minimizes makespan. However, other optimization targets are needed in reality, and in this paper, we introduce another optimization target that maximizes the payload of the machine, which can reflect the capacity of machine. This work applies a two-step way to achieve a robust schedule. A baseline schedule in the deterministic environment is generated first, which pursues standard optimization criterions, and then the temporal buffers are inserted into the baseline schedule which make the schedule absorb some level of unexpected disruption without rescheduling. According to the payload of each machine which should be close to the maximum at any time in execution, we can get each size of the temporal buffers inserted into the different operations. An extensive experiment is used to show the relative performance of the proposed robust schedule. It is shown that the schedule is robust and stable under the stochastic disturbance coupling with minimal makespan tardiness and symmetry payload.

关键词： Robustness Payloads Job shop scheduling Uncertainty Processor scheduling Dynamic scheduling Stochastic processes Switches Computer science Space technology

来源：评论

学校读者我要写书评

暂无评论

Real time traffic congestion degree computation for minor sensorless roads using cost efficient context reasoning

Real time traffic congestion degree computation for minor se...

引用

International IEEE Conference on Intelligent Transportation systems

作者： Raphiphan, Panraphee Prathombutr, Passakon Zaslavsky, Arkady Meesad, Phayung Caulfield School of Information Technology Monash University 900 Dandenong Rd Caulfield East VIC 3145 Australia 112 Thailand Science Park Phahon Yothin Rd Pathumthani 12120 Thailand Department of Computer Science and Electrical Engineering Luleå University of Technology Luleå Sweden Centre for Distributed System and Software Engineering Monash University Australia Department of Teacher Training in Electrical Education Faculty of Technical Education King Mongkut's University of Technology North Bangkok 1518 Pibulsongkram Rd Bangsue Bangkok 10800 Thailand

ISBN: (纸本)9781424476572

Traffic congestion is the cause of pollution and economic loss. The Real time traffic state report can alleviate this problem by assisting drivers for route planning and choosing unblocked roads. More traffic information could lead to more accurate route planning and greater awareness of traffic situations and road conditions for drivers. However, investment into sensor infrastructure for small minor roads is rarely available. In this paper, we present a cost efficient approach to compute real time traffic congestion degrees for non-sensor infrastructure roads, such as small minor roads, based on context fusion and context reasoning method. Our framework intends to utilize real time acquirable context instead of relying on traffic sensory data which made our approach suitable for insufficient sensor infrastructure environment. The evaluation throughout several experimentations conducted in Bangkok has proven the feasibility of our approach. Besides, the experimental result indicated that the methodology of our experiment can be used as an alternative cost efficient tool for infrastructure investment decision making. ©2010 IEEE.

关键词： Traffic congestion

来源：评论

学校读者我要写书评

暂无评论

The Transition Between Sharp and Rounded Features and the Manipulation of Incompatible Boundary in Filling n-sided Holes

The Transition Between Sharp and Rounded Features and the Ma...

引用

International Conference on Shape Modeling and Applications

作者： Kan-Le Shi Jun-Hai Yong Peng Liu Jia-Guang Sun Jean-Claude Paul Key Laboratory of Information System Security Ministry of Education of China Beijing China Department of Computer Science and Technology Tsinghua University Beijing China Tsinghua National Laboratory for Information Science and Technology Beijing China School of Software Tsinghua University Beijing China Tsinghua University Beijing Beijing CN INRIA France

ISBN: (纸本)9781424472598;9780769540726

N-sided hole filling plays an important role in vertex blending. Piegl and Tiller presented an algorithm to interpolate the given boundary and cross-boundary derivatives in B-spline form. To deal with the incompatible cases that their algorithm cannot handle, we propose an extension method to manipulate the transition between sharp and rounded features. The algorithm first patches n crescent-shaped extended surfaces to the boundary with G 2 continuity to handle incompatibility problem in the corners. Then, we compute the inner curves and the corresponding cross-boundary derivatives fulfilling tangent and twist compatibilities. The generated B-spline Coons patches are G 1 -continuously connected exactly, and have ε-G 1 continuity with the extended surfaces. Our method improves the continuity-quality of the shape and reduces the count of the inserted knots. It can be applied to all G 0 -continuous boundary conditions without any restrictions imposed on the boundary or cross-boundary derivatives. It generates better shapes than some popular industrial modeling systems on these incompatible occasions. Some examples underline its feasibility.

关键词： Filling Spline Shape Educational technology Laboratories Computer science information science information systems Computer security information security

来源：评论

学校读者我要写书评

暂无评论

Availability based trust model of clusters for MANET

Availability based trust model of clusters for MANET

引用

International Conference on Services systems and Services Management, ICSSSM

作者： Xibin Zhao Zhiyang You Zhifeng Zhao Danning Chen Feng Peng Key Laboratory of Information System Security of Ministry of Education School of Software Tsinghua University China Department of Computer Science and Technology Tsinghua University China Zhenjiang Watercraft College Department of Computer Science Zhenjiang Watercraft College China School of Software Tsinghua University China China Minzu Securities Company Limited China

MANET (Mobile ad hoc network) is vulnerable to security attack due to its characteristics such as open network environment, lack of centralized control, dynamic topology, and so on, while traditional security mechanisms cannot meet the security requirements of MANET due to the limited communication bandwidth, computation power, memory and battery capacity, and dynamic deployment environment. Many approaches have been suggested to trade-off between the security strength and efficiency, and most of them focus on the confidentiality and integrity of MANET while pay less attention to the availability issue. Based on the analysis of availability related factors in MANET, we present an availability based trust model in this paper. Furthermore, a cluster based trust model (ABTMC, Availability Based Trust Model of Clusters) is presented with the consideration with the resource constrain of node, dynamic topology, and the unbalance of computing capability and resource capability among MANET nodes. Many availability oriented security service can be obtained based on this model.

关键词： Mobile ad hoc networks Availability Computer security Communication system security information security Communication system software Computer science Network topology Environmental management Proposals

来源：评论

学校读者我要写书评

暂无评论

DAWN: Energy efficient data aggregation in WSN with mobile sinks

DAWN: Energy efficient data aggregation in WSN with mobile s...

引用

International Workshop on Quality of Service

作者： ShaoJie Tang Jing Yuan XiangYang Li Yunhao Liu GuiHai Chen Ming Gu JiZhong Zhao Guojun Dai Department of Computer Science Illinois Institute of Technology Chicago IL USA State Key Laboratory of Novel Software Technology NanJing University NanJing China Institute of Computer Application Technology Hangzhou Dianzi University China Department of Computer Science and Engineering HKUST China Key Laboratory of Information System Security Tsinghua University China Department of Computer Science and Engineering Xi'An JiaoTong University China

The benefits of using mobile sink to prolong sensor network lifetime have been well recognized. However, few provably theoretical results remain are developed due to the complexity caused by time-dependent network topology. In this work, we investigate the optimum routing strategy for the static sensor network. We further propose a number of motion stratifies for the mobile sink(s) to gather real time data from static sensor network, with the objective to maximize the network lifetime. Specially, we consider a more realistic model where the moving speed and path for mobile sinks are constrained. Our extensive experiments show that our scheme can significantly prolong entire network lifetime and reduce delivery delay.

关键词： Energy efficiency Wireless sensor networks Routing Computer science Optical sensors Temperature sensors Laboratories Data engineering Power engineering and energy Network topology

来源：评论

学校读者我要写书评

暂无评论

QoS Requirement Generation and Algorithm Selection for Composite Service Based on Reference Vector

引用

Journal of Computer Science & technology 2009年第2期24卷 357-372页

作者：吴邦欲支志雄徐世杰顾明孙家广 School of Software Tsinghua University Key Laboratory for Information System Security Ministry of Education of China Department of Computer Science and Technology Tsinghua University

Under SOA （Service-Oriented Architecture）, composite service is formed by aggregating multiple component services together in a given workflow. One key criterion of this research topic is QoS composition. Most work on service composition mainly focuses on the algorithms about how to compose services according to assumed QoS, without considering where the required QoS comes from and the selection of user preferred composition algorithm among those with different computational cost and different selection results. In this paper, we propose to strengthen current service composition mechanism by generation of QoS requirement and its algorithm selection based on the QoS reference vectors which are calculated optimally from the existing individual services＇ QoS by registry to represent QoS overview about the best QoS, the worst （or most economical） QoS, or the average QoS of all composite services. To implement QoS requirement, which is determined according to QoS overview, this paper introduces two selection algorithms as two kinds of experiment examples, one aiming at the most accurate service selection and the other chasing for trade-off between selection cost and result. Experimental results show our mechanism can help the requester achieve his expected composite service with appropriate QoS requirement and customized selection algorithm.

关键词： service-oriented architecture service composition quality of services service selection

来源：评论

学校读者我要写书评

暂无评论

E-cost estimation using expert judgment and COCOMO II

E-cost estimation using expert judgment and COCOMO II

引用

International Symposium on information technology, ITSim

作者： Zulkefli Bin Mansor Zarinah Mohd Kasirun Noor Habibah Hj Arshad Saadiah Yahya Department of Computer Science Faculty of Industrial Information Technology Universiti Industri Selangor Selangor Darul Ehsan Malaysia Department of Software Engineering Faculty of Computer Science and Information Technology University Malaya Kuala Lumpur Malaysia System Science Studies Faculty of Computer Science and Mathematics Universiti Teknologi Mara Selangor Darul Ehsan Malaysia Computer Technology and Networking Studies Faculty of Computer Science and Mathematics Universiti Teknologi Mara Selangor Darul Ehsan Malaysia

The accuracy and efficiency of cost estimation methodology for web-based application is very important for software development as it would be able to assist the management team to estimate the cost. Furthermore, it will ensure that the development of cost is within the planned budget and provides a fundamental motivation towards the development of web-based application project. The literature review reveals that COCOMO II provides accurate result because more variables are considered including reuse parameter. The parameter is one of the essential variables in estimating the cost in web-based application development. This research investigates the feasibility to combine and implement COCOMO II and expert judgment technique in a tool called webCost. In estimating a cost, the tool considers all variables in COCOMO II and requires expert judgment to key-in the input of the variables such as project size, project type, cost adjustment factor and cost driven factor. Developed in JAVA, webCost is proven able to estimate cost and generate its estimation result. The usability evaluation conducted had shown that webCost is usable when compared with other tools, it has its own advantages. webCost is evidence suitable for everyone especially the project managers, software practitioners or software engineering student in handling the cost estimation tasks.

关键词： Variable speed drives Book reviews Estimation Accuracy Computer aided software engineering

来源：评论

学校读者我要写书评

暂无评论

Adaptability infrastructure for bridging IT security evaluation and options theory 09

Adaptability infrastructure for bridging IT security evaluat...

引用

2nd International Conference on Security of information and Networks, SIN'09

作者： Abbas, Haider Yngström, Louise Hemani, Ahmed Department of Electronic Computer and Software Systems School of Information and Communication Technology Royal Institute of Technology Sweden Department of Computer and System Sciences Stockholm University Sweden

ISBN: (纸本)9781605584126

The constantly rising threats in IT infrastructure raise many concerns for an organization, altering security requirements according to dynamically changing environment, need of midcourse decision management and deliberate evaluation of security measures are most striking. Common Criteria for IT security evaluation has long been considered to be victimized by uncertain IT infrastructure and considered resource hungry, complex and time consuming process. Considering this aspect we have continued our research quest for analyzing the opportunities to empower IT security evaluation process using Real Options thinking. The focus of our research is not only the applicability of real options analysis in IT security evaluation but also observing its implications in various domains including IT security investments and risk management. We find it motivating and worth doing to use an established method from corporate finance i.e. real options and utilize its rule of thumb technique as a road map to counter uncertainty issues for evaluation of IT products. We believe employing options theory in security evaluation will provide the intended benefits. i.e. i) manage dynamically changing security requirements ii) accelerating evaluation process iii) midcourse decision management. Having all the capabilities of effective uncertainty management, options theory follows work procedures based on mathematical calculations quite different from information security work processes. In this paper, we will address the diversities between the work processes of security evaluation and real options analysis. We present an adaptability infrastructure to bridge the gap and make them coherent with each other. This liaison will transform real options concepts into a compatible mode that provides grounds to target IT security evaluation and common criteria issues. We will address ESAM1 system as an example for illustrations and applicability of the concepts. Copyright 2009 ACM.

关键词： Risk management

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：