975 resultados para Convex extendable trees


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Maximum-likelihood estimates of the parameters of stochastic differential equations are consistent and asymptotically efficient, but unfortunately difficult to obtain if a closed-form expression for the transitional probability density function of the process is not available. As a result, a large number of competing estimation procedures have been proposed. This article provides a critical evaluation of the various estimation techniques. Special attention is given to the ease of implementation and comparative performance of the procedures when estimating the parameters of the Cox–Ingersoll–Ross and Ornstein–Uhlenbeck equations respectively.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A number of learning problems can be cast as an Online Convex Game: on each round, a learner makes a prediction x from a convex set, the environment plays a loss function f, and the learner’s long-term goal is to minimize regret. Algorithms have been proposed by Zinkevich, when f is assumed to be convex, and Hazan et al., when f is assumed to be strongly convex, that have provably low regret. We consider these two settings and analyze such games from a minimax perspective, proving minimax strategies and lower bounds in each case. These results prove that the existing algorithms are essentially optimal.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A novel m-ary tree based approach is presented to solve asset management decisions which are combinatorial in nature. The approach introduces a new dynamic constraint based control mechanism which is capable of excluding infeasible solutions from the solution space. The approach also provides a solution to the challenges with ordering of assets decisions.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Carbon dioxide (CO2), as a primary product of combustion, is a known factor affecting climate change and global warming. In Australia, CO2 emissions from biomass burning are a significant contributor to total carbon in the atmosphere and therefore, it is important to quantify the CO2 emission factors from biomass burning in order to estimate their magnitude and impact on the Australian atmosphere. This paper presents the quantification of CO2 emission factors for five common tree species found in South East Queensland forests, as well as several grasses taken from savannah lands in the Northern Territory of Australia, under controlled ‘fast burning’ and ‘slow burning’ laboratory conditions. The results showed that CO2 emission factors varied according to the type of vegetation and burning conditions, with emission factors for fast burning being 2574 ± 254 g/kg for wood, 394 ± 40 g/kg for branches and leaves, and 2181 ± 120 g/kg for grass. Under slow burning conditions, the CO2 emission factors were 218 ± 20 g/kg for wood, 392± 80 g/kg for branches and leaves, and 2027 ± 809 g/kg for grass.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Courtney Pedersen and Charles Robb's A Natural History of Trees was a installation mounted at Blindside ARI in Melbourne's CBD in 2012. The work took the form of a pine-panelled room containing a pair of life-sized tree trunks composed entirely of stacks of cut paper discs. A faux bois stool reinforced the sense of artificiality. Claustrophic and precarious, the installation was simultaneously a response to the complexity of our relationship with nature and place, and an evocation of the precarious quality of the collaborative process. The exhibition was accompanied by a catalogue with an essay by writer/curator, Jane O'Neill.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This creative non-fiction piece of writing speaks to the ‘tree’ themed edition of the About Place Journal. It begins with…“This tree stands steadfast along my inland travelling track, near the town of Mundubbera on the land of the Wakka Wakka people. It is in the region called North Burnett. When we travel, we follow the river systems and look out for distinct markers in the landscape. We acknowledge the lands of others as we move down to Booburrgan Ngmmunge (the language term used by many Aboriginal people to describe the Bunya Mountains) and beyond”. The piece includes photograph images also taken by the author.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Trees are capable of portraying the semi-structured data which is common in web domain. Finding similarities between trees is mandatory for several applications that deal with semi-structured data. Existing similarity methods examine a pair of trees by comparing through nodes and paths of two trees, and find the similarity between them. However, these methods provide unfavorable results for unordered tree data and result in yielding NP-hard or MAX-SNP hard complexity. In this paper, we present a novel method that encodes a tree with an optimal traversing approach first, and then, utilizes it to model the tree with its equivalent matrix representation for finding similarity between unordered trees efficiently. Empirical analysis shows that the proposed method is able to achieve high accuracy even on the large data sets.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Between the 1890s and 1920s street trees became a more prominent feature in streetscapes across New South Wales, Australia. The Sydney Botanic Gardens, with their extensive nursery system, were responsible for supplying seedlings to councils and municipalities for use as street trees. As such, this institution was a primary mover of what a street tree should be, how they should be used and what plants were best suited to this particular use in urban environments. This paper analyses the nurturing of this use of street trees by the Sydney Botanic Gardens and the Director Joseph Maiden. This institution was a place that moved not just stock and seedlings, but ideas about how nature's inclusion into urban environments had the capacity to influence and enhance the cultivation of civilised citizens. This was affected through access to transnational resources available to the Sydney Botanic Gardens.

Relevância:

20.00% 20.00%

Publicador:

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Recently, a convex hull-based human identification protocol was proposed by Sobrado and Birget, whose steps can be performed by humans without additional aid. The main part of the protocol involves the user mentally forming a convex hull of secret icons in a set of graphical icons and then clicking randomly within this convex hull. While some rudimentary security issues of this protocol have been discussed, a comprehensive security analysis has been lacking. In this paper, we analyze the security of this convex hull-based protocol. In particular, we show two probabilistic attacks that reveal the user’s secret after the observation of only a handful of authentication sessions. These attacks can be efficiently implemented as their time and space complexities are considerably less than brute force attack. We show that while the first attack can be mitigated through appropriately chosen values of system parameters, the second attack succeeds with a non-negligible probability even with large system parameter values that cross the threshold of usability.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper is interested in the way in which the heritage of another place, time, and culture is repurposed for popular consumption in an experience economy, as well as the way in which the visitors experience their own past and the past of others. We trace the processes of engagement, education and nostalgia that occur when the European heritage is presented in a postcolonial context and an Australian environment. The information presented includes the results of qualitative and quantitative research conducted at the Abbey Museum over the December-Jan. period of 2012-13.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Recently a convex hull based human identification protocol was proposed by Sobrado and Birget, whose steps can be performed by humans without additional aid. The main part of the protocol involves the user mentally forming a convex hull of secret icons in a set of graphical icons and then clicking randomly within this convex hull. In this paper we show two efficient probabilistic attacks on this protocol which reveal the user’s secret after the observation of only a handful of authentication sessions. We show that while the first attack can be mitigated through appropriately chosen values of system parameters, the second attack succeeds with a non-negligible probability even with large system parameter values which cross the threshold of usability.