La gouvernance nodale de la sécurité locale

Le présent travail de recherche se propose d’analyser les dispositifs de gouvernance nodale de la sécurité locale en France, alors que le paradigme a vu le jour et s’est développé dans les pays anglo-saxons fortement décentralisés. C’est qu’en France les dispositifs de gouvernance nodale s’apparentent bien plus à un dialogue entre central et local qu’entre secteur public et privé. La recherche identifie ainsi les caractéristiques de la gouvernance nodale au cœur des dispositifs partenariaux de la sécurité locale, supportés par le Contrat Local de Sécurité (CLS), le Conseil Local de Sécurité et de Prévention de la Délinquance (CLSPD) ou encore le Groupe Local de Traitement de la Délinquance (GLTD). La recherche identifie ainsi les stratégies de décentrage de l’État et de transfert de la production de sécurité vers une diversité d’acteurs locaux, dont les maires et les services municipaux. Une diversité de politiques publiques locales de sécurité de pertinences différentes voit alors le jour. Le premier enseignement de cette recherche est l’importance du rôle joué par le node super-structurel, que nous appelons super-node et qui regroupe le maire ou l’élu local à la sécurité, le responsable de la police d’État, celui de la police municipale et le représentant de l’État. Il apparaît que dans le dispositif de gouvernance nodale, ce groupe informel génère la dynamique collective qui permet de regrouper, tant les producteurs que les consommateurs de sécurité locale gravitant au sein du réseau local de sécurité. La quarantaine d’entrevues qualitatives permet également d’identifier que la Justice, productrice de sécurité comme peut l’être aussi la sécurité privée ou la médiation sociale, apparaît plus distante que ce que pouvait laisser penser l’étude des textes réglementaires organisant le partenariat. Les bailleurs sociaux, les transporteurs et l’Éducation nationale apparaissent clairement comme des acteurs importants, mais périphériques de sécurité, en intégrant cette « famille élargie » de la sécurité locale. Le deuxième enseignement est relatif au fonctionnement même du dispositif nodal ainsi que du super-node, la recherche permettant d’identifier les ressources mutualisées par l’ensemble des nodes. Cela permet également d’identifier les mécanismes de répartition des tâches entre les différents acteurs et plus particulièrement entre les deux organisations policières d’État et municipale, travaillant autant en compétition, qu’en complémentarité. Cette recherche explore également le rôle joué par l’information dans le fonctionnement du super-node ainsi que l’importance de la confiance dans les relations interpersonnelles des représentants des nodes au sein du super-node. Enfin, l’étude permet également de mettre en perspective les limites du dispositif actuel de gouvernance nodale : le défaut avéré d’outils performants permettant d’informer convenablement le super-node quant aux phénomènes de violence ainsi que d’évaluer l’efficience du dispositif. Cela permet également de questionner l’autonomie des dispositifs de gouvernance nodale, la confiance pouvant ouvrir à la déviance et la collégialité au défaut de la traçabilité de la responsabilité. La fracture avec la société civile apparaît clairement et ne facilite pas le contrôle sur un mode de production de sécurité qui se développe en parallèle des dispositifs traditionnels de démocratie locale.

Network Connectivity under Node Failure

We examine a non-cooperative model of network formation where players may stop functioning with a given probability. When this happens all the links associated with this player are no longer available in the network. In the model, players receive benefits from connecting directly and indirectly to other agents in the network through costly links. We identify conditions under which a Nash network will remain connected after the loss of k nodes by introducing the notion of k-Node Super Connectivity network. We identify similar conditions for efficient networks as well.

Parallel geostatistics for sparse and dense datasets

Very large spatially-referenced datasets, for example, those derived from satellite-based sensors which sample across the globe or large monitoring networks of individual sensors, are becoming increasingly common and more widely available for use in environmental decision making. In large or dense sensor networks, huge quantities of data can be collected over small time periods. In many applications the generation of maps, or predictions at specific locations, from the data in (near) real-time is crucial. Geostatistical operations such as interpolation are vital in this map-generation process and in emergency situations, the resulting predictions need to be available almost instantly, so that decision makers can make informed decisions and define risk and evacuation zones. It is also helpful when analysing data in less time critical applications, for example when interacting directly with the data for exploratory analysis, that the algorithms are responsive within a reasonable time frame. Performing geostatistical analysis on such large spatial datasets can present a number of problems, particularly in the case where maximum likelihood. Although the storage requirements only scale linearly with the number of observations in the dataset, the computational complexity in terms of memory and speed, scale quadratically and cubically respectively. Most modern commodity hardware has at least 2 processor cores if not more. Other mechanisms for allowing parallel computation such as Grid based systems are also becoming increasingly commonly available. However, currently there seems to be little interest in exploiting this extra processing power within the context of geostatistics. In this paper we review the existing parallel approaches for geostatistics. By recognising that diffeerent natural parallelisms exist and can be exploited depending on whether the dataset is sparsely or densely sampled with respect to the range of variation, we introduce two contrasting novel implementations of parallel algorithms based on approximating the data likelihood extending the methods of Vecchia [1988] and Tresp [2000]. Using parallel maximum likelihood variogram estimation and parallel prediction algorithms we show that computational time can be significantly reduced. We demonstrate this with both sparsely sampled data and densely sampled data on a variety of architectures ranging from the common dual core processor, found in many modern desktop computers, to large multi-node super computers. To highlight the strengths and weaknesses of the diffeerent methods we employ synthetic data sets and go on to show how the methods allow maximum likelihood based inference on the exhaustive Walker Lake data set.

