The main goal of my paper is to argue that data compression is a necessary condition for intelligence. One key motivation for this proposal stems from a paradox about intuition and intelligence. For the purposes of this paper, it will be useful to consider playing board games—such as chess and Go—as a paradigm of problem solving and cognition, and computer programs as a model of human cognition. I first describe the basic components of computer programs that play board (...) games, namely value functions and search functions. I then argue that value functions both play the same role as intuition in humans and work in essentially the same way. However, as will become apparent, using an ordinary value function is just a simpler and less accurate form of relying on a database or lookup table. This raises our paradox, since reliance on intuition is usually considered to manifest intelligence, whereas usage of a lookup table is not. I therefore introduce another condition for intelligence that is related to data compression. This proposal allows that even reliance on a perfectly accurate lookup table can be nonintelligent, while retaining the claim that reliance on intuition can be highly intelligent. My account is not just theoretically plausible, but it also captures a crucial empirical constraint. This is because all systems with limited resources that solve complex problems—and hence, all cognitive systems—need to compress data. (shrink)

The article examines the algorithms for JPEG and JPEG-2000 compression of various graphic images. The main steps of the operation of both algorithms are given, their advantages and disadvantages are noted. The main differences between JPEG and JPEG-2000 are analyzed. It is noted that the JPEG-2000 algorithm allows re-moving visually unpleasant effects. This makes it possible to highlight important areas of the image and improve the quality of their compression. The features of each step of the algorithms are (...) considered and the difficulties of their implementation are compared. The effectiveness of each algorithm is demonstrated by the example of a full-color image of the BSU emblem. The obtained compression ratios were obtained and shown in the corresponding tables using both algorithms. Compression ratios are obtained for a wide range of quality values from 1 to ten. We studied various types of images: black and white, business graphics, indexed and full color. A modified LZW-Lempel-Ziv-Welch algorithm is presented, which is applicable to compress a variety of information from text to images. The modification is based on limiting the graphic file to 256 colors. This made it possible to index the color with one byte instead of three. The efficiency of this modification grows with increasing image sizes. The modified LZW-algorithm can be adapted to any image from single-color to full-color. The prepared tests were indexed to the required number of colors in the images using the FastStone Image Viewer program. For each image, seven copies were obtained, containing 4, 8, 16, 32, 64, 128 and 256 colors, respectively. Testing results showed that the modified version of the LZW algorithm allows for an average of twice the compression ratio. However, in a class of full-color images, both algorithms showed the same results. The developed modification of the LZW algorithm can be successfully applied in the field of site design, especially in the case of so-called flat design. The comparative characteristics of the basic and modified methods are presented. (shrink)

The sizes of individual data files have steadily increased along with rising demand for customized services, leading to issues such as low efficiency of web-based geographical information system -based data compression, transmission, and rendering for rich Internet applications in complicated visualization systems. In this article, a WebGIS-based technical solution for the efficient transmission and visualization of meteorological big data is proposed. Based on open-source technology such as HTML5 and Mapbox GL, the proposed scheme considers distributed (...) class='Hi'>data compression and transmission on the server side as well as distributed requests and page rendering on the browser side. A high-low 8-bit compression method is developed for compressing a 100 megabyte file into a megabyte-scale file, with a compression ratio of approximately 90%, and the recovered data are accurate to two decimal places. Another part of the scheme combines pyramid tile cutting, concurrent domain name request processing, and texture rendering. Experimental results indicate that with this scheme, grid files of up to 100 MB can be transferred and displayed in milliseconds, and multiterminal service applications can be supported by building a grid data visualization mode for big data and technology centers, which may serve as a reference for other industries. (shrink)

