Relevant bibliographies by topics / Counting automata

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Counting automata'

Author: Grafiati
Published: 28 June 2021
Last updated: 18 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Counting automata.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Counting automata"

1

Allred, Joël, and Ulrich Ultes-Nitsche. "k-counting automata." RAIRO - Theoretical Informatics and Applications 46, no. 4 (October 2012): 461–78. http://dx.doi.org/10.1051/ita/2012021.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

MANUEL, AMALDEV, and R. RAMANUJAM. "CLASS COUNTING AUTOMATA ON DATAWORDS." International Journal of Foundations of Computer Science 22, no. 04 (June 2011): 863–82. http://dx.doi.org/10.1142/s0129054111008465.

Full text
Abstract:
In the theory of automata over infinite alphabets, a central difficulty is that of finding a suitable compromise between expressiveness and algorithmic complexity. We propose an automaton model where we count the multiplicity of data values on an input word. This is particularly useful when such languages represent behaviour of systems with unboundedly many processes, where system states carry such counts as summaries. A typical recognizable language is: "every process does at most k actions labelled a". We show that emptiness is elementarily decidable, by reduction to the covering problem on Petri nets.
APA, Harvard, Vancouver, ISO, and other styles
3

SCHEICHER, KLAUS, and JÖRG M. THUSWALDNER. "Canonical number systems, counting automata and fractals." Mathematical Proceedings of the Cambridge Philosophical Society 133, no. 1 (July 2002): 163–82. http://dx.doi.org/10.1017/s0305004102005856.

Full text
Abstract:
In this paper we study properties of the fundamental domain [Fscr ]β of number systems, which are defined in rings of integers of number fields. First we construct addition automata for these number systems. Since [Fscr ]β defines a tiling of the n-dimensional vector space, we ask, which tiles of this tiling ‘touch’ [Fscr ]β. It turns out that the set of these tiles can be described with help of an automaton, which can be constructed via an easy algorithm which starts with the above-mentioned addition automaton. The addition automaton is also useful in order to determine the box counting dimension of the boundary of [Fscr ]β. Since this boundary is a so-called graph-directed self-affine set, it is not possible to apply the general theory for the calculation of the box counting dimension of self similar sets. Thus we have to use direct methods.
APA, Harvard, Vancouver, ISO, and other styles
4

Turoňová, Lenka, Lukáš Holík, Ondřej Lengál, Olli Saarikivi, Margus Veanes, and Tomáš Vojnar. "Regex matching with counting-set automata." Proceedings of the ACM on Programming Languages 4, OOPSLA (November 13, 2020): 1–30. http://dx.doi.org/10.1145/3428286.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Beauquier, D., and D. Niwinski. "Automata on Infinite Trees with Counting Constraints." Information and Computation 120, no. 1 (July 1995): 117–25. http://dx.doi.org/10.1006/inco.1995.1104.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Zanetti, Gianluigi. "Counting hydrodynamic modes in lattice gas automata models." Physica D: Nonlinear Phenomena 47, no. 1-2 (January 1991): 30–35. http://dx.doi.org/10.1016/0167-2789(91)90276-f.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Baltic, Vladimir. "Applications of the finite state automata for counting restricted permutations and variations." Yugoslav Journal of Operations Research 22, no. 2 (2012): 183–98. http://dx.doi.org/10.2298/yjor120211023b.

Full text
Abstract:
In this paper, we use the finite state automata to count the number of restricted permutations and the number of restricted variations. For each type of restricted permutations, we construct a finite state automaton able to recognize and enumerate them. We, also, discuss how it encompasses the other known methods for enumerating permutations with restricted position, and in one case, we establish connections with some other combinatorial structures, such as subsets and compositions.
APA, Harvard, Vancouver, ISO, and other styles
8

Beldiceanu, Nicolas, Mats Carlsson, Pierre Flener, and Justin Pearson. "On matrices, automata, and double counting in constraint programming." Constraints 18, no. 1 (December 11, 2012): 108–40. http://dx.doi.org/10.1007/s10601-012-9134-y.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

