scholarly journals Π10 classes with complex elements

2008 ◽  
Vol 73 (4) ◽  
pp. 1341-1353 ◽  
Author(s):  
Stephen Binns
Keyword(s):  
Kolmogorov Complexity ◽  
Binary Sequence ◽  
Computable Function ◽  
Cantor Set ◽  
Linear Orders ◽  
Complex Element ◽  
Bounded Below

AbstractAn infinite binary sequence is complex if the Kolmogorov complexity of its initial segments is bounded below by a computable function. We prove that a class P contains a complex element if and only if it contains a wtt-cover for the Cantor set. That is, if and only if for every Y ⊆ ω there is an X in P such that X ≥wttY. We show that this is also equivalent to the class's being large in some sense. We give an example of how this result can be used in the study of scattered linear orders.

scholarly journals A Model for Quantifying the Agent of a Complex Network in Conditions of Incomplete Awareness

2021 ◽  
pp. 26-35
Author(s):  
Andrey Kalashnikov ◽  
◽  
Konstantin Bugajskij ◽  
Keyword(s):  
Information Systems ◽  
Complex Network ◽  
Kolmogorov Complexity ◽  
Binary Sequence ◽  
Data Transformation ◽  
Point Of View ◽  
Negative Consequences ◽  
Complex Information ◽  
Uncertainty Function ◽  
Qualitative Level

Purpose of the article: development of a mechanism for quantitative evaluation of elements of complex information systems in conditions of insufficient information about the presence of vulnerabilities. Research method: mathematical modeling of uncertainty estimation based on binary convolution and Kolmogorov complexity. Data banks on vulnerabilities and weaknesses are used as initial data for modeling. The result: it is shown that the operation of an element of a complex network can be represented by data transformation procedures, which consist of a sequence of operations in time, described by weaknesses and related vulnerabilities. Each operation can be evaluated at a qualitative level in terms of the severity of the consequences in the event of the implementation of potential weaknesses. The use of binary convolution and universal coding makes it possible to translate qualitative estimates into a binary sequence – a word in the alphabet {0,1}. The sequence of such words — as the uncertainty function — describes the possible negative consequences of implementing data transformation procedures due to the presence of weaknesses in an element of a complex system. It is proposed to use the Kolmogorov complexity to quantify the uncertainty function. The use of a Turing machine for calculating the uncertainty function provides a universal mechanism for evaluating elements of complex information systems from the point of view of information security, regardless of their software and hardware implementation.

Shift-complex sequences

2013 ◽  
Vol 19 (2) ◽  
pp. 199-215 ◽  
Author(s):  
Mushfeq Khan
Keyword(s):  
Kolmogorov Complexity ◽  
Initial Segment ◽  
Random Sequence ◽  
Binary Sequence ◽  
Low Complexity ◽  
Constant Number ◽  
Random Sequences ◽  
Halting Problem ◽  
Complex Sequences ◽  
Do So

AbstractA Martin-Löf random sequence is an infinite binary sequence with the property that every initial segment σ has prefix-free Kolmogorov complexity K(σ) at least ∣σ∣ − c, for some constant c ϵ ω. Informally, initial segments of Martin-Löf randoms are highly complex in the sense that they are not compressible by more than a constant number of bits. However, all Martin-Löf randoms necessarily have contiguous substrings of arbitrarily low complexity. If we demand that all substrings of a sequence be uniformly complex, then we arrive at the notion of shift-complex sequences. In this paper, we collect some of the existing results on these sequences and contribute two new ones. Rumyantsev showed that the measure of oracles that compute shift-complex sequences is zero. We strengthen this result by proving that the Martin-Löf random sequences that do not compute shift-complex sequences are exactly the incomplete ones, in other words, the ones that do not compute the halting problem. In order to do so, we make use of the characterization by Franklin and Ng of the class of incomplete Martin-Löf randoms via a notion of randomness called difference randomness. Turning to the power of shift-complex sequences as oracles, we show that there are shift-complex sequences that do not compute Martin-Löf random (or even Kurtz random) sequences.

Efficient Steganography Algorithm Based On DCT And Entropy Thresholding Technique