This discussion note responds to objections by Twardy, Gardner, and Dowe to my earlier claim that empirical data sets are algorithmically incompressible. Twardy, Gardner, and Dowe hold that many empirical data sets are compressible by Minimum Message Length technique and offer this as evidence that these data sets are algorithmically compressible. I reply that the compression achieved by Minimum Message Length technique is different from algorithmic compression. I conclude that Twardy, Gardner, and Dowe fail to (...) establish that empirical data sets are algorithmically compressible.Keywords: Algorithmic compression; Algorithmic randomness; Empirical data; Huffman compression; Minimum Message Length technique. (shrink)

James McAllister’s 2003 article, “Algorithmic randomness in empirical data” claims that empirical data sets are algorithmically random, and hence incompressible. We show that this claim is mistaken. We present theoretical arguments and empirical evidence for compressibility, and discuss the matter in the framework of Minimum Message Length (MML) inference, which shows that the theory which best compresses the data is the one with highest posterior probability, and the best explanation of the data.

This book examines how compression can be understood not only as a digital process enacted through computing, but as an economic and political phenomenon that impacts the ecology of waste, diversity and social inclusivity. Beginning with a linguistic underpinning of visual space, the book examines the development of the MP3 algorithm and the 'waste' it creates, challenging the wisdom that human reason and language is uniquely capable of bringing order to chaos. Returning to the idea of a sonic economy, (...) the book reintroduces waste, error and other discarded material back into our systems of thought-and into systems beyond our thought. (shrink)

In recent years, the important and fast growth in the development and demand of multimedia products is contributing to an insufficiency in the bandwidth of devices and network storage memory. Consequently, the theory of data compression becomes more significant for reducing data redundancy in order to allow more transfer and storage of data. In this context, this paper addresses the problem of lossy image compression. Indeed, this new proposed method is based on the block singular (...) value decomposition (SVD) power method that overcomes the disadvantages of MATLAB’s SVD function in order to make a lossy image compression. The experimental results show that the proposed algorithm has better compression performance compared with the existing compression algorithms that use MATLAB’s SVD function. In addition, the proposed approach is simple in terms of implementation and can provide different degrees of error resilience, which gives, in a short execution time, a better image compression. (shrink)

Daniel Dennett distinguishes real patterns from bogus patterns by appeal to compressibility. As information theorists have shown, data are compressible if and only if those data exhibit a pattern....

After introducing the concept of compressed sensing as a complementary measurement mode to the classical Shannon-Nyquist approach, I discuss some of the drivers, potential challenges and obstacles to its implementation. I end with a speculative attempt to embed compressed sensing as an enabling methodology within the emergence of data-driven discovery. As a consequence I predict the growth of non-nomological sciences where heuristic correlations will find applications but often bypass conventional pure basic and use-inspired basic research stages due to the (...) lack of verifiable hypotheses. (shrink)

What is understanding? My goal in this paper is to lay out a new approach to this question and clarify how that approach deals with certain issues. The claim is that understanding is a matter of compressing information about the understood so that it can be mentally useful. On this account, understanding amounts to having a representational kernel and the ability to use it to generate the information one needs regarding the target phenomenon. I argue that this ambitious new account (...) can accommodate much of the data that has motivated theories of understanding in philosophy of science, and can also be generally applicable in epistemology and daily life as well. (shrink)

We critically analyse the point of view for which laws of nature are just a mean to compress data. Discussing some basic notions of dynamical systems and information theory, we show that the idea that the analysis of large amount of data by means of an algorithm of compression is equivalent to the knowledge one can have from scientific laws, is rather naive. In particular we discuss the subtle conceptual topic of the initial conditions of phenomena which (...) are generally incompressible. Starting from this point, we argue that laws of nature represent more than a pure compression of data, and that the availability of large amount of data, in general, is not particularly useful to understand the behaviour of complex phenomena. (shrink)

