Увійти

Готові списки джерел за темами / Finite State Theory / Статті в журналах

Статті в журналах з теми "Finite State Theory"

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

Автор: Grafiati

Опубліковано: 6 вересня 2023

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

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

Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Finite State Theory".

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

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

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

1

Zadeh, L. A. "Stochastic finite-state systems in control theory." Information Sciences 251 (December 2013): 1–9. http://dx.doi.org/10.1016/j.ins.2013.06.039.

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

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

2

CALUDE, CRISTIAN S., KAI SALOMAA, and TANIA K. ROBLOT. "STATE-SIZE HIERARCHY FOR FINITE-STATE COMPLEXITY." International Journal of Foundations of Computer Science 23, no. 01 (January 2012): 37–50. http://dx.doi.org/10.1142/s0129054112400035.

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

Анотація:

Finite-state complexity is a variant of algorithmic information theory obtained by replacing Turing machines with finite transducers. We consider the number of states needed for transducers used in minimal descriptions of arbitrary strings and, as our main result, show that the state-size hierarchy with respect to a standard encoding is infinite. We consider corresponding hierarchies yielded by more general computable encodings and establish that for a suitably chosen computable encoding every level of the state-size hierarchy can be strict.

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

3

Ahmad, I., and M. K. Dhodhi. "State assignment of finite-state machines." IEE Proceedings - Computers and Digital Techniques 147, no. 1 (2000): 15. http://dx.doi.org/10.1049/ip-cdt:20000163.

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

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

4

Krishnamoorthy, M. S., James R. Loy, and John F. McDonald. "Optimal Differential Routing based on Finite State Machine Theory." VLSI Design 9, no. 2 (January 1, 1999): 105–17. http://dx.doi.org/10.1155/1999/83648.

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

Анотація:

Noise margins in high speed digital systems continue to erode. Full differential signal routing provides a mechanism for deferring these effects. This paper proposes a three stage routing process for solving the adjacent placement routing problem of differential signal pairs, and proves that it is optimal. The process views differential pairs as logical nets; routes the logical nets; then bifurcates the result to achieve a physical realization. Finite state machine theory provides the critical theoretical underpinning and formal proof of correctness necessary for linear time bifurcation. Regular expressions map the theoretical solution to an appropriate implementation strategy that employs feature vectors for net recognition.

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

5

Giammarresi, Dora, and Antonio Restivo. "TWO-DIMENSIONAL FINITE STATE RECOGNIZABILITY." Fundamenta Informaticae 25, no. 3,4 (1996): 399–422. http://dx.doi.org/10.3233/fi-1996-253411.

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

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

6

Jeanloz, Raymond. "Shock wave equation of state and finite strain theory." Journal of Geophysical Research 94, B5 (1989): 5873. http://dx.doi.org/10.1029/jb094ib05p05873.

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

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

7

Stefanucci, G., and S. Kurth. "Steady-State Density Functional Theory for Finite Bias Conductances." Nano Letters 15, no. 12 (November 20, 2015): 8020–25. http://dx.doi.org/10.1021/acs.nanolett.5b03294.

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

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

8

Hao, Yiding. "Finite-state Optimality Theory: non-rationality of Harmonic Serialism." Journal of Language Modelling 7, no. 2 (September 16, 2019): 49. http://dx.doi.org/10.15398/jlm.v7i2.210.

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

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

9

Juba, Brendan. "On learning finite-state quantum sources." Quantum Information and Computation 12, no. 1&2 (January 2012): 105–18. http://dx.doi.org/10.26421/qic12.1-2-7.

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

Анотація:

We examine the complexity of learning the distributions produced by finite-state quantum sources. We show how prior techniques for learning hidden Markov models can be adapted to the {\em quantum generator} model to find that the analogous state of affairs holds: information-theoretically, a polynomial number of samples suffice to approximately identify the distribution, but computationally, the problem is as hard as learning parities with noise, a notorious open question in computational learning theory.

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

10

Singh, S. P., Jagjivan Ram, Yogendra Kumar, Amar Kumar, and Alok Sagar Gautam. "A New Formulation of Generalized Equation of State (GEOS) based on Finite Strain Theory and Comparison with other Equations of State (EOSs)." Indian Journal Of Science And Technology 16, no. 12 (March 27, 2023): 862–71. http://dx.doi.org/10.17485/ijst/v16i12.2507.

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

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

