MODELING THE EVOLUTION OF COMPLEX NETWORKS THROUGH THE PATH-STAR TRANSFORMATION AND OPTIMAL MULTIVARIATE METHODS

The topology of real-world complex networks, such as in transportation and communication, is always changing with time. Such changes can arise not only as a natural consequence of their growth, but also due to major modi. cations in their intrinsic organization. For instance, the network of transportation routes between cities and towns ( hence locations) of a given country undergo a major change with the progressive implementation of commercial air transportation. While the locations could be originally interconnected through highways ( paths, giving rise to geographical networks), transportation between those sites progressively shifted or was complemented by air transportation, with scale free characteristics. In the present work we introduce the path-star transformation ( in its uniform and preferential versions) as a means to model such network transformations where paths give rise to stars of connectivity. It is also shown, through optimal multivariate statistical methods (i.e. canonical projections and maximum likelihood classification) that while the US highways network adheres closely to a geographical network model, its path-star transformation yields a network whose topological properties closely resembles those of the respective airport transportation network.

EQUIVARIANT PATH FIELDS ON TOPOLOGICAL MANIFOLDS

A classical theorem of H. Hopf asserts that a closed connected smooth manifold admits a nowhere vanishing vector field if and only if its Euler characteristic is zero. R. Brown generalized Hopf`s result to topological manifolds, replacing vector fields with path fields. In this note, we give an equivariant analog of Brown`s theorem for locally smooth G-manifolds where G is a finite group.

Myeloperoxidase activity is increased in gingival crevicular fluid and whole saliva after fixed orthodontic appliance activation

Introduction: Orthodontic tooth movement uses mechanical forces that result in inflammation in the first days. Myeloperoxidase (MPO) is an enzyme found in polymorphonuclear neutrophil (PMN) granules, and it is used to estimate the number of PMN granules in tissues. So far, MPO has not been used to study the inflammatory alterations after the application of orthodontic tooth movement forces. The aim of this study was to determine MPO activity in the gingival crevicular fluid (GCF) and saliva (whole stimulated saliva) of orthodontic patients at different time points after fixed appliance activation. Methods: MPO was determined in the GCF and collected by means of periopaper from the saliva of 14 patients with orthodontic fixed appliances. GCF and saliva samples were collected at baseline, 2 hours, and 7 and 14 days after application of the orthodontic force. Results: Mean MPO activity was increased in both the GCF and saliva of orthodontic patients at 2 hours after appliance activation (P<0.02 for all comparisons). At 2 hours, PMN infiltration into the periodontal ligament from the orthodontic force probably results in the increased MPO level observed at this time point. Conclusions: MPO might be a good marker to assess inflammation in orthodontic movement; it deserves further studies in orthodontic therapy. (Am J Orthod Dentofacial Orthop 2010;138:613-6)

The constrained compartmentalized knapsack problem: mathematical models and solution methods

The constrained compartmentalized knapsack problem can be seen as an extension of the constrained knapsack problem. However, the items are grouped into different classes so that the overall knapsack has to be divided into compartments, and each compartment is loaded with items from the same class. Moreover, building a compartment incurs a fixed cost and a fixed loss of the capacity in the original knapsack, and the compartments are lower and upper bounded. The objective is to maximize the total value of the items loaded in the overall knapsack minus the cost of the compartments. This problem has been formulated as an integer non-linear program, and in this paper, we reformulate the non-linear model as an integer linear master problem with a large number of variables. Some heuristics based on the solution of the restricted master problem are investigated. A new and more compact integer linear model is also presented, which can be solved by a branch-and-bound commercial solver that found most of the optimal solutions for the constrained compartmentalized knapsack problem. On the other hand, heuristics provide good solutions with low computational effort. (C) 2011 Elsevier BM. 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.

ABELIANIZED OBSTRUCTION FOR FIXED POINTS OF FIBER-PRESERVING MAPS OF SURFACE BUNDLES

Let f: M -> M be a fiber-preserving map where S -> M -> B is a bundle and S is a closed surface. We study the abelianized obstruction, which is a cohomology class in dimension 2, to deform f to a fixed point free map by a fiber-preserving homotopy. The vanishing of this obstruction is only a necessary condition in order to have such deformation, but in some cases it is sufficient. We describe this obstruction and we prove that the vanishing of this class is equivalent to the existence of solution of a system of equations over a certain group ring with coefficients given by Fox derivatives.

NIELSEN COINCIDENCE THEORY OF FIBRE-PRESERVING MAPS AND DOLD`S FIXED POINT INDEX

Let M -> B, N -> B be fibrations and f(1), f(2): M -> N be a pair of fibre-preserving maps. Using normal bordism techniques we define an invariant which is an obstruction to deforming the pair f(1), f(2) over B to a coincidence free pair of maps. In the special case where the two fibrations axe the same and one of the maps is the identity, a weak version of our omega-invariant turns out to equal Dold`s fixed point index of fibre-preserving maps. The concepts of Reidemeister classes and Nielsen coincidence classes over B are developed. As an illustration we compute e.g. the minimal number of coincidence components for all homotopy classes of maps between S(1)-bundles over S(1) as well as their Nielsen and Reidemeister numbers.