921 resultados para Spectrally bounded


Relevância:

10.00% 10.00%

Publicador:

Resumo:

We present a fully-distributed self-healing algorithm dex that maintains a constant degree expander network in a dynamic setting. To the best of our knowledge, our algorithm provides the first efficient distributed construction of expanders—whose expansion properties holddeterministically—that works even under an all-powerful adaptive adversary that controls the dynamic changes to the network (the adversary has unlimited computational power and knowledge of the entire network state, can decide which nodes join and leave and at what time, and knows the past random choices made by the algorithm). Previous distributed expander constructions typically provide only probabilistic guarantees on the network expansion whichrapidly degrade in a dynamic setting; in particular, the expansion properties can degrade even more rapidly under adversarial insertions and deletions. Our algorithm provides efficient maintenance and incurs a low overhead per insertion/deletion by an adaptive adversary: only O(logn)O(log⁡n) rounds and O(logn)O(log⁡n) messages are needed with high probability (n is the number of nodes currently in the network). The algorithm requires only a constant number of topology changes. Moreover, our algorithm allows for an efficient implementation and maintenance of a distributed hash table on top of dex  with only a constant additional overhead. Our results are a step towards implementing efficient self-healing networks that have guaranteed properties (constant bounded degree and expansion) despite dynamic changes.

Gopal Pandurangan has been supported in part by Nanyang Technological University Grant M58110000, Singapore Ministry of Education (MOE) Academic Research Fund (AcRF) Tier 2 Grant MOE2010-T2-2-082, MOE AcRF Tier 1 Grant MOE2012-T1-001-094, and the United States-Israel Binational Science Foundation (BSF) Grant 2008348. Peter Robinson has been supported by Grant MOE2011-T2-2-042 “Fault-tolerant Communication Complexity in Wireless Networks” from the Singapore MoE AcRF-2. Work done in part while the author was at the Nanyang Technological University and at the National University of Singapore. Amitabh Trehan has been supported by the Israeli Centers of Research Excellence (I-CORE) program (Center No. 4/11). Work done in part while the author was at Hebrew University of Jerusalem and at the Technion and supported by a Technion fellowship.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

We present a homological characterisation of those chain complexes of modules over a Laurent polynomial ring in several indeterminates which are finitely dominated over the ground ring (that is, are a retract up to homotopy of a bounded complex of finitely generated free modules). The main tools, which we develop in the paper, are a non-standard totalisation construction for multi-complexes based on truncated products, and a high-dimensional mapping torus construction employing a theory of cubical diagrams that commute up to specified coherent homotopies.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

The paper presents the calibration of Fuji BAS-TR image plate (IP) response to high energy carbon ions of different charge states by employing an intense laser-driven ion source, which allowed access to carbon energies up to 270 MeV. The calibration method consists of employing a Thomson parabola spectrometer to separate and spectrally resolve different ion species, and a slotted CR-39 solid state detector overlayed onto an image plate for an absolute calibration of the IP signal. An empirical response function was obtained which can be reasonably extrapolated to higher ion energies. The experimental data also show that the IP response is independent of ion charge states.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

