Journal articles: 'Abstract State Machine'

1

Chiara, Maria Luisa Dalla, Roberto Giuntini, Giuseppe Sergioli, and Roberto Leporini. "Abstract quantum computing machines and quantum computational logics." International Journal of Quantum Information 14, no. 04 (June 2016): 1640019. http://dx.doi.org/10.1142/s0219749916400190.

Full text

Abstract:

Classical and quantum parallelism are deeply different, although it is sometimes claimed that quantum Turing machines are nothing but special examples of classical probabilistic machines. We introduce the concepts of deterministic state machine, classical probabilistic state machine and quantum state machine. On this basis, we discuss the question: To what extent can quantum state machines be simulated by classical probabilistic state machines? Each state machine is devoted to a single task determined by its program. Real computers, however, behave differently, being able to solve different kinds of problems. This capacity can be modeled, in the quantum case, by the mathematical notion of abstract quantum computing machine, whose different programs determine different quantum state machines. The computations of abstract quantum computing machines can be linguistically described by the formulas of a particular form of quantum logic, termed quantum computational logic.

APA, Harvard, Vancouver, ISO, and other styles

2

Németh, Zoltán, and Miklós Kuczmann. "State space modeling theory of induction machines." Pollack Periodica 15, no. 1 (April 2020): 124–35. http://dx.doi.org/10.1556/606.2020.15.1.12.

Full text

Abstract:

Abstract The paper discusses the theoretical background of the state space modeling of induction machines. The main goal is to present the necessary equations of the induction machine and the topic of the state space modeling. Although the induction machine is a highly non-linear system, LPV/qLPV model can be formulated from these equations.

APA, Harvard, Vancouver, ISO, and other styles

3

Oken, Barry, Asieh Ahani, Helane Wahbeh, Hooman Nezamfar, Meghan Miller, Deniz Erdogmus, and Elena Goodrich. "Signal Processing and Machine Learning of EEG and Respiration Changes During Mindfulness Meditation State." Journal of Alternative and Complementary Medicine 20, no. 5 (May 2014): A25. http://dx.doi.org/10.1089/acm.2014.5061.abstract.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Hu, Zhonggang. "Research on the Properties of Lattice-Valued Finite State Machines in Computer Technology." Journal of Physics: Conference Series 2066, no. 1 (November 1, 2021): 012063. http://dx.doi.org/10.1088/1742-6596/2066/1/012063.

Full text

Abstract:

Abstract In this paper, we discuss some algebraic properties of Lattice valued finite state machine and prove that if there are homomorphic mapping satisfying certain conditions between two Lattice valued finite state machines, the first one is strongly connected (cycle), then then the second one is the same. And if the homomorphism is strongly homomorphic, one of the Lattice valued finite state machines is complete if and only if another Lattice valued finite state machine is complete. Discuss the completeness, strong connectivity, circulation and exchange capacity between the product of a Lattice valued finite state machine and the original Lattice valued finite state machine and get some results.

APA, Harvard, Vancouver, ISO, and other styles

5

Al-Fedaghi, Sabah. "Toward Understanding Dynamic Behavior in Abstract Machines." International Journal of Knowledge and Systems Science 8, no. 4 (October 2017): 54–72. http://dx.doi.org/10.4018/ijkss.2017100104.

Full text

Abstract:

This article proposes an abstract machine, known by the acronym FM, for modeling behavior currently described by finite state machines (SMs) in conjunction with related notions such as state and event. Although the SM concept was born more than 50 years ago and is widely applied in hardware design, the literature suggests it is not well understood despite its use in other application fields, especially in software system design. Several SM-based examples are remodeled in terms of the proposed machine, and they reveal a richer conception of the dynamic aspects of systems. FM enhances understanding of concepts in control modeling such as states, events, behavior, and control. The article exposes the limitations of unrefined SM features used in modeling software systems. It is suggested that FM be used as a modeling tool in the software system design process.

APA, Harvard, Vancouver, ISO, and other styles

6

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.

Full text

Abstract:

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, and other styles

7

Susanto, Susanto, Venny Yulianty, Bobby Suryo Prakoso, Suwanda Suwanda, Windu Gata, and Kresna Ramanda. "Desain Finite State Automata Untuk Merancang Vending Automata Logam Mulia." BINA INSANI ICT JOURNAL 8, no. 2 (December 13, 2021): 113. http://dx.doi.org/10.51211/biict.v8i2.1572.

Full text

Abstract:

Abstrak: Menabung logam mulia merupakan investasi yang dianggap safe haven, ditengah era modern saat ini menabung logam mulia dapat dilakukan dengan cara dicicil, sedangkan yang menjadi masalahnya adalah kekhawatiran ketika fisik logam mulia tidak dapat ditarik fisiknya yang membuat potensi fraud atau investasi bodong yang sedang marak saat ini, untuk mengatasi masalah itu penjualan logam mulia dapat dikembangkan menjadi lebih menarik dengan vending machine, untuk memperdalam pemahaman mengenai salah satu model komputasi yang mendasar dan pengenalan Internet of Things (IoT), desain vending machine ini akan menggunakan metode finite state automata (FSA). Dengan desain finite state automata, penelitian ini telah menghasilkan desain vending machine logam mulia berbasis Internet of Things (IoT) dari cara login ke vending machine sampai fisik logam mulia dapat diterima. Produk penjualan logam mulia dengan menggunakan vending machine ini diharapkan dapat menjangkau masyarakat lebih luas untuk berinvestasi, khususnya logam mulia. Kata kunci: Internet of Things, logam mulia, vending machine Abstract: Saving gold is an investment that is considered a safe haven, in the midst of today's modern era saving gold can be done in installments, while the problem is the concern when the physical gold cannot be physically withdrawn which creates the potential for fraud or fraudulent investments that are currently rampant. to overcome this problem the sale of precious metals can be developed to be more attractive with vending machines, to deepen understanding of one of the fundamental computing models and the introduction of the Internet of Things (IoT), this vending machine design will use the finite state automata (FSA) method. With the design of finite state automata (FSA), this research has resulted in the design of a gold vending machine based on the Internet of Things (IoT) from how to login to the vending machine until the gold is physically acceptable. The product selling gold using vending machines is expected to reach a wider audience to invest, especially gold. Keywords: Internet of Things, precious metals, vending machine

APA, Harvard, Vancouver, ISO, and other styles

8

Schüssler, Max. "Machine learning with nonlinear state space models." at - Automatisierungstechnik 70, no. 11 (October 27, 2022): 1027–28. http://dx.doi.org/10.1515/auto-2022-0089.

Full text

Abstract:

Abstract In this dissertation, a novel class of model structures and associated training algorithms for building data-driven nonlinear state space models is developed. The new identification procedure with the resulting model is called local model state space network (LMSSN). Furthermore, recurrent neural networks (RNNs) and their similarities to nonlinear state space models are elaborated on. The overall outstanding performance of the LMSSN is demonstrated on various applications.

APA, Harvard, Vancouver, ISO, and other styles

