Academic literature on the topic 'Algorithmic Number Generation'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Algorithmic Number Generation.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Algorithmic Number Generation"

1

Wang, Chao, Shuang Wang, Wei Chen, Zhen-Qiang Yin, and Zheng-Fu Han. "Analysis of entropy extraction efficiencies in random number generation systems." International Journal of Quantum Information 14, no. 01 (2016): 1630001. http://dx.doi.org/10.1142/s0219749916300011.

Full text
Abstract:
Random numbers (RNs) have applications in many areas: lottery games, gambling, computer simulation, and, most importantly, cryptography [N. Gisin et al., Rev. Mod. Phys. 74 (2002) 145]. In cryptography theory, the theoretical security of the system calls for high quality RNs. Therefore, developing methods for producing unpredictable RNs with adequate speed is an attractive topic. Early on, despite the lack of theoretical support, pseudo RNs generated by algorithmic methods performed well and satisfied reasonable statistical requirements. However, as implemented, those pseudorandom sequences we
APA, Harvard, Vancouver, ISO, and other styles
2

Storcz, Tamás, Zsolt Ercsey, Kristóf Roland Horváth, Zoltán Kovács, Balázs Dávid, and István Kistelegdi. "Energy Design Synthesis: Algorithmic Generation of Building Shape Configurations." Energies 16, no. 5 (2023): 2254. http://dx.doi.org/10.3390/en16052254.

Full text
Abstract:
The building industry is responsible for a significant degree of energy consumption in the world, causing negative climate changes and energy supply uncertainties due to low energy efficiency as well as the high resource demand of construction. Consequently, energy design optimization has become an important research field. Passive design strategies are one of the most definitive factors concerning energy-related building development. The given architectural problem calls for a method that can create all potentially feasible building geometries, thus guaranteeing the optimal solution which is
APA, Harvard, Vancouver, ISO, and other styles
3

Storcz, Tamás, Zsolt Ercsey, Kristóf Roland Horváth, Zoltán Kovács, Balázs Dávid, and István Kistelegdi. "Energy Design Synthesis: Algorithmic Generation of Building Shape Configurations." Energies 16, no. 5 (2023): 17. https://doi.org/10.3390/en16052254.

Full text
Abstract:
The building industry is responsible for a significant degree of energy consumption in the world, causing negative climate changes and energy supply uncertainties due to low energy efficiency as well as the high resource demand of construction. Consequently, energy design optimization has become an important research field. Passive design strategies are one of the most definitive factors concerning energy-related building development. The given architectural problem calls for a method that can create all potentially feasible building geometries, thus guaranteeing the optimal solution which is
APA, Harvard, Vancouver, ISO, and other styles
4

Inyutin, S. A. "General Approach to the Description of Computer Number Systems." Informacionnye Tehnologii 28, no. 4 (2022): 178–84. http://dx.doi.org/10.17587/it.28.178-184.

Full text
Abstract:
General relationships, algorithms, and differences for three numerical systems used in the field of computing technology are analyzed: positional, polyadic and modular. Their power-law modifications are obtained. A single basic algorithm for the formation of components of vectors representing numerical values in these systems, which are residues in relatively simple modules from the set of bases of a numerical system, is analyzed with an estimate of complexity. Vector representation of numerical values is a mathematical and algorithmic basis for generating arithmetic computer formats focused o
APA, Harvard, Vancouver, ISO, and other styles
5

Avram, Florin, Rim Adenane, Lasko Basnarkov, and Matthew D. Johnston. "Algorithmic Approach for a Unique Definition of the Next-Generation Matrix." Mathematics 12, no. 1 (2023): 27. http://dx.doi.org/10.3390/math12010027.

Full text
Abstract:
The basic reproduction number R0 is a concept which originated in population dynamics, mathematical epidemiology, and ecology and is closely related to the mean number of children in branching processes (reflecting the fact that the phenomena of interest are well approximated via branching processes, at their inception). Despite the very extensive literature around R0 for deterministic epidemic models, we believe there are still aspects which are not fully understood. Foremost is the fact that R0 is not a function of the original ODE model, unless we also include in it a certain (F,V) gradient
APA, Harvard, Vancouver, ISO, and other styles
6

