• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 261
  • 49
  • 17
  • 13
  • 11
  • 11
  • 11
  • 11
  • 11
  • 11
  • 9
  • 6
  • 4
  • 4
  • 3
  • Tagged with
  • 472
  • 472
  • 93
  • 82
  • 68
  • 51
  • 48
  • 45
  • 39
  • 37
  • 35
  • 35
  • 31
  • 30
  • 30
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
291

Teaching phonics skills to young children via the formation of generalized equivalence classes

Metcalfe, Marta J. January 1999 (has links)
An equivalence class exists if the stimuli that comprise the class are related by the properties of reflexivity, symmetry, and transitivity. Through these properties, new behavior that has not been taught emerges. For example, when taught to match Set A stimuli to Set B stimuli and to match Set A stimuli to Set C stimuli, if equivalence classes have formed, subjects will (with no explicit instruction) match Set B stimuli to Set C and Set C stimuli to Set B stimuli. Although equivalence classes have been studied extensively, few studies have considered the application of this technology to educational concerns. The purpose of this study was (a) to determine if phonics skills could effectively and efficiently be taught to young children through the formation of equivalence classes and (b) to investigate the generality of those acquired skills. Using a conditional discrimination procedure, children were taught to match printed letters to dictated phonetic sounds and to match the initial sound of pictured items to dictated phonetic sounds. Test results indicated that equivalence classes had emerged and that generalization did occur. The children could match the initial sound of pictured items to printed letters and vice versa and could name letter sounds and initial sounds of pictured items. During generality testing, each child could identify the initial sound of several novel pictured items and could sound out the letters within the words. However, reading did not occur. Only 1 of 5 children could blend the sounds of letters into recognizable words. A significant difficulty encountered throughout the study was maintaining the children's motivation, possibly due to the children's inexperience in attending to academic tasks. This study did, however, demonstrate that the formation of equivalence classes is an effective and efficient method for teaching phonics and that the formation of generalized equivalence classes is effective in extending those taught relations to novel stimuli. / Department of Special Education
292

Privacy Preserving Data Mining using Unrealized Data Sets: Scope Expansion and Data Compression

Fong, Pui Kuen 16 May 2013 (has links)
In previous research, the author developed a novel PPDM method – Data Unrealization – that preserves both data privacy and utility of discrete-value training samples. That method transforms original samples into unrealized ones and guarantees 100% accurate decision tree mining results. This dissertation extends their research scope and achieves the following accomplishments: (1) it expands the application of Data Unrealization on other data mining algorithms, (2) it introduces data compression methods that reduce storage requirements for unrealized training samples and increase data mining performance and (3) it adds a second-level privacy protection that works perfectly with Data Unrealization. From an application perspective, this dissertation proves that statistical information (i. e. counts, probability and information entropy) can be retrieved precisely from unrealized training samples, so that Data Unrealization is applicable for all counting-based, probability-based and entropy-based data mining models with 100% accuracy. For data compression, this dissertation introduces a new number sequence – J-Sequence – as a mean to compress training samples through the J-Sampling process. J-Sampling converts the samples into a list of numbers with many replications. Applying run-length encoding on the resulting list can further compress the samples into a constant storage space regardless of the sample size. In this way, the storage requirement of the sample database becomes O(1) and the time complexity of a statistical database query becomes O(1). J-Sampling is used as an encryption approach to the unrealized samples already protected by Data Unrealization; meanwhile, data mining can be performed on these samples without decryption. In order to retain privacy preservation and to handle data compression internally, a column-oriented database management system is recommended to store the encrypted samples. / Graduate / 0984 / fong_bee@hotmail.com
293

Measurement of Fiscal Rules: Introducing the Application of Partially Ordered Set (POSET) Theory

Badinger, Harald, Reuter, Wolf Heinrich 03 1900 (has links) (PDF)
Data on (economic) institutions are often available only as observations on ordinal, inherently incomparable properties, which are then typically aggregated to a composite index in the empirical social science literature. From a methodological perspective, the present paper advocates the application of partially ordered set (POSET) theory as an alternative approach. Its main virtue is that it takes the ordinal nature of the data seriously and dispenses with the unavoidably subjective assignment of weights to incomparable properties, maintains a high standard of objectivity, and can be applied in various fields of economics. As an application, the POSET approach is then used to calculate new indices on the stringency of fiscal rules for 81 countries over the period 1985 to 2012 based on recent data by the IMF (2012). The derived measures of fiscal rules are used to test their significance for public finances in a fiscal reaction function and compare the POSET with the composite index approach. (authors' abstract)
294

Sets and senses : a work for symphony orchestra accompanied by an analysis : a hierarchy of scienceart interactions

Holbrook, Geoffrey. January 2006 (has links)
Sets and the Senses is a work for symphony orchestra that bears the interaction between science and art as its overriding theme. Formalizations of compositional parameters that relate to this interaction are established, in particular those relating to the contrast between systematic and intuitively composed music, in order to provide a vehicle for musical communication on the theme. A summary of scientific and artistic elements of the compositional process reveals in the work an ingrained hierarchy of science/art interactions. Specific strategies for manipulating the science/art parameters are described. Genetic algorithms as applied to computer-assisted composition are discussed. The formal design of the work is described in terms of the relationship between science and art, accompanied by descriptions of systematic and intuitive musical procedures used.
295

Optimal experimental design for nonlinear and generalised linear models

Waterhouse, Timothy Hugh Unknown Date (has links)
No description available.
296

Problems and results in partially ordered sets, graphs and geometry

Biro, Csaba January 2008 (has links)
Thesis (Ph.D.)--Mathematics, Georgia Institute of Technology, 2008. / Committee Chair: Trotter, William T.; Committee Member: Duke, Richard A.; Committee Member: Randall, Dana; Committee Member: Thomas, Robin; Committee Member: Yu, Xingxing
297

Group based techniques for stable feature selection

Loscalzo, Steven. January 2009 (has links)
Thesis (M.S.)--State University of New York at Binghamton, Thomas J. Watson School of Engineering and Applied Science, Department of Computer Science, 2009. / Includes bibliographical references.
298

Surface reconstruction using gamma shapes

Sun, Ying. January 2006 (has links) (PDF)
Thesis (Ph. D.)--University of Alabama at Birmingham, 2006. / Description based on contents viewed Jan. 26, 2007; title from title screen. Includes bibliographical references (p. 119-125).
299

Conjuntos de simetrias de curvas planas invariantes por transformações afins / Symmetry sets of plane curves invariants under affine transformations

Guedes, Renno Santos 21 February 2014 (has links)
Made available in DSpace on 2015-03-26T13:45:37Z (GMT). No. of bitstreams: 1 texto completo.pdf: 2634733 bytes, checksum: 3cb7c76ba150aef3f051776bae4f9a1a (MD5) Previous issue date: 2014-02-21 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / In the 1990s, mathematicians Peter Giblin and Guillermo Sapiro have introduced the theory of affine invariant symmetry sets of plane curves. This dissertation is devoted to the study of some of these symmetry sets centre symmetry sets (CSS), affine distance symmetry set (ADSS) and affine envelope symmetry set (A6'SS) of a a simple closed convex smooth curve. We study these symmetry sets of through the locus of centers of conics and as an envelope of curves. We analyze the conditions of singularities, studying some in particular. We also study conditions of contact of the curve and of the conics that defined this symmetry sets. / No final dos anos 1990, os matemáticos Peter Giblin e Guillermo Sapiro introduziram a teoria sobre conjuntos de simetria de curvas planas invariantes por transformações afins. Esta dissertação é dedicada ao estudo de alguns destes conjuntosz 0 conjunto de simetria centml (CSS), 0 conjunto de simetria da distância afim(ADSS) e 0 conjunto de simetria da envolvente afim (A6'SS) de uma curva plana diferenciável fechada e convexa. Estudamos os conjuntos de simetria através do local geométrico dos centros de cônicas e como envolvente de curvas. Analisamos as condições de singularidades de cada um, estudando algumas em particular. Também estudamos condições de contato da curva e das cônicas que definem conjuntos de simetria. O estudo está baseado principalmente nos artigos [16] e [14].
300

Proposta de um método de aplicação da teoria de projeto axiomático ao desenvolvimento de software PON-POR

Batista, Márcio Venâncio 23 August 2013 (has links)
Esta pesquisa propõe um método que aplica a Teoria de Projeto Axiomático (PA) ao processo de desenvolvimento de software que se orientam por regras. Nesse âmbito, salienta-se que não foi encontrada na literatura, durante os esforços de pesquisa deste trabalho, a aplicação da Teoria de Projeto Axiomático a sistemas orientados a Regras. Entretanto, a Teoria de Projeto Axiomático já sim foi foco de pesquisa e aplicação no processo de desenvolvimento de software orientado a objeto, servindo de inspiração ao presente trabalho. Dito isso, este trabalho propõe o método Projeto Axiomático aplicado ao Paradigma Orientado a Notificações e ao Paradigma Orientado a Regras (PA-PON-POR) desde que as regras sigam o modelo de estruturação dado pelo PON. O método PA-PON-POR propõe a decomposição funcional de requisitos do sistema em quatro níveis que são: Casos de Uso, Subcasos de Uso Independentes de Características Técnicas, Subcasos de Uso Dependentes de Características Técnicas e Serviços Técnicos. Além disso, o método PA-PON-POR aplica o Axioma da Independência do PA em cada um dos quatro níveis de decomposição por meio das matrizes de projeto e métricas de cálculo da reangularidade e semangularidade do próprio PA. As matrizes de projeto ainda auxiliam na identificação das Premissas exclusivas, elementos esses importantes quando um sistema PON-POR possui Regras que possuem Ações que instigam a geração de fatos conflitantes. O Axioma da Informação do Projeto Axiomático também é aplicado em cada nível de decomposição avaliando as soluções de projeto quanto a sua quantidade de informação. Ainda, o método PA-PON-POR apresenta um conjunto de métricas especificas para avaliação da qualidade estrutural da composição de Regras do sistema, fornecendo critérios para tomada de decisão sobre a qualidade do projeto especificado. Além disso, o método PA-PON-POR é passível de aplicação simultânea com o método existente de projeto de software baseado em desenvolvimento de aplicações PON-POR chamado de Desenvolvimento Orientado a Notificações e Orientado a Regras (DON-DOR), auxiliando na obtenção e validação de artefatos do mesmo. O método PA-PON-POR foi aplicado no desenvolvimento de dois softwares, o primeiro software refere-se um simulador de portão eletrônico e o segundo software refere-se a um sistema de vendas. Em ambas as aplicações, o método PA-PON-POR demonstrou ser eficiente no que se propõe, auxiliando no processo de criação de Regras e de sistemas PON-POR com alguma garantia de qualidade. / This research proposes a method to apply the Axiomatic Design Theory (ADT) in the Rule-oriented software development process. In this context, it was not found in the literature, by the efforts of this work research, the application of ADT in Rule-oriented software development. However, the ADT was focus on research in Object-Oriented software development in a previous work, which was used as inspiration in this current research work. This current research proposes the method Axiomatic Design for Notification-Oriented Paradigm and Rule-Oriented Paradigm (AD-NOP-ROP) since the rules follow the NOP structural model. This method proposes a functional decomposition of system requirements in four levels which are: Use Cases, Use Subcases that are Technical Feature Independent, Use Subcases that are Technical Feature Dependent, and Technical Service . Furthermore, the method AD-NOP-ROP applies the ADT Independence Axiom in each one of the decomposition levels by means of design matrixes and metrics which calculates reangularity and semangularity from ADT. The design matrixes still aids in the identification of Exclusive Premises, which are important elements of NOP-ROP systems with Rules whose Actions instigate the creation of conflicting facts. The Information Axiom from ADT is also applied in each decomposition level in order to evaluate design solutions in terms of its amount of information. Still, the method AD-NOP-ROP presents a set of metrics which are specific for evaluation of structural quality of Rule composition, thereby providing criteria for decision making with respect to design quality. Besides, the method AD-NOP-ROP can be used in a simultaneous way with the existent method used for software design based on NOP-ROP application development, so called Notification-Oriented and Rule-Oriented Application Development (NO-RO-AD), in order to assist in the achievement and validation of artifacts. The method AD-NOP-ROP was applied during the development of two software systems, the first one refers to an Electronic Gate and the second one refers to a Sales System. In both applications the method displayed efficiency in its purposes, assisting in the Rule creation process and also in the creation of NOP-ROP software with some quality assurance.

Page generated in 0.0593 seconds