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

Добірка наукової літератури з теми "Finite State Theory"

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

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

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

Зміст

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Finite State Theory".

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

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

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

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 та ін.
Більше джерел

Дисертації з теми "Finite State Theory"

1

Merryman, William Patrick. "Animating the conversion of nondeterministic finite state automata to deterministic finite state automata." Thesis, Montana State University, 2007. http://etd.lib.montana.edu/etd/2007/merryman/MerrymanW0507.pdf.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Yap, Ngee Thai. "Modeling syllable theory with finite-state transducers." Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file, 279 p, 2006. http://proquest.umi.com/pqdweb?did=1179954391&sid=4&Fmt=2&clientId=8331&RQT=309&VName=PQD.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Liu, Jiuling. "A finite state machine synthesizer." PDXScholar, 1989. https://pdxscholar.library.pdx.edu/open_access_etds/3912.

Повний текст джерела
Анотація:
This thesis presents a Finite State Machine (FSM) Synthesizer developed at Portland State University. The synthesizer starts from a high level behavioral description, in which no states are specified, and generates the lower level FSM descriptions for simulation and physical layout generation.
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Zhao, William Yue. "A new approach to state minimization of finite state machines." PDXScholar, 1989. https://pdxscholar.library.pdx.edu/open_access_etds/3951.

Повний текст джерела
Анотація:
A complete program to ease the task of large scale Finite State Machine (FSM) minimization presented in this thesis: TDFM (Two Dimensional FSM Minimizer), is a part of the DIADES system. DIADES is an Automatic Design Synthesis System whose development in the Department of Electrical Engineering at Portland State University is supported in part by a research grant from SHARP Microelectronics Technology.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Kshatriya, Jagannath Rajini Singh. "Visualizing the minimization of a deterministic finite state automaton." Thesis, Montana State University, 2007. http://etd.lib.montana.edu/etd/2007/kshatriyajagannath/KshatriyaJagannathR1207.pdf.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Hayashi, Masahito. "Asymptotic estimation theory for a finite dimensional pure state model." 京都大学 (Kyoto University), 1999. http://hdl.handle.net/2433/181932.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Wang, Suning. "Classical and logic based control theory for finite state machines." Thesis, McGill University, 1991. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=70243.

Повний текст джерела
Анотація:
This thesis formulates the state estimation and control problem for partially observed finite machines in terms of classical and logic-based approaches. First, in Part I, we present a set operation based formulation of an observer (tree) and a dynamic programming based controller. Then we provide the results of computational complexity of building and running such classical observer and controllers. In Part II, we introduce a notion of a logic-based dynamical system, a new paradigm for controlling finite machines. In particular, we give concepts of a logic-based dynamic observer, and a logic-based dynamic controller and demonstrate an equivalence between classical and logic-based systems. Then we introduce a conditional observer and controller logic--COCOLOG for finite machines, which consists of a family of first order logics each corresponding to a node in the observer tree. Conditional control statements are formulated so that (closed loop) control actions occur when specified past measurable (i.e. past observation dependent) conditions are fulfilled. A semantics is supplied for each COCOLOG in terms of interpretations of controlled transitions on a tree of state estimate sets indexed by observation o(k). Consistency and completeness of the first order theories in a COCOLOG family are established. Furthermore, through a certain unique model property, we obtain the decidability result for each logical theory in a COCOLOG family. Last, in Part III, a function evaluation based resolution for COCOLOG theorems, called FE-resolution, is presented. Completeness results for the FE-resolution method is given in terms of relative truthfulness and validity.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Mason, Kahn. "Notes on the parallel decomposition theory of finite state machines." Thesis, University of Canterbury. Computer Science, 1998. http://hdl.handle.net/10092/8419.

