945 resultados para New Space Vector Modulation


Relevância:

40.00% 40.00%

Publicador:

Resumo:

In this paper, I show how new spaces are being prefigured for colonisation in the language of contemporary technology policy. Drawing on a corpus of 1.3 million words collected from technology policy centres throughout the world, I show the role of policy language in creating the foundations of an emergent form of political economy. The analysis is informed by principles from critical discourse analysis (CDA) and classical political economy. It foregrounds a functional aspect of language called process metaphor to show how aspects of human activity are prefigured for mass commodification by the manipulation of irrealis spaces. I also show how the fundamental element of any new political economy, the property element, is being largely ignored. The potential creation of a global space as concrete as landed property – electromagnetic spectrum – has significant ramifications for the future of social relations in any global “knowledge economy”.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

We consider time-space fractional reaction diffusion equations in two dimensions. This equation is obtained from the standard reaction diffusion equation by replacing the first order time derivative with the Caputo fractional derivative, and the second order space derivatives with the fractional Laplacian. Using the matrix transfer technique proposed by Ilic, Liu, Turner and Anh [Fract. Calc. Appl. Anal., 9:333--349, 2006] and the numerical solution strategy used by Yang, Turner, Liu, and Ilic [SIAM J. Scientific Computing, 33:1159--1180, 2011], the solution of the time-space fractional reaction diffusion equations in two dimensions can be written in terms of a matrix function vector product $f(A)b$ at each time step, where $A$ is an approximate matrix representation of the standard Laplacian. We use the finite volume method over unstructured triangular meshes to generate the matrix $A$, which is therefore non-symmetric. However, the standard Lanczos method for approximating $f(A)b$ requires that $A$ is symmetric. We propose a simple and novel transformation in which the standard Lanczos method is still applicable to find $f(A)b$, despite the loss of symmetry. Numerical results are presented to verify the accuracy and efficiency of our newly proposed numerical solution strategy.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Site-specific performance provides choices in audience experience via degrees of scale, proximity, levels of immersion and viewing perspectives. Beyond these choices, multi-site promenade events also form a connected audience/performer relationship in which moving together in time and space can produce a shared narrative and aesthetic sensibility of collective, yet individuated and shifting meanings. This paper interrogates this notion through audience/performer experiences in two separate multi-site, dance-led events. here/there/then/now occurred in four intimate sites within the Brisbane Powerhouse, providing a theatricalised platform for audiences to create linked narratives through open-ended and fragmented intertextuality. Accented Body, based on the concept of “the body as site and in site” and notions of connectivity, provided a more expansive platform for a similar, but heightened, shared engagement. Audiences traversed 6 outdoor and 2 indoor Brisbane sites moving to varying levels of a large complex. Eleven, predominantly interactive, screens provided links to other sites as well as to distributed presences in Seoul and London. The differentiation in scale and travel time between sites deepened the immersive experiences of audiences who reported transformative engagements with both site and architecture, accompanied by a sense of extended and yet quickened time.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

In the context of ambiguity resolution (AR) of Global Navigation Satellite Systems (GNSS), decorrelation among entries of an ambiguity vector, integer ambiguity search and ambiguity validations are three standard procedures for solving integer least-squares problems. This paper contributes to AR issues from three aspects. Firstly, the orthogonality defect is introduced as a new measure of the performance of ambiguity decorrelation methods, and compared with the decorrelation number and with the condition number which are currently used as the judging criterion to measure the correlation of ambiguity variance-covariance matrix. Numerically, the orthogonality defect demonstrates slightly better performance as a measure of the correlation between decorrelation impact and computational efficiency than the condition number measure. Secondly, the paper examines the relationship of the decorrelation number, the condition number, the orthogonality defect and the size of the ambiguity search space with the ambiguity search candidates and search nodes. The size of the ambiguity search space can be properly estimated if the ambiguity matrix is decorrelated well, which is shown to be a significant parameter in the ambiguity search progress. Thirdly, a new ambiguity resolution scheme is proposed to improve ambiguity search efficiency through the control of the size of the ambiguity search space. The new AR scheme combines the LAMBDA search and validation procedures together, which results in a much smaller size of the search space and higher computational efficiency while retaining the same AR validation outcomes. In fact, the new scheme can deal with the case there are only one candidate, while the existing search methods require at least two candidates. If there are more than one candidate, the new scheme turns to the usual ratio-test procedure. Experimental results indicate that this combined method can indeed improve ambiguity search efficiency for both the single constellation and dual constellations respectively, showing the potential for processing high dimension integer parameters in multi-GNSS environment.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

