A Step-up mu-Power Converter for Solar Energy Harvesting Applications, using Hill Climbing Maximum Power Point Tracking

This paper presents a step-up micro-power converter for solar energy harvesting applications. The circuit uses a SC voltage tripler architecture, controlled by an MPPT circuit based on the Hill Climbing algorithm. This circuit was designed in a 0.13 mu m CMOS technology in order to work with an a-Si PV cell. The circuit has a local power supply voltage, created using a scaled down SC voltage tripler, controlled by the same MPPT circuit, to make the circuit robust to load and illumination variations. The SC circuits use a combination of PMOS and NMOS transistors to reduce the occupied area. A charge re-use scheme is used to compensate the large parasitic capacitors associated to the MOS transistors. The simulation results show that the circuit can deliver a power of 1266 mu W to the load using 1712 mu W of power from the PV cell, corresponding to an efficiency as high as 73.91%. The simulations also show that the circuit is capable of starting up with only 19% of the maximum illumination level.

Logarithmically proportional objective function for planar surfaces recognition in 3D point cloud

3D laser scanning is becoming a standard technology to generate building models of a facility's as-is condition. Since most constructions are constructed upon planar surfaces, recognition of them paves the way for automation of generating building models. This paper introduces a new logarithmically proportional objective function that can be used in both heuristic and metaheuristic (MH) algorithms to discover planar surfaces in a point cloud without exploiting any prior knowledge about those surfaces. It can also adopt itself to the structural density of a scanned construction. In this paper, a metaheuristic method, genetic algorithm (GA), is used to test this introduced objective function on a synthetic point cloud. The results obtained show the proposed method is capable to find all plane configurations of planar surfaces (with a wide variety of sizes) in the point cloud with a minor distance to the actual configurations. © 2014 IEEE.

Algorithm-oriented design of efficient many-core architectures applied to dense matrix multiplication

Recent integrated circuit technologies have opened the possibility to design parallel architectures with hundreds of cores on a single chip. The design space of these parallel architectures is huge with many architectural options. Exploring the design space gets even more difficult if, beyond performance and area, we also consider extra metrics like performance and area efficiency, where the designer tries to design the architecture with the best performance per chip area and the best sustainable performance. In this paper we present an algorithm-oriented approach to design a many-core architecture. Instead of doing the design space exploration of the many core architecture based on the experimental execution results of a particular benchmark of algorithms, our approach is to make a formal analysis of the algorithms considering the main architectural aspects and to determine how each particular architectural aspect is related to the performance of the architecture when running an algorithm or set of algorithms. The architectural aspects considered include the number of cores, the local memory available in each core, the communication bandwidth between the many-core architecture and the external memory and the memory hierarchy. To exemplify the approach we did a theoretical analysis of a dense matrix multiplication algorithm and determined an equation that relates the number of execution cycles with the architectural parameters. Based on this equation a many-core architecture has been designed. The results obtained indicate that a 100 mm(2) integrated circuit design of the proposed architecture, using a 65 nm technology, is able to achieve 464 GFLOPs (double precision floating-point) for a memory bandwidth of 16 GB/s. This corresponds to a performance efficiency of 71 %. Considering a 45 nm technology, a 100 mm(2) chip attains 833 GFLOPs which corresponds to 84 % of peak performance These figures are better than those obtained by previous many-core architectures, except for the area efficiency which is limited by the lower memory bandwidth considered. The results achieved are also better than those of previous state-of-the-art many-cores architectures designed specifically to achieve high performance for matrix multiplication.

Detect and pointing algorithm's performance for a planar smart antenna array: a review

An adaptive antenna array combines the signal of each element, using some constraints to produce the radiation pattern of the antenna, while maximizing the performance of the system. Direction of arrival (DOA) algorithms are applied to determine the directions of impinging signals, whereas beamforming techniques are employed to determine the appropriate weights for the array elements, to create the desired pattern. In this paper, a detailed analysis of both categories of algorithms is made, when a planar antenna array is used. Several simulation results show that it is possible to point an antenna array in a desired direction based on the DOA estimation and on the beamforming algorithms. A comparison of the performance in terms of runtime and accuracy of the used algorithms is made. These characteristics are dependent on the SNR of the incoming signal.

New developments on VCA unmixing algorithm

