Transmission electron microscopy study of a dental gallium alloy

Analytical transmission electron microscopy (TEM) studies of a dental gallium alloy have been carried out. This commercial Ga alloy was made by triturating a Ag-Sn-Cu-rich alloy powder with a liquid Ga alloy containing Ga, In and Sn. Ga alloys are of increasing interest as an alternative to amalgam. The dental material studied in the present work was found to be a composite consisting of remaining, undissolved particles from the Ag-based alloy powder in a matrix of reaction products with the liquid Ga alloy. The phases in the matrix and the remaining Ag-based alloy particles have been identified by electron diffraction, high resolution electron microscopy and energy dispersive X-ray spectroscopy. the following phases were identified: orthorhombic Ag₃Sn, cubic -Cu₉Ga₄, cubic Ag₉In₄, tetragonal -Sn and hexagonal Ag₂Ga. In addition to these well-known phases Ga-rich regions of Cu-Ga were observed consisting of an intergrowth of the tetragonal CuGa₂ and one of the cubic -Cu₉Ga₄ phases.     

Liquidus temperatures for primary crystallization of cryolite in molten salt systems of interest for aluminum electrolysis

Temperatures for primary crystallization of Na₃AlF₆ in multicomponent electrolyte systems of interest for the aluminum electrolysis process were determined by thermal analysis. The results are presented as binary and quasibinary diagrams and discussed in view of the literature data. An empirical equation describing liquidus temperatures for primary crystallization of Na₃AlF₆ was derived: $$\begin{gathered} t/(^\circ C) = 1011 + 0.50[AlF_3 ] - 0.13[AIF_3 ] - \frac{{3.45[CaF_2 ]}}{{1 + 0.0173[CaF_2 ]}} \hfill \\ + 0.124[CaF_2 ] \cdot [AlF_3 ] - 0.00542([CaF_2 ] \cdot [AlF_3 ])^{1.5} \hfill \\ - \frac{{7.93[Al_2 O_3 ]}}{{1 + 0.0936[Al_2 O_3 ] - 0.0017[Al_2 O_3 ]^2 - 0.0023[AlF_3 ] \cdot [Al_2 O_3 ]}} \hfill \\ - \frac{{8.90[LiF]}}{{1 + 0.0047[LiF] + 0.0010[AlF3]^2 }} - 3.95[MgF_2 ] - 3.95 \hfill \\ \end{gathered} $$ wheret is the temperature in degree Celsius and the square brackets denote the weight percent of components in the system Na₃AlF₆-AlF₃-CaF₂-Al₂O₃-LiF-MgF₂-KF. The composition limitations are [AlF₃] ≈ [CaF₂] ≈ [LiF] < 20 wt pct, [MgF₂] ≈ [KF] < 5 wt pct, and [A1₂O₃] up to saturation.     

Specification and refinement of networks of asynchronously communicating agents using the assumption/commitment paradigm

This paper presents an assumption/commitment specification technique and a refinement calculus for networks of agents communicating asynchronously via unbounded FIFO channels in the tradition of Kahn.

We define two types of assumption/commitment specifications, namely simple and general specifications.

It is shown that semantically, any deterministic agent can be uniquely characterized by a simple specification, and any nondeterministic agent can be uniquely characterized by a general specification.

We define two sets of refinement rules, one for simple specifications and one for general specifications. The rules are Hoare-logic inspired. In particular the feedback rules employ invariants in the style of a traditional while-rule.

Both sets of rules have been proved to be sound and also (semantic) relative complete.

Conversion rules allow the two logics to be combined. This means that general specifications and the rules for general specifications have to be introduced only at the point in a system development where they are really needed.

     

Automated extraction of DNA from blood and PCR setup using a Tecan Freedom EVO liquid handler for forensic genetic STR typing of reference samples

We have implemented and validated automated protocols for DNA extraction and PCR setup using a Tecan Freedom EVO liquid handler mounted with the Te-MagS magnetic separation device (Tecan, M?nnedorf, Switzerland). The protocols were validated for accredited forensic genetic work according to ISO 17025 using the Qiagen MagAttract DNA Mini M48 kit (Qiagen GmbH, Hilden, Germany) from fresh whole blood and blood from deceased individuals. The workflow was simplified by returning the DNA extracts to the original tubes minimizing the risk of misplacing samples. The tubes that originally contained the samples were washed with MilliQ water before the return of the DNA extracts. The PCR was setup in 96-well microtiter plates. The methods were validated for the kits: AmpF?STR Identifiler, SGM Plus and Yfiler (Applied Biosystems, Foster City, CA), GenePrint FFFL and PowerPlex Y (Promega, Madison, WI). The automated protocols allowed for extraction and addition of PCR master mix of 96 samples within 3.5h. In conclusion, we demonstrated that (1) DNA extraction with magnetic beads and (2) PCR setup for accredited, forensic genetic short tandem repeat typing can be implemented on a simple automated liquid handler leading to the reduction of manual work, and increased quality and throughput.     