Park, Suyoun, and Sung Ha Park. "Demonstration of Big Bang-like patterns through logic-implemented DNA algorithmic assembly." AIP Advances 12, no. 7 (2022): 075213. http://dx.doi.org/10.1063/5.0093198.

Full text
Abstract:
A DNA algorithm-based logic gate provides an efficient platform for generating various patterns through self-assembly. Self-assembly algorithms using M-input N-output logic gates are easily implemented in DNA tiles. The patterns generated by a 3-input 1-output logic gate show interesting features, such as demonstrations of mathematical functions, physical phenomena observed in nature, and logic operators. We notice that among the 3-input 1-output logic rules, the algorithmic lattices generated by R30 show interesting Big Bang-like patterns. A pattern generated by R30 and specific initial value
APA, Harvard, Vancouver, ISO, and other styles
7

G, Anahita, Krishnapriya KPM, Shiva Prasad R, and Mohan Kumar N. "HD-Sign: Hardware Based Digital Signature Generation Using True Random Number Generator." International Journal of Engineering & Technology 7, no. 3.8 (2018): 147. http://dx.doi.org/10.14419/ijet.v7i3.8.16850.

Full text
Abstract:
With the recent advancements in the field of computing, a fair share of easier and safer practices to exchange and share information between multiple parties have propped up. While some of these are improvisations, a few such as the Digital Signatures, have fast replaced conventional signing practices. It’s wide use and acceptance in the industry as well as officially, has necessitated higher security to protect data integrity and privacy. These digital Signatures are generated on the basis of various schemes that are designed to accommodate efficiency, crypto security and algorithmic complexi
APA, Harvard, Vancouver, ISO, and other styles
8

Nam, Hyoungwook, Segwang Kim, and Kyomin Jung. "Number Sequence Prediction Problems for Evaluating Computational Powers of Neural Networks." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 4626–33. http://dx.doi.org/10.1609/aaai.v33i01.33014626.

Full text
Abstract:
Inspired by number series tests to measure human intelligence, we suggest number sequence prediction tasks to assess neural network models’ computational powers for solving algorithmic problems. We define the complexity and difficulty of a number sequence prediction task with the structure of the smallest automaton that can generate the sequence. We suggest two types of number sequence prediction problems: the number-level and the digit-level problems. The number-level problems format sequences as 2-dimensional grids of digits and the digit-level problems provide a single digit input per a tim
APA, Harvard, Vancouver, ISO, and other styles
9

Howard, David, Jack Collins, and Nicole Robinson. "Taking Shape: A Perspective on the Future of Embodied Cognition and a new Generation of Evolutionary Robotics." IOP Conference Series: Materials Science and Engineering 1261, no. 1 (2022): 012018. http://dx.doi.org/10.1088/1757-899x/1261/1/012018.

Full text
Abstract:
Abstract The philosophy of Embodied Cognition (EC) presents an intuitive lens with which to consider a variety of problems that attempt to optimise or refine some physically-grounded combination of form and function. Conceptualised as a Venn diagram, with circles of 'body', 'brain', and 'environment', the prevailing notion is that moving to the centre of the diagram is the ultimate goal - intertwining and leveraging all three components to generate adaptive solutions. Philosophically, at least, this makes sense: nature abounds with examples of life that extol the virtues of tightly-coupled emb
APA, Harvard, Vancouver, ISO, and other styles
10

BERTHÉ, VALÉRIE, JÉRÉMIE BOURDON, TIMO JOLIVET, and ANNE SIEGEL. "A combinatorial approach to products of Pisot substitutions." Ergodic Theory and Dynamical Systems 36, no. 6 (2015): 1757–94. http://dx.doi.org/10.1017/etds.2014.141.

Full text
Abstract:
We define a generic algorithmic framework to prove a pure discrete spectrum for the substitutive symbolic dynamical systems associated with some infinite families of Pisot substitutions. We focus on the families obtained as finite products of the three-letter substitutions associated with the multidimensional continued fraction algorithms of Brun and Jacobi–Perron. Our tools consist in a reformulation of some combinatorial criteria (coincidence conditions), in terms of properties of discrete plane generation using multidimensional (dual) substitutions. We also deduce some topological and dynam
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Algorithmic Number Generation"

