Trends Of CPU, GPU and FPGA for high-performance computing

Floating-point computing with more than one TFLOP of peak performance is already a reality in recent Field-Programmable Gate Arrays (FPGA). General-Purpose Graphics Processing Units (GPGPU) and recent many-core CPUs have also taken advantage of the recent technological innovations in integrated circuit (IC) design and had also dramatically improved their peak performances. In this paper, we compare the trends of these computing architectures for high-performance computing and survey these platforms in the execution of algorithms belonging to different scientific application domains. Trends in peak performance, power consumption and sustained performances, for particular applications, show that FPGAs are increasing the gap to GPUs and many-core CPUs moving them away from high-performance computing with intensive floating-point calculations. FPGAs become competitive for custom floating-point or fixed-point representations, for smaller input sizes of certain algorithms, for combinational logic problems and parallel map-reduce problems. © 2014 Technical University of Munich (TUM).

The extended unsymmetric frontal solution for multiple-point constraints

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.

Extended immersive learning environment: a hybrid remote/virtual laboratory

This paper presents a collaborative virtual learning environment, which includes technologies such as 3D virtual representations, learning and content management systems, remote experiments, and collaborative learning spaces, among others. It intends to facilitate the construction, management and sharing of knowledge among teachers and students, in a global perspective. The environment proposes the use of 3D social representations for accessing learning materials in a dynamic and interactive form, which is regarded to be closer to the physical reality experienced by teachers and students in a learning context. A first implementation of the proposed extended immersive learning environment, in the area of solid mechanics, is also described, including the access to theoretical contents and a remote experiment to determine the elastic modulus of a given object.These instructions give you basic guidelines for preparing camera-ready papers for conference proceedings. Use this document as a template if you are using Microsoft Word 6.0 or later. Otherwise, use this document as an instruction set. The electronic file of your paper will be formatted further. Define all symbols used in the abstract. Do not cite references in the abstract.

Minimal anomaly-free chiral fermion sets and gauce coupling unification

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.

On the relation between the fractional Brownian motion and the fractional derivatives

Physics Letters A, vol. 372; Issue 7

Global localization with non-quantized local image features

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.

An unsupervised approach to feature discretization and selection

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.

Efficient feature selection filters for high-dimensional data

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.

São diferentes porque a menina tem saia e o menino tem calças: as questões de género no jardim de infância

Relatório da Prática Profissional Supervisionada Mestrado em Educação Pré-Escolar

Das conceções às práticas de avaliação formativa no 1.º ciclo do ensino básico

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

As representações da escola face ao trabalho para casa, no 1.º ciclo do ensino básico

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

Comunicação matemática - representações utilizadas pelos alunos

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

Conhecimento do professor do 1º ciclo sobre números racionais

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

Estudo exploratório sobre as representações dos pais relativamente à educação em creche

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.

A pattern language for parallelizing irregular algorithms

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do grau de Mestre em Engenharia Informática