A Unified Model for the Mixing of Non‐Newtonian Fluids in the Laminar,Transition, and Turbulent Region

Summary: Non‐Newtonian fluid behavior has significant influence on quantities in chemical engineering like power input, mixing time, heat transfer etc. In the laminar flow region, the concept of effective viscosity by Metzner and Otto is well established. In the transition region between laminar and turbulent flow, the existing concepts use three and even more empirical parameters to determine the specific power input. Here, a unified and general but simple approach is introduced to calculate the power input for shear thinning fluids over the whole flow region using just one empirical parameter. The Metzner‐Otto relation is obtained as a limiting case for the laminar region. The empirical parameter of the new approach is related to the Metzner‐Otto constant. The concept is validated for eight different stirrer systems. Mixing time and maximum shear rate and heat transfer can also be calculated using this approach. The new concept presented should also be applicable for other apparatuses, e.g., static mixers.

Comparison of experimental data and a curve calculated according to the new method (solid line).     

Correct pretreatment-the first step to quality in modern textile processing

Cotton continues to be a very widely used natural fibre. However, it becomes ever more difficult to define it exactly in chemical terms, because the variety and quantity of non-cellulosic constituents in the raw cotton are continually increasing in number and becoming more difficult to specify. The textile processor can only count on 75%, or at best 80%, being genuine cellulosic material; the remainder consists mainly of impurities that can seriously interfere with subsequent processes. Modem pretreatment processes take full account of the specific quality requirements, and naturally also the relevant cost factors (energy, effluent, processing costs). By these means the bleacher can now convert raw cotton into a chemically uniform and defined cellulosic textile substrate for the subsequent processes. In this form, either alone or in blends with synthetic fibres, it is accessible for dyeing, printing and finishing processes that can be readily controlled and reproduced.     

Are hormones from the neuropeptide Y family recognized by their receptors from the membrane-bound state?

Hormones and many other neurotransmitters, growth factors, odorant molecules, and light all present stimuli for a class of membrane-anchored receptors called G protein-coupled receptors (GPCRs). The GPCRs are the largest family of cell-surface receptors involved in signal transduction. About 1% of all known genes of Drosophila and more than 5% of the genes of Caenorhabditis elegans encode GPCRs. In addition, more than 50% of current therapeutic agents on the market target these receptors. When the enormous biological and pharmaceutical importance of these receptors is considered, it is surprising how little is known about the mechanism with which these receptors recognize their natural ligands. In this review we present a structural approach, utilizing techniques of high-resolution NMR spectroscopy, to address the question of whether peptides from the neuropeptide Y family of neurohormones are recognized directly from solution or from the membrane-bound state. In our studies we discovered that the structures of the membrane-bound species are better correlated to the pharmacological properties of these peptides than the solution structures are. These findings are supported by the observation that many biophysical properties of these peptides seem to be optimized for membrane binding. We finally present a scenario of possible events during receptor recognition.     

民主德国的堆焊工艺及其现代化设备

本文介绍了民主德国关于堆焊工艺的一些最新研究成果以及为提高焊接自动化程度对设备的研究和发展。哈雷中央焊接研究所研制的堆焊-裁荷-填充材料-工艺系统(“A—B—Z—V”),作为选择工艺及填充材料的依据,从构件分析出发,生产了用于旋转件的特种程序的机器人ZIS12—63.孔堆焊设备ZIS12—96,轨道堆焊机ZIS13—43,轻便堆焊机ZIS15—40.以及用于侧板堆焊的机器人和煤球模型堆焊机器人。     

Prediction-based methods for teleoperation across delayed networks

The remote nature of telepresence scenarios can be seen as a strongpoint and also as a weakness. Although it enables the remote control of robots in dangerous or inaccessible environments, it necessarily involves some kind of communication mechanism for the transmission of control signals. This communication mechanism necessarily involves adverse network effects such as delay. Three mechanisms aimed at improving the effects of network delay are presented in this paper: (1) Motion prediction to partially compensate for network delays, (2) force prediction to learn a local force model, thereby reducing dependency on delayed force signals, and (3) haptic data compression to reduce the required bandwidth of high frequency data. The utilized motion prediction scheme was shown to improve operator performance, but had no influence on operator immersion. The force prediction provided haptic feedback through synchronous forces from the local model, thereby stabilizing the control loop. The developed haptic data compression scheme reduced the number of packets sent across the network by 90%, while improving the quality of the haptic feedback.     