Повний текст джерела
Анотація:
We extend existing theory for the parallel decomposition of finite machines (finite automata) to ω-machines and timed machines. The focus for all three is the existence of a structural relationship between the decomposition and the original machine. This is defined in terms of suitable homomorphisms. The homomorphisms also yield inuitively obvious relationships between the languages of accepted words. The theory of decomposition by state partitions obtaining quotient machines is known for finite machines [Hol82, Shi87]. The extensions to ω-machines is straightforward with a suitable choice of acceptance criteria. Muller acceptance criteria [Tho90] seem natural and are used here. A suitable partial order on the partitions leads to a lattice, the minimal elements of which are the natural starting points in locating decompositions. The extension to timed machines [AD94] is not as straightforward. As anticipated clock resetting and constraints prevent a straightforward state based generalisation. Suitable partitions of both states and clocks are required to generate quotient machines. Once again, a suitable partial order leads to a regarding a lattice, the minimal elements of which are natural starting points. The members of the lattice are now pairs of state partitions with clock subsets. Each of the theories is developed alongside a worked example illustrating how the theory is applied. Discussion of the results, their potential applications and areas of concern is interleaved with the results, and is summarised at the end.
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Cazalis, Daniel S. "Algebraic Theory of Minimal Nondeterministic Finite Automata with Applications." FIU Digital Commons, 2007. http://digitalcommons.fiu.edu/etd/8.

Повний текст джерела
Анотація:
Since the 1950s, the theory of deterministic and nondeterministic finite automata (DFAs and NFAs, respectively) has been a cornerstone of theoretical computer science. In this dissertation, our main object of study is minimal NFAs. In contrast with minimal DFAs, minimal NFAs are computationally challenging: first, there can be more than one minimal NFA recognizing a given language; second, the problem of converting an NFA to a minimal equivalent NFA is NP-hard, even for NFAs over a unary alphabet. Our study is based on the development of two main theories, inductive bases and partials, which in combination form the foundation for an incremental algorithm, ibas, to find minimal NFAs. An inductive basis is a collection of languages with the property that it can generate (through union) each of the left quotients of its elements. We prove a fundamental characterization theorem which says that a language can be recognized by an n-state NFA if and only if it can be generated by an n-element inductive basis. A partial is an incompletely-specified language. We say that an NFA recognizes a partial if its language extends the partial, meaning that the NFA's behavior is unconstrained on unspecified strings; it follows that a minimal NFA for a partial is also minimal for its language. We therefore direct our attention to minimal NFAs recognizing a given partial. Combining inductive bases and partials, we generalize our characterization theorem, showing that a partial can be recognized by an n-state NFA if and only if it can be generated by an n-element partial inductive basis. We apply our theory to develop and implement ibas, an incremental algorithm that finds minimal partial inductive bases generating a given partial. In the case of unary languages, ibas can often find minimal NFAs of up to 10 states in about an hour of computing time; with brute-force search this would require many trillions of years.
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Mogliacci, Sylvain [Verfasser]. "Probing the finite density equation of state of QCD via resummed perturbation theory / Sylvain Mogliacci." Bielefeld : Universitätsbibliothek Bielefeld, 2014. http://d-nb.info/1053467508/34.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Книги з теми "Finite State Theory"

1

Timothy, Kam, ed. Synthesis of finite state machines: Functional optimization. Boston, Mass: Kluwer Acadmic Publishers, 1997.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Stochastic games with finite state and action spaces. [Amsterdam, the Netherlands]: Centrum voor Wiskunde en Informatica, 1987.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Kam, Timothy. Synthesis of Finite State Machines: Functional Optimization. Boston, MA: Springer US, 1997.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Ferdinand, Wagner, ed. Modeling software with finite state machines: A practical approach. Boca Raton, FL: Taylor & Francis, 2006.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Villa, Tiziano. Synthesis of Finite State Machines: Logic Optimization. Boston, MA: Springer US, 1997.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

1953-, Villa Tiziano, ed. Synthesis of finite state machines: Logic optimization. Boston: Kluwer Academic, 1997.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Czerwinski, Robert. Finite State Machine Logic Synthesis for Complex Programmable Logic Devices. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

