885 resultados para distributed network protocol (DNP3)
Resumo:
The making of the modern world has long been fuelled by utopian images that are blind to ecologi- cal reality. Botanical gardens are but one example – who typically portray themselves as miniature, isolated 'edens on earth', whereas they are now in many cases self-evidently also the vital ‘lungs’ of crowded cities, as well as critical habitats for threat- ened biodiversity. In 2010 the 'Remnant Emergency Art lab' set out to question utopian thinking through a creative provocation called the 'Botanical Gardens ‘X-Tension’ - an imagined city-wide, distributed, network of 'ecological gardens' suited to both bat and human needs, in order to ask, what now needs to be better understood, connected and therefore ultimately conserved.
Resumo:
This work experimentally examines the performance benefits of a regional CORS network to the GPS orbit and clock solutions for supporting real-time Precise Point Positioning (PPP). The regionally enhanced GPS precise orbit solutions are derived from a global evenly distributed CORS network added with a densely distributed network in Australia and New Zealand. A series of computational schemes for different network configurations are adopted in the GAMIT-GLOBK and PANDA data processing. The precise GPS orbit results show that the regionally enhanced solutions achieve the overall orbit improvements with respect to the solutions derived from the global network only. Additionally, the orbital differences over GPS satellite arcs that are visible by any of the five Australia-wide CORS stations show a higher percentage of overall improvements compared to the satellite arcs that are not visible from these stations. The regional GPS clock and Uncalibrated Phase Delay (UPD) products are derived using the PANDA real time processing module from Australian CORS networks of 35 and 79 stations respectively. Analysis of PANDA kinematic PPP and kinematic PPP-AR solutions show certain overall improvements in the positioning performance from a denser network configuration after solution convergence. However, the clock and UPD enhancement on kinematic PPP solutions is marginal. It is suggested that other factors, such as effects of ionosphere, incorrectly fixed ambiguities, may be the more dominating, deserving further research attentions.
Resumo:
Denial-of-service (DoS) attacks are a growing concern to networked services like the Internet. In recent years, major Internet e-commerce and government sites have been disabled due to various DoS attacks. A common form of DoS attack is a resource depletion attack, in which an attacker tries to overload the server's resources, such as memory or computational power, rendering the server unable to service honest clients. A promising way to deal with this problem is for a defending server to identify and segregate malicious traffic as earlier as possible. Client puzzles, also known as proofs of work, have been shown to be a promising tool to thwart DoS attacks in network protocols, particularly in authentication protocols. In this thesis, we design efficient client puzzles and propose a stronger security model to analyse client puzzles. We revisit a few key establishment protocols to analyse their DoS resilient properties and strengthen them using existing and novel techniques. Our contributions in the thesis are manifold. We propose an efficient client puzzle that enjoys its security in the standard model under new computational assumptions. Assuming the presence of powerful DoS attackers, we find a weakness in the most recent security model proposed to analyse client puzzles and this study leads us to introduce a better security model for analysing client puzzles. We demonstrate the utility of our new security definitions by including two hash based stronger client puzzles. We also show that using stronger client puzzles any protocol can be converted into a provably secure DoS resilient key exchange protocol. In other contributions, we analyse DoS resilient properties of network protocols such as Just Fast Keying (JFK) and Transport Layer Security (TLS). In the JFK protocol, we identify a new DoS attack by applying Meadows' cost based framework to analyse DoS resilient properties. We also prove that the original security claim of JFK does not hold. Then we combine an existing technique to reduce the server cost and prove that the new variant of JFK achieves perfect forward secrecy (the property not achieved by original JFK protocol) and secure under the original security assumptions of JFK. Finally, we introduce a novel cost shifting technique which reduces the computation cost of the server significantly and employ the technique in the most important network protocol, TLS, to analyse the security of the resultant protocol. We also observe that the cost shifting technique can be incorporated in any Diffine{Hellman based key exchange protocol to reduce the Diffie{Hellman exponential cost of a party by one multiplication and one addition.
Resumo:
Semantic knowledge is supported by a widely distributed neuronal network, with differential patterns of activation depending upon experimental stimulus or task demands. Despite a wide body of knowledge on semantic object processing from the visual modality, the response of this semantic network to environmental sounds remains relatively unknown. Here, we used fMRI to investigate how access to different conceptual attributes from environmental sound input modulates this semantic network. Using a range of living and manmade sounds, we scanned participants whilst they carried out an object attribute verification task. Specifically, we tested visual perceptual, encyclopedic, and categorical attributes about living and manmade objects relative to a high-level auditory perceptual baseline to investigate the differential patterns of response to these contrasting types of object-related attributes, whilst keeping stimulus input constant across conditions. Within the bilateral distributed network engaged for processing environmental sounds across all conditions, we report here a highly significant dissociation within the left hemisphere between the processing of visual perceptual and encyclopedic attributes of objects.
Resumo:
In the present study we utilised functional magnetic resonance imaging (fMRI) to examine cerebral activation during performance of a classic motor task in which response suppression load was parametrically varied. Linear increases in activity were observed in a distributed network of regions across both cerebral hemispheres, although with more extensive involvement of the right prefrontal cortex. Activated regions included prefrontal, parietal and occipitotemporal cortices. Decreasing activation was similarly observed in a distributed network of regions. These response forms are discussed in terms of an increasing requirement for visual cue discrimination and suppression/selection of motor responses, and a decreasing probability of the occurrence of non-target stimuli and attenuation of a prepotent tendency to respond. The results support recent proposals for a dominant role for the right-hemisphere in performance of motor response suppression tasks that emphasise the importance of the right prefrontal cortex.
Resumo:
Acute pain has substantial survival value because of its protective function in the everyday environment. Instead, chronic pain lacks survival and adaptive function, causes great amount of individual suffering, and consumes the resources of the society due to the treatment costs and loss of production. The treatment of chronic pain has remained challenging because of inadequate understanding of mechanisms working at different levels of the nervous system in the development, modulation, and maintenance of chronic pain. Especially in unclear chronic pain conditions the treatment may be suboptimal because it can not be targeted to the underlying mechanisms. Noninvasive neuroimaging techniques have greatly contributed to our understanding of brain activity associated with pain in healthy individuals. Many previous studies, focusing on brain activations to acute experimental pain in healthy individuals, have consistently demonstrated a widely-distributed network of brain regions that participate in the processing of acute pain. The aim of the present thesis was to employ non-invasive brain imaging to better understand the brain mechanisms in patients suffering from chronic pain. In Study I, we used magnetoencephalography (MEG) to measure cortical responses to painful laser stimulation in healthy individuals for optimization of the stimulus parameters for patient studies. In Studies II and III, we monitored with MEG the cortical processing of touch and acute pain in patients with complex regional pain syndrome (CRPS). We found persisting plastic changes in the hand representation area of the primary somatosensory (SI) cortex, suggesting that chronic pain causes cortical reorganization. Responses in the posterior parietal cortex to both tactile and painful laser stimulation were attenuated, which could be associated with neglect-like symptoms of the patients. The primary motor cortex reactivity to acute pain was reduced in patients who had stronger spontaneous pain and weaker grip strength in the painful hand. The tight coupling between spontaneous pain and motor dysfunction supports the idea that motor rehabilitation is important in CRPS. In Studies IV and V we used MEG and functional magnetic resonance imaging (fMRI) to investigate the central processing of touch and acute pain in patients who suffered from recurrent herpes simplex virus infections and from chronic widespread pain in one side of the body. With MEG, we found plastic changes in the SI cortex, suggesting that many different types of chronic pain may be associated with similar cortical reorganization. With fMRI, we found functional and morphological changes in the central pain circuitry, as an indication of central contribution for the pain. These results show that chronic pain is associated with morphological and functional changes in the brain, and that such changes can be measured with functional imaging.
Resumo:
An (alpha, beta)-spanner of an unweighted graph G is a subgraph H that distorts distances in G up to a multiplicative factor of a and an additive term beta. It is well known that any graph contains a (multiplicative) (2k - 1, 0)-spanner of size O(n(1+1/k)) and an (additive) (1, 2)-spanner of size O(n(3/2)). However no other additive spanners are known to exist. In this article we develop a couple of new techniques for constructing (alpha, beta)-spanners. Our first result is an additive (1, 6)-spanner of size O(n(4/3)). The construction algorithm can be understood as an economical agent that assigns costs and values to paths in the graph, purchasing affordable paths and ignoring expensive ones, which are intuitively well approximated by paths already purchased. We show that this path buying algorithm can be parameterized in different ways to yield other sparseness-distortion tradeoffs. Our second result addresses the problem of which (alpha, beta)-spanners can be computed efficiently, ideally in linear time. We show that, for any k, a (k, k - 1)-spanner with size O(kn(1+1/k)) can be found in linear time, and, further, that in a distributed network the algorithm terminates in a constant number of rounds. Previous spanner constructions with similar performance had roughly twice the multiplicative distortion.
Resumo:
A built-in-self-test (BIST) subsystem embedded in a 65-nm mobile broadcast video receiver is described. The subsystem is designed to perform analog and RF measurements at multiple internal nodes of the receiver. It uses a distributed network of CMOS sensors and a low bandwidth, 12-bit A/D converter to perform the measurements with a serial bus interface enabling a digital transfer of measured data to automatic test equipment (ATE). A perturbation/correlation based BIST method is described, which makes pass/fail determination on parts, resulting in significant test time and cost reduction.
Resumo:
Storage systems are widely used and have played a crucial rule in both consumer and industrial products, for example, personal computers, data centers, and embedded systems. However, such system suffers from issues of cost, restricted-lifetime, and reliability with the emergence of new systems and devices, such as distributed storage and flash memory, respectively. Information theory, on the other hand, provides fundamental bounds and solutions to fully utilize resources such as data density, information I/O and network bandwidth. This thesis bridges these two topics, and proposes to solve challenges in data storage using a variety of coding techniques, so that storage becomes faster, more affordable, and more reliable.
We consider the system level and study the integration of RAID schemes and distributed storage. Erasure-correcting codes are the basis of the ubiquitous RAID schemes for storage systems, where disks correspond to symbols in the code and are located in a (distributed) network. Specifically, RAID schemes are based on MDS (maximum distance separable) array codes that enable optimal storage and efficient encoding and decoding algorithms. With r redundancy symbols an MDS code can sustain r erasures. For example, consider an MDS code that can correct two erasures. It is clear that when two symbols are erased, one needs to access and transmit all the remaining information to rebuild the erasures. However, an interesting and practical question is: What is the smallest fraction of information that one needs to access and transmit in order to correct a single erasure? In Part I we will show that the lower bound of 1/2 is achievable and that the result can be generalized to codes with arbitrary number of parities and optimal rebuilding.
We consider the device level and study coding and modulation techniques for emerging non-volatile memories such as flash memory. In particular, rank modulation is a novel data representation scheme proposed by Jiang et al. for multi-level flash memory cells, in which a set of n cells stores information in the permutation induced by the different charge levels of the individual cells. It eliminates the need for discrete cell levels, as well as overshoot errors, when programming cells. In order to decrease the decoding complexity, we propose two variations of this scheme in Part II: bounded rank modulation where only small sliding windows of cells are sorted to generated permutations, and partial rank modulation where only part of the n cells are used to represent data. We study limits on the capacity of bounded rank modulation and propose encoding and decoding algorithms. We show that overlaps between windows will increase capacity. We present Gray codes spanning all possible partial-rank states and using only ``push-to-the-top'' operations. These Gray codes turn out to solve an open combinatorial problem called universal cycle, which is a sequence of integers generating all possible partial permutations.
Resumo:
Índice: - Sobre museos, redes sociales y tecnología 2.0 (Alex Ibáñez Etxeberria). - Sitios web y museos: nuevas aplicaciones para el aprendizaje informal (Mikel Asensio, Elena Asenjo y Alex Ibáñez Etxeberria). - From headphones to microphones: mobile social media in the museum as distributed network (Nancy Proctor). - Mobile learning y patrimionio: aprendiendo historia con mi teléfono, mi GPS y mi PDA (Alex Ibáñez Etxeberria, Mikel Asensio y José Miguel Correa). - Digital asset management strategies for multi-platform content delivery (Titus Bicknell). - Redes sociales y museos participativos: la irrupción de las tecnologías 2.0 en la sociedad y su aplicación en los museos a través del caso de Arazi (Juan José Aranburu).
Resumo:
Web GIS作为一门新兴的技术学科 ,依托互联网的环境和 Internet实用技术 ,成为地理信息系统理论研究和技术创新的增长点。随着网络技术和应用市场的不断发展和扩大 ,将促进 GIS新兴信息产业的形成。本文结合工作实践 ,论述了 Web GIS的技术背景与发展 ,以及系统功能等基础理论 ,重点讨论了 Web GIS的体系结构、实现策略和技术方法
Resumo:
设计了基于CAN协议的AUV内部通讯总线系统 .系统通过协议转换器的模块化、可配置性设计满足AUV系统对其内部通讯总线的开放性要求 .协议转换器内部的容错处理能力以及紧急事件处理节点的设计为增强AUV系统的可靠性和容错能力、为避免AUV在深海工作环境下丢失增加有力的保障措施
Resumo:
Server performance has become a crucial issue for improving the overall performance of the World-Wide Web. This paper describes Webmonitor, a tool for evaluating and understanding server performance, and presents new results for a realistic workload. Webmonitor measures activity and resource consumption, both within the kernel and in HTTP processes running in user space. Webmonitor is implemented using an efficient combination of sampling and event-driven techniques that exhibit low overhead. Our initial implementation is for the Apache World-Wide Web server running on the Linux operating system. We demonstrate the utility of Webmonitor by measuring and understanding the performance of a Pentium-based PC acting as a dedicated WWW server. Our workload uses a file size distribution with a heavy tail. This captures the fact that Web servers must concurrently handle some requests for large audio and video files, and a large number of requests for small documents, containing text or images. Our results show that in a Web server saturated by client requests, over 90% of the time spent handling HTTP requests is spent in the kernel. Furthermore, keeping TCP connections open, as required by TCP, causes a factor of 2-9 increase in the elapsed time required to service an HTTP request. Data gathered from Webmonitor provide insight into the causes of this performance penalty. Specifically, we observe a significant increase in resource consumption along three dimensions: the number of HTTP processes running at the same time, CPU utilization, and memory utilization. These results emphasize the important role of operating system and network protocol implementation in determining Web server performance.