2018 ◽  
Vol 8 (1) ◽  
pp. 45
Author(s):  
Satvir Singh
Keyword(s):  
Relative Entropy ◽  
Experimental Work ◽  
Random Function ◽  
Signal To Noise Ratio ◽  
Binary Sequence ◽  
Threshold Value ◽  
Absolute Difference ◽  
Secret Message ◽  
Signal To Noise ◽  
Confidential Information

Steganography is the special art of hidding important and confidential information in appropriate multimedia carrier. It also restrict the detection of  hidden messages. In this paper we proposes steganographic method based on dct and entropy thresholding technique. The steganographic algorithm uses random function in order to select block of the image where the elements of the binary sequence of a secret message will be inserted. Insertion takes place at the lower frequency  AC coefficients of the  block. Before we insert the secret  message. Image under goes dc transformations after insertion of the secret message we apply inverse dc transformations. Secret message will only be inserted into a particular block if  entropy value of that particular block is greater then threshold value of the entropy and if block is selected by the random function. In  Experimental work we calculated the peak signal to noise ratio(PSNR), Absolute difference , Relative entropy. Proposed algorithm give high value of PSNR  and low value of Absolute difference which clearly indicate level of distortion in image due to insertion of secret message is reduced. Also value of  relative entropy is close to zero which clearly indicate proposed algorithm is sufficiently secure. 

Examples of theories of presheaf type

2018 ◽  
Author(s):  
Olivia Caramello
Keyword(s):  
Finite Groups ◽  
Linear Independence ◽  
Geometric Theory ◽  
Vector Spaces ◽  
Linear Orders ◽  
Locally Finite ◽  
Strong Unit ◽  
Locally Finite Groups ◽  
Simplicial Sets ◽  
Separable Extensions

This chapter discusses several classical as well as new examples of theories of presheaf type from the perspective of the theory developed in the previous chapters. The known examples of theories of presheaf type that are revisited in the course of the chapter include the theory of intervals (classified by the topos of simplicial sets), the theory of linear orders, the theory of Diers fields, the theory of abstract circles (classified by the topos of cyclic sets) and the geometric theory of finite sets. The new examples include the theory of algebraic (or separable) extensions of a given field, the theory of locally finite groups, the theory of vector spaces with linear independence predicates and the theory of lattice-ordered abelian groups with strong unit.

Minimal distributions in a stochastic partial ordering and bounds for Gaussian processes

1983 ◽  
Vol 20 (03) ◽  
pp. 529-536
Author(s):  
W. J. R. Eplett
Keyword(s):  
Gaussian Process ◽  
Gaussian Processes ◽  
Partial Ordering ◽  
Boundary Crossing ◽  
Conditional Probabilities ◽  
Life Distribution ◽  
Life Distributions ◽  
Bounded Below ◽  
Crossing Probabilities

A natural requirement to impose upon the life distribution of a component is that after inspection at some randomly chosen time to check whether it is still functioning, its life distribution from the time of checking should be bounded below by some specified distribution which may be defined by external considerations. Furthermore, the life distribution should ideally be minimal in the partial ordering obtained from the conditional probabilities. We prove that these specifications provide an apparently new characterization of the DFRA class of life distributions with a corresponding result for IFRA distributions. These results may be transferred, using Slepian's lemma, to obtain bounds for the boundary crossing probabilities of a stationary Gaussian process.

SCALING ANALYSIS OF THE A-PHASE DYNAMICS DURING SLEEP

Fractals ◽  
2020 ◽  
Vol 28 (02) ◽  
pp. 2050050
Author(s):  
V. E. ARCE-GUEVARA ◽  
M. O. MENDEZ ◽  
J. S. MURGUÍA ◽  
A. ALBA ◽  
H. GONZÁLEZ-AGUILAR ◽  
...  
Keyword(s):  
Binary Sequence ◽  
Fluctuation Analysis ◽  
Scaling Analysis ◽  
Scaling Exponent ◽  
Sleep State ◽  
Phase Dynamics ◽  
A Value ◽  
Sleep Condition ◽  
Detrended Fluctuation

