It is shown that the stochastic dynamics of nongenerational evolutionary algorithms with binary tournament selection and gene pool recombination but without mutation is closely approximated by a stochastic process consisting of several de-coupled random walks, provided the fitness function is separable in a certain sense. This approach leads to a lower bound on the population size such that the...

Here we provide 129 complete mitochondrial control region sequences of indigenous Khoe-San individuals from Angola to contribute to the still underrepresented pool of data from Africa. The dataset consists of exclusively African lineages with a majority of Sub-Saharan haplogroups. The probability of a random match was calculated as 0.09. The data set comprises 21 haplotypes occurring more than ...

We present a model for evolving population that maintains genetic polymorphism. By introducing random mutation in the model population at a constant rate, we observe that the population does not become extinct but survives, keeping diversity in the gene pool under abrupt environmental changes. The model provides reasonable estimates for the proportions of polymorphic and heterozygous loci and f...

We address a challenge to developing the Future Force — Army tactical networks require cryptographic keys to implement security services such as encryption and authentication, but current pairwise key establishment approaches using interactive public key techniques are too time-consuming. This paper describes identity-based cryptographic solutions that enable strong security and significantly r...

Cloud computing hosts require a good source of cryptographically strong random numbers. Most of the standard security practices are based on assumptions that hold true for physical machines, but don’t translate immediately into the domain of virtualized machines. It is imperative to reconsider the well accepted security practices that were built around physical machines, and whether blind appli...

Key distribution is of a critical importance to security of wireless sensor networks (WSNs). Random key predistribution is an acknowledged approach to the key distribution problem. In this paper, we propose and analyze two novel improvements that enhance security provided by the random key predistribution schemes. The first improvement exploits limited length collisions in secure hash functions...

Our model is a generalized linear programming relaxation of a much studied random K-SAT problem. Specifically, a set of linear constraints C on K variables is fixed. From a pool of n variables, K variables are chosen uniformly at random and a constraint is chosen from C also uniformly at random. This procedure is repeated m times independently. We ask the following question: is the resulting li...

Sequence saturation mutagenesis (SeSaM) is a conceptually novel and practically simple method that truly randomizes a target sequence at every single nucleotide position. A SeSaM experiment can be accomplished within 2-3 days and comprises four steps: generating a pool of DNA fragments with random length, 'tailing' the DNA fragments with universal base using terminal transferase at 3'-termini, ...

By using deployment Knowledge and cellular model, a novel key distribution scheme based on deployment and dual-key pools is proposed for WSN. Each sub-key pool in the network contains two types of key pools: one doubled by the offline server is shared by three adjacent cells before the deployment and the other one distributed to each cell is non-overlapping. The server distributes four random n...