Hyperspectral sensors are being developed for remote sensing applications. These sensors produce huge data volumes which require faster processing and analysis tools. Vertex component analysis (VCA) has become a very useful tool to unmix hyperspectral data. It has been successfully used to determine endmembers and unmix large hyperspectral data sets without the use of any a priori knowledge of the constituent spectra. Compared with other geometric-based approaches VCA is an efficient method from the computational point of view. In this paper we introduce new developments for VCA: 1) a new signal subspace identification method (HySime) is applied to infer the signal subspace where the data set live. This step also infers the number of endmembers present in the data set; 2) after the projection of the data set onto the signal subspace, the algorithm iteratively projects the data set onto several directions orthogonal to the subspace spanned by the endmembers already determined. The new endmember signature corresponds to these extreme of the projections. The capability of VCA to unmix large hyperspectral scenes (real or simulated), with low computational complexity, is also illustrated.

O tempo dos outros: João Salaviza e Cláudia Varejão no interior de uma nova geração

O projecto “Principais tendências no cinema português contemporâneo” nasceu no Departamento de Cinema da ESTC, com o objectivo de desenvolver investigação especializada a partir de um núcleo formado por alunos da Licenciatura em Cinema e do Mestrado em Desenvolvimento de Projecto Cinematográfico, a que se juntaram professores-investigadores membros do CIAC e convidados. O que agora se divulga corresponde a dois anos e meio de trabalho desenvolvido pela equipa de investigação, entre Abril de 2009 e Novembro de 2011. Dada a forma que ele foi adquirindo, preferimos renomeá-lo, para efeitos de divulgação, “Novas & velhas tendências no cinema português contemporâneo”.

Grid structure impact in sparse point representation of derivatives

In the Sparse Point Representation (SPR) method the principle is to retain the function data indicated by significant interpolatory wavelet coefficients, which are defined as interpolation errors by means of an interpolating subdivision scheme. Typically, a SPR grid is coarse in smooth regions, and refined close to irregularities. Furthermore, the computation of partial derivatives of a function from the information of its SPR content is performed in two steps. The first one is a refinement procedure to extend the SPR by the inclusion of new interpolated point values in a security zone. Then, for points in the refined grid, such derivatives are approximated by uniform finite differences, using a step size proportional to each point local scale. If required neighboring stencils are not present in the grid, the corresponding missing point values are approximated from coarser scales using the interpolating subdivision scheme. Using the cubic interpolation subdivision scheme, we demonstrate that such adaptive finite differences can be formulated in terms of a collocation scheme based on the wavelet expansion associated to the SPR. For this purpose, we prove some results concerning the local behavior of such wavelet reconstruction operators, which stand for SPR grids having appropriate structures. This statement implies that the adaptive finite difference scheme and the one using the step size of the finest level produce the same result at SPR grid points. Consequently, in addition to the refinement strategy, our analysis indicates that some care must be taken concerning the grid structure, in order to keep the truncation error under a certain accuracy limit. Illustrating results are presented for 2D Maxwell's equation numerical solutions.

Antena para sistema de localização interior

Dissertação para obtenção do grau de Mestre em Engenharia de Electrónica e Telecomunicações

Avaliação do risco associado a movimentos verticais de navios em manobra no porto da Praia da Vitória

O risco associado a um navio em manobra pode ser avaliado pela probabilidade do movimento vertical de um ponto do navio ultrapassar um determinado limiar pré-definido. Essa excedência pode originar danos tanto no próprio navio como nas estruturas portuárias envolventes. Este trabalho surge no seguimento de um estudo efectuado no Laboratório Nacional de Engenharia Civil (LNEC), no qual foi desenvolvido um conjunto de ferramentas de avaliação da função resposta do navio quando sujeito à agitação marítima e, partindo dessas ferramentas, foi obtido um procedimento para determinação do espectro dos movimentos verticais de um ponto de um navio parado sujeito àquele estado de agitação (Rodrigues, 2010). No presente estudo, estendeu-se esse procedimento de modo a avaliar a influência da velocidade de avanço do navio no espectro dos movimentos verticais do mesmo. O percurso de entrada do “N/M Fernão Gomes” no porto da Praia da Vitória foi o caso de estudo considerado. A agitação marítima incidente no navio cobriu o período de Janeiro de 2009 a Dezembro de 2010 e foi obtida com base no modelo previsão de escala regional (WAVEWATCH III) e posteriormente transferida para o interior do porto com o recurso a modelos numéricos de propagação de ondas (SWAN e DREAMS). Foi também assumido que a altura do movimento vertical do navio segue uma distribuição de Rayleigh, a qual possibilita a determinação da altura significativa desse movimento vertical, bem como a implementação de um procedimento para determinar a probabilidade de a altura do movimento vertical do navio não exceder um limiar pré-definido e consequentemente mostrar, através da análise dos resultados, a influência da velocidade de avanço do navio. Da análise dos resultados concluiu-se que a velocidade tem uma influência significativa nos resultados. No final avaliou-se a contribuição dos resultados anteriormente determinados, para a análise do risco associado aos movimentos verticais do navio quando em manobra no porto em estudo.

