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

Application of deterministic, stochastic, and hybrid methods for cloud provider selection

JOURNAL OF CLOUD COMPUTING-ADVANCES SYSTEMS AND APPLICATIONS 2022年第1期11卷 1-23页

作者： de Moraes, Lucas Borges Parpinelli, Rafael Stubs Fiorese, Adriano Dept Comp Sci DCC Joinville SC Brazil Grad Program Appl Comp PPGCA Joinville SC Brazil Santa Catarina State Univ UDESC Joinville SC Brazil

Cloud Computing popularization inspired the emergence of many new cloud service providers. The significant number of cloud providers available drives users to complex or even impractical choice of the most suitable one to satisfy his needs without automation. The Cloud Provider Selection (CPS) problem addresses that choice. Hence, this work presents a general approach for solving the CPS problem using as selection criteria performance indicators compliant with the Cloud Service Measurement Initiative Consortium - Service Measurement Index framework (CSMIC-SMI). To accomplish that, deterministic (CPS-Matching and CPS-DEA), stochastic (Evolutionary algorithms: CPS-GA, CPS-BDE, and CPS-DDE), and hybrid (Matching-GA, Matching-BDE, and Matching-DDE) selection optimization methods are developed and employed. The evaluation uses a synthetic database created from several real cloud provider indicator values in experiments comprising scenarios with different user needs and several cloud providers indicating that the proposed approach is appropriate for solving the cloud provider selection problem, showing promising results for a large-scale application. Particularly, comparing which approach chooses the most appropriate cloud provider the better, the hybrid one presents better results, achieving the best average hit percentage, dealing with simple and multi-cloud user requests.

关键词： Cloud provider selection problem Cloud provider ranking Evolutionary computing Natural computing Performance indicator Hybrid methods Stochastic algorithms deterministic algorithms

来源：评论

学校读者我要写书评

暂无评论

An innovative deterministic algorithm for optimal placement of micro phasor measurement units in radial electricity distribution systems

引用

COMPEL-THE INTERNATIONAL JOURNAL FOR COMPUTATION AND MATHEMATICS IN ELECTRICAL AND ELECTRONIC ENGINEERING 2022年第1期41卷 550-573页

作者： Manghutay, Aref Gholizadeh Naderi, Mehdi Salay Fathi, Seyed Hamid Amirkabir Univ Technol Dept Elect Engn Tehran Iran Amirkabir Univ Technol Iran Grid Secure Operat Res Ctr IGSORC Tehran Iran Amirkabir Univ Technol Elect Engn Dept Tehran Iran

Purpose Heuristic algorithms have been widely used in different types of optimization problems. Their unique features in terms of running time and flexibility have made them superior to deterministic algorithms. To accurately compare different heuristic algorithms in solving optimization problems, the final optimal solution needs to be known. Existing deterministic methods such as Exhaustive Search and Integer Linear Programming can provide the final global optimal solution for small-scale optimization problems. However, as the system grows the number of calculations and required memory size incredibly increases, so applying existing deterministic methods is no longer possible for medium and large-scale systems. The purpose of this paper is to introduce a novel deterministic method with short running time and small memory size requirement for optimal placement of Micro Phasor Measurement Units (mu PMUs) in radial electricity distribution systems to make the system completely observable. Design/methodology/approach First, the principle of the method is explained and the observability of the system is analyzed. Then, the algorithm's running time and memory usage when applying on some of the modified versions of the Institute of Electrical and Electronics Engineers 123-node test feeder are obtained and compared with those of its deterministic counterparts. Findings Because of the innovative method of step-by-step placement of mu PMUs, a unique method is developed. Simulation results elucidate that the proposed method has unique features of short running time and small memory size requirements. Originality/value While the mathematical background of the observability study of electricity distribution systems is very well-presented in the referenced papers, the proposed step-by-step placement method of mu PMUs, which shrinks unobservable parts of the system in each step, is not discussed yet. The presented paper is directly applicable to typical problems in the field of p

关键词： deterministic algorithms Micro phasor measurement unit (mu PMU) Optimal PMU placement (OPP) OPP search space reduction (OPPSSR) Numerical analysis Model order reduction

