Search

In this letter, a new learnable binary MIMO detection algorithm in massive MIMO systems with one‐bit analog‐to‐digital converters is proposed. A negative penalty is introduced to transform a non‐convex constraint to a convex box constraint and a learnable iterative algorithm is presented based on inexact alternating direction methods of multipliers. The proposed MIMO detection method performs better than the existing binary MIMO detection methods even with lower computational complexity. [ABSTRACT FROM AUTHOR]

Colloidal molecules (CMs) are precisely defined assemblies of nanoparticles (NPs) that mimic the structure of real molecules, but externally programming the precise self‐assembly of CMs is still challenging. In this work, we show that the photo‐induced self‐assembly of complementary copolymer‐capped binary NPs can be precisely controlled to form clustered ABx or linear (AB)y CMs at high yield (x is the coordination number of NP‐Bs, and y is the repeating unit number of AB clusters). Under UV light irradiation, photolabile p‐methoxyphenacyl groups of copolymers on NP‐A*s are converted to carboxyl groups (NP‐A), which react with tertiary amines of copolymers on NP‐B to trigger the directional NP bonding. The x value of ABx can be precisely controlled between 1 and 3 by varying the irradiation duration and hence the amount of carboxyl groups generated on NP‐As. Moreover, when NP‐A* and NP‐B are irradiated after mixing, the assembly process generates AB clusters or linear (AB)y structures with alternating sequence of the binary NPs. This assembly approach offers a simple yet non‐invasive way to externally regulate the formation of various CMs on demand without the need of redesigning the surface chemistry of NPs for use in drug delivery, diagnostics, optoelectronics, and plasmonic devices. [ABSTRACT FROM AUTHOR]

Colloidal molecules (CMs) are precisely defined assemblies of nanoparticles (NPs) that mimic the structure of real molecules, but externally programming the precise self‐assembly of CMs is still challenging. In this work, we show that the photo‐induced self‐assembly of complementary copolymer‐capped binary NPs can be precisely controlled to form clustered ABx or linear (AB)y CMs at high yield (x is the coordination number of NP‐Bs, and y is the repeating unit number of AB clusters). Under UV light irradiation, photolabile p‐methoxyphenacyl groups of copolymers on NP‐A*s are converted to carboxyl groups (NP‐A), which react with tertiary amines of copolymers on NP‐B to trigger the directional NP bonding. The x value of ABx can be precisely controlled between 1 and 3 by varying the irradiation duration and hence the amount of carboxyl groups generated on NP‐As. Moreover, when NP‐A* and NP‐B are irradiated after mixing, the assembly process generates AB clusters or linear (AB)y structures with alternating sequence of the binary NPs. This assembly approach offers a simple yet non‐invasive way to externally regulate the formation of various CMs on demand without the need of redesigning the surface chemistry of NPs for use in drug delivery, diagnostics, optoelectronics, and plasmonic devices. [ABSTRACT FROM AUTHOR]

The study proposes a highly credible true random number generator based on the structural frustration of nematic liquid crystals, which refers to the appearance of two energetically equivalent structures in a nematic system. Frustration is induced in a simple liquid crystal cell by applying an electric field and observing optical textures under crossed polarizers. A clockwise or counterclockwise spiral image appears on 630 separate circular electrodes under the electric field, and random binary sequences are obtained by assigning a digit of 0 or 1 to each image. These sequences pass the strict statistical randomness tests of the National Institute of Standards and Technology with a pass rate of 0.992 or higher for the ten applicable tests and exhibit excellent uniformity. Furthermore, a simple method is introduced to convert the binary results to random decimal numbers with only a minimal amount of data processing. [ABSTRACT FROM AUTHOR]

In this letter, a novel true random number generator (TRNG) with high energy‐efficient and throughput is proposed for cryptographic systems. The current starve based ring oscillator (CSRO) is biased in the subthrehold region as an entropy source. An individual ring oscillator (RO) is sampled using multiple sampling points of the CSRO working in the sub‐threshold region to obtain a multi‐channel sequence output, thereby fully exploiting the randomness of the entropy source. The proposed TRNG is implemented using a standard 40nm CMOS technology and the simulation results show that it provides high‐quality and 20.66 Mbps random sequences while only consuming 11.46 μW at 1.1 V, 25°C. In addition, the proposed TRNG passes the NIST SP 800‐22 and the NIST SP 800‐90B tests without post‐processing and outperforms the state‐of‐the‐art in terms of energy consumption per bit of the output bitstream, reaching 0.555pJ/bit. [ABSTRACT FROM AUTHOR]

We study the problem of prediction of binary sequences with expert advice in the online setting, which is a classic example of online machine learning. We interpret the binary sequence as the price history of a stock, and view the predictor as an investor, which converts the problem into a stock prediction problem. In this framework, an investor, who predicts the daily movements of a stock, and an adversarial market, who controls the stock, play against each other over N turns. The investor combines the predictions of n≥2 experts in order to make a decision about how much to invest at each turn, and aims to minimize their regret with respect to the best‐performing expert at the end of the game. We consider the problem with history‐dependent experts, in which each expert uses the previous d days of history of the market in making their predictions. We prove that the value function for this game, rescaled appropriately, converges as N→∞ at a rate of ON−1/6 to the viscosity solution of a nonlinear degenerate elliptic PDE, which can be understood as the Hamilton‐Jacobi‐Issacs equation for the two‐person game. As a result, we are able to deduce asymptotically optimal strategies for the investor. Our results extend those established by the first author and R.V. Kohn [14] for n=2 experts and d≤4 days of history. © 2022 The Authors. Communications on Pure and Applied Mathematics published by Wiley Periodicals LLC. [ABSTRACT FROM AUTHOR]

