Увійти

Готові списки джерел за темами / AMP ALGORITHM / Дисертації

Дисертації з теми "AMP ALGORITHM"

Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: AMP ALGORITHM.

Автор: Grafiati

Опубліковано: 11 вересня 2023

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

Оберіть тип джерела:

Ознайомтеся з топ-50 дисертацій для дослідження на тему "AMP ALGORITHM".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.

1

Dementiev, Roman. "Algorithm engineering for large data sets : hardware, software, algorithms /." Saarbrücken : VDM-Verl. Dr. Müller, 2007. http://deposit.d-nb.de/cgi-bin/dokserv?id=3029033&prov=M&dok_var=1&dok_ext=htm.

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

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

2

Nallagandla, Shilpa. "Radix 2 division algorithm /." Available to subscribers only, 2006. http://proquest.umi.com/pqdweb?did=1251871361&sid=5&Fmt=2&clientId=1509&RQT=309&VName=PQD.

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

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

3

Jonas, Mario Ricardo Edward. "High performance computing and algorithm development: application of dataset development to algorithm parameterization." Thesis, University of the Western Cape, 2006. http://etd.uwc.ac.za/index.php?module=etd&amp.

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

Анотація:

A number of technologies exist that captures data from biological systems. In addition, several computational tools, which aim to organize the data resulting from these technologies, have been created. The ability of these tools to organize the information into biologically meaningful results, however, needs to be stringently tested. The research contained herein focuses on data produced by technology that records short Expressed Sequence Tags (EST's).

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

4

Han, Tony. "SWASAD Smith & Waterman-algorithm-specific ASIC design /." St. Lucia, Qld, 2001. http://www.library.uq.edu.au/pdfserve.php?image=thesisabs/absthe16391.pdf.

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

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

5

Alweh, Mohammad. "Robust algorithm for WiFi network /." Available to subscribers only, 2006. http://proquest.umi.com/pqdweb?did=1136091901&sid=6&Fmt=2&clientId=1509&RQT=309&VName=PQD.

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

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

6

Konda, Lakshmana Rao. "An empirical study of TJFast algorithm /." Available to subscribers only, 2006. http://proquest.umi.com/pqdweb?did=1240708321&sid=12&Fmt=2&clientId=1509&RQT=309&VName=PQD.

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

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

7

McLoone, M. P. "Generic silicon architectures for encryption algorithm." Thesis, Queen's University Belfast, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.269123.

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

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

8

Kreslins, Karlis. "A stemming algorithm for Latvian." Thesis, Loughborough University, 1996. https://dspace.lboro.ac.uk/2134/7433.

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

Анотація:

The thesis covers construction, application and evaluation of a stemming algorithm for advanced information searching and retrieval in Latvian databases. Its aim is to examine the following two questions: Is it possible to apply for Latvian a suffix removal algorithm originally designed for English? Can stemming in Latvian produce the same or better information retrieval results than manual truncation? In order to achieve these aims, the role and importance of automatic word conflation both for document indexing and information retrieval are characterised. A review of literature, which analyzes and evaluates different types of stemming techniques and retrospective development of stemming algorithms, justifies the necessity to apply this advanced IR method also for Latvian. Comparative analysis of morphological structure both for English and Latvian language determined the selection of Porter's suffix removal algorithm as a basis for the Latvian sternmer. An extensive list of Latvian stopwords including conjunctions, particles and adverbs, was designed and added to the initial sternmer in order to eliminate insignificant words from further processing. A number of specific modifications and changes related to the Latvian language were carried out to the structure and rules of the original stemming algorithm. Analysis of word stemming based on Latvian electronic dictionary and Latvian text fragments confirmed that the suffix removal technique can be successfully applied also to Latvian language. An evaluation study of user search statements revealed that the stemming algorithm to a certain extent can improve effectiveness of information retrieval.

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

9

Kassapakis, E. G. "Studies on a predictive control algorithm." Thesis, University of Reading, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.360726.

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

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

10

Hounsinou, Sena Gladys N. "Hardware realization of speech-time warping algorithm /." Available to subscribers only, 2008. http://proquest.umi.com/pqdweb?did=1650508391&sid=1&Fmt=2&clientId=1509&RQT=309&VName=PQD.

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

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

11

Zhi, Ruoyu. "A Drift Eliminated Attitude & Position Estimation Algorithm In 3D." ScholarWorks @ UVM, 2016. http://scholarworks.uvm.edu/graddis/450.

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

Анотація:

Inertial wearable sensors constitute a booming industry. They are self contained, low powered and highly miniaturized. They allow for remote or self monitoring of health-related parameters. When used to obtain 3-D position, velocity and orientation information, research has shown that it is possible to draw conclusion about issues such as fall risk, Parkinson disease and gait assessment. A key issues in extracting information from accelerometers and gyroscopes is the fusion of their noisy data to allow accurate assessment of the disease. This, so far, is an unsolved problem. Typically, a Kalman filter or its nonlinear, non-Gaussian version are implemented for estimating attitude â?? which in turn is critical for position estimation. However, sampling rates and large state vectors required make them unacceptable for the limited-capacity batteries of low-cost wearable sensors. The low-computation cost complementary filter has recently been re-emerging as the algorithm for attitude estimation. We employ it with a heuristic drift elimination method that is shown to remove, almost entirely, the drift caused by the gyroscope and hence generate a fairly accurate attitude and drift-eliminated position estimate. Inertial sensor data is obtained from the 10-axis SP-10C sensor, attached to a wearable insole that is inserted in the shoe. Data is obtained from walking in a structured indoor environment in Votey Hall.

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

12

Allam, Vineel Reddy. "A novel recovery algorithm for distributed computing environment /." Available to subscribers only, 2008. http://proquest.umi.com/pqdweb?did=1594491041&sid=2&Fmt=2&clientId=1509&RQT=309&VName=PQD.

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

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

13

Chirra, Raja Kishore. "A new efficient recovery algorithm for cluster federations /." Available to subscribers only, 2007. http://proquest.umi.com/pqdweb?did=1404355011&sid=8&Fmt=2&clientId=1509&RQT=309&VName=PQD.

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

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

14

Lynch, Michael Andrew. "Algorithm to layout (ATL) systems for VLSI design." Thesis, University of Newcastle Upon Tyne, 1986. http://hdl.handle.net/10443/2060.

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

Анотація:

The complexities involved in custom VLSI design together with the failure of CAD techniques to keep pace with advances in the fabrication technology have resulted in a design bottleneck. Powerful tools are required to exploit the processing potential offered by the densities now available. Describing a system in a high level algorithmic notation makes writing, understanding, modification, and verification of a design description easier. It also removes some of the emphasis on the physical issues of VLSI design, and focus attention on formulating a correct and well structured design. This thesis examines how current trends in CAD techniques might influence the evolution of advanced Algorithm To Layout (ATL) systems. The envisaged features of an example system are specified. Particular attention is given to the implementation of one its features COPTS (Compilation Of Occam Programs To Schematics). COPTS is capable of generating schematic diagrams from which an actual layout can be derived. It takes a description written in a subset of Occam and generates a high level schematic diagram depicting its realisation as a VLSI system. This diagram provides the designer with feedback on the relative placement and interconnection of the operators used in the source code. It also gives a visual representation of the parallelism defined in the Occam description. Such diagrams are a valuable aid in documenting the implementation of a design. Occam has also been selected as the input to the design system that COPTS is a feature of. The choice of Occam was made on the assumption that the most appropriate algorithmic notation for such a design system will be a suitable high level programming language. This is in contrast to current automated VLSI design systems, which typically use a hardware des~ription language for input. These special purpose languages currently concentrate on handling structural/behavioural information and have limited ability to express algorithms. Using a language such as Occam allows a designer to write a behavioural description which can be compiled and executed as a simulator, or prototype, of the system. The programmability introduced into the design process enables designers to concentrate on a design's underlying algorithm. The choice of this algorithm is the most crucial decision since it determines the performance and area of the silicon implementation. The thesis is divided into four sections, each of several chapters. The first section considers VLSI design complexity, compares the expert systems and silicon compilation approaches to tackling it, and examines its parallels with software complexity. The second section reviews the advantages of using a conventional programming language for VLSI system descriptions. A number of alternative high level programming languages are considered for application in VLSI design. The third section defines the overall ATL system COPTS is envisaged to be part of, and considers the schematic representation of Occam programs. The final section presents a summary of the overall project and suggestions for future work on realising the full ATL system.

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

15

Martins, Wellington Santos. "Algorithm performance on a general purpose parallel computer." Thesis, University of East Anglia, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.296870.

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

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

16

Jiang, Lianjun. "Preconditioning the limited-memory BFGS algorithm." Diss., Connect to online resource, 2006. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3239445.

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

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

17

Kumar, Nandeesh. "Automated task allocation for network processors using genetic algorithm /." Available to subscribers only, 2007. http://proquest.umi.com/pqdweb?did=1324381471&sid=4&Fmt=2&clientId=1509&RQT=309&VName=PQD.

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

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

18

Scott, Kara E. "Evaluating an improved algorithm for segregating large geospatial data /." Available to subscribers only, 2007. http://proquest.umi.com/pqdweb?did=1324372541&sid=24&Fmt=2&clientId=1509&RQT=309&VName=PQD.

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

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

19

Mamillapalli, Sai Praneeth. "A new recovery algorithm for a distributed computing environment /." Available to subscribers only, 2007. http://proquest.umi.com/pqdweb?did=1456296501&sid=7&Fmt=2&clientId=1509&RQT=309&VName=PQD.

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

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

20

Anderson, Travis M. "Motion detection algorithm based on the common housefly eye." Laramie, Wyo. : University of Wyoming, 2007. http://proquest.umi.com/pqdweb?did=1400965531&sid=1&Fmt=2&clientId=18949&RQT=309&VName=PQD.

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

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

21

Momen, Faisal. "OPTIMIZATION OF THE GENETIC ALGORITHM IN THE SHEHERAZADE WARGAMING SIMULATOR." Diss., The University of Arizona, 2011. http://hdl.handle.net/10150/203449.

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

Анотація:

Stability and Support Operations (SASO) continue to play an important role in modern military exercises. The Sheherazade simulation system was designed to facilitate SASO-type mission planning exercises by rapidly generating and evaluating hundreds of thousands of alternative courses-of-action (COAs). The system is comprised of a coevolution engine that employs a Genetic Algorithm (GA) to generate the COAs for each side in a multi-sided conflict and a wargamer that models various subjective factors such as regional attitudes and faction animosities to evaluate their effectiveness. This dissertation extends earlier work on Sheherazade, in the following ways: 1) The GA and coevolution framework have been parallelized for improved performance on current multi-core platforms 2) the effects of various algorithm parameters, both general and specific to Sheherazade, were analyzed 3) alternative search techniques reflecting recent developments in the field have been evaluated for their capacity to improve the quality of the results.

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

