Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Adaptive algorithm.
Rozprawy doktorskie na temat „Adaptive algorithm”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Adaptive algorithm”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.
1
Mirzazadeh, Mehdi. "Adaptive Comparison-Based Algorithms for Evaluating Set Queries." Thesis, University of Waterloo, 2004. http://hdl.handle.net/10012/1147.
Pełny tekst źródłaStreszczenie:
In this thesis we study a problem that arises in answering boolean queries submitted to a search engine. Usually a search engine stores the set of IDs of documents containing each word in a pre-computed sorted order and to evaluate a query like "computer AND science" the search engine has to evaluate the union of the sets of documents containing the words "computer" and "science". More complex queries will result in more complex set expressions. In this thesis we consider the problem of evaluation of a set expression with union and intersection as operators and ordered sets as operands. We explore properties of comparison-based algorithms for the problem. A <i>proof of a set expression</i> is the set of comparisons that a comparison-based algorithm performs before it can determine the result of the expression. We discuss the properties of the proofs of set expressions and based on how complex the smallest proofs of a set expression <i>E</i> are, we define a measurement for determining how difficult it is for <i>E</i> to be computed. Then, we design an algorithm that is adaptive to the difficulty of the input expression and we show that the running time of the algorithm is roughly proportional to difficulty of the input expression, where the factor is roughly logarithmic in the number of the operands of the input expression.
2
Law, Nga Lam. "Parameter-free adaptive genetic algorithm /." View abstract or full-text, 2007. http://library.ust.hk/cgi/db/thesis.pl?PHYS%202007%20LAW.
Pełny tekst źródła
3
au, Daniel Schubert@csiro, and Daniel Schubert. "A Multivariate Adaptive Trimmed Likelihood Algorithm." Murdoch University, 2005. http://wwwlib.murdoch.edu.au/adt/browse/view/adt-MU20061019.132720.
Pełny tekst źródłaStreszczenie:
The research reported in this thesis describes a new algorithm which can be used to
robustify statistical estimates adaptively. The algorithm does not require any pre-specified
cut-off value between inlying and outlying regions and there is no presumption of any
cluster configuration. This new algorithm adapts to any particular sample and may advise
the trimming of a certain proportion of data considered extraneous or may divulge the
structure of a multi-modal data set. Its adaptive quality also allows for the confirmation
that uni-modal, multivariate normal data sets are outlier free. It is also shown to behave
independently of the type of outlier, for example, whether applied to a data set with a
solitary observation located in some extreme region or to a data set composed of clusters
of outlying data, this algorithm performs with a high probability of success.
4
Schubert, Daniel Dice. "A multivariate adaptive trimmed likelihood algorithm /." Access via Murdoch University Digital Theses Project, 2005. http://wwwlib.murdoch.edu.au/adt/browse/view/adt-MU20061019.132720.
Pełny tekst źródła
5
Vogt, Paul E. "An adaptive multi-scene correlation algorithm." Master's thesis, University of Central Florida, 1988. http://digital.library.ucf.edu/cdm/ref/collection/RTD/id/76421.
Pełny tekst źródłaStreszczenie:
University of Central Florida College of Engineering Thesis<br>Digital scene matching algorithms have been used in both military and commercial image processing systems for years. The trend toward using multiple sensors in military imaging systems has generated anew interest in real time techniques to accomplish sensor fusion tasks such as field of view alignment. This thesis analyzes methods presently in use and intorduces a novel algorithm that improves scene correlation performance. The focus of the new technique is in the segmentation area, where significant features are extracted from background and clutter. These performance improvements are espeically helpful when the scene contains excessive noise and or lacks detail, a trouble spot for standard correlation systems. The restrictions imposed on the system design include implementations possible for real time porcessing and a minimum of hardware and power consimption. Simulations of the algorithms programmed for an image processing board by an IBM personal computer are discussed.<br>M.S.<br>Masters<br>Engineering<br>Engineering<br>79 p.
6
Turner, Steven Primitivo. "Adaptive out of step relay algorithm." Thesis, This resource online, 1992. http://scholar.lib.vt.edu/theses/available/etd-01242009-063244/.
Pełny tekst źródła
7
Schubert, Daniel. "A multivariate adaptive trimmed likelihood algorithm." Thesis, Schubert, Daniel (2005) A multivariate adaptive trimmed likelihood algorithm. PhD thesis, Murdoch University, 2005. https://researchrepository.murdoch.edu.au/id/eprint/295/.
Pełny tekst źródłaStreszczenie:
The research reported in this thesis describes a new algorithm which can be used to robustify statistical estimates adaptively. The algorithm does not require any pre-specified cut-off value between inlying and outlying regions and there is no presumption of any cluster configuration. This new algorithm adapts to any particular sample and may advise the trimming of a certain proportion of data considered extraneous or may divulge the structure of a multi-modal data set. Its adaptive quality also allows for the confirmation that uni-modal, multivariate normal data sets are outlier free. It is also shown to behave independently of the type of outlier, for example, whether applied to a data set with a solitary observation located in some extreme region or to a data set composed of clusters of outlying data, this algorithm performs with a high probability of success.
8
Schubert, Daniel. "A multivariate adaptive trimmed likelihood algorithm." Schubert, Daniel (2005) A multivariate adaptive trimmed likelihood algorithm. PhD thesis, Murdoch University, 2005. http://researchrepository.murdoch.edu.au/295/.
Pełny tekst źródłaStreszczenie:
The research reported in this thesis describes a new algorithm which can be used to robustify statistical estimates adaptively. The algorithm does not require any pre-specified cut-off value between inlying and outlying regions and there is no presumption of any cluster configuration. This new algorithm adapts to any particular sample and may advise the trimming of a certain proportion of data considered extraneous or may divulge the structure of a multi-modal data set. Its adaptive quality also allows for the confirmation that uni-modal, multivariate normal data sets are outlier free. It is also shown to behave independently of the type of outlier, for example, whether applied to a data set with a solitary observation located in some extreme region or to a data set composed of clusters of outlying data, this algorithm performs with a high probability of success.
9
Doss, Christopher. "Algorithm Partitioning and Scheduling for Adaptive Computers." NCSU, 2001. http://www.lib.ncsu.edu/theses/available/etd-20010619-175307.
Pełny tekst źródłaStreszczenie:
<p>Adaptive, or reconfigurable, computing has emerged as a viable computing alternative for computationally intense applications. (We use the terms adaptive and reconfigurable interchangeably). Here, an adaptive computer is a computing system that contains a general purpose processor attached to a programmable logic device such as a field programmable gate array (FPGA). These computing systems combine the flexibility of general purpose processors with the speed of application specific processors. The computer system designer can cater the hardware to a specific application by modifying the configuration of the FPGAs. The designer can reconfigure the FPGAs at some future time for other applications since the FPGAs do not have a fixed structure.Several reconfigurable computers have been implemented to demonstrate the viability of reconfigurable processors.Applications mapped to these processors include pattern recognition in high-energy physics, statistical physics and genetic optimization algorithms. In many cases, the reconfigurable computing implementation provided thehighest performance, in terms of execution speed, published (at the respective time).To achieve such performance, the application must effectively utilize the available resources. This presents a challenge for software designers, who are generally used to mapping applications onto fixed computing systems.Generally, the designers examine the available hardware resources and modify their application accordingly. With reconfigurable computers, the available resources can be generated when needed. While it may seem thatthis flexibility would ease the mapping process, it actually introduces new problems, such as what components should be allocated, and how many of each component should be used to generate the best performance. With conventionalhardware components, these questions were not an issue.In addition, software engineers are generally not adept at hardware design.In this dissertation, we present a design methodology for systematically implementing computationally intense applications on reconfigurable computing systems. This methodology is based on concepts from compiler theory to ease automation.In addition to the design methodology, we present, a toolthat implements a significant portion of the design methodology. RAS can be considered as a module generation tool for assisting the design process. Given a flow graph representing a loop nest, RAS allocates a set of resources, and schedules the nodes of the graph to the resources. RAS also generates an estimate of the amount of time it would take if the design implemented according to the schedule.This dissertation also presents results of designs produced by RAS. Multiple tests were performed using three computationally intense algorithms. RAS mapped the algorithms to five configurations representingdifferent sets of resource constraints. Two of the configurations were based on actual systems used in the research development, while the remainingthree were hypothetical systems based on other components available in the market. Experimental results from RASindicate that a significant amount of speedup is attainable using the allocated resources with the given schedule.<P>
10
Pervaiz, Mehtab M. "Spatio-temporal adaptive algorithm for reacting flows." Thesis, Massachusetts Institute of Technology, 1988. http://hdl.handle.net/1721.1/34994.
Pełny tekst źródła
11
Vernersson, Ante. "Adaptive Backprojection : Developing a simple reconstruction algorithm." Thesis, Mittuniversitetet, Avdelningen för elektronikkonstruktion, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-34098.
Pełny tekst źródłaStreszczenie:
This group project aims to investigate the possibility ofconstructing a prototype micro-CT-scanner, hopefullyfurthering the advancement in the field of small CT-scanners,with the ultimate goal to provide a structure useable in anambulance, to scan and send images to the hospital, so thattreatment can commence directly upon arrival.This report deals with the matter of reconstructing the takenimages to construct a three-dimensional model of thescanned object. An algorithm is developed in a mannerunderstandable to those not familiar with traditionalreconstruction techniques, simplifying the understanding ofCT backprojection while also providing a useful algorithm touse along with the scanner setup. The working principles ofthe reconstruction algorithm are explained along with itsdevelopment process, and the project ends with clear resultsin the form of an “Adaptive Backprojection” algorithm.
12
Zhao, Shuqi. "Self-Adaptive Algorithm for Warehouse Truck Speed Measurement with Accelerometer." Thesis, KTH, Elektrisk energiomvandling, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-166587.
Pełny tekst źródłaStreszczenie:
Warehouse trucks are now a practical equipment for lifting and moving goods in warehouses. The working situation for warehouse trucks is complicated. Spilling of machine oil or liquid product leads to low friction coefficient of the floor. Warehouse floors are normally made of concrete. Smooth concrete floors easily become slippery with liquid on the surface. With several tons of load on the fork, the braking distance is longer. An Anti-lock Braking System(ABS) for the truck control system is needed concerning the safety of the operator and people surrounding the truck. The warehouse truck braking is realized by controlling the motor torque. In order to control the torque, the truck wheel slip ratio is needed. With an accurate slip ratio, the control system will have accurate information regarding the vehicle status. To calculate the slip ratio, both the vehicle speed and wheel speed is needed. The wheel speed is derived from the motor speed. The vehicle speed is the challenge of this project. For normal passenger vehicles, sensors are installed on the trailer wheel where no slip occurs. In this case, the requirement is to use a lower number of sensors. There are two reasons of this requirement. It reduces the installation complexity and the cost of the control system. According to the literature study, a sensorless ABS system is impossible realize. Without sensor, it is not possible to estimate the vehicle status. One accelerometer is used in this project. An algorithm is designed and implemented in MATLAB. This algorithm solves the problem with zero-point drifting. Additional features are also added to the algorithm. The algorithm is a self-adaptive algorithm. It operates independently of the installation position of the accelerometer, without additional sensors. The result of the experiment with real measurements is very good. Future work on how to rewrite the algorithm from MATLAB programming to C programming is suggested in the end. Methods of implementation of the algorithm are also recommended.<br>Lagertruckar är en praktisk utrustning för att lyfta och flytta gods på ett lager. Arbetssituationen för en lagertruck är komplicerad. Oljespill eller spill av vätskor i allmänhet innebär att friktionskoefficienten för golvet blir låg. En förklaring till att golvet påverkas mycket av spill är att ytan är mycket slät eftersom den vanligvis är ett obehandlat betonggolv. Med flera ton last på gaffeln kan bromssträckan bli avsevärt längre om golvet är halt. För att uppnå tillräcklig säkerhet för föraren och personer i truckens omgivning skulle ett anti-låsningssystem (ABS) för bromsfunktionen vara nödvändig. Bromsfunktionen hos lagertrucken ombesörjs genom styrning av motormomentet. För detta ändamål är det nödvändigt att känna till drivhjulets âslipâ. Om denna storhet är känd med god noggrannhet kan styrsystemet få god information om fordonets status. För att kunna bestämma drivhjulets âslipâ krävs information om såväl fordonets hastighet som drivhjulets varvtal. Drivhjulets varvatl kan bestämmas mha motorvarvtalet. Fordonets hastighet är utmaningen i detta arbete. För normala passagerarfordon installeras varvtalsgivare på ett hjul som inte har drivning, eftersom detta inte har något âslipâ. I detta fall krävs emellertid att ett lägre antal sensorer ska användas. Det finns två skäl till detta krav. För det första minskas komplexiteten av installationen och för det andra minskas kostnaden. Enligt litteraturstudien är det omöjligt att realisera ett sensorlöst ABS-system. Utan givare kan fordonets status inte bestämmas. I detta projekt används därför en accelerometer. En algoritm har tagits fram och implementerats i MATLAB. Denna algoritm löser problemet med s.k. âzero-point driftningâ. Ytterligare funktioner har också lagts till i algoritmen. Algoritmen är själv-uppdaterande. Den fungerar oberoende av positionen av acelerometern utan ytterligare sensorer. Resultatet av mätningen en mycket bra. I framtiden kan MATLAB-koden ersättas med C-kod. Metoder för implementering av algoritmen föreslås också.
13
Benchoubane, H. "Investigations into a minimal controller synthesis algorithm." Thesis, University of Bristol, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.312265.
Pełny tekst źródła
14
Kim, Kieun Mohan Chilukuri K. "Parallel hierarchical adaptive genetic algorithm for genome sequencing." Related Electronic Resource: Current Research at SU : database of SU dissertations, recent titles available full text, 2003. http://wwwlib.umi.com/cr/syr/main.
Pełny tekst źródła
15
Srivastava, Ravi K. "An Adaptive Grid Algorithm for Air Quality Modeling." NCSU, 1998. http://www.lib.ncsu.edu/theses/available/etd-19980919-174712.
Pełny tekst źródłaStreszczenie:
<p>SRIVASTAVA, RAVI K. An Adaptive Grid Algorithm for Air Quality Modeling. (Under the direction of Dr. D. Scott McRae.)The physical and chemical processes responsible for air pollution span a wide range of spatial scales. For example, there may be point sources, such as power plants that are characterized by relatively small spatial scales compared to the size of the region that may be impacted by such sources. To obtain accurate distributions of pollutants in an air quality simulation, the pertinent spatial scales can be resolved by varying the physical grid node spacing.A new dynamic adaptive grid algorithm, the Dynamic Solution Adaptive Grid Algorithm - PPM (DSAGA-PPM), is developed for use in air quality modeling. Given a fixed number of grid nodes, DSAGA-PPM distributes these nodes in response to spatial resolution requirements of the solution field and then updates the solution field based on the resulting distribution of nodes. DSAGA-PPM is implemented dynamically to resolve any evolving solution features. Tests with model problems demonstrate that DSAGA-PPM calculates advection much more accurately than the corresponding static grid algorithm (SGA-PPM) and, therefore, would assure more accurate starting concentrations for chemistry calculations. For example, after one revolution of four rotating cones, 87% of each of the cone peaks is retained using DSAGA-PPM while only 63% is retained using SGA-PPM. The root-mean-square errors in DSAGA-PPM results are about 4-5 times lower than those in the corresponding SGA-PPM results. Tests with reacting species and sources demonstrate that DSAGA-PPM provides the needed solution resolution. In simulations of a rotating and reacting conical puff, the root-mean-square errors in DSAGA-PPM results are about 4-6 times lower than those in the corresponding SGA-PPM results. In simulations of a power plant plume, the DSAGA-PPM solution reflects the early, the intermediate, and the mature stages of plume development; these stages are not seen in the corresponding SGA-PPM solution. Finally, it is demonstrated that DSAGA-PPM provides an accurate description of the ozone production resulting due to dynamic interactions between emissions from two power plants and an urban area. In general, these results reflect that DSAGA-PPM is able to provide accurate spatial and temporal resolution of rapidly changing and complex concentration fields. Performance achieved by DSAGA-PPM in model problem simulations indicates that it can provide accurate air quality modeling solutions at costs 10 times less than those incurred in obtaining equivalent static grid solutions. <P>
16
Lewis, Kemper E. "The adaptive linear programming algorithm : facilitating robust design." Thesis, Georgia Institute of Technology, 1994. http://hdl.handle.net/1853/15949.
Pełny tekst źródła
17
Bernier, Lucie 1966. "A genetic algorithm with self-adaptive niche sizing." Thesis, McGill University, 1995. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=22847.
Pełny tekst źródłaStreszczenie:
Optimization of multimodal functions is hard for traditional optimization techniques. Holland's genetic algorithm combined with the concept of niche and speciation already showed success in such difficult problems. Some implementations of this concept exist, but the effective ones all lack flexibility by requiring either previous knowledge about the function to optimize or by imposing some fixed external schedule of exploration. We present an implementation of this concept using minimum spanning trees that is compared with a previous algorithm on random choices of input parameters. Our proposal does not require any a priori knowledge about the function. Two approaches using the minimum spanning trees are studied, one of which--the biggest proportion method (BPM)--outperforms its competitor on the battery of test problems and shows its capability of automatically adapting to the function to optimize.
18
Araujo, Eriko Werbet de Oliveira. "Ajax : an adaptive join algorithm for extreme restrictions." Universidade de Fortaleza, 2008. http://dspace.unifor.br/handle/tede/79970.
Pełny tekst źródłaStreszczenie:
Made available in DSpace on 2019-03-29T23:12:42Z (GMT). No. of bitstreams: 0
Previous issue date: 2008-10-21<br>In a mobile ad hoc network (MANET), the nodes represent mobile computers in which database systems may reside. Such mobile computers (nodes) are free to move arbitrarily. In such an environment, we may have a collection of autonomous, distributed, heterogeneous and mobile databases (denoted Mobile Database Community or MDBC). Thus, each database user (in a mobile host) can access databases belonging to an MDBC through the MANET. Traditional query processing techniques fail to support the access to databases in an MDBC, since data delivery rate in such an environment becomes unpredictable and mobile hosts may suffer from limited available main memory to process some query operators (e.g., join). To react to those events, this dissertation presents an adaptive join operator, called AJAX, for processing join operations on mobile databases in an MDBC. AJAX ensures: (i) incremental production of results as soon as the data become available; (ii) progress of the query processing even when the delivery of data is blocked, and; (iii) reaction to situations of memory limitation on the execution of operator. Cost estimation and experimental results are presented to evidence that AJAX is an effective solution for processing join operation on mobile databases.
Keywords: adaptive query processing, adaptive query operators, mobile databases, distributed systems.<br>Uma Comunidade de Bancos de Dados Móveis (MDBC) representa uma coleção de bancos de dados móveis e autônomos. Em tal contexto, cada usuário de um sistema de banco de dados participante da comunidade pode acessar os outros bancos de dados através de uma infra-estrutura de comunicação sem fio. A utilização de técnicas tradicionais para processamento de consultas no acesso à banco de dados em uma MDBC tem se mostrado ineficiente devido à imprevisibilidade na taxa de acesso a bancos de dados da comunidade e a limitação de memória disponível nos dispositivos móveis para a execução de certos operadores, como a junção, por exemplo. A imprevisibilidade é provocada por quedas constantes na comunicação entre os membros de uma MDBC (cenário comum em redes sem fio) e limitação de processamento de certas unidades móveis, atrasando a entrega de tuplas. Para reagir a estes eventos, é apresentado neste trabalho um operador de junção para processamento de consultas em bancos de dados móveis, denominado AJAX. O operador proposto garante as seguintes propriedades: (i) produção incremental de resultados à medida que os dados são disponibilizados; (ii) continuidade no processamento da consulta mesmo que a entrega dos dados esteja bloqueada, e; (iii) reação a situações de limitação de memória durante a execução do operador.
Palavras-chave: processamento adaptativo de consultas, operadores adaptativos, bancos de dados móveis, sistemas distribuídos.
19
Kumar, Kuldeep, and Javier Perez-Ramirez. "Novel BICM HARQ Algorithm Based on Adaptive Modulations." International Foundation for Telemetering, 2011. http://hdl.handle.net/10150/595637.
Pełny tekst źródłaStreszczenie:
ITC/USA 2011 Conference Proceedings / The Forty-Seventh Annual International Telemetering Conference and Technical Exhibition / October 24-27, 2011 / Bally's Las Vegas, Las Vegas, Nevada<br>A novel type-II hybrid automatic repeat request (HARQ) algorithm using adaptive modulations and bit-interleaved coded modulation (BICM) is presented. The algorithm uses different optimized puncturing patterns for different transmissions of the same data packet. The proposed approach exploits mapping diversity through BICM with iterative decoding. The modulation order is changed in each transmission to keep the number of symbols transmitted constant. We present new bit error rate and frame error rate analytical results for the proposed technique showing good agreement with simulation results. We compare the throughput performance of our proposed HARQ technique with a reference HARQ technique that uses different mapping arrangements but keeps the modulation order fixed. By using optimized puncturing patterns and adaptive modulations, our method provides significantly better throughput performance over the reference HARQ method in the whole signalto- noise ratio (SNR) range, and achieves a gain of 12 dB in the medium SNR region.
20
Li, Sun, Wang Yinfeng, and Zhang Qishan. "AN ADAPTIVE SIGNAL SEARCH ALGORITHM IN GPS RECEIVER." International Foundation for Telemetering, 1998. http://hdl.handle.net/10150/607349.
Pełny tekst źródłaStreszczenie:
International Telemetering Conference Proceedings / October 26-29, 1998 / Town & Country Resort Hotel and Convention Center, San Diego, California<br>GPS signal fixed dwell and variable dwell time sequential search algorithms are compared
with probability of false alarm and detection and searching rate. An adaptive search
algorithm is proposed according to different work modes and interference or jam
circumstance, which has effectively improved signal acquiring speed and reliability.
Mathematical simulation shows its correction and feasible.
21
Kumar, Rajendra. "FAST FREQUENCY ACQUISITION VIA ADAPTIVE LEAST SQUARES ALGORITHM." International Foundation for Telemetering, 1986. http://hdl.handle.net/10150/615276.
Pełny tekst źródłaStreszczenie:
International Telemetering Conference Proceedings / October 13-16, 1986 / Riviera Hotel, Las Vegas, Nevada<br>A new least squares algorithm is proposed and investigated for fast frequency and phase acquisition of sinusoids in the presence of noise. This algorithm is a special case of more general adaptive parameter estimation techniques. The advantages of the algorithms are their conceptual simplicity, flexibility and applicability to general situations. For example, the frequency to be acquired can be time varying, and the noise can be non-gaussian, nonstationary and colored.
As the proposed algorithm can be made recursive in the number of observations, it is not necessary to have a-priori knowledge of the received signal-to-noise ratio or to specify the measurement time. This would be required for batch processing techniques, such as the Fast Fourier Transform (FFT). The proposed algorithm improves the frequency estimate on a recursive basis as more and more observations are obtained. When the algorithm is applied in real time, it has the extra advantage that the observations need not be stored. The algorithm also yields a real time confidence measure as to the accuracy of the estimator.
22
Quirk, J. J. "An adaptive grid algorithm for computational shock hydrodynamics." Thesis, Boston Spa, U.K. : British Library Document Supply Centre, 1991. http://ethos.bl.uk/OrderDetails.do?did=1&uin=uk.bl.ethos.280913.
Pełny tekst źródła
23
McClintock, Shaunna. "Soft computing : a fuzzy logic controlled genetic algorithm environment." Thesis, University of Ulster, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.268579.
Pełny tekst źródła
24
Mulgrew, Bernard. "On adaptive filter structure and performance." Thesis, University of Edinburgh, 1987. http://hdl.handle.net/1842/11865.
Pełny tekst źródła
25
Sumali, Hartono. "A New Adaptive Array of Vibration Sensors." Diss., Virginia Tech, 1997. http://hdl.handle.net/10919/30642.
Pełny tekst źródłaStreszczenie:
The sensing technique described in this dissertation produces modal coordinates for monitoring and active control of structural vibration. The sensor array is constructed from strain-sensing segments. The segment outputs are transformed into modal coordinates by a sensor gain matrix.
An adaptive algorithm for computing the sensor gain matrix with minimal knowledge of the structure's modal properties is proposed. It is shown that the sensor gain matrix is the modal matrix of the segment output correlation matrix. This modal matrix is computed using new algorithms based on Jacobi rotations. The procedure is relatively simple and can be performed gradually to keep computation requirements low.
The sensor system can also identify the mode shapes of the structure in real time using Lagrange polynomial interpolation formula.
An experiment is done with an array of piezoelectric polyvinylidene fluoride (PVDF) film segments on a beam to obtain the segment outputs. The results from the experiment are used to verify a computer simulation routine. Then a series of simulations are done to test the adaptive modal sensing algorithms. Simulation results verify that the sensor gain matrix obtained by the adaptive algorithm transforms the segment outputs into modal coordinates.<br>Ph. D.
26
Chen, Dan. "An adaptive weighting algorithm for limited dataset verification problems." Click to view the E-thesis via HKUTO, 2005. http://sunzi.lib.hku.hk/hkuto/record/B3204897X.
Pełny tekst źródła
27
Yamazato, Takaya, Iwao Sasase, and Shinsaku Mori. "A New Viterbi Algorithm with Adaptive Path Reduction Method." IEICE, 1993. http://hdl.handle.net/2237/7839.
Pełny tekst źródła
28
Asefi, Mahdi. "Classification-Based Adaptive Search Algorithm for Video Motion Estimation." Thesis, University of Waterloo, 2006. http://hdl.handle.net/10012/2864.
Pełny tekst źródłaStreszczenie:
A video sequence consists of a series of frames. In order to compress the video for efficient storage and transmission, the temporal redundancy among adjacent frames must be exploited. A frame is selected as reference frame and subsequent frames are predicted from the reference frame using a technique known as motion estimation. Real videos contain a mixture of motions with slow and fast contents. Among block matching motion estimation algorithms, the full search algorithm is known for its superiority in the performance over other matching techniques. However, this method is computationally very extensive. Several fast block matching algorithms (FBMAs) have been proposed in the literature with the aim to reduce computational costs while maintaining desired quality performance, but all these methods are considered to be sub-optimal. No fixed fast block matching algorithm can effi- ciently remove temporal redundancy of video sequences with wide motion contents. Adaptive fast block matching algorithm, called classification based adaptive search (CBAS) has been proposed. A Bayes classifier is applied to classify the motions into slow and fast categories. Accordingly, appropriate search strategy is applied for each class. The algorithm switches between different search patterns according to the content of motions within video frames. The proposed technique outperforms conventional stand-alone fast block matching methods in terms of both peak signal to noise ratio (PSNR) and computational complexity. In addition, a new hierarchical method for detecting and classifying shot boundaries in video sequences is proposed which is based on information theoretic classification (ITC). ITC relies on likelihood of class label transmission of a data point to the data points in its vicinity. ITC focuses on maximizing the global transmission of true class labels and classify the frames into classes of cuts and non-cuts. Applying the same rule, the non-cut frames are also classified into two categories of arbitrary shot frames and gradual transition frames. CBAS is applied on the proposed shot detection method to handle camera or object motions. Experimental evidence demonstrates that our method can detect shot breaks with high accuracy.
29
Spearman, William J. "An adaptive algorithm for prioritization in 802.11e wireless networks." Connect to this title online, 2008. http://etd.lib.clemson.edu/documents/1211389333/.
Pełny tekst źródła
30
Zheng, C. "High performance adaptive MIMO detection : from algorithm to implementation." Thesis, Queen's University Belfast, 2012. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.557888.
Pełny tekst źródłaStreszczenie:
Adaptive-Multiple Input Multiple Output (A-MIMO) techniques are regarded as one of the core techniques in 3G/4G wireless communication systems and beyond. One of the key challenges for A- MIMO systems is to retrieve the spatially mixed transmitted symbols at the receiver. However, only a few high performance detection algorithms have been successfully implemented to achieve real-time performance. This thesis concentrates on developing high performance adaptive modulation MIMO detection algorithms and Model Based Design (MBD) techniques that bridge the gap between detection algorithms and efficient embedded implementations. From the algorithm perspective, this work proposes a novel near-optimal low complexity detection algorithm, Real-valued Fixed-complexity Sphere Decoder (RFSD). The RFSD is derived to achieve quasi-ML decoding performance as FSD, which is the most promising low complexity high performance parallel detection algorithm in existence, but with over 70% complexity reduction. In addition, an adaptive detection algorithm is proposed. This detection algorithm alleviates the BER degradation current high performance detection algorithms experience and provides up to 46% BER improvement for small constellation dominated hybrid modulated MIMO systems. It also balances detection performance and complexity for MIMO configurations under different environments. From the implementation perspective, a Regular Choice Petri Net (RCPN) is proposed to accurately model and rapid implement the adaptive detection algorithms. The Texas Instruments l"MS320C64+ DSP-based realisations from the RCPN model demonstrate 90% reduction in run-time overhead and 10% reduction in code memory as compared to languages in existence. Furthermore, an MBD design approach is developed to convert RCPN models into embedded implementations, by creating an automated allocation method and introducing the kernel concept from streaming applications into the scheduling process. The resulting FPGA based multi-SIMD implementation achieves real time performance with at least 52.6% less hardware resource or over 65% reduction in mapping complexity as compared to conventional schemes.
31
Chan, Chok You. "Stability and robustness of adaptive pole-zero placement algorithm." Thesis, University of Canterbury. Electrical Engineering, 1987. http://hdl.handle.net/10092/6017.
Pełny tekst źródłaStreszczenie:
A computationally efficient pole-zero placement algorithm for explicit adaptive control of discrete-time plants is presented, It is effectively an implicit algorithm in the sense that the controller design stage is trivial. Although the algorithm is restricted to open-loop stable plants, it is applicable to nonminimum phase plants.
Results concerning the adaptive control of linear, time-invariant plants having purely deterministic or stochastic disturbances are given. In the deterministic case, it is shown that the adaptive control algorithm ensures that the purely deterministic disturbances are removed from the system output and that asymptotic perfect tracking is achieved. In the stochastic case, it is shown that the adaptive control algorithm leads to the required stability properties of the closed-loop system.
The robustness properties of the modified adaptive control algorithm in the presence of bounded external disturbances and unmodelled dynamics are also given. It is shown that if the modelling error is sufficiently small relative to the normalizing signals, then the algorithm ensures the boundedness of the input-output signals.
32
Chen, Dan, and 陳丹. "An adaptive weighting algorithm for limited dataset verification problems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2005. http://hub.hku.hk/bib/B3204897X.
Pełny tekst źródła
33
Nassar, George J. "Adaptive unified thinning algorithm." Thesis, 1996. http://spectrum.library.concordia.ca/6254/1/MM18421.pdf.
Pełny tekst źródła
34
"An adaptive parallel genetic algorithm." 2000. http://library.cuhk.edu.hk/record=b5890403.
Pełny tekst źródłaStreszczenie:
Chi Wai Ho, Raymond.<br>Thesis submitted in: December 1999.<br>Thesis (M.Phil.)--Chinese University of Hong Kong, 2000.<br>Includes bibliographical references (leaves 93-97).<br>Abstracts in English and Chinese.<br>Chapter Chapter 1 --- Introduction --- p.7<br>Chapter 1.1 --- Thesis Outline --- p.10<br>Chapter 1.2 --- Contribution at a Glance --- p.11<br>Chapter Chapter 2 --- Background Concept and Related Work --- p.14<br>Chapter 2.1 --- Genetic Algorithms (GAs) --- p.14<br>Chapter 2.2 --- The Nature of GAs --- p.16<br>Chapter 2.3 --- The Role of Mutation --- p.17<br>Chapter 2.4 --- The Role of Crossover --- p.18<br>Chapter 2.5 --- The Roles of the Mutation and Crossover Rates --- p.19<br>Chapter 2.6 --- Adaptation of the Mutation and Crossover Rates --- p.19<br>Chapter 2.7 --- Diversity Control --- p.21<br>Chapter 2.8 --- Coarse-grain Parallel Genetic Algorithms --- p.25<br>Chapter 2.9 --- Adaptation of Migration Period --- p.26<br>Chapter 2.10 --- Serial and Parallel GAs --- p.27<br>Chapter 2.11 --- Distributed Java Machine (DJM) --- p.28<br>Chapter 2.12 --- Clustering --- p.30<br>Chapter Chapter 3 --- Adaptation of the Mutation and Crossover Rates --- p.35<br>Chapter 3.1 --- The Probabilistic Rule-based Adaptive Model (PRAM) --- p.35<br>Chapter 3.2 --- Time Complexity --- p.37<br>Chapter 3.3 --- Storage Complexity --- p.38<br>Chapter Chapter 4 --- Diversity Control --- p.39<br>Chapter 4.1 --- Repelling --- p.39<br>Chapter 4.2 --- Implementation --- p.42<br>Chapter 4.3 --- Lazy Repelling --- p.43<br>Chapter 4.4 --- Repelling and Lazy Repelling with Deterministic Crowding --- p.43<br>Chapter 4.5 --- Comparison of Repelling and Lazy Repelling with Recent Diversity Maintenance Models in Time Complexity --- p.44<br>Chapter Chapter 5 --- An Adaptive Parallel Genetic Algorithm --- p.46<br>Chapter 5.1 --- A Steady-State Genetic Algorithm --- p.46<br>Chapter 5.2 --- An Adaptive Parallel Genetic Algorithm (aPGA) --- p.47<br>Chapter 5.3 --- An Adaptive Parallel Genetic Algorithm for Clustering --- p.48<br>Chapter 5.4 --- Implementation --- p.48<br>Chapter 5.5 --- Time Complexity --- p.51<br>Chapter Chapter 6 --- Performance Evaluation of PRAM --- p.52<br>Chapter 6.1 --- Solution Quality --- p.58<br>Chapter 6.2 --- Efficiency --- p.60<br>Chapter 6.3 --- Discussion --- p.62<br>Chapter Chapter 7 --- Performance Evaluation of Repelling --- p.66<br>Chapter 7.1 --- Performance Comparison of Repelling and Lazy Repelling with Deterministic Crowding --- p.70<br>Chapter 7.2 --- Performance Comparison with Recent Diversity Maintenance Models --- p.73<br>Chapter 7.3 --- Performance Comparison with Serial and Parallel Gas --- p.75<br>Chapter Chapter 8 --- Performance Evaluation of aPGA --- p.78<br>Chapter 8.1 --- Scalability of Different Dimensionalities --- p.78<br>Chapter 8.2 --- Speedup of Schwefel's function --- p.83<br>Chapter 8.3 --- Solution Quality of Clustering Problems --- p.87<br>Chapter 8.4 --- Speedup of The Clustering Problem --- p.89<br>Chapter Chapter 9 --- Conclusion --- p.91
35
Gu, Yu-Jia, and 古祐嘉. "Adaptive K-Nearest Neighbor Algorithm." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/35887089581319797969.
Pełny tekst źródłaStreszczenie:
碩士<br>元智大學<br>資訊管理學系<br>97<br>The K-nearest-neighbor algorithm traditionally predicts the class of a record based on the decision from the K nearest neighbors of the record, for a fixed K value. However, recent studies showed that using different K values for different records could improve the prediction accuracy. This study integrates Fuzzy C-means algorithm to assist determining a proper K value for each record in a local KNN algorithm. Performance results show this method outperforms the traditional KNN in term of prediction accuracy.
36
Wang, Te-P., and 王德丕. "Intelligent Adaptive Notch Filtering Algorithm." Thesis, 1994. http://ndltd.ncl.edu.tw/handle/47341183095341938111.
Pełny tekst źródła
37
Wu, Chia-Ming, and 吳家鳴. "Adaptive Polygon Predictive Search Algorithm." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/72835802202453533158.
Pełny tekst źródłaStreszczenie:
碩士<br>國立屏東商業技術學院<br>資訊工程系(所)<br>101<br>Motion estimation has been the most key role on video encoding. It is usually applied to block matching algorithm for choosing the best motion vector. The two adjacent images are searched to find the displacement of the same object in the video image. Many fast motion vector block matching algorithms are proposed, and they achieve the efficiency of motion compensation and video compression. In our paper, Adaptive Polygon Predictive Search Algorithm (APPS) that based on ARPS、CS、OctaS and PS is proposed. The experimental results show that the PSNR of the proposed method is better than that of other block matching methods on all kinds of video.
38
Lu, Jinn, and 呂晉. "Adaptive Algorithm in Group Testing." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/m37836.
Pełny tekst źródłaStreszczenie:
碩士<br>國立交通大學<br>應用數學系所<br>106<br>In classical group testing, one is given a population N which contains some defective items inside. A group test (pool) is a test on a subset of N. A test is negative if the testing pool contains no defective items and the test is positive if the pool contains at least one defective item but we don’t know which one.
Group Testing is a search methodology. The goal is to use less tests to find all defectives. Mainly, to minimize the number of tests in worst case situation. Formally, we let M(d,n) denote the minimum number of tests if |N| = n and d is the number of defectives. The algorithms designed are then applying to minimize M(d,n). Two basic algorithms are adaptive and non-adaptive algorithms.
The tests designed in an adaptive algorithm may depend on the outcome of previous tests but in a non-adaptive algorithm all tests are carried out simultaneously. Therefore, in general, an adaptive algorithm takes less tests in determining all the defectives.
In this thesis, our study focuses on estimating M(d,n) by using the adaptive algorithms. As a consequence, we further improve the well-known generalized splitting algorithm by Frank K. Hwang. For some pairs (d,n) we are able to determine M(d; n) and for general pairs (d,n) we can close the gap between the number of tests we need and the information lower bound ⌈log_2 C(n,d))⌉.
39
Kuo, Te-Jun, and 郭德潤. "Adaptive Spatial-Temporal De-interlacing Algorithm." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/84252278917659417143.
Pełny tekst źródłaStreszczenie:
碩士<br>國立東華大學<br>電機工程學系<br>94<br>Abstract
The interlaced scanning process technique is widely applied in current TV systems to reduce both of the bandwidth requirement and the large area flicker. However, the interlaced scanning produces line flicker and other artificial effects. In order to provide high vision quality image for the display of the multimedia computer and digital television, the de-interlacing algorithm is proposed for converting the interlaced signals to the progressive signals.
In this thesis, a simple de-interlacing algorithm which combines the spatial and temporal information to interpolate the missing pixels is presented. First of all, the missing pixels are interpolated by the spatial information from the previous field, this method is also called Weave. Afterwards, the prediction errors between the interpolated and the original pixels are refined by the Spatio-Temporal Edge-Based Median Filtering algorithm. By the proposed algorithm, the missing pixels can be interpolated with less artificial effects.
40
Yang, Jie-Sheng, and 楊傑勝. "Adaptive Clustering Algorithm and its Application." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/10713096768065362944.
Pełny tekst źródłaStreszczenie:
碩士<br>國立成功大學<br>資訊工程研究所<br>89<br>Clustering methods have been used extensively in computer vision and pattern recognition. But common use clustering algorithm (like Fuzzy C-Means, Possibilistic C-Means) can''t gain satisfactorily result of every problems. Therefore try at this thesis to hand in an adaptive clustering algorithm, would like to aim at the different data distribution to find out the suitable cluster centers.
With the increasing of information, the number of documents also increasing very fast. People don’t want to spend much time to read every document to gain the information what they want. There must be an efficient method to find out the information what they want. Clustering algorithm can be used to solve the question above. Using the clustering algorithm, we can find out the prototype document in each cluster. According to the result of using clustering algorithm to analysis the data, we also can find out documents that related with the prototype document. In this thesis, we try to apply our adaptive clustering algorithm at document clustering.
英文摘要 ii
誌 謝 iii
目錄 iv
表目錄 vi
圖目錄 vii
第一章 緒論 1
1.1 研究動機 1
1.2 研究目的 2
1.3 研究方法簡介 3
1.4 章節簡介 4
第二章 文獻回顧 5
2.1 分割式聚類演算法 (Partitional Clustering Algorithm) 5
2.2 階層式聚類演算法 (Hierarchical Clustering Algorithm) 8
2.3 綜合分析 11
第三章 研究方法 13
3.1 基本定義和運算 13
3.1.1 歐幾里德距離 13
3.1.2 資料點權重 14
3.2 適應性聚類演算法 17
3.3 範例 20
第四章 實驗方法 23
4.1 二維向量空間實驗資料集 23
4.2 文件聚類應用資料集概述 23
4.2.1 文件 (Documents) 24
4.2.2 檔案格式 (File Format) 24
4.2.3 文件內部標示 25
4.2.4 類別 (Categories) 28
4.3 實驗設計 30
4.3.1 常用字去除 30
4.3.2 字根還原 31
4.3.3 特徵字選取 (Feature Selection) 31
4.3.4 文件表示方式 32
4.3.4 文件聚類應用實驗流程 32
4.3.5 正確率評估 33
4.4 實驗結果 35
實驗一 35
實驗二 40
實驗三 43
實驗四 47
實驗五 51
實驗六 52
第五章 討論與未來研究方向 53
5.1 討論 53
5.2 未來研究方向 53
參考文獻 55
附錄一 Stop-List 57
41
Wu, Kuang-Jung, and 吳光榮. "Adaptive algorithm for environmental noise cancellation." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/26688066809698829111.
Pełny tekst źródłaStreszczenie:
碩士<br>國立陽明大學<br>醫學工程研究所<br>90<br>Noise exists around the environment. It has effects on humans’ physiological and psychological functions. The noise decay and cancellation has attracted peoples’ researches and investigations for a long time. The literatures have demonstrated that many algorithms have their cancellation effects on special or low frequency noise. However, most algorithms only have limited function for complex noise, and they are then unsuitable for real applications.
The study will investigate different methods and algorithms for the cancellation of different noise, including ventilated duct noise, fan noise, vehicular engine noise…… We focus our effort on the investigation about the algorithms of active noise control. In contrary to passive noise control, active noise control generates an anti-acoustic sound, and superposes sound to the noise for achieve the noise cancellation. It is especially effective for low frequency noise. We will build several algorithm models, and test the model performances by preset noise conditions. The model performances will be simulated, analyzed and compared that will result the basic index for real applications. We first study the different algorithms cited by the literatures, and select the suitable algorithms for model simulation. The simulation will compare the performance of different algorithm through their convergent time and signal-to-noise increases. The simulation will be executed on a personal computer, and the program will be developed using SIMULINK 4.0 of MATLAB 6.0.
42
WU, YI-JIE, and 鄔義傑. "Image coding using adaptive blocking algorithm." Thesis, 1989. http://ndltd.ncl.edu.tw/handle/84345360884472152784.
Pełny tekst źródła
43
Lin, Chien-Jen, and 林建任. "Adaptive Handover Algorithm in Cellular Network." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/56030491451162608956.
Pełny tekst źródłaStreszczenie:
碩士<br>國立臺灣大學<br>電機工程學研究所<br>90<br>With the mobile subscriber increasing, the cellular system will increase the amount of cells in the same geographic area. That is, the coverage of a cell will be smaller, and the handoff occurs more frequently. If handoff occurs slowly or happens frequently, the quality of service may degenerate below an acceptable level. Furthermore, the voice call may be dropout or the packet data will be lost. In order to reduce the network load due to switching cell, handover algorithms have to be
designed to minimize the number of handoffs. Conventional handoff algorithms use the threshold values and/or hyteresis margin to improve the performance.
However, the issues of handover in cellular communications have several components including handover initiation and traffic load balance (availability of channel resources). Often researchers consider these issues separately, but overall
performance should be determined by all. In this thesis, therefore, we adapted a new adaptive handover algorithm. Dwell time factor, cell load factor and a control timer are broached to the decision of handover. This algorithm based on these factors adjust hysteresis margin of each mobile station to make handover decisions more accurately and share the traffic loads of cells. By these factors, we reduce unnecessary handoff
rate and forced terminated probability successfully .
44
Kai-ShiuanShih and 施凱軒. "Intelligent Algorithm Based Adaptive Fuzzy Controllers." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/60731302231609837595.
Pełny tekst źródła
45
"An adaptive distributed Dijkstra shortest path algorithm." Massachusetts Institute of Technology, Laboratory for Information and Decision Systems], 1988. http://hdl.handle.net/1721.1/3061.
Pełny tekst źródła
46
Zadeh, Seyed Ali Gorji. "An adaptive M-algorithm based convolutional decoder." Thesis, 2005. http://spectrum.library.concordia.ca/8470/1/MR04371.pdf.
Pełny tekst źródłaStreszczenie:
The Viterbi algorithm is one of the most popular convolutional decoders. This algorithm suffers from the high complexity in the decoding of the long constraint length codes. The M-algorithm is a simplified Viterbi algorithm and it is practical for the decoding of the long constraint length codes but it suffers from catastrophic error caused by the correct path loss in the algorithm. In this thesis we propose two different ways of the correct path recovery based on M-algorithm convolutional decoder. The first method is called Ancestor Based Survivor Decision in M-algorithm Convolutional Decoder. We propose a survivor decision not only based on the path metric but also based on the path ancestor metric. This algorithm has been designed for the systems with an abrupt noise. Simulation results for the Additive White Gaussian Noise (AWGN) channel will show slightly improved error performance in some cases since the AWGN does not act as abrupt noise. For the AWGN channels we propose another method which is called Adaptive M-algorithm Based Convolutional Decoder. In this method, we suggest using small number of survivors for most of the decoding attempts and we use higher number of survivors only in case of error decoding. The Cyclic Redundancy Check (CRC) error detection code is used to detect if the frame is an erroneous frame. Monte-Carlo simulation for the AWGN channel shows that in most of the cases the error performance of the proposed algorithm outperforms the Viterbi algorithm or the conventional M-algorithm error performance.
47
Hsu, Yung-Sheng, and 許永昇. "Adaptive Line Search Algorithm for Packet Classification." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/23376556654576611321.
Pełny tekst źródłaStreszczenie:
碩士<br>國立交通大學<br>電信工程系<br>90<br>Fast packet classification has become a key component to enable additional services in Internet applications. What these services have in common is their requirement for recognizing flows. Basically packet classification can be considered as a process looking for the best matching filter in a filter set. Because of the Internet protocol layers, packet classification is often performed for multiple fields selected from packet headers such as source and destination IP addresses, source and destination port numbers, protocol ID, and even type of service. In general, the search time and storage complexity of a packet classification depend heavily on the number of fields, lengths of fields, match criterion and the number of filters.
In this thesis, we propose two fast packet classification algorithms: Entry-pruning Line Search algorithm and Adaptive Line Search algorithm, with increasing a little storage, the average and worst case search performance can be improved obviously.
48
"An adaptive distributed algorithm for path aggregation." 2008. http://library.cuhk.edu.hk/record=b5893539.
Pełny tekst źródłaStreszczenie:
Zhang, Zhenyi.<br>Thesis (M.Phil.)--Chinese University of Hong Kong, 2008.<br>Includes bibliographical references (leaves 55-[58]).<br>Abstracts in Chinese and English.<br>Chapter 1 --- Introduction --- p.1<br>Chapter 2 --- Problem Formulation --- p.4<br>Chapter 3 --- Examples --- p.7<br>Chapter 3.1 --- Examples of Undirected Graph --- p.7<br>Chapter 3.1.1 --- Example 1: SPF Routing --- p.7<br>Chapter 3.1.2 --- Example 2: rings --- p.7<br>Chapter 3.1.3 --- Example 3: grid --- p.8<br>Chapter 3.1.4 --- Example 4: cube --- p.9<br>Chapter 3.1.5 --- Example 5: random graph X --- p.10<br>Chapter 3.1.6 --- Example 6: random graph Y --- p.10<br>Chapter 3.2 --- An Example for Directive Graph --- p.11<br>Chapter 4 --- The Framework --- p.13<br>Chapter 4.1 --- The distributed algorithm --- p.13<br>Chapter 4.2 --- The modules --- p.14<br>Chapter 4.3 --- Path control --- p.15<br>Chapter 4.4 --- The forwarding module --- p.18<br>Chapter 4.5 --- The routing module --- p.19<br>Chapter 4.5.1 --- Non-weighted Routing (NWR) --- p.19<br>Chapter 4.5.2 --- Weighted Routing (WR) --- p.20<br>Chapter 4.6 --- Packet Aggregation (PKA) --- p.21<br>Chapter 5 --- Experiments of Path Aggregation --- p.23<br>Chapter 5.1 --- System Setup --- p.24<br>Chapter 5.2 --- Experiment Results --- p.25<br>Chapter 6 --- Convergence --- p.28<br>Chapter 6.1 --- Simulation study --- p.34<br>Chapter 6.2 --- Optimality --- p.34<br>Chapter 6.3 --- Speed of Convergence --- p.37<br>Chapter 7 --- The adaptive property --- p.41<br>Chapter 7.1 --- Adapting to new links --- p.42<br>Chapter 7.2 --- Adapting to topology changing --- p.43<br>Chapter 7.3 --- Adapting to interference and congestion --- p.45<br>Chapter 7.4 --- Adapting to traffic flows --- p.45<br>Chapter 7.5 --- Adapting to capacity --- p.46<br>Chapter 8 --- Related works --- p.48<br>Chapter 8.1 --- Spanning Tree --- p.48<br>Chapter 8.2 --- Minimum Equivalent Directed Graph Problem --- p.49<br>Chapter 8.3 --- Topology Control --- p.50<br>Chapter 8.4 --- The Relationship with our problem --- p.53<br>Chapter 9 --- Conclusion --- p.54
49
CHENG, YI-HAN, and 鄭義瀚. "Adaptive Strategy Search Algorithm For Motion Estimation." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/75574169568566845156.
Pełny tekst źródłaStreszczenie:
碩士<br>國立屏東商業技術學院<br>資訊工程系(所)<br>102<br>Searching the suitable Motion Vector (MV) is an important issue in Motion Estimation (ME). In order to solve this problem Block Matching Algorithms (BMA) have been proposed. In BMA, Full Search Algorithm (FSA) is the one of most basic approach. It achieves the best video quality but also results in large amount of computation. Therefore, many fast search algorithms are suggested to decrease search points, such as Three-Step Search Algorithm (TSS), Four-step Search Algorithm (FSS) and Diamond Search Algorithm (DS) .
In this paper, Adaptive Strategy Search Algorithm (ASS) is proposed based on some fast search algorithms, such as DS and ARPS, to enhance video quality. Result shows that it can achieve higher quality with a little expense of time and search points, especially in high movement video.
50
Wu, Tsung-Ju, and 吳宗儒. "Adaptive Bandwidth-Borrowing Algorithm in WiMAX Network." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/45127572554680077149.
Pełny tekst źródłaStreszczenie:
碩士<br>國立臺灣科技大學<br>電子工程系<br>97<br>In WiMAX network, service flows with different priorities are defined. The priority of real time traffic is higher than that of non real time traffic. As bandwidth is limited, the resource must be allocated effectively to guarantee the delay time of real time traffic in WiMAX. .Besides this, the proposed algorithm must be able response quickly to prevent the sudden shortage of resource. These problems are worth studying well.
In this paper, we propose an Adaptive Bandwidth-Borrowing (ABB) algorithm. This algorithm is upgraded from the traditional bandwidth allocation protocol. When the resource assigned to the real time traffic in the current frame is insufficient, it must be increased in following frames. For this, the bandwidth allocated to the non real time traffic must be reduced simultaneously. After the allocated resource to the real time traffic is enough, the borrowed bandwidth must be returned in the next frame. The reasoning for this is “The borrowed ones must be returned sooner or later”. As a whole, the delay time in the real time traffic is reduced effectively with the mechanism. Also, the bandwidth can be allocated more effectively.