Search

Sensitive data, such as financial, personal, or classified governmental information, must be protected throughout its cycle. This paper studies the problem of safeguarding transmitted data based on data categorization techniques. This research aims to use a novel routine as a new meta-heuristic to enhance a novel data categorization based-traffic classification technique where private data is classified into multiple confidential levels. As a result, two packets belonging to the same confidentiality level cannot be transmitted through two routers simultaneously, ensuring a high data protection level. Such a problem is determined by a non-deterministic polynomial-time hardness (NP-hard) problem; therefore, a scheduling algorithm is applied to minimize the total transmission time over the two considered routers. To measure the proposed scheme's performance, two types of distribution, uniform and binomial distributions used to generate packets transmission time datasets. The experimental result shows that the most efficient algorithm is the Best-Random Algorithm (BR˜), recording 0.028 s with an average gap of less than 0.001 in 95.1% of cases compared to all proposed algorithms. In addition, BR˜ is compared to the best-proposed algorithm in the literature which is the Modified decreasing Estimated-Transmission Time algorithm (MDETA). The results show that BR˜ is the best one in 100% of cases where MDETA reaches the best results in only 48%. [ABSTRACT FROM AUTHOR]

Cyber-security research on networked multi-sensor systems is crucial due to the vulnerability to various types of cyberattacks. For the development of effective defense measures, attention is required to gain insight into the complex characteristics and behaviors of cyber attacks from the attacker's perspective. This paper aims to tackle the problem of distributed consensus estimation for networked multi-sensor systems subject to hybrid attacks and missing measurements. To account for both random denial of service (DoS) attacks and false data injection (FDI) attacks, a hybrid attack model on the estimator-to-estimator communication channel is presented. The characteristics of missing measurements are defined by random variables that satisfy the Bernoulli distribution. Then a modified consensus-based distributed estimator, integrated with the characteristics of hybrid attacks and missing measurements, is presented. For reducing the computational complexity of the optimal distributed estimation method, a scalable suboptimal distributed consensus estimator is designed. Sufficient conditions are further provided for guaranteeing the stability of the proposed suboptimal distributed estimator. Finally, a simulation experiment on aircraft tracking is executed to validate the effectiveness and feasibility of the proposed algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we define a new Ma-Minda type class based on binomial distribution series. Our investigation will be focused on the coefficients of the function f belonging to that class. [ABSTRACT FROM AUTHOR]

With the in-depth development of social reforms, the scientificization of enterprise online examinations has become more and more urgent and important. The key to realizing scientific examinations is the automation and rationalization of propositions. Therefore, the construction and realization of the test question bank is also more important. In the realization of the entire test question database, how to select satisfactory test questions randomly from a large number of test questions through the selection of test questions so that the average difficulty, discriminability, and reliability of the test are satisfactory? These requirements are also more important. Among them, random selection of questions is an important difficulty in the realization of the test question bank. In order to solve the difficulties of random selection of these test questions, the author combines the experience of constructing the test question bank and uses the discrete binomial distribution to draw conclusions. Random variables established the first mathematical model for topic selection. By determining the form of the test questions and the distribution of the difficulty of the test questions and then making it use a random function to select questions, this will achieve better results. [ABSTRACT FROM AUTHOR]

In unsupervised learning, clustering is a common starting point for data processing. The convex or concave fusion clustering method is a novel approach that is more stable and accurate than traditional methods such as k-means and hierarchical clustering. However, the optimization algorithm used with this method can be slowed down significantly by the complexity of the fusion penalty, which increases the computational burden. This paper introduces a random projection ADMM algorithm based on the Bernoulli distribution and develops a double random projection ADMM method for high-dimensional fusion clustering. These new approaches significantly outperform the classical ADMM algorithm due to their ability to significantly increase computational speed by reducing complexity and improving clustering accuracy by using multiple random projections under a new evaluation criterion. We also demonstrate the convergence of our new algorithm and test its performance on both simulated and real data examples. [ABSTRACT FROM AUTHOR]

