Topology optimization of a cantilevered piezoelectric energy harvester using stress norm constraints

Vibrational piezoelectric energy harvesters are devices which convert ambient vibrational energy into electric energy. Here we focus on the common cantilever type in which an elastic beam is sandwiched between two piezoelectric plates. In order to maximize the electric power for a given sinusoidal vibrational excitation, we perform topology optimization of the elastic beam and tip mass by means of the SIMP approach, leaving the piezoelectric plates solid. We are interested in the first and especially second resonance mode. Homogenizing the piezoelectric strain distribution is a common indirect approach increasing the electric performance. The large design space of the topology optimization approach and the linear physical model also allows the maximization of electric performance by maximizing peak bending, resulting in practically infeasible designs. To avoid such problems, we formulate dynamic piezoelectric stress constraints. The obtained result is based on a mechanism which differs significantly from the common designs reported in literature.     

Ultraviolet photodetectors and readout based on a-IGZO semiconductor technology

In this work, real-time ultraviolet photodetectors are realized through metal–semiconductor–metal (MSM) structures. Amorphous indium gallium zinc oxide (a-IGZO) is used as semiconductor material and gold as metal electrodes. The readout of an individual sensor is implemented by a transimpedance amplifier (TIA) consisting of an all-enhancement a-IGZO thin-film transistor (TFT) operational amplifier and a switched capacitor (SC) as feedback resistance. The photosensor and the transimpedance amplifier are both manufactured on glass substrates. The measured photosensor possesses a high responsivity R , a low response time t _{R E S} , and a good noise equivalent power value NEP .     

Relaxing high-dimensional constraints in the direct solution space method for early phase development

Early phase distributed system design can be accomplished using solution spaces that provide an interval of permissible values for each functional parameter. The feasibility property guarantees fulfillment of all design requirements for all possible realizations. Flexibility denotes the size measure of the intervals, with higher flexibility benefiting the design process. Two methods are available for solution space identification. The direct method solves a computationally cheap optimization problem. The indirect method employs a sampling approach that requires a relaxation of the feasibility property through re-formulation as a chance constraint. Even for high probabilities of fulfillment, \(P>0.99\), this results in substantial increases in flexibility, which offsets the risk of infeasibility. This work implements the chance constraint formulation into the direct method for linear constraints by showing that its problem statement can be understood as a linear robust optimization problem. Approximations of chance constraints from the literature are transferred into the context of solution spaces. From this, we derive a theoretical value for the safety parameter \(\varOmega\). A further modification is presented for use cases, where some intervals are already predetermined. A problem from vehicle safety is used to compare the modified direct and indirect methods and discuss suitable choices of \(\varOmega\). We find that the modified direct method is able to identify solution spaces with similar flexibility, while maintaining its cost advantage.     

3D-Druck für Hochvakuumanwendungen

To mark our anniversary, we are presenting articles that have been particularly appreciated by readers of our online edition once again in print. Here: 3D-Printing for High Vacuum Applications 3D printing technology has made the leap from a home-based private practice to industrial manufacturing. Due to the increasing reliability of printers and increasing material diversity, especially in the metal sector, double-digit percentage growth rates are possible in the coming years. This thesis deals with the manufacture of parts made by 3D printing for high vacuum application. Different components are printed and examined for their vacuum compatibility. As shown furthermore, conventionally made standard components can be vacuum sealed to printed parts, which enables cost-effective production of more complex components, such as e.g. a vacuum chamber allows. In addition, functional components can already be realized in the manufacturing process. The integration of a system of flow channels directly into the wall of a chamber is just one example. Thus, such a chamber can be heated during evacuation and effectively cool in later operation.     

Distributed Approximation of Capacitated Dominating Sets

