Degenerate polynomial patches of degree 11 for almostGC 2 interpolation over triangles

We consider the problem of interpolating scattered data in ³ by analmost geometrically smoothGC ² surface, where almostGC ² meansGC ² except in a finite number of points (the vertices), where the surface isGC ¹. A local method is proposed, based on employing so-called degenerate triangular Bernstein-Bézier patches. We give an analysis of quintic patches forGC ¹ and patches of degree eleven for almostGC ² interpolation.     

C 1 surface interpolation with constraints

Givenn pairwise distinct and arbitrarily spaced pointsP _i in a domainD of thex–y plane andn real numbersf _i, consider the problem of computing a bivariate functionf(x, y) of classC ¹ inD whose values inP _i are exactlyf _i,i=1,,n, and whose first or second order partial derivatives satisfy appropriate equality and inequality constraints on a given set ofp pointsQ _l inD.In this paper we present a method for solving the above problem, which is designed for extremely large data sets. A step of this method requires the solution of a large scale quadratic programming (QP) problem.The main purpose of this work is to analyse an iterative method for determining the solution of this QP problem: such a method is very efficient and well suited for parallel implementation on a multiprocessor system.Work supported by MURST Project of Computational Mathematics, Italy.     

A New Method to Investigate the Clustering Phenomena in Supercritical Fluids

EstimationoflocaldensityofsolventaboutthesoluteSolvatochromicbehaviorsofspectroscopicprobesarewidelyusedtoestimatethesol-ventstrengthofsupercriticalfluids(SCF,).i-3lnthiswork,thesolvatochrondcshiftofthen-n*transitionbandforacetone(O.o37mo1.L-')insupercrihcal(SC)CO2wasde-terminedbyUVspectroscopytostUdythesolvationeffect.TheMcRae-BaylissexpressionbasedonthedielectriccontinUUInmodelgivestherelahonshipbetWeenso1vatochromicshiftandpo1arizabilityofnonPolarsolvents4-5asfollows:wherevisthewave…     

Asymptotic expansions of the distributions of some test statistics

Summary A modified Wald statistic for testing simple hypothesis against fixed as well as local alternatives is proposed. The asymptotic expansions of the distributions of the proposed statistic as well as the Wald and Rao statistics under both the null and alternative hypotheses are obtained. The powers of these statistics are compared and its is shown that for special structures of parameters some statistics have same power in the sence of order . The results obtained are applied for testing the hypothesis about the covariance matrix of the multivariate normal distribution and it is shown that none of the tests based on the above statistics is uniformly superior. Research supported by the National Science Foundation Grant MCS 830149.     

Partitioning of <Emphasis Type="Italic">π</Emphasis> -electrons in rings of polycyclic conjugated hydrocarbons: Part 6. Comparison with other methods for estimating the local aromaticity of rings in polycyclic benzenoids

By adopting the convention that shared double bonds in polycyclic conjugated hydrocarbons contribute with one -electron and unshared ones with two -electrons, a partition of -electrons in each ring (-electron content, EC) can be obtained by averaging over all Kekulé structures, which are assumed to have equal weights. This affords a simple measure of local aromaticity that is comparable with other such local aromaticity indices in polycyclic benzenoids.     

Modular design of icosahedral metal clusters

The concept of crystalline module, that is, an unambiguously isolated, repeated quasi-molecular element, is introduced. This concept is more general than the concept of crystal lattice. The generalized modular approach allows extension of the methods and principles of crystallography to quasi-crystals, clusters, amorphous solids, and periodic biological structures. Principles of construction of aperiodic, nonequilibrium regular modular structures are formulated. Limitations on the size of icosahedral clusters are due to the presence of spherical shells with non-Euclidean tetrahedral tiling in their structure. A parametric relationship between the structures of icosahedral fullerenes and metal clusters of the Chini series was found.     

QSPR Modeling of Gibbs Free Energy of Organic Compounds by Weighting of Nearest Neighboring Codes

We examine the encoding of chemical structure of organic compounds by Labeled Hydrogen-Filled Graphs (LHFGs). Quantitative Structure-Property Relationships (QSPR) for a representative set of 150 organic molecules have been derived by means of the optimization of correlation weights of local invariants of the LHFGs. We have tested as local invariants Morgan extended connectivity of zero- and first order, numbers of path of length 2 (P2) and valence shells of distance of 2 (S2) associated with each atom in the molecular structure, and the Nearest Neighboring Codes (NNC). The best statistical characteristics for the Gibbs free energy has been obtained for the NNC weighting. Statistical parameters corresponding to this model are the following n = 100, r² = 0.9974, s = 5.136 kJ/mol, F = 38319 (training set); n = 50, r² = 0.9990, s = 3.405 kJ/mol, F = 48717 (test set). Some possible further developments are pointed out.     

Grouped coordinate minimization using Newton's method for inexact minimization in one vector coordinate

Letf(x,y) be a function of the vector variablesx R ⁿ andy R ^m. The grouped (variable) coordinate minimization (GCM) method for minimizingf consists of alternating exact minimizations in either of the two vector variables, while holding the other fixed at the most recent value. This scheme is known to be locally,q-linearly convergent, and is most useful in certain types of statistical and pattern recognition problems where the necessary coordinate minimizers are available explicitly. In some important cases, the exact minimizer in one of the vector variables is not explicitly available, so that an iterative technique such as Newton's method must be employed. The main result proved here shows that a single iteration of Newton's method solves the coordinate minimization problem sufficiently well to preserve the overall rate of convergence of the GCM sequence.The authors are indebted to Professor R. A. Tapia for his help in improving this paper.     

A long-time tail for random walk in random scenery

Consider a simple random walk on ^d whose sites are colored black or white independently with probabilityq, resp. 1–q. Walk and coloring are independent. Letn _k be the number of steps by the walk between itskth and (k+1) th visits to a black site (i.e., the length of itskth white run), and let _k =E(n _k )–q ^–1. Our main result is a proof that (*) lim _k k ^d/2 _k = (1 –q)q ^{d/2 – 2}(d/2) ^d/2. Since it is known thatq ^{– 1} _k =E(n ₁ n _{k + 1} B) –E(n ₁ B)E(n _{k + 1} B), withB the event that the origin is black, (*) exhibits a long-time tail in the run length autocorrelation function. Numerical calculations of _k (1k100) ind=1, 2, and 3 show that there is an oscillatory behavior of _k for smallk. This damps exponentially fast, following which the power law sets in fairly rapidly. We prove that if the coloring is not independent, but is convex in the sense of FKG, then the decay of _k cannot be faster than (*).