Large families of mutually embeddable vertex‐transitive graphs

For each infinite cardinal κ, we give examples of 2^κ many non‐isomorphic vertex‐transitive graphs of order κ that are pairwise isomorphic to induced subgraphs of each other. We consider examples of graphs with these properties that are also universal, in the sense that they embed all graphs with smaller orders as induced subgraphs. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 99–106, 2003     

Ferromagnetic Properties of Bond-Dilution and Random Positive or Negative Uniaxial Anisotropy Blume-Capel Model

We study the ferromagnetic properties of spin-1 system, which is considered in the frame of the bond dilution and random positive or negative anisotropy Blume-Capel model in the effective field theory and a cutting approximation. The investigation of phase diagrams displays some rich properties of the trajectory of tricritical point, reentrant henomena at low temperatures. Under certain both bond concentrations and random negative anisotropy, there are new transition lines of double tricritical points. So special emphasis is placed on the influence of the bond dilution and random anisotropy on phase diagrams. The magnetizations of the system are also discussed. Some results have not been evealed in previous reports.     

Self-avoiding walks and trees in spread-out lattices

LetG _R be the graph obtained by joining all sites ofZ ^d which are separated by a distance of at mostR. Let (G _R ) denote the connective constant for counting the self-avoiding walks in this graph. Let (G _R ) denote the coprresponding constant for counting the trees embedded inG _R . Then asR, (G _R ) is asymptotic to the coordination numberk _R ofG _R , while (G _R ) is asymptotic toek _R. However, ifd is 1 or 2, then (G _R )-k _R diverges to –.Dedicated to Oliver Penrose on this occasion of his 65th birthday.     

Properties of the random search in global optimization

From theorems which we prove about the behavior of gaps in a set ofN uniformly random points on the interval [0, 1], we determine properties of the random search procedure in one-dimensional global optimization. In particular, we show that the uniform grid search is better than the random search when the optimum is chosen using the deterministic strategy, that a significant proportion of large gaps are contained in the uniformly random search, and that the error in the determination of the point at which the optimum occurs, assuming that it is unique, will on the average be twice as large using the uniformly random search compared with the uniform grid. In addition, some of the properties of the largest gap are verified numerically, and some extensions to higher dimensions are discussed. The latter show that not all of the conclusions derived concerning the inadequacies of the one-dimensional random search extend to higher dimensions, and thaton average the random search is better than the uniform grid for dimensions greater than 6.This paper is based on work started in the Statistics Department of Princeton University when the first author was visiting as a Research Associate. Part of this research was supported by the Office of Naval Research, Contract No. 0014-67-A-0151-0017, and by the US Army Research Office—Durham, Contract No. DA-31-124-ARO-D-215.2 The authors wish to thank B. Omodei for his careful work in preparing the programs for the results of Figs. 1–2 and Table 1. The computations were performed on the IBM 360/50 of the Australian National University's Computer Centre. Thanks are also due to R. Miles for suggestions regarding the extension of the results to multidimensional regions, and to P. A. P. Moran and R. Brent for suggestions regarding the evaluation of the integral ₀ ¹ ... ^0/1 (x ₁ ² + ... +x _n ^/2 )^1/2 dx ₁ ...dx _n.     

垂直水声通信中的伪随机序列精确定时算法*

针对垂直水声通信中时变多普勒引起的定时偏差问题,研究一种基于伪随机序列的迭代定时估计及补偿算法。该方法利用伪随机序列作为同步信号,分三步估计时变多普勒：采用低复杂度的模糊函数法粗补偿接收信号内的平均多普勒;通过迭代插值法实现残留时变多普勒的精确估计及补偿;利用基于信道相关函数的相位信息,纠正均衡后信号的偏转相位。为实现高阶海试数据的有效解调,采用基于伪随机序列均方误差的多通道加权合并方式,获得空间分集增益。仿真及海试数据处理结果证明所提方法具有良好的时变多普勒估计及补偿性能,同时对30个通道内的1024QAM数据进行合并处理,在500 m的通信距离下,误码率为0.04,信道容量达到7.6 bits/symbol。与传统数据帧结构相比,无需使用线性调频信号,可以提高有效数据传输率。     

Comparison of Physical Adsorption and Covalent Coupling Methods for Surface Density-Dependent Orientation of Antibody on Silicon

