915 resultados para Common Fixed Point
Resumo:
Mishuris, G; Kuhn, G., (2001) 'Asymptotic behaviour of the elastic solution near the tip of a crack situated at a nonideal interface', Zeitschrift f?r Angewandte Mathematik und Mechanik 81(12) pp.811-826 RAE2008
Resumo:
Wydział Matematyki i Informatyki
Resumo:
For communication-intensive parallel applications, the maximum degree of concurrency achievable is limited by the communication throughput made available by the network. In previous work [HPS94], we showed experimentally that the performance of certain parallel applications running on a workstation network can be improved significantly if a congestion control protocol is used to enhance network performance. In this paper, we characterize and analyze the communication requirements of a large class of supercomputing applications that fall under the category of fixed-point problems, amenable to solution by parallel iterative methods. This results in a set of interface and architectural features sufficient for the efficient implementation of the applications over a large-scale distributed system. In particular, we propose a direct link between the application and network layer, supporting congestion control actions at both ends. This in turn enhances the system's responsiveness to network congestion, improving performance. Measurements are given showing the efficacy of our scheme to support large-scale parallel computations.
Resumo:
We study an optoelectronic time-delay oscillator that displays high-speed chaotic behavior with a flat, broad power spectrum. The chaotic state coexists with a linearly stable fixed point, which, when subjected to a finite-amplitude perturbation, loses stability initially via a periodic train of ultrafast pulses. We derive approximate mappings that do an excellent job of capturing the observed instability. The oscillator provides a simple device for fundamental studies of time-delay dynamical systems and can be used as a building block for ultrawide-band sensor networks.
Resumo:
Recently Ziman et al. [Phys. Rev. A 65, 042105 (2002)] have introduced a concept of a universal quantum homogenizer which is a quantum machine that takes as input a given (system) qubit initially in an arbitrary state rho and a set of N reservoir qubits initially prepared in the state xi. The homogenizer realizes, in the limit sense, the transformation such that at the output each qubit is in an arbitrarily small neighborhood of the state xi irrespective of the initial states of the system and the reservoir qubits. In this paper we generalize the concept of quantum homogenization for qudits, that is, for d-dimensional quantum systems. We prove that the partial-swap operation induces a contractive map with the fixed point which is the original state of the reservoir. We propose an optical realization of the quantum homogenization for Gaussian states. We prove that an incoming state of a photon field is homogenized in an array of beam splitters. Using Simon's criterion, we study entanglement between outgoing beams from beam splitters. We derive an inseparability condition for a pair of output beams as a function of the degree of squeezing in input beams.
Resumo:
CO multipulse temporal analysis of products (TAP) experiments were used to characterize a ceria-supported platinum catalyst after various oxidative and reductive pretreatments using O-2, H2O, CO2, and H-2. Based on the amount of CO consumed, using the final CO-saturated catalyst composition as the common state point, the oxidatively pretreated catalyst could be described using a general scale. From a kinetic analysis of the CO multipulse responses, two kinetic regimes corresponding to two types of active sites could be identified. As the temperature was raised, the number of the most active sites did not change while the amount of the less active site increased. Comparison of the number of active sites determined from the TAP data reported herein with that determined by a previous steady-state isotope transient kinetic analysis experiment showed excellent agreement. This correlation indicates that the (very fast response) TAP experiments can provide information regarding the number and type of active sites that are relevant to a catalyst under real reaction conditions. (c) 2007 Elsevier Inc. All rights reserved.
Resumo:
A new, front-end image processing chip is presented for real-time small object detection. It has been implemented using a 0.6 µ, 3.3 V CMOS technology and operates on 10-bit input data at 54 megasamples per second. It occupies an area of 12.9 mm×13.6 mm (including pads), dissipates 1.5 W, has 92 I/O pins and is to be housed in a 160-pin ceramic quarter flat-pack. It performs both one- and two-dimensional FIR filtering and a multilayer perceptron (MLP) neural network function using a reconfigurable array of 21 multiplication-accumulation cells which corresponds to a window size of 7×3. The chip can cope with images of 2047 pixels per line and can be cascaded to cope with larger window sizes. The chip performs two billion fixed point multiplications and additions per second.
Resumo:
An adaptation of bungee jumping, 'bungee running', involves participants attempting to run as far as they can whilst connected to an elastic rope which is anchored to a fixed point. Usually considered a safe recreational activity, we report a potentially life-threatening head injury following a bungee running accident.
Resumo:
We consider the behaviour of a set of services in a stressed web environment where performance patterns may be difficult to predict. In stressed environments the performances of some providers may degrade while the performances of others, with elastic resources, may improve. The allocation of web-based providers to users (brokering) is modelled by a strategic non-cooperative angel-daemon game with risk profiles. A risk profile specifies a bound on the number of unreliable service providers within an environment without identifying the names of these providers. Risk profiles offer a means of analysing the behaviour of broker agents which allocate service providers to users. A Nash equilibrium is a fixed point of such a game in which no user can locally improve their choice of provider – thus, a Nash equilibrium is a viable solution to the provider/user allocation problem. Angel daemon games provide a means of reasoning about stressed environments and offer the possibility of designing brokers using risk profiles and Nash equilibria.
Resumo:
Caveolae are plasma membrane structures formed from a complex of the proteins caveolin-1 and caveolin-2. Caveolae interact with pro-inflammatory cytokines and are dysregulated in fibrotic disease. Although caveolae are present infrequently in healthy kidneys, they are abundant during kidney injury. An association has been identified between a CAV1 gene variant and long term kidney transplant survival. Chronic, gradual decline in transplant function is a persistent problem in kidney transplantation. The aetiology of this is diverse but fibrosis within the transplanted organ is the common end point. This study is the first to investigate the association of CAV2 gene variants with kidney transplant outcomes. Genomic DNA from donors and recipients of 575 kidney transplants performed in Belfast was investigated for common variation in CAV2 using a tag SNP approach. The CAV2 SNP rs13221869 was nominally significant for kidney transplant failure. Validation was sought in an independent group of kidney transplant donors and recipients from Dublin, Ireland using a second genotyping technology. Due to the unexpected absence of rs13221869 from this cohort, the CAV2 gene was resequenced. One novel SNP and a novel insertion/deletion in CAV2 were identified; rs13221869 is located in a repetitive region and was not a true variant in resequenced populations. CAV2 is a plausible candidate gene for association with kidney transplant outcomes given its proximity to CAV1 and its role in attenuating fibrosis. This study does not support an association between CAV2 variation and kidney transplant survival. Further analysis of CAV2 should be undertaken with an awareness of the sequence complexities and genetic variants highlighted by this study.
Resumo:
Active network scanning injects traffic into a network and observes responses to draw conclusions about the network. Passive network analysis works by looking at network meta data or by analyzing traffic as it traverses a fixed point on the network. It may be infeasible or inappropriate to scan critical infrastructure networks. Techniques exist to uniquely map assets without resorting to active scanning. In many cases, it is possible to characterize and identify network nodes by passively analyzing traffic flows. These techniques are considered in particular with respect to their application to power industry critical infrastructure.
Resumo:
Permafrost peatlands contain globally important amounts of soil organic carbon, owing to cold conditions which suppress anaerobic decomposition. However, climate warming and permafrost thaw threaten the stability of this carbon store. The ultimate fate of permafrost peatlands and their carbon stores is unclear because of complex feedbacks between peat accumulation, hydrology and vegetation. Field monitoring campaigns only span the last few decades and therefore provide an incomplete picture of permafrost peatland response to recent rapid warming. Here we use a high-resolution palaeoecological approach to understand the longer-term response of peatlands in contrasting states of permafrost degradation to recent rapid warming. At all sites we identify a drying trend until the late-twentieth century; however, two sites subsequently experienced a rapid shift to wetter conditions as permafrost thawed in response to climatic warming, culminating in collapse of the peat domes. Commonalities between study sites lead us to propose a five-phase model for permafrost peatland response to climatic warming. This model suggests a shared ecohydrological trajectory towards a common end point: inundated Arctic fen. Although carbon accumulation is rapid in such sites, saturated soil conditions are likely to cause elevated methane emissions that have implications for climate-feedback mechanisms.
Resumo:
Polyphase IIR structures have recently proven themselves very attractive for very high performance filters that can be designed using very few coefficients. This, combined with their low sensitivity to coefficient quantization in comparison to standard FIR and IIR structures, makes them very applicable for very fast filtering when implemented in fixed-point arithmetic. However, although the mathematical description is very simple, there exist a number of ways to implement such filters. In this paper, we take four of these different implementation structures, analyze the rounding noise originating from the limited arithmetic wordlength of the mathematical operators, and check the internal data growth within the structure. These analyses need to be done to ensure that the performance of the implementation matches the performance of the theoretical design. The theoretical approach that we present has been proven by the results of the fixed-point simulation done in Simulink and verified by an equivalent bit-true implementation in VHDL.
Resumo:
Relatório do Trabalho Final de Mestrado para obtenção do grau de Mestre em Engenharia de Electrónica e Telecomunicações
Resumo:
Trabalho de Projeto para obtenção do grau de Mestre em Engenharia de Eletrónica e Telecomunicações