Investigation of a new GRASP-based clustering algorithm applied to biological data

A large amount of biological data has been produced in the last years. Important knowledge can be extracted from these data by the use of data analysis techniques. Clustering plays an important role in data analysis, by organizing similar objects from a dataset into meaningful groups. Several clustering algorithms have been proposed in the literature. However, each algorithm has its bias, being more adequate for particular datasets. This paper presents a mathematical formulation to support the creation of consistent clusters for biological data. Moreover. it shows a clustering algorithm to solve this formulation that uses GRASP (Greedy Randomized Adaptive Search Procedure). We compared the proposed algorithm with three known other algorithms. The proposed algorithm presented the best clustering results confirmed statistically. (C) 2009 Elsevier Ltd. All rights reserved.

Distinguishing links up to link-homotopy by algebraic methods

In this paper we provide a complete algebraic invariant of link-homotopy, that is, an algebraic invariant that distinguishes two links if and only if they are link-homotopic. The paper establishes a connection between the ""peripheral structures"" approach to link-homotopy taken by Milnor, Levine and others, and the string link action approach taken by Habegger and Lin. (C) 2009 Elsevier B.V. All rights reserved.

GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem

This paper addresses the independent multi-plant, multi-period, and multi-item capacitated lot sizing problem where transfers between the plants are allowed. This is an NP-hard combinatorial optimization problem and few solution methods have been proposed to solve it. We develop a GRASP (Greedy Randomized Adaptive Search Procedure) heuristic as well as a path-relinking intensification procedure to find cost-effective solutions for this problem. In addition, the proposed heuristics is used to solve some instances of the capacitated lot sizing problem with parallel machines. The results of the computational tests show that the proposed heuristics outperform other heuristics previously described in the literature. The results are confirmed by statistical tests. (C) 2009 Elsevier B.V. All rights reserved.

Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints

This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method which obtains good approximations in short computational times is proposed. This initial solution is then improved by means of a destroy-and-repair method or a tabu search algorithm. Computational results compare the three methods in terms of accuracy and speed. (C) 2007 Elsevier B.V. All rights reserved.

Comparing finite state machine test coverage criteria

To plan testing activities, testers face the challenge of determining a strategy, including a test coverage criterion that offers an acceptable compromise between the available resources and test goals. Known theoretical properties of coverage criteria do not always help and, thus, empirical data are needed. The results of an experimental evaluation of several coverage criteria for finite state machines (FSMs) are presented, namely, state and transition coverage; initialisation fault and transition fault coverage. The first two criteria focus on FSM structure, whereas the other two on potential faults in FSM implementations. The authors elaborate a comparison approach that includes random generation of FSM, construction of an adequate test suite and test minimisation for each criterion to ensure that tests are obtained in a uniform way. The last step uses an improved greedy algorithm.

Evolutionary model trees for handling continuous classes in machine learning

Model trees are a particular case of decision trees employed to solve regression problems. They have the advantage of presenting an interpretable output, helping the end-user to get more confidence in the prediction and providing the basis for the end-user to have new insight about the data, confirming or rejecting hypotheses previously formed. Moreover, model trees present an acceptable level of predictive performance in comparison to most techniques used for solving regression problems. Since generating the optimal model tree is an NP-Complete problem, traditional model tree induction algorithms make use of a greedy top-down divide-and-conquer strategy, which may not converge to the global optimal solution. In this paper, we propose a novel algorithm based on the use of the evolutionary algorithms paradigm as an alternate heuristic to generate model trees in order to improve the convergence to globally near-optimal solutions. We call our new approach evolutionary model tree induction (E-Motion). We test its predictive performance using public UCI data sets, and we compare the results to traditional greedy regression/model trees induction algorithms, as well as to other evolutionary approaches. Results show that our method presents a good trade-off between predictive performance and model comprehensibility, which may be crucial in many machine learning applications. (C) 2010 Elsevier Inc. All rights reserved.

Liquid crystalline cellulosic elastomers: free standing anisotropic films under stretching