Affective speaker state analysis in the presence of reverberation

Little is known about the impact of reverberation on performance of running speaker state classification systems. This study thus aims to approach the topic by measuring effects on a state-of-the-art engine with consideration of six public room impulse responses for convolution of the affective speech signals of three standard datasets comprising of emotion and interest. Speech data thereby is given by this year’s INTERSPEECH Paralinguistic Challenge corpus TUM AVIC and the frequently used Berlin and eNTERFACE sets. The room impulse responses comprise rooms in private apartments, chapels, a factory hall, and a van. Speaker independent performance after speaker adaptation is investigated. To cope with reverberation, matched condition learning and acoustic space adaptation are considered as efficient means. By that a report is provided on suitability of feature types given the type of impulse response. In the result almost all occurring corruption arising from reverberation can be restored, yet the general impact varies with the type of room or acoustic environment.     

A resource-efficient event algebra

Events play many roles in computer systems, ranging from hardware interrupts, over event-based software architecture, to monitoring and managing of complex systems. In many applications, however, individual event occurrences are not the main point of concern, but rather the occurrences of certain event patterns. Such event patterns can be defined by means of an event algebra, i.e., expressions representing the patterns of interest are built from simple events and operators such as disjunction, sequence, etc.We propose a novel event algebra with intuitive operators (a claim which is supported by a number of algebraic properties). We also present an efficient detection algorithm that correctly detects any expression with bounded memory, which makes this algebra particularly suitable for resource-constrained applications such as embedded systems.     

Implementation of a Modelica compiler using JastAdd attribute grammars

We have implemented a compiler for key parts of Modelica, an object-oriented language supporting equation-based modeling and simulation of complex physical systems. The compiler is extensible, to support experiments with emerging tools for physical models. To achieve extensibility, the implementation is done declaratively in JastAdd, a metacompilation system supporting modern attribute grammar mechanisms such as reference attributes and nonterminal attributes.This paper reports on experiences from this implementation. For name and type analyses, we illustrate how declarative design strategies, originally developed for a Java compiler, could be reused to support Modelica’s advanced features of multiple inheritance and structural subtyping. Furthermore, we present new general design strategies for declarative generation of target ASTs from source ASTs. We illustrate how these strategies are used to resolve a generics-like feature of Modelica called modifications, and to support flattening, a fundamental part of Modelica compilation. To validate that the approach is practical, we have compared the execution speed of our compiler to two existing Modelica compilers.     

SPC: Fast and Efficient Scalable Predictive Coding of Animated Meshes

Animated meshes are often represented by a sequence of static meshes with constant connectivity. Due to their frame-based representation they usually occupy a vast amount of bandwidth or disk space. We present a fast and efficient scalable predictive coding (SPC) scheme for frame-based representations of animated meshes. SPC decomposes animated meshes in spatial and temporal layers which are efficiently encoded in one pass through the animation. Coding is performed in a streamable and scalable fashion. Dependencies between neighbouring spatial and temporal layers are predictively exploited using the already encoded spatio-temporal neighbourhood. Prediction is performed in the space of rotation-invariant coordinates compensating local rigid motion. SPC supports spatial and temporal scalability, and it enables efficient compression as well as fast encoding and decoding. Parts of SPC were adopted in the MPEG-4 FAMC standard. However, SPC significantly outperforms the streaming mode of FAMC with coding gains of over 33%, while in comparison to the scalable FAMC, SPC achieves coding gains of up to 15%. SPC has the additional advantage over FAMC of achieving real-time encoding and decoding rates while having only low memory requirements. Compared to some other non-scalable state-of-the-art approaches, SPC shows superior compression performance with gains of over 16% in bit-rate.     

Local ISS of large-scale interconnections and estimates for stability regions

We consider interconnections of locally input-to-state stable (LISS) systems. The class of LISS systems is quite large, in particular it contains input-to-state stable (ISS) and integral input-to-state stable (iISS) systems.Local small-gain conditions both for LISS trajectory and Lyapunov formulations guaranteeing LISS of the composite system are provided in this paper. Notably, estimates for the resulting stability region of the composite system are also given. This in particular provides an advantage over the linearization approach, as will be discussed.     

On notions of regularity for data languages

With motivation from considerations in XML database theory and model checking, data strings have been introduced as an extension of finite alphabet strings which carry, at each position, a symbol and a data value from an infinite domain. Previous work has shown that it is difficult to come up with an expressive yet decidable automaton model for data languages. Recently, such a model, data automata, was introduced. This paper introduces a simpler but equivalent model and investigates its expressive power, algorithmic and closure properties, and some extensions.