The application of recycled aggregate as a sustainable material in construction projects is considered a promising approach to decrease the carbon footprint of concrete structures. Prediction of compressive strength of environmentally friendly concrete containing recycled aggregate is important for understanding sustainable structures’ concrete behaviour. In this research, the capability of the deep learning neural network approach is examined on the simulation of CS of EF concrete. The developed approach is compared to the well-known artificial intelligence approaches named multivariate adaptive regression (...) spline, extreme learning machines, and random forests. The dataset was divided into three scenarios 70%-30%, 80%-20%, and 90%-10% for training/testing to explore the impact of data division percentage on the capacity of the developed AI model. Extreme gradient boosting was integrated with the developed AI models to select the influencing variables on the CS prediction. Several statistical measures and graphical methods were generated to evaluate the efficiency of the presented models. In this regard, the results confirmed that the DLNN model attained the highest value of prediction performance with minimal root mean squared error. The study revealed that the highest prediction performance could be attained by increasing the number of variables in the prediction problem and using 90%-10% data division. The results demonstrated the robustness of the DLNN model over the other AI models in handling the complex behaviour of concrete. Due to the high accuracy of the DLNN model, the developed method can be used as a practical approach for future use of CS prediction of EF concrete. (shrink)

The algorithmic theory of laws claims that the laws of nature are the algorithms in the best possible compression of all empirical data. This position assumes that the universe is compressible and that data received from observing it is easily reproducible using a simple set of rules. However, there are three sources of evidence that suggest that the universe as a whole is incompressible. The first comes from the practice of science. The other two come from the (...) nature of the universe itself: the presence of chaotic behavior and the nature of quantum systems also suggests that the universe is incompressible. This paper evaluates these sources and argues that none provides a convincing case to reject the algorithmic theory of laws. (shrink)

Electroencephalogram plays an essential role in analysing and recognizing brain-related diseases. EEG has been increasingly used as a new type of biometrics in person identification and verification systems. These EEG-based systems are important components in applications for both police and civilian works, and both areas process a huge amount of EEG data. Storing and transmitting these huge amounts of data are significant challenges for data compression techniques. Lossy compression is used for EEG data as (...) it provides a higher compression ratio than lossless compression techniques. However, lossy compression can negatively influence the performance of EEG-based person identification and verification systems via the loss of information in the reconstructed data. To address this, we propose introducing performance measures as additional features in evaluating lossy compression techniques for EEG data. Our research explores if a common value of CR exists for different systems using datasets with lossy compression that could provide almost the same system performance with those using datasets without lossy compression. We performed experiments on EEG-based person identification and verification systems using two large EEG datasets, CHB MIT Scalp and Alcoholism, to investigate the relationship between standard lossy compression measures and our proposed system performance measures with the two lossy compression techniques, discrete wavelet transform—adaptive arithmetic coding and discrete wavelet transform—set partitioning in hierarchical trees. Our experimental results showed a common value of CR exists for different systems, specifically, 70 for person identification systems and 50 for person verification systems. (shrink)

A terahertz frequency-modulated continuous wave imaging radar system is developed for high-resolution 3D imaging recently. Aiming at the problems of long data acquisition periods and large sample sizes for the developed imaging system, an algorithm based on compressed sensing is proposed for THz FMCW radar 3D imaging in this paper. Firstly, the FMCW radar signal model is built, and the conventional range migration algorithm is introduced for THz FMCW radar imaging. Then, compressed sensing is extended for THz FMCW radar (...) 3D imaging, and the Newton smooth L0-norm algorithm is presented for sparse measurement data reconstruction. Both simulation and measurement experiments demonstrate the feasibility of reconstructing THz images from measurements even at the sparsity rate of 20%. (shrink)

In cybersecurity, there is a call for adaptive, accurate and efficient procedures to identifying performance shortcomings and security breaches. The increasing complexity of both Internet services and traffic determines a scenario that in many cases impedes the proper deployment of intrusion detection and prevention systems. Although it is a common practice to monitor network and applications activity, there is not a general methodology to codify and interpret the recorded events. Moreover, this lack of methodology somehow erodes the possibility of diagnosing (...) whether event detection and recording is adequately performed. As a result, there is an urge to construct general codification and classification procedures to be applied on any type of security event in any activity log. This work is focused on defining such a method using the so-called normalized compression distance (NCD). NCD is parameter-free and can be applied to determine the distance between events expressed using strings. As a first step in the concretion of a methodology for the integral interpretation of security events, this work is devoted to the characterization of web logs. On the grounds of the NCD, we propose an anomaly-based procedure for identifying web attacks from web logs. Given a web query as stored in a security log, a NCD-based feature vector is created and classified using a support vector machine. The method is tested using the CSIC-2010 data set, and the results are analyzed with respect to similar proposals. (shrink)