Super extended versus extended pelvic lymph node dissection in patients undergoing radical cystectomy for bladder cancer: a comparative study

There is evidence from retrospective studies that radical cystectomy with extended pelvic lymph node dissection provides better staging and outcomes than limited lymph node dissection. However, the optimal limits of extended lymph node dissection remain unclear. We compared oncological outcomes at 2 cystectomy centers where 2 different extended lymph node dissection templates are practiced to determine whether removing lymphatic tissue up to the inferior mesenteric artery confers an additional survival advantage.

Experimental demonstration of an all-optical interferometric drop, add, and extract multiplexer for OFDM super-channel

The experimental implementation of an all-optical node able of routing a channel contained in an all-optical OFDM super-channel is presented. The extract function is performed through channel selection, reshaping and interferometric suppression.

Cascaded all-optical sub-channel add/drop multiplexing from a 1-Tb/s super-channel having 2-GHz guard-bands

We demonstrate cascaded 100-Gb/s sub-channel add/drop from a 1-Tb/s multi-band OFDM super-channel having 2-GHz inter-sub-channel guard-bands within a recirculating loop via a hierarchical ROADM using high-resolution filters, showcasing 1000-km transmission reach and five ROADM node passages for the add/drop sub-channel when hybrid Raman-EDFA is implemented.

Service quality in Hong Kong : wet markets vs super markets

Purpose – The purpose of this paper is to determine consumer perceptions of service quality in wet markets and supermarkets in Hong Kong. Design/methodology/approach – A questionnaire was developed and distributed via a convenience sample to consumers in shopping malls in Causeway Bay, Mong Kok and Tsuen Wan. Findings – The study finds that supermarkets outperformed wet markets across all aspects of service quality as measured by SERVQUAL-P. Research limitations/implications – Implications suggest that wet market vendors are not providing the level of service quality demanded by their customers. In particular, findings suggest that wet market vendors need to improve the visual attractiveness of their stalls, work on making them look more professional and start using more modern equipment. Practical implications – Wet market vendors in conjunction with government representatives need to develop standards of service quality for wet markets across Hong Kong. This is imperative if the wet market model is to survive in what is a highly competitive food retailing industry. Without action, it appears that the supermarketization of the Hong Kong food retailing industry will continue unabated. Originality/value – This paper adds to a small but growing research stream examining service quality in the food retailing industry in Hong Kong. It provides empirical results that guide suggested actions for change.

Fast searching algorithm for candidate satellite-node set in NLMG

The Node-based Local Mesh Generation (NLMG) algorithm, which is free of mesh inconsistency, is one of core algorithms in the Node-based Local Finite Element Method (NLFEM) to achieve the seamless link between mesh generation and stiffness matrix calculation, and the seamless link helps to improve the parallel efficiency of FEM. Furthermore, the key to ensure the efficiency and reliability of NLMG is to determine the candidate satellite-node set of a central node quickly and accurately. This paper develops a Fast Local Search Method based on Uniform Bucket (FLSMUB) and a Fast Local Search Method based on Multilayer Bucket (FLSMMB), and applies them successfully to the decisive problems, i.e. presenting the candidate satellite-node set of any central node in NLMG algorithm. Using FLSMUB or FLSMMB, the NLMG algorithm becomes a practical tool to reduce the parallel computation cost of FEM. Parallel numerical experiments validate that either FLSMUB or FLSMMB is fast, reliable and efficient for their suitable problems and that they are especially effective for computing the large-scale parallel problems.

P2 purinergic receptor mRNA in rat and human sinoatrial node and other heart regions.

It is known that adenosine 5'-triphosphate (ATP) is a cotransmitter in the heart. Additionally, ATP is released from ischemic and hypoxic myocytes. Therefore, cardiac-derived sources of ATP have the potential to modify cardiac function. ATP activates P2X(1-7) and P2Y(1-14) receptors; however, the presence of P2X and P2Y receptor subtypes in strategic cardiac locations such as the sinoatrial node has not been determined. An understanding of P2X and P2Y receptor localization would facilitate investigation of purine receptor function in the heart. Therefore, we used quantitative PCR and in situ hybridization to measure the expression of mRNA of all known purine receptors in rat left ventricle, right atrium and sinoatrial node (SAN), and human right atrium and SAN. Expression of mRNA for all the cloned P2 receptors was observed in the ventricles, atria, and SAN of the rat. However, their abundance varied in different regions of the heart. P2X(5) was the most abundant of the P2X receptors in all three regions of the rat heart. In rat left ventricle, P2Y(1), P2Y(2), and P2Y(14) mRNA levels were highest for P2Y receptors, while in right atrium and SAN, P2Y(2) and P2Y(14) levels were highest, respectively. We extended these studies to investigate P2X(4) receptor mRNA in heart from rats with coronary artery ligation-induced heart failure. P2X(4) receptor mRNA was upregulated by 93% in SAN (P < 0.05), while a trend towards an increase was also observed in the right atrium and left ventricle (not significant). Thus, P2X(4)-mediated effects might be modulated in heart failure. mRNA for P2X(4-7) and P2Y(1,2,4,6,12-14), but not P2X(2,3) and P2Y(11), was detected in human right atrium and SAN. In addition, mRNA for P2X(1) was detected in human SAN but not human right atrium. In human right atrium and SAN, P2X(4) and P2X(7) mRNA was the highest for P2X receptors. P2Y(1) and P2Y(2) mRNA were the most abundant for P2Y receptors in the right atrium, while P2Y(1), P2Y(2), and P2Y(14) were the most abundant P2Y receptor subtypes in human SAN. This study shows a widespread distribution of P2 receptor mRNA in rat heart tissues but a more restricted presence and distribution of P2 receptor mRNA in human atrium and SAN. This study provides further direction for the elucidation of P2 receptor modulation of heart rate and contractility.

Molecular architecture of the human sinus node: insights into the function of the cardiac pacemaker.

BACKGROUND: Although we know much about the molecular makeup of the sinus node (SN) in small mammals, little is known about it in humans. The aims of the present study were to investigate the expression of ion channels in the human SN and to use the data to predict electrical activity. METHODS AND RESULTS: Quantitative polymerase chain reaction, in situ hybridization, and immunofluorescence were used to analyze 6 human tissue samples. Messenger RNA (mRNA) for 120 ion channels (and some related proteins) was measured in the SN, a novel paranodal area, and the right atrium (RA). The results showed, for example, that in the SN compared with the RA, there was a lower expression of Na(v)1.5, K(v)4.3, K(v)1.5, ERG, K(ir)2.1, K(ir)6.2, RyR2, SERCA2a, Cx40, and Cx43 mRNAs but a higher expression of Ca(v)1.3, Ca(v)3.1, HCN1, and HCN4 mRNAs. The expression pattern of many ion channels in the paranodal area was intermediate between that of the SN and RA; however, compared with the SN and RA, the paranodal area showed greater expression of K(v)4.2, K(ir)6.1, TASK1, SK2, and MiRP2. Expression of ion channel proteins was in agreement with expression of the corresponding mRNAs. The levels of mRNA in the SN, as a percentage of those in the RA, were used to estimate conductances of key ionic currents as a percentage of those in a mathematical model of human atrial action potential. The resulting SN model successfully produced pacemaking. CONCLUSIONS: Ion channels show a complex and heterogeneous pattern of expression in the SN, paranodal area, and RA in humans, and the expression pattern is appropriate to explain pacemaking.

Automatic tracking, super-resolution and recognition of human faces from surveillance video

Identifying an individual from surveillance video is a difficult, time consuming and labour intensive process. The proposed system aims to streamline this process by filtering out unwanted scenes and enhancing an individual's face through super-resolution. An automatic face recognition system is then used to identify the subject or present the human operator with likely matches from a database. A person tracker is used to speed up the subject detection and super-resolution process by tracking moving subjects and cropping a region of interest around the subject's face to reduce the number and size of the image frames to be super-resolved respectively. In this paper, experiments have been conducted to demonstrate how the optical flow super-resolution method used improves surveillance imagery for visual inspection as well as automatic face recognition on an Eigenface and Elastic Bunch Graph Matching system. The optical flow based method has also been benchmarked against the ``hallucination'' algorithm, interpolation methods and the original low-resolution images. Results show that both super-resolution algorithms improved recognition rates significantly. Although the hallucination method resulted in slightly higher recognition rates, the optical flow method produced less artifacts and more visually correct images suitable for human consumption.

Nation and Internet : Malaysia and the multimedia super corridor

As part of a development plan-in-progress spanning a total of 25 years (1996 to 2020), Malaysia’s Multimedia Super Corridor MSC provides a unique opportunity to witness a brief and microcosmic unfolding of that process which Lewis Mumford lays out in exhaustive detail in Technics and Civilization (Mumford, 1963). What makes it doubly interesting is the interlocking of national imagining, destiny and progress with a specific group of technologies, information and communication technologies (ICT), of which the Internet is part. This paper casts Malaysia’s development and implementation of the MSC as the core round which an enquiry of the association between the nation and the Internet is woven. I argue here that there are 3 dissonances that occur within the relationship between the Malaysian nation and the Internet. The first of these arises from the tension between the premises underlying techno-utopianism and pro-Malay affirmative action. The second is born of the discordance between the “guaranteed” freedom from online censorship and the absolute punitive powers of the state. The third lies in the contradiction between the Malaysian nation, as practiced through graduated sovereignty and its pro-Bumiputera affirmative action. Together, these three comprise the inflections that the Internet has on Malaysia. Further, I contend that aside from adding to the number of ways in which the nation is understood and experienced, these inflections also have the potential to disrupt how the nation is lived. By lived I mean to denote the realisation of the nation that occurs in and through everyday life.