TOŠIĆ, PREDRAG T. "ON THE COMPLEXITY OF COUNTING FIXED POINTS AND GARDENS OF EDEN IN SEQUENTIAL DYNAMICAL SYSTEMS ON PLANAR BIPARTITE GRAPHS." International Journal of Foundations of Computer Science 17, no. 05 (October 2006): 1179–203. http://dx.doi.org/10.1142/s0129054106004339.

Full text
Abstract:
We study counting various types of configurations in certain classes of graph automata viewed as discrete dynamical systems. The graph automata models of our interest are Sequential and Synchronous Dynamical Systems (SDSs and SyDSs, respectively). These models have been proposed as the mathematical foundation for a theory of large-scale simulations of complex multi-agent systems. Our emphasis in this paper is on the computational complexity of counting the fixed point and the garden of Eden configurations in Boolean SDSs and SyDSs. We show that counting these configurations is, in general, computationally intractable. We also show that this intractability still holds when both the underlying graphs and the node update rules of these SDSs and SyDSs are severely restricted. In particular, we prove that the problems of exactly counting fixed points, gardens of Eden and two other types of S(y)DS configurations are all #P-complete, even if the SDSs and SyDSs are defined over planar bipartite graphs, and each of their nodes updates its state according to a monotone update rule given as a Boolean formula. We thus add these discrete dynamical systems to the list of those problem domains where counting combinatorial structures of interest is intractable even when the related decision problems are known to be efficiently solvable.
APA, Harvard, Vancouver, ISO, and other styles
10

Păun, Gheorghe, and Mario J. Pérez-Jiménez. "Solving Problems in a DistributedWay in Membrane Computing: dP Systems." International Journal of Computers Communications & Control 5, no. 2 (June 1, 2010): 238. http://dx.doi.org/10.15837/ijccc.2010.2.2478.

Full text
Abstract:
Although P systems are distributed parallel computing devices, no explicit way of handling the input in a distributed way in this framework was considered so far. This note proposes a distributed architecture (based on cell-like P systems, with their skin membranes communicating through channels as in tissue-like P systems, according to specified rules of the antiport type), where parts of a problem can be introduced as inputs in various components and then processed in parallel. The respective devices are called dP systems, with the case of accepting strings called dP automata. The communication complexity can be evaluated in various ways: statically (counting the communication rules in a dP system which solves a given problem), or dynamically (counting the number of communication steps, of communication rules used in a computation, or the number of objects communicated). For each measure, two notions of “parallelizability" can be introduced. Besides (informal) definitions, some illustrations of these idea are provided for dP automata: each regular language is “weakly parallelizable" (i.e., it can be recognized in this framework, using a constant number of communication steps), and there are languages of various types with respect to Chomsky hierarchy which are “efficiently parallelizable" (they are parallelizable and, moreover, are accepted in a faster way by a dP automaton than by a single P automaton). Several suggestions for further research are made.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Counting automata"

1

Turcel, Matej. "Minimalizace automatů s jednoduchými čítači." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2021. http://www.nusl.cz/ntk/nusl-445565.

Full text
Abstract:
Táto práca sa zaoberá redukciou veľkosti tzv. čítačových automatov. Čítačové automaty rozširujú klasické konečné automaty o čítače s obmedzeným rozsahom hodnôt. Umožňujú tým efektívne spracovať napr. regulárne výrazy s opakovaním: a{5,10}. V tejto práci sa zaoberáme reláciou simulácie v čítačových automatoch, pomocou ktorej sme schopní zredukovať ich veľkosť. Opierame sa pritom o klasickú simuláciu v konečných automatoch, ktorú netriviálnym spôsobom rozširujeme na čítačové automaty. Kľúčovým rozdielom je nutnosť simulovať okrem stavov taktiež čítače. Za týmto účelom zavádzame nový koncept parametrizovanej relácie simulácie, a navrhujeme metódy výpočtu tejto relácie a redukcie veľkosti čítačových automatov pomocou nej. Navrhnuté metódy sú tiež implementované a je vyhodnotená ich efektivita.
APA, Harvard, Vancouver, ISO, and other styles
2