9

MORALES, JOSÉ F., MANUEL CARRO, and MANUEL HERMENEGILDO. "Description and Optimization of Abstract Machines in a Dialect of Prolog." Theory and Practice of Logic Programming 16, no. 1 (January 5, 2015): 1–58. http://dx.doi.org/10.1017/s1471068414000672.

Full text

Abstract:

AbstractIn order to achieve competitive performance, abstract machines for Prolog and related languages end up being large and intricate, and incorporate sophisticated optimizations, both at the design and at the implementation levels. At the same time, efficiency considerations make it necessary to use low-level languages in their implementation. This makes them laborious to code, optimize, and, especially, maintain and extend. Writing the abstract machine (and ancillary code) in a higher-level language can help tame this inherent complexity. We show how the semantics of most basic components of an efficient virtual machine for Prolog can be described using (a variant of) Prolog. These descriptions are then compiled to C and assembled to build a complete bytecode emulator. Thanks to the high-level of the language used and its closeness to Prolog, the abstract machine description can be manipulated using standard Prolog compilation and optimization techniques with relative ease. We also show how, by applying program transformations selectively, we obtain abstract machine implementations whose performance can match and even exceed that of state-of-the-art, highly-tuned, hand-crafted emulators.

APA, Harvard, Vancouver, ISO, and other styles

10

Пенкин, Юрий Михайлович, and Алина Александровна Федосеева. "СТРУКТУРНЫЕ КОНЕЧНЫЕ АВТОМАТЫ В ВИДЕ ТЕНЗОРОВ ТРЕТЬЕГО РАНГА ТИПА СУДОКУ." RADIOELECTRONIC AND COMPUTER SYSTEMS, no. 4 (December 25, 2019): 79–87. http://dx.doi.org/10.32620/reks.2019.4.09.

Full text

Abstract:

The construction concept and general principles of the operation of a new kind of finite state machine are presented, for which the input and output elements are panels of square matrices, and the transitions between their states are determined by numerical tensors of the third rank. In this case, the structure of the tensors is specified in the form of cubic grids, in whose cells' natural numbers are located according to the principle of Sudoku construction. An algorithm for constructing such tensors of arbitrary size is indicated. The structures of tensors constructed using ranked sets of natural numbers are defined as standard. It is shown that the possibility of determining Sudoku type tensors using a one-dimensional parameter is basic for the manifestation of their functional self-similarity. The property of additive conservation of the structure of numerical tensors of the third rank to the requirements of Sudoku is formulated as a theorem. It is proved that the tensor obtained by summing an arbitrary tensor structure and a constant, taking into account the introduced cyclic ranking rule, satisfies the general requirements of Sudoku. The problems of abstract and structural synthesis of finite state machine based on the analyzed tensor structures are considered. In this case, the task of abstract synthesis has traditionally been defined as the creation of a mathematical model of an automaton, and the task of structural synthesis is just the development of its functional logical scheme. Based on the ambiguity of the function of the output of the finite state machine, the possibility of the simultaneous use of several different output alphabets is substantiated. The modes of functioning of the minimal finite state machine of the proposed type are described by the example of an initial state machine with a distinguished standard initial state. In the general case, it is shown that the finite state machines defined on the group of these requirements can be attributed to generalized first-order finite-state machines (or Mealy machines) with a multi-valued output. The features of network applications of structural automata are presented. Variants of possible applications of the considered finite state machines are analyzed.

APA, Harvard, Vancouver, ISO, and other styles

11

Mukhammadiev, D. M., F. Kh Ibragimov, and O. Kh Abzoirov. "Calculation of gasket vibrations under a steady operating mode of the linter machine." Journal of Physics: Conference Series 2388, no. 1 (December 1, 2022): 012064. http://dx.doi.org/10.1088/1742-6596/2388/1/012064.

Full text

Abstract:

Abstract The article presents the results of calculating the saw gasket vibrations in the steady state operation of the linter machine. It was established that the stable position of the equilibrium of saw gasket vibrations is achieved in the steady state operation of the linter machines. To determine the vibrations of the saw gasket in the steady state operation of the linter machine, calculations were conducted with expansion into a series of kinetic and potential energies. As a result of the calculations, the frequency and period of oscillations of the saw gasket were determined under the steady-state operation of the linter machine with aluminum alloy and steel materials. Calculations have shown that an increase in the frequency of vibrations is 2.88 times for steel gaskets and a decrease in the period of vibrations is 34.7% relative to the aluminum alloy. The results of calculations of the vibrations of the steel saw gasket in the steady state operation of the linter machine showed the resistance to vibrations and the expediency of their use in the linter machine when assembling the saw cylinders.

APA, Harvard, Vancouver, ISO, and other styles

12

Żółtowski, Mariusz, Bogdan Żółtowski, and Leonel Castaneda. "Study of the state a Francis turbine." Polish Maritime Research 20, no. 2 (April 1, 2013): 41–47. http://dx.doi.org/10.2478/pomr-2013-0015.

Full text

Abstract:

Abstract This paper presents a methodology to evaluate the technical state of a Francis turbine by shaft rotor dynamic simulation. There are several rotor dynamic criteria that define the technical state of a turbo-machine. To feed the shaft rotor dynamic model this delivers the required information to accomplish the technical assessment. The numerical rotor dynamic model uses as input, the field forces obtained by the fluid-solid interaction analysis undertaken over the blades of the runner. The rotor dynamic numerical simulations allow to determinate the record-in-time of the displacements of any point along the shaft. This information is relevant for diagnosis tasks, because it is possible to decompose it spectrally and to estimate the severity of the vibrations. Comparing the results of the numerical model against those obtained from machines that operates under normal conditions, it is possible to determinate the technical state of the turbo-machine. This allows studying the stability of the turbine working on several operation ranges. A Francis turbine is a very complex machine that involves many physical phenomena of different nature. In this way, the hydraulic input forces needed by the rotor dynamic model should not be assumed but calculated directly from the fluid interaction over the turbine structure.

APA, Harvard, Vancouver, ISO, and other styles

13

Dauda, Taofik O., A. O. Raji, T. A. Ilori, A. O. Adejumo, and O. Kilanko. "EVALUATION OF MAINTENANCE CULTURE OF SOME AGRICULTURAL PROCESSING MACHINE IN OYO STATE, NIGERIA." American Journal of Agricultural Science, Engineering, and Technology 1, no. 3 (March 29, 2017): 43–52. http://dx.doi.org/10.54536/ajaset.v1i3.24.

Full text

Abstract:

