Interfacing remote transaction services using UPnP

Transaction execution in mobile environments needs to be flexible, not only to support typical mobile computing characteristics, like movement, disconnections and limited resources, but also to support the variety of transactional properties that might be required by different applications. Existing models for mobile transaction management solve different aspects of transaction execution, but are not flexible enough to solve all required aspects. Instead of designing a new transaction model, we propose a middleware (MobileTSe) which utilize existing transaction models to handle various requirements for mobile transaction execution. This paper presents an approach for flexible transaction processing in mobile applications, and describes how MobileTSe makes transaction services with different properties available on mobile units. We suggest a solution with transaction service discovery and control using UPnP.     

Solders development and application process for a micro chip-camera

Nowadays, micro components have to fulfill rising optical requirements for different scientific and industrial fields like astronomy, medicine or multimedia. For this purpose, advanced miniaturized chip-cameras are produced for the microsystems engineering market. The assembly and joining technologies play a very important role in the production of these micro components. Several challenges are associated with the joining of chip-cameras. In this study, the application of the soldering technology has been considered in order to face these challenges. Two joining technologies have been investigated: active soldering and transient liquid phase (TLP) bonding. Both soldering processes have shown a big potential for hybrid microsystems joining in previous studies. For both processes, soldering alloys and parameters have been conceived in order to fulfill the joining requirements of the micro camera components. For instance, the joining temperature represents a major challenge because the chip-camera consists of a plastic material, polymethyl methacrylate (PMMA). Therefore, particular attention has been directed to the soldering as well as to the coating temperature. The experimental investigations concerning the solders application through physical vapor deposition (PVD) have been supported by finite element method (FEM) simulations. The analysis of  the temperature distribution in the micro components during the coating process was the focus of  the calculations. Possible undesirable local overheated areas of the chip-camera components can be detected through simulation.

---

Future train traffic control: control by re-planning

Improving train traffic control can be a cost-efficient way to improve train traffic punctuality and increase utilization of existing and future railway infrastructure. However, performance in train traffic control tasks currently involves working on a technical level in order to regulate the traffic flow. Working in a preventive manner is poorly supported and train traffic controllers are usually restricted to just solving problems as they occur. This often results in unnecessarily long delays and decreased timeliness of train traffic. The main objective of this paper is to describe a proposed control strategy and a case study, which evaluates the control strategy and the prototype tool derived from the research. By shifting the control paradigm to a high-level control strategy, many of today’s problems may be avoided, with benefits of the reduction in delays, improved timeliness and better utilization of the infrastructure. Twenty-one train traffic controllers participated in a case study, with a simulated prototype environment. The majority of the participating train traffic controllers were positive to the new concepts and ideas. Many of the important aspects of the proposed control strategy can be investigated with the simulation, but due to the complexity of train traffic some issues must be evaluated in an operative environment.     

Predicting proteinase specificities from free energy calculations

The role of the primary binding residue (P1) in complexes between three different subtilases (subtilisin Carlsberg, thermitase and proteinase K) and their canonical protein inhibitor eglin c have been studied by free energy calculations. Based on the crystal structures of eglin c in complex with subtilisin Carlsberg and thermitase, and a homology model of the eglin c-proteinase K complex, a total of 57 mutants have been constructed and docked into their host proteins. The binding free energy was then calculated using molecular dynamics (MD) simulations combined with the linear interaction energy (LIE) method for all complexes differing only in the nature of the amino acid at the P1 position. LIE calculations for 19 different complexes for each subtilase were thus carried out excluding proline. The effects of substitutions at the P1 position on the binding free energies are found to be very large, and positively charged residues (Arg, Lys and His) are particularly deleterious for all three enzymes. The charged variants of the acidic side chains are found to bind more favorably as compared to their protonated states in all three subtilases. Furthermore, hydrophobic amino acids are accommodated most favorably at the S1-site in all three enzymes. Comparison of the three series of binding free energies shows only minor differences in the 19 computed relative binding free energies among these subtilases. This is further reflected in the correlation coefficient between the 23 relative binding free energies obtained, including the possible protonation states of ionizable side chains, but excluding the P1 Pro, for subtilisin Carlsberg versus thermitase (0.95), subtilisin versus proteinase K (0.94) and thermitase versus proteinase K (0.96).     

