Unconstrained and constrained global optimization of polynomial functions in one variable

In Floudas and Visweswaran (1990), a new global optimization algorithm (GOP) was proposed for solving constrained nonconvex problems involving quadratic and polynomial functions in the objective function and/or constraints. In this paper, the application of this algorithm to the special case of polynomial functions of one variable is discussed. The special nature of polynomial functions enables considerable simplification of the GOP algorithm. The primal problem is shown to reduce to a simple function evaluation, while the relaxed dual problem is equivalent to the simultaneous solution of two linear equations in two variables. In addition, the one-to-one correspondence between the x and y variables in the problem enables the iterative improvement of the bounds used in the relaxed dual problem. The simplified approach is illustrated through a simple example that shows the significant improvement in the underestimating function obtained from the application of the modified algorithm. The application of the algorithm to several unconstrained and constrained polynomial function problems is demonstrated.     

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.     

PERIODIC SOLUTIONS OF PLANAR SYSTEM WITH SIX DELAYS

In this paper we obtain some sufficient conditions for the existence of non-constant periodic solutions of the following planar system with six delaysOur approach is based on the continuation theorem of the coincidence degree.     

Iterated monoidal categories

We develop a notion of an n-fold monoidal category and show that it corresponds in a precise way to the notion of an n-fold loop space. Specifically, the group completion of the nerve of such a category is an n-fold loop space, and free n-fold monoidal categories give rise to a finite simplicial operad of the same homotopy type as the classical little cubes operad used to parametrize the higher H-space structure of an n-fold loop space. We also show directly that this operad has the same homotopy type as the n-th Smith filtration of the Barratt-Eccles operad and the n-th filtration of Berger's complete graph operad. Moreover, this operad contains an equivalent preoperad which gives rise to Milgram's small model for when n=2 and is very closely related to Milgram's model of for n>2.     

The use of high-frequency filters in the investigation of the coloured-random-noise properties of cosmic-ray data

Summary This paper investigates the influence of high-frequency filtering the background white noise on the determination of the coloured-random-noise properties of cosmic-ray experimental signals. We consider fractal methods (Grassberger-Procaccia method, scaling exponent method and fractal length method) and statistical methods (comparison with the Gaussian curve, and the multivariate scaling-analysis technique). The investigation is carried out using two experimental time series with differentcolour (spectral indices α=1.6 and α=1.2) and their computer simulations of pure noise-freecoloured-random-noise signals. The results of the investigation is that the use of high-frequency filtering allows the algorithms employed in the various analyses to see the physical characteristics of the particular data set; the procedure should be reserved, however, to researchers with a good experience in the methods of fractal analysis so that they can identify and discard the artifacts introduced by the truncation applied to the power spectrum.     

Initial Segments in Rogers Semilattices of \Sigma _n^0 -Computable Numberings

S. Goncharov and S. Badaev showed that for , there exist infinite families whose Rogers semilattices contain ideals without minimal elements. In this connection, the question was posed as to whether there are examples of families that lack this property. We answer this question in the negative. It is proved that independently of a family chosen, the class of semilattices that are principal ideals of the Rogers semilattice of that family is rather wide: it includes both a factor lattice of the lattice of recursively enumerable sets modulo finite sets and a family of initial segments in the semilattice of -degrees generated by immune sets.     

Super-measures and finitely defined topological measures

We introduce a class of set-functions on the set of natural numbers, which are called super-measures. Super-measures are then utilized to characterize a certain class of topological measures (previously called quasi-measures, see below) which arises naturally. The members of this class of topological measures are called finitely defined, and are shown to be dense in the set of all topological measures. This revised version was published online in June 2006 with corrections to the Cover Date.     

Metric and Complete Metric σ-Frames

A -frame is a lattice in which countable joins exist and binary meets distribute over countable joins. In this paper, the category MFrm, of metric -frames, is introduced, and it is shown to be equivalent to the category MLFrm _u, of metric Lindelöf frames.Finally, it is shown that the complete metric -frames are exactly the cozero parts of complete metric Lindelöf frames.     

A Generalization of the Hilbert Basis Theorem

A generalization of the Hilbert basis theorem in the geometric setting is proposed. It asserts that, for any well-describable (in a certain sense) family of polynomials, there exists a number C such that if P is an everywhere dense (in a certain sense) subfamily of this family, a is an arbitrary point, and the first C polynomials in any sequence from P vanish at the point a, then all polynomials from P vanish at a.     

On the Pesin set of expansive geodesic flows in manifolds with no conjugate points

In this paper, we show that the Pesin set of an expansive geodesic flow in compact manifold with no conjugate points and bounded asymptote coincides a.e with an open and dense set of the unit tangent bundle. We also show that the set of hyperbolic periodic orbits is dense in the unit tangent bundle.