In this paper, we obtain the upper exponential bounds for the tail probabilities of the quadratic forms for negatively dependent subgaussian random variables. In particular the law of iterated logarithm for quadratic forms of independent subgaussian random variables is generalized to the case of negatively dependent subgaussian random variables.

Iterated local search is a stochastic local search (SLS) method that combines a perturbation step with an embedded local search algorithm. In this article, we propose a new way of hybridizing iterated local search. It consists in using an iterated local search as the embedded local search algorithm inside another iterated local search. This nesting of local searches and iterated local searches ...

In this paper, we investigated the scheduling issue of the vessel’s uploading data to the infostations through the maritime communication network, to optimize the dispatching process by Dynamic Programming. We mapped it as a single-machine minimized total weighted tardiness scheduling problem, subjecting to intermittent network connections in communication, packet generation and due time limita...

Iterated clique graphs arise when the clique operator is applied to a graph more than once. Determining whether a graph is a clique graph or an iterated clique graph is usually a difficult task. The fact that being a clique graph and being an iterated clique graph are not equivalent things has been proved recently. However, it is still unknown whether the classes of second iterated clique graph...

Images are created using probabilistic iterated function systems that involve both affine transformations of the plane and isometries of hyperbolic geometry. Figures of attractors with striking hyperbolic symmetry are the result.

This paper contains four main results associated with an attractor of a projective iterated function system (IFS). The first theorem characterizes when a projective IFS has an attractor which avoids a hyperplane. The second theorem establishes that a projective IFS has at most one attractor. In the third theorem the classical duality between points and hyperplanes in projective space leads to c...

This paper contains four main results associated with an attractor of a projective iterated function system (IFS). The first theorem characterizes when a projective IFS has an attractor which avoids a hyperplane. The second theorem establishes that a projective IFS has at most one attractor. In the third theorem the classical duality between points and hyperplanes in projective space leads to c...