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

Nothing Happens by Accident, or Does It? A Low Prior for Randomness Does Not Explain Belief in Conspiracy Theories

PSYCHOLOGICAL SCIENCE 2015年第11期26卷 1762-1770页

作者： Dieguez, Sebastian Wagner-Egger, Pascal Gauvrit, Nicolas Univ Fribourg Dept Med Lab Cognit & Neurol Sci CH-1700 Fribourg Switzerland Univ Fribourg Dept Psychol CH-1700 Fribourg Switzerland Univ Paris St Denis Human & Artificial Cognit Lab St Denis France Ecole Prat Hautes Etud Dept Life Sci F-75013 Paris France

Belief in conspiracy theories has often been associated with a biased perception of randomness, akin to a nothing-happens-by-accident heuristic. Indeed, a low prior for randomness (i.e., believing that randomness is a priori unlikely) could plausibly explain the tendency to believe that a planned deception lies behind many events, as well as the tendency to perceive meaningful information in scattered and irrelevant details;both of these tendencies are traits diagnostic of conspiracist ideation. In three studies, we investigated this hypothesis and failed to find the predicted association between low prior for randomness and conspiracist ideation, even when randomness was explicitly opposed to malevolent human intervention. Conspiracy believers' and nonbelievers' perceptions of randomness were not only indistinguishable from each other but also accurate compared with the normative view arising from the algorithmic information framework. Thus, the motto nothing happens by accident, taken at face value, does not explain belief in conspiracy theories.

关键词： conspiracist ideation subjective randomness algorithmic complexity conspiracy theories beliefs

来源：评论

学校读者我要写书评

暂无评论

Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility

引用

PEERJ COMPUTER SCIENCE 2015年第9期2015卷

作者： Zenil, Hector Soler-Toscano, Fernando Delahaye, Jean-Paul Gauvrit, Nicolas Ctr Mol Med Unit Computat Med Dept Med Solna SciLifeLabSci Life Lab Stockholm Sweden Karolinska Inst Stockholm Sweden Univ Oxford Dept Comp Sci Oxford England Univ Seville Grp Log Lenguaje & Informac Seville Spain CRISTAL Ctr Rech Informat Signal & Automat Lille Lille France Ecole Prat Hautes Etud CHArt Lab Paris France LABoRES Algorithm Nat Grp Paris France

We propose a measure based upon the fundamental theoretical concept in algorithmic information theory that provides a natural approach to the problem of evaluating n-dimensional complexity by using an n-dimensional deterministic Turing machine. The technique is interesting because it provides a natural algorithmic process for symmetry breaking generating complex n-dimensional structures from perfectly symmetric and fully deterministic computational rules producing a distribution of patterns as described by algorithmic probability. algorithmic probability also elegantly connects the frequency of occurrence of a pattern with its algorithmic complexity, hence effectively providing estimations to the complexity of the generated patterns. Experiments to validate estimations of algorithmic complexity based on these concepts are presented, showing that the measure is stable in the face of some changes in computational formalism and that results are in agreement with the results obtained using lossless compression algorithms when both methods overlap in their range of applicability. We then use the output frequency of the set of 2-dimensional Turing machines to classify the algorithmic complexity of the space-time evolutions of Elementary Cellular Automata.

关键词： algorithmic complexity algorithmic probability Kolmogorov-Chaitin complexity algorithmic information theory Cellular automata Solomonoff-Levin universal distribution Information theory Dimensional complexity Image complexity Small Turing machines

来源：评论

学校读者我要写书评

暂无评论

Algoritmická složitost řešení ve vybraných třídách nekooperativních her

Algoritmická složitost řešení ve vybraných třídách ...

引用

作者： Wichera, Adam Charles University of Prague