The structure and local ordering of 1,6-hexamethylenediisocyanate-(acetoxypropy1) cellulose (HDI-APC) liquid crystalline elastomer thin films are investigated by using X-ray diffraction and scattering techniques. Optical microscopy and mechanical essays are performed to complement the investigation. The study is performed in films subjected or not to an uniaxial stress. Our results indicate that the film is constituted by a bundle of helicoidal fiber-like structure, where the cellobiose block spins around the axis of the fiber, like a string-structure in a smectic-like packing, with the pitch defined by a smectic-like layer. The fibers are in average perpendicular to the smectic-like planes. Without the stretch, these bundles are warped, only with a residual orientation along the casting direction. The stretch orients the bundles along it, increasing the smectic-like and the nematic-like ordering of the fibers. Under stress, the network of molecules which connects the cellobiose blocs and forms the cellulosic matrix tends to organize their links in a hexagonal-like structure with lattice parameter commensurate to the smectic-like structure.

Pulsating strings in Lunin-Maldacena backgrounds

We consider pulsating strings in Lunin-Maldacena backgrounds, specifically in deformed Minkowski spacetime and deformed AdS(5) x S(5). We find the relation between the energy and the oscillation number of the pulsating string when the deformation is small. Since the oscillation number is an adiabatic invariant it can be used to explore the regime of highly excited string states. We then quantize the string and look for such a sector. For the deformed Minkowski background we find a precise match with the classical results if the oscillation number is quantized as an even number. For the deformed AdS(5) x S(5) we find a contribution which depends on the deformation parameter.

Notes on beta-deformations of the pure spinor superstring in AdS(5) x S(5)

We study the properties of the vertex operator for the beta-deformation of the superstring in AdS(5) x S(5) in the pure spinor formalism. We discuss the action of supersymmetry on the infinitesimal beta-deformation, the application of the homological perturbation theory, and the relation between the worldsheet description and the spacetime supergravity description. (C) 2011 Elsevier B.V. All rights reserved.

Quantum current algebra for the AdS(5) x S(5) superstring

The sigma model describing the dynamics of the superstring in the AdS(5) x S(5) background can be constructed using the coset PSU(2, 2 vertical bar 4)/SO(4, 1) x SO(5). A basic set of operators in this two dimensional conformal field theory is composed by the left invariant currents. Since these currents are not (anti) holomorphic, their OPE`s is not determined by symmetry principles and its computation should be performed perturbatively. Using the pure spinor sigma model for this background, we compute the one-loop correction to these OPE`s. We also compute the OPE`s of the left invariant currents with the energy momentum tensor at tree level and one loop.

Conservation laws and tachyon potentials in the sliver frame

Conservation laws have provided an elegant and efficient tool to evaluate the open string field theory interaction vertex, they have been originally implemented in the case where the string field is expanded in the Virasoro basis. In this work we derive conservation laws in the case where the string field is expanded in the so-called sliver L(0)-basis. As an application of this new set of conservation laws, we compute the open string field action relevant to the tachyon condensation and in order to present not only an illustration but also an additional information, we evaluate the action without imposing a gauge choice.

On the generalized eigenvalue method for energies and matrix elements in lattice field theory

We discuss the generalized eigenvalue problem for computing energies and matrix elements in lattice gauge theory, including effective theories such as HQET. It is analyzed how the extracted effective energies and matrix elements converge when the time separations are made large. This suggests a particularly efficient application of the method for which we can prove that corrections vanish asymptotically as exp(-(E(N+1) - E(n))t). The gap E(N+1) - E(n) can be made large by increasing the number N of interpolating fields in the correlation matrix. We also show how excited state matrix elements can be extracted such that contaminations from all other states disappear exponentially in time. As a demonstration we present numerical results for the extraction of ground state and excited B-meson masses and decay constants in static approximation and to order 1/m(b) in HQET.

An all-substrings common subsequence algorithm

Given two strings A and B of lengths n(a) and n(b), n(a) <= n(b), respectively, the all-substrings longest common subsequence (ALCS) problem obtains, for every substring B` of B, the length of the longest string that is a subsequence of both A and B. The ALCS problem has many applications, such as finding approximate tandem repeats in strings, solving the circular alignment of two strings and finding the alignment of one string with several others that have a common substring. We present an algorithm to prepare the basic data structure for ALCS queries that takes O(n(a)n(b)) time and O(n(a) + n(b)) space. After this preparation, it is possible to build that allows any LCS length to be retrieved in constant time. Some trade-offs between the space required and a matrix of size O(n(b)(2)) the querying time are discussed. To our knowledge, this is the first algorithm in the literature for the ALCS problem. (C) 2007 Elsevier B.V. All rights reserved.

THE LOWER CENTRAL AND DERIVED SERIES OF THE BRAID GROUPS OF THE FINITELY-PUNCTURED SPHERE

Motivated in part by the study of Fadell-Neuwirth short exact sequences, we determine the lower central and derived series for the braid groups of the finitely-punctured sphere. For n >= 1, the class of m-string braid groups B(m)(S(2)\{x(1), ... , x(n)}) of the n-punctured sphere includes the usual Artin braid groups B(m) (for n = 1), those of the annulus, which are Artin groups of type B (for n = 2), and affine Artin groups of type (C) over tilde (for n = 3). We first consider the case n = 1. Motivated by the study of almost periodic solutions of algebraic equations with almost periodic coefficients, Gorin and Lin calculated the commutator subgroup of the Artin braid groups. We extend their results, and show that the lower central series (respectively, derived series) of B(m) is completely determined for all m is an element of N (respectively, for all m not equal 4). In the exceptional case m = 4, we obtain some higher elements of the derived series and its quotients. When n >= 2, we prove that the lower central series (respectively, derived series) of B(m)(S(2)\{x(1), ... , x(n)}) is constant from the commutator subgroup onwards for all m >= 3 (respectively, m >= 5). The case m = 1 is that of the free group of rank n - 1. The case n = 2 is of particular interest notably when m = 2 also. In this case, the commutator subgroup is a free group of infinite rank. We then go on to show that B(2)(S(2)\{x(1), x(2)}) admits various interpretations, as the Baumslag-Solitar group BS(2, 2), or as a one-relator group with non-trivial centre for example. We conclude from this latter fact that B(2)(S(2)\{x(1), x(2)}) is residually nilpotent, and that from the commutator subgroup onwards, its lower central series coincides with that of the free product Z(2) * Z. Further, its lower central series quotients Gamma(i)/Gamma(i+1) are direct sums of copies of Z(2), the number of summands being determined explicitly. In the case m >= 3 and n = 2, we obtain a presentation of the derived subgroup, from which we deduce its Abelianization. Finally, in the case n = 3, we obtain partial results for the derived series, and we prove that the lower central series quotients Gamma(i)/Gamma(i+1) are 2-elementary finitely-generated groups.

The lower central and derived series of the braid groups of the projective plane

In this paper, we determine the lower central and derived series for the braid groups of the projective plane. We are motivated in part by the study of Fadell-Neuwirth short exact sequences, but the problem is interesting in its own right. The n-string braid groups B(n)(RP(2)) of the projective plane RP(2) were originally studied by Van Buskirk during the 1960s. and are of particular interest due to the fact that they have torsion. The group B(1)(RP(2)) (resp. B(2)(RP(2))) is isomorphic to the cyclic group Z(2) of order 2 (resp. the generalised quaternion group of order 16) and hence their lower central and derived series are known. If n > 2, we first prove that the lower central series of B(n)(RP(2)) is constant from the commutator subgroup onwards. We observe that Gamma(2)(B(3)(RP(2))) is isomorphic to (F(3) X Q(8)) X Z(3), where F(k) denotes the free group of rank k, and Q(8) denotes the quaternion group of order 8, and that Gamma(2)(B(4)(RP(2))) is an extension of an index 2 subgroup K of P(4)(RP(2)) by Z(2) circle plus Z(2). As for the derived series of B(n)(RP(2)), we show that for all n >= 5, it is constant from the derived subgroup onwards. The group B(n)(RP(2)) being finite and soluble for n <= 2, the critical cases are n = 3, 4. We are able to determine completely the derived series of B(3)(RP(2)). The subgroups (B(3)(RP(2)))((1)), (B(3)(RP(2)))((2)) and (B(3)(RP(2)))((3)) are isomorphic respectively to (F(3) x Q(8)) x Z(3), F(3) X Q(8) and F(9) X Z(2), and we compute the derived series quotients of these groups. From (B(3)(RP(2)))((4)) onwards, the derived series of B(3)(RP(2)), as well as its successive derived series quotients, coincide with those of F(9). We analyse the derived series of B(4)(RP(2)) and its quotients up to (B(4)(RP(2)))((4)), and we show that (B(4)(RP(2)))((4)) is a semi-direct product of F(129) by F(17). Finally, we give a presentation of Gamma(2)(B(n)(RP(2))). (C) 2011 Elsevier Inc. All rights reserved.