1,721,753 research outputs found
La libre circulation sous pression. Régulation et dérégulation des mobilités dans l'Union européenne (a cura di Heidi Mercenier, Eadaoin Ni Chaoimh, Ludivine Damay, Giacomo Delledonne)
No full text
Étude d'impact imparfaite mais considérée par la Cour comme permettant néanmoins de donner au public et à l'administration les informations nécessaires à l'exercice de ses facultés ou de ses compétences. Evaluation des mesures compensatoires comprise dans le montant global des investissements. Difficulté d'une évaluation spécifique. Etude d'impact jugée suffisante. /Modification notable du projet initial imposée par l'arrêté d'autorisation concernant le traitement des rejets. Modification devant assurer globalement une meilleure protection de l'environnement et pouvant être imposée sans nouvelle enquête publique. Cour administrative d'appel de Nancy (formation pleinière), 4 novembre 1993 S.A. Union française des pétroles. Avec note.
No full textDamay Philippe. Étude d'impact imparfaite mais considérée par la Cour comme permettant néanmoins de donner au public et à l'administration les informations nécessaires à l'exercice de ses facultés ou de ses compétences. Evaluation des mesures compensatoires comprise dans le montant global des investissements. Difficulté d'une évaluation spécifique. Etude d'impact jugée suffisante. /Modification notable du projet initial imposée par l'arrêté d'autorisation concernant le traitement des rejets. Modification devant assurer globalement une meilleure protection de l'environnement et pouvant être imposée sans nouvelle enquête publique. Cour administrative d'appel de Nancy (formation pleinière), 4 novembre 1993 S.A. Union française des pétroles. Avec note.. In: Revue Juridique de l'Environnement, n°1, 1994. pp. 71-76
Towards a more reliable symmetry determination from powder diffraction: a redetermination of the low-temperature structure of 4-methylpyridine-N-oxide
No full textThe low-temperature structure of 4-methylpyridine-N-oxide was previously determined in symmetry P4(1) [Damay et al. (2006), Acta Cryst. B62, 627-633]. Using a recently published symmetry-determination method it was found that the true symmetry of the structure is P4(1)2(1)2. The structure was refined in the new space group using X-ray and neutron data. The previously published structure is close to the newly refined structure, but the new structure is in agreement with the results of rotational tunneling spectroscopy, and, in contrast to the structure in symmetry P4(1), does not require a twofold degeneracy of the tunneling bands.LC
Fully-Dynamic Decision Trees
Get PDFWe develop the first fully dynamic algorithm that maintains a decision tree over an arbitrary sequence of insertions and deletions of labeled examples. Given ε>0 our algorithm guarantees that, at every point in time, every node of the decision tree uses a split with Gini gain within an additive ε of the optimum. For real-valued features the algorithm has an amortized running time per insertion/deletion of O((d·log³n)/ε²), which improves to O((d·log²n)/ε) for binary or categorical features, while it uses space O(n·d), where n is the maximum number of examples at any point in time and d is the number of features. Our algorithm is nearly optimal, as we show that any algorithm with similar guarantees requires amortized running time Ω(d) and space Ω(n·d/polylog(nd)). We complement our theoretical results with an extensive experimental evaluation on real-world data, showing the effectiveness of our algorithm
Fully-Dynamic Decision Trees
No full textWe develop the first fully dynamic algorithm that maintains a decision tree over an arbitrary sequence of insertions and deletions of labeled examples. Given ε>0 our algorithm guarantees that, at every point in time, every node of the decision tree uses a split with Gini gain within an additive ε of the optimum. For real-valued features the algorithm has an amortized running time per insertion/deletion of O((d·log3n)/ε2), which improves to O((d·log2n)/ε) for binary or categorical features, while it uses space O(n·d), where n is the maximum number of examples at any point in time and d is the number of features. Our algorithm is nearly optimal, as we show that any algorithm with similar guarantees requires amortized running time Ω(d) and space Ω(n·d/polylog(nd)). We complement our theoretical results with an extensive experimental evaluation on real-world data, showing the effectiveness of our algorithm
Going Beyond Counting First Authors in Author Co-citation Analysis
Get PDFThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
- …