An algorithm for recovering transmitted static identifiers (IDs) in rolling shutter based Optical Camera Communication systems is proposed by the authors, considering a system comprised of a camera and a circular light source. The goal is to allow the correct decoding when the ID frame is only partially detected in the image. A baseline algorithm as reference for the frame recovery success rate (FRSR) and a reconstruction algorithm based on the idea of capturing multiple frame fragments and reassembling them is proposed in order to recover the transmitted ID not entirely seen on a single image. It was proven, by simulation, that the maximum distance at which the IDs recovery can be guaranteed is increased by 2.5 fold with the proposed algorithm, for 6‐bit, 8‐bit and 10‐bit codewords. An experimental validation algorithm was also proposed, using image processing techniques to extract the bitstreams and test the ID recovery process. The proposed algorithm improves the FRSR for a given distance, even in the presence of considerable bit errors in the bitstreams extracted from the images. [ABSTRACT FROM AUTHOR]

In recent years, the introduction of photovoltaic power generation systems has been increasing from the perspective of global warming countermeasures. However, there is a problem that it becomes difficult to adjust the supply and demand balance of electric power. Therefore, in this research, the inverter by using estimation signal estimates the load of the consumer, then we aim to adjust the supply‐demand balance at the demand side. By the verification of experimental, three‐phase inverter, which is assumed to be an industrial photovoltaic power generation system, estimates the load by using pseudo random binary sequence (PRBS) signal and two proposed methods. The load estimation results show that the error rate of the estimated resistance of each phase is within a few percent by using the two proposed methods, and the load estimation is achieved. [ABSTRACT FROM AUTHOR]

The prediction of a binary sequence is a classic example of online machine learning. We like to call it the "stock prediction problem," viewing the sequence as the price history of a stock that goes up or down one unit at each time step. In this problem, an investor has access to the predictions of two or more "experts," and strives to minimize her final‐time regret with respect to the best‐performing expert. Probability plays no role; rather, the market is assumed to be adversarial. We consider the case when there are two history‐dependent experts, whose predictions are determined by the d most recent stock moves. Focusing on an appropriate continuum limit and using methods from optimal control, graph theory, and partial differential equations, we discuss strategies for the investor and the adversarial market, and we determine associated upper and lower bounds for the investor's final‐time regret. When d ≤ 4 our upper and lower bounds coalesce, so the proposed strategies are asymptotically optimal. Compared to other recent applications of partial differential equations to prediction, ours has a new element: there are two timescales, since the recent history changes at every step whereas regret accumulates more slowly. © 2022 Wiley Periodicals LLC. [ABSTRACT FROM AUTHOR]

In this article, we explore the extraction of recursive nested structure in the processing of binary sequences. Our aim was to determine whether humans learn the higher‐order regularities of a highly simplified input where only sequential‐order information marks the hierarchical structure. To this end, we implemented a sequence generated by the Fibonacci grammar in a serial reaction time task. This deterministic grammar generates aperiodic but self‐similar sequences. The combination of these two properties allowed us to evaluate hierarchical learning while controlling for the use of low‐level strategies like detecting recurring patterns. The deterministic aspect of the grammar allowed us to predict precisely which points in the sequence should be subject to anticipation. Results showed that participants' pattern of anticipation could not be accounted for by "flat" statistical learning processes and was consistent with them anticipating upcoming points based on hierarchical assumptions. We also found that participants were sensitive to the structure constituency, suggesting that they organized the signal into embedded constituents. We hypothesized that the participants built this structure by merging recursively deterministic transitions. [ABSTRACT FROM AUTHOR]

Beliefs like the Gambler's Fallacy and the Hot Hand have interested cognitive scientists, economists, and philosophers for centuries. We propose that these judgment patterns arise from the observer's mental models of the sequence‐generating mechanism, moderated by the strength of belief in an a priori base rate. In six behavioral experiments, participants observed one of three mechanisms generating sequences of eight binary events: a random mechanical device, an intentional goal‐directed actor, and a financial market. We systematically manipulated participants' beliefs about the base rate probabilities at which different outcomes were generated by each mechanism. Participants judged 18 sequences of outcomes produced by a mechanism with either an unknown base rate, a specified distribution of three equiprobable base rates, or a precise, fixed base rate. Six target sequences ended in streaks of between two and seven identical outcomes. The most common predictions for subsequent events were best described as pragmatic belief updating, expressed as an increasingly strong expectation that a streak of identical signals would repeat as the length of that streak increased. The exception to this pattern was for sequences generated by a random mechanical device with a fixed base rate of.50. Under this specific condition, participants exhibited a bias toward reversal of streaks, and this bias was larger when participants were asked to make a dichotomous choice versus a numerical probability rating. We review alternate accounts for the anomalous judgments of sequences and conclude with our favored interpretation that is based on Rabin's version of Tversky & Kahneman's Law of Small Numbers. [ABSTRACT FROM AUTHOR]

