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

International Symposium on Information Technology, ITSim

作者： Sayed Gholam Hassan Tabatabaei Wan Mohd Nasir Wan Kadir Suhaimi Ibrahim Department of Software Engineering Faculty of Computer Science and Information Systems University of Technology Skudai Johor Malaysia

Since many organizations recently decide to implement and publish their applications over Internet, the number of Web services has dramatically increased. In many cases, a single service is not sufficient to respond to the user’s request. In order to tackle this problem, services have to be combined together. Therefore, composition of Web services is one of the recent critical issues. Several approaches have been presented, to tackle this problem. In this paper, we classify these approaches into four categories namely Workflow-based, AI-planning based, Syntactic-based, and Ontology-based. Then, we describe and compare these approaches using some criteria (like QoS, scalability, and correctness). The overall results indicate that some AI-planning and Ontology based approaches like HTN-DL and WSMO satisfy most of the criteria.

关键词： Web services Planning Ontologies Calculus OWL Semantic web Protocols

来源：评论

学校读者我要写书评

暂无评论

Semantic Web Service Discovery and Composition Based on AI Planning and Web Service Modeling Ontology

Semantic Web Service Discovery and Composition Based on AI P...

引用

IEEE Asia-Pacific Conference on Services Computing (APSCC)

Web services are the preferred standards-based way to realize service oriented architecture (SOA) computing. A problem that has become one of the recent critical issues is automated composition of Web services. A number of approaches have been proposed to resolve the problem. However, discovery and composition of Web services have been neglected by majority of those approaches. In this paper, we propose an approach called AIMO, based on AI-planning and Web service modeling ontology (WSMO), which are adapted and extended to tackle the mentioned problem. Moreover, we propose a translator to provide interaction between WSMO and AI-planning. We start with presenting the AIMO architecture which shows all components of the proposed approach. Finally, a simple case study is designed to test some components of AIMO. The preliminary results of the test demonstrate that our approach provides an applicable solution.

关键词： Semantic Web Artificial intelligence Web services Ontologies Service oriented architecture Testing Process planning software systems XML software engineering

来源：评论

学校读者我要写书评

暂无评论

Improved robust 𝒟𝒰-stability measures via S-procedure

Improved robust 𝒟𝒰-stability measures via S-procedure

引用

American Control Conference (ACC)

作者： Bilal Sari Olivier Bachelier Driss Mehdi Toufic Al Chaer Languages Informatics Systems and Software Engineering Department Faculty of Computer Science University of Poitiers Poitiers France

In this paper we focus on the notion of robust matrix root-clustering analysis in a union of regions that are possibly disjoint and non symmetric. Indeed this work aims at computing a bound on the size of the uncertainty domain preserving matrix D u -stability. A Linear Fractional Transform (LFT) uncertainty is considered. To reduce conservatism, a new approach, based on some generalized S-procedure, is addressed. In the case where the studied matrices depend afflnely on the uncertain parameters or when the studied matrices are subject to polytopic uncertainty, it is known that recently developed L.M.J conditions are effective to assess the robust performance in a less conservative fashion. This paper further extends the preceding results and propose a unified way to obtain new L.M.J conditions even in the case of rational parameter dependence. Some conservatism induced by some techniques encountered in the literature is here reduced .

关键词： Robustness Uncertainty Lyapunov method Robust control Symmetric matrices Robust stability Control system synthesis Control system analysis Control systems Uncertain systems

来源：评论

学校读者我要写书评

暂无评论

A Meta-scheduler with Auction Based Resource Allocation for Global Grids

A Meta-scheduler with Auction Based Resource Allocation for ...

引用

International Conference on Parallel and Distributed systems (ICPADS)

作者： Saurabh Kumar Garg Srikumar Venugopal Rajkumar Buyya Grid Computing and Distributed Systems Laboratory Department of Computer Science and Software Engineering University of Melbourne Australia