22

Guthikonda, Haritha. "A NEW FAIR QUEUEING ALGORITHM FOR ROUTING IN STATIC NETWORKS." Available to subscribers only, 2009. http://proquest.umi.com/pqdweb?did=1967969541&sid=1&Fmt=2&clientId=1509&RQT=309&VName=PQD.

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

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

23

Thilakawardana, Duminda. "An efficient genetic algorithm application in assembly line balancing." Thesis, University of Surrey, 2002. http://epubs.surrey.ac.uk/844283/.

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

Анотація:

The main achievement of this research is the development of a genetic algorithm model as a solution approach to the single model assembly line balancing problem (SMALBP), considered a difficult combinatorial optimisation problem. This is accomplished by developing a genetic algorithm with a new fitness function and genetic operators. The novel fitness function is based on a new front-loading concept capable of yielding substantially improved and sometimes optimum solutions for the SMALBP. The new genetic operators include a modified selection technique, moving crossover point technique, rank positional weight based repair method and dynamic mutation technique. The moving crossover point technique addressed the issue of propagating best attributes from parents to offspring and also supports the forward loading process. The new selection technique was developed by modifying the original rank-based selection scheme. This eliminates the high selective pressure associate with the original rank-based technique. Furthermore, the modified selection technique allows the algorithm to run long enough, if required, without premature convergence and this feature is very useful for balancing more complex real world problems. The repair technique included in this model repairs a higher proportion of distorted chromosomes after crossover than previous methods. Moreover, a third innovative feature, a moving adjacent mutation technique, strengthens the forward loading procedure and accelerates convergence. The performance of the front-loading fitness function currently outperforms the published fitness functions and fifty-four published test cases generated from sixteen precedence networks are used to assess the overall performance of the model. Encompassing the new genetic algorithm concepts, forty-four test problems (81%) achieved the best solutions obtained by published techniques and twenty-four problems (44%) produced better results than the benchmark Hoffmann precedence procedure, the closest non-genetic algorithm method. The superiority of the genetic model over other heuristics is identified in this research and future developments of this genetic algorithm application for assembly line balancing problems is evident.

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

