Algorithms for network piecewise-linear programs: A comparative study

Piecewise-Linear Programming (PLP) is an important area of Mathematical Programming and concerns the minimisation of a convex separable piecewise-linear objective function, subject to linear constraints. In this paper a subarea of PLP called Network Piecewise-Linear Programming (NPLP) is explored. The paper presents four specialised algorithms for NPLP: (Strongly Feasible) Primal Simplex, Dual Method, Out-of-Kilter and (Strongly Polynomial) Cost-Scaling and their relative efficiency is studied. A statistically designed experiment is used to perform a computational comparison of the algorithms. The response variable observed in the experiment is the CPU time to solve randomly generated network piecewise-linear problems classified according to problem class (Transportation, Transshipment and Circulation), problem size, extent of capacitation, and number of breakpoints per arc. Results and conclusions on performance of the algorithms are reported.

Problem of assignment cells to switches in a cellular mobile network via beam search method

The problem of assigning cells to switches in a cellular mobile network is an NP-hard optimization problem. So, real size mobile networks could not be solved by using exact methods. The alternative is the use of the heuristic methods, because they allow us to find a good quality solution in a quite satisfactory computational time. This paper proposes a Beam Search method to solve the problem of assignment cell in cellular mobile networks. Some modifications in this algorithm are also presented, which allows its parallel application. Computational results obtained from several tests confirm the effectiveness of this approach to provide good solutions for medium- and large-sized cellular mobile network.

Influence of enclosure size on growth of breast and leg muscle fibers in domestic fowl

This experiment evaluated the growth of breast and leg muscle fibers of domestic fowl raised in two enclosure sizes (SE: Small Enclosure, 1.125 m2/10 birds; LE: Large Enclosure, 5.25 m2/10 birds). In breast muscles, the number of fibers per area decreased over time and higher values were observed in broilers housed in SE compared to LE. The fiber size increased with age and was greater in LE than SE at 56 days of age, suggesting greater hypertrophic growth of fibers in breast muscle for broilers maintained in LE. In leg muscles, the muscle cross-sectional area was greater for broilers raised in LE than SE at 56 days of age and decreased from 42 to 56 days of age in broilers raised in SE, suggesting leg muscle atrophy in these birds. The Fast Glycolytic (FG), Fast Oxidative-Glycolytic (FOG) and Slow Oxidative (SO) fibers grew until 42 days of age in both enclosure sizes. The area of FOG fibers was greater in broilers raised in LE than those in SE at 28 and 56 days of age; in LE-raised broilers, the SO area was greater at 28, 42 and 56 days of age, suggesting that the muscles of broilers housed in LE are more oxidative. The BW gain was greater for broilers raised in LE than SE, whereas BW, feed intake and feed conversion were not influenced by enclosure size. Thus, the enclosure space affected hypertrophic growth and metabolic characteristics of breast and leg muscle fibers. © Asian Network for Scientific Information, 2012.

Relationship between incubation temperature and egg size with heart hypoplasy in broiler chicks at hatching

It was analyzed if the effects of continuous incubation temperature deviations during the second half on the development of body, organs and hematological respiratory and energetic parameters differ between male and female from 30- and 60-week-old breeder eggs. From day 13, Cobb eggs were exposed to 36°C, 37.5°C, or 39°C. At 3, 6, 12, 24, 48 and 72 h after this change in the temperature and at hatch, red cells count, hematocrit, hemoglobin, mean corpuscular volume, plasma glucose level and body, liver and heart weights were evaluated. Independent of incubation temperature, sexes and breeder ages, mean corpuscular volume decreased and the other variables increased during late incubation. In 30-week-old breeder eggs, body weights and erythrocytic parameters were not influenced by temperature but liver and heart weights decreased increasing incubation temperature and glucose level increased at 36 and 39°C. In 60-week-old breeder eggs, males were heavier at hatching with incubation at 36°C and females had smaller body weights with incubation at 39°C. In both sexes, liver weight decreased and glucose concentration was higher at 36 and 39°C and heart weights and erythrocytes parameters were not influenced by temperature. Independent of breeder age, hatchability was lower at 39°C. The data show that high temperature from day 13 of incubation reduced more intensively the hatching success and caused cardiac hypoplasia in chicks from 30-week-old breeder eggs only, revealing for the first time that the susceptibility for ascites syndrome, by reduced heart development at hatching, is associated to a relationship between incubation temperature and egg size. © Asian Network for Scientific Information, 2012.

Optimal Segment Size for Fixed-sized Segment Protection in Wavelength-routed Optical Networks