As users increasingly require better quality of service from grids, resource management and scheduling mechanisms have to evolve in order to satisfy competing demands on limited resources. Traditional schedulers for grids are system centric and favour system performance over increasing userpsilas utility. On the other hand market oriented schedulers are price-based systems that favour users but are based solely on user valuations. This paper proposes a novel meta-scheduler that unifies the advantages of both the systems for benefiting both users and resources. In order to do that, we design a valuation metric for userpsilas applications and computational resources based on multi-criteria requirements of users and resource load. The meta-scheduler maps user applications to suitable distributed resources using a continuous double auction (CDA). Through simulation, we compare our scheduling mechanism against other common mechanisms used by current meta-schedulers. The results show that our meta-scheduler mechanism can satisfy more users than the others while still meeting traditional system-centric performance criteria such as average load and deadline of applications.

关键词： Resource management Processor scheduling Cost accounting Grid computing Computational modeling Environmental economics Laboratories computer science software engineering Quality of service

来源：评论

学校读者我要写书评

暂无评论

Random black hole particle swarm optimization and its application

Random black hole particle swarm optimization and its applic...

引用

International Conference on Neural Networks and Signal Processing

作者： Junqi Zhang Kun Liu Ying Tan Xingui He Languages Informatics Systems and Software Engineering Department Faculty of Computer Science Peking University Beijing China

ISBN: (纸本)9781424423101

This paper introduces a novel particle swarm optimization algorithm based on the concept of black holes in physics, called random black hole particle swarm optimization (RBH-PSO) for the first time. In each dimension of a particle, we randomly generate a black hole located nearest to the best particle of the swarm in current generation and then randomly pull particles of the swarm into the black hole with a probability p. By this mechanism of random black hole, we can give all the particles another interesting direction to converge as well as another chance to fly out of local minima when a premature convergence happens. Several experiments on fifteen benchmark test functions are conducted to demonstrate that the proposed RBH-PSO algorithm is able to speedup the evolution process distinctly and improve the performance of global optimizer greatly. Finally, an actual application of the proposed algorithm to spam detection is conducted then compared to other three current methods.

关键词： Benchmark testing Algorithm design and analysis Particle swarm optimization Optimization Electronic mail Convergence Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Solving Sum and Product Riddle via BDD-based model checking

Solving Sum and Product Riddle via BDD-based model checking

引用

2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT Workshops 2008

作者： Luo, Xiangyu Su, Kaile Sattar, Abdul Chen, Yan Tsinghua National Laboratory for Information Science and Technology School of Software Tsinghua University Beijing 100084 China Department of Computer Science Guilin University of Electronic Technology Guilin 541004 China School of Electronics Engineering and Computer Science Peking University Beijing 100871 China Institute for Integrated and Intelligent Systems Griffith University Brisbane QLD 4111 Australia

ISBN: (纸本)9780769534961

We model the Sum and Product Riddle inpublic announcement logic, which is interpreted on an epistemic Kripke model. The model is symbolically represented as a finite state program with n agents. A model checking method to the riddle is developed by using the BDD-based symbolic model checking algorithm for logic of knowledge we developed in [7]. The method is implemented by extending the model checker MCTK [7] and then the solution of the riddle is verified successfully. © 2008 IEEE.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Autonomic Management of Hybrid Sensor Grid systems and Applications

Autonomic Management of Hybrid Sensor Grid Systems and Appli...

引用

International Conference on computer Communications and Networks (ICCCN)

作者： Xiaolin Li Xinxin Liu Huanyu Zhao Nanyan Jiang Manish Parashar Department of Computer Science Scalable Software Systems Laboratory Oklahoma State University Stillwater OK USA Department of Electrical & Computer Engineering Applied Software Systems Laboratory Rutgers University NJ USA

In this paper, we propose an autonomic management framework (ASGrid) to address the requirements of emerging large-scale applications in hybrid grid and sensor network systems. To the best of our knowledge, we are the first who proposed the autonomic sensor grid system concept in a holistic manner targeted at non-trivial large applications. To bridge the gap between the physical world and the digital world and facilitate information analysis and decision making, ASGrid is designed to smooth the integration of sensor networks and grid systems and efficiently use both on demand. Under the blueprint of ASGrid, we present several building blocks that fulfill the following major features: (1) Self-configuration through content-based aggregation and associative rendezvous mechanisms; (2) Self-optimization through utility-based sensor selection and model-driven hierarchical sensing task scheduling; (3) Self-protection through ActiveKey dynamic key management and S3Trust trust management mechanisms. Experimental and simulation results on these aspects are presented.

