Nanoparticle agglomeration in an evaporating levitated droplet for different acoustic amplitudes

Radiatively heated levitated functional droplets with nanosilica suspensions exhibit three distinct stages namely pure evaporation, agglomeration, and finally structure formation. The temporal history of the droplet surface temperature shows two inflection points. One inflection point corresponds to a local maximum and demarcates the end of transient heating of the droplet and domination of vaporization. The second inflection point is a local minimum and indicates slowing down of the evaporation rate due to surface accumulation of nanoparticles. Morphology and final precipitation structures of levitated droplets are due to competing mechanisms of particle agglomeration, evaporation, and shape deformation. In this work, we provide a detailed analysis for each process and propose two important timescales for evaporation and agglomeration that determine the final diameter of the structure formed. It is seen that both agglomeration and evaporation timescales are similar functions of acoustic amplitude (sound pressure level), droplet size, viscosity, and density. However, we show that while the agglomeration timescale decreases with initial particle concentration, the evaporation timescale shows the opposite trend. The final normalized diameter can be shown to be dependent solely on the ratio of agglomeration to evaporation timescales for all concentrations and acoustic amplitudes. The structures also exhibit various aspect ratios (bowls, rings, spheroids) which depend on the ratio of the deformation timescale (t(def)) and the agglomeration timescale (t(g)). For t(def) < t(g), a sharp peak in aspect ratio is seen at low concentrations of nanosilica which separates high aspect ratio structures like rings from the low aspect ratio structures like bowls and spheroids. (C) 2013 American Institute of Physics. http://dx.doi.org/10.1063/1.4775791]

A Phase Transition for the Uniform Distribution in the Pattern Maximum Likelihood Problem

In this paper, we consider the setting of the pattern maximum likelihood (PML) problem studied by Orlitsky et al. We present a well-motivated heuristic algorithm for deciding the question of when the PML distribution of a given pattern is uniform. The algorithm is based on the concept of a ``uniform threshold''. This is a threshold at which the uniform distribution exhibits an interesting phase transition in the PML problem, going from being a local maximum to being a local minimum.

``Conformational Simulation'' of Sulfamethizole by Molecular Complexation and Insights from Charge Density Analysis: Role of Intramolecular S center dot center dot center dot O Chalcogen Bonding

Intramolecular S center dot center dot center dot O chalcogen bonding and its potential to lock molecular conformation have been examined in the crystal forms of sulfamethizole, a sulfonamide antibiotic. Molecular complexes of sulfamethizole, including salts and cocrystal, have been synthesized, and their crystal structures were analyzed in order to examine the possible conformational preferences of the molecule in various ionic states and supramolecular environments (neutral/cocrystal, anionic salt, and cationic salt forms). The electrostatic potential mapped on Hirshfeld surfaces generated for these crystal forms provides insights into the possible binding modes of the drug in different environments. Further, the observed conformation locking feature has been rationalized in terms of the experimental charge density features of the intramolecular S center dot center dot O chalcogen bonding in sulfamethizole. The study quantitatively illustrates and rationalizes an intriguing case of a local minimum of molecular conformation being exclusively preferred over the global minimum, as it facilitates more efficient intermolecular interactions in a supramolecular environment.

Tunable three-dimensional intensity distribution by a pure phase-shifting apodizer

The three-dimensional distribution of light intensity that is modulated by a pure phase-shifting apodizer is studied. Results show that the Strehl ratio can be altered by the proposed apodizer and by the waist width of incident Gaussian beams. By changing geometrical parameters of the proposed apodizer, we can increase the focal depth to several times that of the original system. The proposed apodizer can also be used to realize focal splitting and local minimum of intensity, which may be advantageous for constructing an optical trap. Furthermore, the local minimum of intensity number is tunable by changing the parameters of the apodizer. (c) 2005 Optical Society of America

Genetic and morphological differences between Sebastes vulpes and S. zonatus (Teleostei: Scorpaeniformes: Scorpaenidae)

The taxonomic status of Sebastes vulpes and S. zonatus were clarified by comprehensive genetic (amplif ied fragment length polymorphisms [AFLP] and mitochondrial DNA [mtDNA] variation) and morphological analyses on a total of 65 specimens collected from a single locality. A principal coordinate analysis based on 364 AFLP loci separated the specimens completely into two genetically distinct groups that corresponded to S. vulpes and S. zonatus according to body coloration and that indicated that they are reproductively isolated species. Significant morphological differences were also evident between the two groups; 1) separation by principal component analysis based on 31 measurements, and 2)separation according to differences in counts of gill rakers and dorsal-fin spines without basal scales, and in the frequencies of specimens with small scales on the lower jaw. Restriction of gene flow between the two groups was also indicated by the pairwise ΦST values estimated from variations in partial sequences from the mtDNA control region, although the minimum spanning network did not result in separation into distinct clades. The latter was likely due to incomplete lineage sorting between S. vulpes and S. zonatus owing to their recent speciation.

