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.

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.

Efficient Implementation Of A Single-Precision Floating-Point Arithmetic Unit on FPGA

This paper presents a single precision floating point arithmetic unit with support for multiplication, addition, fused multiply-add, reciprocal, square-root and inverse squareroot with high-performance and low resource usage. The design uses a piecewise 2nd order polynomial approximation to implement reciprocal, square-root and inverse square-root. The unit can be configured with any number of operations and is capable to calculate any function with a throughput of one operation per cycle. The floatingpoint multiplier of the unit is also used to implement the polynomial approximation and the fused multiply-add operation. We have compared our implementation with other state-of-the-art proposals, including the Xilinx Core-Gen operators, and conclude that the approach has a high relative performance/area efficiency. © 2014 Technical University of Munich (TUM).

Offshore wind turbine simulation: multibody drive train. Bacl-to-back NPC (Neutral Point Clamped) converters: Fractional-order control

This paper is on offshore wind energy conversion systems installed on the deep water and equipped with back-to-back neutral point clamped full-power converter, permanent magnet synchronous generator with an AC link. The model for the drive train is a five-mass model which incorporates the dynamic of the structure and the tower in order to emulate the effect of the moving surface. A three-level converter and a four-level converter are the two options with a fractional-order control strategy considered to equip the conversion system. Simulation studies are carried out to assess the quality of the energy injected into the electric grid. Finally, conclusions are presented. (C) 2014 Elsevier Ltd. All rights reserved.

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.

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.

The Sticky Information Macro Model: Beyond Perfect Foresight

Sticky information monetary models have been used in the macroeconomic literature to explain some of the observed features regarding inflation dynamics. In this paper, we explore the consequences of relaxing the rational expectations assumption usually taken in this type of model; in particular, by considering expectations formed through adaptive learning, it is possible to arrive to results other than the trivial convergence to a fixed point long-term equilibrium. The results involve the possibility of endogenous cyclical motion (periodic and a-periodic), which emerges essentially in scenarios of hyperinflation. In low inflation settings, the introduction of learning implies a less severe impact of monetary shocks that, nevertheless, tend to last for additional time periods relative to the pure perfect foresight setup.

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.

A flexible side information generation framework for distributed video coding

One of the most efficient approaches to generate the side information (SI) in distributed video codecs is through motion compensated frame interpolation where the current frame is estimated based on past and future reference frames. However, this approach leads to significant spatial and temporal variations in the correlation noise between the source at the encoder and the SI at the decoder. In such scenario, it would be useful to design an architecture where the SI can be more robustly generated at the block level, avoiding the creation of SI frame regions with lower correlation, largely responsible for some coding efficiency losses. In this paper, a flexible framework to generate SI at the block level in two modes is presented: while the first mode corresponds to a motion compensated interpolation (MCI) technique, the second mode corresponds to a motion compensated quality enhancement (MCQE) technique where a low quality Intra block sent by the encoder is used to generate the SI by doing motion estimation with the help of the reference frames. The novel MCQE mode can be overall advantageous from the rate-distortion point of view, even if some rate has to be invested in the low quality Intra coding blocks, for blocks where the MCI produces SI with lower correlation. The overall solution is evaluated in terms of RD performance with improvements up to 2 dB, especially for high motion video sequences and long Group of Pictures (GOP) sizes.

Toplological Entropy in the Syncronization of Piecewise Linear and Monotone Maps. Coupled Duffing Oscillators

In this paper is presented a relationship between the synchronization and the topological entropy. We obtain the values for the coupling parameter, in terms of the topological entropy, to achieve synchronization of two unidirectional and bidirectional coupled piecewise linear maps. In addition, we prove a result that relates the synchronizability of two m-modal maps with the synchronizability of two conjugated piecewise linear maps. An application to the unidirectional and bidirectional coupled identical chaotic Duffing equations is given. We discuss the complete synchronization of two identical double-well Duffing oscillators, from the point of view of symbolic dynamics. Working with Poincare cross-sections and the return maps associated, the synchronization of the two oscillators, in terms of the coupling strength, is characterized.

Enhanced short wavelength response in laser-scanned-photodiode image sensor using an a-SiC : H/a-Si : H tandem structure

