Filters








5,222 Hits in 3.1 sec

Pseudorandomness in Central Force Optimization [article]

Richard A. Formato
2010 arXiv   pre-print
Central Force Optimization is a deterministic metaheuristic for an evolutionary algorithm that searches a decision space by flying probes whose trajectories are computed using a gravitational metaphor.  ...  While this process may appear to be similar to the randomness in an inherently stochastic algorithm, it is in fact fundamentally different because CFO remains deterministic at every step.  ...  Introduction This note examines the role of pseudorandomness in Central Force Optimization.  ... 
arXiv:1001.0317v2 fatcat:xzwdvjqusrhylhkuvsnxxg52fi

FPGA Implementation of an LFSR based Pseudorandom Pattern Generator for MEMS Testing

Md. FokhrulIslam, M. A. Mohd. Ali, Burhanuddin Yeop Majlis
2013 International Journal of Computer Applications  
Linear feedback shift resister (LFSR) has become one of the central elements used in testing and self testing of contemporary complex electronic systems like processors, controllers and integrated circuits  ...  This paper presents the FPGA implementation of an LFSR based pseudorandom pattern generator.  ...  In Section 4, the hardware structure for the pseudorandom testing technique is discussed.  ... 
doi:10.5120/13158-0881 fatcat:libjyada6jdhfmroqwvtwf6ukm

Page 1972 of Mathematical Reviews Vol. , Issue 84e [page]

1984 Mathematical Reviews  
The needed fluid forces on the particles are computed in terms of these derivatives, and no grid or differences are required.  ...  Borosh, Itshak; Niederreiter, Harald 84e:65012 Optimal multipliers for pseudorandom number generation by the linear congruential method. BIT 23 (1983), no. 1, 65-74.  ... 

AN EFFICIENT CHAOS-BASED OPTIMIZATION ALGORITHM APPROACH FOR CRYPTOGRAPHY

RASHI VOHRA, BRAJESH PATEL
2012 International Journal of Communication Networks and Security  
In this paper, an overview of cryptography, optimization algorithm and chaos theory is provided and a novel approach for encryption and decryption based on chaos and optimization algorithms is discussed  ...  In this article, the basic idea is to encrypt and decrypt the information using the concept of genetic algorithm with the pseudorandom sequence further used as a key in genetic algorithm operation for  ...  With the key length of 56 bits, DES is vulnerable to brute force attack. To overcome the vulnerability to brute force attack, 3DES is issued by NIST in 1999.  ... 
doi:10.47893/ijcns.2012.1056 fatcat:drsqbqnvvja37a7hurmupeo7qa

A novel dot-pattern generation to improve luminance uniformity of LCD backlight