This paper presents the design of an automatic gain control (AGC) loop for high‐speed communication systems, which can be used in wired, wireless, or optical receiver. The design is performed in 130 nm SiGe BiCMOS technology. A Gilbert cell‐based variable gain amplifier is designed, which shows approximately linear gain control with respect to the gain control voltage. The variable gain amplifier is followed by two fixed gain cascode amplifiers. Then, a full wave rectifier‐based peak detector is designed and analyzed. To reduce the peak detector error, a compensation technique is applied. Finally, an operational amplifier is designed, which is used as voltage adder and comparator. The designed AGC loop is simulated with sinusoidal and pseudorandom binary sequence (prbs) input signal with high frequency signal of 1 to 30 GHz. The simulation results of the AGC loop show that a gain tuning range of 47 dB (−7 to 40 dB) is obtained in this design. It is also seen that the reference signal can be varied from 50 to 200 mV. This AGC works in the input voltage signal range between 3 mV peak and 230 mV peak, and the power dissipation of is 79 mW. [ABSTRACT FROM AUTHOR]

Binary population synthesis provides a direct way of studying the effects of different choices of binary evolution models and initial parameter distributions on present‐day compact binary merger populations, which can then be compared to empirical properties such as observed merger rates. Samples of zero‐age main sequence binaries to be evolved by such codes are typically generated from a universal initial mass function (IMF) and simple, uniform, distributions for orbital period P, mass ratio q, and eccentricity e. More recently, however, mounting observational evidence has suggested the non‐universality of the IMF and the existence of correlations between binary parameters. In this study, we implement a metallicity‐ and redshift‐dependent IMF alongside correlated distributions for P, q, and e to generate representative populations of binaries at varying redshifts, which are then evolved with the COMPAS code in order to study the variations in merger rates and overall population properties. [ABSTRACT FROM AUTHOR]

This paper presents an optimized stochastic multiplier to implement Izhikevich spiking neuron model. A novel stochastic number generator is used as the main block for stochastic computing to design a stochastic multiplier. The designed multiplier was used to describe and implement Izhikevich neuron model equation which is capable to produce variant responses of spiking neurons. To the best of the author's knowledge, this work is the pioneer using a designed multiplier for computing all of the multiplication expressions in spiking neuron equation. The effect of increasing number of bit streams on the accuracy of stochastic computing is studied. Furthermore, some numerical intervals that are more prone to the error are found and illustrated upon stochastic computing usage, and a method is proposed to improve the error prone numerical intervals. In addition, the response accuracy is optimized by changing time step parameter in solving ordinary differential Izhikevich neuron model equation using Euler's method. Hence, a 13‐bit stochastic multiplier is designed. It is found that variations in parameters a and b have a profound effect on the accuracy of recovery variable u and, consequently, on the responses. Out of 20 responses of Izhikevich neuron model, 11 responses are generated using the proposed stochastic computing method and compared with piecewise linear method and some previous architectures of Izhikevich neuron model implementations. [ABSTRACT FROM AUTHOR]

True random number generators (TRNGs) are mainly used in cryptographic applications for the generation of various keys. A standard CMOS‐based TRNG utilizes physical phenomena such as thermal noise, metastability, and oscillator jitter to generate fully non‐deterministic random outputs but has high power dissipation and a large overhead area. In this work, we develop a novel low power non‐volatile TRNG circuit that utilizes the inherent stochastic switching nature of magnetic tunnel junction (MTJ) as a randomness source. Thanks to the capabilities of MTJ and carbon nanotube field‐effect transistors (CNTFETs), the proposed TRNG circuit consumes low power when compared with conventional CMOS‐based TRNGs. The reliability of the proposed circuit is checked by running the corner case tests that considers all the process and environmental variations. The quality of the output bitstream is evaluated by running the twelve statistical randomness tests by the U.S National Institute of Standards and Technology (NIST). The circuit passes all the tests, meaning the output bit‐stream is truly random. The circuit is designed in such a way that, even if the power is turned off, the quality of the randomness is not affected. The proposed TRNG structure has a less complex design and generates truly random output. [ABSTRACT FROM AUTHOR]

Summary: Summarizing of multi‐see video and penetrating information depicts an augmentation of the high‐performance video coding (HPVC) criterion. Multi‐see recordings taken by numerous cameras of the same scene from various positions and edges progress towards becoming feasible since little estimated and less value cameras are accessible. Multi‐see video enables the customers to unreservedly change their viewpoints whenever they need to see the scene from any position. For profundity coding, new intracoding modes, an altered movement pay, and movement vector coding and also the idea of movement parameter legacy are a piece of the HPVC expansion. A novel encoder control utilizes see blend improvement, which ensures that amazing middle of the road perspectives can be produced in view of the decoded information. The bit stream arrange bolsters the extraction of halfway piece streams, with the goal that traditional latest video standards like 2D, stereo, multi‐see in addition to profundity organization can be de‐transmit from a solitary piece stream. We proposed a novel saliency detection technique for stereoscopic pictures, which depends on local‐global differentiation highlights, trailed by encompassing district improvement and stereo focus earlier upgrade and furthermore we have proposed an algorithm that effectively chooses a near‐optimalinterview PS and related texture and profundity QPs, at GOP level, when the MVD information organize is utilized for IMVS frameworks. Objective and subjective outcomes are introduced, exhibiting that the proposed approach gives half piece rate investment funds in correlation with JMVDC simulcast and 22% in examination with a direct multi‐see expansion of JMVDC without the recently created coding instruments. [ABSTRACT FROM AUTHOR]

