HAL: Hyper Article en Ligne
Not a member yet
3159010 research outputs found
Sort by
Are Abstract-interpreter Baseline JITs Worth it? An Empirical Evaluation through Metacompilation
No full textInternational audienceBaseline JIT compilers need to compile early and as fast as possible, while still performing optimizations. One powerful technique to write fast baseline JIT compilers is abstract interpretation. Several implementations of this technique exist in practice, implementing in a single pass optimizations such as register allocation, constant propagation, and instruction scheduling. However, although they share the same technique, all these implementations vary in the exact optimizations performed, their internal design and further implementation details (e.g., the implementation language and framework). Thus, it is challenging to understand and isolate the benefits of the technique by simply studing these existing implementations.Understanding the real impact of compile-time abstract interpreters requires isolating performance differences and experimenting with different variations of the same implementation, which demands extensive engineering work. In this paper, we propose to analyse the impact of abstract interpreters through metacompilation. We use metacompilation as a means to (a) reduce the experimentation effort and (b) to produce compiler variants that are comparable, reducing implementation noise.We implemented our solution to generate several JIT compiler variants for the Pharo VM. We describe the adaptations required in the metacompilation framework to target both abstract interpreters and direct translators, in combination with Static Type Prediction optimizations.Our benchmarks show that compile-time abstract interpreters, on average, reduce the emitted machine code size by 12% and increase execution speed by 10%, up to 30%, without increasing JIT compilation overhead, compared to direct translators.</div
Impact of lymph node staging on survival in presumed early-stage ovarian cancer: a multicentric retrospective study
No full textInternational audienceObjective:This study aimed to assess the impact of comprehensive staging on survival outcomes in this population.Methods:Patients who underwent surgery for epithelial ovarian cancer in one of the 14 Francogyn cancer centers between 2000 and 2020 were included in the study. The primary analysis evaluated the impact of lymphadenectomy on overall survival and recurrence-free survival. Lymph node count was analyzed as a continuous variable, and its association with survival, considered as a continuous outcome was assessed using linear regression (secondary analysis). Survival was compared using the log-rank test, and multivariate analysis was performed using a Cox model.Results:A total of 467 patients with presumed early-stage epithelial ovarian cancer were included, of which 198 underwent complete lymphadenectomy and 266 did not. No significant association was found between lymph node staging and survival in the primary analysis, possibly due to limited statistical power and a selection bias, as patients without lymphadenectomy had more favorable disease profiles (p=0.600 and p=0.700, respectively). Complete lymphadenectomy was associated with a significantly higher risk of complications (34.5% vs. 14%, p<0.001). In secondary analysis, the number of para-aortic lymph nodes harvested was identified as an independent predictor of both overall survival and recurrence-free survival (p=0.007 and p=0.002, respectively). Histological characteristics and adjuvant chemotherapy also showed a significant correlation with improved survival outcomes.Conclusion:Extensive para-aortic lymphadenectomy in early-stage epithelial ovarian cancer is associated with better overall and recurrence-free survival but comes with an increased risk of complications
ProvSQL: A General System for Keeping Track of the Provenance and Probability of Data
No full textInternational audienceWe present the data model, design choices, and performance of ProvSQL, a general and easy-to-deploy provenance tracking and probabilistic database system implemented as a PostgreSQL extension. ProvSQL’s data and query models closely reflect that of a large core of SQL, including multiset semantics, the full relational algebra, and aggregation. A key part of its implementation relies on generic provenance circuits stored in memory-mapped files. We propose benchmarks to measure the overhead of provenance and probabilistic evaluation and demonstrate its scalability and competitiveness with respect to other state-of-the-art systems
La place du scripteur urbain dans la procédure judiciaire des villes médiévales de l’Ouest
No full textInternational audienceCette article présente le rôle du scripteur au cours de la procédure en insistant sur son rôle en amont du procès mais aussi pendant le procès que cela soit en tant que greffier ou juge suppléant. Il évoque, enfin, le rôle du scripteur après le procès qui se limite, dans les villes de l’Ouest, à des travaux d’écritures
Beyond uniqueness: Relaxation calculus of junction conditions for coercive Hamilton-Jacobi equations
No full textInternational audienceA junction is a particular network given by the collection of half lines glued together at the origin. On such a junction, we consider evolutive Hamilton-Jacobi equations with coercive Hamiltonians. Furthermore,we consider a general desired junction condition at the origin, given by some monotone function .There is existence and uniqueness of solutions which only satisfy weakly the junction condition (at the origin, they satisfy either the desired junction condition or the PDE).We show that those solutions satisfy strongly a relaxed junction condition (that we can recognize as an effective junction condition). It is remarkable that this relaxed condition can be computed in three different but equivalent ways: 1) using viscosity inequalities, 2) using Godunov fluxes, 3) using Riemann problems.Our result goes beyond uniqueness theory, in the following sense: solutions to two different desired junction conditions and do coincide if
Qui sera candidat ? Une histoire de la candidature à l’élection présidentielle en France, de la Troisième République à nos jours
No full textInternational audienc
Bigraded Castelnuovo-Mumford regularity and Groebner bases
No full textInternational audienceWe study the relation between the bigraded Castelnuovo-Mumford regularity of abihomogeneous ideal in the coordinate ring of the product of two projective spaces and the bidegrees of a Groebner basis of with respect to the degree reverse lexicographical monomial order in generic coordinates. For the single-graded case, Bayer and Stillman unraveled all aspects of this relationship forty years ago and these results led to complexity estimates for computations with Groebner bases. We build on this work to introduce a bounding region of the bidegrees of minimal generators of bihomogeneous Groebner bases for . We also use this region to certify the presence of some minimalgenerators close to its boundary. Finally, we show that, up to a certain shift, this region is related to the bigraded Castelnuovo-Mumford regularity of
Expérience des âges de la vie et formation de soi -30 contributions: une dimension sensible, existentielle en contexte d'orientationsolidarité éducative et âges de la vie
No full textInternational audienc
Possible Explanation of at Large Using Quantum Statistical Mechanics
No full textInternational audienceThe ratio of the neutron to proton structure functions, , is expected to approach 1/4 as , based on the assumption that vanishes as . This expectation is in striking disagreement with a recent measurement by the Marathon experiment of the scattering of electrons off the mirror nuclei H and He, showing that is larger than 1/4 for . We have examined the consequences of the Pauli Exclusion Principle for the parton distributions in the nucleon when the partons are described by quantum statistical mechanics. We find that the recent experimental result on the over the broad range of can be well described by the quantum statistical approach