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


Tytuł:
On State-Synchronized Automata Systems
Autorzy:
Meduna, Alexander
Kučera, Jiřĭ
Powiązania:
https://bibliotekanauki.pl/articles/1373671.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Jagielloński. Wydawnictwo Uniwersytetu Jagiellońskiego
Tematy:
pushdown automata
determinism
recursively enumerable languages
state-synchronized automata systems
automata systems
Opis:
In this paper, we introduce a new kind of automata systems, called state-synchronized automata systems of degree $n$. In general, they consists of $n$ pushdown automata, referred to as their components. These systems can perform a computation step provided that the concatenation of the current states of all their components belongs to a prescribed control language. As its main result, the paper demonstrates that these systems characterize the family of recursively enumerable languages. In fact, this characterization is demostrated in both deterministic and nondeterministic versions of these systems. Restricting their components, these systems provides less computational power.
Źródło:
Schedae Informaticae; 2015, 24; 221-237
0860-0295
2083-8476
Pojawia się w:
Schedae Informaticae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Cryptosystem Based on Reversible Two-dimensional Cellular Automata
Autorzy:
Wiśniewski, A.
Powiązania:
https://bibliotekanauki.pl/articles/92870.pdf
Data publikacji:
2009
Wydawca:
Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:
cellular automata
reversibility
cryptosystem
Opis:
Cellular Automata have been successfully applied to several scientific problems such as among others image processing or data encryption. One could find reversibility of dynamics is a fundamental feature of nature. While the most CA are not reversible in nature, one can find some CA with simple behavior could be reversible. Reversible cellular automata (RCA) as efficient encryption and decryption devices was originally conceived by Kari. In this introduction paper, we analyze and develop reversible cellular automata (RCA) based on Kari’s idea and some Clarridge’s concepts.
Źródło:
Studia Informatica : systems and information technology; 2009, 2(13); 97-105
1731-2264
Pojawia się w:
Studia Informatica : systems and information technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
RCAFE Based Numerical Model of Dynamic Recrystallization
Autorzy:
Legwand, A.
Sitko, M.
Perzyński, K.
Madej, Ł.
Powiązania:
https://bibliotekanauki.pl/articles/100012.pdf
Data publikacji:
2016
Wydawca:
Wrocławska Rada Federacji Stowarzyszeń Naukowo-Technicznych
Tematy:
cellular automata
RCAFE
recrystallization
Opis:
The main goal of the paper is dedicated to proper arrangement of the Finite Element (FE) and Random Cellular Automata (RCA) methods in order to develop numerical model of dynamic recrystallization (DRX) and therefore to simulate microstructure morphology changes during plastic deformation at elevated temperatures. In the approach, Finite Element solver provides information on equivalent stress and strain fields after subsequent time steps. Then these data are transferred to RCA model, which is responsible for evaluation of corresponding microstructure morphology evolution and dislocation density changes. Finally, information from the CA part is send back to the FE solver as an input for the next time step. As a result, a fully coupled RCAFE model to simulate progress of DRX is established. The present paper is directly focused on development of algorithms and methods to transfer input/output data between both FE and RCA models. The developed communication protocol is based on the Abaqus VUMAT subroutine. Examples of obtained results from the developed model are also presented to highlight its potential.
Źródło:
Journal of Machine Engineering; 2016, 16, 2; 52-60
1895-7595
2391-8071
Pojawia się w:
Journal of Machine Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Bisimulation relation for selected types of probabilistic and quantum automata
Autorzy:
Siedlecka-Lamch, O.
Powiązania:
https://bibliotekanauki.pl/articles/121922.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Humanistyczno-Przyrodniczy im. Jana Długosza w Częstochowie. Wydawnictwo Uczelniane
Tematy:
bisimulation relation
probabilistic automata
quantum automata
relacja bisymulacji
automaty probabilistyczne
automaty kwantowe
Opis:
The first step to make transitional systems more efficient is to minimize the number of their states. A bisimulation relation is a mathematical tool that helps in searching for equivalent systems, what is useful in the minimization of algorithms. For two transition systems bisimulation is a binary relation associating systems which behave in the same way in the sense that one system simulates the other and viceversa. The definition for classical systems is clear and simple, but what happens with nondeterministic, probabilistic and quantum systems? This will be the main topic of this article.
Źródło:
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics; 2011, 16; 135-140
2450-9302
Pojawia się w:
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of modified Ritchie-Knott-Rice criterion to cellular automata
Autorzy:
Janus-Gałkiewicz, Urszula
Neimitz, Andrzej
Powiązania:
https://bibliotekanauki.pl/articles/280710.pdf
Data publikacji:
2019
Wydawca:
Polskie Towarzystwo Mechaniki Teoretycznej i Stosowanej
Tematy:
fracture mechanics
cleavage
cellular automata
Opis:
In this paper, the cellular automata model is applied to analyse cleavage and ductile fracture in front of a crack in three-point-bend specimens made of Hardox-400 steel. The research programme was composed of experiments followed by fractographic and numerical analyses. On the basis of microscopic observations, the sizes of cells used in the automata were determined. The algorithm enabled mapping of the two-dimensional crack surface as well as a simulation of temperature-dependent failure mechanisms by defining transition rules based on the modified Ritchie-Knott-Rice cleavage fracture criterion. The critical stress values were estimated and verified by the cellular automata model.
Źródło:
Journal of Theoretical and Applied Mechanics; 2019, 57, 3; 577-590
1429-2955
Pojawia się w:
Journal of Theoretical and Applied Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Simulation of the electrophoresis of DNA by the method of cellular automata
Autorzy:
Krawczyk, Małgorzata
Kułakowski, Krzysztof
Powiązania:
https://bibliotekanauki.pl/articles/747601.pdf
Data publikacji:
2002
Wydawca:
Polskie Towarzystwo Matematyczne
Tematy:
Biochemistry, molecular biology
Cellular automata
Opis:
.
The authors give the description of a new cellular automaton for simulating the electrophoresis of gel DNA. This automaton is deterministic, which corresponds to the well-known Monte Carlo rules holding for the electrophoresis at a low temperature and a high intensity electric field. The experimental results indicate that under such conditions the electrophoresis efficiency depends significantly on the string length.
Źródło:
Mathematica Applicanda; 2002, 30, 44/03
1730-2668
2299-4009
Pojawia się w:
Mathematica Applicanda
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Wykorzystanie automatów komórkowych w modelowaniu ruchu drogowego
Use of cellular automata for traffic analysis
Autorzy:
Małecki, K.
Rokita, M.
Wątróbski, J.
Powiązania:
https://bibliotekanauki.pl/articles/154665.pdf
Data publikacji:
2010
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
automaty komórkowe
symulacja
cellular automata
simulation
Opis:
Uniwersalność automatów komórkowych spowodowała, iż znajdują zastosowanie w wielu dziedzinach, np. w modelowaniu i symulacji ruchu drogowego. Autorzy prezentują dokonania w tym zakresie (tab. 1) oraz formułują nowy model, będący rozwinięciem modelu skrzyżowania dróg prezentowanego w [1] i [8]. Dodatkowo autorzy przedstawiają charakterystykę opracowanego, nowatorskiego systemu, umożliwiającego modelowanie dowolnego obszaru (zespół skrzyżowań i dróg) oraz symulowanie ruchu w ujęciu mikroskopowym.
Cellular automata are considered by some researchers to belong to one of the IT department, which is an artificial intelligence. Even though their history goes back to the forties of the last century, much attention is still paid to the use of cellular automata for the process of testing and simulation of different phenomena. The universality of cellular automata caused their application to many areas such as: physics, computer graphics and traffic modeling. The authors present the achievements in this field (Table 1) and formulate a new traffic model which is a development of the crossroads model defined by Chowdhury-Schadschneider [1] and later by Bartodziej [8]. This new model helps to simulate traffic at the crossroads of two-lane and two-way roads. In addition, there is given the worked out system characteristics which enables modeling any area (intersections and roads) and carrying out the traffic simulations in a microscopic approach. The software consists of two applications: TrafficCA (traffic simulator based on cellular automata) and the map editor (this application enables generating any area including roads, traffic lights and the surroundings). Taking into account the fact that the simulated cases are always correct (carried out in accordance with properly defined models of cellular automata), the developed system, except for the traffic modeling, can be used for showing driver behaviour unfavourable for traffic capacity.
Źródło:
Pomiary Automatyka Kontrola; 2010, R. 56, nr 7, 7; 724-727
0032-4140
Pojawia się w:
Pomiary Automatyka Kontrola
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On mapping onto self-organized criticality
Autorzy:
Wiśniewski, A.
Powiązania:
https://bibliotekanauki.pl/articles/93038.pdf
Data publikacji:
2006
Wydawca:
Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:
cellular automata
self-organizing system
criticality
Opis:
In the report we have discussed a few aspects of SOC concept which in general have strongly influence on explicitness of mapping process. SOC idea is based on group of models and/does not seem to give quite clear instructions whether mapped phenomena exhibit SOC or not. To present the problem we have performed a computer simulation in order to investigate the effect of the critical point within the system evolution process without conservation. We have considered that on two-dimensional cellular automata whose rule consists of one or two subrules. The first one, based on Conway’s model (or very similar to), has represented the local behavior of transmission processes and has been applied in the experiment synchronously, as a fundamental mode. The second one, called a transport rule, has been applied sequentially. That subrule has described the motion of a fraction of individuals. As a result of comparing models of the various sets of rules for the applied size of lattice, we could find that the modified Conway’s model would be merely treated as subcritical.
Źródło:
Studia Informatica : systems and information technology; 2006, 1(7); 207-216
1731-2264
Pojawia się w:
Studia Informatica : systems and information technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Cellular automata: structures and some applications
Automaty komórkowe: struktura i pewne zastosowania
Autorzy:
Burzyński, M.
Cudny, W.
Kosiński, W.
Powiązania:
https://bibliotekanauki.pl/articles/282005.pdf
Data publikacji:
2004
Wydawca:
Polskie Towarzystwo Mechaniki Teoretycznej i Stosowanej
Tematy:
cellular automata
traffic flow
fuzzy rules
Opis:
A new approach to the modelling of various nature phenomena such as predator and prey ecological system, heat transport, spreading of oil slick and traffic flow is introduced. Cellular automata (CA) are discrete dynamical systems whose behaviour is completely specified in terms of simple local relations. They are mathematical models of spatialy distributed processes; however they can lead to an appropriate simulation of comlex dynamic processes. Applications to heat transfer and problems of environmental simulations are done. A discrete automaton model with fuzzy rules to simulate one-way traffic flow is also described. Results of simulations are consistent with phenomena observed in reality. It gives a base to propose the cellular automata tool as an option in modelling and solving problems of complex (and some times, not completely known) nature.
W pracy zaprezentowano metodę modelowania układów i zjawisk obserwowanych w przyrodzie, takich jak dynamika systemu ekologicznego drapieżnik-ofiara, przewodzenie ciepła, rozprzestrzenianie się plamy ropy naftowej po wycieku na wodzie czy ruch strumienia pojazdów na drodze miejskiej. Metodę oparto na tzw. automatach komórkowych, które są układami dyskretnymi o zachowaniach ściśle zdeterminowanych prostymi relacjami o charakterze lokalnym. Automaty komórkowe to matematyczne modele procesów przestrzennych, mogące z powodzeniem opisywać złożone zjawiska dynamiczne. W pracy przedstawiono aplikację do zagadnienia przewodzenia ciepła oraz kilku symulacji środowiskowych. Przedstawiono także model automatowy z regułami rozmytymi opisujący jednokierunkowy ruch pojazdów na drodze. Wyniki symulacji okazały się zgodne z obserwacjami rzeczywistych układów. Zachęcające rezultaty badań skłaniają do postrzegania automatów komórkowych jako efektywnej opcji w modelowaniu i rozwiązywaniu problemów o złożonej (czasem nie całkiem rozpoznanej) naturze.
Źródło:
Journal of Theoretical and Applied Mechanics; 2004, 42, 3; 461-482
1429-2955
Pojawia się w:
Journal of Theoretical and Applied Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Effect of water flows on ship traffic in narrow water channels based on cellular automata
Autorzy:
Hu, H.
Chen, X.
Sun, Z.
Powiązania:
https://bibliotekanauki.pl/articles/260068.pdf
Data publikacji:
2017
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
narrow channel
cellular automata
simulation
ship interaction
Opis:
In narrow water channels, ship traffic may be affected by water flows and ship interactions. Studying their effects can help maritime authorities to establish appropriate management strategies. In this study, a two-lane cellular automation model is proposed. Further, the behavior of ship traffic is analyzed by setting different water flow velocities and considering ship interactions. Numerical experiment results show that the ship traffic density-flux relation is significantly different from the results obtained by classical models. Furthermore, due to ship interactions, the ship lane-change rate is influenced by the water flow to a certain degree.
Źródło:
Polish Maritime Research; 2017, S 3; 130-135
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Using shared memory as a cache in cellular automata water flow simulations on GPUs
Autorzy:
Topa, P.
Młocek, P.
Powiązania:
https://bibliotekanauki.pl/articles/305529.pdf
Data publikacji:
2013
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
cellular automata
GPU computation
modelling physical phenomena
Opis:
Graphics processors (GPU – Graphic Processor Units) recently have gained a lot of interest as an efficient platform for general-purpose computation. Cellular Automata approach which is inherently parallel gives the opportunity to implement high performance simulations. This paper presents how shared memory in GPU can be used to improve performance for Cellular Automata models. In our previous works, we proposed algorithms for Cellular Automata model that use only a GPU global memory. Using a profiling tool, we found bottlenecks in our approach. With this paper, we will introduce modifications that takes an advantage of fast shared memory. The modified algorithm is presented in details, and the results of profiling and performance test are demonstrated. Our unique achievement is comparing the efficiency of the same algorithm working with a global and shared memory.
Źródło:
Computer Science; 2013, 14 (3); 385-401
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On regular copying languages
Autorzy:
Wang, Yang
Hunter, Tim
Powiązania:
https://bibliotekanauki.pl/articles/24201233.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Instytut Podstaw Informatyki PAN
Tematy:
reduplication
copying
finite-state machinery
queue automata
Opis:
This paper proposes a formal model of regular languages enriched with unbounded copying. We augment finite-state machinery with the ability to recognize copied strings by adding an unbounded memory buffer with a restricted form of first-in-first-out storage. The newly introduced computational device, finite-state buffered machines (FS-BMs), characterizes the class of regular languages and languages de-rived from them through a primitive copying operation. We name this language class regular copying languages (RCLs). We prove a pumping lemma and examine the closure properties of this language class. As suggested by previous literature (Gazdar and Pullum 1985, p.278), regular copying languages should approach the correct characteriza-tion of natural language word sets.
Źródło:
Journal of Language Modelling; 2023, 11, 1; 1--66
2299-856X
2299-8470
Pojawia się w:
Journal of Language Modelling
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Critical Phenomena : Towards Modeling with Cellular Automata
Autorzy:
Wiśniewski, A.
Powiązania:
https://bibliotekanauki.pl/articles/92942.pdf
Data publikacji:
2007
Wydawca:
Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:
phase transitions
cellular automata
self-organized criticality
Opis:
The paper presents basic description methods of critical phenomena, i.e. first-order, continuous phase transitions, and an overview of the self-organized criticality concept. In this approach an attempt is made to identify the determinant factors of modeling critical events using cellular automata.
Źródło:
Studia Informatica : systems and information technology; 2007, 2(9); 69-76
1731-2264
Pojawia się w:
Studia Informatica : systems and information technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Complex Computer System Based on Cellular Automata Method Designed to Support Modelling of Laminar Cooling Processes
Autorzy:
Gołąb, R.
Madej, Ł.
Pietrzyk, M.
Powiązania:
https://bibliotekanauki.pl/articles/100057.pdf
Data publikacji:
2014
Wydawca:
Wrocławska Rada Federacji Stowarzyszeń Naukowo-Technicznych
Tematy:
cellular automata
finite element method
cooling process
Opis:
The user friendly computer system that have the capability of modelling material behaviour both at the macro and micro scales was developed in this work. The system was designed to predict microstructure evolution during phase transformation in laminar cooling conditions with the use of the multi scale cellular automata finite element (CAFE) model. The finite element (FE) part is based on the conventional Fourier type equation and is used to predict macroscopic temperature distribution. This is an input for the micro scale cellular automata (CA) model of austenite-ferrite phase transformation. To facilitate the research, proposed micro scale CA model was implemented within developed universal object-oriented programming framework CAF. Description of major assumptions and functionality of the developed numerical system including efficient Graphical User Interface (GUI) is presented in the paper. The intuitive visualization of data obtained in different length scales facilitates work with the software.
Źródło:
Journal of Machine Engineering; 2014, 14, 1; 63-73
1895-7595
2391-8071
Pojawia się w:
Journal of Machine Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł

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