Literatura científica selecionada sobre o tema "Agrégation sécurisée"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Agrégation sécurisée".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Artigos de revistas sobre o assunto "Agrégation sécurisée"
Crespy, Alexandre, Gregoire Boulouis, Héloïse Ifergan, Valère Barrot, Fakhreddine Boustia, Richard Bibi, Denis Herbreteau e Kévin Janot. "Efficacité et sécurité d'une double anti- agrégation par kardégic et ticagrelor pour le traitement par stent à diversion de flux des anévrismes de la circulation cérébrale postérieure". Journal of Neuroradiology 49, n.º 2 (março de 2022): 144–45. http://dx.doi.org/10.1016/j.neurad.2022.01.049.
Texto completo da fonteTeses / dissertações sobre o assunto "Agrégation sécurisée"
El, Khalil Firas. "Sécurité de la base de données cadastrales". Thesis, Polynésie française, 2015. http://www.theses.fr/2015POLF0001/document.
Texto completo da fonteQuantity Based Aggregation (QBA) controls closely related to inference control database and has been rarely addressed by the scientific community. Let us consider a set S of N elements. The aggregation of k elements, at most, out of N is not considered sensitive, while the aggregation of mor than k out of N elements is considered sensitive and should be prevented. The role of QBA control is to make sure the number of disclosed elements of S is less than or equal to k, where k
Curt, Corinne. "Evaluation de la performance des barrages en service basée sur une formalisation et une agrégation des connaisssances". Clermont-Ferrand 2, 2008. http://www.theses.fr/2008CLF21819.
Texto completo da fonteOuni, Zaïd. "Statistique pour l’anticipation des niveaux de sécurité secondaire des générations de véhicules". Thesis, Paris 10, 2016. http://www.theses.fr/2016PA100099/document.
Texto completo da fonteRoad safety is a world, European and French priority. Because light vehicles (or simply“vehicles”) are obviously one of the main actors of road activity, the improvement of roadsafety necessarily requires analyzing their characteristics in terms of traffic road accident(or simply “accident”). If the new vehicles are developed in engineering department and validated in laboratory, it is the reality of real-life accidents that ultimately characterizesthem in terms of secondary safety, ie, that demonstrates which level of security they offer to their occupants in case of an accident. This is why car makers want to rank generations of vehicles according to their real-life levels of safety. We address this problem by exploiting a French data set of accidents called BAAC (Bulletin d’Analyse d’Accident Corporel de la Circulation). In addition, fleet data are used to associate a generational class (GC) to each vehicle. We elaborate two methods of ranking of GCs in terms of secondary safety. The first one yields contextual rankings, ie, rankings of GCs in specified contexts of accident. The second one yields global rankings, ie, rankings of GCs determined relative to a distribution of contexts of accident. For the contextual ranking, we proceed by “scoring”: we look for a score function that associates a real number to any combination of GC and a context of accident; the smaller is this number, the safer is the GC in the given context. The optimal score function is estimated by “ensemble learning”, under the form of an optimal convex combination of scoring functions produced by a library of ranking algorithms by scoring. An oracle inequality illustrates the performance of the obtained meta-algorithm. The global ranking is also based on “scoring”: we look for a scoring function that associates any GC with a real number; the smaller is this number, the safer is the GC. Causal arguments are used to adapt the above meta-algorithm by averaging out the context. The results of the two ranking procedures are in line with the experts’ expectations
Memon, Irfana. "Energy efficient secure and privacy preserving data aggregation in Wireless Sensor Networks". Thesis, Aix-Marseille, 2013. http://www.theses.fr/2013AIXM4079.
Texto completo da fonteWSNs are formed by sensor nodes that have the ability to sense the environment, process the sensed information, and communicate via radio without any additional prior backbone infrastructure. In WSNs, communication with other nodes is the most energy consuming task. Hence, the primary objective in designing protocols for WSNs is to minimize communication overhead. This is often achieved using in-network data aggregation. As WSNs are often deployed in open environments, they are vulnerable to security attacks. This thesis contributes toward the design of energy efficient secure and privacy preserving data aggregation protocol for WSNs. First, we classify the main existing secure and privacy-preserving data aggregation protocols for WSNs in the literature. We then propose an energy-efficient secure and privacy-preserving data aggregation (ESPPA) scheme for WSNs. ESPPA scheme is tree-based and achieves confidentiality and privacy based on shuffling technique. We propose a secure tree construction (ST) and tree-reconstruction scheme. Simulation results show that ESPPA scheme effectively preserve privacy, confidentiality, and has less communication overhead than SMART. Finally we propose an extension of ST scheme, called secure coverage tree (SCT) construction scheme. SCT applies sleep scheduling. Through simulations, we show the efficacy and efficiency of the SCT scheme. Beside the work on secure and privacy preserving data aggregation, during my research period, we have also worked on another interesting topic (i.e., composite event detection for WSNs). Appendix B presents a complementary work on composite event detection for WSNs
Atoui, Ibrahim Abdelhalim. "Data reduction techniques for wireless sensor networks using mathematical models". Thesis, Bourgogne Franche-Comté, 2018. http://www.theses.fr/2018UBFCD009.
Texto completo da fonteIn this thesis, we present energy-efficient data reduction and security techniques dedicated for wireless sensor networks. First, we propose a data aggregation model based on the similarity function that helps in removing the redundant data. In addition, based on the fitting functions we worked on sending less data features, accompanied with the fitting function that expresses all features. Second, we focus on heterogeneity of the data while studying the correlation among these multivariate features in order to enhance the data prediction technique that is based on the polynomial function, all after removing the similar measures in the aggregation phase using the Euclidean distance. Finally, we provide a rigorous security framework inherited from cryptography satisfies the level of exigence usually attained in tree-based WSNs. It prevents attackers from gaining any information about sensed data, by ensuring an end-to-end privacy between sensor nodes and the sink. In order to validate our proposed techniques, we implemented the simulations of the first technique on real readings collected from a small Sensor Scope network which is deployed at the Grand-St-Bernard, while the simulations of the second and the third techniques are conducted on real data collected from 54 sensors deployed in the Intel Berkeley Research Lab. The performance of our techniques is evaluated according to data reduction rate, energy consumption, data accuracy and time complexity