Статті в журналах: "Machines de Mealy"

1

Mordeson, J. N., and P. S. Nair. "Fuzzy Mealy machines." Kybernetes 25, no. 3 (April 1996): 18–33. http://dx.doi.org/10.1108/03684929610116392.

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

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

2

Amato, Christopher, Blai Bonet, and Shlomo Zilberstein. "Finite-State Controllers Based on Mealy Machines for Centralized and Decentralized POMDPs." Proceedings of the AAAI Conference on Artificial Intelligence 24, no. 1 (July 4, 2010): 1052–58. http://dx.doi.org/10.1609/aaai.v24i1.7748.

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

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

Анотація:

Existing controller-based approaches for centralized and decentralized POMDPs are based on automata with output known as Moore machines. In this paper, we show that several advantages can be gained by utilizing another type of automata, the Mealy machine. Mealy machines are more powerful than Moore machines, provide a richer structure that can be exploited by solution methods, and can be easily incorporated into current controller-based approaches. To demonstrate this, we adapted some existing controller-based algorithms to use Mealy machines and obtained results on a set of benchmark domains. The Mealy-based approach always outperformed the Moore-based approach and often outperformed the state-of-the-art algorithms for both centralized and decentralized POMDPs. These findings provide fresh and general insights for the improvement of existing algorithms and the development of new ones.

3

Tiňo, Peter, and Jozef Šajda. "Learning and Extracting Initial Mealy Automata with a Modular Neural Network Model." Neural Computation 7, no. 4 (July 1995): 822–44. http://dx.doi.org/10.1162/neco.1995.7.4.822.

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

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

Анотація:

A hybrid recurrent neural network is shown to learn small initial mealy machines (that can be thought of as translation machines translating input strings to corresponding output strings, as opposed to recognition automata that classify strings as either grammatical or nongrammatical) from positive training samples. A well-trained neural net is then presented once again with the training set and a Kohonen self-organizing map with the “star” topology of neurons is used to quantize recurrent network state space into distinct regions representing corresponding states of a mealy machine being learned. This enables us to extract the learned mealy machine from the trained recurrent network. One neural network (Kohonen self-organizing map) is used to extract meaningful information from another network (recurrent neural network).

4

MORDESON, J. N., and P. S. NAIR. "FUZZY MEALY MACHINES: HOMOMORPHISMS, ADMISSIBLE RELATIONS AND MINIMAL MACHINES." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 04, no. 01 (February 1996): 27–43. http://dx.doi.org/10.1142/s0218488596000032.

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

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

Анотація:

Homomorphisms and admissible relations of fuzzy Mealy machines are studied. Admissible relations play a role similar to normal subgroups in group theory. The kernel of a homomorphism is shown to be an admissible relation. Conversely, corresponding to an admissible relation, there exists a homomorphism. The fundamental theorem on homomorphisms; and the existence and uniqueness of minimal machines are also presented.

5

Bukowiec, Arkadiusz, and Luis Gomes. "Partitioning of Mealy Finite State Machines." IFAC Proceedings Volumes 42, no. 21 (2009): 19–24. http://dx.doi.org/10.3182/20091006-3-es-4010.00006.

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

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

6

A.Morye, S., and S. R. Chaudhari. "On Properties of Fuzzy Mealy Machines." International Journal of Computer Applications 63, no. 19 (February 15, 2013): 1–8. http://dx.doi.org/10.5120/10571-5615.

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

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

7

Hansen, Helle Hvid, David Costa, and Jan Rutten. "Synthesis of Mealy Machines Using Derivatives." Electronic Notes in Theoretical Computer Science 164, no. 1 (October 2006): 27–45. http://dx.doi.org/10.1016/j.entcs.2006.06.003.

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

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

8

Jim, Kam-Chuen, and C. Lee Giles. "Talking Helps: Evolving Communicating Agents for the Predator-Prey Pursuit Problem." Artificial Life 6, no. 3 (July 2000): 237–54. http://dx.doi.org/10.1162/106454600568861.

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

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

Анотація:

We analyze a general model of multi-agent communication in which all agents communicate simultaneously to a message board. A genetic algorithm is used to evolve multi-agent languages for the predator agents in a version of the predator-prey pursuit problem. We show that the resulting behavior of the communicating multi-agent system is equivalent to that of a Mealy finite state machine whose states are determined by the agents' usage of the evolved language. Simulations show that the evolution of a communication language improves the performance of the predators. Increasing the language size (and thus increasing the number of possible states in the Mealy machine) improves the performance even further. Furthermore, the evolved communicating predators perform significantly better than all previous work on similar prey. We introduce a method for incrementally increasing the language size, which results in an effective coarse-to-fine search that significantly reduces the evolution time required to find a solution. We present some observations on the effects of language size, experimental setup, and prey difficulty on the evolved Mealy machines. In particular, we observe that the start state is often revisited, and incrementally increasing the language size results in smaller Mealy machines. Finally, a simple rule is derived that provides a pessimistic estimate on the minimum language size that should be used for any multi-agent problem.

9

Chibnik, Mara. "Algorithmic elimination of spurious nondeterminism from Mealy machines." ACM SIGACT News 17, no. 3 (January 1986): 30–34. http://dx.doi.org/10.1145/382254.382804.

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

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

10