关键词： Sensor systems and applications Content management Grid computing Instruments Sensor phenomena and characterization Resource management Power system management Sensor systems Waste management Application software

来源：评论

学校读者我要写书评

暂无评论

Reengineering a domain-independent framework for Spoken Dialogue systems

Reengineering a domain-independent framework for Spoken Dial...

引用

2008 software engineering, Testing, and Quality Assurance for Natural language Processing at the ACL/HLT 2008

作者： Martins, Filipe M. Mendes, Ana Viveiros, Márcio Pardal, Joana Paulo Arez, Pedro Mamede, Nuno J. Neto, João Paulo Spoken Language Systems Laboratory L2F - INESC-ID Department of Computer Science and Engineering Instituto Superior Técnico Technical University of Lisbon R. Alves Redol 9 - 2◦ Lisboa1000-029 Portugal

ISBN: (纸本)9781932432107

Our work in this area started as a research project but when L2F joined TecnoVoz, a Portuguese national consortium including Academia and Industry partners, our focus shifted to real-time professional solutions. The integration of our domain-independent Spoken Dialogue System (SDS) framework into commercial products led to a major reengineering process. This paper describes the changes that the framework went through and that deeply affected its entire architecture. The communication core was enhanced, the modules interfaces were redefined for an easier integration, the SDS deployment process was optimized and the framework robustness was improved. The work was done according to software engineering guidelines and making use of design patterns. © 2008 Association for Computational Linguistics.

关键词： Reengineering

来源：评论

学校读者我要写书评

暂无评论

Probabilistic analysis and verification of the ASW protocol using PRISM

引用

International Journal of Network Security 2008年第3期7卷 388-396页

作者： Islam, Salekul Abu Zaid, Mohammad Department of Computer Science and Software Engineering Concordia University 1455 De Maisonneuve Blvd. West Montreal QC H3G 1M8 Canada Concordia Institute for Information Systems Engineering Concordia University 1455 De Maisonneuve Blvd. West Montreal QC H3G 1M8 Canada

The ASW protocol is one of the prominent optimistic fair exchange protocols that is used for contract signing between two participants, the originator and the responder, with the aid of a trusted third party in case of a dispute. In this paper, the key security objectives of ASW protocol - fairness, effectiveness and timeliness - have been verified using a probabilistic model checking tool, PRISM. First, the security objectives of ASW protocol have been defined with probabilistic equations. The roles of the participants (i.e., the originator and the responder) and the trusted third party have been modeled in PRISM code. The security objectives of ASW protocol have been expressed using a temporal logic, PCTL. The PCTL expressions are analogous to the probabilistic equations that we have developed to define the security objectives. Next, the model is analyzed using these PCTL expressions, and different outputs have been observed. The outputs confirm the fairness of the ASW protocol. Moreover, the effectiveness and the timeliness of the protocol are also established. Hence, the key security properties of ASW protocol have been verified.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

A Linear Programming Driven Genetic Algorithm for Meta-Scheduling on Utility Grids

A Linear Programming Driven Genetic Algorithm for Meta-Sched...

引用

International Conference on Advanced Computing and Communications (ADCOM)

作者： Saurabh Garg Pramod Konugurthi Rajkumar Buyya Department of Computer Science and Software Engineering Grid Computing and Distributed Systems Laboratory CSSE University of Melbourne Australia

The user-level brokers in grids consider individual application QoS requirements and minimize their cost without considering demands from other users. This results in contention for resources and sub-optimal schedules. Meta-scheduling in grids aims to address this scheduling problem, which is NP hard due to its combinatorial nature. Thus, many heuristic-based solutions using genetic algorithm (GA) have been proposed, apart from traditional algorithms such as greedy and FCFS. We propose a Linear Programming/Integer Programming model (LP/IP) for scheduling these applications to multiple resources. We also propose a novel algorithm LPGA (linear programming driven genetic algorithm) which combines the capabilities of LP and GA. The aim of this algorithm is to obtain the best meta-schedule for utility grids which minimize combined cost of all users in a coordinated manner. Simulation results show that our proposed integrated algorithm offers the best schedule having the minimum processing cost with negligible time overheard.

关键词： Linear programming Genetic algorithms Costs Processor scheduling Grid computing Scheduling algorithm Laboratories computer science software engineering Application software

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：