C, Solomon R., ed. Representation theory of finite groups: Proceedings of a special research quarter at the Ohio State University, spring, 1995. Berlin: Walter de Gruyter, 1997.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Steven, Nowick, ed. Sequential optimization of asynchronous and synchronous finite-state machines: Algorithms and tools. Boston: Kluwer Academic Publishers, 2001.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Fuhrer, Robert M. Sequential optimization of asynchronous and synchronous finite-state machines: Algorithms and tools. Boston: Kluwer Academic Publishers, 2001.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Частини книг з теми "Finite State Theory"

1

d’Andréa-Novel, Brigitte, and Michel De Lara. "Finite Dimensional State-Space Models." In Control Theory for Engineers, 17–44. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-34324-7_2.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Freivalds, Rūsinņš, and Andreas Winter. "Quantum Finite State Transducers." In SOFSEM 2001: Theory and Practice of Informatics, 233–42. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45627-9_20.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Kam, Timothy, Tiziano Villa, Robert Brayton, and Alberto Sangiovanni-Vincentelli. "Taxonomy and Theory of Behaviors." In Synthesis of Finite State Machines, 11–35. Boston, MA: Springer US, 1997. http://dx.doi.org/10.1007/978-1-4757-2622-0_2.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Cuitiño, A. M., and M. Ortiz. "State Updates and State-Transfer Operators in Computational Plasticity." In Finite Inelastic Deformations — Theory and Applications, 239–58. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/978-3-642-84833-9_23.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Kozachinskiy, Alexander, and Alexander Shen. "Two Characterizations of Finite-State Dimension." In Fundamentals of Computation Theory, 80–94. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-25027-0_6.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Dreizler, Reiner M. "Density Functional Theory at Finite Temperatures." In The Nuclear Equation of State, 521–32. Boston, MA: Springer US, 1989. http://dx.doi.org/10.1007/978-1-4613-0583-5_40.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

McEachern, Andrew. "Introduction: The Prisoner’s Dilemma and Finite State Automata." In Game Theory, 1–8. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-031-02118-3_1.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Mukund, Madhavan, K. Narayan Kumar, and Milind Sohoni. "Synthesizing Distributed Finite-State Systems from MSCs." In CONCUR 2000 — Concurrency Theory, 521–35. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-44618-4_37.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Ludwig, Wolfgang, and Claus Falter. "Elements of the Theory of Finite Groups." In Springer Series in Solid-State Sciences, 4–17. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/978-3-642-79977-8_2.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Ludwig, Wolfgang, and Claus Falter. "Elements of the Theory of Finite Groups." In Springer Series in Solid-State Sciences, 4–17. Berlin, Heidelberg: Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/978-3-642-97029-0_2.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Finite State Theory"

1

