Infections as Abstract Symbolic Finite Automata: Formal Model and Applications

2015 ◽  
Author(s):  
Mila Dalla Preda ◽  
Isabella Mastroeni
Keyword(s):  
Formal Model ◽  
Finite Automata

scholarly journals A Formal Model for Semantic Computing Based on Generalized Probabilistic Automata

Entropy ◽  
2019 ◽  
Vol 21 (9) ◽  
pp. 903
Author(s):  
Guangjian Huang ◽  
Shahbaz Hassan Wasti ◽  
Lina Wei ◽  
Yuncheng Jiang
Keyword(s):  
Theoretical Approach ◽  
Weather Forecasting ◽  
Formal Model ◽  
Finite Automata ◽  
Formal Theory ◽  
Theory Of Computation ◽  
Probabilistic Automata ◽  
Semantic Reasoning ◽  
Input Alphabet ◽  
Semantic Computing

In most previous research, “semantic computing” refers to computational implementations of semantic reasoning. It lacks support from the formal theory of computation. To provide solid foundations for semantic computing, researchers propose a different understanding of semantic computing based on finite automata. This approach provides a computer theoretical approach to semantic computing. But finite automata are not capable enough to deal with imprecise knowledge. Therefore, in this paper, we provide foundations for semantic computing based on probabilistic automata. Even though traditional probabilistic automata can handle imprecise knowledge, their limitation resides in their being defined on a fixed finite input alphabet. This deeply restricts the abilities of automata. In this paper, we rebuild traditional probabilistic automata for semantic computing. Furthermore, our new probabilistic automata are robust enough to handle any alphabet as input. They have better performances in many applications. We provide an application for weather forecasting, a domain for which traditional probabilistic automata are not effective due to their finite input alphabet. Our new probabilistic automata can overcome these limitations.

A novel cryptosystem based on abstract automata and Latin cubes

2015 ◽  
Vol 52 (2) ◽  
pp. 221-232
Author(s):  
Pál Dömösi ◽  
Géza Horváth
Keyword(s):  
Block Cipher ◽  
Finite Automata ◽  
Theoretical Background ◽  
Point Of View ◽  
Theoretical Point ◽  
Transition Matrices ◽  
Encryption And Decryption ◽  
Secret Keys ◽  
Automata Network ◽  
Fully Functioning

In this paper we introduce a novel block cipher based on the composition of abstract finite automata and Latin cubes. For information encryption and decryption the apparatus uses the same secret keys, which consist of key-automata based on composition of abstract finite automata such that the transition matrices of the component automata form Latin cubes. The aim of the paper is to show the essence of our algorithms not only for specialists working in compositions of abstract automata but also for all researchers interested in cryptosystems. Therefore, automata theoretical background of our results is not emphasized. The introduced cryptosystem is important also from a theoretical point of view, because it is the first fully functioning block cipher based on automata network.

Parallel Combining Different Approaches to Multi-pattern Matching for Fpga-based Security Systems

2017 ◽  
Vol 5 (1) ◽  
pp. 8-15
Author(s):  
Sergii Hilgurt ◽  
Keyword(s):  
Information Security ◽  
Pattern Matching ◽  
Intrusion Detection System ◽  
Detection System ◽  
Finite Automata ◽  
Network Intrusion Detection ◽  
Security Systems ◽  
Analytical Technique ◽  
Network Intrusion ◽  
Pros And Cons

The multi-pattern matching is a fundamental technique found in applications like a network intrusion detection system, anti-virus, anti-worms and other signature- based information security tools. Due to rising traffic rates, increasing number and sophistication of attacks and the collapse of Moore’s law, traditional software solutions can no longer keep up. Therefore, hardware approaches are frequently being used by developers to accelerate pattern matching. Reconfigurable FPGA-based devices, providing the flexibility of software and the near-ASIC performance, have become increasingly popular for this purpose. Hence, increasing the efficiency of reconfigurable information security tools is a scientific issue now. Many different approaches to constructing hardware matching circuits on FPGAs are known. The most widely used of them are based on discrete comparators, hash-functions and finite automata. Each approach possesses its own pros and cons. None of them still became the leading one. In this paper, a method to combine several different approaches to enforce their advantages has been developed. An analytical technique to quickly advance estimate the resource costs of each matching scheme without need to compile FPGA project has been proposed. It allows to apply optimization procedures to near-optimally split the set of pattern between different approaches in acceptable time.

