Search results for: COMPRESSION OF AUTOMATA - Bridge of Knowledge

Search

Search results for: COMPRESSION OF AUTOMATA

Search results for: COMPRESSION OF AUTOMATA

  • Pomiary Automatyka Robotyka

    Journals

    ISSN: 1427-9126

  • Automatyka Elektryka Zakłócenia

    Journals

    ISSN: 2082-4149

  • AUTOMATICA

    Journals

    ISSN: 0005-1098 , eISSN: 1873-2836

  • Automatyka / Automatics

    Journals

    ISSN: 1429-3447 , eISSN: 2353-0952

  • Comparison of chest compressions with and without LUCAS3 mechanical chest compression system during resuscitation performed by novice physicians

    Publication
    • J. Majer
    • P. Zwolinski
    • Z. Popielarska
    • D. Dunder
    • O. Aniolek
    • M. Madziala
    • A. Madziala
    • L. Szarpak
    • M. Andrzej Madziała

    - Postępy Nauk Medycznych - Year 2018

    Full text to download in external service

  • Acta Mechanica et Automatica

    Journals

    ISSN: 1898-4088 , eISSN: 2300-5319

  • Journal of Cellular Automata

    Journals

    ISSN: 1557-5969 , eISSN: 1557-5977

  • AUTOMATIKA

    Journals

    ISSN: 0005-1144 , eISSN: 1848-3380

  • Optimization of Automata

    Publication

    - Year 2014

    This book is conceived as an effort to gather all algorithms and methods developed by the author of the book that concern three aspects of optimization of automata: incrementality, hashing and compression. Some related algorithms and methods are given as well when they are needed to complete the picture.

  • Perfect hashing with pseudo-minimal bottom-up deterministic tree automata

    Publication

    - Year 2008

    We describe a technique that maps unranked trees to their hash codes using a bottom-up deterministic tree automaton (DTA). In contrast to techniques implemented with minimal tree automata, our procedure builds a pseudo-minimal DTA. Pseudo-minimal automata are larger than the minimal ones but in turn the mapping can be arbitrary, so it can be determined prior to the automaton construction. We also provide procedures to build incrementally...

  • On a Recurrence Arising in Graph Compression

    Publication

    - ELECTRONIC JOURNAL OF COMBINATORICS - Year 2012

    In a recently proposed graphical compression algorithm by Choi and Szpankowski (2012), the following tree arose in the course of the analysis. The root contains n balls that are consequently distributed between two subtrees according to a simple rule: In each step, all balls independently move down to the left subtree (say with probability p) or the right subtree (with probability 1􀀀p). A new node is created as long as...

    Full text available to download

  • Preserving Trees in Automata

    Publication

    - Year 2015

    We present a method to store additional information in a minimal automaton so that it is possible to compute a corresponding tree node number for a state. The number can then be used to retrieve additional information. The method works for minimal (and any other) deterministic acyclic finite state automata (DFAs). We also show how to compute the inverse mapping.

    Full text to download in external service

  • Compression algorithms for multibeam sonar records

    Publication

    - HYDROACOUSTICS - Year 2008

    Jednym z najczęściej używanych urządzeń służących do szeroko rozumianego telemonitoringu morskiego są sonary wielowiązkowe (ang. Multibeam systems MBS). Ich wysoka wydajność w tworzeniu informacji o obiektach znajdujących się pod wodą skutkuje w dużych ilościach danych pozyskiwanych podczas rejsów badawczych i pomiarowych. W tym kontekście, proces przechowywania i zarządzania takim magazynem danych staje się istotnym problemem...

    Full text available to download

  • Journal of Automata, Languages and Combinatorics

    Journals

    ISSN: 1430-189X

  • Perfect hashing tree automata

    Publication

    - Year 2008

    We present an algorithm that computes a function that assigns consecutive integers to trees recognized by a deterministic, acyclic, finite-state, bottom-up tree automaton. Such function is called minimal perfect hashing. It can be used to identify trees recognized by the automaton. Its value may be seen as an index in some other data structures. We also present an algorithm for inverted hashing.Przedstawiamy algorytm, który oblicza...

    Full text to download in external service

  • A new library for construction of automata

    Publication

    - Year 2017

    We present a new library of functions that construct minimal, acyclic, deterministic, finite-state automata in the same format as the author's fsa package, and also accepted by the author's fadd library of functions that use finite-state automata as dictionaries in natural language processing.

  • AUTOMATYKA ELEKTROENERGETYCZNA

    Journals

    ISSN: 1230-7815

  • On the compression of multibeam sonar raw bathymetry data

    Publication

    Multibeam sonars are widely used in applications like high resolution bathymetry measurements or underwater object imaging. One of the significant problems in multibeam sensing of the marine environment is large amount of data which must be transmitted from the sonar processing unit to an operator station using a limited bit rate channel. For instance, such a situation would be in the case when the multibeam sonar was mounted on...

  • NON-LINE ANALYSIS OF STIFFNESS IN COMPRESSION CONDITIONS

    Publication

    The analyzes were aimed at demonstrating the influence of parameters describing the deformation of the structure on the uncertainty of critical force, and the impact of technological imperfections on stress uncertainty in compression conditions. In a linear buckling analysis, the problem is considered only for the initial, permanent state of the stiffness matrix. In the case of demonstrating the influence of initial deformations...

    Full text available to download

  • The flux compression generator load parameters selection

    Computer simulation results of the flux compression generator (FCG) loaded with an inductor has been presented in this paper. Simulation research has been performed in order to select the parameters of FCG load coil properly. The influence of the load inductance and resistance on the current gain factor and the magnetic field energy accumulated in a load coil has been investigated.

    Full text available to download

  • Gazetteer compression technique based on substructure recognition

    Publication

    - Year 2006

    Automaty skończone są najlepszą formą reprezentacji słowników do przetwarzania języka naturalnego. Przedstawiamy nową technikę kompresji, która jest szczególnie użyteczna w stosunku do pewnego rodzaju słowników. Zastępujemy wielokrotnie występujące podstruktury ich niepowtarzalnymi reprezentantami. Do ich znalezienia traktujemy wektor przejść jako tekst i stosujemy technikę kompresji tekstu w stylu Ziv-Lempel, która znajduje powtórzenia...

    Full text to download in external service

  • The Effectiveness of Semi-Automated and Fully Automatic Segmentation for Inferior Alveolar Canal Localization on CBCT Scans: A Systematic Review

    Publication
    • J. Issa
    • R. Olszewski
    • M. Dyszkiewicz-Konwińska

    - International Journal of Environmental Research and Public Health - Year 2022

    Full text to download in external service

  • An implementation of deterministic tree automata minimization

    Publication

    - Year 2007

    Wstępujący, deterministyczny, skończony automat drzewiasty (DTA) może być używany jako struktura danych do przechowywania zbiorów nieuporządkowanych drzew bez narzuconej liczby poddrzew. Takie automaty są zwykle rzadsze niż automaty działające na napisach i dlatego należy zwrócić szczególną uwagę na ich wydajną minimalizację. W dostępnej literaturze jest jednak ciężko znaleźć proste i szczegółowe opisy procedury minimalizacji....

  • Smaller representation of finite state automata

    Publication

    - THEORETICAL COMPUTER SCIENCE - Year 2012

    This paper is a follow-up to Jan Daciuk's experiments on space-efficient finite state automata representation that can be used directly for traversals in main memory (Daciuk, 2000)[4]. We investigate several techniques for reducing memory footprint of minimal automata, mainly exploiting the fact that transition labels and transition pointer offset values are not evenly distributed and so are suitable for compression. We achieve...

    Full text available to download

  • Incremental construction of finite-state automata

    Publication

    - Year 2013

    Rozdział przedstawia algorytmy przyrostowego i półprzyrostowego tworzenia minimalnych deterministycznych automatów skończonych.

    Full text to download in external service

  • Smaller Representation of Finite State Automata

    Publication

    This paper is a follow-up to Jan Daciuk's experiments on space-effcient finite state automata representation that can be used directly for traversals in main memory. We investigate several techniques of reducing memory footprint of minimal automata, mainly exploiting the fact that transition labels and transition pointer offset values are not evenly distributed and so are suitable for compression. We achieve a gain of around 20-30%...

    Full text to download in external service

  • Les transducteurs à sorties variables

    Publication

    - Year 2006

    W przetwarzaniu języka naturalnego słowniki elektroniczne wiążą ze słowami informacje. Najwydajniejsza reprezentacja takich słowników używa maszyn ze skończoną liczbą stanów (automatów prostych lub automatów Mealy'ego). W tym artykule wzorując się na algorytmach bezpośredniej budowy minimalnego automatu deterministycznego proponujemy nowy typ automatu Mealy'ego. Ta nowa forma pozwala na szybkie obliczanie informacji wyjściowej...

    Full text to download in external service

  • U-Turn Compression to a New Isostructural Ferrocene Phase

    Publication

    - Journal of Physical Chemistry Letters - Year 2013

    Full text to download in external service

  • Electroelastic biaxial compression of nanoplates considering piezoelectric effects

    Publication

    - Year 2018

    In the present theoretical work, it is assumed that a piezoelectric nanoplate is connected to the voltage meter which voltages have resulted from deformation of the plate due to in-plane compressive forces whether they are critical buckling loads or arbitrary forces. In order to derive governing equations, a simplified four-variable shear deformation plate theory has been employed using Hamilton’s principle and Von-Kármán...

    Full text to download in external service

  • Algorithms for Ship Movement Prediction for Location Data Compression

    Due to safety reasons, the movement of ships on the sea, especially near the coast should be tracked, recorded and stored. However, the amount of vessels which trajectories should be tracked by authorized institutions, often in real time, is usually huge. What is more, many sources of vessels position data (radars, AIS) produces thousands of records describing route of each tracked object, but lots of that records are correlated...

    Full text available to download

  • Lossless Compression of Binary Trees with Correlated Vertex Names

    Publication

    - Year 2016

    Compression schemes for advanced data structures have become the challenge of today. Information theory has traditionally dealt with conventional data such as text, image, or video. In contrast, most data available today is multitype and context-dependent. To meet this challenge, we have recently initiated a systematic study of advanced data structures such as unlabeled graphs [1]. In this paper, we continue this program by considering...

    Full text to download in external service

  • Innovative cold-formed GEB section under compression

    Cold-formed steel sections extensively affect the modern steel construction industry. Not only are they used as secondary elements like purlins or sheeting, but also they can serve as primary load-bearing members in fabricated steel panels and trusses. A new cross-section called shortly a GEB may serve as that member. However, its existence of the metal building structures industry depends on the exact, optimal dimensional parameters...

  • DME as alternative fuel for compression ignition engines – a review

    Publication

    The ecological issues and the depletion of crude oil, has led the researchers to seeking for non-petroleum based alternative fuels, along with more advanced combustion technologies, and after-treatment systems. The use of clean alternative fuels is the one of the most perspective method that aiming at resolving of the said issues. One of the promising alternative fuels that can be used as a clean highefficiency compression ignition...

    Full text available to download

  • Experiments on compression ignition engine powered by nano-fuels

    The use of nanoparticles in fuels provides new opportunities for modification of fuel properties, which may affect the operational parameters of engines, in particular the efficiency and fuel consumption. The paper presents comparison of compression ignition engine performance fuelled with neat diesel and nano-diesel. Alumina (Al2O3) was used as nanoparticles. Surface-active substances, including Span 80 surfactant, as well as...

    Full text available to download

  • Discrete simulations of a triaxial compression test for sand by DEM.

    Artykuł przedstawia wyniki symulacji dyskretnych dla ściskania trójosiowego stosując metodę elementów dyskretnych DEM. Symulacje wykonano dla piasku. Zastosowano kuli z momentami kontaktu do symulacji kształtu ziaren. Przeprowadzono analizy dla różnych zmiennych parametrów: średnica piasku, krzywa uziarnienia, kształt ziaren, wymiary próbki i warunki brzegowe.

    Full text available to download

  • Modelling of concrete behaviour in uniaxial compression and tension with DEM.

    Publication

    W artykule omowiono wyniki modelowania betonu podczas jednoosiowego sciskania i rozciagania stosujac metode elementów dyskretnych. Beton zostal opisany jako material 3-fazowy (kruszywo, zaprawa cementowa i strefy kontaktu). Szczegolna uwage zwrocono na zjawiska mikro-strukturalne na poziomie kruszywa (lancuchy sil, wiry, obroty ziaren). Wyniki numeryczne zostaly porownano z wynikami badan doswiadczalnych.

    Full text available to download

  • A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata

    Publication

    We describe a technique that maps unranked trees to arbitrary hash codes using a bottom-up deterministic tree automaton (DTA). In contrast to other hashing techniques based on automata, our procedure builds a pseudo-minimal DTA for this purpose. A pseudo-minimal automaton may be larger than the minimal one accepting the same language but, in turn, it contains proper elements (states or transitions that are unique) for every input...

    Full text to download in external service

  • Zeszyty Naukowe Politechniki Śląskiej. Automatyka

    Journals

    ISSN: 0434-0760

  • Dynamic Perfect hashing with finite-state automata

    Publication

    - Year 2005

    Minimalna doskonała funkcja mieszająca dostarcza odwzorowania zbioru n niepowtarzalnych słów w zwarty zakres n liczb całkowitych. Gdy jest realizowane za pomocą automatów skończonych, odwzorowanie wynika z porządku słów (zwykle alfabetycznego) w zbiorze. Dodanie nowych słów zmieniłoby porządek słów rozpoznawanych przez automat, zmieniając całe odwzorowanie i czyniąc je bezużytecznym w wielu dziedzinach. Dlatego nazywamy je statycznym....

  • Complexity of weak acceptonic conditions in tree automata

    Publication

    - INFORMATION PROCESSING LETTERS - Year 2002

    Rozważano złożoność problemu pustości dla automatów na drzewach ze słabymi warunkami akceptowalności. Rozważano także translacje pomiędzy słabymi i silnymi warunkami akceptowalności.

  • Finite automata for compact representation of tuple dictionaries.

    Publication

    - THEORETICAL COMPUTER SCIENCE - Year 2004

    Opisane zostaje uogólnienie struktury danych - słownika, zwane słownikiem n-tek. Słownik n-tek przedstawia odwzorowanie n-tek łańcuchów znaków na pewne wartości. Motywacją dla powstania tej struktury danych są praktyczne zastosowania w przetwarzaniu języka i mowy, w których obszerne słowniki n-tek używane są do przedstawiania modeli języka. Przedstawiona zostaje technika oszczędnej reprezentacji słowników n-tek. Ta technika...

    Full text available to download

  • Incremental construction of Minimal Tree Automata [online]

    Publication

    - ALGORITHMICA - Year 2009

    We describe an algorithm that allows the incremental addition or removal of unranked ordered trees to minimal frontier-to-root deterministic tree automaton (DTA). The algorithm takes a tree t and a minimal DTA A as input; it outputs a minimal DTA A' which accepts the language L(A) accepted by A incremented (or decremented) with the tree t. The algorithm can be used to efficiently maintain dictionaries which store large collections...

    Full text to download in external service

  • Natural language dictionaries implemented as finite automata

    Publication

    - Year 2010

    Rozdział przedstawia wykorzystanie automatów skończonych jako słowników języka naturalnego. Podane są podstawy teoretyczne. Omówione są zastosowania: realizacja doskonałej funkcji mieszającej, analizy i syntezy morfologicznej, poprawiania pisowni i dopisywania znaków diakrytycznych, wydobywanie informacji. Podano algorytmy tworzenia automatów oraz omówiono sposoby reprezentacji automatów z uwzględnieniem kompresji.

    Full text to download in external service

  • Application of a cellular automata model to granular flow

    Publication

    Przedstawiono wyniki modelowania przepływów granulowanych przy zastosowaniu automatu komórkowego. Obliczenia wykonano dla silosów ze wstawkami i ścianką szczelną. Przyjęto różne schematy propagacji ziaren.

    Full text available to download

  • Experimental research of the stability of steel cylindricalshell subjected to circumferential compression

    Publication

    - Year 2008

    At the Department of Metal Structures Gdańsk University of Technology, experiments have been performed on the stability of shell of steel cylindrical models. The experiments have been carried on a test bench built at the Department. The design based on other test benches which were created in the past by other scientists, where modernized by the courtesy of companies that offer modern solutions. The test bench enables to generate...

  • Speech codec enhancements utilizing time compression and perceptual coding

    Publication

    A method for encoding wideband speech signal employing standardized narrowband speech codecs is presented as well as experimental results concerning detection of tonal spectral components. The speech signal sampled with a higher sampling rate than it is suitable for narrowband coding algorithm is compressed in order to decrease the amount of samples. Next, the time-compressed representation of a signal is encoded using a narrowband...

  • Simulation of ammonia combustion in dual-fuel compression-ignition engine

    Publication
    • J. Lasocki
    • M. Bednarski
    • M. Sikora

    - IOP Conference Series: Earth and Environmental Science - Year 2019

    Full text to download in external service

  • Applications of compression techniques for reducing the size of multibeam sonar records

    Publication

    - Year 2008

    Jednym z najczęściej używanych urządzeń służących do szeroko rozumianego telemonitoringu morskiego są sonary wielowiązkowe (ang. Multibeam systems - MBS). Ich wysoka wydajność w tworzeniu informacji o obiektach znajdujących się pod wodą skutkuje w dużych ilościach danych pozyskiwanych podczas rejsów badawczych i pomiarowych. W tym kontekście, proces przechowywania i zarządzania takim magazynem danych staje się istotnym problemem...

  • Numerical analysis of laminated shells under in-plane axial compression

    Publication

    - Year 2009

    W pracy analizowana jest stateczność powłoki warstwowej poddanej osiowemu ściskaniu. Badany jest wpływ wariantów uwarstwienia oraz warunków podparcia krawędzi obciążonej na zachowanie konstrukcji. Wyniki numeryczne porównano z eksperymentem.

    Full text available to download

  • Using wavelet techniques for multibeam sonar bathymetry data compression

    Multibeam sonars are widely used in applications like high resolution bathymetry measurements or underwater object imaging. One of the significant problems in multibeam sensing of the marine environment is large amount of data which must be transmitted from the sonar processing unit to an operator station using a limited bit rate channel. For instance, such a situation would be in the case when the multibeam sonar was mounted on...

    Full text available to download