ABSTRACT A survey on maintenance culture of some Agricultural processing machines wascarried out in Oyo state to investigate the type of maintenance practices carried out bystakeholder in the small scale agro- processing industry. Well structured questionnairewas used to source information on common machine fault, availability of spare parts,technical knowhow and types of maintenance carried out. A total of 150 questionnaireswere administered while 86.7% were retrieved, collated and analyzed using descriptive statistics. The study showed that 39% of the respondents practice predictive maintenance, 24% practice preventive while 27% combine both predictive andpreventive maintenance, 8% of the respondents prefer overhauling and 3% corrective.The technical know-how for the service maintenance of the machines surveyed is sparepart dependent as most of the machines are locally fabricated. However, 34.6% of therespondent tends to leave their machine for a period of six month before maintainingduring the off season period. A good and effective training program on maintenanceprocedures should be extended to stakeholder in the agro- processing industry to keepthose machines in optimum working condition.

APA, Harvard, Vancouver, ISO, and other styles

14

Shuang, Xiang, Zhao Bo, Xiao Yu, and An Yang. "Security risk analysis of IaaS based on the abstract state machine model." International Journal of High Performance Computing and Networking 9, no. 5/6 (2016): 431. http://dx.doi.org/10.1504/ijhpcn.2016.080416.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Yu, Xiao, An Yang, Zhao Bo, and Xiang Shuang. "Security risk analysis of IaaS based on the abstract state machine model." International Journal of High Performance Computing and Networking 9, no. 5/6 (2016): 431. http://dx.doi.org/10.1504/ijhpcn.2016.10001331.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Oleksiak, Beata, Barbara Ciecińska, Piotr Ołów, and Małgorzata Hordyńska. "Analysis of the Possibility of Introducing the Reduction of Changeover Time of Selected CNC Machines Using the SMED Method." Production Engineering Archives 29, no. 1 (February 15, 2023): 83–93. http://dx.doi.org/10.30657/pea.2023.29.10.

Full text

Abstract:

Abstract The paper presents the results of improving the production process using the SMED method. The process improvement was carried out in a company in the construction industry, using a machine park consisting of CNC machines. The study evaluated the current state of changeover times for selected CNC machines and proposed a reduction in changeover times for the machine park analysed. By introducing changes to the changeover process on selected CNC machines, it was possible to minimise the changeover time by more than 20% on all the machines analysed. The proposed reorganisation of the CNC operators’ workstations resulted in a time reduction of approximately 61% for machine 1, 52% for machine 2 and 12% for machine 3. The installation of barcode readers on the profiles, on the other hand, made it possible to load the machining programmes into the CNC machines more quickly and resulted in a reduction in loading time of approximately 88% on average for each of the machines analysed.

APA, Harvard, Vancouver, ISO, and other styles

17

Skrzypzcak, Jan, and Florian Schintke. "Towards Log-Less, Fine-Granular State Machine Replication." Datenbank-Spektrum 20, no. 3 (October 15, 2020): 231–41. http://dx.doi.org/10.1007/s13222-020-00358-4.

Full text

Abstract:

Abstract State machine replication is used to increase the availability of a service such as a data management system while ensuring consistent access to it. State-of-the-art implementations are based on a command log to gain linear write access to storage and avoid repeated transmissions of large replicas. However, the command log requires non-trivial state management such as allocation and pruning to prevent unbounded growth. By introducing in-place replicated state machines that do not use command logs, the log overhead can be avoided. Instead, replicas agree on a sequence of states, and former states are directly overwritten. This method enables the consistent, fault-tolerant replication of basic data management primitives such as counters, sets, or individual locks with little to no overhead. It matches the properties of fast, byte-addressable, non-volatile memory particularly well, where it is no longer necessary to rely on sequential access for good performance. Our approach is especially well suited for small states and fine-granular distributed data management as it occurs in key-value stores, for example.

APA, Harvard, Vancouver, ISO, and other styles

18

CHEN, JINFU, YANSHENG LU, and HUANHUAN WANG. "COMPONENT SECURITY TESTING APPROACH BASED ON EXTENDED CHEMICAL ABSTRACT MACHINE." International Journal of Software Engineering and Knowledge Engineering 22, no. 01 (February 2012): 59–83. http://dx.doi.org/10.1142/s0218194012500039.

Full text

Abstract:

Unreliable component security hinders the development of component technology. Component security testing is rarely researched with comprehensive focus; several approaches or technologies for detecting vulnerabilities in component security have been proposed, but most are infeasible. A testing approach for component security, which is based on the chemical abstract machine, is proposed for detecting explicit and implicit component security vulnerabilities. We develop an extended chemical abstract machine model, called eCHAM, and generate a state transfer tree and testing sequence for components based on the proposed model. The model can help test the explicit security exceptions of components according to the testing approach of interface fault injection. Condition and state mutation algorithms for identifying implicit security exceptions are also proposed. Vulnerability testing reports are obtained according to the test results. Experiments were conducted in an integration testing platform to verify the applicability of the proposed approach. Results show that the approach is effective and practicable. The proposed approach can detect explicit and implicit security exceptions of components.

APA, Harvard, Vancouver, ISO, and other styles

19

Kodada, Basappa B., and Demian Antony D’Mello. "Symmetric Key Cryptosystem based on Sequential State Machine." IOP Conference Series: Materials Science and Engineering 1187, no. 1 (September 1, 2021): 012026. http://dx.doi.org/10.1088/1757-899x/1187/1/012026.

Full text

Abstract:

Abstract Cryptography is a type of art that translate strings of plain text into strings of cipher text and is very important in sharing of secrete information in communication system. It is very essential to have cryptographic algorithms to provide high security by utilizing optimum computational resources during information sharing to achieve data confidentiality, privacy, integrity and other security services. The traditional conventional encryption algorithms (DES, AES) have high computational cost due to generating number of sub keys and bilinear concept. Hence this paper propose the sequential state machine (Mealy state Machine) based cryptosystem which is very light weight in nature and provide high security due to its weakly invertability concept with relatively smaller key size. The paper also presents the performance analysis on proposed algorithm and describes the security analysis on it.

APA, Harvard, Vancouver, ISO, and other styles

20

NAKANO, MASAHIRO, KAZUHIRO OGATA, MASAKI NAKAMURA, and KOKICHI FUTATSUGI. "CRÈME: AN AUTOMATIC INVARIANT PROVER OF BEHAVIORAL SPECIFICATIONS." International Journal of Software Engineering and Knowledge Engineering 17, no. 06 (December 2007): 783–804. http://dx.doi.org/10.1142/s0218194007003458.

Full text

Abstract:

We describe a method of automating invariant verification of behavioral specifications, which are algebraic specifications of abstract machines. The proposed method is based on fixed-point computation, which is one of the standard techniques for automatic (invariant) verification. The proposed method has some notable features. Among them are as follow: (1) the method finds and uses as lemmas state predicates whose invariant proofs may (even mutually) depend on other state predicates whose invariant proofs may not be completed, and (2) the method finds a counterexample showing that an abstract machine does not satisfy an invariant property if any, which does not need to make the (reachable) state space of the abstract machine finite. Crème is a tool based on the proposed method. We also report on two case studies in which (1) Crème proves fully automatically that the NSLPK authentication protocol satisfies the secrecy property and (2) Crème finds a counterexample showing that the NSPK authentication protocol does not satisfy the secrecy property.