Parallel algorithms for image enhancement and segmentation by region growing, with an experimental study

This paper presents efficient and portable implementations of a powerful image enhancement process, the Symmetric Neighborhood Filter (SNF), and an image segmentation technique that makes use of the SNF and a variant of the conventional connected components algorithm which we call -Connected Components. We use efficient techniques for distributing and coalescing data as well as efficient combinations of task and data parallelism. The image segmentation algorithm makes use of an efficient connected components algorithm based on a novel approach for parallel merging. The algorithms have been coded in Split-C and run on a variety of platforms, including the Thinking Machines CM-5, IBM SP-1 and SP-2, Cray Research T3D, Meiko Scientific CS-2, Intel Paragon, and workstation clusters. Our experimental results are consistent with the theoretical analysis (and provide the best known execution times for segmentation, even when compared with machine-specific implementations). Our test data include difficult images from the Landsat Thematic Mapper (TM) satellite data.Also affiliated with the Department of Electrical Engineering.Also affiliated with the Department of Computer Science and the Center for Automation Research.     

Formal testing for separation assurance

In order to address the rapidly increasing load of air traffic operations, innovative algorithms and software systems must be developed for the next generation air traffic control. Extensive verification of such novel algorithms is key for their adoption by industry. Separation assurance algorithms aim at predicting if two aircraft will get closer to each other than a minimum safe distance; if loss of separation is predicted, they also propose a change of course for the aircraft to resolve this potential conflict. In this paper, we report on our work towards developing an advanced testing framework for separation assurance. Our framework supports automated test case generation and testing, and defines test oracles that capture algorithm requirements. We discuss three different approaches to test-case generation, their application to a separation assurance prototype, and their respective strengths and weaknesses. We also present an approach for statistical analysis of the large numbers of test results obtained from our framework.     

Congestion prevention in broadband wireless access systems: An economic approach

While the demand for mobile broadband wireless services continues to increase, radio resources remain scarce. Even with the substantial increase in the supported bandwidth in the next generation broadband wireless access systems (BWASs), it is expected that these systems will severely suffer from congestion, due to the rapid increase in demand of bandwidth-intensive multimedia services. Without efficient bandwidth management and congestion control schemes, network operators may not be able to meet the increasing demand of users for multimedia services, and hence they may suffer an immense revenue loss. In this paper, we propose an admission-level bandwidth management scheme consisting of call admission control (CAC) and dynamic pricing. The main aim of our proposed scheme is to provide monetary incentives to users to use the wireless resources efficiently and rationally, hence, allowing efficient bandwidth management at the admission level. By dynamically determining the prices of units of bandwidth, the proposed scheme can guarantee that the number of connection requests to the system are less than or equal to certain optimal values computed dynamically, hence, ensuring a congestion-free system. The proposed scheme is general and can accommodate different objective functions for the admission control as well as different pricing functions. Comprehensive simulation results with accurate and inaccurate demand modeling are provided to show the effectiveness and strengths of our proposed approach.     

The transposition median problem is NP-complete

During recent years, the genomes of more and more species have been sequenced, providing data for phylogenetic reconstruction based on genome rearrangement measures, where the most important distance measures are the reversal distance and the transposition distance. The two main tasks in all phylogenetic reconstruction algorithms are to calculate pairwise distances and to solve the median of three problem. While the reversal distance problem can be solved in linear time, the reversal median problem has been proven to be NP-complete. The status of the transposition distance problem is still open, but it is conjectured to be more difficult than the reversal problem. This, in turn, also suggests that the transposition median problem is NP-complete. However, this conjecture could not yet be proven. We have now succeeded in giving a non-trivial proof for the NP-completeness of the transposition median problem.