In this work, the scaling behavior of the sleep process is evaluated by using detrended fluctuation analysis based on wavelets. The analysis is carried out from arrivals of short and recurrent cortical events called A-phases, which in turn build up the Cyclic Alternating Pattern phenomenon, and are classified in three types: A1, A2 and A3. In this study, 61 sleep recordings corresponding to healthy, nocturnal frontal lobe epilepsy patients and sleep-state misperception subjects, were analyzed. From the A-phase annotations, the onsets were extracted and a binary sequence with one second resolution was generated. An item in the sequence has a value of one if an A-phase onset occurs in the corresponding window, and a value of zero otherwise. In addition, we consider other different temporal resolutions from 2[Formula: see text]s to 256[Formula: see text]s. Furthermore, the same analysis was carried out for sequences obtained from the different types of A-phases and their combinations. The results of the numerical analysis showed a relationship between the time resolutions and the scaling exponents; specifically, for higher time resolutions a white noise behavior is observed, whereas for lower time resolutions a behavior towards to [Formula: see text]-noise is exhibited. Statistical differences among groups were observed by applying various wavelet functions from the Daubechies family and choosing the appropriate sequence of A-phase onsets. This scaling analysis allows the characterization of the free-scale dynamic of the sleep process that is specific for each sleep condition. The scaling exponent could be useful as a diagnosis parameter in clinics when sleep macrostructure does not offer enough information.

scholarly journals Metric Dimension Parameterized By Treewidth

Algorithmica ◽  
2021 ◽  
Author(s):  
Édouard Bonnet ◽  
Nidhi Purohit
Keyword(s):  
Computable Function ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Minimum Size ◽  
Metric Dimension ◽  
Resolving Set ◽  
Input Graph ◽  
Outerplanar Graphs ◽  
Bounded Treewidth ◽  
Fpt Algorithm

AbstractA resolving set S of a graph G is a subset of its vertices such that no two vertices of G have the same distance vector to S. The Metric Dimension problem asks for a resolving set of minimum size, and in its decision form, a resolving set of size at most some specified integer. This problem is NP-complete, and remains so in very restricted classes of graphs. It is also W[2]-complete with respect to the size of the solution. Metric Dimension has proven elusive on graphs of bounded treewidth. On the algorithmic side, a polynomial time algorithm is known for trees, and even for outerplanar graphs, but the general case of treewidth at most two is open. On the complexity side, no parameterized hardness is known. This has led several papers on the topic to ask for the parameterized complexity of Metric Dimension with respect to treewidth. We provide a first answer to the question. We show that Metric Dimension parameterized by the treewidth of the input graph is W[1]-hard. More refinedly we prove that, unless the Exponential Time Hypothesis fails, there is no algorithm solving Metric Dimension in time $$f(\text {pw})n^{o(\text {pw})}$$ f ( pw ) n o ( pw ) on n-vertex graphs of constant degree, with $$\text {pw}$$ pw the pathwidth of the input graph, and f any computable function. This is in stark contrast with an FPT algorithm of Belmonte et al. (SIAM J Discrete Math 31(2):1217–1243, 2017) with respect to the combined parameter $$\text {tl}+\Delta$$ tl + Δ , where $$\text {tl}$$ tl is the tree-length and $$\Delta$$ Δ the maximum-degree of the input graph.

Bratteli–Vershik models for partial actions of ℤ

2017 ◽  
Vol 28 (10) ◽  
pp. 1750073 ◽  
Author(s):  
Thierry Giordano ◽  
Daniel Gonçalves ◽  
Charles Starling
Keyword(s):  
Cantor Set ◽  
Bratteli Diagram ◽  
Partial Action ◽  
Dense Orbits

Let [Formula: see text] and [Formula: see text] be open subsets of the Cantor set with nonempty disjoint complements, and let [Formula: see text] be a homeomorphism with dense orbits. Building on the ideas of Herman, Putnam and Skau, we show that the partial action induced by [Formula: see text] can be realized as the Vershik map on an ordered Bratteli diagram, and that any two such diagrams are equivalent.

Sign in / Sign up

Export Citation Format

Share Document