APA, Harvard, Vancouver, ISO, and other styles

21

Ippel, Martin J., and Caroline J. M. Meulemans. "A Cybernetic Approach to Study the Learnability of the Logo Turtle World." Journal of Educational Computing Research 19, no. 2 (September 1998): 191–221. http://dx.doi.org/10.2190/gtyq-4v7t-jf82-4mng.

Full text

Abstract:

Research has demonstrated that children experience great difficulty in gaining mastery of the syntax and the semantic structure of the LOGO programming environment. The study presented in this article tests the hypothesis that simplification of the semantic structure will facilitate semantic understanding and acquisition of syntax knowledge within the LOGO Turtle World. Two microworlds were designed to carry out the same class of tasks using an identical set of basic commands, but comprising a different semantic structure. They were designed applying the theory of automata and abstract languages. The article demonstrates that different formal grammars can be formulated from one set of terminal symbols (i.e., basic commands of the LOGO Turtle World). Furthermore, it demonstrates how different finite-state machines correspond with these different grammars. In this study, two finite-state machines are defined: a one-state machine (ORTHO-1) and a four-state machine (ORTHO-4). Both machines can produce analogous rectangular figures in response to sequences of input symbols chosen from an identical input alphabet. Each of these abstract machines was physically realized as a computer-based microworld similar to the LOGO Turtle World. In an experiment with second and third grade children, it was found that the semantically simpler microworld (i.e., ORTHO-1) produced better semantic understanding as well as better mastery of the syntax of the input commands. The result occurred despite the fact that these microworlds used identical input commands.

APA, Harvard, Vancouver, ISO, and other styles

22

Žukauskaitė, Audronė. "SOCIALINIŲ INSTITUCIJŲ KRITIKA GILL ES’IO DELEUZE’O IR FELIXO GUATTARI FILOSOFIJOJE." Problemos 76 (January 1, 2009): 39–51. http://dx.doi.org/10.15388/problemos.2009.0.1944.

Full text

Abstract:

Straipsnyje analizuojama socialinių institucijų kritika, išplėtota Deleuze’o ir Guattari knygose Anti-Oidipas ir Tūkstantis plokštikalnių bei trumpame, bet reikšmingame Deleuze’o tekste „Prierašas apie kontrolės visuomenę“. Deleuze’as ir Guattari kuria mašininę visuomenės sampratą: jų teigimu, skirtingas socialines ir ekonomines formacijas įmanoma įsivaizduoti kaip virtualias mašinas, kurios gali aktualizuotis bet kuriuo istoriniu momentu. Analizuodami valstybės aparatą, Deleuze’as ir Guattari vengia nuorodų į konkrečias valstybes; veikiau jie kalba apie universalią valstybę-formą, kuri veikia kaip užgrobimo aparatas. Valstybė-forma suvokiama kaip suvienodinantis ir standartizuojantis principas, o karo mašina, priešingai, siekia sulaužyti sustingusias formas ir kurti inovacijas. Šie du agregatai – valstybės aparatas ir karo mašina – apibūdina ne tik valstybę ir jai besipriešinančias jėgas, bet persmelkia visas žmogaus veiklos sferas: mokslą, filosofiją, meną. Deleuze’o ir Guattari formuluojama valstybės aparato kritika artima Michelio Foucault disciplinos visuomenės teorijai. Foucault galios samprata taip pat yra mechanicistinė: galia persmelkia sociumą įsikūnydama disciplininiuose aparatuose. Deleuze’as disciplinos visuomenės teorijai priešpriešina savąją kontrolės visuomenės sampratą: priešingai nei disciplininė galia, kuri buvo ilgalaikė, visa apimanti, tačiau netolydi, kontrolė sukuria tolydų ir nuolat kintantį galios tinklą, kuris apraizgo visas žmogaus veiklos sferas.Pagrindiniai žodžiai: socialinės mašinos, valstybės aparatas, karo mašina, disciplinos visuomenė, kontrolės visuomenė.Critique of Social Institutions in Gilles Deleuze’s and Felix Guattari’s PhilosophyAudronė Žukauskaitė SummaryThe article discusses Deleuze’s and Guattari’s notions of society and state. In Anti-Oedipus, Deleuze and Guattari analyze the territorial, despotic and capitalist machines which are seen not as different stages of historical evolution but as different types of an abstract machine. In A Thousand Plateaus Deleuze and Guattari develop the mechanistic notion of the state: the state – form is an abstract machine or a diagram which can be actualized in different historical state forms. The state – form is juxtaposed to another type of assemblage called the nomadic war machine. If the state-form functions as a principle of unification and standardization, the war machine is seen as a principle of metamorphic transformations and innovations. Deleuze and Guattari’s theories of society and state are compared with Michel Foucault’s mechanistic notion of society. Deleuze contrasts his notion of control society to the notion of discipline society by Foucault. If the mechanisms of discipline are discontinuous and function in precise space areas, the mechanisms of control produce continuous and all-encompassing networks which totally merge with our corporeal existence.Keywords: social machines, state apparatus, war machine, discipline society, control society.

APA, Harvard, Vancouver, ISO, and other styles

23

Gogoi, Mr Rupak Kumar. "A Software System for A Finite State Machine (FSM)." International Journal for Research in Applied Science and Engineering Technology 10, no. 7 (July 31, 2022): 795–806. http://dx.doi.org/10.22214/ijraset.2022.44711.

Full text

Abstract:

Abstract: A finite-state machine (FSM) is a computational mathematical model. For design and analysis, circuits and system operations can be represented in a variety of ways. FSM is one of the methods for using a drawing to represent the operations of many circuits and systems in electronic engineering, computer engineering, and so on. In terms of design, the finite state machine is a very simple machine. It is made up of a set of input symbols, output symbols, and states that must be designed. Furthermore, a function of input and output symbols with the current state to give the next state must be present. To simulate the Finite State machine, a software simulator is implemented in this paper using the Visual Basic programming language (in terms of design and operation).Several general examples are represented in this model. However, the software can be used to teach students about FSM and how it works.

APA, Harvard, Vancouver, ISO, and other styles

24

Kaplon, A., G. Utrata, and J. Rolek. "Estimators of induction motor electromechanical quantities built on the basis of a machine secondary multi-loop equivalent circuit." Archives of Electrical Engineering 63, no. 2 (June 1, 2014): 149–60. http://dx.doi.org/10.2478/aee-2014-0012.

Full text

Abstract:

Abstract Contemporary sensorless AC drives require the use of electromechanical quantities estimation. The skin effect occurring in AC machines with solid secondary or with solid secondary elements causes machines of this type to be represented by equivalent circuits containing distributed elements, which makes the analysis of machine electrodynamic states more complicated and hinders the construction of relatively simple and effective estimators of electromechanical quantities. The variability of rotor parameters is modelled, with a good approximation, by the machine secondary multi-loop equivalent circuit with lumped elements. In this paper the construction procedure of electromechanical state variable estimators basing on this type of equivalent circuit will be presented. The simulation investigations of the created electromechanical quantities estimators, performed for the selected states of solid iron rotor AC machine operation will be shown as well.

