High-frequency water quality monitoring in an urban catchment: hydrochemical dynamics, primary production and implications for the Water Framework Directive

This paper describes the hydrochemistry of a lowland, urbanised river-system, The Cut in England, using in situ sub-daily sampling. The Cut receives effluent discharges from four major sewage treatment works serving around 190,000 people. These discharges consist largely of treated water, originally abstracted from the River Thames and returned via the water supply network, substantially increasing the natural flow. The hourly water quality data were supplemented by weekly manual sampling with laboratory analysis to check the hourly data and measure further determinands. Mean phosphorus and nitrate concentrations were very high, breaching standards set by EU legislation. Though 56% of the catchment area is agricultural, the hydrochemical dynamics were significantly impacted by effluent discharges which accounted for approximately 50% of the annual P catchment input loads and, on average, 59% of river flow at the monitoring point. Diurnal dissolved oxygen data demonstrated high in-stream productivity. From a comparison of high frequency and conventional monitoring data, it is inferred that much of the primary production was dominated by benthic algae, largely diatoms. Despite the high productivity and nutrient concentrations, the river water did not become anoxic and major phytoplankton blooms were not observed. The strong diurnal and annual variation observed showed that assessments of water quality made under the Water Framework Directive (WFD) are sensitive to the time and season of sampling. It is recommended that specific sampling time windows be specified for each determinand, and that WFD targets should be applied in combination to help identify periods of greatest ecological risk. This article is protected by copyright. All rights reserved.

Using autonomous mobile agents for efficient data collection in sensor networks

Sensor networks are emerging as the new frontier in sensing technology, however there are still issues that need to be addressed. Two such issues are data collection and energy conservation. We consider a mobile robot, or a mobile agent, traveling the network collecting information from the sensors themselves before their onboard memory storage buffers are full. A novel algorithm is presented that is an adaptation of a local search algorithm for a special case of the Asymmetric Traveling Salesman Problem with Time-windows (ATSPTW) for solving the dynamic scheduling problem of what nodes are to be visited so that the information collected is not lost. Our algorithms are given and compared to other work.

Statistics and kinetics of single-molecule electron transfer dynamics in complex environments: A simulation model study

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Filtros ótimos: efeitos de janelas e de tipo de fase

O objetivo central deste trabalho é o estudo do desempenho do operador deconvolucional WHL na compressão do pulso-fonte sísmico, sob condições especiais de fase não-mínima e da densidade de eventos no traço, como casos advogados para dados reais e processamento em rotina. O método de ataque ao problema construído é centrado no conteúdo da informação da função autocorrelação submetida a diferentes condições: (a) de truncamento e tipo de janelas; (b) das características da fase do operador (se mínima ou não-mínima); (c) da medida de qualidade; (d) do nível de embranquecimento; (e) do ruído presente e da equalização; (f) do balanceamento do traço; (g) dos princípios físicos da propagação expressos e limitados pelo modelo convolutional. Os resultados obtidos são apenas na forma numérica, organizados na forma de álbuns com dificuldades crescentes, e demonstram como o uso de janelas na autocorrelação serve para diagnosticar e melhorar a performance dos operadores. Concluímos que muitas perguntas ainda surgem quando técnicas de deconvolução são aplicadas a seções sísmicas de bacias sedimentares, e que o modelo de Goupillaud é conveniente para simulações e análises devido a sua descrição matemática simples e completa.

Estudo exploratório comparativo do declínio cognitivo senil após estimulação multissensorial e cognitiva em idosos institucionalizados e não institucionalizados

O objetivo do presente trabalho foi investigar, empregando testes neuropsicológicos selecionados, a duração dos efeitos benéficos do programa de estimulação multissensorial e cognitiva realizado em idosos vivendo em instituições de longa permanência ou em comunidade. Os participantes do estudo foram idosos institucionalizados (n=20, 75,1 ± 6,8 anos de idade) e não institucionalizados (n=15, 74,1 ± 3,9 anos de idade), com 65 anos de idade ou mais, sem histórico de traumatismo crânio-encefálico, acidente vascular encefálico ou depressão primária, acuidade visual mínima 20/30 mensurada pelo Teste de Snellen e que participaram regularmente do Programa de Estimulação Multissensorial e Cognitiva. Foram realizadas reavaliações em cinco períodos (2, 4, 6, 8 e 12 meses) após a finalização da intervenção multissensorial e cognitiva. Para isso empregou-se o Mini Exame do Estado Mental (MEEM); nomeação de Boston; fluência verbal semântica (FVS) e fonológica (FVF), testes da Bateria Montreal de Avaliação da Comunicação (MAC), Teste de Narrativa “Roubo de Biscoitos” e testes neuropsicológicos selecionados da Bateria Cambridge (CANTAB) incluindo: Triagem Motora (Motor Screening – MOT); Processamento Rápido de Informação Visual (Rapid Visual Information Processing – RVP); Tempo de Reação (Reaction Time - RTI); Aprendizagem Pareada (Paired Associates Learning - PAL); Memória de Trabalho Espacial (Spatial Working Memory - SWM) e Pareamento com Atraso (Delayed matching to sample - DMS). Os resultados apontaram diferenças estatisticamente significativas entre os grupos revelando taxa de declínio cognitivo maior nos idosos institucionalizados. Esses resultados confirmam sugestão anterior de que o ambiente pobre de estímulos somato-motores e cognitivos das instituições de longa permanência aceleram o declínio cognitivo senil. Além disso, a análise das curvas ROC seguido dos cálculos de sensibilidade, especificidade e eficiência para cada teste revelou que os testes da bateria CANTAB para memória e aprendizado espacial pareado assim como para memória espacial de trabalho permitiram a distinção entre os grupos I e NI em todas janelas de reavaliação. Os resultados demonstraram que uma vez cessado o programa de estimulação, se observa em ambos os grupos declínio cognitivo progressivo, com perdas mais precoces e mais intensas nos idosos institucionalizados do que naqueles vivendo em comunidade com suas famílias. Além disso, observou-se que a duração dos efeitos benéficos sobre o desempenho nos testes neuropsicológicos de ambos os grupos é heterogêneo, e que os efeitos de proteção guardam relação estreita com a natureza das oficinas. Por conta disso os escores dos testes de linguagem declinaram mais lentamente. Os resultados reúnem evidências que permitem a recomendação de programas regulares de estimulação somatomotora e cognitiva para idosos institucionalizados com o intuito de promover a redução da taxa de progressão do declínio cognitivo senil.

Comparação dos filtros de velocidade e do operador WHLP-CRS na atenuação de múltiplas

A motivação geológica deste trabalho reside no imageamento de estruturas de bacias sedimentares da região Amazônica, onde a geração e o acúmulo de hidrocarboneto estão relacionados com a presença de soleiras de diabásio. A motivação sísmica reside no fato de que essas rochas intrusivas possuem grandes contrastes de impedância com a rocha encaixante, o que resulta em múltiplas, externas e internas, com amplitudes semelhantes as das primárias. O sinal sísmico das múltiplas podem predominar sobre o sinal das reflexões primárias oriundas de interfaces mais profundas, o que pode dificultar o processamento, a interpretação e o imageamento da seção sísmica temporal. Neste trabalho, estudamos a atenuação de múltiplas em seções sintéticas fonte-comum (FC) através da comparação de dois métodos. O primeiro método resulta da combinação das técnicas Wiener-Hopf-Levinson de predição (WHLP) e o de empilhamento superfície-de-reflexão-comum (CRS), e denominando WHLP-CRS, onde o operador é desenhado exclusivamente no domínio do tempo-espaço. O segundo método utilizado é o filtro de velocidade (ω-k) aplicado após o empilhamento superfície-de-reflexão (CRS), onde o operador é desenhado exclusivamente no domínio bidimensional de freqüência temporal-espacial. A identificação das múltiplas é feita na seção de afastamento-nulo (AN) simulada com o empilhamento CRS, e utiliza o critério da periodicidade entre primária e suas múltiplas. Os atributos da frente de onda, obtidos através do empilhamento CRS, são utilizados na definição de janelas móveis no domínio tempo-espaço, que são usadas para calcular o operador WHLP-CRS. O cálculo do filtroω-k é realizado no domínio da freqüência temporal-espacial, onde os eventos são selecionados para corte ou passagem. O filtro (ω-k) é classificado como filtro de corte, com alteração de amplitude, mas não de fase, e limites práticos são impostos pela amostragem tempo-espaço. Em termos práticos, concluímos que, para o caso de múltiplas, os eventos separados no domínio x-t não necessariamente se separam no domínio ω-k, o que dificulta o desenho de um operador ω-k semelhante em performance ao operador x-t.

Influências do tamanho da ninhada e da atividade física sobre a plasticidade glial na formação hipocampal em modelo murino

Estudos anteriores demonstraram efeitos importantes do estresse perinatal no desempenho cognitivo na vida adulta e durante o envelhecimento. Entretanto permanece por ser estudado em detalhe como o exercício físico em diferentes fases da vida contribui para reduzir esses déficits. Isso é particularmente verdadeiro quando se trata de documentar as alterações da matriz extracelular e das células da glia, largamente ignoradas nesses estudos. Assim o objetivo geral do presente trabalho é o de investigar as possíveis influências do tamanho da ninhada e da atividade física sobre a memória de reconhecimento de objetos na vida adulta e possíveis alterações associadas à plasticidade glial e da matriz extracelular da formação hipocampal em modelo murino. Para alcançar esses objetivos alteramos o tamanho da ninhada de ratos Wistar de modo a acentuar o grau de competição entre os filhotes por tetas funcionais e diminuir a quantidade de cuidado materno por indivíduo. Durante o período de aleitamento quantificamos o cuidado materno em ninhadas de diferentes tamanhos. Em várias janelas temporais submetemos grupos selecionados de sujeitos ao exercício em esteira durante 5 semanas adotando o mesmo protocolo de treinamento. Após o exercício alguns grupos de animais adultos e senis foram submetidos ao teste de memória de reconhecimento de objetos que é dependente do hipocampo, sendo sacrificados e processados para imunohistoquímica seletiva para micróglia. Outros grupos de animais adultos não submetidos aos testes comportamentais foram igualmente sacrificados sendo um dos hemisférios empregado para registro de parâmetros difusionais no hipocampo enquanto que o outro foi empregado para imunohistoquímicas seletivas para astrócitos, células NG2 e reelina. Encontramos que o aumento do tamanho da ninhada está relacionado à redução do cuidado materno, ao declínio cognitivo, à proliferação e alteração da morfologia microglial, astrocitária e de células NG2 positivas, assim como às alterações nos padrões de difusão encontradas no tecido hipocampal. Além disso que tais alterações podem ser revertidas pelo menos de forma parcial pela atividade física e que esse efeito é tanto maior quanto mais jovem é o sujeito. O envelhecimento agrava as alterações morfológicas microgliais induzidas pelo aumento do tamanho da ninhada e reduz o desempenho nos testes de memória de reconhecimento de objeto. Os mecanismos moleculares associados a esses efeitos permanecem por ser investigados.

Influências do envelhecimento e do ambiente sobre a progressão da encefalite experimental por arbovírus Piry em modelo murino: mudanças morfológicas microgliais e alterações comportamentais

O enriquecimento ambiental e os efeitos do envelhecimento sobre as alterações morfológicas das micróglias e no comportamento foram investigados em modelo murino de encefalite sub-letal por arbovírus. Para medir possíveis influências da idade e do ambiente sobre a progressão da encefalite, camundongos suíços albinos fêmeas de 2 meses de idade foram mantidos em Ambiente Padrão (AP) ou em Ambiente Enriquecido (AE), durante: 6 meses (Adulto - A) e 16 meses (Senil –S). Após os testes comportamentais, os camundongos A e S foram inoculados intranasalmente com igual volume de homogenado de cérebro de camundongo infectado pelo vírus Piry (Py) ou homogenado de cérebro de camundongo normal. Oito dias após a inoculação (8DPI), quando os primeiros testes comportamentais revelaram as alterações relacionadas à doença, os cérebros foram seccionados e inumomarcados seletivamente para IBA-1 e antígenos virais. Aos 20 ou 40DPI, os animais restantes foram testados comportamentalmente e processados para os mesmos marcadores e nenhum sinal neuropatológico foi detectado. Em camundongos adultos infectados o ambiente padrão (APPyA), a atividade de burrowing diminuiu e se recuperou rapidamente (8-10DPI), a atividade de campo aberto (20-40DPI), mas manteve-se inalterado em animais da mesma idade e de ambiente enriquecido (AEPyA). Em contraste animais senis tanto de ambiente enriquecido (AEPyS) quanto de ambiente empobrecido (APPyS) reduzem significativamente a atividade de burrowing em todas janelas. A encefalite causada pelo virus Piry, induziu perdas olfativas transitórias em animais APPyA e AEPyA, mas permanents em APPyS e AEPyS. A imunomarcação para os antígenos viral do Piry atingiram seu pico no parênquima do SNC aos 5 e 6DPI e desapareceu aos 8DPI. Todas as reconstruções tridimensionais das micróglias, foram realizadas aos 8DPI. Mudanças Microgliais foram significativamente mais graves em camundongos adultos do que em camundongos senis, mas os animais AE parecem recuperar a morfologia microglia homeostática mais cedo do que os animais de AP. Os efeitos benéficos do AE foram menores em camundongos envelhecidos.