Industrial aspects and literature survey: Combined inventory management and routing

This paper describes industrial aspects of combined inventory management and routing in maritime and road-based transportation, and gives a classification and comprehensive literature review of the current state of the research.The literature is contrasted with aspects of industrial applications from a constructive, but critical, viewpoint. Based on the status and trends within the field, future research is suggested with regard to both further development of the research area and industrial needs. By highlighting the industrial aspects, practitioners will hopefully see the benefit of using advanced decision support systems in complex situations related to combined inventory management and routing in their business. In addition, a classification and presentation of the research should help and motivate researchers to further focus on inventory management and routing challenges.     

Path Planning for UAVs Under Communication Constraints Using SPLAT! and MILP

We will in this paper address the problem of offline path planning for Unmanned Aerial Vehicles (UAVs). Our goal is to find paths that meet mission objectives, are safe with respect to collision and grounding, fuel efficient and satisfy criteria for communication. Due to the many nonconvex constraints of the problem, Mixed Integer Linear Programming (MILP) will be used in finding the path. Approximate communication constraints and terrain avoidance constraints are used in the MILP formulation. To achieve more accurate prediction of the ability to communicate, the path is then analyzed in the radio propagation toolbox SPLAT!, and if the UAVs are not able to communicate according to design criteria for bandwidth, constraints are modified in the optimization problem in an iterative manner. The approach is exemplified with the following setup: The path of two UAVs are planned so they can serve as relay nodes between a target without line of sight to the base station.     

Breaking Symmetries and Constraints: Transitions from 2D to 3D in Passive Walkers

The inherent dynamics of bipedal, passive mechanisms are studiedto investigate the relation between motions constrained to two-dimensional (2D)planes and those free to move in a three-dimensional (3D) environment. Inparticular, we develop numerical and analytical techniques usingdynamical-systems methodology to address the persistence and stabilitychanges of periodic, gait-like motions due to the relaxation ofconfiguration constraints and the breaking of problem symmetries. Theresults indicate the limitations of a 2D analysis to predictthe dynamics in the 3D environment. For example, it is shownhow the loss of constraints may introduce characteristically non-2Dinstability mechanisms, and how small symmetry-breaking terms may result inthe termination of solution branches.     

Bayesian estimation of Dirichlet mixture model with variational inference

In statistical modeling, parameter estimation is an essential and challengeable task. Estimation of the parameters in the Dirichlet mixture model (DMM) is analytically intractable, due to the integral expressions of the gamma function and its corresponding derivatives. We introduce a Bayesian estimation strategy to estimate the posterior distribution of the parameters in DMM. By assuming the gamma distribution as the prior to each parameter, we approximate both the prior and the posterior distribution of the parameters with a product of several mutually independent gamma distributions. The extended factorized approximation method is applied to introduce a single lower-bound to the variational objective function and an analytically tractable estimation solution is derived. Moreover, there is only one function that is maximized during iterations and, therefore, the convergence of the proposed algorithm is theoretically guaranteed. With synthesized data, the proposed method shows the advantages over the EM-based method and the previously proposed Bayesian estimation method. With two important multimedia signal processing applications, the good performance of the proposed Bayesian estimation method is demonstrated.     

Graph Searching, Elimination Trees, and a Generalization of Bandwidth

The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layouts. We consider this extension from three main viewpoints: graph searching, tree decompositions, and elimination orderings. The three graph parameters pathwidth, profile, and bandwidth related to linear layouts can be defined by variants of graph searching using a standard fugitive. Switching to an inert fugitive, the two former parameters are extended to treewidth and fill-in, and our first viewpoint considers the analogous tree-like extension that arises from the bandwidth variant. Bandwidth also has a definition in terms of ordered path decompositions, and our second viewpoint extends this in a natural way to ordered tree decompositions. In showing that both extensions are equivalent we employ the third viewpoint of elimination trees, as used in the field of sparse matrix computations. We call the resulting parameter the treespan of a graph and prove some of its combinatorial and algorithmic properties.