APA, Harvard, Vancouver, ISO, and other styles

25

Ainuddin, Urooj, and Maria Waqas. "Finite state machine and Markovian equivalents of the lac Operon in E. coli bacterium." AIMS Bioengineering 9, no. 4 (2022): 400–419. http://dx.doi.org/10.3934/bioeng.2022029.

Full text

Abstract:

<abstract> The <italic>lac</italic> operon in <italic>E. coli</italic> has been extensively studied by computational biologists. The bacterium uses it to survive in the absence of glucose, utilizing lactose for growth. This paper presents a novel modeling mechanism for the <italic>lac</italic> operon, transferring the process of lactose metabolism from the cell to a finite state machine (FSM). This FSM is implemented in field-programmable gate array (FPGA) and simulations are run in random conditions. A Markov chain is also proposed for the <italic>lac</italic> operon, which helps study its behavior in terms of probabilistic variables, validating the finite state machine at the same time. This work is focused towards conversion of biological processes into computing machines. </abstract>

APA, Harvard, Vancouver, ISO, and other styles

26

Castilho, Sheila, Joss Moorkens, Federico Gaspari, Iacer Calixto, John Tinsley, and Andy Way. "Is Neural Machine Translation the New State of the Art?" Prague Bulletin of Mathematical Linguistics 108, no. 1 (June 1, 2017): 109–20. http://dx.doi.org/10.1515/pralin-2017-0013.

Full text

Abstract:

Abstract This paper discusses neural machine translation (NMT), a new paradigm in the MT field, comparing the quality of NMT systems with statistical MT by describing three studies using automatic and human evaluation methods. Automatic evaluation results presented for NMT are very promising, however human evaluations show mixed results. We report increases in fluency but inconsistent results for adequacy and post-editing effort. NMT undoubtedly represents a step forward for the MT field, but one that the community should be careful not to oversell.

APA, Harvard, Vancouver, ISO, and other styles

27

Wu, Tianyi, Xiangyi Xu, Lu Chen, and Weijie Tang. "Transformer evaluation strategy based on improved machine learning." Journal of Physics: Conference Series 2221, no. 1 (May 1, 2022): 012019. http://dx.doi.org/10.1088/1742-6596/2221/1/012019.

Full text

Abstract:

Abstract A transformer state assessment method based on an improved extreme learning machine is proposed in this paper, which introduces an adaptive evolution algorithm into the extreme learning machine. This method is used in the evaluation model to evaluate the state of the transformer. The algorithm is trained and tested through sample sets. Furthermore, the test results are analyzed to prove the feasibility of the proposed control strategy.

APA, Harvard, Vancouver, ISO, and other styles

28

Mehdipour Ataee, Shahin, and Zeki Bayram. "An Improved Abstract State Machine Based Choreography Specification and Execution Algorithm for Semantic Web Services." Scientific Programming 2018 (2018): 1–20. http://dx.doi.org/10.1155/2018/4094951.

Full text

Abstract:

We identify significant weaknesses in the original Abstract State Machine (ASM) based choreography algorithm of Web Service Modeling Ontology (WSMO), which make it impractical for use in semantic web service choreography engines. We present an improved algorithm which rectifies the weaknesses of the original algorithm, as well as a practical, fully functional choreography engine implementation in Flora-2 based on the improved algorithm. Our improvements to the choreography algorithm include (i) the linking of the initial state of the ASM to the precondition of the goal, (ii) the introduction of the concept of a final state in the execution of the ASM and its linking to the postcondition of the goal, and (iii) modification to the execution of the ASM so that it stops when the final state condition is satisfied by the current configuration of the machine. Our choreography engine takes as input semantic web service specifications written in the Flora-2 dialect of F-logic. Furthermore, we prove the equivalence of ASMs (evolving algebras) and evolving ontologies in the sense that one can simulate the other, a first in literature. Finally, we present a visual editor which facilitates the design and deployment of our F-logic based web service and goal specifications.

APA, Harvard, Vancouver, ISO, and other styles

29

Ighomereho, Salome, Patrick Ladipo, and Bolajoko Dixon-Ogbechi. "Determinants of Automated Teller Machine Usage in Lagos State, Nigeria." Acta Universitatis Sapientiae, Economics and Business 6, no. 1 (December 1, 2018): 89–111. http://dx.doi.org/10.1515/eb-2018-0005.

Full text

Abstract:

Abstract Research has shown that ATMs provide an extremely useful service to customers but the machine is characterized by several service quality inadequacies, and at times it can be very frustrating to use. Consequently, this study investigated socio-demographic factors and service quality dimensions as determinants of ATM usage in Lagos State, Nigeria. A questionnaire was used to collect data from bank customers who use ATM and the data were analysed using General Linear Model (GLM) and multiple regression. The results from the analyses reveal that socio-demographic factors, such as age, education, and income, influence ATM usage, while gender and occupation do not influence ATM usage. The study also revealed that all the service quality dimensions identified in the study have a significant positive influence on ATM usage. When the joint effect of socio-demographic factors and service quality dimensions on ATM usage was assessed, it was found that service quality had a greater influence on ATM usage than socio-demographic factors.

APA, Harvard, Vancouver, ISO, and other styles

30

Schwab, Brian. "Implementation Walkthrough of a Homegrown “Abstract State Machine” Style System in a Commercial Sports Game." Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment 4, no. 1 (September 27, 2021): 145–48. http://dx.doi.org/10.1609/aiide.v4i1.18687.

Full text

Abstract:

When I began working at Sony Computer Entertainment of America in 2002, the AI system they were using was very dated. Over the next few years, I designed and developed an almost completely data driven system that has proven to be very powerful, extremely extensible, and designer friendly. This system uses a homegrown data structure, the use of which in many ways resembles the software method of using Abstract State Machines for decomposing complex logical constructs iteratively. This paper will provide an overview of the construction and usage of the system, as well as the pros and cons of this type of game AI engine.

APA, Harvard, Vancouver, ISO, and other styles

31

Ouimet, Martin, and Kristina Lundqvist. "Automated Verification of Completeness and Consistency of Abstract State Machine Specifications using a SAT Solver." Electronic Notes in Theoretical Computer Science 190, no. 2 (August 2007): 85–97. http://dx.doi.org/10.1016/j.entcs.2007.08.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Coglianese, Cary. "Administrative Law in the Automated State." Daedalus 150, no. 3 (2021): 104–20. http://dx.doi.org/10.1162/daed_a_01862.

Full text

Abstract:

Abstract In the future, administrative agencies will rely increasingly on digital automation powered by machine learning algorithms. Can U.S. administrative law accommodate such a future? Not only might a highly automated state readily meet long-standing administrative law principles, but the responsible use of machine learning algorithms might perform even better than the status quo in terms of fulfilling administrative law's core values of expert decision-making and democratic accountability. Algorithmic governance clearly promises more accurate, data-driven decisions. Moreover, due to their mathematical properties, algorithms might well prove to be more faithful agents of democratic institutions. Yet even if an automated state were smarter and more accountable, it might risk being less empathic. Although the degree of empathy in existing human-driven bureaucracies should not be overstated, a large-scale shift to government by algorithm will pose a new challenge for administrative law: ensuring that an automated state is also an empathic one.