In this paper, a recursive filter algorithm is developed to deal with the state estimation problem for power systems with quantized nonlinear measurements. The measurements from both the remote terminal units and the phasor measurement unit are subject to quantizations described by a logarithmic quantizer. Attention is focused on the design of a recursive filter such that, in the simultaneous presence of nonlinear measurements and quantization effects, an upper bound for the estimation error covariance is guaranteed and subsequently minimized. Instead of using the traditional approximation methods in nonlinear estimation that simply ignore the linearization errors, we treat both the linearization and quantization errors as norm-bounded uncertainties in the algorithm development so as to improve the performance of the estimator. For the power system with such kind of introduced uncertainties, a filter is designed in the framework of robust recursive estimation, and the developed filter algorithm is tested on the IEEE benchmark power system to demonstrate its effectiveness.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Coastal and estuarine landforms provide a physical template that not only accommodates diverse ecosystem functions and human activities, but also mediates flood and erosion risks that are expected to increase with climate change. In this paper, we explore some of the issues associated with the conceptualisation and modelling of coastal morphological change at time and space scales relevant to managers and policy makers. Firstly, we revisit the question of how to define the most appropriate scales at which to seek quantitative predictions of landform change within an age defined by human interference with natural sediment systems and by the prospect of significant changes in climate and ocean forcing. Secondly, we consider the theoretical bases and conceptual frameworks for determining which processes are most important at a given scale of interest and the related problem of how to translate this understanding into models that are computationally feasible, retain a sound physical basis and demonstrate useful predictive skill. In particular, we explore the limitations of a primary scale approach and the extent to which these can be resolved with reference to the concept of the coastal tract and application of systems theory. Thirdly, we consider the importance of different styles of landform change and the need to resolve not only incremental evolution of morphology but also changes in the qualitative dynamics of a system and/or its gross morphological configuration. The extreme complexity and spatially distributed nature of landform systems means that quantitative prediction of future changes must necessarily be approached through mechanistic modelling of some form or another. Geomorphology has increasingly embraced so-called ‘reduced complexity’ models as a means of moving from an essentially reductionist focus on the mechanics of sediment transport towards a more synthesist view of landform evolution. However, there is little consensus on exactly what constitutes a reduced complexity model and the term itself is both misleading and, arguably, unhelpful. Accordingly, we synthesise a set of requirements for what might be termed ‘appropriate complexity modelling’ of quantitative coastal morphological change at scales commensurate with contemporary management and policy-making requirements: 1) The system being studied must be bounded with reference to the time and space scales at which behaviours of interest emerge and/or scientific or management problems arise; 2) model complexity and comprehensiveness must be appropriate to the problem at hand; 3) modellers should seek a priori insights into what kind of behaviours are likely to be evident at the scale of interest and the extent to which the behavioural validity of a model may be constrained by its underlying assumptions and its comprehensiveness; 4) informed by qualitative insights into likely dynamic behaviour, models should then be formulated with a view to resolving critical state changes; and 5) meso-scale modelling of coastal morphological change should reflect critically on the role of modelling and its relation to the observable world.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

