Bibliografie tematiche / Coding theory

Letteratura scientifica selezionata sul tema "Coding theory"

Autore: Grafiati
Pubblicato: 4 giugno 2021
Ultima modifica: 7 luglio 2024

Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili

Scegli il tipo di fonte:

Indice

Consulta la lista di attuali articoli, libri, tesi, atti di convegni e altre fonti scientifiche attinenti al tema "Coding theory".

Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.

Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.

Articoli di riviste sul tema "Coding theory"

1

Stine, Robert A. "Coding theory". Wiley Interdisciplinary Reviews: Computational Statistics 1, n. 3 (novembre 2009): 261–70. http://dx.doi.org/10.1002/wics.42.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
2

Greferath, Marcus, Camilla Hollanti e Joachim Rosenthal. "Contemporary Coding Theory". Oberwolfach Reports 16, n. 1 (26 febbraio 2020): 773–840. http://dx.doi.org/10.4171/owr/2019/13.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
3

van Lint, J. H. "Coding theory introduction". IEEE Transactions on Information Theory 34, n. 5 (settembre 1988): 1274–75. http://dx.doi.org/10.1109/tit.1988.8862503.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
4

SAKATA, Shojiro. "Algebraic Coding Theory". IEICE ESS Fundamentals Review 1, n. 3 (2008): 3_44–3_57. http://dx.doi.org/10.1587/essfr.1.3_44.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
5

Ohashi, Masayoshi, e Toshio Mizuno. "Introduction to Coding Theory(15); Application of Coding Theory Satellite Communication." Journal of the Institute of Television Engineers of Japan 45, n. 10 (1991): 1291–96. http://dx.doi.org/10.3169/itej1978.45.1291.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
6

Baylis, John, D. G. Hoffman, D. A. Leonard, C. C. Lindner, K. T. Phelps, C. A. Rodger e J. R. Wall. "Coding Theory: The Essentials". Mathematical Gazette 77, n. 480 (novembre 1993): 381. http://dx.doi.org/10.2307/3619794.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
7

Anderson, Ian, e J. H. van Lint. "Introduction to Coding Theory". Mathematical Gazette 77, n. 480 (novembre 1993): 383. http://dx.doi.org/10.2307/3619795.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
8

Baylis, John, Gareth A. Jones e J. Mary Jones. "Information and Coding Theory". Mathematical Gazette 85, n. 503 (luglio 2001): 377. http://dx.doi.org/10.2307/3622076.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
9

Dawy, Zaher, Pavol Hanus, Johanna Weindl, Janis Dingel e Faruck Morcos. "On genomic coding theory". European Transactions on Telecommunications 18, n. 8 (2007): 873–79. http://dx.doi.org/10.1002/ett.1201.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
10

Saito, Minoru. "Introduction to Coding Theory: (14) Application of Coding Theory to Computer Technology." Journal of the Institute of Television Engineers of Japan 45, n. 9 (1991): 1089–94. http://dx.doi.org/10.3169/itej1978.45.1089.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
Più fonti

Tesi sul tema "Coding theory"

1

Мельник, Ю. "Coding theory". Thesis, Видавництво СумДУ, 2006. http://essuir.sumdu.edu.ua/handle/123456789/21790.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
2

Золотова, Світлана Григорівна, Светлана Григорьевна Золотова, Svitlana Hryhorivna Zolotova e V. V. Petrov. "The history of coding theory". Thesis, Видавництво СумДУ, 2008. http://essuir.sumdu.edu.ua/handle/123456789/16065.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
3

Ryzhikov, Andrew. "Synchronizing automata and coding theory". Thesis, Paris Est, 2020. http://www.theses.fr/2020PESC2030.

