I. Exact solution of some nonlinear evolution equations. II. The similarity solution for the Korteweg-De Vries equation and the related Painleve Transcendent

In Part I, a method for finding solutions of certain diffusive dispersive nonlinear evolution equations is introduced. The method consists of a straightforward iteration procedure, applied to the equation as it stands (in most cases), which can be carried out to all terms, followed by a summation of the resulting infinite series, sometimes directly and other times in terms of traces of inverses of operators in an appropriate space.

We first illustrate our method with Burgers' and Thomas' equations, and show how it quickly leads to the Cole-Hopft transformation, which is known to linearize these equations.

We also apply this method to the Korteweg and de Vries, nonlinear (cubic) Schrödinger, Sine-Gordon, modified KdV and Boussinesq equations. In all these cases the multisoliton solutions are easily obtained and new expressions for some of them follow. More generally we show that the Marcenko integral equations, together with the inverse problem that originates them, follow naturally from our expressions.

Only solutions that are small in some sense (i.e., they tend to zero as the independent variable goes to ∞) are covered by our methods. However, by the study of the effect of writing the initial iterate u_1 = u_(1)(x,t) as a sum u_1 = ^∼/u_1 + ^≈/u_1 when we know the solution which results if u_1 = ^∼/u_1, we are led to expressions that describe the interaction of two arbitrary solutions, only one of which is small. This should not be confused with Backlund transformations and is more in the direction of performing the inverse scattering over an arbitrary “base” solution. Thus we are able to write expressions for the interaction of a cnoidal wave with a multisoliton in the case of the KdV equation; these expressions are somewhat different from the ones obtained by Wahlquist (1976). Similarly, we find multi-dark-pulse solutions and solutions describing the interaction of envelope-solitons with a uniform wave train in the case of the Schrodinger equation.

Other equations tractable by our method are presented. These include the following equations: Self-induced transparency, reduced Maxwell-Bloch, and a two-dimensional nonlinear Schrodinger. Higher order and matrix-valued equations with nonscalar dispersion functions are also presented.

In Part II, the second Painleve transcendent is treated in conjunction with the similarity solutions of the Korteweg-de Vries equat ion and the modified Korteweg-de Vries equation.

Self-Similarity and helical symmetry in vortex generator flow simulations

According to experimental observations, the vortices generated by vortex generators have previously been observed to be self-similar for both the axial (u(z)) and azimuthal (u(circle minus)) velocity profiles. Further, the measured vortices have been observed to obey the criteria for helical symmetry. This is a powerful result, since it reduces the highly complex flow to merely four parameters. In the present work, corresponding computer simulations using Reynolds-Averaged Navier-Stokes equations have been carried out and compared to the experimental observations. The main objective of this study is to investigate how well the simulations can reproduce the physics of the flow and if the same analytical model can be applied. Using this model, parametric studies can be significantly reduced and, further, reliable simulations can substantially reduce the costs of the parametric studies themselves.

Distributed flow algorithms for scalable similarity visualization

We describe simple yet scalable and distributed algorithms for solving the maximum flow problem and its minimum cost flow variant, motivated by problems of interest in objects similarity visualization. We formulate the fundamental problem as a convex-concave saddle point problem. We then show that this problem can be efficiently solved by a first order method or by exploiting faster quasi-Newton steps. Our proposed approach costs at most O(|ε|) per iteration for a graph with |ε| edges. Further, the number of required iterations can be shown to be independent of number of edges for the first order approximation method. We present experimental results in two applications: mosaic generation and color similarity based image layouting. © 2010 IEEE.

Graphical representation and the similarity of DNA primary sequences

In this article, graphical representations of DNA primary sequences were generated. Topological indices and molecular connectivity indices were calculated and used for the comparison of similarities among eight different DNA segments. The satisfactory results were achieved by this analysis.

Local similarity in organic crystals and the non-uniqueness of X-ray powder patterns

Two new concepts for molecular solids, 'local similarity' and 'boundary-preserving isometry', are defined mathematically and a theorem which relates these concepts is formulated. 'Locally similar' solids possess an identical short-range structure and a 'boundary-preserving isometry' is a new mathematical operation on a finite region of a solid that transforms mathematically a given solid to a locally similar one. It is shown further that the existence of such a 'boundary-preserving isometry' in a given solid has infinitely many 'locally similar' solids as a consequence. Chemical implications, referring to the similarity of X-ray powder patterns and patent registration, are discussed as well. These theoretical concepts, which are first introduced in a schematic manner, are proved to exist in nature by the elucidation of the crystal structure of some diketopyrrolopyrrole (DPP) derivatives with surprisingly similar powder patterns. Although the available powder patterns were not indexable, the underlying crystals could be elucidated by using the new technique of ab initio prediction of possible polymorphs and a subsequent Rietveld refinement. Further ab initio packing calculations on other molecules reveal that 'local crystal similarity' is not restricted to DPP derivatives and should also be exhibited by other molecules such as quinacridones. The 'boundary-preserving isometry' is presented as a predictive tool for crystal engineering purposes and attempts to detect it in crystals of the Cambridge Structural Database (CSD) are reported.

Atom space distance and computing of molecular similarity

A mathematical model on computation of molecular similarity was suggested, The algorithmic techniques for measuring the degree of similarity between pairs of three-dimensional chemical molecules was represented by modified interatomic distance matrices. Current work was carried out on Indigo 2 work station with Sybyl software. Four groups of molecules were used to compute the molecules similarity to testing the mathematical model with satisfactory results.

Chemical environment code and measure of molecular similarity

A new scheme for the code of chemical environments of compounds is described in this paper, and three molecular similarity methods have been used to select nearest neighbors from four different types of probe compounds. One of the methods is based on the C-13 NMR spectra. The second method is based on the code of chemical environments and molecular topological index A(x). The third approach, i.e. the Tanimoto coefficient, is also based on the code of chemical environments, but not to use the topological index. Five nearest neighbors for each probe compound using these three molecular similarity methods were determined and taken from the database of 7309 structures. The results indicate that the scheme of the chemical environment code and the method for similarity measure of intermolecules suggested in this study are reasonable. (C) 1998 Published by Elsevier Science Ltd. All rights reserved.

Code for chemical environment and computation of molecular similarity

A new code for chemical environment and an empirical mathematical pattern Sa(m) on computation of molecular similarity were suggested. Seven molecules which referred to as the probe compounds and the nearest neighbors of each probe structure were determined by the methods of Sa(m) and Tanimoto, The results show an intuitive notion of chemical similarity.