APA, Harvard, Vancouver, ISO, and other styles

33

Paulweber, Philipp, Georg Simhandl, and Uwe Zdun. "On the Understandability of Language Constructs to Structure the State and Behavior in Abstract State Machine Specifications: A Controlled Experiment." Journal of Systems and Software 178 (August 2021): 110987. http://dx.doi.org/10.1016/j.jss.2021.110987.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Siami, Mohsen, S. Asghar Gholamian, and Mosayeb Yousefi. "A Comparative Study Between Direct Torque Control and Predictive Torque Control for Axial Flux Permanent Magnet Synchronous Machines." Journal of Electrical Engineering 64, no. 6 (November 1, 2013): 346–53. http://dx.doi.org/10.2478/jee-2013-0052.

Full text

Abstract:

Abstract This paper presents a comparative study between direct torque control (DTC) and predictive torque control (PTC) of Axial Flux Permanent magnet Machines (AFPM). In conventional DTC method for permanent magnet machines, only six actives voltage vectors of inverter are used to control torque and flux of machine. But in predictive torque control, in addition to six active voltage vectors, zero voltage vectors are used to control machine. So number of voltage vectors to control AFPM increases that leads to lower ripple of torque and flux. In predictive torque control, the response of torque and flux are computed for all possible switching states of inverter at every sample time according to discrete time model of machine, and then the switching state that optimizes ripple of torque and flux, will be applied in next discrete-time interval. Simulation results which compare the results of implementation of both methods and confirm the good performance of the proposed predictive torque control are presented.

APA, Harvard, Vancouver, ISO, and other styles

35

Netanyahu, Aviv, Tianmin Shu, Boris Katz, Andrei Barbu, and Joshua B. Tenenbaum. "PHASE: PHysically-grounded Abstract Social Events for Machine Social Perception." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 1 (May 18, 2021): 845–53. http://dx.doi.org/10.1609/aaai.v35i1.16167.

Full text

Abstract:

The ability to perceive and reason about social interactions in the context of physical environments is core to human social intelligence and human-machine cooperation. However, no prior dataset or benchmark has systematically evaluated physically grounded perception of complex social interactions that go beyond short actions, such as high-fiving, or simple group activities, such as gathering. In this work, we create a dataset of physically-grounded abstract social events, PHASE, that resemble a wide range of real-life social interactions by including social concepts such as helping another agent. PHASE consists of 2D animations of pairs of agents moving in a continuous space generated procedurally using a physics engine and a hierarchical planner. Agents have a limited field of view, and can interact with multiple objects, in an environment that has multiple landmarks and obstacles. Using PHASE, we design a social recognition task and a social prediction task. PHASE is validated with human experiments demonstrating that humans perceive rich interactions in the social events, and that the simulated agents behave similarly to humans. As a baseline model, we introduce a Bayesian inverse planning approach, SIMPLE (SIMulation, Planning and Local Estimation), which outperforms state-of-the-art feed-forward neural networks. We hope that PHASE can serve as a difficult new challenge for developing new models that can recognize complex social interactions.

APA, Harvard, Vancouver, ISO, and other styles

36

Dudzńiski, Damian, Tomasz Kryjak, and Zbigniew Mikrut. "Human action recognition using simple geometric features and a finite state machine." Image Processing & Communications 18, no. 2-3 (December 1, 2013): 49–60. http://dx.doi.org/10.2478/v10248-012-0079-y.

Full text

Abstract:

Abstract In this paper a human action recognition algorithm, which uses background generation with shadow elimination, silhouette description based on simple geometrical features and a finite state machine for recognizing particular actions is described. The performed tests indicate that this approach obtains a 81 % correct recognition rate allowing real-time image processing of a 360 X 288 video stream.

APA, Harvard, Vancouver, ISO, and other styles

37

Ramchandani, Monica, Hrishikesh Khandare, Priyanshi Singh, Prince Rajak, Nidhi Suryawanshi, Anjali Sagar Jangde, Laxmi Arya, Prithviraj Kumar, and Mridu Sahu. "Survey: Tensorflow in Machine Learning." Journal of Physics: Conference Series 2273, no. 1 (May 1, 2022): 012008. http://dx.doi.org/10.1088/1742-6596/2273/1/012008.

Full text

Abstract:

Abstract TensorFlow(TF) is a large-scale ML system that can be used in many different situations. Data-flow graphs are used by TF to define operations, shared state, and computations that change that state. It distributes the nodes of a Data-flow graph across multiple machines in a cluster, as well as diverse processing units within a single system, such as multicore CPUs, general-purpose GPUs and Tensor Processing Units, which are custom-designed ASICs (TPUs). Developers may use TF to try out new training techniques and optimizations. It covers a broad applications range, which focus on inference and DNN training. It is utilised in production by several Google services, and it has since been released as an open-source project and is broadly used in ML research. We review TensorFlow and place it in the context of modern deep learning techniques and technologies in this paper. We go over the fundamental computational concepts and how they work. The distributed execution concept, as well as its programming interface as accompanying visualisation toolkit. The remainder of this paper will provide a comprehensive overview of TensorFlow and place it in the context of machine learning today

APA, Harvard, Vancouver, ISO, and other styles

38

Ramchandani, Monica, Hrishikesh Khandare, Priyanshi Singh, Prince Rajak, Nidhi Suryawanshi, Anjali Sagar Jangde, Laxmi Arya, Prithviraj Kumar, and Mridu Sahu. "Survey: Tensorflow in Machine Learning." Journal of Physics: Conference Series 2273, no. 1 (May 1, 2022): 012008. http://dx.doi.org/10.1088/1742-6596/2273/1/012008.

Full text

Abstract:

Abstract TensorFlow(TF) is a large-scale ML system that can be used in many different situations. Data-flow graphs are used by TF to define operations, shared state, and computations that change that state. It distributes the nodes of a Data-flow graph across multiple machines in a cluster, as well as diverse processing units within a single system, such as multicore CPUs, general-purpose GPUs and Tensor Processing Units, which are custom-designed ASICs (TPUs). Developers may use TF to try out new training techniques and optimizations. It covers a broad applications range, which focus on inference and DNN training. It is utilised in production by several Google services, and it has since been released as an open-source project and is broadly used in ML research. We review TensorFlow and place it in the context of modern deep learning techniques and technologies in this paper. We go over the fundamental computational concepts and how they work. The distributed execution concept, as well as its programming interface as accompanying visualisation toolkit. The remainder of this paper will provide a comprehensive overview of TensorFlow and place it in the context of machine learning today

APA, Harvard, Vancouver, ISO, and other styles

39

