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

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

来源：评论

学校读者我要写书评

暂无评论

Programming support for sensor-based scientific applications

Programming support for sensor-based scientific applications

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Nanyan Jiang Manish Parashar The Applied Software Systems Laboratory Department of Electrical and Computer Engineering Rutgers University Piscataway NJ USA

Technical advances are enabling a pervasive computational ecosystem that integrates computing infrastructures with embedded sensors and actuators, and are giving rise to a new paradigm for monitoring, understanding, and managing natural and engineered systems - one that is information/data-driven. This research investigates programming systems for sensor-driven applications. It addresses abstractions and runtime mechanisms for integrating sensor systems with computational models for scientific processes, as well as for in- network data processing, e.g., aggregation, adaptive interpolation and assimilation. The current status of this research, as well as initial results are presented.

关键词： Pervasive computing Sensor systems Ecosystems Embedded computing Actuators Monitoring engineering management Data engineering systems engineering and theory Runtime

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Integrating static checking and interactive verification: Supporting multiple theories and provers in verification

引用

1st IFIP TC 2/WG 2.3 Conference on Verified software: Theories, Tools, Experiments, VSTTE 2005

作者： Kiniry, Joseph R. Chalin, Patrice Hurlin, Clément Breunesse, Cees-Bart Charles, Julien Cok, David Jacobs, Bart Poll, Erik Ranise, Silvio Schubert, Aleksy Tinelli, Cesare Systems Research Group School of Computer Science and Informatics UCD Dublin Belfield Dublin 4 Ireland Dependable Software Research Group Department of Computer Science and Software Engineering Concordia University Montreal QC H3G 1M8 Canada Universiteé Henri Poincareé Nancy 1 BP 60120 Nancy Cedex France

ISBN: (纸本)9783540691471

Automatic verification by means of extended static checking (ESC) has seen some success in industry and academia due to its lightweight and easyto- use nature. Unfortunately, ESC comes at a cost: A host of logical and practical completeness and soundness issues. Interactive verification technology, on the other hand, is usually complete and sound, but requires a large amount of mathematical and practical expertise. Most programmers can be expected to use automatic, but not interactive, verification. The focus of this proposal is to integrate these two approaches into a single theoretical and practical framework, leveraging the benefits of each approach. © IFIP International Federation for Information Processing 2008.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Verifying and Analyzing Adaptive Logic through UML State Models

Verifying and Analyzing Adaptive Logic through UML State Mod...

引用

International Conference on software Testing, Verification, and Validation, ICST

作者： Andres J. Ramirez Betty H.C. Cheng Software Engineering and Network Systems Laboratory Department of Computer Science and Engineering Michigan State University East Lansing MI USA

It is becoming increasingly important to be able to adapt an application's behavior at run time in response to changing requirements and environmental conditions. Adaptive programs are typically difficult to specify, design, and verify. A variety of conditions may trigger an adaptation, each of which may involve different types of adaptation mechanisms. In many cases, adaptive systems are concurrent, thus further exacerbating the complexity. Furthermore, it is important that adaptations do not put the system into an inconsistent state during or after adaptation. This paper presents an iterative approach to modeling and analyzing UML behavioral design models of adaptive systems, where the UML state diagrams are automatically translated into Promela code for analysis with the Spin model checker. The adaptive models are analyzed for adherence to both system invariants and properties that should hold during adaptation. We demonstrate this approach on applications for the mobile computing domain where we verify the design models against formally-specified properties.

关键词： Unified modeling language Adaptive systems Steady-state Logic design Mobile computing Time factors Iterative methods software testing Logic testing software engineering

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Market-Oriented Cloud Computing: Vision, Hype, and Reality for Delivering IT Services as Computing Utilities

Market-Oriented Cloud Computing: Vision, Hype, and Reality f...

引用

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Rajkumar Buyya Chee Shin Yeo Srikumar Venugopal Grid Computing and Distributed Systems (GRIDS) Laboratory Department of Computer Science and Software Engineering University of Melbourne Australia

This keynote paper: presents a 21 st century vision of computing; identifies various computing paradigms promising to deliver the vision of computing utilities; defines Cloud computing and provides the architecture for creating market-oriented Clouds by leveraging technologies such as VMs; provides thoughts on market-based resource management strategies that encompass both customer-driven service management and computational risk management to sustain SLA-oriented resource allocation; presents some representative Cloud platforms especially those developed in industries along with our current work towards realising market-oriented resource allocation of Clouds by leveraging the 3rd generation Aneka enterprise Grid technology; reveals our early thoughts on interconnecting Clouds for dynamically creating an atmospheric computing environment along with pointers to future community research; and concludes with the need for convergence of competing IT paradigms for delivering our 21 st century vision.

关键词： Meteorology Cloud computing Resource management Grid computing Quality of service Industries Monitoring

来源：评论

学校读者我要写书评

暂无评论

A Negotiation Mechanism for Advance Resource Reservations Using the Alternate Offers Protocol

A Negotiation Mechanism for Advance Resource Reservations Us...

引用

International Workshop on Quality of Service

作者： Srikumar Venugopal Xingchen Chu Rajkumar Buyya Grid Computing and Distributed Systems (GRIDS) Laboratory Department of Computer Science and Software Engineering University of Melbourne Australia

ISBN: (纸本)9781424420841

Service level agreements (SLAs) between grid users and providers have been proposed as mechanisms for ensuring that the users' quality of service (QoS) requirements are met, and that the provider is able to realise utility from its infrastructure. This paper presents a bilateral protocol for SLA negotiation using the alternate offers mechanism wherein a party is able to respond to an offer by modifying some of its terms to generate a counter offer. We apply this protocol to the negotiation between a resource broker and a provider for advance reservation of compute nodes, and implement and evaluate it on a real grid system.

关键词： Protocols Resource management Contracts Grid computing Quality of service Counting circuits Proposals Streaming media computer architecture Laboratories

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：