Title: algorithmic complexity of solution concepts in selected classes of non-cooperative games Author: Adam Wichera Department: Department of Logic Supervisor: RNDr. Ondřej Majer, CSc. Supervisors e-mail address: majer@ *** Abstract In the presented work we study natural algorthmic problems rising from the concept of Nash Equilibrium. The problem of its existence is trivial, because it follows from Nash The- orem of completeness of Nash Equilibria. Even related search problem doesnt seem to belong to NP-complete class, the reason being the very fact, that existence of Nash Equilibria is certain. Interesting observation is that every natural extension of this problem seems to be NP-complete. Many of such problems have been proven to be NP-complete through reduction of SAT problem, Klike problem or problem of searching subcover of certain size. The question, wheather the pro- blem of existence of assymmetric Nash equilibria of symmeric game ts with the others, in being NP-complete, has been an open problem. Here we show how to alternate the proof from [? ] and apply the construction to problem of existence of assymetric equilibria and therefore prove its NP-completness. Keywords: Nash equilibrium, algorithmic complexity, Non-cooperative games, Game Theory, Assymetric equilibria, 1

关键词： Nash equilibrium algorithmic complexity Non-cooperative games Game Theory Assymmetric equilibria

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of Precoded MIMO PLC System Based on Two-Sided Jacobi SVD

引用

JOURNAL OF ELECTRICAL AND COMPUTER ENGINEERING 2015年第1期2015卷 706526.1-706526.7页

作者： Kilani, Hasna Tlich, Mohamed Attia, Rabah Carthage Univ Tunisia Polytech Sch SERCOM Lab La Marsa 2078 Tunisia CodinTek Co Ariana 2088 Tunisia

This paper evaluates the performance of closed loop multiple input multiple output power line communication (CL MIMO PLC) system based on enhanced zero-forcing (ZF) equalizer. In this work, the two-sided Jacobi (TSJ) algorithm has been investigated for the computation of singular value decomposition of the channel matrix. Quantized parameters are feedback from the receiver to the transmitter for precoding process. Numerous simplifications are introduced for the reduction of the algorithm complexity. The performance of the CL MIMO PLC is evaluated in terms of bit error rate (BER), constellation error vector magnitude (EVM), and mean square error (MSE) between the constructed SVD matrices and Matlab computed ones.

关键词： Programmable logic controllers Transmitters Mean square error Feedback algorithmic complexity Singular value decomposition Bit error rate Swine vesicular disease multiple input multiple output systems

来源：评论

学校读者我要写书评

暂无评论

Natural scene statistics mediate the perception of image complexity

引用

VISUAL COGNITION 2014年第8期22卷 1084-1091页

作者： Gauvrit, Nicolas Soler-Toscano, Fernando Zenil, Hector Ecole Prat Hautes Etud CHArt PARIS Reasoning Paris France Univ Seville Grp Log Lenguaje & Informac Seville Spain Karolinska Inst Ctr Mol Med Unit Computat Med Solna Sweden

Humans are sensitive to complexity and regularity in patterns (Falk & Konold, 1997;Yamada, Kawabe, & Miyazaki, 2013). The subjective perception of pattern complexity is correlated to algorithmic (or Kolmogorov-Chaitin) complexity as defined in computer science (Li & Vitanyi, 2008), but also to the frequency of naturally occurring patterns (Hsu, Griffiths, & Schreiber, 2010). However, the possible mediational role of natural frequencies in the perception of algorithmic complexity remains unclear. Here we reanalyze Hsu et al. (2010) through a mediational analysis, and complement their results in a new experiment. We conclude that human perception of complexity seems partly shaped by natural scenes statistics, thereby establishing a link between the perception of complexity and the effect of natural scene statistics.

关键词： Randomness Visual perception algorithmic complexity Visual complexity

来源：评论

学校读者我要写书评

暂无评论

Ecosystem complexity Through the Lens of Logical Depth: Capturing Ecosystem Individuality

引用

Biological Theory 2014年第4期9卷 440-451页

作者： Gaucherel, Cédric French Institute of Pondicherry (IFP-CNRS) Pondicherry India