The first of three articles in this issue addressing the public space topic considers public space and young people in the light of a range of papers delivered at the 27th International Conference on 'Making Cities Livable', held in Vienna, Austria, in July 2000. Under the overarching concept of the "liveable city" the conference themes of 'Rediscovery of public space' and 'Cities for the wellbeing of children' attracted a broad mix of those interested in the planning, design and management of urban space. A number of themes percolated through the conference which stimulated the writers to examine the nexus between urban development, young people and public space. There is an ongoing need to examine the meaning of public space in the face of powerful urban development trends. A model of public space practice is required which incorporates a vision of inclusive public spaces, fosters the interactivity of design, planning, social policy and management, and resources for greater communication and strategic action between stake holders from the most local of levels to those at state and international levels. The speed and magnitude of contemporary urban development makes community input and influence difficult, particularly for those impacted on by the exclusionary tendencies of much urban development. It is critical that a range of meaningful and sustainable mechanisms are developed which allow young people’s conceptions of what constitutes youth-friendly space to be directly made and taken account of.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

In this paper, we consider a two-sided space-fractional diffusion equation with variable coefficients on a finite domain. Firstly, based on the nodal basis functions, we present a new fractional finite volume method for the two-sided space-fractional diffusion equation and derive the implicit scheme and solve it in matrix form. Secondly, we prove the stability and convergence of the implicit fractional finite volume method and conclude that the method is unconditionally stable and convergent. Finally, some numerical examples are given to show the effectiveness of the new numerical method, and the results are in excellent agreement with theoretical analysis.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Integrating renewable energy into public space is becoming more common as a climate change solution. However, this approach is often guided by the environmental pillar of sustainability, with less focus on the economic and social pillars. The purpose of this paper is to examine this issue in the speculative renewable energy propositions for Freshkills Park in New York City submitted for the 2012 Land Art Generator Initiative (LAGI) competition. This paper first proposes an optimal electricity distribution (OED) framework in and around public spaces based on relevant ecology and energy theory (Odum’s fourth and fifth law of thermodynamics). This framework addresses social engagement related to public interaction, and economic engagement related to the estimated quantity of electricity produced, in conjunction with environmental engagement related to the embodied energy required to construct the renewable energy infrastructure. Next, the study uses the OED framework to analyse the top twenty-five projects submitted for the LAGI 2012 competition. The findings reveal an electricity distribution imbalance and suggest a lack of in-depth understanding about sustainable electricity distribution within public space design. The paper concludes with suggestions for future research.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Background In 2011, a variant of West Nile virus Kunjin strain (WNVKUN) caused an unprecedented epidemic of neurological disease in horses in southeast Australia, resulting in almost 1,000 cases and a 9% fatality rate. We investigated whether increased fitness of the virus in the primary vector, Culex annulirostris, and another potential vector, Culex australicus, contributed to the widespread nature of the outbreak. Methods Mosquitoes were exposed to infectious blood meals containing either the virus strain responsible for the outbreak, designated WNVKUN2011, or WNVKUN2009, a strain of low virulence that is typical of historical strains of this virus. WNVKUN infection in mosquito samples was detected using a fixed cell culture enzyme immunoassay and a WNVKUN- specific monoclonal antibody. Probit analysis was used to determine mosquito susceptibility to infection. Infection, dissemination and transmission rates for selected days post-exposure were compared using Fisher’s exact test. Virus titers in bodies and saliva expectorates were compared using t-tests. Results There were few significant differences between the two virus strains in the susceptibility of Cx. annulirostris to infection, the kinetics of virus replication and the ability of this mosquito species to transmit either strain. Both strains were transmitted by Cx. annulirostris for the first time on day 5 post-exposure. The highest transmission rates (proportion of mosquitoes with virus detected in saliva) observed were 68% for WNVKUN2011 on day 12 and 72% for WNVKUN2009 on day 14. On days 12 and 14 post-exposure, significantly more WNVKUN2011 than WNVKUN2009 was expectorated by infected mosquitoes. Infection, dissemination and transmission rates of the two strains were not significantly different in Culex australicus. However, transmission rates and the amount of virus expectorated were significantly lower in Cx. australicus than Cx. annulirostris. Conclusions The higher amount of WNVKUN2011 expectorated by infected mosquitoes may be an indication that this virus strain is transmitted more efficiently by Cx. annulirostris compared to other WNVKUN strains. Combined with other factors, such as a convergence of abundant mosquito and wading bird populations, and mammalian and avian feeding behaviour by Cx. annulirostris, this may have contributed to the scale of the 2011 equine epidemic.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Distributed space time coding for wireless relay networks when the source, the destination and the relays have multiple antennas have been studied by Jing and Hassibi. In this set-up, the transmit and the receive signals at different antennas of the same relay are processed and designed independently, even though the antennas are colocated. In this paper, a wireless relay network with single antenna at the source and the destination and two antennas at each of the R relays is considered. A new class of distributed space time block codes called Co-ordinate Interleaved Distributed Space-Time Codes (CIDSTC) are introduced where, in the first phase, the source transmits a T-length complex vector to all the relays;and in the second phase, at each relay, the in-phase and quadrature component vectors of the received complex vectors at the two antennas are interleaved and processed before forwarding them to the destination. Compared to the scheme proposed by Jing-Hassibi, for T >= 4R, while providing the same asymptotic diversity order of 2R, CIDSTC scheme is shown to provide asymptotic coding gain with the cost of negligible increase in the processing complexity at the relays. However, for moderate and large values of P, CIDSTC scheme is shown to provide more diversity than that of the scheme proposed by Jing-Hassibi. CIDSTCs are shown to be fully diverse provided the information symbols take value from an appropriate multidimensional signal set.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

