Sistema de Informação Geográfica na Internet para apoio à gestão de Infra-estruturas, baseado em ferramentas Open Source

A gestão de infra-estruturas é um processo de coordenação, avaliação sistemática e manutenção efectiva das infra-estruturas relacionadas com os serviços básicos. A gestão eficaz de infra-estruturas exige que a disposição dos equipamentos no meio urbano seja conhecida, bem como sua relação com o uso do solo. Sendo a gestão de infra-estruturas uma questão de natureza espacial, é natural pensar na utilização de um Sistema de Informação Geográfica como ferramenta com potencial de grande utilidade, pois permite a georreferenciação de dados espaciais e sua interligação com atributos alfanuméricos, para além da realização de análises complexas e a possibilidade de simular diversos cenários de modo a propiciar uma tomada de decisão eficaz. O elevado custo das licenças e a especificidade de utilização a nível técnico, tornam-se obstáculos na criação e manutenção de dados geográficos. Contudo os recentes desenvolvimentos em tecnologias da Internet têm contribuído para o acesso, publicação, exploração e distribuição da Informação Geográfica. A utilização de SIG distribuídos na Internet (WebGIS), nomeadamente na vertente livre, pode ser uma solução adequada visto que coloca funcionalidades de SIG ao alcance de utilizadores, através de um simples browser, sem necessidade de investimentos em relação a software ou mesmo em formação técnica especializada. Assim, com este projecto pretende-se a criação de um sistema de Informação geográfico na Internet, utilizando softwares livres, que disponibiliza toda a informação geográfica e alfanumérica das infra-estruturas construídas e sob a responsabilidade do Ministério das Infra-estruturas e Economia Marítima, permitindo a visualização e a realização de pesquisas e operações de análise.

Iowa Communications Network Performance Report, FY 2007

Agency Performance Report

PhD Students’ Research Group Social Capital in Two Countries: A Clustering Approach with Duocentred Network Measures

The article examines the structure of the collaboration networks of research groups where Slovenian and Spanish PhD students are pursuing their doctorate. The units of analysis are student-supervisor dyads. We use duocentred networks, a novel network structure appropriate for networks which are centred around a dyad. A cluster analysis reveals three typical clusters of research groups. Those which are large and belong to several institutions are labelled under a bridging social capital label. Those which are small, centred in a single institution but have high cohesion are labelled as bonding social capital. Those which are small and with low cohesion are called weak social capital groups. Academic performance of both PhD students and supervisors are highest in bridging groups and lowest in weak groups. Other variables are also found to differ according to the type of research group. At the end, some recommendations regarding academic and research policy are drawn

On optimal monetary and fiscal policy interactions in open economies

This paper studies monetary and fiscal policy interactions in a two country model, where taxes on firms sales are optimally chosen and the monetary policy is set cooperatively.It turns out that in a two country setting non-cooperative fiscal policy makers have an incentive to change taxes on sales depending on shocks realizations in order to reduce output production. Therefore whether the fiscal policy is set cooperatively or not matters for optimal monetary policy decisions. Indeed, as already shown in the literature, the cooperative monetary policy maker implements the flexible price allocation only when special conditions on the value of the distortions underlying the economy are met. However, if non-cooperative fiscal policy makers set the taxes on firms sales depending on shocks realizations, these conditions cannot be satisfied; conversely, when fiscal policy is cooperative, these conditions are fulfilled. We conclude that whether implementing the flexible price allocation is optimal or not depends on the fiscal policy regime.

Network revenue management with product-specific no-shows

Revenue management practices often include overbooking capacity to account for customerswho make reservations but do not show up. In this paper, we consider the network revenuemanagement problem with no-shows and overbooking, where the show-up probabilities are specificto each product. No-show rates differ significantly by product (for instance, each itinerary andfare combination for an airline) as sale restrictions and the demand characteristics vary byproduct. However, models that consider no-show rates by each individual product are difficultto handle as the state-space in dynamic programming formulations (or the variable space inapproximations) increases significantly. In this paper, we propose a randomized linear program tojointly make the capacity control and overbooking decisions with product-specific no-shows. Weestablish that our formulation gives an upper bound on the optimal expected total profit andour upper bound is tighter than a deterministic linear programming upper bound that appearsin the existing literature. Furthermore, we show that our upper bound is asymptotically tightin a regime where the leg capacities and the expected demand is scaled linearly with the samerate. We also describe how the randomized linear program can be used to obtain a bid price controlpolicy. Computational experiments indicate that our approach is quite fast, able to scale to industrialproblems and can provide significant improvements over standard benchmarks.