24

CUNHA, FERNANDO BRANDAO LOBATO. "ADAPTATION ALGORITHM OF IIR." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 1991. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=9838@1.

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

Анотація:

CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO
A partir da forma geral do algoritmo de adaptação, é proposto o uso de mais uma variável de projeto, denominada janela. Esta janela tem por objetivo melhorar as características de convergência de algoritmos, cujos parâmetros são partes de estruturas IIR. A introdução das janelas é justificada heuristicamente e seu desempenho é avaliado por meio de diversas simulações de identificação de sistemas. Os resultados obtidos indicam aumentos significativos na velocidade de convergência (cerca de uma ordem de grandeza mais rápido do que os algoritmos atualmente mais usados), na precisão das estimativas dos parâmetros do problema e na robustez dos novos algoritmos (menor número de pólos instáveis durante a adaptação). Estes resultados foram observados em ambientes estacionários e não estacionários, com e sem ruído de medida e com ordem de identificação suficiente ou não.
From the adaptation algorithm general form it is proposed the usage of another design variable, called Window. The goal of this Window is to improve the convergence characteristics of algorithms whose parameters are parts of IIR Structures. The introduction of the Window is heuristically justified and its performance is eventuated by several system identification simulations. The results achieved suggest significant increase in the convergence speed (about one order of magnitude faster than the currently most used algorithms), in the parameter estimation precision and in the new algorithm robusteness (fewer unstable poles during adaptation). These results were observed in sationary and non-stationary environments, with and without measurement noise and with sufficient identification order or not.

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

25

MARTINS, ROBERTO CINTRA. "SHOR S FACTORING ALGORITHM." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2018. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=35511@1.

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

Анотація:

PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO
A dissertação apresenta detalhadamente o algoritmo de fatoração de Shor, tanto em termos de sua execução passo a passo como mediante sua representação em forma de circuito, abordando aspectos tanto de sua parte clássica como de sua parte quântica. Inicialmente são apresentados aspectos de teoria dos números indispensáveis para a compreensão do algoritmo e em seguida são desenvolvidos conceitos e propriedades de mecânica quântica e de informação quântica pertinentes. Em atenção ao caráter eminentemente estocástico do algoritmo realiza-se um estudo de sua fonte estocástica e demonstram-se os principais teoremas que embasam a avaliação de sua probabilidade de sucesso. Desenvolvem-se exemplos de simulação clássica do algoritmo. Finalmente, a eficiência do algoritmo de fatoração de Shor é comparada com a de algoritmos clássicos.
The dissertation presents in detail Shor s factoring algorithm, including its execution step by step and its representation in the form of a circuit, addressing aspects of both its classical and its quantum parts. Aspects of number theory indispensable to understand the algorithm are presented, followed by a development of concepts and properties of quantum mechanics and quantum information. Considering the eminently stochastic character of the algorithm, a study of its stochastic source is carried out and the main theorems that support the evaluation of its probability of success are proved. Examples of classical simulation of the algorithm are developed. Finally, the efficiency of Shor s factoring algorithm is compared with that of classical algorithms.

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

26

Nayestani, Naynaz. "A process comparison algorithm /." Thesis, McGill University, 2002. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=79252.

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

Анотація:

The purpose of this research was to design a method for the detailed comparison of processes. People already do process measurement and compare these measurements to internal or regulatory standards. The innovation in this thesis is the development of an algorithm for process comparison that accommodates any process, responds to any kind of semantic junction in the process model, deals with uncertain process data, and compares all or part of a process. This is done by the activity-by-activity comparison of data and measurements from an actual process to a model of a process.
IDEF3 diagrams were used for process modeling, a modified PERT network technique was used for process comparison, and the technique incorporated fuzzy data and metric comparison.
Solutions of practical problems showed that the algorithm does not have any limitations for process comparison. While the test data were for time performance only, other metrics can easily be accommodated, such as cost, quality, human resource or energy.

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

27

Singh, Payal. "Accounting for spatial variations using spatial autocorrelation and fuzzy classifiers algorithm /." Available to subscribers only, 2006. http://proquest.umi.com/pqdweb?did=1203554991&sid=2&Fmt=2&clientId=1509&RQT=309&VName=PQD.

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

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

28

Vemuri, Aditya. "A high performance non-blocking checkpointing/recovery algorithm for ring networks /." Available to subscribers only, 2006. http://proquest.umi.com/pqdweb?did=1203587991&sid=8&Fmt=2&clientId=1509&RQT=309&VName=PQD.

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

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

29

Dontha, Priyadharshini. "A modification to Yang's asynchronous recovery algorithm with direct checkpoint determination /." Available to subscribers only, 2006. http://proquest.umi.com/pqdweb?did=1203588011&sid=23&Fmt=2&clientId=1509&RQT=309&VName=PQD.

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

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

30

Jupally, Vamshi Krishna Rao. "A novel recovery algorithm for concurrent failures in distributed computing environment /." Available to subscribers only, 2008. http://proquest.umi.com/pqdweb?did=1594491061&sid=13&Fmt=2&clientId=1509&RQT=309&VName=PQD.

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

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

31

Patsias, Kyriakos. "A HIGH PERFORMANCE GIBBS-SAMPLING ALGORITHM FOR ITEM RESPONSE THEORY MODELS." Available to subscribers only, 2009. http://proquest.umi.com/pqdweb?did=1796121011&sid=3&Fmt=2&clientId=1509&RQT=309&VName=PQD.

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

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

32

Khudhair, Ali Dheyaa. "A Simplified Routing Algorithm for Energy Efficiency in Wireless Sensor Networks." Available to subscribers only, 2009. http://proquest.umi.com/pqdweb?did=1885751071&sid=8&Fmt=2&clientId=1509&RQT=309&VName=PQD.

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

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

33

Ndungu, Edward Nganga. "A stable pre-whitened NLMS algorithm for acoustic echo cancellation." Thesis, Loughborough University, 1997. https://dspace.lboro.ac.uk/2134/14117.

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

Анотація:

This thesis is on a new method for improving the convergence speed of the normalised least mean square (NLMS) algorithm when the input is a coloured signal, such as speech, that can be decorrelated using linear prediction. The proposed method gives a significant improvement in the convergence speed and requires very little additional computation in terms of arithmetic operations and memory space. It is also very easy to implement. An important aspect of the proposed method is its inherent stability irrespective of the order of the prediction-error filter or the manner in which it is adapted. This allows the proposed method to be used without any restrictions beyond those of the conventional NLMS algorithm. Following the stability analysis, a further improvement to the basic proposed method is suggested. This improvement is restricted to the cases where the input signal is decorrelated by a prediction-error filter of up to order two. The proposed method finds immediate application in acoustic echo cancellation in hands-free telephones where the impulse response of the system (echo path) to be identified is very long and the identification has to be done in real time. Such an application requires an algorithm with low computational complexity and a fast rate of convergence. In general, the proposed method can be used where the input coloured signal can be decorrelated using linear prediction.

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

34

Murnion, Shane D. "Neural and genetic algorithm applications in GIS and remote sensing." Thesis, Queen's University Belfast, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.337024.

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

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

35

Farsi, M. "Simplified self-tuning algorithm and model reduction for robot control." Thesis, University of Newcastle Upon Tyne, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.373053.

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

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

36

Cutress, Ian James. "Algorithm development in computational electrochemistry." Thesis, University of Oxford, 2011. http://ora.ox.ac.uk/objects/uuid:a1cfb510-3656-4396-84b3-8e67b88d3d2f.

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

Анотація:

This thesis presents algorithm development in computational chemistry, and applies new computer science concepts to voltammetric simulation. To begin, this thesis discusses why algorithm development is necessary, and inherent problems found in commercial simulation solvers. As a result of this discussion, this thesis describes the need for simulators to keep abreast of recent computational developments. Algorithm development in this thesis is taken through stages. Chapter 3 applies known theory relating to the stripping voltammetry at a macroelectrode to the diffusional model of a microdisk, using finite difference and alternating direction implicit simulation techniques. Chapter 4 introduces the concept of parallel computing, and how computational hardware has developed recently to take advantage of out-of-order calculations, by processing them in parallel to reduce simulation time. The novel area of graphics card simulation for highly parallel algorithms is also explained in detail. Chapter 5 discusses the adaptation of voltammetric finite difference algorithms to a purely parallel format for simulation by explicit solution. Through explicit solution, finite difference algorithms are applied to electrode geometries which necessitate a three-dimensional solution – elliptical electrodes; square, rectangular, and microband electrodes; and dual microdisk electrodes in collector-generator mode. Chapter 6 introduces 'Random Walk' simulations, whereby individual particles in the simulation are modelled and their trajectories over time are calculated. The random walk technique in this thesis is improved for pure three-dimensional diffusion, and adapted to graphics cards, allowing up to a factor 4000 increase in speed over previous computational methods. This method is adapted to various systems of low concentration confined voltammetry (chapter 6.4) and single molecule detection, ultra low concentration cyclic voltammetry (chapter 6.5), and underpotential deposition of thallium on mobile silver nanoparticles (chapter 6.6). Overall, this thesis presents, and applies, a series of algorithm development concepts in computational electrochemistry.

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

37

Lambert, Geoffrey C. "The development of a unique algorithm for the solution of HVAC system design optimisation problems." Thesis, University of Liverpool, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.359199.

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

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

38

Köpf, Christian Rudolf. "Meta-learning: strategies, implementations, and evaluations for algorithm selection /." Berlin : Aka, 2006. http://deposit.ddb.de/cgi-bin/dokserv?id=2745748&prov=M&dok_var=1&dok_ext=htm.

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

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

39

CORDEIRO, JOAQUIM PEDRO DE V. "NETWORK SIMPLEX, ALGORITHM E IMPLEMENTATION." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2008. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=13219@1.

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

Анотація:

PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO
COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR
Este trabalho busca desenvolver o método Simplex para Redes na solução de problemas de Fluxo de Custo Mínimo. Este método consiste em uma adaptação do método Simplex primal em que são exploradas as características específicas da rede subjacente ao problema ao se buscar a solução ótima em um número finito de árvores geradoras. A árvore geradora ótima será obtida iterativamente através de sucessivas melhorias na estrutura de cada árvore formada. A maior eficiência do Simplex para Redes se dá tanto no menor número de iterações necessárias para se atingir o ótimo, quanto na maior velocidade destas iterações, trata-se, portanto, de um método bastante poderoso na resolução de problemas de Fluxo de Custo Mínimo. Serão, também, abordados aspectos práticos da implementação do algoritmo além da aplicação deste algoritmo implementado em VBA (Visual Basic for Applications) em um problema prático a título de exemplificação.
The current work intends to develop a Network Simplex Method for solving Minimum Cost Flow problems. Such method consists of a primal Simplex Method adaptation in which specific characteristics of the network underlying the problem are investigated by searching for the optimal solution within a finite number of spanning trees. The optimal spanning tree is iteratively obtained through successive structure improvements in each formed tree. The higher efficiency of Network Simplex lies both in fewer iterations necessary to achieve the optimum and in the higher speed of these iterations. Therefore, it is a powerful method for solving Minimum Cost Flow Problems. Practical aspects of implementing the algorithm will be discussed, as well as the algorithm´s implementation in VBA (Visual Basic for Applications) through a practical instance.

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

40

Kantheti, Vinod. "Design of an efficient checkpointing-recovery algorithm for distributed cluster computing environment /." Available to subscribers only, 2005. http://proquest.umi.com/pqdweb?did=1079672401&sid=2&Fmt=2&clientId=1509&RQT=309&VName=PQD.

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

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

41

Taduri, Manoj Reddy. "A low-overhead non-block check pointing algorithm for distributed computing environment /." Available to subscribers only, 2008. http://proquest.umi.com/pqdweb?did=1650513331&sid=4&Fmt=2&clientId=1509&RQT=309&VName=PQD.

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

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

42

Asefi, Mahdi. "Classification-Based Adaptive Search Algorithm for Video Motion Estimation." Thesis, University of Waterloo, 2006. http://hdl.handle.net/10012/2864.

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

Анотація:

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.

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

43

Mantas, P. "A directed search algorithm for secondary state assignment of sequential machines." Thesis, Cranfield University, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.276370.

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

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

44

Usta, Ö. "A power based digital algorithm for the protection of embedded generators." Thesis, University of Bath, 1992. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.251234.

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

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

45

Nguyen, Diep Ngoc. "RESOURCE ALLOCATION STRATEGIES FOR COGNITIVE AND COOPERATIVE MIMO COMMUNICATIONS: ALGORITHM AND PROTOCOL DESIGN." Diss., The University of Arizona, 2013. http://hdl.handle.net/10150/292674.

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

Анотація:

Dynamic Spectrum Access (DSA) and multi-input multi-output (MIMO) communications are among the most promising solutions to address the ever-increasing wireless demand. Cognitive radio (CR) is the enabling technology for DSA. In this dissertation, we propose several resource allocation strategies for multiuser and cooperative MIMO communications in the context of DSA/CR systems and wireless sensor networks (WSNs). First, to maximize the Cognitive MIMO (CMIMO) network throughput, we develop a low-complexity distributed algorithm that configures the transmit antenna radiation directions and allocates power to all data streams over both frequency and space/antenna dimensions. We formulate the joint power, spectrum allocation, and MIMO beamforming problem as a noncooperative game. We prove that the game always admits at least one Nash Equilibrium (NE). To improve the efficiency of this NE (i.e., network throughput), we derive user-dependent pricing policies that force MIMO transmitters to steer their beams away from nearby unintended receivers. Second, we propose beamforming games (with and without pricing policies) that jointly improve the power and spectrum efficiency while meeting various rate demands. We derive sufficient conditions under which a given rate-demand profile can be supported. To account for user fairness, we develop a channel assignment and power allocation mechanism based on the Nash Bargaining solution. The proposed scheme allows CMIMO links to first propose their rate demands, and then cooperate and bargain in the process of determining their channel assignment, power allocation, and "precoding" matrices. In the context of WSNs where energy efficiency is a key design metric, we propose a cooperative MIMO framework. The framework partitions a WSN into various clusters in which several single-antenna sensors cooperate and form a virtual MIMO node so as to conserve power through harvesting MIMO's diversity gain. Extensive simulations show that our proposed schemes achieve significant throughput and energy efficiency improvement compared with state-of-the-art designs.

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

46

Pirim, Taner. "A hybrid metaheuristic algorithm for solving capacitated task allocation problems as modified XQX problems /." Full text available from ProQuest UM Digital Dissertations, 2006. http://0-proquest.umi.com.umiss.lib.olemiss.edu/pqdweb?index=0&did=1335352891&SrchMode=2&sid=1&Fmt=2&VInst=PROD&VType=PQD&RQT=309&VName=PQD&TS=1218810152&clientId=22256.

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

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

47

Oyana, Damalie M. "Implementation of a new data stream clustering algorithm using discrete cosine transformed data /." Available to subscribers only, 2006. http://proquest.umi.com/pqdweb?did=1203588021&sid=12&Fmt=2&clientId=1509&RQT=309&VName=PQD.

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

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

48

Venkatraman, Chandrasekar. "Hill climbing digital control algorithm for maximum power point tracking of photovoltaic arrays." Laramie, Wyo. : University of Wyoming, 2006. http://proquest.umi.com/pqdweb?did=1320938081&sid=2&Fmt=2&clientId=18949&RQT=309&VName=PQD.

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

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

49

Fernandes, José Maria Veiga. "Improving direct solar radiation in complex building envelopes with a computational genetic algorithm." Diss., Restricted to subscribing institutions, 2007. http://proquest.umi.com/pqdweb?did=1417816821&sid=1&Fmt=2&clientId=1564&RQT=309&VName=PQD.

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

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

50

Johnson, Amanda R. "A pose estimation algorithm based on points to regions correspondence using multiple viewpoints." Laramie, Wyo. : University of Wyoming, 2008. http://proquest.umi.com/pqdweb?did=1798480891&sid=1&Fmt=2&clientId=18949&RQT=309&VName=PQD.

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

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

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!