For decades, conventional wisdom maintained that binary 0–1 Bernoulli random variables cannot contain extra-binomial variation. Taking an unorthodox stance, Hilbe actively disagreed, especially for correlated observation instances, arguing that the universally adopted diagnostic Pearson or deviance dispersion statistics are insensitive to a variance anomaly in a binary context, and hence simply fail to detect it. However, having the intuition and insight to sense the existence of this departure from standard mathematical statistical theory, but being unable to effectively isolate it, he classified this particular over-/under-dispersion phenomenon as implicit. This paper explicitly exposes his hidden quantity by demonstrating that the variance in/deflation it represents occurs in an underlying predicted beta random variable whose real number values are rounded to their nearest integers to convert to a Bernoulli random variable, with this discretization masking any materialized extra-Bernoulli variation. In doing so, asymptotics linking the beta-binomial and Bernoulli distributions show another conventional wisdom misconception, namely a mislabeling substitution involving the quasi-Bernoulli random variable; this undeniably is not a quasi-likelihood situation. A public bell pepper disease dataset exhibiting conspicuous spatial autocorrelation furnishes empirical examples illustrating various features of this advocated proposition. [ABSTRACT FROM AUTHOR]

For state estimation of multi-source asynchronous measurement systems with measurement missing phenomena, this paper proposes a distributed sequential inverse covariance intersection (DSICI) fusion algorithm based on conditional Kalman filtering method. It is mainly divided into synchronized state space module, local filtering module and fusion estimation module. The missing measurements occurring in the system are modelled and described by a set of random variables obeying a Bernoulli distribution. The synchronized state space module uses a state iteration method to synchronize the asynchronous measurement system at the moment of measurement update and it ensures the integrity of the measurement information. The local filtering module uses a conditional Kalman filtering algorithm for filter estimation. The reliability of the local filtering results is guaranteed because the local estimator designs a method to interact information with the domain sensors. The fusion estimation module designs a DSICI fusion algorithm with higher accuracy and satisfying consistency, which fuses the filtering results provided by each sensor when the relevant information between multiple sensors is unknown. Simulation examples demonstrate the excellent performance of the proposed algorithm, with a 33% improvement in accuracy over existing algorithms and an iteration time of less than 3 ms. [ABSTRACT FROM AUTHOR]

In this research paper, we investigate the problem of remote state estimation for nonlinear discrete systems. Specifically, we focus on scenarios where event-triggered sensor schedules are utilized and where packet drops occur between the sensor and the estimator. In the sensor scheduler, the SOD mechanism is proposed to decrease the amount of data transmitted from the sensor to a remote estimator and the phenomena of packet drops modeled with random variables obeying the Bernoulli distribution. As a consequence of packet drops, the assumption of Gaussianity no longer holds at the estimator side. By fully considering the non-linearity and non-Gaussianity of the dynamic system, this paper develops an event-trigger particle filter algorithm to relieve the communication burden and achieve an appropriate estimation accuracy. First, we derive an explicit expression for the likelihood function when an event trigger occurs and the possible occurrence of packet dropout is taken into consideration. Then, using a special form of sequential Monte–Carlo algorithm, the posterior distribution is approximated and the corresponding minimum mean-squared error is derived. By contrasting the error covariance matrix with the posterior Cramér–Rao lower bound, the estimator's performance is assessed. An illustrative numerical example shows the effectiveness of the proposed design. [Display omitted] • Limited bandwidth networked systems require sensors scheduling algorithm design. • Event-based particle filter is designed in conjunction with scheduling algorithms and packet dropout. • With Cramér–Rao lower bound the proposed scheduling algorithms improve clearly the filter performance. • Innovation scheduling allows robustness against packet dropouts. [ABSTRACT FROM AUTHOR]