Abnormal cortical network activation in human amnesia: A high-resolution evoked potential study.

Little is known about how human amnesia affects the activation of cortical networks during memory processing. In this study, we recorded high-density evoked potentials in 12 healthy control subjects and 11 amnesic patients with various types of brain damage affecting the medial temporal lobes, diencephalic structures, or both. Subjects performed a continuous recognition task composed of meaningful designs. Using whole-scalp spatiotemporal mapping techniques, we found that, during the first 200 ms following picture presentation, map configuration of amnesics and controls were indistinguishable. Beyond this period, processing significantly differed. Between 200 and 350 ms, amnesic patients expressed different topographical maps than controls in response to new and repeated pictures. From 350 to 550 ms, healthy subjects showed modulation of the same maps in response to new and repeated items. In amnesics, by contrast, presentation of repeated items induced different maps, indicating distinct cortical processing of new and old information. The study indicates that cortical mechanisms underlying memory formation and re-activation in amnesia fundamentally differ from normal memory processing.

A randomized concave programming method for choice network revenue management

Models incorporating more realistic models of customer behavior, as customers choosing froman offer set, have recently become popular in assortment optimization and revenue management.The dynamic program for these models is intractable and approximated by a deterministiclinear program called the CDLP which has an exponential number of columns. However, whenthe segment consideration sets overlap, the CDLP is difficult to solve. Column generationhas been proposed but finding an entering column has been shown to be NP-hard. In thispaper we propose a new approach called SDCP to solving CDLP based on segments and theirconsideration sets. SDCP is a relaxation of CDLP and hence forms a looser upper bound onthe dynamic program but coincides with CDLP for the case of non-overlapping segments. Ifthe number of elements in a consideration set for a segment is not very large (SDCP) can beapplied to any discrete-choice model of consumer behavior. We tighten the SDCP bound by(i) simulations, called the randomized concave programming (RCP) method, and (ii) by addingcuts to a recent compact formulation of the problem for a latent multinomial-choice model ofdemand (SBLP+). This latter approach turns out to be very effective, essentially obtainingCDLP value, and excellent revenue performance in simulations, even for overlapping segments.By formulating the problem as a separation problem, we give insight into why CDLP is easyfor the MNL with non-overlapping considerations sets and why generalizations of MNL posedifficulties. We perform numerical simulations to determine the revenue performance of all themethods on reference data sets in the literature.

Dietary folates and cancer risk in a network of case-control studies.

Background Folate deficiency leads to DNA damage and inadequate repair, caused by a decreased synthesis of thymidylate and purines. We analyzed the relationship between dietary folate intake and the risk of several cancers. Patients and methods The study is based on a network of case-control studies conducted in Italy and Switzerland in 1991-2009. The odds ratios (ORs) for dietary folate intake were estimated by multiple logistic regression models, adjusted for major identified confounding factors. Results For a few cancer sites, we found a significant inverse relation, with ORs for an increment of 100 μg/day of dietary folate of 0.65 for oropharyngeal (1467 cases), 0.58 for esophageal (505 cases), 0.83 for colorectal (2390 cases), 0.72 for pancreatic (326 cases), 0.67 for laryngeal (851 cases) and 0.87 for breast (3034 cases) cancers. The risk estimates were below unity, although not significantly, for cancers of the endometrium (OR = 0.87, 454 cases), ovary (OR = 0.86, 1031 cases), prostate (OR = 0.91, 1468 cases) and kidney (OR = 0.88, 767 cases), and was 1.00 for stomach cancer (230 cases). No material heterogeneity was found in strata of sex, age, smoking and alcohol drinking. Conclusions Our data support a real inverse association of dietary folate intake with the risk of several common cancers.

A tractable consideration set structure for network revenue management

Models incorporating more realistic models of customer behavior, as customers choosing from an offerset, have recently become popular in assortment optimization and revenue management. The dynamicprogram for these models is intractable and approximated by a deterministic linear program called theCDLP which has an exponential number of columns. When there are products that are being consideredfor purchase by more than one customer segment, CDLP is difficult to solve since column generationis known to be NP-hard. However, recent research indicates that a formulation based on segments withcuts imposing consistency (SDCP+) is tractable and approximates the CDLP value very closely. In thispaper we investigate the structure of the consideration sets that make the two formulations exactly equal.We show that if the segment consideration sets follow a tree structure, CDLP = SDCP+. We give acounterexample to show that cycles can induce a gap between the CDLP and the SDCP+ relaxation.We derive two classes of valid inequalities called flow and synchronization inequalities to further improve(SDCP+), based on cycles in the consideration set structure. We give a numeric study showing theperformance of these cycle-based cuts.

Equivalence of piecewise-linear approximation and Lagrangian relaxation for network revenue management

The network revenue management (RM) problem arises in airline, hotel, media,and other industries where the sale products use multiple resources. It can be formulatedas a stochastic dynamic program but the dynamic program is computationallyintractable because of an exponentially large state space, and a number of heuristicshave been proposed to approximate it. Notable amongst these -both for their revenueperformance, as well as their theoretically sound basis- are approximate dynamic programmingmethods that approximate the value function by basis functions (both affinefunctions as well as piecewise-linear functions have been proposed for network RM)and decomposition methods that relax the constraints of the dynamic program to solvesimpler dynamic programs (such as the Lagrangian relaxation methods). In this paperwe show that these two seemingly distinct approaches coincide for the network RMdynamic program, i.e., the piecewise-linear approximation method and the Lagrangianrelaxation method are one and the same.

The network origins of aggregate fluctuations

This paper argues that in the presence of intersectoral input-output linkages, microeconomicidiosyncratic shocks may lead to aggregate fluctuations. In particular, itshows that, as the economy becomes more disaggregated, the rate at which aggregatevolatility decays is determined by the structure of the network capturing such linkages.Our main results provide a characterization of this relationship in terms of the importanceof different sectors as suppliers to their immediate customers as well as theirrole as indirect suppliers to chains of downstream sectors. Such higher-order interconnectionscapture the possibility of "cascade effects" whereby productivity shocks to asector propagate not only to its immediate downstream customers, but also indirectlyto the rest of the economy. Our results highlight that sizable aggregate volatility isobtained from sectoral idiosyncratic shocks only if there exists significant asymmetryin the roles that sectors play as suppliers to others, and that the "sparseness" of theinput-output matrix is unrelated to the nature of aggregate fluctuations.

A new compact linear programming formulation for choice network revenue management

The choice network revenue management model incorporates customer purchase behavioras a function of the offered products, and is the appropriate model for airline and hotel networkrevenue management, dynamic sales of bundles, and dynamic assortment optimization.The optimization problem is a stochastic dynamic program and is intractable. A certainty-equivalencerelaxation of the dynamic program, called the choice deterministic linear program(CDLP) is usually used to generate dyamic controls. Recently, a compact linear programmingformulation of this linear program was given for the multi-segment multinomial-logit (MNL)model of customer choice with non-overlapping consideration sets. Our objective is to obtaina tighter bound than this formulation while retaining the appealing properties of a compactlinear programming representation. To this end, it is natural to consider the affine relaxationof the dynamic program. We first show that the affine relaxation is NP-complete even for asingle-segment MNL model. Nevertheless, by analyzing the affine relaxation we derive a newcompact linear program that approximates the dynamic programming value function betterthan CDLP, provably between the CDLP value and the affine relaxation, and often comingclose to the latter in our numerical experiments. When the segment consideration sets overlap,we show that some strong equalities called product cuts developed for the CDLP remain validfor our new formulation. Finally we perform extensive numerical comparisons on the variousbounds to evaluate their performance.

Aggregate fluctuations and the network structure of intersectoral trade

This paper analyzes the flow of intermediate inputs across sectors by adopting a network perspective on sectoral interactions. I apply these tools to show how fluctuationsin aggregate economic activity can be obtained from independent shocks to individualsectors. First, I characterize the network structure of input trade in the U.S. On thedemand side, a typical sector relies on a small number of key inputs and sectors arehomogeneous in this respect. However, in their role as input-suppliers sectors do differ:many specialized input suppliers coexist alongside general purpose sectors functioningas hubs to the economy. I then develop a model of intersectoral linkages that can reproduce these connectivity features. In a standard multisector setup, I use this modelto provide analytical expressions linking aggregate volatility to the network structureof input trade. I show that the presence of sectoral hubs - by coupling productiondecisions across sectors - leads to fluctuations in aggregates.