Zeitschriftenartikel: „Counting automata“

1

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

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

3

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

4

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

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

8

Beldiceanu, Nicolas, Mats Carlsson, Pierre Flener und Justin Pearson. „On matrices, automata, and double counting in constraint programming“. Constraints 18, Nr. 1 (11.12.2012): 108–40. http://dx.doi.org/10.1007/s10601-012-9134-y.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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, Nr. 05 (Oktober 2006): 1179–203. http://dx.doi.org/10.1142/s0129054106004339.

Der volle Inhalt der Quelle

Annotation:

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

10

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

11

Kutyłowski, Mirosław. „Finite automata, real time processes and counting problems in bounded arithmetics“. Journal of Symbolic Logic 53, Nr. 1 (März 1988): 243–58. http://dx.doi.org/10.1017/s0022481200029078.

Der volle Inhalt der Quelle

Annotation:

AbstractIn this paper we present a negative solution of counting problems for some classes slightly different from bounded arithmetic (Δ0sets). To get the results we study properties of chains of finite automata.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

CÂMPEANU, CEZAR, und ANDREI PĂUN. „COUNTING THE NUMBER OF MINIMAL DFCA OBTAINED BY MERGING STATES“. International Journal of Foundations of Computer Science 14, Nr. 06 (Dezember 2003): 995–1006. http://dx.doi.org/10.1142/s0129054103002138.

Der volle Inhalt der Quelle

Annotation:

Finite Deterministic Cover Automata (DFCA) can be obtained from Deterministic Finite Automata (DFA) using the similarity relation and a method of merging similar states. The DFCA minimization procedure can yield different results depending on the order of merging the similar states, because the minimal DFCA for a finite language is in general not unique. We count the number of minimal DFCA that can be obtained from a given minimal DFA with n states by merging the similar states in the given DFA. We compute an upper-bound for this number and prove that in the worst case, it is n-1 for an unary alphabet, and [Formula: see text] for a non-unary alphabet. We prove that this upper-bound is reached, i.e., for any given positive integer n one can construct a minimal DFA with n states, which has the number of minimal DFCA obtained by merging similar states equal to this maximum expression.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

LIOU, SHU-HAO, und CHIA-CHU CHEN. „DIRECT COUNTING ANALYSIS ON NETWORK GENERATED BY DISCRETE DYNAMICS“. International Journal of Modern Physics B 26, Nr. 04 (10.02.2012): 1250023. http://dx.doi.org/10.1142/s021797921110223x.

Der volle Inhalt der Quelle

Annotation:

A detail study on the in-degree distribution (ID) of cellular automata is obtained by exact enumeration. The results indicate large deviation from multi-scaling and classification according to various IDs are discussed. We further augment the transfer matrix such that the distributions for more complicated rules are obtained. Dependence of ID on the lattice size have also been found for some rules including R50 and R77.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

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

15

Kutylowski, Miroslaw. „Finite Automata, Real Time Processes and Counting Problems in Bounded Arithmetics“. Journal of Symbolic Logic 53, Nr. 1 (März 1988): 243. http://dx.doi.org/10.2307/2274442.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

Nogueira, Marcelo Arbori, und Pedro Paulo Balbi de Oliveira. „Automatic Texture Based Classification of the Dynamics of One-Dimensional Binary Cellular Automata“. International Journal of Natural Computing Research 8, Nr. 4 (Oktober 2019): 41–61. http://dx.doi.org/10.4018/ijncr.2019100104.

Der volle Inhalt der Quelle

Annotation:

Cellular automata present great variability in their temporal evolutions due to the number of rules and initial configurations. The possibility of automatically classifying its dynamic behavior would be of great value when studying properties of its dynamics. By counting on elementary cellular automata, and considering its temporal evolution as binary images, the authors created a texture descriptor of the images - based on the neighborhood configurations of the cells in temporal evolutions - so that it could be associated to each dynamic behavior class, following the scheme of Wolfram's classic classification. It was then possible to predict the class of rules of a temporal evolution of an elementary rule in a more effective way than others in the literature in terms of precision and computational cost. By applying the classifier to the larger neighborhood space containing 4 cells, accuracy decreased to just over 70%. However, the classifier is still able to provide some information about the dynamics of an unknown larger space with reduced computational cost.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

HOLZER, MARKUS, und SEBASTIAN JAKOBI. „FROM EQUIVALENCE TO ALMOST-EQUIVALENCE, AND BEYOND: MINIMIZING AUTOMATA WITH ERRORS“. International Journal of Foundations of Computer Science 24, Nr. 07 (November 2013): 1083–97. http://dx.doi.org/10.1142/s0129054113400327.

Der volle Inhalt der Quelle

Annotation:

We introduce E-equivalence, which is a straightforward generalization of almost-equivalence. While almost-equivalence asks for ordinary equivalence up to a finite number of exceptions, in E-equivalence these exceptions or errors must belong to a (regular) set E. The computational complexity of deterministic finite automata (DFAs) minimization problems and their variants w.r.t. almost- and E-equivalence are studied. We show that there is a significant difference in the complexity of problems related to almost-equivalence, and those related to E-equivalence. Moreover, since hyper-minimal and E-minimal automata are not necessarily unique (up to isomorphism as for minimal DFAs), we consider the problem of counting the number of these minimal automata.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

Yao, Fenghui, Mohamed Saleh Zein-Sabatto, Guifeng Shao, Mohammad Bodruzzaman und Mohan Malkani. „Nanosensor Data Processor in Quantum-Dot Cellular Automata“. Journal of Nanotechnology 2014 (2014): 1–14. http://dx.doi.org/10.1155/2014/259869.

Der volle Inhalt der Quelle

Annotation:

Quantum-dot cellular automata (QCA) is an attractive nanotechnology with the potential alterative to CMOS technology. QCA provides an interesting paradigm for faster speed, smaller size, and lower power consumption in comparison to transistor-based technology, in both communication and computation. This paper describes the design of a 4-bit multifunction nanosensor data processor (NSDP). The functions of NSDP contain (i) sending the preprocessed raw data to high-level processor, (ii) counting the number of the active majority gates, and (iii) generating the approximate sigmoid function. The whole system is designed and simulated with several different input data.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

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

20

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

21

Stamatovic, Biljana, und Artem Korsun. „Local Data Flow Principles in Porosity of Materials“. Applied Mechanics and Materials 725-726 (Januar 2015): 371–76. http://dx.doi.org/10.4028/www.scientific.net/amm.725-726.371.

Der volle Inhalt der Quelle

Annotation:

We propose a new algorithm for counting closed pores in porous materials. Closed pore can be defined as isolated object of arbitrary shapes in rectangular domains or binary images. The algorithm is based on two cellular automata (CA). First CA saves 2 or more connectivity of image while the second CA is Leviald’s CA that count 1-connected parts after transformations of the initial image. The CA algorithm was implemented on a parallel computer. Computational performances are evaluated and measured on real cases. The obtained results indicate that the proposed approach achieves comparable complexity as standard approaches; however, the number of processing nodes does not limit the speedup and scalability of the proposed algorithm.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

Ramirez, José L., und Mark Shattuck. „Generalized Jacobsthal numbers and restricted k-ary words“. Pure Mathematics and Applications 28, Nr. 1 (01.10.2019): 91–108. http://dx.doi.org/10.1515/puma-2015-0034.

Der volle Inhalt der Quelle

Annotation:

Abstract We consider a generalization of the problem of counting ternary words of a given length which was recently investigated by Koshy and Grimaldi [10]. In particular, we use finite automata and ordinary generating functions in deriving a k-ary generalization. This approach allows us to obtain a general setting in which to study this problem over a k-ary language. The corresponding class of n-letter k-ary words is seen to be equinumerous with the closed walks of length n − 1 on the complete graph for k vertices as well as a restricted subset of colored square-and-domino tilings of the same length. A further polynomial extension of the k-ary case is introduced and its basic properties deduced. As a consequence, one obtains some apparently new binomial-type identities via a combinatorial argument.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

Asinowski, Andrei, Axel Bacher, Cyril Banderier und Bernhard Gittenberger. „Analytic Combinatorics of Lattice Paths with Forbidden Patterns, the Vectorial Kernel Method, and Generating Functions for Pushdown Automata“. Algorithmica 82, Nr. 3 (13.10.2019): 386–428. http://dx.doi.org/10.1007/s00453-019-00623-3.

Der volle Inhalt der Quelle

Annotation:

Abstract In this article we develop a vectorial kernel method—a powerful method which solves in a unified framework all the problems related to the enumeration of words generated by a pushdown automaton. We apply it for the enumeration of lattice paths that avoid a fixed word (a pattern), or for counting the occurrences of a given pattern. We unify results from numerous articles concerning patterns like peaks, valleys, humps, etc., in Dyck and Motzkin paths. This refines the study by Banderier and Flajolet from 2002 on enumeration and asymptotics of lattice paths: we extend here their results to pattern-avoiding walks/bridges/meanders/excursions. We show that the autocorrelation polynomial of this forbidden pattern, as introduced by Guibas and Odlyzko in 1981 in the context of rational languages, still plays a crucial role for our algebraic languages. En passant, our results give the enumeration of some classes of self-avoiding walks, and prove several conjectures from the On-Line Encyclopedia of Integer Sequences. Finally, we also give the trivariate generating function (length, final altitude, number of occurrences of the pattern p), and we prove that the number of occurrences is normally distributed and linear with respect to the length of the walk: this is what Flajolet and Sedgewick call an instance of Borges’s theorem.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

24

VANCHERI, ALBERTO, PAOLO GIORDANO und DENISE ANDREY. „FUZZY LOGIC BASED MODELING OF TRAFFIC FLOWS INDUCED BY REGIONAL SHOPPING MALLS“. Advances in Complex Systems 17, Nr. 03n04 (Juli 2014): 1450017. http://dx.doi.org/10.1142/s0219525914500179.

Der volle Inhalt der Quelle

Annotation:

In this paper, we present an agent-based model aiming at supporting decisions about the planning of shopping malls (SM), with a main focus about their environmental impact. The model forecasts the traffic flows induced by SM at the regional level on the whole road network of Canton Ticino (Switzerland), and has been used by the public administration as a support to decide master plan rules. The system has been modeled as an interaction space, a new type of modeling framework that includes both multi-agent systems and cellular automata as a particular case. We define a grammar to specify different agents' trips, and we associate a fuzzy logic based indicator to each one of these specifications. Similarly, we define attractiveness indicators for zones containing economical activities related to agents' trips. The use of these indicators permits to obtain agents' location choices of secondary activities with a great computational efficiency. Simulations include several environmental indicators, like concentrations of nitrogen dioxide, counting changes in a given small part of a road or an estimation of roads' level of service.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

Marchant, Ross, Martin Tetard, Adnya Pratiwi, Michael Adebayo und Thibault de Garidel-Thoron. „Automated analysis of foraminifera fossil records by image classification using a convolutional neural network“. Journal of Micropalaeontology 39, Nr. 2 (15.10.2020): 183–202. http://dx.doi.org/10.5194/jm-39-183-2020.

Der volle Inhalt der Quelle

Annotation:

Abstract. Manual identification of foraminiferal morphospecies or morphotypes under stereo microscopes is time consuming for micropalaeontologists and not possible for nonspecialists. Therefore, a long-term goal has been to automate this process to improve its efficiency and repeatability. Recent advances in computation hardware have seen deep convolutional neural networks emerge as the state-of-the-art technique for image-based automated classification. Here, we describe a method for classifying large foraminifera image sets using convolutional neural networks. Construction of the classifier is demonstrated on the publicly available Endless Forams image set with a best accuracy of approximately 90 %. A complete automatic analysis is performed for benthic species dated to the last deglacial period for a sediment core from the north-eastern Pacific and for planktonic species dated from the present until 180 000 years ago in a core from the western Pacific warm pool. The relative abundances from automatic counting based on more than 500 000 images compare favourably with manual counting, showing the same signal dynamics. Our workflow opens the way to automated palaeoceanographic reconstruction based on computer image analysis and is freely available for use.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

Shariatmadari, Sima, Sima Emadi und Younes Akbari. „Nonlinear Dynamics Tools for Offline Signature Verification Using One-class Gaussian Process“. International Journal of Pattern Recognition and Artificial Intelligence 34, Nr. 01 (24.05.2019): 2053001. http://dx.doi.org/10.1142/s0218001420530018.

Der volle Inhalt der Quelle

Annotation:

One of the major problems in biometrics and in document forensics is the offline mode of signature verification. This study aims to present a novel approach of verifying an individual’s signature through offline images of handwriting. The approach proposed here relies on a global method which considers signature images as waveforms. First, image decompositions are in terms of a series of wavelet sub-bands at some specific levels. Wavelet sub-bands are then extended so as to obtain waveforms. Each waveform is quantized by two Nonlinear Dynamics Tools in order to generate feature vectors. Multi-Resolution Box-Counting (MRBC) fractal dimension algorithm as well as probabilistic finite state automata (PFSA) are applied separately to signature waveforms. In the training and verification phase, we propose the one-class Gaussian process (GP) priors based on writer-independent approach. As one of the main parameters, optimal decision threshold is selected from False Accept Rate (FAR) and False Reject Rate (FRR) curves. The presented system was tested on two Persian databases (PHBC and UTSig) as well as on two Latin databases (MCYT-75 and CEDAR). In fact, the results produced by this method were generally better in terms of the four signature databases than the state-of-the-art results.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

Patterson, K. G., und A. B. Carter. „Automated differential counting“. Blood Reviews 5, Nr. 2 (Juni 1991): 78–83. http://dx.doi.org/10.1016/0268-960x(91)90038-e.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

Oña, Edwin, Patricia Sánchez-Herrera, Alicia Cuesta-Gómez, Santiago Martinez, Alberto Jardón und Carlos Balaguer. „Automatic Outcome in Manual Dexterity Assessment Using Colour Segmentation and Nearest Neighbour Classifier“. Sensors 18, Nr. 9 (31.08.2018): 2876. http://dx.doi.org/10.3390/s18092876.

Der volle Inhalt der Quelle

Annotation:

Objective assessment of motor function is an important component to evaluating the effectiveness of a rehabilitation process. Such assessments are carried out by clinicians using traditional tests and scales. The Box and Blocks Test (BBT) is one such scale, focusing on manual dexterity evaluation. The score is the maximum number of cubes that a person is able to displace during a time window. In a previous paper, an automated version of the Box and Blocks Test using a Microsoft Kinect sensor was presented, and referred to as the Automated Box and Blocks Test (ABBT). In this paper, the feasibility of ABBT as an automated tool for manual dexterity assessment is discussed. An algorithm, based on image segmentation in CIELab colour space and the Nearest Neighbour (NN) rule, was developed to improve the reliability of automatic cube counting. A pilot study was conducted to assess the hand motor function in people with Parkinson’s disease (PD). Three functional assessments were carried out. The success rate in automatic cube counting was studied by comparing the manual (BBT) and the automatic (ABBT) methods. The additional information provided by the ABBT was analysed to discuss its clinical significance. The results show a high correlation between manual (BBT) and automatic (ABBT) scoring. The lowest average success rate in cube counting for ABBT was 92%. Additionally, the ABBT acquires extra information from the cubes’ displacement, such as the average velocity and the time instants in which the cube was detected. The analysis of this information can be related to indicators of health status (coordination and dexterity). The results showed that the ABBT is a useful tool for automating the assessment of unilateral gross manual dexterity, and provides additional information about the user’s performance.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

Francisco, Jairo Silva, Heleno Pinto de Moraes und Eliane Pedra Dias. „Evaluation of the Image-Pro Plus 4.5 software for automatic counting of labeled nuclei by PCNA immunohistochemistry“. Brazilian Oral Research 18, Nr. 2 (Juni 2004): 100–104. http://dx.doi.org/10.1590/s1806-83242004000200002.

Der volle Inhalt der Quelle

Annotation:

The objective of this study was to create and evaluate a routine (macro) using Image-Pro Plus 4.5 software (Media Cybernetics, Silver Spring, USA) for automatic counting of labeled nuclei by proliferating cell nuclear antigen (PCNA) immunohistochemistry. A total of 154 digital color images were obtained from eleven sections of reticular oral lichen planus stained by PCNA immunohistochemistry. Mean density (gray-level), red density, green density, blue density, area, minor axis, perimeter rate and roundness were parameters used for PCNA labeled nuclei discrimination, followed by their outlined presentation and counting in each image by the macro. Mean density and area thresholds were automatically defined based, respectively, on mean density and mean area of PCNA labeled nuclei in the assessed image. The reference method consisted in visual counting of manually outlined labeled nuclei. Statistical analysis of macro results versus reference countings showed a very significant correlation (r s = 0.964, p < 0.001) for general results and a high level (89.8 ± 3.8%) of correctly counted labeled nuclei. We conclude that the main parameters associated with a high correlation between macro and reference results were mean density (gray-level) and area thresholds based on image profiles; and that Image-Pro Plus 4.5 using a routine with automatic definition of mean density and area thresholds can be considered a valid alternative to visual counting of PCNA labeled nuclei.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

Yang, Pei-Ying, Chin-Dar Tseng, Tai-Lin Huang, Chao-Hong Liu, I.-Hsing Tsai, Wei-Chun Lin, Chin-Shiuh Shieh, Shyh-An Yeh, Stephen Wan Leung und Tsair-Fwu Lee. „Automatic mantispid egg detection and counting using image nature“. International Journal of Modern Physics B 34, Nr. 22n24 (25.08.2020): 2040138. http://dx.doi.org/10.1142/s0217979220401384.

Der volle Inhalt der Quelle

Annotation:

Mantispids are small brown bugs about 1.5 cm in length. Mantispid eggs are produced in large quantities, with about 1000 eggs per spawning, and are tiny and densely packed. Traditionally, mantispid eggs are counted manually. However, counting such a large quantity of eggs is difficult. To provide accurate data for researchers, we detail methods to accurately detect and count the number of mantispid eggs using image processing. The following methods were used to count the mantispid eggs: background estimation, morphological image processing, background subtraction, stretching, image thresholding, gray-level transformation, labeling and counting. The results of automated counting were compared with the results of manual counting. The segmentation results were verified, and the accuracy of the mantispid egg counts was determined to be 100%. This provides a useful resource for mantispid egg counting. The automatic counting system cannot only count mantispid eggs, it can also be used to count other similar insect eggs.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

Abdullah, Afiq, Jasmee Jaafar, Khairul Nizam Tahar und Mohamad Hezri Razali. „Shipping Container Counting Approach Using Unmanned Aerial Vehicle (UAV) and ArcGIS“. Built Environment Journal 16, Nr. 2 (31.07.2019): 15. http://dx.doi.org/10.24191/bej.v16i2.9693.

Der volle Inhalt der Quelle

Annotation:

In Malaysia, the existing of counting approach on the shipping container at depot is carried out by manual based system. This has made the efficiency of the method to be questioned which can be solved through automation. Under previous studies, Unmanned Aerial Vehicle (UAV) is demonstrated for automatic counting of cars and trees. Therefore, the possibility for shipping container counting is highly required in which promotes low-cost alternative and automatedpilot for data collection. Based on this study, the aerial images captured using UAV is combined with geographical information processing software, ArcGIS, towards automated approach for container counting. The overlapping aerial images are post-processed using photogrammetric technique to produce Digital Surface Model (DSM) that represents the ground and above surface feature’s elevations. Then, the constructed DSM is filtered to develop Digital Terrain Model (DTM) where it represents the ground surface’s elevation only. Then, container’s candidates are isolated using subtraction of the DTM from DSM to generate normalized DSM (nDSM) which represents the heights of container’s stacks. From the standard size and height of one container from ISO, the number of containers is extracted. The ModelBuilder tool available in ArcGIS is customized for automated geographical information processing. From results, the proposed approach contributed to 100% of counting accuracy. Keywords: Unmanned Aerial Vehicle, Counting, Shipping Container, ArcGIS, ModelBuilder

APA, Harvard, Vancouver, ISO und andere Zitierweisen

32

Tomori, Zoltán, Ivan Krekule und Lucie Kubínová. „DISECTOR PROGRAM FOR UNBIASED ESTIMATION OF PARTICLE NUMBER, NUMERICAL DENSITY AND MEAN VOLUME“. Image Analysis & Stereology 20, Nr. 2 (03.05.2011): 119. http://dx.doi.org/10.5566/ias.v20.p119-130.

Der volle Inhalt der Quelle

Annotation:

A DISECTOR program is presented, offering the possibility to count particles by the disector or unbiased sampling brick principles as well as to apply the point-counting method needed for estimation of the particle volume density or mean particle volume. Three modes of counting, two semi-automatic and one automatic, are offered, allowing the user to choose the one most suitable for his image data. In a semi-automatic regime, the user marks and counts individual particles by a mouse during browsing through the stack of images. In the algorithm working in an automated mode, the role of a human operator is suppressed, assuming that segmented objects are available in individual levels. The settings of the point grid and 3-D probe can be tailored for each application. The DISECTOR program applications are shown on the examples of the estimation of the number and numerical density of mesophyll cells in a Norway spruce needle and the mean volume of tubular cells in a chick embryonic kidney.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

33

Shortis, Mark R., Mehdi Ravanbakhsh, Faisal Shafait und Ajmal Mian. „Progress in the Automated Identification, Measurement, and Counting of Fish in Underwater Image Sequences“. Marine Technology Society Journal 50, Nr. 1 (01.01.2016): 4–16. http://dx.doi.org/10.4031/mtsj.50.1.1.

Der volle Inhalt der Quelle

Annotation:

AbstractUnderwater video systems are widely used for counting and measuring fish in aquaculture, fisheries, and conservation management. To determine population counts, spatial or temporal frequencies, and age or weight distributions, snout to tail fork length measurements are performed in video sequences, most commonly using a point and click process by a human operator. Current research aims to automate the identification, measurement, and counting of fish in order to improve the efficiency of population counts or biomass estimates. A fully automated process requires the detection and isolation of candidates for measurement, followed by the snout to tail fork length measurement, species classification, as well as the counting and tracking of fish. This paper reviews the algorithms used for the detection, identification, measurement, counting, and tracking of fish in underwater video sequences. The paper analyzes the most commonly used approaches, leading to an evaluation of the techniques most likely to be a comprehensive solution to the complete process of candidate detection, species identification, length measurement, and population counts for biomass estimation.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

34

Ercetin, Ali, Fatih Akkoyun, Ercan Şimşir, Danil Yurievich Pimenov, Khaled Giasin, Manjunath Patel Gowdru Chandrashekarappa, Avinash Lakshmikanthan und Szymon Wojciechowski. „Image Processing of Mg-Al-Sn Alloy Microstructures for Determining Phase Ratios and Grain Size and Correction with Manual Measurement“. Materials 14, Nr. 17 (06.09.2021): 5095. http://dx.doi.org/10.3390/ma14175095.

Der volle Inhalt der Quelle

Annotation:

The study of microstructures for the accurate control of material properties is of industrial relevance. Identification and characterization of microstructural properties by manual measurement are often slow, labour intensive, and have a lack of repeatability. In the present work, the intermetallic phase ratio and grain size in the microstructure of known Mg-Sn-Al alloys were measured by computer vision (CV) technology. New Mg (Magnesium) alloys with different alloying element contents were selected as the work materials. Mg alloys (Mg-Al-Sn) were produced using the hot-pressing powder metallurgy technique. The alloys were sintered at 620 °C under 50 MPa pressure in an argon gas atmosphere. Scanning electron microscopy (SEM) images were taken for all the fabricated alloys (three alloys: Mg-7Al-5Sn, Mg-8Al-5Sn, Mg-9Al-5Sn). From the SEM images, the grain size was counted manually and automatically with the application of CV technology. The obtained results were evaluated by correcting automated grain counting procedures with manual measurements. The accuracy of the automated counting technique for determining the grain count exceeded 92% compared to the manual counting procedure. In addition, ASTM (American Society for Testing and Materials) grain sizes were accurately calculated (approximately 99% accuracy) according to the determined grain counts in the SEM images. Hence, a successful approach was proposed by calculating the ASTM grain sizes of each alloy with respect to manual and automated counting methods. The intermetallic phases (Mg17Al12 and Mg2Sn) were also detected by theoretical calculations and automated measurements. The accuracy of automated measurements for Mg17Al12 and Mg2Sn intermetallic phases were over 95% and 97%, respectively. The proposed automatic image processing technique can be used as a tool to track and analyse the grain and intermetallic phases of the microstructure of other alloys such as AZ31 and AZ91 magnesium alloys, aluminium, titanium, and Co alloys.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

De Potter, Pieterjan, Ioannis Kypraios, Steven Verstockt, Chris Poppe und Rik Van de Walle. „Automatic Passengers Counting In Public Rail Transport Using Wavelets“. Automatika 53, Nr. 4 (Januar 2012): 321–34. http://dx.doi.org/10.7305/automatika.53-4.227.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

Oliveira, Raimundo Antônio Gomes, Maria Mariko Takadachi, Kimiyo Nonoyama und Orlando César de Oliveira Barretto. „Is automated platelet counting still a problem in thrombocytopenic blood?“ Sao Paulo Medical Journal 121, Nr. 1 (2003): 19–23. http://dx.doi.org/10.1590/s1516-31802003000100005.

Der volle Inhalt der Quelle

Annotation:

CONTEXT: Reliable platelet counting is crucial for indicating prophylactic platelet transfusion in thrombocytopenic patients. OBJECTIVE: To evaluate the precision and accuracy of platelet counting for thrombocytopenic patients, using four different automated counters in comparison with the Brecher & Cronkite reference method recommended by the International Committee for Standardization in Hematology (ICSH). TYPE OF STUDY: Automated platelet counting assessment in thrombocytopenic patients. SETTING: Hematology Laboratory, Hospital do Servidor Público Estadual de São Paulo, and the Hematology Division of Instituto Adolfo Lutz, São Paulo, SP, Brazil. MAIN MEASUREMENTS: Brecher & Cronkite reference method and four different automated platelet counters. PARTICIPANTS: 43 thrombocytopenic patients with platelet counts of less than 30,000/µl RESULTS: The ADVIA-120 (Bayer), Coulter STKS, H1 System (Technicom-Bayer) and Coulter T-890 automatic instruments presented great precision and accuracy in relation to laboratory thrombocytopenic samples obtained by diluting blood from normal donors. However, when thrombocytopenic patients were investigated, all the counters except ADVIA (which is based on volume and refraction index) showed low accuracy when compared to the Brecher & Cronkite reference method (ICSH). The ADVIA counter showed high correlation (r = 0.947). However, all counters showed flags in thrombocytopenic samples. CONCLUSION: The Brecher & Cronkite reference method should always be indicated in thrombocytopenic patients for platelet counts below 30,000 plt /µl obtained in one dimensional counters.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

Chen, Jian, Yangyang Fan, Tao Wang, Chu Zhang, Zhengjun Qiu und Yong He. „Automatic Segmentation and Counting of Aphid Nymphs on Leaves Using Convolutional Neural Networks“. Agronomy 8, Nr. 8 (25.07.2018): 129. http://dx.doi.org/10.3390/agronomy8080129.

Der volle Inhalt der Quelle

Annotation:

The presence of pests is one of the main problems in crop production, and obtaining reliable statistics of pest infestation is essential for pest management. Detection of pests should be automated because human monitoring of pests is time-consuming and error-prone. Aphids are among the most destructive pests in greenhouses and they reproduce quickly. Automatic detection of aphid nymphs on leaves (especially on the lower surface) using image analysis is a challenging problem due to color similarity and complicated background. In this study, we propose a method for segmentation and counting of aphid nymphs on leaves using convolutional neural networks. Digital images of pakchoi leaves at different aphid infestation stages were obtained, and corresponding pixel-level binary mask annotated. In the test, segmentation results by the proposed method achieved high overlap with annotation by human experts (Dice coefficient of 0.8207). Automatic counting based on segmentation showed high precision (0.9563) and recall (0.9650). The correlation between aphid nymph count by the proposed method and manual counting was high (R2 = 0.99). The proposed method is generic and can be applied for other species of pests.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

Nachtergaele, Simon, und Johan De Grave. „AI-Track-tive: open-source software for automated recognition and counting of surface semi-tracks using computer vision (artificial intelligence)“. Geochronology 3, Nr. 1 (30.06.2021): 383–94. http://dx.doi.org/10.5194/gchron-3-383-2021.

Der volle Inhalt der Quelle

Annotation:

Abstract. A new method for automatic counting of etched fission tracks in minerals is described and presented in this article. Artificial intelligence techniques such as deep neural networks and computer vision were trained to detect fission surface semi-tracks on images. The deep neural networks can be used in an open-source computer program for semi-automated fission track dating called “AI-Track-tive”. Our custom-trained deep neural networks use the YOLOv3 object detection algorithm, which is currently one of the most powerful and fastest object recognition algorithms. The developed program successfully finds most of the fission tracks in the microscope images; however, the user still needs to supervise the automatic counting. The presented deep neural networks have high precision for apatite (97 %) and mica (98 %). Recall values are lower for apatite (86 %) than for mica (91 %). The application can be used online at https://ai-track-tive.ugent.be (last access: 29 June 2021), or it can be downloaded as an offline application for Windows.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

Pereira, Nilosha, K. K. P. Gayashani, L. G. K. M. Gunathunga, N. Y. Niluka, A. A. J. Chinthaka und Gayana Fernando. „AUTOMATED TRAFFIC COUNTING AND CONTROL.“ International Journal of Advanced Research 5, Nr. 1 (31.01.2017): 10–18. http://dx.doi.org/10.21474/ijar01/2714.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

Prater, Michael A. „The Automatic Tablet Counting Machine“. Journal of Pharmacy Technology 4, Nr. 5 (September 1988): 188–91. http://dx.doi.org/10.1177/875512258800400507.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

Clayton, Joe. „Automated Label-Free Cell Counting“. Genetic Engineering & Biotechnology News 37, Nr. 14 (August 2017): 12–13. http://dx.doi.org/10.1089/gen.37.14.07.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

Zeilberger, Doron. „Automated counting of lego towers“. Journal of Difference Equations and Applications 5, Nr. 4-5 (Januar 1999): 323–33. http://dx.doi.org/10.1080/10236199908808194.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

43

Grishagin, Ivan V. „Automatic cell counting with ImageJ“. Analytical Biochemistry 473 (März 2015): 63–65. http://dx.doi.org/10.1016/j.ab.2014.12.007.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

Marotz, J., C. Lübbert und W. Eisenbeiß. „Effective object recognition for automated counting of colonies in Petri dishes (automated colony counting)“. Computer Methods and Programs in Biomedicine 66, Nr. 2-3 (September 2001): 183–98. http://dx.doi.org/10.1016/s0169-2607(00)00128-0.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

P, Chaya. „An Automated Solution for Extracting and Counting of White Blood Cells in a Blood Smear Images“. International Journal of Trend in Scientific Research and Development Volume-3, Issue-2 (28.02.2019): 137–40. http://dx.doi.org/10.31142/ijtsrd20293.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

Paľo, J., J. Caban, M. Kiktová und Ľ. Černický. „The comparison of automatic traffic counting and manual traffic counting“. IOP Conference Series: Materials Science and Engineering 710 (19.12.2019): 012041. http://dx.doi.org/10.1088/1757-899x/710/1/012041.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

Ying, Yu Ming, und Xiao Hong Yang. „Automatic Counting System Based on MCU“. Applied Mechanics and Materials 273 (Januar 2013): 547–50. http://dx.doi.org/10.4028/www.scientific.net/amm.273.547.

Der volle Inhalt der Quelle

Annotation:

For the low accuracy and low efficiency of artificial counting problem, we introduced a set of automatic counting system which can be applied in the particulate workpiece counting. With infrared transmitting and receiving module as sensor, when a workpiece passes through the surveyed area, the light will be blocked by the workpiece and the receiving module will emit a pulse signal, the counting for the passing workpiece just is the workpiece number. This text make detailed introduction to the hardware circuit and software design and An on-line type automatic control photoelectric counter system is developed based on this photoelectric detection method. The experiments show that the instrument has the advantages of precision counting, fast detection speed and strong practicability.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

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

49

Krezanoski, Joseph D., Kidwell Matshotyana, Nkosinathi Nxumalo, Alison B. Comfort, Phinda Khumalo und Paul J. Krezanoski. „The impact of pill counting on resource-limited health facilities: a thematic qualitative analysis in eSwatini“. Health Policy and Planning 35, Nr. 4 (19.02.2020): 452–60. http://dx.doi.org/10.1093/heapol/czaa007.

Der volle Inhalt der Quelle

Annotation:

Abstract Research on health systems in resource-limited settings has garnered considerable attention, but the dispensing of individual prescriptions has not been thoroughly explored as a specific bottleneck to effective delivery of care. The rise of human immunodeficiency virus/tuberculosis prevalence and non-communicable diseases in the Kingdom of eSwatini has introduced significant pressures on health facilities to meet patient demands for lifelong medications. Because automated pill counting methods are impracticable and expensive, most prescriptions are made by means of manually counting individual prescriptions using a plastic dish and spatula. The aim of this work was to examine the perceptions of health providers of causes for pill counting errors, and pill counting’s impact on clinic workflow. Our study took place in 13 randomly selected public health facilities in eSwatini, stratified by three groups based on monthly patient volumes. Thirty-one participants who count pills regularly and 13 clinic supervisors were interviewed with semi-structured materials and were audio-recorded for later transcription. Interviews were thematically analysed with inductive coding and three major themes emerged: workflow, counting error causes and effect on clinic function. Findings demonstrate large variety in how facilities manage pill counting for prescription making. Due to patient demands, most facilities utilize all available personnel, from cleaners to nurses, to partake in prescription making. Major causes for pill counting errors were distractions, exhaustion and being hurried. Participants mentioned that patients said that they had initially received the wrong quantity of pills and this affected medication adherence measurements based off pill counts. Most participants described how efforts put into pill counting detracted from their work performance, wasted valuable time and increased patient wait times. Future research is needed to quantify prescription accuracy, but our data suggest that interventions directly alleviating the burden of pill counting could lead to improved clinic quality and possibly improve patient outcomes.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

Shih, Frank Y., und Xin Zhong. „Automated Counting and Tracking of Vehicles“. International Journal of Pattern Recognition and Artificial Intelligence 31, Nr. 12 (17.09.2017): 1750038. http://dx.doi.org/10.1142/s0218001417500380.

Der volle Inhalt der Quelle

Annotation:

A robust traffic surveillance system is crucial in improving the control and management of traffic systems. Vehicle flow processing primarily involves counting and tracking vehicles; however, due to complex situations such as brightness changes and vehicle partial occlusions, traditional image segmentation methods are unable to segment and count vehicles correctly. This paper presents a novel framework for vision-based vehicle counting and tracking, which consists of four main procedures: foreground detection, feature extraction, feature analysis, and vehicles counting/tracking. Foreground detection intends to generate regions of interest in an image, which are used to produce significant feature points. Vehicles counting and tracking are achieved by analyzing clusters of feature points. As for testing on recorded traffic videos, the proposed framework is verified to be able to separate occluded vehicles and count the number of vehicles accurately and efficiently. By comparing with other methods, we observe that the proposed framework achieves the highest occlusion segment rate and the counting accuracy.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Zeitschriftenartikel zum Thema „Counting automata“

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