Consider a sequence (X n) n ≥ 1 of i.i.d. 2 × 2 stochastic matrices with each X n distributed as μ. This μ is described as follows. Let (C n , D n) T denote the first column of X n and for a given real r with 0 < r < 1 , let r − 1 C n and r − 1 D n each be Bernoulli distributions with parameters p 1 and p 2 , respectively, and 0 < p 1 , p 2 < 1 . Clearly, the weak limit of the sequence μ n , namely λ , is known to exist, whose support is contained in the set of all 2 × 2 rank one stochastic matrices. In a previous paper, we considered 0 < r ≤ 1 2 and obtained λ explicitly. We showed that λ is supported countably on many points, each with positive λ -mass. Of course, the case 0 < r ≤ 1 2 is tractable, but the case r > 1 2 is very challenging. Considering the extreme nontriviality of this case, we stick to a very special such r, namely, r = 5 − 1 2 (the reciprocal of the golden ratio), briefly mention the challenges in this nontrivial case, and completely identify λ for a very special situation. [ABSTRACT FROM AUTHOR]

The binomial distribution is the probability distribution of the number of successes for a sequence of n independent trials with success probability p. Efficiently generating binomial random variates is important in many modeling and simulation applications, such as in medicine, risk management, and fraud and anomaly detection, among others. A variety of algorithms exist for generating binomial random variates. This paper concerns the algorithm chosen for ρ μ , an open source Java library for efficient randomization, which uses a hybrid of two existing binomial random variate algorithms: the BTPE Algorithm (Binomial, Triangle, Parallelogram, Exponential) and the inverse transform for cases that BTPE cannot handle. BTPE uses rejection sampling, and BTPE's authors originally provided an analytical formula for the expected number of iterations in terms of n and p. That expression is complicated to interpret in practical contexts. I explore BTPE by instrumenting ρ μ 's implementation to empirically analyze its acceptance/rejection behavior to gain further insights into its runtime performance. Although the number of iterations depends upon n and p, my experiments show that the average number of iterations is always under two, and that the average number of random uniform variates required to generate a single random binomial is under four (two per iteration). Thus, when analyzing the runtime of a simulation algorithm that includes steps generating random binomials, one can consider such steps to have a constant runtime. [ABSTRACT FROM AUTHOR]

In this paper, we study a new type of distribution that generalizes distributions from the gamma and beta classes that are widely used in applications. The estimators for the parameters of the digamma distribution obtained by the method of logarithmic cumulants are considered. Based on the previously proved asymptotic normality of the estimators for the characteristic index and the shape and scale parameters of the digamma distribution constructed from a fixed-size sample, we obtain a statement about the convergence of these estimators to the scale mixtures of the normal law in the case of a random sample size. Using this result, asymptotic confidence intervals for the estimated parameters are constructed. A number of examples of the limit laws for sample sizes with special forms of negative binomial distributions are given. The results of this paper can be widely used in the study of probabilistic models based on continuous distributions with an unbounded non-negative support. [ABSTRACT FROM AUTHOR]

This paper studies the iterative learning fault-tolerant control (ILFTC) problem for networked batch processes with event-triggered transmission strategy and data dropouts. During the transmission of input signal, the event-triggered mechanism is adopted to reduce the number of updated data items. The data dropouts are assumed to obey the Bernoulli random binary distribution. The objective of this paper is to design a state feedback controller such that the system is fault-tolerant and satisfies the robust performance requirement. By combining 2D stochastic system theory and linear matrix inequality (LMI) technique, some sufficient conditions are given to ensure the existence of the designed controller. Finally, an example of nozzle pressure control is utilized to verify the availability of the proposed method. [ABSTRACT FROM AUTHOR]

Copyright of Colombian Journal of Statistics / Revista Colombiana de Estadística is the property of Universidad Nacional de Colombia and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Human activity recognition (HAR) is one of the key applications of health monitoring that requires continuous use of wearable devices to track daily activities. The most efficient supervised machine learning (ML)-based approaches for predicting human activity are based on a continuous stream of sensor data. Sensor data analysis for human activity recognition using conventional algorithms and deep learning (DL) models shows promising results, but evaluating their ambiguity in decision-making is still challenging. In order to solve these issues, the paper proposes a novel Wasserstein gradient flow legonet WGF-LN-based human activity recognition system. At first, the input data is pre-processed. From the pre-processed data, the features are extracted using Haar Wavelet mother- Symlet wavelet coefficient scattering feature extraction (HS-WSFE). After that, the interest features are selected from the extracted features using (Binomial Distribution integrated-Golden Eagle Optimization) BD-GEO. The important features are then post-processed using the scatter plot matrix method. Obtained post-processing features are finally given into the WGF-LN for classifying human activities. From these experiments, the results can be obtained and showed the efficacy of the proposed model. [ABSTRACT FROM AUTHOR]

