Addressing water, food and poverty problems together--Methods, tools and lessons

This sourcebook entitled “Addressing water,food and poverty problems together: Methods,tools and lessons” is part of a wider process to capitalize on results from the Phase 1 of CPWF (2004-2008). Phase 1 of CPWF cast its net widely. Sixty-eight individual research projects were carried out in ten river basins around the world. The learning was immense. Unfortunately, many Phase 1 lessons and experiences are locked away in people’s minds or hidden in long technical and scientific reports that are difficult to access, particularly for non-researchers. The articles in the sourcebook provide development professionals and the wider research for development community with concise information on methodologies, approaches and lessons learned on agriculture water management. The articles are not intended to provide comprehensive information on the project nor are they intended to serve as project summaries. Typically, one or more aspects of the research, usually an approach, have been highlighted in the source book article. There are some limitations to the articles themselves as the reports and journal articles are often from research that took place three to four years ago and has not been updated. The sourcebook is divided into 12 chapters. Chapter 1 provides a short overview of the CPWF project, based on its strategic and medium term plans. Chapter 2 discusses water in the context of food production and security, information that is based on CPWF’s Comprehensive Assessment of Water Management for Agriculture (2007). Chapter 3 has three articles all based on Basin Focal Point (BFP) project outputs previously published in Water International (Issues 35 and 36). As such, Chapter 3 provides an overview of river basin issues and discusses in some detail the connection between poverty, water and food. Chapters 4 to 12 are drawn from CPWF project level engagement in the various river basins. These chapters focus on innovative frameworks, methods, approaches and tools. Each chapter consists of a cluster of articles, each standing on its own. Sourcebook articles were repackaged from previously written material. This means that secondary materials - primarily project reports and peer-reviewed journal articles – were used as the basis for creating these articles. Professional writers and artists were employed as part of this effort and an initial workshop was held with CPWF partners to get feedback on the initial drafts. After improvements, project leaders and external reviewers commented and approved the repackaged articles

Distance-Dependent Kronecker Graphs for Modeling Social Networks

This paper focuses on a generalization of stochastic Kronecker graphs, introducing a Kronecker-like operator and defining a family of generator matrices H dependent on distances between nodes in a specified graph embedding. We prove that any lattice-based network model with sufficiently small distance-dependent connection probability will have a Poisson degree distribution and provide a general framework to prove searchability for such a network. Using this framework, we focus on a specific example of an expanding hypercube and discuss the similarities and differences of such a model with recently proposed network models based on a hidden metric space. We also prove that a greedy forwarding algorithm can find very short paths of length O((log log n)^2) on the hypercube with n nodes, demonstrating that distance-dependent Kronecker graphs can generate searchable network models

The lonely nerd

This is the twenty-second issue of Exchanges, published in August 2022. This is our fourth special issue focussing on cultural experiences around the theme of the lonely nerd. Developed in collaboration with scholars from the Universities of Oxford and SOAS, and with author contributions from around the world, the issue is in part an output from a workshop held at the University of Warwick in spring 2021. Article topics in this issue include: conceptions and perceptions of lonely nerds, diversity of nerd representation in film, television theatre, gaming and comic books, along with explorations of alienation, non-conformity and societal acceptance. Within the issue’s editorial the Editor-in-Chief briefly introduces the issue and its development, alongside providing an overview of its articles and the future opportunities for contributions from authors old and new alike. An introductory essay from the two special issue leads provides an overview of the workshop and special issue themes, providing a useful framing for readers in contextualising the articles within

Performance Modelling and Optimisation of Multi-hop Networks

A major challenge in the design of large-scale networks is to predict and optimise the total time and energy consumption required to deliver a packet from a source node to a destination node. Examples of such complex networks include wireless ad hoc and sensor networks which need to deal with the effects of node mobility, routing inaccuracies, higher packet loss rates, limited or time-varying effective bandwidth, energy constraints, and the computational limitations of the nodes. They also include more reliable communication environments, such as wired networks, that are susceptible to random failures, security threats and malicious behaviours which compromise their quality of service (QoS) guarantees. In such networks, packets traverse a number of hops that cannot be determined in advance and encounter non-homogeneous network conditions that have been largely ignored in the literature. This thesis examines analytical properties of packet travel in large networks and investigates the implications of some packet coding techniques on both QoS and resource utilisation. Specifically, we use a mixed jump and diffusion model to represent packet traversal through large networks. The model accounts for network non-homogeneity regarding routing and the loss rate that a packet experiences as it passes successive segments of a source to destination route. A mixed analytical-numerical method is developed to compute the average packet travel time and the energy it consumes. The model is able to capture the effects of increased loss rate in areas remote from the source and destination, variable rate of advancement towards destination over the route, as well as of defending against malicious packets within a certain distance from the destination. We then consider sending multiple coded packets that follow independent paths to the destination node so as to mitigate the effects of losses and routing inaccuracies. We study a homogeneous medium and obtain the time-dependent properties of the packet’s travel process, allowing us to compare the merits and limitations of coding, both in terms of delivery times and energy efficiency. Finally, we propose models that can assist in the analysis and optimisation of the performance of inter-flow network coding (NC). We analyse two queueing models for a router that carries out NC, in addition to its standard packet routing function. The approach is extended to the study of multiple hops, which leads to an optimisation problem that characterises the optimal time that packets should be held back in a router, waiting for coding opportunities to arise, so that the total packet end-to-end delay is minimised

The 2005 HST Calibration Workshop Hubble After the Transition to Two-Gyro Mode

The 2005 HST Calibration Workshop was held at the Space Telescope Science Institute during October 26, 2005 to bring together members of the observing community, the instrument development teams, and the STScI instrument support teams to share information and techniques. Presentations included the two-gyro performance of HST and FGS, advances in the calibration of a number of instruments, the results of other instruments after their return from space, and the status of still others which are scheduled for installation during the next servicing mission. Cross-calibration between HST and JWST was discussed, as well as the new Guide Star Catalog and advances in data analysis software. This book contains the published record of the workshop, while all the talks and posters are available electronically on the workshop Web site

Computer-aided detection and diagnosis of breast cancer in 2D and 3D medical imaging through multifractal analysis

This Thesis describes the research work performed in the scope of a doctoral research program and presents its conclusions and contributions. The research activities were carried on in the industry with Siemens S.A. Healthcare Sector, in integration with a research team. Siemens S.A. Healthcare Sector is one of the world biggest suppliers of products, services and complete solutions in the medical sector. The company offers a wide selection of diagnostic and therapeutic equipment and information systems. Siemens products for medical imaging and in vivo diagnostics include: ultrasound, computer tomography, mammography, digital breast tomosynthesis, magnetic resonance, equipment to angiography and coronary angiography, nuclear imaging, and many others. Siemens has a vast experience in Healthcare and at the beginning of this project it was strategically interested in solutions to improve the detection of Breast Cancer, to increase its competitiveness in the sector. The company owns several patents related with self-similarity analysis, which formed the background of this Thesis. Furthermore, Siemens intended to explore commercially the computer- aided automatic detection and diagnosis eld for portfolio integration. Therefore, with the high knowledge acquired by University of Beira Interior in this area together with this Thesis, will allow Siemens to apply the most recent scienti c progress in the detection of the breast cancer, and it is foreseeable that together we can develop a new technology with high potential. The project resulted in the submission of two invention disclosures for evaluation in Siemens A.G., two articles published in peer-reviewed journals indexed in ISI Science Citation Index, two other articles submitted in peer-reviewed journals, and several international conference papers. This work on computer-aided-diagnosis in breast led to innovative software and novel processes of research and development, for which the project received the Siemens Innovation Award in 2012. It was very rewarding to carry on such technological and innovative project in a socially sensitive area as Breast Cancer.No cancro da mama a deteção precoce e o diagnóstico correto são de extrema importância na prescrição terapêutica e caz e e ciente, que potencie o aumento da taxa de sobrevivência à doença. A teoria multifractal foi inicialmente introduzida no contexto da análise de sinal e a sua utilidade foi demonstrada na descrição de comportamentos siológicos de bio-sinais e até na deteção e predição de patologias. Nesta Tese, três métodos multifractais foram estendidos para imagens bi-dimensionais (2D) e comparados na deteção de microcalci cações em mamogramas. Um destes métodos foi também adaptado para a classi cação de massas da mama, em cortes transversais 2D obtidos por ressonância magnética (RM) de mama, em grupos de massas provavelmente benignas e com suspeição de malignidade. Um novo método de análise multifractal usando a lacunaridade tri-dimensional (3D) foi proposto para classi cação de massas da mama em imagens volumétricas 3D de RM de mama. A análise multifractal revelou diferenças na complexidade subjacente às localizações das microcalci cações em relação aos tecidos normais, permitindo uma boa exatidão da sua deteção em mamogramas. Adicionalmente, foram extraídas por análise multifractal características dos tecidos que permitiram identi car os casos tipicamente recomendados para biópsia em imagens 2D de RM de mama. A análise multifractal 3D foi e caz na classi cação de lesões mamárias benignas e malignas em imagens 3D de RM de mama. Este método foi mais exato para esta classi cação do que o método 2D ou o método padrão de análise de contraste cinético tumoral. Em conclusão, a análise multifractal fornece informação útil para deteção auxiliada por computador em mamogra a e diagnóstico auxiliado por computador em imagens 2D e 3D de RM de mama, tendo o potencial de complementar a interpretação dos radiologistas

