Thematische Bibliographien / Counting automaton

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Bücher
Buchteile
Konferenzberichte
Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „Counting automaton“

Autor: Grafiati

Veröffentlicht am 28. Juni 2021

Zuletzt aktualisiert am 1. Februar 2022

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Counting automaton" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Counting automaton"

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

Der volle Inhalt der Quelle

Annotation:

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 und andere Zitierweisen

ALAZEMI, HAMED M. K., und ANTON ČERNÝ. „COUNTING SUBWORDS USING A TRIE AUTOMATON“. International Journal of Foundations of Computer Science 22, Nr. 06 (September 2011): 1457–69. http://dx.doi.org/10.1142/s0129054111008817.

Der volle Inhalt der Quelle

Annotation:

We use the concept of trie (prefix tree) representation of a prefix-closed finite language L to design a simple nondeterministic automaton. Each computation of this trie automaton corresponds to a subword occurrence of a word from L in the input word. The matrix representation of the trie automaton leads to a fairly general extension of the original concept of the Parikh matrix from [7].

APA, Harvard, Vancouver, ISO und andere Zitierweisen

MANUEL, AMALDEV, und R. RAMANUJAM. „CLASS COUNTING AUTOMATA ON DATAWORDS“. International Journal of Foundations of Computer Science 22, Nr. 04 (Juni 2011): 863–82. http://dx.doi.org/10.1142/s0129054111008465.

Der volle Inhalt der Quelle

Annotation:

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 und andere Zitierweisen

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

Der volle Inhalt der Quelle

Annotation:

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 und andere Zitierweisen

Păun, Gheorghe, und Mario J. Pérez-Jiménez. „Solving Problems in a DistributedWay in Membrane Computing: dP Systems“. International Journal of Computers Communications & Control 5, Nr. 2 (01.06.2010): 238. http://dx.doi.org/10.15837/ijccc.2010.2.2478.

Der volle Inhalt der Quelle

Annotation:

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 und andere Zitierweisen

Biehl, Martin, und Olaf Witkowski. „Investigating Transformational Complexity: Counting Functions a Region Induces on Another in Elementary Cellular Automata“. Complexity 2021 (29.06.2021): 1–8. http://dx.doi.org/10.1155/2021/7501405.

Der volle Inhalt der Quelle

Annotation:

Over the years, the field of artificial life has attempted to capture significant properties of life in artificial systems. By measuring quantities within such complex systems, the hope is to capture the reasons for the explosion of complexity in living systems. A major effort has been in discrete dynamical systems such as cellular automata, where very few rules lead to high levels of complexity. In this paper, for every elementary cellular automaton, we count the number of ways a finite region can transform an enclosed finite region. We discuss the relation of this count to existing notions of controllability, physical universality, and constructor theory. Numerically, we find that particular sizes of surrounding regions have preferred sizes of enclosed regions on which they can induce more transformations. We also find three particularly powerful rules (90, 105, 150) from this perspective.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Dassow, Jürgen, und Bianca Truthe. „Accepting networks of evolutionary processors with resources restricted and structure limited filters“. RAIRO - Theoretical Informatics and Applications 55 (2021): 8. http://dx.doi.org/10.1051/ita/2021004.

Der volle Inhalt der Quelle

Annotation:

In this paper, we continue the research on accepting networks of evolutionary processors where the filters belong to several special families of regular languages. We consider families of codes or ideals and subregular families which are defined by restricting the resources needed for generating or accepting them (the number of states of the minimal deterministic finite automaton accepting a language of the family as well as the number of non-terminal symbols or the number of production rules of a right-linear grammar generating such a language). We insert the newly defined language families into the hierachy of language families obtained by using as filters languages of other subregular families (such as ordered, non-counting, power-separating, circular, suffix-closed regular, union-free, definite, combinational, finite, monoidal, nilpotent, or commutative languages).

APA, Harvard, Vancouver, ISO und andere Zitierweisen

BRODA, SABINE, ANTÓNIO MACHIAVELO, NELMA MOREIRA und ROGÉRIO REIS. „ON THE AVERAGE SIZE OF GLUSHKOV AND PARTIAL DERIVATIVE AUTOMATA“. International Journal of Foundations of Computer Science 23, Nr. 05 (August 2012): 969–84. http://dx.doi.org/10.1142/s0129054112400400.

Der volle Inhalt der Quelle

Annotation:

In this paper, the relation between the Glushkov automaton [Formula: see text] and the partial derivative automaton [Formula: see text] of a given regular expression, in terms of transition complexity, is studied. The average transition complexity of [Formula: see text] was proved by Nicaud to be linear in the size of the corresponding expression. This result was obtained using an upper bound of the number of transitions of [Formula: see text]. Here we present a new quadratic construction of [Formula: see text] that leads to a more elegant and straightforward implementation, and that allows the exact counting of the number of transitions. Based on that, a better estimation of the average size is presented. Asymptotically, and as the alphabet size grows, the number of transitions per state is on average 2. Broda et al. computed an upper bound for the ratio of the number of states of [Formula: see text] to the number of states of [Formula: see text] which is about ½ for large alphabet sizes. Here we show how to obtain an upper bound for the number of transitions in [Formula: see text], which we then use to get an average case approximation. In conclusion, assymptotically, and for large alphabets, the size of [Formula: see text] is half the size of the [Formula: see text]. This is corroborated by some experiments, even for small alphabets and small regular expressions.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

GRECO, SERGIO, DOMENICO SACCÀ und CARLO ZANIOLO. „GRAMMARS AND AUTOMATA TO OPTIMIZE CHAIN LOGIC QUERIES“. International Journal of Foundations of Computer Science 10, Nr. 03 (September 1999): 349–72. http://dx.doi.org/10.1142/s0129054199000253.

Der volle Inhalt der Quelle

Annotation:

The critical problem of finding efficient implementations for recursive queries with bound arguments offers many open challenges of practical and theoretical import. In particular, there is a need to find methods that are effective for the general case, such as non-linear programs, as well as for specialized cases, such as left-recursive linear programs. In this paper, we propose a novel approach that solves this problem for chain queries, i.e., for queries where bindings are propagated from arguments in the head to arguments in the tail of the rules, in a chain-like fashion. The method, called pushdown method, is based on the fact that a chain query can have associated a context-free language and a pushdown automaton recognizing this language can be emulated by rewriting the query as a particular factorized left-linear program. The proposed method generalizes and unifies previous techniques such as the 'counting' and 'right-, left-, mixed-linear' methods. It also succeeds in reducing many non-linear programs to query-equivalent linear ones.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

CALEGARI, DANNY, und KOJI FUJIWARA. „Combable functions, quasimorphisms, and the central limit theorem“. Ergodic Theory and Dynamical Systems 30, Nr. 5 (04.11.2009): 1343–69. http://dx.doi.org/10.1017/s0143385709000662.

Der volle Inhalt der Quelle

Annotation:

AbstractA function on a discrete group is weakly combable if its discrete derivative with respect to a combing can be calculated by a finite-state automaton. A weakly combable function is bicombable if it is Lipschitz in both the left- and right-invariant word metrics. Examples of bicombable functions on word-hyperbolic groups include:(1)homomorphisms to ℤ;(2)word length with respect to a finite generating set;(3)most known explicit constructions of quasimorphisms (e.g. the Epstein–Fujiwara counting quasimorphisms).We show that bicombable functions on word-hyperbolic groups satisfy acentral limit theorem: if$\overline {\phi }_n$is the value of ϕ on a random element of word lengthn(in a certain sense), there areEandσfor which there is convergence in the sense of distribution$n^{-1/2}(\overline {\phi }_n - nE) \to N(0,\sigma )$, whereN(0,σ) denotes the normal distribution with standard deviationσ. As a corollary, we show that ifS1andS2are any two finite generating sets forG, there is an algebraic numberλ1,2depending onS1andS2such that almost every word of lengthnin theS1metric has word lengthn⋅λ1,2in theS2metric, with error of size$O(\sqrt {n})$.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "Counting automaton"

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.

Der volle Inhalt der Quelle

Annotation:

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 und andere Zitierweisen

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

Der volle Inhalt der Quelle

Annotation:

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 und andere Zitierweisen

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.

Der volle Inhalt der Quelle

Annotation:

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 und andere Zitierweisen

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

Der volle Inhalt der Quelle

Annotation:

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 und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

Annotation:

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 und andere Zitierweisen

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.

Der volle Inhalt der Quelle

Annotation:

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 und andere Zitierweisen

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

Annotation:

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 und andere Zitierweisen

Mehr Quellen

Bücher zum Thema "Counting automaton"

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

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Pippy, John Herbert Charles. A field guide to counting and measuring salmonids using the Silhouette Imaging and Counting System (SIACS). St. John's, Nfld: Science Branch, Dept. of Fisheries and Oceans, 1997.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

Annotation:

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 und andere Zitierweisen

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

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Buchteile zum Thema "Counting automaton"

Rich, Craig A., und Giora Slutzki. „The complexity of a counting finite-state automaton“. In Lecture Notes in Computer Science, 225–39. Berlin, Heidelberg: Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/3-540-50517-2_83.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Campbell, Matthew. „Automatic Reference Counting“. In Swift Quick Syntax Reference, 147–51. Berkeley, CA: Apress, 2014. http://dx.doi.org/10.1007/978-1-4842-0439-9_49.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Alberti, Francesco, Silvio Ghilardi und Elena Pagani. „Counting Constraints in Flat Array Fragments“. In Automated Reasoning, 65–81. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-40229-1_6.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Amini, Omid, Fedor V. Fomin und 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Choffrut, C., und 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

de Luca, Aldo, und 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Seidl, Helmut, Thomas Schwentick, Anca Muscholl und 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Goldberg, Leslie Ann, Rob Gysel und 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ge, Cunjing, Feifei Ma, Tian Liu, Jian Zhang und Xutong Ma. „A New Probabilistic Algorithm for Approximate Model Counting“. In Automated Reasoning, 312–28. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-94205-6_21.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Counting automaton"

Yang, Sudi, und Guoqing Gu. „Region counting algorithm based on region labeling automaton“. In International Symposium on Multispectral Image Processing and Pattern Recognition, herausgegeben von Jianguo Liu, Kunio Doi, Patrick S. P. Wang und Qiang Li. SPIE, 2007. http://dx.doi.org/10.1117/12.748099.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Cho, Myoung-Ock, Hyo Mi Chang, Yeon Gyu Yu, Hwataik Han und 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.

Der volle Inhalt der Quelle

Annotation:

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 und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Diep, Daniel, Isabelle Marc, Herve Nonon, Jonathan Delhom und 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Barbedo, Jayme. „Automatic Object Counting In Neubauer Chambers“. In XXXI Simpósio Brasileiro de Telecomunicações. Sociedade Brasileira de Telecomunicações, 2013. http://dx.doi.org/10.14209/sbrt.2013.224.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Muthukumar, S., W. Sherine Mary, S. K. Abijith, P. Haribalan und S. Sakthivel. „Sensor Based Automated People Counting System“. In 2018 Second International Conference on Intelligent Computing and Control Systems (ICICCS). IEEE, 2018. http://dx.doi.org/10.1109/iccons.2018.8662887.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kobayashi, Takumi, Tadaaki Hosaka, Shu Mimura, Takashi Hayashi und Nobuyuki Otsu. „HLAC Approach to Automatic Object Counting“. In 2008 ECSIS Symposium on Bio-Inspired Learning and Intelligent Systems for Security (BLISS). IEEE, 2008. http://dx.doi.org/10.1109/bliss.2008.21.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Yan, Wenzhong, und Shuqun Shen. „An Automatic Counting Algorithm for Chromosomes“. In 2008 2nd International Conference on Bioinformatics and Biomedical Engineering (ICBBE '08). IEEE, 2008. http://dx.doi.org/10.1109/icbbe.2008.956.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Toh, Y. H., T. M. Ng und B. K. Liew. „Automated Fish Counting Using Image Processing“. In 2009 International Conference on Computational Intelligence and Software Engineering. IEEE, 2009. http://dx.doi.org/10.1109/cise.2009.5365104.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Counting automaton"

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Arhin, Stephen, Babin Manandhar, Hamdiat Baba Adam und 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.

Der volle Inhalt der Quelle

Annotation:

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 und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!