67 resultados para Information Foraging Theory, Search Economic Theory, Interactive Probability Ranking Principle

em QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast


Relevância:

100.00% 100.00%

Publicador:

Resumo:

Context. The 30 Doradus (30 Dor) region of the Large Magellanic Cloud, also known as the Tarantula nebula, is the nearest starburst region. It contains the richest population of massive stars in the Local Group, and it is thus the best possible laboratory to investigate open questions on the formation and evolution of massive stars. Aims. Using ground-based multi-object optical spectroscopy obtained in the framework of the VLT-FLAMES Tarantula Survey (VFTS), we aim to establish the (projected) rotational velocity distribution for a sample of 216 presumably single O-type stars in 30 Dor. The sample is large enough to obtain statistically significant information and to search for variations among subpopulations - in terms of spectral type, luminosity class, and spatial location - in the field of view. Methods. We measured projected rotational velocities, 3e sin i, by means of a Fourier transform method and a profile fitting method applied to a set of isolated spectral lines. We also used an iterative deconvolution procedure to infer the probability density, P(3e), of the equatorial rotational velocity, 3e. Results. The distribution of 3e sin i shows a two-component structure: a peak around 80 km s1 and a high-velocity tail extending up to 600 km s-1 This structure is also present in the inferred distribution P(3e) with around 80% of the sample having 0 <3e ≤ 300 km s-1 and the other 20% distributed in the high-velocity region. The presence of the low-velocity peak is consistent with what has been found in other studies for late O- and early B-type stars. Conclusions. Most of the stars in our sample rotate with a rate less than 20% of their break-up velocity. For the bulk of the sample, mass loss in a stellar wind and/or envelope expansion is not efficient enough to significantly spin down these stars within the first few Myr of evolution. If massive-star formation results in stars rotating at birth with a large portion of their break-up velocities, an alternative braking mechanism, possibly magnetic fields, is thus required to explain the present-day rotational properties of the O-type stars in 30 Dor. The presence of a sizeable population of fast rotators is compatible with recent population synthesis computations that investigate the influence of binary evolution on the rotation rate of massive stars. Even though we have excluded stars that show significant radial velocity variations, our sample may have remained contaminated by post-interaction binary products. That the highvelocity tail may be populated primarily (and perhaps exclusively) by post-binary interaction products has important implications for the evolutionary origin of systems that produce gamma-ray bursts. © 2013 Author(s).

Relevância:

60.00% 60.00%

Publicador:

Resumo:

The analytic advantages of central concepts from linguistics and information theory, and the analogies demonstrated between them, for understanding patterns of retrieval from full-text indexes to documents are developed. The interaction between the syntagm and the paradigm in computational operations on written language in indexing, searching, and retrieval is used to account for transformations of the signified or meaning between documents and their representation and between queries and documents retrieved. Characteristics of the message, and messages for selection for written language, are brought to explain the relative frequency of occurrence of words and multiple word sequences in documents. The examples given in the companion article are revisited and a fuller example introduced. The signified of the sequence stood for, the term classically used in the definitions of the sign, as something standing for something else, can itself change rapidly according to its syntagm. A greater than ordinary discourse understanding of patterns in retrieval is obtained.

Relevância:

60.00% 60.00%

Publicador:

Resumo:

An analogy is established between the syntagm and paradigm from Saussurean linguistics and the message and messages for selection from the information theory initiated by Claude Shannon. The analogy is pursued both as an end itself and for its analytic value in understanding patterns of retrieval from full text systems. The multivalency of individual words when isolated from their syntagm is contrasted with the relative stability of meaning of multi-word sequences, when searching ordinary written discourse. The syntagm is understood as the linear sequence of oral and written language. Saussureâ??s understanding of the word, as a unit which compels recognition by the mind, is endorsed, although not regarded as final. The lesser multivalency of multi-word sequences is understood as the greater determination of signification by the extended syntagm. The paradigm is primarily understood as the network of associations a word acquires when considered apart from the syntagm. The restriction of information theory to expression or signals, and its focus on the combinatorial aspects of the message, is sustained. The message in the model of communication in information theory can include sequences of written language. Shannonâ??s understanding of the written word, as a cohesive group of letters, with strong internal statistical influences, is added to the Saussurean conception. Sequences of more than one word are regarded as weakly correlated concatenations of cohesive units.

Relevância:

60.00% 60.00%

Publicador:

Resumo:

This paper provides algorithms that use an information-theoretic analysis to learn Bayesian network structures from data. Based on our three-phase learning framework, we develop efficient algorithms that can effectively learn Bayesian networks, requiring only polynomial numbers of conditional independence (CI) tests in typical cases. We provide precise conditions that specify when these algorithms are guaranteed to be correct as well as empirical evidence (from real world applications and simulation tests) that demonstrates that these systems work efficiently and reliably in practice.

Relevância:

60.00% 60.00%

Publicador:

Resumo:

We study non-Markovian decoherence phenomena by employing projection-operator formalism when a quantum system (a quantum bit or a register of quantum bits) is coupled to a reservoir. By projecting out the degree of freedom of the reservoir, we derive a non-Markovian master equation for the system, which is reduced to a Lindblad master equation in Markovian limit, and obtain the operator sum representation for the time evolution. It is found that the system is decohered slower in the non- Markovian reservoir than the Markovian because the quantum information of the system is memorized in the non-Markovian reservoir. We discuss the potential importance of non-Markovian reservoirs for quantum-information processing.

Relevância:

60.00% 60.00%

Publicador:

Relevância:

60.00% 60.00%

Publicador:

Resumo:

The need to merge multiple sources of uncertaininformation is an important issue in many application areas,especially when there is potential for contradictions betweensources. Possibility theory offers a flexible framework to represent,and reason with, uncertain information, and there isa range of merging operators, such as the conjunctive anddisjunctive operators, for combining information. However, withthe proposals to date, the context of the information to be mergedis largely ignored during the process of selecting which mergingoperators to use. To address this shortcoming, in this paper,we propose an adaptive merging algorithm which selects largelypartially maximal consistent subsets (LPMCSs) of sources, thatcan be merged through relaxation of the conjunctive operator, byassessing the coherence of the information in each subset. In thisway, a fusion process can integrate both conjunctive and disjunctiveoperators in a more flexible manner and thereby be morecontext dependent. A comparison with related merging methodsshows how our algorithm can produce a more consensual result.