Testo completo
Abstract (sommario):
Cette thèse est consacrée a l’étude des mots synchronisant pour les automates finis et les codes. Intuitivement, un mot synchronisant est tel que son application amène le système dans un état indépendant de l'état initial. Un code ou un automate est synchronisant s’il admet un mot synchronisant. Il existe une forte relation entre l’utilisation de cette notion pour les automates ou les codes et son usage est l’un des leitmotifs de cette thèse.Un des principaux outils pour traiter les codes est l’usage d’un automate particulier préservant ses propriétés de synchronisation. Pour les codes préfixes, ceci est obtenu en utilisant un automate déterministe.Nous avons exploré deux problèmes principaux concernant la synchronisation. Le premier consiste à mesurer la longueur du plus court mot synchronisant pour un automate ou un code. Dans le cas d’un automate fini complet et déterministe, un des problèmes les plus anciens de la théorie combinatoire des automates propose une borne quadratique en termes du nombre d'états de l’automate. Nous étendons cette conjecture aux automates partiels non-déterministes. Nous établissons des bornes polynomiales pour ces classes en présence de la forte connexité, et nous discutons leur lien avec la conjecture originale de Černý.La relation avec les codes finis nous permet de prouver l’existence de bornes similaires en termes de la somme des longueurs des mots du code, et aussi de la longueur du plus long mot. Le deuxième cas est lié à une autre importante conjecture, proposée par Restivo. Elle concerne les mots mortels plutôt que synchronisant. Dans la plupart de ces cas, nous examinons aussi la complexité de calcul d’un mot synchronisant court, un deuxième aspect fondamental de cette thèse. Au-delà, nous étudions plusieurs généralisations de la notion de mot synchronisant, qui permettent d’utiliser une information partielle sur sur l’état dans lequel se trouve l’automate. Pour plusieurs de ces généralisations, nous prouvons des bornes inférieures de complexité, même dans ce cas très particuliers
This thesis is devoted to studying synchronizing words for finite automata and variable-length codes. Intuitively, a synchronizing word is a word such that its application brings a system into some particular state regardless of its initial state. A code or automaton is synchronizing if it admits a synchronizing word. There is a deep connection between the concrete implementations of this notion for finite automata and variable-length codes, and the use of it is one of the leitmotifs of this thesis.One of the main tools for dealing with variable-length codes is assigning a special automaton preserving many synchronization properties to it. For finite codes, this is done using prefix automata.We investigate two fundamental problems about synchronization. The first one is measuring the length of shortest synchronizing words for synchronizing automata and codes. For the case of complete deterministic finite automata, the Černý conjecture, one of the oldest problems in combinatorial automata theory, proposes a quadratic upper bound in terms of the number of states in the automaton. We broaden this conjecture to partial deterministic finite automata and then to unambiguous non-deterministic finite automata. We show polynomial upper bounds for mentioned classes in the presence of strong connectivity, and discuss their connections with the original Černý conjecture.The relation with finite codes allows us to show similar bounds in terms of the sum of the lengths of the codewords, as well as in terms of the length of the longest codeword. The second case is related to another important conjecture stated by Restivo. It deals with mortal words instead of synchronizing ones, the case which we also investigate. For most of these settings we also examine the computational complexity of finding short synchronizing words, which is the second fundamental question investigated in this thesis. Besides that, we study various generalization of the notion of a synchronizing word, which allow to use some partial information about the current state of an automaton. For several such generalizations we show strong computational complexity lower bounds even in very restricted cases
Gli stili APA, Harvard, Vancouver, ISO e altri
4

Redwood-Sawyerr, J. A. S. "Constant envelope modulation coding". Thesis, University of Essex, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.356049.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
5

Cohen, D. A. "A problem in algebraic coding theory". Thesis, University of Oxford, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.380002.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
6

Arslan, Ogul. "Some algebraic problems from coding theory". [Gainesville, Fla.] : University of Florida, 2009. http://purl.fcla.edu/fcla/etd/UFE0024938.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
7

Chaiyaboonthanit, Thanit. "Image coding using wavelet transform and adaptive block truncation coding /". Online version of thesis, 1991. http://hdl.handle.net/1850/10913.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
8

Delopoulos, Athanasios. "Coding techniques for moving images". Thesis, Imperial College London, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.338648.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
9

Kaouri, Hussein Ali. "Speech coding using vector quantisation". Thesis, Queen's University Belfast, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.356934.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
10

Adistambha, Kevin. "Embedded lossless audio coding using linear prediction and cascade coding". Access electronically, 2005. http://www.library.uow.edu.au/adt-NWU/public/adt-NWU20060724.122433/index.html.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
Più fonti

Libri sul tema "Coding theory"

1

Gray, Robert M. Source Coding Theory. Boston, MA: Springer US, 1989. http://dx.doi.org/10.1007/978-1-4613-1643-5.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
2

Richardson, Thomas J. Modern coding theory. New York, NY: Cambridge University Press, 2008.

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
3

M, Gray Robert. Source Coding Theory. Boston, MA: Springer US, 1989.

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
4

M, Gray Robert. Source coding theory. Boston: Kluwer Academic Publishers, 1990.

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
5

1962-, Yeung Raymond W., a cura di. Network coding theory. Boston, MA: Now, 2006.

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
6

Ray-Chaudhuri, Dijen, a cura di. Coding Theory and Design Theory. New York, NY: Springer New York, 1990. http://dx.doi.org/10.1007/978-1-4615-6654-0.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
7

