?
Lecture Notes in Artificial Intelligence
Vol. 9861: Belief Functions: Theory and Applications.
Springer, 2016.
Academic editor: J. Vejnarová, V. Kratochvíl
The theory of belief functions, also referred to as evidence theory or Dempster-Shafer theory, is a well-established general framework for reasoning with uncertainty. It has well-understood connections to other frameworks, such as probability, possibility, and imprecise probability theories. First introduced by Arthur P. Dempster in the context of statistical inference, the theory was later developed by Glenn Shafer into a general framework for modeling epistemic uncertainty. These early contributions have provided the starting points for many important developments, including the Transferable Belief Model and the Theory of Hints.
The biennial BELIEF conferences (organized by the Belief Functions and Applications Society) are dedicated to the exchange of ideas, reporting of recent achievements, and presenting the wide range of applications of this theory. This conference series was started in Brest, France, in 2010; the second event was held in Compiègne, France, in May 2012; and the third in Oxford, UK, in September 2014.
The present volume contains the proceedings of the 4th International Conference on Belief Functions, which took place in Prague, Czech Republic, on September 21–23, 2016. The book contains 25 peer-reviewed papers (out of a total number of 33 submissions) describing recent developments concerning both theoretical issues (including combination rules, conflict management, and generalized information theory) and applications in various areas (such as image processing, material sciences, and navigation).
Andrey G. Bronevich, Rozenberg I., , in : Lecture Notes in Artificial Intelligence. Vol. 9861: Belief Functions: Theory and Applications.: Springer, 2016. P. 137-145.
In the paper we argue that aggregation rules in the theory of belief functions should be in accordance with underlying decision models, i.e. aggregation produced in conjunctive manner has to produce the order embedded to the union of partial orders constructed in each source of information; and if we take models based on imprecise probabilities, ...
Added: October 17, 2016
Lepskiy A., , in : Lecture Notes in Artificial Intelligence. Vol. 9861: Belief Functions: Theory and Applications.: Springer, 2016. P. 25-34.
Conflictness is an important a priori characteristic of combining rules in the belief functions theory. A new approach to the estimation of internal conflict offered in this article. This approach is based on the idea of decomposition of the initial body of evidence on the set of bodies of evidence by means of some combining ...
Added: September 28, 2016
Bronevich A., Розенберг И. Н., International Journal of Approximate Reasoning 2015 Vol. 56 P. 122-136
In the paper we investigate the criteria of choosing generalized Dempster–Shafer rules for aggregating sources whose information is represented by belief functions. The approach is based on measuring various types of uncertainty in information and we use for this purpose in particular linear imprecision indices. Some results concerning properties of such rules are also presented. ...
Added: March 5, 2015
Lepskiy A., Нечеткие системы и мягкие вычисления 2013 Т. 8 № 2 С. 65-82
The index of decreasing of ignorance after applying of combination rules is introduced and studied in the work within the frame of Dempster-Shafer theory. This index is analysed for some special sets (bodies) of evidence. It is shown that a strong correlation between bodies of evidence is a sufficient condition to decrease of ignorance after applying of combination rules. In ...
Added: December 16, 2013
Malyshev D., Discrete Mathematics 2015 Vol. 338 No. 11 P. 1860-1865
We completely determine the complexity status of the 3-colorability problem for hereditary graph classes defined by two forbidden induced subgraphs with at most five vertices. ...
Added: April 7, 2014
Bliznets Ivan, Cygan M., Komosa P. et al., ACM Transactions on Computation Theory 2018 Vol. 10 No. 2 P. 1-32
The H-free Edge Deletion problem asks, for a given graph G and integer k, whether it is possible to delete at most k edges from G to make it H-free—that is, not containing H as an induced subgraph. The H-free Edge Completion problem is defined similarly, but we add edges instead of deleting them. The study of these two problem families has recently been the subject of intensive studies from the point of ...
Added: October 30, 2018
Skoptsov K. A., Sheshenin S., Galatenko V. V. et al., International Journal of Applied Mechanics 2016 Vol. 8 No. 2 P. 1650016-01-1650016-18
We present a method for evaluating elastic properties of a composite material produced by molding a resin filled with short elastic fibers. A flow of the filled resin is simulated numerically using a mesh-free method. After that, assuming that spatial distribution and orientation of fibers are not significantly changed during polymerization, effective elastic moduli of ...
Added: May 22, 2016
Chernyshev S. V., Cherepanov E. A., Pankratiev E. V. et al., Journal of Mathematical Sciences 2005 Vol. 128 No. 6 P. 3487-3495
Added: January 27, 2014
Baibikova T., Domoratsky E., Вестник Московского финансово-юридического университета 2017 № 1 С. 200-206
Some questions of scientific visualization are under consideration in this paper. This article also discusses the peculiarities of application of cognitive computer graphics, singles out a range of tasks of scientific visualization. The paper gives a brief overview of modern support tools for program visualization, tendencies of their development and their main characteristics. A module ...
Added: June 10, 2017
М. : National Instruments Russia, 2017
Содержание сборника составляют доклады с результатами оригинальных исследований и технических решений, ранее не публиковавшиеся. Мы надеемся, что предлагаемый сборник окажется полезным для специалистов, работающих в различных областях науки и техники, для широкого круга преподавателей, аспирантов и студентов ВУЗов, а также для преподавателей средних школ и технических колледжей. ...
Added: May 10, 2017
Beklemishev L. D., Оноприенко А. А., Математический сборник 2015 Т. 206 № 9 С. 3-20
We formulate some term rewriting systems in which the number of computation steps is finite for each output, but this number cannot be bounded by a provably total computable function in Peano arithmetic PA. Thus, the termination of such systems is unprovable in PA. These systems are derived from an independent combinatorial result known as the Worm ...
Added: March 13, 2016
Springer, 2012
Added: January 29, 2013
Sotnikova S., Динамика сложных систем 2012 № 3 С. 84-87
In article is described designed programme complex of the physical processes modeling, which also allows to conduct the identification printed node parameters (the physical model). On printed node designed the on-board secondary power supply source is realized. For it are designed relationship interfaces of controlling program with the known program of modeling and optimization. ...
Added: December 5, 2014
Chuprikov P., Nikolenko S. I., Davydow A. et al., IEEE Transactions on Networking 2018 Vol. 26 No. 1 P. 342-355
Modern network elements are increasingly required to deal with heterogeneous traffic. Recent works consider processing policies for buffers that hold packets with different processing requirements (number of processing cycles needed before a packet can be transmitted out) but uniform value, aiming to maximize the throughput, i.e., the number of transmitted packets. Other developments deal with ...
Added: March 14, 2018
Karpov V. E., Karpova I. P., Procedia Engineering 2015 Vol. 100 P. 1459-1468
Work solutions are proposed for problems of leader definition and role distribution in homogeneous groups of robots. It is shown that transition from a swarm to a collective of robots with hierarchical organization is possible using exclusively local interaction. The local revoting algorithm is central to the procedure for choice of leader while redistribution of roles can ...
Added: March 14, 2015
М. : Издательский центр «Российский государственный гуманитарный университет», 2019
Сборник включает 27 докладов международной конференции по компьютерной лингвистике и интеллектуальным технологиям «Диалог 2019», не вошедшие в ежегодник «Компьютерная лингвистика и интеллектуальные технологии», но рекомендованные Программным Комитетом к представлению на конференции. Для специалистов в области теоретической и прикладной лингвистики и интеллектуальных технологий. ...
Added: December 10, 2019
Morozov I., Norman G. E., Insepov Z. et al., Physical Review Special Topics - Accelerators and Beams 2012 Vol. 15 P. 053501
This paper describes the surface environment of the dense plasma arcs that damage rf accelerators, tokamaks, and other high gradient structures. We simulate the dense, nonideal plasma sheath near a metallic surface using molecular dynamics (MD) to evaluate sheaths in the non-Debye region for high density, low temperature plasmas. We use direct two-component MD simulations ...
Added: October 28, 2013
Kiselyova N. N., Dudarev V.A., Korzhuev M. A., Inorganic Materials: Applied Research 2016 Vol. 7 No. 1 P. 34-39
A database (DB) on the bandgap of inorganic substances available via the Internet (http://bg.imetdb.ru) was developed for the information service of specialists in the sphere of inorganic chemistry and materials science. The DB is integrated with other information systems on the properties of inorganic substances and materials, which provides the search of a wide range ...
Added: February 23, 2016
Vyalyi M., Дискретная математика 1991 Т. 3 № 3 С. 35-45
Added: October 17, 2014
Toldova S., Azerkovich I., Гришина Ю. et al., / НИУ ВШЭ. Series WP BRP "Linguistics". 2015.
Building benchmark corpora in the domain of coreference and anaphora resolution is an important task for developing and evaluating NLP systems and models. Our study is aimed at assessing the feasibility of enhancing corpora with information about coreference relations. The annotation procedure includes identification of text segments that are subjects to annotation (markables), marking their ...
Added: December 15, 2015
Shuranov E., / Cornell University. Series Computer Science "arxiv.org". 2021.
Text encodings from automatic speech recognition (ASR) transcripts and audio representations have shown promise in speech emotion recognition (SER) ever since. Yet, it is challenging to explain the effect of each information stream on the SER systems. Further, more clarification is required for analysing the impact of ASR's word error rate (WER) on linguistic emotion ...
Added: February 14, 2023
Gostev I. M., М. : Юрайт, 2016
В настоящее время компьютерные науки стремительно развиваются. Новые версии операционных систем появляются каждые полтора-два года, поэтому было принято решение о включении в данную книгу такого материала, который не будет устаревать. Содержание учебника представляет собой некоторые наиболее общие принципы построения операционных систем, которые были разработаны более 50 лет назад и практически не изменились за прошедшее время. ...
Added: October 13, 2009
Borchmann D., Hanika T., Obiedkov S., Discrete Applied Mathematics 2020 Vol. 273 P. 30-42
We propose an algorithm for learning the Horn envelope of an arbitrary domain using an expert, or an oracle, capable of answering certain types of queries about this domain. Attribute exploration from formal concept analysis is a procedure that solves this problem, but the number of queries it may ask is exponential in the size ...
Added: October 29, 2019
Каз. : Издательство «Фэн» Академии наук Республики Татарстан, 2013
Материалы и доклады Шестой Всероссийской научно-практической конференции по имитацонному моделированию и его применению в науке и промышленности. ...
Added: December 14, 2013
Goncharov R., Сапанов П. М., Яшунский А. Д., Социология власти 2013 № 3 С. 57-72
В статье представлена технология, позволяющая собирать в полевых исследованиях пространственно локализованные данные об объектах городской среды. Технология основана на автоматической привязке фотографий к пространственным координатам. Приведен план полевых и камеральных мероприятий, предложены варианты ГИС-обработки собираемых таким образом данных. В качестве примера приведены данные об использовании белорусского языка в общественном пространстве городов Белоруссии. ...
Added: April 12, 2015
Furmanov K. K., Nikol'skii I. M., Computational Mathematics and Modeling 2016 Vol. 27 No. 2 P. 247-253
Added: December 22, 2016