Hao, Yiding. "Harmonic Serialism and Finite-State Optimality Theory." In Proceedings of the 13th International Conference on Finite State Methods and Natural Language Processing (FSMNLP 2017). Stroudsburg, PA, USA: Association for Computational Linguistics, 2017. http://dx.doi.org/10.18653/v1/w17-4003.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Sankarasubramaniam, Yogesh, Andrew Thangaraj, and Kapali Viswanathan. "Finite-state wiretap channels: Secrecy under memory constraints." In 2009 IEEE Information Theory Workshop. IEEE, 2009. http://dx.doi.org/10.1109/itw.2009.5351376.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Rezaeian, Mohammad. "Symmetric Characterization of Finite State Markov Channels." In 2006 IEEE International Symposium on Information Theory. IEEE, 2006. http://dx.doi.org/10.1109/isit.2006.261559.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Sasaki, Shoichi, and Takeshi Yamazaki. "Bound state spectrum in the finite volume." In XXIIIrd International Symposium on Lattice Field Theory. Trieste, Italy: Sissa Medialab, 2005. http://dx.doi.org/10.22323/1.020.0061.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Dabora, Ron, and Andrea Goldsmith. "Finite-state broadcast channels with feedback and receiver cooperation." In 2009 IEEE Information Theory Workshop on Networking and Information Theory (ITW). IEEE, 2009. http://dx.doi.org/10.1109/itwnit.2009.5158554.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Chen, Jun, Haim Permuter, and Tsachy Weissman. "On the capacity of finite-state channels." In 2008 IEEE International Symposium on Information Theory - ISIT. IEEE, 2008. http://dx.doi.org/10.1109/isit.2008.4595182.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Weng, Jian-Jia, Fady Alajaji, and Tamás Linder. "Capacity of Finite-State Two-Way Channels." In 2023 IEEE International Symposium on Information Theory (ISIT). IEEE, 2023. http://dx.doi.org/10.1109/isit54713.2023.10206735.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Shrader, Brooke, and Haim H. Permuter. "On the Compound Finite State Channel with Feedback." In 2007 IEEE International Symposium on Information Theory. IEEE, 2007. http://dx.doi.org/10.1109/isit.2007.4557258.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Eckford, Andrew W. "Ordering Finite-State Markov Channels by Mutual Information." In 2007 IEEE International Symposium on Information Theory. IEEE, 2007. http://dx.doi.org/10.1109/isit.2007.4557340.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Ikemoto, K., and R. Kohno. "Adaptive channel coding scheme using finite state machine." In IEEE International Symposium on Information Theory, 2003. Proceedings. IEEE, 2003. http://dx.doi.org/10.1109/isit.2003.1228491.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Finite State Theory"

1

Zarrieß, Benjamin, and Jens Claßen. Decidable Verification of Golog Programs over Non-Local Effect Actions. Technische Universität Dresden, 2015. http://dx.doi.org/10.25368/2022.224.

Повний текст джерела
Анотація:
The Golog action programming language is a powerful means to express high-level behaviours in terms of programs over actions defined in a Situation Calculus theory. In particular for physical systems, verifying that the program satisfies certain desired temporal properties is often crucial, but undecidable in general, the latter being due to the language’s high expressiveness in terms of first-order quantification and program constructs. So far, approaches to achieve decidability involved restrictions where action effects either had to be contextfree (i.e. not depend on the current state), local (i.e. only affect objects mentioned in the action’s parameters), or at least bounded (i.e. only affect a finite number of objects). In this paper, we present a new, more general class of action theories (called acyclic) that allows for context-sensitive, non-local, unbounded effects, i.e. actions that may affect an unbounded number of possibly unnamed objects in a state-dependent fashion. We contribute to the further exploration of the boundary between decidability and undecidability for Golog, showing that for acyclic theories in the two-variable fragment of first-order logic, verification of CTL properties of programs over ground actions is decidable
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Terzic, Vesna, and William Pasco. Novel Method for Probabilistic Evaluation of the Post-Earthquake Functionality of a Bridge. Mineta Transportation Institute, April 2021. http://dx.doi.org/10.31979/mti.2021.1916.

Повний текст джерела
Анотація:
While modern overpass bridges are safe against collapse, their functionality will likely be compromised in case of design-level or beyond design-level earthquake, which may generate excessive residual displacements of the bridge deck. Presently, there is no validated, quantitative approach for estimating the operational level of the bridge after an earthquake due to the difficulty of accurately simulating residual displacements. This research develops a novel method for probabilistic evaluation of the post-earthquake functionality state of the bridge; the approach is founded on an explicit evaluation of bridge residual displacements and associated traffic capacity by considering realistic traffic load scenarios. This research proposes a high-fidelity finite-element model for bridge columns, developed and calibrated using existing experimental data from the shake table tests of a full-scale bridge column. This finite-element model of the bridge column is further expanded to enable evaluation of the axial load-carrying capacity of damaged columns, which is critical for an accurate evaluation of the traffic capacity of the bridge. Existing experimental data from the crushing tests on the columns with earthquake-induced damage support this phase of the finite-element model development. To properly evaluate the bridge's post-earthquake functionality state, realistic traffic loadings representative of different bridge conditions (e.g., immediate access, emergency traffic only, closed) are applied in the proposed model following an earthquake simulation. The traffic loadings in the finite-element model consider the distribution of the vehicles on the bridge causing the largest forces in the bridge columns.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Borgwardt, Stefan, and Rafael Peñaloza. Complementation and Inclusion of Weighted Automata on Infinite Trees: Revised Version. Technische Universität Dresden, 2011. http://dx.doi.org/10.25368/2022.180.

