Local Asymptotic Normality Complexity Arising in a Parametric Statistical Lévy Model

We consider statistical experiments associated with a Lévy process X = X t t ≥ 0 observed along a deterministic scheme i u n , 1 ≤ i ≤ n . We assume that under a probability ℙ θ , the r.v. X t , t > 0 , has a probability density function > o , which is regular enough relative to a parameter θ ∈ 0 , ∞ . We prove that the sequence of the associated statistical models has the LAN property at each θ , and we investigate the case when X is the product of an unknown parameter θ by another Lévy process Y with known characteristics. We illustrate the last results by the case where Y is attracted by a stable process.

Multi-membrane search algorithm

This research proposes a new multi-membrane search algorithm (MSA) based on cell biological behavior. Cell secretion protein behavior and cell division and fusion strategy are the main inspirations for the algorithm. In order to verify the performance of the algorithm, we used 19 benchmark functions to compare the MSA test results with MVO, GWO, MFO and ALO. The number of iterations of each algorithm on each benchmark function is 100, the population number is 10, and the running is repeated 50 times, and the average and standard deviation of the results are recorded. Tests show that the MSA is competitive in unimodal benchmark functions and multi-modal benchmark functions, and the results in composite benchmark functions are all superior to MVO, MFO, ALO, and GWO algorithms. This paper also uses MSA to solve two classic engineering problems: welded beam design and pressure vessel design. The result of welded beam design is 1.7252, and the result of pressure vessel design is 5887.7052, which is better than other comparison algorithms. Statistical experiments show that MSA is a high-performance algorithm that is competitive in unimodal and multimodal functions, and its performance in compound functions is significantly better than MVO, MFO, ALO, and GWO algorithms.

Seeded Ising Model and Distributed Biometric Template Storage and Matching

It is known that a variant of Ising model, called Seeded Ising Model, can be used to recover the information content of a biometric template from a fraction of information therein. The method consists in reconstructing the whole template, which is called the intruder template in this paper, using only a small portion of the given template, a partial template. This reconstruction method may pose a security threat to the integrity of a biometric identity management system. In this paper, based on the Seeded Ising Model, we present a systematic analysis of the possible security breach and its probability of accepting the intruder templates as genuine. Detailed statistical experiments on the intruder match rate are also conducted under various scenarios. In particular, we study (1) how best a template is divided into several small pieces called partial templates, each of which is to be stored in a separate silo; (2) how to do the matching by comparing partial templates in the locked-up silos, and letting only the results of these intra-silo comparisons be sent to the central tallying server for final scoring without requiring the whole templates in one location at any time.

Interactive Information Design

We study the interaction between multiple information designers who try to influence the behavior of a set of agents. When each designer can choose information policies from a compact set of statistical experiments with countable support, such games always admit subgame-perfect equilibria. When designers produce public information, every equilibrium of the simple game in which the set of messages coincides with the set of states is robust in the sense that it is an equilibrium with larger and possibly infinite and uncountable message sets. The converse is true for a class of Markovian equilibria only. When designers produce information for their own corporation of agents, robust pure-strategy equilibria exist and are characterized via an auxiliary normal-form game in which the set of strategies of each designer is the set of outcomes induced by Bayes correlated equilibria in her corporation.

An Early CU Partition Mode Decision Algorithm in VVC Based on Variogram for Virtual Reality 360 Degree Videos

360-degree videos have become increasingly popular with the development of virtual reality (VR) technology. These videos are converted to a 2D image plane format before being encoded with standard encoders. To improve coding efficiency, a new generation video coding standard has been launched to be known as Versatile Video Coding (VVC). However, the computational complexity of VVC makes it time-consuming to compress 360-degree videos of high resolution. The diversity of CU partitioning modes of VVC greatly increases the computational complexity. Through statistical experiments on ERP videos, it is found that the probability of using horizontal partitioning for such videos is greater than that of vertical partitioning. The empirical variogram combined with Mahalanobis distance is proposed to measure texture orientation information. The experimental results show that the algorithm saves 32.13% of the coding time with only 0.66% BDBR increasing.

PEMBELAJARAN TEORI PROBABILITAS MENGGUNAKAN R

In learning probability theory, if a series of statistical experiments is carried out several times, identifying the possible samples produced is not an easy thing. If this happens, then a significant probability problem will arise. The objective of this study is how to learn probability theory using R software. Based on the simulation results it can be concluded that by combining the syntax in R can be used to solve probability problems such as identifying sample points from experiments, events, event operations, probabilities and conditional probabilities. This will help students learning in understanding of the probability theory material. The use of R will be very pronounced for experiments with a large enough scale that results in a large sample probability.

Quantitative Investigation of the Panteleymon Gospel Dating from the Late 12th to the Early 13th Centuries (Three Statistical Experiments)

