Intelligent Sensor Networks

In the last decade, wireless or wired sensor networks have attracted much attention. However, most designs target general sensor network issues including protocol stack (routing, MAC, etc.) and security issues. This book focuses on the close integration of sensing, networking, and smart signal processing via machine learning. Based on their world-class research, the authors present the fundamentals of intelligent sensor networks. They cover sensing and sampling, distributed signal processing, and intelligent signal learning. In addition, they present cutting-edge research results from leading experts

Distribuição de conteúdos em redes veiculares usando mecanismos de comunicação tolerantes ao atraso

Mestrado em Engenharia Eletrónica e TelecomunicaçõesThe last couple of decades have been the stage for the introduction of new telecommunication networks. It is expected that in the future all types of vehicles, such as cars, buses and trucks have the ability to intercommunicate and form a vehicular network. Vehicular networks display particularities when compared to other networks due to their continuous node mobility and their wide geographical dispersion, leading to a permanent network fragmentation. Therefore, the main challenges that this type of network entails relate to the intermittent connectivity and the long and variable delay in information delivery. To address the problems related to the intermittent connectivity, a new concept was introduced – Delay Tolerant Network (DTN). This architecture is built on a Store-Carry-and-Forward (SCF) mechanism in order to assure the delivery of information when there is no end-to-end path defined. Vehicular networks support a multiplicity of services, including the transportation of non-urgent information. Therefore, it is possible to conclude that the use of a DTN for the dissemination of non-urgent information is able to surpass the aforementioned challenges. The work developed focused on the use of DTNs for the dissemination of non-urgent information. This information is originated in the network service provider and should be available on mobile network terminals during a limited period of time. In order to do so, four different strategies were deployed: Random, Least Number of Hops First (LNHF), Local Rarest Bundle First (LRBF) e Local Rarest Generation First (LRGF). All of these strategies have a common goal: to disseminate content into the network in the shortest period of time and minimizing network congestion. This work also contemplates the analysis and implementation of techniques that reduce network congestion. The design, implementation and validation of the proposed strategies was divided into three stages. The first stage focused on creating a Matlab emulator for the fast implementation and strategy validation. This stage resulted in the four strategies that were afterwards implemented in the DTNs software Helix – developed in a partnership between Instituto de Telecomunicac¸˜oes (IT) and Veniam R , which are responsible for the largest operating vehicular network worldwide that is located in Oporto city. The strategies were later evaluated on an emulator that was built for the largescale testing of DTN. Both emulators account for vehicular mobility based on information previously collected from the real platform. Finally, the strategy that presented the best overall performance was tested on a real platform – in a lab environment – for concept and operability demonstration. It is possible to conclude that two of the implemented strategies (LRBF and LRGF) can be deployed in the real network and guarantee a significant delivery rate. The LRBF strategy has the best performance in terms of delivery. However, it needs to add a significant overhead to the network in order to work. In the future, tests of scalability should be conducted in a real environment in order to confirm the emulator results. The real implementation of the strategies should be accompanied by the introduction of new types of services for content distribution.Nas últimas décadas tem-se assistido à introdução de novas redes de telecomunicações. Entre estas destacam-se as redes veiculares constituídas por todo o tipo de veículos com capacidades de intercomunicação. As redes veiculares têm especificidades singulares face a outro tipo de redes devido à constante mobilidade dos nós e à sua elevada dispersão geográfica. Os principais desafios introduzidos por este tipo de redes prendem-se com a conectividade intermitente e o atraso longo e variado na entrega da informação. Por forma a fazer face aos problemas relacionados com a conectividade intermitente, introduziu-se um novo conceito intitulado de Delay Tolerant Network (DTN). Esta arquitetura assenta num mecanismo de StoreCarry-and-Forward (SCF) por forma a garantir a entrega de informação em situações onde não existe um caminho estabelecido fim-a-fim. As redes veiculares suportam uma multiplicidade de serviços, nos quais se inclui o transporte de informação não-urgente. Desta forma, a utilização de uma DTN para a difusão de informação não-urgente permite ultrapassar os desafios identificados anteriormente. O trabalho realizado foca-se na utilização de DTNs para a disseminação de informação não-urgente. Por forma a operacionalizar esta premissa foram implementadas quatro estratégias distintas: Random, Least Number of Hops First (LNHF), Local Rarest Bundle First (LRBF) e Local Rarest Generation First (LRGF). Todas estas estratégias tem um objetivo comum: disseminar um conteúdo na rede no menor tempo possível minimizando ao máximo o congestionamento da rede. Foram também implementadas e estudadas técnicas para minimizar o congestionamento do meio. A metodologia de desenho, implementação e validação das estratégias propostas foi desenvolvida em três fases. A primeira focou-se na criação de um emulador Matlab para a implementação rápida e validação das estratégias. Dessa primeira fase resultaram quatro estratégias que foram posteriormente implementadas no software de DTNs Helix desenvolvido através de uma parceria entre o Instituto de Telecomunicações (IT) e a Veniam R (responsáveis pela maior rede veicular em operação a nível mundial localizada na cidade do Porto). As estratégias foram depois avaliadas num emulador construído para fazer testes de grande escala. Ambos os emuladores introduzem a mobilidade dos veículos com base em informação recolhida previamente da plataforma real. Por fim a estratégia que apresentou o melhor desempenho foi introduzida e testada numa plataforma real para demonstração de conceito e operacionalidade. Conclui-se que duas das estratégias implementadas (LRBF and LRGF) são passíveis de utilização na rede real garantido uma taxa de entrega significativa. A estratégia LRBF apresentou o melhor desempenho em termos de entrega, no entanto, necessita de adicionar um overhead considerável na rede para funcionar. No futuro devem ser realizados testes de escalabilidade em ambiente real por forma a confirmar os resultados obtidos em ambiente de emulação e real em pequena escala. A implementação real das estratégias deve ser acompanhada pela introdução de novos tipos de serviços para distribuição de conteúdos