We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph G=(V,E), and a capacity cap(v)∈ℕ for each node v∈V, the CapMDS problem asks for a subset S⊆V of minimal cardinality, such that every network node not in S is covered by at least one neighbor in S, and every node v∈S covers at most cap(v) of its neighbors. We prove that in general graphs and even with uniform capacities, the problem is inherently non-local, i.e., every distributed algorithm achieving a non-trivial approximation ratio must have a time complexity that essentially grows linearly with the network diameter. On the other hand, if for some parameter ε>0, capacities can be violated by a factor of 1+ε, CapMDS becomes much more local. Particularly, based on a novel distributed randomized rounding technique, we present a distributed bi-criteria algorithm that achieves an O(log Δ)-approximation in time O(log ³ n+log (n)/ε), where n and Δ denote the number of nodes and the maximal degree in G, respectively. Finally, we prove that in geometric network graphs typically arising in wireless settings, the uniform problem can be approximated within a constant factor in logarithmic time, whereas the non-uniform problem remains entirely non-local.     

Automated property verification for large scale B models with ProB

In this paper we describe the successful application of the ProB tool for data validation in several industrial applications. The initial case study centred on the San Juan metro system installed by Siemens. The control software was developed and formally proven with B. However, the development contains certain assumptions about the actual rail network topology which have to be validated separately in order to ensure safe operation. For this task, Siemens has developed custom proof rules for Atelier B. Atelier B, however, was unable to deal with about 80 properties of the deployment (running out of memory). These properties thus had to be validated by hand at great expense, and they need to be revalidated whenever the rail network infrastructure changes. In this paper we show how we were able to use ProB to validate all of the about 300 properties of the San Juan deployment, detecting exactly the same faults automatically in a few minutes that were manually uncovered in about one man-month. We have repeated this task for three ongoing projects at Siemens, notably the ongoing automatisation of the line 1 of the Paris Métro. Here again, about a man month of effort has been replaced by a few minutes of computation. This achievement required the extension of the ProB kernel for large sets as well as an improved constraint propagation algorithm. We also outline some of the effort and features that were required in moving from a tool capable of dealing with medium-sized examples towards a tool able to deal with actual industrial specifications. We also describe the issue of validating ProB, so that it can be integrated into the SIL4 development chain at Siemens.     

Lock-in amplifier error prediction and correction in frequency sweep measurements

This article proposes an analytical algorithm for predicting errors in lock-in amplifiers (LIAs) working with time-varying reference frequency. Furthermore, a simple method for correcting such errors is presented. The reference frequency can be swept in order to measure the frequency response of a system within a given spectrum. The continuous variation of the reference frequency produces a measurement error that depends on three factors: the sweep speed, the LIA low-pass filters, and the frequency response of the measured system. The proposed error prediction algorithm is based on the final value theorem of the Laplace transform. The correction method uses a double-sweep measurement. A mathematical analysis is presented and validated with computational simulations and experimental measurements.     

Efficient computation based on stochastic spikes

The speed and reliability of mammalian perception indicate that cortical computations can rely on very few action potentials per involved neuron. Together with the stochasticity of single-spike events in cortex, this appears to imply that large populations of redundant neurons are needed for rapid computations with action potentials. Here we demonstrate that very fast and precise computations can be realized also in small networks of stochastically spiking neurons. We present a generative network model for which we derive biologically plausible algorithms that perform spike-by-spike updates of the neuron's internal states and adaptation of its synaptic weights from maximizing the likelihood of the observed spike patterns. Paradigmatic computational tasks demonstrate the online performance and learning efficiency of our framework. The potential relevance of our approach as a model for cortical computation is discussed.     

Zur semantischen Interoperabilität in der Energiebranche: CIM IEC 61970

This contribution provides an introduction to the Common Information Model CIM which is an international standard maintained by the International Electrotechnical Commission IEC. Today’s market requirements towards the model are discussed, furthermore, we give an introduction to the history of the CIM, its serializations and scope of application. The contribution concludes with an overview of future use of the CIM for both science and commerce. Briefly, we focus on:

Message-based loose coupling of information systems

Exchange of power grid topologies with minimal communication and data overhead

Data quality assurance using ontology-based meta annotations and

Integration of heterogeneous standards in the utility domain. The contribution presents solutions to the use cases providing a better information management for the utility utilizing the Common Information Model.