Dissertations / Theses on the topic 'Fat pattern'
To see the other types of publications on this topic, follow the link: Fat pattern.
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 'Fat pattern.'
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
Chlebowski, Rowan T., Aaron K. Aragaki, Garnet L. Anderson, Cynthia A. Thomson, JoAnn E. Manson, Michael S. Simon, Barbara V. Howard, et al. "Low-Fat Dietary Pattern and Breast Cancer Mortality in the Women’s Health Initiative Randomized Controlled Trial." AMER SOC CLINICAL ONCOLOGY, 2017. http://hdl.handle.net/10150/625754.
Full textAbstract:
Purpose Earlier Women's Health Initiative Dietary Modification trial findings suggested that a low-fat eating pattern may reduce breast cancers with greater mortality. Therefore, as a primary outcome-related analysis from a randomized prevention trial, we examined the long-term influence of this intervention on deaths as a result of and after breast cancer during 8.5 years (median) of dietary intervention and cumulatively for all breast cancers diagnosed during 16.1 years (median) of follow-up. Patients and Methods The trial randomly assigned 48,835 postmenopausal women with normal mammograms and without prior breast cancer from 1993 to 1998 at 40 US clinical centers to a dietary intervention with goals of a reduction of fat intake to 20% of energy and an increased intake of fruits, vegetables, and grains (40%; n = 19,541) or to a usual diet comparison (60%; n = 29,294). Results In the dietary group, fat intake and body weight decreased (all P < .001). During the 8.5-year dietary intervention, with 1,764 incident breast cancers, fewer deaths occurred as a result of breast cancer in the dietary group, which was not statistically significant (27 deaths [0.016% per year] v 61 deaths [0.024% per year]; hazard ratio [HR], 0.67; 95% CI, 0.43 to 1.06; P = .08). During the same period, deaths after breast cancer (n = 134) were significantly reduced (40 deaths [0.025% per year] v 94 deaths [0.038% per year]; HR, 0.65; 95% CI, 0.45 to 0.94; P = .02) by the dietary intervention. During the 16.1-year follow-up, with 3,030 incident breast cancers, deaths after breast cancer also were significantly reduced (234 deaths [0.085% per year] v 443 deaths [0.11% per year]; HR, 0.82; 95% CI, 0.70 to 0.96; P = .01) in the dietary group. Conclusion Compared with a usual diet comparison group, a low-fat dietary pattern led to a lower incidence of deaths after breast cancer. (C) 2017 by American Society of Clinical Oncology
2
Moore, Rebecca. "The relationship between a dietary pattern high in fruits, vegetables, low fat dairy, and whole grains and low in red meat and vascular structure and function in individuals with type 2 diabetes." University of Cincinnati / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1439307990.
Full text
3
Alejo, Willy, Daniel Rodriguez, Guillermo Kemper, and Universidad Peruana de Ciencias Aplicadas (UPC). "A biometric method based on the matching of dilated and skeletonized IR images of the veins map of the dorsum of the hand." IEEE, 2015. http://hdl.handle.net/10757/556175.
Full textAbstract:
ArticleThis work proposes a biometric identification system that works together with a palm vein reader sensor and a hand-clenching support, designed to perform the capture the back of the hand. Several processing steps were performed: extraction of the region of interest, binarization, dilation, noise filtering, skeletonization, as well as extraction and verification of patterns based on the measurment of coincidence of vertical and horizontal displacements of skeletonized and dilated images. The proposed method achieved the following results: processing time post capture of 1.8 seconds, FRR of 0.47% and FAR of 0,00%, with a referential database of 50 people from a total of 1500 random captures.
4
Speakman, Skyler. "Fast Constrained Subset Scanning for Pattern Detection." Research Showcase @ CMU, 2014. http://repository.cmu.edu/dissertations/434.
Full text
5
Fitch, Alistair John. "Fast statistically robust image registration." Thesis, University of Surrey, 2003. http://epubs.surrey.ac.uk/844612/.
Full textAbstract:
Image registration is the automatic alignment of images. It is a fundamental task in computer vision. Image registration is challenging, in part, because of the wide range of applications with an equally wide range of content. Applications that require the automatic alignment of images include: super-resolution, face detection, video coding, medical imaging, mosaicking, post-production video effects, and satellite image registration. The wide and diverse range of applications have led to a wide and diverse range of image registration algorithms. An image registration algorithm is defined by its transformation, criterion, and search. The transformation is the model of image deformation required for alignment. The criterion is the definition of the best registration. The search describes how the best registration is to be found. This thesis presents two image registration methods; fast robust correlation and orientation correlation. The presented methods find translational transformations. Both define their criterion of the best registration using robust statistics. Fast robust correlation applies robust statistics to pixel intensity differences. Orientation correlation applies robust statistics to differences in orientation of intensity gradient. This gives orientation correlation the property of illumination invariance. Both use an exhaustive search to find the best registration. The novelty of fast robust correlation and orientation correlation is the combination of robust statistics, with an exhaustive search that can be computed quickly with fast Fourier transforms (FFTs). This is achieved by expressing a statistically robust registration surface with correlations. The correlations are computed quickly using FFTs. Computation with FFTs is shown to be particularly advantageous in registration of large images of similar size. Experimental comparisons demonstrate the advantages of the methods over standard correlation-based approaches. Advantage is shown in the experiments of: video coding, video frame registration, tolerance of rotation and zoom, registration of multimodal microscopy images, and face registration.
6
Niu, Chaowei. "Motion pattern analysis for far-field vehicle surveillance." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/36188.
Full textAbstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006.Includes bibliographical references (p. 71-73).
The main goal of this thesis is to analyze the motion patterns in far-field vehicle tracking data collected by multiple, stationary non-overlapping cameras. The specific focus is to fully recover the camera's network topology, which means the graph structure relating cameras and typical transitions time between cameras, then based on the recovered topology, to learn the traffic patterns(i.e. source/sink, transition probability, etc.), and finally be able to detect unusual events. I will present a weighted statistical method to learn the environment's topology. First, an appearance model is constructed by the combination of normalized color and overall model size to measure the appearance similarity of moving objects across non-overlapping views. Then based on the similarity in appearance, weighted votes are used to learn the temporally correlating information. By exploiting the statistical spatio-temporal information weighted by the similarity in an object's appearance, this method can automatically learn the possible links between the disjoint views and recover the topology of the network. After the network topology has been recovered, we then gather statistics about motion patterns in this distributed camera setting. And finally, we explore the problem of how to detect unusual tracks using the information we have inferred.
by Chaowei Niu.
S.M.
7
Goh, Eng Lim. "Parallel architectures with fast ray-tracing image synthesis." Thesis, University of Cambridge, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.335748.
Full text
8
Chen, Peng 1960. "Precipitation and Pattern Formation under Far-From-Equilibrium Conditions." Thesis, University of North Texas, 1995. https://digital.library.unt.edu/ark:/67531/metadc278650/.
Full textAbstract:
Precipitates of a series of alkaline earth metal (barium and strontium) carbonates, chromates, phosphates, and sulfates were formed at high supersaturation by diffusion through silica hydrogel, agarose hydrogel, and the freshly developed agarosesilica mixed gels. The reaction vessels could be a small test tube, a recently designed standard micro slide cassette and a enlarged supercassette. Homogeneous nucleation is thought to have taken place, and particle development led to the formation of an unusual category of materials, known as Induced Morphology Crystal Aggregates [IMCA], at high pH under far-from-equilibrium conditions. Standard procedures were developed in order to produce homogeneous gels. Particle development led to characteristic style of pattern formation, which I have called monster, spiral, and flake. Among these IMCA, barium carbonate, chromate, and sulfate were moderately easy to grow. Barium phosphate was very difficult to grow as IMCA due to formation of poorly crystalline spherulites. IMCA of strontium carbonate, chromate and sulfate could be developed at high basic pH in the presence of silicate. Strontium carbonate sheet morphology displays a unique property, double internal layer structure, which was identified by backscattering electron imaging (BEI). Selected electron diffraction (SAD) revealed a new crystal phase which was called "Dentonite". Precipitate particles were isolated using a non-destructive isolation technique. Optical microscopy was widely used to examine particles in situ and scanning electron microscopy and X-ray dispersive energy (EDX) spectroscopy were applied to particles ex situ, together with ESCA for surface analysis. Growth patterns were found to be strongly dependent on pH. Other related pattern formation processes were also investigated including normal and dendritic structures, spherulitic structures and periodic pattern formation. Some interpretations were proposed in terms of mechanism. Chemical additive effects were examined experimentally in the calcium phosphate system. The effect of external ionic strength was investigated, and it was found that a certain concentration of sodium chloride (0.2 M) approximately equals a fraction of pH unit (-0.2).
9
Leone, Ryan J. "Patterns and Composition of Weight Change in College Freshmen." Bowling Green State University / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1428668895.
Full text
10
Zhang, Xin Iris, and 張欣. "Fast mining of spatial co-location patterns." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2004. http://hub.hku.hk/bib/B30462708.
Full text
11
Truong, Alfred Kar Yin. "Fast growing and interpretable oblique trees via logistic regression models." Thesis, University of Oxford, 2009. http://ora.ox.ac.uk/objects/uuid:e0de0156-da01-4781-85c5-8213f5004f10.
Full textAbstract:
The classification tree is an attractive method for classification as the predictions it makes are more transparent than most other classifiers. The most widely accepted approaches to tree-growth use axis-parallel splits to partition continuous attributes. Since the interpretability of a tree diminishes as it grows larger, researchers have sought ways of growing trees with oblique splits as they are better able to partition observations. The focus of this thesis is to grow oblique trees in a fast and deterministic manner and to propose ways of making them more interpretable. Finding good oblique splits is a computationally difficult task. Various authors have proposed ways of doing this by either performing stochastic searches or by solving problems that effectively produce oblique splits at each stage of tree-growth. A new approach to finding such splits is proposed that restricts attention to a small but comprehensive set of splits. Empirical evidence shows that good oblique splits are found in most cases. When observations come from a small number of classes, empirical evidence shows that oblique trees can be grown in a matter of seconds. As interpretability is the main strength of classification trees, it is important for oblique trees that are grown to be interpretable. As the proposed approach to finding oblique splits makes use of logistic regression, well-founded variable selection techniques are introduced to classification trees. This allows concise oblique splits to be found at each stage of tree-growth so that oblique trees that are more interpretable can be directly grown. In addition to this, cost-complexity pruning ideas which were developed for axis-parallel trees have been adapted to make oblique trees more interpretable. A major and practical component of this thesis is in providing the oblique.tree package in R that allows casual users to experiment with oblique trees in a way that was not possible before.
12
Zakerolhosseini, Ali. "The application of fast transforms to real-time pattern recognition." Thesis, University of Kent, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.267380.
Full text
13
Moustafa, Moustafa Abdel-Azim. "Feature recognition using a fast radon transform-based computer vision system." Thesis, Cranfield University, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.305610.
Full text
14
Perry, S. T. "Fast interactive object delineation in images for content based retrieval and navigation." Thesis, University of Southampton, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.286748.
Full text
15
Edwards, Susannah Lin. "Associations between Dietary Patterns and Cardiovascular Disease Risk in US Females." The Ohio State University, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=osu1461172539.
Full text
16
Boussakta, Said. "Algorithms and development of the number theoretic and related fast transforms with applications." Thesis, University of Newcastle Upon Tyne, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.293568.
Full text
17
Kuan, Joseph. "Image texture analysis and fast similarity search for content based retrieval and navigation." Thesis, University of Southampton, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.287321.
Full text
18
Blunt, Matthew Oliver. "Far-from-equilibrium nanoparticle assemblies : patterns, transport and dynamics." Thesis, University of Nottingham, 2007. http://eprints.nottingham.ac.uk/13112/.
Full textAbstract:
This work is centered on the study of self-organisation and pattern formation in a prototypical nanostructured system, namely colloidal nanoparticle assemblies. The particular system chosen for investigation, Au nanocrystals spin cast onto silicon substrates from a solvent, despite being chemically rather simple exhibits a rich variety of complex patterns. In the majority of experiments discussed in this thesis, far-from-equilibrium conditions are attained by a spin-casting process which drives rapid solvent evaporation. A systematic study was carried out to determine the various factors affecting the morphology of nanoparticle assemblies produced in this manner. These factors include the concentration of the nanoparticle solution, the particular solvent used, and the chemical/ physical nature of the substrate. Changing these variables can affect both the strength of interactions between individual nanoparticles and between nanoparticles and the substrate. The various morphologies of the nanoparticle structures produced were studied using atomic force microscopy (AFM). Particular attention is paid to the role of the substrate's surface chemistry in pattern selection. A range of different substrates are used to gauge the influence of differing surface chemistries. In addition, scanning probe lithography was employed to microscopically pattern surfaces. This facilitated the observation of effects caused by the presence of two radically different surface chemistries in the micron size range. This patterning process provides the experimenter some measure of control over the morphology of the nanoparticle assembly, allowing the enforcement of predefined length scales onto the network. Simulations of drying nanocrystal films produced using code written by Martin et al [1] have been shown to accurately reproduce the experimental results. These simulations are used to develop theoretical explanations of the experimental data in terms of the varying solvent evaporation rate on the substrate and the manner by which the solvent dewets on chemically and topologically differing areas of a surface. A remarkable probe-induced coarsening of nanoparticle assemblies by repetitive scanning with an AFM probe has been studied. Repeated scanning of colloidal nanoparticle systems causes the irreversible growth of nanoparticle assemblies. The size distribution of structures produced by this growth is shown to be self-similar. With the size of the domains growing with a power law dependence on scan time. From a combination of these results the growth of structures is explained using a model of coarsening based on cluster diffusion and coalescence. This model is subtly different from coalescence in a thermally driven system due to the novel nature of the mechanical coarsening process. Electrical transport through different array morphologies produced via the spin-coating process was studied using D. C. electrical measurements and electrostatic force microscopy (EFM). Measurements over temperatures ranging from 4.5K to room temperature were made. Variations in the manner that power law scaling of the conduction behaviour alters for different arrays is linked to the topological characteristics of the arrays.
19
Wilson, Andrew Gordon. "Covariance kernels for fast automatic pattern discovery and extrapolation with Gaussian processes." Thesis, University of Cambridge, 2014. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.708032.
Full text
20
Zhang, Qinjie, and Longyu Zhou. "Cultural adaptation pattern analysis of McDonald's and KFC in the Chinese market." Thesis, Uppsala universitet, Företagsekonomiska institutionen, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-176311.
Full textAbstract:
KFC and McDonald’s are two representatives of American fast food brands who are operating in China.Considering the cultural differences between American and Chinese culture, whether and how they adaptthemselves to the Chinese culture caught the authors’ attention. This thesis aimed to explore the culturaladaptation patterns of these two brands, and find out what factors contribute to a successful culturaladaptation model from customers’ perspective.In order to find the answer, the authors based this study on academic theories and studies together withobjective information of KFC and McDonald’s, and carried on a survey based on Chinese market. Aftercombining empirical findings and analysis, two models were derived for KFC and McDonald’srespectively. After the analysis, this thesis also discussed implication and limitation of the results, andsuggestion for future study was presented.
21
Melhorn, Susan Jennifer. "The microstructure of food intake under conditions of high-fat diet, social stress and social subordination." University of Cincinnati / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1243018975.
Full text
22
Abbasi, Roohollah. "Colour pattern evolution and development in Vanessa butterflies." John Wiley & Sons Publishers, 2015. http://hdl.handle.net/1993/30979.
Full textAbstract:
The evolution and development of eyespot and non-eyespot colour pattern elements was studied in Vanessa butterflies using a phylogenetic approach. A Bayesian phylogeny of the genus Vanessa was reconstructed from 7750 DNA base pairs from 10 genes. Twenty-four non-eyespot and forty-four eyespot color pattern elements from the Nymphalid ground plan were defined and studied and their evolutionary history was traced on the Vanessa phylogeny. Ancestral character states were predicted and the direction of evolutionary changes was inferred for all characters. Five serially arranged eyespots were predicted for the ancestral Vanessa on all wing surfaces. Homologous eyespot and non-eyespot characters on the surfaces of the forewing were more similar than those on the surfaces of the hindwing. Homologous eyespot characters on the dorsal surfaces of fore and hindwings show more similarities than the ventral surfaces, in contrast to what was found for non-eyespot characters. Independent Contrast analysis was also used to study correlations between eyespot characters. Independent Contrast analysis revealed significant correlations between eyespots 2 and 5 and eyespots 3 and 4 on all wing surfaces. This consistency among highly variable eyespot characters suggested a structural hypothesis: the existence of a Far-Posterior (F-P) compartment boundary and organizer could be responsible for the observed correlations. This hypothesis was tested in several ways. First, examination of wing patterns across species from all families of butterflies revealed correspondence between wing cells 1 and 4 and between cells 2 and 3. Second, evaluation of spontaneous mitotic clones in butterflies and moths reveals a peak abundance of clonal boundaries along the vein dividing wing cells 2 and 3. Finally, experimentally generated FLP/FRT mitotic wing clones produced in Drosophila, reveal a clonal boundary posterior to the L5 wing vein, which is homologous to the vein dividing wing cells 3 and 4 in butterflies. Collectively, this suggests the existence of an additional compartment boundary associated with an organizer in wing cell 3 responsible for patterning the posterior portion of insect wings. A model is proposed that predicts that the wing developmental compartment boundaries produce unique combinations of gene expression for each wing sector, permitting eyespot individuation.February 2016
23
Schuck, Renaud. "Two-photon minimal inertia scanning patterns for fast acquisition of calcium dynamics." Thesis, Imperial College London, 2017. http://hdl.handle.net/10044/1/57510.
Full textAbstract:
Development of optical technologies aiming to reverse engineer neural circuits has been flourishing over the past two decades. Multi-Photon Laser Scanning Microscopy (MPLMS) together with the development of fast kinetic fluorescent calcium dyes has revolutionised the world of modern neuroscience. This technology enables mesoscale functional imaging in deep scattering brain tissues of large two (2D) and three dimensional (3D) neural networks. With single cell sensitivity in vitro as well as in vivo, it is one of the main contenders for deciphering higher brain functions. My approach in this thesis is to develop and test new scanning techniques for fast functional calcium imaging aiming to enhance the temporal precision of the acquisition. To avoid the slow and sequential "point" raster scanning nature of these Galvanometric Scanners (GSs) based microscopes, I developed new 2D and 3D scanning algorithms. These algorithms were developed in MATLAB with a simulation platform that models the main mechanical elements of the MPLSM. Both my 2D Adaptive Spiral Scanning (SSA) algorithm and my 3D Orbital Scanning Trajectory (OST) algorithm were developed to minimize the inertial slowdowns of the GSs and Electrical Tunable Lens (ETL) and therefore increase the temporal resolution of the acquisition. In 2D, I tested the SSA algorithm on in vitro hippocampal brain slices loaded with the synthetic calcium dye Cal520. To assess the performance of the scanning technique, I used the Cramer-Rao Bound (CRB) as a metric for signal quality. The CRB estimates the time of occurrence of an Action Potential (AP) from the calcium imaging data, taking into account the sampling frequency and the SNR of the acquisition. In this thesis, I show that the use of scanning strategies enables sampling rates one order of magnitude higher than traditional frame scanning in functional calcium imaging. I also show that frame scanning needs considerably higher SNR values than scanning strategies to reach the same temporal precision. In 3D, I implemented the scanning algorithms into the software and hardware of the MPLSM and recorded the trajectory of the focal point with a high-speed camera as a proof of principle. More analyses regarding the precision of the paths needs to be carried out in 3D for functional calcium imaging in vitro or in vivo. These software-based scanning strategies are attractive as they are inexpensive, easily transferable from one setup to another and enable fast functional calcium imaging with standard commercial MPSLMs. Finally, through this implementation of scanning strategies, I recorded multiple data sets of spontaneous and evoked activity in populations of Dentate Granular Cells (DGCs). This lead to the new beginning of a larger in vitro investigation at the microcircuit level on the functionality of the DG.
24
Stanford, Derek C. "Fast automatic unsupervised image segmentation and curve detection in spatial point patterns /." Thesis, Connect to this title online; UW restricted, 1999. http://hdl.handle.net/1773/8976.
Full text
25
Bramsiepe, Jonathan. "A function of cell-cycle regulation in pattern formation : endoreplication controls cell-fate maintenance in Arabidopsis." Thesis, Strasbourg, 2013. http://www.theses.fr/2013STRAJ119.
Full textAbstract:
Dans ce travail, j'ai utilisé les trichomes (poils foliaires) d'Arabidopsis comme modèle pour étudier la différenciation cellulaire et l'endoréplication. Mon travail a révélé que les cycles d’endoréplication chez Arabidopsis étaient contrôlés par les protéines inhibitrices CYCLIN DEPENDENT KINASE (CDK), elles-mêmes contrôlées par dégradation via l'action de complexes SKP-CULLIN-F-BOX (SCF). Ceci crée vraisemblablement des niveaux variables d'activité de CDK, qui sont nécessaires pour la progression répétée au travers des phases de synthèse d'ADN dans les cellules entrées en endoréplication. Cependant, la sur-expression des inhibiteurs des CDK ne bloque pas seulement l'endoréplication mais résulte aussi dans la dédifférenciation des cellules précurseurs des trichomes. Des résultats similaires ont été obtenus en utilisant des allèles faibles de perte de fonction pour CDKA;1, la principale CDK chez Arabidopsis, laissant émerger la notion que l'endoréplication est nécessaire à la maintenance du devenir des cellules. De manière surprenante, la dédifférenciation peut être au moins partiellement réprimée quand RBR1, l'homologue chez Arabidopsis de la protéine animale suppresseur de tumeur RETINOBLASTOMA (Rb), est mutée de manière concomitante. De même, une mutation de la methyltransferase CURLY LEAF, composante du complexe PRC2, rétablit le défaut de maintenance des trichomes chez les mutants faibles pour CDKA;1. Pris dans leur ensemble, ces résultats suggèrent que le complexe PRC2 et la protéine RBR1 établissent, au niveau tissulaire, un seuil pour la différenciation cellulaire au cours du développement de l'épiderme chez ArabidopsisCell differentiation is often linked with a switch from a mitotic to an endoreplication cycle, in which cells re-replicate their DNA without cell division. The molecular regulation of endoreplication and its biological fonction are only poorly understood. Here, I have used trichomes (leaf hairs) of Arabidopsis as a model to study cell differentiation and endoreplication. My work revealed that endoreplication cycles in Arabidopsis are controlled by cyclin dependent kinase (CDK) inhibitor proteins, which in turn are subject to protein degradation mediated by the action of SKP-CULLIN-F-BOX (SCF) complexes. This presumably creates oscillating levels of CDK activity, which are needed for repeated progression through DNA synthesis phases in endoreplicating cells. However, overexpression of CDK inhibitors did not only block endoreplication but also resulted in the dedifferentiation of trichome precursor cells. Similar observations were made with weak- loss-of-function alleles for the major CDK in Arabidopsis, CDKA;1, giving rise to the notion that endoreplication is required for cell fate maintenance. Trichome dedifferentiation was enhanced when trichome fate regulators were mutated. Surprisingly, the dedifferentiation could be at least partially repressed when RBR1, the Arabidopsis homolog of the animal tumor suppressor protein Retinoblastoma (Rb), was concomitantly mutated. Similarly, a mutation in PRCZ-methyltransfcrase CURLY LEAF (CLF) rescued the trichome maintenance defect of weak CDKA;1 mutants. Taken together, this suggests that PRC2 and RBR1 set a dynamic tissue threshold for cell differentiation during epidermis development in Arabidopsis
26
Lo, Chong Fai. "Is 'fast food mania' developed in Macua? An exploration of the burgeoning fast food consumption patterns in an emerging market." Thesis, University of Macau, 2010. http://umaclib3.umac.mo/record=b2147581.
Full text
27
Kummari, Chandrashekar. "Embedded test pattern generator for memories /." Available to subscribers only, 2006. http://proquest.umi.com/pqdweb?did=1240704151&sid=1&Fmt=2&clientId=1509&RQT=309&VName=PQD.
Full text
28
Richardson, Adam. "Apexification Healing Patterns Comparing MTA & Bioceramic Putty." The Ohio State University, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu159177077247595.
Full text
29
Montenegro, Jorge Antonio. "Interpreting Cultural and Sociopolitical Landscapes in the Upper Piura Valley, Far North Coast of Perú (1100 B.C.- A.D. 1532)." OpenSIUC, 2010. https://opensiuc.lib.siu.edu/dissertations/238.
Full textAbstract:
This dissertation is a diachronic settlement and landscape study undertaken from an interpretive archaeology perspective. The outcome of this study has been an interpretation of the settlement and landscape configurations as well as of the sociopolitical organization during the entire prehispanic occupation (ca. 1100 B.C.- A.D. 1532) of the Upper Piura River Valley in the Far North Coast of Perú. Also, the sociopolitical interaction between the local polities of the Upper Piura River Valley and the southern foreign Northern North Coast polities has been assessed. The Far North Coast is not an environmentally "marginal" area as compared to the Northern North Coast. Yet, in terms of its prehispanic cultural development, it often has been characterized as "marginal" or "peripheral". Such characterization is due in part to an overemphasis on the study of Mochica style cultural materials found in the Far North Coast. In particular, the emphasis on analyses of "high quality" Mochica ceramics has led to interpretations that view local Upper Piura River Valley sociopolitical developments from the perspective of the "dominant" Northern North Coast societies in an unbalanced situation disregarding the perspective of the supposedly "weaker, less developed" local societies. In this sense, interpretations drawn from iconographic and stylistic analyses of objects on the one hand, and from landscape analyses on the other, seem like two different versions of the same story. Since the latter is so uncommon and unexplored in Andean archaeology, I chose to apply it in this dissertation. For that purpose I followed two different but complementary paths of interpretation. The first path is an interpretation of the landscape from a dwelling perspective. The goal was to create an analogy of the experience of past individuals through an embodiment process via the movement of my body and mind through the landscape features. A second path of interpretation was merged with the first one. This second path comprised a classic settlement pattern analysis oriented to clarify the nature of the sociopolitical interaction between local polities of the Upper Piura River Valley and the intrusive polities of the Northern North Coast. The second path of interpretation also entailed overlapping the settlement patterns observed onto the spatial structures and topograms defined and interpreted by the dwelling perspective. As a result, I found that the study area is characterized by a 2600-year long process of dwelling in the landscape. Through this process and along the years, yet following a long, local process, revolving around the topograms, the landscapes conceptualizations and configurations changed. Two moments of the settlements and landscapes configurations were defined: the "old system" and the "new system". For most of its history (through all the "old system" and the first epoch of the "new system"), and acknowledging the mutual cultural influence with other areas (e.g., the Northern North Coast), the local landscape and settlement configurations were not disrupted and engaged in an egalitarian or coevolving sociopolitical interaction. Yet during the second epoch of the "new system", this situation changed drastically when a hierarchical and coercive interaction structure developed during the Chimú and Inca periods.
30
Mathew, Mini. "Novel State Coding For Scalable Pattern Matching." Available to subscribers only, 2009. http://proquest.umi.com/pqdweb?did=1885751671&sid=2&Fmt=2&clientId=1509&RQT=309&VName=PQD.
Full text
31
Jawaid, S. "Differential changes in neuromuscular junction morphology after divergence of activity pattern in rat slow and fast skeletal muscles." Thesis, University of Aberdeen, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.592627.
Full textAbstract:
The morphology of NMJ was quantified in soleus and EDL muscles during postnatal development. Differences were extensively quantified in adults by measuring various parameters (e.g. junctional area, terminal area, width/length ratio, fragmentation of the terminal, shape coefficient). The fluorescent marker FMI-43 was used to label the presynaptic synaptic vesicles in the terminals, and postsynaptic acetylcholine receptors were labelled with fluorescent Rh α-bungarotoxin. Fibre type proportions and fibre diameter were also studied to see if there is any relation between NMJ morphology and fibre type proportion of fibre diameter. Fibre types in both muscles were studied by using histochemistry and immunohistochemistry. The results demonstrate that NMJ morphologies are very similar initially, except for shape coefficient. Marked changes in NMJ morphological parameters occur in the third postnatal week, when both muscles diverge from their common neonatal activity pattern. Fibre type proportion, initially were slow in both muscles. After onset of the adult activity pattern, the rearrangement in fibre proportions makes soleus predominantly slow- and EDL a fast-twitch muscle. Fibre diameter is always greater in soleus. Fibre diameter increased in both muscles but only after the onset of adult activity. Soleus fibres were wider but have longer synapses. Finally, width/length ratio was found to be a major discriminator between NMJ morphologies in the two muscles. In soleus muscle, but not EDL, a reasonable correlation between width/length ratio of NMJ morphology and fibre types was found. All differences appeared after the establishment of adult activity pattern, supporting the hypothesis. Comparison with other studies, however, suggests the effects of activity are probably indirect, via changes in fibre diameter.
32
Revaud, Jérôme. "Contributions to a fast and robust object recognition in images." Phd thesis, INSA de Lyon, 2011. http://tel.archives-ouvertes.fr/tel-00694442.
Full textAbstract:
In this thesis, we first present a contribution to overcome this problem of robustness for the recognition of object instances, then we straightly extend this contribution to the detection and localization of classes of objects. In a first step, we have developed a method inspired by graph matching to address the problem of fast recognition of instances of specific objects in noisy conditions. This method allows to easily combine any types of local features (eg contours, textures ...) less affected by noise than keypoints, while bypassing the normalization problem and without penalizing too much the detection speed. Unlike other methods based on a global rigid transformation, our approach is robust to complex deformations such as those due to perspective or those non-rigid inherent to the model itself (e.g. a face, a flexible magazine). Our experiments on several datasets have showed the relevance of our approach. It is overall slightly less robust to occlusion than existing approaches, but it produces better performances in noisy conditions. In a second step, we have developed an approach for detecting classes of objects in the same spirit as the bag-of-visual-words model. For this we use our cascaded micro-classifiers to recognize visual words more distinctive than the classical words simply based on visual dictionaries. Training is divided into two parts: First, we generate cascades of micro-classifiers for recognizing local parts of the model pictures and then in a second step, we use a classifier to model the decision boundary between images of class and those of non-class. We show that the association of classical visual words (from keypoints patches) and our disctinctive words results in a significant improvement. The computation time is generally quite low, given the structure of the cascades that minimizes the detection time and the form of the classifier is extremely fast to evaluate.
33
Petersson, Hjärne Jon. "A Hero in Disgrace : The patterns of a hero in David Lurie's twist of fate." Thesis, Växjö University, School of Humanities, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:vxu:diva-2573.
Full textAbstract:
In this essay I look at J.M Coetzee’s Disgrace from a rather different perspective. I argue that, despite his less than heroic attributes, David Lurie is the protagonist of an adventure and follows Joseph Campbell’s pattern of the hero’s ditto. Furthermore, the goal of David Lurie’s journey lies in self-realization and self-reinvention, which is not typical for the hero’s journey. The Ultimate Boon is usually something else but different times call for different heroes. In J.M. Coetzee and the Ethics of Reading, Derek Attridge suggests that David Lurie grows on the reader throughout the novel and is a better person at the end (Attridge 183). This indicates that David Lurie goes through a process personally that changes him in a positive direction. Besides Campbell’s theory, the theories of Propp and Stanford are presented and put to good use as theoretical background. Since this essay deals with both narratology and structuralism I provide short explanations of these two branches of literature criticism as presented in Peter Barry’s Beginning Theory. I then discuss relevant passages from Disgrace in connection with the different stages of the hero’s journey as described by Campbell. I do so in the order they are presented in Campbell’s book.
34
Harris, Juliette May. "Gene targeting of a fast myosin promoter in muscle cells to alter myosin expression patterns." Thesis, Imperial College London, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.286625.
Full text
35
Doong, Jia-Yau. "The relationship of body fat distribution pattern to metabolic syndrome in the US and Taiwan." Diss., 2008. http://proquest.umi.com/pqdweb?did=1683720971&sid=1&Fmt=2&clientId=3552&RQT=309&VName=PQD.
Full text
36
Maftei, Oana. "Intrauterine influences on obesity and insulin resistance in pre-pubertal children." Thesis, 2012. http://hdl.handle.net/2440/75507.
Full textAbstract:
Within the paradigm of developmental origins of health and disease, an intrauterine environment that stimulates fetal overnutrition has been found to contribute to the risk of subsequent obesity in the offspring. There is compelling epidemiological evidence for a positive association between maternal obesity prior to pregnancy, gestational diabetes (GD) or excessive gestational weight gain, and the development of childhood obesity (as measured by body mass index, BMI). However, the evidence is limited and inconsistent with respect to more specific measures of adiposity (body composition or
fat pattern) and insulin resistance in children. Furthermore, the long-term effects of maternal borderline gestational glucose intolerance (BGGI) on the offspring have not been considered.
Therefore, I sought to examine whether maternal obesity prior to pregnancy, gestational glucose intolerance across the entire spectrum, and gestational weight gain have deleterious effects on the development of obesity (both global and specific measures of adiposity) and insulin resistance in pre-pubertal children. These associations are particularly important from a public health perspective as, once identified, they may point towards potential windows for prevention of childhood obesity and related metabolic disorders. This project entailed a follow-up of an existing representative, prospective birth cohort study (Generation 1 Study, n=557) in Adelaide, South Australia, recruited during 1998-2000. At the 9-10 year follow-up, rigorous anthropometric measurements were conducted in 443 children (80% of the original cohort), of whom 163 consented to provide a fasting blood sample for the estimation of insulin resistance based on homeostasis model assessment (HOMA-IR). Information on intrauterine exposures and confounders was collected from the antenatal interviews and hospital records. Maternal age, parity, smoking, pregnancy-induced hypertension, and education at the time of pregnancy were considered as potential confounders for all the associations of interest, and child current BMI z-score as a potential mediator on the pathway between the intrauterine exposures and child insulin resistance. Data were analysed using multiple linear regression and generalized linear models. Maternal pre-pregnancy BMI was positively associated with all three obesity-related measures considered in the 9-10 year-old children (BMI z-score, percentage body fat estimated by bioelectrical impedance analysis, and waist-to-height ratio); these relationships were robust to adjustment for potential confounders (adjusted coefficients for each one kg/m2 increase in maternal pre-pregnancy BMI were 0.08 (95% confidence interval 0.06, 0.10) for child BMI z-score, 0.44 (95% CI 0.31, 0.58) for percentage body fat and 0.002 (95% CI 0.002, 0.003) for waist-to-height ratio). There was no association between maternal pre-pregnancy BMI and HOMA-IR in children (with or without adjustment); however, when child current BMI z-score was included as a mediating variable, the relationship between maternal pre-pregnancy BMI and child HOMA-IR was inverse and significant (adjusted change in child HOMA-IR for each one kg/m2 increase in maternal pre-pregnancy BMI was -0.83% (95% CI 1.63, -0.02)). Intrauterine exposure to glucose intolerance during pregnancy (either BGGI or GD) was not associated with any of the three obesity-related measures in children at 9-10 years. Children of mothers who developed GD during the index pregnancy had a higher HOMA-IR; this relationship was robust to adjustment for potential confounders (adjusted change in child HOMA-IR if exposed to maternal GD was 42.9% (95% CI 20.9, 68.9)) and partly mediated by child current BMI z-score. No association was found between exposure to maternal BGGI and child HOMA-IR (with or without confounder adjustment); however, when child current BMI z-score was added as a potential mediator, exposure to BGGI was associated with a reduction in child HOMA-IR (adjusted change in child HOMA-IR if exposed to maternal BGGI was -17.9% (95% CI -29.9, -3.96)). There were no significant associations between maternal gestational weight gain and any of the outcome measures of interest in unadjusted models. However, adjustment for pre-pregnancy BMI led to a positive association between gestational weight gain and child BMI z-score (adjusted changes in child BMI z-score for each one kg increase in maternal gestational weight gain was 0.032 (95% CI 0.007, 0.057)). Gestational weight gain was not associated with child insulin resistance, and this did not change when child current BMI z-score was included as a potential mediator on the pathway between gestational weight gain and child insulin resistance. Potential two-way interactions between the main exposures were investigated in relation to all outcomes of interest. Two significant interactions were identified: maternal pre-pregnancy BMI and glucose tolerance status, and maternal pre-pregnancy BMI and gestational weight gain, with a synergistic effect on child waist-to-height ratio. These results suggest that childhood obesity and insulin resistance have origins, at least in part, in intrauterine life, particularly in relation to maternal obesity at the time of pregnancy and GD. Further research to differentiate between genetic, environmental and intrauterine programming is recommended. That said, maternal pre-pregnancy BMI was the strongest predictor of child BMI zscore, while GD appeared to have an independent effect on child insulin resistance, and both clinical and public health actions to address these maternal factors are warranted for a range of reasons.Thesis (Ph.D.) -- University of Adelaide, School of Population Health and Clinical Practice and School of Paediatrics and Reproductive Health, 2012
37
"Fast frequent pattern mining." 2003. http://library.cuhk.edu.hk/record=b5891575.
Full textAbstract:
Yabo Xu.Thesis (M.Phil.)--Chinese University of Hong Kong, 2003.
Includes bibliographical references (leaves 57-60).
Abstracts in English and Chinese.
Abstract --- p.i
Acknowledgement --- p.iii
Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- Frequent Pattern Mining --- p.1
Chapter 1.2 --- Biosequence Pattern Mining --- p.2
Chapter 1.3 --- Organization of the Thesis --- p.4
Chapter 2 --- PP-Mine: Fast Mining Frequent Patterns In-Memory --- p.5
Chapter 2.1 --- Background --- p.5
Chapter 2.2 --- The Overview --- p.6
Chapter 2.3 --- PP-tree Representations and Its Construction --- p.7
Chapter 2.4 --- PP-Mine --- p.8
Chapter 2.5 --- Discussions --- p.14
Chapter 2.6 --- Performance Study --- p.15
Chapter 3 --- Fast Biosequence Patterns Mining --- p.20
Chapter 3.1 --- Background --- p.21
Chapter 3.1.1 --- Differences in Biosequences --- p.21
Chapter 3.1.2 --- Mining Sequential Patterns --- p.22
Chapter 3.1.3 --- Mining Long Patterns --- p.23
Chapter 3.1.4 --- Related Works in Bioinformatics --- p.23
Chapter 3.2 --- The Overview --- p.24
Chapter 3.2.1 --- The Problem --- p.24
Chapter 3.2.2 --- The Overview of Our Approach --- p.25
Chapter 3.3 --- The Segment Phase --- p.26
Chapter 3.3.1 --- Finding Frequent Segments --- p.26
Chapter 3.3.2 --- The Index-based Querying --- p.27
Chapter 3.3.3 --- The Compression-based Querying --- p.30
Chapter 3.4 --- The Pattern Phase --- p.32
Chapter 3.4.1 --- The Pruning Strategies --- p.34
Chapter 3.4.2 --- The Querying Strategies --- p.37
Chapter 3.5 --- Experiment --- p.40
Chapter 3.5.1 --- Synthetic Data Sets --- p.40
Chapter 3.5.2 --- Biological Data Sets --- p.46
Chapter 4 --- Conclusion --- p.55
Bibliography --- p.60
38
Cheng, Chang-Yeng, and 鄭昶延. "Fast Pattern Detection in Stream Data." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/95244923612433375113.
Full textAbstract:
碩士國立清華大學
資訊工程學系
92
Digital pollution is emerging as an overwhelming threat to the Internet, whose ubiquitous connectivity conversely cultivates the widespread outbreaks of such dirt. Considerable amount of human efforts and network resources are wasted at a little cost of the few polluters. To prevent flooding of the contamination, classical string matching schemes and their variants can be the first aid for the effective quarantine to establish its censorship. The features of the typical pollutants are extracted and refined into so-called signatures. Every transfer post then looks through the incoming stream data for these signatures. Upon detecting any such pattern, the post can obstruct the connection and sound an alert to inform higher-level security systems. Obviously, the processing speed and accuracy of pattern detection schemes is crucial to the effectiveness of security systems. To expedite the scrutiny, we propose a novel pattern detection technique based on the decision tree induction to seek for significant improvement over the classical schemes. According to the intrinsic of the pattern, the tree is sprouted adaptively to minimize the number of symbols in the data stream needed to be examined. This allows a unique order to inspect the symbols in a strategic way optimized contextually, as opposed to the fixed order followed by the other schemes. In other words, this strategy inspects the symbols in every possible matching positions in parallel, and rules out the unmatching ones that have at least one false matching symbol. Finally only the possible positions that match the previous inspected symbols needed to be checked with the entire pattern. This way reduces considerable amounts of context symbol checks to confirm a matching. Performance study indicates our approach achieves the speed-up of five or more over the best competitors.
39
"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.
40
Wang, Po-chung, and 王柏忠. "Fast Pattern Classification through Nearest-Neighbor Search." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/46937856524916401924.
Full textAbstract:
碩士國立高雄第一科技大學
電腦與通訊工程所
98
Over recent years, support vector machines (SVMs) have been widely used for solving a variety of classification problems in the fields of pattern recognition and data mining applications. One basic principle behind SVMs is to predict the class label of a testing sample by using the optimal hyperplane determined from labeled training samples. Obviously, this principle brings SVMs a limitation that they are computationally infeasible for training a very large-scale dataset. To overcome this drawback, an intuitive approach is to reduce the number of training samples that are unrelated to the construction of the optimal hyperplane. In this thesis, an efficient approach based on nearest neighbor search is therefore proposed to identify non-relevant samples that can subsequently be removed from a large-scale training dataset without degrading the classification accuracy. The performance of the proposed approach is assessed through the use of several publicly available datasets such as IRIS, Monks, and Forest. Experimental results demonstrate that the proposed approach is a significant improvement compared with the previous attempts in terms of the reduced number of training samples, the time taken for SVM training procedures, and the classification accuracy.
41
CHEN, BANG-ZHENG, and 陳邦正. "A fast method of wall pattern generation." Thesis, 1991. http://ndltd.ncl.edu.tw/handle/30030774050720333610.
Full text
42
Yu-Nan, Su, and 蘇育南. "Implementation of Antenna Far-Field Pattern Measurement System." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/83525232294769208028.
Full textAbstract:
碩士樹德科技大學
電腦與通訊研究所
94
Antennas are very popular in 802.11b/g WLANs and Bluetooth applications by using 2.4GHz ISM band. For antenna designer, it is a key to increase the efficiency of antenna measurement effectively. As we know, a Far-Field Antenna Measurement System is extremely expensive. This research goal is using the mature RF techniques to design and build up a low cost and high reliability Antenna Measurement System to offer antenna designer the fast and accurate measured results.
43
Shun-I, Chu, and 朱順義. "Charging Pattern Optimization for Li-Ion Fast Chargers." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/71214223142328112784.
Full textAbstract:
碩士義守大學
電機工程學系
92
Recently, the number of portable personal telecommunication systems such as mobile phones and laptop computers has grown explosively. Secondary batteries are often used in these equipments because they are cost-effective over the lifetime of the product. Among these, lithium-ion (Li-ion) batteries are growing at a rapid rate in response to environmental concerns and the need for higher energy density. The performance and longevity of lithium ion batteries depend, to a large extent, on the quality of their chargers. Commercially available fast chargers are often not designed in the best interests of the battery. Therefore, it is important for battery manufacturers to determine the optimal charging pattern for their products. Several efforts have been devoted to study the charging techniques and charging patterns. From those methods, multi-stage pulse charging algorithm is proven to have the advantages such as prolong cycle lives, enhance discharge/charge energy efficiency, and reduce the charging time. However, the optimal current value for each stage still cannot be determined. In order to search the optimization charging pattern for multi-stage pulse charging algorithm, a rapid charger designed based on CPLD (Complex Programmable Logic Device) is implemented in this thesis. A human-machine interface designed by LabVIEW (Laboratory Virtual Instrument Engineering Workbench) is also implemented to set the charging currents and monitor the charging status. A searching algorithm for charging pattern based on Taguchi method and orthogonal array is then proposed for Li-ion batteries in this thesis. Due to the characteristics of Taguchi method and orthogonal array, the experimental number required for charging pattern searching can be minimized. Experimental results show that the obtained rapid charging pattern is capable of charging the lithium-ion batteries to 60% capacity in 30 minutes.
44
Lin, Jun-Wei, and 林浚瑋. "Maintenance Algorithms for Fast Updated Frequent Pattern Trees." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/80896537645549114192.
Full textAbstract:
碩士義守大學
資訊管理學系碩士班
94
Due to the increasing usage and development of information technologies, how to mine the useful information and helpful knowledge from the huge and complicated transactions has been evolving into an important research area. In the past, researchers usually assumed the database was static to simplify the data-mining problem. Most of the classic algorithms proposed thus focused on batch mining, and did not utilize previously mined information for incrementally growing databases. The Frequent-Pattern-tree (FP-tree) is an efficient data structure for association-rule mining without generation of candidate itemsets. It was used to compress a database into a tree structure which stored only large items. It, however, needed to process all transactions in a batch way when the databases are usually changed whether insertion, deletion or modification of transactions. In real-world applications, however, developing a mining algorithm that can maintenance the discovered information as a database changes is quite important. In this paper, we thus attempt to extend the FP-tree construction algorithm for efficiently handling the insertion, deletion or modification of transactions. A fast updated FP-tree (FUFP-tree) structure is used, which makes the tree update process become easier. An FUFP-tree maintenance algorithm is also proposed for reducing the execution time in reconstructing the tree when transaction are inserted, deleted or modified. Experimental results show that the proposed FUFP-tree maintenance algorithm for the insertion, deletion or modification of transactions runs faster than the batch FP-tree construction algorithm for handling updated database and generates nearly the same tree structures as the FP-tree algorithm. The proposed three approaches can thus achieve a good performance in execution time and tree complexity.
45
Cheng, Bo En, and 鄭博恩. "Fast Pattern Matching Using Dynamically Partitioned AC-DFA." Thesis, 2019. http://ndltd.ncl.edu.tw/cgi-bin/gs32/gsweb.cgi/login?o=dnclcdr&s=id=%22107CGU05392014%22.&searchmode=basic.
Full text
46
Yu-HaoTseng and 曾毓豪. "Fast and Memory Efficient NFA Pattern Matching using GPU." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/05823690367574769741.
Full textAbstract:
碩士國立成功大學
資訊工程學系
102
With the rapid development of networks, a large number of malicious packets, such as virus and malware, are spreading in recent years. Network intrusion detection system (NIDS) is mainly designed for monitoring whether there are some malicious packets over the Internet. The technique of pattern matching plays an important role because we often use it to protect our systems. With pre-defined virus signatures called patterns, NIDS can find out whether these pre-defined patterns exist in the payload of packets. Finite state automata (FSA), such as NFA and DFA, are one of pattern matching techniques in NIDS. Because processing a large amount of network packets only on a single thread cannot satisfy our high-speed demand, we need hardware to accelerate the performance of pattern matching. GPU can be used to effectively accelerate the performance of pattern matching because abundant parallel hardware threads are supported. In this thesis, we propose a new NFA-based method to store more complex regular expressions in limited memory of GPU effectively. The proposed constrained NFA (CNFA) is constructed from the original NFA based on the method used in the subset construction algorithm that converts NFA to DFA. Compared to original NFA and DFA, the proposed CNFA imposes a constraint that each state can only have at most two transitions for each character, namely self-loop and non-self-loop transitions. Based on our experimental results, the proposed CNFA can achieve the performance of about 100 Gbps at the best case on GPU. Also, the proposed CNFA only needs 18% of memory usage, used in iNFAnt. In addition, the proposed CNFA can be used for more complex rule sets that is not possible to be implemented in iNFAnt.
47
KAN, CHE-CHIH, and 康哲誌. "Fast fractal image encoding based on contrast pattern classification." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/24105998227669428278.
Full textAbstract:
碩士國立臺灣科技大學
資訊工程系
96
Speeding up fractal image encoding is an important issue. In this thesis, we propose a fractal encoding method based on contrast-pattern classification. According to contrast-pattern of each block, range and domain blocks are divided into 6 classes – Smooth, Chessboard, Horizontal, Vertical, Diagonal and Anti-diagonal (SCHVD). Then, for each range block, we only search domain blocks in the corresponding domain pool to speed up fractal encoding. By limiting the domain pool for each range block, the encoding time can be shortened. Moreover, the proposed method can be combined with the spatial-correlation method. In this hybrid approach, most range blocks could get qualified domain blocks from neighbor’s fractal code. For others, which can’t get domain blocks from neighbor search, the SCHVD classification is served to limit the size of domain pool to speed up encoding. Experiment results show that the proposed algorithm can shorten encoding time and also keep the quality of the reconstructed image.
48
Yeh, Yao-Jung, and 葉燿榮. "SOPC-based fast kNN classification system for pattern recognition." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/00502704957002074464.
Full textAbstract:
碩士國立臺灣師範大學
資訊教育學系
94
A novel algorithm for field programmable gate array (FPGA) realization of kNN classifiers using wavelet transform and partial distance search (PDS) is presented in this paper. The PDS is usually adopted as a software approach for attaining moderate codeword search acceleration. In this paper, a novel PDS algorithm well-suited for hardware realization is proposed. The algorithm identifies first k closest vectors in the design set of a kNN classifier for each input vector by performing the PDS in the wavelet domain. The algorithm employs subspace search, bitplane reduction and multiple-coefficient accumulation techniques for the effective reduction of the area complexity and computation latency. Concurrent classification of different input vectors for further computation acceleration is also allowed by the employment of multiple-module PDS. The proposed implementation has been embedded in a softcore CPU for physical performance measurement. Experimental results show that the implementation provides a cost-effective solution to the FPGA realization of kNN classification systems where both high throughput and low area cost are desired.
49
Lee, Che-Wei, and 李哲瑋. "Double-layered Initial Search Pattern for Fast Motion Estimation." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/94919139335258025914.
Full textAbstract:
碩士國立成功大學
電機工程學系碩博士班
93
Multimedia communication relies on data compression technologies to reduce the data bytes of transmission and enhance the speed of transmission. Motion estimation is vital to many motion-compensated video-coding techniques/standards, such as ISO MPEG-1/2/4 and ITU-T H.261/262/263/264。In block motion estimation, a search pattern with a different shape and size has a very important impact on performance of motion estimation. The performance indicates that the speed of finding out motion vectors and the visual quality of predicted results. In recent years, many computationally efficient fast search algorithm were developed, among which are typically the three-step search (3SS) in 1994, the new diamond search (DS) in 2000, the hexagon-based Search (HEXBS) in 2002, and the efficient three-step search (E3SS) in 2004. Here we propose a pair of simple, robust and efficient fast block matching motion estimation algorithms, called double-layered initial search patterns (DLISP). Simulation experiments demonstrate that the proposed DLISP algorithm greatly outperforms the well-known hexagon-based Search (HEXBS) algorithm and achieves similar MSE performance compared to efficient three-step search (E3SS) while reducing its computation by up to 22% approximately. Compared with other recently proposed block-matching algorithms, the proposed DLISP algorithms works better on average in terms of MSE values, reconstructed image quality, and average number of search points.
50
LEE, Yi-Hui, and 李怡慧. "Fast motion estimation algorithm based on adaptive search pattern." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/79257830641405966245.
Full textAbstract:
碩士義守大學
資訊工程學系碩士班
95
Motion estimation plays an important role in the video coding. The objective of the motion estimation is to remove the temporal redundancy between video frames, and then achieve high compression ratio. In video coding, the full search motion estimation algorithm is searching all possible positions in the searching area, thus it has the optimum performance for motion compensation. But it requires the highest computational load, therefore, the fast algorithms is developed to reduce the computational burden. Traditional fast algorithms are used to search pattern than the distribution error is the smallest of the next search for a search pattern of the center. Only the quantity of the distribution error, it is impossible to be the most likely direction of the message. That is in distribution error is to judge the size, according to continue to do a single search path of information is not enough. The proposed method is mainly based on the adaptive search pattern and use the ratio of the Mean Square Error between the search points to decide next search direction. As well as to set up dynamic threshold in order to stop search at once, it can reducing the search points. The experimental results show that the new scheme is reduce the search points effectively and quality of video is approximate to traditional fast algorithms.