We introduce a model for recurrent event data subject to left‐, right‐, and intermittent‐censoring. The observations consist of binary sequences (along with covariates) for each individual under study. These sequences are modeled as generated by latent Ornstein–Uhlenbeck processes being above or below certain thresholds. Features of the latent process and the thresholds are taken as functions of covariates, allowing the researcher to distinguish factors that have an effect on the frailty, from those that have an effect on the variability, of the observational unit. Inference is achieved by a quasi‐likelihood approach, for which consistency and asymptotic normality is established. An advantage of our model is that particularities regarding the censoring need not be taken actively into account, and that it is well suited for situations where the individuals under study are irregularly and asynchronously observed. The motivation for our model came from a dataset pertaining to the incidence of diarrhoea among Brazilian children growing up under rather harsh conditions. We analyze these data with our model and contrast the results with an intensity‐based counting process analysis of the same data. [ABSTRACT FROM AUTHOR]

A 4.5 Gb/s/pin transceiver capable of eliminating the inter‐symbol interference (ISI) and far‐end crosstalk (FEXT) in a hybrid scheme with low power and small area for next‐generation high‐bandwidth memory (HBM) interfaces is presented. Built around the combination of two ISI and FEXT equalization topologies, the transmitter (TX) energy efficiently reduces data‐dependent jitter (DDJ) and crosstalk‐induced jitter (CIJ) by using the compensation signal generated from edge detectors (ED) to ensure the sampling margin. The prototype transceiver, implemented using a 28‐nm complementary metal‐oxide semiconductor (CMOS) process, operates over a 3‐mm mimicked silicon interposer channel with 21.2‐dB loss. It achieves a data rate per density of 9 Gb/s/μm at a bit error rate (BER) < 10–12 with 0.23 unit interval (UI) eye width for pseudorandom binary sequence (PRBS)15 data while consuming only 1.46 pJ/bit. [ABSTRACT FROM AUTHOR]

Summary: In this paper, we propose an efficient method for generating two types of novel optimized long binary spreading sequences (OLBSS) with improved autocorrelation function (ACF) properties. The first type is constructed from concatenated short binary subsequences belonging to the same code family, such as Walsh Hadamard and Gold subsequences, provided that their cross‐correlation functions (CCFs) have good properties. The second category uses the same subsequences but which are rather interlaced. Here, the number and size of the subsequences are related to the chosen length of the final constructed long sequence and the desired performances. The realization of the OLBSSs is achieved using two different optimization techniques, namely, the genetic algorithms (GAs) and particle swarm optimization (PSO) method. The simulation results, based on MATLAB tool, have shown that the proposed long sequences, composed of Walsh–Hadamard subsequences and optimized by the GA, have better ACF properties compared to the original Gold, Weil, and random sequences of the same length. [ABSTRACT FROM AUTHOR]

In this study, a novel reversible data hiding (RDH) in encrypted domain scheme for coding channel based on sliding-block segmentation and adaptive steganography is proposed. The proposed scheme enriches the residual information with as little additional encryption information as possible to improve the testing error rate of a steganalyser by sliding-block segmentation with bit stream encryption. The specific encryption process effectively weakens the correlation between the adjacent pixels and minimises the size of key stream bits. The encryption key can be further embedded in the channel code stream before transmitted in the channel. Experimental analysis shows that the image encrypted by the proposed RDH scheme can achieve a peak-signal-to-noise ratio of >50 dB, as the payload is 0.5 bits per pixel (bpp). In terms of security performance, compared with the state-of-the-art methods, their method has a higher testing error rate when the steganalyser is utilised. Even if the payload is 0.5 bpp, the testing error rate is >0.25. [ABSTRACT FROM AUTHOR]

New Findings: What is the central question of this study?What are the dynamic characteristics of cerebrovascular carbon dioxide reactivity and the central respiratory chemoreflex?What is the main finding and its importance?The transfer function gain from the end‐tidal partial pressure of carbon dioxide to cerebral blood flow or ventilation decreased in the high frequency range at rest and during exercise. These findings indicate that the dynamic characteristics of both systems were not constant in all frequency ranges, and this trend was not modified by exercise. The purpose of this study was to examine the dynamic characteristics of cerebrovascular reactivity and ventilatory response to change in arterial CO2 in all frequency ranges at rest using frequency domain analysis, and also to examine whether this is modified by dynamic exercise as with the traditionally determined cerebrovascular CO2 reactivity. In nine healthy young subjects, at rest and during exercise (cycling exercise at constant predetermined work rate corresponding to a V̇O2 level of 0.90 l min−1), the dynamic characteristics of cerebrovascular CO2 reactivity and the central respiratory chemoreflex were assessed by transfer function analysis using a binary white‐noise sequence (0–7% inspired CO2 fraction) from the end‐tidal partial pressure of CO2 (PETCO2) to the mean middle cerebral artery mean blood velocity (MCA Vm) or minute ventilation (V̇E), respectively. In the high frequency range, both transfer function gains decreased but, interestingly, the cut‐off frequency in the transfer function gain from PETCO2 to MCA Vm response was higher than that from PETCO2 to V̇E response at rest (0.024 vs. 0.015 Hz) and during exercise (0.030 vs. 0.011 Hz), indicating that cerebrovascular CO2 reactivity or central respiratory chemoreflex was not constant in all frequency ranges, and this trend was not modified by exercise. These findings suggest that dynamic characteristics of the cerebrovascular CO2 reactivity or central chemoreflex need to be assessed to identify the whole system because the traditional method cannot identify the property of time response of these systems. [ABSTRACT FROM AUTHOR]