Повний текст джерела
Анотація:
Weighted automata can be seen as a natural generalization of finite state automata to more complex algebraic structures. The standard reasoning tasks for unweighted automata can also be generalized to the weighted setting. In this report we study the problems of intersection, complementation, and inclusion for weighted automata on infinite trees and show that they are not harder complexity-wise than reasoning with unweighted automata. We also present explicit methods for solving these problems optimally.
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Borgwardt, Stefan, and Rafael Peñaloza. Complementation and Inclusion of Weighted Automata on Infinite Trees. Technische Universität Dresden, 2010. http://dx.doi.org/10.25368/2022.178.

Повний текст джерела
Анотація:
Weighted automata can be seen as a natural generalization of finite state automata to more complex algebraic structures. The standard reasoning tasks for unweighted automata can also be generalized to the weighted setting. In this report we study the problems of intersection, complementation and inclusion for weighted automata on infinite trees and show that they are not harder than reasoning with unweighted automata. We also present explicit methods for solving these problems optimally.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Heymsfield, Ernie, and Jeb Tingle. State of the practice in pavement structural design/analysis codes relevant to airfield pavement design. Engineer Research and Development Center (U.S.), May 2021. http://dx.doi.org/10.21079/11681/40542.

Повний текст джерела
Анотація:
An airfield pavement structure is designed to support aircraft live loads for a specified pavement design life. Computer codes are available to assist the engineer in designing an airfield pavement structure. Pavement structural design is generally a function of five criteria: the pavement structural configuration, materials, the applied loading, ambient conditions, and how pavement failure is defined. The two typical types of pavement structures, rigid and flexible, provide load support in fundamentally different ways and develop different stress distributions at the pavement – base interface. Airfield pavement structural design is unique due to the large concentrated dynamic loads that a pavement structure endures to support aircraft movements. Aircraft live loads that accompany aircraft movements are characterized in terms of the load magnitude, load area (tire-pavement contact surface), aircraft speed, movement frequency, landing gear configuration, and wheel coverage. The typical methods used for pavement structural design can be categorized into three approaches: empirical methods, analytical (closed-form) solutions, and numerical (finite element analysis) approaches. This article examines computational approaches used for airfield pavement structural design to summarize the state-of-the-practice and to identify opportunities for future advancements. United States and non-U.S. airfield pavement structural codes are reviewed in this article considering their computational methodology and intrinsic qualities.
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Ko, Yu-Fu, and Jessica Gonzalez. Fiber-Based Seismic Damage and Collapse Assessment of Reinforced Concrete Single-Column Pier-Supported Bridges Using Damage Indices. Mineta Transportation Institute, August 2023. http://dx.doi.org/10.31979/mti.2023.2241.

