In this paper, a single machine sequencing problem is considered in order to find the sequence of jobs minimizing the sum of the maximum earliness and tardiness with idle times (n/1/I/ETmax). Due to the time complexity function, this sequencing problem belongs to a class of NP-hard ones. Thus, a special design of a simulated annealing (SA) method is applied to solve such a hard problem. To co...

rupture and wrinkling are two prevalent phenomena that happen in hydro-forming process. many efforts have been made to achieve the upper and lower bounds for the pressure related to rupture and wrinkling of sheet, respectively. the aim of this investigation is to improve the upper bound of fluid pressure in hydro-forming process by hemispherical punch. in this article, analytical study of the u...

Sphere-Decoding (SD) methods are branch-and-bound-like techniques used for optimal detection of digital communications signals over in wireless MIMO (Multiple input Multiple Output) channels. These methods look for the optimal solution in a tree of partial solutions; the size of the tree depends on the parameters of the problem (dimension of the channel matrix, cardinality of the alphabet), and...

Most good quantitative analysis begins with data exploration. However, when there are many variables how can one summarise and compare cases in terms of all values? The first two Principal Components are often plotted which can, for example, reveal clusters. However, implementation and interpretation of such a method requires a moderate level of statistical skill and there is no guarantee that ...

The Schrödinger equation is investigated in the Euclidean TaubNUT geometry. The bound states are degenerate and an extra degeneracy is due to the conserved Runge-Lenz vector. The existence of the extra conserved quantities, quadratic in four-velocities implies the possibility of separating variables in two different coordinate systems. The eigenvalues and the eigenvectors are given in both case...

We present a formal method of functional program develop ment based on step by step transformation In their most abstract form speci cations are essentially predicates that relate the result of the speci ed program to the free variables of that pro gram In their most concrete form speci cations are simply programs in a functional programming language Development from abstract speci cations to p...

When we use the Refal machine for computation, we load a program into it, put the expression to evaluate into the view-field, and switch the machine on. The Refal machine works on its own; we do not interfere with its operation. After a while it comes up (or does not come up) with the desired (or not exactly desired) result. Metacomputation is an operation mode of the Refal machine where it is ...

One-dimensional unitary scattering controlled by non-Hermitian (typically, PT -symmetric) quantum Hamiltonians H 6= H is considered. Treating these operators via Runge–Kutta approximation, our three-Hilbert-space formulation of quantum theory is reviewed as explaining the unitarity of scattering. Our recent paper on bound states [Znojil M., SIGMA 5 (2009), 001, 19 pages, arXiv:0901.0700] is com...

In recent years there has been renewed interest in deriving tight bounds on the error performance of specific codes and ensembles, based on their distance spectrum. In this paper, we discuss many reported upper bounds on the maximum likelihood decoding error probability and demonstrate the underlying connections that exist between them. In addressing the Gallager bounds and their variations, we...