The orientation of antibodies, employed as capture molecules on biosensors, determines biorecognition efficiency and bioassay performance. In a previous publication we demonstrated for antibodies attached covalently to silicon that an increase in their surface amount Γ, evaluated with ellipsometry, induces changes in their orientation, which is traced directly using Time-of-Flight Secondary Ion Mass Spectroscopy combined with Principal Component Analysis. Here, we extend the above studies to antibodies adsorbed physically on a 3-aminopropyltriethoxysilane (APTES) monolayer. Antibodies physisorbed on APTES (0 ≤ Γ ≤ 3.5 mg/m²) reveal the Γ ranges for flat-on, side-on, and vertical orientation consistent with random molecular packing. The relation between orientation and Γ is juxtaposed for silicon functionalized with APTES, APTES modified with glutaraldehyde (APTES/GA) and N-hydroxysuccinimide-silane (NHS-silane). Antibody reorientation occurs at lower Γ values when physisorption (APTES) is involved rather than chemisorption (APTES/GA, NHS-silane). At high Γ values, comparable proportions of molecules adapting head-on and tail-on vertical alignment are concluded for APTES and the NHS-silane monolayer, and they are related to intermolecular dipole–dipole interactions. Intermolecular forces seem to be less decisive than covalent binding for antibodies on the APTES/GA surface, with dominant head-on orientation. Independently, the impact of glutaraldehyde activation of APTES on vertical orientation is confirmed by separate TOF-SIMS measurements.     

From Chaos to Ordering: New Studies in the Shannon Entropy of 2D Patterns

Properties of the Voronoi tessellations arising from random 2D distribution points are reported. We applied an iterative procedure to the Voronoi diagrams generated by a set of points randomly placed on the plane. The procedure implied dividing the edges of Voronoi cells into equal or random parts. The dividing points were then used to construct the following Voronoi diagram. Repeating this procedure led to a surprising effect of the positional ordering of Voronoi cells, reminiscent of the formation of lamellae and spherulites in linear semi-crystalline polymers and metallic glasses. Thus, we can conclude that by applying even a simple set of rules to a random set of seeds, we can introduce order into an initially disordered system. At the same time, the Shannon (Voronoi) entropy showed a tendency to attain values that are typical for completely random patterns; thus, the Shannon (Voronoi) entropy does not distinguish the short-range ordering. The Shannon entropy and the continuous measure of symmetry of the patterns demonstrated the distinct asymptotic behavior, while approaching the close saturation values with the increase in the number of iteration steps. The Shannon entropy grew with the number of iterations, whereas the continuous measure of symmetry of the same patterns demonstrated the opposite asymptotic behavior. The Shannon (Voronoi) entropy is not an unambiguous measure of order in the 2D patterns. The more symmetrical patterns may demonstrate the higher values of the Shannon entropy.     

Essential Conditions for the Full Synergy of Probability of Occurrence Distributions

In this contribution, we specify the conditions for assuring the validity of the synergy of the distribution of probabilities of occurrence. We also study the subsequent restriction on the maximal extension of the strict concavity region on the parameter space of Sharma–Mittal entropy measures, which has been derived in a previous paper in this journal. The present paper is then a necessary complement to that publication. Some applications of the techniques introduced here are applied to protein domain families (Pfam databases, versions 27.0 and 35.0). The results will show evidence of their usefulness for testing the classification work performed with methods of alignment that are used by expert biologists.     

Scattering Matrix Modeling of Photon Migration in Turbid Media

Ｉｎｔｒｏｄｕｃｔｉｏｎ　　Ｏｐｔｉｃａｌｔｏｍｏｇｒａｐｈｙｕｓｉｎｇｎｅａｒｉｎｆｒａｒｅｄｌｉｇｈｔｔｏｅｘｔｒａｃｔｉｎｔｅｒｉｏｒａｂｎｏｒｍａｌｉｔｉｅｓｉｎｆｏｒｍａｔｉｏｎａｔｔｒａｃｔｓｍａｎｙｒｅｓｅａｒｃｈｉｎｔｅｒｅｓｔｓｉｎｂｉｏｍｅｄｉｃａｌｏｐｔｉｃｓ［１］,ｂｅｃａｕｓｅｉｔｐｒｏｖｉｄｅｓａｎａｌｔｅｒｎａｔｉｖｅｐｏｔｅｎｔｉａｌｍｏｄａｌｉｔｙｔｏｐｒｏｂｅｂｒｅａｓｔｃａｎｃｅｒａｎｄｍｏｎｉｔｏｒｂｒａｉｎａｎｄｍｕｓｃｌｅｏｘｙｇｅｎａｔｉｏｎｎｏｎ…     

Geometry of random sequential adsorption

By sequentially adding line segments to a line or disks to a surface at random positions without overlaps, we obtain configurations of the one- and two-dimensional random sequential adsorption (RSA) problem. We have simulated the one- and two-dimensional problem with periodic boundary condition. The one-dimensional simulations are compared with the exact analytical solutions to give an estimate of the accuracy of the simulation. In two dimensions the geometrical properties of the RSA configuration are discussed and in addition known results of the RSA process are reproduced. Various statistical distributions of the Voronoi-Dirichlet (VD) network corresponding to the RSA disk configuration are analyzed. In order to characterize pores in the RSA configuration, we introduce circular holes. There is a direct correspondence between vertices of the VD network and these holes, and also between direct/indirect geometrical neighbors and these holes. The hole size distribution is found to be a parabola. We also find general relations that connect the asymptotic behavior of the surface coverage, the correlation function, and the hole size distribution.