scholarly journals Human Activities Recognition Based on Neuro-Fuzzy Finite State Machine

Technologies ◽  
2018 ◽  
Vol 6 (4) ◽  
pp. 110 ◽  
Author(s):  
Gadelhag Mohmed ◽  
Ahmad Lotfi ◽  
Amir Pourabdollah
Keyword(s):  
Neural Networks ◽  
Human Activities ◽  
Finite State Machine ◽  
Fuzzy Rule ◽  
State Machine ◽  
Machine Learning Techniques ◽  
Rule Based ◽  
Neuro Fuzzy ◽  
Finite State ◽  
Learning Capabilities

Human activity recognition and modelling comprise an area of research interest that has been tackled by many researchers. The application of different machine learning techniques including regression analysis, deep learning neural networks, and fuzzy rule-based models has already been investigated. In this paper, a novel method based on Fuzzy Finite State Machine (FFSM) integrated with the learning capabilities of Neural Networks (NNs) is proposed to represent human activities in an intelligent environment. The proposed approach, called Neuro-Fuzzy Finite State Machine (N-FFSM), is able to learn the parameters of a rule-based fuzzy system, which processes the numerical input/output data gathered from the sensors and/or human experts’ knowledge. Generating fuzzy rules that represent the transition between states leads to assigning a degree of transition from one state to another. Experimental results are presented to demonstrate the effectiveness of the proposed method. The model is tested and evaluated using a dataset collected from a real home environment. The results show the effectiveness of using this method for modelling the activities of daily living based on ambient sensory datasets. The performance of the proposed method is compared with the standard NNs and FFSM techniques.

scholarly journals Perancangan dan Pembuatan Serious Game Sebagai Simulasi Aktivitas Bisnis dan Akuntansi Menggunakan Pendekatan Agent-Based Modelling

2017 ◽  
Vol 5 (2) ◽  
pp. 66
Author(s):  
Angga Ari Wijaya ◽  
Saiful Bukhori ◽  
Nelly Oktavia
Keyword(s):  
Personality Trait ◽  
Finite State Machine ◽  
State Machine ◽  
Serious Game ◽  
Agent Based Model ◽  
Rule Based ◽  
Agent Based ◽  
Agent Based Modelling ◽  
Rule Based System ◽  
Finite State

Permainan memiliki efek positif dalam mendukung kemampuan motorik seseorang untuk berkembang. Salah satu bahasan menarik dalam permainan adalah simulasi bisnis yang memiliki kategori serious game untuk dijadikan alternatif media pembelajaran dalam memahami konsep dasar bisnis dan aktivitas akuntansi. Gameplay dibuat dengan menciptakan artificial bisnis level UKM yang melakukan aktivitas jual beli, dimana di dalamnya terdapat game world, pelanggan dan toko yang berinteraksi untuk menghasilkan fenomena sebuah pasar. Aktivitas jual beli menjadi dasar siklus akuntansi untuk pemain belajar dan memahami kejadian finansial. Setiap agent diberi attribute yang digunakan sebagai parameter untuk membentuk personality-trait dan pengambilan keputusan pembelian serta aktivitas yang membentuk tingkah laku sehari - hari melalui State Machine dan Rule Based System (RBS). Simulasi perilaku konsumen dalam pasar virtual digunakan sebagai trigger aktivitas utama bisnis yaitu transaksi penjualan. Kejadian finansial yang terjadi dari proses simulasi menghasilkan proses jurnal untuk memberikan pemain pengalaman dalam memproses transaksi dengan contoh sumber aktivitas buatan.Kata Kunci: Serious Game, Perilaku Konsumen, Agent-based Model, A Star, Stack Finite State Machine, Rule-Based System.

Correction to Proof That Recurrent Neural Networks Can Robustly Recognize Only Regular Languages

1998 ◽  
Vol 10 (5) ◽  
pp. 1067-1069 ◽  
Author(s):  
Mike Casey
Keyword(s):  
Neural Networks ◽  
Discrete Time ◽  
Recurrent Neural Networks ◽  
Finite State Machine ◽  
State Machine ◽  
Regular Languages ◽  
State Variables ◽  
Finite Dimensional ◽  
Corrected Proof ◽  
Finite State