Riley, M. "Finite automata, machines and counting problems in bounded arithmetic." Thesis, University of Manchester, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.383202.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Horký, Michal. "Rychlejší než grep pomocí čítačů." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2021. http://www.nusl.cz/ntk/nusl-445473.

Full text
Abstract:
Vyhledávání regulárních výrazů má ve vývoji softwaru nezastupitelné místo. Rychlost vyhledávání může ovlivnit použitelnost softwaru, a proto je na ni kladen velký důraz. Pro určité druhy regulárních výrazů mají standardní přístupy pro vyhledávání vysokou složitost. Kvůli tomu jsou náchylné k útokům založeným na vysoké náročnosti vyhledávání regulárních výrazů (takzvané ReDoS útoky). Regulární výrazy s omezeným opakováním, které se v praxi často vyskytují, jsou jedním z těchto druhů. Efektivní reprezentace a rychlé vyhledávání těchto regulárních výrazů je možné s použítím automatu s čítači. V této práci představujeme implementaci vyhledávání regulárních výrazů založeném na automatech s čítači v C++. Vyhledávání je implementováno v rámci RE2, rychlé moderní knihovny pro vyhledávání regulárních výrazů. V práci jsme provedli experimenty na v praxi používaných regulárních výrazech. Výsledky experimentů ukázaly, že implementace v rámci nástroje RE2 je rychleší než původní implementace v jazyce C#.
APA, Harvard, Vancouver, ISO, and other styles
4

Sallay, John. "Automatic People Counting and Matching." DigitalCommons@USU, 2009. https://digitalcommons.usu.edu/etd/499.

Full text
Abstract:
This thesis explores software algorithm for implementing a people counting and matching system to be used on a bus. A special camera is used, known as a texel camera, that generates depth and color information for a scene. This added information greatly facilitates both the tasks of matching and counting. Although people counting is a relatively mature field, there are several situations in which current technologies are not able to count correctly. Several of these difficult situations are tested with 82% counting accuracy. The idea of matching people on a bus is also developed. The goal is not to identify a specific person on a bus, but to find the time that a specific person is on the bus, and what bus stops were used. There are several aspects of this matching problem that differentiate it from other classification tasks that have been researched. In this thesis, multiple measurements are used to classify a person and sequence estimation techniques explored. The techniques developed classify with 92% accuracy, even with a relatively large number of people on a bus.
APA, Harvard, Vancouver, ISO, and other styles
5

Haddad, George. "AUTOMATIC PARTICLE COUNTING USING AN ACOUSTIC TRANSDUCER." Master's thesis, University of Central Florida, 2005. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/2646.

Full text
Abstract:
Aerosol particle detection and determination finds important applications in the commercial, military and aerospace sectors. Monitoring of clean room environments, and spacecraft integration and check out facilities are some of the most important aplications. In the early days test filters were examined with a microscope to determine the number and size of particles that were being removed from air. Today, most of the commercially available clean room airborne particle counters work on a light scattering principle. They are referred to as Optical Particle Counter or OPC. Essentially, they utilize a very bright laser light source to illuminate the particles. The burst of light energy is converted into a pulse of electrical energy. By measuring the height of the signal and counting the number of pulses the sizes and quantities of particles could thus be determined. The microscope and the OPC techniques have their limitations. The microscope technique is a post contamination assessment technique and the OPC is costly, hard to maintain, lack in counting efficiency and is not mobile. This experimental study demonstrates a novel and inexpensive particle detection technique which is based on the acoustic signature of airborne particles as they are accelerated through an acoustic transducer. The transducer consists of an inlet converging nozzle, a capillary tube and an expansion section. If the air is laden with particles, as the flow accelerates through the inlet, the particles cannot follow the large change in velocity due to their inertia. Vortices are generated as air flows over the particles prior to entering the capillary. These vortices are believed to generate sound, which is amplified by the transducer acting as an organ pipe. This sound emission if measured contains frequencies that are harmonics of the natural frequency of the transducer's air column. Results show how the frequency content of the acoustic signature relates to the fundamental frequency of the transducer's air column. The transducer is able to detect micron sized particles ( 5 to 50 micron) and the sound intensity is a function of the flowrate but not of particle size. This study also shows the ability of the transducer to determine particle concentration as low as few parts per liter (ppl) and compare the data with that obtained from a commercially available aerodynamic particle sizer.
M.S.M.E.
Department of Mechanical, Materials and Aerospace Engineering;
Engineering and Computer Science
Mechanical Engineering
APA, Harvard, Vancouver, ISO, and other styles
6

Wheatley, Joseph. "Automated Bayesian layer counting of ice cores." Thesis, University of Sheffield, 2015. http://etheses.whiterose.ac.uk/8856/.

Full text
Abstract:
The polar ice sheets hold a continuous record of climatic and environmental information, in the composition and concentrations of various chemicals, particles and gasses, extending back over hundreds of thousands of years. In order to interpret these data we must first learn about the underlying relationship between depth and age. Ice cores are vertical samples of the ice sheets. Some signals measured from them have annual cycles which show as quasi-periodic seasonality; layer counting uses this periodicity to obtain a chronology for the core. This is currently achieved manually, which is time-consuming and open to inconsistency and human error. We present a method to standardise an ice core signal, isolating its seasonality, and to split it into sections with well-defined cycle counts and those with uncertain cycle counts. We show how the uncertain sections can be presented for manual assessment, and describe how the possible reconstructions can be identified and assigned probabilities based on their implied cycle lengths. We also develop a multivariate fully Bayesian approach, which models the signals as phase-shifted sine waves with continuously varying mean and amplitude. We use Markov chain Monte Carlo algorithms to enable inference about the age-depth relationship, and specifically the number of years covered by a particular section of ice core, including quantitative assessment of the uncertainty involved. We provide examples, applying our methods to several chemistry signals measured from ice cores from Greenland and Antarctica.
APA, Harvard, Vancouver, ISO, and other styles
7

Hou, Yali, and 侯亚丽. "Video-based people counting and crowd segmentation." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2011. http://hub.hku.hk/bib/B47032339.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

León, Izeppi Edgar David de. "An automatic passenger counting system at a small transit property." Thesis, Virginia Polytechnic Institute and State University, 1985. http://hdl.handle.net/10919/91129.

Full text
Abstract:
This thesis describes the work done on the first phase of the implementation of an Automatic Passenger Counting (APC) system at the Roanoke Valley-Metro transit property. The primary objective of the first phase of this project was to create a software program to decode, edit, analyze and store the data from the APC. The second phase of the project will make reports by aggregating data from the work done in the first phase. The basis for efficient management of operations in transit properties is having accurate and reliable information on transit ridership, fare revenue, and schedule adherence for individual routes and for the transit system as a whole. Data from passenger counts are used to identify peak load points and quantify service demands. Fare revenue data are needed to analyze the systems productivity, and the time checks are essential to monitor and control the scheduling activities. The actual data collection efforts at Valley-Metro have proven to be obsolete, unreliable and very expensive. The new APC system offers the management at Valley-Metro with a new and powerful tool that will enhance their capability to make better decisions when allocating the service needs.
M.S.
APA, Harvard, Vancouver, ISO, and other styles
9

D'Souza, Aswin Cletus. "Automated counting of cell bodies using Nissl stained cross-sectional images." [College Station, Tex. : Texas A&M University, 2007. http://hdl.handle.net/1969.1/ETD-TAMU-2035.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Shankar, Sanjeev. "Analysis of microprocessor based vehicular instrumentation and automatic passenger counting systems." Thesis, Virginia Tech, 1985. http://hdl.handle.net/10919/41570.

