A lower bound on the performance of the quadratic discriminant function

The quadratic discriminant function is often used to separate two classes of points in a multidimensional space. When the two classes are normally distributed, this results in the optimum separation. In some cases however, the assumption of normality is a poor one and the classification error is increased. The current paper derives an upper bound for the classification error due to a quadratic decision surface. The bound is strict when the class means and covariances and the quadratic discriminant surface satisfy certain specified symmetry conditions.     

Eigenvalue and stability of singular differential delay systems

The eigenvalue and the stability of singular differential systems with delay are considered. Firstly we investigate some properties of the eigenvalue, then give the exact exponential estimation for the fundamental solution, and finally discuss the necessary and sufficient condition of uniform asymptotic stability.     

Banach空间二阶周期边值问题解的存在性

利用一些比较结果，讨论了Banach空间中二阶周期边值问题解的存在性，获得了若干解的存在性与唯一性结果。     

Periodic solutions of nonlinear impulsive differential inclusions with constraints

In this paper we obtain the existence of periodic solutions for nonlinear ``invariance' problems monitored by impulsive differential inclusions subject to impulse effects.

     

Fermi, Majorana and the Statistical Model of Atoms

We give an account of the appearance and first developments of the statistical model of atoms proposed by Thomas and Fermi, focusing on the main results achieved by Fermi and his group in Rome. Particular attention is addressed to the unknown contribution to this subject by Majorana, anticipating some important results reached later by leading physicists.     

A two-stage parallel branch and bound algorithm for mixed integer programs

Mixed integer programming (MIP) models are extensively usedto aid strategic and tactical decision making in many businesssectors. Solving MIP models is a computationally intensive processand there is a need to develop solution approaches that enablelarger models to be solved within acceptable timeframes. Inthis paper, we describe the implementation of a two-stage parallelbranch and bound (PB & B) algorithm for MIP. In stage 1of the algorithm, a multiple heuristic search is implementedin which a number of alternative search trees are investigatedusing a forest search in the hope of finding a good solutionquickly. In stage 2, the search is reorganized so that the branchesof a chosen tree are investigated in parallel. A new heuristicis introduced, based on a best projection criterion, which evaluatesalternative B & B trees in order to choose one for investigationin stage 2 of the algorithm. The heuristic also serves as away of implementing a quality load balancing scheme for stage2 of the algorithm. The results of experimental investigationsare reported for a range of models taken from the MIPLIB libraryof benchmark problems.     

Inflationary Cosmological Models Without Restrictions on a Scalar Field Potential

A new strategy of exact solutions construction in inflationary cosmology within the self-interacting scalar field theory is proposed. It is shown that inflationary models have no restrictions dictated by the slow-roll approximation on the self-interacting potential. The suggested approach makes it possible to compute precisely the e-folds numbers in inflationary scenarios. The scalar field with a logarithmic evolution in time is analyzed in details. Other possible types of scalar field evolution are discussed.     

带有单模糊映射的一般变分不等式解的存在性

众所周知，在各种变分不等式问题中，解的存在性是最基础也是最重要的问题之一．本文的目的是在Hilbert空间中研究带有单模糊映射的一般变分不等式解的存在性．此外，还讨论了几种特殊情况．     

Randomization helps to perform independent tasks reliably

This paper is about algorithms that schedule tasks to be performed in a distributed failure‐prone environment, when processors communicate by message‐passing, and when tasks are independent and of unit length. The processors work under synchrony and may fail by crashing. Failure patterns are imposed by adversaries. Linearly‐bounded adversaries may fail up to a constant fraction of the processors. Weakly‐adaptive adversaries have to select, prior to the start of an execution, a subset of processors to be failure‐prone, and then may fail only the selected processors, at arbitrary steps, in the course of the execution. Strongly adaptive adversaries have a total number of failures as the only restriction on failure patterns. The measures of complexity are work, measured as the available processor steps, and communication, measured as the number of point‐to‐point messages. A randomized algorithm is developed, that attains both ??(n log*n) expected work and ??(n log*n) expected communication, against weakly‐adaptive linearly‐bounded adversaries, in the case when the numbers of tasks and processors are both equal to n. This is in contrast with performance of algorithms against strongly‐adaptive linearly‐bounded adversaries, which has to be Ω(n log n/log log n) in terms of work. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2004     

Practical algorithms for transposition-invariant string-matching

We consider the problems of (1) longest common subsequence (LCS) of two given strings in the case where the first may be shifted by some constant (that is, transposed) to match the second, and (2) transposition-invariant text searching using indel distance. These problems have applications in music comparison and retrieval. We introduce two novel techniques to solve these problems efficiently. The first is based on the branch and bound method, the second on bit-parallelism. Our branch and bound algorithm computes the longest common transposition-invariant subsequence (LCTS) in time O((m²+loglogσ)logσ) in the best case and O((m²+logσ)σ) in the worst case, where m and σ, respectively, are the length of the strings and the size of the alphabet. On the other hand, we show that the same problem can be solved by using bit-parallelism and thus obtain a speedup of O(w/logm) over the classical algorithms, where the computer word has w bits. The advantage of this latter algorithm over the present bit-parallel ones is that it allows the use of more complex distances, including general integer weights. Since our branch and bound method is very flexible, it can be further improved by combining it with other efficient algorithms such as our novel bit-parallel algorithm. We experiment on several combination possibilities and discuss which are the best settings for each of those combinations. Our algorithms are easily extended to other musically relevant cases, such as δ-matching and polyphony (where there are several parallel texts to be considered). We also show how our bit-parallel algorithm is adapted to text searching and illustrate its effectiveness in complex cases where the only known competing method is the use of brute force.