In this modern world, a massive amount of data is processed and broadcasted daily. This includes the use of high energy, massive use of memory space, and increased power use. In a few applications, for example, image processing, signal processing, and possession of data signals, etc., the signals included can be viewed as light in a few spaces. The compressive sensing theory could be an appropriate contender to manage these limitations. “Compressive Sensing theory” preserves extremely helpful while signals (...) are sparse or compressible. It very well may be utilized to recoup light or compressive signals with less estimation than customary strategies. Two issues must be addressed by CS: plan of the estimation framework and advancement of a proficient sparse recovery calculation. The essential intention of this work expects to audit a few ideas and utilizations of compressive sensing and to give an overview of the most significant sparse recovery calculations from every class. The exhibition of acquisition and reconstruction strategies is examined regarding the Compression Ratio, Reconstruction Accuracy, Mean Square Error, and so on. (shrink)

Parkinson’s Disease can be treated with the use of microelectrode recording and stimulation. This paper presents a data stream classifier that analyses raw data from micro-electrodes and decides whether the measurements were taken from the subthalamic nucleus (STN) or not. The novelty of the proposed approach is based on the fact that distances based on raw data are used. Two distances are investigated in this paper, i.e. Normalized Compression Distance (NCD) and Lempel-Ziv Jaccard Distance (LZJD). No (...) new features needed to be extracted due to the fact that in the case of high-dimensional data the process is extremely time-consuming. The k-nearest neighbour (k-NN) was chosen as the classifier due to its simplicity, which is essential in data stream classification. Results obtained from classifiers based on k-NN: k-NN, k-NN were compared with Probabilistic Approximate Window (k-NN with PAW); k-NN with Probabilistic Approximate Window and Adaptive Windowing (k-NN with PAW and ADWIN); and Self Adjusting Memory k-NN (SAM k-NN), which use the proposed distances, with the performance of the same classifiers but using standard Euclidean distance. Prequential accuracy was chosen as the performance measure. The results of the experiments performed with the described approach are in most cases better, i.e. the performance measures for kNN classifiers that use NCD and LZJD distances are better by up to 8.5 per cent and 14 per cent, respectively. Moreover, the proposed approach performs better when compared with other stream classification algorithms, i.e. Hoeffding Tree, Naive Bayes, and Leveraging Bagging. In the discussed case, an improvement of classification rate of up to 17.9 per cent when using Lempel-Ziv Jaccard Distance instead of the Euclidean was noted. (shrink)

Image data play important role in various real-time online and offline applications. Biomedical field has adopted the imaging system to detect, diagnose, and prevent several types of diseases and abnormalities. The biomedical imaging data contain huge information which requires huge storage space. Moreover, currently telemedicine and IoT based remote health monitoring systems are widely developed where data is transmitted from one place to another. Transmission of this type of huge data consumes more bandwidth. Along with this, (...) during this transmission, the attackers can attack the communication channel and obtain the important and secret information. Hence, biomedical image compression and encryption are considered the solution to deal with these issues. Several techniques have been presented but achieving desired performance for combined module is a challenging task. Hence, in this work, a novel combined approach for image compression and encryption is developed. First, image compression scheme using wavelet transform is presented and later a cryptography scheme is presented using confusion and diffusion schemes. The outcome of the proposed approach is compared with various existing techniques. The experimental analysis shows that the proposed approach achieves better performance in terms of autocorrelation, histogram, information entropy, PSNR, MSE, and SSIM. (shrink)