This study considers a H∞ filtering problem for discrete‐time switched systems with multiple packet dropouts. The switching signal may be lost that is similar to the measurement signal during transmission. Also, the multiple packet‐dropouts phenomenon is described by Bernoulli binary sequences. With the aid of a novel switched Lyapunov function containing a random change of switching rate, sufficient conditions in the form of linear matrix inequalities for the desired filter are derived, which ensure the filtering error system is exponentially stable in the sense of mean square with prescribed H∞ performance. Finally, a practical example is given to verify the effectiveness of the proposed approaches. [ABSTRACT FROM AUTHOR]

In this review we shortly summarize in an accessible way the physical and nanoscale material science aspects of the promising field of molecular quantum cellular automata (QCA). QCA is a revolutionary paradigm in quantum electronics with promising application in the conceptually new computing scheme which can be referred to as "computing with molecules". This scheme of devices have vitally important advantages compared with conventional schemes of quantum computing in which the binary information is stored in the eigenvectors of a two‐level quantum system and therefore their practical application is strongly limited by the requirement of coherence. Molecular QCA promise nanometer‐scale units with ultra‐high device densities, as well as room temperature operation with extremely small heat release. Molecular materials provide at the same time options to control the key properties of the active molecules by chemical means. Hereunder we summarize the background of the electronic and vibronic problems in QCA cells represented by the tetrameric mixed‐valence (MV) complexes and organic molecules proposed for implementation as four‐site molecular QCA. We discuss the basic model of the molecular cell that include the following ingredients: 1) intracell Coulomb repulsion energy of the electrons in different electronic distributions among the redox sites; 2) electron transfer between redox sites which changes electronic distributions; 3) interaction of the itinerant electrons with molecular vibrations which is referred to as the vibronic interactions; 4) intercell Coulomb interaction by mean of which the binary information is transmitted from cell to cell. On the basis of this model we will study the cell polarization, adiabatic picture of the switching cycle describing interaction between the "input" and "output" molecular cells, non‐linear cell‐cell response function whose shape describes the action of molecular logic gates. Along with developed and current problems, we discuss new challenging trends of research in this fascinating area. [ABSTRACT FROM AUTHOR]

This study has given the investigation for achievable net coding gain (NCG) of optical forward error correction (FEC) coding scheme with convolutional code to control the received sensitivity following a required signal‐to‐noise ratio in the communication channel. The achievable NCG is obtained from the difference between the upper bound NCG and the power penalty of the optical exclusive‐OR (XOR) gate, which is based on a four‐wave mixing in highly non‐linear fibre. The upper bound NCG was analytically derived by calculating error probability of optimal convolutional code, and the power penalty was numerically derived by comparing bit‐error rates between with and without the optical FEC coding. To confirm the feasibility for achieving the highest NCG, the optimal operating condition of the optical XOR gate is experimentally evaluated to minimise their power penalty. A 0.5 dB power penalty was obtained at BER=10−9 under the optimised condition with 223−1 pseudo‐random binary sequence differential phase‐shift keying‐modulated return to zero signal at 10 Gbps. [ABSTRACT FROM AUTHOR]

A data embedding solution in HEVC videos is proposed by modifying the partitioning of coding units (CUs). The partitions of a CU are first represented as a sequence of binary flags. The flags pertaining to 16 × 16 sub CUs are used as a cover for data embedding, where 6 or 4 message bits are embedded per CU. The data embedding algorithm guarantees that a maximum of one partition is modified per message segment, therefore, in a given CU, either 0, 1 or 2 partitions are modified. The proposed solution is assessed in terms of message payload, number of modified partitions, loss in video quality as indicated by the PSNR results, mean objective scores and excessive bitrate. The proposed solution can embed messages with up to an average payload of 32.6 kbit/s with a corresponding average distortion of <0.5 dB. Comparisons with existing solutions reveal that the proposed solution maintains similar message payloads with less modifications of CU partitioning and at the same time resulting in less distortions for the cover video. [ABSTRACT FROM AUTHOR]

We consider the notion of prediction functions (or predictors) studied before in the context of randomness and stochasticity by Ko, and later by Ambos‐Spies and others. Predictor is a total computable function which tries to predict bits of some infinite binary sequence. The prediction error is defined as the limit of the number of incorrect answers divided by the number of answers given so far. We discuss indefiniteness of prediction errors for weak 1‐generics and show that this phenomenon affects certain c.e. sequences as well. On the other hand, a notion of optimal predictor is considered. It is shown that there is a sequence for which increasingly better predictors exist but for which no predictor is optimal. [ABSTRACT FROM AUTHOR]

This study describes a time domain channel sounder based on binary sequences. The channel sounder system consists of several off‐the‐shelf laboratory instruments and is controlled by a PC. The frequency band of interest is the unlicensed millimetre wave band, 57–64 GHz. A crucial feature of the proposed system is its fast measurement speed enabling measurements of realistic vehicular scenarios. The main part of the study is dedicated to the description and analysis of the system behaviour when nonlinear components, such as mixers, low noise amplifiers or power amplifiers are used. The contributions of this study are the description of how to mitigate these effects utilising several different excitation signals and the evaluation and comparison of the channel sounder performance in terms of the spurious‐free dynamic range parameter. [ABSTRACT FROM AUTHOR]

