Neuronal Correlation Parameter in the Idea of Thermodynamic Entropy of an N-Body Gravitationally Bounded System

Understanding how the brain encodes information and performs computation requires statistical and functional analysis. Given the complexity of the human brain, simple methods that facilitate the interpretation of statistical correlations among different brain regions can be very useful. In this report we introduce a numerical correlation measure that may serve the interpretation of correlational neuronal data, and may assist in the evaluation of different brain states. The description of the dynamical brain system, through a global numerical measure may indicate the presence of an action principle which may facilitate a application of physics principles in the study of the human brain and cognition

Decision Problems For Turing Machines

We answer two questions posed by Castro and Cucker, giving the exact complexities of two decision problems about cardinalities of omega-languages of Turing machines. Firstly, it is $D_2(\Sigma_1^1)$-complete to determine whether the omega-language of a given Turing machine is countably infinite, where $D_2(\Sigma_1^1)$ is the class of 2-differences of $\Sigma_1^1$-sets. Secondly, it is $\Sigma_1^1$-complete to determine whether the omega-language of a given Turing machine is uncountable.Comment: To appear in Information Processing Letter

Mobile Agents for Mobile Tourists: A User Evaluation of Gulliver's Genie

How mobile computing applications and services may be best designed, implemented and deployed remains the subject of much research. One alternative approach to developing software for mobile users that is receiving increasing attention from the research community is that of one based on intelligent agents. Recent advances in mobile computing technology have made such an approach feasible. We present an overview of the design and implementation of an archetypical mobile computing application, namely that of an electronic tourist guide. This guide is unique in that it comprises a suite of intelligent agents that conform to the strong intentional stance. However, the focus of this paper is primarily concerned with the results of detailed user evaluations conducted on this system. Within the literature, comprehensive evaluations of mobile context-sensitive systems are sparse and therefore, this paper seeks, in part, to address this deficiency

Challenges in computational lower bounds

We draw two incomplete, biased maps of challenges in computational complexity lower bounds

Spatial Random Sampling: A Structure-Preserving Data Sketching Tool

Random column sampling is not guaranteed to yield data sketches that preserve the underlying structures of the data and may not sample sufficiently from less-populated data clusters. Also, adaptive sampling can often provide accurate low rank approximations, yet may fall short of producing descriptive data sketches, especially when the cluster centers are linearly dependent. Motivated by that, this paper introduces a novel randomized column sampling tool dubbed Spatial Random Sampling (SRS), in which data points are sampled based on their proximity to randomly sampled points on the unit sphere. The most compelling feature of SRS is that the corresponding probability of sampling from a given data cluster is proportional to the surface area the cluster occupies on the unit sphere, independently from the size of the cluster population. Although it is fully randomized, SRS is shown to provide descriptive and balanced data representations. The proposed idea addresses a pressing need in data science and holds potential to inspire many novel approaches for analysis of big data

Revisiting the Rice Theorem of Cellular Automata

A cellular automaton is a parallel synchronous computing model, which consists in a juxtaposition of finite automata whose state evolves according to that of their neighbors. It induces a dynamical system on the set of configurations, i.e. the infinite sequences of cell states. The limit set of the cellular automaton is the set of configurations which can be reached arbitrarily late in the evolution. In this paper, we prove that all properties of limit sets of cellular automata with binary-state cells are undecidable, except surjectivity. This is a refinement of the classical "Rice Theorem" that Kari proved on cellular automata with arbitrary state sets.Comment: 12 pages conference STACS'1

FY 1988 scientific and technical reports, articles, papers and presentations

This document presents formal NASA technical reports, papers published in technical journals, and presentations by MSFC personnel in FY 88. It also includes papers of MSFC contractors. After being announced in STAR, all of the NASA series reports may be obtained from the NationaL Technical Information Service, 5285 Port Royal Road, Springfield, VA 22161. The information in this report may be of value to the scientific and engineering community in determining what information has been published and what is available

The structured phase of concurrency

This extended abstract summarizes the state-of-the-art solution to the structuring problem for models that describe existing real world or envisioned processes. Special attention is devoted to models that allow for the true concurrency semantics. Given a model of a process, the structuring problem deals with answering the question of whether there exists another model that describes the process and is solely composed of structured patterns, such as sequence, selection, option for simultaneous execution, and iteration. Methods and techniques for structuring developed by academia as well as products and standards proposed by industry are discussed. Expectations and recommendations on the future advancements of the structuring problem are suggested