We report in this paper the recent advances we obtained in optimizing a color image sensor based on the laser-scanned-photodiode (LSP) technique. A novel device structure based on a a-SiC:H/a-Si:H pin/pin tandem structure has been tested for a proper color separation process that takes advantage on the different filtering properties due to the different light penetration depth at different wavelengths a-SM and a-SiC:H. While the green and the red images give, in comparison with previous tested structures, a weak response, this structure shows a very good recognition of blue color under reverse bias, leaving a good margin for future device optimization in order to achieve a complete and satisfactory RGB image mapping. Experimental results about the spectral collection efficiency are presented and discussed from the point of view of the color sensor applications. The physics behind the device functioning is explained by recurring to a numerical simulation of the internal electrical configuration of the device.

Some bounds of loss in classical semideterministic immunization

Since Samuelson, Redington and Fisher and Weil, duration and immunization are very important topics in bond portfolio analysis from both a theoretical and a practical point of view. Many results have been established, especially in semi-deterministic framework. As regards, however, the loss may be sustained, we do not think that the subject has been investigated enough, except for the results found in the wake of the theorem of Fong and Vasicek. In this paper we present some results relating to the limitation of the loss in the case of local immunization for multiple liabilities.

Good deals in markets with frictions

This paper studies a portfolio choice problem such that the pricing rule may incorporate transaction costs and the risk measure is coherent and expectation bounded. We will prove the necessity of dealing with pricing rules such that there exists an essentially bounded stochastic discount factor, which must be also bounded from below by a strictly positive value. Otherwise good deals will be available to traders, i.e., depending on the selected risk measure, investors can build portfolios whose (risk, return) will be as close as desired to (−infinity, infinity) or (0, infinity). This pathologic property still holds for vector risk measures (i.e., if we minimize a vector valued function whose components are risk measures). It is worthwhile to point out that essentially bounded stochastic discount factors are not usual in financial literature. In particular, the most famous frictionless, complete and arbitrage free pricing models imply the existence of good deals for every coherent and expectation bounded (scalar or vector) measure of risk, and the incorporation of transaction costs will not guarantee the solution of this caveat.

Constructing good deals in discrete time arbitrage-free dynamic pricing models

Recent literature has proved that many classical pricing models (Black and Scholes, Heston, etc.) and risk measures (V aR, CV aR, etc.) may lead to “pathological meaningless situations”, since traders can build sequences of portfolios whose risk leveltends to −infinity and whose expected return tends to +infinity, i.e., (risk = −infinity, return = +infinity). Such a sequence of strategies may be called “good deal”. This paper focuses on the risk measures V aR and CV aR and analyzes this caveat in a discrete time complete pricing model. Under quite general conditions the explicit expression of a good deal is given, and its sensitivity with respect to some possible measurement errors is provided too. We point out that a critical property is the absence of short sales. In such a case we first construct a “shadow riskless asset” (SRA) without short sales and then the good deal is given by borrowing more and more money so as to invest in the SRA. It is also shown that the SRA is interested by itself, even if there are short selling restrictions.

Controlo de tráfego

O crescente número de automóveis nas ruas das grandes cidades, assim como o crescente número de transportes urbanos para atender o crescimento das populações, veio fazer com que as cidades cada vez mais fiquem mais congestionadas e mais propícias para acidentes envolvendo viaturas e peões. Devido a isso, foram criados sistemas de controlo de tráfego capazes de melhorar o tráfego urbano nas cidades, sem deixar de lado as preocupações com os peões e nem com as emissões de poluentes para o ar. Baseado nesse cenário, este trabalho tem como objetivo abordar as possíveis soluções existentes no mercado para melhorar o fluxo das viaturas, principalmente dos transportes colectivos, com prioridades para viaturas de emergências e autocarros, assim como, as passagens de peões, e sistemas de mobilidade urbana. Desempenho do transporte público pode ser melhorado através de um melhor controlo e gerenciamento de tráfego em geral. Nos testes realizados em campo: foi medida a velocidade de viagem do autocarro no cruzamento fixo (Praça de Espanha), e correlacionando-os com intervalos do ciclo dos semáforos para este cruzamento. A flexibilidade do controlador actuando, com o auxílio de detectores de veículos, sendo capaz de variar os intervalos dentro do ciclo, bem como o volume de carros e de prestações em velocidade de viagem do autocarro. Resultados mostram que, durante o período em estudo, os benefícios de velocidade da viagem do autocarro, seria possível, através de um verdadeiro controlo de tempo feedback de cooperação entre as áreas urbanas de controlo de tráfego (Gertrude) e do sistema de localização de veículos de transportes públicos (SAEIP). Ao longo prazo, sugerimos a implantação de um sistema integrado. Fazendo com que o volume no carro seja reduzido. Este efeito leva também, a um aumento da velocidade comercial do autocarro urbano, da mesma forma como foi proposto em nossa experiência.