Síndroma dos edifícios doentes: estudo da qualidade do ar interior e despiste da eventual existência de SED entre a população do edifício “E” de um estabelecimento de ensino superior

Mestrado em Segurança e Higiene no Trabalho.

Acompanhamento da construção da subconcessão do Pinhal Interior: obras de arte

O presente relatório de estágio enquadra-se no âmbito do Trabalho Final de Mestrado, do curso de Engenharia Civil, Área de Especialização de Estruturas, ministrado no Instituto Superior de Engenharia de Lisboa (ISEL). O Estágio foi realizado na empreitada de construção da Subconcessão Pinhal Interior, lote 7, IC8 – Proença-a-Nova / Perdigão (A23), obra adjudicada à Ascendi Pinhal Interior / Mota - Engil, Engenharia e Construção (MEEC), durante o semestre de verão de 2012. Em termos objetivos, o estágio traduziu-se no acompanhamento da construção desta nova ligação rodoviária, em particular das obras de arte, onde se destaca a futura Ponte sobre o Rio Ocreza. A Ponte sobre o Rio Ocreza (PROC), tem um desenvolvimento total de 420 m, com vãos de 110 m – 190 m – 120 m e uma altura máxima do tabuleiro ao leito do rio de 98 m. Em termos planimétricos a diretriz da rodovia traduz-se numa reta enquanto a rasante corresponde a uma curva côncava com 5500 m de raio. A obra em questão será baseada no Processo Construtivo: Carros de Avanço emAduelas Sucessivas moldadas in situ.

Elastically restrained Bernoulli-Euler beams applied to rotary machinery modelling

Facing the lateral vibration problem of a machine rotor as a beam on elastic supports in bending, the authors deal with the free vibration of elastically restrained Bernoulli-Euler beams carrying a finite number of concentrated elements along their length. Based on Rayleigh's quotient, an iterative strategy is developed to find the approximated torsional stiffness coefficients, which allows the reconciliation between the theoretical model results and the experimental ones, obtained through impact tests. The mentioned algorithm treats the vibration of continuous beams under a determined set of boundary and continuity conditions, including different torsional stiffness coefficients and the effect of attached concentrated masses and rotational inertias, not only in the energetic terms of the Rayleigh's quotient but also on the mode shapes, considering the shape functions defined in branches. Several loading cases are examined and examples are given to illustrate the validity of the model and accuracy of the obtained natural frequencies.

IOPT Petri Net State Space Generation Algorithm with Maximal-Step Execution Semantics

This paper presents an algorithm to efficiently generate the state-space of systems specified using the IOPT Petri-net modeling formalism. IOPT nets are a non-autonomous Petri-net class, based on Place-Transition nets with an extended set of features designed to allow the rapid prototyping and synthesis of system controllers through an existing hardware-software co-design framework. To obtain coherent and deterministic operation, IOPT nets use a maximal-step execution semantics where, in a single execution step, all enabled transitions will fire simultaneously. This fact increases the resulting state-space complexity and can cause an arc "explosion" effect. Real-world applications, with several million states, will reach a higher order of magnitude number of arcs, leading to the need for high performance state-space generator algorithms. The proposed algorithm applies a compilation approach to read a PNML file containing one IOPT model and automatically generate an optimized C program to calculate the corresponding state-space.

Comparação do cálculo de dose com os algoritmos Analytical Anisotropic Algorithm e Pencil Beam Convolution na patologia de pulmão

Mestrado em Radioterapia.

Sensing Cloud Optimization to Solve ED of Units with Valve-Point Effects and Multi-fuels

In this paper a solution to an highly constrained and non-convex economical dispatch (ED) problem with a meta-heuristic technique named Sensing Cloud Optimization (SCO) is presented. The proposed meta-heuristic is based on a cloud of particles whose central point represents the objective function value and the remaining particles act as sensors "to fill" the search space and "guide" the central particle so it moves into the best direction. To demonstrate its performance, a case study with multi-fuel units and valve- point effects is presented.