Scan-based volume animation driven by locally adaptive articulated registrations

This paper describes a complete system to create anatomically accurate example-based volume deformation and animation of articulated body regions, starting from multiple in vivo volume scans of a specific individual. In order to solve the correspondence problem across volume scans, a template volume is registered to each sample. The wide range of pose variations is first approximated by volume blend deformation (VBD), providing proper initialization of the articulated subject in different poses. A novel registration method is presented to efficiently reduce the computation cost while avoiding strong local minima inherent in complex articulated body volume registration. The algorithm highly constrains the degrees of freedom and search space involved in the nonlinear optimization, using hierarchical volume structures and locally constrained deformation based on the biharmonic clamped spline. Our registration step establishes a correspondence across scans, allowing a data-driven deformation approach in the volume domain. The results provide an occlusion-free person-specific 3D human body model, asymptotically accurate inner tissue deformations, and realistic volume animation of articulated movements driven by standard joint control estimated from the actual skeleton. Our approach also addresses the practical issues arising in using scans from living subjects. The robustness of our algorithms is tested by their applications on the hand, probably the most complex articulated region in the body, and the knee, a frequent subject area for medical imaging due to injuries.     

Modelling and analysis of the dynamics of a tilting three-wheeled vehicle

To understand the handling behaviour of a three-wheeled tilting vehicle, models of the vehicle with different level of detail, corresponding to specific fields of investigation, have been developed. Then the proposed kinematics of the three-wheeler are assessed and optimized with respect to desired dynamic properties by applying a detailed multibody system model. The partially unstable nature of the motion of the vehicle suggests the application of an analytically derived, simplified model, to allow for focusing on stability aspects and steady-state handling properties. These investigations reveal the necessity of employing a steer-by-wire control system to support the driver by stabilizing the motion of the vehicle. Thus, an additional basic vehicle model is derived for control design, and an energy-efficient control strategy is presented. Numerical simulation results demonstrate the dynamic properties of the optimized kinematics and the control system, approved by successful test runs of a prototype.     

On generic context lemmas for higher-order calculi with sharing

This paper proves several generic variants of context lemmas and thus contributes to improving the tools for observational semantics of deterministic and non-deterministic higher-order calculi that use a small-step reduction semantics. The generic (sharing) context lemmas are provided for may- as well as two variants of must-convergence, which hold in a broad class of extended process- and extended lambda calculi, if the calculi satisfy certain natural conditions. As a guide-line, the proofs of the context lemmas are valid in call-by-need calculi, in call-by-value calculi if substitution is restricted to variable-by-variable and in process calculi like variants of the $\pi$-calculus. For calculi employing beta-reduction using a call-by-name or call-by-value strategy or similar reduction rules, some iu-variants of ciu-theorems are obtained from our context lemmas. Our results reestablish several context lemmas already proved in the literature, and also provide some new context lemmas as well as some new variants of the ciu-theorem. To make the results widely applicable, we use a higher-order abstract syntax that allows untyped calculi as well as certain simple typing schemes. The approach may lead to a unifying view of higher-order calculi, reduction, and observational equality.     

The Kemeny Constant for Finite Homogeneous Ergodic Markov Chains

A quantity known as the Kemeny constant, which is used to measure the expected number of links that a surfer on the World Wide Web, located on a random web page, needs to follow before reaching his/her desired location, coincides with the more well known notion of the expected time to mixing, i.e., to reaching stationarity of an ergodic Markov chain. In this paper we present a new formula for the Kemeny constant and we develop several perturbation results for the constant, including conditions under which it is a convex function. Finally, for chains whose transition matrix has a certain directed graph structure we show that the Kemeny constant is dependent only on the common length of the cycles and the total number of vertices and not on the specific transition probabilities of the chain.     

Automated bidding in computational markets: an application in market-based allocation of computing services

Autonomous agents are widely applied to automate interactions in robotics, e.g. for selling and purchasing goods on eBay, and in financial markets, e.g. in the form of quote machines and algorithmic traders. Current research investigates efficient economic mechanisms that fully automate the provisioning and usage processes of Grid-based services. On the one hand, consumers want to allocate resources on demand for their various applications, e.g. data sharing, stream processing, email, business applications and simulations. On the other hand, providers of Grid services want to govern business policies to meet their utilization and profit goals. The above-mentioned processes are not manually manageable, however, because decisions need to be taken within milliseconds. Therefore, such processes have to be automated to minimize human interactions. Hence, market mechanisms and strategic behavior play important roles when it comes to achieving automated and efficient allocation of Grid services. The paper begins by presenting a framework for automated bidding, providing a methodology for the design and implementation of configurable bidding strategies. Second, it presents a novel bidding strategy based on a reinforcement learning technique. This strategy is designed to automate the bid generation processes of consumers and providers in various market mechanisms. Third, the behavior and convergence of the strategy is evaluated in a centralized Continuous Double Auction and a decentralized on-line machine scheduling mechanism against selected benchmark bidding strategies. Fourth, we define a bidding language for communicating consumer and provider preferences to the market as well as report back the match of the market-based allocation process.     

