Research on simulation method of 3D flower blossom process based on botany characteristics and random generation algorithm

Author(s):  
Xiaobiao Xie ◽  
Chengpeng Wu ◽  
Zhang Ming ◽  
Junfeng Yao
Author(s):  
Huda M. Salih ◽  
Raghda Salam Al Mahdawi

Digital technologies grow more rapidly; information security threats are becoming increasingly dangerous. Advanced and various cyber-attacks and security threats, like targeted emails, and information exploitation, pose a critical threat that basically undermines our trust in the digital society. Rivest cipher 4 (RC4) algorithm is a significant cipher of a stream that could be utilized with protocols of the internet, the advantage of the RC4 algorithm is that it is simple and effective. There are several weak, especially after the pseudo-random generation algorithm (PRGA), PRGA's initially 256 rounds (the amount of the RC4 permutation). Several modified RC4 studies have been published thus far, however, they all face either standard privacy or achievement evaluation issues. This paper proposes a new RC4 algorithm that is based on the user's retina (RC4-Retina), which has solved both of these weak points it was indicated in the standard RC4 algorithm. The novelty of retina key scheduling algorithm (RKSA), which is generated by relying on the user's retina of the algorithm will modify the matrix of permutation used to configure the keys. The efficiency of the improved algorithm was measured by depending on the average security of ciphertext of different keys and different messages, results were good compared to the standard algorithm.


10.37236/6014 ◽  
2016 ◽  
Vol 23 (4) ◽  
Author(s):  
Philippe Duchon ◽  
Romaric Duvignau

The goal of this work is to describe a uniform generation tree for permutations which preserves the number of $k$-cycles between any permutation (except for a small unavoidable subset of optimal size) of the tree and its direct children. Moreover, the tree we describe has the property that if the number of $k$-cycles does not change during any $k$ consecutive levels, then any further random descent will always yield permutations with that same number of $k$-cycles. This specific additional property yields interesting applications for exact sampling. We describe a new random generation algorithm for permutations with a fixed number of $k$-cycles in $n+\mathcal{O}(1)$ expected calls to a random integer sampler. Another application is a combinatorial algorithm for exact sampling from the Poisson distribution with parameter $1/k$.


2008 ◽  
Vol 2 (3) ◽  
Author(s):  
Riddhipratim Basu ◽  
Shirshendu Ganguly ◽  
Subhamoy Maitra ◽  
Goutam Paul

Entropy ◽  
2021 ◽  
Vol 23 (4) ◽  
pp. 487
Author(s):  
Tongliang Lu ◽  
Kai Chen ◽  
Yan Zhang ◽  
Qiling Deng

Based on the data in real combat games, the combat System-of-Systems is usually composed of a large number of armed equipment platforms (or systems) and a reasonable communication network to connect mutually independent weapons and equipment platforms to achieve tasks such as information collection, sharing, and collaborative processing. However, the generation algorithm of the combat system in the existing research is too simple and not suitable for reality. To overcome this problem, this paper proposes a communication network generation algorithm by adopting the joint distribution strategy of power law distribution and Poisson distribution to model the communication network. The simulation method is used to study the operation under continuous attack on communication nodes. The comprehensive experimental results of the dynamic evolution of the combat network in the battle scene verify the rationality and effectiveness of the communication network construction.


Methodology ◽  
2017 ◽  
Vol 13 (1) ◽  
pp. 9-22 ◽  
Author(s):  
Pablo Livacic-Rojas ◽  
Guillermo Vallejo ◽  
Paula Fernández ◽  
Ellián Tuero-Herrero

Abstract. Low precision of the inferences of data analyzed with univariate or multivariate models of the Analysis of Variance (ANOVA) in repeated-measures design is associated to the absence of normality distribution of data, nonspherical covariance structures and free variation of the variance and covariance, the lack of knowledge of the error structure underlying the data, and the wrong choice of covariance structure from different selectors. In this study, levels of statistical power presented the Modified Brown Forsythe (MBF) and two procedures with the Mixed-Model Approaches (the Akaike’s Criterion, the Correctly Identified Model [CIM]) are compared. The data were analyzed using Monte Carlo simulation method with the statistical package SAS 9.2, a split-plot design, and considering six manipulated variables. The results show that the procedures exhibit high statistical power levels for within and interactional effects, and moderate and low levels for the between-groups effects under the different conditions analyzed. For the latter, only the Modified Brown Forsythe shows high level of power mainly for groups with 30 cases and Unstructured (UN) and Autoregressive Heterogeneity (ARH) matrices. For this reason, we recommend using this procedure since it exhibits higher levels of power for all effects and does not require a matrix type that underlies the structure of the data. Future research needs to be done in order to compare the power with corrected selectors using single-level and multilevel designs for fixed and random effects.


Sign in / Sign up

Export Citation Format

Share Document