Connectivity interdiction

We consider the problem of maximally decreasing the edge-connectivity of an edge-weighted graph by removing a limited set of edges. This problem, which we term connectivity interdiction, falls into a large family of so-called interdiction problems, which have been considered in a variety of contexts. Whereas little is known about the approximability of most interdiction problems, we show that connectivity interdiction admits a PTAS, and a natural special case of it can even be solved efficiently.     

Thermomechanical formulation of ductile damage coupled to nonlinear isotropic hardening and multiplicative viscoplasticity

In this paper, we present a thermomechanical framework which makes use of the internal variable theory of thermodynamics for damage-coupled finite viscoplasticity with nonlinear isotropic hardening. Damage evolution, being an irreversible process, generates heat. In addition to its direct effect on material's strength and stiffness, it causes deterioration of the heat conduction. The formulation, following the footsteps of Simó and Miehe (1992), introduces inelastic entropy as an additional state variable. Given a temperature dependent damage dissipation potential, we show that the evolution of inelastic entropy assumes a split form relating to plastic and damage parts, respectively. The solution of the thermomechanical problem is based on the so-called isothermal split. This allows the use of the model in 2D and 3D example problems involving geometrical imperfection triggered necking in an axisymmetric bar and thermally triggered necking of a 3D rectangular bar.     

Combined Path and Maximum Empty Static Routing Algorithms with Wavelength Assignment for Future Transport Networks

Abstract

In this article, two static routing algorithms have been proposed and compared to some of the existing algorithms on the basis of blocking probability. The two proposed static routing and wavelength assignment algorithms reduce the blocking probability to maximize the utilization of the network. All of these algorithms are analyzed and compared with four wavelength assignment schemes, which are first-fit, random, most used, and least used. It is shown that our proposed static algorithms give the best performance for first-fit wavelength assignment and most used wavelength assignment strategies with reduced complexity. For least used wavelength assignment and random wavelength assignment, 1 fixed and 2 alternate routing algorithm gives the lowest blocking probability.     

Computation and conversion of brain pH values obtained with two algorithms of phosphorus magnetic resonance spectroscopy data analysis

The intracellular brain pH in phosphorus magnetic resonance spectroscopy is calculated using the chemical shift between the inorganic phosphate and phosphocreatine with the Henderson–Hasselbalch equations. Researchers use various mathematical formulas that have different parameters and get various results for the same input data as a consequence. Thus, the aim of this article was to determine the mathematical formulas that allow the conversion of the pH values obtained by the most popular analysis methods to each other. To determine the relationships between pH results and the applied mathematical formula, the pH values were calculated using two algorithms for the theoretical chemical shift values. The pH results were compared with each other using the appropriate t-tests. Mathematical formulas were designed to simplify the conversion of pH values obtained by two data analysis methods to each other. The pH values with were obtained this way did not differ significantly from the pH values calculated directly from the given formula. The computed mathematical formulas will make it possible to simplify pH conversions without knowing the chemical shift between inorganic phosphate and phosphocreatine but only basing on the final pH values obtained by one of the formulas.     

Locally Optimized Crossover for the Traveling Umpire Problem

This paper presents a genetic algorithm (GA) to solve the Traveling Umpire Problem, which is a recently introduced sports scheduling problem that is based on the most important features of the real Major League Baseball umpire scheduling problem. In our GA, contrary to the traditional way of randomly obtaining new solutions from parent solutions, we obtain partially optimized solutions with a Locally Optimized Crossover operator. This operator also presents a link between the evolutionary mechanism on a population of solutions and the local search on a single solution. We present improved results over other methods on benchmark instances.     

Clique-cutsets beyond chordal graphs

Truemper configurations (thetas, pyramids, prisms, and wheels) have played an important role in the study of complex hereditary graph classes (eg, the class of perfect graphs and the class of even-hole-free graphs), appearing both as excluded configurations, and as configurations around which graphs can be decomposed. In this paper, we study the structure of graphs that contain (as induced subgraphs) no Truemper configurations other than (possibly) universal wheels and twin wheels. We also study several subclasses of this class. We use our structural results to analyze the complexity of the recognition, maximum weight clique, maximum weight stable set, and optimal vertex coloring problems for these classes. Furthermore, we obtain polynomial -bounding functions for these classes.     

Diseño automático de tableros óptimos de puentes de carretera de vigas artesa prefabricadas mediante algoritmos meméticos híbridos

This paper deals with the minimum cost automatic design of precast bridge decks made of U-beams and an upper slab. It uses a hybrid memetic algorithm that combines the population search of solutions by genetic algorithms and a search by variable neighborhood. This algorithm is applied to a bridge made of two isostatic U-beams of 20-40 m of span and a width of 12 m. This example has 40 discrete variables. The evaluation module takes into account the service and ultimate limit states usually considered for these structures, i.e. flexure, shear, torsion, cracking, deflections, etc. The use of the memetic algorithm requires its previous calibration. Each of the heuristics is run 12 times, obtaining information about the minimum and average values, as well as the scatter. The parametric study showed a good correlation for the cost, the number of strands and the steel and concrete quantities with the span length. Savings have been found between 8 and 50% compared to other structures really executed. The presented procedure allows the practical application to the real design and its adaptation to the precast process.     

Characterizing and Generating Bivariate Empirical Rank Distributions Satisfying Certain Positive Dependence Concepts

Abstract

This article introduces an approach for characterizing the classes of empirical distributions that satisfy certain positive dependence notions. Mathematically, this can be expressed as studying certain subsets of the class S_N of permutations of 1, …, N, where each subset corresponds to some positive dependence notions. Explicit techniques for it-eratively characterizing subsets of S_N that satisfy certain positive dependence concepts are obtained and various counting formulas are given. Based on these techniques, graph-theoretic methods are used to introduce new and more efficient algorithms for constructively generating and enumerating the elements of various of these subsets of S_N. For example, the class of positively quadrant dependent permutations in S_N is characterized in this fashion.