Secret-Key Agreement by Asynchronous EEG over Authenticated Public Channels

In this paper, we propose a new system for a sequential secret key agreement based on 6 performance metrics derived from asynchronously recorded EEG signals using an EMOTIV EPOC+ wireless EEG headset. Based on an extensive experiment in which 76 participants were engaged in one chosen mental task, the system was optimized and rigorously evaluated. The system was shown to reach a key agreement rate of 100%, a key extraction rate of 9%, with a leakage rate of 0.0003, and a mean block entropy per key bit of 0.9994. All generated keys passed the NIST randomness test. The system performance was almost independent of the EEG signals available to the eavesdropper who had full access to the public channel.

Recognizing the Style of Artistic Painting via Information Entropy for Smart City Construction

Digitalization is conducive to the protection and inheritance of culture and civilization. The artistic painting recognition is an essential part in digitalization and plays an important role in smart city construction. This paper proposes a novel framework to recognize Chinese painting style by using information entropy. First, the authors choose the ink painting, pyrography, mural, and splash ink painting as the known artistic styles. Then, this article uses the information entropy to represent the paintings. The information entropy includes color entropy, block entropy, and contour entropy. The color entropy is obtained by a weighted function of Channel A and B in the lab color space. The block entropy is the average information entropy of blocks which are a small part of the image. The contour entropy is obtained from the contour information which is obtained by contourlet transform. The information entropy is input into an oracle to determine the style. The oracle includes a one-class classifier and a classical classifier. The effectiveness is verified on the real painting set.

Stochastic and Self-Organisation Patterns in a 17-Year PM10 Time Series in Athens, Greece

This paper utilises statistical and entropy methods for the investigation of a 17-year PM10 time series recorded from five stations in Athens, Greece, in order to delineate existing stochastic and self-organisation trends. Stochastic patterns are analysed via lumping and sliding, in windows of various lengths. Decreasing trends are found between Windows 1 and 3500–4000, for all stations. Self-organisation is studied through Boltzmann and Tsallis entropy via sliding and symbolic dynamics in selected parts. Several values are below −2 (Boltzmann entropy) and 1.18 (Tsallis entropy) over the Boltzmann constant. A published method is utilised to locate areas for which the PM10 system is out of stochastic behaviour and, simultaneously, exhibits critical self-organised tendencies. Sixty-six two-month windows are found for various dates. From these, nine are common to at least three different stations. Combining previous publications, two areas are non-stochastic and exhibit, simultaneously, fractal, long-memory and self-organisation patterns through a combination of 15 different fractal and SOC analysis techniques. In these areas, block-entropy (range 0.650–2.924) is significantly lower compared to the remaining areas of non-stochastic but self-organisation trends. It is the first time to utilise entropy analysis for PM10 series and, importantly, in combination with results from previously published fractal methods.

Encryption Image by Using RC6 and Hybrid Chaotic Map

Cryptography is data processed in a way that becomes incomprehensible and unavailable to unauthorized persons. In this paper instructed method to encryption image by using RC6 algorithm and generated key by using hybrid chaotic map (tent and logistic map). Used some measures such as frequency test within a block, entropy, serial test (two-bit test), and frequency test (monobit test); to demonstrate the strength of the algorithm proposed in the image coding and protection. The MATLAB program was used as a work environment.

The Flow of Information in Trading: An Entropy Approach to Market Regimes

In this study, we use entropy-based measures to identify different types of trading behaviors. We detect the return-driven trading using the conditional block entropy that dynamically reflects the “self-causality” of market return flows. Then we use the transfer entropy to identify the news-driven trading activity that is revealed by the information flows from news sentiment to market returns. We argue that when certain trading behavior becomes dominant or jointly dominant, the market will form a specific regime, namely return-, news- or mixed regime. Based on 11 years of news and market data, we find that the evolution of financial market regimes in terms of adaptive trading activities over the 2008 liquidity and euro-zone debt crises can be explicitly explained by the information flows. The proposed method can be expanded to make “causal” inferences on other types of economic phenomena.

Capacity Analysis and Cooperative Lane Changing for Connected and Automated Vehicles: Entropy-Based Assessment Method

Connected and automated vehicles (CAVs) are poised to transform how we manage and control the existing traffic. CAVs can provide accurate distance sensing and adaptive cruise control which make shorter headway possible, and will eventually increase the roadway throughput or capacity. The vehicle-to-vehicle (V2V) communication technology equipment on CAVs allows vehicles to exchange information and form platoons more efficiently. This paper uses the intelligent driver model (IDM) as the behavior model to simulate CAVs in mixed traffic conditions with both CAVs and human-driven vehicles (HDVs) under different CAV penetration rates. A cooperative CAV lane-changing model is introduced to build more CAV platoons. The model develops two lane-changing algorithms. Partial CAV lane change (PAL) is applied at low CAV percentages, whereas full CAV lane change (FAL) is used at high CAV percentages. In addition, block entropy is employed as a performance measure for lane-changing results. The simulation experiments show that capacity will increase as the CAV percentage grows, and the peak growth rates occur in medium CAV percentage between 40% and 70%. The cooperative CAV lane-changing algorithm is found to decrease HDV–CAV conflicts remarkably by 37% as well as to marginally increase capacity by 2.5% under all CAV percentages. The simulation performance suggests that the threshold of CAV penetration rate for switching PAL to FAL is approximately 55%. Furthermore, it is demonstrated that block entropy can measure CAV lane-changing performance efficiently and represent capacity changes to some extent.