11

Birget, Jean-Camille. "State-complexity of finite-state devices, state compressibility and incompressibility." Mathematical Systems Theory 26, no. 3 (September 1993): 237–69. http://dx.doi.org/10.1007/bf01371727.

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

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

12

Yue, Jumei, Yongyi Yan, Zengqiang Chen, and He Deng. "State space optimization of finite state machines from the viewpoint of control theory." Frontiers of Information Technology & Electronic Engineering 22, no. 12 (October 23, 2021): 1598–609. http://dx.doi.org/10.1631/fitee.2000608.

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

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

13

Podlovchenko, R. I. "Finite state automata in the theory of algebraic program schemata." Proceedings of the Institute for System Programming of the RAS 27, no. 2 (2015): 161–72. http://dx.doi.org/10.15514/ispras-2015-27(2)-10.

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

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

14

Cohen, Samuel N., and Robert J. Elliott. "A general theory of finite state Backward Stochastic Difference Equations." Stochastic Processes and their Applications 120, no. 4 (April 2010): 442–66. http://dx.doi.org/10.1016/j.spa.2010.01.004.

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

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

15

Hayashi, Masahito. "Asymptotic estimation theory for a finite-dimensional pure state model." Journal of Physics A: Mathematical and General 31, no. 20 (May 22, 1998): 4633–55. http://dx.doi.org/10.1088/0305-4470/31/20/006.

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

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

16

Hayashi, M. "Asymptotic estimation theory for a finite-dimensional pure state model." Journal of Physics A: Mathematical and General 31, no. 41 (October 16, 1998): 8405. http://dx.doi.org/10.1088/0305-4470/31/41/015.

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

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

17

Oliynyk, A. S. "Finite state wreath powers of transformation semigroups." Semigroup Forum 82, no. 3 (January 14, 2011): 423–36. http://dx.doi.org/10.1007/s00233-011-9292-z.

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

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

18

Lucas, Simon M., and T. Jeff Reynolds. "Learning Finite-State Transducers: Evolution Versus Heuristic State Merging." IEEE Transactions on Evolutionary Computation 11, no. 3 (June 2007): 308–25. http://dx.doi.org/10.1109/tevc.2006.880329.

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

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

19

Calude, Cristian S., Ludwig Staiger, and Frank Stephan. "Finite state incompressible infinite sequences." Information and Computation 247 (April 2016): 23–36. http://dx.doi.org/10.1016/j.ic.2015.11.003.

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

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

20

Nishiyama, Seiya. "Resonating Relativistic Mean Field Theory of Finite Nuclei." International Journal of Modern Physics E 07, no. 05 (October 1998): 601–24. http://dx.doi.org/10.1142/s0218301398000348.

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

Анотація:

We develop a general theory based on relativistic fields to describe finite nuclei with large quantum fluctuations. The theory is a direct extension of the resonating Hartree-Fock (HF) and resonating Hartree-Bogoliubov (HB) theories to the relativistic mean field case including an effective nucleon mass and an effective potential mediated by mesons. We start from the Walecka model and construct coherent state representations of a system of nucleons described by Dirac spinors and of mesons described in terms of bosons. A state with large quantum fluctuations is approximated by superpositions of non-orthogonal nucleon and meson wave functions with different correlation structures. We derive the variational equations to determine the two kinds of coefficients of fermionic and bosonic configuration mixings and the two kinds of fermionic and bosonic orbitals in the resonating nucleon and meson wave functions.

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

21

Chattopadhyay, S., and P. N. Reddy. "Finite state machine state assignment targeting low power consumption." IEE Proceedings - Computers and Digital Techniques 151, no. 1 (2004): 61. http://dx.doi.org/10.1049/ip-cdt:20030980.

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

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

22

Siems, Tobias. "Markov Chain Monte Carlo on finite state spaces." Mathematical Gazette 104, no. 560 (June 18, 2020): 281–87. http://dx.doi.org/10.1017/mag.2020.51.

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

Анотація:

We elaborate the idea behind Markov chain Monte Carlo (MCMC) methods in a mathematically coherent, yet simple and understandable way. To this end, we prove a pivotal convergence theorem for finite Markov chains and a minimal version of the Perron-Frobenius theorem. Subsequently, we briefly discuss two fundamental MCMC methods, the Gibbs and Metropolis-Hastings sampler. Only very basic knowledge about matrices, convergence of real sequences and probability theory is required.

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

23

Alfaro, Ricardo. "State spaces, finite algebras, and skew group rings." Journal of Algebra 139, no. 1 (May 1991): 134–54. http://dx.doi.org/10.1016/0021-8693(91)90286-h.

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

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

24

Rasskazov, A. O., A. G. Bondar', V. I. Kosenko, and I. I. Sokolovskaya. "Refining the stress state of multilayer shells using finite-shear theory." Soviet Applied Mechanics 23, no. 4 (April 1987): 332–35. http://dx.doi.org/10.1007/bf00887202.

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

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

25

Starinets, A. O., A. S. Vshivtsev, and V. Ch Zhukovskii. "Colour ferromagnetic state in SU (2) gauge theory at finite temperature." Physics Letters B 322, no. 4 (February 1994): 403–12. http://dx.doi.org/10.1016/0370-2693(94)91172-x.

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

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

26

MENEZES, DÉBORA P., and C. PROVIDÊNCIA. "FINITE TEMPERATURE EQUATIONS OF STATE FOR MIXED STARS." International Journal of Modern Physics D 13, no. 07 (August 2004): 1249–53. http://dx.doi.org/10.1142/s0218271804005389.

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

Анотація:

We investigate the properties of mixed stars formed by hadronic and quark matter in β-equilibrium described by appropriate equations of state (EOS) in the framework of relativistic mean-field theory. The calculations were performed for T=0 and for finite temperatures and also for fixed entropies with and without neutrino trapping in order to describe neutron and proto-neutron stars. The star properties are discussed. Maximum allowed masses for proto-neutron stars are much larger when neutrino trapping is imposed.

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

27

Hao, Yong-Sheng, Zhi-Gang Su, and Xiangyu Wang. "Finite-Time Output Feedback Control for a Rigid Hydraulic Manipulator System." Mathematical Problems in Engineering 2018 (July 10, 2018): 1–9. http://dx.doi.org/10.1155/2018/9316562.

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

Анотація:

The position tracking control problem of a hydraulic manipulator system is investigated. By utilizing homogeneity theory, a finite-time output feedback controller is designed. Firstly, a finite-time state feedback controller is developed based on homogeneity theory. Secondly, a nonlinear state observer is designed to estimate the manipulator’s velocity. A rigorous analysis process is presented to demonstrate the observer’s finite-time stability. Finally, the corresponding output feedback tracking controller is derived, which stabilizes the tracking error system in finite time. Simulations demonstrate the effectiveness of the designed finite-time output feedback controller.

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

28

XU, XUE-FEN, and HONG-YI FAN. "THERMO MINIMUM UNCERTAINTY STATE FOR FERMIONIC TFD THEORY." Modern Physics Letters A 22, no. 36 (November 30, 2007): 2757–62. http://dx.doi.org/10.1142/s0217732307022955.

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

Анотація:

By analyzing the characters of Thermo Field Dynamics (TFD) that every annihilation operator f acting on real Hilbert space has an image [Formula: see text] acting on fictitious space we should choose [Formula: see text] and [Formula: see text], or their linear combination [Formula: see text], and [Formula: see text] for measuring Fermi field's fluctuation at finite temperature. As a consequence, the corresponding minimum uncertainty states are derived, which resembles the form of fermionic squeezed state. This work is the fermionic counterpart of Ref. 8 in which bosonic TFD's minimum uncertainty states are obtained.

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

29

Lamont, Andrew. "Optimizing over subsequences generates context-sensitive languages." Transactions of the Association for Computational Linguistics 9 (2021): 528–37. http://dx.doi.org/10.1162/tacl_a_00382.

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

Анотація:

Abstract Phonological generalizations are finite-state. While Optimality Theory is a popular framework for modeling phonology, it is known to generate non-finite-state mappings and languages. This paper demonstrates that Optimality Theory is capable of generating non-context-free languages, contributing to the characterization of its generative capacity. This is achieved with minimal modification to the theory as it is standardly employed.

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

30