Full text
Abstract:
Information on transit ridership and operations is a necessary condition as far as efficient management is considered. Transit managements on the acquisition of such a data base can confirm predictions about scheduling, receive warnings about potential dangers and plan future operations on a much broader and precise base. Data from passenger counts provide essential information to marketing and scheduling personnel by identifying peak load-points and the such. Using manual collection methods for such data is expensive and prone to human errors. Automatic Passenger Counting (APC) systems are viewed as an improved and economical technique for data collection. Such systems monitor the progress of a particular vehicle -- its position, number of passengers getting on and off, times and distances between stops -- and make this data available for processing. These are state of the art systems, mostly microprocessor based and often embracing a modular structure. The Red Pine system is such a system with different dedicated modules for each bank of tasks. Multitasking software is seen to be an powerful tool for such systems and simplify the architecture of the system hardware. A CHMOS hardware design, suited for multitasking softwares is provided. Interfacing software for the Red Pine system has been developed and is explained. Debugging testing and simulation of the Red Pine hardware is detailed. Modifications have been recorded and improvements suggested.


Master of Science
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Counting automata"

1

Lidman, J. Kirby. Iowa automated aircraft activity counting, 1987-1988. [Des Moines]: Iowa Dept. of Transportation, Planning & Research Division, Office of Transportation Research, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Lidman, J. Kirby. Iowa automated aircraft activity counting, 1988-1989. [Des Moines]: Iowa Dept. of Transportation, Planning & Research Division, Office of Transportation Research, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Lidman, J. Kirby. Iowa automated aircraft activity counting, 1985-1987. [Iowa]: Dept. of Transportation, Planning & Research Division, Office of Transportation Research, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Great Britain. Working Group on Automated Vote Counting. Report of the Working Group on Automated Vote Counting. [London]: Home Office, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Andrews, D. J. An automated NaI 'well' counting system for the determination of radiocaesium. Lowestoft: Ministry of Agriculture, Fisheries and Food, Directorate of Fisheries Research, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Boyle, Daniel K. Passenger counting technologies and procedures. Washington, D.C: National Academy Press, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Mauceri, Vince C. APC, automatic passenger counting system: The Hamilton Street Railway Technology Fair, Canadian Urban Transit Association Fall Meeting, November 6th-10, 1988, Hamilton, Ontario, Canada. [Hamilton]: Hamilton Street Railway Co., 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kraberg, Alexandra, Katja Metfies, and Rowena Stern. Sampling, Preservation and Counting of Samples I: Phytoplankton. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780199233267.003.0009.

Full text
Abstract:
This chapter reviews phytoplankton sampling and analysis techniques, discussing them in light of their advantages and disadvantages. Different sampling methods have varying levels of precision and accuracy. This means that they affect the ways in which individual data sets can be interpreted, and methods therefore have to be kept consistent within time series to avoid creating artefacts. The discussions cover qualitative and semi-quantitative methods, quantitative methods, sample analysis, automated/semi-automated systems, and molecular methodologies. None of the methods are universally applicable but depend on the right set of tools and the scientific and financial context in which they are used. Molecular techniques hold great promise particularly for taxa that cannot be identified by routine microscopical techniques.
APA, Harvard, Vancouver, ISO, and other styles
9

Ibrahim, Saleh Hassan. Computer control of the Automatic Gamma Well counting system. 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Passenger Counting Technologies & Procedures. Transportation Research Board, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Counting automata"

1

Brassard, Gilles, Peter HØyer, and Alain Tapp. "Quantum counting." In Automata, Languages and Programming, 820–31. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0055105.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Amini, Omid, Fedor V. Fomin, and Saket Saurabh. "Counting Subgraphs via Homomorphisms." In Automata, Languages and Programming, 71–82. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02927-1_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Choffrut, C., and M. P. Schutzenberger. "Counting with rational functions." In Automata, Languages and Programming, 79–88. Berlin, Heidelberg: Springer Berlin Heidelberg, 1986. http://dx.doi.org/10.1007/3-540-16761-7_57.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