1

Epstein, Peter Carleton University Dissertation Computer Science. "Generating geometric objects at random." Ottawa, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Stewart, Robert Grisham. "A Statistical Evaluation of Algorithms for Independently Seeding Pseudo-Random Number Generators of Type Multiplicative Congruential (Lehmer-Class)." Digital Commons @ East Tennessee State University, 2007. https://dc.etsu.edu/etd/2049.

Full text
Abstract:
To be effective, a linear congruential random number generator (LCG) should produce values that are (a) uniformly distributed on the unit interval (0,1) excluding endpoints and (b) substantially free of serial correlation. It has been found that many statistical methods produce inflated Type I error rates for correlated observations. Theoretically, independently seeding an LCG under the following conditions attenuates serial correlation: (a) simple random sampling of seeds, (b) non-replicate streams, (c) non-overlapping streams, and (d) non-adjoining streams. Accordingly, 4 algorithms (each sa
APA, Harvard, Vancouver, ISO, and other styles
3

Mor, Stefano Drimon Kurz. "Analysis of synchronizations in greedy-scheduled executions and applications to efficient generation of pseudorandom numbers in parallel." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2015. http://hdl.handle.net/10183/130529.

Full text
Abstract:
Nous présentons deux contributions dans le domaine de la programmation parallèle. La première est théorique : nous introduisons l’analyse SIPS, une approche nouvelle pour dénombrer le nombre d’opérations de synchronisation durant l’exécution d’un algorithme parallèle ordonnancé par vol de travail. Basée sur le concept d’horloges logiques, elle nous permet : d’une part de donner de nouvelles majorations de coût en moyenne; d’autre part de concevoir des programmes parallèles plus efficaces par adaptation dynamique de la granularité. La seconde contribution est pragmatique : nous présentons une p
APA, Harvard, Vancouver, ISO, and other styles
4

Hauser, Michael A., and Wolfgang Hörmann. "The Generation of Stationary Gaussian Time Series." Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business, 1997. http://epub.wu.ac.at/1630/1/document.pdf.

Full text
Abstract:
Three different algorithms for the generation of stationary Gaussian time series with given autocorrelation function are presented in this paper. The algorithms have already been suggested in the literature but are not well known and have never been compared before. Interrelations between the different methods, advantages and disadvantages with respect to speed and memory requirements and the range of autocorrelation functions for which the different methods are stable are discussed. The time-complexity of the algorithms and the comparisons of their implementations show that the method twice u
APA, Harvard, Vancouver, ISO, and other styles
5

Greiner, Johannes N. [Verfasser], and Jörg [Akademischer Betreuer] Wrachtrup. "Algorithms and resources for quantum technology, sensing and random number generation / Johannes N. Greiner ; Betreuer: Jörg Wrachtrup." Stuttgart : Universitätsbibliothek der Universität Stuttgart, 2020. http://d-nb.info/1233681265/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Andersson, Anton. "On Generating Complex Numbers for FFT and NCO Using the CORDIC Algorithm." Thesis, Linköping University, Department of Electrical Engineering, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-15556.

Full text
Abstract:
<p>This report has been compiled to document the thesis work carried out by Anton Andersson for Coresonic AB. The task was to develop an accelerator that could generate complex numbers suitable for fast fourier transforms (FFT) and tuning the phase of complex signals (NCO). Of many ways to achieve this, the CORDIC algorithm was chosen. It is very well suited since the basic implementation allows rotation of 2D-vectors using only shift and add operations. Error bounds and proof of convergence are derived carefully The accelerator was implemented in VHDL in such a way that all critical parameter
APA, Harvard, Vancouver, ISO, and other styles
7

Hörmann, Wolfgang, and Josef Leydold. "Continuous Random Variate Generation by Fast Numerical Inversion." Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business, 2002. http://epub.wu.ac.at/664/1/document.pdf.

Full text
Abstract:
The inversion method for generating non-uniform random variates has some advantages compared to other generation methods, since it monotonically transforms uniform random numbers into non-uniform random variates. Hence it is the method of choice in the simulation literature. However, except for some simple cases where the inverse of the cumulative distribution function is a simple function we need numerical methods. Often inversion by ``brute force" is used, applying either very slow iterative methods or linear interpolation of the CDF and huge tables. But then the user has to accept unnecessa
APA, Harvard, Vancouver, ISO, and other styles
8

Leydold, Josef, and Wolfgang Hörmann. "Universal Algorithms as an Alternative for Generating Non-Uniform Continuous Random Variates." Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business, 2000. http://epub.wu.ac.at/844/1/document.pdf.

Full text
Abstract:
This paper presents an overview of the most powerful universal methods. These are based on acceptance/rejection techniques where hat and squeezes are constructed automatically. Although originally motivated to sample from non-standard distributions these methods have advantages that make them attractive even for sampling from standard distributions and thus are an alternative to special generators tailored for particular distributions. Most important are: the marginal generation time is fast and does not depend on the distribution. They can be used for variance reduction techniques, and they p
APA, Harvard, Vancouver, ISO, and other styles
9

Hörmann, Wolfgang, and Josef Leydold. "Automatic Random Variate Generation for Simulation Input." Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business, 2000. http://epub.wu.ac.at/534/1/document.pdf.

Full text
Abstract:
We develop and evaluate algorithms for generating random variates for simulation input. One group called automatic, or black-box algorithms can be used to sample from distributions with known density. They are based on the rejection principle. The hat function is generated automatically in a setup step using the idea of transformed density rejection. There the density is transformed into a concave function and the minimum of several tangents is used to construct the hat function. The resulting algorithms are not too complicated and are quite fast. The principle is also applicable to random vec
APA, Harvard, Vancouver, ISO, and other styles
10

Xu, Jinzhong. "Stream Cipher Analysis Based on FCSRs." UKnowledge, 2000. http://uknowledge.uky.edu/gradschool_diss/320.

Full text
Abstract:
Cryptosystems are used to provide security in communications and data transmissions. Stream ciphers are private key systems that are often used to transform large volumn data. In order to have security, key streams used in stream ciphers must be fully analyzed so that they do not contain specific patterns, statistical infomation and structures with which attackers are able to quickly recover the entire key streams and then break down the systems. Based on different schemes to generate sequences and different ways to represent them, there are a variety of stream cipher analyses. The most import
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Algorithmic Number Generation"

1

Alonso, Laurent. Random generation of trees: Random generators in computer science. Kluwer Academic, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Panteleev, Andrey, Natal'ya Savost'yanova, and Natal'ya Fedorova. Mathematical analysis. INFRA-M Academic Publishing LLC., 2020. http://dx.doi.org/10.12737/1077332.

Full text
Abstract:
The manual contains a brief statement of the course of mathematical analysis. In contrast to existing academic literature textbook starts with a Chapter on "Basic mathematics" that covers arithmetic and algebra, i.e. the essential information needed when solving problems of higher mathematics. Along with theoretical material all the sections are accompanied by a number of examples, including illustrating the geometric and economic meanings of the introduced concepts, methods and algorithms for solving mathematical, engineering and economic challenges. Given tasks for independent solving with a
APA, Harvard, Vancouver, ISO, and other styles
3

Varlamov, Oleg. Mivar databases and rules. INFRA-M Academic Publishing LLC., 2021. http://dx.doi.org/10.12737/1508665.

Full text
Abstract:
The multidimensional open epistemological active network MOGAN is the basis for the transition to a qualitatively new level of creating logical artificial intelligence. Mivar databases and rules became the foundation for the creation of MOGAN. The results of the analysis and generalization of data representation structures of various data models are presented: from relational to "Entity — Relationship" (ER-model). On the basis of this generalization, a new model of data and rules is created: the mivar information space "Thing-Property-Relation". The logic-computational processing of data in th
APA, Harvard, Vancouver, ISO, and other styles
4

Milne, Andy. Linking Sonic Aesthetics with Mathematical Theories. Edited by Roger T. Dean and Alex McLean. Oxford University Press, 2018. http://dx.doi.org/10.1093/oxfordhb/9780190226992.013.6.

Full text
Abstract:
Pure mathematics provides principles, procedures, and ways of thinking that can be fruitful starting points for music composition, performance, and algorithmic generation. In this chapter, a number of mathematical methods are suggested as useful ways to define and transform underlying musical structures such as metres and scales, and to realize these structures as finished pieces of music. The mathematical methods include the discrete Fourier transform, geometry, algebraic word theory, and tiling, and the chapter explains how these relate to musical features such as periodicity (or lack of per
APA, Harvard, Vancouver, ISO, and other styles
5

Schacher, Jan C. Algorithmic Spatialization. Edited by Roger T. Dean and Alex McLean. Oxford University Press, 2018. http://dx.doi.org/10.1093/oxfordhb/9780190226992.013.12.

Full text
Abstract:
Beginning with a brief historical overview of spatial audio and music practices, this chapter looks at principles of sound spatialization, algorithms for composing and rendering spatial sound and music, and different techniques of spatial source positioning and sound space manipulation. These operations include composing with abstract objects in a sound scene, creating compound sounds using source clusters, altering spatial characteristics by means of spectral sound decomposition, and the manipulation of artificial acoustic spaces. The chapter goes on to discuss practical issues of live spatia
APA, Harvard, Vancouver, ISO, and other styles
6

Coolen, A. C. C., A. Annibale, and E. S. Roberts. Ensembles with hard constraints. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198709893.003.0005.

Full text
Abstract:
This chapter introduces random graph ensembles involving hard constraints such as setting a fixed total number of links or fixed degree sequence, including properties of the partition function. It continues on from the previous chapter’s investigation of ensembles with soft-constrained numbers of two-stars (two-step paths) and soft-constrained total number of triangles, but now combined with a hard constraint on the total number of links. This illustrates phase transitions in a mixed-constrained ensemble – which in this case is shown to be a condensation transition, where the network becomes c
APA, Harvard, Vancouver, ISO, and other styles
7

Schott, René, and Laurent Alonso. Random Generation of Trees: Random Generators in Computer Science. Springer, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Feinberg, Melanie. Everyday Adventures with Unruly Data. The MIT Press, 2022. http://dx.doi.org/10.7551/mitpress/14198.001.0001.

Full text
Abstract:
Paired informal and scholarly essays show how everyday events reveal fundamental concepts of data, including its creation, aggregation, management, and use. Whether questioning numbers on a scale, laughing at a misspelling of one's name, or finding ourselves confused in a foreign supermarket, we are engaging with data. The only way to handle data responsibly, says Melanie Feinberg in this incisive work, is to take into account its human character. Though the data she discusses may seem familiar, close scrutiny shows it to be ambiguous, complicated, and uncertain: unruly. Drawing on the tools o
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Algorithmic Number Generation"

1

Tanigawa, Shin-ichi, and Naoki Katoh. "Polygonal Curve Approximation Using Grid Points with Application to a Triangular Mesh Generation with Small Number of Different Edge Lengths." In Algorithmic Aspects in Information and Management. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11775096_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kao, Ming-Yang. "Random Number Generation." In Encyclopedia of Algorithms. Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-30162-4_329.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Tempo, Roberto, Giuseppe Calafiore, and Fabrizio Dabbene. "Random Number and Variate Generation." In Randomized Algorithms for Analysis and Control of Uncertain Systems. Springer London, 2013. http://dx.doi.org/10.1007/978-1-4471-4610-0_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Yao, Andrew C. "Context-Free Grammars and Random Number Generation." In Combinatorial Algorithms on Words. Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/978-3-642-82456-2_25.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Mascagni, Michael. "Some Methods of Parallel Pseudorandom Number Generation." In Algorithms for Parallel Processing. Springer New York, 1999. http://dx.doi.org/10.1007/978-1-4612-1516-5_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Zhang, Xuyan, Ziyi Zhou, Siqi Xu, Feifei Wang, and Jie Song. "A Novel High-Performance Random Number Generation Algorithm." In Communications in Computer and Information Science. Springer Nature Singapore, 2025. https://doi.org/10.1007/978-981-96-4509-1_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Mihăilescu, Preda. "Algorithms for Generating, Testing and Proving Primes: A Survey." In Cryptography and Computational Number Theory. Birkhäuser Basel, 2001. http://dx.doi.org/10.1007/978-3-0348-8295-8_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Gawade, Aruna, and Rushabh Vinchhi. "Lightweight Random Number Generation for Elliptic Curve Cryptography for Use in IoT." In Algorithms for Intelligent Systems. Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-3242-9_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Cárdenas-Montes, Miguel, Miguel A. Vega-Rodríguez, and Antonio Gómez-Iglesias. "Sensitiveness of Evolutionary Algorithms to the Random Number Generator." In Adaptive and Natural Computing Algorithms. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-20282-7_38.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Pushpalatha, V., K. B. Sudeepa, and H. N. Mahendra. "Pseudo Random Number Generation Based on Genetic Algorithm Application." In Advances in Intelligent Systems and Computing. Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-3514-7_59.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Algorithmic Number Generation"

1

Shi, Linshan, Changsong Zhao, Min Jin, Zhongyu Xu, Feng Li, and Yaobin Shen. "A Resource-Friendly Random Number Generation Algorithm for IoT." In 2024 7th International Conference on Algorithms, Computing and Artificial Intelligence (ACAI). IEEE, 2024. https://doi.org/10.1109/acai63924.2024.10899605.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Tsai, Meng-Lin, and Styliani Avraamidou. "Assessing Triviality in Random Mixed-Integer Bilevel Optimization Problems to Improve Problem Generators and Libraries." In The 35th European Symposium on Computer Aided Process Engineering. PSE Press, 2025. https://doi.org/10.69997/sct.149474.

Full text
Abstract:
While bilevel optimization is gaining prominence across various domains, the field lacks standardized tools for generating test problems that can effectively evaluate and guide the development of efficient solution algorithms. We define the term "trivial bilevel optimization problem" as a bilevel problem whose high-point relaxation solution is also feasible. These easy-to-solve problems frequently arise in na�ve implementations of random bilevel optimization problem generators, significantly impacting the evaluation of bilevel solution algorithms. However, this problem has not been addressed i
APA, Harvard, Vancouver, ISO, and other styles
3

Yadav, Ajeet Kumar, Nishant Kumar, and Rathna G N. "Generation of Indian Sign Language Letters, Numbers, and Words." In 2024 International Conference on Intelligent Algorithms for Computational Intelligence Systems (IACIS). IEEE, 2024. http://dx.doi.org/10.1109/iacis61494.2024.10721847.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kavitha, S. S., Narasimha Kaulgud, B. S. Sharmila, B. M. Nandini, R. Rishwanth Ram, and Deepit Petkar. "Quantum Shor's Algorithm vs. Classical General Number Field Sieve (GNFS) Approach for Large Integer Factorization." In 2025 International Conference on Next Generation Communication & Information Processing (INCIP). IEEE, 2025. https://doi.org/10.1109/incip64058.2025.11019635.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Mamatha, Malavath, and V. Prithivirajan. "Design and Implementation of True Random Number Test Pattern Generator for Enhanced BIST Performance in Integrated Circuits." In 2024 International Conference on Intelligent Algorithms for Computational Intelligence Systems (IACIS). IEEE, 2024. http://dx.doi.org/10.1109/iacis61494.2024.10721833.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Dasadhikari, Kingshuk, and Yoshihiro Kuwamura. "Rapid Algorithmic Blade Design Applying Machine Learning From Shape Optimization to Satisfy Multidisciplinary Constraints." In ASME Turbo Expo 2023: Turbomachinery Technical Conference and Exposition. American Society of Mechanical Engineers, 2023. http://dx.doi.org/10.1115/gt2023-102700.

Full text
Abstract:
Abstract This paper presents a new, rapid, flexible approach for turbine blade section design combining algorithmic and inverse techniques to enable automatic generation of blade sections guaranteed to conform to multidisciplinary requirements, with the aim of accelerating turbomachinery design iterations. The approach links a base algorithm to parametrize and generate blade section geometry conforming to structural and manufacturability constraints such as section area, trailing edge radius, and exit wedge angle with a 2D CFD solver to calculate surface isentropic Mach number profile for aero
APA, Harvard, Vancouver, ISO, and other styles
7

Loconsole, Claudio, and Massimiliano Panarari. "Algorithmic Journalism and Ideological Polarization: An Experimental Work Around ChatGPT and the Production of Politically Oriented Information." In 13th International Conference on Human Interaction & Emerging Technologies: Artificial Intelligence & Future Applications. AHFE International, 2025. https://doi.org/10.54941/ahfe1005943.

Full text
Abstract:
Artificial intelligence (AI) is one of the emerging technologies that is developing with ever greater intensity and in an ever-increasing number of domains, often overturning the features of these domains. In the domain of journalism, generative AI has become a tool used to write texts and articles with potential implications on ethics and on the issue of transparency (Diakopoulos, Koliska, 2017) together with a possible reconfiguration of the perimeter and of the foundations of making information, with the oscillation between different options and positions (Schapals, Porlezza, 2020). The sci
APA, Harvard, Vancouver, ISO, and other styles
8

Li, Dawei, Yier Jin, Haibin Shen, and Xiaolang Yan. "Design of Random Number Generation Algorithm." In 2006 International Conference on Computational Intelligence and Security. IEEE, 2006. http://dx.doi.org/10.1109/iccias.2006.295264.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Colesa, Adrian, Radu Tudoran, and Sebastian Banescu. "Software Random Number Generation Based on Race Conditions." In 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing. IEEE, 2008. http://dx.doi.org/10.1109/synasc.2008.36.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Chittala, Abhilash, Tharun Bhupathi, and Durga Prasad Alakunta. "Random Number Generation Algorithms for Performance Testing." In 2021 5th International Conference on Electronics, Materials Engineering & Nano-Technology (IEMENTech). IEEE, 2021. http://dx.doi.org/10.1109/iementech53263.2021.9614832.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Algorithmic Number Generation"

1

Dolotii, Marharyta H., and Pavlo V. Merzlykin. Using the random number generator with a hardware entropy source for symmetric cryptography problems. [б. в.], 2018. http://dx.doi.org/10.31812/123456789/2883.

Full text
Abstract:
The aim of the research is to test the possibility of using the developed random number generator [1], which utilizes the sound card noise as an entropy source, in the symmetric cryptography algorithms.
APA, Harvard, Vancouver, ISO, and other styles
2

van der Mensbrugghe, Dominique. A Summary Guide to the Latin Hypercube Sampling (LHS) Utility. GTAP Working Paper, 2023. http://dx.doi.org/10.21642/gtap.wp94.

Full text
Abstract:
Latin Hypercube Sampling (LHS) is one method of Monte Carlo-type sampling, which is useful for limiting sample size yet maximizing the range of sampling of the underlying distributions. The LHS utility, for which this document describes the usage, also allows for user-specified correlations between two or more of the sampled distributions. The LHS utility described herein is a full re-coding using C/C++ of the original LHS utility—developed at Sandia National Labs (Swiler and Wyss (2004)), written in FORTRAN and freely available. The re-coding hones close to the original FORTRAN code, but allo
APA, Harvard, Vancouver, ISO, and other styles
3

Amela, R., R. Badia, S. Böhm, R. Tosi, C. Soriano, and R. Rossi. D4.2 Profiling report of the partner’s tools, complete with performance suggestions. Scipedia, 2021. http://dx.doi.org/10.23967/exaqute.2021.2.023.

Full text
Abstract:
This deliverable focuses on the proling activities developed in the project with the partner's applications. To perform this proling activities, a couple of benchmarks were dened in collaboration with WP5. The rst benchmark is an embarrassingly parallel benchmark that performs a read and then multiple writes of the same object, with the objective of stressing the memory and storage systems and evaluate the overhead when these reads and writes are performed in parallel. A second benchmark is dened based on the Continuation Multi Level Monte Carlo (C-MLMC) algorithm. While this algorithm is norm
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!