Увійти

Готові списки джерел за темами / Universal Computing Program / Статті в журналах

Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Universal Computing Program.

Статті в журналах з теми "Universal Computing Program"

Автор: Grafiati

Опубліковано: 3 червня 2025

Оновлено: 31 липня 2025

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Universal Computing Program".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.

1

HUTTER, MARCUS. "THE FASTEST AND SHORTEST ALGORITHM FOR ALL WELL-DEFINED PROBLEMS." International Journal of Foundations of Computer Science 13, no. 03 (2002): 431–43. http://dx.doi.org/10.1142/s0129054102001199.

Повний текст джерела

Анотація:

An algorithm M is described that solves any well-defined problem p as quickly a the fastest algorithm computing a solution to p, save for a factor of 5 and low-order additive terms. M optimally distributes resources between the execution of provably correct p-solving programs and an enumeration of all proofs, including relevant proofs of program correctness and of time bounds on program runtimes. M avoids Blum's speed-up theorem by ignoring programs without correctness proof. M has broader applicability and can be faster than Levin's universal search, the fastest method for inverting functions

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Gorodnyaya, Lidia. "FUNCTIONAL PROGRAMMING FOR PARALLEL COMPUTING." Bulletin of the Novosibirsk Computing Center. Series: Computer Science, no. 45 (2021): 29–48. http://dx.doi.org/10.31144/bncc.cs.2542-1972.2021.n45.p29-48.

Повний текст джерела

Анотація:

The paper is devoted to modern trends in the application of functional programming to the problems of organizing parallel computations. Functional programming is considered as a meta-paradigm for solving the problems of developing multi-threaded programs for multiprocessor complexes and distributed systems, as well as for solving the problems associated with rapid IT development. The semantic and pragmatic principles of functional programming and consequences of these principles are described. The paradigm analysis of programming languages and systems is used, which allows assessing their simi

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Wang DongSheng. "Universal quantum computing models:a resource-theoretic study." Acta Physica Sinica 73, no. 22 (2024): 0. http://dx.doi.org/10.7498/aps.73.20240893.

Повний текст джерела

Анотація:

Quantum computing has been proven to be powerful, however, there are still great challenges for building real quantum computers due to the requirements of both fault-tolerance and universality. People still lack a systematic way to design fast quantum algorithms and identify the key quantum resources. In this work, we develop a resource-theoretic approach to characterize universal quantum computing models and the universal resources for quantum computing.<br>Our theory combines the framework of universal quantum computing model (UQCM) and the quantum resource theory (QRT). The former has

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Emelyanov, S. A. "Actual issues of operation of CNC machines — preparation of control programs." Glavnyj mekhanik (Chief Mechanic), no. 7 (June 15, 2023): 437–47. http://dx.doi.org/10.33920/pro-2-2307-07.

Повний текст джерела

Анотація:

The article analyzes various options for the preparation of control programs for CNC machines: the use of computer-aided design systems, the use of integrated CNC editors, the use of universal computing tools (personal computers, laptops, tablets), interactive writing of the program in manual control mode, the use of templates for specific processing methods, the use of converters that convert control programs developed by for other CNC systems, the use of converters from raster or vector files.

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Hartmann, Lars, Neil D. Jones, Jakob Grue Simonsen, and Søren Bjerregaard Vrist. "Programming in Biomolecular Computation: Programs, Self-Interpretation and Visualisation." Scientific Annals of Computer Science XXI, no. 1 (2011): 73–106. https://doi.org/10.5281/zenodo.12720717.

Повний текст джерела

Анотація:

Our goal is to provide a top-down approach to biomolecular computation. In spite of widespread discussion about connections between biology and computation, one question seems notable by its absence: Where are the programs? We identify a number of common features in programming that seem conspicuously absent from the literature on biomolecular computing; to partially redress this absence, we introduce a model of computation that is evidently programmable, by programs reminiscent of low-level computer machine code; and at the same time biologically plausible: its functioning is defined by a sin

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Liu, Xie Quan, Xin Hua Ni, Shu Qin Zhang, Lei Zhao, and Guo Hui Zhong. "The Stress-Strain Analysis for the Nonlinear and Strength Difference Structure of Bars Jointed to Rigid-Body of Fixed-Point Motion." Advanced Materials Research 156-157 (October 2010): 383–86. http://dx.doi.org/10.4028/www.scientific.net/amr.156-157.383.

Повний текст джерела

Анотація:

Many material have different stress-strain relation in tension and compression, generally the relation is nonlinear. In this paper, we use two exponential functions to approximately represent the stress-strain relation of nonlinearly elastic material and analyze strength-difference structure of bars jointed to Rigid-body of fixed-point motion. The displacement method is used to derive the universal expression of calculating stress and strain. The nonlinear equations for computing angular displacement of the rigid-body has been given and general computing program has been worked out. They can b

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Jiang, Zhen Zhen. "Cycloid Pinwheel Planet Drive Nonlinear Meshing Stiffness Calculation and Analysis." Applied Mechanics and Materials 543-547 (March 2014): 224–27. http://dx.doi.org/10.4028/www.scientific.net/amm.543-547.224.

Повний текст джерела

Анотація:

Mathematical model of pin-cycloid meshing stiffness is set up by profile modification with clearance meshing analytical method. An universal program of pin-cycloid meshing stiffness is compiled, by which meshing stiffness is computed. Computing results show that meshing stiffness is changing with time greatly, which indicate that changing meshing stiffness is a main factor on vibration of whole machine. Better value of modification and curtate ratio coefficient are gotten by analyzing factors on meshing stiffness,such as value of modification ,curtate ratio coefficient and pin-cycloid radius e

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Hamzeh, Ali, and Zakaria Al-Omari. "Improved model for investigating transient stability in multimachine power systems." Indonesian Journal of Electrical Engineering and Computer Science 13, no. 1 (2019): 368–76. https://doi.org/10.11591/ijeecs.v13.i1.pp368-376.

Повний текст джерела

Анотація:

The determinant factor in transient stability study of electric power systems is the behavior of synchronous generators when subjected to sudden and large disturbances. The objective of this paper is to develop a mathematical model, general algorithm, and a computer program to investigate the transient stability of multi-machine power systems. The developed mathematical model is established as a first step. The new developments lie in modeling the fault occurrence and fault clearance as well as the procedure of computing the system matrices during and after the fault through only modification

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Hou, Xiang Lin, De Sheng Huang, and Cong Chen. "Optimization Algorithm of Matrix Riccati Differential Equation and Application." Advanced Engineering Forum 2-3 (December 2011): 801–6. http://dx.doi.org/10.4028/www.scientific.net/aef.2-3.801.

Повний текст джерела

Анотація:

To the matrix Riccati differential equation, based on dynamic design Variables Optimization Method, making unknown element of Riccati matrix as design variables, square sum of defined summation matrix element as objective function, a kind of new optimization Method about element of Riccati matrix orders is built. Universal program is formed. Practical examples are computed. Effectiveness is shown through result. The method is a new thinking for computing high order matrix Riccati Differential equation and obtaining control parameters.

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Alfonseca, Manuel, Manuel Cebrian, Antonio Fernandez Anta, Lorenzo Coviello, Andrés Abeliuk, and Iyad Rahwan. "Superintelligence Cannot be Contained: Lessons from Computability Theory." Journal of Artificial Intelligence Research 70 (January 5, 2021): 65–76. http://dx.doi.org/10.1613/jair.1.12202.

Повний текст джерела

Анотація:

Superintelligence is a hypothetical agent that possesses intelligence far surpassing that of the brightest and most gifted human minds. In light of recent advances in machine intelligence, a number of scientists, philosophers and technologists have revived the discussion about the potentially catastrophic risks entailed by such an entity. In this article, we trace the origins and development of the neo-fear of superintelligence, and some of the major proposals for its containment. We argue that total containment is, in principle, impossible, due to fundamental limits inherent to computing itse

Стилі APA, Harvard, Vancouver, ISO та ін.

11

Alfonseca, Manuel, Manuel Cebrian, Antonio Fernandez Anta, Lorenzo Coviello, Andrés Abeliuk, and Iyad Rahwan. "Superintelligence Cannot be Contained: Lessons from Computability Theory." Journal of Artificial Intelligence Research 70 (January 5, 2021): 65–76. http://dx.doi.org/10.1613/jair.1.12202.

Повний текст джерела

Анотація:

Superintelligence is a hypothetical agent that possesses intelligence far surpassing that of the brightest and most gifted human minds. In light of recent advances in machine intelligence, a number of scientists, philosophers and technologists have revived the discussion about the potentially catastrophic risks entailed by such an entity. In this article, we trace the origins and development of the neo-fear of superintelligence, and some of the major proposals for its containment. We argue that total containment is, in principle, impossible, due to fundamental limits inherent to computing itse

Стилі APA, Harvard, Vancouver, ISO та ін.

12

TEKLE, K. TUNCAY, and YANHONG A. LIU. "Precise complexity guarantees for pointer analysis via Datalog with extensions." Theory and Practice of Logic Programming 16, no. 5-6 (2016): 916–32. http://dx.doi.org/10.1017/s1471068416000405.

Повний текст джерела

Анотація:

AbstractPointer analysis is a fundamental static program analysis for computing the set of objects that an expression can refer to. Decades of research has gone into developing methods of varying precision and efficiency for pointer analysis for programs that use different language features, but determining precisely how efficient a particular method is has been a challenge in itself.For programs that use different language features, we consider methods for pointer analysis using Datalog and extensions to Datalog. When the rules are in Datalog, we present the calculation of precise time comple

Стилі APA, Harvard, Vancouver, ISO та ін.

13

MAINZER, KLAUS. "CELLULAR NEURAL NETWORKS AND VISUAL COMPUTING." International Journal of Bifurcation and Chaos 13, no. 01 (2003): 1–6. http://dx.doi.org/10.1142/s0218127403006534.

Повний текст джерела

Анотація:

Brain-like information processing has become a challenge to modern computer science and chip technology. The CNN (Cellular Neural Network) Universal Chip is the first fully programmable industrial-sized brain-like stored-program dynamic array computer which dates back to an invention of Leon O. Chua and Lin Yang in Berkeley in 1988. Since then, many papers have been written on the mathematical foundations and technical applications of CNN chips. They are already used to model artificial, physical, chemical, as well as living biological systems. CNN is now a new computing paradigm of interdisci

Стилі APA, Harvard, Vancouver, ISO та ін.

14