Liu, Weifeng, and Yudong Chi. "Resolvable Group State Estimation with Maneuver Based on Labeled RFS and Graph Theory." Sensors 19, no. 6 (March 15, 2019): 1307. http://dx.doi.org/10.3390/s19061307.

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

Анотація:

In this paper, multiple resolvable group target tracking was considered in the frame of random finite sets. In particular, a group target model was introduced by combining graph theory with the labeled random finite sets (RFS). This accounted for dependence between group members. Simulations were presented to verify the proposed algorithm.

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

31

Gao, Rui, Wen Song Hu, and Cheng Qiu Zhang. "Modeling and Analysis of Metabolism Process with Finite State Machine." Advanced Materials Research 424-425 (January 2012): 250–54. http://dx.doi.org/10.4028/www.scientific.net/amr.424-425.250.

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

Анотація:

This paper extends our early study on discrete events system formulations of DNA hybridization, and focuses discussions on metabolism and gene mutation in Molecular Biology. Finite state machine (FSM) theory is extensively applied to represent key concepts and analyze the processes related to the biological phenomena mentioned above. The goal is to mathematically represent and interpret the process of metabolism and the effects to structures of protein macro molecule caused by gene mutation. We hope the proposed model will provide a foothold for introducing the information science and the control theory tools in Molecular Biology

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

32

Fadiloglu, Mehmet Murat, and Sencer Yeralan. "A general theory on spectral properties of state-homogeneous finite-state quasi-birth–death processes." European Journal of Operational Research 128, no. 2 (January 2001): 402–17. http://dx.doi.org/10.1016/s0377-2217(99)00367-7.

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

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

33

Doty, David, Jack H. Lutz, and Satyadev Nandakumar. "Finite-state dimension and real arithmetic." Information and Computation 205, no. 11 (November 2007): 1640–51. http://dx.doi.org/10.1016/j.ic.2007.05.003.

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

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

34

Winter, Sarah, and Martin Zimmermann. "Finite-state strategies in delay games." Information and Computation 272 (June 2020): 104500. http://dx.doi.org/10.1016/j.ic.2019.104500.

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

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

35

Almaini, A. E. A., J. F. Miller, P. Thomson, and S. Billina. "State assignment of finite state machines using a genetic algorithm." IEE Proceedings - Computers and Digital Techniques 142, no. 4 (1995): 279. http://dx.doi.org/10.1049/ip-cdt:19951885.

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

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

36

Suharsih, Ririn, and Firas Atqiya. "Penerapan Konsep Finite State Automata (FSA) pada Aplikasi Simulasi Vending Machine Yoghurt Walagri." Edsence: Jurnal Pendidikan Multimedia 1, no. 2 (December 13, 2019): 71–78. http://dx.doi.org/10.17509/edsence.v1i2.21778.

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

Анотація:

Language theory and automata is a theory that related to abstract machines which in there is Finite State Automata. FSA can be implemented in design of a vending machine. Vending machines in Indonesia operate mostly with products such as canned drinks, plastic bottles, coffee, snacks, and tickets. This research discuss about simulating application design of Walagri Yoghurt vending machine, a yoghurt produced by Biotechnology Departement at the University of Muhammadiyah Bandung, based on the implementation of Finite State Automata. The conclusion obtained in this study is that Finite State Automata can be used as a basic logic for making vending machine simulations.

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

37

Álvarez, Nicolás, Verónica Becher, and Olivier Carton. "Finite-state independence and normal sequences." Journal of Computer and System Sciences 103 (August 2019): 1–17. http://dx.doi.org/10.1016/j.jcss.2019.02.001.

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

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

38

Yannakakis, M., and D. Lee. "Testing Finite State Machines: Fault Detection." Journal of Computer and System Sciences 50, no. 2 (April 1995): 209–27. http://dx.doi.org/10.1006/jcss.1995.1019.

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

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

39

Saputra, Fajar Ananda, F. Ti Ayyu Sayyidul Laily, Dimas Prasetyo Buseri, Imro’aturrozaniyah Imro’aturrozaniyah, and Kartika Candra Kirana. "“M-Auto” The Augmented Reality-Based (AR) Learning Media Application for the Finite-State Automata (FA) Reduction Subject of Language and Automata Theory Courses." Journal of Disruptive Learning Innovation (JODLI) 1, no. 2 (May 30, 2020): 45. http://dx.doi.org/10.17977/um072v1i22020p45-58.

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