Our earlier article, “The Dynamics of Discrete-Time Computation, with Application to Recurrent Neural Networks and Finite State Machine Extraction” (Casey, 1996), contains a corollary that shows that finite dimensional recurrent neural networks with noise in their state variables that perform algorithmic computations can perform only finite state machine computations. The proof of the corollary is technically incorrect. The problem resulted from the fact that the proof of the theorem on which the corollary is based was more general than the statement of the theorem, and it was the contents of the proof rather than the statement that were used to prove the corollary. In this note, we state the theorem in the necessary generality and then give the corrected proof of the corollary.

The Dynamics of Discrete-Time Computation, with Application to Recurrent Neural Networks and Finite State Machine Extraction

1996 ◽  
Vol 8 (6) ◽  
pp. 1135-1178 ◽  
Author(s):  
Mike Casey
Keyword(s):  
Neural Networks ◽  
Recurrent Neural Networks ◽  
Finite State Machine ◽  
State Machine ◽  
Training Methods ◽  
Precise Description ◽  
Activation Dynamics ◽  
Finite State ◽  
Successful Approach ◽  
Space Dynamics

Recurrent neural networks (RNNs) can learn to perform finite state computations. It is shown that an RNN performing a finite state computation must organize its state space to mimic the states in the minimal deterministic finite state machine that can perform that computation, and a precise description of the attractor structure of such systems is given. This knowledge effectively predicts activation space dynamics, which allows one to understand RNN computation dynamics in spite of complexity in activation dynamics. This theory provides a theoretical framework for understanding finite state machine (FSM) extraction techniques and can be used to improve training methods for RNNs performing FSM computations. This provides an example of a successful approach to understanding a general class of complex systems that has not been explicitly designed, e.g., systems that have evolved or learned their internal structure.

scholarly journals Defense behavior of real time strategy games: comparison between HFSM and FSM

2019 ◽  
Vol 13 (2) ◽  
pp. 634
Author(s):  
Rahmat Fauzi ◽  
Mochamad Hariadi ◽  
Muharman Lubis ◽  
Supeno Mardi Susiki Nugroho
Keyword(s):  
Finite State Machine ◽  
State Machine ◽  
Test Results ◽  
Defense Behavior ◽  
Rule Based ◽  
Rule Based System ◽  
Strategy Games ◽  
Special Skill ◽  
Finite State ◽  
Rts Game

<span>RTS Game is one of the popular genre in PC gaming, which has been played by various type of players frequently. In RTS game, NPC Defense Building (Tower) has attacking behavior to the closest enemy without considering certain enemy parameters. This causes the NPC Tower to be more predictable by the opponent and easily defeated if NPC attacked by enemies in the group. Thus, this research simulates NPC Tower using Hierarchical Finite State Machine (HFSM) method compared with Finite State Machine (FSM). In this study, NPC Tower detects enemies by seeing at four parameters namely NPC Tower Health, Enemy's Health, Enemy Type, and Tower Distance to enemies. NPC Tower will attack the most dangerous enemy according to the ‘Degree of Danger’ parameter. Then use the decision-making logic of the rule-based system. The output of NPC Tower are three type of behaviors namely Aggressive Attacking, Regular Attacking, and Attack with Special Skill. From the test results of 3 NPC Tower, Kamandaka NPC Tower with HFSM method is winning 8.92% compare to Kamandaka Tower with FSM method. For Gayatri Tower NPC obtained equal results using both HFSM and FSM. Meanwhile, Adikara NPC with HFSM method is 4.62% superior to Adikara Tower with FSM method.</span>

MARKOV MATHEMATICAL MODEL OF DYNAMIC ADAPTIVE TESTING OF AN ACTIVE AGENT