de Luca, Aldo, and Stefano Varricchio. "On non-counting regular classes." In Automata, Languages and Programming, 74–87. Berlin, Heidelberg: Springer Berlin Heidelberg, 1990. http://dx.doi.org/10.1007/bfb0032023.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Seidl, Helmut, Thomas Schwentick, Anca Muscholl, and Peter Habermehl. "Counting in Trees for Free." In Automata, Languages and Programming, 1136–49. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-27836-8_94.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Goldberg, Leslie Ann, Rob Gysel, and John Lapinskas. "Approximately Counting Locally-Optimal Structures." In Automata, Languages, and Programming, 654–65. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-47672-7_53.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Terrier, V. "A Counting Equivalence Classes Method to Prove Negative Results." In Cellular Automata, 199–210. Dordrecht: Springer Netherlands, 1999. http://dx.doi.org/10.1007/978-94-015-9153-9_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bordewich, Magnus, Martin Dyer, and Marek Karpinski. "Stopping Times, Metrics and Approximate Counting." In Automata, Languages and Programming, 108–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11786986_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kane, Daniel M., Kurt Mehlhorn, Thomas Sauerwald, and He Sun. "Counting Arbitrary Subgraphs in Data Streams." In Automata, Languages, and Programming, 598–609. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-31585-5_53.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Allender, Eric, Samir Datta, Andris Ambainis, David A. Mix Barrington, and Huong LêThanh. "Bounded Depth Arithmetic Circuits: Counting and Closure." In Automata, Languages and Programming, 149–58. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48523-6_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Counting automata"

1

Sherman, Elena, and Andrew Harris. "Accurate String Constraints Solution Counting with Weighted Automata." In 2019 34th IEEE/ACM International Conference on Automated Software Engineering (ASE). IEEE, 2019. http://dx.doi.org/10.1109/ase.2019.00049.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Yuan, Yao, Liu Peng, Zhang Zheng, Wang Hui, and Gou Cheng Cheng. "An Extended Automata to Efficiently Match Counting Constraints Patterns." In 2010 International Conference on E-Business and E-Government (ICEE). IEEE, 2010. http://dx.doi.org/10.1109/icee.2010.510.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Rong-cai, Zhao, Zhang Shuo, Liu Peng, and Zhou Li. "A high effective papilionaceous automata to match multiple counting constraint pattern." In 2011 IEEE 3rd International Conference on Communication Software and Networks (ICCSN). IEEE, 2011. http://dx.doi.org/10.1109/iccsn.2011.6014209.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Wandeler, E., J. W. Janneck, E. A. Lee, and L. Thiele. "Counting interface automata and their application in static analysis of actor models." In Third IEEE International Conference on Software Engineering and Formal Methods (SEFM'05). IEEE, 2005. http://dx.doi.org/10.1109/sefm.2005.14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Meiners, Chad, Eric Norige, Alex X. Liu, and Eric Torng. "FlowSifter: A counting automata approach to layer 7 field extraction for deep flow inspection." In IEEE INFOCOM 2012 - IEEE Conference on Computer Communications. IEEE, 2012. http://dx.doi.org/10.1109/infcom.2012.6195547.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Cho, Myoung-Ock, Hyo Mi Chang, Yeon Gyu Yu, Hwataik Han, and Jung Kyung Kim. "Selective and Automated Detection of Airborne Asbestos Fibers Using Chrysotile-Adhesive Protein and High-Throughput Microscopy (HTM)." In ASME 2011 International Mechanical Engineering Congress and Exposition. ASMEDC, 2011. http://dx.doi.org/10.1115/imece2011-63721.