This paper introduces two novel subclasses of the function class Σ for bi-univalent functions, leveraging generalized telephone numbers and Binomial series through convolution. The exploration is conducted within the domain of the open unit disk. We delve into the analysis of initial Taylor-Maclaurin coefficients | a 2 | and | a 3 | , deriving insights and findings for functions belonging to these new subclasses. Additionally, Fekete-Szegö inequalities are established for these functions. Furthermore, the study unveils a range of new subclasses of Σ , some of which are special cases, yet have not been previously explored in conjunction with telephone numbers. These subclasses emerge as a result of hybrid-type convolution operators. Concluding from our results, we present several corollaries, which stand as fresh contributions in the domain of involution numbers involving hybrid-type convolution operators. [ABSTRACT FROM AUTHOR]

The Median-of-Mean (MoM) estimation is an efficient statistical method for handling data with contamination. In this paper, we propose a variance-dependent MoM estimation method using the tail probability of a binomial distribution. The bound of this method is better than the classical Hoeffding method under mild conditions. This method is then used to study the concentration of variance-dependent MoM empirical processes and sub-Gaussian intrinsic moment norm. Finally, we give the bound of the variance-dependent MoM estimator with distribution-free contaminated data. [ABSTRACT FROM AUTHOR]

Ensemble climatological forecasts play a critical part in benchmarking the predictive performance of hydroclimatic forecasts. Accounting for the skewness and censoring characteristics of hydroclimatic variables, ensemble climatological forecasts can be generated by the log, Box‐Cox and log‐sinh transformations, by the combinations of the Bernoulli distribution with the Gaussian, Gamma, log‐normal, generalized extreme value, generalized logistic and Pearson type III distributions and by the non‐parametric resampling, empirical cumulative distribution function and kernel density estimation methods. This paper is concentrated on the reliability of the 12 types of ensemble climatological forecasts. Specifically, mathematical formulations are presented and large‐sample tests are devised to verify the forecast reliability for the Multi‐Source Weighted‐Ensemble Precipitation version 2 across the globe. Climatological forecasts of monthly precipitation over 18,425 grid cells are generated for 30 years under leave‐one‐year‐out cross validation, leading to 6,633,000 (12 × 18425 × 30) sets of ensemble climatological forecasts. The results point out that the reliability of climatological forecasts considerably varies across the 12 methods, particularly in regions with high hydroclimatic variability. One observation is that climatological forecasts tend to deviate from the distributions of observations when there is inadequate flexibility to fit precipitation data. Another observation is that ensemble spreads can be overly wide when there exist overfits of sample‐specific noises in cross validation. Through the tests of global precipitation, the robustness of the log‐sinh transformation and the Bernoulli‐Gamma distribution is highlighted. Overall, the investigations can serve as a guidance on the uses of transformations, distributions and non‐parametric methods in generating climatological forecasts. Plain Language Summary: Ensemble climatological forecasts have been extensively used as the benchmark to evaluate forecast skill. That is, forecasts generated by a certain forecasting model are skillful when they outperform climatological forecasts and otherwise they are not. In practice, ensemble climatological forecasts are generated by different methods, including the log, Box‐Cox and log‐sinh transformations, the combinations of the Bernoulli distribution with the Gaussian, Gamma, log‐normal, generalized extreme value, generalized logistic and Pearson type III distributions and the non‐parametric resampling, empirical cumulative distribution function and kernel density estimation methods. It is important to investigate pros and cons of different types of climatological forecasts. Focusing on the reliability, that is, statistical consistency between forecasts and observations, this paper has devised large‐sample tests of global monthly precipitation. The results show that owing to hydroclimatic variability, different types of climatological forecasts exhibit varying characteristics of reliability. On the one hand, climatological forecasts can deviate from observations when there is inadequate flexibility to fit precipitation data, especially for the Bernoulli‐Gaussian distribution. On the other hand, ensemble spreads can be too wide when there exist overfits of sample‐specific noises in cross validation. Among the 12 methods, the robustness of the log‐sinh transformation and the Bernoulli‐Gamma distribution is highlighted. Key Points: Climatological forecasts can be generated by using data transformations, statistical distributions and non‐parametric methodsThe reliability of climatological forecasts generated by different methods is shown to vary considerably in large‐sample testsThe robustness of log‐sinh transformation and Bernoulli‐Gamma distribution is illustrated through the tests of global precipitation [ABSTRACT FROM AUTHOR]