Advances in Computer Science and Engineering

The book Advances in Computer Science and Engineering constitutes the revised selection of 23 chapters written by scientists and researchers from all over the world. The chapters cover topics in the scientific fields of Applied Computing Techniques, Innovations in Mechanical Engineering, Electrical Engineering and Applications and Advances in Applied Modeling

Using MapReduce Streaming for Distributed Life Simulation on the Cloud

Distributed software simulations are indispensable in the study of large-scale life models but often require the use of technically complex lower-level distributed computing frameworks, such as MPI. We propose to overcome the complexity challenge by applying the emerging MapReduce (MR) model to distributed life simulations and by running such simulations on the cloud. Technically, we design optimized MR streaming algorithms for discrete and continuous versions of Conway’s life according to a general MR streaming pattern. We chose life because it is simple enough as a testbed for MR’s applicability to a-life simulations and general enough to make our results applicable to various lattice-based a-life models. We implement and empirically evaluate our algorithms’ performance on Amazon’s Elastic MR cloud. Our experiments demonstrate that a single MR optimization technique called strip partitioning can reduce the execution time of continuous life simulations by 64%. To the best of our knowledge, we are the first to propose and evaluate MR streaming algorithms for lattice-based simulations. Our algorithms can serve as prototypes in the development of novel MR simulation algorithms for large-scale lattice-based a-life models.https://digitalcommons.chapman.edu/scs_books/1014/thumbnail.jp

MS FT-2-2 7 Orthogonal polynomials and quadrature: Theory, computation, and applications

Quadrature rules find many applications in science and engineering. Their analysis is a classical area of applied mathematics and continues to attract considerable attention. This seminar brings together speakers with expertise in a large variety of quadrature rules. It is the aim of the seminar to provide an overview of recent developments in the analysis of quadrature rules. The computation of error estimates and novel applications also are described

Generalized averaged Gaussian quadrature and applications

A simple numerical method for constructing the optimal generalized averaged Gaussian quadrature formulas will be presented. These formulas exist in many cases in which real positive GaussKronrod formulas do not exist, and can be used as an adequate alternative in order to estimate the error of a Gaussian rule. We also investigate the conditions under which the optimal averaged Gaussian quadrature formulas and their truncated variants are internal

Variation of Soil Structure in the Foot and Toe Slopes of Mt. Vukan, East-central Serbia

This paper presents the variation of soil structure along the foot and toe slopes of Mt. Vukan, East-Central Serbia. The analysis of aggregate size distribution and structure indices were conducted by means of soil units, characteristic soil horizons and elevation differences along the study area. Soils of Great Field located at different elevations were found to have significant variation in ASD and soil structure indices. Topsoil horizon of Eutric Cambisols have higher MWD after dry sieving, but at the same time it has the highest variation in MWD after wet sieving, indicating low water stability, which is opposite to the coefficient of aggregability. We share an opinion that change in MWD better depicts soils structure stability to water. The results of correlation analysis indicated that clay content is correlated more to structure indices compared with SOM content. SOM is significantly correlated with ASD and soil structure indices only in Calcomelansols, whereas the significant correlation of clay content and soil structure is more evident in Eutric Cambisols and Non-calcaric Chernozems, compared with other soil units. Soil structure variation along the lowest chain of Catena might be strong, and that it has to be analyzed from the point of view of soil unit and their corresponding soil horizons