scholarly journals Dynamic and Quantitative Method of Analyzing Service Consistency Evolution Based on Extended Hierarchical Finite State Automata

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Linjun Fan ◽  
Jun Tang ◽  
Yunxiang Ling ◽  
Benxian Li
Keyword(s):  
Large Scale ◽  
Distributed Simulation ◽  
Influential Factor ◽  
Impact Factors ◽  
Dynamic Evolution ◽  
Finite State Automata ◽  
Evolution Analysis ◽  
Finite State ◽  
Service Oriented ◽  
Evolution Algorithms

This paper is concerned with the dynamic evolution analysis and quantitative measurement of primary factors that cause service inconsistency in service-oriented distributed simulation applications (SODSA). Traditional methods are mostly qualitative and empirical, and they do not consider the dynamic disturbances among factors in service’s evolution behaviors such as producing, publishing, calling, and maintenance. Moreover, SODSA are rapidly evolving in terms of large-scale, reusable, compositional, pervasive, and flexible features, which presents difficulties in the usage of traditional analysis methods. To resolve these problems, a novel dynamic evolution model extended hierarchical service-finite state automata (EHS-FSA) is constructed based on finite state automata (FSA), which formally depict overall changing processes of service consistency states. And also the service consistency evolution algorithms (SCEAs) based on EHS-FSA are developed to quantitatively assess these impact factors. Experimental results show that thebad reusability(17.93% on average) is the biggest influential factor, thenoncomposition of atomic services(13.12%) is the second biggest one, and theservice version’s confusion(1.2%) is the smallest one. Compared with previous qualitative analysis, SCEAs present good effectiveness and feasibility. This research can guide the engineers of service consistency technologies toward obtaining a higher level of consistency in SODSA.

On some applications of finite-state automata theory to natural language processing

1996 ◽  
Vol 2 (1) ◽  
pp. 61-80 ◽  
Author(s):  
MEHRYAR MOHRI
Keyword(s):  
Natural Language Processing ◽  
Natural Language ◽  
Language Processing ◽  
Large Scale ◽  
Automata Theory ◽  
Finite State Automata ◽  
Finite State ◽  
New Applications ◽  
New Algorithms

We describe new applications of the theory of automata to natural language processing: the representation of very large scale dictionaries and the indexation of natural language texts. They are based on new algorithms that we introduce and describe in detail. In particular, we give pseudocodes for the determinisation of string to string transducers, the deterministic union of p-subsequential string to string transducers, and the indexation by automata. We report on several experiments illustrating the applications.

AGRICULTURAL PRODUCTION OF CA DONG PEOPLE IN RESETTLEMENT AREA OF TRANH RIVER HYDROPOWER NUMBER 2: CURRENT SITUATION AND IMPACT FACTORS

2020 ◽  
Vol 9 (2) ◽  
Author(s):  
Bùi Thị Bích Lan
Keyword(s):  
Social Relations ◽  
Agricultural Production ◽  
Large Scale ◽  
Transition Process ◽  
Impact Factors ◽  
Small Scale ◽  
Scale Production ◽  
Technical Application ◽  
Production Models ◽  
Role Of The State

In Vietnam, the construction of hydropower projects has contributed significantly in the cause of industrialization and modernization of the country. The place where hydropower projects are built is mostly inhabited by ethnic minorities - communities that rely primarily on land, a very important source of livelihood security. In the context of the lack of common productive land in resettlement areas, the orientation for agricultural production is to promote indigenous knowledge combined with increasing scientific and technical application; shifting from small-scale production practices to large-scale commodity production. However, the research results of this article show that many obstacles in the transition process are being posed such as limitations on natural resources, traditional production thinking or the suitability and effectiveness of scientific - technical application models. When agricultural production does not ensure food security, a number of implications for people’s lives are increasingly evident, such as poverty, preserving cultural identity, social relations and resource protection. Since then, it has set the role of the State in researching and building appropriate agricultural production models to exploit local strengths and ensure sustainability.

scholarly journals Composition of weighted finite transducers in MapReduce

2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Bilal Elghadyry ◽  
Faissal Ouardi ◽  
Sébastien Verel
Keyword(s):  
Speech Processing ◽  
Large Scale ◽  
Large Scale Data ◽  
Finite State Transducers ◽  
Wide Range ◽  
Finite State ◽  
Common Operation ◽  
Efficient Representation ◽  
Weighted Finite State Transducers ◽  
Np Hardness

AbstractWeighted finite-state transducers have been shown to be a general and efficient representation in many applications such as text and speech processing, computational biology, and machine learning. The composition of weighted finite-state transducers constitutes a fundamental and common operation between these applications. The NP-hardness of the composition computation problem presents a challenge that leads us to devise efficient algorithms on a large scale when considering more than two transducers. This paper describes a parallel computation of weighted finite transducers composition in MapReduce framework. To the best of our knowledge, this paper is the first to tackle this task using MapReduce methods. First, we analyze the communication cost of this problem using Afrati et al. model. Then, we propose three MapReduce methods based respectively on input alphabet mapping, state mapping, and hybrid mapping. Finally, intensive experiments on a wide range of weighted finite-state transducers are conducted to compare the proposed methods and show their efficiency for large-scale data.

Characterizations of rough finite state automata

2015 ◽  
Vol 8 (3) ◽  
pp. 721-730 ◽  
Author(s):  
Shambhu Sharan ◽  
Arun K. Srivastava ◽  
S. P. Tiwari
Keyword(s):  
Finite State Automata ◽  
Finite State
Sign in / Sign up

Export Citation Format

Share Document