Повний текст джерела
Анотація:
Near-fault earthquakes can have major effects on transportation systems due to the structural damage they impose on bridges. Therefore, it is imperative to assess the seismic damage of bridges appropriately, and this research focuses on reinforced concrete (RC) bridges. This research advances the seismic performance assessment of RC single-column pier-supported bridges with flexural failure under near-fault ground motion by use of ductility coefficients and damage indices. The methodology included modeling fiber-based nonlinear beam-column elements to simulate the damage development process of RC bridge piers under earthquake loadings, considering the global buckling of longitudinal steel bars, examining the cracking and spalling of cover concrete, and analyzing the effects of bond-slip. The tensile strain represented the damage of the longitudinal bars while the compression strain represented the cover concrete damage. Two innovative nonlinear fiber-based finite element models (FEMs) were developed: Model 1 (bond-slip excluded) and Model 2 (bond-slip included). Nonlinear static cyclic pushover analyses and nonlinear response history analyses were conducted. The simulation results were compared with available pseudo-dynamic test results. Model 1 provided a more ideal prognosis on the seismic performance of RC single-column pier-supported bridges under near-fault ground motion. The proposed damage indices can indicate the damage state at any stage and the gradual accumulation of damage in RC bridge piers, which are more convincing than most other indices in the literature. The proposed fiber-based nonlinear FEMs, together with the use of ductility coefficients and proposed damage indices, can also assist engineers and researchers in simulating the seismic behavior and assessing the damage state of RC bridge columns in a computationally effective manner which can empower engineers to identify and prioritize RC bridges for seismic retrofit and maintenance.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Oliynyk, Kateryna, and Matteo Ciantia. Application of a finite deformation multiplicative plasticity model with non-local hardening to the simulation of CPTu tests in a structured soil. University of Dundee, December 2021. http://dx.doi.org/10.20933/100001230.

Повний текст джерела
Анотація:
In this paper an isotropic hardening elastoplastic constitutive model for structured soils is applied to the simulation of a standard CPTu test in a saturated soft structured clay. To allow for the extreme deformations experienced by the soil during the penetration process, the model is formulated in a fully geometric non-linear setting, based on: i) the multiplicative decomposition of the deformation gradient into an elastic and a plastic part; and, ii) on the existence of a free energy function to define the elastic behaviour of the soil. The model is equipped with two bonding-related internal variables which provide a macroscopic description of the effects of clay structure. Suitable hardening laws are employed to describe the structure degradation associated to plastic deformations. The strain-softening associated to bond degradation usually leads to strain localization and consequent formation of shear bands, whose thickness is dependent on the characteristics of the microstructure (e.g, the average grain size). Standard local constitutive models are incapable of correctly capturing this phenomenon due to the lack of an internal length scale. To overcome this limitation, the model is framed using a non-local approach by adopting volume averaged values for the internal state variables. The size of the neighbourhood over which the averaging is performed (characteristic length) is a material constant related to the microstructure which controls the shear band thickness. This extension of the model has proven effective in regularizing the pathological mesh dependence of classical finite element solutions in the post-localization regime. The results of numerical simulations, conducted for different soil permeabilities and bond strengths, show that the model captures the development of plastic deformations induced by the advancement of the cone tip; the destructuration of the clay associated with such plastic deformations; the space and time evolution of pore water pressure as the cone tip advances. The possibility of modelling the CPTu tests in a rational and computationally efficient way opens a promising new perspective for their interpretation in geotechnical site investigations.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Barker, Amanda, Jay Clausen, Thomas Douglas, Anthony Bednar, Christopher Griggs, and William Martin. Environmental impact of metals resulting from military training activities : a review. Engineer Research and Development Center (U.S.), February 2022. http://dx.doi.org/10.21079/11681/43348.

Повний текст джерела
Анотація:
The deposition of metals into the environment as a result of military training activities remains a longterm concern for Defense organizations across the globe. Of particular concern for deposition and potential mobilization are antimony (Sb), arsenic (As), copper (Cu), lead (Pb), and tungsten (W), which are the focus of this review article. The fate, transport, and mobilization of these metals are complicated and depend on a variety of environmental factors that are often convoluted, heterogeneous, and site dependent. While there have been many studies investigating contaminant mobilization on military training lands there exists a lack of cohesiveness surrounding the current state of knowledge for these five metals. The focus of this review article is to compile the current knowledge of the fate, transport, and ultimate risks presented by metals associated with different military training activities particularly as a result of small arms training activities, artillery/mortar ranges, battleruns, rocket ranges, and grenade courts. From there, we discuss emerging research results and finish with suggestions of where future research efforts and training range designs could be focused toward further reducing the deposition, limiting the migration, and decreasing risks presented by metals in the environment. Additionally, information presented here may offer insights into Sb, As, Cu, Pb, and W in other environmental settings.
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Rosenfeld, Hart, and Zulfiqar. L51994 Acceptance Criteria for Mild Ripples in Pipeline Field Bends. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), September 2003. http://dx.doi.org/10.55274/r0010395.