In this article, I will discuss possible differences between ecosystems and organisms on the basis of their intrinsic complexity. As the concept of complexity still remains highly debated, I propose here a practical and original way to measure the complexity of an ecosystem or an organism. For this purpose, I suggest using the concept of logical depth (LD) in a specific manner, in order to take into account the difficulty as well as the time needed to generate the studied object. I illustrate this method with fully controlled Daisyworld simulations (i.e., simulations based on the Gaia hypothesis) that have often been proposed to mimic living systems. The method consists of the following sequential stages: (1) identification of the shortest program able to numerically model the studied system (also called the Kolmogorov–Solomonoff complexity);(2) running the program, once if there are no stochastic components in the system, several times if stochastic components are there;and (3) computing the time needed to generate the system with LD complexity. This measure is supposed to estimate the system complexity. It appears in this study that LD estimations fit well with the intuition we have of complex systems, with higher complexities being found for more realistic Daisyworlds. With such a method of capturing the time needed to build a system, we expect to detect in future studies any quantified differences between complex ecosystems and organisms. © 2014, Konrad Lorenz Institute for Evolution and Cognition Research.

关键词： algorithmic complexity Darwinism Gaia hypothesis Lamarckism Lattice

来源：评论

学校读者我要写书评

暂无评论

An Approach to One-Bit Compressed Sensing Based on Probably Approximately Correct Learning Theory

An Approach to One-Bit Compressed Sensing Based on Probably ...

引用

IEEE Annual Conference on Decision and Control

作者： M. Eren Ahsen M. Vidyasagar IBM Thomas J. Watson Research Center Yorktown Heights NY Erik Jonsson School of Engineering and Computer Science

ISBN: (纸本)9781479978878

This paper builds upon earlier work of the authors in formulating the one-bit compressed sensing (OBCS) problem as a problem in probably approximately correct (PAC) learning theory. It is shown that the solution to the OBCS problem consists of two parts. The first part is to determine the statistical complexity of OBCS by determining the Vapnik-Chervonenkis (VC-) dimension of the set of half-spaces generated by sparse vectors. The second is to determine the algorithmic complexity of the problem by developing a "consistent" algorithm. In this paper, we generalize the earlier results of the authors by deriving both upper and lower bounds on the VC-dimension of half-spaces generated by sparse vectors, even when the separating hyperplane need not pass through the origin. As with earlier bounds, these bounds grow linearly with respect to with the sparsity dimension and logarithmically with the vector dimension,

关键词： Compressed sensing algorithmic complexity dimensions Lower bound Bound Writers

来源：评论

学校读者我要写书评

暂无评论

Analysis of Electrogram complexity during Atrial Fibrillation for Ablation duration Assessment

Analysis of Electrogram Complexity during Atrial Fibrillatio...

引用

41st Computing in Cardiology Conference (CinC)

作者： Kosna, Katarzyna Podziemski, Piotr Wilson, Lauren Stolcman, Simon Sanders, Prashanthan Gieraltowski, Jan Zebrowski, Jan J. Kuklik, Pawel Warsaw Univ Technol Fac Phys Koszykowa 75 PL-00662 Warsaw Poland Royal Adelaide Hosp Cardiovasc Res Ctr Adelaide SA 5000 Australia Univ Hosp Eppendorf Dept Electrophysiol Hamburg Germany

ISBN: (纸本)9781479943463

The aim of this study was to assess the reliability of the complexity analysis of single electrogram as an estimator of the length of the ablation procedure necessary for AF termination. Left and right atrial endocardial bipolar electrograms were recorded during ablation procedure of AF in 27 patients. Up to 30 second electrogram samples were measured at baseline, after each stage of ablation (LPV, roof, CFAE etc.) and prior to termination. For each electrogram, algorithmic complexity was calculated. Electrograms had significantly lower algorithmic complexity for patients who had two or less ablation stages performed than for patients for whom more than two ablation stage was performed (p < 0.001). ROC analysis showed 100% statistical sensitivity for 81% statistical specificity. These results show that algorithmic complexity increases with a number of ablation stages needed to terminate AF, which is related with the duration of the ablation procedure.