Zhang, Hong Ming, Qin Ke Yang, Shu Qin Li, et al. "Design and Implementation of Regional LS Factor Computing Tool Based on GIS and Array Operation." Applied Mechanics and Materials 394 (September 2013): 509–14. http://dx.doi.org/10.4028/www.scientific.net/amm.394.509.

Повний текст джерела

Анотація:

For over 40 years, the universal soil loss equation (USLE) and its revised version the revised universal soil loss equation (RUSLE) have been used all over the world for soil mean annual loss per area unit. Because of the watershed erosion models are under developing, many researchers applied the USLE and RUSLE to estimate soil loss in watershed estimations. However, a major limitation is the difficulty in extracting the LS factor. The geographic information system-based (GIS-based) methods which have been developed for estimating the slope length for USLE and RUSLE model also have limitations

Стилі APA, Harvard, Vancouver, ISO та ін.

15

Sarkar, Aritra, Zaid Al-Ars, and Koen Bertels. "Estimating Algorithmic Information Using Quantum Computing for Genomics Applications." Applied Sciences 11, no. 6 (2021): 2696. http://dx.doi.org/10.3390/app11062696.

Повний текст джерела

Анотація:

Inferring algorithmic structure in data is essential for discovering causal generative models. In this research, we present a quantum computing framework using the circuit model, for estimating algorithmic information metrics. The canonical computation model of the Turing machine is restricted in time and space resources, to make the target metrics computable under realistic assumptions. The universal prior distribution for the automata is obtained as a quantum superposition, which is further conditioned to estimate the metrics. Specific cases are explored where the quantum implementation offe

Стилі APA, Harvard, Vancouver, ISO та ін.

16

Ivancova, Olga, Vladimir Korenkov, Olga Tyatyushkina, Sergey Ulyanov, and Toshio Fukuda. "Quantum supremacy in end-to-end intelligent IT. PT. III. Quantum software engineering – quantum approximate optimization algorithm on small quantum processors." System Analysis in Science and Education, no. 2 (2020) (June 30, 2020): 115–76. http://dx.doi.org/10.37005/2071-9612-2020-2-115-176.

Повний текст джерела

Анотація:

Principles and methodologies of quantum algorithmic gate-based design on small quantum computer described. The possibilities of quantum algorithmic gates simulation on classical computers discussed. A new approach to a circuit implementation design of quantum algorithm gates for fast quantum massive parallel computing presented. SW & HW support sophisticated smart toolkit of supercomputing accelerator of quantum algorithm simulation on small quantum programmable computer algorithm gate (that can program in SW to implement arbitrary quantum algorithms by executing any sequence of universal

Стилі APA, Harvard, Vancouver, ISO та ін.

17

Che, Xiao Yi, Qi Yuan Liu, and You Xin Luo. "Differential Evolution Algorithm with Hybrid Discrete Variables and its Application to Mechanical Optimization." Advanced Materials Research 502 (April 2012): 402–6. http://dx.doi.org/10.4028/www.scientific.net/amr.502.402.

Повний текст джерела

Анотація:

The optimization design about hybrid discrete variables is very significant but also difficult in engineering, mathematics for programming and operational research. Aimed at shortages of existing optimum methods, in this paper, according to the search mechanism of differential evolution algorithm (DEA), a new differential evolution algorithm is proposed to complex optimization problem with hybrid discrete variables The dynamic penalty function was constructed. DEA algorithm program with hybrid discrete variables is developed. The computing examples of mechanical optimization design show that t

Стилі APA, Harvard, Vancouver, ISO та ін.

18

Luo, You Xin. "The Novel Compound Evolutionary Optimization Algorithm with Hybrid Discrete Variables and its Application to Mechanical Optimization." Advanced Materials Research 97-101 (March 2010): 3276–80. http://dx.doi.org/10.4028/www.scientific.net/amr.97-101.3276.

Повний текст джерела

Анотація:

To overcome the problem of low convergence speed and sensitivity to local convergence with the traditional Artificial Fish-swarm Algorithm (AFSA) to handle complex functions, a novel compound evolutionary algorithm, called AFS-EMPCEOA, was introduced which is combined Artificial Fish-swarm Algorithm with the Elite Multi-parent Crossover Evolutionary Optimization Algorithm (EMPCEOA) that is GuoTao Algorithm improved by elite multi-parent crossover method. AFSEMPCEOA algorithm program with hybrid discrete variables was also developed. The computing example of mechanical optimization design shows

Стилі APA, Harvard, Vancouver, ISO та ін.

19

Bakhtin, Vladimir Aleksandrovich, Dmitry Aleksandrovich Zakharov, Andrey Nikolaevich Kozlov, and Veniamin Sergeevich Konovalov. "The Using of DVM-System for Developing of a Program for Calculations of the Problem of Radiation Magnetic Gas Dynamics and Research of Plasma Dynamics in the QSPA Channel." Russian Digital Libraries Journal 23, no. 4 (2020): 594–614. http://dx.doi.org/10.26907/1562-5419-2020-23-4-594-614.

Повний текст джерела

Анотація:

DVM-system is designed for the development of parallel programs of scientific and technical calculations in the C-DVMH and Fortran-DVMH languages. These languages use a single DVMH-model of parallel programming model and are an extension of the standard C and Fortran languages with parallelism specifications in the form of compiler directives. The DVMH model makes it possible to create efficient parallel programs for heterogeneous computing clusters, in the nodes of which accelerators, graphic processors or Intel Xeon Phi coprocessors can be used as computing devices along with universal multi

Стилі APA, Harvard, Vancouver, ISO та ін.

20

Sukhachev, K. I., K. E. Voronov, A. S. Dorofeev, D. A. Shestakov, and A. A. Artyushin. "DEVELOPMENT OF A HIGH-PERFORMANCE COMPUTING SYSTEM BASED ON AN IP-CORE FOR SPACE SCIENTIFIC EQUIPMENT." NAUCHNOE PRIBOROSTROENIE 32, no. 4 (2022): 88–106. http://dx.doi.org/10.18358/np-32-4-i88106.

Повний текст джерела

Анотація:

The article presents the result of the development and implementation of a universal synthesized processor core based on integrated FPGA circuits of domestic and foreign production. The possibility of creating a high-performance computing system based on a FPGA is shown. The description of the structure of the system, the main processor core and associated modules, is described. The system of processor commands is presented. The process of developing a program for a synthesized controller and a variant of implementing a control system based on the developed controller are presented.

Стилі APA, Harvard, Vancouver, ISO та ін.

21

YANG, TAO, and LEON O. CHUA. "IMPLEMENTING BACK-PROPAGATION- THROUGH-TIME LEARNING ALGORITHM USING CELLULAR NEURAL NETWORKS." International Journal of Bifurcation and Chaos 09, no. 06 (1999): 1041–74. http://dx.doi.org/10.1142/s0218127499000730.

Повний текст джерела

Анотація:

In a programmable (multistage) cellular neural network (CNN) structure, the CPU is a CNN universal chip which supports massively parallel computations on patterns and images, including videos. In this paper, we decompose the structure of a class of simultaneous recurrent networks (SRN) into a CNN program and run it on a von Neumann-like stored program CNN structure. To train the SRN, we map the back-propagation-through-time (BTT) learning algorithm into a sequence of CNN subroutines to achieve real-time performance via a CNN universal chip. By computing in parallel, the CNN universal chip can

Стилі APA, Harvard, Vancouver, ISO та ін.

22

Ben, Nengjun, Sergiy Ryzhkov, Andriy Topalov, et al. "A Methodology and Information System for Computing and Optimization of Impellers and Vanned Diffusers Geometry Parameters." Applied Computer Systems 27, no. 1 (2022): 62–74. http://dx.doi.org/10.2478/acss-2022-0007.

Повний текст джерела

Анотація:

Abstract The study aims to develop an information-computing complex for computer design of a centrifugal compressor with parallel calculation of stages and optimization of the geometric parameters of the impellers and the diffusers. The paper presents a universal methodology and computerized information system of the main geometry parameter determination and optimization of the centrifugal compressor impellers and vanned diffusers. Optimization of cross-sectional areas of the input and output channels of the impeller and diffuser blade channels is held using a gradient descent method by gas fl

Стилі APA, Harvard, Vancouver, ISO та ін.

23

Randone, Francesca, Luca Bortolussi, Emilio Incerto, and Mirco Tribastone. "Inference of Probabilistic Programs with Moment-Matching Gaussian Mixtures." Proceedings of the ACM on Programming Languages 8, POPL (2024): 1882–912. http://dx.doi.org/10.1145/3632905.

Повний текст джерела

Анотація:

Computing the posterior distribution of a probabilistic program is a hard task for which no one-fit-for-all solution exists. We propose Gaussian Semantics, which approximates the exact probabilistic semantics of a bounded program by means of Gaussian mixtures. It is parametrized by a map that associates each program location with the moment order to be matched in the approximation. We provide two main contributions. The first is a universal approximation theorem stating that, under mild conditions, Gaussian Semantics can approximate the exact semantics arbitrarily closely. The second is an app

Стилі APA, Harvard, Vancouver, ISO та ін.

24

Alexander, S. Ryzhkov. "INNOVATIVE PROJECT MANAGEMENT METHODOLOGY FOR GLOBAL EDUCATIONAL MARKET." International Journal of Research - Granthaalayah 5, no. 9 (2017): 171–85. https://doi.org/10.5281/zenodo.1002166.

Повний текст джерела

Анотація:

Innovative project management methodology for the provision of educational services to the foreign customer was developed. In this methodology is applied the general calculation of a quantitative assessment of the quality of teaching. To significantly reduce the time for calculations, the universal computing program has been created, which allows to process extensive data blocks with the visualization of the results in the two-dimensional coordinate system. This methodology was implemented to working process of Admiral Makarov National University of Shipbuilding. The results made it possible t

Стилі APA, Harvard, Vancouver, ISO та ін.

25

Hubeny, Ivan. "Basic Tools for Modeling Stellar and Planetary Atmospheres." Proceedings of the International Astronomical Union 7, S282 (2011): 221–28. http://dx.doi.org/10.1017/s1743921311027414.

Повний текст джерела

Анотація:

AbstractMost popular computer codes for calculating model stellar and planetary atmospheres are briefly reviewed. A particular emphasis is devoted to our universal computer program Tlusty (model stellar atmospheres and accretion disks), CoolTlusty (a variant of Tlusty for computing model atmospheres of substellar-mass objects such as giant planets and brown dwarfs), and Synspec (an associated spectrum synthesis code). We show the highlights of actual applications of these codes which include extensive grids of fully line-blanketed non-LTE model atmospheres of O and B stars, and grids of model

Стилі APA, Harvard, Vancouver, ISO та ін.

26

Alexander, S. Ryzhkov. "QUANTITATIVE CALCULATION OF THE QUALITY OF TEACHING AS A PROJECT MANAGEMENT FACTOR OF THE INTERNATIONAL CONTRACT." International Journal of Research - Granthaalayah 5, no. 11 (2017): 126–38. https://doi.org/10.5281/zenodo.1069389.

Повний текст джерела

Анотація:

One of the most problematic places in the implementation of international contracts is inefficient project management. The choice of inappropriate methodology for managing the educational project, irrational allocation of resources, untimely monitoring quality of the provided services can lead not only to the loss of an existing contract, but also to the reduction of the university's reputation in the international arena in conditions of competitive struggle in the educational services market. In turn, this minimizes the probability of concluding of new contracts. An innovative methodology

Стилі APA, Harvard, Vancouver, ISO та ін.

27

Kochigina, A. M., and P. A. Kornilov. "Educational software environment for the study of abstract Turing and Post computing machines." Informatics in school, no. 6 (December 26, 2023): 31–40. http://dx.doi.org/10.32517/2221-1993-2023-22-6-31-40.

Повний текст джерела

Анотація:

The Federal Work Program of Secondary General Education in Informatics at an in-depth level involves familiarization of schoolchildren with Turing and Post machines as universal models of computing. The use of Turing and Post machines interpreters in the educational process makes it possible to overcome the difficulties associated with learning based on abstract logical thinking. The article describes the possibilities of the educational software environment developed by the authors, which contains three sections for each computer. In the "Theory" section, students can get acquainted with the

Стилі APA, Harvard, Vancouver, ISO та ін.

28

Ryzhkov, Alexander S. "INNOVATIVE PROJECT MANAGEMENT METHODOLOGY FOR GLOBAL EDUCATIONAL MARKET." International Journal of Research -GRANTHAALAYAH 5, no. 9 (2017): 171–85. http://dx.doi.org/10.29121/granthaalayah.v5.i9.2017.2227.

Повний текст джерела

Анотація:

Innovative project management methodology for the provision of educational services to the foreign customer was developed. In this methodology is applied the general calculation of a quantitative assessment of the quality of teaching. To significantly reduce the time for calculations, the universal computing program has been created, which allows to process extensive data blocks with the visualization of the results in the two-dimensional coordinate system. This methodology was implemented to working process of Admiral Makarov National University of Shipbuilding. The results made it possible t

Стилі APA, Harvard, Vancouver, ISO та ін.

29

Xiao, Wei Yue, Yue Hua Cai, and You Xin Luo. "Evolutionary Cellular Automata Algorithm with Hybrid Discrete Variables and its Application to Mechanical Optimization." Applied Mechanics and Materials 271-272 (December 2012): 912–16. http://dx.doi.org/10.4028/www.scientific.net/amm.271-272.912.

Повний текст джерела

Анотація:

The optimization design about hybrid discrete variables synthesizing integer, discrete and continuous variables is very significant but also difficult in engineering, mathematics for programming and operational research. Aimed at shortages of existing optimum methods, in this paper, Evolutionary Cellar Automata Algorithm (ECAA) is proposed to complex optimization problem with hybrid discrete variables which has a digging operator and two learning operators (dual arithmetic crossover operator and chaos-peak-jumping operator). The computing examples of mechanical optimization design show that th

Стилі APA, Harvard, Vancouver, ISO та ін.

30

Gorognaya, Lidia. "On Functional Programming." Computer tools in education, no. 3 (August 20, 2021): 57–75. http://dx.doi.org/10.32603/2071-2340-2021-3-57-75.

Повний текст джерела

Анотація:

The article is devoted to the description of the features of functional programming, considered as a methodology for solving new and research problems of applied and system programming. The technique of analysis and comparison of programming paradigms is involved, taking into account the priorities of decision-making in the process of developing programs. The methodology for comparing languages and programming paradigms is based on an informal definition of the term “programming paradigm”, according to which, when comparing paradigms, it is necessary to highlight the distinctive testable featu

Стилі APA, Harvard, Vancouver, ISO та ін.

31

Ivancova, Olga, Vladimir Korenkov, Olga Tyatyushkina, Sergey Ulyanov, and Toshio Fukuda. "Quantum supremacy in end-to-end intelligent IT. Pt. I:Quantum software engineering–quantum gate level applied models simulators." System Analysis in Science and Education, no. 1 (2020) (2020): 52–84. http://dx.doi.org/10.37005/2071-9612-2020-1-52-84.

Повний текст джерела

Анотація:

Principles and methodologies of quantum algorithmic gates design for master course and PhD students in computer science, control engineering and intelligent robotics described. The possibilities of quantum algorithmic gates simulation on classical computers discussed. Applications of quantum gate of nanotechnology in intelligent quantum control introduced. Anew approach to a circuit implementation design of quantum algorithm gates for fast quantum massive parallel computing presented. The main attention focused on the development of design method of fast quantum algorithm operators as superpos

Стилі APA, Harvard, Vancouver, ISO та ін.

32

Smolensky, Paul. "Symbolic functions from neural computation." Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 370, no. 1971 (2012): 3543–69. http://dx.doi.org/10.1098/rsta.2011.0334.

Повний текст джерела

Анотація:

Is thought computation over ideas? Turing, and many cognitive scientists since, have assumed so, and formulated computational systems in which meaningful concepts are encoded by symbols which are the objects of computation. Cognition has been carved into parts, each a function defined over such symbols. This paper reports on a research program aimed at computing these symbolic functions without computing over the symbols. Symbols are encoded as patterns of numerical activation over multiple abstract neurons, each neuron simultaneously contributing to the encoding of multiple symbols. Computati

Стилі APA, Harvard, Vancouver, ISO та ін.

33

Shapiro, Ehud. "A mechanical Turing machine: blueprint for a biomolecular computer." Interface Focus 2, no. 4 (2012): 497–503. http://dx.doi.org/10.1098/rsfs.2011.0118.

Повний текст джерела

Анотація:

We describe a working mechanical device that embodies the theoretical computing machine of Alan Turing, and as such is a universal programmable computer. The device operates on three-dimensional building blocks by applying mechanical analogues of polymer elongation, cleavage and ligation, movement along a polymer, and control by molecular recognition unleashing allosteric conformational changes. Logically, the device is not more complicated than biomolecular machines of the living cell, and all its operations are part of the standard repertoire of these machines; hence, a biomolecular embodime

Стилі APA, Harvard, Vancouver, ISO та ін.

34

Defienne, Hugo, Marco Barbieri, Ian A. Walmsley, Brian J. Smith, and Sylvain Gigan. "Two-photon quantum walk in a multimode fiber." Science Advances 2, no. 1 (2016): e1501054. http://dx.doi.org/10.1126/sciadv.1501054.

Повний текст джерела

Анотація:

Multiphoton propagation in connected structures—a quantum walk—offers the potential of simulating complex physical systems and provides a route to universal quantum computation. Increasing the complexity of quantum photonic networks where the walk occurs is essential for many applications. We implement a quantum walk of indistinguishable photon pairs in a multimode fiber supporting 380 modes. Using wavefront shaping, we control the propagation of the two-photon state through the fiber in which all modes are coupled. Excitation of arbitrary output modes of the system is realized by controlling

Стилі APA, Harvard, Vancouver, ISO та ін.

35

Maksymiuk, Yurii, Viktor Andriievskyi, Ivan Martyniuk, and Oleksandr Maksymiuk. "Analysis of structures with arbitrary kinematic boundary conditions by the semi-analytical finite element method." Strength of Materials and Theory of Structures, no. 111 (November 24, 2023): 140–46. http://dx.doi.org/10.32347/2410-2547.2023.111.140-146.

Повний текст джерела

Анотація:

The successful application of FEM to the analysis of structures is largely due to the efficiency of the use of modern software packages, in connection with which the role of program systems that implement the solution process increases. The correct organization of the computing complex, the choice of optimal algorithms for solving systems of linear and nonlinear equations largely determine the possibilities of the method in terms of the structural complexity of the objects under consideration, the accuracy of the results obtained, and the complexity of setting nonlinear problems. Therefore, th

Стилі APA, Harvard, Vancouver, ISO та ін.

36

Prots’ko, I., and O. Gryshchuk. "THE MODULAR EXPONENTIATION WITH PRECOMPUTATION OF REDUSED SET OF RESIDUES FOR FIXED-BASE." Radio Electronics, Computer Science, Control, no. 1 (April 4, 2022): 58. http://dx.doi.org/10.15588/1607-3274-2022-1-7.

Повний текст джерела

Анотація:

Context. Modular exponentiation is an important operation in many applications that requires a large number of calculations Fast computations of the modular exponentiation are extremely necessary for efficient computations in theoretical-numerical transforms, for provide high crypto capability of information data and in many other applications. Objective – the runtime analysis of software functions for computation of modular exponentiation of the developed program that uses the precomputation of redused set of residuals for fixed-base. Method. Modular exponentiation is implemented using of the

Стилі APA, Harvard, Vancouver, ISO та ін.

37

Ciurys, Marek, and Ignacy Dudzikowski. "Transients of electrical and mechanical quantities of a brushless DC motor - computations, measurements." Archives of Electrical Engineering 60, no. 1 (2011): 23–34. http://dx.doi.org/10.2478/v10171-011-0003-x.

Повний текст джерела

Анотація:

Transients of electrical and mechanical quantities of a brushless DC motor - computations, measurements The paper presents a method of computing electrical and mechanical variables of BLDC motors. It takes into account electrical, magnetic and mechanical phenomena in the power supply-converter-BLDC motor-load machine system. The solution to the problem is the so-called circuit-field method. The results determined with the use of time stepping finite element method were used as the parameters of equations of the developed mathematical model. Losses in the motor, losses in transistors and diodes

Стилі APA, Harvard, Vancouver, ISO та ін.

38

Hnitko, Vasyl. "RESEARCH OF STRESS-STRAIN STATE OF ORE GRINDING MILLS." Bulletin of the National Technical University «KhPI» Series: Engineering and CAD, no. 1 (December 28, 2024): 26–34. https://doi.org/10.20998/2079-0775.2024.1.04.

Повний текст джерела

Анотація:

Over the past decades, computing complexes based on finite element methods, such as "MARS," "Lira," "ASKA," "ADINA," "COSMOS," "ANSYS," etc., have been developed and are now successfully operational. However, alongside the development of powerful universal computing packages for various applications, there is a growing trend towards specialized complexes tailored to solve specific practical problems. This trend is driven by the advancement of automation systems for designing both typical structures and computer codes. In this paper, we address the problem of determining displacements and stres

Стилі APA, Harvard, Vancouver, ISO та ін.

39

Perumal, Sundresan. "Escalation of Security and Privacy in Internet of Things using Advanced IPv6 Based Security Mechanism." Wasit Journal of Computer and Mathematics Science 1, no. 1 (2021): 43–51. http://dx.doi.org/10.31185/wjcm.vol1.iss1.7.

Повний текст джерела

Анотація:

Kevin Ashton coined the phrase Internet of Things in 1999 with high performance implementation for corporate and social world. Thanks to the success of high-performing Internet of Things (IoT) whereby the tags and sensors are the foundation for IoT implementation of radio frequency identification with enormous implementation patterns. Real world objects and systems that are remotely managed using program- based tools may be outfitted with RFID tags. Radio frequency recognition devices may identify objects and sense information. Very thin micro-sized RFID chips that can attach remotely are buil

Стилі APA, Harvard, Vancouver, ISO та ін.

40

Borodin, E. A., A. P. Chupalov, P. D. Timkin, E. A. Timofeev, and N. Yu Leusova. "Selection of potential ligands for TRPM8 using deep neural networks and intermolecular docking." Bulletin Physiology and Pathology of Respiration, no. 80 (July 16, 2021): 26–33. http://dx.doi.org/10.36604/1998-5029-2021-80-26-33.

Повний текст джерела

Анотація:

Introduction. TRPM8 has been implicated in the development of bronchial hypersensitivity to cold and is considered a potential target for computer-generated drugs.Aim. Development of a strategy for the selection of ligands for TRPM8 by in silico methods.Materials and methods. Using machine learning tools based on deep neural networks and further verification by intermolecular docking, a strategy has been proposed for predicting potential ligands for TRPM8, which consists in using a neural network to screen out potential drug candidates and thereby reduce the list of candidate ligands for verif

Стилі APA, Harvard, Vancouver, ISO та ін.

41

Maley, Carlo C. "DNA Computation: Theory, Practice, and Prospects." Evolutionary Computation 6, no. 3 (1998): 201–29. http://dx.doi.org/10.1162/evco.1998.6.3.201.

Повний текст джерела

Анотація:

L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also identified three broad categories of open questions for the field. First, is DNA capable of universal computation? Second, what kinds of algorithms can DNA implement? Third, can the error rates in the manipulations of the DNA be controlled enough to allow for useful computation? In the two years that have followed, theoretical work has shown that DNA is in fact capable of universal computation. Furthermore, algorithms

Стилі APA, Harvard, Vancouver, ISO та ін.

42

Karamysheva, N. S., D. S. Svishchev, K. V. Popov, and S. A. Zinkin. "Implementation of Agent-Based Metacomputersystems and Applications." Proceedings of the Southwest State University 26, no. 1 (2022): 148–71. http://dx.doi.org/10.21869/2223-1560-2022-26-1-148-171.

Повний текст джерела

Анотація:

Purpose of research. Creation of a methodology for designing a prototype of a metacomputer distributed computing system, taking into account the current stage of the evolution of hardware and cloud-network software to provide users with the means to create applications with inter-program parallelism and the ability of components to work together.Methods. Logical models of artificial intelligence, semantic networks and conceptual graphs, agent-based technology, virtualization of network resources. The method of conducting a full-scale experiment was that when the application was launched for ex

Стилі APA, Harvard, Vancouver, ISO та ін.

43

Korytin, N. O., and S. V. Pridvizhkin. "METHODS FOR CREATING MODULES FOR DESIGN AUTOMATION SOFTWARE." SOFT MEASUREMENTS AND COMPUTING 6/1, no. 55 (2022): 66–74. http://dx.doi.org/10.36871/2618-9976.2022.06.007.

Повний текст джерела

Анотація:

In the modern world, humanity needs to increase the power of its computing resources for further development. However, unfortunately, over the past few decades, the human brain has been much inferior in this aspect to electronic computers (computers), giving them primacy. The computer is able to significantly reduce the time spent on any computing tasks performing, as well as repeatedly improve the quality and repeatability of the result. Therefore, computers have become an integral part of the life of each of us. Human programming, in turn, has become the main tool for creating more effective

Стилі APA, Harvard, Vancouver, ISO та ін.

44

Singh, Bijendra, and D. Guptasarma. "New method for fast computation of gravity and magnetic anomalies from arbitrary polyhedra." GEOPHYSICS 66, no. 2 (2001): 521–26. http://dx.doi.org/10.1190/1.1444942.

Повний текст джерела

Анотація:

We show that at any point the gravity field from a solid body bounded by plane surfaces and having uniform density can be computed as a field from a fictitious distribution of surface mass‐density on the same body. The surface mass density at every surface element is equal to the product of the volume density of the body and the scalar product of (1) the unit outward vector normal to that surface element and (2) the position vector of the surface element with respect to the point of observation. Accordingly, the contribution to the gravity field from any plane surface of the body vanishes if t

Стилі APA, Harvard, Vancouver, ISO та ін.

45

M., M. Biliaiev, I. Rusakova T., V. Kalashnikov I., O. Bondarenko I., and Y. Gunko E. "NUMERICAL MODELING OF AIR POLLUTION FROM DUMPS." Science and Transport Progress. Bulletin of Dnipropetrovsk National University of Railway Transport, no. 4(82) (September 23, 2019): 7–17. https://doi.org/10.15802/stp2019/178855.

Повний текст джерела

Анотація:

<strong>Purpose.</strong> Rock dumps are long-term sources of air pollution. A significant amount of harmful substances enters the atmosphere. Particularly intense is the pollution of atmospheric air due to dusting dumps. An important task is the development of methods for predicting the dynamics of atmospheric air pollution during the emission of harmful impurities from dumps. When developing methods for predicting the dynamics of air pollution from dumps. It is very important to create a universal model that would allow on a single computing platform to calculate the process of atmosphe

Стилі APA, Harvard, Vancouver, ISO та ін.

46

Tyurin, S. F., A. Yu Skornyakova, Y. A. Stepchenkov, and Y. G. Diachenko. "SELF-TIMED LOOK UP TABLE FOR ULAs AND FPGAs." Radio Electronics, Computer Science, Control 1, no. 1 (2021): 36–45. http://dx.doi.org/10.15588/1607-3274-2021-1-4.

Повний текст джерела

Анотація:

Context. Self-Timed Circuits, proposed by D. Muller on the rise of the digital era, continues to excite researchers’ minds. These circuits started with the task of improving performance by taking into account real delays. Then Self-Timed Circuits have moved into the field of green computing. At last, they are currently positioned mainly in the field of fault tolerance. There is much redundancy in Self-Timed Circuits. It is believed that Self-Timed Circuits approaches will be in demand in the nano-circuitry when a synchronous approach becomes impossible. Strictly Self-Timed Circuits check trans

Стилі APA, Harvard, Vancouver, ISO та ін.

47

Bakhtin, Vladimir Aleksandrovich, Dmitry Aleksandrovich Zakharov, Aleksandr Aleksandrovich Ermichev, and Victor Alekseevich Krukov. "Debugging Parallel Programs in DVM-System." Russian Digital Libraries Journal 23, no. 4 (2020): 866–86. http://dx.doi.org/10.26907/1562-5419-2020-23-4-866-886.

Повний текст джерела

Анотація:

DVM-system is designed for the development of parallel programs of scientific and technical calculations in the C-DVMH and Fortran-DVMH languages. These languages use a single DVMH-model of parallel programming model and are an extension of the standard C and Fortran languages with parallelism specifications in the form of compiler directives. The DVMH model makes it possible to create efficient parallel programs for heterogeneous computing clusters, in the nodes of which accelerators, graphic processors or Intel Xeon Phi coprocessors can be used as computing devices along with universal multi

Стилі APA, Harvard, Vancouver, ISO та ін.

48

STOLBOUSHKIN, ALEXEI P. "ON THE COMPUTING POWER OF PROGRAMS WITH SETS." International Journal of Foundations of Computer Science 03, no. 02 (1992): 161–80. http://dx.doi.org/10.1142/s0129054192000115.

Повний текст джерела

Анотація:

The class FDSet of while-programs equipped with finite sets as internal data type is considered in the context of generalized computability over abstract first order structures. This class is proved to be semi-universal, i.e. to be able to compute every computable function in every infinite finitely-generated structure. However, for this class the halting problem on finite structures is decidable within LinearSpace complexity (on the cardinality of structure), and it is proved that the dynamic logic of the class FDSet describes exactly the class LinearSpace computable global predicates on the

Стилі APA, Harvard, Vancouver, ISO та ін.

49

Chua, Leon O. "CNN: A Vision of Complexity." International Journal of Bifurcation and Chaos 07, no. 10 (1997): 2219–425. http://dx.doi.org/10.1142/s0218127497001618.

Повний текст джерела

Анотація:

CNN is an acronym for either Cellular Neural Network when used in the context of brain science, or Cellular Nonlinear Network when used in the context of coupled dynamical systems. A CNN is defined by two mathematical constructs: 1. A spatially discrete collection of continuous nonlinear dynamical systems called cells, where information can be encrypted into each cell via three independent variables called input, threshold, and initial state. 2. A coupling law relating one or more relevant variables of each cell Cij to all neighbor cells Ckl located within a prescribed sphere of influence Sij(

Стилі APA, Harvard, Vancouver, ISO та ін.

50

Aleksahin, Valery Fedorovich, Vladimir Aleksandrovich Bakhtin, Olga Fedorovna Zhukova, et al. "Progress in Dvm-System." Russian Digital Libraries Journal 23, no. 3 (2020): 247–70. http://dx.doi.org/10.26907/1562-5419-2020-23-3-247-270.

Повний текст джерела

Анотація:

DVM-system is designed for the development of parallel programs of scientific and technical calculations in the C-DVMH and Fortran-DVMH languages. These languages use a single DVMH-model of parallel programming model and are an extension of the standard C and Fortran languages with parallelism specifications in the form of compiler directives. The DVMH model makes it possible to create efficient parallel programs for heterogeneous computing clusters, in the nodes of which accelerators, graphic processors or Intel Xeon Phi coprocessors can be used as computing devices along with universal multi

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!