Повний текст джерела
Анотація:
Field bends in large diameter pipe are routinely used in the construction of oil and gas pipelines. Mild ripples along the intrados are often unavoidable where such bends have a high D/t or high yield strength. Present regulations and industry standards differ in their treatment of mild ripples, ranging from silence to prohibition, depending upon interpretation. Consequently, the application of acceptance standards for such features is inconsistent, leading to variable standards of inspection and probable scrapping of otherwise sound bends. Finite element analysis (FEA) was used to estimate the effect of ripple magnitude and spacing on stresses due to pressure and bending. Stress concentration factors derived from the models were used with a suitable fatigue damage rule to estimate the effect of ripple parameters on service life. Results were benchmarked against the available test data. The results indicate that (1) mild or shallow ripples up to 2 percent of the pipe diameter in crest-to-trough dimension would not be expected to be harmful in gas transmission pipelines operating under conditions normally encountered in the gas transportation industry; (2) mild or shallow ripples up to 1 percent of the pipe diameter in crest-to-trough dimension would not be expected to be harmful in hazardous liquid transportation pipelines operating under conditions normally encountered in the liquid transportation industry; (3) the presence of ripples could eventually be harmful to long-term integrity in a severe cyclic loading (pressure, thermal expansion, flow-induced vibration) environment, or where soil movement could take place. Recommendations are made for ASME Code criteria specifically permitting mild ripples within stated limits.
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Kontak, D. J., S. Paradis, Z. Waller, and M. Fayek. Petrographic, fluid inclusion, and secondary ion mass spectrometry stable isotopic (O, S) study of Mississippi Valley-type mineralization in British Columbia and Alberta. Natural Resources Canada/CMSS/Information Management, 2022. http://dx.doi.org/10.4095/327994.

Повний текст джерела
Анотація:
A comprehensive study of Mississippi Valley-type base-metal deposits across the Canadian Cordillera was done to compare and contrast their features. Extensive dissolution of host rocks is followed by multiple generations of dolomite cements from early, low-temperature, fine-grained to coarser, higher temperature types that overlap with Zn-Pb sulfide minerals; late-stage calcite occludes residual porosity. Dolomite is generally chemically stoichiometric, but ore-stage types are often rich in Fe (<1.3 weight per cent FeO) with small sphalerite inclusions. Sphalerite-hosted fluid inclusions record ranges for homogenization temperatures (77-214°C) and fluid salinity (1-28 weight per cent equiv. NaCl±CaCl2). These data suggest fluid mixing with no single fluid type related to all sulfide mineralization. In situ secondary ion mass spectrometry (SIMS) generated delta-18OVSMOW values for carbonate minerals (13-33 permille) reflect dolomite and calcite formation involving several fluids (seawater, basinal, meteoric) over a large temperature range at varying fluid-rock ratios. Sphalerite and pyrite SIMS delta-34SVCDT values vary (8-33 permille) but in single settings have small ranges (<2-3 permille) that suggest sulfur was reduced via thermochemical sulfate reduction from homogeneous sulfur reservoirs. Collectively, the data implicate several fluids in the mineralizing process and suggest mixing of a sulfur-poor, metal-bearing fluid with a metal-poor, sulfide-bearing fluid.
Стилі APA, Harvard, Vancouver, ISO та ін.
Також вас можуть зацікавити розширені добірки на тему "Finite State Theory" для конкретних типів джерел:
Статті в журналах Дисертації Книги
Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!

До бібліографії