Annals of Mathematics and Artificial Intelligence最新文献_第9页

Commitment-based negotiation semantics for accountability in multi-agent systems 多智能体系统中基于承诺的协商语义

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-07-08 DOI: 10.1007/s10472-023-09875-w

Phillip Sloan, Nirav Ajmeri

引用次数: 0

Local critical analysis of inequalities related to the sum of distances between n points on the unit hemisphere for (n=4,5) 单位半球上n点距离和不等式的局部临界分析 $$n=4,5$$

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-07-06 DOI: 10.1007/s10472-023-09880-z

Yaochen Xu, Zhenbing Zeng, Jian Lu, Yuzheng Wang, Liangyu Chen

{"title":"Local critical analysis of inequalities related to the sum of distances between n points on the unit hemisphere for (n=4,5)","authors":"Yaochen Xu, Zhenbing Zeng, Jian Lu, Yuzheng Wang, Liangyu Chen","doi":"10.1007/s10472-023-09880-z","DOIUrl":"10.1007/s10472-023-09880-z","url":null,"abstract":"<div><p>In this paper, we study a geometrical inequality conjecture which states that for any four points on a hemisphere with the unit radius, the largest sum of distances between the points is <span>(4+4sqrt{2})</span>, the best configuration is a regular square inscribed to the equator, and for any five points, the largest sum is <span>(5sqrt{5+2sqrt{5}})</span> and the best configuration is the regular pentagon inscribed to the equator. We prove that the conjectured configurations are local optimal, and construct a rectangular neighborhood of the local maximum point in the related feasible set, whose size is explicitly determined, and prove that (1): the objective function is bounded by a quadratic polynomial which takes the local maximum point as the unique critical point in the neighborhood, and (2): the remaining part of the feasible set can be partitioned into a finite union of a large number of very small cubes so that on each small cube, the conjecture can be verified by estimating the objective function with exact numerical computation. We also explain the method for constructing the neighborhoods and upper-bound quadratic polynomials in detail and describe the computation process outside the constructed neighborhoods briefly.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"91 6","pages":"865 - 898"},"PeriodicalIF":1.2,"publicationDate":"2023-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-023-09880-z.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42818484","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Controlling weighted voting games by deleting or adding players with or without changing the quota 控制加权投票游戏通过删除或添加玩家，或不改变配额

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-07-06 DOI: 10.1007/s10472-023-09874-x

Joanna Kaczmarek, Jörg Rothe

{"title":"Controlling weighted voting games by deleting or adding players with or without changing the quota","authors":"Joanna Kaczmarek, Jörg Rothe","doi":"10.1007/s10472-023-09874-x","DOIUrl":"10.1007/s10472-023-09874-x","url":null,"abstract":"<div><p>Weighted voting games are a well-studied class of succinct simple games that can be used to model collective decision-making in, e.g., legislative bodies such as parliaments and shareholder voting. Power indices [1,2,3,4] are used to measure the influence of players in weighted voting games. In such games, it has been studied how a distinguished player’s power can be changed, e.g., by merging or splitting players (the latter is a.k.a. false-name manipulation) [5, 6], by changing the quota [7], or via structural control by adding or deleting players [8]. We continue the work on the structural control initiated by Rey and Rothe [8] by solving some of their open problems. In addition, we also modify their model to a more realistic setting in which the quota is indirectly changed during the addition or deletion of players (in a different sense than that of Zuckerman et al. [7] who manipulate the quota directly without changing the set of players), and we study the corresponding problems in terms of their computational complexity.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"92 3","pages":"631 - 669"},"PeriodicalIF":1.2,"publicationDate":"2023-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-023-09874-x.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138520484","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Design and implementation of symbolic algorithms for the computation of generalized asymptotes 广义渐近线计算符号算法的设计与实现

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-07-03 DOI: 10.1007/s10472-023-09856-z

Marián Fernández de Sevilla, Rafael Magdalena Benedicto, Sonia Pérez-Díaz

{"title":"Design and implementation of symbolic algorithms for the computation of generalized asymptotes","authors":"Marián Fernández de Sevilla, Rafael Magdalena Benedicto, Sonia Pérez-Díaz","doi":"10.1007/s10472-023-09856-z","DOIUrl":"10.1007/s10472-023-09856-z","url":null,"abstract":"<div><p>In this paper we present two algorithms for computing the <i>g-asymptotes</i> or <i>generalized asymptotes</i>, of a plane algebraic curve, <span>(mathscr {C})</span>, implicitly or parametrically defined. The asymptotes of a curve <span>(mathscr {C})</span> reflect the status of <span>(mathscr {C})</span> at points with sufficiently large coordinates. It is well known that an asymptote of a curve <span>(mathscr {C})</span> is a line such that the distance between <span>(mathscr {C})</span> and the line approaches zero as they tend to infinity. However, a curve <span>(mathscr {C})</span> may have more general curves than lines describing the status of <span>(mathscr {C})</span> at infinity. These curves are known as <i>g-asymptotes</i> or <i>generalized asymptotes</i>. The pseudocodes of these algorithms are presented, as well as the corresponding implementations. For this purpose, we use the algebra software <span>Maple</span>. A comparative analysis of the algorithms is carried out, based on some properties of the input curves and their results to analyze the efficiency of the algorithms and to establish comparative criteria. The results presented in this paper are a starting point to generalize this study to surfaces or to curves defined by a non-rational parametrization, as well as to improve the efficiency of the algorithms. Additionally, the methods developed can provide a new and different approach in prediction (regression) or classification algorithms in the machine learning field.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"91 4","pages":"537 - 561"},"PeriodicalIF":1.2,"publicationDate":"2023-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-023-09856-z.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43041329","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Automated generation of illustrated proofs in geometry and beyond 自动生成几何及其他领域的图解证明

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-07-03 DOI: 10.1007/s10472-023-09857-y

Predrag Janičić, Julien Narboux

引用次数: 0

Search algorithms for automated negotiation in large domains 大型领域自动协商的搜索算法

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-07-02 DOI: 10.1007/s10472-023-09859-w

Thimjo Koça, Dave de Jonge, Tim Baarslag

引用次数: 0

Single MCMC chain parallelisation on decision trees 决策树上的单MCMC链并行化

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-07-02 DOI: 10.1007/s10472-023-09876-9

Efthyvoulos Drousiotis, Paul Spirakis

{"title":"Single MCMC chain parallelisation on decision trees","authors":"Efthyvoulos Drousiotis, Paul Spirakis","doi":"10.1007/s10472-023-09876-9","DOIUrl":"10.1007/s10472-023-09876-9","url":null,"abstract":"<div><p>Decision trees (DT) are highly famous in machine learning and usually acquire state-of-the-art performance. Despite that, well-known variants like CART, ID3, random forest, and boosted trees miss a probabilistic version that encodes prior assumptions about tree structures and shares statistical strength between node parameters. Existing work on Bayesian DT depends on Markov Chain Monte Carlo (MCMC), which can be computationally slow, especially on high dimensional data and expensive proposals. In this study, we propose a method to parallelise a single MCMC DT chain on an average laptop or personal computer that enables us to reduce its run-time through multi-core processing while the results are statistically identical to conventional sequential implementation. We also calculate the theoretical and practical reduction in run time, which can be obtained utilising our method on multi-processor architectures. Experiments showed that we could achieve 18 times faster running time provided that the serial and the parallel implementation are statistically identical.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"93 1","pages":"219 - 232"},"PeriodicalIF":1.2,"publicationDate":"2023-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-023-09876-9.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138520482","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A Novel Method for Solving Universum Twin Bounded Support Vector Machine in the Primal Space 一种求解原始空间中普遍双界支持向量机的新方法

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-07-01 DOI: 10.1007/s10472-023-09871-0

H. Moosaei, Saeed Khosravi, F. Bazikar, M. Hladík, Mario Rosario Guarracino

引用次数: 0

A hybrid simulated annealing and variable neighborhood search algorithm for the close-open electric vehicle routing problem 一种求解闭-开电动车路径问题的混合模拟退火和变邻域搜索算法

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-06-18 DOI: 10.1007/s10472-023-09858-x

Themistoklis Stamadianos, N. Kyriakakis, M. Marinaki, Y. Marinakis

引用次数: 0

Lattice point of view for argumentation framework 格点观点的论证框架

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-06-17 DOI: 10.1007/s10472-023-09873-y

Mohammed Elaroussi, Lhouari Nourine, Mohammed Said Radjef

{"title":"Lattice point of view for argumentation framework","authors":"Mohammed Elaroussi, Lhouari Nourine, Mohammed Said Radjef","doi":"10.1007/s10472-023-09873-y","DOIUrl":"10.1007/s10472-023-09873-y","url":null,"abstract":"<div><p>The main purpose of this article is to develop a lattice point of view for the study of argumentation framework extensions. We first characterize self-defending sets of an argumentation framework by the closed sets of an implicational system that can be computed in polynomial time from the argumentation framework. On the other hand, for any implicational system <span>(Sigma )</span> over the set of arguments, we associate an argumentation framework whose admissible sets are in bijection with closed sets of <span>(Sigma )</span>. Second, we propose conflict-closed sets reduction rules, based on implicational system, to find out minimal subsets of vertex cover closed while maintaining all potential admissible extensions as well as preferred extensions. This leads to a polynomial delay and space algorithm to enumerate admissible sets of argumentation frameworks without even cycles. Finally, based on the implicational system, a new decomposition of the argumentation framework is defined and leads to a polynomial delay and space algorithm to enumerate admissible sets for a bipartite argumentation framework. The proposed algorithm improves the exponential space complexity of previous algorithms.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"91 5","pages":"691 - 711"},"PeriodicalIF":1.2,"publicationDate":"2023-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43172549","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4