The rapid growth of covert activities via communications network brought about an increasing need to provide an efficient method for data hiding to protect secret information from malicious attacks. One of the options is to combine two approaches, namely steganography and compression. However, its performance heavily relies on three major factors, payload, imperceptibility, and robustness, which are always in trade-offs. Thus, this study aims to hide a large amount of secret message inside a grayscale host image without sacrificing (...) its quality and robustness. To realize the goal, a new two-tier data hiding technique is proposed that integrates an improved exploiting modification direction method and Huffman coding. First, a secret message of an arbitrary plain text of characters is compressed and transformed into streams of bits; each character is compressed into a maximum of 5 bits per stream. The stream is then divided into two parts of different sizes of 3 and 2 bits. Subsequently, each part is transformed into its decimal value, which serves as a secret code. Second, a cover image is partitioned into groups of 5 pixels based on the original EMD method. Then, an enhancement is introduced by dividing the group into two parts, namely k1 and k2, which consist of 3 and 2 pixels, respectively. Furthermore, several groups are randomly selected for embedding purposes to increase the security. Then, for each selected group, each part is embedded with its corresponding secret code by modifying one grayscale value at most to hide the code in a -ary notational system. The process is repeated until a stego-image is eventually produced. Finally, the χ2 test, which is considered one of the most severe attacks, is applied against the stego-image to evaluate the performance of the proposed method in terms of its robustness. The test revealed that the proposed method is more robust than both least significant bit embedding and the original EMD. Additionally, in terms of imperceptibility and capacity, the experimental results have also shown that the proposed method outperformed both the well-known methods, namely original EMD and optimized EMD, with a peak signal-to-noise ratio of 55.92 dB and payload of 52,428 bytes. (shrink)

The simplicity of a theory seems closely related to how well the theory summarizes individual data points. Think, for example, of classic curve-fitting. It is easy to get perfect data-fit with a ‘‘theory’’ that simply lists each point of data, but such a theory is maximally unsimple (for the data-fit). The simple theory suggests instead that there is one underlying curve that summarizes this data, and we usually prefer such a theory even at some expense (...) in data-fit. In general, it seems, theorizing involves looking for regularities or patterns in our experience, and such regularities are interesting to us because they summarize how our experience goes. We could list all the ravens we’ve encountered, and their colors, or we could summarize.. (shrink)

According to a traditional view, scientific laws and theories constitute algorithmic compressions of empirical data sets collected from observations and measurements. This article defends the thesis that, to the contrary, empirical data sets are algorithmically incompressible. The reason is that individual data points are determined partly by perturbations, or causal factors that cannot be reduced to any pattern. If empirical data sets are incompressible, then they exhibit maximal algorithmic complexity, maximal entropy and zero redundancy. They are (...) therefore maximally efficient carriers of information about the world. Since, on algorithmic information theory, a string is algorithmically random just if it is incompressible, the thesis entails that empirical data sets consist of algorithmically random strings of digits. Rather than constituting compressions of empirical data, scientific laws and theories pick out patterns that data sets exhibit with a certain noise. (shrink)

Playing an important role in electromechanical systems, hydraulic servo system is crucial to mechanical systems like engineering machinery, metallurgical machinery, ships, and other equipment. Fault diagnosis based on monitoring and sensory signals plays an important role in avoiding catastrophic accidents and enormous economic losses. This study presents a fault diagnosis scheme for hydraulic servo system using compressed random subspace based ReliefF method. From the point of view of feature selection, the scheme utilizes CRSR method to determine the most stable feature (...) combination that contains the most adequate information simultaneously. Based on the feature selection structure of ReliefF, CRSR employs feature integration rules in the compressed domain. Meanwhile, CRSR substitutes information entropy and fuzzy membership for traditional distance measurement index. The proposed CRSR method is able to enhance the robustness of the feature information against interference while selecting the feature combination with balanced information expressing ability. To demonstrate the effectiveness of the proposed CRSR method, a hydraulic servo system joint simulation model is constructed by HyPneu and Simulink, and three fault modes are injected to generate the validation data. (shrink)

This paper claims rigour and sensitivity for a methodology used to explore multiple sources of data and expose the essential characteristics of a phenomenon in the human sciences. A descriptive phenomenological methodology was applied in a study of the experience of ten people with osteoarthritis receiving ginger compress therapy. The application of the phenomenological attitude, with reduction, bracketing and imaginative variation, allowed multiple sources of data – written, pictorial and oral – to be explicated. The applied methodology used (...) is described in this paper, with its six clearly defined steps illustrated by examples from the study. The findings demonstrate that phenomenological reduction enabled an indication of the potential benefits of ginger compress treatment as a therapy for people with osteoarthritis. Indo-Pacific Journal of Phenomenology , May 2010, Volume 10, Edition 1. (shrink)

Christiansen & Chater propose that language comprehenders must immediately compress perceptual data by “chunking” them into higher-level categories. Effective language understanding, however, requires maintaining perceptual information long enough to integrate it with downstream cues. Indeed, recent results suggest comprehenders do this. Although cognitive systems are undoubtedly limited, frameworks that do not take into account the tasks that these systems evolved to solve risk missing important insights.

Guided by the theories of system theory, synergetic theory, and other disciplines and based on fuzzy data mining algorithm, this article constructs a three-tier social security fund cloud audit platform. Firstly, the article systematically expounds the current situation of social security fund and social security fund audit, such as the technical basis of cloud computing and data mining. Combined with the actual work, the necessity and feasibility of building a cloud audit platform for social security funds are analyzed. (...) This article focuses on the construction of the cloud audit platform for social security funds. The general idea of using fuzzy data mining algorithm to build the social security fund audit cloud platform is to compress the knowledge contained in a large number of data into the weights between nodes and optimize the weights through the learning of the neural network system. Through the optimization function, the information contained in the neural network is stored in a few weights as far as possible. The main information is further highlighted by network clipping and removing weights that have little impact on the output. (shrink)

It has been argued that the fundamental laws of physics do not face a ‘problem of provisos’ equivalent to that found in other scientific disciplines (Earman, Roberts and Smith 2002) and there is only the appearance of exceptions to physical laws if they are confused with differential equations of evolution type (Smith 2002). In this paper I argue that even if this is true, fundamental laws in physics still pose a major challenge to standard Humean approaches to lawhood, as they (...) are not in any obvious sense about regularities in behaviour. A Humean approach to physical laws with exceptions is possible, however, if we adopt a view of laws that takes them to be the algorithms in the algorithmic compressions of empirical data. When this is supplemented with a distinction between lossy and lossless compression, we can explain exceptions in terms of compression artefacts present in the application of the lossy laws. (shrink)

What is a larva, if it is not what survives of an ancestor's adult, compressed into a transient pre‐reproductive phase, as suggested by Haeckel's largely disreputed model of evolution by recapitulation? A recently published article hypothesizes that larva and adult of holometabolous insects are developmental expressions of two different genomes coexisting in the same animal as a result of an ancient hybridization event between an onychophoran and a primitive insect with eventless post‐embryonic development. More likely, however, larvae originated from late (...) embryonic or early post‐embryonic stages of ancestors with direct development. Evolutionary novelties would thus be intercalary rather than terminal, with respect to the ancestor's ontogenetic schedule. This scenario, supported by current research on holometabolous insects and marine invertebrates with complex life cycles, offers a serious alternative to the traditional scenario (‘what is early in ontogeny is also early in phylogeny’) underlying the current perception of the evolution of genetic regulatory networks. (shrink)