Full text
Abstract:
There are several methods to detect asbestos including phase contrast microscopy (PCM), polarized light microscopy, X-ray diffraction, and electron microscopy. Although the PCM method is widely used due to its simple process and relatively low cost, it is a time-consuming and laborious process that is manually performed by a human counter. We developed a high-throughput microscopy (HTM) system for automated counting of airborne asbestos fibers to automate the conventional PCM method. Our results show that automatic image acquisition by synchronization of charge-coupled device (CCD) camera with movement of stages, and image analysis using image processing software, significantly reduced time consumption and labor. In this study, we used DksA chrysotile-adhesive protein for the selective detection of asbestos. DksA, known as the protein that specifically attaches to chrysotile, was extracted from Escherichia coli through a recombinant protein technique. We tried to detect chrysotile selectively from other fibers or particles, and we developed a highly selective and automated low-cost device for automated identification and enumeration of airborne asbestos fibers based on the HTM method.
APA, Harvard, Vancouver, ISO, and other styles
7

Sexton, Graham G., and Xiaowei Zhang. "Automated counting of pedestrians." In Visual Communications and Image Processing '94, edited by Aggelos K. Katsaggelos. SPIE, 1994. http://dx.doi.org/10.1117/12.186027.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Tseng, Chun-Lin, Hao-Yu Lu, and Shun-Pin Hsu. "An optical approach to counting reeled components." In 2016 International Automatic Control Conference (CACS). IEEE, 2016. http://dx.doi.org/10.1109/cacs.2016.7973915.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Diep, Daniel, Isabelle Marc, Herve Nonon, Jonathan Delhom, and Frederic Roure. "Smartphones for automatic shad counting." In 2013 International Conference on Systems, Signals and Image Processing (IWSSIP). IEEE, 2013. http://dx.doi.org/10.1109/iwssip.2013.6623479.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Sexton, G. "Advances in automated pedestrian counting." In European Convention on Security and Detection. IEE, 1995. http://dx.doi.org/10.1049/cp:19950479.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Counting automata"

1

Bigu, J. Design and operation of an automated beta-particle counting system for the measurement of 220Rn (and 222Rn) progeny. Natural Resources Canada/CMSS/Information Management, 1990. http://dx.doi.org/10.4095/328732.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Arhin, Stephen, Babin Manandhar, Hamdiat Baba Adam, and Adam Gatiba. Predicting Bus Travel Times in Washington, DC Using Artificial Neural Networks (ANNs). Mineta Transportation Institute, April 2021. http://dx.doi.org/10.31979/mti.2021.1943.

Full text
Abstract:
Washington, DC is ranked second among cities in terms of highest public transit commuters in the United States, with approximately 9% of the working population using the Washington Metropolitan Area Transit Authority (WMATA) Metrobuses to commute. Deducing accurate travel times of these metrobuses is an important task for transit authorities to provide reliable service to its patrons. This study, using Artificial Neural Networks (ANN), developed prediction models for transit buses to assist decision-makers to improve service quality and patronage. For this study, we used six months of Automatic Vehicle Location (AVL) and Automatic Passenger Counting (APC) data for six Washington Metropolitan Area Transit Authority (WMATA) bus routes operating in Washington, DC. We developed regression models and Artificial Neural Network (ANN) models for predicting travel times of buses for different peak periods (AM, Mid-Day and PM). Our analysis included variables such as number of served bus stops, length of route between bus stops, average number of passengers in the bus, average dwell time of buses, and number of intersections between bus stops. We obtained ANN models for travel times by using approximation technique incorporating two separate algorithms: Quasi-Newton and Levenberg-Marquardt. The training strategy for neural network models involved feed forward and errorback processes that minimized the generated errors. We also evaluated the models with a Comparison of the Normalized Squared Errors (NSE). From the results, we observed that the travel times of buses and the dwell times at bus stops generally increased over time of the day. We gathered travel time equations for buses for the AM, Mid-Day and PM Peaks. The lowest NSE for the AM, Mid-Day and PM Peak periods corresponded to training processes using Quasi-Newton algorithm, which had 3, 2 and 5 perceptron layers, respectively. These prediction models could be adapted by transit agencies to provide the patrons with accurate travel time information at bus stops or online.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Counting automata' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography