Le contrôle judiciaire de la procédure administrative : éléments de droit comparé, fédéral, ontarien et québécois

The exercise of diverse powers whether « administrative » or judicial or quasi-judicial by administrative bodies, raises many procedural issues. This article approaches them from a comparative point of view, hocking at selected cases from of Ontario and Quebec courts and the Federal Court of Canada. The cases studied concern the judicial control of administrative procedure followed by central institutions (that is, the Crown, governmental departments and administrative agencies, commissions or boards) in the three systems of law mentioned. A comparative approach permits us to identify existing trends in the immense body of day-to-day decisions made by the courts. Thus, with respect to the many procedural questions raised by administrative and governmental decision-making, elements of convergence or divergence can be identified in the judicial answers given to practical issues

Constraint-based Subspace Clustering

International audienceIn high dimensional data, the general performance of traditional clustering algorithms decreases. This is partly because the similarity criterion used by these algorithms becomes inadequate in high dimensional space. Another reason is that some dimensions are likely to be irrelevant or contain noisy data, thus hiding a possible clustering. To overcome these problems, subspace clustering techniques, which can automatically find clusters in relevant subsets of dimensions, have been developed. However, due to the huge number of subspaces to consider, these techniques often lack efficiency. In this paper we propose to extend the framework of bottom up subspace clustering algorithms by integrating background knowledge and, in particular, instance-level constraints to speed up the enumeration of subspaces. We show how this new framework can be applied to both density and distance based bottom-up subspace clustering techniques. Our experiments on real datasets show that instance-level constraints cannot only increase the efficiency of the clustering process but also the accuracy of the resultant clustering

El silúrico de Galicia Media (central): su importancia en la paleográfica varisca

[Resumen] La sucesión silúrica es estudiada en el flanco Oeste y Sud-Oeste del anticlinal del (Ollo de Sapo» (Este de Cabo Ortegal y región de Verín). Estas observaciones y los datos exIstentes permiten discutir ciertos problemas estratigráficos y paleogeográficos. Se señala la originalidad de la zona de Galicia Media-"Tras"'os"Montes” en el marco de la paleogeografía del Silúrico de la Península Ibérica[Abstract] The Silurian succession is described in the region located to the Westand the Southwest of the ((0llo de Sapo» anticline (East of Cabo ,Ortegal and Verinarea). Stratigraphical and palaeogeographical problems are discussed on the basis of this study and of previous data. The originality of the ((Middle-Galicia-Tras-os-Montes zone» in the Iherian Silurian palaeogeography is pointed out

Discovering the structure of complex networks: Implementation and Complexity of the heuristic MACH

Getting a labeling of vertices close to the structure of the graph has been proven to be of interest in many applications e.g., to follow signals indexed by the vertices of the network. This question can be related to a graph labeling problem known as the cyclic bandwidth sum problem. It consists in finding a labeling of the vertices of an undirected and unweighted graph with distinct integers such that the sum of (cyclic) difference of labels of adjacent vertices is minimized. Although theoretical results exist that give optimal value of cyclic bandwidth sum for standard graphs, there are neither results in the general case, nor explicit methods to reach this optimal result. In addition to this lack of theoretical knowledge, only a few methods have been proposed to approximately solve this problem. This report describes the implementation and the complexity of the heuristic MACH, developed to find an approximate solution for the cyclic bandwidth sum problem, by following the structure of the graph. The heuristic is a two-step algorithm: the first step consists of traversing the graph to find a set of paths which follow the structure of the graph, using a similarity criterion based on the Jaccard index to jump from one vertex to the next one. The second step is the merging of all obtained paths, based on a greedy approach that extends a partial solution by inserting a new path at the position that minimizes the cyclic bandwidth sum. 1 Description of the heuristic MACH The aim of the heuristic, introduced in [1], is to build a labeling by traversing the graph to discover its structure. The heuristic we propose consists of a two-step algorithm. The first step performs local searches in order to find a collection of independent paths with respect to the local structure of the graph, while the second step determines the best way to arrange the paths such that the objective function of the Cyclic Bandwidth Sum is minimized

Loi de puissance et caractérisation des réseaux dynamiques

National audienceCaractériser la dynamique et l'évolution au cours du temps d'un réseau sans fil multi sauts (réseaux ad hoc, réseaux de senseurs) apparaît comme un problème important car cela doit permettre de comprendre, de modéliser et de développer des algorithmes et des protocoles adaptés. A partir des traces expérimentales collectées lors de la conférence Infocom 2005 [1], nous proposons une analyse plus avancée de la structure évolutive de ce genre de réseaux. Plus précisément, nous montrons que la seule caractérisation au travers d'une loi de puissance des contacts et inter-contacts entre individus/noeuds n'est pas suffisante pour capturer et rendre l'évolution du réseau. A partir d'une analyse combinant trois approches [2] qui se révèlent très complémentaires (théorie des graphes, processus aléatoires et fouille de données), nous proposons un modèle simple mettant en évidence la complexité de la structure évolutive

Factorisation de réseaux temporels : étude des rythmes hebdomadaires du système Vélo'v

International audienceWe study the Vélo'v system, a fully automated bike-sharing system in Lyon, using a temporal network representation. A decomposition of this network is proposed by using nonnegative matrix factorisation (NMF), whose the choice of parameters is discussed. This decomposition enables us to represent the temporal network as a mixture of subnetwork, whose structures describe specific behaviors of Vélo'v users, in relation with the geographical and socio-economical space. Coefficients of activation associated to the patterns separate temporally each subnetwork, enabling an interpretation consistent with the literature on bike-sharing systems.Nous étudions le système Vélo'v, un système automatisé de location de vélos à Lyon, en le représentant sous la forme d'un réseau temporel. Une décomposition de ce réseau est proposée en utilisant une factorisation en matrices non-négatives (NMF), dont le choix des para-mètres est discuté. Cette décomposition permet de représenter à chaque instant le réseau comme un mélange de sous-réseaux, dont les structures décrivent des comportements spécifiques des utilisateurs Vélo'v, en lien avec l'espace géographique et socio-économique. Les coefficients d'activation associés à chacun des motifs permettent de séparer temporellement ceux-ci, permettant une interprétation cohérente avec la littérature sur les vélos en libre-service