Likert scales are useful for collecting data on attitudes and perceptions from large samples of people. In particular, they have become a well-established tool in soundscape studies for conducting in situ surveys to determine how people experience urban public spaces. However, it is still unclear whether the metrics of the scales are consistently interpreted during a typical assessment task. The current work aims at identifying some general trends in the interpretation of Likert scale metrics and introducing a procedure for (...) the derivation of metric corrections by analyzing a case study dataset of 984 soundscape assessments across 11 urban locations in London. According to ISO/TS 12913-2:2018, soundscapes can be assessed through the scaling of 8 dimensions: pleasant, annoying, vibrant, monotonous, eventful, uneventful, calm, and chaotic. The hypothesis underlying this study is that a link exists between correlations across the percentage of assessments falling in each Likert scale category and a dilation/compression factor affecting the interpretation of the scales metric. The outcome of this metric correction value derivation is introduced for soundscape, and a new projection of the London soundscapes according to the corrected circumplex space is compared with the initial ISO circumplex space. The overall results show a general non-equidistant interpretation of the scales, particularly on the vibrant-monotonous direction. The implications of this correction have been demonstrated through a Linear Ridge Classifier task for predicting the London soundscape responses using objective acoustic parameters, which shows significant improvement when applied to the corrected data. The results suggest that the corrected values account for the non-equidistant interpretation of the Likert metrics, thereby allowing mathematical operations to be viable when applied to the data. (shrink)

While scientific inquiry crucially relies on the extraction of patterns from data, we still have a far from perfect understanding of the metaphysics of patterns—and, in particular, of what makes a pattern real. In this paper we derive a criterion of real-patternhood from the notion of conditional Kolmogorov complexity. The resulting account belongs to the philosophical tradition, initiated by Dennett :27–51, 1991), that links real-patternhood to data compressibility, but is simpler and formally more perspicuous than other proposals previously (...) defended in the literature. It also successfully enforces a non-redundancy principle, suggested by Ladyman and Ross, that aims to exclude from real-patternhood those patterns that can be ignored without loss of information about the target dataset, and which their own account fails to enforce. (shrink)

The unprecedented prowess of measurement techniques provides a detailed, multi‐scale look into the depths of living systems. Understanding these avalanches of high‐dimensional data—by distilling underlying principles and mechanisms—necessitates dimensional reduction. We propose that living systems achieve exquisite dimensional reduction, originating from their capacity to learn, through evolution and phenotypic plasticity, the relevant aspects of a non‐random, smooth physical reality. We explain how geometric insights by mathematicians allow one to identify these genuine hallmarks of life and distinguish them from universal (...) properties of generic data sets. We illustrate these principles in a concrete example of protein evolution, suggesting a simple general recipe that can be applied to understand other biological systems. (shrink)

This book is the result of several decades of teaching experience in data structures and algorithms. It is self-contained but does assume some prior knowledge of data structures, and a grasp of basic programming and mathematics tools. Basic Concepts in Algorithms focuses on more advanced paradigms and methods combining basic programming constructs as building blocks and their usefulness in the derivation of algorithms. Its coverage includes the algorithms' design process and an analysis of their performance. It is primarily (...) intended as a textbook for the teaching of Algorithms for second-year undergraduate students in study fields related to computers and programming. Klein reproduces his oral teaching style in writing, with one topic leading to another, related one. Most of the classical and some more advanced subjects in the theory of algorithms are covered, though not in a comprehensive manner. The topics include Divide and Conquer, Dynamic Programming, Graph algorithms, probabilistic algorithms, data compression, numerical algorithms and intractability. Each chapter comes with its own set of exercises, and solutions to most of them are appended. (shrink)

Algorithmic probability and friends: Proceedings of the Ray Solomonoff 85th memorial conference is a collection of original work and surveys. The Solomonoff 85th memorial conference was held at Monash University's Clayton campus in Melbourne, Australia as a tribute to pioneer, Ray Solomonoff, honouring his various pioneering works - most particularly, his revolutionary insight in the early 1960s that the universality of Universal Turing Machines could be used for universal Bayesian prediction and artificial intelligence. This work continues to increasingly influence and (...) under-pin statistics, econometrics, machine learning, data mining, inductive inference, search algorithms, data compression, theories of intelligence and philosophy of science - and applications of these areas. Ray not only envisioned this as the path to genuine artificial intelligence, but also, still in the 1960s, anticipated stages of progress in machine intelligence which would ultimately lead to machines surpassing human intelligence. Ray warned of the need to anticipate and discuss the potential consequences - and dangers - sooner rather than later. Possibly foremostly, Ray Solomonoff was a fine, happy, frugal and adventurous human being of gentle resolve who managed to fund himself while electing to conduct so much of his paradigm-changing research outside of the university system. The volume contains 35 papers pertaining to the abovementioned topics in tribute to Ray Solomonoff and his legacy. (shrink)

Donald E. Knuth has been making foundational contributions to the field of computer science for as long as computer science has been a field. His award-winning textbooks are often given credit for shaping the field, and his scientific papers are widely referenced and stand as milestones of development over a wide variety of topics. The present volume, the seventh in a series of his collected papers, is devoted to his work on the design of new algorithms. Nearly thirty of Knuth’s (...) classic papers are collected in this book and brought up to date with extensive revisions and notes on subsequent developments. The papers cover numerous discrete problems, such as assorting, searching, data compression, theorem proving, and cryptography, as well as methods for controlling errors in numerical computations. (shrink)

This paper focuses on the disparate phenomena we psychologize as “selfhood”. A central argument is that, far from being a deus ex machina as required in the Cartesian schema, our felt experience of self is above all a consequence of data compression. In coming to this conclusion, it considers in turn the Cartesian epiphany, other traditional and contemporary perspectives, and a half-century’s empirical work in the Freeman lab on neurodynamics. We introduce the concept of consciousness qua process as (...) a force. (shrink)

We present in this article a compression system that uses STEP compliant standards for the compression and design review visualization of large CAD data sets. Our approach is orthogonal to the traditional techniques applied in the field, as we complement previous works by introducing semantic criteria along with algorithms for the categorization, simplification and user-oriented adaptation of the engineering components described by domain-specific standards. As an example, we have implemented two test cases in two specific domains – (...) ISO-STEP 13013-AP227 in the case of industrial Plant Design, and CIS/2 in the case of Steel Detailing Design (Structures Design). (shrink)

In this book review essay, Justus discusses The Birth of the Mind: How a Tiny Number of Genes Creates the Complexities of Human Thought (2004) by Gary Marcus. The review opens by contrasting the common architectural-blueprint metaphor for the genome with an alternative: the if-then statements of a computer program. The former leads to a seeming “gene shortage” problem while the latter are better suited to representing the cascades of genetic expression that give rise to exponential genotype-phenotype relationships. The essay (...) then develops three conceptual issues of interest to cognitive scientists in light of this small, data-compressed genome: (1) distinguishing dissociations in the developmental process from the domain-specificity of the resulting mental representations, (2) the observation that no gene is specific to a mental representation, a cortical region, or even the nervous system, and (3) the complications that a small number of genes present to the adaptationist programme in evolutionary psychology. The review concludes by questioning the utility of the Swiss Army knife as a metaphor for cognitive development and evolution. (shrink)

This paper presents a computational model of the way humans inductively identify and aggregate concepts from the low-level stimuli they are exposed to. Based on the idea that humans tend to select the simplest structures, it implements a dynamic hierarchical chunking mechanism in which the decision whether to create a new chunk is based on an information-theoretic criterion, the Minimum Description Length (MDL) principle. We present theoretical justifications for this approach together with results of an experiment in which participants, exposed (...) to meaningless symbols, have been implicitly encouraged to create high-level concepts by grouping them. Results show that the designed model, called hereafter MDLChunker, makes precise quantitative predictions both on the kind of chunks created by the participants and also on the moment at which these creations occur. They suggest that the simplicity principle used to design MDLChunker is particularly efficient to model chunking mechanisms. The main interest of this model over existing ones is that it does not require any adjustable parameter. (shrink)