The first detection of gas-phase methanol in a protoplanetary disk (TW Hya) is presented. In addition to being one of the largest molecules detected in disks to date, methanol is also the first disk organic molecule with an unambiguous ice chemistry origin. The stacked methanol emission, as observed with the Atacama Large Millimeter/submillimeter Array, is spectrally resolved and detected across six velocity channels (>3σ), reaching a peak signal-to-noise of 5.5σ, with the kinematic pattern expected for TW Hya. Using an appropriate disk model, a fractional abundance of 3 x 10-12 – 4 x 10-11 (with respect to H2) reproduces the stacked line profile and channel maps, with the favored abundance dependent upon the assumed vertical location (midplane versus molecular layer). The peak emission is offset from the source position, suggesting that the methanol emission has a ring-like morphology: the analysis here suggests it peaks at ≈30 au, reaching a column density ≈3–6 x 1012 cm−2. In the case of TW Hya, the larger (up to millimeter-sized) grains, residing in the inner 50 au, may thus host the bulk of the disk ice reservoir. The successful detection of cold gas-phase methanol in a protoplanetary disk implies that the products of ice chemistry can be explored in disks, opening a window into studying complex organic chemistry during planetary system formation.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Nesta tese, consideram-se operadores integrais singulares com a acção extra de um operador de deslocacamento de Carleman e com coeficientes em diferentes classes de funções essencialmente limitadas. Nomeadamente, funções contínuas por troços, funções quase-periódicas e funções possuíndo factorização generalizada. Nos casos dos operadores integrais singulares com deslocamento dado pelo operador de reflexão ou pelo operador de salto no círculo unitário complexo, obtêm-se critérios para a propriedade de Fredholm. Para os coeficientes contínuos, uma fórmula do índice de Fredholm é apresentada. Estes resultados são consequência das relações de equivalência explícitas entre aqueles operadores e alguns operadores adicionais, tais como o operador integral singular, operadores de Toeplitz e operadores de Toeplitz mais Hankel. Além disso, as relações de equivalência permitem-nos obter um critério de invertibilidade e fórmulas para os inversos laterais dos operadores iniciais com coeficientes factorizáveis. Adicionalmente, aplicamos técnicas de análise numérica, tais como métodos de colocação de polinómios, para o estudo da dimensão do núcleo dos dois tipos de operadores integrais singulares com coeficientes contínuos por troços. Esta abordagem permite também a computação do inverso no sentido Moore-Penrose dos operadores principais. Para operadores integrais singulares com operadores de deslocamento do tipo Carleman preservando a orientação e com funções contínuas como coeficientes, são obtidos limites superiores da dimensão do núcleo. Tal é implementado utilizando algumas estimativas e com a ajuda de relações (explícitas) de equivalência entre operadores. Focamos ainda a nossa atenção na resolução e nas soluções de uma classe de equações integrais singulares com deslocamento que não pode ser reduzida a um problema de valor de fronteira binomial. De forma a atingir os objectivos propostos, foram utilizadas projecções complementares e identidades entre operadores. Desta forma, as equações em estudo são associadas a sistemas de equações integrais singulares. Estes sistemas são depois analisados utilizando um problema de valor de fronteira de Riemann. Este procedimento tem como consequência a construção das soluções das equações iniciais a partir das soluções de problemas de valor de fronteira de Riemann. Motivados por uma grande diversidade de aplicações, estendemos a definição de operador integral de Cauchy para espaços de Lebesgue sobre grupos topológicos. Assim, são investigadas as condições de invertibilidade dos operadores integrais neste contexto.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