Efeitos da corticoterapia pré-natal e durante a puberdade sobre a morfofisiologia do lobo ventral da próstata de ratos senis

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Porcentaje de artículos altamente citados: una medida comparable del impacto de revistas entre campos científicos.

[EN]This paper proposes an alternative bibliometric indicator for evaluating scholarly journals based on the percentage of highly cited articles in a journal. It compares such an index with the impact factor and the h-index by using different time windows and levels of citation that can determine when a document can be considered as highly cited compared to others of the same year and discipline. The main outcome of this comparison suggests that the best index for obtaining data distributions that are comparable between scientific fields is by taking the 20% citation percentile over a three-year time frame for considering citations.

Enhanced Mixed Integer Programming Techniques and Routing Problems

Mixed integer programming is up today one of the most widely used techniques for dealing with hard optimization problems. On the one side, many practical optimization problems arising from real-world applications (such as, e.g., scheduling, project planning, transportation, telecommunications, economics and finance, timetabling, etc) can be easily and effectively formulated as Mixed Integer linear Programs (MIPs). On the other hand, 50 and more years of intensive research has dramatically improved on the capability of the current generation of MIP solvers to tackle hard problems in practice. However, many questions are still open and not fully understood, and the mixed integer programming community is still more than active in trying to answer some of these questions. As a consequence, a huge number of papers are continuously developed and new intriguing questions arise every year. When dealing with MIPs, we have to distinguish between two different scenarios. The first one happens when we are asked to handle a general MIP and we cannot assume any special structure for the given problem. In this case, a Linear Programming (LP) relaxation and some integrality requirements are all we have for tackling the problem, and we are ``forced" to use some general purpose techniques. The second one happens when mixed integer programming is used to address a somehow structured problem. In this context, polyhedral analysis and other theoretical and practical considerations are typically exploited to devise some special purpose techniques. This thesis tries to give some insights in both the above mentioned situations. The first part of the work is focused on general purpose cutting planes, which are probably the key ingredient behind the success of the current generation of MIP solvers. Chapter 1 presents a quick overview of the main ingredients of a branch-and-cut algorithm, while Chapter 2 recalls some results from the literature in the context of disjunctive cuts and their connections with Gomory mixed integer cuts. Chapter 3 presents a theoretical and computational investigation of disjunctive cuts. In particular, we analyze the connections between different normalization conditions (i.e., conditions to truncate the cone associated with disjunctive cutting planes) and other crucial aspects as cut rank, cut density and cut strength. We give a theoretical characterization of weak rays of the disjunctive cone that lead to dominated cuts, and propose a practical method to possibly strengthen those cuts arising from such weak extremal solution. Further, we point out how redundant constraints can affect the quality of the generated disjunctive cuts, and discuss possible ways to cope with them. Finally, Chapter 4 presents some preliminary ideas in the context of multiple-row cuts. Very recently, a series of papers have brought the attention to the possibility of generating cuts using more than one row of the simplex tableau at a time. Several interesting theoretical results have been presented in this direction, often revisiting and recalling other important results discovered more than 40 years ago. However, is not clear at all how these results can be exploited in practice. As stated, the chapter is a still work-in-progress and simply presents a possible way for generating two-row cuts from the simplex tableau arising from lattice-free triangles and some preliminary computational results. The second part of the thesis is instead focused on the heuristic and exact exploitation of integer programming techniques for hard combinatorial optimization problems in the context of routing applications. Chapters 5 and 6 present an integer linear programming local search algorithm for Vehicle Routing Problems (VRPs). The overall procedure follows a general destroy-and-repair paradigm (i.e., the current solution is first randomly destroyed and then repaired in the attempt of finding a new improved solution) where a class of exponential neighborhoods are iteratively explored by heuristically solving an integer programming formulation through a general purpose MIP solver. Chapters 7 and 8 deal with exact branch-and-cut methods. Chapter 7 presents an extended formulation for the Traveling Salesman Problem with Time Windows (TSPTW), a generalization of the well known TSP where each node must be visited within a given time window. The polyhedral approaches proposed for this problem in the literature typically follow the one which has been proven to be extremely effective in the classical TSP context. Here we present an overall (quite) general idea which is based on a relaxed discretization of time windows. Such an idea leads to a stronger formulation and to stronger valid inequalities which are then separated within the classical branch-and-cut framework. Finally, Chapter 8 addresses the branch-and-cut in the context of Generalized Minimum Spanning Tree Problems (GMSTPs) (i.e., a class of NP-hard generalizations of the classical minimum spanning tree problem). In this chapter, we show how some basic ideas (and, in particular, the usage of general purpose cutting planes) can be useful to improve on branch-and-cut methods proposed in the literature.

Algorithms for network design and routing problems

In this thesis we study three combinatorial optimization problems belonging to the classes of Network Design and Vehicle Routing problems that are strongly linked in the context of the design and management of transportation networks: the Non-Bifurcated Capacitated Network Design Problem (NBP), the Period Vehicle Routing Problem (PVRP) and the Pickup and Delivery Problem with Time Windows (PDPTW). These problems are NP-hard and contain as special cases some well known difficult problems such as the Traveling Salesman Problem and the Steiner Tree Problem. Moreover, they model the core structure of many practical problems arising in logistics and telecommunications. The NBP is the problem of designing the optimum network to satisfy a given set of traffic demands. Given a set of nodes, a set of potential links and a set of point-to-point demands called commodities, the objective is to select the links to install and dimension their capacities so that all the demands can be routed between their respective endpoints, and the sum of link fixed costs and commodity routing costs is minimized. The problem is called non- bifurcated because the solution network must allow each demand to follow a single path, i.e., the flow of each demand cannot be splitted. Although this is the case in many real applications, the NBP has received significantly less attention in the literature than other capacitated network design problems that allow bifurcation. We describe an exact algorithm for the NBP that is based on solving by an integer programming solver a formulation of the problem strengthened by simple valid inequalities and four new heuristic algorithms. One of these heuristics is an adaptive memory metaheuristic, based on partial enumeration, that could be applied to a wider class of structured combinatorial optimization problems. In the PVRP a fleet of vehicles of identical capacity must be used to service a set of customers over a planning period of several days. Each customer specifies a service frequency, a set of allowable day-combinations and a quantity of product that the customer must receive every time he is visited. For example, a customer may require to be visited twice during a 5-day period imposing that these visits take place on Monday-Thursday or Monday-Friday or Tuesday-Friday. The problem consists in simultaneously assigning a day- combination to each customer and in designing the vehicle routes for each day so that each customer is visited the required number of times, the number of routes on each day does not exceed the number of vehicles available, and the total cost of the routes over the period is minimized. We also consider a tactical variant of this problem, called Tactical Planning Vehicle Routing Problem, where customers require to be visited on a specific day of the period but a penalty cost, called service cost, can be paid to postpone the visit to a later day than that required. At our knowledge all the algorithms proposed in the literature for the PVRP are heuristics. In this thesis we present for the first time an exact algorithm for the PVRP that is based on different relaxations of a set partitioning-like formulation. The effectiveness of the proposed algorithm is tested on a set of instances from the literature and on a new set of instances. Finally, the PDPTW is to service a set of transportation requests using a fleet of identical vehicles of limited capacity located at a central depot. Each request specifies a pickup location and a delivery location and requires that a given quantity of load is transported from the pickup location to the delivery location. Moreover, each location can be visited only within an associated time window. Each vehicle can perform at most one route and the problem is to satisfy all the requests using the available vehicles so that each request is serviced by a single vehicle, the load on each vehicle does not exceed the capacity, and all locations are visited according to their time window. We formulate the PDPTW as a set partitioning-like problem with additional cuts and we propose an exact algorithm based on different relaxations of the mathematical formulation and a branch-and-cut-and-price algorithm. The new algorithm is tested on two classes of problems from the literature and compared with a recent branch-and-cut-and-price algorithm from the literature.

Hybrid constraint programming and metaheuristic methods for large scale optimization problems

This work presents hybrid Constraint Programming (CP) and metaheuristic methods for the solution of Large Scale Optimization Problems; it aims at integrating concepts and mechanisms from the metaheuristic methods to a CP-based tree search environment in order to exploit the advantages of both approaches. The modeling and solution of large scale combinatorial optimization problem is a topic which has arisen the interest of many researcherers in the Operations Research field; combinatorial optimization problems are widely spread in everyday life and the need of solving difficult problems is more and more urgent. Metaheuristic techniques have been developed in the last decades to effectively handle the approximate solution of combinatorial optimization problems; we will examine metaheuristics in detail, focusing on the common aspects of different techniques. Each metaheuristic approach possesses its own peculiarities in designing and guiding the solution process; our work aims at recognizing components which can be extracted from metaheuristic methods and re-used in different contexts. In particular we focus on the possibility of porting metaheuristic elements to constraint programming based environments, as constraint programming is able to deal with feasibility issues of optimization problems in a very effective manner. Moreover, CP offers a general paradigm which allows to easily model any type of problem and solve it with a problem-independent framework, differently from local search and metaheuristic methods which are highly problem specific. In this work we describe the implementation of the Local Branching framework, originally developed for Mixed Integer Programming, in a CP-based environment. Constraint programming specific features are used to ease the search process, still mantaining an absolute generality of the approach. We also propose a search strategy called Sliced Neighborhood Search, SNS, that iteratively explores slices of large neighborhoods of an incumbent solution by performing CP-based tree search and encloses concepts from metaheuristic techniques. SNS can be used as a stand alone search strategy, but it can alternatively be embedded in existing strategies as intensification and diversification mechanism. In particular we show its integration within the CP-based local branching. We provide an extensive experimental evaluation of the proposed approaches on instances of the Asymmetric Traveling Salesman Problem and of the Asymmetric Traveling Salesman Problem with Time Windows. The proposed approaches achieve good results on practical size problem, thus demonstrating the benefit of integrating metaheuristic concepts in CP-based frameworks.

Exact Algorithms for Different Classes of Vehicle Routing Problems

We deal with five problems arising in the field of logistics: the Asymmetric TSP (ATSP), the TSP with Time Windows (TSPTW), the VRP with Time Windows (VRPTW), the Multi-Trip VRP (MTVRP), and the Two-Echelon Capacitated VRP (2E-CVRP). The ATSP requires finding a lest-cost Hamiltonian tour in a digraph. We survey models and classical relaxations, and describe the most effective exact algorithms from the literature. A survey and analysis of the polynomial formulations is provided. The considered algorithms and formulations are experimentally compared on benchmark instances. The TSPTW requires finding, in a weighted digraph, a least-cost Hamiltonian tour visiting each vertex within a given time window. We propose a new exact method, based on new tour relaxations and dynamic programming. Computational results on benchmark instances show that the proposed algorithm outperforms the state-of-the-art exact methods. In the VRPTW, a fleet of identical capacitated vehicles located at a depot must be optimally routed to supply customers with known demands and time window constraints. Different column generation bounding procedures and an exact algorithm are developed. The new exact method closed four of the five open Solomon instances. The MTVRP is the problem of optimally routing capacitated vehicles located at a depot to supply customers without exceeding maximum driving time constraints. Two set-partitioning-like formulations of the problem are introduced. Lower bounds are derived and embedded into an exact solution method, that can solve benchmark instances with up to 120 customers. The 2E-CVRP requires designing the optimal routing plan to deliver goods from a depot to customers by using intermediate depots. The objective is to minimize the sum of routing and handling costs. A new mathematical formulation is introduced. Valid lower bounds and an exact method are derived. Computational results on benchmark instances show that the new exact algorithm outperforms the state-of-the-art exact methods.