A method for analysing operational complexity in supply chains

This paper proposes a method for analysing the operational complexity in supply chains by using an entropic measure based on information theory. The proposed approach estimates the operational complexity at each stage of the supply chain and analyses the changes between stages. In this paper a stage is identified by the exchange of data and/or material. Through analysis the method identifies the stages where the operational complexity is both generated and propagated (exported, imported, generated or absorbed). Central to the method is the identification of a reference point within the supply chain. This is where the operational complexity is at a local minimum along the data transfer stages. Such a point can be thought of as a 'sink' for turbulence generated in the supply chain. Where it exists, it has the merit of stabilising the supply chain by attenuating uncertainty. However, the location of the reference point is also a matter of choice. If the preferred location is other than the current one, this is a trigger for management action. The analysis can help decide appropriate remedial action. More generally, the approach can assist logistics management by highlighting problem areas. An industrial application is presented to demonstrate the applicability of the method. © 2013 Operational Research Society Ltd. All rights reserved.

Continuous dynamical systems that realize discrete optimization on the hypercube

We study the problem of finding a local minimum of a multilinear function E over the discrete set {0,1}n. The search is achieved by a gradient-like system in [0,1]n with cost function E. Under mild restrictions on the metric, the stable attractors of the gradient-like system are shown to produce solutions of the problem, even when they are not in the vicinity of the discrete set {0,1}n. Moreover, the gradient-like system connects with interior point methods for linear programming and with the analog neural network studied by Vidyasagar (IEEE Trans. Automat. Control 40 (8) (1995) 1359), in the same context. © 2004 Elsevier B.V. All rights reserved.

长白山地区曲尾藓属植物生态分化的排序研究

The relationships of eight moss species of Dicranum in 31 sites in main ecological systems in the Changbai Mountain with environmental factors were studied by canonical correspondence analysis (CCA). The results showed that altitude, soil sand percentage, water percentage, acidity and canopy density were important environmental factors influencing the distribution of the species of Dicranum . The relationships between Dicranum elongatum Schleich. ex Schwaegr ., D.groenlandicum Brid. and altitude,between D.japonicum Mitt., D.scoparium Hedw. and canopy density,between D.polysetum Sw., D. undulatum Schrad. ex Brid. and soil acidity and water percentage,were positively correlative. The niche overlaps among the eight species of Dicranum were calculated. The minimal spanning tree of the eight species on the two-dimensional scatter plot were also drawn based on their niche overlaps, which clearly revealed the ecological similarities of eight species.

Conformational analysis of 2,2 '-bithiophene under interaction of external electric field defined by point charges

Conformational analysis of 2,2'-bithiophene (BT) under the influence of an electric field (EF) constructed by point charges has been performed by using semi-empirical Austin Model 1 (AM1) and Parametric model number 3 (PM3) calculations. When the EF perpendicular to the molecular conjugation chain is applied, both AM1 and PM3 calculations show an energy increase of the anti-conformation. AM1 predicts that the global minimum shifts to syn-conformation when the EF strength is larger than a critical value. and PM predicts that the local minimum in anti-conformation vanishes. This kind of EF effect has been ascribed to the EF and dipole moment interaction.

基于SVD和能量最小原则的图像自适应降噪算法

基于奇异值分解和能量最小原则,提出了一种自适应图像降噪算法,并给出了基于有界变差的能量降噪模型的代数形式。通过在矩阵范数意义下求能量最小,自适应确定去噪图像重构的奇异值个数。该算法的特点是将能量最小法则和奇异值分解结合起来,在代数空间中建立了一种自适应的图像降噪算法。与基于压缩比和奇异值分解的降噪方法相比,由于该算法避免了图像压缩比函数及其拐点的计算,因此具有快速去噪和简单可行的优点。实验结果证明,该算法是有效的。

利用BP神经网络实现三维物体姿态的测定

本文利用BP(Back-Propagation)人工神经网络对三维物体的姿态测定进行了研究。姿态测定一直缺少通用而实际的方法,人工神经网络由于具有强大的自组织、自适应学习能力,迅速的并行信息处理能力,可望解决这个问题。但现有BP算法存在训练慢和易陷入局部最小两个问题.本文提出的级联形式网络结构,使BP网络的训练速度大为提高,陷入局部最小的可能性大为降低。利用这种级联结构对飞机模型姿态测定,取得了较好的实验结果。

井间地震速度层析成像方法与软件系统

