An approach for evaluating the functional and non-functional change factors of web service using Finite State Machine

2013 ◽  
Author(s):  
M. Thirumaran ◽  
P. Dhavachelvan ◽  
D. Aishwarya
Keyword(s):  
Web Service ◽  
Finite State Machine ◽  
State Machine ◽  
Functional Change ◽  
Change Factors ◽  
Finite State

scholarly journals Providing security for Web Service Composition using Finite State Machine

2005 ◽  
Vol 4 (2) ◽  
pp. 435-444
Author(s):  
Priya Sundar ◽  
R Raju ◽  
P Mahalakshmi ◽  
G Lalitha
Keyword(s):  
Web Services ◽  
Web Service ◽  
Service Composition ◽  
Finite State Machine ◽  
State Machine ◽  
Web Service Composition ◽  
Machine Model ◽  
Access Points ◽  
Finite State ◽  
The Web

The revolution impacted by Web Service as a solution to business and enterprise application integration throws light on the significance of security provided by Web Services during Web Service Composition. Satisfying the security requirements is truly a demanding task because of the dynamic and capricious nature of the Web. Web Service Composition associates web services to create high level business process that absolutely matches and conforms appropriately to the service requestor’s needs. It involves customizing services often by locating, assimilating and deploying elementary services. Our paper proposes a policy based system for granting security during the process of web service composition. Policies defined for effective and secure composition analyze and verify the conditions under which the task of the web service is allowed or rejected. To achieve this specification, we make use of Finite State Machine model which clearly portrays the business and flow logic. Nodes in the Finite State Machine represent rules. Upon efficacious fulfillment of policies which are defined in the node access points, transition between rules is stimulated. A service composition is said to be successfully incorporated only if there is complete absence of policy violations when combining the policies of elementary services. The simulated FSM which extracts the rules and policies of the web services and correctly matches and satisfies the policy constraints defined in the access points ensure providing security for the composite web service.

scholarly journals DESAIN & PENGEMBANGAN WEB-SERVICE PELAYANAN TERPADU SATU PINTU (PTSP) KEMENTERIAN AGAMA (KEMENAG) KUTAI TIMUR

2021 ◽  
Vol 3 (3) ◽  
pp. 19-25
Author(s):  
Tommy Bustomi ◽  
Nursobah Nursobah ◽  
Jan-Jan Jaelani
Keyword(s):  
Web Service ◽  
Collision Detection ◽  
Finite State Machine ◽  
Web Server ◽  
State Machine ◽  
Modeling Language ◽  
Adobe Photoshop ◽  
Finite State ◽  
Front Office

Aplikasi Pelayanan Terpadu Satu Pintu (PTSP) merupakan pemberian pelayanan terhadap beberapa jenis pelayanan yang diselenggarakan secara terintegrasi dalam satu tempat dan dikontrol oleh sistem pengendalian manajement.  Di dalam Aplikasi PTSP ini ada dua jenis pelayanan yaitu costumer servivce (Cs) dan front office (FO) , di kedua jenis pelayanan itu mempunyai fungsi pelayanan yang berbeda CS berfungsi memberikan pelayanan kepada masyarakat maupun pegawai yang mau melakukan konsultasi meliputi, Ibadah Haji dan Umrah, Pernikahan, Wakaf, Zakat, Kenaikan Pangkat, Kepegawaian sedangkan FO Memberikan pelayanan kepada masyarakat berupa permohonan pindah sekolah, legaliser ijazah, rekomendasi masjid, rekomendasi paspor, Permohonan Arah kiblat, permohonan doa, permohonan rohaniawan, Permohonan data tempat Ibadah, Permohonan data Pernikahan.  Aplikasi PTSP ini dikembangkan dengan metode pengembangan sistem Prototype, metode pengumpulan data dengan wawancara, observasi dan studi pustaka, analisa perancangan sistem dengan menggunakan UML (Unifield Modeling Language). Dalam membangun Aplikasi PTSP informasi digunakan bahasa pemrograman PHP, Basis Data MySQL, Web Server Local apache, Adobe Dreamweaver CS6 sebagai editor web, dan adobe photoshop sebagai editor image. Hasil dari penelitian ini dengan dikembangkannya aplikasi PTSP berbasis web mempermudah petugas kantor dalam pelayanan pengarsipan pencatatan history dan mempermudah dalam melayani masyarakat umum serta memberikan kemudahan kepada masyarakat ketika akan melakukan pelayanan.Kata Kunci— Game, Zombie Hunter, Finite State Machine, Collision Detection.

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

Human action recognition using simple geometric features and a finite state machine

2013 ◽  
Vol 18 (2-3) ◽  
pp. 49-60 ◽  
Author(s):  
Damian Dudzńiski ◽  
Tomasz Kryjak ◽  
Zbigniew Mikrut
Keyword(s):  
Action Recognition ◽  
Finite State Machine ◽  
Recognition Rate ◽  
Human Action Recognition ◽  
Human Action ◽  
Video Stream ◽  
State Machine ◽  
Recognition Algorithm ◽  
Finite State ◽  
Correct Recognition Rate

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.

User permission isolation model based on finite state machine

2013 ◽  
Vol 33 (1) ◽  
pp. 149-152
Author(s):  
Jianjun LI ◽  
Yixiang JIANG ◽  
Jie QIAN ◽  
Wei LI ◽  
Yu LI
Keyword(s):  
Finite State Machine ◽  
State Machine ◽  
Model Based ◽  
Finite State
Sign in / Sign up

Export Citation Format

Share Document