Network management integrating SNMP/CMIP protocol implementations

In this paper, a new approach to integratingSNMP andCMIP protocols in a network management system is introduced. It is based on the use of proxy systems allowing to integrate SNMP network management agents in a general network management framework based onCMIP. The system architecture for marrying the protocols is first presented. Then the key features of a new protocol gateway implementing the proxy function are described, with emphasis on the explanation of theSNMP/CMIP mapping algorithm and the threshold/event reporting functions.     

Recovery of chromium from tannery effluents using a redox–adsorption approach

Adsorption isotherms for sodium and trivalent chromium uptake from aqueous solutions onto Amberlite resin were prepared at 18°C. Adsorption of each cation followed the Langmuir model. The rate of uptake of each cation was found to be film diffusion controlled with sodium showing the most rapid uptake. In aqueous solutions containing both chromium and sodium as the only cationic species, it was found that with increasing initial concentration of sodium, the trivalent chromium uptake on the resin decreased substantially. To overcome this difficulty a four step redox–adsorption system has been developed for the removal of Cr³⁺ from tannery effluents. The first step comprises the oxidation of trivalent chromium to the hexavalent form using selected common oxidising agents. The liquid effluent is then passed through an Amberlite cation-exchange resin in step 2 where the sodium in the waste stream is completely removed. The anionic hexavalent form of chromium (Cr₂O) passes unaltered through the resin along with the waste stream. In the third stage the dichromate is reduced back to the trivalent cationic form which is subsequently removed from the waste stream by a second Amberlite ion-exchange bed in stage 4. Each step in this process is assessed in batch and flow mode using simulated and real tannery effluents.     

Thermodynamic magnetization discontinuity between the A and B phases of superfluid3he

We present data for the magnitude of the thermodynamic magnetization discontinuity at the equilibrium A-B transition in superfluid³He, M_AB, over its entire pressure-temperature-magnetic field phase diagram. The data was taken by measuring flux changes in a SQUID pick-up coil, which was calibrated by a novel first-principles technique. We compare our results with those of NMR experiments, and find that the two types of measurements yield different values, and this discrepancy is not the result of thermometry or field errors.     

State of the Art of Molecular Visualization in Immersive Virtual Environments

Visualization plays a crucial role in molecular and structural biology. It has been successfully applied to a variety of tasks, including structural analysis and interactive drug design. While some of the challenges in this area can be overcome with more advanced visualization and interaction techniques, others are challenging primarily due to the limitations of the hardware devices used to interact with the visualized content. Consequently, visualization researchers are increasingly trying to take advantage of new technologies to facilitate the work of domain scientists. Some typical problems associated with classic 2D interfaces, such as regular desktop computers, are a lack of natural spatial understanding and interaction, and a limited field of view. These problems could be solved by immersive virtual environments and corresponding hardware, such as virtual reality head-mounted displays. Thus, researchers are investigating the potential of immersive virtual environments in the field of molecular visualization. There is already a body of work ranging from educational approaches to protein visualization to applications for collaborative drug design. This review focuses on molecular visualization in immersive virtual environments as a whole, aiming to cover this area comprehensively. We divide the existing papers into different groups based on their application areas, and types of tasks performed. Furthermore, we also include a list of available software tools. We conclude the report with a discussion of potential future research on molecular visualization in immersive environments.     

Building a speech recognition system with privacy identification information based on Google Voice for social robots

The Journal of Supercomputing - Currently, many smart speakers, even social robots, appear on the market to help people's lives become more convenient. Usually, people use smart speakers to...     

Controlled counter-flow motion of magnetic bead chains rolling along microchannels

We demonstrate controlled transport of superparamagnetic beads in the opposite direction of a laminar flow. A permanent magnet assembles 200 nm magnetic particles into about 200 μm long bead chains that are aligned in parallel to the magnetic field lines. Due to a magnetic field gradient, the bead chains are attracted towards the wall of a microfluidic channel. A rotation of the permanent magnet results in a rotation of the bead chains in the opposite direction to the magnet. Due to friction on the surface, the bead chains roll along the channel wall, even in counter-flow direction, up to at a maximum counter-flow velocity of 8 mm s⁻¹. Based on this approach, magnetic beads can be accurately manoeuvred within microfluidic channels. This counter-flow motion can be efficiently be used in Lab-on-a-Chip systems, e.g. for implementing washing steps in DNA purification.     

Cost optimization of a hybrid composite flywheel rotor with a split-type hub using combined analytical/numerical models

A procedure to find the optimal design of a flywheel with a split-type hub is presented. Since cost plays a decisive role in stationary flywheel energy storage applications, a trade-off between energy and cost is required. Applying a scaling technique, the multi-objective design problem is reduced to the maximization of the energy-per-cost ratio as the single objective. Both an analytical and a finite element model were studied. The latter was found to be more than three orders of magnitude more computationally expensive than the analytical model, while the analytical model can only be regarded as a coarse approximation. Multifidelity approaches were examined to reduce the computational expense while retaining the high accuracy and large modeling depth of the finite element model. Using a surrogate-based optimization strategy, the computational cost was reduced to only one third in comparison to using only the finite element model. A nonlinear interior-point method was employed to find the optimal rim thicknesses and rotational speed. The benefits of the split-type hub architecture were demonstrated.     

The smart car seat: personalized monitoring of vital signs in automotive applications

Embedded wireless sensors are important components of mobile distributed computing networks, and one of the target applications areas is health care. The preservation of mobility for senior citizens is one of the key issues in maintaining an independent lifestyle. Thus health technologies inside a car can contribute both to safety issues (supervision of driver fitness) as well as healthcare issues by monitoring vitals signs imperceptibly. In this paper, three embedded measurement techniques for non-contact monitoring of vital signals have been investigated. Specifically, capacitive electrocardiogram (cECG) monitoring, mechanical movement analysis (ballistocardiogram, BCG) using piezo-foils and inductive impedance monitoring were examined regarding their potential for integration into car seats. All three sensing techniques omit the need for electroconductive contact to the human body, but require defined mechanical boundary conditions (stable distances or, in the case of BCG, frictional connection). The physical principles of operation, the specific boundary conditions regarding automotive integration and the results during wireless operation in a running car are presented. All three sensors were equipped with local intelligence by incorporating a microcontroller. To eliminate the need for additional cabling, a wireless Bluetooth communication module was added and used to transmit data to a measurement PC. Finally, preliminary results obtained during test drives on German city roads and highways are discussed.     

Multi-GPU accelerated multi-spin Monte Carlo simulations of the 2D Ising model

A Modern Graphics Processing unit (GPU) is able to perform massively parallel scientific computations at low cost. We extend our implementation of the checkerboard algorithm for the two-dimensional Ising model [T. Preis et al., Journal of Chemical Physics 228 (2009) 4468-4477] in order to overcome the memory limitations of a single GPU which enables us to simulate significantly larger systems. Using multi-spin coding techniques, we are able to accelerate simulations on a single GPU by factors up to 35 compared to an optimized single Central Processor Unit (CPU) core implementation which employs multi-spin coding. By combining the Compute Unified Device Architecture (CUDA) with the Message Parsing Interface (MPI) on the CPU level, a single Ising lattice can be updated by a cluster of GPUs in parallel. For large systems, the computation time scales nearly linearly with the number of GPUs used. As proof of concept we reproduce the critical temperature of the 2D Ising model using finite size scaling techniques.     

Learning state machine-based string edit kernels

During the past few years, several works have been done to derive string kernels from probability distributions. For instance, the Fisher kernel uses a generative model M (e.g. a hidden Markov model) and compares two strings according to how they are generated by M. On the other hand, the marginalized kernels allow the computation of the joint similarity between two instances by summing conditional probabilities. In this paper, we adapt this approach to edit distance-based conditional distributions and we present a way to learn a new string edit kernel. We show that the practical computation of such a kernel between two strings x and x^′ built from an alphabet Σ requires (i) to learn edit probabilities in the form of the parameters of a stochastic state machine and (ii) to calculate an infinite sum over Σ^* by resorting to the intersection of probabilistic automata as done for rational kernels. We show on a handwritten character recognition task that our new kernel outperforms not only the state of the art string kernels and string edit kernels but also the standard edit distance used by a neighborhood-based classifier.