Protecting a network against link failures is a major challenge faced by network operators. The protection scheme has to address two important objectives - fast recovery and minimizing the amount of backup resources needed. Every protection algorithm is a tradeoff between these two objectives. In this paper, we study the problem of segment protection. In particular, we investigate what is the optimal segment size that obtains the best tradeoff between the time taken for recovery and minimizing the bandwidth used by the backup segments. We focus on the uniform fixed-length segment protection method, where each primary path is divided into fixed-length segments, with the exception of the last segment in the path. We observe that the optimal segment size for a given network depends on several factors such as the topology and the ratio of the costs involved.

Cross-Layer Packet Size Optimization for Wireless Terrestrial, Underwater, and Underground Sensor Networks

In this paper, a cross-layer solution for packet size optimization in wireless sensor networks (WSN) is introduced such that the effects of multi-hop routing, the broadcast nature of the physical wireless channel, and the effects of error control techniques are captured. A key result of this paper is that contrary to the conventional wireless networks, in wireless sensor networks, longer packets reduce the collision probability. Consequently, an optimization solution is formalized by using three different objective functions, i.e., packet throughput, energy consumption, and resource utilization. Furthermore, the effects of end-to-end latency and reliability constraints are investigated that may be required by a particular application. As a result, a generic, cross-layer optimization framework is developed to determine the optimal packet size in WSN. This framework is further extended to determine the optimal packet size in underwater and underground sensor networks. From this framework, the optimal packet sizes under various network parameters are determined.

A scheme for synchronizing clocks connected by a packet communication network

Consider a communication system in which a transmitter equipment sends fixed-size packets of data at a uniform rate to a receiver equipment. Consider also that these equipments are connected by a packet-switched network, which introduces a random delay to each packet. Here we propose an adaptive clock recovery scheme able of synchronizing the frequencies and the phases of these devices, within specified limits of precision. This scheme for achieving frequency and phase synchronization is based on measurements of the packet arrival times at the receiver, which are used to control the dynamics of a digital phase-locked loop. The scheme performance is evaluated via numerical simulations performed by using realistic parameter values. (C) 2011 Elsevier By. All rights reserved.

Fog- and cloud-induced aerosol modification observed by the Aerosol Robotic Network (AERONET)

Large fine mode-dominated aerosols (submicron radius) in size distributions retrieved from the Aerosol Robotic Network (AERONET) have been observed after fog or low-altitude cloud dissipation events. These column-integrated size distributions have been obtained at several sites in many regions of the world, typically after evaporation of low-altitude cloud such as stratocumulus or fog. Retrievals with cloud-processed aerosol are sometimes bimodal in the accumulation mode with the larger-size mode often similar to 0.4-0.5 mu m radius (volume distribution); the smaller mode, typically similar to 0.12 to similar to 0.20 mu m, may be interstitial aerosol that were not modified by incorporation in droplets and/or aerosol that are less hygroscopic in nature. Bimodal accumulation mode size distributions have often been observed from in situ measurements of aerosols that have interacted with clouds, and AERONET size distribution retrievals made after dissipation of cloud or fog are in good agreement with particle sizes measured by in situ techniques for cloud-processed aerosols. Aerosols of this type and large size range (in lower concentrations) may also be formed by cloud processing in partly cloudy conditions and may contribute to the "shoulder" of larger-size particles in the accumulation mode retrievals, especially in regions where sulfate and other soluble aerosol are a significant component of the total aerosol composition. Observed trends of increasing aerosol optical depth (AOD) as fine mode radius increased suggests higher AOD in the near-cloud environment and higher overall AOD than typically obtained from remote sensing owing to bias toward sampling at low cloud fraction.

Prominent Effect of Soil Network Heterogeneity on Microbial Invasion

Using a network representation for real soil samples and mathematical models for microbial spread, we show that the structural heterogeneity of the soil habitat may have a very significant influence on the size of microbial invasions of the soil pore space. In particular, neglecting the soil structural heterogeneity may lead to a substantial underestimation of microbial invasion. Such effects are explained in terms of a crucial interplay between heterogeneity in microbial spread and heterogeneity in the topology of soil networks. The main influence of network topology on invasion is linked to the existence of long channels in soil networks that may act as bridges for transmission of microorganisms between distant parts of soil.

Aplicación para la configuración automática del certificado digital en un ordenador personal