In this thesis we consider Wiener-Hopf-Hankel operators with Fourier symbols in the class of almost periodic, semi-almost periodic and piecewise almost periodic functions. In the first place, we consider Wiener-Hopf-Hankel operators acting between L2 Lebesgue spaces with possibly different Fourier matrix symbols in the Wiener-Hopf and in the Hankel operators. In the second place, we consider these operators with equal Fourier symbols and acting between weighted Lebesgue spaces Lp(R;w), where 1 < p < 1 and w belongs to a subclass of Muckenhoupt weights. In addition, singular integral operators with Carleman shift and almost periodic coefficients are also object of study. The main purpose of this thesis is to obtain regularity properties characterizations of those classes of operators. By regularity properties we mean those that depend on the kernel and cokernel of the operator. The main techniques used are the equivalence relations between operators and the factorization theory. An invertibility characterization for the Wiener-Hopf-Hankel operators with symbols belonging to the Wiener subclass of almost periodic functions APW is obtained, assuming that a particular matrix function admits a numerical range bounded away from zero and based on the values of a certain mean motion. For Wiener-Hopf-Hankel operators acting between L2-spaces and with possibly different AP symbols, criteria for the semi-Fredholm property and for one-sided and both-sided invertibility are obtained and the inverses for all possible cases are exhibited. For such results, a new type of AP factorization is introduced. Singular integral operators with Carleman shift and scalar almost periodic coefficients are also studied. Considering an auxiliar and simpler operator, and using appropriate factorizations, the dimensions of the kernels and cokernels of those operators are obtained. For Wiener-Hopf-Hankel operators with (possibly different) SAP and PAP matrix symbols and acting between L2-spaces, criteria for the Fredholm property are presented as well as the sum of the Fredholm indices of the Wiener-Hopf plus Hankel and Wiener-Hopf minus Hankel operators. By studying dependencies between different matrix Fourier symbols of Wiener-Hopf plus Hankel operators acting between L2-spaces, results about the kernel and cokernel of those operators are derived. For Wiener-Hopf-Hankel operators acting between weighted Lebesgue spaces, Lp(R;w), a study is made considering equal scalar Fourier symbols in the Wiener-Hopf and in the Hankel operators and belonging to the classes of APp;w, SAPp;w and PAPp;w. It is obtained an invertibility characterization for Wiener-Hopf plus Hankel operators with APp;w symbols. In the cases for which the Fourier symbols of the operators belong to SAPp;w and PAPp;w, it is obtained semi-Fredholm criteria for Wiener-Hopf-Hankel operators as well as formulas for the Fredholm indices of those operators.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Strong and sometimes extreme responses in runoff and soil erosion following wildfires have been reported worldwide. However, in the case of North-Central Portugal, little research had been carried out regarding the hydrologic and erosive impacts of several land management activities in recently burnt areas (such as ground preparation, post-fire logging or post-fire mitigation treatments). This study aims to assess post-fire runoff and soil erosion response on Eucalypt and Maritime pine plantations during the first, second and third years following wildfires. The effect of several pre-fire ground preparation operations (ploughed down-slope, contour ploughed and inclined terraces), post-fire logging activities (on both the eucalypt and pine plantations), as well as the application of hydromulch (a post-fire emergency treatment) on overland flow and soil erosion were compared to burnt but undisturbed and untreated areas. The intensive monitoring of runoff, soil erosion and selected soil properties served to determine the main factors involved in post-fire runoff and soil erosion and their spatial and temporal variation. Soil water repellency deserved special attention, due to its supposed important role for overland flow generation. Repeated rainfall simulation experiments (RSE’s), micro-scale runoff plots and bounded sediment fences were carried out and/or installed immediately after the wildfire on seven burnt slopes. Micro-scale runoff plots results under natural rainfall conditions were also compared to the RSE’s results, which was useful for assessing the representativeness of the data obtained with artificial rainfall. The results showed comparable runoff coefficient (20-60%) but lower sediment losses (125-1000 g m-2) than prior studies in Portugal, but especially outside Portugal. Lower sediment losses were related with the historic intensive land use in the area. In evaluating these losses, however, the shallowness and stoniness of the soils, as well as the high organic matter fraction of the eroded sediments (50%) must not be overlooked. Sediment limited erosion was measured in all the ploughed sites, probably due to the time since ploughing (several years). The disturbance of the soil surface cover due to post-fire logging and wood extraction substantially increased sediment losses at both the pine and eucalypt sites. Hydromulch effectiveness in reducing the runoff (70%) and sediment losses (83%) was attributed to the protective high coverage provided by hydromulch. The hydromulch significantly affected the soil cover and other soil properties and these changes also reduced the soil erosion risk. The rainfall amount was the main factor explaining the variance in runoff. However, a shift from rainfall amount to rainfall intensity was detected when either the surface cover or the infiltration capacity (hydrophilic conditions) increased. Sediment losses were controlled by rainfall intensity and surface cover. The role of soil water repellency on runoff generation was not consistent; the overall repellency levels alone were not enough to assess its hydrological impact. Soil water repellency explained runoff generation in the specific-sites model better than in the overall model. Additionally, soil moisture content was a better predictor for soil water repellency than antecedent rainfall. The natural rainfall results confirmed that RSE’s were able to capture the specific sediment losses and its organic matter content as well as the differences between the ploughed and unploughed sites. Repeated RSE’s also captured the seasonal variations in runoff and sediment losses attributed to soil water repellency. These results have implications for post-fire soil erosion modelling and soil conservation practices in the region, or areas with the same land use, climate and soil characteristics. The measured sediment loss, as well as the increasing frequency of ploughing in recently burnt and unburnt eucalypt stands, suggests ploughing is not an effective as a soil conservation measure. Logging activities with less impact are recommended in order to maintain the forest litter protecting the soil surface. Due to its high effectiveness in reducing runoff and soil erosion, hydromulch is recommended for highly sensitive and vulnerable areas.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