In this Letter, based on certain binary Golay complementary pairs and deletion function, a new construction of binary near complementary sequences with low peak-to-average power ratio is proposed. The length of these sequences takes the form $2^{a+1}10^b26^c-2$2a+110b26c−2 (where a, b and c are non-negative integers) and has not been reported before. [ABSTRACT FROM AUTHOR]

In this Letter, a new construction of complementary sequence sets (CSSs) is proposed by concatenating Golay complementary pairs (GCPs) which could have different lengths. The constructed CSSs have flexible sequence lengths, i.e. $2L+N$2L+N , where L and N are the lengths of two constituting GCPs. For example, the proposed method can be used to construct quadriphase CSSs of all lengths up to 100, except 87 and 95. The feasibility for practical applications of CSSs will be enhanced due to their flexible lengths and good peak-to-average power ratio property. [ABSTRACT FROM AUTHOR]

The authors investigated the problem of overestimation with the Volterra series transfer function (VSTF) and an artificial neural network (ANN), which are used for non‐linear equalisers in optical communication systems. The results revealed that the risk of predicting a pseudo‐random binary sequence (PRBS) pattern, which causes overestimation of the equaliser performance, occurs not only with an ANN but also with the VSTF. When using PRBS9, PRBS11 and PRBS15, the number of taps of a feedforward tapped delay line, which is required in the VSTF to predict the PRBS pattern, was the same as that with the ANN. When the second‐order Volterra kernels were omitted, a larger number of taps was required in the VSTF to observe the overestimation. [ABSTRACT FROM AUTHOR]

This study investigates the security problem for a class of polytopic uncertain systems by virtue of robust model predictive control (RMPC) approach. In consideration of the difficulties in accessing the system states, a novel dynamic‐output‐feedback RMPC strategy is presented to guarantee the security of the discussed system subject to randomly occurring deception attacks and persistent bounded disturbances. Such the randomly occurring attack is characterised by using a Bernoulli binary distributed white sequence with a given successful probability. Under this condition, a novel concept of system security in mean‐square sense is presented based on RMPC technique, in which the system is required not only to satisfy the specified performance index but also to keep all the states in an invariant set by designing a time‐varying terminal constraint set. Moreover, due to the presence of the persistent bounded disturbances and model uncertainties, the worst‐case cost function is considered. By using a Lyapunov function approach dependent of the input‐to‐state stability (ISS), the dynamic‐output‐feedback RMPC scheme is designed by solving an optimisation problem including some inequality constraints, and the upper bound of the investigated cost function is obtained. In addition, the ISS performance is ensured for the polytopic uncertain system with both the randomly occurring deception attacks and persistent disturbances. Finally, a numerical simulation example is developed to show the effectiveness of the proposed dynamic‐output‐feedback RMPC strategy. [ABSTRACT FROM AUTHOR]

We characterise the collections of infinite binary sequences that, when barred by a set of finite binary sequences, are also barred by a finite subset of such a set. [ABSTRACT FROM AUTHOR]

Recently, Lee and Tsai proposed a new authentication method for greyscale document images using the portable network graphics format image; however, their method cannot resist the self‐substitution attack, the same‐position‐substitution attack, or the cut‐off attack. Furthermore, those attacks can be completed by the popular image editing software Adobe Photoshop. Therefore, the authors proposed a security‐enhanced authentication scheme based on Lee and Tsai's method. The authors' proposed scheme uses three random binary sequences to randomise the binary version of a given greyscale document image, and thus overcomes the security flaws mentioned above. The authors' proposed scheme is capable of repairing the content of the given stego‐image if attacked by the methods mentioned above. Moreover, the authors' proposed scheme retains all of the strengths of Lee and Tsai's scheme. The authors improve the opacity of the alpha channel of stego‐image by using Wang and Su's extended secret sharing, and enhance the data security by using Hash functions. The experimental results show that the authors' proposed scheme is effective for application. [ABSTRACT FROM AUTHOR]

This study extends the authors' earlier work to show that the Gaussian integer sequences of period pm - 1 with p - 2 non-zero out-of-phase autocorrelation values can be constructed from the known families of two-tuple-balanced p-ary sequences over the finite field Fpm, where p is an odd prime and m≥ 2. The proposed Gaussian integer sequences have high energy efficiency and are superior to the perfect Gaussian integer sequences (introduced by Hu et al. in 2012) for the peak-to-average power ratio reduction in orthogonal frequency-division multiplexing systems. [ABSTRACT FROM AUTHOR]

The authors investigate the problem of control and channel resource allocation of a set of plants controlled by a remote computer in a cyber‐physical system framework via a wireless network. Owing to capacity limitation, at any time only a subset of plants are allowed to be attended by the cyber controller while others must wait. To establish a promising scheduling policy regulating the allocation of the controller attention to the plants, they use binary sequences to model the allocation procedure. Taking advantage of the binary sequences and considering the packet loss effects in the channel, they establish sufficient conditions guaranteeing simultaneous stabilisation of the collection of systems. Most excitedly, a systematic methodology for the scheduling and controller co‐design is established, which supplies a constructive and easily applicable design tool for most regular binary sequences and state‐feedback controllers for the collection of plants. The theory and the results are built on the piecewise Lyapunov function method and the average dwell time techniques. A numerical example and laboratory experiment results are given to demonstrate the effectiveness of the binary sequences sequence‐based co‐design method. [ABSTRACT FROM AUTHOR]