Ray-Chaudhuri, Dijen. Coding Theory and Design Theory. New York, NY: Springer New York, 1990. http://dx.doi.org/10.1007/978-1-4613-8994-1.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
8

Hiramatsu, Toyokazu, e Günter Köhler. Coding Theory and Number Theory. Dordrecht: Springer Netherlands, 2003. http://dx.doi.org/10.1007/978-94-017-0305-5.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
9

Hiramatsu, Toyokazu. Coding Theory and Number Theory. Dordrecht: Springer Netherlands, 2003.

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
10

1933-, Ray-Chaudhuri Dijen, a cura di. Coding theory and design theory. New York: Springer-Verlag, 1990.

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
Più fonti

Capitoli di libri sul tema "Coding theory"

1

Lidl, Rudolf, e Günter Pilz. "Coding Theory". In Undergraduate Texts in Mathematics, 183–238. New York, NY: Springer New York, 1998. http://dx.doi.org/10.1007/978-1-4757-2941-2_4.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
2

Brophy, Tim. "Coding Theory". In Real-World Problems for Secondary School Mathematics Students, 67–85. Rotterdam: SensePublishers, 2011. http://dx.doi.org/10.1007/978-94-6091-543-7_3.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
3

O’Regan, Gerard. "Coding Theory". In Mathematics in Computing, 155–69. London: Springer London, 2012. http://dx.doi.org/10.1007/978-1-4471-4534-9_9.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
4

Niederreiter, Harald, e Arne Winterhof. "Coding Theory". In Applied Number Theory, 99–183. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-22321-6_3.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
5

Cohn, P. M. "Coding Theory". In Further Algebra and Applications, 371–93. London: Springer London, 2003. http://dx.doi.org/10.1007/978-1-4471-0039-3_10.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
6

O’Regan, Gerard. "Coding Theory". In Undergraduate Topics in Computer Science, 171–83. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-34209-8_11.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
7

O’Regan, Gerard. "Coding Theory". In Texts in Computer Science, 177–89. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81588-2_11.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
8

O’Regan, Gerard. "Coding Theory". In Texts in Computer Science, 331–43. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-26212-8_21.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
9

Rojek, Chris. "Coding and Representation". In Leisure Theory, 110–24. London: Palgrave Macmillan UK, 2005. http://dx.doi.org/10.1057/9780230505117_5.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
10

O’Regan, Gerard. "Coding TheoryCoding Theory". In Texts in Computer Science, 171–83. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-44561-8_11.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri

Atti di convegni sul tema "Coding theory"

1

Lim, Sung Hoon, Young-Han Kim, Abbas El Gamal e Sae-Young Chung. "Noisy network coding". In 2010 IEEE Information Theory Workshop on Information Theory (ITW). IEEE, 2010. http://dx.doi.org/10.1109/itwksps.2010.5503216.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
2

Solov’eva, Faina I. "Coding theory and cryptology". In PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON CONSTRUCTION AND BUILDING ENGINEERING (ICONBUILD) 2017: Smart Construction Towards Global Challenges. Author(s), 2017. http://dx.doi.org/10.1063/1.5012616.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
3

Heidarzadeh, Anoosheh, e Amir H. Banihashemi. "Overlapped Chunked network coding". In 2010 IEEE Information Theory Workshop on Information Theory (ITW). IEEE, 2010. http://dx.doi.org/10.1109/itwksps.2010.5503153.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
4

Liu, Yucheng, Parastoo Sadeghi e Young-Han Kim. "Three-Layer Composite Coding for Index Coding". In 2018 IEEE Information Theory Workshop (ITW). IEEE, 2018. http://dx.doi.org/10.1109/itw.2018.8613351.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
5

Arbabjolfaei, Fatemeh, Bernd Bandemer e Young-Han Kim. "Index coding via random coding". In 2014 Iran Workshop on Communication and Information Theory (IWCIT). IEEE, 2014. http://dx.doi.org/10.1109/iwcit.2014.6842484.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
6

Liu, Yucheng, Parastoo Sadeghi, Fatemeh Arbabjolfaei e Young-Han Kim. "Simplified Composite Coding for Index Coding". In 2018 IEEE International Symposium on Information Theory (ISIT). IEEE, 2018. http://dx.doi.org/10.1109/isit.2018.8437663.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
7

Yao, Hongyi, e Raymond W. Yeung. "Zero-error multichannel source coding". In 2010 IEEE Information Theory Workshop on Information Theory (ITW). IEEE, 2010. http://dx.doi.org/10.1109/itwksps.2010.5503211.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
8

