991 resultados para Duprat, Antoine, Cardinal, 1463-1535.


Relevância:

10.00% 10.00%

Publicador:

Resumo:

Rendle, M. (2005). Family, Kinship and Revolution: The Russian Nobility, 1917-1923. Family and Community History. 8(1), pp.35-47. RAE2008

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Poolton, Nigel; Ozanyan, K.B.; Wallinga, J.; Murray, A.S., (2002) 'Electrons in feldspar II: a consideration of the influence of conduction band-tail states on luminescence processes', Physics and Chemistry of Minerals 29(3) pp.217-225 RAE2008

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Russell M. Morphew, Hazel A. Wright, E. James LaCourse, Debra J. Woods and Peter M. Brophy (2007). Comparative proteomics of excretory-secretory proteins released by the liver fluke Fasciola hepatica in sheep host bile and during in vitro culture ex host. Molecular and Cellular Proteomics, 6 (6), 963-972. Sponsorship: BBSRC / EU RAE2008

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Książka stanowi plon 2-letniego projektu badawczego zrealizowanego na Wydziale Neofilologii UAM przez zespół złożony z psychologa i filologów aż czterech specjalności językowych. Prezentuje zagadnienia ogólne (m.in. specyfilę komunikacji ustnej, kształtowanie postaw proautonomicznych i osobistej kompetencji komunikacyjnej) oraz sprawozdania z badań (dotyczące m.in. kształtowania samooceny, wrażliwości językowej, umiejętności argumentacyjnych i postawy podmiotowej).

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Wydział Matematyki i Informatyki: Zakład Lingwistyki Informatycznej i Sztucznej Inteligencji

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Wydział Historyczny: Instytut Historii

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Première edition revue, corrigée, et précédée d'une Préface à la Mosaïque, dans le plus nouveau goût.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

By utilizing structure sharing among its parse trees, a GB parser can increase its efficiency dramatically. Using a GB parser which has as its phrase structure recovery component an implementation of Tomita's algorithm (as described in [Tom86]), we investigate how a GB parser can preserve the structure sharing output by Tomita's algorithm. In this report, we discuss the implications of using Tomita's algorithm in GB parsing, and we give some details of the structuresharing parser currently under construction. We also discuss a method of parallelizing a GB parser, and relate it to the existing literature on parallel GB parsing. Our approach to preserving sharing within a shared-packed forest is applicable not only to GB parsing, but anytime we want to preserve structure sharing in a parse forest in the presence of features.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

We present a type system, StaXML, which employs the stacked type syntax to represent essential aspects of the potential roles of XML fragments to the structure of complete XML documents. The simplest application of this system is to enforce well-formedness upon the construction of XML documents without requiring the use of templates or balanced "gap plugging" operators; this allows it to be applied to programs written according to common imperative web scripting idioms, particularly the echoing of unbalanced XML fragments to an output buffer. The system can be extended to verify particular XML applications such as XHTML and identifying individual XML tags constructed from their lexical components. We also present StaXML for PHP, a prototype precompiler for the PHP4 scripting language which infers StaXML types for expressions without assistance from the programmer.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Metal oxide clusters of sub-nm dimensions dispersed on a metal oxide support are an important class of catalytic materials for a number of key chemical reactions, showing enhanced reactivity over the corresponding bulk oxide. In this paper we present the results of a density functional theory study of small sub-nm TiO2 clusters, Ti2O4, Ti3O6 and Ti4O8 supported on the rutile (110) surface. We find that all three clusters adsorb strongly with adsorption energies ranging from -3 eV to -4.5 eV. The more stable adsorption structures show a larger number of new Ti-O bonds formed between the cluster and the surface. These new bonds increase the coordination of cluster Ti and O as well as surface oxygen, so that each has more neighbours. The electronic structure shows that the top of the valence band is made up of cluster derived states, while the conduction band is made up of Ti 3d states from the surface, resulting in a reduction of the effective band gap and spatial separation of electrons and holes after photon absorption, which shows their potential utility in photocatalysis. To examine reactivity, we study the formation of oxygen vacancies in the cluster-support system. The most stable oxygen vacancy sites on the cluster show formation energies that are significantly lower than in bulk TiO2, demonstrating the usefulness of this composite system for redox catalysis.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