A 2D approach was studied for the design of polymer-based molecular barcodes. Uniform oligo(alkoxyamine amide)s, containing a monomer-coded binary message, were synthesized by orthogonal solid-phase chemistry. Sets of oligomers with different chain-lengths were prepared. The physical mixture of these uniform oligomers leads to an intentional dispersity (1st dimension fingerprint), which is measured by electrospray mass spectrometry. Furthermore, the monomer sequence of each component of the mass distribution can be analyzed by tandem mass spectrometry (2nd dimension sequencing). By summing the sequence information of all components, a binary message can be read. A 4-bytes extended ASCII-coded message was written on a set of six uniform oligomers. Alternatively, a 3-bytes sequence was written on a set of five oligomers. In both cases, the coded binary information was recovered. [ABSTRACT FROM AUTHOR]

Intramolecularly stabilized Sb(OCH2CH2NMe2)3 ( 1) and Bi(OCH2CH2NMe2)3 ( 2) readily react with (Me3Si)2S and (Et3Si)2E (E = Se, Te) at moderate temperatures (hot injection method) with elimination of the corresponding silyl ether and subsequent formation of the group 15 chalcogenides Sb2E3 and Bi2E3, which were characterized by XRD, SEM, and energy-dispersive X-ray spectroscopy (EDX). In addition, the solid-state structure of 1 was determined by single-crystal XRD. [ABSTRACT FROM AUTHOR]

Sequence pairs with good correlation can be applied in many practical systems. In this Letter, the authors construct a class of p‐ary sequence pairs of period 2p2 by interleaving two p‐ary sequences derived from Fermat quotient, where p is an odd prime. In the authors' construction, sequence pairs have almost perfect correlation. [ABSTRACT FROM AUTHOR]

This paper is concerned with the simultaneous stabilization of a collection of plants shared by the wireless network with capacity limitation. We use most regular binary sequences (MRBS) to control the medium access status of the plants. The design procedure of the scheduling policy translates to determine two parameters of the MRBS. With the MRBS protocol, each plant is essentially a sampled-data control system with time varying sampling intervals. We derive a sufficient condition for determining the MRBS protocol that guarantees the controllability, observability, and stability of each plant. Most importantly, we give a methodology for MRBS protocol and controller co-design, in which the controller has switching gains that are piecewise constant and dependent on the sampling intervals yielded by the MRBS. The main results are established using piecewise Lyapunov functional and the average dwell time technique. It is shown that the method can guarantee simultaneous stabilization of the collection of plants robustly in situations where the controller gain does not match the sampling interval or the sampling interval violates the maximum allowable transmission interval criteria. A numerical example is given to demonstrate the effectiveness of the co-design method. Copyright © 2015 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

The paper considers a model for crossover designs with carryover effects and a random interaction between treatments and subjects. Under this model, two observations of the same treatment on the same subject are positively correlated and therefore provide less information than two observations of the same treatment on different subjects. The introduction of the interaction makes the determination of optimal designs much harder than is the case for the traditional model. Generalising the results of Bludowsky's thesis, the present paper uses Kushner's method to determine optimal approximate designs. We restrict attention to the case where the number of periods is less than or equal to the number of treatments. We determine the optimal designs in the important special cases that the number of periods is 3, 4 or 5. It turns out that the optimal designs depend on the variance of the random interactions and in most cases are not binary. However, we can show that neighbour balanced binary designs are highly efficient, regardless of the number of periods and of the size of the variance of the interaction effects. [ABSTRACT FROM AUTHOR]

An inductorless 13 Gbit/s analogue equaliser with an additional low‐frequency equalisation (LFEQ) to counter the low‐frequency channel losses is presented. An active feedback topology for the proposed equaliser together with negative capacitance circuit is used to extend the bandwidth to compensate a 15 dB channel loss at Nyquist. The LFEQ improves the measured data jitter of the conventional equaliser from 0.41 to 0.12 UI, for a pseudorandom binary sequence of 231 − 1. The proposed prototype was implemented in 65 nm CMOS, occupying active area of merely 0.058 mm2. It exhibits a power efficiency of 1.07 mW/Gitb/s under a supply voltage of 1.2 V and a BER < 10−12. [ABSTRACT FROM AUTHOR]

The benefits of adjusting for baseline covariates are not as straightforward with repeated binary responses as with continuous response variables. Therefore, in this study, we compared different methods for analyzing repeated binary data through simulations when the outcome at the study endpoint is of interest. Methods compared included chi-square, Fisher's exact test, covariate adjusted/unadjusted logistic regression (Adj.logit/Unadj.logit), covariate adjusted/unadjusted generalized estimating equations (Adj.GEE/Unadj.GEE), covariate adjusted/unadjusted generalized linear mixed model (Adj.GLMM/Unadj.GLMM). All these methods preserved the type I error close to the nominal level. Covariate adjusted methods improved power compared with the unadjusted methods because of the increased treatment effect estimates, especially when the correlation between the baseline and outcome was strong, even though there was an apparent increase in standard errors. Results of the Chi-squared test were identical to those for the unadjusted logistic regression. Fisher's exact test was the most conservative test regarding the type I error rate and also with the lowest power. Without missing data, there was no gain in using a repeated measures approach over a simple logistic regression at the final time point. Analysis of results from five phase III diabetes trials of the same compound was consistent with the simulation findings. Therefore, covariate adjusted analysis is recommended for repeated binary data when the study endpoint is of interest. Copyright © 2015 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