Liu, Jun, Zhi-wen Mo, Dong Qiu, and Yang Wang. "Products of Mealy-type fuzzy finite state machines." Fuzzy Sets and Systems 160, no. 16 (August 2009): 2401–15. http://dx.doi.org/10.1016/j.fss.2009.01.001.

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

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

11

Andriani, Tuti, and Pristiwanto. "Transducer Function In Vending Machine Simulation Design." Instal : Jurnal Komputer 11, no. 01 (February 6, 2019): 26–34. http://dx.doi.org/10.54209/jurnalkomputer.v11i01.5.

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

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

Анотація:

A vending machine is a substitute for a cashier or admin in the form of a machine so that buyers simply enter coins and the machine will issue them according to the request. Moore machine and mealy machines as a process for processing buyer orders which are translated into machine orders. Based on the test results of coins entered 1000 and 500, the drink can be chosen according to the price of the drink.

12

Caldwell, Ben, Rachel Cardell-Oliver, and Tim French. "Learning Time Delay Mealy Machines From Programmable Logic Controllers." IEEE Transactions on Automation Science and Engineering 13, no. 2 (April 2016): 1155–64. http://dx.doi.org/10.1109/tase.2015.2496242.

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

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

13

Broy, Manfred. "Verifying of interface assertions for infinite state Mealy machines." Journal of Computer and System Sciences 80, no. 7 (November 2014): 1298–322. http://dx.doi.org/10.1016/j.jcss.2014.03.002.

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

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

14

Li, Yongming, and Witold Pedrycz. "The equivalence between fuzzy Mealy and fuzzy Moore machines." Soft Computing 10, no. 10 (October 25, 2005): 953–59. http://dx.doi.org/10.1007/s00500-005-0022-x.

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

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

15

Yang, Wuu. "Mealy machines are a better model of lexical analyzers." Computer Languages 22, no. 1 (April 1996): 27–38. http://dx.doi.org/10.1016/0096-0551(96)00003-3.

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

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

16

Solov’ev, V. V. "Minimization of mealy finite state machines via internal state merging." Journal of Communications Technology and Electronics 56, no. 2 (February 2011): 207–13. http://dx.doi.org/10.1134/s1064226911020136.

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

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

17

Klimovich, A. S., and V. V. Solov’ev. "Minimization of mealy finite-state machines by internal states gluing." Journal of Computer and Systems Sciences International 51, no. 2 (April 2012): 244–55. http://dx.doi.org/10.1134/s1064230712010091.

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

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

18

Provost, Julien, Jean-Marc Roussel, and Jean-Marc Faure. "Translating Grafcet specifications into Mealy machines for conformance test purposes." Control Engineering Practice 19, no. 9 (September 2011): 947–57. http://dx.doi.org/10.1016/j.conengprac.2010.10.001.

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

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

19

D'Angeli, Daniele, and Emanuele Rodaro. "Groups and semigroups defined by colorings of synchronizing automata." International Journal of Algebra and Computation 24, no. 06 (September 2014): 773–93. http://dx.doi.org/10.1142/s0218196714500337.

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

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

Анотація:

In this paper we combine the algebraic properties of Mealy machines generating self-similar groups and the combinatorial properties of the corresponding deterministic finite automata (DFA). In particular, we relate bounded automata to finitely generated synchronizing automata and characterize finite automata groups in terms of nilpotency of the corresponding DFA. Moreover, we present a decidable sufficient condition to have free semigroups in an automaton group. A series of examples and applications is widely discussed, in particular we show a way to color the de Bruijn automata into Mealy automata whose associated semigroups are free, and we present some structural results related to the associated groups.

20

HINES, PETER. "A categorical framework for finite state machines." Mathematical Structures in Computer Science 13, no. 3 (May 20, 2003): 451–80. http://dx.doi.org/10.1017/s0960129503003931.

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

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

Анотація:

We provide a consistent way of looking at a range of finite state machines and their algebraic models. Our claim is that the natural representation of transitions of finite state machines is in terms of monoid homomorphisms, and distinct generalisation processes that can be applied to finite state machines correspond to distinct categorical generalisation processes at the level of the algebraic models.The generalisations we consider are those from deterministic to non-deterministic machines, from one-way to two-way machines, and from read-only machines to read/write machines. Hence the finite state machines we consider, and provide algebraic models for, are (deterministic and non-deterministic) finite state automata, two-way automata, Mealy machines, and bounded Turing machines.The categorical constructions corresponding to these generalisation processes are, respectively: altering the base category from functions to relations, applying the Geometry of Interaction, or Int construction, and a categorical process, which we refer to as the Comp construction, that uses the tensor on monoidal categories to construct graded categories.

21

KHARAKHNIN, KONSTANTIN A. "MODELING DISCRETE CONTROL SYSTEMS BASED ON MEALY AND MOORE MACHINES IN PROTEUS 8 CAD." Cherepovets State University Bulletin 2, no. 107 (2022): 16–30. http://dx.doi.org/10.23859/1994-0637-2022-2-107-2.

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

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

Анотація:

In the course of the works, discrete control systems based on Mealy and Moore machines in Proteus 8 CAD have been designed and modeled. The author analyzes functional capabilities of the VSM (virtual simulation environment) of the Proteus Design Suite virtual modeling environment by Labcenter Electronics. Its application is considered to be useful for developing models and testing discrete systems.

22

