The interaction of luminescent dinuclear ruthenium(II) complexes containing the bridging ligand tetrapyrido[3,2-a:2',3'-c:3'',2''-h:2'',3''-j]phenazine with several intramolecular and intermolecular quadruplex DNA structures has been explored. It was found that these interactions produced distinctly different luminescence signatures. Binding curves constructed from these optical changes reveal ...

In this note we address the problem of graph isomorphism by means of eigenvalue spectra of different matrix representations: the neighborhood matrix M̂ , its corresponding signless Laplacian QM̂ , and the set of higher order adjacency matrices M`s. We find that, in relation to graphs with at most 10 vertices, QM̂ leads to better results than the signless Laplacian Q; besides, when combined with M̂ ...

We show that finding a global optimal solution for the regularized Lq-minimization problem (q ≥ 1) is strongly NP-hard if the penalty function is concave but not linear in a neighborhood of zero and satisfies a very mild technical condition. This implies that it is impossible to have a fully polynomial-time approximation scheme (FPTAS) for such problems unless P = NP. This result clarifies the ...

Nowadays, offering extended warranty is considered as a lucrative source of income from the perspective of the after-sale service providers. Meanwhile, the main concern is presence or absence of base warranty and strategies adopted by the manufacturer during this period. Moreover, extended warranty structure must be responsive and customer oriented, which not only control the services cost but ...

We develop two algorithms to perform the q step shrinking and expanding of an N×N binary image on a pyramid computer with an N×N base. The time complexity of both algorithms is O(√ q ). However, one uses O(√ q ) space per processor while the per processor space requirement of the other is O (1).

The second-order cone programming problem is reformulated into several new systems of nonlinear equations. Assume the perturbation of the data is in a certain neighborhood of zero. Then starting from a solution to the old problem, the semismooth Newton’s iterates converge Q-quadratically to a solution of the perturbed problem. The algorithm is globalized. Numerical examples show that the algori...

Q-learning as well as other learning paradigms depend strongly on the representation of the underlying state space. As a special case of the hidden state problem we investigate the e ect of a self-organizing discretization of the state space in a simple control problem. We apply the neural gas algorithm with adaptation of learning rate and neighborhood range to a simulated cart-pole problem. Th...

Let X be a complex space and f : X → I R a real valued function. Then f is said to be q-convex if for any x ∈ X there exist a neighborhood U which is biholomorphic to a closed analytic set in an open set Ω ⊂ I C and a function g ∈ C(Ω) such that i∂∂g has at most q − 1 zero or negative eigenvalues at each point of Ω and f |U = g|U . The space X is called q-complete if there exists an exhaustion ...

We are presenting in this volume selected, peer-reviewed, short papers that were presented at the 3rd International Conference on Variable Neighborhood Search (VNS’14) which took place in Djerba, Tunisia, during October 8-11, 2014.

Available online 31 July 2008