One problem in most three-dimensional (3D) scalar data visualization techniques is that they often overlook to depict uncertainty that comes with the 3D scalar data and thus fail to faithfully present the 3D scalar data and have risks which may mislead users’ interpretations, conclusions or even decisions. Therefore this thesis focuses on the study of uncertainty visualization in 3D scalar data and we seek to create better uncertainty visualization techniques, as well as to find out the advantages/disadvantages of those state-of-the-art uncertainty visualization techniques. To do this, we address three specific hypotheses: (1) the proposed Texture uncertainty visualization technique enables users to better identify scalar/error data, and provides reduced visual overload and more appropriate brightness than four state-of-the-art uncertainty visualization techniques, as demonstrated using a perceptual effectiveness user study. (2) The proposed Linked Views and Interactive Specification (LVIS) uncertainty visualization technique enables users to better search max/min scalar and error data than four state-of-the-art uncertainty visualization techniques, as demonstrated using a perceptual effectiveness user study. (3) The proposed Probabilistic Query uncertainty visualization technique, in comparison to traditional Direct Volume Rendering (DVR) methods, enables radiologists/physicians to better identify possible alternative renderings relevant to a diagnosis and the classification probabilities associated to the materials appeared on these renderings; this leads to improved decision support for diagnosis, as demonstrated in the domain of medical imaging. For each hypothesis, we test it by following/implementing a unified framework that consists of three main steps: the first main step is uncertainty data modeling, which clearly defines and generates certainty types of uncertainty associated to given 3D scalar data. The second main step is uncertainty visualization, which transforms the 3D scalar data and their associated uncertainty generated from the first main step into two-dimensional (2D) images for insight, interpretation or communication. The third main step is evaluation, which transforms the 2D images generated from the second main step into quantitative scores according to specific user tasks, and statistically analyzes the scores. As a result, the quality of each uncertainty visualization technique is determined.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

We revisit the well-known problem of sorting under partial information: sort a finite set given the outcomes of comparisons between some pairs of elements. The input is a partially ordered set P, and solving the problem amounts to discovering an unknown linear extension of P, using pairwise comparisons. The information-theoretic lower bound on the number of comparisons needed in the worst case is log e(P), the binary logarithm of the number of linear extensions of P. In a breakthrough paper, Jeff Kahn and Jeong Han Kim (STOC 1992) showed that there exists a polynomial-time algorithm for the problem achieving this bound up to a constant factor. Their algorithm invokes the ellipsoid algorithm at each iteration for determining the next comparison, making it impractical. We develop efficient algorithms for sorting under partial information. Like Kahn and Kim, our approach relies on graph entropy. However, our algorithms differ in essential ways from theirs. Rather than resorting to convex programming for computing the entropy, we approximate the entropy, or make sure it is computed only once in a restricted class of graphs, permitting the use of a simpler algorithm. Specifically, we present: an O(n2) algorithm performing O(log n·log e(P)) comparisons; an O(n2.5) algorithm performing at most (1+ε) log e(P) + Oε(n) comparisons; an O(n2.5) algorithm performing O(log e(P)) comparisons. All our algorithms are simple to implement. © 2010 ACM.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Background: Anti-Müllerian hormone (AMH), secreted by the granulosa cells of preantral and small antral follicles, has been described as a potential marker of the ovarian reserve. The aim of this prospective study is to investigate the variations of AMH during the menstrual cycle in a young selected population of normo-ovulatory women and to analyse the correlation with other cyclic hormones. Methods: Twenty healthy volunteers from 19 to 35 years old, with regular menstrual cycles (26-31 days), normal ovulation (day 10-16), normal hormonal profile and normal body mass index (18-26 kg/m2) were recruited. AMH, inhibin B, LH, FSH, estradiol and progesterone were measured on days 3, 7, 10, 11, 12, 13, 14, 15, 16, 18, 21 and 25 of a spontaneous cycle. Results: AMH serum levels, either expressed by cycleday or aligned according to the ovulation day, did not show any significant variations during the menstrual cycle. Conclusions: No significant fluctuation of the AMH level during the menstrual cycle was observed. Therefore, this hormone is particularly interesting for clinical evaluation of the ovarian reserve as it may be used at any time during the cycle. © The Author 2007.