Verification of composed web service using Synthesized Nondeterministic Turing Model (SNTMM) with Multiple Tapes and Stacks

2021 ◽  
Vol 18 (4) ◽  
pp. 0-0
Keyword(s):  
Web Services ◽  
Turing Machine ◽  
General View ◽  
Deterministic System ◽  
Machine Model ◽  
Deterministic Systems ◽  
Proposed Model ◽  
Deterministic Turing Machine ◽  
Verification Model ◽  
Service Need

To verify the composed Web services, a general view of what traits of a service need to be identified is still lacking. The existing verification model did not address any mechanism for getting alternative services if we failed to reach the desired service and partially concentrated on the reachability problem for a deterministic and non-deterministic system in sequential. This paper proposes a Synthesised Non-deterministic Turing Machine Model (SNTMM) by combining the Multistacked Non-deterministic Turing Machine (MSNTM) model and Multitaped Non-deterministic Turing Machine (MTNTM) model to verify the composed Web services for both deterministic and non-deterministic systems in parallel. The deceased transition and departed service marking algorithm have been proposed to address each participated service’s reachability in composing service for all possible input in parallel. This article shows an example to demonstrate the meticulousness of the model. The experimental results show that the performance of the proposed model is measured efficiently

The Turing Machine Model of Sensing, Manipulation, and Control

1989 ◽  
Author(s):  
Constantine Tsikos ◽  
Tom Chmielewski ◽  
Brian Frederick
Keyword(s):  
Turing Machine ◽  
Machine Model ◽  
And Control ◽  
Manipulation And Control

Estimation of CO2 Diffusivity in Brine by Use of the Genetic Algorithm and Mixed Kernels-Based Support Vector Machine Model

2018 ◽  
Vol 141 (4) ◽  
Author(s):  
Qihong Feng ◽  
Ronghao Cui ◽  
Sen Wang ◽  
Jin Zhang ◽  
Zhe Jiang
Keyword(s):  
Genetic Algorithm ◽  
Support Vector Machine ◽  
Diffusion Coefficient ◽  
Co2 Storage ◽  
Co2 Injection ◽  
Support Vector ◽  
Hybrid Technique ◽  
Machine Model ◽  
Proposed Model ◽  
Wide Range

Diffusion coefficient of carbon dioxide (CO2), a significant parameter describing the mass transfer process, exerts a profound influence on the safety of CO2 storage in depleted reservoirs, saline aquifers, and marine ecosystems. However, experimental determination of diffusion coefficient in CO2-brine system is time-consuming and complex because the procedure requires sophisticated laboratory equipment and reasonable interpretation methods. To facilitate the acquisition of more accurate values, an intelligent model, termed MKSVM-GA, is developed using a hybrid technique of support vector machine (SVM), mixed kernels (MK), and genetic algorithm (GA). Confirmed by the statistical evaluation indicators, our proposed model exhibits excellent performance with high accuracy and strong robustness in a wide range of temperatures (273–473.15 K), pressures (0.1–49.3 MPa), and viscosities (0.139–1.950 mPa·s). Our results show that the proposed model is more applicable than the artificial neural network (ANN) model at this sample size, which is superior to four commonly used traditional empirical correlations. The technique presented in this study can provide a fast and precise prediction of CO2 diffusivity in brine at reservoir conditions for the engineering design and the technical risk assessment during the process of CO2 injection.

STOCHASTIC MODELING OF PHYTOPLANKTON–ZOOPLANKTON INTERACTIONS WITH TOXIN PRODUCING PHYTOPLANKTON

2018 ◽  
Vol 26 (01) ◽  
pp. 87-106 ◽  
Author(s):  
T. MIHIRI M. DE SILVA ◽  
SOPHIA R.-J. JANG
Keyword(s):  
Markov Chain ◽  
Stochastic Modeling ◽  
Stochastic Models ◽  
Continuous Time ◽  
Toxin Production ◽  
Mutual Interference ◽  
Deterministic System ◽  
Continuous Time Markov Chain ◽  
Deterministic Systems ◽  
Population Interactions

We construct models of continuous-time Markov chain (CTMC) and Itô stochastic differential equations of population interactions based on a deterministic system of two phytoplankton and one zooplankton populations. The mechanisms of mutual interference among the predator zooplankton and the avoidance of toxin-producing phytoplankton (TPP) by zooplankton are incorporated. Sudden population extinctions occur in the stochastic models that cannot be captured in the deterministic systems. In addition, the effect of periodic toxin production by TPP is lessened when the birth and death of the populations are modeled randomly.

Some advances of the turing machine model of DEDS

