«Великое искусство» Раймонда Луллия и его исторические судьбы
This volume contains a selection of contributions from the "First International Conference in Network Analysis," held at the University of Florida, Gainesville, on December 14-16, 2011. The remarkable diversity of fields that take advantage of Network Analysis makes the endeavor of gathering up-to-date material in a single compilation a useful, yet very difficult, task. The purpose of this volume is to overcome this difficulty by collecting the major results found by the participants and combining them in one easily accessible compilation.
This paper devoted to Russian scientist Alexander Schukarev and his work on logical machine. Historically, this work may be divided on two periods – before and after Russian October revolution. We try to understand and explain why Schukarev's activity in this field was ceased and his logical machine was forgotten for the long time.
This book constitutes the refereed proceedings of the 11th IFIP TC 9 International Conference on Human Choice and Computers, HCC11 2014, held in Turku, Finland, in July/August 2014. The 29 revised full papers presented were carefully reviewed and selected from numerous submissions. The papers are based on both academic research and the professional experience of information technologists working in the field.
One of the key advances in genome assembly that has led to a significant improvement in contig lengths has been improved algorithms for utilization of paired reads (mate-pairs). While in most assemblers, mate-pair information is used in a post-processing step, the recently proposed Paired de Bruijn Graph (PDBG) approach incorporates the mate-pair information directly in the assembly graph structure. However, the PDBG approach faces difficulties when the variation in the insert sizes is high. To address this problem, we first transform mate-pairs into edge-pair histograms that allow one to better estimate the distance between edges in the assembly graph that represent regions linked by multiple mate-pairs. Further, we combine the ideas of mate-pair transformation and PDBGs to construct new data structures for genome assembly: pathsets and pathset graphs.
The purpose of the present paper is to describe and evaluate recent Bayesian developments concerning the theory of confirmation and the theory of scientific reasoning as a whole. It is argued that the Bayesian approach in contemporary philosophy of science has, as its main consequence, a serious revision of the conception of scientific rationality.
The collection represents proceedings of the nineth international conference "Discrete Models in Control Systems Theory" that is held by Lomonosov Moscow State Uneversity and is dedicated in 90th anniversary of Sergey Vsevolodovich Yablonsky's birth. The conference subject are includes: discrete functional systems; discrete functions properties; control systems synthesis, complexity, reliability, and diagnostics; automata; graph theory; combinatorics; coding theory; mathematical methods of information security; theory of pattern recognition; mathematical theory of intellegence systems; applied mathematical logic. The conference is sponsored by Russian Foundation for Basic Research (project N 15-01-20193-г).
The centuries-old development of logical machines is very interesting page of both computer technology and logic history. In fact, logical machines cannot be called the ancestors of modern computers but our analysis allows us to state for surely that these devices were the very first predecessors of contemporary intellectual informational technologies. In this article we give the review of logical machines built before the beginning of computer era. In contrast to the classic book of Martin Gardner «Logic machines and diagrams» (1958) our paper includes descriptions of all known logical machines. Some of them (e.g. devices of Alfred Smee) Gardner described only briefly and some («virtual» logical machine of Jonathan Swift, Round Demonstrator of Earl Stanhope, machines intellectueles of Semion Korsakov, logical machines of Pavel Khruschev and Aleksandr Schukarev) did not mention at all.