Influence of Spatial Variability on Pavement Responses Using Latin Hypercube Sampling on Two-Dimensional Random Fields

Although uncertainties in material properties have been addressed in the design of flexible pavements, most current modeling techniques assume that pavement layers are homogeneous. The paper addresses the influence of the spatial variability of the resilient moduli of pavement layers by evaluating the effect of the variance and correlation length on the pavement responses to loading. The integration of the spatially varying log-normal random field with the finite-difference method has been achieved through an exponential autocorrelation function. The variation in the correlation length was found to have a marginal effect on the mean values of the critical strains and a noticeable effect on the standard deviation which decreases with decreases in correlation length. This reduction in the variance arises because of the spatial averaging phenomenon over the softer and stiffer zones generated because of spatial variability. The increase in the mean value of critical strains with decreasing correlation length, although minor, illustrates that pavement performance is adversely affected by the presence of spatially varying layers. The study also confirmed that the higher the variability in the pavement layer moduli, introduced through a higher value of coefficient of variation (COV), the higher the variability in the pavement response. The study concludes that ignoring spatial variability by modeling the pavement layers as homogeneous that have very short correlation lengths can result in the underestimation of the critical strains and thus an inaccurate assessment of the pavement performance. (C) 2014 American Society of Civil Engineers.

Viejos problemas en ciudades nuevas : La Plata: agua potable y problemas sanitarios en la época fundacional

Resumen: La fundación de la ciudad de La Plata tiene por lo menos una doble significación. En primer lugar puso fin a décadas de desencuentros entre las autoridades nacionales y provinciales por la llamada “cuestión capital” que tuvo su primer hito en la federalización de la ciudad de Buenos Aires en 1880. En segundo lugar La Plata era una ciudad nueva, pensada y diseñada para superar los problemas que asolaban a las ciudades viejas. Uno de estos problemas que recibió particular atención por parte de los “fundadores” fue el suministro de agua e instalaciones sanitarias. No obstante su resolución planteaba serios problemas técnicos y un elevado coste económico. Estos primeros años de vida platense estuvieron marcados por el auge de la llamada higiene social fundada por las transformaciones producidas por la revolución pasteuriana y la resignificación ideológica de las causas sociales que originan la enfermedad. En este sentido, la higiene social retoma el viejo cuerpo programático de la higiene pública: agua, recolección de residuos, pavimentos (causas directas) pero agrega otros ligados a las "causas indirectas": salarios, alojamientos, condiciones de trabajo de los obreros. Nosotros analizaremos cómo los profesionales responsables de la administración de la ciudad de La Plata entendieron y enfrentaron el problema del suministro de agua potable en un núcleo urbano que experimentaba un formidable crecimiento demográfico.

Exibição de Propaganda Personalizada com o uso de Realidade Aumentada

É apresentado como problema atual na área de Publicidade e Propaganda a exibição de conteúdo personalizado para nichos específicos. A propaganda acaba se concentrando nos produtos de maior sucesso, tendo como foco alguns públicos-alvo previamente determinados. Assim, o estudo pretende avaliar um novo canal para exibição de propaganda em nível individual, através das perspectivas da Cauda Longa e da Realidade Aumentada (R.A.). O ponto principal desse trabalho é, portanto, mostrar a quantidade de nichos existentes e sugerir uma personalização da propaganda a um nível praticamente individual, como uma ligação direta entre produto e consumidor, usando como suporte tecnológico a R.A. A partir da análise de trabalhos de Romero Tori, Paul Milgram, Ronald Azuma, Cláudio Kirner, Robson Siscouto, Lúcia Santaella, entre outros autores, foi feita uma avaliação dos principais pontos de interesse da tecnologia de Realidade Aumentada para profissionais da área do Design. Discorrendo não só sobre suas características como também identificando problemas e questionamentos atuais, tanto para esses profissionais como para o consumidor final. A tese se enquadra na linha de pesquisa de Design e Tecnologia ao passo que os profissionais desta área de conhecimento são responsáveis diretos por pensar as formas de interação de modo que sejam mais orgânicas e intuitivas para os usuários. Existe muito trabalho a ser realizado, no tocante à Ergonomia e Usabilidade, nas soluções que usam a Realidade Aumentada, principalmente na forma como se dá a sobreposição da informação digital ao ambiente real capturado pela câmera e sua manipulação pelo indivíduo.

Analysis of asphalt concrete permeability data using representative pore size

The permeability of asphalt concrete has been the subject of much study by pavement engineers over the last decade. The work undertaken has tended to focus on high air voids as the primary indicator of permeable asphalt concrete. This paper presents a simple approach for understanding the parameters that affect permeability. Principles explained by Taylor in 1956 in channel theory work for soils are used to derive a new parameter-representative pore size. Representative pore size is related to the air voids in the compacted mix and the D75 of the asphalt mix grading curve. Collected Superpave permeability data from published literature and data collected by the writers at the Queensland Department of Transport and Main Roads is shown to be better correlated with representative pore size than air voids, reducing the scatter considerably. Using the database of collected field and laboratory permeability values an equation is proposed that pavement engineers can use to estimate the permeability of in-place pavements. © 2011 ASCE.

Fracture mechanics of idealised bituminous mixes

© 2014 Taylor & Francis. The durability of asphalt pavements is strongly impaired by cracks, caused primarily by traffic loads and environmental effects. In this work, fracture behaviour of idealised asphalt mixes is investigated. Experiments on idealised asphalt mixes under pure-tension mode (mode I cracking) were performed and fracture parameters were evaluated. In these three-point bend fracture tests, the test variables were temperature and load rate. The test data were stored in an asphalt materials database and special-purpose tools were implemented to analyse and handle the laboratory data automatically. Fracture mechanism maps were constructed, showing the conditions associated with ductile, brittle and ductile-brittle transition regimes of behaviour. The mechanism maps show the failure response of the material in terms of the stress intensity factor, strain energy release rate and J-integral as a function of the temperature-compensated crack mouth opening strain rate. Fracture behaviour of asphalt mix specimens was simulated by cohesive zone model in conjunction with a novel material constitutive model for asphalt mixes. The finite element model agrees well with the experimental results and provides insights into fracture response of the notched asphalt mix beam specimens.

移动自组网中感知拓扑失配的P2P覆盖网构建

对等计算主要关注构造在应用层的虚拟覆盖网络.在上层的覆盖网络和底层的物理网络之间,通常都存在着拓扑失配.这种失配会导致P2P应用耗费相当大的通信开销.在移动自组网中,由于资源(比如带宽,电池能量等)和节点移动性的限制,拓扑失配问题变得更加严重.而已有工作对这一问题没有进行充分的研究.本文研究了移动自组网中的拓扑失配问题对非结构化P2P覆盖网中目标搜索的影响,并提出一个分布式的、能感知拓扑失配的覆盖网络构建算法D-TAOC.分析和实验表明在D-TAOC构建的拓扑失配感知的覆盖网中,P2P应用能够在较少牺牲目标搜索效率的前提下,明显地降低网络中的通信负载.

Cluster-Based Optimizations for Distributed Hash Tables

We consider the problem of performing topological optimizations of distributed hash tables. Such hash tables include Chord and Tapestry and are a popular building block for distributed applications. Optimizing topologies over one dimensional hash spaces is particularly difficult as the higher dimensionality of the underlying network makes close fits unlikely. Instead, current schemes are limited to heuristically performing local optimizations finding the best of small random set of peers. We propose a new class of topology optimizations based on the existence of clusters of close overlay members within the underlying network. By constructing additional overlays for each cluster, a significant portion of the search procedure can be performed within the local cluster with a corresponding reduction in the search time. Finally, we discuss the effects of these additional overlays on spatial locality and other load balancing scheme.

Improving the Performance of Overlay Routing and P2P File Sharing using Selfish Neighbor Selection

A foundational issue underlying many overlay network applications ranging from routing to P2P file sharing is that of connectivity management, i.e., folding new arrivals into the existing mesh and re-wiring to cope with changing network conditions. Previous work has considered the problem from two perspectives: devising practical heuristics for specific applications designed to work well in real deployments, and providing abstractions for the underlying problem that are tractable to address via theoretical analyses, especially game-theoretic analysis. Our work unifies these two thrusts first by distilling insights gleaned from clean theoretical models, notably that under natural resource constraints, selfish players can select neighbors so as to efficiently reach near-equilibria that also provide high global performance. Using Egoist, a prototype overlay routing system we implemented on PlanetLab, we demonstrate that our neighbor selection primitives significantly outperform existing heuristics on a variety of performance metrics; that Egoist is competitive with an optimal, but unscalable full-mesh approach; and that it remains highly effective under significant churn. We also describe variants of Egoist's current design that would enable it to scale to overlays of much larger scale and allow it to cater effectively to applications, such as P2P file sharing in unstructured overlays, based on the use of primitives such as scoped-flooding rather than routing.

Swarming on optimized graphs for n-way broadcast