This paper examines the meaning of public space and sense of community among neighbourhood residents in the changing urban context of the Kathmandu Valley in Nepal. Two new neighbourhoods were selected for the purpose of this study with data collected from interviews with the residents. The study has found that most residents of the new neighbourhoods have an understanding of the significance of public space in community life. However, such understandings are based less on the actual use of public space. The existing public spaces in these neighbourhoods are less successful in offering a meaning to the residents, due to their poor development and the lack of active use. Despite these changes, some residents believe they have developed a sense of community, which is an outcome of other individual factors than the use of public space. It is argued that the role of contemporary neighbourhood public space in fostering a sense of community appears to be less significant in the valley’s present context.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

We consider the problem of computing an approximate minimum cycle basis of an undirected edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time 0(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time 0(n(3+2/k)), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega)) bound. We also present a 2-approximation algorithm with O(m(omega) root n log n) expected running time, a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Some new concepts characterizing the response of nonlinear systems are developed. These new concepts are denoted by the terms, the transient system equivalent, the response vector, and the space-phase components. This third concept is analyzed in comparison with the well-known technique of symmetrical components. The performance of a multiplicative feedback control system is represented by a nonlinear integro-differential equation; its solution is obtained by the principle of variation of parameters. The system response is treated as a vector and is resolved into its space-phase components. The individual effects of these components on the performance of the system are discussed. The suitability of the technique for the transient analysis of higher order nonlinear control systems is discussed.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Various Tb theorems play a key role in the modern harmonic analysis. They provide characterizations for the boundedness of Calderón-Zygmund type singular integral operators. The general philosophy is that to conclude the boundedness of an operator T on some function space, one needs only to test it on some suitable function b. The main object of this dissertation is to prove very general Tb theorems. The dissertation consists of four research articles and an introductory part. The framework is general with respect to the domain (a metric space), the measure (an upper doubling measure) and the range (a UMD Banach space). Moreover, the used testing conditions are weak. In the first article a (global) Tb theorem on non-homogeneous metric spaces is proved. One of the main technical components is the construction of a randomization procedure for the metric dyadic cubes. The difficulty lies in the fact that metric spaces do not, in general, have a translation group. Also, the measures considered are more general than in the existing literature. This generality is genuinely important for some applications, including the result of Volberg and Wick concerning the characterization of measures for which the analytic Besov-Sobolev space embeds continuously into the space of square integrable functions. In the second article a vector-valued extension of the main result of the first article is considered. This theorem is a new contribution to the vector-valued literature, since previously such general domains and measures were not allowed. The third article deals with local Tb theorems both in the homogeneous and non-homogeneous situations. A modified version of the general non-homogeneous proof technique of Nazarov, Treil and Volberg is extended to cover the case of upper doubling measures. This technique is also used in the homogeneous setting to prove local Tb theorems with weak testing conditions introduced by Auscher, Hofmann, Muscalu, Tao and Thiele. This gives a completely new and direct proof of such results utilizing the full force of non-homogeneous analysis. The final article has to do with sharp weighted theory for maximal truncations of Calderón-Zygmund operators. This includes a reduction to certain Sawyer-type testing conditions, which are in the spirit of Tb theorems and thus of the dissertation. The article extends the sharp bounds previously known only for untruncated operators, and also proves sharp weak type results, which are new even for untruncated operators. New techniques are introduced to overcome the difficulties introduced by the non-linearity of maximal truncations.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. Although in most such applications any cycle basis can be used, a low weight cycle basis often translates to better performance and/or numerical stability. Despite the fact that the problem can be solved exactly in polynomial time, we design approximation algorithms since the performance of the exact algorithms may be too expensive for some practical applications. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time O(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time O(n(3+2/k) ), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega) ) bound. We also present a 2-approximation algorithm with expected running time O(M-omega root n log n), a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.