Keshavarz-Haddad, A., e M. A. Khojastepour. "Rotate-and-add coding: A novel algebraic network coding scheme". In 2010 IEEE Information Theory Workshop. IEEE, 2010. http://dx.doi.org/10.1109/cig.2010.5592671.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
9

Huang, Shurui, Aditya Ramamoorthy e Muriel Medard. "Minimum cost content distribution using network coding: Replication vs. coding at the source nodes". In 2010 IEEE Information Theory Workshop on Information Theory (ITW). IEEE, 2010. http://dx.doi.org/10.1109/itwksps.2010.5503149.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
10

Sudan, Madhu. "Algebraic algorithms and coding theory". In the twenty-first international symposium. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1390768.1390816.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri

Rapporti di organizzazioni sul tema "Coding theory"

1

Moran, William. Coding Theory Information Theory and Radar. Fort Belvoir, VA: Defense Technical Information Center, settembre 2005. http://dx.doi.org/10.21236/ada456510.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
2

Calderbank, Arthur R. Coding Theory Information Theory and Radar. Fort Belvoir, VA: Defense Technical Information Center, gennaio 2005. http://dx.doi.org/10.21236/ada434253.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
3

Xia, Xiang-Gen. Space-Time Coding Using Algebraic Number Theory for Broadband Wireless Communications. Fort Belvoir, VA: Defense Technical Information Center, maggio 2008. http://dx.doi.org/10.21236/ada483791.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
4

Smith, David I. Highly Conserved, Large, Non-Coding Transcripts and Their Role in the Development of Breast Cancer. Fort Belvoir, VA: Defense Technical Information Center, agosto 2008. http://dx.doi.org/10.21236/ada493371.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
5

Audsley, Neil, Gonzalo Avila, Claudio Ioratti, Valerie Caron, Chiara Ferracini, Tibor Bukovinszki, Marc Kenis et al. False Codling Moth, Thaumatotibia leucotreta (Meyrick). Euphresco, 2023. http://dx.doi.org/10.1079/20240228687.

Testo completo
Abstract (sommario):
The false codling moth (Thaumatotibia leucotreta) is a major polyphagous pest native to sub-Saharan Africa, affecting over 50 crop species, including citrus, stone fruits, nuts, arable crops, grapevines and vegetables. Larval feeding causes significant damage to fruits, leading to premature ripening and yield losses. The pest, present year-round due to its lack of diapause, is found in African countries and Israel and can spread through trade. Strict phytosanitary measures are required to prevent its spread, impacting trade markets. There are no classical biological control programs for this pest. Promising biological control agents include the egg parasitoid Trichogrammatoidea cryptophlebiae and the larval parasitoid Agathis bishop, both native to southern Africa. Additionally, the entomopathogenic virus Cryptophlebia leucotreta granulovirus (CrleGV) has been used against it in citrus.
Gli stili APA, Harvard, Vancouver, ISO e altri
6

Prasad, Jayanti. Large Language Models: AI Foundations and Applications in Python. Instats Inc., 2023. http://dx.doi.org/10.61700/85rfezw01y0q9521.

Testo completo
Abstract (sommario):
This 5-day workshop provides a comprehensive understanding of large language models, their AI foundations, and applications in Python. Designed for PhD students, professors, and professional researchers, the seminar offers hands-on coding sessions, case studies, and discussions on the future of large language models in academic research.
Gli stili APA, Harvard, Vancouver, ISO e altri
7

Harman, Gary E., e Ilan Chet. Discovery and Use of Genes and Gene Combinations Coding for Proteins Useful in Biological Control. United States Department of Agriculture, settembre 1994. http://dx.doi.org/10.32747/1994.7568787.bard.

Testo completo
Abstract (sommario):
The objectives of the research in this proposal were to (A) identify synergy among proteins that provide enhanced activity over single proteins for control of plant pathogenic fungi, (B) clone and characterize genetic sequences coding for proteins with ability to control pathogenic fungi, (C) produce transgenic organisms with enhanced biocontrol ability using genes and gene combinations and determine their efficiency in protecting plants against plant pathogenic fungi. A related objective was to produce disease-resistant plants. Fungal cell wall degrading enzymes from any source are strongly synergistic with any membrane active compound and, further, different classes of cell wall degrading enzymes are also strongly synergistic. We have cloned and sequenced a number of genes from bacterial and fungal sources including five that are structurally unrelated. We have prepared transgenic fungi that are deficient in production of enzymes and useful in mechanistic studies. Others are hyperproducers of specific enzymes that permit us, for the first time, to produce enzymes from T. harzianum in sufficient quantity to conduct tests of their potential use in commercial agriculture. Finally, genes from these studies have been inserted into several species of crop plants were they produce a high level of resistance to several plant pathogenic fungi.
Gli stili APA, Harvard, Vancouver, ISO e altri
8