In this thesis, we study the existence and multiplicity of solutions of the following class of Schr odinger-Poisson systems: u + u + l(x) u = (x; u) in R3; = l(x)u2 in R3; where l 2 L2(R3) or l 2 L1(R3). And we consider that the nonlinearity satis es the following three kinds of cases: (i) a subcritical exponent with (x; u) = k(x)jujp 2u + h(x)u (4 p < 2 ) under an inde nite case; (ii) a general inde nite nonlinearity with (x; u) = k(x)g(u) + h(x)u; (iii) a critical growth exponent with (x; u) = k(x)juj2 2u + h(x)jujq 2u (2 q < 2 ). It is worth mentioning that the thesis contains three main innovations except overcoming several di culties, which are generated by the systems themselves. First, as an unknown referee said in his report, we are the rst authors concerning the existence of multiple positive solutions for Schr odinger- Poisson systems with an inde nite nonlinearity. Second, we nd an interesting phenomenon in Chapter 2 and Chapter 3 that we do not need the condition R R3 k(x)ep 1dx < 0 with an inde nite noncoercive case, where e1 is the rst eigenfunction of +id in H1(R3) with weight function h. A similar condition has been shown to be a su cient and necessary condition to the existence of positive solutions for semilinear elliptic equations with inde nite nonlinearity for a bounded domain (see e.g. Alama-Tarantello, Calc. Var. PDE 1 (1993), 439{475), or to be a su cient condition to the existence of positive solutions for semilinear elliptic equations with inde nite nonlinearity in RN (see e.g. Costa-Tehrani, Calc. Var. PDE 13 (2001), 159{189). Moreover, the process used in this case can be applied to study other aspects of the Schr odinger-Poisson systems and it gives a way to study the Kirchho system and quasilinear Schr odinger system. Finally, to get sign changing solutions in Chapter 5, we follow the spirit of Hirano-Shioji, Proc. Roy. Soc. Edinburgh Sect. A 137 (2007), 333, but the procedure is simpler than that they have proposed in their paper.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Wireless communication technologies have become widely adopted, appearing in heterogeneous applications ranging from tracking victims, responders and equipments in disaster scenarios to machine health monitoring in networked manufacturing systems. Very often, applications demand a strictly bounded timing response, which, in distributed systems, is generally highly dependent on the performance of the underlying communication technology. These systems are said to have real-time timeliness requirements since data communication must be conducted within predefined temporal bounds, whose unfulfillment may compromise the correct behavior of the system and cause economic losses or endanger human lives. The potential adoption of wireless technologies for an increasingly broad range of application scenarios has made the operational requirements more complex and heterogeneous than before for wired technologies. On par with this trend, there is an increasing demand for the provision of cost-effective distributed systems with improved deployment, maintenance and adaptation features. These systems tend to require operational flexibility, which can only be ensured if the underlying communication technology provides both time and event triggered data transmission services while supporting on-line, on-the-fly parameter modification. Generally, wireless enabled applications have deployment requirements that can only be addressed through the use of batteries and/or energy harvesting mechanisms for power supply. These applications usually have stringent autonomy requirements and demand a small form factor, which hinders the use of large batteries. As the communication support may represent a significant part of the energy requirements of a station, the use of power-hungry technologies is not adequate. Hence, in such applications, low-range technologies have been widely adopted. In fact, although low range technologies provide smaller data rates, they spend just a fraction of the energy of their higher-power counterparts. The timeliness requirements of data communications, in general, can be met by ensuring the availability of the medium for any station initiating a transmission. In controlled (close) environments this can be guaranteed, as there is a strict regulation of which stations are installed in the area and for which purpose. Nevertheless, in open environments, this is hard to control because no a priori abstract knowledge is available of which stations and technologies may contend for the medium at any given instant. Hence, the support of wireless real-time communications in unmanaged scenarios is a highly challenging task. Wireless low-power technologies have been the focus of a large research effort, for example, in the Wireless Sensor Network domain. Although bringing extended autonomy to battery powered stations, such technologies are known to be negatively influenced by similar technologies contending for the medium and, especially, by technologies using higher power transmissions over the same frequency bands. A frequency band that is becoming increasingly crowded with competing technologies is the 2.4 GHz Industrial, Scientific and Medical band, encompassing, for example, Bluetooth and ZigBee, two lowpower communication standards which are the base of several real-time protocols. Although these technologies employ mechanisms to improve their coexistence, they are still vulnerable to transmissions from uncoordinated stations with similar technologies or to higher power technologies such as Wi- Fi, which hinders the support of wireless dependable real-time communications in open environments. The Wireless Flexible Time-Triggered Protocol (WFTT) is a master/multi-slave protocol that builds on the flexibility and timeliness provided by the FTT paradigm and on the deterministic medium capture and maintenance provided by the bandjacking technique. This dissertation presents the WFTT protocol and argues that it allows supporting wireless real-time communication services with high dependability requirements in open environments where multiple contention-based technologies may dispute the medium access. Besides, it claims that it is feasible to provide flexible and timely wireless communications at the same time in open environments. The WFTT protocol was inspired on the FTT paradigm, from which higher layer services such as, for example, admission control has been ported. After realizing that bandjacking was an effective technique to ensure the medium access and maintenance in open environments crowded with contention-based communication technologies, it was recognized that the mechanism could be used to devise a wireless medium access protocol that could bring the features offered by the FTT paradigm to the wireless domain. The performance of the WFTT protocol is reported in this dissertation with a description of the implemented devices, the test-bed and a discussion of the obtained results.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Let p(G)p(G) and q(G)q(G) be the number of pendant vertices and quasi-pendant vertices of a simple undirected graph G, respectively. Let m_L±(G)(1) be the multiplicity of 1 as eigenvalue of a matrix which can be either the Laplacian or the signless Laplacian of a graph G. A result due to I. Faria states that mL±(G)(1) is bounded below by p(G)−q(G). Let r(G) be the number of internal vertices of G. If r(G)=q(G), following a unified approach we prove that mL±(G)(1)=p(G)−q(G). If r(G)>q(G) then we determine the equality mL±(G)(1)=p(G)−q(G)+mN±(1), where mN±(1) denotes the multiplicity of 1 as eigenvalue of a matrix N±. This matrix is obtained from either the Laplacian or signless Laplacian matrix of the subgraph induced by the internal vertices which are non-quasi-pendant vertices. Furthermore, conditions for 1 to be an eigenvalue of a principal submatrix are deduced and applied to some families of graphs.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Tese de doutoramento, Educação (Teoria e Desenvolvimento Curricular), Universidade de Lisboa, Instituto de Educação, 2015

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Thesis (Ph.D.)--University of Washington, 2014

Relevância:

10.00% 10.00%

Publicador:

Resumo:

In order to accelerate computing the convex hull on a set of n points, a heuristic procedure is often applied to reduce the number of points to a set of s points, s ≤ n, which also contains the same hull. We present an algorithm to precondition 2D data with integer coordinates bounded by a box of size p × q before building a 2D convex hull, with three distinct advantages. First, we prove that under the condition min(p, q) ≤ n the algorithm executes in time within O(n); second, no explicit sorting of data is required; and third, the reduced set of s points forms a simple polygonal chain and thus can be directly pipelined into an O(n) time convex hull algorithm. This paper empirically evaluates and quantifies the speed up gained by preconditioning a set of points by a method based on the proposed algorithm before using common convex hull algorithms to build the final hull. A speedup factor of at least four is consistently found from experiments on various datasets when the condition min(p, q) ≤ n holds; the smaller the ratio min(p, q)/n is in the dataset, the greater the speedup factor achieved.