The use of ‘exploratory learning’ for supporting immersive learning in virtual environments

User interfaces are becoming more intuitive following the requirements of the individual learner and reinforcing the drive towards more personalised learning and greater learner autonomy. There are clearly a new set of challenges emerging for teaching practitioners that will have implications upon not just what is learned but importantly upon lesson planning. This paper explores these changes to teaching through a consideration of an exploratory learning model which allows practitioners to rethink how they teach in 3D and immersive spaces where learning sequences and experiences are choreographed to support peer interactions and exchanges. The ELM extends from Kolb’s experiential learning model to adapt the use of 3D applications, and provides examples from research and development projects to exemplify how the model works in practice. Teaching in these contexts provides less emphasis upon curriculum and more emphasis upon sequencing learning experiences, meta-reflection, peer assessment and group work.     

Distributed top-<Emphasis Type="Italic">k</Emphasis> aggregation queries at large

Top-k query processing is a fundamental building block for efficient ranking in a large number of applications. Efficiency is a central issue, especially for distributed settings, when the data is spread across different nodes in a network. This paper introduces novel optimization methods for top-k aggregation queries in such distributed environments. The optimizations can be applied to all algorithms that fall into the frameworks of the prior TPUT and KLEE methods. The optimizations address three degrees of freedom: 1) hierarchically grouping input lists into top-k operator trees and optimizing the tree structure, 2) computing data-adaptive scan depths for different input sources, and 3) data-adaptive sampling of a small subset of input sources in scenarios with hundreds or thousands of query-relevant network nodes. All optimizations are based on a statistical cost model that utilizes local synopses, e.g., in the form of histograms, efficiently computed convolutions, and estimators based on order statistics. The paper presents comprehensive experiments, with three different real-life datasets and using the ns-2 network simulator for a packet-level simulation of a large Internet-style network.     

The effect of the microfluidic diodicity on the efficiency of valve-less rectification micropumps using Lattice Boltzmann Method

The efficiency of the valve-less rectification micropump depends primarily on the microfluidic diodicity (the ratio of the backward pressure drop to the forward pressure drop). In this study, different rectifying structures, including the conventional structures (nozzle/diffuser and Tesla structures), were investigated at very low Reynolds numbers (between 0.2 and 60). The rectifying structures were characterized with respect to their design, and a numerical approach was illustrated to calculate the diodicity for the rectifying structures. In this study, the microfluidic diodicity was evaluated numerically for different rectifying structures including half circle, semicircle, heart, triangle, bifurcation, nozzle/diffuser, and Tesla structures. The Lattice Boltzmann Method (LBM) was utilized as a numerical method to simulate the fluid flow in the microscale. The results suggest that at very low Reynolds number flow, rectification and multifunction micropumping may be achievable by using a number of the presented structures. The results for the conventional structures agree with the reported results.     

Multivariable control strategy based on bifurcation analysis of an industrial gas-phase polymerization reactor

In an industrial gas-phase polyethylene reactor, the safe operating range of temperature is rather narrow. Even within this temperature range, temperature excursions must be avoided because they can result in low catalyst productivity and significant changes in product properties. If the manipulated variable for temperature control saturates (i.e., the cooling water valve position is completely open), then the reactor operates without a feedback temperature controller, leading to oscillatory behavior and limit cycles. In this work, it has been demonstrated that the saturation in the manipulated variable and the complex non-linear dynamic behavior are removed when auxiliary manipulated variables, obtained by bifurcation analysis, are used in a multivariable control strategy for the reactor temperature control. Two control structures are proposed and compared considering their impact in the reactor production and polymer melt index. In the first control structure, the designed PID controller for the reactor temperature is considered and a switching strategy with a PI controller for the auxiliary manipulated variables is included. In the second control structure, the designed PID controller for the reactor temperature is also used, however, a MPC controller for the auxiliary manipulated variables is considered. The results suggest that the use of gain-scheduling strategy in the PID temperature controller with a MPC controller for the auxiliary manipulated variables avoids the saturation of the manipulated variable and, hence, the undesired non-linear dynamic behavior, reducing the production loss and improving the product quality.