一阶时滞微分方程解的零点分布

Abstract. The paper gives two estimates of the distance between adjacent zeros of solutions     

Affine-Invariant Distances, Envelopes and Symmetry Sets

Affine invariant symmetry sets of planar curves are introduced and studied in this paper. Two different approaches are investigated. The first one is based on affine invariant distances, and defines the symmetry set as the closure of the locus of points on (at least) two affine normals and affine-equidistant from the corresponding points on the curve. The second approach is based on affine bitangent conics. In this case the symmetry set is defined as the closure of the locus of centers of conics with (at least) 3-point contact with the curve at two or more distinct points on the curve. This is equivalent to conic and curve having, at those points, the same affine tangent, or the same Euclidean tangent and curvature. Although the two analogous definitions for the classical Euclidean symmetry set are equivalent, this is not the case for the affine group. We present a number of properties of both affine symmetry sets, showing their similarities with and differences from the Euclidean case. We conclude the paper with a discussion of possible extensions to higher dimensions and other transformation groups, as well as to invariant Voronoi diagrams.     

聚碳酸酯聚氨酯弹性体的模拟生物老化性能的研究

研究了聚碳酸酯聚氨酯的水解剂，氧化，钙化等生物老化性能，并与聚醚聚氨酯样品做了比较，结果表明，胺扩链样品具有较好的耐水解性能，聚碳酸酯氨酯的抗氧化性能优于聚醚聚氨酯，同了聚醚氨酯一样，聚碳酸酯聚氨酯同样受钙的影响，含水氯化钙对聚碳酸酯聚氨酯的相结构产生影响，并对弹性具有增强作用。     

Counterexamples in measuring the distance between binary trees

Examples are given to show that the closest partition distance measure need not agree with the nearest neighbor interchange distance for unordered labeled binary trees. Proposed algorithms for computing the closest partition distance are shown to be of exponential complexity and hence may not be useful in approximating the nearest neighbor interchange distance.     

Information Theories with Adversaries,Intrinsic Information,and Entanglement

There are aspects of privacy theory that are analogous to quantum theory. In particular one can define distillable key and key cost in parallel to distillable entanglement and entanglement cost. We present here classical privacy theory as a particular case of information theory with adversaries, where similar general laws hold as in entanglement theory. We place the result of Renner and Wolf—that intrinsic information is lower bound for key cost—into this general formalism. Then we show that the question of whether intrinsic information is equal to key cost is equivalent to the question of whether Alice and Bob can create a distribution product with Eve using I_M bits of secret key. We also propose a natural analogue of relative entropy of entanglement in privacy theory and show that it is equal to the intrinsic information. We also provide a formula analogous to the entanglement of formation for classical distributions. It is our pleasure to dedicate this paper to Asher Peres on the occasion of his seventieth birthday.     

The identity is isolated among composition operators

Let be the Banach algebra of bounded holomorphic functions on the open unit ball of a Banach space. We show that the identity operator is an isolated point in the space of composition operators on . This answers a conjecture of Aron, Galindo and Lindström.

     

An example in holomorphic fixed point theory

If is the open unit ball in the Cartesian product furnished with the -norm , where and , then a holomorphic self-mapping of has a fixed point if and only if for some

     

Retrieval Properties of Bidirectional Associative Memories

We study a two-layer neural network made of N and M(N) neurons, producing a two-way association search for a family of p(N) patterns, where each pattern is a pair of two independent sub-categories of information having respectively N and M(N) components. In terms of the ratio =lim _N M(N)/N, we study the retrieval capability of this network and show that there exists, at least, three regimes of association for which we determine the evolution of the threshold _c () of the storage capacity =lim _N p(N)/N.     

Uniqueness and asymptotic behaviour for solutions of semilinear problems with boundary blow-up

In this paper we prove uniqueness of positive solutions to logistic singular problems , , 1$">, 0$"> in , where the main feature is the fact that . More importantly, we provide exact asymptotic estimates describing, in the form of a two-term expansion, the blow-up rate for the solutions near . This expansion involves both the distance function and the mean curvature of .

     

On the use of Laplace's equation for global predictions of internuclear separation and dissociation energy

Properties of target species can be estimated by various means including interpolations in periodic charts. Interpolation is equivalent to numerical solution of the Laplace equation. A test of this equivalence, within some confidence level, for any N-atomic molecule surrounded by 4N nearest neighbors: the sum of the second differences of the data in all directions must be zero. Since very few molecules have 4N neighbors with known data, the test becomes: the sum of the averages of the second differences must be zero. The validity of these tests is explored. For radii of main-group atoms, and for internuclear separations of their diatomic combinations, the averages are different from zero and the sums of the averages are zero to within one if second-nearest neighbors are used. Dissociation potentials pass the tests but with larger scatter. Predictions for dissociation potentials, using iterative interpolation within boundaries on which there are known data, are reviewed.