Анотація:

AbstractA proper learning process should contain innovative, amusing, challenging, and motivating aspects. It should be able to provide an opportunity for the students to develop their creativity and independence based on their interests and talent. Less interesting and tedious classroom learning activity indicates the factor of the students’ learning interest degradation, for example as in the language and automata theory and finite-state automata reduction subject. The current research aims to aid language and automata theory in a learning activity to be easier to acquire. With the Augmented Reality-based learning media, the researcher hopes that the students can develop their understanding and their interest in a learning activity, especially for finite-state automata subjects. The subject of the current research is the Augmented Reality-based application as the learning media for language and automata theory and finite-state automata material. The researcher employs several research methodologies such as literature review, library research, and questionnaire to support the current research. The application is designed according to system development that consists of problem identification, appropriateness study, need analysis, concept designing, content designing, script designing, graphic designing, system production, and system examination. The result of the current research is the AR-based learning media application for the finite-state automata reduction subject of language and automata theory. Keywords: Learning Media, Finite-State Automata Reduction, Augmented Reality

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

40

Ndalichako, Joyce L., and W. Todd Rogers. "Comparison of Finite State Score Theory, Classical Test Theory, and Item Response Theory in Scoring Multiple-Choice Items." Educational and Psychological Measurement 57, no. 4 (August 1997): 580–89. http://dx.doi.org/10.1177/0013164497057004004.

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

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

41

Ahn, Soohan, J. Jeon, and V. Ramaswami. "Steady State Analysis of Finite Fluid Flow Models Using Finite QBDs." Queueing Systems 49, no. 3-4 (April 2005): 223–59. http://dx.doi.org/10.1007/s11134-005-6966-9.

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

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

42

GRUBER, HERMANN, and MARKUS HOLZER. "PROVABLY SHORTER REGULAR EXPRESSIONS FROM FINITE AUTOMATA." International Journal of Foundations of Computer Science 24, no. 08 (December 2013): 1255–79. http://dx.doi.org/10.1142/s0129054113500330.

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

Анотація:

Based on recent results from extremal graph theory, we prove that every n-state binary deterministic finite automaton can be converted into an equivalent regular expression of size O(1.742n) using state elimination. Furthermore, we give improved upper bounds on the language operations intersection and interleaving on regular expressions.

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

43

Vidal, E., F. Thollard, C. de la Higuera, F. Casacuberta, and R. C. Carrasco. "Probabilistic finite-state machines - part I." IEEE Transactions on Pattern Analysis and Machine Intelligence 27, no. 7 (July 2005): 1013–25. http://dx.doi.org/10.1109/tpami.2005.147.

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

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

44

Vidal, E., F. Thollard, C. de la Higuera, F. Casacuberta, and R. C. Carrasco. "Probabilistic finite-state machines - part II." IEEE Transactions on Pattern Analysis and Machine Intelligence 27, no. 7 (July 2005): 1026–39. http://dx.doi.org/10.1109/tpami.2005.148.

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

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

45

Goldberg, Robert R., and Jerry Waxman. "Parallel decision procedures for finite state automata." International Journal of Computer Mathematics 49, no. 1-2 (January 1993): 33–40. http://dx.doi.org/10.1080/00207169308804213.

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

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

46

Ivanov, Alexander, and Alexey Tuzhilin. "Gromov minimal fillings for finite metric spaces." Publications de l'Institut Math?matique (Belgrade) 94, no. 108 (2013): 3–15. http://dx.doi.org/10.2298/pim1308003i.

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

Анотація:

The problem discussed in this paper was stated by Alexander O. Ivanov and Alexey A. Tuzhilin in 2009. It stands at the intersection of the theories of Gromov minimal fillings and Steiner minimal trees. Thus, it can be considered as one-dimensional stratified version of the Gromov minimal fillings problem. Here we state the problem; discuss various properties of one-dimensional minimal fillings, including a formula calculating their weights in terms of some special metrics characteristics of the metric spaces they join (it was obtained by A.Yu. Eremin after many fruitful discussions with participants of Ivanov-Tuzhilin seminar at Moscow State University); show various examples illustrating how one can apply the developed theory to get nontrivial results; discuss the connection with additive spaces appearing in bioinformatics and classical Steiner minimal trees having many applications, say, in transportation problem, chip design, evolution theory etc. In particular, we generalize the concept of Steiner ratio and get a few of its modifications defined by means of minimal fillings, which could give a new approach to attack the long standing Gilbert-Pollack Conjecture on the Steiner ratio of the Euclidean plane.

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