Tsuyoshi Idé, Hidetoshi Numata, Yoichi Taira, Hideyuki Mizuta, Masaru Suzuki, Michikazu Noguchi, Yoshihiro Katsu
2003 Journal of the Society for Information Display  
For example, consider a central force model whose magnitude is given by [ ]    ≥ − − < = D r L D r D r f ij for / ) ( exp for 1 ' (1) where r represents the distance between dot i and j. model.  ...  However, it gives no answer about how to optimize the density distribution itself.  ... 
doi:10.1889/1.1825693 fatcat:ubgyhyl5mrcylcnsiyuzbiqxce

Comparative Results: Group Search Optimizer and Central Force Optimization [article]

Richard A. Formato
2010 arXiv   pre-print
This note compares the performance of two multidimensional search and optimization algorithms: Group Search Optimizer and Central Force Optimization.  ...  The CFO implementation reported here includes architectural improvements in errant probe retrieval and decision space adaptation that result in even better performance.  ...  "Pseudorandomness in Central Force Optimization" ' arXiv:1001.0317v1[cs.NE], online: www.arXiv.org 'Abstract -Central Force Optimization is a deterministic metaheuristic for an evolutionary algorithm '  ... 
arXiv:1002.2798v2 fatcat:ksazit6pzvftzf3s2qi5vxuaxu

Improved Pseudorandom Generators from Pseudorandom Multi-Switching Lemmas

Rocco A. Servedio, Li-Yang Tan, Michael Wagner
2019 International Workshop on Approximation Algorithms for Combinatorial Optimization  
The key enabling ingredient in our approach is a new pseudorandom multi-switching lemma.  ...  We give the best known pseudorandom generators for two touchstone classes in unconditional derandomization: small-depth circuits and sparse F2 polynomials.  ...  Switching lemmas, first established in a series of breakthrough works in the 1980s [4, 29, 71, 34] , are fundamental results stating that depth-two circuits (ORs of ANDs or vice versa) simplify dramatically  ... 
doi:10.4230/lipics.approx-random.2019.45 dblp:conf/approx/ServedioT19 fatcat:gtiom7wivve6rhihqxwkzb3b4u

Diffusion limited aggregation and the fractal evolution of gene promoter networks

Preston R. Aldrich
2011 Network Biology  
This interplay between attractive and repulsive forces in a GPN is sufficient to generate a fractal topology.  ...  Here I report results of twenty seven in silico simulations for a diffusion limited aggregation model which accounts for much of the fractal structure previously observed in GPNs.  ...  In the figure, the dark torus marks the region of optimal promoter similarity assuming both attraction from the central consensus and repulsion from too close a match (strong version of DLA).  ... 
doaj:f6b04c89e65b4b7ea9e1e9139f0677d7 fatcat:zl3l3c3zq5c2db425x366koq5y

On the performance limits of data-aided synchronization

Yimin Jiang, Feng-Wen Sun, J.S. Baras
2003 IEEE Transactions on Information Theory  
This paper addresses data-aided (DA) synchronization, in which the reference parameter acquisition is aided by a training sequence known to the receiver.  ...  In this paper, we derive a closed-form CRB for timing and carrier phase recovery with respect to an arbitrary training sequence and pulse shaping function for the over and under sampling cases.  ...  Similar to earlier works, it assumes pseudorandom training data. In principle, it is possible to use a brute-force numerical approach to compute the CRB for any given training sequence.  ... 
doi:10.1109/tit.2002.806156 fatcat:haw4m4ehzvf2tjv432ua43q2ge

An Improved Central Force Optimization Algorithm for Multimodal Optimization

Jie Liu, Yu-ping Wang
2014 Journal of Applied Mathematics  
This paper proposes the hybrid CSM-CFO algorithm based on the simplex method (SM), clustering technique, and central force optimization (CFO) for unconstrained optimization.  ...  When tested against benchmark functions, in low and high dimensions, the CSM-CFO algorithm has competitive performance in terms of accuracy and convergence speed compared to other evolutionary algorithms  ...  method and exploration in central force optimization.  ... 
doi:10.1155/2014/895629 fatcat:5sng35hlyzbprjdue7y4cn7kba

Improvement algorithm of random numbers generators used intensively on simulation of stochastic processes

Edisel Navas Conyedo, Carlos Torres Pupo, Giuseppe B. Suffritti, Jorge Gulín González
2014 Revista Cubana de Ciencias Informáticas  
The results obtained using our computational tool allows to improve the random characteristics of any pseudorandom generator, and the subsequent improving of the accuracy and efficiency of computational  ...  Both models, in the non-interacting free particles approximation, are used to test the quality of the random number generators which will be used in more complex computational simulations.  ...  In the first model, RNG is used to simulate the molecular displacement by jumping; in the second one, to simulate the force on each particle, when the thermal noise is considered.  ... 
doaj:41d61f92679847a5b8743b94d008b412 fatcat:rdnbdf42pzb2jgkp3t4yruodvq

Multi-kilowatt diffractive coherent combining of pseudorandom-modulated fiber amplifiers

Angel Flores, Iyad Dajani, Roger Holten, Thomas Ehrenreich, Brian Anderson
2016 Optical Engineering: The Journal of SPIE  
Overall, multi-kW beam combining of pseudorandom-modulated fiber amplifiers was demonstrated for the first time.  ...  Additional losses due in part to nonideal polarization, amplified spontaneous emission content, uncorrelated wavefront errors, and fractional beam misalignments contributed to the efficiency reduction.  ...  John Luginsland of the Air Force Office of Scientific Research (AFOSR) for partially supporting this research. The authors would also like to thank Dr. Stuart McNaught, Dr. Joshua Rothenberg, and Dr.  ... 
doi:10.1117/1.oe.55.9.096101 fatcat:pqkflaspdrfwvlt7hnsl72l7zy

DEFINED: Deterministic Execution for Interactive Control-Plane Debugging

Chia-Chi Lin, Virajith Jalaparti, Matthew Caesar, Jacobus E. van der Merwe
2013 USENIX Annual Technical Conference  
Large-scale networks are among the most complex software infrastructures in existence.  ...  We demonstrate our system's advantages by reproducing discovery of known ordering and timing bugs in popular software routing platforms, XORP and Quagga.  ...  In particular, we design an optimized pseudorandom sequence to match the common-case ordering of events we would expect to see in the production network.  ... 
dblp:conf/usenix/LinJCM13 fatcat:lqrknnvevrgyvgg3srhxxovvsq

Improved pseudorandom generators from pseudorandom multi-switching lemmas [article]

Rocco A. Servedio, Li-Yang Tan
2018 arXiv   pre-print
The key enabling ingredient in our approach is a new pseudorandom multi-switching lemma.  ...  We give the best known pseudorandom generators for two touchstone classes in unconditional derandomization: an ε-PRG for the class of size-M depth-d AC^0 circuits with seed length (M)^d+O(1)·(1/ε), and  ...  In particular, a parameter of central importance in essentially all applications of switching lemmas is the probability that a given coordinate x i remains alive under a random (or pseudorandom) restriction  ... 
arXiv:1801.03590v1 fatcat:yodu5mvlvnfwxnlip3d3f5oppm

Entropy test for complexity in chaotic time series

Kenichiro Cho, Takaya Miyano
2016 Nonlinear Theory and Its Applications IEICE  
We discuss the performances of the time series as sequences of pseudorandom numbers for chaotic cryptography.  ...  We perform an entropy test, combined with a diagnostic test for the degree of visible determinism, for the complexity in chaotic time series.  ...  Here, the sampling time T is not optimized and set to unity, because the chaotic maps are not supposed to be used as the pseudorandom-number generators in our cryptographic method [10] because of the  ... 
doi:10.1587/nolta.7.21 fatcat:skbrswigvbgudojlwzosmua73i
« Previous Showing results 1 — 15 out of 5,222 results