To see the other types of publications on this topic, follow the link: Record matching.
Dissertations / Theses on the topic 'Record matching'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Record matching.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Tam, Siu-lung. "Linear-size indexes for approximate pattern matching and dictionary matching." Click to view the E-thesis via HKUTO, 2010. http://sunzi.lib.hku.hk/hkuto/record/B44205326.
Full text
2
Jupin, Joseph. "Temporal Graph Record Linkage and k-Safe Approximate Match." Diss., Temple University Libraries, 2016. http://cdm16002.contentdm.oclc.org/cdm/ref/collection/p245801coll10/id/412419.
Full textAbstract:
Computer and Information SciencePh.D.
Since the advent of electronic data processing, organizations have accrued vast amounts of data contained in multiple databases with no reliable global unique identifier. These databases were developed by different departments for different purposes at different times. Organizing and analyzing these data for human services requires linking records from all sources. RL (Record Linkage) is a process that connects records that are related to the identical or a sufficiently similar entity from multiple heterogeneous databases. RL is a data and compute intensive, mission critical process. The process must be efficient enough to process big data and effective enough to provide accurate matches. We have evaluated an RL system that is currently in use by a local health and human services department. We found that they were using the typical approach that was offered by Fellegi and Sunter with tuple-by-tuple processing, using the Soundex as the primary approximate string matching method. The Soundex has been found to be unreliable both as a phonetic and as an approximate string matching method. We found that their data, in many cases, has more than one value per field, suggesting that the data were queried from a 5NF data base. Consider that if a woman has been married 3 times, she may have up to 4 last names on record. This query process produced more than one tuple per database/entity apparently generating a Cartesian product of this data. In many cases, more than a dozen tuples were observed for a single database/entity. This approach is both ineffective and inefficient. An effective RL method should handle this multi-data without redundancy and use edit-distance for approximate string matching. However, due to high computational complexity, edit-distance will not scale well with big data problems. We developed two methodologies for resolving the aforementioned issues: PSH and ALIM. PSH – The Probabilistic Signature Hash is a composite method that increases the speed of Damerau-Levenshtein edit-distance. It combines signature filtering, probabilistic hashing, length filtering and prefix pruning to increase the speed of edit-distance. It is also lossless because it does not lose any true positive matches. ALIM – Aggregate Link and Iterative Match is a graph-based record linkage methodology that uses a multi-graph to store demographic data about people. ALIM performs string matching as records are inserted into the graph. ALIM eliminates data redundancy and stores the relationships between data. We tested PSH for string comparison and found it to be approximately 6,000 times faster than DL. We tested it against the trie-join methods and found that they are up to 6.26 times faster but lose between 10 and 20 percent of true positives. We tested ALIM against a method currently in use by a local health and human services department and found ALIM to produce significantly more matches (even with more restrictive match criteria) and that ALIM ran more than twice as fast. ALIM handles the multi-data problem and PSH allows the use of edit-distance comparison in this RL model. ALIM is more efficient and effective than a currently implemented RL system. This model can also be expanded to perform social network analysis and temporal data modeling. For human services, temporal modeling can reveal how policy changes and treatments affect clients over time and social network analysis can determine the effects of these on whole families by facilitating family linkage.
Temple University--Theses
3
U, Leong-Hou. "Matching problems in large databases." Click to view the E-thesis via HKUTO, 2010. http://sunzi.lib.hku.hk/hkuto/record/B43910488.
Full text
4
Grzebala, Pawel B. "Private Record Linkage: A Comparison of Selected Techniques for Name Matching." Wright State University / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=wright1461096562.
Full text
5
Sze, Wui-fung. "Robust feature-point based image matching." Click to view the E-thesis via HKUTO, 2006. http://sunzi.lib.hku.hk/hkuto/record/B37153262.
Full text
6
Denk, Michaela, Peter Hackl, and Norbert Rainer. "String Matching Techniques: An Empirical Assessment Based on Statistics Austria's Business Register." Austrian Statistical Society, c/o Bundesanstalt Statistik Austria, 2005. http://epub.wu.ac.at/5630/1/415%2D1277%2D1%2DSM.pdf.
Full textAbstract:
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.
7
Lai, Ka-ying. "Solving multiparty private matching problems using Bloom-filters." Click to view the E-thesis via HKUTO, 2006. http://sunzi.lib.hku.hk/hkuto/record/B37854847.
Full text
8
Hackl, Peter, and Michaela Denk. "Data Integration: Techniques and Evaluation." Austrian Statistical Society, 2004. http://epub.wu.ac.at/5631/1/435%2D1317%2D1%2DSM.pdf.
Full textAbstract:
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.
9
Denk, Michaela, and Peter Hackl. "Data Integration and Record Matching: An Austrian Contribution to Research in Official Statistics." Austrian Statistical Society, 2003. http://epub.wu.ac.at/5632/1/464%2D1378%2D1%2DSM.pdf.
Full textAbstract:
Data integration techniques are one of the core elements of
DIECOFIS, an EU-funded international research project that aims at
developing a methodology for the construction of a system of indicators on
competitiveness and fiscal impact on enterprise performance. Data
integration is also of major interest for official statistics agencies as a means
of using available information more efficiently and improving the quality of
the agency's products. The Austrian member of the project consortium
comprises university departments, representatives from the Bundesanstalt
Statistik Austria, from the Statistical Department of the Austrian Economic
Chamber, and from ec3, a non-profit research corporation. This paper gives
a short report on DIECOFIS in general and on the Austrian contribution to
the project, mainly dealing with data integration methodology. Various
papers that have been read at the DIECOFIS workshop last November in
Vienna, will be published as a Special Issue of the Austrian Journal of
Statistics.
10
Wong, Iok Lan. "Face detection in skin color modeling and template matching." Thesis, University of Macau, 2008. http://umaclib3.umac.mo/record=b1795653.
Full text
11
Chan, Chi-ho. "Matching patterns of line segments using affine invariant features." Click to view the E-thesis via HKUTO, 2005. http://sunzi.lib.hku.hk/hkuto/record/B3462725X.
Full text
12
Bauman, G. John. "Computation of Weights for Probabilistic Record Linkage Using the EM Algorithm." Diss., CLICK HERE for online access, 2006. http://contentdm.lib.byu.edu/ETD/image/etd1361.pdf.
Full text
13
Ay, Bekir Ozer. "A Proposed Ground Motion Selection And Scaling Procedure For Structural Systems." Phd thesis, METU, 2012. http://etd.lib.metu.edu.tr/upload/12615359/index.pdf.
Full textAbstract:
This study presents a ground-motion selection and scaling procedure that preserves the inherent uncertainty in the modified recordings. The proposed procedure provides a set of scaled ground-motion records to be used in the response estimation of structural systems for a pre-defined earthquake hazard level. Given a relatively larger ground-motion dataset, the methodology constrains the selection and scaling of the accelerograms to the differences between individual records and corresponding estimations from a representative ground-motion predictive model. The procedure precisely calculates the distribution parameters of linear structural systems whereas it provides estimations of these parameters for nonlinear structural response. Thus this method is not only useful for ground-motion selection and scaling but also for probability based performance assessment studies. The proposed procedure is also capable of matching with a pre-defined target elastic response spectrum and corresponding variance over a period range. Case studies that compare the performance of the proposed procedure with some other record selection and scaling methods suggest its usefulness for the accurate verification of structural systems and rapid loss estimation studies.
14
Nunes, Marcos Freitas. "Avaliação experimental de uma técnica de padronização de escores de similaridade." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2009. http://hdl.handle.net/10183/25494.
Full textAbstract:
Com o crescimento e a facilidade de acesso a Internet, o volume de dados cresceu muito nos últimos anos e, consequentemente, ficou muito fácil o acesso a bases de dados remotas, permitindo integrar dados fisicamente distantes. Geralmente, instâncias de um mesmo objeto no mundo real, originadas de bases distintas, apresentam diferenças na representação de seus valores, ou seja, os mesmos dados no mundo real podem ser representados de formas diferentes. Neste contexto, surgiram os estudos sobre casamento aproximado utilizando funções de similaridade. Por consequência, surgiu a dificuldade de entender os resultados das funções e selecionar limiares ideais. Quando se trata de casamento de agregados (registros), existe o problema de combinar os escores de similaridade, pois funções distintas possuem distribuições diferentes. Com objetivo de contornar este problema, foi desenvolvida em um trabalho anterior uma técnica de padronização de escores, que propõe substituir o escore calculado pela função de similaridade por um escore ajustado (calculado através de um treinamento), o qual é intuitivo para o usuário e pode ser combinado no processo de casamento de registros. Tal técnica foi desenvolvida por uma aluna de doutorado do grupo de Banco de Dados da UFRGS e será chamada aqui de MeaningScore (DORNELES et al., 2007). O presente trabalho visa estudar e realizar uma avaliação experimental detalhada da técnica MeaningScore. Com o final do processo de avaliação aqui executado, é possível afirmar que a utilização da abordagem MeaningScore é válida e retorna melhores resultados. No processo de casamento de registros, onde escores de similaridades distintos devem ser combinados, a utilização deste escore padronizado ao invés do escore original, retornado pela função de similaridade, produz resultados com maior qualidade.With the growth of the Web, the volume of information grew considerably over the past years, and consequently, the access to remote databases became easier, which allows the integration of distributed information. Usually, instances of the same object in the real world, originated from distinct databases, present differences in the representation of their values, which means that the same information can be represented in different ways. In this context, research on approximate matching using similarity functions arises. As a consequence, there is a need to understand the result of the functions and to select ideal thresholds. Also, when matching records, there is the problem of combining the similarity scores, since distinct functions have different distributions. With the purpose of overcoming this problem, a previous work developed a technique that standardizes the scores, by replacing the computed score by an adjusted score (computed through a training), which is more intuitive for the user and can be combined in the process of record matching. This work was developed by a Phd student from the UFRGS database research group, and is referred to as MeaningScore (DORNELES et al., 2007). The present work intends to study and perform an experimental evaluation of this technique. As the validation shows, it is possible to say that the usage of the MeaningScore approach is valid and return better results. In the process of record matching, where distinct similarity must be combined, the usage of the adjusted score produces results with higher quality.
15
Taylor, Paul Terence Girot. "Postmortem Identification through matching dental traits with population data." University of Sydney. Community Oral Health and Epidemiology, 2003. http://hdl.handle.net/2123/604.
Full textAbstract:
In cases of forensic dental identification, a key factor in the comparison of the dental status of deceased persons with antemortem dental records is the matching of dental restorations in individual teeth. Many studies have been performed showing the prevalence of dental interventions. This has mostly been performed by counting the numbers of decayed, missing and filled teeth (DMFT) in each mouth without detailed data collection on a per-tooth basis. The purpose of this study was to investigate the research question: to what extent would data on the distribution and prevalence of restoration types in the human dentition facilitate forensic identification? A database program was developed to allow efficient collection and collation of dental trait information. Provision was made for storing information relating to a subject's individual teeth, such as restorative materials used and surfaces filled. Other data, such as missing teeth, caries status on a per-individual tooth basis and presence and details of types of prostheses may be stored. iii Data from patients attending a private group practice in Hobart was collected and a system was devised to enable the likelihood of dental trait occurrence to be calculated in cases of forensic dental identification. The capabilities of the system are demonstrated in a series of mock cases of dental identification. An opportunity to make use of the database for which it was designed arose in relation to the analysis of person identification evidence in a murder trial at the Tasmanian Supreme Court. The use of this reference database in evidence invoked lengthy debate involving the judge, crown prosecutor and defence barristers. The resulting voire dire was resolved in favour of conclusions drawn from the use of the database being admitted in evidence. The legal precedent set in the Marlow trial may possibly offer encouragement for practising odontologists to further the concept of establishing and using reference databases of dental traits in population groups in other parts of Australia.
16
Chandwain, Roopkumar Mohan. "The matching of bioprocess data records for rapid diagnosis of chromatographic processes." Thesis, University College London (University of London), 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.362578.
Full text
17
Chen, Wei-Chuan. "A Multi-Channel, Impedance-Matching, Wireless, Passive Recorder for Medical Applications." The Ohio State University, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1555661316375242.
Full text
18
An, Xuebei. "Investigating the Validity of Observational Study Based on Electronic Medical Records and the Effectiveness of Perioperative Beta-Adrenoceptor Therapy to Reduce Postoperative Cardiac Events in Patients Undergoing Major Non-Cardiac Surgery." Case Western Reserve University School of Graduate Studies / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=case1338996142.
Full text
19
Jedzejczak, W. W., Jacek Smurzynski, Krzysztof Kochanek, and Henryk Skarzynski. "Matching Pursuit Algorithm Applied to the Evaluation of Click-evoked Otoacoustic Emissions Recorded with Linear and Nonlinear Protocols." Digital Commons @ East Tennessee State University, 2009. https://dc.etsu.edu/etsu-works/2200.
Full textAbstract:
Typically, click-evoked otoacoustic emissions (CEOAEs) are analyzed using fast Fourier transform which has greatly limited time-frequency (t-f) resolution. The purpose of the present study was to process CEOAEs recorded using linear and non-linear presentation modes by applying the Matching Pursuit (MP) method of adaptive approximation which provides a high t-f resolution. The data were recorded in 26 normal-hearing subjects using the ILO96 system with clicks presented at 78-82 dB pSPL. In the non-linear mode, a series of four clicks was delivered with three at the same level and polarity and the fourth three times greater in amplitude and inverted in polarity, whereas in the linear mode all stimuli were presented at the same level and polarity. The responses consisting of 512 data points were stored in two buffers. For each subject, 520 responses were recorded separately for off-line MP analyses. The MP method allowed decomposition of signals into waveforms of defined frequency, latency, time span, and amplitude and also identified patterns of resonance modes that were characteristic for CEOAEs recorded in each individual ear. The overall CEOAE levels were higher by 4 dB for the linear mode than those for the nonlinear method, in agreement with studies reported previously. In general, t-f properties of CEOAEs recorded with linear and non-linear protocols were similar with the exception of the 0-6-ms post-stimulus time window and the frequency range below 2.2 kHz. This part of the signal was contaminated by a stimulus artifact in the linear mode. The reproducibility factor grew faster with an increase of the number of averaged responses for the linear protocol than for the non-linear method. The results suggest that main differences between CEOAEs measured with the two methods are related to stimulus artifacts occurring at the beginning of the recording time-window in the linear mode.
20
Rasner, Anika [Verfasser], and Gert G. [Akademischer Betreuer] Wagner. "The Distribution of Pension Wealth and the Process of Pension Building: Augmenting Survey Data with Administrative Pension Records by Statistical Matching / Anika Rasner. Betreuer: Gert G. Wagner." Berlin : Universitätsbibliothek der Technischen Universität Berlin, 2012. http://d-nb.info/1019398639/34.
Full text
21
Arès, Sébastien. "Le couplage de données et la protection de la vie privée informationnelle sous l'article 8 de la Charte canadienne /." Thesis, McGill University, 2005. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=82651.
Full textAbstract:
Data matching is the automated process permitting the comparison of significant amounts of personal data from two or more different databanks in order to produce new information. Its use by governments implicates many rights and freedoms, including the protection against unreasonable search and seizure under section 8 of the Canadian Charter.In the author's opinion, a governmental data matching program will probably constitute a search or seizure under section 8 when a positive answer is given to two questions. First, is there a use or transfer of information which implicates constitutionally protected information? Generally, section 8 will only protect biographical personal information, as described in the Plant case. Second, one must determine if a reasonable expectation of privacy exists as to the purpose for which the information will be used. In other words, one must determine if the two governmental databanks are separate on the constitutional level.
However, a positive answer to both of theses questions does not mean that the matching program necessarily infringes section 8. It will not be considered unreasonable if it is authorised by law, if the law itself is reasonable, and if the execution of the program is reasonable. Presuming that the program is authorised by law, it is probable that a matching program aimed to detect individuals collecting illegally social benefits will not be considered unreasonable.
22
Marko, Savić. "Efficient algorithms for discrete geometry problems." Phd thesis, Univerzitet u Novom Sadu, Prirodno-matematički fakultet u Novom Sadu, 2018. https://www.cris.uns.ac.rs/record.jsf?recordId=107293&source=NDLTD&language=en.
Full textAbstract:
The first class of problem we study deals with geometric matchings. Given a setof points in the plane, we study perfect matchings of those points by straight linesegments so that the segments do not cross. Bottleneck matching is such a matching that minimizes the length of the longest segment. We are interested in finding a bottleneck matching of points in convex position. In the monochromatic case, where any two points are allowed to be matched, we give an O(n 2 )-time algorithm for finding a bottleneck matching, improving upon previously best known algorithm of O(n 3 ) time complexity. We also study a bichromatic version of this problem, where each point is colored either red or blue, and only points of different color can be matched. We develop a range of tools, for dealing with bichromatic non-crossing matchings of points in convexposition. Combining that set of tools with a geometric analysis enable us to solve theproblem of finding a bottleneck matching in O(n 2 ) time. We also design an O(n)-timealgorithm for the case where the given points lie on a circle. Previously best known results were O(n 3 ) for points in convex position, and O(n log n) for points on a circle.The second class of problems we study deals with dilation of geometric networks.Given a polygon representing a network, and a point p in the same plane, we aim toextend the network by inserting a line segment, called a feed-link, which connectsp to the boundary of the polygon. Once a feed link is fixed, the geometric dilationof some point q on the boundary is the ratio between the length of the shortest pathfrom p to q through the extended network, and their Euclidean distance. The utility ofa feed-link is inversely proportional to the maximal dilation over all boundary points.We give a linear time algorithm for computing the feed-link with the minimum overalldilation, thus improving upon the previously known algorithm of complexity that isroughly O(n log n).Prva klasa problema koju proučavamo tičee se geometrijskih mečinga. Za dat skup tačaaka u ravni, posmatramo savršene mečinge tih tačaka spajajućii ih dužima koje se ne smeju sećui. Bottleneck mečing je takav mečing koji minimizuje dužinu najduže duži. Naš cilj je da nađemo bottleneck mečiing tačaka u konveksnom položaju.Za monohromatski slučaj, u kom je dozvoljeno upariti svaki par tačaka, dajemo algoritam vremenske složenosti O(n 2) za nalaženje bottleneck mečinga. Ovo je bolje od prethodno najbolji poznatog algoritam, čiija je složenost O(n 3 ). Takođe proučavamo bihromatsku verziju ovog problema, u kojoj je svaka tačka obojena ili u crveno ili u plavo, i dozvoljeno je upariti samo tačke različite boje. Razvijamo niz alata za rad sa bihromatskim nepresecajućim mečinzima tačaka u konveksnom položaju. Kombinovanje ovih alata sa geometrijskom analizom omogućava nam da rešimo problem nalaženja bottleneck mečinga u O(n 2 ) vremenu. Takođe, konstruišemo algoritam vremenske složenosti O(n) za slučaj kada sve date tačkke leže na krugu. Prethodno najbolji poznati algoritmi su imali složenosti O(n 3 ) za tačkeke u konveksnom položaju i O(n log n) za tačke na krugu.Druga klasa problema koju proučaavamo tiče se dilacije u geometrijskim mrežama. Za datu mrežu predstavljenu poligonom, i tačku p u istoj ravni, želimo proširiti mrežu dodavanjem duži zvane feed-link koja povezuje p sa obodom poligona. Kada je feed- link fiksiran, definišemo geometrijsku dilaciju neke tačke q na obodu kao odnos izme đu dužine najkraćeg puta od p do q kroz proširenu mrežu i njihovog Euklidskog rastojanja. Korisnost feed-linka je obrnuto proporcionalna najvećoj dilaciji od svih ta čaka na obodu poligona. Konstruišemo algoritam linearne vremenske složenosti koji nalazi feed-link sa najmanom sveukupnom dilacijom. Ovim postižemo bolji rezultat od prethodno najboljeg poznatog algoritma složenosti približno O(n log n).
23
Gil, Rodríguez Raquel. "Digital camera colour processing pipeline for high dynamic range imaging and colour stabilisation for cinema." Doctoral thesis, Universitat Pompeu Fabra, 2018. http://hdl.handle.net/10803/664378.
Full textAbstract:
In this thesis we focus on two different image processing challenges: high dynamic range (HDR) image/video generation, and colour matching. In both cases, we redefine these tasks by taking into account the prior knowledge from the different processes the camera performs when capturing the image. High dynamic range techniques have recently become very popular, thanks to the emergence of HDR recording and displaying technology. We propose two different approaches for HDR creation, one for still images, and one for video creation. In case of still images, most of previous methods follow a multiple exposure combination approach. These methods share a set of building assump-tions: i) the full dynamic range of the scene can be recovered, ii) colour channels are independent, and iii) the camera response function remains constant while varying the exposure time. First, we highlight how these assumptions do not apply in general for digital cameras, and then, we propose a method to im-prove multiple exposure combination. Our results outperform state-of-the-art multiple exposure techniques.In case of HDR video, we present a simple and affordable method to gen-erate high quality video from an HDR scene. Our input is an interlaced video alternating row pairs with different ISO values, as some DSLR camera models can provide. The proposed algorithm involves two main steps: i) the compu-tation of two single-ISO full-frame images (one for each ISO value) using an inpainting-based deinterlacing method, and ii) the linear combination of the full-frame ISO’s into a single HDR frame. Finally, the results are tone-mapped into an LDR frame ready for display. Results are free of ghosting artefacts and present little noise.Colour matching approaches attempt to transfer the colours of a reference image, to another source image. In this context, we focus on colour matching two images taken from the same scene. First, we propose a method that mod-ifies logarithmic encoded images, used in cinema for HDR content, in order to behave as gamma encoded images, used in most digital cameras. Then, we ex-tend a previous approach defined just for gamma encoded images. We redefine the transformation between the two images, by considering a projective trans-form, and we estimate the method parameters in a single optimisation step. The method outperforms the state-of-the-art methods and can handle real-life examples.En aquesta tesi ens centrem en dos problemes de processament d’imatges diferents: generació d’imatge/vídeo d’alt rang dinàmic (HDR) i coloració. En tots dos casos, redefinim aquestes tasques tenint en compte el coneixement previ dels diferents processos que realitza la càmera en capturar la imatge. Actualment, les tèniques d’alt rang dinàmic s’han tornat molt populars, gràcies a l’aparició de la tecnologia per capturar i visualitzar HDR. Proposem dos enfocaments diferents per a la creació d’HDR, un per a imatges i un altre per a la creació de video. En el cas d’imatges, la majoria de mètodes combinen múltiples exposicions. Aquests mètodes comparteixen un conjunt d’hipòtesis: i) la recuperació del rang dinàmic complet de l’escena, ii) els canals de color són independents, i iii) la funció de resposta de la càmera es manté constant mentre es varia el temps d’exposició. En primer lloc, destaquem com aquestes suposicions no s’apliquen, en general, a les càmeres digitals, i després proposem un mètode per millorar aquesta tècnica. Els nostres resultats superen l’estat de l’art. En el cas de vídeo HDR, presentem un mètode senzill i assequible per generar vídeos d’alta qualitat d’una escena HDR. El nostre input és un vídeo entrellaçat alternant parells de fileres amb diferents valors d’ISO, com alguns models de càmeres DSLR poden proporcionar. L’algorisme inclou dos passos principals: i) el càlcul de dues imatges full-frame ISO (una per a cada valor d’ISO) utilizant un mètode de desentrella¸cat basat en inpainting, ii) la combinació lineal dels ISOs full-frame en un HDR únic. Finalment, els resultats es mapegen tonalment per obtenir un LDR per mostrar per pantalla. Els resultats no tenen artefactes de ghosting i presenten poc soroll. Els mètodes d’igualació de colors intenten transferir els colors d’una imatge de referència, a una altra imatge d’origen. En aquest context, ens centrem en el cas de dues imatges capturades a la mateixa escena. En primer lloc, proposem un mètode que modifica imatges codificades logarítmicament, utilitzades en el cinema per a continguts HDR, per tal de comportar-se com imatges gamma codificades, que s’utilitzen en la majoria de les càmeres digitals. A continuació, extenem un mètode definit prèviament només per imatges gamma codificades, redefinint la transformació entre les dues imatges, considerant una transformació projectiva i estimant els paràmetres del mètode en un únic pas d’optimització. El mètode supera l’estat de l’art i pot tractar exemples de la vida real.
24
Huang, Tai-Feng, and 黃泰豐. "An Efficient Privacy Preserving Record Matching Protocol." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/41600167529493747789.
Full textAbstract:
碩士國立臺灣大學
電機工程學研究所
96
Record matching or data linkage identifies all pairs of matched records that refer to the same entity in the real world; it is an important issue and a basic operation of information integration in the data mining field. In recent years, preservation of privacy has gained a lot of attention because of an increasing awareness of the importance of security. Therefore, the aim of the privacy preserving record matching protocol is to recognize the common records shared between two autonomous data sources and keep privacy leakage low without revealing any private data at the same time, although the main idea of privacy-preserving and information sharing conflicts in nature. In this thesis, one modified reference set to set the embedding space is proposed and demonstrated by experiment that it is more efficient and precise when transforming plain record values into a metric space in order to keep confidential.
25
Huang, Tai-Feng. "An Efficient Privacy Preserving Record Matching Protocol." 2008. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0001-2907200813175500.
Full text
26
Huang, Yuan-May, and 黃圓媚. "Building Medical Record and Investigating the Usage of Image Matching Technique with Medical Record." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/36957440914098221439.
Full textAbstract:
碩士國立陽明大學
衛生資訊與決策研究所
92
Due to the number of increasing outpatients more and more every day in hospital, especially surgery department, it had been a long time from first consultation to using endoscope, and nurses and doctors would keep their mind on diagnosing. As far as Rectal and Colon Surgery Department concerned, images were taken in every diagnosis, so we must manage these medical images well. The effect was more efficient after managing database. We could try to process medical images before doctors’ viewing since this method could decrease the viewing time, mark the doubtable position, and be a reference for diagnosis. Therefore by using some image processing, we would be able to investigate what process could be more efficient in machine recognition. In this research, we collected the images that be doubted of tumor existence for patients, including CT, specimen and colonoscopy photos. We designed a user interface on the Web that could add new records, edit and delete records and search the images, and construct metadata for doctors’ contribution to connect the images to search easily. Besides, we focused on doubting images which can be taken in patients’ colon and use image processing and classification in Data Mining. We can use that to explore weather classify tumor and non-tumor. We expect the result can be hopeful to categorization. In this thesis, the results of classification using support vector machine (SVM) were suitable. Gold standard experts based on experienced physician. Accuracy is 96.296 %, sensitivity is 0.975 and specificity is 0.987 using wavelet transform + Principal Component Analysis (PCA).
27
"A study of matching mechanisms." 2010. http://library.cuhk.edu.hk/record=b5894413.
Full textAbstract:
Liu, Jian.Thesis (M.Phil.)--Chinese University of Hong Kong, 2010.
Includes bibliographical references (p. 86-91).
Abstracts in English and Chinese.
Chapter 1 --- Introduction of Matching Mechanisms --- p.1
Chapter 1.1 --- Background for College Admissions Problem --- p.1
Chapter 1.2 --- Background for Internet Advertising Market --- p.3
Chapter 2 --- Application I: College Admissions Problem Revisited --- p.6
Chapter 2.1 --- Three Basic Mechanisms --- p.6
Chapter 2.1.1 --- Boston Mechanism --- p.7
Chapter 2.1.2 --- Gale-Shapley Student Optimal Mechanism --- p.9
Chapter 2.1.3 --- Top Trading Cycles Mechanism --- p.11
Chapter 2.2 --- College Admissions Mechanisms Around the World --- p.12
Chapter 2.2.1 --- Serial Dictatorship in Turkey --- p.13
Chapter 2.2.2 --- JUPAS in Hong'Kong SAR --- p.14
Chapter 2.2.3 --- College Admissions in Mainland China --- p.16
Chapter 2.3 --- Generalized Model for College Admissions: JUPAS Revisited --- p.19
Chapter 2.4 --- Extension to Marriage Problem --- p.23
Chapter 2.5 --- Strategy Analysis in Extended Marriage Problem --- p.27
Chapter 2.6 --- Strategy Analysis in JUPAS --- p.30
Chapter 2.7 --- Efficiency Investigation via Simulation --- p.33
Chapter 2.7.1 --- Efficiency Definition --- p.33
Chapter 2.7.2 --- Simulation Design --- p.36
Chapter 2.7.3 --- Simulation Results --- p.38
Chapter 3 --- Application II: Search Engines Market Model --- p.42
Chapter 3.1 --- The Monopoly Market Model --- p.42
Chapter 3.1.1 --- The Ex Ante Case --- p.43
Chapter 3.1.2 --- The Ex Post Case --- p.45
Chapter 3.1.3 --- Formulated As An Optimization Problem --- p.51
Chapter 3.2 --- The Duopoly Market Model --- p.54
Chapter 3.2.1 --- Competition for End Users in Stage I --- p.54
Chapter 3.2.2 --- Competition for Advertisers in Stage II and III --- p.57
Chapter 3.2.3 --- Comparison of Competition and Monopoly --- p.65
Chapter 3.3 --- Numerical Results and Observations --- p.70
Chapter 3.3.1 --- Baseline Setting --- p.71
Chapter 3.3.2 --- Effect of Supplies --- p.74
Chapter 3.3.3 --- Effect of Discount Factors --- p.75
Chapter 4 --- Related Work --- p.78
Chapter 5 --- Summary and Future Directions --- p.83
Bibliography --- p.86
28
"Fast pattern matching and its applications." Thesis, 2011. http://library.cuhk.edu.hk/record=b6075121.
Full textAbstract:
After that, strip sum and orthogonal Haar transform are proposed. The sum of pixels in a rectangle can be computed by one addition using the strip sum. Then this thesis proposes to use the orthogonal Haar transform (OHT) for pattern matching. Applied for pattern matching, the fast OHT algorithm using strip sum requires O(log u) additions per pixel to project input data of size N1 x N2 onto u 2-D OHT bases. Experimental results show the efficiency of pattern matching using OHT.Firstly, this thesis proposes a fast algorithm for Walsh Hadamard Transform (WHT) on sliding windows which can be used to implement pattern matching efficiently.
Support vector machine (SVM) is a widely used classification approach. Direct computation of SVM is not desirable in applications requiring computationally efficient classification. To relieve the burden of high computational time required for computing SVM, this thesis proposes a transform domain SVM (TDSVM) using pruning that computes SVM much faster. Experimental results show the efficiency in applying the proposed method for human detection.
Then this thesis analyzes and compares state-of-the-art algorithms for full search equivalent pattern matching. Inspired by the analysis, this thesis develops a new family of transforms called the Kronecker-Hadamard Transform (KHT) of which the GCK family is a subset and WHT is a member. Thus, KHT provides more choices of transforms for representing images. Then this thesis proposes a new fast algorithm that is more efficient than the GCK algorithm. All KHTs can be computed efficiently using the fast KHT algorithm. Based on the KHT, this thesis then proposes the segmented KHT (SegKHT). By segmenting input data into Ls parts, the SegKHT requires 1/Ls the computation required by the KHT algorithm in computing basis vectors. Experimental results show that the proposed algorithm can significantly accelerate the pattern matching process and outperforms state-of-the-art methods.
This thesis aims at improving the computational efficiency in pattern matching.
Ouyang, Wanli.
Adviser: Wai Kuen Cham.
Source: Dissertation Abstracts International, Volume: 73-04, Section: B, page: .
Thesis (Ph.D.)--Chinese University of Hong Kong, 2011.
Includes bibliographical references (leaves 143-147).
Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web.
Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [201-] System requirements: Adobe Acrobat Reader. Available via World Wide Web.
Abstract also in Chinese.
29
"Arbitrated matching: formulation, protocol and strategies." Chinese University of Hong Kong, 1992. http://library.cuhk.edu.hk/record=b5887793.
Full textAbstract:
by Choi Ka Wai.Thesis (M.Phil.)--Chinese University of Hong Kong, 1992.
Includes bibliographical references (leaves 54-55).
Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- The Matching Process --- p.1
Chapter 1.2 --- Centralization --- p.2
Chapter 1.3 --- One-off Approach --- p.3
Chapter 1.4 --- Our Approach --- p.4
Chapter 1.5 --- Organization --- p.5
Chapter 2 --- Decision Theory --- p.6
Chapter 2.1 --- Ordinal Preference --- p.6
Chapter 2.1.1 --- Strict Preference and Indifference --- p.6
Chapter 2.1.2 --- Weak Preference --- p.8
Chapter 2.2 --- Utility Theory --- p.8
Chapter 2.3 --- Group Decision Making --- p.9
Chapter 2.3.1 --- Social Choice Theory --- p.9
Chapter 2.3.2 --- Bargaining --- p.11
Chapter 3 --- The Matching Rule --- p.14
Chapter 3.1 --- The Marriage Model --- p.15
Chapter 3.2 --- Stability --- p.16
30
"Efficient time series matching by wavelets." 1999. http://library.cuhk.edu.hk/record=b5889902.
Full textAbstract:
by Chan, Kin Pong.Thesis (M.Phil.)--Chinese University of Hong Kong, 1999.
Includes bibliographical references (leaves 100-105).
Abstracts in English and Chinese.
Acknowledgments --- p.ii
Abstract --- p.iii
Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- Wavelet Transform --- p.4
Chapter 1.2 --- Time Warping --- p.5
Chapter 1.3 --- Outline of the Thesis --- p.6
Chapter 2 --- Related Work --- p.8
Chapter 2.1 --- Similarity Models for Time Series --- p.8
Chapter 2.2 --- Dimensionality Reduction --- p.11
Chapter 2.3 --- Wavelet Transform --- p.15
Chapter 2.4 --- Similarity Search under Time Warping --- p.16
Chapter 3 --- Dimension Reduction by Wavelets --- p.21
Chapter 3.1 --- The Proposed Approach --- p.21
Chapter 3.1.1 --- Haar Wavelets --- p.23
Chapter 3.1.2 --- DFT versus Haar Transform --- p.27
Chapter 3.1.3 --- Guarantee of no False Dismissal --- p.29
Chapter 3.2 --- The Overall Strategy --- p.34
Chapter 3.2.1 --- Pre-processing --- p.35
Chapter 3.2.2 --- Range Query --- p.35
Chapter 3.2.3 --- Nearest Neighbor Query --- p.36
Chapter 3.3 --- Performance Evaluation --- p.39
Chapter 3.3.1 --- Stock Data --- p.39
Chapter 3.3.2 --- Synthetic Random Walk Data --- p.45
Chapter 3.3.3 --- Scalability Test --- p.51
Chapter 3.3.4 --- Other Wavelets --- p.52
Chapter 4 --- Time Warping --- p.55
Chapter 4.1 --- Similarity Search based on K-L Transform --- p.60
Chapter 4.2 --- Low Resolution Time Warping --- p.63
Chapter 4.2.1 --- Resolution Reduction of Sequences --- p.63
Chapter 4.2.2 --- Distance Compensation --- p.67
Chapter 4.2.3 --- Time Complexity --- p.73
Chapter 4.3 --- Adaptive Time Warping --- p.77
Chapter 4.3.1 --- Time Complexity --- p.79
Chapter 4.4 --- Performance Evaluation --- p.80
Chapter 4.4.1 --- Accuracy versus Runtime --- p.80
Chapter 4.4.2 --- Precision versus Recall --- p.85
Chapter 4.4.3 --- Overall Runtime --- p.91
Chapter 4.4.4 --- Starting Up Evaluation --- p.93
Chapter 5 --- Conclusion and Future Work --- p.95
Chapter 5.1 --- Conclusion --- p.95
Chapter 5.2 --- Future Work --- p.96
Chapter 5.2.1 --- Application of Wavelets on Biomedical Signals --- p.96
Chapter 5.2.2 --- Moving Average Similarity --- p.98
Chapter 5.2.3 --- Clusters-based Matching in Time Warping --- p.98
Bibliography --- p.99
31
"Feature matching by Hopfield type neural networks." 2002. http://library.cuhk.edu.hk/record=b6073412.
Full textAbstract:
Li Wenjing."April 2002."
Thesis (Ph.D.)--Chinese University of Hong Kong, 2002.
Includes bibliographical references (p. 155-167).
Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web.
Mode of access: World Wide Web.
Abstracts in English and Chinese.
32
"On linear programming relaxations of hypergraph matching." 2009. http://library.cuhk.edu.hk/record=b5896586.
Full textAbstract:
Chan, Yuk Hei.Thesis (M.Phil.)--Chinese University of Hong Kong, 2009.
Includes bibliographical references (leaves 49-51).
Abstract also in Chinese.
Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- Problem Definition --- p.1
Chapter 1.1.1 --- Hypergraph Matching --- p.1
Chapter 1.1.2 --- k-Set Packing --- p.2
Chapter 1.1.3 --- k-Dimensional Matching --- p.2
Chapter 1.1.4 --- Related Problems --- p.2
Chapter 1.2 --- Main Result --- p.5
Chapter 1.3 --- Overview of the Thesis --- p.6
Chapter 2 --- Background --- p.8
Chapter 2.1 --- Matching --- p.8
Chapter 2.1.1 --- Augmenting Path --- p.8
Chapter 2.1.2 --- Linear Programming --- p.10
Chapter 2.1.3 --- Matching in General Graphs --- p.11
Chapter 2.1.4 --- Approximate Min-max Relation for Hypergraphs --- p.11
Chapter 2.2 --- Local Search --- p.12
Chapter 2.2.1 --- Unweighted k-Set Packing --- p.12
Chapter 2.2.2 --- Weighted k-Set Packing ´ؤ (k- - 1 + ₂ё)-approximation --- p.14
Chapter 2.2.3 --- Weighted k-Set Packing´ؤ(2(k + l)/3 + ₂ё)-approximation --- p.15
Chapter 2.2.4 --- Weighted k-Set Packing´ؤ((k + l)/2 + ₂ё)-approximation --- p.16
Chapter 2.3 --- Iterative Rounding --- p.17
Chapter 2.3.1 --- Basic Solution --- p.17
Chapter 2.3.2 --- Bipartite Matching --- p.19
Chapter 2.3.3 --- Generalized Steiner Network Problem --- p.20
Chapter 2.3.4 --- Minimum Bounded Degree Spanning Tree --- p.22
Chapter 2.4 --- Packing Problems --- p.24
Chapter 2.4.1 --- Projective Plane --- p.26
Chapter 2.5 --- Local Ratio --- p.28
Chapter 2.5.1 --- Vertex Cover --- p.28
Chapter 2.5.2 --- Local Ratio Theorem --- p.29
Chapter 2.5.3 --- Feedback Vertex Set in Tournaments --- p.29
Chapter 2.5.4 --- Fractional Local Ratio --- p.31
Chapter 2.5.5 --- Maximum Weight Independent Set in t-interval Graph --- p.31
Chapter 3 --- k-Dimensional Matching --- p.33
Chapter 3.1 --- Integrality Gap of the Standard LP Relaxation --- p.33
Chapter 3.1.1 --- Approximation Algorithm for Unweighted k-D Matching --- p.34
Chapter 3.1.2 --- Fractional Colouring --- p.35
Chapter 3.1.3 --- Produce an Ordering --- p.37
Chapter 3.2 --- Approximation Algorithm for Weighted k-D Matching --- p.38
Chapter 4 --- k-Set Packing --- p.40
Chapter 4.1 --- Integrality Gap of the Standard LP Relaxation --- p.40
Chapter 4.2 --- Improved LP Relaxation for 3-SP --- p.41
Concluding Remarks --- p.48
Bibliography --- p.49
33
"Generalized pattern matching applied to genetic analysis." Thesis, 2011. http://library.cuhk.edu.hk/record=b6075184.
Full textAbstract:
Approximate pattern matching problem is, given a reference sequence T, a pattern (query) Q, and a maximum allowed error e, to find all the substrings in the reference, such that the edit distance between the substrings and the pattern is smaller than or equal to the maximum allowed error. Though it is a well-studied problem in Computer Science, it gains a resurrection in Bioinformatics in recent years, largely due to the emergence of the next-generation high-throughput sequencing technologies. This thesis contributes in a novel generalized pattern matching framework, and applies it to solve pattern matching problems in general and alternative splicing detection (AS) in particular. AS is to map a large amount of next-generation sequencing short reads data to a reference human genome, which is the first and an important step in analyzing the sequenced data for further Biological analysis. The four parts of my research are as follows.In the first part of my research work, we propose a novel deterministic pattern matching algorithm which applies Agrep, a well-known bit-parallel matching algorithm, to a truncated suffix array. Due to the linear cost of Agrep, the cost of our approach is linear to the number of characters processed in the truncated suffix array. We analyze the matching cost theoretically, and .obtain empirical costs from experiments. We carry out experiments using both synthetic and real DNA sequence data (queries) and search them in Chromosome-X of a reference human genome. The experimental results show that our approach achieves a speed-up of several magnitudes over standard Agrep algorithm.
In the fourth part, we focus on the seeding strategies for alternative splicing detection. We review the history of seeding-and-extending (SAE), and assess both theoretically and empirically the seeding strategies adopted in existing splicing detection tools, including Bowtie's heuristic and ABMapper's exact seedings, against the novel complementary quad-seeding strategy we proposed and the corresponding novel splice detection tool called CS4splice, which can handle inexact seeding (with errors) and all 3 types of errors including mismatch (substitution), insertion, and deletion. We carry out experiments using short reads (queries) of length 105bp comprised of several data sets consisting of various levels of errors, and align them back to a reference human genome (hg18). On average, CS4splice can align 88. 44% (recall rate) of 427,786 short reads perfectly back to the reference; while the other existing tools achieve much smaller recall rates: SpliceMap 48.72%, MapSplice 58.41%, and ABMapper 51.39%. The accuracies of CS4splice are also the highest or very close to the highest in all the experiments carried out. But due to the complementary quad-seeding that CS4splice use, it takes more computational resources, about twice (or more) of the other alternative splicing detection tools, which we think is practicable and worthy.
In the second part, we define a novel generalized pattern (query) and a framework of generalized pattern matching, for which we propose a heuristic matching algorithm. Simply speaking, a generalized pattern is Q 1G1Q2 ... Qc--1Gc--1 Qc, which consists of several substrings Q i and gaps Gi occurring in-between two substrings. The prototypes of the generalized pattern come from several real Biological problems that can all be modeled as generalized pattern matching problems. Based on a well-known seeding-and-extending heuristic, we propose a dual-seeding strategy, with which we solve the matching problem effectively and efficiently. We also develop a specialized matching tool called Gpattern-match. We carry out experiments using 10,000 generalized patterns and search them in a reference human genome (hg18). Over 98.74% of them can be recovered from the reference. It takes 1--2 seconds on average to recover a pattern, and memory peak goes to a little bit more than 1G.
In the third part, a natural extension of the second part, we model a real biological problem, alternative splicing detection, into a generalized pattern matching problem, and solve it using a proposed bi-directional seeding-and-extending algorithm. Different from all the other tools which depend on third-party tools, our mapping tool, ABMapper, is not only stand-alone but performs unbiased alignments. We carry out experiments using 427,786 real next-generation sequencing short reads data (queries) and align them back to a reference human genome (hg18). ABMapper achieves 98.92% accuracy and 98.17% recall rate, and is much better than the other state-of-the-art tools: SpliceMap achieves 94.28% accuracy and 78.13% recall rate;while TopHat 88.99% accuracy and 76.33% recall rate. When the seed length is set to 12 in ABMapper, the whole searching and alignment process takes about 20 minutes, and memory peak goes to a little bit more than 2G.
Ni, Bing.
Adviser: Kwong-Sak Leung.
Source: Dissertation Abstracts International, Volume: 73-06, Section: B, page: .
Thesis (Ph.D.)--Chinese University of Hong Kong, 2011.
Includes bibliographical referencesTexture mapping (leaves 151-161).
Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web.
Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [201-] System requirements: Adobe Acrobat Reader. Available via World Wide Web.
Electronic reproduction. Ann Arbor, MI : ProQuest Information and Learning Company, [200-] System requirements: Adobe Acrobat Reader. Available via World Wide Web.
Abstract also in Chinese.
34
"Stereo matching on objects with fractional boundary." 2007. http://library.cuhk.edu.hk/record=b5896708.
Full textAbstract:
Xiong, Wei.Thesis (M.Phil.)--Chinese University of Hong Kong, 2007.
Includes bibliographical references (leaves 56-61).
Abstracts in English and Chinese.
Abstract --- p.i
Acknowledgement --- p.iv
Chapter 1 --- Introduction --- p.1
Chapter 2 --- Background Study --- p.6
Chapter 2.1 --- Stereo matching --- p.6
Chapter 2.2 --- Digital image matting --- p.8
Chapter 2.3 --- Expectation Maximization --- p.9
Chapter 3 --- Model Definition --- p.12
Chapter 4 --- Initialization --- p.20
Chapter 4.1 --- Initializing disparity --- p.20
Chapter 4.2 --- Initializing alpha matte --- p.24
Chapter 5 --- Optimization --- p.26
Chapter 5.1 --- Expectation Step --- p.27
Chapter 5.1.1 --- "Computing E((Pp(df = d1̐ưجθ(n),U))" --- p.28
Chapter 5.1.2 --- "Computing E((Pp(db = d2̐ưجθ(n),U))" --- p.29
Chapter 5.2 --- Maximization Step --- p.31
Chapter 5.2.1 --- "Optimize α, given {F, B} fixed" --- p.34
Chapter 5.2.2 --- "Optimize {F, B}, given α fixed" --- p.37
Chapter 5.3 --- Computing Final Disparities --- p.40
Chapter 6 --- Experiment Results --- p.42
Chapter 7 --- Conclusion --- p.54
Bibliography --- p.56
35
"Deadline-ordered parallel iterative matching with QoS guarantee." 2000. http://library.cuhk.edu.hk/record=b5890379.
Full textAbstract:
by Lui Hung Ngai.Thesis (M.Phil.)--Chinese University of Hong Kong, 2000.
Includes bibliographical references (leaves 56-[59]).
Abstracts in English and Chinese.
Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- Thesis Overview --- p.3
Chapter 2 --- Background & Related work --- p.4
Chapter 2.1 --- Scheduling problem in ATM switch --- p.4
Chapter 2.2 --- Traffic Scheduling in output-buffered switch --- p.5
Chapter 2.3 --- Traffic Scheduling in Input buffered Switch --- p.16
Chapter 3 --- Deadline-ordered Parallel Iterative Matching (DLPIM) --- p.22
Chapter 3.1 --- Introduction --- p.22
Chapter 3.2 --- Switch model --- p.23
Chapter 3.3 --- Deadline-ordered Parallel Iterative Matching (DLPIM) --- p.24
Chapter 3.3.1 --- Motivation --- p.24
Chapter 3.3.2 --- Algorithm --- p.26
Chapter 3.3.3 --- An example of DLPIM --- p.28
Chapter 3.4 --- Simulation --- p.30
Chapter 4 --- DLPIM with static scheduling algorithm --- p.41
Chapter 4.1 --- Introduction --- p.41
Chapter 4.2 --- Static scheduling algorithm --- p.42
Chapter 4.3 --- DLPIM with static scheduling algorithm --- p.48
Chapter 4.4 --- An example of DLPIM with static scheduling algorithm --- p.50
Chapter 5 --- Conclusion --- p.54
Bibliography --- p.56
36
"Bargaining with externalities under an endogenous matching protocol." 2013. http://library.cuhk.edu.hk/record=b5549264.
Full textAbstract:
本文研究一個賣家和多個潛在買家對於一個不可分割商品的議價，且賣家之間存在與身份相關的外部性。我們考察一個有限期的展開形式的博弈，此博弈採用內生的匹配機制，在每一期的博弈中，賣家選擇和哪一個買家進行議價。此博弈有一個唯一的平衡，且無論外部性爲正或負，在平衡中，協議總是立即達成。只有兩個買家時，若外部性爲負，商品必然售予效率買家；若外部性爲正，當買家的議價能力提高時，平衡結果可能會從無效率變爲有效率。若有超過兩個買家存在，無效率結果出現的可能性將會提高。
This paper studies bargaining between one seller and multiple potential buyers on the sale of one indivisible good, in which indentity-dependent exernalities exist among buyers. We consider an extensive game with nite horizon and endogenous matching procedure, that is, the seller chooses the buyer whom to bargain with during each period of the bargaining game.
The bargaining game has a unique equilibrium with immediate agreement regardless of whether externalities are positive or negative. In a two-buyer game, the good is sold to the efficient buyer when externalities are negative. When externalities are positive, the outcome may change from inefficient to efficient by increasing the bargaining power of the buyers. Inefficient outcomes arise with higher probability in a game with more than two buyers.
Detailed summary in vernacular field only.
Detailed summary in vernacular field only.
Zhang, Xuechao.
Thesis (M.Phil.)--Chinese University of Hong Kong, 2013.
Includes bibliographical references (leaves 37-38).
Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web.
Abstracts also in Chinese.
Abstract --- p.i
Abstract in Chinese --- p.ii
Acknowledgements --- p.iii
Chapter 1 --- Introduction --- p.1
Chapter 2 --- Literature Review --- p.5
Chapter 3 --- The Model --- p.8
Chapter 3.1 --- Bargaining Procedure --- p.8
Chapter 3.2 --- Histories and Strategies --- p.9
Chapter 3.3 --- Outcomes and Payos --- p.10
Chapter 4 --- Equilibrium Analysis --- p.13
Chapter 4.1 --- Equilibrium Dynamics --- p.13
Chapter 4.2 --- Effi ciency Analysis --- p.20
Chapter 5 --- Further Extensions --- p.32
Chapter 5.1 --- Buyer-active Protocol --- p.32
Chapter 5.2 --- Innite-horizon Framework --- p.34
Chapter 6 --- Conclusion --- p.36
References --- p.37
37
"Feature extraction and pattern matching in time series data." 2001. http://library.cuhk.edu.hk/record=b5890957.
Full textAbstract:
Wan Po Man Polly.Thesis (M.Phil.)--Chinese University of Hong Kong, 2001.
Includes bibliographical references (leaves 122-128).
Abstracts in English and Chinese.
Abstract --- p.i
Acknowledgements --- p.v
Contents --- p.vi
List of Figures --- p.x
List of Tables --- p.xiv
Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- Motivation and Aims --- p.1
Chapter 1.2 --- Organization of Thesis --- p.5
Chapter 2 --- Literature Review --- p.6
Chapter 2.1 --- Dimensionality Reduction --- p.6
Chapter 2.1.1 --- Fourier Transformation --- p.6
Chapter 2.1.2 --- Wavelet Transformation --- p.8
Chapter 2.1.3 --- Singular Value Decomposition --- p.10
Chapter 2.2 --- Searching Sequence Similarity with Transformation --- p.11
Chapter 2.2.1 --- Time Warping --- p.11
Chapter 2.2.2 --- Amplitude Scaling and Shifting --- p.14
Chapter 2.3 --- Data Smoothing and Noise Removal --- p.18
Chapter 2.3.1 --- Piecewise Linear Segmentations --- p.18
Chapter 2.3.2 --- Approximation Function --- p.21
Chapter 2.3.3 --- Best-fitting Line --- p.23
Chapter 2.3.4 --- Turning Points --- p.24
Chapter 3 --- Time-Series Searching with Scaling and Shifting in Amplitude and Time Domains --- p.25
Chapter 3.1 --- Representation --- p.25
Chapter 3.1.1 --- Control Points --- p.26
Chapter 3.1.2 --- Lattice Structure --- p.28
Chapter 3.1.3 --- Algorithm on Lattice Construction --- p.31
Chapter 3.2 --- Pattern Matching --- p.32
Chapter 3.2.1 --- Formulating the Problem of Similarity --- p.35
Chapter 3.2.2 --- Error Measurement --- p.38
Chapter 3.3 --- Indexing Scheme --- p.39
Chapter 3.3.1 --- Indexing with scaling and shifting proposed by Chu and Wong --- p.40
Chapter 3.3.2 --- Integrating with lattice structure --- p.41
Chapter 3.4 --- Results --- p.43
Chapter 4 --- Chart Patterns Searching for Chart Analysis --- p.47
Chapter 4.1 --- Chart Patterns Overview --- p.47
Chapter 4.1.1 --- Reversal Patterns --- p.49
Chapter 4.1.2 --- Continuation Patterns --- p.52
Chapter 4.2 --- Representation --- p.53
Chapter 4.2.1 --- Trendline Preparation --- p.54
Chapter 4.2.2 --- Trendline Pair --- p.59
Chapter 4.3 --- Three-Phase Pattern Classification --- p.66
Chapter 4.3.1 --- Phase One: Trendline Pair Classification --- p.66
Chapter 4.3.2 --- Phase Two: Patterns Merging and Rejection --- p.74
Chapter 4.3.3 --- Phase Three: Patterns Merging of Unclassified and Un- merged Trendline Pairs --- p.89
Chapter 4.4 --- Results --- p.90
Chapter 5 --- Conclusion --- p.100
Chapter A --- Supplementary Results --- p.103
Chapter A.1 --- Ascending Triangle --- p.103
Chapter A.2 --- Descending Triangle --- p.104
Chapter A.3 --- Falling Wedge --- p.106
Chapter A.4 --- Head and Shoulders --- p.107
Chapter A.5 --- Price Channel --- p.109
Chapter A.6 --- Rectangle --- p.110
Chapter A.7 --- Rising Wedge --- p.112
Chapter A.8 --- Symmetric Triangle --- p.113
Chapter A.9 --- Double Bottom --- p.113
Chapter A.10 --- Double Top --- p.116
Chapter A.11 --- Triple Bottom --- p.118
Chapter A.12 --- Triple Top --- p.120
Bibliography --- p.122
Publications --- p.128
38
"Bending invariant correspondence matching on 3D models with feature descriptor." 2010. http://library.cuhk.edu.hk/record=b5896651.
Full textAbstract:
Li, Sai Man.Thesis (M.Phil.)--Chinese University of Hong Kong, 2010.
Includes bibliographical references (leaves 91-96).
Abstracts in English and Chinese.
Abstract --- p.2
List of Figures --- p.6
Acknowledgement --- p.10
Chapter Chapter 1 --- Introduction --- p.11
Chapter 1.1 --- Problem definition --- p.11
Chapter 1.2. --- Proposed algorithm --- p.12
Chapter 1.3. --- Main features --- p.14
Chapter Chapter 2 --- Literature Review --- p.16
Chapter 2.1 --- Local Feature Matching techniques --- p.16
Chapter 2.2. --- Global Iterative alignment techniques --- p.19
Chapter 2.3 --- Other Approaches --- p.20
Chapter Chapter 3 --- Correspondence Matching --- p.21
Chapter 3.1 --- Fundamental Techniques --- p.24
Chapter 3.1.1 --- Geodesic Distance Approximation --- p.24
Chapter 3.1.1.1 --- Dijkstra ´ةs algorithm --- p.25
Chapter 3.1.1.2 --- Wavefront Propagation --- p.26
Chapter 3.1.2 --- Farthest Point Sampling --- p.27
Chapter 3.1.3 --- Curvature Estimation --- p.29
Chapter 3.1.4 --- Radial Basis Function (RBF) --- p.32
Chapter 3.1.5 --- Multi-dimensional Scaling (MDS) --- p.35
Chapter 3.1.5.1 --- Classical MDS --- p.35
Chapter 3.1.5.2 --- Fast MDS --- p.38
Chapter 3.2 --- Matching Processes --- p.40
Chapter 3.2.1 --- Posture Alignment --- p.42
Chapter 3.2.1.1 --- Sign Flip Correction --- p.43
Chapter 3.2.1.2 --- Input model Alignment --- p.49
Chapter 3.2.2 --- Surface Fitting --- p.52
Chapter 3.2.2.1 --- Optimizing Surface Fitness --- p.54
Chapter 3.2.2.2 --- Optimizing Surface Smoothness --- p.56
Chapter 3.2.3 --- Feature Matching Refinement --- p.59
Chapter 3.2.3.1 --- Feature descriptor --- p.61
Chapter 3.2.3.3 --- Feature Descriptor matching --- p.63
Chapter Chapter 4 --- Experimental Result --- p.66
Chapter 4.1 --- Result of the Fundamental Techniques --- p.66
Chapter 4.1.1 --- Geodesic Distance Approximation --- p.67
Chapter 4.1.2 --- Farthest Point Sampling (FPS) --- p.67
Chapter 4.1.3 --- Radial Basis Function (RBF) --- p.69
Chapter 4.1.4 --- Curvature Estimation --- p.70
Chapter 4.1.5 --- Multi-Dimensional Scaling (MDS) --- p.71
Chapter 4.2 --- Result of the Core Matching Processes --- p.73
Chapter 4.2.1 --- Posture Alignment Step --- p.73
Chapter 4.2.2 --- Surface Fitting Step --- p.78
Chapter 4.2.3 --- Feature Matching Refinement --- p.82
Chapter 4.2.4 --- Application of the proposed algorithm --- p.84
Chapter 4.2.4.1 --- Design Automation in Garment Industry --- p.84
Chapter 4.3 --- Analysis --- p.86
Chapter 4.3.1 --- Performance --- p.86
Chapter 4.3.2 --- Accuracy --- p.87
Chapter 4.3.3 --- Approach Comparison --- p.88
Chapter Chapter 5 --- Conclusion --- p.89
Chapter 5.1 --- Strength and contributions --- p.89
Chapter 5.2 --- Limitation and future works --- p.90
References --- p.91
39
"Matching properties and applications of compatible lateral bipolar transistors (CLBTs)." 2001. http://library.cuhk.edu.hk/record=b5895864.
Full textAbstract:
Hiu Yung Wong.Thesis (M.Phil.)--Chinese University of Hong Kong, 2001.
Includes bibliographical references (leaves 104-111).
Abstracts in English and Chinese.
Abstract --- p.i
Acknowledgments --- p.iii
List of Figures --- p.ix
List of Tables --- p.xiii
Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- Motivation and Objectives --- p.1
Chapter 1.2 --- Contributions --- p.3
Chapter 1.3 --- Organization of the Thesis --- p.4
Chapter 2 --- Devices and Fabrication Processes --- p.5
Chapter 2.1 --- Introduction --- p.5
Chapter 2.2 --- BJTs --- p.6
Chapter 2.2.1 --- Structure and Modeling of BJTs --- p.6
Chapter 2.2.2 --- Standard BJT Process and BJT Characteristics --- p.7
Chapter 2.3 --- MOSFETs and Complementary MOS (CMOS) --- p.8
Chapter 2.3.1 --- Structure and Modeling of MOSFETs --- p.8
Chapter 2.3.2 --- Standard n-well CMOS Process and MOSFETs Charac- teristics --- p.11
Chapter 2.4 --- BiCMOS Technology --- p.13
Chapter 2.5 --- Summary --- p.14
Chapter 3 --- Matching Properties --- p.15
Chapter 3.1 --- Introduction --- p.15
Chapter 3.2 --- Importance of Matched Devices in IC Design --- p.15
Chapter 3.2.1 --- What is Matching? --- p.15
Chapter 3.2.2 --- Low-power Systems --- p.16
Chapter 3.2.3 --- Device Size Downward Scaling --- p.16
Chapter 3.2.4 --- Analog Circuits and Analog Computing --- p.17
Chapter 3.3 --- Measurement of Mismatch --- p.18
Chapter 3.3.1 --- Definitions and Statistics of Mismatch --- p.18
Chapter 3.3.2 --- Types of Mismatches --- p.20
Chapter 3.3.3 --- Matching Properties of MOSFETs --- p.23
Chapter 3.3.4 --- Matching Properties of BJTs and CLBTs --- p.27
Chapter 3.4 --- Summary --- p.30
Chapter 4 --- CMOS Compatible Lateral Bipolar Transistors (CLBTs) --- p.31
Chapter 4.1 --- Introduction --- p.31
Chapter 4.2 --- Structure and Operation --- p.32
Chapter 4.3 --- DC Model of CLBTs --- p.34
Chapter 4.4 --- Residual Gate Effect in Accumulation --- p.35
Chapter 4.5 --- Main Characteristics of CLBTs --- p.37
Chapter 4.5.1 --- Low Early Voltage --- p.37
Chapter 4.5.2 --- Low Lateral Current Gain at High Current Levels --- p.38
Chapter 4.5.3 --- Other Issues --- p.39
Chapter 4.6 --- Enhanced CLBTs with Cascode Circuit --- p.40
Chapter 4.7 --- Applications --- p.41
Chapter 4.8 --- Design and Layout of CLBTs --- p.42
Chapter 4.9 --- Experimental Results of Single pnp CLBT； nMOSFET and pMOSFET --- p.44
Chapter 4.9.1 --- CLBT Gains --- p.46
Chapter 4.9.2 --- Gate Voltage Required for Pure Bipolar Action --- p.47
Chapter 4.9.3 --- I ´ؤ V and Other Characteristics of Bare pnp CLBTs --- p.49
Chapter 4.9.4 --- Transfer Characteristics of a Cascoded pnp CLBT --- p.50
Chapter 4.9.5 --- Transfer Characteristics of an nMOSFET --- p.51
Chapter 4.9.6 --- Transfer Characteristics of Cascoded and Bare CLBTs Operating as pMOSFETs --- p.52
Chapter 4.10 --- Summary --- p.53
Chapter 5 --- Experiments on Matching Properties --- p.54
Chapter 5.1 --- Introduction --- p.54
Chapter 5.2 --- Objectives --- p.55
Chapter 5.3 --- Technology --- p.57
Chapter 5.4 --- Design of Testing Arrays --- p.57
Chapter 5.4.1 --- nMOSFET Array --- p.57
Chapter 5.4.2 --- pnp CLBT Array --- p.59
Chapter 5.5 --- Design of Input and Output Pads (I/O Pads) --- p.62
Chapter 5.6 --- Shift Register --- p.62
Chapter 5.7 --- Experimental Equipment --- p.63
Chapter 5.8 --- Experimental Setup for Matching Properties Measurements --- p.65
Chapter 5.8.1 --- Setup for Measuring the Mismatches of the Devices --- p.65
Chapter 5.8.2 --- Testing Procedures --- p.68
Chapter 5.8.3 --- Data Analysis --- p.68
Chapter 5.9 --- Matching Properties --- p.69
Chapter 5.9.1 --- Matching Properties of nMOSFETs --- p.69
Chapter 5.9.2 --- Matching Properties of CLBTs --- p.71
Chapter 5.9.3 --- Matching Properties of pMOSFETs --- p.73
Chapter 5.9.4 --- "Comments on the Matching Properties of CLBT, nMOSFET, and pMOSFET" --- p.76
Chapter 5.9.5 --- "Mismatch in CLBT, nMOSFET, and pMOSFET Cur- rent Mirrors" --- p.77
Chapter 5.10 --- Summary --- p.79
Chapter 6 --- Conclusion --- p.80
Chapter A --- Floating Gate Technology --- p.82
Chapter A.1 --- Floating Gate --- p.82
Chapter A.2 --- Tunnelling --- p.83
Chapter A.3 --- Hot Electron Effect --- p.85
Chapter A.4 --- Summary --- p.86
Chapter B --- A Trimmable Transconductance Amplifier --- p.87
Chapter B.1 --- Introduction --- p.87
Chapter B.2 --- Trimmable Transconductance Amplifier using Floating Gate Com- patible Lateral Bipolar Transistors (FG-CLBTs) --- p.87
Chapter B.2.1 --- Residual Gate Effect and Collector Current Modulation --- p.89
Chapter B.2.2 --- Floating Gate CLBTs --- p.92
Chapter B.2.3 --- Electron Tunnelling --- p.93
Chapter B.2.4 --- Hot Electron Injection --- p.94
Chapter B.2.5 --- Experimental Results of the OTA --- p.94
Chapter B.2.6 --- Experimental Results of the FGOTA --- p.96
Chapter B.3 --- Summary --- p.97
Chapter C --- AMI-ABN 1.5μm n-well Process Parameters (First Batch) --- p.98
Chapter D --- AMI-ABN 1.5μm n-well Process Parameters (Second Batch) --- p.101
Bibliography --- p.104
40
"A matching algorithm for facial memory recall in forensic applications." 2000. http://library.cuhk.edu.hk/record=b5890306.
Full textAbstract:
by Lau Kwok Kin.Thesis (M.Phil.)--Chinese University of Hong Kong, 2000.
Includes bibliographical references (leaves 82-87).
Abstracts in English and Chinese.
List of Figures --- p.vi
List of Tables --- p.vii
Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- Objective of This Thesis --- p.3
Chapter 1.2 --- Organization of This Thesis --- p.3
Chapter 2 --- Literature Review --- p.4
Chapter 2.1 --- Facial Memory Recall --- p.4
Chapter 2.2 --- Facial Recognition --- p.6
Chapter 2.2.1 --- Earlier Approaches --- p.7
Chapter 2.2.2 --- Feature and Template Matching --- p.8
Chapter 2.2.3 --- Neural Network --- p.10
Chapter 2.2.4 --- Statistical Approach --- p.14
Chapter 3 --- A Forensic Application of Facial Recall --- p.19
Chapter 3.1 --- Motivation --- p.20
Chapter 3.2 --- AICAMS-FIT --- p.20
Chapter 3.2.1 --- The Facial Component Library --- p.21
Chapter 3.2.2 --- The Feature Selection Module --- p.24
Chapter 3.2.3 --- The Facial Construction Module --- p.24
Chapter 3.3 --- The Interaction Between The Three Main Components --- p.29
Chapter 3.4 --- Summary --- p.30
Chapter 4 --- Sketch-to-Sketch Matching --- p.31
Chapter 4.1 --- The Representation of A Composite Face --- p.31
Chapter 4.2 --- The Component-based Encoding Scheme --- p.32
Chapter 4.2.1 --- Local Feature Analysis --- p.34
Chapter 4.2.2 --- Similarity Matrix --- p.36
Chapter 4.3 --- Experimental Results and Evaluation --- p.41
Chapter 4.4 --- Shortcomings of the encoding scheme --- p.44
Chapter 4.4.1 --- Size Variation --- p.45
Chapter 4.5 --- Summary --- p.51
Chapter 5 --- Sketch-to-Photo/Photo-to-Sketch Matching --- p.52
Chapter 5.1 --- Principal Component Analysis --- p.53
Chapter 5.2 --- Experimental Setup --- p.56
Chapter 5.3 --- Experimental Results --- p.59
Chapter 5.3.1 --- Sketch-to-Photo Matching --- p.59
Chapter 5.3.2 --- Photo-to-Sketch Matching --- p.62
Chapter 5.4 --- Summary --- p.66
Chapter 6 --- Future Work --- p.67
Chapter 7 --- Conclusions --- p.70
Chapter A --- Image Library I --- p.72
Chapter A.1 --- The Database for Searching --- p.72
Chapter A.2 --- The Database for Testing --- p.74
Chapter B --- Image Library II --- p.75
Chapter B.1 --- The Photographic Database --- p.75
Chapter B.2 --- The Sketch Database --- p.77
Chapter C --- The Eigenfaces --- p.78
Chapter C.1 --- Eigenfaces of Photographic Database (N = 20) --- p.78
Chapter C.2 --- Eigenfaces of Photographic Database (N = 100) --- p.79
Chapter C.3 --- The Eigenfaces of Sketch Database --- p.81
Bibliography --- p.82
41
"Stream segregation and pattern matching techniques for polyphonic music databases." 2003. http://library.cuhk.edu.hk/record=b5891706.
Full textAbstract:
Szeto, Wai Man.Thesis (M.Phil.)--Chinese University of Hong Kong, 2003.
Includes bibliographical references (leaves 81-86).
Abstracts in English and Chinese.
Abstract --- p.ii
Acknowledgements --- p.vi
Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- Motivations and Aims --- p.1
Chapter 1.2 --- Thesis Organization --- p.6
Chapter 2 --- Preliminaries --- p.7
Chapter 2.1 --- Fundamentals of Music and Terminology --- p.7
Chapter 2.2 --- Findings in Auditory Psychology --- p.8
Chapter 3 --- Literature Review --- p.12
Chapter 3.1 --- Pattern Matching Techniques for Music Information Retrieval --- p.12
Chapter 3.2 --- Stream Segregation --- p.14
Chapter 3.3 --- Post-tonal Music Analysis --- p.15
Chapter 4 --- Proposed Method for Stream Segregation --- p.17
Chapter 4.1 --- Music Representation --- p.17
Chapter 4.2 --- Proposed Method --- p.19
Chapter 4.3 --- Application of Stream Segregation to Polyphonic Databases --- p.27
Chapter 4.4 --- Experimental Results --- p.30
Chapter 4.5 --- Summary --- p.36
Chapter 5 --- Proposed Approaches for Post-tonal Music Analysis --- p.38
Chapter 5.1 --- Pitch-Class Set Theory --- p.39
Chapter 5.2 --- Sequence-Based Approach --- p.43
Chapter 5.2.1 --- Music Representation --- p.43
Chapter 5.2.2 --- Matching Conditions --- p.44
Chapter 5.2.3 --- Algorithm --- p.46
Chapter 5.3 --- Graph-Based Approach --- p.47
Chapter 5.3.1 --- Graph Theory and Its Notations --- p.48
Chapter 5.3.2 --- Music Representation --- p.50
Chapter 5.3.3 --- Matching Conditions --- p.53
Chapter 5.3.4 --- Algorithm --- p.57
Chapter 5.4 --- Experiments --- p.67
Chapter 5.4.1 --- Experiment 1 --- p.67
Chapter 5.4.2 --- Experiment 2 --- p.68
Chapter 5.4.3 --- Experiment 3 --- p.70
Chapter 5.4.4 --- Experiment 4 --- p.75
Chapter 6 --- Conclusion --- p.79
Bibliography --- p.81
A Publications --- p.87
42
Jann, Dominic 1983. "Bayesian Logistic Regression with Jaro-Winkler String Comparator Scores Provides Sizable Improvement in Probabilistic Record Matching." Thesis, 2012. http://hdl.handle.net/1969.1/148078.
Full textAbstract:
Record matching is a fundamental and ubiquitous part of today?s society. Anything from typing in a password in order to access your email to connecting existing health records in California with new health records in New York requires matching records together. In general, there are two types of record matching algorithms: deterministic, a more rules-based approach, and probabilistic, a model-based approach. Both types have their advantages and disadvantages. If the amount of data is relatively small, deterministic algorithms yield very high success rates. However, the number of common mistakes, and subsequent rules, becomes astronomically large as the sizes of the datasets increase. This leads to a highly labor-intensive process updating and maintaining the matching algorithm. On the other hand, probabilistic record matching implements a mathematical model that can take into account keying mistakes, does not require as much maintenance and over- head, and provides a probability that two particular entities should be linked. At the same time, as a model, assumptions need to be met, fitness has to be assessed, and predictions can be incorrect. Regardless of the type of algorithm, nearly all utilize a 0/1 field-matching structure, including the Fellegi-Sunter algorithm from 1969. That is to say that either the fields match entirely, or they do not match at all. As a result, typographical errors can get lost and false negatives can result. My research has yielded that using Jaro-Winkler string comparator scores as predictors to a Bayesian logistic regression model in lieu of a restrictive binary structure yields marginal improvement over current methodologies.
43
"Named entity translation matching and learning with mining from multilingual news." 2004. http://library.cuhk.edu.hk/record=b5892099.
Full textAbstract:
Cheung Pik Shan.Thesis (M.Phil.)--Chinese University of Hong Kong, 2004.
Includes bibliographical references (leaves 79-82).
Abstracts in English and Chinese.
Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- Named Entity Translation Matching --- p.2
Chapter 1.2 --- Mining New Translations from News --- p.3
Chapter 1.3 --- Thesis Organization --- p.4
Chapter 2 --- Related Work --- p.5
Chapter 3 --- Named Entity Matching Model --- p.9
Chapter 3.1 --- Problem Nature --- p.9
Chapter 3.2 --- Matching Model Investigation --- p.12
Chapter 3.3 --- Tokenization --- p.15
Chapter 3.4 --- Hybrid Semantic and Phonetic Matching Algorithm --- p.16
Chapter 4 --- Phonetic Matching Model --- p.22
Chapter 4.1 --- Generating Phonetic Representation for English --- p.22
Chapter 4.1.1 --- Phoneme Generation --- p.22
Chapter 4.1.2 --- Training the Tagging Lexicon and Transformation Rules --- p.25
Chapter 4.2 --- Generating Phonetic Representation for Chinese --- p.29
Chapter 4.3 --- Phonetic Matching Algorithm --- p.31
Chapter 5 --- Learning Phonetic Similarity --- p.37
Chapter 5.1 --- The Widrow-Hoff Algorithm --- p.39
Chapter 5.2 --- The Exponentiated-Gradient Algorithm --- p.41
Chapter 5.3 --- The Genetic Algorithm --- p.42
Chapter 6 --- Experiments on Named Entity Matching Model --- p.43
Chapter 6.1 --- Results for Learning Phonetic Similarity --- p.44
Chapter 6.2 --- Results for Named Entity Matching --- p.46
Chapter 7 --- Mining New Entity Translations from News --- p.48
Chapter 7.1 --- Metadata Generation --- p.52
Chapter 7.2 --- Discovering Comparable News Cluster --- p.54
Chapter 7.2.1 --- News Preprocessing --- p.54
Chapter 7.2.2 --- Gloss Translation --- p.55
Chapter 7.2.3 --- Comparable News Cluster Discovery --- p.62
Chapter 7.3 --- Named Entity Cognate Generation --- p.64
Chapter 7.4 --- Entity Matching --- p.66
Chapter 7.4.1 --- Matching Algorithm --- p.66
Chapter 7.4.2 --- Matching Result Production --- p.68
Chapter 8 --- Experiments on Mining New Translations --- p.69
Chapter 9 --- Experiments on Context-based Gloss Translation --- p.72
Chapter 9.1 --- Results on Chinese News Translation --- p.73
Chapter 9.2 --- Results on Arabic News Translation --- p.75
Chapter 10 --- Conclusions and Future Work --- p.77
Bibliography --- p.79
A --- p.83
B --- p.85
C --- p.87
D --- p.89
E --- p.91
F --- p.94
G --- p.95
44
"Generalized surface geometry estimation in photometric stereo and two-view stereo matching." 2011. http://library.cuhk.edu.hk/record=b5894611.
Full textAbstract:
Hung, Chun Ho.Thesis (M.Phil.)--Chinese University of Hong Kong, 2011.
Includes bibliographical references (p. 58-63).
Abstracts in English and Chinese.
Chapter 1 --- Introduction --- p.1
Chapter 2 --- Generalized Photometric Stereo --- p.6
Chapter 2.1 --- Problem Description --- p.6
Chapter 2.2 --- Related Work --- p.9
Chapter 2.3 --- Photometric Stereo with Environment Lighting --- p.11
Chapter 2.4 --- Estimating Surface Normals --- p.13
Chapter 2.4.1 --- Surface Normal and Albedo Estimation --- p.14
Chapter 2.5 --- Data Acquisition Configuration --- p.17
Chapter 2.6 --- Issues --- p.19
Chapter 2.7 --- Outlier Removal --- p.22
Chapter 2.8 --- Experimental Results --- p.23
Chapter 3 --- Generalized Stereo Matching --- p.30
Chapter 3.1 --- Problem Description --- p.30
Chapter 3.2 --- Related Work --- p.32
Chapter 3.3 --- Our Approach --- p.33
Chapter 3.3.1 --- Notations and Problem Introduction --- p.33
Chapter 3.3.2 --- Depth and Motion Initialization --- p.35
Chapter 3.3.3 --- Volume-based Structure Prior --- p.38
Chapter 3.3.4 --- Objective Function with Volume-based Priors --- p.43
Chapter 3.3.5 --- Numerical Solution --- p.46
Chapter 3.4 --- Results --- p.48
Chapter 4 --- Conclusion --- p.56
Bibliography --- p.57
45
"Constraint optimization techniques for graph matching applicable to 3-D object recognition." Chinese University of Hong Kong, 1996. http://library.cuhk.edu.hk/record=b5888888.
Full textAbstract:
by Chi-Min Pang.Thesis (M.Phil.)--Chinese University of Hong Kong, 1996.
Includes bibliographical references (leaves 110-[115]).
Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- Range Images --- p.1
Chapter 1.2 --- Rigid Body Model --- p.3
Chapter 1.3 --- Motivation --- p.4
Chapter 1.4 --- Thesis Outline --- p.6
Chapter 2 --- Object Recognition by Relaxation Processes --- p.7
Chapter 2.1 --- An Overview of Probabilistic Relaxation Labelling --- p.8
Chapter 2.2 --- Formulation of Model-matching Problem Solvable by Probabilistic Relaxation --- p.10
Chapter 2.2.1 --- Compatibility Coefficient --- p.11
Chapter 2.2.2 --- Match Score --- p.13
Chapter 2.2.3 --- Iterative Algorithm --- p.14
Chapter 2.2.4 --- A Probabilistic Concurrent Matching Scheme --- p.15
Chapter 2.3 --- Formulation of Model-merging Problem Solvable by Fuzzy Relaxation --- p.17
Chapter 2.3.1 --- Updating Mechanism --- p.17
Chapter 2.3.2 --- Iterative Algorithm --- p.19
Chapter 2.3.3 --- Merging Sub-Rigid Body Models --- p.20
Chapter 2.4 --- Simulation Results --- p.21
Chapter 2.4.1 --- Experiments in Model-matching Using Probabilistic Relaxation --- p.22
Chapter 2.4.2 --- Experiments in Model-matching Using Probabilistic Concur- rent Matching Scheme --- p.26
Chapter 2.4.3 --- Experiments in Model-merging Using Fuzzy Relaxation --- p.33
Chapter 2.5 --- Summary --- p.36
Chapter 3 --- Object Recognition by Hopfield Network --- p.37
Chapter 3.1 --- An Overview of Hopfield Network --- p.38
Chapter 3.2 --- Model-matching Problem Solved by Hopfield Network --- p.41
Chapter 3.2.1 --- Representation of the Solution --- p.41
Chapter 3.2.2 --- Energy Function --- p.42
Chapter 3.2.3 --- Equations of Motion --- p.46
Chapter 3.2.4 --- Interpretation of Solution --- p.49
Chapter 3.2.5 --- Convergence of the Hopfield Network --- p.50
Chapter 3.2.6 --- Iterative Algorithm --- p.51
Chapter 3.3 --- Estimation of Distance Threshold Value --- p.53
Chapter 3.4 --- Cooperative Concurrent Matching Scheme --- p.55
Chapter 3.4.1 --- Scheme for Recognizing a Single Object --- p.56
Chapter 3.4.2 --- Scheme for Recognizing Multiple Objects --- p.60
Chapter 3.5 --- Simulation Results --- p.60
Chapter 3.5.1 --- Experiments in the Model-matching Problem Using a Hopfield Network --- p.61
Chapter 3.5.2 --- Experiments in Model-matching Problem Using Cooperative Concurrent Matching --- p.69
Chapter 3.5.3 --- Experiments in Model-merging Problem Using Hopfield Network --- p.77
Chapter 3.6 --- Summary --- p.80
Chapter 4 --- Genetic Generation of Weighting Parameters for Hopfield Network --- p.83
Chapter 4.1 --- An Overview of Genetic Algorithms --- p.84
Chapter 4.2 --- Determination of Weighting Parameters for Hopfield Network --- p.86
Chapter 4.2.1 --- Chromosomal Representation --- p.87
Chapter 4.2.2 --- Initial Population --- p.88
Chapter 4.2.3 --- Evaluation Function --- p.88
Chapter 4.2.4 --- Genetic Operators --- p.89
Chapter 4.2.5 --- Control Parameters --- p.91
Chapter 4.2.6 --- Iterative Algorithm --- p.94
Chapter 4.3 --- Simulation Results --- p.95
Chapter 4.3.1 --- Experiments in Model-matching Problem using Hopfield Net- work with Genetic Generated Parameters --- p.95
Chapter 4.3.2 --- Experiments in Model-merging Problem Using Hopfield Network --- p.101
Chapter 4.4 --- Summary --- p.104
Chapter 5 --- Conclusions --- p.106
Chapter 5.1 --- Conclusions --- p.106
Chapter 5.2 --- Suggestions for Future Research --- p.109
Bibliography --- p.110
Chapter A --- Proof of Convergence of Fuzzy Relaxation Process --- p.116
46
"Performance analysis of iterative matching scheduling algorithms in ATM input-buffered switches." 1999. http://library.cuhk.edu.hk/record=b5889961.
Full textAbstract:
by Cheng Sze Wan.Thesis (M.Phil.)--Chinese University of Hong Kong, 1999.
Includes bibliographical references (leaves 72-[76]).
Abstracts in English and Chinese.
Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- Background --- p.1
Chapter 1.2 --- Traffic Scheduling in Input-buffered Switches .。 --- p.3
Chapter 1.3 --- Organization of Thesis --- p.7
Chapter 2 --- Principle of Enchanced PIM Algorithm --- p.8
Chapter 2.1 --- Introduction --- p.8
Chapter 2.1.1 --- Switch Model --- p.9
Chapter 2.2 --- Enhanced Parallel Iterative Matching Algorithm (EPIM) --- p.10
Chapter 2.2.1 --- Motivation --- p.10
Chapter 2.2.2 --- Algorithm --- p.12
Chapter 2.3 --- Performance Evaluation --- p.16
Chapter 2.3.1 --- Simulation --- p.16
Chapter 2.3.2 --- Delay Analysis --- p.18
Chapter 3 --- Providing Bandwidth Guarantee in Input-Buffered Switches --- p.25
Chapter 3.1 --- Introduction --- p.25
Chapter 3.2 --- Bandwidth Reservation in Static Scheduling Algorithm --- p.26
Chapter 3.3 --- Incorporation of Dynamic and Static Scheduling Algorithms .。 --- p.32
Chapter 3.4 --- Simulation --- p.34
Chapter 3.4.1 --- Switch Model --- p.35
Chapter 3.4.2 --- Simulation Results --- p.36
Chapter 3.5 --- Comparison with Existing Schemes --- p.42
Chapter 3.5.1 --- Statistical Matching --- p.42
Chapter 3.5.2 --- Weighted Probabilistic Iterative Matching --- p.45
Chapter 4 --- EPIM and Cross-Path Switch --- p.50
Chapter 4.1 --- Introduction --- p.50
Chapter 4.2 --- Concept of Cross-Path Switching --- p.51
Chapter 4.2.1 --- Principle --- p.51
Chapter 4.2.2 --- Supporting Performance Guarantee in Cross-Path Switch --- p.52
Chapter 4.3 --- Implication of EPIM on Cross-Path switch --- p.55
Chapter 4.3.1 --- Problem Re-definition --- p.55
Chapter 4.3.2 --- Scheduling in Input Modules with EPIM --- p.58
Chapter 4.4 --- Simulation --- p.63
Chapter 5 --- Conclusion --- p.70
Bibliography --- p.72
47
"Statistical matching using imputation: survival analysis for residents in Hong Kong 1991-1995." 1998. http://library.cuhk.edu.hk/record=b5889751.
Full textAbstract:
by Siu-Fai Leung.Thesis (M.Phil.)--Chinese University of Hong Kong, 1998.
Includes bibliographical references (leaves 80-81).
Abstract also in Chinese.
Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- Mortality and Socioeconomic Status --- p.1
Chapter 1.2 --- Research Plan and Difficulties Encountered in the Study --- p.4
Chapter 2 --- Imputation and File Merging --- p.8
Chapter 2.1 --- Structure and Contents of Data Sets --- p.8
Chapter 2.2 --- Imputation of Missing Values --- p.14
Chapter 2.3 --- Merging Data Sets --- p.22
Chapter 2.3.1 --- Merging Death Data and Census Data --- p.22
Chapter 2.3.2 --- Merging Two Census Data Sets --- p.29
Chapter 2.3.3 --- Final Data Set Used in Modeling --- p.31
Chapter 3 --- Modeling and Estimation --- p.33
Chapter 3.1 --- Discrete-Time Hazard Function Analysis --- p.33
Chapter 3.1.1 --- The Hazard Function --- p.34
Chapter 3.1.2 --- Logistic Regression --- p.36
Chapter 3.2 --- Application of Discrete-Time Hazard Model on the Death Data Set --- p.37
Chapter 3.2.1 --- Preparing the Person-Period Data Set --- p.38
Chapter 3.2.2 --- Modeling the Person-Period Data Set --- p.41
Chapter 3.3 --- Combining Results from different imputed data sets --- p.47
Chapter 3.4 --- Estimation of Cell Probabilities --- p.51
Chapter 4 --- Model Adequacy Checking --- p.52
Chapter 4.1 --- The Definition of Residuals in Multiple Imputation --- p.52
Chapter 4.2 --- Residual Analysis of The Cancer Mortality Model --- p.59
Chapter 5 --- Conclusion --- p.63
Chapter 5.1 --- The Cancer Mortality --- p.63
Chapter 5.2 --- Competing Risk --- p.68
Chapter 5.3 --- Discussion --- p.72
Appendix A: Coding Description of District --- p.75
Appendix B: Results of the Heart Diseases Mortality Model --- p.76
Bibliography --- p.80
48
"Fast pattern matching in Walsh-Hadamard domain and its application in video processing." 2006. http://library.cuhk.edu.hk/record=b5892780.
Full textAbstract:
Li Ngai.Thesis (M.Phil.)--Chinese University of Hong Kong, 2006.
Includes bibliographical references.
Abstracts in English and Chinese.
Chapter Chapter 1. --- Introduction --- p.1-1
Chapter 1.1. --- A Brief Review on Pattern Matching --- p.1-1
Chapter 1.2. --- Objective of the Research Work --- p.1-5
Chapter 1.3. --- Organization of the Thesis --- p.1-6
Chapter 1.4. --- Notes on Publications --- p.1-7
Chapter Chapter 2. --- Background Information --- p.2-1
Chapter 2.1. --- Introduction --- p.2-1
Chapter 2.2. --- Review of Block Based Pattern Matching --- p.2-3
Chapter 2.2.1 --- Gradient Descent Strategy --- p.2-3
Chapter 2.2.2 --- Simplified Matching Operations --- p.2-10
Chapter 2.2.3 --- Fast Full-Search Methods --- p.2-14
Chapter 2.2.4 --- Transform-domain Manipulations --- p.2-19
Chapter Chapter 3. --- Statistical Rejection Threshold for Pattern Matching --- p.3-1
Chapter 3.1. --- Introduction --- p.3-1
Chapter 3.2. --- Walsh Hadamard Transform --- p.3-3
Chapter 3.3. --- Coarse-to-fine Pattern Matching in Walsh Hadamard Domain --- p.3-4
Chapter 3.3.1. --- Bounding Euclidean Distance in Walsh Hadamard Domain --- p.3-5
Chapter 3.3.2. --- Fast Projection Scheme --- p.3-9
Chapter 3.3.3. --- Using the Projection Scheme for Pattern Matching --- p.3-17
Chapter 3.4. --- Statistical Rejection Threshold --- p.3-18
Chapter 3.5. --- Experimental Results --- p.3-22
Chapter 3.6. --- Conclusions --- p.3-29
Chapter 3.7. --- Notes on Publication --- p.3-30
Chapter Chapter 4. --- Fast Walsh Search --- p.4-1
Chapter 4.1. --- Introduction --- p.4-1
Chapter 4.2. --- Approximating Sum-of-absolute Difference Using PS AD --- p.4-3
Chapter 4.3. --- Two-level Threshold Scheme --- p.4-6
Chapter 4.4. --- Block Matching Using SADDCC --- p.4-10
Chapter 4.5. --- Optimization of Threshold and Number of Coefficients in PSAD --- p.4-15
Chapter 4.6. --- Candidate Elimination by the Mean of PSAD --- p.4-23
Chapter 4.7. --- Computation Requirement --- p.4-28
Chapter 4.8. --- Experimental Results --- p.4-32
Chapter 4.9. --- Conclusions --- p.4-45
Chapter 4.10. --- Notes on Publications --- p.4-46
Chapter Chapter 5. --- Conclusions & Future Works --- p.5-1
Chapter 5.1. --- Contributions and Conclusions --- p.5-1
Chapter 5.1.1. --- Statistical Rejection Threshold for Pattern Matching --- p.5-2
Chapter 5.1.2. --- Fast Walsh Search --- p.5-3
Chapter 5.2. --- Future Works --- p.5-4
References --- p.I
49
"Work-family interface and outcomes: testing the matching-domain hypothesis in Chinese samples." 2012. http://library.cuhk.edu.hk/record=b5549678.
Full textAbstract:
本研究旨在探讨工作家庭交互作用与匹配领域的变量之间的关系，即，工作家庭交互作用与一开始引发它的领域中的两个结果变量(满意度和绩效)之间的关系。本研究共有三个研究问题:(1)这种匹配领域的关系是否能推广到中国样本中? (2)工作家庭交互作用和满意度/绩效之间，到底谁是因谁是果? (3)在这个过程中，情绪是否有中介作用? 研究一在一个教师群体中采用横断面研究，并发现在控制了交互领域(即工作家庭交互作用的被影响的领域)的作用之后，匹配领域的关系在满意度上仍然显著，但是在绩效这个因变量上不显著。研究二在一个以孩子家长组成的样本中采用一个周期为两周的日记法以及间隔时间为一周的跨时间的数据进行交互验证，并发现是匹配领域中的满意度导致了工作家庭交互作用，而不是反过来。并且发现对于绩效来说，只有交互领域的关系是显著的，并且在这个关系中，绩效是果而不是因。对于情绪的作用，研究结果并不一致。基于以上结果，对研究意义、不足和展望进行了讨论。This study focused on the matching-domain relationship in work-family interface (WFI), i.e., the relationship between WFI and two outcome variables of satisfaction and performance in the originating domain. There were three research questions:(1) whether such relationship could be generalized in Chinese samples;(2) what was the causal relationship between the variables; and (3) whether emotions could mediate such relationship. Study 1 was a cross-sectional research conducted with Chinese teacher. We found that after controlling the cross-domain (i.e., the receiving domain) relationship, the matching-domain effect of WFI was still significant on satisfaction but not on performance. Study 2 consisted of a two-week daily diary data and a one-week interval cross-time data on a group of Chinese parents. It cross-validated that it was the matching-domain satisfaction caused WFI but not the reversed. Also, we found that performance was only significant in the cross-domain relationship and WFI was the cause rather than the result in this relationship. Finding on the role of emotions on the aforesaid relationship was inconsistent. Implications, limitations and future directions were discussed based on the above findings.
Detailed summary in vernacular field only.
Cao, Hui.
"November 2011."
Thesis (Ph.D.)--Chinese University of Hong Kong, 2012.
Includes bibliographical references (leaves 112-123).
Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web.
Abstract also in Chinese; appendixes in Chinese.
Acknowledgements --- p.IV
Table of Contents --- p.V
List of Tables --- p.VII
List of Figures --- p.IX
English Abstract --- p.II
Chinese Abstract --- p.III
Chapter Chapter 1 --- Literature Review --- p.1
Concept of work-family interface --- p.2
Summary on the concept of work-family interface --- p.10
Framework of Work-family Interface --- p.15
Chapter Chapter 2 --- The Present Study --- p.23
Research question 1: the phenomenon of matching-domain relationship between WFI and outcome variables --- p.23
Hypotheses on the phenomenon of matching-domain hypothesis in Chinese sample --- p.29
Research question 2: the causal relationship between WFI and matching-domain satisfaction/performance --- p.30
Hypotheses on the causal relationship between WFI and matching-domain satisfaction/performance --- p.35
Research question 3: the mediation effect of emotion --- p.36
Design of the present study --- p.38
Chapter Chapter 3 --- Study 1: Cross-Sectional Study --- p.41
Method --- p.42
Results --- p.46
Discussion --- p.56
Chapter Chapter 4 --- Study 2: Daily Diary Study --- p.61
Methods --- p.61
Results --- p.73
Discussion --- p.94
Chapter Chapter 5 --- General Discussion --- p.100
Summary of the Results --- p.100
Implications --- p.103
Limitations --- p.106
Future directions --- p.108
References --- p.112
Chapter Appendix 1 --- The Chinese Version of Work-family Interface Scale used in Study I and Posttest of Study 2 --- p.124
Chapter Appendix 2 --- The Chinese Version of Work Satisfaction Scale, Family Satisfaction Scale, Work performance Scale, and Family Performance Scale used in Study 1 and Posttets of Study 2 --- p.125
50
"Generation and sequencing of cDNA matching SAGE tags for gene identification in Lentinula edodes." 2005. http://library.cuhk.edu.hk/record=b5896450.
Full textAbstract:
Hui Cheung.Thesis (M.Phil.)--Chinese University of Hong Kong, 2005.
Includes bibliographical references (leaves 166-172).
Abstracts in English and Chinese.
Abstract --- p.iii
Acknowledgments --- p.vi
Abbreviations --- p.vii
Table of Contents --- p.viii
Table of Figures --- p.xiii
Table of Tables --- p.xviii
Chapter Chapter 1. --- Literature Reviews
Chapter 1.1 --- Functional Genomics and Its Developments --- p.1
Chapter 1.1.1 --- Introduction --- p.1
Chapter 1.1.2 --- "Transcriptomics, Proteomics and Metabolomics" --- p.1
Chapter 1.1.3 --- Gene-perturbing Strategies --- p.3
Chapter 1.1.4 --- Applications of Functional Genomics --- p.4
Chapter 1.2 --- Serial Analysis of Gene Expression (SAGE) and Generation of Longer cDNA Fragments from SAGE tags for Gene Identification (GLGI) --- p.6
Chapter 1.2.1 --- Introduction --- p.6
Chapter 1.2.2 --- Principles and Methods of SAGE --- p.6
Chapter 1.2.3 --- Data Analysis --- Bioinformatics --- p.9
Chapter 1.2.4 --- Applications of SAGE --- p.9
Chapter 1.2.5 --- Modifications of SAGE --- p.10
Chapter 1.2.6 --- Principles and Methods of GLGI --- p.11
Chapter 1.2.7 --- Applications and Improvements of GLGI --- p.14
Chapter 1.3 --- Transformation --- p.15
Chapter 1.3.1 --- Introduction --- p.15
Chapter 1.3.2 --- Different Methods of Transformation --- p.15
Chapter 1.3.2.1 --- General Transformation Strategy --- p.15
Chapter 1.3.2.2 --- Polyethylene Glycol (PEG)-mediated Transformation --- p.16
Chapter 1.3.2.3 --- Restriction Enzyme Mediated Integration (REMI) --- p.16
Chapter 1.3.2.4 --- Electroporation --- p.17
Chapter 1.3.2.5 --- Particle Bombardment --- p.17
Chapter 1.3.3 --- The Future Needs of Transformation --- p.18
Chapter 1.4 --- RNA Silencing --- p.20
Chapter 1.4.1 --- Introduction --- p.20
Chapter 1.4.2 --- Major Components and Principles of RNAi --- p.21
Chapter 1.4.3 --- Applications of RNA Silencing --- p.23
Chapter 1.5 --- The Target Organism Lentinula edodes --- p.25
Chapter 1.5.1 --- Introduction --- p.25
Chapter 1.5.2 --- The Life Cycle of L. edodes --- p.26
Chapter 1.5.3 --- Biochemical and Molecular Studies on L. edodes --- p.27
Chapter 1.5.4 --- Prospectus --- p.29
Chapter Chapter 2. --- Development of Methods for Studying Gene Function in Lentinula edodes
Chapter 2.1 --- Introduction --- p.30
Chapter 2.2 --- Materials and Methods --- p.32
Chapter 2.2.1 --- Cultivation of Lentinula edodes --- p.32
Chapter 2.2.2 --- Proplast Release and Regeneration --- p.32
Chapter 2.2.3 --- Preparation of Plasmid DNA --- p.33
Chapter 2.2.4 --- Selectable Marker …Bialaphos --- p.35
Chapter 2.2.5 --- Transformation --- p.35
Chapter 2.2.5.1 --- Electroporation --- p.35
Chapter 2.2.5.2 --- PEG-mediated Transformation --- p.36
Chapter 2.3 --- Results --- p.37
Chapter 2.3.1 --- Cultivation of Lentinula edodes --- p.37
Chapter 2.3.2 --- Proplast Release and Regeneration --- p.37
Chapter 2.3.3 --- Preparation of Plasmid DNA --- p.43
Chapter 2.3.4 --- Selectable Marker--- Bialaphos --- p.43
Chapter 2.3.5 --- Transformation --- p.46
Chapter 2.3.5.1 --- Electroporation --- p.46
Chapter 2.3.5.2 --- PEG-mediated Transformation --- p.46
Chapter 2.4 --- Discussions and Conclusions --- p.57
Chapter Chapter 3. --- Identification of Interested Genes in Expression Profile of SAGE using GLGI Method.
Chapter 3.1 --- Introduction --- p.61
Chapter 3.1.1 --- Results of SAGE Analysis --- p.61
Chapter 3.1.2 --- Use of GLGI Method for Extension of SAGE Tags --- p.63
Chapter 3.1.3 --- 5´ة Extension of GLGI (5'GLGI) --- p.65
Chapter 3.1.3.1 --- Introduction --- p.65
Chapter 3.1.3.2 --- "Overall strategy of 5, GLGI Method" --- p.67
Chapter 3.1.3.3 --- Two-Steps PCR Method --- p.69
Chapter 3.2 --- Generation of Longer cDNA Fragments from SAGE tags for Gene Identification (GLGI) --- p.71
Chapter 3.2.1 --- Materials and Methods (GLGI Analysis) --- p.71
Chapter 3.2.1.1 --- Total RNA Extraction --- p.71
Chapter 3.2.1.2 --- Messenger RNA (mRNA) Extraction --- p.72
Chapter 3.2.1.3 --- Preparation of 3´ة cDNA for GLGI --- p.73
Chapter 3.2.1.4 --- NIaIII digestion of double strand cDNA --- p.74
Chapter 3.2.1.5 --- PCR amplification of the 3'-cDNAs (Optional) --- p.77
Chapter 3.2.1.6 --- GLGI Amplification of The Target Template --- p.80
Chapter 3.2.1.7 --- DNA Cloning (Optional) --- p.82
Chapter 3.2.1.8 --- Sequencing of GLGI PCR products --- p.85
Chapter 3.2.2 --- 5' Materials and Methods (5' GLGI Analysis) --- p.86
Chapter 3.2.2.1 --- Preparation of unique antisense primers --- p.86
Chapter 3.2.2.2 --- 5' extension of GLGI products --- p.87
Chapter 3.2.2.3 --- DNA Cloning (Optional) --- p.89
Chapter 3.2.2.4 --- Sequencing of 5' GLGI PCR products --- p.89
Chapter 3.2.3 --- Results (GLGI Analysis) --- p.90
Chapter 3.2.3.1 --- Total RNA Extraction --- p.90
Chapter 3.2.3.2 --- Messenger RNA Extraction --- p.90
Chapter 3.2.3.3 --- Preparation of 3' cDNA for GLGI --- p.90
Chapter 3.2.3.4 --- NIaIII digestion of double strand cDNA --- p.94
Chapter 3.2.3.5 --- GLGI Amplification of The Target Template --- p.94
Chapter 3.2.3.6 --- Sequencing of GLGI PCR products --- p.103
Chapter 3.2.4 --- Results (5' GLGI Analysis) --- p.111
Chapter 3.2.4.1 --- 5' extension of GLGI products --- p.111
Chapter 3.2.4.2 --- Sequencing of 5´ة GLGI PCR products --- p.116
Chapter 3.3 --- Discussions and Conclusions --- p.126
Chapter 3.3.1 --- GLGI amplification of the target template --- p.126
Chapter 3.3.2 --- 5' extension of GLGI products --- p.129
Chapter 3.3.3 --- Two-Steps PCR Method --- p.130
Chapter 3.3.4 --- Sequencing results of GLGI method and 5' GLGI method --- p.131
Chapter Chapter 4. --- Identification of Unknown EST Using PCR Method With cDNA Library
Chapter 4.1 --- Introduction --- p.134
Chapter 4.2 --- Materials and Methods --- p.134
Chapter 4.2.1 --- Extension of 5' end of EST sequence by PCR method --- p.134
Chapter 4.2.2 --- Purification of PCR products --- p.136
Chapter 4.2.3 --- Sequencing of Extended EST products --- p.136
Chapter 4.3 --- Results --- p.137
Chapter 4.3.1 --- Extension of 5' end of EST sequence by PCR method --- p.137
Chapter 4.3.2 --- Sequencing of Extended EST products --- p.137
Chapter 4.4 --- Discussions and Conclusions --- p.147
Chapter Chapter 5. --- General Discussions --- p.151
Appendix I --- p.156
Reference --- p.166