On the Impact of Phase Noise in Communication Systems –- Performance Analysis and Algorithms

The mobile industry is preparing to scale up the network capacity by a factor of 1000x in order to cope with the staggering growth in mobile traffic. As a consequence, there is a tremendous pressure on the network infrastructure, where more cost-effective, flexible, high speed connectivity solutions are being sought for. In this regard, massive multiple-input multiple-output (MIMO) systems, and millimeter-wave communication systems are new physical layer technologies, which promise to facilitate the 1000 fold increase in network capacity. However, these technologies are extremely prone to hardware impairments like phase noise caused by noisy oscillators. Furthermore, wireless backhaul networks are an effective solution to transport data by using high-order signal constellations, which are also susceptible to phase noise impairments. Analyzing the performance of wireless communication systems impaired by oscillator phase noise, and designing systems to operate efficiently in strong phase noise conditions are critical problems in communication theory. The criticality of these problems is accentuated with the growing interest in new physical layer technologies, and the deployment of wireless backhaul networks. This forms the main motivation for this thesis where we analyze the impact of phase noise on the system performance, and we also design algorithms in order to mitigate phase noise and its effects. First, we address the problem of maximum a posteriori (MAP) detection of data in the presence of strong phase noise in single-antenna systems. This is achieved by designing a low-complexity joint phase-estimator data-detector. We show that the proposed method outperforms existing detectors, especially when high order signal constellations are used. Then, in order to further improve system performance, we consider the problem of optimizing signal constellations for transmission over channels impaired by phase noise. Specifically, we design signal constellations such that the error rate performance of the system is minimized, and the information rate of the system is maximized. We observe that these optimized constellations significantly improve the system performance, when compared to conventional constellations, and those proposed in the literature. Next, we derive the MAP symbol detector for a MIMO system where each antenna at the transceiver has its own oscillator. We propose three suboptimal, low-complexity algorithms for approximately implementing the MAP symbol detector, which involve joint phase noise estimation and data detection. We observe that the proposed techniques significantly outperform the other algorithms in prior works. Finally, we study the impact of phase noise on the performance of a massive MIMO system, where we analyze both uplink and downlink performances. Based on rigorous analyses of the achievable rates, we provide interesting insights for the following question: how should oscillators be connected to the antennas at a base station, which employs a large number of antennas