来源：评论

学校读者我要写书评

暂无评论

A synod based deterministic and indulgent leader election protocol for asynchronous large groups

引用

INTERNATIONAL JOURNAL OF PARALLEL EMERGENT AND DISTRIBUTED SYSTEMS 2022年第2期37卷 220-247页

作者： Srinivasan, Sathyanarayanan Kandukoori, Ramesh Natl Inst Technol Warangal Warangal Telangana India

This paper presents a deterministic and indulgent algorithm for leader election. Our algorithm is adapted to large-scale systems with the primary objective of faster execution time to elect a leader. We modify the singledecree Paxos consensus (Synod) algorithm such that proposers proposing the same value do not conflict with each other. Although any process in the system can initiate election, we restrict the decision making on electing the leader to a select set of processes A, called acceptors. For a given k (= vertical bar A vertical bar) acceptors in the system, our algorithm can tolerate up to f = inverted right perpendiculark/2 - 1inverted left perpendicular failures in A, and any number of process failures outside A. The restriction on decision making allows our algorithm to scale without compromising on performance. Experimental results show that our algorithm is faster to elect a leader than existing algorithms which are optimised for largescale systems. We also adapt our algorithm for leader election in Wireless Sensor Networks (WSNs) and Internet of Things (IoTs) and show that it performs better than the existing graph-based techniques employed in these systems. [GRAPHICS] .

关键词： Leader election deterministic algorithms indulgent algorithms synod Paxos wireless sensor networks and internet of things

来源：评论

学校读者我要写书评

暂无评论

Mobile Agents on Chordal Graphs: Maximum Independent Set and Beyond 21st

Mobile Agents on Chordal Graphs: Maximum Independent Set and...

引用

21st International Conference on Distributed Computing and Intelligent Technology

作者： Kaur, Tanvir Paul, Kaustav Mondal, Kaushik Indian Inst Thelmol Ropar Rupnagar Punjab India

ISBN: (纸本)9783031814037;9783031814044

We consider the problem of finding a maximum independent set (MaxIS) of chordal graphs using mobile agents. Suppose n agents are initially placed arbitrarily on the nodes of an n-node chordal graph G = (V, E). Agents need to find a maximum independent set M of G such that each node of M is occupied by at least one agent. Also, each of the n agents must know whether its occupied node is a part of M or not. Starting from both rooted and arbitrary initial configuration, we provide distributed algorithms for n mobile agents having O(log n) memory each to compute the MaxIS of G in O(mnlog Delta) time, where m denotes the number of edges in G and Delta is the maximum degree of the graph. Agents do not need prior knowledge of any parameters if the initial configuration is rooted. For arbitrary initial configuration, agents need to know few global parameters beforehand. We further show that using a similar approach it is possible to find the maximum clique in chordal graphs and color any chordal graph with the minimum number of colors. We also provide a dynamic programming-based approach to solve the MaxIS finding problem in trees in O(n) time.

关键词： Mobile agents Maximum Independent Set Distributed algorithms deterministic algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimal Dispersion in Triangular Grids: Achieving Efficiency Without Prior Knowledge 21st

Optimal Dispersion in Triangular Grids: Achieving Efficiency...

引用

21st International Conference on Distributed Computing and Intelligent Technology

作者： Pandit, Himani Pandit, Supantha Dhirubhai Ambani Inst Informat & Commun Technol Gandhinagar Gujarat India

ISBN: (纸本)9783031814037;9783031814044

In the dispersion problem, a group of k <= n mobile robots, initially placed on the vertices of an anonymous graph G with n vertices, must redistribute themselves so that each vertex hosts no more than one robot. We address this challenge on an anonymous triangular grid graph, where each vertex can connect to up to six adjacent vertices. We propose a distributed deterministic algorithm that achieves dispersion on an unoriented triangular grid graph in O(root n) time, where n is the number of vertices. Each robot requires O(log n) bits of memory. The time complexity of our algorithm and the memory usage per robot are optimal. This work builds on previous studies by Kshemkalyani et al. [WALCOM 2020 [17]] and Banerjee et al. [ALGOWIN 2024 [3]]. Importantly, our algorithm terminates without requiring prior knowledge of n and resolves a question posed by Banerjee et al. [ALGOWIN 2024 [3]].

关键词： Distributed algorithms Mobile robots Dispersion Triangular grid deterministic algorithms

来源：评论

学校读者我要写书评

暂无评论

Good-Case Early-Stopping Latency of Synchronous Byzantine Reliable Broadcast: The deterministic Case 36

Good-Case Early-Stopping Latency of Synchronous Byzantine Re...

引用

36th International Symposium on Distributed Computing, DISC 2022

作者： Albouy, Timothé Frey, Davide Raynal, Michel Taïani, François Univ Rennes Inria CNRS IRISA France

ISBN: (纸本)9783959772556

This paper considers the good-case latency of Byzantine Reliable Broadcast (BRB), i.e., the time taken by correct processes to deliver a message when the initial sender is correct, and an essential property for practical distributed systems. Although significant strides have been made in recent years on this question, progress has mainly focused on either asynchronous or randomized algorithms. By contrast, the good-case latency of deterministic synchronous BRB under a majority of Byzantine faults has been little studied. In particular, it was not known whether a good-case latency below the worst-case bound of t + 1 rounds could be obtained under a Byzantine majority. In this work, we answer this open question positively and propose a deterministic synchronous Byzantine reliable broadcast that achieves a good-case latency of max(2, t + 3 - c) rounds, where t is the upper bound on the number of Byzantine processes, and c the number of effectively correct processes. © Timothé Albouy, Davide Frey, Michel Raynal, and François Taïani.

关键词： Byzantine Faults deterministic algorithms Good-case latency Reliable Broadcast Synchronous Systems

来源：评论

学校读者我要写书评

暂无评论

deterministic Graph Coloring in the Streaming Model* 2022

Deterministic Graph Coloring in the Streaming Model*

引用

54th Annual ACM SIGACT Symposium on Theory of Computing (STOC)

作者： Assadi, Sepehr Chen, Andrew Sun, Glenn Rutgers State Univ New Brunswick NJ 08854 USA Cornell Univ Ithaca NY 14853 USA Univ Calif Los Angeles Los Angeles CA 90024 USA

ISBN: (纸本)9781450392648

Recent breakthroughs in graph streaming have led to design of semi-streaming algorithms for various vertex coloring problems such as (Delta+ 1)-coloring, degeneracy-coloring, coloring triangle-free graphs, and others. These algorithms are all randomized in crucial ways and whether or not there is any deterministic analogue of them has remained an important open question in this line of work. We settle this fundamental question by proving that there is no deterministic single-pass semi-streaming algorithm that given a graph.. with maximum degree Delta, can output a proper coloring of.. using any number of colors which is sub-exponential in Delta. Our proof is based on analyzing the multi-party communication complexity of a related communication game, using random graph theory type arguments that may be of independent interest. We complement our lower bound by showing that one extra pass over the input allows one to recover an O (Delta(2)) coloring via a deterministic semi-streaming algorithm. This result is extended to an O (Delta) coloring in O (log Delta) passes even in dynamic streams.

关键词： Graph coloring streaming deterministic algorithms lower bounds

来源：评论

学校读者我要写书评

暂无评论

Pebble guided optimal treasure hunt in anonymous graphs

引用

THEORETICAL COMPUTER SCIENCE 2022年 922卷 61-80页

作者： Gorain, Barun Mondal, Kaushik Nayak, Himadri Pandit, Supantha Indian Inst Technol Bhilai Raipur Madhya Pradesh India Indian Inst Technol Ropar Rupnagar Punjab India Indian Inst Informat Technol Bhagalpur India Dhirubhai Ambani Inst Informat & Commun Technol Gandhinagar Gujarat India