The work presents the results of the quantitative and statistical comparative analysis of the most frequent word forms and combinations of the Old Russian of the Panteleymon Gospel (RNB, Sof. 1). The work aims to reveal the degree of closeness of the Panteleymon Gospel to the other gospels and the medieval Slavonic texts of other genres, represented in sub-corpora of historical corpus "Manuscript: Slavic Written Heritage". The work was carried out with the help of the special modules of statistics and n-grams. The comparison of the lists of single-, two- and three-component linguistic units, automatically extracted from the manuscripts, with the respective lists of several sub-corpora points to the presence of the quantitative-statistical characteristics of the linguistic components of the manuscripts which can be recognized as important. The data of the three experiments are summarized. The first experiment showed that the smallest differences of the frequency lists exist between the Panteleymon Gospel and the sub-corpus of complete aprakoses and the greatest differences between the manuscript being analyzed and the sub-corpus of short aprakoses. This makes possible to recognize that the composition of the lists, the order and the relative frequency of the forms in them are the important characteristics of the manuscript or the sub-corpus. The application of the Weirdness measure helped to extract from the Panteleymon Gospel the word forms which are supposed to be significant – those, having the highest weight within the sub-corpora of different genres (вамъ, имъ, азъ, емоу, рече, аще). It has been established that the volume and composition of contrasted sub-corpus do not influence the result, and the use of the collections of complete and short aprakoses as contrast sub-corpora helped to specify the list of such forms (яко, къ, бо, о(т), имъ, есть, аще). The investigation of two- and three-component combinations, extracted with the help of the statistical measure T-score, gave the following results: a list of fixed combinations – invariable composition formulas (ев[ан](г)[елие] ѡ(т) ма[т](ѳ)[ея] etc.), inherent to all gospels, was made; entire grammatical structures (ѧже далъ ѥси etc.) were listed, as well as stable semantic complexes and their parts ([да] любите дроугъ дроуга etc.). Statistically important sequences having in the Panteleymon Gospel a statistical weight, which is considerably higher than in the contrast sub-corpora – нѣсте ли чьли, имать животъ вѣчьныи etc. have been revealed.

An efficient local search for large-scale set-union knapsack problem

PurposeThe set-union knapsack problem is one of the most significant generalizations of the Non-deterministic Polynomial (NP)-hard 0-1 knapsack problem in combinatorial optimization, which has rich application scenarios. Although some researchers performed effective algorithms on normal-sized instances, the authors found these methods deteriorated rapidly as the scale became larger. Therefore, the authors design an efficient yet effective algorithm to solve this large-scale optimization problem, making it applicable to real-world cases under the era of big data.Design/methodology/approachThe authors develop three targeted strategies and adjust them into the adaptive tabu search framework. Specifically, the dynamic item scoring tries to select proper items into the knapsack dynamically to enhance the intensification, while the age-guided perturbation places more emphasis on the diversification of the algorithm. The lightweight neighborhood updating simplifies the neighborhood operators to reduce the algorithm complexity distinctly as well as maintains potential solutions. The authors conduct comparative experiments against currently best solvers to show the performance of the proposed algorithm.FindingsStatistical experiments show that the proposed algorithm can find 18 out of 24 better solutions than other algorithms. For the remaining six instances on which the competitor also achieves the same solutions, ours performs more stably due to its narrow gap between best and mean value. Besides, the convergence time is also verified efficiency against other algorithms.Originality/valueThe authors present the first implementation of heuristic algorithm for solving large-scale set-union knapsack problem and achieve the best results. Also, the authors provide the benchmarks on the website for the first time.

An image encryption scheme based on public key cryptosystem and quantum logistic map

Most of existing image encryption schemes are proposed in the spatial domain which easily destroys the correlation between pixels. This paper proposes an image encryption scheme by employing discrete cosine transform (DCT), quantum logistic map and substitution-permutation network (SPN). The DCT is used to transform the images in the frequency domain. Meanwhile, the SPN is used to provide the security properties of confusion and diffusion. The SPN provides fast encryption as compared to the asymmetric based image encryption since operations with low computational complexity are used (e.g., exclusive-or and permutation). Different statistical experiments and security analysis are performed against six grayscale and color images to justify the effectiveness and security of the proposed image encryption scheme.

Security of Wireless Sensor Nodes

Due to the large-scale development in satellite and network communication technologies, there is a significant demand for preserving the secure storage and transmission of the data over the internet and shared network environments. New challenges appeared that are related to the protection of critical and sensitive datafrom illegal usage and unauthorized access. In this paper, we address the issues described above and develop new techniques to eliminate the associated problems. To achieve this, we propose a design of a new sensor node for tracking the location of cars and collecting all information and all visited locations by cars, followed byencryption in a sensor node and saving in the database. A microcontroller of Arduino esp8266 Node MCU board and a GPS module are used. The cryptography uses the chaos-based symmetric-key encryption technique for data. This scheme utilizes a chaotic map (Hénon map) for robustness and security of data. The key sensitivity can be performed by statistical experiments to determine the safety, reliability, and speed of the algorithm. The proposed algorithm presents several exciting features, such as a high level of security, sufficient saving of the energy of the sensor network, and an acceptable encryption speed compared to Advanced Encryption Standard (AES) and Data Encryption Standard (DES).