Steffens, John, Eithan Harel e Alfred Mayer. Coding, Expression, Targeting, Import and Processing of Distinct Polyphenoloxidases in Tissues of Higher Plants. United States Department of Agriculture, novembre 1994. http://dx.doi.org/10.32747/1994.7613008.bard.

Testo completo
Abstract (sommario):
Polyphenol oxidase (PPO) catalyzes the oxidation of phenols to quinones at the expense of O2. PPOs are ubiquitous in higer plants, and their role in oxidative browning of plant tissues causes large annual losses to food production. Despite the importance of PPOs to agriculture, the function(s) of PPOs in higher plants are not understood. Among other roles, PPOs have been proposed to participate in aspects of chloroplast metabolism, based on their occurrence in plastids and high Km for O2. Due to the ability of PPO to catalyze formation of highly reactive quinones, PPOs have also been proposed to be involved in a wide array of defensive interactions with insect, bacterial, and fungal pests. Physiological and biochemical studies of PPO have provided few answers to the major problems of PPO function, subcellular localization, and biochemical properties. This proposal achieved the following major objectives: cloning of PPO cDNAs in potato and tomato; characterization of the tomato PPO gene family; antisense downregulation of the tomato PPO gene family; and reduction in post-harvest enzymic browning of potato through expression of antisense PPO genes under the control of tuber-specific promoters. In addition, we established the lumenal localization of PPO, characterized and clarified the means by which PPOs are imported and processed by chloroplasts, and provided insight into the factors which control localization of PPOs. This proposal has thereby provided fundamental advances in the understanding of this enzyme and the control of its expression.
Gli stili APA, Harvard, Vancouver, ISO e altri
9

van der Mensbrugghe, Dominique. A Summary Guide to the Latin Hypercube Sampling (LHS) Utility. GTAP Working Paper, maggio 2023. http://dx.doi.org/10.21642/gtap.wp94.

Testo completo
Abstract (sommario):
Latin Hypercube Sampling (LHS) is one method of Monte Carlo-type sampling, which is useful for limiting sample size yet maximizing the range of sampling of the underlying distributions. The LHS utility, for which this document describes the usage, also allows for user-specified correlations between two or more of the sampled distributions. The LHS utility described herein is a full re-coding using C/C++ of the original LHS utility—developed at Sandia National Labs (Swiler and Wyss (2004)), written in FORTRAN and freely available. The re-coding hones close to the original FORTRAN code, but allows for significantly more flexibility. For example, dynamic memory allocation is used for all internal variables and hence there are no pre-determined dimensions. The new utility has additional features compared to the original FORTRAN code: (1) it includes 10 new statistical distributions; (2) it has four additional output formats; and (3) it has an alternative random number generator. This guide provides a summary of the full features of the LHS utility. For a complete reference, with the exception of the new features, as well as a description of the intuition behind the LHS algorithm users are referred to Swiler and Wyss (2004)
Gli stili APA, Harvard, Vancouver, ISO e altri
10

Silver, Christina. Harnessing Dedoose for Qualitative and Mixed-Methods Analysis. Instats Inc., 2023. http://dx.doi.org/10.61700/ub9kx30m0ga6o469.

Testo completo
Abstract (sommario):
This seminar, 'Harnessing Dedoose for Qualitative and Mixed-Methods Data Analysis', is a one-day workshop aimed at equipping researchers with the skills to effectively use Dedoose in their research. Led by Christina Silver, an expert in the field, the workshop covers a range of topics including preparing and importing data, coding strategies, data visualization, and troubleshooting common issues in Dedoose. The seminar, which will be taught via Zoom, is a valuable opportunity for researchers to enhance their qualitative and mixed-methods data analysis skills, with all materials available online for 30 days after the seminar begins. An official Instats certificate of completion and 1 ECTS Equivalent point is provided at the conclusion of the seminar.
Gli stili APA, Harvard, Vancouver, ISO e altri
Ti possono interessare anche gli elenchi estesi di opere sul tema "Coding theory":
Articoli di riviste Tesi Libri
Offriamo sconti su tutti i piani premium per gli autori le cui opere sono incluse in raccolte letterarie tematiche. Contattaci per ottenere un codice promozionale unico!

Vai alla bibliografia