Species-site matching in mixed species plantations of native trees in tropical Australia

Mixed species plantations using native trees are increasingly being considered for sustainable timber production. Successful application of mixed species forestry systems requires knowledge of the potential spatial interaction between species in order to minimise the chance of dominance and suppression and to maximise wood production. Here, we examined species performances across 52 experimental plots of tree mixtures established on cleared rainforest land to analyse relationships between the growth of component species and climate and soil conditions. We derived site index (SI) equations for ten priority species to evaluate performance and site preferences. Variation in SI of focus species demonstrated that there are strong species-specific responses to climate and soil variables. The best predictor of tree growth for rainforest species Elaeocarpus grandis and Flindersia brayleyana was soil type, as trees grew significantly better on well-draining than on poorly drained soil profiles. Both E. grandis and Eucalyptus pellita showed strong growth response to variation in mean rain days per month. Our study generates understanding of the relative performance of species in mixed species plantations in the Wet Tropics of Australia and improves our ability to predict species growth compatibilities at potential planting sites within the region. Given appropriate species selections and plantation design, mixed plantations of high-value native timber species are capable of sustaining relatively high productivity at a range of sites up to age 10 years, and may offer a feasible approach for large-scale reforestation.

Portrait of man (name handwritten on verso illegible).

Digital Image

Patterns of entrepreneurial career development: An optimal matching analysis approach

Longitudinal studies of entrepreneurial career development are rare, and current knowledge of self-employment patterns and their relationships with individual difference characteristics is limited. In this study, the authors analyzed employment data from a subsample of 514 participants from the German Socio-Economic Panel study (1984–2008). Results of an optimal matching analysis indicated that a continuous self-employment pattern could be distinguished from four alternative employment patterns (change from employment to self-employment, full-time employees, part-time employees, and farmers). Results of a multinomial logistic regression analysis showed that certain socio-demographic characteristics (i.e., age and gender) and personality characteristics (i.e., conscientiousness and risk-taking propensity) were related to the likelihood of following a continuous self-employment pattern compared to the other employment patterns. Implications for future research on entrepreneurial career development are discussed.

Cover page of a binder for maps of Crimea and Ukraine

Digital image

Seixas family papers, undated, 1746-1911, 1926, 1939.

The collection contains items relating to individual members of the family as well as the Seixas family in general. Included are papers of the following persons: Isaac Mendes Seixas (1708/9-1780/1), a copy of A voyage to Hudson's--Bay, by Henry Ellis, inscribed with his name on the title page, along with additional inscriptions on the end papers (1748); and a daily prayer book printed in Amsterdam (title page missing), with an inscription on the first page indicating that the book was owned by Seixas in 1758/9, and subsequently by his grandson, Theodore J. Seixas, in 1816/17.

Cover page of a binder for plans of tracts of land on Crimea

Digital image

Efficient Content-based Routing, Mobility-aware Topologies, and Temporal Subspace Matching

Event-based systems are seen as good candidates for supporting distributed applications in dynamic and ubiquitous environments because they support decoupled and asynchronous many-to-many information dissemination. Event systems are widely used, because asynchronous messaging provides a flexible alternative to RPC (Remote Procedure Call). They are typically implemented using an overlay network of routers. A content-based router forwards event messages based on filters that are installed by subscribers and other routers. The filters are organized into a routing table in order to forward incoming events to proper subscribers and neighbouring routers. This thesis addresses the optimization of content-based routing tables organized using the covering relation and presents novel data structures and configurations for improving local and distributed operation. Data structures are needed for organizing filters into a routing table that supports efficient matching and runtime operation. We present novel results on dynamic filter merging and the integration of filter merging with content-based routing tables. In addition, the thesis examines the cost of client mobility using different protocols and routing topologies. We also present a new matching technique called temporal subspace matching. The technique combines two new features. The first feature, temporal operation, supports notifications, or content profiles, that persist in time. The second feature, subspace matching, allows more expressive semantics, because notifications may contain intervals and be defined as subspaces of the content space. We also present an application of temporal subspace matching pertaining to metadata-based continuous collection and object tracking.

Letter from D. G. Seixas to M. L. M. Peixotto regarding Hebrew name of Mr. Solomons

Digital image

Fred F. Field Collection 1937-1995

Fred F. Field, 1995

An Optimal Mechanism for Sponsored Search Auctions on the Web and Comparison With Other Mechanisms

In this paper, we first describe a framework to model the sponsored search auction on the web as a mechanism design problem. Using this framework, we describe two well-known mechanisms for sponsored search auction-Generalized Second Price (GSP) and Vickrey-Clarke-Groves (VCG). We then derive a new mechanism for sponsored search auction which we call optimal (OPT) mechanism. The OPT mechanism maximizes the search engine's expected revenue, while achieving Bayesian incentive compatibility and individual rationality of the advertisers. We then undertake a detailed comparative study of the mechanisms GSP, VCG, and OPT. We compute and compare the expected revenue earned by the search engine under the three mechanisms when the advertisers are symmetric and some special conditions are satisfied. We also compare the three mechanisms in terms of incentive compatibility, individual rationality, and computational complexity. Note to Practitioners-The advertiser-supported web site is one of the successful business models in the emerging web landscape. When an Internet user enters a keyword (i.e., a search phrase) into a search engine, the user gets back a page with results, containing the links most relevant to the query and also sponsored links, (also called paid advertisement links). When a sponsored link is clicked, the user is directed to the corresponding advertiser's web page. The advertiser pays the search engine in some appropriate manner for sending the user to its web page. Against every search performed by any user on any keyword, the search engine faces the problem of matching a set of advertisers to the sponsored slots. In addition, the search engine also needs to decide on a price to be charged to each advertiser. Due to increasing demands for Internet advertising space, most search engines currently use auction mechanisms for this purpose. These are called sponsored search auctions. A significant percentage of the revenue of Internet giants such as Google, Yahoo!, MSN, etc., comes from sponsored search auctions. In this paper, we study two auction mechanisms, GSP and VCG, which are quite popular in the sponsored auction context, and pursue the objective of designing a mechanism that is superior to these two mechanisms. In particular, we propose a new mechanism which we call the OPT mechanism. This mechanism maximizes the search engine's expected revenue subject to achieving Bayesian incentive compatibility and individual rationality. Bayesian incentive compatibility guarantees that it is optimal for each advertiser to bid his/her true value provided that all other agents also bid their respective true values. Individual rationality ensures that the agents participate voluntarily in the auction since they are assured of gaining a non-negative payoff by doing so.