Telesphor Lakra and T. Rajaretnam. "The cyclic and strongly connected of the products of intuitionistic fuzzy Mealy machines." ANNALS OF FUZZY MATHEMATICS AND INFORMATICS 13, no. 3 (March 2017): 317–44. http://dx.doi.org/10.30948/afmi.2017.13.3.317.

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

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

23

Klimowicz, A. S., and V. V. Solov’ev. "Minimization of incompletely specified mealy finite-state machines by merging two internal states." Journal of Computer and Systems Sciences International 52, no. 3 (May 2013): 400–409. http://dx.doi.org/10.1134/s106423071303009x.

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

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

24

Barkalov, Alexander, Larysa Titarenko, and Kazimierz Krzywicki. "Improving Hardware in LUT-Based Mealy FSMs." Applied Sciences 12, no. 16 (August 11, 2022): 8065. http://dx.doi.org/10.3390/app12168065.

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

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

Анотація:

The main contribution of this paper is a novel design method reducing the number of look-up table (LUT) elements in the circuits of three-block Mealy finite-state machines (FSMs). The proposed method is based on using codes of collections of outputs (COs) for representing both FSM state variables and outputs. The interstate transitions are represented by output collections generated during two adjacent cycles of FSM operation. To avoid doubling the number of variables encoding of COs, two registers are used. The first register keeps a code of CO produced in the current cycle of operation; the code of a CO produced in the previous cycle is kept in the second register. There is given a synthesis example with applying the proposed method. The results of the research are shown. The research is conducted using the CAD tool Vivado by Xilinx. The experiments prove that the proposed approach allows reducing the hardware compared with such known methods as auto and one-hot of Vivado, and JEDI. Additionally, the proposed approach gives better results than a method based on the simultaneous replacement of inputs and encoding of COs. Compared to circuits of the three-block FSMs, the LUT counts are reduced by an average of 7.21% without significant reduction in the performance. Our approach loses in terms of power consumption (on average 9.62%) and power–time products (on average 10.44%). The gain in LUT counts and area–time products increases with the increase in the numbers of FSM states and inputs.

25

PEDRYCZ, WITOLD, and ADAM GACEK. "LEARNING OF FUZZY AUTOMATA." International Journal of Computational Intelligence and Applications 01, no. 01 (March 2001): 19–33. http://dx.doi.org/10.1142/s1469026801000068.

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

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

Анотація:

In this study, we revisit the well-known notion of fuzzy state machines and discuss their development through learning. The systematic development of fuzzy state machines has not been pursued as intensively as it could have been expected from the breadth of the possible usage of them as various modelling platforms. We concentrate on the generalization of the well known architectures exploited in Boolean system synthesis, namely Moore and Mealy machines and show how these can be implemented in terms of generic functional modules such as fuzzy JK flip-flops and fuzzy logic neurons (AND and OR neurons) organized in the form of logic processors. It is shown that the design of the fuzzy state machines can be accomplished through their learning. The detailed learning algorithm is presented and illustrated with a series of numeric examples. The study reveals an interesting option of constructing digital systems through learning: the original problem is solved in the setting of fuzzy state machines and afterwards "binarised" into the two-valued format realized via the standard digital hardware.

26

Barkalov, Alexander, Larysa Titarenko, and Sławomir Chmielewski. "Mixed Encoding of Collections of Output Variables for LUT-Based Mealy FSMs." Journal of Circuits, Systems and Computers 28, no. 08 (July 2019): 1950131. http://dx.doi.org/10.1142/s0218126619501317.

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

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

Анотація:

A method is proposed targeting the decrease of the number of look-up tables (LUTs) in logic circuits of field programmable gate arrays (FPGA)-based Mealy finite state machines. The method is based on constructing a partition for the set of output variables. It diminishes the number of additional variables encoding the collections of output variables (COVs). A formal method is proposed for finding the partition. An example of synthesis is given, as well as the results of investigations. The investigations were conducted for standard benchmarks.

27

Barkalov, Alexander, Larysa Titarenko, Kazimierz Krzywicki, and Svetlana Saburova. "Improving the Characteristics of Multi-Level LUT-Based Mealy FSMs." Electronics 9, no. 11 (November 5, 2020): 1859. http://dx.doi.org/10.3390/electronics9111859.

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

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

Анотація:

Contemporary digital systems include many varying sequential blocks. In the article, we discuss a case when Mealy finite state machines (FSMs) describe the behavior of sequential blocks. In many cases, the performance is the most important characteristic of an FSM circuit. In the article, we propose a method which allows increasing the operating frequency of multi-level look-up table (LUT)-based Mealy FSMs. The main idea of the proposed approach is to use together two methods of structural decomposition. They are: (1) the known method of transformation of codes of collections of outputs into FSM state codes and (2) a new method of extension of state codes. The proposed approach allows producing FPGA-based FSMs having three levels of logic combined through the system of regular interconnections. Each function for every level of logic was implemented using a single LUT. An example of the synthesis of Mealy FSM with the proposed architecture is shown. The effectiveness of the proposed method was confirmed by the results of experimental studies based on standard benchmark FSMs. The research results show that FSM circuits based on the proposed approach have a higher operating frequency than can be obtained using other investigated methods. The maximum operating frequency is improved by an average of 3.18 to 12.57 percent. These improvements are accompanied by a small growth of LUT count.

28

