Дисертації: "AUTOMATED NUMBER"

1

Bradford, Alexander. "Automated Conjecturing Approach to the Discrete Riemann Hypothesis." VCU Scholars Compass, 2016. http://scholarscompass.vcu.edu/etd/4470.

Повний текст джерела

Анотація:

This paper is a study on some upper bounds of the Mertens function, which is often considered somewhat of a ``mysterious" function in mathematics and is closely related to the Riemann Hypothesis. We discuss some known bounds of the Mertens function, and also seek new bounds with the help of an automated conjecture-making program named CONJECTURING, which was created by C. Larson and N. Van Cleemput, and inspired by Fajtowicz's Dalmatian Heuristic. By utilizing this powerful program, we were able to form, validate, and disprove hypotheses regarding the Mertens function and how it is bounded.

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Yang, Xiaoli [Verfasser], and M. [Akademischer Betreuer] Weber. "Precise and Automated Tomographic Reconstruction with a Limited Number of Projections / Xiaoli Yang. Betreuer: M. Weber." Karlsruhe : KIT-Bibliothek, 2016. http://d-nb.info/1084112329/34.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Zhai, Xiaojun. "Automatic number plate recognition on FPGA." Thesis, University of Hertfordshire, 2013. http://hdl.handle.net/2299/14231.

Повний текст джерела

Анотація:

Intelligent Transportation Systems (ITSs) play an important role in modern traffic management, which can be divided into intelligent infrastructure systems and intelligent vehicle systems. Automatic Number Plate Recognition systems (ANPRs) are one of infrastructure systems that allow users to track, identify and monitor moving vehicles by automatically extracting their number plates. ANPR is a well proven technology that is widely used throughout the world by both public and commercial organisations. There are a wide variety of commercial uses for the technology that include automatic congestion charge systems, access control and tracing of stolen cars. The fundamental requirements of an ANPR system are image capture using an ANPR camera and processing of the captured image. The image processing part, which is a computationally intensive task, includes three stages: Number Plate Localisation (NPL), Character Segmentation (CS) and Optical Character Recognition (OCR). The common hardware choice for its implementation is often high performance workstations. However, the cost, compactness and power issues that come with these solutions motivate the search for other platforms. Recent improvements in low-power high-performance Field Programmable Gate Arrays (FPGAs) and Digital Signal Processors (DSPs) for image processing have motivated researchers to consider them as a low cost solution for accelerating such computationally intensive tasks. Current ANPR systems generally use a separate camera and a stand-alone computer for processing. By optimising the ANPR algorithms to take specific advantages of technical features and innovations available within new FPGAs, such as low power consumption, development time, and vast on-chip resources, it will be possible to replace the high performance roadside computers with small in-camera dedicated platforms. In spite of this, costs associated with the computational resources required for complex algorithms together with limited memory have hindered the development of embedded vision platforms. The work described in this thesis is concerned with the development of a range of image processing algorithms for NPL, CS and OCR and corresponding FPGA architectures. MATLAB implementations have been used as a proof of concept for the proposed algorithms prior to the hardware implementation. The proposed architectures are speed/area efficient architectures, which have been implemented and verified using the Mentor Graphics RC240 FPGA development board equipped with a 4M Gates Xilinx Virtex-4 LX40. The proposed NPL architecture can localise a number plate in 4.7 ms whilst achieving a 97.8% localisation rate and consuming only 33% of the available area of the Virtex-4 FPGA. The proposed CS architecture can segment the characters within a NP image in 0.2-1.4 ms with 97.7% successful segmentation rate and consumes only 11% of the Virtex-4 FPGA on-chip resources. The proposed OCR architecture can recognise a character in 0.7 ms with 97.3% successful recognition rate and consumes only 23% of the Virtex-4 FPGA available area. In addition to the three main stages, two pre-processing stages which consist of image binarisation, rotation and resizing are also proposed to link these stages together. These stages consume 9% of the available FPGA on-chip resources. The overall results achieved show that the entire ANPR system can be implemented on a single FPGA that can be placed within an ANPR camera housing to create a stand-alone unit. As the benefits of this are drastically improve energy efficiency and removing the need for the installation and cabling costs associated with bulky PCs situated in expensive, cooled, waterproof roadside cabinets.

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Xu, Shuiai. "Automatic location of number plates at night time." Thesis, Högskolan i Gävle, Avdelningen för Industriell utveckling, IT och Samhällsbyggnad, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:hig:diva-16482.

Повний текст джерела

Анотація:

In transport information area, in order to improve control system, identifying vehicle plates is very important. For that reason we are focusing on recognizing the vehicle plate from an image. To distinguish one car from others, one should remove all area except the vehicle plate. Due to the extra difficulties, like limited light, distances, moving etc., it can be hard to detect the final vehicle plate. In this work, we have solved the location of vehicle plate at night time, by separating the objects from the background by using morphological processing and analyzing the characteristics of vehicle plates by using removal of noise and mathematical calculations. According to some characteristics of cars and vehicle plates we developed an algorithm to detect the number of final vehicle plate. This algorithm works fine, and the detected result is accurate.

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Kondler, Radim. "Automatický tarifikační systém telefonních hovorů." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2016. http://www.nusl.cz/ntk/nusl-242032.

Повний текст джерела

Анотація:

The thesis deals with the numbering plan, PBX, tariffs, draft disable tariff system and its possible extensions. Within numbering plans work deals with shapes of national and international figures, describes different types of these numbers, description of the structure and definition of fields, including the length of these fields. Within countries and regions of the Czech Republic are given individual prefix for both fixed and mobile networks. There are mentioned special shapes that are different in length compared to standard types. All these types of shapes are listed according to ITU-T. Within the exchanges are given generation switches, PBXs use within the telephone network and a description of the selected functions. Furthermore, there are kinds of pricing and options of valuation call. The work contains a description of automated acconting system, according to the principle of work of the program and a description of the individual steps and functions that thanks to the cooperation process individually each calls, convert numbers to international form, assigns the call tariff and appreciate the call according to the tariff. Finally, there are described possible extensions of this automated acconting system.

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Johnson, Abioseh Saeley. "Automatic number-plate recognition : an application of computer vision technology to automatic vehicle identification." Thesis, University of Bristol, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.300053.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Cisse, Baki. "Automates cellulaires pour la modélisation et le contrôle en épidémiologie." Thesis, Perpignan, 2015. http://www.theses.fr/2015PERP0011.

Повний текст джерела

Анотація:

Ce travail de thèse traite de la modélisation et du contrôle des maladies infectieuses à l’aide des automates cellulaires. Nous nous sommes d’abord focalisés sur l’étude d’un modèle de type SEIR. Nous avons pu monter d’une part qu’un voisinage fixe pouvait entrainer une sous-évaluation de l’incidence et de la prévalence et d’autre part que sa structure a un impact direct sur la structure de la distribution de la maladie. Nous nous sommes intéressés également la propagation des maladies vectorielles à travers un modèle de type SIRS-SI multi-hôtes dans un environnement hétérogène.Les hôtes y étaient caractérisés par leur niveau de compétence et l’environnement par la variation du taux de reproduction et de mortalité. Son application à la maladie de Chagas, nous a permis de montrer que l’hétérogénéité de l’habitat et la diversité des hôtes contribuaient à faire baisser l’infection. Cependant l’un des principaux résultats de notre travail à été la formulation du nombre de reproduction spatiale grâce à deux matrices qui représentent les coefficients d’interactions entre les différentes cellules du réseau
This PhD thesis considers the general problem of epidemiological modelling and control using cellular automata approach.We first focused on the study of the SEIR model. On the one hand, we have shown that the traditionnal neighborhood contribute to underestimate the incidence and prevalence of infection disease. On the other hand, it appeared that the spatial distribution of the cells in the lattice have a real impact on the disease spreading. The second study concerns the transmission of the vector-borne disease in heterogeneous landscape with host community. We considered a SIRS-SI with various level of competence at witch the environnment heterogeneity has been characterized by the variation of the birth flow and the death rate. We simulated the Chagas disease spreading and shown that the heterogeneity of habitat and host diversity contribute to decrease the infection. One of the most important results of our work, was the proposition of the spatial reproduction number expression based on two matrices that represent the interaction factors between the cells in the lattice

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Fahmy, Maged Mohamed Mahoud. "Application of computer vision to automatic vehicle identification." Thesis, University of Newcastle Upon Tyne, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.244940.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

9

TANG, LI. "Automatic Extraction of Number of Lanes from Aerial Images for Transportation Applications." FIU Digital Commons, 2015. http://digitalcommons.fiu.edu/etd/2200.

Повний текст джерела

Анотація:

Number of lanes is a basic roadway attribute that is widely used in many transportation applications. Traditionally, number of lanes is collected and updated through field surveys, which is expensive especially for large coverage areas with a high volume of road segments. One alternative is through manual data extraction from high-resolution aerial images. However, this is feasible only for smaller areas. For large areas that may involve tens of thousands of aerial images and millions of road segments, an automatic extraction is a more feasible approach. This dissertation aims to improve the existing process of extracting number of lanes from aerial images automatically by making improvements in three specific areas: (1) performance of lane model, (2) automatic acquisition of external knowledge, and (3) automatic lane location identification and reliability estimation. In this dissertation, a framework was developed to automatically recognize and extract number of lanes from geo-rectified aerial images. In order to address the external knowledge acquisition problem in this framework, a mapping technique was developed to automatically estimate the approximate pixel locations of road segments and the travel direction of the target roads in aerial images. A lane model was developed based on the typical appearance features of travel lanes in color aerial images. It provides more resistance to “noise” such as presence of vehicle occlusions and sidewalks. Multi-class classification test results based on the K-nearest neighbor, logistic regression, and Support Vector Machine (SVM) classification algorithms showed that the new model provides a high level of prediction accuracy. Two optimization algorithms based on fixed and flexible lane widths, respectively, were then developed to extract number of lanes from the lane model output. The flexible lane-width approach was recommended because it solved the problems of error-tolerant pixel mapping and reliability estimation. The approach was tested using a lane model with two SVM classifiers, i.e., the Polynomial kernel and the Radial Basis Function (RBF) kernel. The results showed that the framework yielded good performance in a general test scenario with mixed types of road segments and another test scenario with heavy plant occlusions.

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Robinson, Alan. "Validating traffic models using large-scale automatic number plate recognition (ANPR) data." Diss., University of Pretoria, 2017. http://hdl.handle.net/2263/66238.

Повний текст джерела

Анотація:

Traditional manual survey methods for collecting reliable origin-destination data to develop large strategic transport model is notoriously expensive and the sample sizes are often relatively small. Arguably, the least reliable data required for the development of strategic traffic models is the origin-destination data. Recent technological advances, such as probe data from on-board devices, have been successful in providing data for some needs such as journey times and routing options. However, varying degrees of success have been achieved in obtaining reliable origin-destination (OD) data from these new technologies. Automatic Number Plate Recognition (ANPR) is one if the newer technologies that could be used to collect large-scale data sets over the large study areas that strategic traffic models cover. The aim of this study is to examine ANPR data collected from the Gauteng Freeway Improvement Project's (GFIP) Open Road Tolling (ORT) gantries in terms of its accuracy and uses in the development and improvement of strategic traffic models. Of particular interest is the use of the ANPR data to contribute towards the improvement of the distribution of trips in the OD matrices. This is achieved by developing methodologies to derive comparable gantry to gantry traffic volumes from the ANPR data and the GFIP traffic model. The above comparisons enabled the undertaking of a post opening project evaluation of the GFIP traffic model's 2015 forecasts using as many characteristics of the traffic flows and patterns that can be derived from the ANPR data. Characteristics such as traffic volumes and journey times are directly comparable with standard traffic model outputs. Tracking vehicles between gantries enabled the calculation of the number of trips that travel between gantry pairs giving rise to gantry-to-gantry (G2G) trips, which can be represented in a G2G count matrix. This G2G count matrix has probably the most beneficial data that can be derived from the ANPR systems as it contains an "accurate" element of the trip distribution on the road network. A methodology was developed to derive equivalent trip matrices from a traffic model's select-link trip matrices where the links are those where the gantry (ANPR camera) is located. The sums of the trips in the derived sub-matrices match the G2G counts. This enabled the comparison between the modelled trip distribution represented by the select link to select link (SL2SL) volumes and the actual ANPR G2G counts. This is in fact a comparison of a portion of the model's distribution to actual, comprehensive data. This study demonstrates that ANPR data has the potential to improve strategic traffic models. The automation of the processes to derive the SL2SL assigned volumes from the models and combining it with existing matrix estimation techniques will enhance the trip distribution in the output trip matrix. The current practice of using individual traffic counts in matrix estimation has the adverse tendency to affect the trip distribution. Hence, the recommendation to use traffic counts in matrix estimation to traffic counts with caution.
Dissertation (MEng)--University of Pretoria, 2017.
Civil Engineering
MEng
Unrestricted

Стилі APA, Harvard, Vancouver, ISO та ін.

11

Haines, Alina. "The role of automatic number plate recognition surveillance within policing and public reassurance." Thesis, University of Huddersfield, 2009. http://eprints.hud.ac.uk/id/eprint/8760/.

Повний текст джерела

Анотація:

This Thesis examines the role that Automatic Number Plate Recognition surveillance plays within policing and public reassurance. The thesis is improvement orientated, exploring how ANPR could become a more effective policing tool and highlights implications for future policies and practice. The first two chapters set the context for the research, explaining what ANPR is, its place within criminology and gaps in research addressed in the Thesis. The literature review calls for a better understanding of ANPR’s potential and role as an investigative tool and an examination of the public’s views about ANPR surveillance. In the third chapter, reference is made to available methods used to address such objectives. Chapters Four, Five and Six present the results emerging from the empirical work in this Thesis. Chapter Four is concerned with police perceptions regarding current ANPR practice. The thesis highlights the complexity of translating policy into practice in the current political and economic climate, where objectives and priorities dictated by the government are constantly shifting. Continuing its improvement orientation, Chapter Five covers public perceptions about ANPR and outlines ways to address the balance between privacy and security without endangering both. The potential impact of ANPR on crime and ways to measure it is the topic of Chapter Six, which argues that establishing a causal link between ANPR and crime is not a straightforward process. The concluding chapter talks about the implications of the study and any interesting future avenues for research. The emerging findings from this research sit uncomfortably with the opinions and predictions of both supporters and opponents of ANPR alike and shed light not only on the management and use of ANPR by the police in Britain, but also on many of the ethical issues raised by the emergence of new surveillance technologies.

Стилі APA, Harvard, Vancouver, ISO та ін.

12

Shenoi, Sangeetha Chandra. "A Comparative Study on Methods for Stochastic Number Generation." University of Cincinnati / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1511881394773194.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

13

Fransson, Linnea. "Monomial Cellular Automata : A number theoretical study on two-dimensional cellular automata in the von Neumann neighbourhood over commutative semigroups." Thesis, Linnéuniversitetet, Institutionen för matematik (MA), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-51865.

Повний текст джерела

Анотація:

In this report, we present some of the results achieved by investigating two-dimensional monomial cellular automata modulo m, where m is a non-zero positive integer. Throughout the experiments, we work with the von Neumann neighbourhood and apply the same local rule based on modular multiplication. The purpose of the study is to examine the behaviour of these cellular automata in three different environments, (i.e. the infinite plane, the finite plane and the torus), by means of elementary number theory. We notice how the distance between each pair of cells with state 0 influences the evolution of the automaton and the convergence of its configurations. Similar impact is perceived when the cells attain the values of Euler's- $\phi$ function or of integers with common divisors with m, when m > 2. Alongside with the states of the cells, the evolution of the automaton, as well as the convergence of its configurations, are also decided by the values attributed to m, whether it is a prime, a prime power or a multiple of primes and/or prime powers.

Стилі APA, Harvard, Vancouver, ISO та ін.

14

Csorba, Robert. "An analysis of serial number tracking automatic identification technology as used in naval aviation programs." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2002. http://library.nps.navy.mil/uhtbin/hyperion-image/02sep%5FCsorba.pdf.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

15

Leydold, Josef, and Wolfgang Hörmann. "The Automatic Generation of One- and Multi-dimensional Distributions with Transformed Density Rejection." Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business, 1997. http://epub.wu.ac.at/1328/1/document.pdf.

Повний текст джерела

Анотація:

A rejection algorithm, called ``transformed density rejection", is presented. It uses a new method for constructing simple hat functions for a unimodal density $f$. It is based on the idea of transforming $f$ with a suitable transformation $T$ such that $T(f(x))$ is concave. The hat function is then constructed by taking the pointwise minimum of tangents which are transformed back to the original scale. The resulting algorithm works very well for a large class of distributions and is fast. The method is also extended to the two- and multidimensional case. (author's abstract)
Series: Preprint Series / Department of Applied Statistics and Data Processing

Стилі APA, Harvard, Vancouver, ISO та ін.

16

Mujumdar, Monali. "Estimation of the number of syllables using hidden Markov models and design of a dysarthria classifier using global statistics of speech." Laramie, Wyo. : University of Wyoming, 2006. http://proquest.umi.com/pqdweb?did=1283963331&sid=6&Fmt=2&clientId=18949&RQT=309&VName=PQD.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

17

Molčány, Peter. "Zpracování obrazu v systému Android - detekce a rozpoznání SPZ/RZ a využití externí databáze zájmových vozidel." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2015. http://www.nusl.cz/ntk/nusl-221270.

Повний текст джерела

Анотація:

The aim of this Master's thesis is designing and developing Android application for automatic number plate recognition with external database lookup. In the introduction we discuss possibilities of number plate recognition in general. Android platform fundamentals, necessary developer tools and multi-platform image processing library OpenCV are described in the second section. In the third section different database types and synchronization methods are introduced. In the fourth section we describe basics of image processing and different algorithms necessary for recognition. Application requirements, involving scene and hardware requirements are defined in the fifth section. In the sixth section application development and algorithm implementation is described. In the seventh section we evalute the results of the detection. In the last section results are summarized and goals are set for further improvement.

Стилі APA, Harvard, Vancouver, ISO та ін.

18

Jin, Kang Meir Amnon J. "The lattice gas model and Lattice Boltzmann model on hexagonal grids." Auburn, Ala., 2005. http://repo.lib.auburn.edu/2005%20Summer/master's/JIN_KANG_53.pdf.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

19

Hörmann, Wolfgang, and Josef Leydold. "Automatic Random Variate Generation for Simulation Input." Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business, 2000. http://epub.wu.ac.at/534/1/document.pdf.

Повний текст джерела

Анотація:

We develop and evaluate algorithms for generating random variates for simulation input. One group called automatic, or black-box algorithms can be used to sample from distributions with known density. They are based on the rejection principle. The hat function is generated automatically in a setup step using the idea of transformed density rejection. There the density is transformed into a concave function and the minimum of several tangents is used to construct the hat function. The resulting algorithms are not too complicated and are quite fast. The principle is also applicable to random vectors. A second group of algorithms is presented that generate random variates directly from a given sample by implicitly estimating the unknown distribution. The best of these algorithms are based on the idea of naive resampling plus added noise. These algorithms can be interpreted as sampling from the kernel density estimates. This method can be also applied to random vectors. There it can be interpreted as a mixture of naive resampling and sampling from the multi-normal distribution that has the same covariance matrix as the data. The algorithms described in this paper have been implemented in ANSI C in a library called UNURAN which is available via anonymous ftp. (author's abstract)
Series: Preprint Series / Department of Applied Statistics and Data Processing

Стилі APA, Harvard, Vancouver, ISO та ін.

20

Rigoti, Marcio Dominicali. "Números primos: os átomos dos números." Universidade Tecnológica Federal do Paraná, 2014. http://repositorio.utfpr.edu.br/jspui/handle/1/1075.

Повний текст джерела

Анотація:

CAPES
Este trabalho apresenta um estudo sobre os Números Primos que passa por resultados básicos, como a infinitude dos números primos e o Teorema Fundamental da Aritmética, e resultados mais sofisticados, como o Teorema de Wilson e a consequente função geradora de primos. Além dos resultados teóricos apresenta-se uma interpretação geométrica para os números primos. Essa interpretação e aplicada na ilustração de alguns dos resultados relacionados a primos abordados no ensino básico. Atividades envolvendo a interpretação geométrica apresentada são sugeridas no capítulo final.
This work presents a study about Prime Numbers, since basic results, like the prime number’s infinity and the Arithmetic Fundamental Theorem, to more sophisticated results, as Wilson’s Theorem and it’s consequent Prime generating function. Further the theoretical results we present a prime’s geometric interpretation. This interpretation is applied to illustrate some results related to primes, which appears in basic education. Activities about this geometric interpretation are suggested in the final chapter.

Стилі APA, Harvard, Vancouver, ISO та ін.

21

Leydold, Josef. "Automatic Sampling with the Ratio-of-uniforms Method." Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business, 1999. http://epub.wu.ac.at/84/1/document.pdf.

Повний текст джерела

Анотація:

Applying the ratio-of-uniforms method for generating random variates results in very efficient, fast and easy to implement algorithms. However parameters for every particular type of density must be precalculated analytically. In this paper we show, that the ratio-of-uniforms method is also useful for the design of a black-box algorithm suitable for a large class of distributions, including all with log-concave densities. Using polygonal envelopes and squeezes results in an algorithm that is extremely fast. In opposition to any other ratio-of-uniforms algorithm the expected number of uniform random numbers is less than two. Furthermore we show that this method is in some sense equivalent to transformed density rejection. (author's abstract)
Series: Preprint Series / Department of Applied Statistics and Data Processing

Стилі APA, Harvard, Vancouver, ISO та ін.

22

Lechner, Antonia. "Extensions of Presburger arithmetic and model checking one-counter automata." Thesis, University of Oxford, 2016. https://ora.ox.ac.uk/objects/uuid:687bd910-392a-4db0-9fc6-eb10efb8235b.

Повний текст джерела

Анотація:

This thesis concerns decision procedures for fragments of linear arithmetic and their application to model-checking one-counter automata. The first part of this thesis covers the complexity of decision problems for different types of linear arithmetic, namely the existential subset of the first-order linear theory over the p-adic numbers and the existential subset of Presburger arithmetic with divisibility, with all integer constants and coefficients represented in binary. The most important result of this part is a new upper complexity bound of NEXPTIME for existential Presburger arithmetic with divisibility. The best bound that was known previously was 2NEXPTIME, which followed directly from the original proof of decidability of this theory by Lipshitz in 1976. Lipshitz also gave a proof of NP-hardness of the problem in 1981. Our result is the first improvement of the bound since this original description of a decision procedure. Another new result, which is both an important building block in establishing our new upper complexity bound for existential Presburger arithmetic with divisibility and an interesting result in its own right, is that the decision problem for the existential linear theory of the p-adic numbers is in the Counting Hierarchy CH, and thus within PSPACE. The precise complexity of this problem was stated as open by Weispfenning in 1988, who showed that it is in EXPTIME and NP-hard. The second part of this thesis covers two problems concerning one-counter automata. The first problem is an LTL synthesis problem on one-counter automata with integer-valued and parameterised updates and with equality tests. The decidability of this problem was stated as open by Göller et al. in 2010. We give a reduction of this problem to the decision problem of a subset of Presburger arithmetic with divisibility with one quantifier alternation and a restriction on existentially quantified variables. A proof of decidability of this theory is currently under review. The final result of this thesis concerns a type of one-counter automata that differs from the previous one in that it allows parameters only on tests, not actions, and it includes both equality and disequality tests on counter values. The decidability of the basic reachability problem on such one-counter automata was stated as an open problem by Demri and Sangnier in 2010. We show that this problem is decidable by a reduction to the decision problem for Presburger arithmetic.

Стилі APA, Harvard, Vancouver, ISO та ін.

23

Neron, Pierre. "A Quest for Exactness: Program Transformation for Reliable Real Numbers." Phd thesis, Ecole Polytechnique X, 2013. http://tel.archives-ouvertes.fr/tel-00924379.

Повний текст джерела

Анотація:

Cette thèse présente un algorithme qui élimine les racines carrées et les divi- sions dans des programmes sans boucles, utilisés dans des systèmes embarqués, tout en préservant la sémantique. L'élimination de ces opérations permet d'éviter les erreurs d'arrondis à l'exécution, ces erreurs d'arrondis pouvant entraîner un comportement complètement inattendu de la part du programme. Cette trans- formation respecte les contraintes du code embarqué, en particulier la nécessité pour le programme produit de s'exécuter en mémoire fixe. Cette transformation utilise deux algorithmes fondamentaux développés dans cette thèse. Le premier permet d'éliminer les racines carrées et les divisions des expressions booléennes contenant des comparaisons d'expressions arithmétiques. Le second est un algo- rithme qui résout un problème d'anti-unification particulier, que nous appelons anti-unification contrainte. Cette transformation de programme est définie et prou- vée dans l'assistant de preuves PVS. Elle est aussi implantée comme une stratégie de ce système. L'anti-unification contrainte est aussi utilisée pour étendre la transformation à des programmes contenant des fonctions. Elle permet ainsi d'éliminer les racines carrées et les divisions de spécifications écrites en PVS. La robustesse de cette méthode est mise en valeur par un exemple conséquent: l'élimination des racines carrées et des divisions dans un programme de détection des conflits aériens.

Стилі APA, Harvard, Vancouver, ISO та ін.

24

Amri, Anis. "Autour de quelques statistiques sur les arbres binaires de recherche et sur les automates déterministes." Thesis, Université de Lorraine, 2018. http://www.theses.fr/2018LORR0301.

Повний текст джерела

Анотація:

Cette thèse comporte deux parties indépendantes. Dans la première partie, nous nous intéressons à l’analyse asymptotique de quelques statistiques sur les arbres binaires de recherche (ABR). Dans la deuxième partie, nous nous intéressons à l’étude du problème du collectionneur de coupons impatient. Dans la première partie, en suivant le modèle introduit par Aguech, Lasmar et Mahmoud [Probab. Engrg. Inform. Sci. 21 (2007) 133—141], on définit la profondeur pondérée d’un nœud dans un arbre binaire enraciné étiqueté comme la somme de toutes les clés sur le chemin qui relie ce nœud à la racine. Nous analysons alors dans ABR, les profondeurs pondérées des nœuds avec des clés données, le dernier nœud inséré, les nœuds ordonnés selon le processus de recherche en profondeur, la profondeur pondérée des trajets, l’indice de Wiener pondéré et les profondeurs pondérées des nœuds avec au plus un enfant. Dans la deuxième partie, nous étudions la forme asymptotique de la courbe de la complétion de la collection conditionnée à T_n≤ (1+Λ), Λ>0, où T_n≃n ln⁡n désigne le temps nécessaire pour compléter la collection. Puis, en tant qu’application, nous étudions les automates déterministes et accessibles et nous fournissons une nouvelle dérivation d’une formule due à Korsunov [Kor78, Kor86]
This Phd thesis is divided into two independent parts. In the first part, we provide an asymptotic analysis of some statistics on the binary search tree. In the second part, we study the coupon collector problem with a constraint. In the first part, following the model introduced by Aguech, Lasmar and Mahmoud [Probab. Engrg. Inform. Sci. 21 (2007) 133—141], the weighted depth of a node in a labelled rooted tree is the sum of all labels on the path connecting the node to the root. We analyze the following statistics : the weighted depths of nodes with given labels, the last inserted node, nodes ordered as visited by the depth first search procees, the weighted path length, the weighted Wiener index and the weighted depths of nodes with at most one child in a random binary search tree. In the second part, we study the asymptotic shape of the completion curve of the collection conditioned to T_n≤ (1+Λ), Λ>0, where T_n≃n ln⁡n is the time needed to complete accessible automata, we provide a new derivation of a formula due to Korsunov [Kor78, Kor86]

Стилі APA, Harvard, Vancouver, ISO та ін.

25

Wojcik, Caius. "Factorisations des mots de basse complexité." Thesis, Lyon, 2019. http://www.theses.fr/2019LYSE1340.

Повний текст джерела

Анотація:

Nous présentons dans ce doctorat de mathématiques le travail effectué pendant trois ans à l'Université Claude Bernard Lyon 1. Ce doctorat a été réalisé sous les directions de Boris Adamczewski et Luca Zamboni, tous deux chercheurs à l'UCBL. Le thème général abordé est la combinatoire des mots, sous la forme de deux contributions, l'une concernant la théorie de Ramsey développée dans la première partie, et l'autre la classe des mots sturmiens développée dans la seconde partie. La combinatoire des mots est un domaine à la croisée des mathématiques, et plus généralement des sciences. Avec l'essor de l'informatique théorique, ou encore des progrès de la génétique, l'étude des suites de symboles est devenu un sujet de recherche incontournable à l'importance grandissante. Les mots vus comme suites de symboles sont en effet intrinsèquement soumis à des lois mathématiques d'une profonde subtilité. L'exemple historique d'Axel Thue d'un mot infini sans facteurs carrés sur un alphabet à trois lettres a été un des points de départ de cette théorie, via une construction non-triviale d'un mot infini soumis à une condition pourtant très simple en apparence. Que ce soit dans la structure des décimales des nombre réels, dans les codes informatiques omniprésents dans le fonctionnement des ordinateurs, ou dans notre propre code génétique, la combinatoire des mots fournit un cadre commun pour une étude en profondeur de problématiques actuelles. Le présent doctorat s'inscrit naturellement dans ce processus scientifique. Directement inspiré par les travaux fondateurs d'Axel Thue, nous étudions dans la première partie les conditions d'existence d'objets combinatoires (en outre, des colorations) soumis à des contraintes d'apparence simples, et nous apportons une réponse optimale à une conjecture qui est restée ouverte pendant une décennie. Cette solution exploite les différences et liens entre les notions naturelles de préfixe et de suffixe en combinatoire des mots. Notre seconde partie, quant à elle, étudie une version infinie du système de numération d'Ostrowski, à l'aide des mots de basse complexité donnés par les mots infinis non-ultimement périodiques de plus petite fonction de complexité que sont les mots sturmiens. Construit d'une manière analogue aux nombres p-adiques, le formalisme introduit et développé concernant les intercepts formels en vue de donner une description combinatoire de la classe des mots sturmiens a pour conséquences plusieurs résultats concernant les factorisations de ces mots. Le calcul des compléments étudié à la fin de cette partie montre comment la comparaison des opérations de préfixe et de suffixe peut être utilisée pour obtenir des résultats non-triviaux concernant les factorisations des mots de basse complexité
We present in this PhD. in Mathematics the work effectuated during three years at the Lyon 1 University Chaude Bernard Lyon 1. This PhD. has been realied under the supervisions of Boris Adamczewki and Luca Zamboni, both researchers in the Lyon 1 University. The general topic is combinatorics on words, in the form of two contributions, one of them on the limits of Ramsey theory in this context developped in the first part, and the second on the links between the Ostrowski numeration system and factorisations of sturmian words. Combinatorics on words is a domain at the intersections of mathematics, and more generally of sciences. With the emergence of theoretical computer science, or of progresses in genetics, the study of sequences of symbols has become a unavoidable research subject of growing importance. Words seen as a sequence of symboles are indeed bound to deep and subtle mathematical laws. The historical example discovered by Axel Thue of an infinite square-free word over a 3-letter alphabet have been the start of this theory, with a non-trivial construction of a specific word submitted to a seemingly very simple condition. Whether it is within the structure of decimals of real numbers, in the code lines everywhere in computers or inside our own genetic information, combinatorics on words gives a comon theoretical set of tools for a deep study of a number of present scientific issues. The present PhD. lands naturally within this scientific process. Directly inspired by the fundamental work of Axel Thue, we study in the first part the condition for the existence of combinatorial objects, colorations, submitted to a monochromatic constraint, and provide an optimal answer to a conjecture that have remained open for 10 years. This solution exploits the differences and links between the notions of prefixes and suffixes in combinatorics on words. In a second part, we study a infinite version of the Ostrowski numeration system, with the use of the low complexity class of words formed by the sturmian words. Built in a similar way as the p-adic number, the introduced and developped formalism on formal intercepts with the purpose of describing combinatorially the class of sturmian words has several consequences with regards to their factorisations. The calculus of complement, presented at the end shows how comparison of the prefix and suffix operations can be used to derived non-trivial results on factorisation of low complecity words

Стилі APA, Harvard, Vancouver, ISO та ін.

26

Costa, Maurício Verardo da. "Representando famílias de autômatos celulares por meio de templates." Universidade Presbiteriana Mackenzie, 2015. http://tede.mackenzie.br/jspui/handle/tede/1454.

Повний текст джерела

Анотація:

Made available in DSpace on 2016-03-15T19:37:54Z (GMT). No. of bitstreams: 1 MAURICIO VERARDO DA COSTA.pdf: 829862 bytes, checksum: 7cb233efb8692b0820e30cf2bdbf4a76 (MD5) Previous issue date: 2015-02-10
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
The notion of a template for representing cellular automata (CA) rules is introduced. This enhances the standard representation based on a rule table, in that it refers to families of cellular automata, instead of a rule alone. Operations applicable to the templates are defined herein, and their use is exemplified in the context of finding representations for rule sets that share properties. Wolfram Mathematica's functional nature and built-in equation-solving capabilities are central to develop these algorithms. The perspectives for using templates in further contexts are also discussed, along with possible extensions to the present work. As a support to the template concept, a Wolfram Mathematica package called CATemplates is presented, shared with the community using a public repository.
A noção de representação de autômatos celulares (ACs) por meio de templates é aqui introduzida. Ela consiste em uma generalização da tabela de transições de estado clássica, permitindo a representação de subespaços de autômatos celulares, ao invés de apenas indivíduos isolados. São definidas operações aplicáveis aos templates, e seu uso é exemplificado por meio da obtenção de algoritmos que encontram subespaços de regras que apresentam propriedades em comum. Para o desenvolvimento destes algoritmos, a utilização do software Wolfram Mathematica é central, dada sua capacidade de resolução automática de sistemas de equações, além da natureza funcional e simbólica da Wolfram Language, linguagem de programação a ele associada. Também são discutidas as vantagens e desvantagens da utilização deste tipo de representação em outros contextos, e possiblidades de extensão para o trabalho. Como apoio ao conceito dos templates, é apresentada a biblioteca para o Wolfram Mathematica chamada CATemplates, disponibilizada em um repositório público.

Стилі APA, Harvard, Vancouver, ISO та ін.

27

Passerat-Palmbach, Jonathan. "Contributions to parallel stochastic simulation : application of good software engineering practices to the distribution of pseudorandom streams in hybrid Monte Carlo simulations." Phd thesis, Université Blaise Pascal - Clermont-Ferrand II, 2013. http://tel.archives-ouvertes.fr/tel-00858735.

Повний текст джерела

Анотація:

The race to computing power increases every day in the simulation community. A few years ago, scientists have started to harness the computing power of Graphics Processing Units (GPUs) to parallelize their simulations. As with any parallel architecture, not only the simulation model implementation has to be ported to the new parallel platform, but all the tools must be reimplemented as well. In the particular case of stochastic simulations, one of the major element of the implementation is the pseudorandom numbers source. Employing pseudorandom numbers in parallel applications is not a straightforward task, and it has to be done with caution in order not to introduce biases in the results of the simulation. This problematic has been studied since parallel architectures are available and is called pseudorandom stream distribution. While the literature is full of solutions to handle pseudorandom stream distribution on CPU-based parallel platforms, the young GPU programming community cannot display the same experience yet. In this thesis, we study how to correctly distribute pseudorandom streams on GPU. From the existing solutions, we identified a need for good software engineering solutions, coupled to sound theoretical choices in the implementation. We propose a set of guidelines to follow when a PRNG has to be ported to GPU, and put these advice into practice in a software library called ShoveRand. This library is used in a stochastic Polymer Folding model that we have implemented in C++/CUDA. Pseudorandom streams distribution on manycore architectures is also one of our concerns. It resulted in a contribution named TaskLocalRandom, which targets parallel Java applications using pseudorandom numbers and task frameworks. Eventually, we share a reflection on the methods to choose the right parallel platform for a given application. In this way, we propose to automatically build prototypes of the parallel application running on a wide set of architectures. This approach relies on existing software engineering tools from the Java and Scala community, most of them generating OpenCL source code from a high-level abstraction layer.

Стилі APA, Harvard, Vancouver, ISO та ін.

28

BOLLO, MATTEO. "Architectures and Design Methodologies for Micro and Nanocomputing." Doctoral thesis, Politecnico di Torino, 2017. http://hdl.handle.net/11583/2679368.

Повний текст джерела

Анотація:

For many years, the transistors placement was not limited by interconnections thanks to the Digital Integrated Circuits market that is changing from a situation where CMOS technology was the reference (microelectronics era) to a plurality of emerging technologies (nanoelectronics era). The costs of optics photolithography needed to produce the recent CMOS technologies are increasing to such an extent as to make interesting the exploration of nanoelectronics alternative solutions. These technologies are called beyond CMOS technologies. Among the application fields, Information Security is one of the most pioneering rising market: several application areas need to ensure confidentiality and authenticity of data through cryptographic solutions. In some cases, cryptographic primitives can benefit a strong hardware acceleration. Unfortunately, CMOS based systems are vulnerable to ageing factors, such as Electromigration which decreases the reliability of certain security properties, and to Side-Channel attacks, where an attacker can retrieve confidential information by observing the power consumption. In this scenario, it is possible to speculate that emerging nanotechnologies can be exploited to cover the gaps left uncovered by CMOS technologies. A sub-class of circuits based on this novel techno- logical approach are called Dynamically-Coupled Systems (DCS). These novel technologies go beyond the transistor-interconnection dichotomy: elaboration, storage and transmission functions are all performed by the same device. DCS building blocks are called Processing Elements (PE). Interconnections are replaced with PE chains that are intrinsically pipelined. Ideally, it is possible to divide DCS technologies in two conventional sub-classes: Electrical-Coupled Technologies (ECT) where information propagation is due to electrons flow across ohmic paths and Field-Coupled Technologies (FCT). In FCT both the propagation and the elaboration of data depends on the electromagnetic field in- teractions (coupling) among PEs. An interesting possibility is offered by the use of single domain nanomagnets. Rectangular shaped magnets, with sizes smaller than 100nm, demonstrate a bistable behavior. This principle has been exploited to design digital logic circuits, leading to the so-called NanoMagnet Logic. The energy landscape of a single domain nanomagnet has two minimums corresponding to the magnetization vector aligned along the longer magnet side. If an ideal magnet is forced in the metastable state (i.e. the peak in the energy landscape), the probability that the magnet will reach one of the two stable states is exactly 0.5. The presented work proposes a plurality of development environments employable to study and design Dynamical-Coupled Nanocomputing digital circuits based on both a bottom-up approach for “fast prototyping” and a top-down one for complex circuits development environment. By means of the presented tools, it has been possible to study a series of Arithmetic and Cryptographic architectures, to perform circuit performance analysis and to highlight how the Modular Arithmetic offers a substantial contribution to the Field-Coupled Nanotechnologies interconnections overhead issue.

Стилі APA, Harvard, Vancouver, ISO та ін.

29

Schimit, Pedro Henrique Triguis. "Modelagem e controle de propagação de epidemias usando autômatos celulares e teoria de jogos." Universidade de São Paulo, 2010. http://www.teses.usp.br/teses/disponiveis/3/3139/tde-05122011-153541/.

Повний текст джерела

Анотація:

Estuda-se o espalhamento de doenças contagiosas utilizando modelos suscetível-infectado-recuperado (SIR) representados por equações diferenciais ordinárias (EDOs) e por autômatos celulares probabilistas (ACPs) conectados por redes aleatórias. Cada indivíduo (célula) do reticulado do ACP sofre a influência de outros, sendo que a probabilidade de ocorrer interação com os mais próximos é maior. Efetuam-se simulações para investigar como a propagação da doença é afetada pela topologia de acoplamento da população. Comparam-se os resultados numéricos obtidos com o modelo baseado em ACPs aleatoriamente conectados com os resultados obtidos com o modelo descrito por EDOs. Conclui-se que considerar a estrutura topológica da população pode dificultar a caracterização da doença, a partir da observação da evolução temporal do número de infectados. Conclui-se também que isolar alguns infectados causa o mesmo efeito do que isolar muitos suscetíveis. Além disso, analisa-se uma estratégia de vacinação com base em teoria dos jogos. Nesse jogo, o governo tenta minimizar os gastos para controlar a epidemia. Como resultado, o governo realiza campanhas quase-periódicas de vacinação.
The spreading of contagious diseases is studied by using susceptible-infected-recovered (SIR) models represented by ordinary differential equations (ODE) and by probabilistic cellular automata (PCA) connected by random networks. Each individual (cell) of the PCA lattice experiences the influence of others, where the probability of occurring interaction with the nearest ones is higher. Simulations for investigating how the disease propagation is affected by the coupling topology of the population are performed. The numerical results obtained with the model based on randomly connected PCA are compared to the results obtained with the model described by ODE. It is concluded that considering the topological structure of the population can pose difficulties for characterizing the disease, from the observation of the time evolution of the number of infected individuals. It is also concluded that isolating a few infected subjects can cause the same effect than isolating many susceptible individuals. Furthermore, a vaccination strategy based on game theory is analyzed. In this game, the government tries to minimize the expenses for controlling the epidemic. As consequence, the government implements quasi-periodic vaccination campaigns.

Стилі APA, Harvard, Vancouver, ISO та ін.

30

Xu, Tiantian. "Propulsion Characteristics and Visual Servo Control of Scaled-up Helical Microswimmers." Phd thesis, Université Pierre et Marie Curie - Paris VI, 2014. http://tel.archives-ouvertes.fr/tel-00977906.

Повний текст джерела

Анотація:

L'utilisation de micronageurs hélicoidaux capables de se mouvoir dans des liquides à faible nombre de Reynolds trouve son intérêt dans beaucoup d'applications: de tâches in-vitro dans des laboratoires sur puce (transport et tri de micro-objets; assemblage de micro-composants...), à des applications in-vivo en médecine mini-invasive (livraison interne et ciblée de médicaments, curiethérapie, thermothérapie...); grace à leur dimensions microscopiques et agilité permettant l'accès à des endroits normalement très restreints. Plusieurs types de nageurs hélicoidaux actionnés magnétiquement possédant divers paramètres géométriques, formes de tête et positions de la partie magnétique ont été proposés dans de précédents travaux. Cependant, l'influence de tous ces paramètres n'a pas clairement été étudiée. À notre connaissance, les micronageurs hélicoidaux dans l'état de l'art sont principalement contrôlés en boucle ouverte, en raison de la complexité de la commande du champ magnétique actionnant la propulsion, et du nombre limité de retours ayant des critères satisfaisants. Cette thèse vise à: comparer les performances de déplacement de nageurs hélicoidaux avec des conceptions différentes afin d'améliorer leur design et de les caractériser, et réaliser un asservissement visual de nageur hélicoidal. Pour se faire, des nageurs hélicoidaux de tailles millimétriques ont été conçus et sont mis en conditions à faible nombre de Reynolds. La conception de ces "millinageurs" servira de base à la conception de micronageurs. Une commande boucle fermée par retour visuel de l'orientation d'un micronageur hélicoidal dans un espace 3D, et un suivi de trajectoires sur plan horizontal ont été effectués. Cette méthode de commande sera par la suite appliquée à des micronageurs hélicoidaux.

Стилі APA, Harvard, Vancouver, ISO та ін.

31

Jaume, Bennasar Andrés. "Las nuevas tecnologías en la administración de justicia. La validez y eficacia del documento electrónico en sede procesal." Doctoral thesis, Universitat de les Illes Balears, 2009. http://hdl.handle.net/10803/9415.

Повний текст джерела

Анотація:

La tesis se encarga de analizar, por un lado, la integración y el desarrollo de las nuevas tecnologías en la Administración de Justicia; y, por otro, los parámetros que constituyen la validez y eficacia del documento electrónico.
La primera cuestión se centra en la configuración de los Sistemas de Información de la Oficina Judicial y del Ministerio Fiscal, así como de la informatización de los Registros Civiles, donde el art. 230 LOPJ es la pieza clave. Se estudian sus programas, aplicaciones, la videoconferencia, los ficheros judiciales y las redes de telecomunicaciones que poseen la cobertura de la firma electrónica reconocida, donde cobran gran relevancia los convenios de colaboración tecnológica. La digitalización de las vistas quizá sea una de las cuestiones con más trascendencia, teniendo en cuenta que el juicio es el acto que culmina el proceso. Aunque no todos los proyectos adoptados en el ámbito de la e.justicia se han desarrollado de forma integral, ni han llegado a la totalidad de los órganos judiciales. El objetivo final es lograr una Justicia más ágil y de calidad, a lo cual aspira el Plan Estratégico de Modernización de la Justicia 2009-2012 aprobado recientemente.
En referencia a la segunda perspectiva, no cabe duda que el Ordenamiento jurídico y los tribunales, en el ámbito de la justicia material, otorgan plena validez y eficacia al documento electrónico. Nuestra línea de investigación se justifica porque cada vez son más los procesos que incorporan soportes electrónicos de todo tipo, ya sea al plantearse la acción o posteriormente como medio de prueba (art. 299.2 LEC). Entre otros temas examinamos el documento informático, la problemática que rodea al fax, los sistemas de videograbación y el contrato electrónico.
La tesi s'encarrega d'analitzar, per una part, la integració i el desenvolupament de les noves tecnologies dins l´Administració de Justícia; i, per l'altra, els paràmetres que constitueixen la validesa i l'eficàcia del document electrònic.
La primera qüestió es centra en la configuració dels Sistemes d´Informació de l´Oficina Judicial i del Ministeri Fiscal, així com de la informatització dels Registres Civils, on l'art. 230 LOPJ es la peça clau. S'estudien els seus programes, aplicacions, la videoconferència, el fitxers judicials i les xarxes de telecomunicacions que tenen la cobertura de la firma electrònica reconeguda, on cobren gran rellevància els convenis de col·laboració tecnològica. La digitalització de les vistes tal vegada sigui una de les qüestions amb més transcendència, tenint amb compte que el judici es l'acte que culmina el procés. Però no tots el projectes adoptats en l'àmbit de la e.justicia s'han desenvolupat d'una manera integral ni han arribat a la totalitat dels òrgans judicials. L'objectiu final es assolir una Justícia més àgil i de qualitat, al que aspira el Pla Estratègic de Modernització de la Justícia 2009-2012 aprovat recentment.
En referència a la segona perspectiva, no hi ha dubte que l´Ordenament jurídic i els tribunals, en l'àmbit de la justícia material, donen plena validesa i eficàcia al document electrònic. La nostra línia d'investigació es justifica perquè cada vegada son més el processos que incorporen suports electrònics de tot tipus, ja sigui quant es planteja l'acció o posteriorment como a medi de prova (art. 299.2 LEC). Entre altres temes examinem el document informàtic, la problemàtica que envolta al fax, els sistemes de videogravació i el contracte electrònic.
The thesis seeks to analyse, on the one hand, the integration and development of the new technologies in the Administration of Justice; and, on the other, the parameters which constitute the validity and efficiency of the electronic document.
The first question centres on the configuration of the Information Systems of the Judicial Office and the Public Prosecutor, as well as the computerisation of the Civil Registers, where the art. 230 LOPJ it's the part key. Their programmes, applications, the Video Conferencing, the judicial registers and the telecommunication networks which are covered by the recognised electronic signatures, are studied, where the agreements on technological collaboration gain great relevance. The digitalisation of evidence might perhaps be one of the questions with most consequence, bearing in mind that the judgment is the act by which the process is culminated. Although not all the projects adopted within the compass of e.justice have developed completely nor have reached all the judicial organs. The final objective is to achieve an agile, quality Justice, to which the recently approved Strategic Plan for the Modernisation of Justice aspires.
With reference to the second perspective, there is no doubt that the juridical Ordinance and the tribunals within the compass of material justice grant full validity and efficacy to the electronic document. Our line of investigation is justified because there are more and more processes which are sustained by electronic supports of all kinds, whether it be at the establishment of the action or later, as a proof of it (art. 299.2 LEC). Amongst other things, we examine the computerised document, the problems which surround the fax, the systems for video recording and the electronic contract.

Стилі APA, Harvard, Vancouver, ISO та ін.

32

JAIN, URVASHI B. "AUTOMATED NUMBER PLATE RECOGNITION SYSTEM." Thesis, 2016. http://dspace.dtu.ac.in:8080/jspui/handle/repository/14455.

Повний текст джерела

Анотація:

ABSTRACT The strategy of the project is to design automatic system for recognizing the number plate of the car from image taken by the traffic surveillance system. Thus, the project is to investigate and construct an application whereby the system will recognize the car number plate from the image captured of the car. The system will be based on a personal computer and software packages available, MATLAB program and a digital camera, which help to capture the images of the car. The general algorithm involves the following steps: Ø Image Processing: The image captured is preprocessed and reduction in the contrast. Ø Conversion of RGB image to Gray image: Processed image is converted into a gray image. Ø Erosion and Dilation: Unwanted noise is removed. Ø Localization of number plate using Histogram approach: Thresholding is applied to both the row and column difference vectors obtained. Ø Smoothening and Filtering: Unwanted rows and columns are removed using averaging method. Ø Final extraction of number plate: Final number plate is extracted by selecting the area having maximum intensity variation between pixels and having maximum row and column sum of pixel intensity. Ø Number plate recognition based on OCR method.

Стилі APA, Harvard, Vancouver, ISO та ін.

33

OU-YANG, JUI, and 歐陽睿. "Automated analysis for Airport Pavement Classification Number." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/72523311647686465634.

Повний текст джерела

Анотація:

碩士
國立臺灣大學
土木工程學研究所
96
International Civil Aviation Organization (ICAO) published the ACN/PCN method to be a standard publish for the airport pavement strength in 1983. However, until now, there is no complete process of PCN evaluation for airport engineering departments to follow. This research establishes an easily-used PCN evaluation program, which is based on FAA AC 1502/5335-5a and the COMFAA program to. This research uses the concept of the regression formula for maximum edge stress from R805FAA program for rigid pavement model and uses the concept of equivalent single wheel load (ESWL), deflection factor, and CBR design method for flexible pavement model. Both rigid and flexible pavement models are constructed based on the output data from the COMFAA 2.0 program . The pavement models are incorporated with the the standardPCN evaluation process suggested by FAA to establish a comprehensive PCN evaluation process. This comprehensive PCN evaluation process is capable of obtaining the same PCN values as the values calculated by the standard PCN evaluation process suggested by FAA. In addition, this research uses the equivalent thickness method and the reverse overlay design concept to solve the PCN calculation problem about AC overlaid pavement . The research also illustrates the calculation of effective K-values for rigid pavement and the equivalent factors for flexible pavement. Finally, the research investigates the differences between the PCN values obtained from multi-point calculation or representative value calculation. The result shows that the PCN values obtained from multi-point calculation are more reasonable than those obtained from representative value calculation.

Стилі APA, Harvard, Vancouver, ISO та ін.

34

Marzieh, Abdollahi. "Automated Multiple Point Stimulation Technique for Motor Unit Number Estimation." Thesis, 2007. http://hdl.handle.net/10012/3382.

Повний текст джерела

Анотація:

Motor unit number estimation (MUNE) is an electrodiagnostic procedure used to estimate the number of MUs in a muscle. In this thesis, a new MUNE technique, called Automated MPS, has been developed to overcome the shortcomings of two current techniques, namely MPS and MUESA. This method can be summarized as follows. First, a muscle is stimulated with a train of constant intensity current pulses. Depending on various factors, one to three MUs activate probabilistically after each pulse, and several responses are collected. These collected responses should be divided into up to 2^n clusters, such that each cluster represents one possible combination of n Surface-detected Motor Unit Potentials (SMUPs). After clustering the collected responses, the average response of each cluster is calculated, the outliers are excluded, and similar groups are merged together. Then, depending on the number of response set groups, a decomposition technique is applied to the response clusters to obtain the $n$ constituent SMUPs. To estimate the number of MUs, the aforementioned process is repeated several times until enough SMUPs to calculate a reliable mean-SMUP are acquired. The number of MUs can then be determined by dividing the maximal compound muscle action potential (CMAP) size by the mean-SMUP size. The focus of this thesis was on using pattern recognition techniques to detect n SMUPs from a collected set of waveforms. Several experiments were performed using both simulated and real data to evaluate the ability of Automated MPS in finding the constituent SMUPs of a response set. Our experiments showed that performing Automated MPS needs less experience compared with MPS. Moreover, it can deal with more difficult situations and detect more accurate SMUPs compared with MUESA.

Стилі APA, Harvard, Vancouver, ISO та ін.

35

Kowaliw, Taras. "A good number of forms fairly beautiful : an exploration of biologically-inspired automated design." Thesis, 2007. http://spectrum.library.concordia.ca/975451/1/NR31134.pdf.

Повний текст джерела

Анотація:

Artificial Embryogeny (AE) can be described as the use of a dynamical system as a mid-step in a design process; Through emulating Biological Embryogenesis, we hope to reach levels of complexity and robustness currently impossible. AE is a new field, and suffers from a lack of standards and meaningful means of evaluation. In this document, we review existing work, discussing motivations and merits of existing approaches. Throughout, we argue that a viewpoint which does not regard environment as a primary source of information risks taking a naïve view of evolution. We argue that "complexity" is vaguely and inconsistently defined, and propose several novel measures; Perhaps the simplest model of AE, the Terminating Cellular Automaton, is introduced, and used to compute and contrast our measures. Next, the Deva family of AE algorithms is introduced, a modular Cellular Automaton-like group. A domain of application from Civil Engineering is chosen as an interpretation of the grown organisms. It is initially shown that it is possible to use a Deva algorithm to evolve Plane 'Fusses successfully, this interpretation providing a discipline-independent measure of success. A series of empirical experiments is undertaken, showing the relative efficacy and effects of several model-level strategies in the context of the evolution of structural design. Finally, we explore the role of environment as a constraint on development of structural form. We demonstrate a strong resistance to environmental change by successfully re-growing the organisms in new environments, showing that some Deva organisms are adding information from the environment to their overall morphology; This provides an artificial analogue to the re-use of genes which characterizes biological development.

Стилі APA, Harvard, Vancouver, ISO та ін.

36

Vašek, Vojtěch. "Automatické rozpoznávání registračních značek aut z málo kvalitních videosekvencí." Master's thesis, 2018. http://www.nusl.cz/ntk/nusl-387247.

Повний текст джерела

Анотація:

The commercially used automated number plate recognition (ANPR) sys- tems constitute a mature technology which relies on dedicated industrial cam- eras capable of capturing high-quality still images. In contrast, the problem of ANPR from low-quality video sequences has been so far severely under- explored. This thesis proposes a trainable convolutional neural network (CNN) with a novel architecture which can efficiently recognize number plates from low-quality videos of arbitrary length. The proposed network is experimentally shown to outperform several existing approaches dealing with video-sequences, state-of-the-art commercial ANPR system as well as the human ability to recog- nize number plates from low-resolution images. The second contribution of the thesis is a semi-automatic pipeline which was used to create a novel database containing annotated sequences of challenging low-resolution number plate im- ages. The third contribution is a novel CNN based generator of super-resolution number plate images. The generator translates the input low-resolution image into its high-quality counterpart which preserves the structure of the input and depicts the same string which was previously predicted from a video-sequence. 1

Стилі APA, Harvard, Vancouver, ISO та ін.

37

Henderson, Philip. "Playing and solving the game of Hex." Phd thesis, 2010. http://hdl.handle.net/10048/1311.

Повний текст джерела

Анотація:

The game of Hex is of interest to the mathematics, algorithms, and artificial intelligence communities. It is a classical PSPACE-complete problem, and its invention is intrinsically tied to the Four Colour Theorem and the well-known strategy-stealing argument. Nash, Shannon, Tarjan, and Berge are among the mathematicians who have researched and published about this game. In this thesis we expand on previous research, further developing the mathematical theory and algorithmic techniques relating to Hex. In particular, we identify new classes of moves that can be pruned from consideration, and devise new algorithms to identify connection strategies efficiently. As a result of these theoretical improvements, we produce an automated solver capable of solving all 8 x 8 Hex openings and most 9 x 9 Hex openings; this marks the first time that computers have solved all Hex openings solved by humans. We also produce the two strongest automated Hex players in the world --- Wolve and MoHex --- and obtain both the gold and silver medals in the 2008 and 2009 International Computer Olympiads.

Стилі APA, Harvard, Vancouver, ISO та ін.

38

Yang, Wen Tzong, and 楊文宗. "Automatic Vehicle Identification Number Recognition System." Thesis, 1996. http://ndltd.ncl.edu.tw/handle/16636917567719883726.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

39

Larsson, Stefan, and Filip Mellqvist. "Automatic Number Plate Recognition for Android." Thesis, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-72573.

Повний текст джерела

Анотація:

This thesis describes how we utilize machine learning and image preprocessing to create a system that can extract a license plate number by taking a picture of a car with an Android smartphone. This project was provided by ÅF at the behalf of one of their customers who wanted to make the workflow of their employees more efficient. The two main techniques of this project are object detection to detect license plates and optical character recognition to then read them. In between are several different image preprocessing techniques to make the images as readable as possible. These techniques mainly includes skewing and color distorting the image. The object detection consists of a convolutional neural network using the You Only Look Once technique, trained by us using Darkflow. When using our final product to read license plates of expected quality in our evaluation phase, we found that 94.8% of them were read correctly. Without our image preprocessing, this was reduced to only 7.95%.

Стилі APA, Harvard, Vancouver, ISO та ін.

40

Gamble, Dustin Eli. "Automated dynamic propeller testing at low Reynolds numbers." 2009. http://digital.library.okstate.edu/etd/Gamble_okstate_0664M_10596.pdf.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

41

Hou, Shun-Cheng, and 侯舜程. "An Automatic Recognition System for Credit Card Number." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/93769698685274548818.

Повний текст джерела

Анотація:

碩士
玄奘大學
資訊管理學系碩士班
102
Development of technology more widely and popular, and more recognition system extends from simple digital identification to text recognition more diversity, not only to extend the use of the license plate is also applied to the identification card or credit card numbers. The theory proposes a simple and convenient credit card identification system, the main part of the capture credit card numbers, you need to first color images into grayscale images. Before then use the binary character segmentation way to remove the background and do normalization cutting characters. And we use the template matching method to do character recognition, will do a similar alphanumeric histogram matching, more accurately identify the alphanumeric serial number on the credit card.

Стилі APA, Harvard, Vancouver, ISO та ін.

42

Лилик, Андрій Любомирович. "Удосконалення засобів автоматизованого тестування знань та загального моніторингу освітнього процесу у системі електронного навчання ATUTOR на базіІ ЦЕН ТНТУ". Master's thesis, 2018. http://elartu.tntu.edu.ua/handle/lib/26387.

Повний текст джерела

Анотація:

При запровадженні технологій електронного навчання як базове програмне забезпечення зазвичай застосовують спеціалізовані програмні оболонки – системи керування навчанням (Learning management system, LMS). Такі платформи призначені для об'єднання усіх учасників процесу навчання (педагогів-тьюторів, адміністраторів, учнів чи студентів) в одну надійну, безпечну та зручну систему, яка стає основою для розбудови персоналізованого віртуального навчального середовища. У цих системах одну з провідних ролей виконують засоби автоматизованого контролю знань, що подаються у вигляді тестувальних підсистем. Взявши на себе функції навчальну, діагностичну та виховну, завдяки сучасним інформаційним технологіям, засоби тестування перетворились на потужний інструмент в освітній діяльності, ефективність якого у значній мірі визначається не лише інтелектуальною складовою самого тестувального матеріалу, але й критеріями та алгоритмами оцінювання, закладеними розробниками у них. Завданням даної роботи є опис та узагальнення практичного досвіду розбудови та запровадження засобів тестування в освітньому процесі на базі LMS ATutor у Тернопільскому національному технічному університеті ім. Івана Пулюя (ТНТУ). У даній роботі систематизовано та розглянуто результати інноваційних розробок, пов’язаних з удосконаленням системи тестування для потреб вищого закладу освіти. Впровадження розглянутих у роботі підходів дозволить забезпечити нарощування ефективності використання засобів автоматизованого контролю знань. Передбачено заходи з охорони праці та проведено розрахунок собівартості проведення робіт з розробки програмного забезпечення.
This project behaves to industry of automation of educational technologies and can be used for development of the system of testing of knowledge. 7 In the work on the basis of models of student and subject domain the analysis of answers is conducted in the systems of testing and estimation of probability of random selection of right answer for answers to the type is done great number, list, list of great numbers and great numbers of lists. Project performances can be used for development of test tasks and enable to choose an answer necessary and sufficient and provide objectivity of estimation of knowledge.
У вступі дано характеристику сучасного стану використання засобів тестування знань у системах управління навчанням та охарактеризовано перспективні напрямки розвитку цього напрямку. В аналітичній частині розглянуто історію і тенденції розвитку засобів електронного навчання, проведено класифікацію комп’ютерних засобів навчального призначення. У науково-дослідницькій частині сформульовано статистичні моделі різних типів тестових запитань (множина, список, список множин, множина списків) та моделі випадкового уведення правильних відповідей. У технологічній частині розглянуто основні технології розподілених автоматизованих навчальних систем та вимоги до них. Описано особливості роботи підсистеми контролю знань та проаналізовано існуючі системи контролю знань. Розглянуто основні типи тестових запитань та проведено їх статистичний аналіз. У конструкторській частині проведено формування структурної схеми розподіленої автоматизованої навчальної системи. Розроблено логічну структуру навчальної системи. Сформульовано вимоги до функійних можливостей підсистеми управління начанням. Розроблено модель предметної області. Розроблено структурну схему системи контролю знань та блок-схему алгоритму адаптивного контролю знань. 5 У спеціальній частині описано розроблену комплексну систему контролю знань на базі електронного начального курсу. У системі передбачено такі види контролю: вхідний, нульовий, самоконтроль за темою, рубіжний контроль за змістовним модулем, модульний і підсумковий контроль а також, ректорський контроль. У частині «Обґрунтування економічної ефективності» проведено розрахунок трудомісткості створення програмного продукту, визначено планову собівартість проведення робіт та обгрунтовано формування договірної ціни. У частині «Охорона праці та безпека в надзвичайних ситуаціях» розглянуто проблему організації охорони праці на підприємстві з питань освітлення робочих місць та стану повітря у виробничих приміщеннях. У частині «Екологія» розглянуто питання охорони довкілля та мінімізації шкідливих викидів при опаленні виробничих приміщень. У загальних висновках до дипломної роботи відзначено, що проведена систематизація та узагальнення результатів розвитку засобів тестового контролю на базі LMS ATutor у Тернопільському національному технічному університеті імені Івана Пулюя дає можливість скласти чітке уявлення про напрям розвитку цієї важливої складової частини системи електронного навчання в університеті. Подані технічні рішення можуть бути легко впроваджені і в інших системах електронного навчання, що використовуються закладами освіти, таких наприклад, як Moodle, Learning Blackboard System тощо. Це дасть можливість підвищити з одного боку якість тестового матеріалу, з іншого - ефективність використання систем тестування знань у цілому. У графічній частині приведено структурні схеми та алгоритми роботи підсистем розподіленої автоматизованої навчальної системи.

Стилі APA, Harvard, Vancouver, ISO та ін.

43

Chen, Shen-Wei, and 陳慎微. "Automatic Clustering Using Differential Evolution with Cluster Number Vibration Strategy." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/74480922896069532500.

Повний текст джерела

Анотація:

碩士
中原大學
資訊管理研究所
98
In this paper, an improved differential evolution algorithm (V-ACDE) with cluster number vibration strategy for automatic crisp/fuzzy clustering has been presented. The proposed algorithm needs no prior knowledge of the number of clusters of the data. Rather, it finds the optimal number of clusters on the processing with stable and fast convergence, cluster number vibration mechanism will search more possible cluster number in case of bad initial cluster number caused bad clusters. Superiority of the proposed algorithm is demonstrated by comparing it with one recently developed partitional clustering algorithm. Experimental results over four real life datasets and two artificial datasets, and the performance of proposed algorithm is mostly better than the other one.

Стилі APA, Harvard, Vancouver, ISO та ін.

44

Chen, Jyh-Long, and 陳智龍. "Automatic License Number Recognition for Car Images Taken for Parking Violation." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/59989635316726048514.

Повний текст джерела

Анотація:

碩士
國立交通大學
資訊科學系
89
In this paper, the approach to automatic license number recognition for car images taken for parking violation is presented. The approach consists of three phases. First, we use a dual difference filter to enhance the license plate in the car images for the license plate location. Second, for the segmentation of the license plate image into foreground and background, we use difference filter to find the two end points of each horizontal segment of the foreground. Finally, for character images segmented from the license plate, a row-based method is used to extract the feature of the character, which is then applied to a tree classifier for recognition. For real car images of different types of license plates and various background scenery, the proposed approach seems to yield satisfactory results for license plate location and recognition.

Стилі APA, Harvard, Vancouver, ISO та ін.

45

Chang, Yuan-Che, and 張元哲. "An automatic classification algorithm for a large number of patent categorization." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/79689898838726915920.

Повний текст джерела

Анотація:

博士
國立中央大學
資訊管理學系
102
An automatic patent categorization system would be invaluable to individual inventors and patent attorneys, saving them time and effort by quickly identifying conflicts with existing patents. In recent years, it has become more and more common to classify all patent documents using the International Patent Classification (IPC), a complex hierarchical classification system comprised of 8 sections, 128 classes, 648 subclasses, about 7,200 main groups, and approximately 72,000 subgroups. So far, however, no patent categorization method has been developed that can classify patents down to the subgroup level (the bottom level of the IPC). Therefore, this dissertation presents a novel categorization method, the three phase categorization (TPC) algorithm, which classifies patents down to the subgroup level with reasonable accuracy. The method is composed of three phases, where the first two are performed using SVM classification and the last one employs clustering. The experimental results for the TPC algorithm, using the WIPO-alpha collection, indicate that our classification method can achieve 36.07% accuracy at the subgroup level. This is approximately a 26,020-fold improvement over a random guess. In addition, a collection of 96,654 distinct patent documents that we collect from Internet has been combined with WIPO-alpha collection. We evaluate the TPC algorithm on this collection and it achieved an accuracy of 38.01% at the subgroup level.

Стилі APA, Harvard, Vancouver, ISO та ін.

46

Gupta, Nisha. "Automatic Number Plate Recognition Using Raspberry Pi2 in Shovel-Dumper Combination." Thesis, 2016. http://ethesis.nitrkl.ac.in/8318/1/2016_BT_112MN0606_Nisha_Automated.pdf.

Повний текст джерела

Анотація:

A designing of a system which captures the image of the number plate automatically of a Shovel-Dumper combination and these details were verified using Raspberry Pi2 processor for authentication. This system captures the number plate of shovel and dumper further processing for the character recognition. Automation is the most frequently spelled term in the field of electronics. The hunger for automation brought many revolutions in the existing technologies. This paper makes use of an onboard computer, which is commonly termed as Raspberry Pi2 processor. It acts as heart of the project. This onboard computer can efficiently communicate with the output and input modules which are being used. The device which is able to perform the task is a Raspberry Pi2 processor. When any vehicle passes by the system, the image of the number plate of every vehicle is captured using camera. The image of the number plate details are fed as input to the Raspberry Pi2 processor. The Processor takes responsibility to check the authentication details of every shover and dumper. Once the details are recognized then the processor operates it detects an unauthorized image of number plate was detected. To perform this task, Raspberry Pi processor is programmed using embedded ‘Raspbian’.

Стилі APA, Harvard, Vancouver, ISO та ін.

47

"Pseudorandom number generator by cellular automata and its application to cryptography." 1999. http://library.cuhk.edu.hk/record=b5890148.

Повний текст джерела

Анотація:

by Siu Chi Sang Obadiah.
Thesis (M.Phil.)--Chinese University of Hong Kong, 1999.
Includes bibliographical references (leaves 66-68).
Abstracts in English and Chinese.
Chapter 1 --- Pseudorandom Number Generator --- p.5
Chapter 1.1 --- Introduction --- p.5
Chapter 1.2 --- Statistical Indistingushible and Entropy --- p.7
Chapter 1.3 --- Example of PNG --- p.9
Chapter 2 --- Basic Knowledge of Cellular Automata --- p.12
Chapter 2.1 --- Introduction --- p.12
Chapter 2.2 --- Elementary and Totalistic Cellular Automata --- p.14
Chapter 2.3 --- Four classes of Cellular Automata --- p.17
Chapter 2.4 --- Entropy --- p.20
Chapter 3 --- Theoretical analysis of the CA PNG --- p.26
Chapter 3.1 --- The Generator --- p.26
Chapter 3.2 --- Global Properties --- p.27
Chapter 3.3 --- Stability Properties --- p.31
Chapter 3.4 --- Particular Initial States --- p.33
Chapter 3.5 --- Functional Properties --- p.38
Chapter 3.6 --- Computational Theoretical Properties --- p.42
Chapter 3.7 --- Finite Size Behaviour --- p.44
Chapter 3.8 --- Statistical Properties --- p.51
Chapter 3.8.1 --- statistical test used --- p.54
Chapter 4 --- Practical Implementation of the CA PNG --- p.56
Chapter 4.1 --- The implementation of the CA PNG --- p.56
Chapter 4.2 --- Applied to the set of integers --- p.58
Chapter 5 --- Application to Cryptography --- p.61
Chapter 5.1 --- Stream Cipher --- p.61
Chapter 5.2 --- One Time Pad --- p.62
Chapter 5.3 --- Probabilistic Encryption --- p.63
Chapter 5.4 --- Probabilistic Encryption with RSA --- p.64
Chapter 5.5 --- Prove yourself --- p.65
Bibliography

Стилі APA, Harvard, Vancouver, ISO та ін.

48

Leong, Alexander. "Variations on the Erdos Discrepancy Problem." Thesis, 2011. http://hdl.handle.net/10012/6432.

Повний текст джерела

Анотація:

The Erdős discrepancy problem asks, "Does there exist a sequence t = {t_i}_{1≤i<∞} with each t_i ∈ {-1,1} and a constant c such that |∑_{1≤i≤n} t_{id}| ≤ c for all n,c ∈ ℕ = {1,2,3,...}?" The discrepancy of t equals sup_{n≥1} |∑_{1≤i≤n} t_{id}|. Erdős conjectured in 1957 that no such sequence exists. We examine versions of this problem with fixed values for c and where the values of d are restricted to particular subsets of ℕ. By examining a wide variety of different subsets, we hope to learn more about the original problem. When the values of d are restricted to the set {1,2,4,8,...}, we show that there are exactly two infinite {-1,1} sequences with discrepancy bounded by 1 and an uncountable number of in nite {-1,1} sequences with discrepancy bounded by 2. We also show that the number of {-1,1} sequences of length n with discrepancy bounded by 1 is 2^{s2(n)} where s2(n) is the number of 1s in the binary representation of n. When the values of d are restricted to the set {1,b,b^2,b^3,...} for b > 2, we show there are an uncountable number of infinite sequences with discrepancy bounded by 1. We also give a recurrence for the number of sequences of length n with discrepancy bounded by 1. When the values of d are restricted to the set {1,3,5,7,..} we conjecture that there are exactly 4 in finite sequences with discrepancy bounded by 1 and give some experimental evidence for this conjecture. We give descriptions of the lexicographically least sequences with D-discrepancy c for certain values of D and c as fixed points of morphisms followed by codings. These descriptions demonstrate that these automatic sequences. We introduce the notion of discrepancy-1 maximality and prove that {1,2,4,8,...} and {1,3,5,7,...} are discrepancy-1 maximal while {1,b,b^2,...} is not for b > 2. We conclude with some open questions and directions for future work.

Стилі APA, Harvard, Vancouver, ISO та ін.

49

OU, CHUN-JEN, and 歐峻任. "An Automatic Number Calculation System of People Using CNN-Based Face Detection Approach." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/8sqn78.

Повний текст джерела

Анотація:

碩士
亞洲大學
資訊傳播學系
107
Calculation of the number of people is often required in life, such as repeating counting the number of tourists in a tour group, in a play area etc. If there are a lot of people, the calculation of their number is time consuming. Developing an efficient method to calculate the number of people is really important. Due to recent advances in face detection technologies, faces in a photo can be used as a key for the calculation of the number of people in the scene. In this paper, we propose a simple and effective approach to calculating the number of people in a photo based on a convolutional neural network (CNN) for face recognition. Firstly, the suspected face areas are segmented into blocks by the Viola-Jones algorithm. Then, the detected face blocks are refined through the CNN by excluding the segmented blocks without the human face, so as to enhance the accuracy of face detection. The experimental results show that the proposed system can efficiently and correctly calculate the number of people in a photo, where the performances are presented by the precision rate, recall rate, and F-measure.

Стилі APA, Harvard, Vancouver, ISO та ін.

50

Khan, Kamaul Hoque. "Development of Automatic Digitization of Truck Number in Open Cast Mines Using Microcontroller." Thesis, 2015. http://ethesis.nitrkl.ac.in/7668/1/2015_MT_Development_khan.pdf.

Повний текст джерела

Анотація:

Geological condition in mines appears to be extremely complicated and there are many intelligence security problems. Production is falsely transfer by the unauthorized truck from mine pits also at loading point. It also lifted in wrong ways by malfunctioning of the truck weight in Weigh Bridge. Mining organizations are under the control of mafia and countless can be added to the mines mafia. An intelligence security system is need to monitor truck number in automatically using image acquisition method, automatic detection, recognition process, communication technology, information technology and microcontroller innovation to understand the working specification of the mining region. Tracking of the number plate from the truck is an important task, which demands intelligent solution. Intelligent surveillance in open casts mine security network using data accession is a prime task that protects the secure production of mines. So automatic truck number recognition technique is used to recognize the registration number of the truck which is used for transferring the mine production as well as track record the amount of the production. It also preserves the mines and thus improving its security. For extraction and recognition of number plate from truck image the system is uses MATLAB software tool. It is assumed that images of the truck have been captured from digital camera. The data acquisition terminal uses the PIC16F877A microcontroller as a core chip for sending data. The data are communicated through USB to TTL converter (RS232) with the main circuit to realize intelligent monitoring. To store the data in permanently it is uses EEPROM chip. Alphanumeric Characters on plate has been extracted and recognized using template images of alphanumeric characters. The proposed system performs the real time data monitoring to recognize the registration number plate of the trucks for getting required important information. It also provides to maintenance the history of data and support access control

Стилі APA, Harvard, Vancouver, ISO та ін.

Дисертації з теми "AUTOMATED NUMBER"

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями