Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "automata" wg kryterium: Temat


Wyświetlanie 1-8 z 8
Tytuł:
Probability timed automata for investigating communication processes
Autorzy:
Piech, H.
Grodzki, G.
Powiązania:
https://bibliotekanauki.pl/articles/331047.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
protocol logic
probabilistic timed automata
communication security
Opis:
Exploitation characteristics behaves as a decreasing valors factor (DVF) which can be connected with degradation processes. It is a structure that consists of independent attributes which represent situations generally connected with a given exploitation factor. The multi-attribute structure contains attributes directly and indirectly referring to the main factor. Attribute states, by definition, can only maintain or decrease their values. Such situations are met in security, reliability, exploitation, fatigues and many complex one-directed or irreversible processes. The main goal refers to protocol security analysis during the realization of the communication run that specifies the assessment of the level of current and oncoming threats connected with cryptography authentication. In the communication run, the operations of different protocols mutually interleave. Our concept is based on the algorithm of attributes correction during exploitation process realization (Blanchet et al., 2008). The monitoring and correcting procedures make it possible to provide forecast information about possible threats on the basis of the structure of the current attribute values.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2015, 25, 2; 403-414
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Correcting Spelling Errors by Modelling Their Causes
Autorzy:
Deorowicz, S.
Ciura, M. G.
Powiązania:
https://bibliotekanauki.pl/articles/908544.pdf
Data publikacji:
2005
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
korekcja pisowni
automat skończony
błąd pisowni
spelling correction
finite state automata
spelling errors
Opis:
This paper accounts for a new technique of correcting isolated words in typed texts. A language-dependent set of string substitutions reflects the surface form of errors that result from vocabulary incompetence, misspellings, or mistypings. Candidate corrections are formed by applying the substitutions to text words absent from the computer lexicon. A minimal acyclic deterministic finite automaton storing the lexicon allows quick rejection of nonsense corrections, while costs associated with the substitutions serve to rank the remaining ones. A comparison of the correction lists generated by several spellcheckers for two corpora of English spelling errors shows that our technique suggests the right words more accurately than the others.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2005, 15, 2; 275-285
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Minimal state automata for detecting a β globin gene mutation
Autorzy:
Ferdania, Devi Fitri
Irawati, -
Garminia, Hanni
Akhmaloka, -
Rachmansyah, Kemal Aziez
Powiązania:
https://bibliotekanauki.pl/articles/1838203.pdf
Data publikacji:
2021
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
minimal state automata
syntactic monoid
β-thalassemia
biological sequences
automat stanu minimalnego
monoid syntaktyczny
sekwencja biologiczna
Opis:
Beta-thalassemia is an autosomal recessive blood disorder characterized by abnormalities in the synthesis of β globin. Together with α globin, it is a subunit of globin protein, called hemoglobin, located inside our red blood cells to deliver oxygen from the lungs to all of the tissues throughout our body. Thereby, individuals with β-thalassemia will often feel limp due to a lack of oxygen dissolved in their blood. In this paper, a finite state automaton to detect and classify β globin gene mutations using its DNA sequence is constructed. Finite state automata have a close connection to an algebraic structure, that is, a monoid. Together with the theory of the syntactic monoid, we present a methodology to minimize the number of the internal states of an automaton to have minimal state automata. Therefore, a minimal state automaton can be constructed to detect β globin gene mutation causing the β-thalassemia disease. We have developed a MATLAB program to conduct the appropriate simulations.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2021, 31, 2; 337-351
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Fault diagnosis in nonlinear hybrid systems
Autorzy:
Zhirabok, A.
Shumsky, A.
Powiązania:
https://bibliotekanauki.pl/articles/330628.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
hybrid system
finite automata
mode activator
fault diagnosis
nonparametric method
system hybrydowy
automat skończony
diagnostyka uszkodzeń
metoda nieparametryczna
Opis:
The problem of fault diagnosis in hybrid systems is investigated. It is assumed that the hybrid systems under consideration consist of a finite automaton, a set of nonlinear difference equations and the so-called mode activator that coordinates the action of the other two parts. To solve the fault diagnosis problem, hybrid residual generators based on both diagnostic observers and parity relations are used. It is shown that the hybrid nature of the system imposes some restrictions on the possibility of creating such generators. Sufficient solvability conditions of the fault diagnosis problem are found. Examples illustrate details of the solution.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2018, 28, 4; 635-648
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Decentralized job scheduling in the cloud based on a spatially generalized Prisoner’s Dilemma game
Autorzy:
Gąsior, J.
Seredyński, F.
Powiązania:
https://bibliotekanauki.pl/articles/329736.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
job scheduling
multiobjective optimization
genetic algorithm
prisoner's dilemma
cellular automata
harmonogramowanie zadań
optymalizacja wielokryterialna
algorytm genetyczny
dylemat więźnia
automat komórkowy
Opis:
We present in this paper a novel distributed solution to a security-aware job scheduling problem in cloud computing infrastructures. We assume that the assignment of the available resources is governed exclusively by the specialized brokers assigned to individual users submitting their jobs to the system. The goal of this scheme is allocating a limited quantity of resources to a specific number of jobs minimizing their execution failure probability and total completion time. Our approach is based on the Pareto dominance relationship and implemented at an individual user level. To select the best scheduling strategies from the resulting Pareto frontiers and construct a global scheduling solution, we developed a decision-making mechanism based on the game-theoretic model of Spatial Prisoner’s Dilemma, realized by selfish agents operating in the two-dimensional cellular automata space. Their behavior is conditioned by the objectives of the various entities involved in the scheduling process and driven towards a Nash equilibrium solution by the employed social welfare criteria. The performance of the scheduler applied is verified by a number of numerical experiments. The related results show the effectiveness and scalability of the scheme in the presence of a large number of jobs and resources involved in the scheduling process.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2015, 25, 4; 737-751
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Evolving morphogenetic fields in the zebra skin pattern based on Turings morphogen hypothesis
Autorzy:
Gravan, C. P.
Lahoz-Beltra, R.
Powiązania:
https://bibliotekanauki.pl/articles/907636.pdf
Data publikacji:
2004
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
pole morfogenetyczne
model reakcji-dyfuzji
automat komórkowy
mammalian coat pattern
morphogenetic field
Turing reaction-diffusion
evolving cellular automata
developmental models
modeling biological structures
Opis:
One of the classical problems of morphogenesis is to explain how patterns of different animals evolved resulting in a consolidated and stable pattern generation after generation. In this paper we simulated the evolution of two hypothetical morphogens, or proteins, that diffuse across a grid modeling the zebra skin pattern in an embryonic state, composed of pigmented and nonpigmented cells. The simulation experiments were carried out applying a genetic algorithm to the Young cellular automaton: a discrete version of the reaction-diffusion equations proposed by Turing in 1952. In the simulation experiments we searched for proper parameter values of two hypothetical proteins playing the role of activator and inhibitor morphogens. Our results show that on molecular and cellular levels recombination is the genetic mechanism that plays the key role in morphogen evolution, obtaining similar results in the presence or absence of mutation. However, spot patterns appear more often than stripe patterns on the simulated skin of zebras. Even when simulation results are consistent with the general picture of pattern modeling and simulation based on the Turing reaction-diffusion, we conclude that the stripe pattern of zebras may be a result of other biological features (i.e., genetic interactions, the Kipling hypothesis) not included in the present model.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2004, 14, 3; 351-361
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Cellular Automata and Many-Particle Systems Modeling Aggregation Behavior Among Populations
Autorzy:
Morale, D.
Powiązania:
https://bibliotekanauki.pl/articles/929762.pdf
Data publikacji:
2000
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
równanie różniczkowe stochastyczne
równanie różniczkowo-całkowe
cellular automata
individual-based models
stochastic differential equations
law of large numbers
density dependence
nonlinear integrodifferential equations
Opis:
A cellular automaton model is presented in order to describe mutual interactions among the individuals of a population due to social decisions.The scheme is used for getting qualitative results, comparable to field experiments carried out on a population of ants which present an aggregative behavior. We also present a second description of a biological spatially structured population of N individuals by a system of stochastic differential equations of Ito type. A 'law of large numbers' to a continuum dynamics described by an integro-differential equation is given.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2000, 10, 1; 157-173
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Segmentation of breast cancer fine needle biopsy cytological images
Autorzy:
Hrebień, M.
Steć, P.
Nieczkowski, T.
Obuchowicz, A.
Powiązania:
https://bibliotekanauki.pl/articles/907946.pdf
Data publikacji:
2008
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
segmentacja obrazów
algorytm działów wodnych
aktywne kontury
obraz cytologiczny
transformata Hough'a
automat komórkowy
metoda GrowCut
cytological image segmentation
Hough transform
watershed algorithm
active contours
cellular automata GrowCut method
Opis:
This paper describes three cytological image segmentation methods. The analysis includes the watershed algorithm, active contouring and a cellular automata GrowCut method. One can also find here a description of image pre-processing, Hough transform based pre-segmentation and an automatic nuclei localization mechanism used in our approach. Preliminary experimental results collected on a benchmark database present the quality of the methods in the analyzed issue. The discussion of common errors and possible future problems summarizes the work and points out regions that need further research.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2008, 18, 2; 159-170
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-8 z 8

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies