62 resultados para sparse representations
Resumo:
The purpose of this paper is to discuss the linear solution of equality constrained problems by using the Frontal solution method without explicit assembling. Design/methodology/approach - Re-written frontal solution method with a priori pivot and front sequence. OpenMP parallelization, nearly linear (in elimination and substitution) up to 40 threads. Constraints enforced at the local assembling stage. Findings - When compared with both standard sparse solvers and classical frontal implementations, memory requirements and code size are significantly reduced. Research limitations/implications - Large, non-linear problems with constraints typically make use of the Newton method with Lagrange multipliers. In the context of the solution of problems with large number of constraints, the matrix transformation methods (MTM) are often more cost-effective. The paper presents a complete solution, with topological ordering, for this problem. Practical implications - A complete software package in Fortran 2003 is described. Examples of clique-based problems are shown with large systems solved in core. Social implications - More realistic non-linear problems can be solved with this Frontal code at the core of the Newton method. Originality/value - Use of topological ordering of constraints. A-priori pivot and front sequences. No need for symbolic assembling. Constraints treated at the core of the Frontal solver. Use of OpenMP in the main Frontal loop, now quantified. Availability of Software.
Resumo:
We look for minimal chiral sets of fermions beyond the standard model that are anomaly free and, simultaneously, vectorlike particles with respect to color SU(3) and electromagnetic U(1). We then study whether the addition of such particles to the standard model particle content allows for the unification of gauge couplings at a high energy scale, above 5.0 x 10(15) GeV so as to be safely consistent with proton decay bounds. The possibility to have unification at the string scale is also considered. Inspired in grand unified theories, we also search for minimal chiral fermion sets that belong to SU(5) multiplets, restricted to representations up to dimension 50. It is shown that, in various cases, it is possible to achieve gauge unification provided that some of the extra fermions decouple at relatively high intermediate scales.
Resumo:
In the field of appearance-based robot localization, the mainstream approach uses a quantized representation of local image features. An alternative strategy is the exploitation of raw feature descriptors, thus avoiding approximations due to quantization. In this work, the quantized and non-quantized representations are compared with respect to their discriminativity, in the context of the robot global localization problem. Having demonstrated the advantages of the non-quantized representation, the paper proposes mechanisms to reduce the computational burden this approach would carry, when applied in its simplest form. This reduction is achieved through a hierarchical strategy which gradually discards candidate locations and by exploring two simplifying assumptions about the training data. The potential of the non-quantized representation is exploited by resorting to the entropy-discriminativity relation. The idea behind this approach is that the non-quantized representation facilitates the assessment of the distinctiveness of features, through the entropy measure. Building on this finding, the robustness of the localization system is enhanced by modulating the importance of features according to the entropy measure. Experimental results support the effectiveness of this approach, as well as the validity of the proposed computation reduction methods.
Resumo:
Many learning problems require handling high dimensional datasets with a relatively small number of instances. Learning algorithms are thus confronted with the curse of dimensionality, and need to address it in order to be effective. Examples of these types of data include the bag-of-words representation in text classification problems and gene expression data for tumor detection/classification. Usually, among the high number of features characterizing the instances, many may be irrelevant (or even detrimental) for the learning tasks. It is thus clear that there is a need for adequate techniques for feature representation, reduction, and selection, to improve both the classification accuracy and the memory requirements. In this paper, we propose combined unsupervised feature discretization and feature selection techniques, suitable for medium and high-dimensional datasets. The experimental results on several standard datasets, with both sparse and dense features, show the efficiency of the proposed techniques as well as improvements over previous related techniques.
Resumo:
Feature selection is a central problem in machine learning and pattern recognition. On large datasets (in terms of dimension and/or number of instances), using search-based or wrapper techniques can be cornputationally prohibitive. Moreover, many filter methods based on relevance/redundancy assessment also take a prohibitively long time on high-dimensional. datasets. In this paper, we propose efficient unsupervised and supervised feature selection/ranking filters for high-dimensional datasets. These methods use low-complexity relevance and redundancy criteria, applicable to supervised, semi-supervised, and unsupervised learning, being able to act as pre-processors for computationally intensive methods to focus their attention on smaller subsets of promising features. The experimental results, with up to 10(5) features, show the time efficiency of our methods, with lower generalization error than state-of-the-art techniques, while being dramatically simpler and faster.
Resumo:
Relatório da Prática Profissional Supervisionada Mestrado em Educação Pré-Escolar
Resumo:
Relatório de estágio apresentado à Escola Superior de Educação de Lisboa para obtenção de grau de mestre em Ensino do 1.º e 2.º Ciclo do Ensino Básico
Resumo:
Relatório de Estágio apresentado à Escola Superior de Educação de Lisboa para obtenção de grau de mestre em Ensino do 1.º e 2.º Ciclo do Ensino Básico
Resumo:
Relatório de Estágio apresentado à Escola Superior de Educação de Lisboa para obtenção de grau de mestre em Ensino do 1.º e do 2.º Ciclo do Ensino Básico
Resumo:
Dissertação apresentada à Escola Superior de Educação de Lisboa para obtenção do grau de mestre em Educação Matemática na Educação Pré-escolar e nos 1º e 2º Ciclos do Ensino Básico
Resumo:
Tendo em conta o aumento do número de estruturas de apoio à primeira infância, particularmente, a expansão da creche, a investigação tem-se debruçado sobre as questões da qualidade. A generalidade dos estudos centra-se na discriminação das dimensões de qualidade e, raramente, a representação dos pais sobre a creche (e sua qualidade) tem sido alvo de estudo. Partindo do pressuposto que a discussão sobre a qualidade da creche deve ser baseada na evidência empírica mas também é uma construção social baseada nos valores e representações dos seus atores, fomos ouvir os pais. Assim, quisemos conhecer: Como escolhiam a creche do seu filho(a)? Qual o seu conceito de qualidade? Que valor atribuem às experiências vividas pelos seus filhos ou filhas na creche? Que representação têm do papel do profissional de educação? Para o efeito, entrevistamos 20 pais sobre as suas Representações acerca da Creche num estudo exploratório e qualitativo. Os entrevistados foram na maioria dos casos mães (18 em 20) de crianças entre os 8 e os 32 meses (M = 21,65; 9 meninas, 11 meninos; 13 primogénitos). De modo geral, o estudo revelou que os pais valorizam a creche como espaço de promoção do desenvolvimento da criança; valorizam a dimensão afetiva do trabalho em creche; as educadoras como profissionais qualificados de educação e desejam uma relação estreita, aberta e respeitosa entre a creche e a família.
Resumo:
Dissertação apresentada para obtenção do grau de Mestre em Ciências da Educação - Área de especialização em Administração Escolar
Resumo:
Past studies found three types of infant coping behaviour during Face-to-Face Still-Face paradigm (FFSF): a Positive Other-Directed Coping; a Negative Other-Directed Coping and a Self-Directed Coping. In the present study, we investigated whether those types of coping styles are predicted by: infants’ physiological responses; maternal representations of their infant’s temperament; maternal interactive behaviour in free play; and infant birth and medical status. The sample consisted of 46, healthy, prematurely born infants and their mothers. At one month, infant heart rate was collected in basal. At three months old (corrected age), infant heart-rate was registered during FFSF episodes. Mothers described their infants’ temperament using a validated Portuguese temperament scale, at infants three months of corrected age. As well, maternal interactive behaviour was evaluated during a free play situation using CARE-Index. Our findings indicate that positive coping behaviours were correlated with gestational birth weight, heart rate (HR), gestational age, and maternal sensitivity in free play. Gestational age and maternal sensitivity predicted Positive Other-Direct Coping behaviours. Moreover, Positive Other-Direct coping was negatively correlated with HR during Still-Face Episode. Self-directed behaviours were correlated with HR during Still-Face Episode and Recover Episode and with maternal controlling/intrusive behaviour. However, only maternal behaviour predicted Self-direct coping. Early social responses seem to be affected by infants’ birth status and by maternal interactive behaviour. Therefore, internal and external factors together contribute to infant ability to cope and to re-engage after stressful social events.
Resumo:
Modular design is crucial to manage large-scale systems and to support the divide-and-conquer development approach. It allows hierarchical representations and, therefore, one can have a system overview, as well as observe component details. Petri nets are suitable to model concurrent systems, but lack on structuring mechanisms to support abstractions and the composition of sub-models, in particular when considering applications to embedded controllers design. In this paper we present a module construct, and an underlying high-level Petri net type, to model embedded controllers. Multiple interfaces can be declared in a module, thus, different instances of the same module can be used in different situations. The interface is a subset of the module nodes, through which the communication with the environment is made. Module places can be annotated with a generic type, overridden with a concrete type at instance level, and constants declared in a module may have a new value in each instance.
Resumo:
Feature discretization (FD) techniques often yield adequate and compact representations of the data, suitable for machine learning and pattern recognition problems. These representations usually decrease the training time, yielding higher classification accuracy while allowing for humans to better understand and visualize the data, as compared to the use of the original features. This paper proposes two new FD techniques. The first one is based on the well-known Linde-Buzo-Gray quantization algorithm, coupled with a relevance criterion, being able perform unsupervised, supervised, or semi-supervised discretization. The second technique works in supervised mode, being based on the maximization of the mutual information between each discrete feature and the class label. Our experimental results on standard benchmark datasets show that these techniques scale up to high-dimensional data, attaining in many cases better accuracy than existing unsupervised and supervised FD approaches, while using fewer discretization intervals.