Добірка наукової літератури з теми "Problèmes en ligne"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Problèmes en ligne".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Problèmes en ligne":
KUNGUDI MALIO, Patrick, Papy KULUNGU ZUMBU, Jacques DISONAMA PHEMBA, Willy KAZADI MITENGA, Alphonse KITOKO MWANA, and Serge TSHIMANGA TSHIUNZA. "Problématique du déploiement d’une application de e-commerce pour la vente des logiciels." Revue du Centre de Recherche Interdisciplinaire de l'Université Pédagogique Nationale 96, no. 4 (May 1, 2021): 111–19. http://dx.doi.org/10.62362/sosy7137.
Stępniak, Piotr. "LA RESPONSABILITE CIVILE EN CAS DE LA NEGLIGENCE ET D’ERREUR MEDICALE." REVISTA ESMAT 13, no. 21 (October 20, 2021): 215–26. http://dx.doi.org/10.34060/reesmat.v13i21.436.
Jin, Qingna, Mijung Kim, and Suzanna Wong. "Elementary Students’ Online Information Problem Solving (IPS) in a Science Classroom." Alberta Journal of Educational Research 69, no. 1 (March 17, 2023): 1–19. http://dx.doi.org/10.55016/ojs/ajer.v69i1.71768.
Clerc, Louis. "La Finlande et le débat sur I'OTAN durant la campagne présidentielle de 1999-2000 (Note)." Études internationales 33, no. 2 (April 12, 2005): 303–24. http://dx.doi.org/10.7202/704409ar.
Bernie Baeaufort. "Vote en ligne pour les initiatives de terrain en Californie : Collecte de signatures électroniques." International Journal of Science and Society 4, no. 4 (October 18, 2022): 75–83. http://dx.doi.org/10.54783/ijsoc.v4i4.555.
JEON, Hak-Seon. "L’Ère du métaverse et autorégulation des plateformes en ligne." Korean Constitutional Law Association 28, no. 4 (December 30, 2022): 401–30. http://dx.doi.org/10.35901/kjcl.2022.28.4.401.
Thibault, André. "Le destin de ‹-oir(e)› en français laurentien et la neutralisation de l’opposition /ɑ/ ~ /ɔ/ devant /ʁ/". SHS Web of Conferences 78 (2020): 02006. http://dx.doi.org/10.1051/shsconf/20207802006.
Marique, Pierre-Xavier, Maud Jacquet, François Georges, Maryse Hoebeke, and Marianne Poumay. "Dispositif en ligne d’entraînement à la résolution de problèmes de physique." RDST, no. 15 (June 30, 2017): 237–60. http://dx.doi.org/10.4000/rdst.1519.
Sarr, Elhadji, Christophe Estay, and Malick Faye. "L’acceptation des systèmes d’enseignement en ligne par les étudiants des établissements d’enseignement supérieur privé au Sénégal." Management & Sciences Sociales N° 35, no. 2 (December 13, 2023): 107–20. http://dx.doi.org/10.3917/mss.035.0107.
Barnabé, Jocelyne, and Gérald Doré. "Le repérage des zones de pauvreté sur les territoires de C.L.S.C. — Une méthodologie de recherche pour l’action." Service social 38, no. 2-3 (April 12, 2005): 270–81. http://dx.doi.org/10.7202/706442ar.
Дисертації з теми "Problèmes en ligne":
Jolivet, Frederic. "Approches "problèmes inverses" régularisées pour l'imagerie sans lentille et la microscopie holographique en ligne." Thesis, Lyon, 2018. http://www.theses.fr/2018LYSES012/document.
In Digital Imaging, the regularized inverse problems methods reconstruct particular information from measurements and an image formation model. With an inverse problem that is ill-posed and illconditioned, and with the used image formation mode! having few constraints, it is necessary to introduce a priori conditions in order to restrict ambiguity for the inversion. This allows us to guide the reconstruction towards a satisfying solution. The works of the following thesis delve into the development of reconstruction algorithms of digital holograms based on large-scale optimization methods (smooth and non-smooth). This general framework allowed us to propose different approaches adapted to the challenges found with this unconventional imaging technique: the super-resolution, reconstruction outside the sensor's field, the color holography and finally, the quantitative reconstruction of phase abjects (i.e. transparent). For this last case, the reconstruction problem consists of estimating the complex 2D transmittance of abjects having absorbed and/or dephased the light wave during the recording of the hologram. The proposed methods are validated with the help of numerical simulations that are then applied on experimental data taken from the lensless imaging or from the in-line holographie microscopy (coherent imaging in transmission, with a microscope abject glass). The applications range from the reconstruction of opaque resolution sights, to the reconstruction of biological objects (bacteria), passing through the reconstruction of evaporating ether droplets from a perspective of turbulence study in fluid mechanics
Salim, Soufian Antoine. "Analyse discursive multi-modale des conversations écrites en ligne portées sur la résolution de problèmes." Thesis, Nantes, 2017. http://www.theses.fr/2017NANT4074/document.
We are interested in problem-solving online written conversations. These conversations may be found on online channels such as forums, mailing lists or chat rooms. In the literature, human interactions are usually modelled in terms of dialogue acts. Dialogue acts are typically used to represent the discursive functions of utterances in dialogue. We want to use dialogue acts for the analysis of online written conversations. Well-defined methods and models allowing for the fine-grained analysis of these conversations would represent a solid framework to support different user-assistance and dialogue analysis systems. This would represent an important stake for the customer support industry, but could also be used to improve collaborative assistance platforms that are accessed daily by millions of users. However, current conversations analysis techniques were not developed with written online conversations in mind. It is necessary to adapt existing resources for these conversations. This effort is related to the field of research in computer-mediated conversations (CMC). Our goal is to build a dialogue act model for problem-solving online written conversations, and to offer tools for the automatic recognition of these acts
Tisserand, Arnaud. "Adéquation arithmétique architecture, problèmes et étude de cas." Phd thesis, Ecole normale supérieure de lyon - ENS LYON, 1997. http://tel.archives-ouvertes.fr/tel-00445752.
Zaid, Abdelkarim. "Problèmes didactiques d'une documentation et d'une assistance pédagogique en ligne pour des ingénieurs en formation en alternance." Phd thesis, École normale supérieure de Cachan - ENS Cachan, 2004. http://tel.archives-ouvertes.fr/tel-00136834.
Hachicha, Marouane. "Modélisation de hiérarchies complexes dans les entrepôts de données XML et traitement des problèmes d'additivité dans l'analyse en ligne XOLAP." Thesis, Lyon 2, 2012. http://www.theses.fr/2012LYO22016/document.
Since its inception in 1998, the eXtensible Markup Language (XML) has emerged as a standard for data representation and exchange over the Internet. XML provides an opportunity for modeling data structures that are not easily represented in relational systems. In this context, XML data warehouses nowadays form the basis of several decision-support applications exploiting heterogeneous data (little structured and coming from various sources) bearing complex structures, such as complex hierarchies. In this thesis, we propose a novel XOLAP (XML-OLAP) approach that automatically detects and processes summarizability issues at query time, without requiring any particular expertise from the user. Thus, at the logical level, we choose XML data trees, so-called multidimensional data trees, to model the multidimensional structures (facts, dimensions, measures and complex hierarchies) of XML data warehouses. In order to query multidimensional data trees, we model user queries as XML pattern trees. Then, we introduce a new aggregation algorithm to address summarizability issues in complex hierarchies. On the basis of this algorithm, we propose a novel XOLAP roll-up operator. Finally, we experimentally validate our proposal and compare our approach with the reference approach for addressing summarizability issues in complex hierarchies. For this sake, we extend the XML warehouse benchmark XWeB with complex hierarchies to generate XML data warehouses with scalable complex hierarchies. The results of our experiments show that the overhead induced by managing hierarchy complexity at run-time is totally acceptable and that our approach is expected to scale up well
ARADIAN, Achod André. "Quelques problèmes de dynamique d'interfaces molles." Phd thesis, Université Pierre et Marie Curie - Paris VI, 2001. http://tel.archives-ouvertes.fr/tel-00001386.
Ridouard, Frédéric. "Contributions à des problèmes d'ordonnancement en ligne : l'ordonnancement temps réel de tâches à suspension et l'ordonnancement par une machine à traitement par lot." Poitiers, 2006. http://www.theses.fr/2006POIT2323.
In this report, two scheduling problems are studied, using the competitive analysis. The first problem is the scheduling of independant hard real-time tasks with self-suspensions. We first establish results about the difficulties of this scheduling problem (computationnal complexity, scheduling anomalies and non-optimality of on-line algorithms). We have prooved the non-competitiveness of on-line algorithmes for two performance criteria even if they have a faster processor than the adversary. Finaly, we have studied several feasibility tests established for this problem with the competitive analysis. The second problem concerns the single batching machine scheduling problem. We have proposed three on-line competitive algorithms for problems with unbounded batch sizes. We defined the algorithm αH∞ that is a best possible on-line algorithm for the general problem because its competitive ratio is equal to the lower bound, (1+p5)/2
Bousse, Alexandre. "Problèmes inverses, application à la reconstruction compensée en mouvement en angiographie rotationnelle X." Phd thesis, Université Rennes 1, 2008. http://tel.archives-ouvertes.fr/tel-00361396.
Une fois le mouvement estimé, la reconstruction tomographique à un instant de référence est effectuée par une optimisation aux moindres-carrés qui inclut le mouvement ainsi qu'un terme de pénalité qui favorise les valeurs d'intensités fortes pour les voxels au voisinage de la ligne centrale 3-D, et les faibles valeurs pour les autres. Cette méthode a été testée sur des données simulées basées sur des lignes centrales 3-D préalablement extraites de données MSCT.
Bergé, Pierre. "Algorithmes pour voyager sur un graphe contenant des blocages." Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLS480.
We study NP-hard problems on graphs with blockages seen as models of networks which are exposed to risk of failures.We treat cut problems via the parameterized complexity framework. The cutset size p is taken as a parameter. Given a set of sources {s1,...,sk} and a target $t, we propose an algorithm which builds a small edge cut of size p separating at least r sources from t. This NP-complete problem is called Partial One-Target Cut. It belongs to the family of multiterminal cut problems. Our algorithm is fixed-parameter tractable (FPT) as its execution takes $2^{O(p^2)}n^{O(1)}$. We prove that the vertex version of this problem, which imposes cuts to contain vertices instead of edges, is W[1]-hard. Then, we design an FPT algorithm which counts the minimum vertex (S,T)-cuts of an undirected graph in time $2^{O(plog p)}n^{O(1)}$.We provide numerous results on the competitive ratio of both deterministic and randomized strategies for the Canadian Traveller Problem. The optimal ratio obtained for the deterministic strategies on general graphs is 2k+1, where k is a given upper bound on the number of blockages. We show that randomized strategies which do not use memory cannot improve the bound 2k+1. In addition, we discuss the tightness of lower bounds on the competitiveness of randomized strategies. The distance competitive ratio for a group of travellers possibly equipped with telecommunication devices is studied. Eventually, a strategy dedicated to equal-weight chordal graphs is proposed while another one is built for graphs with small maximum (s,t)-cuts. Both strategies outperform the ratio 2k+1
Arres, Billel. "Optimisation des performances dans les entrepôts distribués avec Mapreduce : traitement des problèmes de partionnement et de distribution des données." Thesis, Lyon, 2016. http://www.theses.fr/2016LYSE2012.
In this manuscript, we addressed the problems of data partitioning and distribution for large scale data warehouses distributed with MapReduce. First, we address the problem of data distribution. In this case, we propose a strategy to optimize data placement on distributed systems, based on the collocation principle. The objective is to optimize queries performances through the definition of an intentional data distribution schema of data to reduce the amount of data transferred between nodes during treatments, specifically during MapReduce’s shuffling phase. Secondly, we propose a new approach to improve data partitioning and placement in distributed file systems, especially Hadoop-based systems, which is the standard implementation of the MapReduce paradigm. The aim is to overcome the default data partitioning and placement policies which does not take any relational data characteristics into account. Our proposal proceeds according to two steps. Based on queries workload, it defines an efficient partitioning schema. After that, the system defines a data distribution schema that meets the best user’s needs, and this, by collocating data blocks on the same or closest nodes. The objective in this case is to optimize queries execution and parallel processing performances, by improving data access. Our third proposal addresses the problem of the workload dynamicity, since users analytical needs evolve through time. In this case, we propose the use of multi-agents systems (MAS) as an extension of our data partitioning and placement approach. Through autonomy and self-control that characterize MAS, we developed a platform that defines automatically new distribution schemas, as new queries appends to the system, and apply a data rebalancing according to this new schema. This allows offloading the system administrator of the burden of managing load balance, besides improving queries performances by adopting careful data partitioning and placement policies. Finally, to validate our contributions we conduct a set of experiments to evaluate our different approaches proposed in this manuscript. We study the impact of an intentional data partitioning and distribution on data warehouse loading phase, the execution of analytical queries, OLAP cubes construction, as well as load balancing. We also defined a cost model that allowed us to evaluate and validate the partitioning strategy proposed in this work
Книги з теми "Problèmes en ligne":
Ouellet, Gilles. Algèbre linéaire: Vecteurs et géométrie. 2nd ed. Sainte-Foy, Québec: Éditions Le Griffon d'argile, 2002.
Sainte-Laguë, A. Avec des nombres et des lignes (récréations mathématiques). Paris: Vuibert, 2001.
Boucher, Hélène. Entre les lignes: Textes et activités pour développer des compétences en français au secondaire. Montréal: Chenelière-éducation, 2007.
Paul, Longley, ed. Geographic Information Systems and Science. 2nd ed. Chichester: Wiley, 2005.
Bidard-Gibson, Jacqueline, and Marie Therese Villamena. Ligne Directe. Hodder Arnold H&S, 1996.
Vabre. Les Lignes: Problèmes d'électronique impulsionnelle. Ellipses Marketing, 1998.
Med, l'édition Vert. Bien Sûr, Laissez-Moi Tout Laisser Tomber et Travailler Sur Votre Problème.: Cahier Ligné. Independently Published, 2021.
Collègues, M. H. Bien Sûr, Laissez-Moi Tout Laisser Tomber et Travailler Sur Votre Problème.: Cahier Ligné. Independently Published, 2021.
Cahier Ecriture Cahier Ecriture Insolite. Bien SûR. Laisse-Moi Tout Mettre de Côté Pour M'occuper de Tes Problèmes: Carnet de Notes -108 Pages Avec Papier Ligné Petit Format A5 - Blanc Sur Noir. Independently Published, 2018.
Retraites, Cahiers de Les. Retraité Ce N'Est Plus Mon Problème Carnet de Notes: Un Carnet de Notes Drôle Pour les Retraités - 110 Pages, Ligné - 15. 24x22. 86 Cm -. Independently Published, 2019.
Частини книг з теми "Problèmes en ligne":
MOMEY, Fabien, Thomas OLIVIER, and Corinne FOURNIER. "Reconstruction d’échantillons en microscopie holographique numérique en ligne." In Imageries optiques non conventionnelles pour la biologie, 103–41. ISTE Group, 2023. http://dx.doi.org/10.51926/iste.9132.ch4.
MAYER, ROBERT, and CHRISTIANE CARDINAL. "LA POLICE, UN INTERVENANT DE PREMIERE LIGNE POUR LE RÉSEAU DE LA SANTÉ MENTALE." In Problèmes sociaux – Tome II, 447–69. Presses de l'Université du Québec, 2001. http://dx.doi.org/10.2307/j.ctv18ph386.23.
Sestier, F. "Problèmes de la vigilance chez les pilotes de ligne." In Vigilance et transports, 173–77. Presses universitaires de Lyon, 1995. http://dx.doi.org/10.4000/books.pul.39822.
Schell, Robyn, and David Kaufman. "La collaboration en ligne pour un apprentissage par problèmes (CLAP)." In Jeux et simulations éducatifs, 365–84. Presses de l'Université du Québec, 2010. http://dx.doi.org/10.2307/j.ctv18pgk91.22.
BELKHARROUBI, Lakhdar, and Khadidja YAHYAOUI. "La résolution du problème d’équilibrage d’une chaîne de montage à modèles mixtes." In Optimisation et apprentissage, 93–119. ISTE Group, 2023. http://dx.doi.org/10.51926/iste.9071.ch4.
"Établir les grandes lignes de l'application des enseignements des sciences comportementales aux politiques en matière d'environnement." In Traiter les problèmes environnementaux avec l'aide des sciences comportementales, 39–48. OECD, 2017. http://dx.doi.org/10.1787/9789264280977-4-fr.
Звіти організацій з теми "Problèmes en ligne":
Warin, Thierry. Risques liés aux chaînes d’approvisionnement : réalité vécue et perceptions de la population du Québec. CIRANO, August 2022. http://dx.doi.org/10.54932/dmik1689.