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

Discrete versus Continuous algorithms in dynamics of Affective Decision Making

algorithms 2023年第9期16卷 416-416页

作者： Yukalov, Vyacheslav I. Yukalova, Elizaveta P. Joint Inst Nucl Res Bogolubov Lab Theoret Phys Dubna 141980 Russia Univ Sao Paulo Inst Fis Sao Carlos CP 369 BR-13560970 Sao Carlos Brazil Joint Inst Nucl Res Lab Informat Technol Dubna 141980 Russia

The dynamics of affective decision making is considered for an intelligent network composed of agents with different types of memory: long-term and short-term memory. The consideration is based on probabilistic affective decision theory, which takes into account the rational utility of alternatives as well as the emotional alternative attractiveness. The objective of this paper is the comparison of two multistep operational algorithms of the intelligent network: one based on discrete dynamics and the other on continuous dynamics. By means of numerical analysis, it is shown that, depending on the network parameters, the characteristic probabilities for continuous and discrete operations can exhibit either close or drastically different behavior. Thus, depending on which algorithm is employed, either discrete or continuous, theoretical predictions can be rather different, which does not allow for a uniquely defined description of practical problems. This finding is important for understanding which of the algorithms is more appropriate for the correct analysis of decision-making tasks. A discussion is given, revealing that the discrete operation seems to be more realistic for describing intelligent networks as well as affective artificial intelligence.

关键词： dynamic algorithms affective decision making dynamic decision making affective artificial intelligence probabilistic networks intelligent networks

来源：评论

学校读者我要写书评

暂无评论

The effect of delays in the Economic Dispatch Problem for smart grid architectures

The effect of delays in the Economic Dispatch Problem for sm...

引用

American Control Conference

作者： Christoforos Somarakis Dipankar Maity John S. Baras Applied Mathematics Dept. The Institute for Systems Research University of Maryland College Park 20742 USA Electrical & Computer Engineering Dept. The Institute for Systems Research University of Maryland College Park 20742 USA

ISBN: (纸本)9781467386838

We consider the Economic Dispatch Problem (EDP) in power systems for a smart-grid friendly environment. We develop a consensus based decentralized optimization algorithm that evolves in a time-varying communication network that suffers from multiple propagation time-dependent delays. This paper, being an improvisation of an earlier work of ours, addresses the effects of time dependent delays in a fully decentralized network. We show analytically and by simulation that propagation delays may not only affect the performance of the dynamic algorithm that solves the EDP but can also destabilize the system.

关键词： Delays Heuristic algorithms Optimization Generators Mathematical model Stability analysis Smart grids Smart grids Heuristic algorithms dynamos delay Stability analysis Mathematical Model Electronic Data Processing Dispatching dynamic algorithms Propagation delay Improvisation networks(communications)

来源：评论

学校读者我要写书评

暂无评论

First-Order Logic with Counting At Least, Weak Hanf Normal Forms Always Exist and Can Be Computed! 17

First-Order Logic with Counting At Least, Weak Hanf Normal F...

引用

Annual ACM/IEEE Symposium on Logic in Computer Science

作者： Dietrich Kuske Nicole Schweikardt TU Ilmenau Humboldt-Universitat zu Berlin

ISBN: (纸本)9781509030194

We introduce the logic FOCN(P) which extends first-order logic by counting and by numerical predicates from a set P, and which can be viewed as a natural generalisation of various counting logics that have been studied in the literature. We obtain a locality result showing that every FOCN(P)-formula can be transformed into a formula in Hanf normal form that is equivalent on all finite structures of degree at most d. A formula is in Hanf normal form if it is a Boolean combination of formulas describing the neighbourhood around its tuple of free variables and arithmetic sentences with predicates from P over atomic statements describing the number of realisations of a type with a single centre. The transformation into Hanf normal form can be achieved in time elementary in d and the size of the input formula. From this locality result, we infer the following applications: (1)The Hanf-locality rank of first-order formulas of bounded quantifier alternation depth only grows polynomially with the formula size. (2)The model checking problem for the fragment FOC(P) of FOCN(P) on structures of bounded degree is fixed-parameter tractable (with elementary parameter dependence). (3)The query evaluation problem for fixed queries from FOC(P) over fully dynamic databases of degree at most d can be solved efficiently: there is a dynamic algorithm that can enumerate the tuples in the query result with constant delay, and that allows to compute the size of the query result and to test if a given tuple belongs to the query result within constant time after every database update.

关键词： FOCN(P) Hanf normal transformation formula tuple Formal logic FIRST ORDER dynamic algorithms Normal

来源：评论

学校读者我要写书评

暂无评论

Lattice Data Analytics: The Poset of Irreducibles and the MacNeille Completion

Lattice Data Analytics: The Poset of Irreducibles and the Ma...

引用

IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems

作者： George Markowsky Linda Markowsky Missouri Science & Technology University of Maine

ISBN: (纸本)9781728140704

Automated and semi-automated systems that derive actionable information from massive, heterogeneous datasets are essential for many applications. The reasoning of such systems must be as clear as possible in order to earn our trust. Lattices have begun to play a key role in computer science finding applications in distributed computing, programming languages, concurrency theory, and data mining, thereby justifying G. C. Rota's belief that lattice theory will play an important role in 21st Century mathematics. In some instances, researchers must deal with posets that are not necessarily lattices and the question arises how these posets can be embedded in lattices. A classic way to answer this question is to construct the MacNeille completion of the lattice, which is the most compact way to embed a poset into a lattice. In 1973 G. Markowsky introduced the poset of irreducibles construction in his dissertation and demonstrated that this was a very compact way to represent a lattice. In addition, the poset of irreducibles has many of the properties of the poset of join-irreducibles of distributive lattices that was introduced by G. Birkhoff and described in his book. In this paper, we show how to construct the poset of irreducibles for the MacNeille completion of a poset efficiently. We conclude with some applications of these ideas.

关键词： Poset of irreducibles Lattice data analytics MacNeille completion dynamic algorithms Poset dynamic algorithms crystal lattices Completion lattice theory

来源：评论

学校读者我要写书评

暂无评论

Improved Deterministic algorithms for Decremental Reachability and Strongly Connected Components

引用

ACM TRANSACTIONS ON algorithms 2013年第3期9卷 27-27页

作者： Lacki, Jakub Univ Warsaw Inst Informat PL-02097 Warsaw Poland

This article presents a new deterministic algorithm for decremental maintenance of the transitive closure in a directed graph. The algorithm processes any sequence of edge deletions in O(mn) time and answers queries in constant time. Previously, such time bound has only been achieved by a randomized Las Vegas algorithm. In addition to that, a few decremental algorithms for maintaining strongly connected components are shown, whose time complexity is O(n(1.5)) for planar graphs, O(n log n) for graphs with bounded treewidth and O(mn) for general digraphs.

关键词： algorithms dynamic algorithms decremental algorithms graph algorithms graphs strongly connected components transitive closure

来源：评论

学校读者我要写书评

暂无评论

Adaptive Clustering and CSI Acquisition for FDD Massive MIMO Systems with Two-level Precoding

Adaptive Clustering and CSI Acquisition for FDD Massive MIMO...

引用

IEEE Wireless Communications and Networking Conference

作者： Apostolos Destounis Marco Maso Mathematical and Algorithmic Sciences Lab Huawei Technologies France Research Center

ISBN: (纸本)9781467398152

In this paper, we target a massive multiple-input/multiple-output (MIMO) system operating in frequency-division duplexing (FDD) mode, assuming the adoption of a two-level linear precoding strategy at the BS. We propose a novel strategy to effectively acquire the channel state information (CSI) at the base station (BS). In particular, we devise a cross-layer dynamic algorithm for user grouping, CSI acquisition and user scheduling that takes into account fairness considerations, application characteristics and quality of service (QoS) constraints of the users. We assess the merit of the proposed algorithm for a proportional fairness objective by comparing its performance with what is achieved by a relevant baseline algorithm in which user grouping is static and based only on the second order statistics, i.e., joint space division and multiplexing (JSDM). Our numerical findings illustrate that the proposed algorithm outperforms the baseline in terms of both fairness and speed of convergence to a steady state, and for different network topologies.

关键词： multiple input multiple output systems Network topology disc drives dynamic algorithms prediction coding Bahamas Quality of service space division User groups BASELINE

来源：评论

学校读者我要写书评

暂无评论

Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance

引用

ACM TRANSACTIONS ON algorithms 2012年第1期8卷 3-3页

作者： Haeupler, Bernhard Kavitha, Telikepalli Mathew, Rogers Sen, Siddhartha Tarjan, Robert E. MIT CSAIL Cambridge MA 02139 USA Tata Inst Fundamental Res Mumbai 400005 Maharashtra India Indian Inst Sci Bangalore 560012 Karnataka India Princeton Univ Dept Comp Sci Princeton NJ 08540 USA HP Labs Palo Alto CA 94304 USA