A late-stage clinical development program typically contains multiple trials. Conventionally, the program's success or failure may not be known until the completion of all trials. Nowadays, interim analyses are often used to allow evaluation for early success and/or futility for each individual study by calculating conditional power, predictive power and other indexes. It presents a good opportunity for us to estimate the probability of program success (POPS) for the entire clinical development earlier. The sponsor may abandon the program early if the estimated POPS is very low and therefore permit resource savings and reallocation to other products. We provide a method to calculate probability of success (POS) at an individual study level and also POPS for clinical programs with multiple trials in binary outcomes. Methods for calculating variation and confidence measures of POS and POPS and timing for interim analysis will be discussed and evaluated through simulations. We also illustrate our approaches on historical data retrospectively from a completed clinical program for depression. Copyright © 2015 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

In this Letter, two constructions of new binary sequences with optimal autocorrelation magnitude of length 4N derived from binary sequences with optimal autocorrelation of length N = 2 (mod 4) and almost‐perfect binary sequences of length 2N using N × 2 interleaved structure is presented. The first construction is to use binary Sidelnikov sequences of length N = pn−1 whereas the second one is to use binary Ding–Helleseth–Martinsen sequences of length N = 2p. The obtained sequences have large linear complexity and can be used in communication and cryptography. [ABSTRACT FROM AUTHOR]

The Brier Score is a widely used criterion to assess the quality of probabilistic predictions of binary events. The expectation value of the Brier Score can be decomposed into the sum of three components called reliability, resolution and uncertainty, which characterize different forecast attributes. Given a dataset of forecast probabilities and corresponding binary verifications, these three components can be estimated empirically. Here, propagation of uncertainty is used to derive expressions that approximate the sampling variances of the estimated components. Variance estimates are provided for both the traditional estimators, as well as for refined estimators that include a bias correction. Applications of the derived variance estimates to artificial data illustrate their validity and application to a meteorological prediction problem illustrates a possible usage case. The observed increase of variance of the bias-corrected estimators is discussed. [ABSTRACT FROM AUTHOR]

An ordered pair of semi-infinite binary sequences (η,ξ) is said to be compatible if there is a way of removing a certain number (possibly infinite) of ones from η and zeroes from ξ that would map both sequences to the same semi-infinite sequence. This notion was introduced by Peter Winkler, who also posed the following question: η and ξ being independent i.i.d. Bernoulli sequences with parameters p′ and p, respectively, does there exist ( p′, p) so that the set of compatible pairs has positive measure? It is known that this does not happen for p and p′ very close to [ABSTRACT FROM AUTHOR]

Let $A_n=(a_0,a_1,\ldots ,a_{n-1})$ be drawn uniformly at random from ${\{ }-1,+1{\} }^n$ and define\[M(A_n)=\max _{01}{\mathrm {}}.\]It is proved that $M(A_n)/\sqrt {n\log n}$ converges in probability to $\sqrt {2}$. This settles a problem first studied by Moon and Moser in the 1960s and proves in the affirmative a recent conjecture due to Alon, Litsyn, and Shpunt. It is also shown that the expectation of $M(A_n)/\sqrt {n\log n}$ tends to $\sqrt {2}$. [ABSTRACT FROM AUTHOR]

We investigate a directed metric on the space of infinite binary sequences defined by [ABSTRACT FROM AUTHOR]

Eight pigeons responded in a concurrent-chains procedure in which terminal-link schedules changed pseudorandomly across sessions. Pairs of terminal-link delays either summed to 15 s or to 45 s. Across sessions, the location of the shorter terminal link changed according to a pseudorandom binary sequence. On some terminal links, food was withheld to obtain start and stop times, measures of temporal control. Log initial-link response ratios stabilized within the first half of each session. Log response ratio was a monotonically-increasing but nonlinear function of programmed log terminal-link immediacy ratio. There was an effect of absolute terminal-link duration on log response ratio: For most subjects, preference for the relatively shorter terminal-link delay was stronger when absolute delays were long than when absolute delays were short. Polynomial regressions and model comparison showed that differences in degree of nonlinearity, not in sensitivity to log immediacy ratio, produced this effect. Temporal control of stop times was timescale invariant with scalar variability, but temporal control of start times was not consistent across subjects or terminal-link durations. [ABSTRACT FROM AUTHOR]

A K‐band on–off keying (OOK) receiver implemented in tsmcTM 90 nm CMOS process is proposed. The proposed OOK receiver consists of a two‐stage wideband low‐noise amplifier, a single‐to‐differential envelop detector with RC lowpass filter and a 62.6 dB three‐stage variable gain amplifier and DC offset compensation circuit. The OOK receiver achieved a sensitivity of −47.6 dBm at 600 Mbit/s data rate under a pseudo‐random binary sequence 29–1 pattern. The receiver consumes a low power of 9.5 mW, which minimum average power is only 15.86 nW at the input power of −47.6 dBm. The chip area including test pads is 1 × 0.81 mm2. [ABSTRACT FROM AUTHOR]