In an n-way broadcast application each one of n overlay nodes wants to push its own distinct large data file to all other n-1 destinations as well as download their respective data files. BitTorrent-like swarming protocols are ideal choices for handling such massive data volume transfers. The original BitTorrent targets one-to-many broadcasts of a single file to a very large number of receivers and thus, by necessity, employs an almost random overlay topology. n-way broadcast applications on the other hand, owing to their inherent n-squared nature, are realizable only in small to medium scale networks. In this paper, we show that we can leverage this scale constraint to construct optimized overlay topologies that take into consideration the end-to-end characteristics of the network and as a consequence deliver far superior performance compared to random and myopic (local) approaches. We present the Max-Min and MaxSum peer-selection policies used by individual nodes to select their neighbors. The first one strives to maximize the available bandwidth to the slowest destination, while the second maximizes the aggregate output rate. We design a swarming protocol suitable for n-way broadcast and operate it on top of overlay graphs formed by nodes that employ Max-Min or Max-Sum policies. Using trace-driven simulation and measurements from a PlanetLab prototype implementation, we demonstrate that the performance of swarming on top of our constructed topologies is far superior to the performance of random and myopic overlays. Moreover, we show how to modify our swarming protocol to allow it to accommodate selfish nodes.

Overlay Network Creation and Maintenance with Selfish Users

Overlay networks have been used for adding and enhancing functionality to the end-users without requiring modifications in the Internet core mechanisms. Overlay networks have been used for a variety of popular applications including routing, file sharing, content distribution, and server deployment. Previous work has focused on devising practical neighbor selection heuristics under the assumption that users conform to a specific wiring protocol. This is not a valid assumption in highly decentralized systems like overlay networks. Overlay users may act selfishly and deviate from the default wiring protocols by utilizing knowledge they have about the network when selecting neighbors to improve the performance they receive from the overlay. This thesis goes against the conventional thinking that overlay users conform to a specific protocol. The contributions of this thesis are threefold. It provides a systematic evaluation of the design space of selfish neighbor selection strategies in real overlays, evaluates the performance of overlay networks that consist of users that select their neighbors selfishly, and examines the implications of selfish neighbor and server selection to overlay protocol design and service provisioning respectively. This thesis develops a game-theoretic framework that provides a unified approach to modeling Selfish Neighbor Selection (SNS) wiring procedures on behalf of selfish users. The model is general, and takes into consideration costs reflecting network latency and user preference profiles, the inherent directionality in overlay maintenance protocols, and connectivity constraints imposed on the system designer. Within this framework the notion of user’s "best response" wiring strategy is formalized as a k-median problem on asymmetric distance and is used to obtain overlay structures in which no node can re-wire to improve the performance it receives from the overlay. Evaluation results presented in this thesis indicate that selfish users can reap substantial performance benefits when connecting to overlay networks composed of non-selfish users. In addition, in overlays that are dominated by selfish users, the resulting stable wirings are optimized to such great extent that even non-selfish newcomers can extract near-optimal performance through naïve wiring strategies. To capitalize on the performance advantages of optimal neighbor selection strategies and the emergent global wirings that result, this thesis presents EGOIST: an SNS-inspired overlay network creation and maintenance routing system. Through an extensive measurement study on the deployed prototype, results presented in this thesis show that EGOIST’s neighbor selection primitives outperform existing heuristics on a variety of performance metrics, including delay, available bandwidth, and node utilization. Moreover, these results demonstrate that EGOIST is competitive with an optimal but unscalable full-mesh approach, remains highly effective under significant churn, is robust to cheating, and incurs minimal overheads. This thesis also studies selfish neighbor selection strategies for swarming applications. The main focus is on n-way broadcast applications where each of n overlay user wants to push its own distinct file to all other destinations as well as download their respective data files. Results presented in this thesis demonstrate that the performance of our swarming protocol for n-way broadcast on top of overlays of selfish users is far superior than the performance on top of existing overlays. In the context of service provisioning, this thesis examines the use of distributed approaches that enable a provider to determine the number and location of servers for optimal delivery of content or services to its selfish end-users. To leverage recent advances in virtualization technologies, this thesis develops and evaluates a distributed protocol to migrate servers based on end-users demand and only on local topological knowledge. Results under a range of network topologies and workloads suggest that the performance of the distributed deployment is comparable to that of the optimal but unscalable centralized deployment.

Seed Scheduling for Peer-to-Peer Networks