We study the problem of treasure hunt in a graph by a mobile agent. The nodes in the graph are anonymous and the edges at any node v of degree deg(v) are labeled arbitrarily as 0, 1,..., deg( v) - 1. A mobile agent, starting from a node, must find a stationary object, called treasurethat is located on an unknown node at a distance Dfrom its initial position. The agent finds the treasure when it reaches the node where the treasure is present. The timeof treasure hunt is defined as the number of edges the agent visits before it finds the treasure. The agent does not have any prior knowledge about the graph or the position of the treasure. An Oracle, that knows the graph, the initial position of the agent, and the position of the treasure, places some pebbles on the nodes, at most one per node, of the graph to guide the agent towards the treasure. We target to answer the question: what is the fastest possible treasure hunt algorithm regardless of the number of pebbles are placed? We show an algorithm that uses O( D log Delta) pebbles to find the treasure in a graph Gin time O( D log Delta), where Delta is the maximum degree of a node in Gand Dis the distance from the initial position of the agent to the treasure. We show a matching lower bound of Omega(D log Delta) on time of the treasure hunt using any number of pebbles. (C) 2022 Elsevier B.V. All rights reserved.

关键词： Treasure hunt Mobile agent Anonymous graph Pebbles deterministic algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on Algorithm Design and Control Strategies for Complex Systems Based on Mathematical Models

Research on Algorithm Design and Control Strategies for Comp...

引用

2024 International Conference on Power, Electrical Engineering, Electronics and Control, PEEEC 2024

作者： Guo, Lihua Shandong Business Institute Shandong Yantai264000 China

ISBN: (纸本)9798350378917

The study of algorithm design and control strategies based on mathematical models has become particularly important in the current context of increasing complex systems. The aim of this study is to explore how mathematical models can be used to design efficient algorithms and apply them to the control of complex systems. First, we provide an overview of relevant mathematical models and basic concepts and discuss their importance in algorithm design. We then delve into the design methods of deterministic, stochastic, and heuristic algorithms, and provide examples of practical applications of these methods. We then explore several commonly used control strategies for complex systems, including feedback control mechanisms, adaptive control strategies, and predictive control models. Through specific case studies, we demonstrate the effectiveness of the practical application of these strategies in industrial, environmental, and technological systems. The research results show that the algorithms designed based on mathematical models have significant advantages in complex system control and can significantly improve the stability and efficiency of the system. Finally, we summarize the main findings of the study and look ahead to possible directions for future research, suggesting further applications and developments in different fields. © 2024 IEEE.

关键词： algorithm design complex systems control strategies deterministic algorithms Mathematical modeling system dynamics

来源：评论

学校读者我要写书评

暂无评论

Generalized framework for Group Testing: Queries, feedbacks and adversaries

引用

THEORETICAL COMPUTER SCIENCE 2022年 919卷 18-35页

作者： Klonowski, Marek Kowalski, Dariusz R. Pajak, Dominik Wroclaw Univ Sci & Technol Wroclaw Poland Augusta Univ Augusta GA 30912 USA

In the Group Testing problem, the objective is to learn a subset K of some much larger domain N, using the shortest-possible sequence of queries Q. A feedback to a query provides some information about the intersection between the query and subset K. Several specific feedbacks have been studied in the literature, often proving different formulas for the estimate of the query complexity of the problem, defined as the shortest length of queries' sequence solving Group Testing problem with specific feedback. In this paper we study what are the properties of the feedback that influence the query complexity of Group Testing and what is their measurable impact. We propose a generic framework that covers a vast majority of relevant settings considered in the literature, which depends on two fundamental parameters of the feedback: input capacity alpha and output expressiveness beta. They upper bound the logarithm of the size of the feedback function domain and image, respectively. To justify the value of the framework, we prove upper bounds on query complexity of non-adaptive, deterministic Group Testing under some "efficient" feedbacks, for minimum, maximum and general expressiveness, and complement them with a lower bound on all feedbacks with given parameters alpha, beta. Our upper bounds also hold if the feedback function could get an input twisted by a malicious adversary, in case the intersection of a query and the hidden set is bigger than the feedback capacitya. We also show that slight change in the feedback function may result in substantial worsening of the query complexity. Additionally, we analyze explicitly constructed randomized counterparts of the deterministic results. Our results provide some insights to what are the most useful bits of information an output-restricted feedback could provide, and open a number of challenging research directions. (C) 2022 Elsevier B.V. All rights reserved.

关键词： Group testing Queries Feedback functions Adversaries Non-adaptive algorithms deterministic algorithms Randomized algorithms Lower bound

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：