Hlavičková, Irena. "An application of Markov chains in digital communication." Tatra Mountains Mathematical Publications 63, no. 1 (June 1, 2015): 129–37. http://dx.doi.org/10.1515/tmmp-2015-0025.

Full text

Abstract:

Abstract This contribution shows an application of Markov chains in digital communication. A random sequence of the symbols 0 and 1 is analyzed by a state machine. The state machine switches to state “0” after detecting an unbroken sequence of w zero symbols (w being a fixed integer), and to state “1” after detecting an unbroken sequence of w ones. The task to find the probabilities of each of these two states after n time steps leads to a Markov chain. We show the construction of the transition matrix and determine the steady-state probabilities for the time-homogeneous case.

APA, Harvard, Vancouver, ISO, and other styles

40

Noveck, Beth Simone. "The Innovative State." Daedalus 150, no. 3 (2021): 121–42. http://dx.doi.org/10.1162/daed_a_01863.

Full text

Abstract:

Abstract To create government that is neither bigger nor smaller but better at solving problems more effectively and legitimately, agencies need to use big data and the associated technologies of machine learning and predictive analytics. Such data-analytical approaches will help agencies understand the problems they are addressing more empirically and devise more responsive policies and services. Such data-processing tools can also be used to make citizen engagement more efficient, helping agencies to make sense of large quantities of information and invite meaningful participation from more diverse audiences who have never participated in our democracy. To take advantage of the power of new technologies for governing, however, the federal government needs, first and foremost, to invest in training public servants to work differently and prepare them for the future of work in a new technological age.

APA, Harvard, Vancouver, ISO, and other styles

41

Guo, Zhiyuan. "The Principle and State-of-Art Facilities for PET." Journal of Physics: Conference Series 2386, no. 1 (December 1, 2022): 012062. http://dx.doi.org/10.1088/1742-6596/2386/1/012062.

Full text

Abstract:

Abstract Since the late 20th century, Positron Emission Tomography (PET) scanners and their hybrid scanners (PET/CT and PET/MRI) offer a path to detect cancer. In this research, the PET scan will be introduced and discussed in multiple dimensions, mainly to explain the principle of PET scan, the state-of-art of PET scans, and the future of PET scans. According to the analysis, from the time that the PET scanner is invented, it not only had a better image quality but also had more functions. It is believed that an intelligent non-radioactive scanner will be achieved in the future due to the development of MRI and artificial intelligence. The main reason for conducting this research is to understand the mechanisms of PET as well as investigate the way to improve the technology itself to avoid the limitations it poses. Overall, these results shed light on guiding further exploration of the next generation of PET scans (e.g., Hybrid PET machines and machine learning).

APA, Harvard, Vancouver, ISO, and other styles

42

Hillenbrand, J., J. Detroy, and J. Fleischer. "Investigation of defects in roll contacts of machine elements with Acoustic Emission and Unsupervised Machine Learning." IOP Conference Series: Materials Science and Engineering 1193, no. 1 (October 1, 2021): 012085. http://dx.doi.org/10.1088/1757-899x/1193/1/012085.

Full text

Abstract:

Abstract In the age of Industry 4.0 and IIoT machines are becoming increasingly connected enabling continuous monitoring. A variety of information from machines and installed sensors is used to develop condition monitoring solutions. These systems are used to prevent premature failures and the follow-up costs due to machine downtime associated with them. Recent research in this area applies supervised machine learning, extracting features from captured signals and training classifiers. Supervised learning approaches require large amounts of labeled data, whose generation is time consuming and requires domain knowledge. For this reason, an unsupervised learning approach is being used in this work to distinguish between different defect and operation states of axial ball bearings. Within the scope of this work, acoustic emission (AE) measurements in the ultrasonic range are recorded and evaluated. Artificial defects are seeded in the rolling contact of axial bearings. From the AE signals a selection of state-of-the-art features is extracted. Then, the Laplacian Score, an unsupervised filter algorithm, is used to select the most significant features. Subsequently, the DBSCAN clustering algorithm is used to draw conclusions about the existing damage.

APA, Harvard, Vancouver, ISO, and other styles

43

Hernawan, A., AL Sunarwidhi, ES Prasedya, and S. Widyastuti. "A generalization SPARQL federated query: An initial step towards machine-readable web of data for halal food products." IOP Conference Series: Earth and Environmental Science 913, no. 1 (November 1, 2021): 012040. http://dx.doi.org/10.1088/1755-1315/913/1/012040.

Full text

Abstract:

Abstract The evolution of webs from web of documents to a web of data allows machines to read and connect structured data on the Web, known as Linked Data. This enables machine learning to use linked data in ways that were previously thought to be impossible to do. Machine learning and linked data research are relatively thoughtless. As a result, the primary goal of this research is to present ARQL, an extension of SPARQL 1.1 and to cluster Linked Data derived from online web sources. We provide state of the art ARQL features to allow machine to directly query from online RDF, JSON-LD or JSON API. Here we describe how ARQL web service is used to query Web of Data development and generalization of SPARQL federated query, two initial steps for the development of halal food mobile application tied up with ARQL.

APA, Harvard, Vancouver, ISO, and other styles

44

Korutcheva, Elka, Kostadin Korutchev, Silvia N. Santalla, Javier Rodríguez-Laguna, and Hassan Chamati. "The Restricted Boltzmann Machine Ansatz through Adiabiatic Routes." Journal of Physics: Conference Series 2436, no. 1 (January 1, 2023): 012001. http://dx.doi.org/10.1088/1742-6596/2436/1/012001.

Full text

Abstract:

Abstract We discuss the expressive power of the quantum restricted Boltzmann machine Ansatz in order to represent faithfully the operation process of a quantum spin-glass system undergoing an adiabatic quantum computation process. We address both the representability and the trainability problems associated to the restricted Boltzmann machine Ansatz when we try to describe the ground state of a quantum Ising spin-glass in a transverse field. In our approach, we obtain the ground state of the system using exact diagonalization and find the optimal restricted Boltzman machine. Our preliminary results show that due to the complex spin-glass landscape, for some topologies of the restricted Bolztmann machine, the parameters of the representation are hard to be found.

APA, Harvard, Vancouver, ISO, and other styles

45

CURIEN, PIERRE-LOUIS. "Abstract Böhm trees." Mathematical Structures in Computer Science 8, no. 6 (December 1998): 559–91. http://dx.doi.org/10.1017/s0960129598002631.

Full text

Abstract:

We present a formalism of trees with pointers, called abstract Böhm trees, that provide a suitable abstract framework in which various cut-free proofs or normal terms of several λ-calculus based languages (including PCF and Parigot's λμ-calculus) can be faithfully encoded. A simple abstract machine called the View Abstract Machine (VAM) allows us to compute over abstract Böhm trees. The VAM is closely related to Coquand's interaction sequences and debates. The VAM execution over finite abstract Böhm trees always terminates. We next introduce an abstract notion of type that fits the purpose of guaranteeing that the VAM cannot go into deadlock, i.e., that it always reaches a satisfactory final state. Typed abstract Böhm trees can be turned into a category – more naturally a ‘multi-category’ where the domains of arrows are sets of named objects or records. We then go from the abstract to the concrete by giving examples. Our sets of abstract (typed) Böhm trees are relative to an alphabet and a set of types. By instantiating these two parameter sets appropriately, we recover, successively: (η-long) typed Böhm trees; PCF trees as considered in the game models of Hyland–Ong or of Abramsky–Jagadeesan–Malacaria; a notion of classical Böhm tree due to Herbelin that provides a classical version of PCF trees in the style of λμ-calculus; and, finally, cut-free proofs in Novikov's infinitary propositional logic as investigated by Coquand. In a companion paper, we investigate the operational aspects of (untyped) Böhm trees in more depth.

APA, Harvard, Vancouver, ISO, and other styles

46

Robyanto, Deny, Ade Priyatna Priyatna, Eni Heni Hermaliani, Frieyadie Frieyadie, and Windu Gata. "IMPLEMENTASI DETERMINISTIC FINITE AUTOMATA (DFA) PADA PERANCANGAN APLIKASI PERHITUNGAN UANG HARIAN PERJALANAN DINAS KEMENTERIAN." JURNAL ILMIAH INFORMATIKA 9, no. 02 (September 2, 2021): 100–104. http://dx.doi.org/10.33884/jif.v9i02.3770.

Full text

Abstract:

Each ministry always has a budget for official travel, especially for the daily money given to personnel who travel in exchange for daily expenses. With the current pendemi need to be held an application system that can reduce contact when handling official travel files. The design of this application will use the implementation of Deterministic Finite Automata (DFA) as an abstract machine to determine the state or stages to determine the transition between these stages to determine the daily money calculation of official travel. From the calculation of daily money will be made recapitulation to be verified and if it is considered appropriate and correct will be transferred to the account that travels to the office. This is the role in making abstract machines for the calculation of daily money using Deterministic Finite Automata (DFA) because each stage is right to one stage next until the last stage that prints proof of transfer.

APA, Harvard, Vancouver, ISO, and other styles

47

Jansen, Cees J. A. "On the calculation of the linear equivalence bias of jump controlled linear finite state machines." Tatra Mountains Mathematical Publications 45, no. 1 (December 1, 2010): 51–63. http://dx.doi.org/10.2478/v10127-010-0005-x.

Full text

Abstract:

ABSTRACT Jump controlled linear finite state machines were introduced several years ago as building blocks for stream ciphers that can efficiently be implemented in hardware and have intrinsically good side channel resistance. These constructions have found their way in concrete stream cipher designs. The bias in the distribution of linear relations of low degree in the key stream is important for the cryptographic strength of these stream ciphers. Recently, an algorithm was presented by the author to determine this bias. In this paper a new algorithm is introduced, that makes use of the properties of jump registers and has sub exponential order in the degree of the characteristic polynomial of the linear finite state machine.

APA, Harvard, Vancouver, ISO, and other styles

48

Xu, Jin Ling, Jie Ma, Xiao Li Xu, and Shao Hong Wang. "State Prediction of Huge Gas Turbine Machine Based on Multi-Level Recursive Method and Experimental Study." Applied Mechanics and Materials 20-23 (January 2010): 414–20. http://dx.doi.org/10.4028/www.scientific.net/amm.20-23.414.

Full text

Abstract:

Gas turbine machine,Multi-level recursive,Prediction,Experimental study Abstract. Take the huge gas turbine set of Beijing Yanshan Petrochemical Refinery as the research object. The most important feature of machine is the vibration characteristic,and vibration displacement is the most important parameter of the machine,based on the historical vibration displacement datas,use multi-level recursive method to predict the state of the machine.With this method,fault prediction is divided into two parts:forecast of time-varying parameters and forecast based on the former forecast,the prediction precision is improved. Through the analysis of gas turbine failure mechanism,use Bently rotor bench,effectively simulate the mechanical failure of the rotor imbalance.

APA, Harvard, Vancouver, ISO, and other styles

49

Szymański, Zygmunt. "Intelligent, Energy Saving Power Supply and Control System of Hoisting Mine Machine with Compact and Hybrid Drive System / Inteligentne, Energooszczędne Układy Zasilania I Sterowania Górniczych Maszyn Wyciągowych Z Napędem Zintegrowanym Lub Hybrydowym." Archives of Mining Sciences 60, no. 1 (March 1, 2015): 239–51. http://dx.doi.org/10.1515/amsc-2015-0016.

Full text

Abstract:

Abstract In the paper present’s an analysis of suitableness an application of compact and hybrid drive system in hoisting machine. In the paper presented the review of constructional solutions of hoisting machines drive system, driving with AC and DC motor. In the paper presented conception of modern, energy sparing hoisting machine supply system, composed with compact motor, an supplied with transistor or thyristor converter supply system, and intelligent control system composed with multilevel microprocessor controller. In the paper present’s also analysis of suitableness application an selected method of artificial intelligent in hoisting machine control system, automation system, and modern diagnostic system. In the paper one limited to analysis of: fuzzy logic method, genetic algorithms method, and modern neural net II and III generation. That method enables realization of complex control algorithms of hosting machine with insurance of energy sparing exploitation conditions, monitoring of exploitation parameters, and prediction diagnostic of hoisting machine technical state, minimization a number of failure states. In the paper present’s a conception of control and diagnostic system of the hoisting machine based on fuzzy logic neural set control. In the chapter presented also a selected control algorithms and results of computer simulations realized for particular mathematical models of hoisting machine. Results of theoretical investigation were partly verified in laboratory and industrial experiments.

APA, Harvard, Vancouver, ISO, and other styles

50

Paulweber, Philipp, Georg Simhandl, and Uwe Zdun. "Specifying with Interface and Trait Abstractions in Abstract State Machines: A Controlled Experiment." ACM Transactions on Software Engineering and Methodology 30, no. 4 (July 2021): 1–29. http://dx.doi.org/10.1145/3450968.

Full text

Abstract:

Abstract State Machine (ASM) theory is a well-known state-based formal method. As in other state-based formal methods, the proposed specification languages for ASMs still lack easy-to-comprehend abstractions to express structural and behavioral aspects of specifications. Our goal is to investigate object-oriented abstractions such as interfaces and traits for ASM-based specification languages. We report on a controlled experiment with 98 participants to study the specification efficiency and effectiveness in which participants needed to comprehend an informal specification as problem (stimulus) in form of a textual description and express a corresponding solution in form of a textual ASM specification using either interface or trait syntax extensions. The study was carried out with a completely randomized design and one alternative (interface or trait) per experimental group. The results indicate that specification effectiveness of the traits experiment group shows a better performance compared to the interfaces experiment group, but specification efficiency shows no statistically significant differences. To the best of our knowledge, this is the first empirical study studying the specification effectiveness and efficiency of object-oriented abstractions in the context of formal methods.

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Abstract State Machine'

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