Decomposition algorithms for locating minimal cuts in a network

This paper provides decomposition algorithms for locating minimal cuts in a large directed network. The main theorem provides several cases for the algorithms. In the worst case, it is shown that the efficiency of one of the proposed algorithms is of the same order as a no-decomposition algorithm. As in linear programming, the obvious advantage of the proposed decomposition procedure is its ability to potentially handle larger problems than a no-decomposition algorithm.     

The inverse problem of stationary covariance generation

The paper considers the problem of passing from a stationary covariance, or spectral matrix, associated with the output of a constant linear finite-dimensional system excited by white noise to the set of all possible systems of minimum possible dimension which will generate this covariance. The problem, originally posed by R. E. Kalman in 1965, is solved by identifying each possible system with the solution of a quadratic matrix inequality; an algorithm for the solution of the inequality is also presented.Work supported by the Australian Research Grants Committee. University of New castle Technical Report EE-6816.     

A Flaw in the Use of Minimal Defining Sets for Secret Sharing Schemes

It is shown that in some cases it is possible to reconstruct a block design uniquely from incomplete knowledge of a minimal defining set for . This surprising result has implications for the use of minimal defining sets in secret sharing schemes.     

大偏差定理与初值敏感性

本文讨论了动力系统的统计性质和动力性质的某些关系.对于紧致度量空间X上的连续自映射f,我们证明了:如果f满足大偏差定理,那么f是初值敏感的当且仅当f不是极小等度连续的.     

光滑轨道的最小周期(周期)

本文考虑动力系统 (dx)/(dt)=f(x),x∈E~n,得出其周期轨道x(t)的最小周期T>0满足: TC≥2π,其中,而且2π是最好的常数。     

A unified theory for coherent systems in reliability part III: Two special cases for multinary systems—binary-type coherence and homogeneous coherence

As shown in a companion-paper,¹ binary and multinary coherent systems can be studied with unified arguments, through monotone binary coherent systems. These are binary coherent systems submitted to some monotone constraint and generalize the classic theory of free binary coherent systems. By considering the unified point of view thus obtained, this paper gives what is perhaps the most suggestive representation for multinary coherent systems, since this extends the definition of binary coherent systems in terms of series-parallel (parallel-series) structures. Then, this paper examines the special case of multinary systems that can be studied directly with the classic theory of free binary coherent systems. It thus enlarges and complements, in a shorter unified manner, the particular cases considered in earlier studies.     

Minimal surfaces with prescribed topological type on a Schwarzian chain inMc3

Similar to the investigations of unstable polygonal minimal surfaces by Courant [1] we introduce here a variational principle for the free boundary problem with prescribed topological type which produces minimal surfaces in Riemannian manifolds with constant curvature. For special boundary configurations the surfaces have no branch points. The approach can be applied to numerical algorithms since it is constructive.     

An Approach to the Subproblem of the Cutting Angle Method of Global Optimization

The solution of the Subproblem of the Cutting Angle Method of Global Optimization for problems of minimizing increasing positively homogeneous of degree one functions is proved to be NP-Complete. For the proof of this fact we formulate another problem which we call “Dominating Subset with Minimal Weight”. This problem is also NP-Complete. An O(n²)-time algorithm is presented for approximate solution of Dominant Subset with Minimal Weight Problem. This problem can be expressed as a kind of Assignment Problem in which it is allowed to assign multiple tasks to a single processor. Experimental analysis of the algorithm is performed using the program implemented in ANSI-C. The results of the analysis show the efficiency of the proposed algorithm.Mathematics Subject Classification (2000): 65K05, 90C27, 68Q25     

Concentration of area in half-planes

For the standard class of normalized univalent functions analytic in the unit disk , we consider a problem on the minimal area of the image concentrated in any given half-plane. This question is related to a well-known problem posed by A. W. Goodman in 1949 that regards minimizing area covered by analytic univalent functions under certain geometric constraints. An interesting aspect of this problem is the unexpected behavior of the candidates for extremal functions constructed via geometric considerations.

     

On the Krein and Friedrichs extensions of a positive Jacobi operator

We show that for a positive linear operator acting in ℓ² and defined from

a_nx_n+1+b_nx_n+a_n-1x_n-1