In this paper, a quantum scheme for a two-qubit system (2QS) and field initially prepared in the excited negative binomial distribution is presented. The field photon statistics is detected from the evolution of the Mandel parameter, while the evolution of von Neumann entropy detects the nonlocal correlation between the 2QS and radiation field. The concurrence is used to detect the qubit-qubit entanglement during the time evolution. The dynamical properties of single-qubit and two-qubit quantum Fisher information are investigated. We visualize the number of photon excitations on the field in negative binomial states with influence of photon success probability. A connection is provided between the dynamical behaviors of these statistical quantities. We have found that the proposed quantities are strongly influenced by the number of excited photons of the field in negative binomial states and photon success probability. [ABSTRACT FROM AUTHOR]

In this paper, an underwater robot system with nonlinear characteristics is studied by a backstepping method. Based on the state preservation problem of an Autonomous Underwater Vehicle (AUV), this paper applies the backstepping probabilistic gain controller to the nonlinear system of the AUV for the first time. Under the comprehensive influence of underwater resistance, turbulence, and driving force, the motion of the AUV has strong coupling, strong nonlinearity, and an unpredictable state. At this time, the system's output feedback can solve the problem of an unmeasurable state. In order to achieve a good control effect and extend the cruising range of the AUV, first, this paper will select the state error to make it a new control objective. The system's control is transformed into the selection of system parameters, which greatly simplifies the degree of calculation. Second, this paper introduces the concept of a stochastic backstepping control strategy, in which the robot's actuators work discontinuously. The actuator works only when there is a random disturbance, and the control effect is not diminished. Finally, the backstepping probabilistic gain controller is designed according to the nonlinear system applied to the simulation model for verification, and the final result confirms the effect of the controller design. [ABSTRACT FROM AUTHOR]

• Memory sampled-data control is applied for the uncertain rigid spacecraft model. • Randomly missing measurement in the system output obeys the Bernoulli distribution. • It tolerates uncertainty and disturbances using the H ∞ technique. • A novel looped and delay-dependent LKF is constructed for the proposed systems. • It gives the minimum disturbance attenuation level compared with existing works. This paper focuses on stabilizing the attitude of the rigid spacecraft under the sampled-data control design technique with constant communication delay. The system dynamics with model uncertainty (perturbation) and missing measurements are considered. The aim is to design a desirable attitude control that ensures the stabilization of the rigid spacecraft with an optimal H ∞ performance level. A novel Lyapunov–Krasovskii functional is developed, incorporating looped characteristics, for the proposed study on the rigid spacecraft model by developing relevant new terms. Making use of the Lyapunov function as well as free-matrix-based integral inequality, sufficient stability criteria are established to assure the stability of the rigid spacecraft model. Furthermore, the desired sampled-data control gain matrices are acquired through the solution of linear matrix inequalities, which guarantees the asymptotic stability of the rigid spacecraft model. Finally, the numerical simulation demonstrates the efficacy of the theoretical study proposed for the rigid spacecraft model. [ABSTRACT FROM AUTHOR]