Barkalov, Alexander, Larysa Titarenko, Małgorzata Mazurkiewicz, and Kazimierz Krzywicki. "Encoding of Terms in EMB-Based Mealy FSMs." Applied Sciences 10, no. 8 (April 16, 2020): 2762. http://dx.doi.org/10.3390/app10082762.

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

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

Анотація:

A method is proposed targeting implementation of FPGA-based Mealy finite state machines. The main goal of the method is a reduction for the number of look-up table (LUT) elements and their levels in FSM logic circuits. To do it, it is necessary to eliminate the direct dependence of input memory functions and FSM output functions on FSM inputs and state variables. The method is based on encoding of the terms corresponding to rows of direct structure tables. In such an approach, only terms depend on FSM inputs and state variables. Other functions depend on variables representing terms. The method belongs to the group of the methods of structural decomposition. The set of terms is divided by classes such that each class corresponds to a single-level LUT-based circuit. An embedded memory block (EMB) generates codes of both classes and terms as elements of these classes. The mutual using LUTs and EMB allows diminishing chip area occupied by FSM circuit (as compared to its LUT-based counterpart). The simple sequential algorithm is proposed for finding the partition of the set of terms by a determined number of classes. The method is based on representation of an FSM by a state transition table. However, it can be used for any known form of FSM specification. The example of synthesis is shown. The efficiency of the proposed method was investigated using a library of standard benchmarks. We compared the proposed with some other known design methods. The investigations show that the proposed method gives better results than other discussed methods. It allows the obtaining of FSM circuits with three levels of logic and regular interconnections.

29

Kremer, S. C. "Identification of a specific limitation on local-feedback recurrent networks acting as Mealy-Moore machines." IEEE Transactions on Neural Networks 10, no. 2 (March 1999): 433–38. http://dx.doi.org/10.1109/72.750574.

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

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

30

Barkalov, Alexander, Larysa Titarenko, Kazimierz Krzywicki, and Svetlana Saburova. "Improving Characteristics of LUT-Based Mealy FSMs with Twofold State Assignment." Electronics 10, no. 8 (April 10, 2021): 901. http://dx.doi.org/10.3390/electronics10080901.

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

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

Анотація:

Practically, any digital system includes sequential blocks. This article is devoted to a case when sequential blocks are represented by models of Mealy finite state machines (FSMs). The performance (maximum operating frequency) is one of the most important characteristics of an FSM circuit. In this article, a method is proposed which aims at increasing the operating frequency of LUT-based Mealy FSMs with twofold state assignment. This is done using only extended state codes. Such an approach allows excluding a block of transformation of binary state codes into extended state codes. The proposed approach leads to LUT-based Mealy FSM circuits having two levels of logic blocks. Each function for any logic level is represented by a circuit including a single LUT. The proposed method is illustrated by an example of synthesis. The results of experiments conducted with standard benchmarks show that the proposed approach produces LUT-based circuits with significantly higher operating frequency than it is for circuits produced by other investigated methods (Auto and One-hot of Vivado, JEDI, twofold state assignment). The performance is increased by an average of 15.9 to 25.49 percent. These improvements are accompanied by a small growth of the numbers of LUTs compared with circuits based on twofold state assignment. Our approach provides the best area-time products compared with other investigated methods. The advantages of the proposed approach increase as the number of FSM inputs and states increases.

31

Solov’ev, V. V. "Implementation of finite-state machines based on programmable logic ICs with the help of the merged model of Mealy and Moore machines." Journal of Communications Technology and Electronics 58, no. 2 (February 2013): 172–77. http://dx.doi.org/10.1134/s106422691302006x.

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

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

32

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

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

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

Анотація:

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.

33

Barkalov, Alexander, Larysa Titarenko, Kazimierz Krzywicki, and Svetlana Saburova. "Improving Characteristics of LUT-Based Three-Block Mealy FSMs’ Circuits." Electronics 11, no. 6 (March 18, 2022): 950. http://dx.doi.org/10.3390/electronics11060950.

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

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

Анотація:

One of the very important problems connected with FPGA-based design is reducing the hardware amount in implemented circuits. In this paper, we discuss the implementation of Mealy finite state machines (FSMs) by circuits consisting of look-up tables (LUT). A method is proposed to reduce the LUT count of three-block circuits of Mealy FSMs. The method is based on finding a partition of set of internal states by classes of compatible states. To reduce the LUT count, we propose a special kind of state code, named complex state codes. The complex codes include two parts. The first part includes the binary codes of a state as the element of some partition class. The second part consists of the code of corresponding partition class. Using complex state codes allows obtaining FPGA-based FSM circuits with exactly four logic blocks. If some conditions hold, then any FSM function from the first and second blocks is implemented by a single LUT. The third level is represented as a network of multiplexers. These multiplexers generate either additional variable encoding collections of outputs or input memory functions. The fourth level generates FSM outputs. An example of synthesis and experimental results is shown and discussed. The experiments prove that the proposed approach allows reducing hardware compared to such methods as auto and one-hot of Vivado, JEDI. Further, the proposed approach produces circuits with fewer LUTs than for three-level Mealy FSMs based on joint use of several methods of structural decomposition. The experiments show that our approach allows reducing the LUT counts on average from 11 to 77 percent. As the complexity of an FSM increases, the gain from the application of the proposed method grows; the same is true for both the FSM performance and power consumption.

34

