• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1074
  • 239
  • 152
  • 123
  • 76
  • 48
  • 35
  • 24
  • 24
  • 23
  • 18
  • 16
  • 8
  • 7
  • 7
  • Tagged with
  • 2194
  • 315
  • 216
  • 172
  • 168
  • 168
  • 165
  • 162
  • 130
  • 126
  • 115
  • 115
  • 114
  • 110
  • 106
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
81

An Extension of The Berry-Ravindran Algorithm for protein and DNA data

Riekkola, Jesper January 2022 (has links)
String matching algorithms are the algorithms used to search through different types of text in search of a certain pattern. Many of these algorithms achieve their impressive performance by analysing the pattern and saving that information. That information is then continuously used during the searching phase to know what parts of the text can be skipped. One such algorithm is the Berry-Ravindran. The Berry-Ravindran checks the two characters past the current try for a match and sees if those characters exist in the pattern. This thesis compares the Berry-Ravindran algorithm to new versions of itself that check three and four characters instead of two, along with the Boyer-Moore algorithm. Checking more characters improves the amount of the text that can be skipped by reducing the number of attempts needed but exponentially increases the pre-processing time. The improved performance in attempts does not necessarily mean a faster run-time because of the increased pre-processing time. The variable impacting the pre-processing time the biggest is the size of the alphabet that the text uses. This is researched by testing these algorithms with patterns ranging from 4 to 100 characters long on two different data sets. Protein data which has an alphabet size of 27 and DNA data which has an alphabet size of 4.
82

Computer colour matching with fluorescent dyes : The influence of fluorescence on reflectance - concentration relationships for fluorescent dyes, singly and in mixtures, and the effects on the prediction of recipes for use in colour matching.

Man, Tak-ming January 1984 (has links)
A simple and feasible method of computer colour matching involving fluorescent dyes was developed. An ordinary abridged-spectroreflectometer with polychomatic illumination and a simulated D65 xenon light source was employed for all measurements. In addition to the normal K/S constants for non-fluorescent dyes and the non-fluorescent portion of the fluorescent dye'.. constants responsible for the fluorescent portion were necessary. Two sets of equations to relate the total radiance factors of dyeings with a fluorescent dye and its concentration were developed respectively for self and compound shades where a non-fluorescent dye is admixed. Finding constants responsible for the compound shades required a number of calibration mixture dyeings. Negative K/S constants were found useful when the total radiance factor was above that for the substrate but below one hundred. Three computer programs? s were developed to deal with calibration constants for self and compound shade and also for match prediction. Optimization was used in all cases to minimize errors in total radiance factors or colour differences. Half of the actual dyeingq formulations from the predicted were visually passed by a panel of five dyers. In this study, disperse dyes on polyester were used. Moreover, a commercial matching package was studied using non-fluorescent dyes. The dyeing system affected its accuracy. The polyester/disperse dye system was better than the cotton/reactive dye system. The sample size and luminancefactor of target colours; were also studied. The accuracy was affected slightly by the latter but not the former. / Staff-development Committee and the Institute of Textiles and Clothing of the Hong Kong Polytechnic.
83

Otimização do algoritmo de block matching aplicado a estudos elastográficos / Otimization of the block matching algorithm aplied to elastogtraphic studies.

Neves, Lucio Pereira 03 August 2007 (has links)
Este trabalho apresenta uma análise sobre um novo método de formação de imagem, utilizando aparelhos de ultra-som a elastografia. Esta técnica baseia-se no fato de que quando um meio elástico, como o tecido, é deformado por uma tensão constante e uniaxial, todos os pontos no meio possuem um nível de deformação longitudinal cujo componente principal está ao longo do eixo de deformação. Se elementos do tecido possuem um módulo elástico diferente dos demais, a deformação nestes elementos será relativamente maior ou menor. Elementos mais rígidos geralmente deformam-se menos. Desta forma, pode-se mapear e identificar estruturas com diferentes níveis de dureza. A comparação entre os mapas de RF de pré e pós-deformação foi realizada pela técnica de block matching. Esta técnica consiste em comparar regiões, ou kernels, no mapa de pré-deformação com regiões de mesmo tamanho no mapa de pós-deformação. Esta comparação é feita pela minimização de uma função custo. Nesta técnica, o tamanho do kernel, é um dos principais parâmetros para melhorar a precisão das medidas de deslocamento. O principal objetivo neste trabalho é aperfeiçoar o algoritmo de block matching visando melhorar a precisão da determinação de deslocamento em técnicas de deformação dinâmica e estática, mantendo o custo computacional baixo. Para isto, foram utilizados phantoms com e sem inclusões mais duras que o meio. Os phantoms foram submetidos a deformações estáticas e dinâmicas. Foi possível determinar o comportamento destes phantoms sob estas formas de deformação, e as faixas de kernel e funções custo que forneceram os melhores resultados. Também foram gerados elastogramas do phantom com inclusão. Estas imagens permitiram avaliar a influência dos diferentes kernels sobre a resolução dos elastogramas e a capacidade em diferenciar a lesão do tecido circundante. Comparando os elastogramas obtidos sobre deformação dinâmica, utilizando os kernels que apresentaram o melhor desempenho, com as respectivas imagens em modo B, pôde-se observar que a inclusão estava clara e bem delimitada. / This work provides an analysis about a new method for image formation using ultrasound devices elastography. This technique is based on the fact that when an elastic medium, as the tissue, is deformed under a constant and directional stress, all the points in the medium have a deformation level whose main component is along the deformation axis. If tissues elements have different elastic modules, the deformation in these elements will be higher or lower. Normally harder elements have lower deformations. In this way, one can detect and identify structures with different elastic levels. The comparisons between the pre and post-deformation RF maps were done by the block matching technique. This technique is based on the comparison of regions, or kernels, in the pre-deformation maps with regions of the same size in the post-deformation map. This is done by the minimization of a cost function. In this technique, the kernel size is one of the most important parameters to obtain better resolution and precision in the displacement measurements. The goal of this work is to optimize the block matching algorithm to improve the displacement estimates precision in both dynamic and static deformations, while keeping a low computational cost. To obtain this, we used phantoms with and without inclusions harder than the medium. These phantoms were submitted to both static and dynamic deformations. It was possible to estimate the behavior of these phantoms under these deformations, and the kernel range and cost functions that provided the best results. Also, we generated the elastograms of the phantom with the inclusion. These images allowed us to evaluate the influence of the different kernel sizes under the elastograms resolution and their capability in differentiate the lesion from the embedding tissue. Comparing the elastograms obtained under dynamic deformation that had the best performance, with the B mode images, we could conclude that the inclusion was well delimited and clear.
84

Data Integration: Techniques and Evaluation

Hackl, Peter, Denk, Michaela January 2004 (has links) (PDF)
Within the DIECOFIS framework, ec3, the Division of Business Statistics from the Vienna University of Economics and Business Administration and ISTAT worked together to find methods to create a comprehensive database of enterprise data required for taxation microsimulations via integration of existing disparate enterprise data sources. This paper provides an overview of the broad spectrum of investigated methodology (including exact and statistical matching as well as imputation) and related statistical quality indicators, and emphasises the relevance of data integration, especially for official statistics, as a means of using available information more efficiently and improving the quality of a statistical agency's products. Finally, an outlook on an empirical study comparing different exact matching procedures in the maintenance of Statistics Austria's Business Register is presented.
85

String Matching Techniques: An Empirical Assessment Based on Statistics Austria's Business Register

Denk, Michaela, Hackl, Peter, Rainer, Norbert January 2005 (has links) (PDF)
The maintenance and updating of Statistics Austria's business register requires a regularly matching of the register against other data sources; one of them is the register of tax units of the Austrian Federal Ministry of Finance. The matching process is based on string comparison via bigrams of enterprise names and addresses, and a quality class approach assigning pairs of register units into classes of different compliance (i.e., matching quality) based on bigram similarity values and the comparison of other matching variables, like the NACE code or the year of foundation. Based on methodological research concerning matching techniques carried out in the DIECOFIS project, an empirical comparison of the bigram method and other string matching techniques was conducted: the edit distance, the Jaro algorithm and the Jaro-Winkler algorithm, the longest common subsequence and the maximal match were selected as appropriate alternatives and evaluated in the study. This paper briefly introduces Statistics Austria's business register and the corresponding maintenance process and reports on the results of the empirical study.
86

DESIGN AND EXPERIMENTATION WITH A SOFTWARE-DEFINED ACOUSTIC TELEMETRY MODEM

Doonan, Daniel, Fu, Tricia, Utley, Chris, Iltis, Ronald, Kastner, Ryan, Lee, Hua 10 1900 (has links)
ITC/USA 2006 Conference Proceedings / The Forty-Second Annual International Telemetering Conference and Technical Exhibition / October 23-26, 2006 / Town and Country Resort & Convention Center, San Diego, California / This paper describes the design and successful development of an acoustic modem for potential use in underwater ecological sensor networks. The presentation includes theoretical study, design and development of both software and hardware, laboratory experiments, full-scale field tests, and the documentation and analysis of field-test results.
87

Acoustic Telemetry for UUVs using Walsh/m-sequence Waveforms

Iltis, Ronald A. 10 1900 (has links)
ITC/USA 2005 Conference Proceedings / The Forty-First Annual International Telemetering Conference and Technical Exhibition / October 24-27, 2005 / Riviera Hotel & Convention Center, Las Vegas, Nevada / Underwater acoustic (UWA) telemetry requires wideband waveforms for anti-multipath which are simultaneously easy to equalize and demodulate. The Walsh/m-sequence waveforms proposed here are robust to multipath and with appropriate time-guard bands do not require equalization. For example, in the UCSB prototype acoustic modem, a data rate of 133 bps is achieved using 8-ary Walsh signaling with an 11.2 msec. symbol duration. Demodulation is performed using noncoherent detection, and hence accurate phase tracking, which is difficult to achieve in the UWA channel, is not required. However, telemetry from unmanned underwater vehicles (UUVs) is more problematic due to large Doppler shifts resulting from platform motion. A new receiver algorithm based on Matching Pursuits is proposed which combines channel and Doppler shift estimation. Symbol-error rate (SER) simulation results are presented for the UWA modem under realistic Doppler/multipath conditions.
88

Trapped-wave propagation along irregular coasts and channels

Santos, Joao Alfredo Ferreira dos January 1999 (has links)
No description available.
89

Motion compensation for 2D object-based video coding

Steliaros, Michael Konstantinos January 1999 (has links)
No description available.
90

Development of a natural language interface system that allows the user population to tailor the system iteratively to their own requirements

Sidhu, Jadvinder Singh January 1997 (has links)
No description available.

Page generated in 0.0883 seconds