The initial phase in a content distribution (file sharing) scenario is a delicate phase due to the lack of global knowledge and the dynamics of the overlay. An unwise distribution of the pieces in this phase can cause delays in reaching steady state, thus increasing file download times. We devise a scheduling algorithm at the seed (source peer with full content), based on a proportional fair approach, and we implement it on a real file sharing client [1]. In dynamic overlays, our solution improves up to 25% the average downloading time of a standard protocol ala BitTorrent.

Implications of Selfish Neighbor Selection in Overlay Networks

In a typical overlay network for routing or content sharing, each node must select a fixed number of immediate overlay neighbors for routing traffic or content queries. A selfish node entering such a network would select neighbors so as to minimize the weighted sum of expected access costs to all its destinations. Previous work on selfish neighbor selection has built intuition with simple models where edges are undirected, access costs are modeled by hop-counts, and nodes have potentially unbounded degrees. However, in practice, important constraints not captured by these models lead to richer games with substantively and fundamentally different outcomes. Our work models neighbor selection as a game involving directed links, constraints on the number of allowed neighbors, and costs reflecting both network latency and node preference. We express a node's "best response" wiring strategy as a k-median problem on asymmetric distance, and use this formulation to obtain pure Nash equilibria. We experimentally examine the properties of such stable wirings on synthetic topologies, as well as on real topologies and maps constructed from PlanetLab and AS-level Internet measurements. Our results indicate that selfish nodes can reap substantial performance benefits when connecting to overlay networks composed of non-selfish nodes. On the other hand, in overlays that are dominated by selfish nodes, the resulting stable wirings are optimized to such great extent that even non-selfish newcomers can extract near-optimal performance through naive wiring strategies.

NETEMBED: A Network Resource Mapping Service for Distributed Applications

Emerging configurable infrastructures such as large-scale overlays and grids, distributed testbeds, and sensor networks comprise diverse sets of available computing resources (e.g., CPU and OS capabilities and memory constraints) and network conditions (e.g., link delay, bandwidth, loss rate, and jitter) whose characteristics are both complex and time-varying. At the same time, distributed applications to be deployed on these infrastructures exhibit increasingly complex constraints and requirements on resources they wish to utilize. Examples include selecting nodes and links to schedule an overlay multicast file transfer across the Grid, or embedding a network experiment with specific resource constraints in a distributed testbed such as PlanetLab. Thus, a common problem facing the efficient deployment of distributed applications on these infrastructures is that of "mapping" application-level requirements onto the network in such a manner that the requirements of the application are realized, assuming that the underlying characteristics of the network are known. We refer to this problem as the network embedding problem. In this paper, we propose a new approach to tackle this combinatorially-hard problem. Thanks to a number of heuristics, our approach greatly improves performance and scalability over previously existing techniques. It does so by pruning large portions of the search space without overlooking any valid embedding. We present a construction that allows a compact representation of candidate embeddings, which is maintained by carefully controlling the order via which candidate mappings are inserted and invalid mappings are removed. We present an implementation of our proposed technique, which we call NETEMBED – a service that identify feasible mappings of a virtual network configuration (the query network) to an existing real infrastructure or testbed (the hosting network). We present results of extensive performance evaluation experiments of NETEMBED using several combinations of real and synthetic network topologies. Our results show that our NETEMBED service is quite effective in identifying one (or all) possible embeddings for quite sizable queries and hosting networks – much larger than what any of the existing techniques or services are able to handle.

Rats, floods and flowers: London's Gothicized nature

AUTHOR's OVERVIEW This chapter attempts a definition of London eco-gothic, beginning with an ecocritical reading of the ubiquitous London rat. Following Dracula, popular London gothic has been overrun, from the blunt horror-schlock of James Herbert’s 1970s Rats series to China Miéville’s King Rat. Maud Ellman’s elegant discussion of the modernist rat as a protean figure associated with a ‘panoply of fears and fetishes’, underlines how the rat has always featured in anti-urban discourse: as part of racist representations of immigration; as an expression of fear of disease and poverty; or through a quasi-supernatural anxiety about their indestructible and illimitable nature which makes them a staple feature of post-apocalyptic landscapes. Even so, the London rat is a rather more mundane manifestation of urban eco-gothic than the ‘city wilderness’ metaphors common to representations of New York or Los Angles as identified by eco-critic Andrew White. London’s gothic noses its way out through cracks in the pavements, grows from seeds in suburban gardens or accumulates through the steady drip of rainwater. However, I will suggest, in texts such as Maggie Gee’s The Flood and P. D. James’ Children of Men, London eco-gothic becomes less local and familiar as it responds to global environmental crisis with more dramatic tales of minatorial nature.