Numerical simulation of non-linear chatter vibration in turning

In this paper, basic relationships and algorithms for numerical simulation of non-linear, self-excited vibrations in single degree-of-freedom cutting systems are presented. Non-linearities due to the tool leaving the cut, as well as interference between the cutting tool clearance face and cutting surface waviness, were taken into consideration. Examples of vibration simulation results are shown.     

Evolutionary algorithm with a directional local search for multiobjective optimization in combinatorial problems

Evolutionary algorithms (EAs) are often employed to multiobjective optimization, because they process an entire population of solutions which can be used as an approximation of the Pareto front of the tackled problem. It is a common practice to couple local search with evolutionary algorithms, especially in the context of combinatorial optimization. In this paper a new local search method is proposed that utilizes the knowledge concerning promising search directions. The proposed method can be used as a general framework and combined with many methods of iterating over a neighbourhood of an initial solution as well as various decomposition approaches. In the experiments the proposed local search method was used with an EA and tested on 2-, 3- and 4-objective versions of two well-known combinatorial optimization problems: the travelling salesman problem (TSP) and the quadratic assignment problem (QAP). For comparison two well-known local search methods, one based on Pareto dominance and the other based on decomposition, were used with the same EA. The results show that the EA coupled with the directional local search yields better results than the same EA coupled with any of the two reference methods on both the TSP and QAP problems.     

Comparison of virtual path bandwidth assignment and routing methods

The virtual path (VP) can simplifyAtm network management by minimizing connection routing and admission costs, and by facilitating the layered control of resources. However, fully exploiting these advantages may lead to a large number of relatively low capacity virtual paths travelling on each physical link. If each VP is treated as a separate unit, as is commonly assumed, low path capacities will lead to low network utilisation. This paper carefully examines the trade-off between simplification through traffic separation and improved efficiency due to traffic consolidation. We review existing vp bandwidth assignment and control techniques, and propose a new vp tagging control method. A comparison shows that by permitting resource sharing between paths it is possible to influence significantly the trade-off between simplified network management and multiplexing gain from traffic consolidation.     

Carbon nano-onion composites: Physicochemical characteristics and biological activity

Carbon nano-onion/surfactant (CNO/surfactant) composites offer the possibility to easily produce the soluble nanostructures. That approach combines the hydrophilicity of surfactants with the robustness of carbon structures to produce composites with superior and unusual physicochemical properties. We used the following surfactants: hexadecyltrimethylammonium bromide (CTAB), sodium dodecyl sulfate (SDS), sodium dodecyl benzene sulfonate (SDBS), 4-(1,1,3,3-tetramethylbutyl)phenyl-polyethylene glycol (Triton X-100), and polyethylene glycol sorbitan monolaurate (Tween 20) to non-covalently modify CNO surfaces. The existence of stable CNO composites are clearly evidenced by direct transmission electron microscopy observations, which are also supported by thermogravimetric analyses. Dynamic light scattering and zeta potential confirmed their dispersion and stability. Additionally, the biological activity of well-dispersed CNO/surfactant composites against a strain of Escherichia coli was assayed. In vitro antimicrobial assays for the composites revealed that only the CNO/CTAB composite decreased cell viability. This activity could be assigned to the simple composite dissociation in water solutions, however antimicrobial properties of the composite are slightly better when compared with pure CTAB. This indicate some synergic effect with respect to the properties of the pure surfactant.     

Evaluation of artery visualizations for heart disease diagnosis

Heart disease is the number one killer in the United States, and finding indicators of the disease at an early stage is critical for treatment and prevention. In this paper we evaluate visualization techniques that enable the diagnosis of coronary artery disease. A key physical quantity of medical interest is endothelial shear stress (ESS). Low ESS has been associated with sites of lesion formation and rapid progression of disease in the coronary arteries. Having effective visualizations of a patient's ESS data is vital for the quick and thorough non-invasive evaluation by a cardiologist. We present a task taxonomy for hemodynamics based on a formative user study with domain experts. Based on the results of this study we developed HemoVis, an interactive visualization application for heart disease diagnosis that uses a novel 2D tree diagram representation of coronary artery trees. We present the results of a formal quantitative user study with domain experts that evaluates the effect of 2D versus 3D artery representations and of color maps on identifying regions of low ESS. We show statistically significant results demonstrating that our 2D visualizations are more accurate and efficient than 3D representations, and that a perceptually appropriate color map leads to fewer diagnostic mistakes than a rainbow color map.     

Multi-objective optimization of multicast overlays for collaborative applications

Current real-time collaborative application implementations use dedicated infrastructure to carry out all communication and synchronization activities. Specifically, they require all end nodes to communicate directly with and through the central server. In this paper, we investigate scenarios in which the most resource intensive functionality of continuous communication among collaborators to disseminate changes is decentralized, utilizing the end users themselves as relays. We observe that communication characteristics of real-time collaboration makes use of existing multicast mechanisms unsuitable. As collaborative editing sessions are typically long and repeated, it is possible to gather and leverage node behavior (their instabilities and frequency of sending updates) and communication links (latencies and average costs). Several criteria to determine the quality of a multicast tree can be identified: cost, latency and instability. In this paper, we analyze the complexity of the problem of finding optimal communication topologies, and propose approximate algorithms to optimize the same. We also consider the multiobjective problem in which we search for a topology that provides good trade-off between these sometimes conflicting measures. Validation of our proposed algorithms on numerous graphs shows that it is important to consider the multiobjective problem, as optimal solutions for one performance measure can be far from optimal for the other metrics. Finally, we briefly present an implementation of a communication library that uses the proposed algorithms to periodically adjust the dissemination tree.     

Protected subspaces in quantum information

In certain situations the state of a quantum system, after transmission through a quantum channel, can be perfectly restored. This can be done by “coding” the state space of the system before transmission into a “protected” part of a larger state space, and by applying a proper “decoding” map afterwards. By a version of the Heisenberg Principle, which we prove, such a protected space must be “dark” in the sense that no information leaks out during the transmission. We explain the role of the Knill–Laflamme condition in relation to protection and darkness, and we analyze several degrees of protection, whether related to error correction, or to state restauration after a measurement. Recent results on higher rank numerical ranges of operators are used to construct examples. In particular, dark spaces are constructed for any map of rank 2, for a biased permutations channel and for certain separable maps acting on multipartite systems. Furthermore, error correction subspaces are provided for a class of tri-unitary noise models.     

On the generalized Hyers-Ulam stability of multi-quadratic mappings

A mapping f:Vⁿ?W, where V is a commutative group, W is a linear space, and n≥2 is an integer, is called multi-quadratic if it is quadratic in each variable. In this paper, we prove the generalized Hyers-Ulam stability of multi-quadratic mappings in Banach spaces and complete non-Archimedean spaces.     

The effect of isopropyl alcohol concentration on the etching process of Si-substrates in KOH solutions

In this paper the process of silicon anisotropic etching in KOH solutions containing isopropyl alcohol in a wide concentration range is extensively studied. Though the alcohol does not take part in the etching process itself, it strongly affects the etching results. Both etch rates and the roughness of etched surfaces depend on the alcohol concentration in the etching solution, which is connected with the adsorption phenomena on the etched surface. The surface coverage with alcohol depends on the level of saturation of the etching solution and crystallographic orientation of an etched surface. It was observed that the best morphology of (1 1 0) surface was achieved just below saturation level with IPA whereas the (1 0 0) surfaces were improving above the saturation. A model, which explains these phenomena, was proposed. Based on this model, a simple way of selection of the composition of KOH solutions with alcohol additives, assuring optimization of etching results was suggested. The method is restricted to surface tension measurements and allows one to avoid elaborated etching experiments.