In this paper, we propose two new construction methods for quaternary Hadamard matrices. By the first method, which is applicable for any positive integer n, we are able to construct a quaternary Hadamard matrix of order 2 from a binary sequence with ideal autocorrelation. The second method also gives us a quaternary Hadamard matrix of order 2 from a binary extended sequence of period 2 − 1, wh...

In 1992, A. Ehrenfeucht and J. Mycielski defined a seemingly pseuorandom binary sequence which has since been termed the EM-sequence. The balance conjecture for the EM-sequence, still open, is the conjecture that the sequence of EM-sequence initial segment averages converges to 1=2. In this paper, we do not prove the balance conjecture but we do make some progress concerning it, namely, we prov...

in this paper, an algorithm is presented for the formation of optimal null basis vectors corresponding to sparse flexibility matrices. for controlling the independence of the vectors, a generator is selected in each corresponding self-equilibrating systems, and the sequence of generators is modeled as decision variables. since the equilibrium conditions and uniqueness of generators consists a u...

This paper reviews and investigates Bennett s notions of strong and weak computational depth also called logical depth for in nite binary sequences Roughly an in nite binary sequence x is de ned to be weakly useful if every element of a non negligible set of decidable sequences is reducible to x in recursively bounded time It is shown that every weakly useful sequence is strongly deep This resu...

The linear complexity of a sequence has been used as an important measure of keystream strength, hence designing a sequence which possesses high linear complexity and k-error linear complexity is a hot topic in cryptography and communication. Niederreiter first noticed many periodic sequences with high k-error linear complexity over GF(q). In this paper, the concept of stable k-error linear com...

Encoding, storing, and recalling a temporal sequence of stimuli in a neuronal network can be achieved by creating associations between pairs of stimuli that are contiguous in time. This idea is illustrated by studying the behavior of a neural network model with binary neurons and binary stochastic synapses. The network extracts in an unsupervised manner the temporal statistics of the sequence o...

The preponderance of binary systems in all known stellar populations makes them exciting dynamical agents for research on topics as varied as star formation, star-cluster dynamics and the interiors of young and old stars. Today we know that the Galactic-field binary population is probably a dynamically evolved version of the Taurus–Auriga pre-main sequence population, and that the initial distr...

For evaluating quality of electrical insulation, it is necessary to measure the property of insulators. Dielectric constant and loss tangent (tans) are two important parameters for determining the property of insulator. The measurement of above parameters is normally based on the time- domain and frequency-domain, which is costly and time consuming. In this study a multiple-frequency binary se...

What is the relationship between the complexity of a learner and the randomness of his mistakes ? This question was posed in [7] who showed that the more complex the learner the higher the possibility that his mistakes deviate from a true random sequence. In the current paper we report on an empirical investigation of this problem. We investigate two characteristics of randomness, the stochasti...

As open-source software (OSS) is widely used, many IT organizations adopt OSS without obeying some guidelines for open-source license agreements. To reduce risks related to open-source licenses, the organizations should meet the requirements for OSS licenses. Because some OSS components may be given from major upstream suppliers in binary form, it is very hard to verify whether a binary program...