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

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

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

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

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

Зміст

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

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

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

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

1

Shang, Lina, Pinqi H. Xia, and Dewey H. Hodges. "Aeroelastic Response Analysis of Composite Blades Based on Geometrically Exact Beam Theory." Journal of the American Helicopter Society 64, no. 2 (April 1, 2019): 1–14. http://dx.doi.org/10.4050/jahs.64.022007.

Повний текст джерела
Анотація:
The geometrically exact nonlinear beam theory consisting of the latest version of two-dimensional variational asymptotic beam sectional analysis (VABS) and one-dimensional geometrically exact beam theory (GEBT) has been widely used for the structural analysis of composite beam structures. The theory can be used for establishing the aeroelastic model of composite blades undergoing large deflections to improve computational accuracy and efficiency. In this paper, the theory has been extended from structural analysis to aeroelastic analysis of blade, and an accurate and efficient method for aeroelastic response analysis of composite blades has been presented based on the theory and unsteady aerodynamic model. The geometrically exact nonlinear equations of motion and the latest VABS are used to deal with one-dimensional beam analysis and the structural property of blade cross section, respectively. The Peters–He finite state dynamic wake model and the Peters finite state airloads theory are used to calculate the induced velocity and blade airloads, respectively. The presented method has been used to analyze the aeroelastic responses of composite blades, and its accuracy has been verified by experimental data. The influence of transverse shear deformation on the aeroelastic response of composite blades was also investigated, indicating that the transverse shear deformation has a nonnegligible effect on aeroelastic response analysis of hingeless composite rotors in hover.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

KIM, KYUNG-SEOK, IN-GYU LIM, IN LEE, and JAE-HAN YOO. "FLUID-STRUCTURE INTERACTION ANALYSIS OF A HIGH-ASPECT-RATIO WING CONSIDERING STRUCTURAL NONLINEARITY." Modern Physics Letters B 23, no. 03 (January 30, 2009): 445–48. http://dx.doi.org/10.1142/s0217984909018618.

Повний текст джерела
Анотація:
In this research, fluid-structure interaction problem including geometric structural nonlinearity is studied for a high-aspect-ratio wing. When a high-aspect-ratio wing structure is interacted with external airload, geometric structural nonlinearity can be caused by large deflection of a wing. For the investigation of such a fluid-structure interaction problem, the transonic small disturbance theory for the aerodynamic analysis and the large deflection beam theory for the structural analysis are used, respectively. For the coupling between fluid and structure, the transformation of a displacement from the structural mesh to the aerodynamic grid is performed by a shape function which is used for the finite element and the inverse transformation of force by work equivalent load method. Static deformations in the vertical and twist deflections caused by gravity loading are compared with experimental results. Also, static aeroelastic analysis results are compared with experimental data. From the analysis results, effects of structural nonlinearity on static aeroelastic characteristics are investigated.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

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 та ін.
4

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 та ін.
5

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 та ін.
6

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 та ін.
7

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 та ін.
8

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 та ін.
9

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 та ін.
10

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

Дисертації з теми "Finite State Airload 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 Airload 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

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

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

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

Знайти повний текст джерела
Стилі 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 Airload 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

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 та ін.
4

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 та ін.
5

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 та ін.
6

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 та ін.
7

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 та ін.
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

Koralov, Leonid, and Yakov G. Sinai. "Markov Processes with a Finite State Space." In Theory of Probability and Random Processes, 201–8. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-540-68829-7_14.

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

Haase, Christoph. "Approaching Arithmetic Theories with Finite-State Automata." In Language and Automata Theory and Applications, 33–43. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-40608-0_3.

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

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

1

Pulok, Mohammad Khairul Habib, and Uttam K. Chakravarty. "An Investigation of the Wake and Vortex Formation of a Helicopter Rotor Blade." In ASME 2021 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2021. http://dx.doi.org/10.1115/imece2021-70777.

Повний текст джерела
Анотація:
Abstract Vortices are present in many engineering applications and are systematically generated by lifting surfaces. The vortex characteristics and the wake surrounding a helicopter rotor blade play an important role because they affect the flow physics surrounding the rotor blade. Therefore, an advanced mathematical and computational model of rotor wake and blade vortex gives a better understanding of the helicopter rotor dynamics. The strength of the vortex depends on the blade geometry, loading, and the aircraft’s operational state. A concentrated tip vortex line, an inboard trailing vortex sheet, and a shed vortex are accountable for aerodynamic airload generation. Among these, tip vortices have the maximum contribution and are formed by the rolling up of trailing vortices near the tip of the wing. In this study, tip vortex models are used to characterize the vortex core structure and prescribed wake models are utilized for analyzing the hovering flight. A Bo 105 composite, hingeless helicopter rotor blade is considered for the computational analysis. A fluid-structure interaction model is developed by coupling the finite element model of the rotor blade with a computational fluid dynamics model of the surrounding air to analyze the helicopter rotor blade dynamic response and to investigate vortex formation due to the fluid-structure interaction. The swirl velocity is minimum, and the axial velocity is maximum at the vortex center. The axial velocity decreases and swirl velocity increases with increasing the distance from the vortex center to the core radius.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

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 та ін.
3

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 та ін.
4

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 та ін.
5

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 та ін.
6

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 та ін.
7

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 та ін.
8

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 та ін.
9

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 та ін.
10

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 та ін.

Звіти організацій з теми "Finite State Airload 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 та ін.
Також вас можуть зацікавити розширені добірки на тему "Finite State Airload Theory" для конкретних типів джерел:
Статті в журналах Дисертації Книги
Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!

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