959 resultados para Syntactic derivation
Resumo:
Between 1959 and 1987 we operated on 18 patients for malignant oddian tumor. Eleven had a Whipple resection, 3 a bilio-enteric anastomosis, 4 a local excision with or without bilio-enteric anastomosis. The overall operative mortality was 11% and the median survival was 13.8 months. Three patients are living and without evidence of disease 12, 29 and 30 months, respectively, after a Whipple resection. Because of their anatomy and favourable behaviour, malignant oddian tumors must be separated from the other periampullary tumors. Echography and endoscopic retrograde cholangiopancreatography with deep biopsies are the most efficient diagnostic modalities. With the aim of cure, the treatment is always surgical and relies mainly on duodenopancreatectomy. Those patients with unresectable tumors or unfit for a major procedure should benefit from internal or external biliary drainage. By coexisting duodenal obstruction, a surgical double derivation should be done.
Resumo:
Abstract Textual autocorrelation is a broad and pervasive concept, referring to the similarity between nearby textual units: lexical repetitions along consecutive sentences, semantic association between neighbouring lexemes, persistence of discourse types (narrative, descriptive, dialogal...) and so on. Textual autocorrelation can also be negative, as illustrated by alternating phonological or morpho-syntactic categories, or the succession of word lengths. This contribution proposes a general Markov formalism for textual navigation, and inspired by spatial statistics. The formalism can express well-known constructs in textual data analysis, such as term-document matrices, references and hyperlinks navigation, (web) information retrieval, and in particular textual autocorrelation, as measured by Moran's I relatively to the exchange matrix associated to neighbourhoods of various possible types. Four case studies (word lengths alternation, lexical repulsion, parts of speech autocorrelation, and semantic autocorrelation) illustrate the theory. In particular, one observes a short-range repulsion between nouns together with a short-range attraction between verbs, both at the lexical and semantic levels. Résumé: Le concept d'autocorrélation textuelle, fort vaste, réfère à la similarité entre unités textuelles voisines: répétitions lexicales entre phrases successives, association sémantique entre lexèmes voisins, persistance du type de discours (narratif, descriptif, dialogal...) et ainsi de suite. L'autocorrélation textuelle peut être également négative, comme l'illustrent l'alternance entre les catégories phonologiques ou morpho-syntaxiques, ou la succession des longueurs de mots. Cette contribution propose un formalisme markovien général pour la navigation textuelle, inspiré par la statistique spatiale. Le formalisme est capable d'exprimer des constructions bien connues en analyse des données textuelles, telles que les matrices termes-documents, les références et la navigation par hyperliens, la recherche documentaire sur internet, et, en particulier, l'autocorélation textuelle, telle que mesurée par le I de Moran relatif à une matrice d'échange associée à des voisinages de différents types possibles. Quatre cas d'étude illustrent la théorie: alternance des longueurs de mots, répulsion lexicale, autocorrélation des catégories morpho-syntaxiques et autocorrélation sémantique. On observe en particulier une répulsion à courte portée entre les noms, ainsi qu'une attraction à courte portée entre les verbes, tant au niveau lexical que sémantique.
Estudi comparatiu per ala millora dels resultatsdels traductorsautomàtics de l’empresaAutomaticTrans
Resumo:
Aquest treball pretén millorar els resultats dels traductors automàtics de l’empresa AutomaticTrans i la traducció a l’agència de notícies EuropaPress mitjançant la comparació d’un corpus de notícies en castellà amb la corresponent traducció al català per dos traductors automàtics: l’ATS1, utilitzat per EuropaPress, i l’ATS4, l’última versió del traductor
Resumo:
Although numerous positron emission tomography (PET) studies with (18) F-fluoro-deoxyglucose (FDG) have reported quantitative results on cerebral glucose kinetics and consumption, there is a large variation between the absolute values found in the literature. One of the underlying causes is the inconsistent use of the lumped constants (LCs), the derivation of which is often based on multiple assumptions that render absolute numbers imprecise and errors hard to quantify. We combined a kinetic FDG-PET study with magnetic resonance spectroscopic imaging (MRSI) of glucose dynamics in Sprague-Dawley rats to obtain a more comprehensive view of brain glucose kinetics and determine a reliable value for the LC under isoflurane anaesthesia. Maps of Tmax /CMRglc derived from MRSI data and Tmax determined from PET kinetic modelling allowed to obtain an LC-independent CMRglc . The LC was estimated to range from 0.33 ± 0.07 in retrosplenial cortex to 0.44 ± 0.05 in hippocampus, yielding CMRglc between 62 ± 14 and 54 ± 11 μmol/min/100 g, respectively. These newly determined LCs for four distinct areas in the rat brain under isoflurane anaesthesia provide means of comparing the growing amount of FDG-PET data available from translational studies.
Resumo:
This paper discusses the qualitativecomparative evaluation performed on theresults of two machine translation systemswith different approaches to the processing ofmulti-word units. It proposes a solution forovercoming the difficulties multi-word unitspresent to machine translation by adopting amethodology that combines the lexicongrammar approach with OpenLogos ontologyand semantico-syntactic rules. The paper alsodiscusses the importance of a qualitativeevaluation metrics to correctly evaluate theperformance of machine translation engineswith regards to multi-word units.
A performance lower bound for quadratic timing recovery accounting for the symbol transition density
Resumo:
The symbol transition density in a digitally modulated signal affects the performance of practical synchronization schemes designed for timing recovery. This paper focuses on the derivation of simple performance limits for the estimation of the time delay of a noisy linearly modulated signal in the presence of various degrees of symbol correlation produced by the varioustransition densities in the symbol streams. The paper develops high- and low-signal-to-noise ratio (SNR) approximations of the so-called (Gaussian) unconditional Cramér–Rao bound (UCRB),as well as general expressions that are applicable in all ranges of SNR. The derived bounds are valid only for the class of quadratic, non-data-aided (NDA) timing recovery schemes. To illustrate the validity of the derived bounds, they are compared with the actual performance achieved by some well-known quadratic NDA timing recovery schemes. The impact of the symbol transitiondensity on the classical threshold effect present in NDA timing recovery schemes is also analyzed. Previous work on performancebounds for timing recovery from various authors is generalized and unified in this contribution.
Resumo:
This paper is concerned with the derivation of new estimators and performance bounds for the problem of timing estimation of (linearly) digitally modulated signals. The conditional maximum likelihood (CML) method is adopted, in contrast to the classical low-SNR unconditional ML (UML) formulationthat is systematically applied in the literature for the derivationof non-data-aided (NDA) timing-error-detectors (TEDs). A new CML TED is derived and proved to be self-noise free, in contrast to the conventional low-SNR-UML TED. In addition, the paper provides a derivation of the conditional Cramér–Rao Bound (CRB ), which is higher (less optimistic) than the modified CRB (MCRB)[which is only reached by decision-directed (DD) methods]. It is shown that the CRB is a lower bound on the asymptotic statisticalaccuracy of the set of consistent estimators that are quadratic with respect to the received signal. Although the obtained boundis not general, it applies to most NDA synchronizers proposed in the literature. A closed-form expression of the conditional CRBis obtained, and numerical results confirm that the CML TED attains the new bound for moderate to high Eg/No.
Resumo:
The well-known structure of an array combiner along with a maximum likelihood sequence estimator (MLSE) receiveris the basis for the derivation of a space-time processor presentinggood properties in terms of co-channel and intersymbol interferencerejection. The use of spatial diversity at the receiver front-endtogether with a scalar MLSE implies a joint design of the spatialcombiner and the impulse response for the sequence detector. Thisis faced using the MMSE criterion under the constraint that thedesired user signal power is not cancelled, yielding an impulse responsefor the sequence detector that is matched to the channel andcombiner response. The procedure maximizes the signal-to-noiseratio at the input of the detector and exhibits excellent performancein realistic multipath channels.
Resumo:
In this paper, the problem of frame-level symboltiming acquisition for UWB signals is addressed. The main goalis the derivation of a frame-level timing estimator which does notrequire any prior knowledge of neither the transmitted symbolsnor the received template waveform. The independence withrespect to the received waveform is of special interest in UWBcommunication systems, where a fast and accurate estimation ofthe end-to-end channel response is a challenging and computationallydemanding task. The proposed estimator is derived under theunconditional maximum likelihood criterion, and because of thelow power of UWB signals, the low-SNR assumption is adopted. Asa result, an optimal frame-level timing estimator is derived whichoutperforms existing acquisition methods in low-SNR scenarios.
Resumo:
This correspondence addresses the problem of nondata-aidedwaveform estimation for digital communications. Based on the unconditionalmaximum likelihood criterion, the main contribution of this correspondenceis the derivation of a closed-form solution to the waveform estimationproblem in the low signal-to-noise ratio regime. The proposed estimationmethod is based on the second-order statistics of the received signaland a clear link is established between maximum likelihood estimation andcorrelation matching techniques. Compression with the signal-subspace isalso proposed to improve the robustness against the noise and to mitigatethe impact of abnormals or outliers.
Resumo:
AIMS: To validate a model for quantifying the prognosis of patients with pulmonary embolism (PE). The model was previously derived from 10 534 US patients. METHODS AND RESULTS: We validated the model in 367 patients prospectively diagnosed with PE at 117 European emergency departments. We used baseline data for the model's 11 prognostic variables to stratify patients into five risk classes (I-V). We compared 90-day mortality within each risk class and the area under the receiver operating characteristic curve between the validation and the original derivation samples. We also assessed the rate of recurrent venous thrombo-embolism and major bleeding within each risk class. Mortality was 0% in Risk Class I, 1.0% in Class II, 3.1% in Class III, 10.4% in Class IV, and 24.4% in Class V and did not differ between the validation and the original derivation samples. The area under the curve was larger in the validation sample (0.87 vs. 0.78, P=0.01). No patients in Classes I and II developed recurrent thrombo-embolism or major bleeding. CONCLUSION: The model accurately stratifies patients with PE into categories of increasing risk of mortality and other relevant complications. Patients in Risk Classes I and II are at low risk of adverse outcomes and are potential candidates for outpatient treatment.
Resumo:
BACKGROUND AND PURPOSE: The ASTRAL score was recently introduced as a prognostic tool for acute ischemic stroke. It predicts 3-month outcome reliably in both the derivation and the validation European cohorts. We aimed to validate the ASTRAL score in a Chinese stroke population and moreover to explore its prognostic value to predict 12-month outcome. METHODS: We applied the ASTRAL score to acute ischemic stroke patients admitted to 132 study sites of the China National Stroke Registry. Unfavorable outcome was assessed as a modified Rankin Scale score >2 at 3 and 12 months. Areas under the curve were calculated to quantify the prognostic value. Calibration was assessed by comparing predicted and observed probability of unfavorable outcome using Pearson correlation coefficient. RESULTS: Among 3755 patients, 1473 (39.7%) had 3-month unfavorable outcome. Areas under the curve for 3 and 12 months were 0.82 and 0.81, respectively. There was high correlation between observed and expected probability of unfavorable 3- and 12-month outcome (Pearson correlation coefficient: 0.964 and 0.963, respectively). CONCLUSIONS: ASTRAL score is a reliable tool to predict unfavorable outcome at 3 and 12 months after acute ischemic stroke in the Chinese population. It is a useful tool that can be readily applied in clinical practice to risk-stratify acute stroke patients.
Resumo:
The Jalta and Jebel Ghozlane ore deposits are located in the extreme North of Tunisia, within the Nappe zone. The mineralization of Jalta, hosted in Triassic dolostones and the overlying Mio-Pliocene conglomerates, consists of abundant galena, barite, and cerussite with accessory sphalerite, pyrite, and jordanite. At Jebel Ghozlane, large Pb-Zn concentrations occur in the Triassic dolostones and Eocene limestones. The mineral association consists of galena, sphalerite, barite, and celestite and their oxidation products (cerussite, smithsonite, and anglesite). Lead isotope ratios in galena from both districts are relatively homogeneous ((206)Pb/(204)Pb = 18.702-18.823, (207)Pb/(204)Pb = 15.665-15.677, (208)Pb/(204)Pb = 38.725-38.875). The delta(34)S values for sulfates from both areas (+12.2 to +16.2 parts per thousand at Jalta and + 14.3 to + 19.4 parts per thousand at Jebel Ghozlane) are compatible with a derivation of sulfur from marine sulfates, possibly sourced from the Triassic evaporites. The delta(34)S values of the sulfides have a range between -10 and +12.5 parts per thousand at Jalta, and between -9.1 and +22.1 parts per thousand at Jebel Ghozlane. The large range of values suggests reduction of the sulfate by bacterial and/or thermochemical reduction of sulfate to sulfur. The high delta(34)S values of sulfides require closed-system reduction processes. The isotopically light carbon in late calcites (-6.3 to -2.5 parts per thousand) and authigenic dolomite (-17.6 parts per thousand) suggests an organic source of at least some of the carbon in these samples, whereas the similarity of the delta(18)O values between calcite (+24.8 parts per thousand) and the authigenic dolomite (+24.7 parts per thousand) of Jalta and their respective host rocks reflects oxygen isotope buffering of the mineralizing fluids by the host rock carbonates. The secondary calcite isotope compositions of Jalta are compatible with a hydrothermal fluid circulation at approximately 100 to 200 degrees C, but temperatures as low as 50 degrees C may be indicated by the late calcite of Jebel Ghozlane (delta(18)O of +35.9 parts per thousand). Given the geological events related to the Alpine orogeny in the Nappe zone (nappe emplacement, bimodal volcanism, and reactivation of major faults, such as Ghardimaou-Cap Serrat) and the Neogene age of the host rocks in several localities, a Late-Miocene age is proposed for the Pb-Zn ore deposits considered in this study. Remobilization of deep-seated primary deposits in the Paleozoic sequence is the most probable source for metals in both localities considered in this study and probably in the Nappe zone as a whole. (C) 2011 Elsevier B.V. All rights reserved.
Resumo:
Koneet voidaan usein jakaa osajärjestelmiin, joita ovat ohjaus- ja säätöjärjestelmät, voimaa tuottavat toimilaitteet ja voiman välittävät mekanismit. Eri osajärjestelmiä on simuloitu tietokoneavusteisesti jo usean vuosikymmenen ajan. Osajärjestelmien yhdistäminen on kuitenkin uudempi ilmiö. Usein esimerkiksi mekanismien mallinnuksessa toimilaitteen tuottama voimaon kuvattu vakiona, tai ajan funktiona muuttuvana voimana. Vastaavasti toimilaitteiden analysoinnissa mekanismin toimilaitteeseen välittämä kuormitus on kuvattu vakiovoimana, tai ajan funktiona työkiertoa kuvaavana kuormituksena. Kun osajärjestelmät on erotettu toisistaan, on niiden välistenvuorovaikutuksien tarkastelu erittäin epätarkkaa. Samoin osajärjestelmän vaikutuksen huomioiminen koko järjestelmän käyttäytymissä on hankalaa. Mekanismien dynamiikan mallinnukseen on kehitetty erityisesti tietokoneille soveltuvia numeerisia mallinnusmenetelmiä. Useimmat menetelmistä perustuvat Lagrangen menetelmään, joka mahdollistaa vapaasti valittaviin koordinaattimuuttujiin perustuvan mallinnuksen. Numeerista ratkaisun mahdollistamiseksi menetelmän avulla muodostettua differentiaali-algebraaliyhtälöryhmää joudutaan muokkaamaan esim. derivoimalla rajoiteyhtälöitä kahteen kertaan. Menetelmän alkuperäisessä numeerisissa ratkaisuissa kaikki mekanismia kuvaavat yleistetyt koordinaatit integroidaan jokaisella aika-askeleella. Tästä perusmenetelmästä johdetuissa menetelmissä riippumattomat yleistetyt koordinaatit joko integroidaan ja riippuvat koordinaatit ratkaistaan rajoiteyhtälöiden perusteella tai yhtälöryhmän kokoa pienennetään esim. käyttämällä nopeus- ja kiihtyvyysanalyyseissä eri kiertymäkoordinaatteja kuin asema-analyysissä. Useimmat integrointimenetelmät on alun perin tarkoitettu differentiaaliyhtälöiden (ODE) ratkaisuunjolloin yhtälöryhmään liitetyt niveliä kuvaavat algebraaliset rajoiteyhtälöt saattavat aiheuttaa ongelmia. Nivelrajoitteiden virheiden korjaus, stabilointi, on erittäin tärkeää mekanismien dynamiikan simuloinnin onnistumisen ja tulosten oikeellisuuden kannalta. Mallinnusmenetelmien johtamisessa käytetyn virtuaalisen työn periaatteen oletuksena nimittäin on, etteivät rajoitevoimat tee työtä, eli rajoitteiden vastaista siirtymää ei tapahdu. Varsinkaan monimutkaisten järjestelmien pidemmissä analyyseissä nivelrajoitteet eivät toteudu tarkasti. Tällöin järjestelmän energiatasapainoei toteudu ja järjestelmään muodostuu virtuaalista energiaa, joka rikkoo virtuaalisen työn periaatetta, Tästä syystä tulokset eivät enää pidäpaikkaansa. Tässä raportissa tarkastellaan erityyppisiä mallinnus- ja ratkaisumenetelmiä, ja vertaillaan niiden toimivuutta yksinkertaisten mekanismien numeerisessa ratkaisussa. Menetelmien toimivuutta tarkastellaan ratkaisun tehokkuuden, nivelrajoitteiden toteutumisen ja energiatasapainon säilymisen kannalta.
Resumo:
La hiérarchie de Wagner constitue à ce jour la plus fine classification des langages ω-réguliers. Par ailleurs, l'approche algébrique de la théorie de langages formels montre que ces ensembles ω-réguliers correspondent précisément aux langages reconnaissables par des ω-semigroupes finis pointés. Ce travail s'inscrit dans ce contexte en fournissant une description complète de la contrepartie algébrique de la hiérarchie de Wagner, et ce par le biais de la théorie descriptive des jeux de Wadge. Plus précisément, nous montrons d'abord que le degré de Wagner d'un langage ω-régulier est effectivement un invariant syntaxique. Nous définissons ensuite une relation de réduction entre ω-semigroupes pointés par le biais d'un jeu infini de type Wadge. La collection de ces structures algébriques ordonnée par cette relation apparaît alors comme étant isomorphe à la hiérarchie de Wagner, soit un quasi bon ordre décidable de largeur 2 et de hauteur ω. Nous exposons par la suite une procédure de décidabilité de cette hiérarchie algébrique : on décrit une représentation graphique des ω-semigroupes finis pointés, puis un algorithme sur ces structures graphiques qui calcule le degré de Wagner de n'importe quel élément. Ainsi le degré de Wagner de tout langage ω-régulier peut être calculé de manière effective directement sur son image syntaxique. Nous montrons ensuite comment construire directement et inductivement une structure de n''importe quel degré. Nous terminons par une description détaillée des invariants algébriques qui caractérisent tous les degrés de cette hiérarchie. Abstract The Wagner hierarchy is known so far to be the most refined topological classification of ω-rational languages. Also, the algebraic study of formal languages shows that these ω-rational sets correspond precisely to the languages recognizable by finite pointed ω-semigroups. Within this framework, we provide a construction of the algebraic counterpart of the Wagner hierarchy. We adopt a hierarchical game approach, by translating the Wadge theory from the ω-rational language to the ω-semigroup context. More precisely, we first show that the Wagner degree is indeed a syntactic invariant. We then define a reduction relation on finite pointed ω-semigroups by means of a Wadge-like infinite two-player game. The collection of these algebraic structures ordered by this reduction is then proven to be isomorphic to the Wagner hierarchy, namely a well-founded and decidable partial ordering of width 2 and height $\omega^\omega$. We also describe a decidability procedure of this hierarchy: we introduce a graph representation of finite pointed ω-semigroups allowing to compute their precise Wagner degrees. The Wagner degree of every ω-rational language can therefore be computed directly on its syntactic image. We then show how to build a finite pointed ω-semigroup of any given Wagner degree. We finally describe the algebraic invariants characterizing every Wagner degree of this hierarchy.