Complexity and Universality of Iterated Finite Automata

2009 ◽  
Vol 18 (1) ◽  
pp. 145-158
Author(s):  
Jiang Zhang ◽  
Keyword(s):  
Finite Automata

DEVELOPMENT OF A METHOD FOR DESIGNING INFORMATION SYSTEMS FOR ENERGY COMPANIES

2020 ◽  
Vol 5 (333) ◽  
pp. 53-57
Author(s):  
T.B. Aldongar ◽  
◽  
F.U. Malikova ◽  
G.B. Issayeva ◽  
B.R. Absatarova ◽  
...  
Keyword(s):  
Information Systems ◽  
Business Processes ◽  
Design Research ◽  
Graphical Model ◽  
Formal Model ◽  
Workflow Management ◽  
Research Process ◽  
Information Models ◽  
The Creation ◽  
Concept Of Information

The creation of information models requires the use of known methods and the development of new methods of formalizing the pre-design research process. The modeling process consists of four stages: data collection on the object of management - pre-project research; creation of a graphical model of business processes taking place in the enterprise; development of a formal model of business processes; business research by optimizing the formal model. To support the creation of workflow management services and systems, the complex offers methodologies, standards and specialized software that make up the developer's tools. This can be ensured only by modern automated methods based on information systems. It is important that the information collected is structured to meet the needs of potential users and stored in a form that allows the use of modern access technologies. Before discussing the effectiveness of FIM, it should be noted that the basic concept of information itself is still not the same. In a pragmatic way, it is a set of messages in the form of an important document for the system. Information can be evaluated not only by volume, but also by various parameters, the most important of which are: timeliness, relevance, value, aging, accuracy, etc. in addition, the information may be clear, probable and accurate. The methods of its reception and processing are different in each case.

An Information-theoretical Model for Breast Cancer Detection

2008 ◽  
Vol 47 (04) ◽  
pp. 322-327 ◽  
Author(s):  
D. Blokh ◽  
N. Zurgil ◽  
I. Stambler ◽  
E. Afrimzon ◽  
Y. Shafran ◽  
...  
Keyword(s):  
Breast Cancer ◽  
Cancer Detection ◽  
Hamming Distance ◽  
Formal Model ◽  
Methodological Approach ◽  
Breast Cancer Detection ◽  
Receptor Expression ◽  
Diagnostic Model ◽  
Model Parameters ◽  
Two Stages

Summary Objectives: Formal diagnostic modeling is an important line of modern biological and medical research. The construction of a formal diagnostic model consists of two stages: first, the estimation of correlation between model parameters and the disease under consideration; and second, the construction of a diagnostic decision rule using these correlation estimates. A serious drawback of current diagnostic models is the absence of a unified mathematical methodological approach to implementing these two stages. The absence of aunified approach makesthe theoretical/biomedical substantiation of diagnostic rules difficult and reduces the efficacyofactual diagnostic model application. Methods: The present study constructs a formal model for breast cancer detection. The diagnostic model is based on information theory. Normalized mutual information is chosen as the measure of relevance between parameters and the patterns studied. The “nearest neighbor” rule is utilized for diagnosis, while the distance between elements is the weighted Hamming distance. The model concomitantly employs cellular fluorescence polarization as the quantitative input parameter and cell receptor expression as qualitative parameters. Results: Twenty-four healthy individuals and 34 patients (not including the subjects analyzed for the model construction) were tested by the model. Twenty-three healthy subjects and 34 patients were correctly diagnosed. Conclusions: The proposed diagnostic model is an open one,i.e.it can accommodate new additional parameters, which may increase its effectiveness.

Sign in / Sign up

Export Citation Format

Share Document