47

KERIMOV, AZER. "ON THE UNIQUENESS OF GIBBS STATES IN THE PIROGOV–SINAI THEORY." International Journal of Modern Physics B 20, no. 15 (June 20, 2006): 2137–46. http://dx.doi.org/10.1142/s0217979206034534.

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

Анотація:

We consider models of classical statistical mechanics satisfying natural stability conditions: a finite spin space, translation-periodic finite potential of finite range, a finite number of ground states meeting Peierls or Gertzik–Pirogov–Sinai condition. The Pirogov–Sinai theory describes the phase diagrams of these models at low temperature regimes. By using the method of doubling and mixing of partition functions we give an alternative elementary proof of the uniqueness of limiting Gibbs states at low temperatures in ground state uniqueness region.

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

48

COOPER, FRED, та EMIL MOTTOLA. "INITIAL VALUE PROBLEMS IN λφ4 FIELD THEORY IN A BACKGROUND GRAVITATIONAL FIELD". Modern Physics Letters A 02, № 09 (вересень 1987): 635–44. http://dx.doi.org/10.1142/s0217732387000793.

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

Анотація:

We derive the time evolution equations appropriate to initial value problems in λ(φαφα)2 field theory at large N interacting with a classical background spatially flat R.W. metric. We determine from physical considerations the renormalization of the mass, the self coupling and the coupling to the scalar curvature. A simple method is given to arrive at finite differential equations suitable for numerical integration forward in time. We find that for the equations to be finite, the ultraviolet properties of the initial state are constrained by the requirement that the initial state contains a finite average number of particles and/or correlated pairs per unit volume.

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

49

Sulaiman, Maulana Muhamad, Romi Andrianto, and Muhamad Arief Yulianto. "Mobile Learning Application for Language and Automata Theory using Android-based." Jurnal Online Informatika 5, no. 2 (December 3, 2020): 176. http://dx.doi.org/10.15575/join.v5i2.630.

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

Анотація:

The language and automata theory are which required course must implemented by college student in informatic engineering study program. In this course, there are finite state automata (FSA) and deterministic finite automata (DFA) which are important materials in language and automata theory. This material requires more understanding of mathematical logic from students to determine an input which can be accepted or rejected in an abstract machine system. The assist students to understand the material, it is need to develop the learning media for mobile learning applications for language and automata theory on finite state automata (FSA) and deterministic finite automata (DFA) based on android as an evaluation of learning media for students. And the development of this learning media use the ADDIE development model (analysis, design, development, implementation, evaluation) to design language and automata theory applications learning so can be support the learning process for students and then assist lecturer to explain the material more dynamic and applicative.

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

50

Dong, Xingjian, Zhike Peng, and Guang Meng. "Vibration control of a lead zirconate titanate structure considering controller–structure interactions." Journal of Low Frequency Noise, Vibration and Active Control 37, no. 4 (September 4, 2018): 1201–18. http://dx.doi.org/10.1177/1461348418795372.

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

Анотація:

This study focuses on integrating an active vibration controller into the finite element model of a piezoelectric laminated plate with the controller–structure interactions considered. A finite element model of a piezoelectric laminated plate is formulated using the third-order shear deformation theory. A state-space model is set up by performing a system identification technique. The state-space model is then used to design an optimal vibration controller. Considering that the finite element model is more appropriate than state-space model for dynamic simulation, the state-space model-based controller is integrated into the finite element model to capture the controller–structure interactions. The results obtained by applying vibration controller in state-space model are also presented to make a comparison. It is numerically demonstrated that the controller–structure interactions occur and cause performance degradation in case that the state-space model-based controller works with the finite element model. There is no prior guarantee that a state-space model-based controller satisfying the control requirements still works well in closed loop with the finite element model. The results of this study can be used to evaluate the controller performance for the piezoelectric smart structures during the preliminary design stage.

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

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