The paper addresses the switching-like event-triggered control for uncertain networked control systems with time-varying delay under DoS attacks. First of all, to reduce the communication burden, a switching-like event-triggered mechanism is designed to automatically select the trigger condition according to whether the system is under DoS attacks, which have the advantage of reducing the number of data packets transmitted. Secondly, unlike the traditional assumption of time-varying delay, here it satisfies the condition that the probability is known, and combines the networked control systems to propose a novel time-delay system model, which can obtain a larger upper bound on the delay. Then, by using both the Lyapunov functional method and linear matrix inequality technique, we obtain sufficient conditions of uncertain networked control systems to achieve exponentially stable in the mean square sense. Furthermore, under the common limitations of the maximum continuous packet losses caused by the DoS attacks and delay, the stability criterion is derived, which can be used to estimate the communication parameters and security controller gain. Finally, through two simulation examples, the larger upper bound of time delay, less trigger times, faster convergence rate are obtained, which verify the validity of our theoretical analysis. • An event-triggered mechanism is designed which can switch the trigger threshold. • A new delay model based on Bernoulli distribution is introduced. • Lyapunov function method and linear matrix inequality techniques are used. • The uncertain networked control systems remain robust exponentially stable in the mean square sense under DoS attacks. [ABSTRACT FROM AUTHOR]

One of the most crucial aspects of an algorithm design for the wireless sensors networks is the failure tolerance. A high natural robustness and an effectively bounded execution time are factors that can significantly optimize the overall energy consumption and therefore, a great emphasis is laid on these aspects in many applications from the area of the wireless sensor networks. This paper addresses the robustness of the optimized Best Constant weights of Average Consensus with a stopping criterion (i.e. the algorithm is executed in a finite time) and their five variations with a lower mixing parameter (i.e. slower variants) to random communication breakdowns modeled as a stochastic event of a Bernoulli distribution. We choose three metrics, namely the deviation of the least precise final estimates from the average, the convergence rate expressed as the number of the iterations for the consensus, and the deceleration of each initial setup, in order to evaluate the robustness of various initial setups of Best Constant weights under a varying failure probability and over 30 random geometric graphs of either a strong or a weak connectivity. Our contribution is to find the most robust initial setup of Best Constant weights according to numerical experiments executed in Matlab. Finally, the experimentally obtained results are discussed, compared to the results from the error-free executions, and our conclusions are compared with the conclusions from related papers. [ABSTRACT FROM AUTHOR]

This paper investigates the event-triggered consensus of linear multiagent systems with periodic data sampling mechanisms, where random packet losses are taken into account. The random packet losses occur in communication links based on a certain probability, and it is subject to the Bernoulli distribution. A novel distributed control protocol is designed based on the combined measurement to achieve the mean square consensus. By using the Riccati inequalities and linear matrix inequalities, an event-triggered condition with fewer parameters is also designed to reduce the information updating number. The interaction among the control gain matrix, sampling interval, and packet losses probability is used to describe the consensus conditions. The maximum sampling interval is presented explicitly. It is shown that the advantages of the proposed event-triggered strategy with the data sampling mechanism can avoid the Zeno behavior of the systems and continuous monitoring of the states. The simulations are provided to verify the proposed control strategy. [ABSTRACT FROM AUTHOR]

Process capability and performance indices (PCIs and PPIs) are used in industry to provide numerical measures for the capability and performance of several processes. The majority of the literature refers to PCIs and PPIs for continuous data. The aim of this paper is to compute the classical indices for discrete data following Poisson, binomial or negative binomial distribution using various transformation techniques. A simulation study under different situations of a process and comparisons with other existing PCIs for discrete data are also presented. The methodology of computing the indices is easy to use, and as a result, one can have an assessment of the process capability and performance without difficulty. Three examples are further provided to illustrate the application of the transformation techniques. [ABSTRACT FROM AUTHOR]