1991 ◽  
Vol 24 (14) ◽  
pp. 75-79
Author(s):  
Bian Xiaochun ◽  
Zhang Yongguang ◽  
Qiao Jun
Keyword(s):  
Turing Machine ◽  
Machine Model

TWO TOPICS CONCERNING TWO-DIMENSIONAL AUTOMATA OPERATING IN PARALLEL

1992 ◽  
Vol 06 (02n03) ◽  
pp. 211-225 ◽  
Author(s):  
KATSUSHI INOUE ◽  
ITSUO SAKURAMOTO ◽  
MAKOTO SAKAMOTO ◽  
ITSUO TAKANAMI
Keyword(s):  
Turing Machine ◽  
Finite Automata ◽  
Space Complexity ◽  
Two Dimensional ◽  
Turing Machines ◽  
Small Space ◽  
Bottom Up ◽  
Constructible Function ◽  
Deterministic Turing Machine ◽  
Alternating Turing Machines

This paper deals with two topics concerning two-dimensional automata operating in parallel. We first investigate a relationship between the accepting powers of two-dimensional alternating finite automata (2-AFAs) and nondeterministic bottom-up pyramid cellular acceptors (NUPCAs), and show that Ω ( diameter × log diameter ) time is necessary for NUPCAs to simulate 2-AFAs. We then investigate space complexity of two-dimensional alternating Turing machines (2-ATMs) operating in small space, and show that if L (n) is a two-dimensionally space-constructible function such that lim n → ∞ L (n)/ loglog n > 1 and L (n) ≤ log n, and L′ (n) is a function satisfying L′ (n) =o (L(n)), then there exists a set accepted by some strongly L (n) space-bounded two-dimensional deterministic Turing machine, but not accepted by any weakly L′ (n) space-bounded 2-ATM, and thus there exists a rich space hierarchy for weakly S (n) space-bounded 2-ATMs with loglog n ≤ S (n) ≤ log n.

14.—Dynamic Programming applied to Some Non-linear Stochastic Control Systems

1976 ◽  
Vol 74 ◽  
pp. 175-203
Author(s):  
A. T. Fuller
Keyword(s):  
Dynamic Programming ◽  
Control Systems ◽  
Deterministic System ◽  
Optimal Switching ◽  
Error Performance ◽  
Deterministic Systems ◽  
Switching Curve ◽  
Rough Approximation ◽  
Random Disturbances ◽  
Continuous Dynamic

SynopsisOptimal switching curves are investigated for some second-order control systems with random disturbances, saturating control, and a mean-square-error performance index.It is first shown that the optimal switching curves are asymptotic at infinity to the optimal switching curves for corresponding deterministic systems.The systems are then discretised in time and state, and ordinary dynamic programming is applied to the resulting Markov chain models. The discretisation techniques are described in some detail.The same techniques are applied to a deterministic system for which the optimal switching curve is known, and it is found that the resulting discretisation errors are considerable.Thus it turns out that ordinary discrete dynamic programming gives only a rough approximation to the optimal switching curve. It seems desirable to tackle the equations of continuous dynamic programming by techniques more refined than crude discretisation. One such technique is suggested.

Trapping Runtime Faults from Web Service Fault Ontology

2020 ◽  
Vol 17 (8) ◽  
pp. 3759-3764
Author(s):  
K. Jayashree
Keyword(s):  
Web Services ◽  
Web Service ◽  
Service Users ◽  
Intended Behavior ◽  
Proposed Model ◽  
Different Types ◽  
Service Application ◽  
Common Understanding ◽  
Types Of Faults ◽  
The Web

The ontology offers a clear considerate of the runtime faults in web services and helps to share this common understanding with users and applications. This paper presents Web Service Fault Ontology and to trap the runtime faults from the Web Services Fault Ontology. Web Service Fault Ontology has been developed to represent the different types of faults that can occur during the interactions between service users, service publishers and service registries: publishing, discovery, binding and execution of web services. Ontology has been proposed to define the intended behavior of web services from the service provider. A sample web service application was developed for testing the proposed model.

Hypermachines

2011 ◽  
Vol 76 (2) ◽  
pp. 620-636 ◽  
Author(s):  
Sy-David Friedman ◽  
P. D. Welch
Keyword(s):  
Turing Machine ◽  
Infinite Time ◽  
Machine Model ◽  
Infinite Loop

AbstractThe Infinite Time Turing Machine model [8] of Hamkins and Kidder is, in an essential sense, a “Σ2-machine” in that it uses a Σ2Liminf Rule to determine cell values at limit stages of time. We give a generalisation of these machines with an appropriate Σn rule. Such machines either halt or enter an infinite loop by stage , again generalising precisely the ITTM case.The collection of such machines taken together computes precisely those reals of the least model of analysis.

Sign in / Sign up

Export Citation Format

Share Document