[ES] Programa de escritorio compatible con sistemas operativos Windows 7 y Windows 8.1. El programa configura el ordenador personal del usuario de modo que la firma electrónica de la Universidad de Las Palmas de Gran Canaria funcione correctamente en los navegadores web elegidos por el usuario. Al iniciarse la aplicación, el usuario elige dichos navegadores. El programa incorpora dos modos de instalación. La primera forma es la instalación automática, todos los componentes requeridos, que no estén instalados en el equipo, se instalarán automáticamente con una mínima intervención del usuario. La segunda forma es la instalación personalizada, se muestra una lista de los componentes requeridos y el usuario puede instalar de forma individual cada uno de éstos, si no están ya instalados. El programa también puede desinstalar los cambios realizados en el equipo, también incorpora dos formas de realizar esta operación. De forma automática, todos los componentes instalados por el programa serán desinstalados con una mínima intervención del usuario. De forma personalizada, el usuario podrá elegir el componente que se desinstala de forma individual. Siempre teniendo en cuenta que los cambios que se deshacen, son cambios realizados por el propio configurador. El programa también es capaz de analizar si un equipo cumple o no los requerimientos para que funcione correctamente la firma electrónica en su ordenador. Para analizar un equipo no se instala ningún componente. Se requiere acceso a Internet para usar este programa ya que se descargan diferentes archivos desde el servidor de la Universidad de Las Palmas de Gran Canaria.

Large-scale Network Analysis on Distributed Architectures

Questa dissertazione esamina le sfide e i limiti che gli algoritmi di analisi di grafi incontrano in architetture distribuite costituite da personal computer. In particolare, analizza il comportamento dell'algoritmo del PageRank così come implementato in una popolare libreria C++ di analisi di grafi distribuiti, la Parallel Boost Graph Library (Parallel BGL). I risultati qui presentati mostrano che il modello di programmazione parallela Bulk Synchronous Parallel è inadatto all'implementazione efficiente del PageRank su cluster costituiti da personal computer. L'implementazione analizzata ha infatti evidenziato una scalabilità negativa, il tempo di esecuzione dell'algoritmo aumenta linearmente in funzione del numero di processori. Questi risultati sono stati ottenuti lanciando l'algoritmo del PageRank della Parallel BGL su un cluster di 43 PC dual-core con 2GB di RAM l'uno, usando diversi grafi scelti in modo da facilitare l'identificazione delle variabili che influenzano la scalabilità. Grafi rappresentanti modelli diversi hanno dato risultati differenti, mostrando che c'è una relazione tra il coefficiente di clustering e l'inclinazione della retta che rappresenta il tempo in funzione del numero di processori. Ad esempio, i grafi Erdős–Rényi, aventi un basso coefficiente di clustering, hanno rappresentato il caso peggiore nei test del PageRank, mentre i grafi Small-World, aventi un alto coefficiente di clustering, hanno rappresentato il caso migliore. Anche le dimensioni del grafo hanno mostrato un'influenza sul tempo di esecuzione particolarmente interessante. Infatti, si è mostrato che la relazione tra il numero di nodi e il numero di archi determina il tempo totale.

Development, degeneration and neural network of the bodily self

The question addressed by this dissertation is how the human brain builds a coherent representation of the body, and how this representation is used to recognize its own body. Recent approaches by neuroimaging and TMS revealed hints for a distinct brain representation of human body, as compared with other stimulus categories. Neuropsychological studies demonstrated that body-parts and self body-parts recognition are separate processes sub-served by two different, even if possibly overlapping, networks within the brain. Bodily self-recognition is one aspect of our ability to distinguish between self and others and the self/other distinction is a crucial aspect of social behaviour. This is the reason why I have conducted a series of experiment on subjects with everyday difficulties in social and emotional behaviour, such as patients with autism spectrum disorders (ASD) and patients with Parkinson’s disease (PD). More specifically, I studied the implicit self body/face recognition (Chapter 6) and the influence of emotional body postures on bodily self-processing in TD children as well as in ASD children (Chapter 7). I found that the bodily self-recognition is present in TD and in ASD children and that emotional body postures modulate self and others’ body processing. Subsequently, I compared implicit and explicit bodily self-recognition in a neuro-degenerative pathology, such as in PD patients, and I found a selective deficit in implicit but not in explicit self-recognition (Chapter 8). This finding suggests that implicit and explicit bodily self-recognition are separate processes subtended by different mechanisms that can be selectively impaired. If the bodily self is crucial for self/other distinction, the space around the body (personal space) represents the space of interaction and communication with others. When, I studied this space in autism, I found that personal space regulation is impaired in ASD children (Chapter 9).

Social network e capitale sociale degli ex-ospiti di Comunita' Liberta': Drug free e ricaduti a confronto

L'indagine condotta, avvalendosi del paradigma della social network analysis, offre una descrizione delle reti di supporto personale e del capitale sociale di un campione di 80 italiani ex post un trattamento terapeutico residenziale di lungo termine per problemi di tossicodipendenza. Dopo aver identificato i profili delle reti di supporto sociale degli intervistati, si è proceduto, in primis, alla misurazione e comparazione delle ego-centered support networks tra soggetti drug free e ricaduti e, successivamente, all'investigazione delle caratteristiche delle reti e delle forme di capitale sociale – closure e brokerage – che contribuiscono al mantenimento dell'astinenza o al rischio di ricaduta nel post-trattamento. Fattori soggettivi, come la discriminazione pubblica percepita e l'attitudine al lavoro, sono stati inoltre esplorati al fine di investigare la loro correlazione con la condotta di reiterazione nell'uso di sostanze. Dai risultati dello studio emerge che un più basso rischio di ricaduta è positivamente associato ad una maggiore attitudine al lavoro, ad una minore percezione di discriminazione da parte della società, all'avere membri di supporto con un più alto status socio-economico e che mobilitano risorse reputazionali e, infine, all'avere reti più eterogenee nell'occupazione e caratterizzate da più elevati livelli di reciprocità. Inoltre, il capitale sociale di tipo brokerage contribuisce al mantenimento dell'astinenza in quanto garantisce l'accesso del soggetto ad informazioni meno omogenee e la sua esposizione a opportunità più numerose e differenziate. I risultati dello studio, pertanto, dimostrano l'importante ruolo delle personal support networks nel prevenire o ridurre il rischio di ricaduta nel post-trattamento, in linea con precedenti ricerche che suggeriscono la loro incorporazione nei programmi terapeutici per tossicodipendenti.

Decomposition Methods and Network Design Problems

Decomposition based approaches are recalled from primal and dual point of view. The possibility of building partially disaggregated reduced master problems is investigated. This extends the idea of aggregated-versus-disaggregated formulation to a gradual choice of alternative level of aggregation. Partial aggregation is applied to the linear multicommodity minimum cost flow problem. The possibility of having only partially aggregated bundles opens a wide range of alternatives with different trade-offs between the number of iterations and the required computation for solving it. This trade-off is explored for several sets of instances and the results are compared with the ones obtained by directly solving the natural node-arc formulation. An iterative solution process to the route assignment problem is proposed, based on the well-known Frank Wolfe algorithm. In order to provide a first feasible solution to the Frank Wolfe algorithm, a linear multicommodity min-cost flow problem is solved to optimality by using the decomposition techniques mentioned above. Solutions of this problem are useful for network orientation and design, especially in relation with public transportation systems as the Personal Rapid Transit. A single-commodity robust network design problem is addressed. In this, an undirected graph with edge costs is given together with a discrete set of balance matrices, representing different supply/demand scenarios. The goal is to determine the minimum cost installation of capacities on the edges such that the flow exchange is feasible for every scenario. A set of new instances that are computationally hard for the natural flow formulation are solved by means of a new heuristic algorithm. Finally, an efficient decomposition-based heuristic approach for a large scale stochastic unit commitment problem is presented. The addressed real-world stochastic problem employs at its core a deterministic unit commitment planning model developed by the California Independent System Operator (ISO).

Hierarchical Approach for Survivable Network Design

A central design challenge facing network planners is how to select a cost-effective network configuration that can provide uninterrupted service despite edge failures. In this paper, we study the Survivable Network Design (SND) problem, a core model underlying the design of such resilient networks that incorporates complex cost and connectivity trade-offs. Given an undirected graph with specified edge costs and (integer) connectivity requirements between pairs of nodes, the SND problem seeks the minimum cost set of edges that interconnects each node pair with at least as many edge-disjoint paths as the connectivity requirement of the nodes. We develop a hierarchical approach for solving the problem that integrates ideas from decomposition, tabu search, randomization, and optimization. The approach decomposes the SND problem into two subproblems, Backbone design and Access design, and uses an iterative multi-stage method for solving the SND problem in a hierarchical fashion. Since both subproblems are NP-hard, we develop effective optimization-based tabu search strategies that balance intensification and diversification to identify near-optimal solutions. To initiate this method, we develop two heuristic procedures that can yield good starting points. We test the combined approach on large-scale SND instances, and empirically assess the quality of the solutions vis-à-vis optimal values or lower bounds. On average, our hierarchical solution approach generates solutions within 2.7% of optimality even for very large problems (that cannot be solved using exact methods), and our results demonstrate that the performance of the method is robust for a variety of problems with different size and connectivity characteristics.