نتایج جستجو برای: insa de lyon france
تعداد نتایج: 1575016 فیلتر نتایج به سال:
In this report, we propose a modification of the multi-resolution frequency domain ParFlow (MR-FDPF) method that allows simulating radio propagation channels in a frequency range. The performance of the proposed MR-FDPF implementation has been analyzed based on different realistic propagation scenarios. Key-words: ParFlow, TLM, wave propagation, indoor radio propagation, channel simulation, mul...
1CNR− Istituto di Fotonica e Nanotecnologie, Via Cineto Romano 42, 00156 Rome, Italy 2COBRA Research Institute, Eindhoven University of Technology, PO Box 513, 5600MB Eindhoven, The Netherlands 3Institute of Photonics and Quantum Electronics, Ecole Polytechnique Fédérale de Lausanne (EPFL), CH−1015 Lausanne, Switzerland 4Institut des Nanotechnologies de Lyon, Université de Lyon, CNRS UMR5270, I...
Johan Gyselinck1, Patrick Dular2, Laurent Krähenbühl3, Ruth V. Sabariego4 1 BEAMS Department, Université Libre de Bruxelles (ULB), Belgium, [email protected] 2ACE, Dept. of Electrical Engineering and Computer Science, University of Lie‘ge (ULg), Belgium, [email protected] 3Université de Lyon, Ampere (CNRS UMR5005, Ecole Centrale de Lyon, INSA-Lyon, UCBL), France 4Dept. Electrical ...
A. Lazariev, F. Fauvelle, M. Piotto, K. Elbayed, J. Namer, D. van Ormondt, and D. Graveron-Demilly Laboratoire Creatis-LRMN; CNRS UMR 5220; INSERM U630; INSA de Lyon, Université Claude Bernard Lyon 1, Villeurbanne, France, CRSSA/BCM, Grenoble, France, Bruker BioSpin, Wissembourg, France, Institut de Chimie, Strasbourg, France, Department of Biophysics and Nuclear Medicine, University Hospitals ...
Three algorithms — CubeMiner, Trias, and Data-Peeler — have been recently proposed to mine closed patterns in ternary relations, i.e., a generalization of the so-called formal concept extraction from binary relations. In this paper, we consider the specific context where a ternary relation denotes the value of a graph adjacency matrix (i. e., a Vertices × Vertices matrix) at different timestamp...
In this paper, we propose an accurate method to evaluate the available bandwidth in IEEE 802.11-based ad hoc networks. We improve the method described in [12]. We evaluate our solution on different scenarios. We also provide a comparison with different QoS routing protocols, BRuIT, AAC and QoS-AODV, based on different available bandwidth estimation techniques. Key-words: Available bandwidth est...
Makoto Shimizu 1,2,*, Hiroki Akutsu 1, Shinichiro Tsuda 1, Fumitada Iguchi 1 and Hiroo Yugami 1 1 Graduate School of Engineering, Tohoku University, Sendai 980-8579, Japan; [email protected] (H.A.); [email protected] (S.T.); [email protected] (F.I.); [email protected] (H.Y.) 2 Centre de Thermique de Lyon, Unité Mixte de Recherche 50...
This chapter illustrates how inductive querying techniques can be used to support knowledge discovery from genomic data. More precisely, it presents a data mining scenario to discover putative transcription factor binding sites in gene promoter sequences. We do not provide technical details about the used constraintbased data mining algorithms that have been previously described. Our contributi...
1 Philippe Pouletaut, 1 Tien Tuan Dao, 2 Jean-Christophe Goebel, 2 Olivier Beuf, 3 Astrid Pinzano, 1 Marie-Christine Ho Ba Tho and 3 Pierre Gillet 1 UTC CNRS UMR 6600, BMBI Biomécanique et Bioingénierie, Université de Technologie de Compiègne, France, 2 CREATIS, CNRS UMR 5220, Inserm U1044, Université Lyon 1, INSA-Lyon, France, 3 CNRS UMR 7561, PPIA, Physiologie et Pharmacologie et Ingénieries ...
M. Bajard 1 , M. Chevallier 1 , D. Dauvergne 1 , N. Freud 2 , P. Henriquet 1 , S. Karkar 3 , F. Le Foulher 1 , J.M. Létang 2 , R. Plescak 4 , C. Ray 1 , D. Schardt 4 , E. Testa 1# , M. Testa 1 . IPNL, Université de Lyon, F-69003 Lyon; Université Lyon 1 and CNRS/IN2P3, UMR 5822, F-69622 Villeurbanne, France ; 2 Laboratoire de Contrôles Non Destructifs par Rayonnements Ionisants, INSA-Lyon, F-696...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید