Dissertations / Theses: 'Distance vectors'

1

Shaik, Abdul Ameer Basha. "SVM Classification and Analysis of Margin Distance on Microarray Data." University of Akron / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=akron1302618924.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Hjelm, Andersson Patrick. "Binär matchning av bilder med hjälp av vektorer från deneuklidiska avståndstransformen." Thesis, Linköping University, Department of Electrical Engineering, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-2440.

Full text

Abstract:

This thesis shows the result from investigations of methods that use distance vectors when matching pictures. The distance vectors are available in a distance map made by the Euclidean Distance Transform. The investigated methods use the two characteristic features of the distance vector when matching pictures, length and direction. The length of the vector is used to calculate a value of how good a match is and the direction of the vector is used to predict a transformation to get a better match. The results shows that the number of calculation steps that are used during a search can be reduced compared to matching methods that only uses the distance during the matching.

APA, Harvard, Vancouver, ISO, and other styles

3

Visa, Sofia. "Comparative Study of Methods for Linguistic Modeling of Numerical Data." University of Cincinnati / OhioLINK, 2002. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1043254774.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Thomson, R. G. W. "Vector acoustic miss distance indication." Master's thesis, University of Cape Town, 1985. http://hdl.handle.net/11427/21868.

Full text

Abstract:

In 1981 the author decided to investigate means of accurately measuring the passage of anti-aircraft shells past a towed airborne target. This decision was based on the observation that available literature showed a need for low cost miss distance indication equipment. A feasibility study showed that the task would be multi-disciplinary entailing aerodynamics telemetry, weapons performance studies and investigation of the techniques of measurement of shell location currently in use. The decision was made by the author to concentrate on a study of the technique measurements of shell location and the analysis of such measurements in view of the fact that, at least in isolation, knowledge of the other factors mentioned was fairly complete although unevenly spread in South Africa. Initial work concerned a study of the General Requirements for such target systems and the classification of these. A literature survey was conducted by the author which indicated that systems already in service made use of several measurement techniques, including photographic, radar and acoustic phenomena. Of these, acoustic means appeared to offer a cheap and simple solution to the measurement problem. The author then explored the principles and potential of Acoustic Miss Distance indication and arrived at the conclusion that such a system, based on measurements of the period of the shockwave accompanying a supers6nic shell, would be feasible. This conclusion led to the Thesis presented in this document, that firstly measurement of the shock-wave period could enable deduction of the distance between the sensor and the flight path of a supersonic shell and secondly, that several such measurements would enable the miss vector to be calculated.

APA, Harvard, Vancouver, ISO, and other styles

5

Girard, Jean-François. "Failure tolerant alternate-path distance-vector routing." Thesis, McGill University, 1992. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=61200.

Full text

Abstract:

In the Alternate-path Distance-vector Routing approach presented by Tsuchiya (?) each node of a network keeps enough information to route messages after a failure. This thesis presents an algorithm to update this information in reaction to link failures. The proposed algorithm appears to perform its task without introducing a count to infinity problem. This thesis also presents a way to reduce the size of one of the most frequently sent messages. The size of this message can be reduced by up to 50% of its equivalent in the Tsuchiya approach. The algorithm was tested on a simulated networks consisting of 98 nodes representative of the ARPANET (1983). The results obtained show that the algorithm displays reasonable performance in the context of hop count metrics.

APA, Harvard, Vancouver, ISO, and other styles

6

Fang, Xiao Ph D. Massachusetts Institute of Technology. "Bayesian distance metric learning on i-vector for speaker verification." Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/84870.

Full text

Abstract:

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2013.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 63-66).
This thesis explores the use of Bayesian distance metric learning (Bayes_dml) for the task of speaker verification using the i-vector feature representation. We propose a framework that explores the distance constraints between i-vector pairs from the same speaker and different speakers. With an approximation of the distance metric as a weighted covariance matrix of the top eigenvectors from the data covariance matrix, variational inference is used to estimate a posterior distribution of the distance metric. Given speaker labels, we select different-speaker data pairs with the highest cosine scores to form a different-speaker constraint set. This set captures the most discriminative between-speaker variability that exists in the training data. This system is evaluated on the female part of the 2008 NIST SRE dataset. Cosine similarity scoring, as the state-of-the-art approach, is compared to Bayes-dml. Experimental results show the comparable performance between Bayes_dml and cosine similarity scoring. Furthermore, Bayes-dml is insensitive to score normalization, as compared to cosine similarity scoring. Without the requirement of the number of labeled examples, Bayes_dml performs better in the context of limited training data
by Xiao Fang.
S.M.

APA, Harvard, Vancouver, ISO, and other styles

7

Miško, Lukáš. "Optimalizace směrování v protokolu Ad hoc On-Demand Distance Vector." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2020. http://www.nusl.cz/ntk/nusl-413102.

Full text

Abstract:

This thesis contains a theoretical basis for MANET networks. The main focus of the thesis is principles of these networks, their routing protocols and especially on Ad hoc On-Demand Distance Vector (AODV), implementation of this protocol and implementation of new mechanis for peer selection. Thesis contains ETX metric basic and implementation of this metric to AODV protocol. There is a demonstration of simulation of AODV protocol and simulation of AODV-ETX protocol. Simulations are run in Network Simulator 3. AODV and AODV-ETX comparasion are included in thesis.

APA, Harvard, Vancouver, ISO, and other styles

8

Eerla, Vishwa Shanthi. "Multi-Criteria Mapping Based on Support Vector Machine and Cluster Distance." Master's thesis, Universitätsbibliothek Chemnitz, 2016. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-212565.

Full text

Abstract:

There was an increase in a number of applications for a master degree program with the growth in time. It takes huge time to process all the application documents of each and every applicant manually and requires a high volume of the workforce. This can be reduced if automation is used for this process. In any case, before that, an analysis of the complete strides required in preparing was precisely the automation must be utilized to diminish the time and workforces must be finished. The application process for the applicant is actually participating in several steps. First, the applicant sends the complete scanned documents to the uni-assist; from there the applications are received by the student assistant team at the particular university to which the applicant had applied, and then they are sent to the individual departments. At the individual sections, the individual applications will be handled by leading an intensive study to know whether the applicant by their past capabilities scopes to satisfy the prerequisites of further study system to which they have applied. What's more, by considering the required points of interest of the applicant without investigating every single report, and to pack the information and diminish the preparing time for the specific division, by this postulation extend a solitary web apparatus is being produced that can procedure the application which is much dependable in the basic leadership procedure of application.

APA, Harvard, Vancouver, ISO, and other styles

9

Du, Plessis Johan. "ACODV : Ant Colony Optimisation Distance Vector routing in ad hoc networks." Diss., University of Pretoria, 2005. http://hdl.handle.net/2263/23923.

Full text

Abstract:

A mobile ad hoc network is a collection of wireless mobile devices which dynamically form a temporary network, without using any existing network infrastructure or centralised administration. Each node in the network effectively becomes a router, and forwards packets towards the packet’s destination node. Ad hoc networks are characterized by frequently changing network topology, multi-hop wireless connections and the need for dynamic, efficient routing protocols.

The overarching requirement for low power consumption, as battery powered sensors may be required to operate for years without battery replacement;

An emphasis on reliable communication as opposed to real-time communication, it is more important for packets to arrive reliably than to arrive quickly; and

Very scarce processing and memory resources, as these sensors are often implemented on small low-power microprocessors.

This work provides overviews of routing protocols in ad hoc networks, swarm intelligence, and swarm intelligence applied to ad hoc routing. Various mechanisms that are commonly encountered in ad hoc routing are experimentally evaluated under situations as close to real-life as possible. Where possible, enhancements to the mechanisms are suggested and evaluated. Finally, a routing protocol suitable for such low-power sensor networks is defined and benchmarked in various scenarios against the Ad hoc On-Demand Distance Vector (AODV) algorithm.
Dissertation (MSc)--University of Pretoria, 2005.
Computer Science
Unrestricted

APA, Harvard, Vancouver, ISO, and other styles

10

Trhlík, Jiří. "Modelování distance-vektor směrovacích protokolů." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2013. http://www.nusl.cz/ntk/nusl-235460.

Full text

Abstract:

This master thesis deals with the implementation of the RIPng routing protocol in the OMNeT++/INET environment. It describes the RIPng protocol and its specifics on the Cisco devices. It clarifies important concepts such as IPv6 and distance-vector routing protocols. The thesis also describes the OMNeT++ environment and the INET Framework, where it focuses on the current status of implementation of the components required for the RIPng protocol integration.

APA, Harvard, Vancouver, ISO, and other styles

11

Alexandropoulos, Ioannis M. "Uncooled infrared imaging face recognition using kernel-based feature vector selection." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2006. http://library.nps.navy.mil/uhtbin/hyperion/06Sep%5FAlexandropoulos.pdf.

Full text

Abstract:

Thesis (M.S. in Electrical Engineering)--Naval Postgraduate School, September 2006.
Thesis Advisor(s): Monique P. Furgues, Roberto Cristi, Carlos Borges. "September 2006." Includes bibliographical references (p. 133-136). Also available in print.

APA, Harvard, Vancouver, ISO, and other styles

12

Tang, Siu-shing. "Integrating distance function learning and support vector machine for content-based image retrieval /." View abstract or full-text, 2006. http://library.ust.hk/cgi/db/thesis.pl?CSED%202006%20TANG.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Balagam, Satya. "Enhancement of ad hoc On-Demand Distance Vector protocol security using Secure Message Transmission." Thesis, Wichita State University, 2011. http://hdl.handle.net/10057/5160.

Full text

Abstract:

The ad hoc on-demand distance vector (AODV) routing protocol offers quick adaptation to dynamic link changes, incurs low processing and memory overhead, has a low initial setup while connecting to networks, and determines unicast routes to destinations within the ad hoc network. This routing protocol allows for efficient and reliable discovery of routes. Although the connection setup delay is lower for the AODV protocol compared to other ad hoc routing protocols, such as the dynamic source routing (DSR) protocol and destination sequenced distance vector (DSDV) protocol, the AODV routing protocol involves a heavy control overload and delay while finding the routes in adverse conditions, such as the presence of malicious nodes in the network or connection failures due to network congestion. This thesis studies the secure message transmission (SMT) protocol, which safeguards data transmission against arbitrary malicious behavior of other nodes and evaluates its performance over the AODV routing protocol. The analysis of the performance of the AODV routing protocol in combination with the SMT protocol was done by considering a scenario of mobile ad hoc networks under adverse conditions, with half of the nodes acting maliciously and dropping both data and control packets. The AODV routing protocol in combination with the SMT protocol imposes up to 46% less routing overhead, delivering up to 17% more data packets, with a throughput of 12% more and end-to-end delays that are up to 24% lower than those of the native AODV routing protocols in the scenarios considered. Thus the AODV routing protocol performs well with the SMT protocol, and is reliable. The NS-2 network simulator was utilized to compare performances. The advantages of the proposed approach of using the AODV routing protocol together with the SMT protocol are more apparent in the presence of malicious nodes in the network.
Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical Engineering and Computer Science.

APA, Harvard, Vancouver, ISO, and other styles

14

Jayakeerthy, Arunkumar Thippur Lim Alvin S. "Query-localized route repair mechanism for ad-hoc on-demand distance vector routing algorithm." Auburn, Ala, 2009. http://hdl.handle.net/10415/1608.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Zahary, Ammar Thabit. "Improving routing performance of multipath ad hoc on-demand distance vector in mobile add hoc networks." Thesis, De Montfort University, 2008. http://hdl.handle.net/2086/4277.

Full text

Abstract:

The aim of this research is to improve routing fault tolerance in Mobile Ad hoc Networks (MANETs) by optimising mUltipath routing in a well-studied reactive and single path routing protocol known as Ad hoc On-demand Distance Vector (AODV). The research also aims to prove the effect of varying waiting time of Route Reply (RREP) procedure and utilising the concept of efficient routes on the performance of multipath extensions to AODV. Two novel multipath routing approaches are developed in this thesis as new extensions to AODV to optimise routing overhead by improving Route Discovery Process (RDP) and Route Maintenance Process (RMP) of multipath AODV. The first approach is a Iinkdisjoint multipath extension called 'Thresho)d efficient Routes in multipath AODV' (TRAODV) that optimises routing packets ~verhead by improving the RDP of AODV which is achieved by detecting the waiting time required for RREP procedure to receive a threshold number of efficient routes. The second approach is also a link-disjoint mUltipath extension called 'On-demand Route maintenance in Multipath AoDv' (ORMAD) which is an extension to TRAODV that optimises routing packets and delay overhead by improving the RMP of TRAODV. ORMAD applies the concepts of threshold waiting time and efficient routes to both phases RDP and RMP. It also applies RMP only to efficient routes which are selected in the RDP and when a route fails, it invokes a local repair procedure between upstream and downstream nodes of the broken link. This mechanism produces a set of alternative subroutes with less number of hops which enhances route efficiency and consequently minimises the routing overhead. TRAODV and ORMAD are implemented and evaluated against two existing multipath extensions to,AODV protocol and two traditional multipath protocols. The existing extensions to AODV used in the evaluation are a well-known protocol called Ad hoc On-demand Multipath Distance Vector (AOMDV) and a recent extension called Multiple Route AODV (MRAODV) protocol which is extended in this thesis to the new approach TRAODV while the traditional multipath protocols used in the evaluation are Dynamic Source Routing (DSR) and Temporally Ordered Routing Algorithm (TORA). Protocols are implemented using NS2 and evaluated under the same simulation environment in terms of four performance metrics; packet delivery fraction, average end-to-end delay, routing packets overhead, and throughput. Simulation results of TRAODV evaluation show that the average number of routes stored in a routing table of MRAODV protocol is always larger than the average number of routes in TRAODV. Simulation results show that TRAODV reduces the overall routing packets overhead compared to both extensions AOMDV and MRAODV, especially for large network size and high mobility. A vital drawback of TRAODV is that its performance is reduced compared to AOMDV and MRAODV in terms of average end-to-end delay. Additionally, TORA still outperforms TRAODV and the other extensions to AODV in terms of routing packets overhead. In order to overcome the drawbacks of TRAODV, ORMAD is developed by improving the RDP of TRAODV. The performance of ORMAD is evaluated against RREP waiting time using the idea of utilising the efficient routes in both phases RDP and RMP. Simulation results of ORMAD show that the performance is affected by varying the two RREP waiting times of both RDP and RMP in different scenarios. As shown by the simulation results, applying the short and long waiting times in both phases tends to less performance in terms of routing packets overhead while applying the moderate waiting times tends to better performance. ORMAD enhances routing packets overhead and the average end-to-end delay compared to TRAODV, especially in high mobility scenarios. ORMAD has the closest performance to TORA protocol in terms of routing packets overhead compared to ~M~a~M~OW . Relevant concepts are formalised for ORMAD approach and conducted as an analytical model in this thesis involving the\vhole process of multipath routing in AODV extensions. ORMAD analytical model describes how the two phases RDP and RMP interact with each other with regard to two performance metrics; total number of detected routes and Route Efficiency.

APA, Harvard, Vancouver, ISO, and other styles

16

Sama, Aravind Reddy. "AOD²V : Ad Hoc On Demand and Delay Constrained Distance Vector Routing for mobile sensor/actor networks /." Available to subscribers only, 2008. http://proquest.umi.com/pqdweb?did=1619624051&sid=12&Fmt=2&clientId=1509&RQT=309&VName=PQD.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Tamrakar, Sandeep. "Study of TCP friendliness of CEAS routing system in comparison with Distance Vector Routing and Link State Routing." Thesis, Norwegian University of Science and Technology, Department of Telematics, 2009. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-9043.

Full text

Abstract:

With the continuous development of the Internet technologies new routing requirements have surfaced. In response, several adaptive, stochastic routing algorithms have been purposed. The Cross Entropy Ant System (CEAS) is an adaptive, robust and distributed routing and management system based on the swarm intelligence. Several prototype implementations and enhancements have been made on this system, however the level of TCP friendliness the CEAS may provide is yet an important issue. In order to investigate the level of TCP friendliness, the behavior of the CEAS system during different network dynamics needs to be understood. For this reason, the behavior of the CEAS system under different network event and its corresponding effects on TCP performance is examined first using a simple network. Later the level of TCP performance is measured on complex networks. Also the load sharing capabilities of the CEAS system is investigated the efficiency of the system to manage and update according to the network load. Additionally the results are compared against the results obtained from the standard Link State Routing protocol and the Distance Vector Routing protocol under similar conditions. In this work, we find that the update process in response to the change in network dynamics is slower on CEAS compared to the other systems. However, the update process speeds up with the increase in the ant rates. During such period the use of multiple path reduces the TCP performance. We also find that large amount of packets loop around some links during link failures. Such looping reduces the TCP performance significantly. However, implementing previous hop memory technique removes such loops and also help TCP resume transmission immediately after the link failure. Compare to the LSRP and the DVR, we find that CEAS manages network resources more efficiently to produce higher TCP performance. We find that the CEAS diverts the data traffic on the basis of the quality of the path rather than the length of the path. We also find that the CEAS system handles multiple TCP stream independently with equal priority. But the smaller transition delay on the ants compared to the data packet reduces the TCP performance to some extent. However, forcing the ants to experience longer queuing delay according to the traffic load improves the TCP performance as well as helps CEAS update more accurately.

APA, Harvard, Vancouver, ISO, and other styles

18

Krishnan, Ravikiran. "Generalized Conditional Matching Algorithm for Ordered and Unordered Sets." Thesis, University of South Florida, 2014. http://pqdtopen.proquest.com/#viewpdf?dispub=3666203.

Full text

Abstract:

Designing generalized data-driven distance measures for both ordered and unordered set data is the core focus of the proposed work. An ordered set is a set where time-linear property is maintained when distance between pair of temporal segments. One application in the ordered set is the human gesture analysis from RGBD data. Human gestures are fast becoming the natural form of human computer interaction. This serves as a motivation to modeling, analyzing, and recognition of gestures. The large number of gesture categories such as sign language, traffic signals, everyday actions and also subtle cultural variations in gesture classes makes gesture recognition a challenging problem. As part of generalization, an algorithm is proposed as part of an overlap speech detection application for unordered set.

Any gesture recognition task involves comparing an incoming or a query gesture against a training set of gestures. Having one or few samples deters any class statistic learning approaches to classification, as the full range of variation is not covered. Due to the large variability in gesture classes, temporally segmenting individual gestures also becomes hard. A matching algorithm in such scenarios needs to be able to handle single sample classes and have the ability to label multiple gestures without temporal segmentation.

Each gesture sequence is considered as a class and each class is a data point on an input space. A pair-wise distances pattern between to gesture frame sequences conditioned on a third (anchor) sequence is considered and is referred to as warp vectors. Such a process is defined as conditional distances. At the algorithmic core we have two dynamic time warping processes, one to compute the warp vectors with the anchor sequences and the other to compare these warp vectors. We show that having class dependent distance function can disambiguate classification process where the samples of classes are close to each other. Given a situation where the model base is large (number of classes is also large); the disadvantage of such a distance would be the computational cost. A distributed version combined with sub-sampling anchor gestures is proposed as speedup strategy. In order to label multiple connected gestures in query we use a simultaneous segmentation and recognition matching algorithm called level building algorithm. We use the dynamic programming implementation of the level building algorithm. The core of this algorithm depends on a distance function that compares two gesture sequences. We propose that, we replace this distance function, with the proposed distances. Hence, this version of level building is called as conditional level building (clb). We present results on a large dataset of 8000 RGBD sequences spanning over 200 gesture classes, extracted from the ChaLearn Gesture Challenge dataset. The result is that there is significant improvement over the underlying distance used to compute conditional distance when compared to conditional distance.

As an application of unordered set and non-visual data, overlap speech segment detection algorithm is proposed. Speech recognition systems have a vast variety of application, but fail when there is overlap speech involved. This is especially true in a meeting-room setting. The ability to recognize speaker and localize him/her in the room is an important step towards a higher-level representation of the meeting dynamics. Similar to gesture recognition, a new distance function is defined and it serves as the core of the algorithm to distinguish between individual speech and overlap speech temporal segments. The overlap speech detection problem is framed as outlier detection problem. An incoming audio is broken into temporal segments based on Bayesian Information Criterion (BIC). Each of these segments is considered as node and conditional distance between the nodes are determined. The underlying distances for triples used in conditional distances is the symmetric KL distance. As each node is modeled as a Gaussian, the distance between the two segments or nodes is given by Monte-Carlo estimation of the KL distance. An MDS based global embedding is created based on the pairwise distance between the nodes and RANSAC is applied to compute the outliers. NIST meeting room data set is used to perform experiments on the overlap speech detection. An improvement of more than 20% is achieved with conditional distance based approach when compared to a KL distance based approach.

APA, Harvard, Vancouver, ISO, and other styles

19

Wesolkowski, Slawomir. "Color Image Edge Detection and Segmentation: A Comparison of the Vector Angle and the Euclidean Distance Color Similarity Measures." Thesis, University of Waterloo, 1999. http://hdl.handle.net/10012/937.

Full text

Abstract:

This work is based on Shafer's Dichromatic Reflection Model as applied to color image formation. The color spaces RGB, XYZ, CIELAB, CIELUV, rgb, l1l2l3, and the new h1h2h3 color space are discussed from this perspective. Two color similarity measures are studied: the Euclidean distance and the vector angle. The work in this thesis is motivated from a practical point of view by several shortcomings of current methods. The first problem is the inability of all known methods to properly segment objects from the background without interference from object shadows and highlights. The second shortcoming is the non-examination of the vector angle as a distance measure that is capable of directly evaluating hue similarity without considering intensity especially in RGB. Finally, there is inadequate research on the combination of hue- and intensity-based similarity measures to improve color similarity calculations given the advantages of each color distance measure. These distance measures were used for two image understanding tasks: edge detection, and one strategy for color image segmentation, namely color clustering. Edge detection algorithms using Euclidean distance and vector angle similarity measures as well as their combinations were examined. The list of algorithms is comprised of the modified Roberts operator, the Sobel operator, the Canny operator, the vector gradient operator, and the 3x3 difference vector operator. Pratt's Figure of Merit is used for a quantitative comparison of edge detection results. Color clustering was examined using the k-means (based on the Euclidean distance) and Mixture of Principal Components (based on the vector angle) algorithms. A new quantitative image segmentation evaluation procedure is introduced to assess the performance of both algorithms. Quantitative and qualitative results on many color images (artificial, staged scenes and natural scene images) indicate good edge detection performance using a vector version of the Sobel operator on the h1h2h3 color space. The results using combined hue- and intensity-based difference measures show a slight improvement qualitatively and over using each measure independently in RGB. Quantitative and qualitative results for image segmentation on the same set of images suggest that the best image segmentation results are obtained using the Mixture of Principal Components algorithm on the RGB, XYZ and rgb color spaces. Finally, poor color clustering results in the h1h2h3 color space suggest that some assumptions in deriving a simplified version of the Dichromatic Reflectance Model might have been violated.

APA, Harvard, Vancouver, ISO, and other styles

20

Panascí, Marco. "Vliv dlouhých optovláknových tras na polarizační stav světla a jejich využití pro napájení polarizačních senzorů." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2021. http://www.nusl.cz/ntk/nusl-442367.

Full text

Abstract:

This diploma thesis deals with the influence of long fiber optic paths on the polarization state of light and their use for powering polarization sensors. The aim of the diploma thesis was to design the arrangement of optical fiber components so that the polarization properties of light at the end of the path are further usable for sensory purposes. Four partial measurements with a long path (in a laboratory setting, laying in the ground, on a curtain, under the influence of external influence) and one measurement without a path under the influence of external influence were designed. The overall measurement results demonstrate that for the functional power supply of long-distance sensor systems, an existing single-mode fiber can be used (laid by laying in the ground), into which a light source for a given sensor system would be multiplexed. In the discussion, all types of measurements are analyzed and compared with each other. Finally, the overall result is summarized and applications are described in which such a sensor system could be used.

APA, Harvard, Vancouver, ISO, and other styles

21

Theriot, Tyrone P. "Simulation and performance analysis of the AD HOC On-Demand Distance Vector Routing Protocol for tactical mobile ad hoc networks." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2000. http://handle.dtic.mil/100.2/ADA388021.

Full text

Abstract:

Thesis (M.S. in Electrical Engineering) Naval Postgraduate School, Dec. 2000.
Thesis advisor(s): Tummala, Murali. "December 2000." Includes bibliographical references (p. 81-82). Also available in print.

APA, Harvard, Vancouver, ISO, and other styles

22

Seibel, Roman [Verfasser], Dieter [Akademischer Betreuer] Hogrefe, and Andreas [Akademischer Betreuer] Kassler. "Route Record Distance Vector Protocol for Minimization of Intra-Flow Interference / Roman Seibel. Gutachter: Dieter Hogrefe ; Andreas Kassler. Betreuer: Dieter Hogrefe." Göttingen : Niedersächsische Staats- und Universitätsbibliothek Göttingen, 2013. http://d-nb.info/104487063X/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

El, Moutia Abdallah. "Energy-aware Ad Hoc on-demand distance vector routing protocol and optimizing the blocking problem induced in wireless Ad Hoc networks." FIU Digital Commons, 2004. http://digitalcommons.fiu.edu/etd/3124.

Full text

Abstract:

The purpose of this thesis was to investigate some of the issues related to routing and medium access control protocol in ad hoc networks. In routing protocol, the goal is to tackle the power consumption problem and to present a case for using new cost energy-aware metric for Ad Hoc On-Demand Distance Vector (AODV). The idea of the new cost metric is to be able to avoid routes with a low energy capacity. By using this approach, high efficiency in energy consumption can be achieved in Ad-Hoc networks. The second goal of this thesis was to investigate the blocking problem induced by Request-to-Send/Clear-to-Send (RTS/CTS) mechanism in detail and provide a solution to overcome that problem. To do so, a new parameter is proposed by which the Medium Access control (MAC) protocol will decide when to switch between RTS/CTS mechanism (the 4-way-handshaking) and the Basic Access method (the 2-way-handshaking) in order to reduce the effect of the blocking problem in Ad Hoc networks.

APA, Harvard, Vancouver, ISO, and other styles

24

Chang, Chuan. "Authentification biométrique par dynamique de frappe pour évaluation à distance utilisant SVM à une classe." Master's thesis, Université Laval, 2016. http://hdl.handle.net/20.500.11794/27194.

Full text

Abstract:

La machine à vecteurs de support à une classe est un algorithme non-supervisé qui est capable d’apprendre une fonction de décision à partir de données d’une seule classe pour la détection d’anomalie. Avec les données d’entraînement d’une seule classe, elle peut identifier si une nouvelle donnée est similaire à l’ensemble d’entraînement. Dans ce mémoire, nous nous intéressons à la reconnaissance de forme de dynamique de frappe par la machine à vecteurs de support à une classe, pour l’authentification d’étudiants dans un système d’évaluation sommative à distance à l’Université Laval. Comme chaque étudiant à l’Université Laval possède un identifiant court, unique qu’il utilise pour tout accès sécurisé aux ressources informatiques, nous avons choisi cette chaîne de caractères comme support à la saisie de dynamique de frappe d’utilisateur pour construire notre propre base de données. Après avoir entraîné un modèle pour chaque étudiant avec ses données de dynamique de frappe, on veut pouvoir l’identifier et éventuellement détecter des imposteurs. Trois méthodes pour la classification ont été testées et discutées. Ainsi, nous avons pu constater les faiblesses de chaque méthode dans ce système. L’évaluation des taux de reconnaissance a permis de mettre en évidence leur dépendance au nombre de signatures ainsi qu’au nombre de caractères utilisés pour construire les signatures. Enfin, nous avons montré qu’il existe des corrélations entre le taux de reconnaissance et la dispersion dans les distributions des caractéristiques des signatures de dynamique de frappe.
One-Class Support Vector Machine is an unsupervised algorithm that learns a decision function from only one class for novelty detection. By training the data with only one class, this method is able to classify new data as similar (inlier) or different (outlier) from the training set. In this thesis, we have applied the One-Class Support Vector Machine to Keystroke Dynamics pattern recognition for user authentication in a remote evaluation system at Laval University. Since all of their students have a short and unique identifier at Laval University, this particular static text is used as the Keystroke Dynamics input for a user to build our own dataset. After training a model for each student with his or her keystroke data, we then use this model to detect imposters in the later phase. Three methods were tried and discussed for the classification. Then, we were able to identify weaknesses of each method in such a system by evaluating the recognition accuracy depending on the number of signatures and as a function of their number of characters. Finally, we were able to show some correlations between the dispersion and mode of distributions of features characterizing the keystroke signatures and the recognition rate.

APA, Harvard, Vancouver, ISO, and other styles

25

Guilbert, Laure. "Activités, temps et lieux de vie des cadres : la problématique des technologies et vecteurs d'information et de communication à distance : une approche systémique." Amiens, 2005. http://www.theses.fr/2005AMIE0007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Tran, Anh Tuyet. "1p spaces." CSUSB ScholarWorks, 2002. https://scholarworks.lib.csusb.edu/etd-project/2238.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Bonada, i. Cruells Eduard. "Building ethernet connectivity services for provider networks." Doctoral thesis, Universitat Pompeu Fabra, 2012. http://hdl.handle.net/10803/85413.

Full text

Abstract:

Network providers are motivated to deploy Ethernet in their infrastructures. However, this represents a new application for Ethernet technology that leads to new requirements. In Ethernet networks, the Rapid Spanning Tree Protocol (RSTP) creates an active tree on top of the physical topology to avoid potential loops and allows the bridge functionalities to work properly. However, there are some implications of using RSTP to prune the physical topology into an active tree: unused links and sub-optimal paths. In addition, RSTP suffers count-to-infinity and takes too long to recover from critical failures. In this thesis we propose a complete solution based on RSTP extensions that addresses the shortcomings. We design and evaluate two extensions: RSTP-Conf to provide quick recoveries and RSTP-SP to operate with optimal path communications.
Els proveïdors de xarxa estan motivats per implementar Ethernet en les seves infraestructures. No obstant, això representa una nova aplicació per Ethernet que comporta nous requeriments. En les xarxes Ethernet, el protocol de Rapid Spanning Tree (RSTP) crea un arbre actiu per evitar cicles i permetre que les xarxes Ethernet funcionin correctament. Hi ha però algunes implicacions de l'ús de RSTP per transformar la topologia física en un arbre actiu: alguns enllaços no utilitzats i la creació de rutes sub-òptimes. A més, RSTP pateix count-to-infinity i tarda massa temps per recuperar-se de caigudes crítiques. En aquesta tesi es proposa una solució completa basada en extensions d’RSTP que aborda les seves deficiències. Dissenyem i avaluem dues extensions: RSTP-Conf per proporcionar una ràpida recuperació i RSTP-SP per operar amb comunicacions per camins òptims.

APA, Harvard, Vancouver, ISO, and other styles

28

Bsalis, Elias. "Commande modale d'un avion sans pilote par retour dynamique de sortie." Toulouse, ENSAE, 1992. http://www.theses.fr/1992ESAE0002.

Full text

Abstract:

Cette thèse a pour objet la définition de lois de pilotage pour un avion sans pilote doté d'une instrumentation réduite et rustique dans le cadre d'une mission de survol de la mer à très basse altitude. Ces lois ont été conçues en utilisant la méthodologie de placement des valeurs et vecteurs propres etplus précisément le concept original de participation des modes. Celui-ci offre à l'ingénieur la possibilité de visualiser la participation de chaque mode dans les états et les commandes de son système et d'affiner le choix des vecteurs propres désirés en vue d'atteindre les performances recherchées. Afin de pallier le nombre limité de mesures, divers observateurs ont été mis en œuvre. Finalement à partir d'un modèle de l'avion soumis à une turbulence basse altitude et en tenant compte des contraintes pratiques de réalisation, des compensateurs dynamiques latéraux et longitudinaux ont été élaborés.

APA, Harvard, Vancouver, ISO, and other styles

29

Relovský, Josef. "Zjištění fyzické pozice počítače v Internetu." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2008. http://www.nusl.cz/ntk/nusl-217301.

Full text

Abstract:

This master‘s thesis is formed as a part of the research project for whose analyse is used the worldwide experimental network called PlanetLab. The whole dilemma is engaged by IPTV technology. IPTV is a protocol that makes possible transfer data of a television content over the Internet to the end user. In the IPTV technology the server is a source. These data are presented as a video and audio signal (streem) which are required to deliver to the end users. Some structure, which presents alternate these computers´connection, has been established, because the technology making use of the big pretention is used. The most patent way between the source and the destination is found. My objective is design this structure in the pursuit. The principle of the signal ramification from one node to several nodes (in group) is called multicast. Rather said from one node to the set of nodes. In the IPTV is presented each one single program for one multicast group. The concrete end users (recipients) are members of one or several obtainable multicast groups. The switch between programs demands a change from one multicast group to other group. For an analyse is used the worldwide experimental network called PlanetLab. This network was created after the floatation of three American´s universities in 2002. Nowadays it takes in more than 800 nodes which are distributed over the world. The PlanetLab is used by multinational company such as the Intel or the Hewlett-Packard. It is created for the testing and the scientific scope. I make the scripts in the Linux for the formation of the interconnecting structure. The main item by the course of the unreeling is response time. I investigate it with a command called “ping”. Everything is created in the Linux because all nodes use the operation system Linux in PlanetLab. By the help of the command “ping” I take the active nodes and response times. According to the response time I make a distance vectors which are used for the finding a location in the face of the references points which were determined before. According to the similarity of these vectors is designated to what end point is put to the point.

APA, Harvard, Vancouver, ISO, and other styles

30

Aymak, Onur. "Ad Hoc Packet Routing Simulation And Tactical Picture Display Tool For Navy." Master's thesis, METU, 2004. http://etd.lib.metu.edu.tr/upload/2/12605266/index.pdf.

Full text

Abstract:

The importance of communication is vital in wartime. The capability of having all the position information of the allied and enemy forces in a single Tactical Information Display System (TIDS), maintains a great advantage for deciding what to do before the enemy reacts. A Naval Information Distributing System (NIDS) is developed for building an effective communication infrastructure between the war ships. In the designed network, besides the mobile platforms (ships), some fixed platforms (land stations) are used to transfer the information coming from these mobile platforms to all the other platforms. To demonstrate the performance and effectiveness of the Naval Information Distribution System, a discrete event simulation model is developed on a Geographic Information System. The goal of this thesis is to describe and experimentally evaluate an effective and feasible information sharing and routing system for Navy.

APA, Harvard, Vancouver, ISO, and other styles

31

sayah, nahla K. "A study of errors for 4D lung dose calculation." VCU Scholars Compass, 2015. http://scholarscompass.vcu.edu/etd/3730.

Full text

Abstract:

To estimate the delivered dose to the patient during intra-fraction or throughout the whole treatment, it is important to determine the contribution of dose accumulated at different patient geometries to the overall dose. Dose mapping utilizes deformable image registration to map doses deposited on patient geometries at different times. Inputs to the dose mapping process are the irradiated and reference images, the displacement vector field, and a dose mapping algorithm. Thus accuracy of the mapped dose depends on the DVF and dose mapping algorithm. Dose mapping had been the subject of many research studies however, up to now there is no gold standard DIR or dose mapping algorithm. This thesis compares current dose mapping algorithms under different conditions such as choosing the planning target and dose grid size, and introduces new tool to estimate the required spatial accuracy of a DVF. 11 lung patients were used for this thesis work. IMRT plans were generated on the end of inhale breathing phases with 66 Gy as the prescription dose. Demons DVF’s were generated using the Pinnacle treatment planning system DIR interface. Dtransform, Tri-linear with sub-voxel division, and Pinnacle dose mapping algorithms were compared to energy transfer with mass sub-voxel mapping. For breathing phase 50% on 11 patients, tissue density gradients were highest around the edge of the tumor compared to the CTV and the PTV edge voxels. Thus treatment plans generated with margin equal to zero on the tumor might yield the highest dose mapping error (DME). For plans generated on the tumor, there was no clinical effect of DME on the MLD, lung V20, and Esophagus volume indices. Statistically, MLD and lung V20 DME were significant. Two patients had D98 Pinnacle-DME of 4.4 and 1.2 Gy. In high dose gradient regions DVF spatial accuracy of ~ 1 mm is needed while 8 to 10 mm DVF accuracy can be tolerated before introducing any considerable dose mapping errors inside the CTV. By using ETM with mass sub-voxel mapping and adapting the reported DVF accuracy, the findings of this thesis have the potential to increase the accuracy of 4D lung planning.

APA, Harvard, Vancouver, ISO, and other styles

32

Gunay, Melih. "Representation Of Covariance Matrices In Track Fusion Problems." Master's thesis, METU, 2007. http://etd.lib.metu.edu.tr/upload/12609026/index.pdf.

Full text

Abstract:

Covariance Matrix in target tracking algorithms has a critical role at multi- sensor track fusion systems. This matrix reveals the uncertainty of state es- timates that are obtained from diferent sensors. So, many subproblems of track fusion usually utilize this matrix to get more accurate results. That is why this matrix should be interchanged between the nodes of the multi-sensor tracking system. This thesis mainly deals with analysis of approximations of the covariance matrix that can best represent this matrix in order to efectively transmit this matrix to the demanding site. Kullback-Leibler (KL) Distance is exploited to derive some of the representations for Gaussian case. Also com- parison of these representations is another objective of this work and this is based on the fusion performance of the representations and the performance is measured for a system of a 2-radar track fusion system.

APA, Harvard, Vancouver, ISO, and other styles

33

Tan, Teewoon. "HUMAN FACE RECOGNITION BASED ON FRACTAL IMAGE CODING." University of Sydney. Electrical and Information Engineering, 2004. http://hdl.handle.net/2123/586.

Full text

Abstract:

Human face recognition is an important area in the field of biometrics. It has been an active area of research for several decades, but still remains a challenging problem because of the complexity of the human face. In this thesis we describe fully automatic solutions that can locate faces and then perform identification and verification. We present a solution for face localisation using eye locations. We derive an efficient representation for the decision hyperplane of linear and nonlinear Support Vector Machines (SVMs). For this we introduce the novel concept of $\rho$ and $\eta$ prototypes. The standard formulation for the decision hyperplane is reformulated and expressed in terms of the two prototypes. Different kernels are treated separately to achieve further classification efficiency and to facilitate its adaptation to operate with the fast Fourier transform to achieve fast eye detection. Using the eye locations, we extract and normalise the face for size and in-plane rotations. Our method produces a more efficient representation of the SVM decision hyperplane than the well-known reduced set methods. As a result, our eye detection subsystem is faster and more accurate. The use of fractals and fractal image coding for object recognition has been proposed and used by others. Fractal codes have been used as features for recognition, but we need to take into account the distance between codes, and to ensure the continuity of the parameters of the code. We use a method based on fractal image coding for recognition, which we call the Fractal Neighbour Distance (FND). The FND relies on the Euclidean metric and the uniqueness of the attractor of a fractal code. An advantage of using the FND over fractal codes as features is that we do not have to worry about the uniqueness of, and distance between, codes. We only require the uniqueness of the attractor, which is already an implied property of a properly generated fractal code. Similar methods to the FND have been proposed by others, but what distinguishes our work from the rest is that we investigate the FND in greater detail and use our findings to improve the recognition rate. Our investigations reveal that the FND has some inherent invariance to translation, scale, rotation and changes to illumination. These invariances are image dependent and are affected by fractal encoding parameters. The parameters that have the greatest effect on recognition accuracy are the contrast scaling factor, luminance shift factor and the type of range block partitioning. The contrast scaling factor affect the convergence and eventual convergence rate of a fractal decoding process. We propose a novel method of controlling the convergence rate by altering the contrast scaling factor in a controlled manner, which has not been possible before. This helped us improve the recognition rate because under certain conditions better results are achievable from using a slower rate of convergence. We also investigate the effects of varying the luminance shift factor, and examine three different types of range block partitioning schemes. They are Quad-tree, HV and uniform partitioning. We performed experiments using various face datasets, and the results show that our method indeed performs better than many accepted methods such as eigenfaces. The experiments also show that the FND based classifier increases the separation between classes. The standard FND is further improved by incorporating the use of localised weights. A local search algorithm is introduced to find a best matching local feature using this locally weighted FND. The scores from a set of these locally weighted FND operations are then combined to obtain a global score, which is used as a measure of the similarity between two face images. Each local FND operation possesses the distortion invariant properties described above. Combined with the search procedure, the method has the potential to be invariant to a larger class of non-linear distortions. We also present a set of locally weighted FNDs that concentrate around the upper part of the face encompassing the eyes and nose. This design was motivated by the fact that the region around the eyes has more information for discrimination. Better performance is achieved by using different sets of weights for identification and verification. For facial verification, performance is further improved by using normalised scores and client specific thresholding. In this case, our results are competitive with current state-of-the-art methods, and in some cases outperform all those to which they were compared. For facial identification, under some conditions the weighted FND performs better than the standard FND. However, the weighted FND still has its short comings when some datasets are used, where its performance is not much better than the standard FND. To alleviate this problem we introduce a voting scheme that operates with normalised versions of the weighted FND. Although there are no improvements at lower matching ranks using this method, there are significant improvements for larger matching ranks. Our methods offer advantages over some well-accepted approaches such as eigenfaces, neural networks and those that use statistical learning theory. Some of the advantages are: new faces can be enrolled without re-training involving the whole database; faces can be removed from the database without the need for re-training; there are inherent invariances to face distortions; it is relatively simple to implement; and it is not model-based so there are no model parameters that need to be tweaked.

APA, Harvard, Vancouver, ISO, and other styles

34

Peng, Wendi Surveying &amp Spatial Information Systems Faculty of Engineering UNSW. "Roles of factors in simulation of parking guidance and information systems." Publisher:University of New South Wales. Surveying & Spatial Information Systems, 2008. http://handle.unsw.edu.au/1959.4/42788.

Full text

Abstract:

The Parking Guidance and Information (PGI) system is an important application of Intelligent Transport System (ITS), which has been shown to be an effect service for traffic information and parking management. The roadside Variable Message Sign (VMS) board has been the usual media for the publication of parking information in early PGI systems, and its performance over the years has been studied via simulations and questionnaire surveys. However, survey results show significant discrepancies across various traffic networks in different areas. More recently, parking information services have become available on other media such as mobile and in-vehicle devices. In contrast to VMS-based systems, PGI systems based on new media, especially the in-vehicle class of devices, have not been studied separately. This thesis aims to conduct research into the performance of PGI systems based on invehicle devices, by simulating and comparing a VMS-based PGI system with a Vehicle On-Board Device (VOBD)-based PGI system. A specially designed simulator utilising a routing algorithm known as the Ad hoc On-Demand Distance Vector (AODV) routing protocol in computer networks, has been created in MATLAB. The simulation minimises the influence of specific structures of traffic networks that may be found in some networks, but not others. This is done by simulating a grid-based road network where the capacities of parking stations and their geographic distribution are randomly allocated within specific zones, and the parking demand in each run of simulations is variable load. The results of simulations, including the information reliability, reduction of travel time, demand on on-street parking and the utilisation rates of parking stations, are analysed for multiple scenarios where the compliance rate, the information update policy and the strategy of human behaviour are varied. The analyses reveal a significant advantage of VOBD-based PGI systems over VMS-based PGI systems in terms of the quality of information and the reduction of travel time. At the same time, the analyses highlight the limitations of a PGI system when the demand and supply of parking stations is not appropriately balanced.

APA, Harvard, Vancouver, ISO, and other styles

35

Arendt, Christopher D. "Adaptive Pareto Set Estimation for Stochastic Mixed Variable Design Problems." Ft. Belvoir : Defense Technical Information Center, 2009. http://handle.dtic.mil/100.2/ADA499860.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Batista, Leandro Candido. "Teoria isomorfa dos espaços de Banach C0(K,X)." Universidade de São Paulo, 2012. http://www.teses.usp.br/teses/disponiveis/45/45131/tde-17072013-113811/.

Full text

Abstract:

Para um espaço localmente compacto de Hausdorff K e um espaço de Banach X, denotamos por C0(K,X) o espaço de todas as funções a valores em X contínuas sobre K que se anulam no infinito, munido da norma do supremo. No espírito do clássico teorema de Banach-Stone 1937, estabelecemos que se C0(K1,X) é isomorfo a C0(K2,X), onde X é um espaço de Banach de cotipo finito e tal que X é separável ou X* tem a propriedade de Radon-Nikodým, então ou K1 e K2 são ambos finitos ou K1 e K2 tem a mesma cardinalidade. Trata-se de uma extensão vetorial de um resultado de Cengiz 1978, o caso escalar X = R ou X = C. Demonstramos também que se K1 e K2 são intervalos compactos de ordinais e X é um espaço de Banach de cotipo finito, então a existência de um isomorfismo T de C(K1,X) em C(K2,X) com ||T||||T-1|| < 3 implica que uma certa soma topológica finita de K1 é homeomorfa a alguma soma topológica finita de K2. Mais ainda, se Xn não contém subespaço isomorfo a Xn+1 para todo n ∈ N, então K1 é homeomorfo a K2. Em outras palavras, obtemos um teorema tipo Banach-Stone vetorial que é uma extensão de um teorema de Gordon de 1970 e ao mesmo tempo uma extensão de um teorema de Behrends e Cambern de 1988. Mostramos que se existe um isomorfismo T de C(K1) em um subespaço de C(K2,X) com ||T||||T-1|| < 3, então a cardinalidade do α-ésimo derivado de K2 ou é finita ou é maior do que a cardinalidade do α-ésimo derivado de K1, para todo ordinal α. Em seguida, seja n um inteiro positivo, Γ um conjunto infinito munido da topologia discreta e X um espaço de Banach de cotipo finito. Estabelecemos que se o n-ésimo derivado de K for não vazio, então a distância de Banach-Mazur entre C0(K,X) e C0(Γ,X) é maior ou igual a 2n + 1. Também demonstramos que para quaisquer inteiros positivos n e k, a distância de Banach-Mazur entre C([1,ωnk],X) e C0(N,X) é exatamente 2n+1. Estes resultados fornecem extensões vetoriais para alguns teoremas de Cambern de 1970. Para um ordinal enumerável α, denotando por C(α) o espaço de Banach das funções contínuas no intervalo de ordinal [1, α], obtemos cotas superiores H(n, k) e cotas inferiores G(n, k) para as distâncias de Banach-Mazur entre os espaços C(ω) e C(ωnk), 1 < n, k < ω, verificando H(n, k) - G(n, k) < 2. Estas estimativas fornecem uma resposta para uma questão de Bessaga e Peczynski de 1960 sobre as distâncias de Banach-Mazur entre C(ω) e cada um dos espaços C(α), ω<α<ωω.
For a locally compact Hausdorff space K and a Banach space X, we denote by C0(K,X) the space of X-valued continuous functions on K which vanish at infinity, endowed with the supremum norm. In the spirit of the classical 1937 Banach-Stone theorem, we prove that if C0(K1,X) is isomorphic to C0(K2,X), where X is a Banach space having finite cotype and such that X is separable or X* has the Radon-Nikodým property, then either K1 and K2 are finite or K1 and K2 have the same cardinality. It is a vector-valued extension of a 1978 Cengiz result, the scalar case X = R or X = C. We also prove that if K1 and K2 are compact ordinal spaces and X is Banach space having finite cotype, then the existence of an isomorphism T from C(K1,X) onto C(K2,X) with ||T||||T-1|| < 3 implies that some finite topological sum of K1 is homeomorphic to some finite topological sum of K2. Moreover, if Xn contains no subspace isomorphic to Xn+1 for every n ∈ N, then K1 is homeomorphic to K2. In other words, we obtain a vector-valued Banach-Stone theorem which is an extension of a 1970 Gordon theorem and at same time an improvement of a 1988 Behrends and Cambern theorem. We show that if there is an embedding T of a C(K1) into C(K2,X) with ||T||||T-1|| < 3, then the cardinality of the α-th derivative of K2 is either finite or greater than the cardinality of the α-th derivative of K1, for every ordinal α. Next, let n be a positive integer, Γ an infinite set with the discrete topology and X is a Banach space having finite cotype. We prove that if the n-th derivative of K is not empty, then the Banach Mazur distance between C0(K,X) and C0(Γ,X) is greater than or equal to 2n + 1. Thus, we also show that for every positive integers n and k, the Banach Mazur distance between C([1,ωnk],X) and C0(N,X) is exactly 2n+1. These results provide vector-valued versions of some 1970 Cambern theorems. For a countable ordinal α, writing C(α) for the Banach space of continuous functions on the interval of ordinal [1, α], we give lower bounds H(n, k) and upper bounds G(n, k) on the Banach- Mazur distances between C(ω) and C(ωnk), 1 < n, k < ω, such that H(n, k) - G(n, k) < 2. These estimates provide an answer to a 1960 Bessaga and Peczynski question on the Banach-Mazur distances between C(ω) and each of the C(α) spaces, ω<α<ωω.

APA, Harvard, Vancouver, ISO, and other styles

37

Proença, Patrícia Aparecida. "Recuperação de imagens digitais com base na distribuição de características de baixo nível em partições do domínio utilizando índice invertido." Universidade Federal de Uberlândia, 2010. https://repositorio.ufu.br/handle/123456789/12500.

Full text

Abstract:

Fundação de Amparo a Pesquisa do Estado de Minas Gerais
The main goal of a images retrieval system is to obtain images from a collection that assist a need of the user. To achieve this objective, in generally, the systems of retrieval of images calculate the similarity between the user's need represented by a query and representations of the images of the collection. Such an objective is dicult of being obtain due to the subjectivity of the similarity concept among images, because a same image can be interpreted in dierent ways by dierent people. In the attempt of solving this problem the content based image retrieval systems explore the characteristics of low level color, forms and texture in the calculation of the similarity among the images. A problem of this approach is that in most of the systems the calculation of the similarity is accomplished being compared the query image with all of the images of the collection, turning the dicult and slow processing. Considering the indexation of characteristics of low level of partitions of digital images mapped to an inverted index, this work looks for improvements in the acting of the processing of querys and improve in the precision considering the group of images retrieval in great bases of data. We used an approach based in inverted index that is here adapted for partitions images. In this approach the concept of term of the retrieval textual, main element of the indexation, it is used in the work as characteristic of partitions of images for the indexation. Experiments show improvement in the quality of the precision using two collections of digital images.
O principal objetivo de um sistema de recuperação de imagens é obter imagens de uma coleção que atendam a uma necessidade do usuário. Para atingir esse objetivo, em geral, os sistemas de recuperação de imagens calculam a similaridade entre a necessidade do usuário, representada por uma consulta, e representações das imagens da coleção. Tal objetivo é difícil de ser alcançado devido à subjetividade do conceito de similaridade entre imagens, visto que uma mesma imagem pode ser interpretada de formas diferentes por pessoas distintas. Na tentativa de resolver este problema os sistemas de recuperação de imagens por conteúdo exploram as características de baixo nível cor, forma e textura no cálculo da similaridade entre as imagens. Um problema desta abordagem é que na maioria dos sistemas o cálculo da similaridade é realizado comparando-se a imagem de consulta com todas as imagens da coleção, tornando o processamento difícil e lento. Considerando a indexação de características de baixo nível de partições de imagens digitais mapeadas para um índice invertido, este trabalho busca melhorias no desempenho do processamento de consultas e ganho na precisão considerando o conjunto de imagens recuperadas em grandes bases de dados. Utilizamos uma abordagem baseada em índice invertido, que é aqui adaptada para imagens particionadas. Nesta abordagem o conceito de termo da recuperação textual, principal elemento da indexação, é utilizado no trabalho como característica de partições de imagens para a indexação. Experimentos mostram ganho na qualidade da precisão usando duas coleções de imagens digitais.
Mestre em Ciência da Computação

APA, Harvard, Vancouver, ISO, and other styles

38

Heutte, Laurent. "Reconnaissance de caractères manuscrits : application a la lecture automatique des chèques et des enveloppes postales." Rouen, 1994. http://www.theses.fr/1994ROUES049.

Full text

Abstract:

Cette thèse traite de la reconnaissance de caractères manuscrits provenant de la segmentation d'un mot ou d'une chaîne de caractères numériques dans le contexte particulier de la lecture automatique de chèques et d'enveloppes postales. Le premier chapitre présente un état de l'art dans le domaine de la reconnaissance de l'écrit et notamment les étapes concernant la conception d'un système de reconnaissance de caractères. Le deuxième chapitre traite de la reconnaissance proprement dite. Après une analyse détaillée des différentes méthodes proposées dans la littérature, les deux méthodes retenues, la séparation linéaire et la distance de Mahalanobis, sont décrites. Le troisième chapitre est consacré à la définition des caractéristiques et à la construction du vecteur représentant chaque caractère. Les familles de caractéristiques retenues, incluant à la fois des mesures statistiques et des primitives structurelles, sont détectées à partir de différentes représentations du caractère. Un algorithme de recherche d'une combinaison optimale représentation/famille de caractéristiques est présenté. Le choix de la dimension du vecteur et le problème des composantes manquantes pour certaines observations sont discutés. Le dernier chapitre présente les différentes applications dans lesquelles les travaux de la thèse ont été intégrés. Les deux premières applications concernent la lecture automatique des enveloppes postales américaines et plus spécialement la reconnaissance de graphèmes issus de la segmentation des mots manuscrits cursifs ainsi que la reconnaissance des chiffres provenant de la segmentation du code postal. La troisième application concerne la lecture automatique des chèques postaux français et plus particulièrement la reconnaissance des chiffres issus de la segmentation des deux montants numériques. Les différents aspects de l'étude présentée sont approfondis tant sur le plan bibliographique que sur le plan algorithmique. Ils ont conduit à la mise au point de méthodes de reconnaissance robustes qui ont été validées expérimentalement sur d'importantes bases de caractères et de mots manuscrits

APA, Harvard, Vancouver, ISO, and other styles

39

Jarolím, Jordán. "Analýza a získávání informací ze souboru dokumentů spojených do jednoho celku." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2018. http://www.nusl.cz/ntk/nusl-385929.

Full text

Abstract:

This thesis deals with mining of relevant information from documents and automatic splitting of multiple documents merged together. Moreover, it describes the design and implementation of software for data mining from documents and for automatic splitting of multiple documents. Methods for acquiring textual data from scanned documents, named entity recognition, document clustering, their supportive algorithms and metrics for automatic splitting of documents are described in this thesis. Furthermore, an algorithm of implemented software is explained and tools and techniques used by this software are described. Lastly, the success rate of the implemented software is evaluated. In conclusion, possible extensions and further development of this thesis are discussed at the end.

APA, Harvard, Vancouver, ISO, and other styles

40

Mekyska, Jiří. "Identifikace osob pomocí otisku hlasu." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2010. http://www.nusl.cz/ntk/nusl-218235.

Full text

Abstract:

This work deals with the text-dependent speaker recognition in systems, where just a few training samples exist. For the purpose of this recognition, the voice imprint based on different features (e.g. MFCC, PLP, ACW etc.) is proposed. At the beginning, there is described the way, how the speech signal is produced. Some speech characteristics important for speaker recognition are also mentioned. The next part of work deals with the speech signal analysis. There is mentioned the preprocessing and also the feature extraction methods. The following part describes the process of speaker recognition and mentions the evaluation of the used methods: speaker identification and verification. Last theoretically based part of work deals with the classifiers which are suitable for the text-dependent recognition. The classifiers based on fractional distances, dynamic time warping, dispersion matching and vector quantization are mentioned. This work continues by design and realization of system, which evaluates all described classifiers for voice imprint based on different features.

APA, Harvard, Vancouver, ISO, and other styles

41

Teissier, Yoann. "Metapopulation dynamics of dengue epidemics in French Polynesia." Thesis, Sorbonne Paris Cité, 2017. http://www.theses.fr/2017USPCB008.

Full text

Abstract:

La dengue circule en Polynésie française sur un mode épidémique depuis plus de 35 ans. Néanmoins, en dépit de la taille relativement faible de la population de Polynésie française, la circulation de la dengue peut persister à de faibles niveaux pendant de nombreuses années. L’objectif de ce travail de thèse est de déterminer si l'épidémiologie de la dengue dans le système insulaire de la Polynésie française répond aux critères d’un contexte de métapopulation. Après avoir constitué une base de données regroupant les cas de dengue répertoriés sur les 35 dernières années, nous avons réalisé des analyses épidémiologiques descriptives et statistiques. Celles-ci ont révélé des disparités spatio-temporelles distinctes pour l’incidence de la dengue des archipels et des îles, mais la structure de l'épidémie globale à l’échelle de la Polynésie française pour un même sérotype ne semble pas être affectée. Les analyses de la métapopulation ont révélé l'incidence asynchrone de la dengue dans un grand nombre d’îles. Celle-ci s’observe plus particulièrement par la différence de dynamique de l’incidence entre les îles plus peuplées et celles ayant une population plus faible. La taille critique de la communauté nécessaire à la persistance de la dengue n’est même pas atteinte par la plus grande île de Polynésie Française, Tahiti. Ce résultat suggère que la dengue peut uniquement persister grâce à sa propagation d’île en île. L'incorporation de la connectivité des îles à travers des modèles de migration humaine dans un modèle mathématique a produit une dynamique de la dengue davantage en adéquation avec les données observées, que les tentatives de modélisation traitant la population dans son ensemble. Le modèle de la métapopulation a été capable de simuler la même dynamique que les cas de dengue observés pour l'épidémie et la transmission endémique qui a suivi pour la période de 2001 à 2008. Des analyses complémentaires sur la différenciation de l'incidence de la maladie et de l'infection seront probablement instructives pour affiner le modèle de métapopulation de l'épidémiologie de la dengue en Polynésie française
Dengue has been epidemic in French Polynesia for the past 35 years. Despite the relatively small population size in French Polynesia, dengue does not disappear and can persist at low levels for many years. In light of the large number of islands comprising French Polynesia, this thesis addresses the extent to which a metapopulation context may be the most appropriate to describe the epidemiology and persistence of dengue in this case. After compiling a database of dengue cases over the last 35 years, we used a number of descriptive and statistical epidemiological analyses that revealed distinct spatio-temporal disparity in dengue incidence for archipelago and islands. But the global structure of the epidemics of the same serotype were not affected. Metapopulation analyses revealed asynchronous dengue incidence among many of the islands and most notably larger islands lagged behind the smaller islands. The critical community size, which determines dengue persistence, was found to exceed even the largest island of Tahiti, suggesting that dengue can only exist by island-hopping. Incorporation of island connectedness through patterns of human migration into a mathematical model enabled a much better fit to the observed data than treating the population as a whole. The metapopulation model was able to capture to some extent the epidemic and low level transmission dynamics observed for the period of 2001-2008. Further analyses on differentiating incidence of disease and infection will likely prove informative for the metapopulation model of dengue epidemiology in French Polynesia

APA, Harvard, Vancouver, ISO, and other styles

42

Pospíšil, Petr. "Optimalizace predikce pozice v síti." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2008. http://www.nusl.cz/ntk/nusl-217436.

Full text

Abstract:

This work is about position prediction in network, it is focused to find Landmark closest to the Host in the network (with lowest distance vector). The algorithm is based on GNP system. In terms of GNP system simulation was selected method for mathematical part of position prediction. The method was Simplex Downhill. The designed algorithm was implemented in Java. In the first step chose Host continent by meassuring the distance vector. In next step is selected nearest part in the continent. In conclusion estimate Host its position and then closest Landmark. Results from this work is important for designing TTP protocol. The verdict is that the GNP can be used for TTP, but Landmarks must be located in uniform density.

APA, Harvard, Vancouver, ISO, and other styles

43

Marchi, Tommaso. "Position and singularity analysis of a class of n-RRR planar parallel robots." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2020.

Find full text

Abstract:

Parallel robots with configurable platform are a class of parallel robots in which the end-effector is a closed-loop flexible chain of rigid links. We have developed a 5-RRR planar mechanism that features a flexible 5-bar chain as end-effector. The angles between adjacent sides of this chain can be controlled through the actuated revolute joints attached to the base of the mechanism. This thesis consists in the geometrical design of n-RRR planar parallel robots and in the study of the Direct Kinematics for 4-, 5- and 6-RRR mechanisms using Bilateration, a method that greatly reduces the computational time for the kinematic analysis. The next step is the singularity analysis for the n-RRR robot architectures; finally, in the last part of this thesis we present the results from experimental tests that have been performed on a 5-RRR robot prototype.

APA, Harvard, Vancouver, ISO, and other styles

44

Essid, Slim. "Classification automatique des signaux audio-fréquences : reconnaissance des instruments de musique." Phd thesis, Université Pierre et Marie Curie - Paris VI, 2005. http://pastel.archives-ouvertes.fr/pastel-00002738.

Full text

Abstract:

L'objet de cette thèse est de contribuer à améliorer l'identification automatique des instruments de musique dans des contextes réalistes, (sur des solos de musique, mais également sur des pièces multi-instrumentales). Nous abordons le problème suivant une approche de classification automatique en nous efforçant de rechercher des réalisations performantes des différents modules constituant le système que nous proposons. Nous adoptons un schéma de classification hiérarchique basé sur des taxonomies des instruments et des mélanges d'instruments. Ces taxonomies sont inférées au moyen d'un algorithme de clustering hiérarchique exploitant des distances probabilistes robustes qui sont calculées en utilisant une méthode à noyau. Le système exploite un nouvel algorithme de sélection automatique des attributs pour produire une description efficace des signaux audio qui, associée à des machines à vecteurs supports, permet d'atteindre des taux de reconnaissance élevés sur des pièces sonores reflétant la diversité de la pratique musicale et des conditions d'enregistrement rencontrées dans le monde réel. Notre architecture parvient ainsi à identifier jusqu'à quatre instruments joués simultanément, à partir d'extraits de jazz incluant des percussions.

APA, Harvard, Vancouver, ISO, and other styles

45

Jou, Pei-Yuan, and 周培元. "Adaptive Weighted Distance for Feature Vectors of Biological Sequences." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/47274308615858302312.

Full text

Abstract:

碩士
國立嘉義大學
資訊工程學系研究所
95
Study on biological sequence database similarity searching has received substantial attention in the past decade. The similarity search in the biological databases is an important issue. Similarity search in biology sequences has attention in the recent studies. Sequence alignment is the essential task for searching of similar sequence in bioinformatics. The biological sequence databases have getting larger in past decade. Finding sequences that similar to the query sequence is a time consuming task. By transforming sequences into numeric feature vectors, we can quickly filter out sequences whose feature vectors are far to the feature vector of the query sequence. The numeric feature vector contains three groups of features: Count, Extensible-Relative Position Dispersion (XRPD), and Extensible-Absolute Position Dispersion (XAPD) of a DNA sequence. Each group has four dimensions for A, C, T, and G. When computing distance between two feature vectors, Euclidean distance and L1 distance are commonly used. The author proposed an adaptive weighting distance. The adaptive weighting derives from the four nucleotides from the Count group. And the weighting applied on both XRPD and XAPD. In other words, if a certain kind of nucleotide appears much frequent than the other kinds of nucleotides, the weight for the kind of nucleotide should also be large in XRPD and XAPD groups. Experiments show that such distance of feature vectors helps reflect the distance between sequences.

APA, Harvard, Vancouver, ISO, and other styles

46

Lin, Jyh-Shyan, and 林志賢. "Construction and Analysis of Distance-Preserving Mappings from Vectors to Permutations." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/13269627485999501868.

Full text

Abstract:

博士
國立交通大學
資訊科學與工程研究所
96
A mapping from the set of all q-ary vectors of length n to the set of all permutations of {1, 2, … , N} where N �d n is called a distance-preserving mapping (DPM) if every two vectors are mapped to permutations with the same or even larger Hamming distance than that of the vectors. A distance-increasing mapping (DIM) is a special DPM such that the distances of mapped permutations are strictly increased except when that is obviously not possible. In this dissertation, we propose several constructions of DIMs from binary vectors. These constructions possess some advantages over previous proposed constructions. In addition, we also propose constructions of DPMs and DIMs from ternary vectors. This is the first time that constructions of DPMs and DIMs from ternary vectors are proposed in the literature. A contribution of these constructions is their application to the improvement of the lower bounds on the maximal size of permutation arrays (or permutation codes), which are useful in the design of a power line communication system.

APA, Harvard, Vancouver, ISO, and other styles

47

Yang, Hsin-Yun, and 楊心運. "Multipath 6LoWPAN Ad Hoc On-Demand Distance Vector Routing." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/09944727246416524200.

Full text

Abstract:

碩士
國立宜蘭大學
資訊工程研究所碩士班
97
In order to move towards the current development of ubiquitous network environment. To integrate the different types of network environment is going on. The IEEE 802.15.4 standard is a low cost, low-rate, Low-power Wireless Personal Area Network technology. IP for Smart Objects seeks to extend the use of IP networking into resource-constrained devices over a low-power network. IPv6 over Low-power Wireless Personal Area Network (6LoWPAN) are specified by the IETF Working Group, and advanced by the IPSO alliance. 6LoWPAN Ad Hoc On-Demand Distance Vector Routing (LOAD) is based on AODV , and simplify the routing protocol for 6LoWPAN mesh network . Although the LOAD simplify the AODV for 6LoWPAN mesh network, but the route discovery by broadcasting route request(RREQ) still huge whole network overhead . So we would like to use the concept of Ad-Hoc On-Demand Multipath Distance Vector Routing (AOMDV) for LOAD to find multipath routes during the route discovery. If the path fail we still have alternate path can be used for reducing the overhead of route discovery for the network.

APA, Harvard, Vancouver, ISO, and other styles

48

Huang, Yuan-Chih, and 黃元志. "Fault Management for Networks with Distance Vector Routing Protocols." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/69654420046517846954.

Full text

Abstract:

碩士
逢甲大學
資訊電機工程碩士在職專班
94
With the increasing complexity of enterprise networks and Internet, in which losts of large scale, distributed, and heterogeneous applications have been deployed. To guarantee the high reliability of service upper layer of the network, on one hand, redundant link is built in the backbone network to avoid from stopping the service and operation losses. On the other hand, when the network flow increasing can make load-balancing across the multiple available paths appealing. But a lot of critical applications; such as the VOIP, its quality of the network demands to be higher than normal datagram transmitting far, and its end-to-end delay time must be shorter than 150ms in order to achieve the standard of VOIP QOS. Once the primary path fails, the traffic is routed through a backup path, if available. And they will increase centralization rapidly, the conversation quality of the VOIP will be deteriorated certainly. Our motivation is to present a new fault management of networks that can localize the possible fault position correctly and fast in complicated with the fault-tolerant backbone network, and then clear fault and restore immediately in addition to guarantee the high availability of the network service. Therefore, we decide to research, develop and practice a new system for online fault management of networks running distance vector routing protocol in backbone network. This system can be put in any IDC of ISP to ensure the high reliability and availability of backbone network. In order to improve system practicability and scalability, we will also adopt the idea of plug-and-play for our plan. This system only needs to monitor passively any monitored router in backbone network so that it can localize the possible fault position. In order to reach this goal, network fault management will utilize the characteristic of routing protocol that routes exchange each other regarded as tools to detect fault, so we can compare the changes of routing topology. Thereafter, we analyse in detail all the characteristics of possible case systematically （depending on time, place, equipment, characteristic of backbone, layer-2-switch features, and etc.） to exactly localize the fault position.

APA, Harvard, Vancouver, ISO, and other styles

49

Lan, Shi-Zhang, and 藍世璋. "Ad-Hoc On-Demand Distance Vector Protocol Simulation and Analysis." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/28754103164283508248.

Full text

Abstract:

碩士
華梵大學
工業工程與經營資訊學系碩士班
97
With the popularities of mobile devices and their applications, the mobile Ad-Hoc network becomes an important research topic. Different from typical networks that have fixed topologies, the movement of mobile nodes leads to the change of network topology that influences the network’s behavior. This research uses simulation models to study the parameters that affect the network’s stability and performance. Network structures and routing protocols were first investigated to establish the basis of simulation infrastructure and the Ad-Hoc On-Demand Distance Vector communication protocol was selected to develop the models. The simulation platform was developed using AnyLogic which is object-oriented simulation development software in Java language. Speed, mobility and distribution of mobile nodes were used as parameters in the simulation. The simulation results indicate that the topology change is the most important parameter that affects the data transmission performance of Ad-Hoc On-Demand Distance Vector protocol. In order to maintain a certain degree of stability these parameters must be within a proper range.

APA, Harvard, Vancouver, ISO, and other styles

50

Seibel, Roman. ""Route Record Distance Vector Protocol for Minimization of Intra-Flow Interference"." Doctoral thesis, 2013. http://hdl.handle.net/11858/00-1735-0000-0001-BC21-F.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic 'Distance vectors'

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