Inhaltsverzeichnis
Auswahl der wissenschaftlichen Literatur zum Thema „Code non sûr“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Code non sûr" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "Code non sûr"
Parent, Colette, und Chris Bruckert. „Les travailleuses du sexe et la vie économique : marginalisation et résistance“. Criminologie 43, Nr. 2 (04.04.2011): 199–217. http://dx.doi.org/10.7202/1001775ar.
Der volle Inhalt der QuelleDiesse, François. „La situation juridique de l’enfant à naître en droit français : entre pile et face“. Question d’actualité en droit de la famille comparé 30, Nr. 4 (08.12.2014): 607–61. http://dx.doi.org/10.7202/1027762ar.
Der volle Inhalt der QuelleFan, Zeng, John Rudlin, Giorgos Asfis und Hongying Meng. „Convolution of Barker and Golay Codes for Low Voltage Ultrasonic Testing“. Technologies 7, Nr. 4 (10.10.2019): 72. http://dx.doi.org/10.3390/technologies7040072.
Der volle Inhalt der QuelleFan, Zeng, Xudong Niu, Baichun Miao und Hongying Meng. „Hybrid Coded Excitation of the Torsional Guided Wave Mode T(0,1) for Oil and Gas Pipeline Inspection“. Applied Sciences 12, Nr. 2 (13.01.2022): 777. http://dx.doi.org/10.3390/app12020777.
Der volle Inhalt der QuelleJasne, Adam S., Pola Chojecka, Ilavarasy Maran, Razaz Mageid, Mohamed Eldokmak, Qiang Zhang, Karin Nystrom et al. „Stroke Code Presentations, Interventions, and Outcomes Before and During the COVID-19 Pandemic“. Stroke 51, Nr. 9 (September 2020): 2664–73. http://dx.doi.org/10.1161/str.0000000000000347.
Der volle Inhalt der QuelleCruel, Louis. „Le code non écrit des jurés populaires“. Tocqueville Review 18, Nr. 2 (Januar 1997): 71–82. http://dx.doi.org/10.3138/ttr.18.2.71.
Der volle Inhalt der QuelleHan, Changcai, Hui Li und Weigang Chen. „Minimum Distance Optimization with Chord Edge Growth for High Girth Non-Binary LDPC Codes“. Electronics 9, Nr. 12 (17.12.2020): 2161. http://dx.doi.org/10.3390/electronics9122161.
Der volle Inhalt der QuelleBardini, Thierry. „Variations sur l’insignifiant génétique : les métaphores du (non-)code“. Hors dossier, Nr. 3 (09.08.2011): 162–86. http://dx.doi.org/10.7202/1005473ar.
Der volle Inhalt der QuelleNindyasari, Ratih. „METODE NON- HEURISTIC UNTUK DETEKSI REFACTORING NON-SOURCE CODE (SYSTEMATIC LITERATURE REVIEW)“. Simetris : Jurnal Teknik Mesin, Elektro dan Ilmu Komputer 6, Nr. 2 (01.11.2015): 361. http://dx.doi.org/10.24176/simet.v6i2.473.
Der volle Inhalt der QuelleSyryjczyk, Jerzy. „Krzywoprzysięstwo w systematyce kanonicznego prawa karnego“. Prawo Kanoniczne 34, Nr. 1-2 (05.06.1991): 121–34. http://dx.doi.org/10.21697/pk.1991.34.1-2.08.
Der volle Inhalt der QuelleDissertationen zum Thema "Code non sûr"
Carpentier, Robin. „Privacy-preserving third-party computations on secure personal data management systems“. Electronic Thesis or Diss., université Paris-Saclay, 2022. http://www.theses.fr/2022UPASG079.
Der volle Inhalt der QuelleThe privacy of individuals is constantly undermined by some of the most prominent companies in the world which centralize vast amounts of personal data. Recent legal means such as the General Data Protection Regulation in Europe regulate the collection and processing of citizens' data. In particular, data portability grants individuals the right to recover a copy of their data held by an organization. At the same time, Personal Data Management Systems (PDMS) are emerging, empowering users by facilitating the management of their data. For example, these solutions enable automatic data collection, sharing, and advanced processing. In these solutions, the user's data is processed directly where it is stored by a processing code potentially written by a third party. Here, only the results are shared with a third party upon the user's decision. This paradigm diverges from the traditional approach in which the user's data is entirely shared with a third party for processing. To be viable, PDMS must satisfy two prerequisites: they must ensure the security of the data in the presence of a layman user while being as extensible as possible to support diverse computations on this data. To address this conflict between extensibility and security, this thesis relies on an architecture including third-party modules coupled with hardware security mechanisms called Trusted Executions Environments. In this context, we propose security building blocks to limit data leakage resulting from the use of these third-party modules as well as execution strategies implementing these building blocks and limiting the impact on performances
Quintin, Guillaume. „Sur l'algorithme de décodage en liste de Guruswami-Sudan sur les anneaux finis“. Phd thesis, Ecole Polytechnique X, 2012. http://pastel.archives-ouvertes.fr/pastel-00759820.
Der volle Inhalt der QuelleShams, Bilal. „Les Codes LDPC non-binaires de nouvelle génération“. Thesis, Cergy-Pontoise, 2010. http://www.theses.fr/2010CERG0525/document.
Der volle Inhalt der QuelleIn this thesis we present our work in the domain of non-binary decoding algorithm for general classes of non-binary LDPC codes. Low-Density Parity-Check (LDPC) codes were originally presented by Gallager in 1963, and after some fundamental theoretical advancements, they were considered in standards like DVB-S2, WI-MAX, DSL, W-LAN etc. Later on, non-binary LDPC (NB-LDPC)codes were proposed in the litterature, and showed better performance for small lengths or when used on non-binary channels. However, the advantages of using NB-LDPC codes comes with the consequence of an heavily increased decoding complexity. For a code defined in GF(q), the complexity is of the order O(q^2). Similarly, the memory required for storing messages is of order O(q). Consequently, the implementation of an LDPC-decoder defined over a field order q > 64 becomes practically impossible.The main objective of the thesis is to develop reduced complexity algorithms for non-binary LDPC codes that exhibit excellent performance and is practically im-plementable. For better decoding performance, not only the decoding algorithm is important, but also the structure of the code plays an important role. With this goal in mind, a new family of codes called cluster-NB-LDPC codes was developped and specific improvements of the NB decoder for cluster-NB-LDPC codes were proposed. Our principal result is that we were able to propose decoders for cluster-NB-LDPC codes with reduced complexity compared to usual decoders for NB-LDPC codes on fields, without any performance loss in error correction capability
Stenger, Jérôme. „Optimal uncertainty quantification of a risk measurement from a computer code“. Thesis, Toulouse 3, 2020. http://www.theses.fr/2020TOU30082.
Der volle Inhalt der QuelleUncertainty quantification in a safety analysis study can be conducted by considering the uncertain inputs of a physical system as a vector of random variables. The most widespread approach consists in running a computer model reproducing the physical phenomenon with different combinations of inputs in accordance with their probability distribution. Then, one can study the related uncertainty on the output or estimate a specific quantity of interest (QoI). Because the computer model is assumed to be a deterministic black-box function, the QoI only depends on the choice of the input probability measure. It is formally represented as a scalar function defined on a measure space. We propose to gain robustness on the quantification of this QoI. Indeed, the probability distributions characterizing the uncertain input may themselves be uncertain. For instance, contradictory expert opinion may make it difficult to select a single probability distribution, and the lack of information in the input variables affects inevitably the choice of the distribution. As the uncertainty on the input distributions propagates to the QoI, an important consequence is that different choices of input distributions will lead to different values of the QoI. The purpose of this thesis is to account for this second level uncertainty. We propose to evaluate the maximum of the QoI over a space of probability measures, in an approach known as optimal uncertainty quantification (OUQ). Therefore, we do not specify a single precise input distribution, but rather a set of admissible probability measures defined through moment constraints. The QoI is then optimized over this measure space. After exposing theoretical results showing that the optimization domain of the QoI can be reduced to the extreme points of the measure space, we present several interesting quantities of interest satisfying the assumption of the problem. This thesis illustrates the methodology in several application cases, one of them being a real nuclear engineering case that study the evolution of the peak cladding temperature of fuel rods in case of an intermediate break loss of coolant accident
Dyshko, Serhii. „Généralisations du Théorème d'Extension de MacWilliams“. Electronic Thesis or Diss., Toulon, 2016. http://www.theses.fr/2016TOUL0018.
Der volle Inhalt der QuelleThe famous MacWilliams Extension Theorem states that for classical codes each linear Hamming isometry ofa linear code extends to a monomial map. However, for linear codes over module alphabets an analogue of theextension theorem does not always exist. That is, there may exists a linear code over a module alphabet with anunextendable Hamming isometry. The same holds in a more general context of a module alphabet equippedwith a general weight function. Analogues of the extension theorem for different classes of codes, alphabetsand weights are proven in the present thesis. For instance, extension properties of the following codes arestudied: short codes over a matrix module alphabet, maximum distance separable codes, codes over a modulealphabet equipped with the symmetrized weight composition. As a separate result, a classification of twoisometry groups of combinatorial codes is given. The thesis also contains applications of the developedtechniques to quantum stabilizer codes and Gabidulin codes
Mokadem, Azza. „Analysis of scattering by urban areas in the frame of NLOS target detection in SAR images“. Thesis, Supélec, 2014. http://www.theses.fr/2014SUPL0004/document.
Der volle Inhalt der QuelleSynthetic Aperture Radar (SAR) systems have been used since many years for military applications such as the detection of hidden targets. With improved resolutions of these systems, high level of details can be distinguished in the corresponding images. However, some difficulties are encountered when analyzing the SAR images of urban areas. In particular, in these areas, many physical phenomena and interactions occur that make the detection of a target a challenging task. In this framework, the goal of the thesis is to investigate the feasibility of detecting Non Line Of Sight targets inside a simple and representative scene: the urban canyon. A study of the electromagnetic (EM) phenomenology of propagation inside urban canyons has been performed using indoor data at a reduced scale. These data allowed the validation of an EM commercial tool that studies the EM propagation at a real scale. Based on the results of simulation of this code, an in-house code was developed dedicated to predict the detection of a target inside an urban canyon and to analyze the corresponding EM signature. Moreover, this code contributed to a full interpretation of InSAR data of a real complex urban scene with targets
Dyshko, Serhii. „Généralisations du Théorème d'Extension de MacWilliams“. Thesis, Toulon, 2016. http://www.theses.fr/2016TOUL0018/document.
Der volle Inhalt der QuelleThe famous MacWilliams Extension Theorem states that for classical codes each linear Hamming isometry ofa linear code extends to a monomial map. However, for linear codes over module alphabets an analogue of theextension theorem does not always exist. That is, there may exists a linear code over a module alphabet with anunextendable Hamming isometry. The same holds in a more general context of a module alphabet equippedwith a general weight function. Analogues of the extension theorem for different classes of codes, alphabetsand weights are proven in the present thesis. For instance, extension properties of the following codes arestudied: short codes over a matrix module alphabet, maximum distance separable codes, codes over a modulealphabet equipped with the symmetrized weight composition. As a separate result, a classification of twoisometry groups of combinatorial codes is given. The thesis also contains applications of the developedtechniques to quantum stabilizer codes and Gabidulin codes
Lorendeau, Benjamin. „Amélioration des performances via un parallélisme multi-niveaux en maillage sur un code de CFD en maillages non structurés“. Thesis, Bordeaux, 2019. http://www.theses.fr/2019BORD0412.
Der volle Inhalt der QuelleThe ever-evolving and ultimately complexification of computer architectures enforce scientific developpers to maintain both their software and technical knowledge in order to pertain their ability to fully exploit recent high performance computing platforms. Moreover the birth of heterogeneous plateforms and the large increase in core number per processor lead developpers of software parallelized through distributed paralleslim to see a small but consistent decrease of performance on recent plateforms. For cs, the transission from a full MPI code to a MPI+OpenMP code is not fully satisfying and cannot adress the scalability issue that alack of load balancing causes. This load balancing issue is a complex problemto solve for a code such as cs where partitionning is a NP problem and mustdata being indexed due to the unstructured nature of the meshes used. To solvethis kind of issue and many others (such as portability and heterogeneity), the use of a task based runtime recently won popularity through three different ways: loop parallelism, sequential submission of task(STF) or parameterized task graph (PTG). This thesis is focused on the transition effort of cs, a computational fluid dynamic (CFD) code with unstructured meshes (sparse linear algebra) from a mostly distributed parallelism to the integration of a task based runtime. In order to do this,we investigated the STF and PTG paradigms through the use of StarPU and PaRSECin cs. We demonstrate their advantages over a solution such that MPI + OpenMP as well ascompare their use in terms of complexity and performance with the existing solutions in cs. This thesis was made through the collaboration between the MFEE department of EDF R&D and the Tadaam research team, grouping Inria Bordeaux Sud-Ouest, the LaBRI,University of Bordeaux 1 and Bordeaux INP
Masiero, Matteo <1998>. „L’utilizzo del crowdfunding come sostegno per le organizzazioni non governative. Il caso delle SAR NGO“. Master's Degree Thesis, Università Ca' Foscari Venezia, 2022. http://hdl.handle.net/10579/21919.
Der volle Inhalt der QuelleZrelli, Yasamine. „Identification aveugle de codes correcteurs d'erreurs basés sur des grands corps de Galois et recherche d'algorithmes de type décision souple pour les codes convolutifs“. Thesis, Brest, 2013. http://www.theses.fr/2013BRES0097/document.
Der volle Inhalt der QuelleIn the first part of this thesis, we have focused on the blind identification of non-binary error correcting codes over the Galois field GF(2m). A study of the properties of Galois fields and non-binarycodes has been presented so as to get the essential elements for a blind identification of non-binary codes parameters. From the knowledge of only the received symbols, methods have been developed to identify the code parameters in the case of a noiseless transmission. The relevance of this approach has been highlighted when the parameters of the used Galois field are known bythe receiver. A theoretical study of rank criterion behaviors has been also presented to justify its use by the most existing identification methods. Then, three blind identification methods of the codeword size for binary and non-binary linear codes have been developped in the framework of a noisy transmission. In order to identify a dual code basis, an existing method for binary codes based on the use of a hard decision demodulation has been generalized to non-binary codes. The detection performance of this technique has been improved when an iterative process based on the joint use of a soft-decision demodulator and a soft-decision iterative decoding is introduced. In the second part of this thesis manuscript, a mathematical formalism is proposed in order to investigate the impact of mapping-demapping functions on linear algebra computations and properties over Galois field in the case of non-binary error correcting codes. Finally, this formalism has been exploited to detect or/and correct some digital transmission problems such as a bad synchronization. Finally, we have studied the impact of some mapping-demapping functions on the blind identification ofnon-binary error correcting codes parameters
Bücher zum Thema "Code non sûr"
Canada, Canada Environnement, und Canada. Prévention de la pollution. Secteur des ressources naturelles. Métaux., Hrsg. Code de pratiques écologiques: Loi canadienne sur la protection de l'environnement (1999) : fonderies et affineries de métaux communs. Ottawa, Ont: Environnement Canada, 2006.
Den vollen Inhalt der Quelle findenHistory Buech Reimenweisz: Geschichte, Bildprogramm und Illuminatoren des Willehalm-Codex König Wenzels IV. von Böhmen, Wien, Österreichische Nationalbibliothek Ser. Nov. 2643. Wien: Verlag der Österreichische Akademie der Wissenschaften, 2010.
Den vollen Inhalt der Quelle findenCanada. Human Resources Development Canada. Directory of Holland codes for the NOC career handbook =: Répertoire des codes Holland pour le Guide sur les carrières de la CNP. Ottawa, Ont: Human Resources Development Canada = Développement des ressources humaines Canada, 1997.
Den vollen Inhalt der Quelle findenHartmann, Philippe. Centrales nucléaires et environnement - Prélèvements d'eau et rejets. EDP Sciences, 2014. http://dx.doi.org/10.1051/978-2-7598-0913-4.
Der volle Inhalt der QuelleAlmendra Garcia Pereira, Emerson. Awaken. Brazil Publishing, 2022. http://dx.doi.org/10.31012/978-65-5861-905-5.
Der volle Inhalt der QuellePaiva, Paulo. Um presente para você: Felicidade - empodere-se | sinta-se | mergulhe. Brazil Publishing, 2020. http://dx.doi.org/10.31012/978-65-5861-099-1.
Der volle Inhalt der QuellePfeiffer, Douglas S. Authorial Personality and the Making of Renaissance Texts. Oxford University Press, 2022. http://dx.doi.org/10.1093/oso/9780198714163.001.0001.
Der volle Inhalt der QuelleJohnsen, Bredo. Righting Epistemology. Oxford University Press, 2017. http://dx.doi.org/10.1093/acprof:oso/9780190662776.001.0001.
Der volle Inhalt der QuelleMBASSI ATÉBA, Raymond, und Gérard-Marie MESSINA, Hrsg. Sous le signe du signe ou l’art d’être sémioticien. Editions des archives contemporaines, 2022. http://dx.doi.org/10.17184/eac.9782813004222.
Der volle Inhalt der QuelleBaracchini, Leïla. Entre désert et toile. Création d’un art san contemporain au Kalahari. Éditions Alphil-Presses universitaires suisses, 2021. http://dx.doi.org/10.33055/alphil.03150.
Der volle Inhalt der QuelleBuchteile zum Thema "Code non sûr"
Chan, Monica. „What We Know, We Don’t Know About Macao’s Arbitration Framework and the Way Forward“. In Cofola International 2021, 482–505. Brno: Masaryk University Press, 2021. http://dx.doi.org/10.5817/cz.muni.p210-8639-2021-19.
Der volle Inhalt der QuelleBromberger, Martin, Irina Dragoste, Rasha Faqeh, Christof Fetzer, Larry González, Markus Krötzsch, Maximilian Marx, Harish K. Murali und Christoph Weidenbach. „A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic“. In Tools and Algorithms for the Construction and Analysis of Systems, 480–501. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-99524-9_27.
Der volle Inhalt der QuelleGarnett, George. „The Excavation, Reconstruction, and Fabrication of Old English Law in the Twelfth Century“. In The Norman Conquest in English History, 104–31. Oxford University Press, 2020. http://dx.doi.org/10.1093/oso/9780198726166.003.0004.
Der volle Inhalt der Quelle„Détermination des codes de produits à attribuer“. In Lignes directrices pour la collecte de données sur les mesures non tarifaires officielles: Édition de 2023, 33–39. United Nations, 2024. http://dx.doi.org/10.18356/9789213586396c007.
Der volle Inhalt der QuelleOsawa, Syozo. „The structure of the ‘universal’ genetic code“. In Evolution of the Genetic Code, 14–35. Oxford University PressOxford, 1995. http://dx.doi.org/10.1093/oso/9780198547815.003.0002.
Der volle Inhalt der QuelleBellamy, Edward. „Chapter XXVIII“. In Looking Backward 2000-1887. Oxford University Press, 2009. http://dx.doi.org/10.1093/owc/9780199552573.003.00029.
Der volle Inhalt der QuelleThiam, Khadimou Rassoul. „De la rue à la scène politique : analyse des logiques discursives et pragmatiques du code switching dans un débat politique au Sénégal“. In Les parlers urbains africains au prisme du plurilinguisme : description sociolinguistique, 93–110. Observatoire européen du plurilinguisme, 2020. http://dx.doi.org/10.3917/oep.kosso.2020.01.0093.
Der volle Inhalt der QuelleBurnaby, Frederick. „chapter X“. In On Horseback Through Asia Minor, 64–68. Oxford University PressNew York, NY, 1996. http://dx.doi.org/10.1093/oso/9780192825001.003.0011.
Der volle Inhalt der QuelleTurner, Henry S. „Sir Philip Sidney and the Practical Imagination“. In The English Renaissance Stage, 82–113. Oxford University PressOxford, 2006. http://dx.doi.org/10.1093/oso/9780199287383.003.0003.
Der volle Inhalt der QuelleCollins, William Wilkie. „The Story continued by Mrs Catherick“. In The Woman in White. Oxford University Press, 2008. http://dx.doi.org/10.1093/owc/9780199535637.003.0010.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "Code non sûr"
Demoss, Dennis, Stefan J. Janusz und Richard P. Niemer. „ASME Codes and Small Modular Reactors“. In ASME 2014 Small Modular Reactors Symposium. American Society of Mechanical Engineers, 2014. http://dx.doi.org/10.1115/smr2014-3345.
Der volle Inhalt der QuelleSidarta, Djoni E., Tuhin Rakshit und Vivek Jaiswal. „SCR VIV Analysis Using Time Domain Code SimVIV“. In ASME 2012 31st International Conference on Ocean, Offshore and Arctic Engineering. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/omae2012-83695.
Der volle Inhalt der QuelleHumphries, Larry, Brad Beeny, David Louie, Hossein Esmaili und Michael Salay. „Non-LWR Model Development for the MELCOR Code“. In 2018 26th International Conference on Nuclear Engineering. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/icone26-82415.
Der volle Inhalt der QuelleAbbasi, Fariba, Hessam Mahdavifar und Emanuele Viterbo. „Hybrid Non-Binary Repeated Polar Codes For Low-SNR Regime“. In 2021 IEEE International Symposium on Information Theory (ISIT). IEEE, 2021. http://dx.doi.org/10.1109/isit45174.2021.9518274.
Der volle Inhalt der QuelleTrivedi, A. K., D. R. Novog und C. Allison. „Implementation of Solar Salt as Fluid in ASYST4.1 and Validation for a Natural Circulation Loop“. In 2021 28th International Conference on Nuclear Engineering. American Society of Mechanical Engineers, 2021. http://dx.doi.org/10.1115/icone28-64703.
Der volle Inhalt der QuelleSong, Jian, Limin Liu, Simiao Tang, Yingwei Wu, Wenxi Tian, Suizheng Qiu und Guanghui Su. „Implementation of Liquid Metal Properties in RELAP5 MOD3.2 for Safety Analysis of Sodium-Cooled Fast Reactors“. In 2017 25th International Conference on Nuclear Engineering. American Society of Mechanical Engineers, 2017. http://dx.doi.org/10.1115/icone25-66009.
Der volle Inhalt der QuelleDutt, B. J., J. J. Kroutch, K. N. Hooghan, R. J. Jenkins und M. J. Toth. „Integrated Circuit SNR Improvement Using Dielectric Altering Compound, Laser Trim and FIB System“. In ISTFA 2000. ASM International, 2000. http://dx.doi.org/10.31399/asm.cp.istfa2000p0323.
Der volle Inhalt der QuelleNava Rivera, Milka Hebi, Daisuke Ito, Yasushi Saito, Mitsuhiro Aoyagi, Kenji Kamiyama und Tohru Suzuki. „Measurements of Two-Phase Pressure Drop in a Simulated Debris Bed“. In 2017 25th International Conference on Nuclear Engineering. American Society of Mechanical Engineers, 2017. http://dx.doi.org/10.1115/icone25-67927.
Der volle Inhalt der QuelleYada, Hiroki, Shigeru Takaya, Kyoichi Morohoshi und Shinobu Yokoi. „Proposal of Detailed Procedures of Determining Rational In-Service Inspection Requirements Based on System Based Code Concept“. In 2022 29th International Conference on Nuclear Engineering. American Society of Mechanical Engineers, 2022. http://dx.doi.org/10.1115/icone29-90542.
Der volle Inhalt der QuelleKikuchi, Norihiro, Yasutomo Imai, Ryuji Yoshikawa, Norihiro Doda und Masaaki Tanaka. „Investigation of Applicability of Subchannel Analysis Code ASFRE on Thermal Hydraulics Analysis in Fuel Assembly With Inner Duct Structure in Sodium Cooled Fast Reactor“. In 2021 28th International Conference on Nuclear Engineering. American Society of Mechanical Engineers, 2021. http://dx.doi.org/10.1115/icone28-65662.
Der volle Inhalt der QuelleBerichte der Organisationen zum Thema "Code non sûr"
Hoard, R. W., und S. Hunter. Design of a five-axis flux-gate magnetic-gradiometer system Tracking Code No. 93-SR-035. Office of Scientific and Technical Information (OSTI), März 1995. http://dx.doi.org/10.2172/87820.
Der volle Inhalt der QuelleKaboré, Gisele, Rene Dala und AristideR Bado. Etude quantitative sur le mariage précoce et le vécu des adolescentes dans la zone d'intervention du projet: Etat des lieux et perspectives. Population Council, 2009. http://dx.doi.org/10.31899/pgy20.1003.
Der volle Inhalt der QuelleCunha e Melo, Mariana, und Jonas de Abreu Castro. Contribuições Fórum Pix: Gestor de Pagamentos. Center for Technology and Public Interest, SL, Oktober 2023. http://dx.doi.org/10.59262/wf2jbb.
Der volle Inhalt der QuellePforr, Tobias, Fabian Pape und Steffen Murau. After the Allocation: What Role for the Special Drawing Rights System? Institute for New Economic Thinking Working Paper Series, März 2022. http://dx.doi.org/10.36687/inetwp180.
Der volle Inhalt der QuellePaynter, Robin A., Celia Fiordalisi, Elizabeth Stoeger, Eileen Erinoff, Robin Featherstone, Christiane Voisin und Gaelen P. Adam. A Prospective Comparison of Evidence Synthesis Search Strategies Developed With and Without Text-Mining Tools. Agency for Healthcare Research and Quality (AHRQ), März 2021. http://dx.doi.org/10.23970/ahrqepcmethodsprospectivecomparison.
Der volle Inhalt der QuelleAltstein, Miriam, und Ronald J. Nachman. Rational Design of Insect Control Agent Prototypes Based on Pyrokinin/PBAN Neuropeptide Antagonists. United States Department of Agriculture, August 2013. http://dx.doi.org/10.32747/2013.7593398.bard.
Der volle Inhalt der QuelleMacFarlane, Andrew. 2021 medical student essay prize winner - A case of grief. Society for Academic Primary Care, Juli 2021. http://dx.doi.org/10.37361/medstudessay.2021.1.1.
Der volle Inhalt der Quelle