2018 ◽  
pp. 29-35
Author(s):  
N. V. Brovka ◽  
P. P. Dyachuk ◽  
M. V. Noskov ◽  
I. P. Peregudova
Keyword(s):  
Mathematical Model ◽  
Finite State Machine ◽  
Active Agent ◽  
Adaptive Testing ◽  
State Machine ◽  
Learning Activities ◽  
Independent Learning ◽  
Complex Object ◽  
Total Reward ◽  
Finite State

The problem and the goal.The urgency of the problem of mathematical description of dynamic adaptive testing is due to the need to diagnose the cognitive abilities of students for independent learning activities. The goal of the article is to develop a Markov mathematical model of the interaction of an active agent (AA) with the Liquidator state machine, canceling incorrect actions, which will allow mathematically describe dynamic adaptive testing with an estimated feedback.The research methodologyconsists of an analysis of the results of research by domestic and foreign scientists on dynamic adaptive testing in education, namely: an activity approach that implements AA developmental problem-solving training; organizational and technological approach to managing the actions of AA in terms of evaluative feedback; Markow’s theory of cement and reinforcement learning.Results.On the basis of the theory of Markov processes, a Markov mathematical model of the interaction of an active agent with a finite state machine, canceling incorrect actions, was developed. This allows you to develop a model for diagnosing the procedural characteristics of students ‘learning activities, including: building axiograms of total reward for students’ actions; probability distribution of states of the solution of the problem of identifying elements of the structure of a complex object calculate the number of AA actions required to achieve the target state depending on the number of elements that need to be identified; construct a scatter plot of active agents by target states in space (R, k), where R is the total reward AA, k is the number of actions performed.Conclusion.Markov’s mathematical model of the interaction of an active agent with a finite state machine, canceling wrong actions allows you to design dynamic adaptive tests and diagnostics of changes in the procedural characteristics of educational activities. The results and conclusions allow to formulate the principles of dynamic adaptive testing based on the estimated feedback.

PENERAPAN FINITE STATE MACHINE UNTUK PENGENDALIAN ANIMASI PADA VIDEO GAME RPG NUSANTARA LEGACY

2018 ◽  
Vol 3 (1) ◽  
pp. 1
Author(s):  
Mustofa Mustofa ◽  
Sidiq Sidiq ◽  
Eva Rahmawati
Keyword(s):  
Life Cycle ◽  
Video Game ◽  
Finite State Machine ◽  
Role Playing ◽  
State Machine ◽  
Game Development ◽  
Development Life Cycle ◽  
Finite State ◽  
Role Playing Game

Perkembangan dunia yang dinamis mendorong percepatan perkembangan teknologi dan informasi. Dengan dorongan tersebut komputer yang dulunya dibuat hanya untuk membantu pekerjaan manusia sekarang berkembang menjadi sarana hiburan, permainan, komunikasi dan lain sebagainya. Dalam sektor hiburan salah satu industri yang sedang menjadi pusat perhatian adalah industri video game. Begitu banyaknya produk video game asing yang masuk ke dalam negeri ini memberikan tantangan kepada bangsa ini. Tentunya video game asing yang masuk ke negara ini membawa banyak unsur kebudayaan negara lain. Ini semakin membuat kebudayaan nusantara semakin tergeserkan dengan serangan kebudayaan asing melalui berbagai media. Maka dari itu peneliti mencoba untuk menerapkan Finite State Machine dalam merancang sebuah video game RPG (Role-Playing game) yang memperkenalkan kebudayaan. Dalam perancangan video game ini peneliti menggunakan metode GDLC(Game Development Life Cycle) agar penelitian ini berjalan secara sistematis. Dalam suatu perancangan video game tedapat banyak elemen, pada penelitian ini penulis lebih fokus pada pengendalian animasi karakter yang dimainkan pada video game ini. Dari perancangan yang dilakukan, disimpulkan bahwa Finite State Machine dapat digunakan untuk pengendalian animasi yang baik pada video game RPG. Diharapkan video game ini dapat menjadi salah satu media untuk mengenalkan kebudayaan nusantara

Sign in / Sign up

Export Citation Format

Share Document