Healing Effect of Controlled Anti‐Electromigration on Conventional and High‐Tc Superconducting Nanowires

The electromigration process has the potential capability to move atoms one by one when properly controlled. It is therefore an appealing tool to tune the cross section of monoatomic compounds with ultimate resolution or, in the case of polyatomic compounds, to change the stoichiometry with the same atomic precision. As demonstrated here, a combination of electromigration and anti‐electromigration can be used to reversibly displace atoms with a high degree of control. This enables a fine adjustment of the superconducting properties of Al weak links, whereas in Nb the diffusion of atoms leads to a more irreversible process. In a superconductor with a complex unit cell (La_2?x Ce_x CuO₄), the electromigration process acts selectively on the oxygen atoms with no apparent modification of the structure. This allows to adjust the doping of this compound and switch from a superconducting to an insulating state in a nearly reversible fashion. In addition, the conditions needed to replace feedback controlled electromigration by a simpler technique of electropulsing are discussed. These findings have a direct practical application as a method to explore the dependence of the characteristic parameters on the exact oxygen content and pave the way for a reversible control of local properties of nanowires.     

Selective toxicity of hydroxyl-rich carbon nanodots for cancer research

Nano Research - The toxicity of nanoparticles in a biological system is an integration of effects arising from surface functionality, particle size, ionic dissolution, etc. This complexity suggests...     

Direct Visible Surface Interpolation

The computation of visible surfaces is usually formulated in a regularization framework based on thin-plate and membrane splines. When discretized, this formulation leads to large sparse linear systems. Most surface interpolation methods solve these sparse systems with iterative methods. Here we explore the use of direct methods. Through a careful analysis of the regularization operator, we derive direct methods that efficiently make use of all zeros in the sparse discretization of the operator. Experimental results show that, compared with iterative interpolation methods, the direct methods we present are competitive in general, and they provide significant speed-ups for problems involving discontinuities. In addition to their use in visible-surface interpolation, the presented methods also support very efficient time integration for deformable surfaces.     

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.     

Integratable non-clogging microconcentrator based on counter-flow principle for continuous enrichment of CaSki cells sample

This study addresses the need to reduce the risk of clogging when preparing samples for cell concentration, i.e., the CaSki Cell-lines (epidermoid cervical carcinoma cells). Aiming to develop a non-clogging microconcentrator, we proposed a new counter-flow concentration unit characterized by the directions of penetrating flows being at an obtuse angle to the main flow, due to employment of streamlined turbine blade-like micropillars. Based on the optimization results of the counter-flow unit profile, a fractal arrangement for the counter-flow concentration unit was developed. A counter-flow microconcentrator chip was then designed and fabricated, with both the processing layer and collecting layer arranged in terms of the honeycomb structure. Visualized experiments using CaSki cell samples on the microconcentrator chip demonstrated that no cell-clogging phenomena occurred during the test and that no cells were found in the final filtrate. The test results show an excellent concentration performance for the microconcentrator chip, while a concentrating ratio of >4 with the flow rate being below 1.0 ml/min. As only geometrical structure is employed in the passive device, the counter-flow microconcentrator can be easily integrated into advanced microfluidic systems. Owing to the merit of non-clogging and continuous processing ability, the counter-flow microconcentrator is not only suitable for the sample preparation within biomedical field, but also applicable in water-particle separation.     

Surrogate modeling approximation using a mixture of experts based on EM joint estimation

An automatic method to combine several local surrogate models is presented. This method is intended to build accurate and smooth approximation of discontinuous functions that are to be used in structural optimization problems. It strongly relies on the Expectation−Maximization (EM) algorithm for Gaussian mixture models (GMM). To the end of regression, the inputs are clustered together with their output values by means of parameter estimation of the joint distribution. A local expert is then built (linear, quadratic, artificial neural network, moving least squares) on each cluster. Lastly, the local experts are combined using the Gaussian mixture model parameters found by the EM algorithm to obtain a global model. This method is tested over both mathematical test cases and an engineering optimization problem from aeronautics and is found to improve the accuracy of the approximation.     

Development of a framework for truss-braced wing conceptual MDO

The paper describes the development of a multidisciplinary design optimization framework for conceptual design of truss-braced wing configurations. This unconventional configuration requires specialized analysis tools supported by a modular and flexible framework to accommodate different configurations. While the previous framework developed at Virginia Tech was a monolithic Fortran-77 code, the need for more flexibility for complex truss-braced wing configurations was addressed by the development of this new framework, which is based on Phoenix Integration ModelCenter^TM environment. The framework uses updated structural and aerodynamic design modules that enable a more general geometry definition. The new framework, thus, provides a foundation for future design concepts, especially multi-member truss-braced wing configurations. The fuel saving potential of these truss-braced wing configurations is presented by comparing different truss designs with gradually increased level of complexity.     

Scheduling jobs with equal processing times subject to machine eligibility constraints

We consider the problem of nonpreemptively scheduling a set of n jobs with equal processing times on m parallel machines so as to minimize the makespan. Each job has a prespecified set of machines on which it can be processed, called its eligible set. We consider the most general case of machine eligibility constraints as well as special cases of nested and inclusive eligible sets. Both online and offline models are considered. For offline problems we develop optimal algorithms that run in polynomial time, while for online problems we focus on the development of optimal algorithms of a new and more elaborate structure as well as approximation algorithms with good competitive ratios.