关键词： computational complexity data analysis diseases electrocardiography medical computing radiation therapy sensitivity analysis statistical analysis AF ablation duration assessment AF termination CFAE ablation stage LP V ablation stage ROC analysis ablation procedure length estimator ablation stage number ablation termination algorithmic complexity calculation atrial fibrillation baseline measurement complexity analysis reliability assessment endocardial bipolar electrogram recording left atrial endocardial bipolar electrogram right atrial endocardial bipolar electrogram roof ablation stage single electrogram complexity analysis statistical sensitivity statistical specificity time 30 s Abstracts Algorithm design and analysis Analysis of variance complexity theory Physics Algorithm design and analysis ROC Curve algorithmic complexity medical computing Baseline measurements electrogram complexity theory Data analysis Statistical analysis ABLATION Electrocardiography complexity classes Analysis of Variance Radiotherapy Statistical methods

来源：评论

学校读者我要写书评

暂无评论

Linear Profilometry: A Low Cost 3D Acquisition System

Linear Profilometry: A Low Cost 3D Acquisition System

引用

IEEE/SICE International Symposium on System Integration

作者： Arwan Ahmad Khoiruddin Research Center for Informatics Indonesian Institute of Sciences (LIPI)

ISBN: (纸本)9781467372435

Numerous methods have been proposed for 3D acquisition using Fringe Projection Profilometry (FPP). Most methods assume that the signal acquired by the camera is perfectly sinusoidal. However, due to color response and optical aberration on projector and camera, inter-color crosstalk, as well as the presence of noise, it is very difficult to get a perfect sinusoidal. Several methods have been proposed to analyze non-sinusoidal signal by performing polynomial fitting on the signal. However, due to noise, polynomial fitting may produce oscillated errors. In this paper, a low cost method named Linear Profilometry is proposed. As no polynomial fitting is needed, oscillated error can be avoided. Moreover, as no monotonic part of the signal needs to be extracted, nor any unwrapping is needed, the algorithm complexity is extremely low. However, as no signal fitting is performed, the noise will remain unreduced. Thus, signal filter is needed during pre-processing. The final results of the method will highly depend on the noise filtering. In this paper, average and median filter are used.

关键词： algorithmic complexity PROFILOMETRY noise filtering signal filtering Optical aberrations Noise color response MACHINE SHOP PRACTICE median filters signals Cameras acquisition system Polynomial

来源：评论

学校读者我要写书评

暂无评论

Folded Hasse diagrams of combined traces

引用

INFORMATION PROCESSING LETTERS 2014年第4期114卷 208-216页

作者： Mikulski, Lukasz Koutny, Maciej Newcastle Univ Sch Comp Sci Newcastle Upon Tyne NE1 7RU Tyne & Wear England Nicolaus Copernicus Univ Fac Math & Comp Sci Torun Poland

To represent concurrent behaviours one can use concepts originating from language theory, including traces and comtraces. Traces can express notions such as concurrency and causality, whereas comtraces can also capture weak causality and simultaneity. This paper is concerned with the development of efficient data structures and algorithms for manipulating comtraces. We introduce and investigate folded Hasse diagrams of comtraces which generalise Hasse diagrams defined for partial orders and traces. We also develop an efficient on-line algorithm for deriving Hasse diagrams from language theoretic representations of comtraces. Finally, we briefly discuss how folded Hasse diagrams could be used to implement efficiently some basic operations on comtraces. (C) 2013 Elsevier B.V. All rights reserved.

关键词： Comtrace Trace Hasse diagram Stratified order structure Partial order Concurrency Causality Weak causality Independence algorithmic complexity Petri net Inhibitor arc

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：