Among diseases, cancer exhibits the fastest global spread, presenting a substantial challenge for patients, their families, and the communities they belong to. This paper is devoted to modeling such a disease as a special case. A newly proposed distribution called the binomial-discrete Erlang-truncated exponential (BDETE) is introduced. The BDETE is a mixture of binomial distribution with the number of trials (parameter n ) taken after a discrete Erlang-truncated exponential distribution. A comprehensive mathematical treatment of the proposed distribution and expressions of its density, cumulative distribution function, survival function, failure rate function, Quantile function, moment generating function, Shannon entropy, order statistics, and stress-strength reliability, are provided. The distribution's parameters are estimated using the maximum likelihood method. Two real-world lifetime count data sets from the cancer disease, both of which are right-skewed and over-dispersed, are fitted using the proposed BDETE distribution to evaluate its efficacy and viability. We expect the findings to become standard works in probability theory and its related fields. [ABSTRACT FROM AUTHOR]

This paper considers the adaptive event-triggered strategy and controller design of vehicle platooning for stochastic attacks and interferences in communication channels. Bernoulli distribution and Markovian distribution Denial of Service models are introduced in this paper. In designing the controller, Aiming at the stochastic jamming attacks, the stability criterion is presented to guide the controller for almost sure string stability, and meanwhile aiming at the special safety requirements and the reduction of system interferences, the asymmetry event-triggered strategy framework is presented to adapt the transmission environment and the different safety requirements, which is designed to balance the principal concern in different situations. Finally, an example is introduced to demonstrate the controller performances of the vehicle platooning with the Bernoulli distribution and Markovian distribution DoS models, which implies that the presented methods are effective. • Considering the different safety requirements of the vehicle platooning and the influence of the SINR, the DoS attack probabilistic model is built by the analysis of the wireless communication channel under stochastic jamming attacks and interference among vehicles. • Considering the stability of the system and the jamming attacks, the controller design method can be refreshed in different communication environments and safety requirements to reduce the shock to the mechanical system of the vehicle and avoid the collision. • Considering the safety and focusing on the characteristic of the platooning system itself, we present the adaptive event-triggered method, which can further reduce the communication frequency, which is another different from previous results. [ABSTRACT FROM AUTHOR]

This paper aims to establish distribution-free concentration inequalities for the log-likelihood function of Bernoulli variables, which means that the tail bounds are independent of the parameters. Moreover, Bernstein's and Bennett's inequalities with optimal constants are obtained. The simulation study shows significant improvements over the previous results. [ABSTRACT FROM AUTHOR]

The aim of this short paper is to present a new family of discrete densities with two parameters based on Bernoulli numbers and polynomials. We use the properties of such numbers in order to compute the first moments and the density of a finite sum of such independent variables. [ABSTRACT FROM AUTHOR]

Several studies deal with the development of advanced statistical methods for predicting football match results. These predictions are then used to construct profitable betting strategies. Even if the most popular bets are based on whether one expects that a team will win, lose, or draw in the next game, nowadays a variety of other outcomes are available for betting purposes. While some of these events are binary in nature (e.g. the red cards occurrence), others can be seen as binary outcomes. In this paper we propose a simple framework, based on score-driven models, able to obtain accurate forecasts for binary outcomes in soccer matches. To show the usefulness of the proposed statistical approach, two experiments to the English Premier League and to the Italian Serie A are provided for predicting red cards occurrence, Under/Over and Goal/No Goal events. [ABSTRACT FROM AUTHOR]

This paper mainly investigates the problem of extended dissipative filter design for switched discrete-time systems where the variation of switching signals among subsystems is governed by the persistent dwell-time strategy. Considering that in practical applications, the congestion of the communication channels between systems and filters may cause data loss, therefore the packet dropouts are taken into account to make the issue under consideration more general. Meanwhile, it is generally known that the mode information of the system may sometimes not be accessed, so we consider the design of a unified filter including mode-dependent and mode-independent filters simultaneously. A white sequence that obeys the Bernoulli distribution is used to express the random switching of the filters. The main purpose of this paper is to find a suitable filter design method which ensures that the resulting error system is exponentially mean-square stable and extended dissipative. Sufficient conditions are established to make sure the solvability of the addressed problem. By using appropriate decoupling method, some conditions that could be readily solved are obtained. In order to explain the correctness and effectiveness of the proposed method, two illustrated examples are given in the final part of this paper. [ABSTRACT FROM AUTHOR]