A novel approach based on recurrent neural networks applied to nonlinear systems optimization

This paper presents an efficient approach based on recurrent neural network for solving nonlinear optimization. More specifically, a modified Hopfield network is developed and its internal parameters are computed using the valid subspace technique. These parameters guarantee the convergence of the network to the equilibrium points that represent an optimal feasible solution. The main advantage of the developed network is that it treats optimization and constraint terms in different stages with no interference with each other. Moreover, the proposed approach does not require specification of penalty and weighting parameters for its initialization. A study of the modified Hopfield model is also developed to analyze its stability and convergence. Simulation results are provided to demonstrate the performance of the proposed neural network.     

Adjugates in Banach algebras

A simple formula for the adjugate of a block triangle offers an alternative route to the determinant theory for Banach algebras.

     

Fractal strings as an alternative justification for El Naschie''s cantorian spacetime and the fine structure constant

Beginning with the most general fractal strings/sprays construction recently expounded in the book by Lapidus and Frankenhuysen, it is shown how the complexified extension of El Naschie's cantorian-fractal spacetime model belongs to a very special class of families of fractal strings/sprays whose scaling ratios are given by suitable pinary (pinary, p prime) powers of the Golden Mean. We then proceed to show why the logarithmic periodicity laws in Nature are direct physical consequences of the complex dimensions associated with these fractal strings/sprays. We proceed with a discussion on quasi-crystals with p-adic internal symmetries, von Neumann's Continuous Geometry, the role of wild topology in fractal strings/sprays, the Banach-Tarski paradox, tesselations of the hyperbolic plane, quark confinement and the Mersenne-prime hierarchy of bit-string physics in determining the fundamental physical constants in Nature.     

On the spectrum of certain noncommutative harmonic oscillators

Abstract Some spectral properties of certain 2×2 globally elliptic systems of ordinary differential operators, a class of vector-valued deformations of the classical harmonic oscillator here called noncommutative harmonic oscillators, will be described, with special emphasis on the Poisson relation and clustering properties of the eigenvalues. Keywords: Clustering theorems, Periodic trajectories, Poisson relations, Noncommutative harmonic oscillators     

Online weighted flow time and deadline scheduling

In this paper we study some aspects of weighted flow time. We first show that the online algorithm Highest Density First is an O(1)-speed O(1)-approximation algorithm for P|r_i,pmtn|∑w_iF_i. We then consider a related Deadline Scheduling Problem that involves minimizing the weight of the jobs unfinished by some unknown deadline D on a uniprocessor. We show that any c-competitive online algorithm for weighted flow time must also be c-competitive for deadline scheduling. We then give an O(1)-competitive algorithm for deadline scheduling.     

Electrochemical impedance spectroscopy and linear polarization applied to evaluation of porosity of phosphate conversion coatings on electrogalvanized steels

In this work, electrochemical impedance spectroscopy and linear polarization are used in determining porosity of zinc phosphates, and of nickel and manganese modified zinc phosphates on electrogalvanized steel. The porosity of the phosphate layers ranges from 0.1% for the manganese-modified hopeite to 8% for hopeite, using the linear polarization and the electrochemical impedance spectroscopy techniques. The porosity values measured using the two techniques were in agreement. All impedance spectra of coated samples showed two steps, with two capacitive arcs and an inductive looping.     

Packing into the smallest square: Worst-case analysis of lower bounds

We address the problem of packing a given set of rectangles into the minimum size square. We consider three versions of the problem, arising when the rectangles (i) are squares; (ii) have a fixed orientation; (iii) can be rotated by 90. For each case we study lower bounds, and analyze their worst-case performance ratio. In addition, we evaluate through computational experiments their average performance on instances from the literature.     

Using graphs for some discrete tomography problems

Given a rectangular array whose entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each color in every column and in every row. The complexity of this problem is still open when there are just three colors in the image. We study some special cases where the number of occurrences of each color is limited to small values. Formulations in terms of edge coloring in graphs and as timetabling problems are used; complexity results are derived from the model.     

Algebraic models defined over Q of differential manifolds

Here we prove that every compact differential manifold has a smooth algebraic model defined over Q. In dimension 2 we find an algebraic model (may be singular) defined over Q and birational over Q to the projective plane.