Crosshole Seismic tomography has been broadly studied and applied in the fields of resource exploration and engineering exploration because of its special observing manner and better resolution than normal seismic exploration. This thesis will state the theory and method of Crosshole Seismic tomography. Basing on the previous studies，the thesis studied the initial velocity model，ray-tracing method, and developed the three-dimension tomography software. All the cells that a ray passes through are of the same velocities if the paths from transmitters to receivers are straight. The cells that the each ray passes through are recorded, and rays that pass through each cell are calculated. The ray average velocity which passes through a cell is set as the cell velocity. Analogously we can make a initial node velocity model because the velocity sum is calculated on the all cells which own to a certain node, and the cell number is summed about each nodes，the ratio of the velocity sum to the all cells number is set as the node velocity. The inversion result from the initial node velocity model is better than that of the average velocity model. Ray-bending and Shortest Path for Rays (SPR) have shortcomings and limitations respectively. Using crooked rays obtained from SPR rather than straight lines as the starting point can not only avoid ray bending converging to the local minimum travel time path, but also settle the no smooth ray problem obtained by SPR. The hybrid method costs much computation time, which is roughly equal to the time that SPR expends. The Delphi development tool based on the Object Pascal language standard has an advantage of object-oriented. TDTOM (Three Dimensions Tomography) was developed by using Delphi from the DOS version. Improvement on the part of inversion was made, which bring faster convergence velocity. TDTOM can be used to do velocity tomography from the first arrival travel time of the seismic wave, and it has the good qualities of friendly user interface and convenient operation. TDTOM is used to reconstruct the velocity image for a set of crosshole data from Karamay Oil Field. The geological explanation is then given by comparing the inversion effects of different ray-tracing methods. High velocity zones mean the cover of oil reservoir, and low velocity zones correspond to the reservoir or the steam flooding layer.

各向同性与各向异性介质中地震波旅行时正演模拟与反演成像

By seismic tomography, interesting results have been achieved not only in the research of the geosphere with a large scale but also in the exploration of resources and projects with a small scale since 80'. Compared with traditional inversion methods, seismic tomography can offer more and detailed information about subsurface and has been being paid attention by more and more geophysicists. Since inversion based on forward modeling, we have studied and improved the methods to calculate seismic traveltimes and raypaths in isotropic and anisotropic media, and applied the improved forward methods to traveltime tomography. There are three main kinds of methods to calculate seismic traveltime field and its ray path distribution, which are ray-tracing theory, eikonal equation by the finite-difference and minimum traveltime tree algorithm. In ray tracing, five methods are introduced in the paper, including analytic ray tracing, ray shooting, ray bending, grid ray tracing and rectangle grid ray perturbation with three points. Finite-difference solution of eikonal equation is very efficient in calculation of seismic first-break, but is awkward in calculation of reflection traveltimes. We have put forward a idea to calculate traveltimes of reflected waves using a combining way of eikonal equation method and other one in order to improve its capability of dealing with reflection waves. The minimum traveltime tree algorithm has been studied with emphases. Three improved algorithms are put forward on the basis of basic algorithm of the minimum traveltime tree. The first improved algorithm is called raypath tracing backward minimum traveltime algorithm, in which not only wavelets from the current source but also wavelets from upper source points are all calculated. The algorithm can obviously improve the speed of calculating traveltimes and raypaths in layered or blocked homogeneous media and keep good accuracy. The second improved algorithm is raypath key point minimum traveltime algorithm in which traveltimes and raypaths are calculated with a view of key points of raypaths (key points of raypths mean the pivotal points which determine raypaths). The raypath key point method is developed on the basis of the first improved algorithm, and has better applicability. For example, it is very efficient even for inhomogeneous media. Another improved algorithm, double grid minimum traveltime tree algorithm, bases upon raypath key point scheme, in which a model is divided with two kinds of grids so that the unnecessary calculation can be left out. Violent undulation of curved interface often results in the phenomenon that there are no reflection points on some parts of interfaces where there should be. One efficacious scheme that curved interfaces are divided into segments, and these segments are treated respectively is presented to solve the problem. In addition, the approximation to interfaces with discrete grids leads to large errors in calculation of traveltimes and raypaths. Noting the point, we have thought a new method to remove the negative effect of mesh and to improve calculation accuracy by correcting the traveltimes with a little of additional calculation, and obtained better results.

Surrogate-Based Optimization Using Multifidelity Models with Variable Parameterization and Corrected Space Mapping

Surrogate-based-optimization methods provide a means to achieve high-fidelity design optimization at reduced computational cost by using a high-fidelity model in combination with lower-fidelity models that are less expensive to evaluate. This paper presents a provably convergent trust-region model-management methodology for variableparameterization design models: that is, models for which the design parameters are defined over different spaces. Corrected space mapping is introduced as a method to map between the variable-parameterization design spaces. It is then used with a sequential-quadratic-programming-like trust-region method for two aerospace-related design optimization problems. Results for a wing design problem and a flapping-flight problem show that the method outperforms direct optimization in the high-fidelity space. On the wing design problem, the new method achieves 76% savings in high-fidelity function calls. On a bat-flight design problem, it achieves approximately 45% time savings, although it converges to a different local minimum than did the benchmark.