Provost, Julien, Jean-Marc Roussel, and Jean-Marc Faure. "Test exhaustif de contrôleurs logiques spécifiés en Grafcet Apports et limites d'une modélisation par machines de Mealy." Journal Européen des Systèmes Automatisés 43, no. 7-9 (November 10, 2009): 889–904. http://dx.doi.org/10.3166/jesa.43.889-904.

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

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

35

Solov’ev, V. V. "Minimization of mealy finite-state machines by using the values of the output variables for state assignment." Journal of Computer and Systems Sciences International 56, no. 1 (January 2017): 96–104. http://dx.doi.org/10.1134/s1064230717010129.

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

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

36

Tu, Y., D. Li, and S. Li. "Formal syntax and semantics of basic function blocks in IEC 61499." Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science 226, no. 4 (August 23, 2011): 1025–35. http://dx.doi.org/10.1177/0954406211417931.

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

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

Анотація:

The use IEC 61499 (International Electrotechnical Commission, IEC) as a modelling language for distributed industrial process measurement control systems lacks formal syntax and explicit semantics and can hardly ensure reliability and validity of systems. As the basic modelling elements in IEC 61499, syntax and semantics of basic function block (BFB) are specified informally and ambiguously. Hence, the formal syntax and explicit semantics of BFB are advanced to achieve the behavioural consistency and correct results, in this article. The formal syntax is defined by mathematical set theory and the explicit semantics are composed of two kinds of semantics: denotational and execution semantics. The denotational semantics explain the meaning of language with an extended Mealy finite-state machines for the formal verification in a formal way. The execution semantics provide execution rule and algorithm scheduling in the execution process and involve an input machine and the main part, in which input machine masters the matching relation of event and data input variables and the main part offers execution orders and algorithm computation. Besides, the execution semantics of BFB are exemplified with two events and algorithms as the execution order t1–t20, and a flowchart of BFB behaviours is given as an overview of the processing steps for implementation or code generation.

37

Barkalov, Alexander, Larysa Titarenko, and Kazimierz Krzywicki. "Improving Characteristics of LUT-Based Sequential Blocks for Cyber-Physical Systems." Energies 15, no. 7 (April 4, 2022): 2636. http://dx.doi.org/10.3390/en15072636.

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

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

Анотація:

A method is proposed for optimizing circuits of sequential devices which are used in cyber-physical systems (CPSs) implemented using field programmable gate arrays (FPGAs). The optimizing hardware is a very important problem connected with implementing digital parts of CPSs. In this article, we discuss a case when Mealy finite state machines (FSMs) represent behaviour of sequential devices. The proposed method is aimed at optimization of FSM circuits implemented with look-up table (LUT) elements of FPGA chip. The method aims to reduce the LUT count of Mealy FSMs with extended state codes. The method is based on finding a partition of the set of internal states by classes of compatible states. To reduce LUT count, we propose a special kind of state codes named composite state codes. The composite codes include two parts. The first part includes the binary codes of states as elements of some partition class. The second part consists of the code of corresponding partition class. Using composite state codes allows us to obtain FPGA-based FSM circuits with exactly two levels of logic. If some conditions hold, then any FSM function from the first level is implemented by a single LUT. The second level is represented as a network of multiplexers. Each multiplexer generates either an FSM output or input memory function. An example of synthesis is shown. The experiments prove that the proposed approach allows us to reduce hardware compared with two methods from Vivado, JEDI-based FSMs, and extended state assignment. Depending on the complexity of an FSM, the LUT count is reduced on average from 15.46 to 68.59 percent. The advantages of the proposed approach grow with the growth of FSM complexness. An additional positive effect of the proposed method is a decrease in the latency time.

38

BRZOZOWSKI, JANUSZ, and HELMUT JÜRGENSEN. "REPRESENTATION OF SEMIAUTOMATA BY CANONICAL WORDS AND EQUIVALENCES, PART II: SPECIFICATION OF SOFTWARE MODULES." International Journal of Foundations of Computer Science 18, no. 05 (October 2007): 1065–87. http://dx.doi.org/10.1142/s0129054107005133.

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

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

Анотація:

A theory of representation of semiautomata by canonical words and equivalences was developed in [7]. That work was motivated by trace-assertion specifications of software modules, but its focus was entirely on the underlying mathematical model. In the present paper we extend that theory to automata with Moore and Mealy outputs, and show how to apply the extended theory to the specification of modules. In particular, we present a unified view of the trace-assertion methodology, as guided by our theory. We illustrate this approach, and some specific issues, using several nontrivial examples. We include a discussion of finite versus infinite modules, methods of error handling, some awkward features of the trace-assertion method, and a comparison to specifications by automata. While specifications by trace assertions and automata are equivalent in power, there are cases where one approach appears to be more natural than the other. We conclude that, for certain types of system modules, formal specification by automata, as opposed to informal state machines, is not only possible, but practical.

39

MILLERIOUX, G., and P. GUILLOT. "SELF-SYNCHRONIZING STREAM CIPHERS AND DYNAMICAL SYSTEMS: STATE OF THE ART AND OPEN ISSUES." International Journal of Bifurcation and Chaos 20, no. 09 (September 2010): 2979–91. http://dx.doi.org/10.1142/s0218127410027532.

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

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

Анотація:

Dynamical systems play a central role in the design of symmetric cryptosystems. Their use has been widely investigated both in "chaos-based" private communications and in stream ciphers over finite fields. In the former case, they take the form of automata named Moore or Mealy machines. The main charateristic of stream ciphers lies in that they require synchronization of complex sequences generated by the dynamical systems involved both at the transmitter and the receiver ends. In this paper, we focus on a special class of symmetric ciphers, namely the Self-Synchronizing Stream Ciphers. Indeed, such ciphers have not been seriously explored so far although they show interesting properties of synchronization which could make them very appealing in practice. We review and compare different design approaches which have been proposed in the open literature, and fully-specified algorithms are detailed for illustration purposes. Open issues related to the validation and the implementation of Self-Synchronizing Stream Ciphers are developed. We highlight the reason why some concepts borrowed from control theory appear to be useful to this end.

40

Materzok, Marek. "Generating circuits with generators." Proceedings of the ACM on Programming Languages 6, ICFP (August 29, 2022): 52–79. http://dx.doi.org/10.1145/3549821.

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

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

Анотація:

The most widely used languages and methods used for designing digital hardware fall into two rough categories. One of them, register transfer level (RTL), requires specifying each and every component in the designed circuit. This gives the designer full control, but burdens the designer with many trivial details. The other, the high-level synthesis (HLS) method, allows the designer to abstract the details of hardware away and focus on the problem being solved. This method however cannot be used for a class of hardware design problems because the circuit's clock is also abstracted away. We present YieldFSM, a hardware description language that uses the generator abstraction to represent clock-level timing in a digital circuit. It represents a middle ground between the RTL and HLS approaches: the abstraction level is higher than in RTL, but thanks to explicit information about clock-level timing, it can be used in applications where RTL is traditionally used. We also present the YieldFSM compiler, which uses methods developed by the functional programming community -- including continuation-passsing style translation and defunctionalization -- to translate YieldFSM programs to Mealy machines. It is implemented using Template Haskell and the Clash functional hardware description language. We show that this approach leads to short and conceptually simple hardware descriptions.

41

Barkalov, A., L. Titarenko, O. Golovin, and A. Matvienko. "Twofold Addressing of Microinstructions in CMCU with Common Memory." Cybernetics and Computer Technologies, no. 1 (March 30, 2021): 86–98. http://dx.doi.org/10.34229/2707-451x.21.1.9.

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

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

Анотація:

Introduction. Control unit (CU) is one of the most important blocks of practically any digital system. Its characteristics largely determine the characteristics of a system as a whole. As a rule, to synthesize CUs, the models of Mealy and Moore finite state machines (FSMs) are used. The article is devoted to compositional microprogram control units (CMCUs). A CMCU is a Moore FSM in which a state register is replaced by a microinstruction address counter. The choice of CMCU is an optimal solution for implementing linear control algorithms. When developing FSM circuits, it is necessary to optimize such characteristics as the performance and hardware amount. The methods of optimization depend strongly on logic elements used. Nowadays, FPGA chips are one of the most common logic elements for implementing digital systems. To implement the CMCU circuit, it is enough to use look-up table (LUT) elements, programmable flip-flops, embedded memory blocks, and programmable interconnections. The purpose of the article. In the article, there is proposed a CMCU design method improving such characteristics of CU as the number of logic levels and regularity of programmable interconnections. The main drawback of LUT is a small number of inputs. Modern digital systems can generate signals of logical conditions entering the control unit, the number of which is tens of times greater than the number of LUT inputs. Such a discrepancy between the characteristics of the control algorithm and the number of inputs of the LUT elements leads to multi-level control circuits with an irregular structure of programmable interconnections, and is the reason for a decrease in performance and an increase in chip area and power consumption. Results. A method for double addressing of microinstructions in CMCU with shared memory is proposed. The method is an adaptation of the two-fold state assignment of Mealy FSMs, the circuits of which are implemented with FPGAs. The proposed method makes it possible to obtain a microinstruction addressing circuit with two logic levels and a regular interconnection system. The paper considers an example of the synthesis of the CMCU circuit and analyzes the proposed method. Conclusions. The proposed method allows reducing hardware amount (the number of LUTs and their interconnections), time of delay and power consumption. Moreover, the more complex the control algorithm, the greater the benefit the proposed method gives. Keywords: compositional microprogram control unit, microinstruction, LUT, EMB, synthesis.

42

Sudo, Kyoko, Kazuhiko Murasaki, Tetsuya Kinebuchi, Shigeko Kimura, and Kayo Waki. "Machine Learning–Based Screening of Healthy Meals From Image Analysis: System Development and Pilot Study." JMIR Formative Research 4, no. 10 (October 26, 2020): e18507. http://dx.doi.org/10.2196/18507.

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

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

Анотація:

Background Recent research has led to the development of many information technology–supported systems for health care control, including systems estimating nutrition from images of meals. Systems that capture data about eating and exercise are useful for people with diabetes as well as for people who are simply on a diet. Continuous monitoring is key to effective dietary control, requiring systems that are simple to use and motivate users to pay attention to their meals. Unfortunately, most current systems are complex or fail to motivate. Such systems require some manual inputs such as selection of an icon or image, or by inputting the category of the user’s food. The nutrition information fed back to users is not especially helpful, as only the estimated detailed nutritional values contained in the meal are typically provided. Objective In this paper, we introduce healthiness of meals as a more useful and meaningful general standard, and present a novel algorithm that can estimate healthiness from meal images without requiring manual inputs. Methods We propose a system that estimates meal healthiness using a deep neural network that extracts features and a ranking network that learns the relationship between the degrees of healthiness of a meal using a dataset prepared by a human dietary expert. First, we examined whether a registered dietitian can judge the healthiness of meals solely by viewing meal images using a small dataset (100 meals). We then generated ranking data based on comparisons of sets of meal images (850 meals) by a registered dietitian’s viewing meal images and trained a ranking network. Finally, we estimated each meal’s healthiness score to detect unhealthy meals. Results The ranking estimated by the proposed network and the ranking of healthiness based on the dietitian’s judgment were correlated (correlation coefficient 0.72). In addition, extracting network features through pretraining with a publicly available large meal dataset enabled overcoming the limited availability of specific healthiness data. Conclusions We have presented an image-based system that can rank meals in terms of the overall healthiness of the dishes constituting the meal. The ranking obtained by the proposed method showed a good correlation to nutritional value–based ranking by a dietitian. We then proposed a network that allows conditions that are important for judging the meal image, extracting features that eliminate background information and are independent of location. Under these conditions, the experimental results showed that our network achieves higher accuracy of healthiness ranking estimation than the conventional image ranking method. The results of this experiment in detecting unhealthy meals suggest that our system can be used to assist health care workers in establishing meal plans for patients with diabetes who need advice in choosing healthy meals.

43

Kalihari, Ritika, Toran Verma, and Alka Jaiswal. "Concept of Automated Machine using Mealy." International Journal of Computer Applications Technology and Research 2, no. 3 (May 10, 2013): 335–39. http://dx.doi.org/10.7753/ijcatr0203.1024.

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

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

44

Martinelli, Sarah, Francesco Acciai, Michael J. Yedidia, and Punam Ohri-Vachaspati. "Do Parental Perceptions of the Nutritional Quality of School Meals Reflect the Food Environment in Public Schools?" International Journal of Environmental Research and Public Health 18, no. 20 (October 14, 2021): 10764. http://dx.doi.org/10.3390/ijerph182010764.

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

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

Анотація:

(1) Background: It is unknown whether parents’ perception of school meals, a determinant of student meal participation, align with the nutritional quality of meals served in schools. This study compares the healthfulness of foods offered in schools with parental perception of school meals at those same schools. (2) Method: Parents were asked to rate the healthfulness of school meals at their child’s school. Data on the types of foods offered were collected from public schools in four cities in New Jersey and matched with parent-reported data. Measures were developed to capture the presence of healthy and unhealthy items in the National School Lunch Program and the presence of a la carte offerings as well as vending machines. Multivariable analysis examined the association between parental perceptions of school meals and the school food measures after adjusting for covariates. (3) Results: Measures of the school food environment and parental perceptions were available for 890 pre-K to 12th grade students. No significant associations were observed between parental perceptions and food environment measures when examined one by one or in a comprehensive model. (4) Conclusions: Parents’ perception of the healthfulness of meals served do not align with the nutritional quality of foods offered at schools.

45

Martinelli, Sarah, Francesco Acciai, Michael J. Yedidia, and Punam Ohri-Vachaspati. "Do Parental Perceptions of the Nutritional Quality of School Meals Reflect the Food Environment in Public Schools?" International Journal of Environmental Research and Public Health 18, no. 20 (October 14, 2021): 10764. http://dx.doi.org/10.3390/ijerph182010764.

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

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

Анотація:

(1) Background: It is unknown whether parents’ perception of school meals, a determinant of student meal participation, align with the nutritional quality of meals served in schools. This study compares the healthfulness of foods offered in schools with parental perception of school meals at those same schools. (2) Method: Parents were asked to rate the healthfulness of school meals at their child’s school. Data on the types of foods offered were collected from public schools in four cities in New Jersey and matched with parent-reported data. Measures were developed to capture the presence of healthy and unhealthy items in the National School Lunch Program and the presence of a la carte offerings as well as vending machines. Multivariable analysis examined the association between parental perceptions of school meals and the school food measures after adjusting for covariates. (3) Results: Measures of the school food environment and parental perceptions were available for 890 pre-K to 12th grade students. No significant associations were observed between parental perceptions and food environment measures when examined one by one or in a comprehensive model. (4) Conclusions: Parents’ perception of the healthfulness of meals served do not align with the nutritional quality of foods offered at schools.

46

Sowah, Robert A., Adelaide A. Bampoe-Addo, Stephen K. Armoo, Firibu K. Saalia, Francis Gatsi, and Baffour Sarkodie-Mensah. "Design and Development of Diabetes Management System Using Machine Learning." International Journal of Telemedicine and Applications 2020 (July 16, 2020): 1–17. http://dx.doi.org/10.1155/2020/8870141.

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

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

Анотація:

This paper describes the design and implementation of a software system to improve the management of diabetes using a machine learning approach and to demonstrate and evaluate its effectiveness in controlling diabetes. The proposed approach for this management system handles the various factors that affect the health of people with diabetes by combining multiple artificial intelligence algorithms. The proposed framework factors the diabetes management problem into subgoals: building a Tensorflow neural network model for food classification; thus, it allows users to upload an image to determine if a meal is recommended for consumption; implementing K-Nearest Neighbour (KNN) algorithm to recommend meals; using cognitive sciences to build a diabetes question and answer chatbot; tracking user activity, user geolocation, and generating pdfs of logged blood sugar readings. The food recognition model was evaluated with cross-entropy metrics that support validation using Neural networks with a backpropagation algorithm. The model learned features of the images fed from local Ghanaian dishes with specific nutritional value and essence in managing diabetics and provided accurate image classification with given labels and corresponding accuracy. The model achieved specified goals by predicting with high accuracy, labels of new images. The food recognition and classification model achieved over 95% accuracy levels for specific calorie intakes. The performance of the meal recommender model and question and answer chatbot was tested with a designed cross-platform user-friendly interface using Cordova and Ionic Frameworks for software development for both mobile and web applications. The system recommended meals to meet the calorific needs of users successfully using KNN (with k=5) and answered questions asked in a human-like way. The implemented system would solve the problem of managing activity, dieting recommendations, and medication notification of diabetics.

47

Stankoski, Simon, Marko Jordan, Hristijan Gjoreski, and Mitja Luštrek. "Smartwatch-Based Eating Detection: Data Selection for Machine Learning from Imbalanced Data with Imperfect Labels." Sensors 21, no. 5 (March 9, 2021): 1902. http://dx.doi.org/10.3390/s21051902.

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

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

Анотація:

Understanding people’s eating habits plays a crucial role in interventions promoting a healthy lifestyle. This requires objective measurement of the time at which a meal takes place, the duration of the meal, and what the individual eats. Smartwatches and similar wrist-worn devices are an emerging technology that offers the possibility of practical and real-time eating monitoring in an unobtrusive, accessible, and affordable way. To this end, we present a novel approach for the detection of eating segments with a wrist-worn device and fusion of deep and classical machine learning. It integrates a novel data selection method to create the training dataset, and a method that incorporates knowledge from raw and virtual sensor modalities for training with highly imbalanced datasets. The proposed method was evaluated using data from 12 subjects recorded in the wild, without any restriction about the type of meals that could be consumed, the cutlery used for the meal, or the location where the meal took place. The recordings consist of data from accelerometer and gyroscope sensors. The experiments show that our method for detection of eating segments achieves precision of 0.85, recall of 0.81, and F1-score of 0.82 in a person-independent manner. The results obtained in this study indicate that reliable eating detection using in the wild recorded data is possible with the use of wearable sensors on the wrist.

48

Shilo, Smadar, Anastasia Godneva, Marianna Rachmiel, Tal Korem, Dmitry Kolobkov, Tal Karady, Noam Bar, et al. "Prediction of Personal Glycemic Responses to Food for Individuals With Type 1 Diabetes Through Integration of Clinical and Microbial Data." Diabetes Care 45, no. 3 (October 19, 2021): 502–11. http://dx.doi.org/10.2337/dc21-1048.

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

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

Анотація:

OBJECTIVE Despite technological advances, results from various clinical trials have repeatedly shown that many individuals with type 1 diabetes (T1D) do not achieve their glycemic goals. One of the major challenges in disease management is the administration of an accurate amount of insulin for each meal that will match the expected postprandial glycemic response (PPGR). The objective of this study was to develop a prediction model for PPGR in individuals with T1D. RESEARCH DESIGN AND METHODS We recruited individuals with T1D who were using continuous glucose monitoring and continuous subcutaneous insulin infusion devices simultaneously to a prospective cohort and profiled them for 2 weeks. Participants were asked to report real-time dietary intake using a designated mobile app. We measured their PPGRs and devised machine learning algorithms for PPGR prediction, which integrate glucose measurements, insulin dosages, dietary habits, blood parameters, anthropometrics, exercise, and gut microbiota. Data of the PPGR of 900 healthy individuals to 41,371 meals were also integrated into the model. The performance of the models was evaluated with 10-fold cross validation. RESULTS A total of 121 individuals with T1D, 75 adults and 46 children, were included in the study. PPGR to 6,377 meals was measured. Our PPGR prediction model substantially outperforms a baseline model with emulation of standard of care (correlation of R = 0.59 compared with R = 0.40 for predicted and observed PPGR respectively; P < 10−10). The model was robust across different subpopulations. Feature attribution analysis revealed that glucose levels at meal initiation, glucose trend 30 min prior to meal, meal carbohydrate content, and meal’s carbohydrate-to-fat ratio were the most influential features for the model. CONCLUSIONS Our model enables a more accurate prediction of PPGR and therefore may allow a better adjustment of the required insulin dosage for meals. It can be further implemented in closed loop systems and may lead to rationally designed nutritional interventions personally tailored for individuals with T1D on the basis of meals with expected low glycemic response.

49

Barkalov, A. A., L. A. Titarenko, and S. O. Kovalov. "IMPLEMENTATION OF MEALY FINITE-STATE MACHINE ON THE COUNTERS." Problems of Modeling and Design Automatization 22, no. 1 (2020): 15–21. http://dx.doi.org/10.31474/2074-7888-2020-1-15-21.

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

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

50

Üstündağ, Berk. "An adaptive Mealy machine model for monitoring crop status." Journal of Integrative Agriculture 16, no. 2 (February 2017): 252–65. http://dx.doi.org/10.1016/s2095-3119(16)61430-2.

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

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

Статті в журналах з теми "Machines de Mealy"

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