We present two online algorithms for maintaining a topological order of a directed n-vertex acyclic graph as arcs are added, and detecting a cycle when one is created. Our first algorithm handles m arc additions in O(m(3/2)) time. For sparse graphs (m/n = O(1)), this bound improves the best previous bound by a logarithmic factor, and is tight to within a constant factor among algorithms satisfying a natural locality property. Our second algorithm handles an arbitrary sequence of arc additions in O(n(5/2)) time. For sufficiently dense graphs, this bound improves the best previous bound by a polynomial factor. Our bound may be far from tight: we show that the algorithm can take Omega(n(2)2 root(2lgn)) time by relating its performance to a generalization of the k-levels problem of combinatorial geometry. A completely different algorithm running in Theta (n(2) log n) time was given recently by Bender, Fineman, and Gilbert. We extend both of our algorithms to the maintenance of strong components, without affecting the asymptotic time bounds.

关键词： dynamic algorithms directed graphs topological order cycle detection strong components halving intersection arrangement

来源：评论

学校读者我要写书评

暂无评论

Fully dynamic clustering and diversity maximization in doubling metrics

引用

ACM Transactions on Knowledge Discovery from Data 1000年

作者： Paolo Pellizzoni Andrea Pietracaprina Geppino Pucci Max Planck Institute of Biochemistry Germany University of Padova Italy

We present approximation algorithms for some variants of \(k\)-center clustering and diversity maximization in a fully dynamic setting, where the active pointset evolves through arbitrary insertions and deletions. All algorithms employ a coreset-based strategy and rely on the use of the cover tree data structure, which we crucially augment to maintain, at any time, some additional information enabling the efficient extraction of the solution for the specific problem. For all the problems under consideration, our algorithms compute \((\alpha+\varepsilon)\)-approximate solutions, where \(\alpha\) is the best known approximation attainable in polynomial time in the standard static setting, and \(\varepsilon>0\) is a user-provided accuracy parameter. Remarkably, and unlike previous works, the (cover tree) data structure used by our algorithms and the running times of the update procedures are both independent of the accuracy parameter \(\varepsilon\) and, for the \(k\)-center variants, also of parameter \(k\). The analysis is performed in terms of the doubling dimension of the metric space which the points belong to, and it shows that, for spaces of bounded doubling dimension, the times required to extract solutions to the above problems are dramatically smaller than those that would be required to recompute solutions on the entire active pointset from scratch. To the best of our knowledge, ours are the first solutions for the matroid-center and diversity maximization problems in the fully dynamic setting. The theoretical results are complemented by an extensive set of experiments, which demonstrate the efficiency and effectiveness of our algorithms for \(k\)-center without and with outliers against previously known ones.

关键词： dynamic algorithms k-center outliers matroid center diversity maximization cover tree

来源：评论

学校读者我要写书评

暂无评论

Profit-Maximizing Virtual Machine Trading in a Federation of Selfish Clouds

Profit-Maximizing Virtual Machine Trading in a Federation of...

引用

IEEE INFOCOM Conference

作者： Hongxing Li Chuan Wu Zongpeng Li Francis C. M. Lau Department of Computer Science The University of Hong Kong Hong Kong Department of Computer Science University of Calgary Canada

ISBN: (纸本)9781467359443

The emerging federated cloud paradigm advocates sharing of resources among cloud providers, to exploit temporal availability of resources and diversity of operational costs for job serving. While extensive studies exist on enabling interoperability across different cloud platforms, a fundamental question on cloud economics remains unanswered: When and how should a cloud trade VMs with others, such that its net profit is maximized over the long run? In order to answer this question by the federation, a number of important, correlated decisions, including job scheduling, server provisioning and resource pricing, need to be dynamically made, with long-term profit optimality being a goal. In this work, we design efficient algorithms for inter-cloud resource trading and scheduling in a federation of geo-distributed clouds. For VM trading among clouds, we apply a double auction-based mechanism that is strategyproof, individual rational, and ex-post budget balanced. Coupling with the auction mechanism is an efficient, dynamic resource trading and scheduling algorithm, which carefully decides the true valuations of VMs in the auction, optimally schedules stochastic job arrivals with different SLAs onto the VMs, and judiciously turns on and off servers based on the current electricity prices. Through rigorous analysis, we show that each individual cloud, by carrying out our dynamic algorithm, can achieve a time-averaged profit arbitrarily close to the offline optimum.

关键词： federations virtual machines Servers dynamic algorithms Electricity pricing Manufacturing costs jobs long run

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：