Relevant bibliographies by topics / Indices de De Bruijn

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Indices de De Bruijn'

Author: Grafiati
Published: 4 June 2021
Last updated: 18 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Indices de De Bruijn.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Indices de De Bruijn"

1

Bonelli, Eduardo, Delia Kesner, and Alejandro Rios. "de Bruijn Indices for Metaterms." Journal of Logic and Computation 15, no. 6 (December 1, 2005): 855–99. http://dx.doi.org/10.1093/logcom/exi051.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kamareddine, F. "Pure Type Systems with de Bruijn Indices." Computer Journal 45, no. 2 (February 1, 2002): 187–201. http://dx.doi.org/10.1093/comjnl/45.2.187.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

KAMAREDDINE, FAIROUZ. "THE SOUNDNESS OF EXPLICIT SUBSTITUTION WITH NAMELESS VARIABLES." International Journal of Foundations of Computer Science 09, no. 03 (September 1998): 321–49. http://dx.doi.org/10.1142/s0129054198000210.

Full text
Abstract:
We show the soundness of a λ-calculus ℬ where de Bruijn indices are used, substitution is explicit, and reduction is step-wise. This is done by interpreting ℬ in the classical calculus where the explicit substitution becomes implicit and de Bruijn indices become named variables. This is the first flat semantics of explicit substitution and step-wise reduction and the first clear account of exactly when α-reduction is needed.
APA, Harvard, Vancouver, ISO, and other styles
4

DI COSMO, ROBERTO, DELIA KESNER, and EMMANUEL POLONOVSKI. "Proof nets and explicit substitutions." Mathematical Structures in Computer Science 13, no. 3 (May 20, 2003): 409–50. http://dx.doi.org/10.1017/s0960129502003791.

Full text
Abstract:
We refine the simulation technique introduced in Di Cosmo and Kesner (1997) to show strong normalisation of $\l$-calculi with explicit substitutions via termination of cut elimination in proof nets (Girard 1987). We first propose a notion of equivalence relation for proof nets that extends the one in Di Cosmo and Guerrini (1999), and show that cut elimination modulo this equivalence relation is terminating. We then show strong normalisation of the typed version of the $\ll$-calculus with de Bruijn indices (a calculus with full composition defined in David and Guillaume (1999)) using a translation from typed $\ll$ to proof nets. Finally, we propose a version of typed $\ll$ with named variables, which helps to give a better understanding of the complex mechanism of the explicit weakening notation introduced in the $\ll$-calculus with de Bruijn indices (David and Guillaume 1999).
APA, Harvard, Vancouver, ISO, and other styles
5

POUILLARD, NICOLAS, and FRANÇOIS POTTIER. "A unified treatment of syntax with binders." Journal of Functional Programming 22, no. 4-5 (August 15, 2012): 614–704. http://dx.doi.org/10.1017/s0956796812000251.

Full text
Abstract:
AbstractAtoms and de Bruijn indices are two well-known representation techniques for data structures that involve names and binders. However, using either technique, it is all too easy to make a programming error that causes one name to be used where another was intended. We propose an abstract interface to names and binders that rules out many of these errors. This interface is implemented as a library in Agda. It allows defining and manipulating term representations in nominal style and in de Bruijn style. The programmer is not forced to choose between these styles: on the contrary, the library allows using both styles in the same program, if desired. Whereas indexing the types of names and terms with a natural number is a well-known technique to better control the use of de Bruijn indices, we index types with worlds. Worlds are at the same time more precise and more abstract than natural numbers. Via logical relations and parametricity, we are able to demonstrate in what sense our library is safe, and to obtain theorems for free about world-polymorphic functions. For instance, we prove that a world-polymorphic term transformation function must commute with any renaming of the free variables. The proof is entirely carried out in Agda.
APA, Harvard, Vancouver, ISO, and other styles
6

Ventura, D. L., F. Kamareddine, and M. Ayala-Rincon. "Explicit substitution calculi with de Bruijn indices and intersection type systems." Logic Journal of IGPL 23, no. 2 (December 30, 2014): 295–340. http://dx.doi.org/10.1093/jigpal/jzu044.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kamareddine, F. "Bridging de Bruijn indices and variable names in explicit substitutions calculi." Logic Journal of IGPL 6, no. 6 (November 1, 1998): 843–74. http://dx.doi.org/10.1093/jigpal/6.6.843.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Vouillon, Jérôme. "A Solution to the PoplMark Challenge Based on de Bruijn Indices." Journal of Automated Reasoning 49, no. 3 (June 4, 2011): 327–62. http://dx.doi.org/10.1007/s10817-011-9230-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Berghofer, Stefan, and Christian Urban. "A Head-to-Head Comparison of de Bruijn Indices and Names." Electronic Notes in Theoretical Computer Science 174, no. 5 (June 2007): 53–67. http://dx.doi.org/10.1016/j.entcs.2007.01.018.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Berghofer, Stefan. "A Solution to the PoplMark Challenge Using de Bruijn Indices in Isabelle/HOL." Journal of Automated Reasoning 49, no. 3 (June 23, 2011): 303–26. http://dx.doi.org/10.1007/s10817-011-9231-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Indices de De Bruijn"

1

Pouillard, Nicolas. "Une approche unifiante pour programmer sûrement avec de la syntaxe du premier ordre contenant des lieurs." Phd thesis, Université Paris-Diderot - Paris VII, 2012. http://tel.archives-ouvertes.fr/tel-00759059.

Full text
Abstract:
Cette thèse décrit une nouvelle approche pour la méta-programmation sûre. Un méta-programme est un programme qui manipule des programmes ou assimilés. Les compilateurs et systèmes de preuves sont de bons exemples de méta-programmes qui bénéficieraient de cette approche. Dans ce but, ce travail se concentre sur la représentation des noms et des lieurs dans les structures de données. Les erreurs de programmation étant courantes avec les techniques usuelles, nous proposons une interface abstraite pour les noms et les lieurs qui élimine ces erreurs. Cette interface est implémentée sous forme d'une bibliothèque en Agda. Elle permet de définir et manipuler des représentations de termes dans le style nominal. Grâce à l'abstraction, d'autres styles sont aussi disponibles : le style de De Bruijn, les combinaisons de ces styles, et d'autres encore. Nous indiçons les noms et les termes par des mondes. Les mondes sont en même temps précis et abstraits. Via les relations logiques et la paramétricité, nous pouvons démontrer dans quel sens notre bibliothèque est sûre, et obtenir des "théorèmes gratuits" à propos des fonctions monde-polymorphiques. Ainsi une fonction monde-polymorphique de transformation de termes doit commuter avec n'importe quel renommage des variables libres. La preuve est entièrement conduite en Agda. Notre technique se montre utile sur plusieurs exemples, dont la normalisation par évaluation qui est connue pour être un défi. Nous montrons que notre approche indicée par des mondes permet d'exprimer un large panel de type de données grâce a des langages de définition embarqués.
APA, Harvard, Vancouver, ISO, and other styles
2

Evans, Stephen David. "Methods of rapid bruise assessment and the formulation of robust bruise indices for potatoes." Thesis, University of Edinburgh, 1995. http://hdl.handle.net/1842/27990.

Full text
Abstract:
When potato tubers are subjected to impacts, the sub-surface tissue may become discoloured as damaged cells produce the blue-black pigment melanin. Bruising caused during harvesting and handling can lead to downgrading of potatoes for the processing industry and quality retail trade. The two aims of this thesis were to reduce the time to detect bruising, and to develop a non-subjective method for the quantification of bruising. Reflectance spectrophotometry was investigated as a rapid, non-subjective and non-invasive way of detecting bruising. Wavelengths from ultraviolet to near infrared were selected by discriminant analysis to separate unbruised and bruised tubers. Neural nets were trained with three wavelengths to identify bruised tubers in a sample of unbruised and bruised tubers. The detection of bruising gave inconsistent results in unpeeled tubers, but proved to be reliable in peeled tubers. The rate of bruise development at air pressures up to 10 bar was measured by reflectance spectrophotometry and by a visual rating. The production of dopachrome, an orange precursor pigment of melanin, was used as an early indication of bruising. Dopachrome is visible to the human eye and the time for bruise detection can be reduced to approximately 3 hours when compressed air is used. Infrared and microwave thermography were used to measure possible rises in bruised tissue temperature. Thermography was used in conjunction with scanning laser Doppler imaging to detect changes in the biological zero of bruised tissue. No significant differences could be detected between unbruised and bruised tubers using these techniques. Reflectance spectrophotometry was also used in combination with a colour digital camera to automatically measure bruise area in peeled tubers. While the camera alone could measure bruise area with precision, constant adjustments were needed. Reflectance spectrophotometry was faster but less precise than the camera for measuring bruise area.
APA, Harvard, Vancouver, ISO, and other styles
3

Varnet, Léo. "Identification des indices acoustiques utilisés lors de la compréhension de la parole dégradée." Thesis, Lyon 1, 2015. http://www.theses.fr/2015LYO10221/document.

Full text
Abstract:
Bien qu’il existe un large consensus de la communauté scientifique quant au rôle des indices acoustiques dans la compréhension de la parole, les mécanismes exacts permettant la transformation d’un flux acoustique continu en unités linguistiques élémentaires demeurent aujourd’hui largement méconnus. Ceci est en partie dû à l’absence d’une méthodologie efficace pour l’identification et la caractérisation des primitives auditives de la parole. Depuis les premières études de l’interface acoustico-phonétique par les Haskins Laboratories dans les années 50, différentes approches ont été proposées ; cependant, toutes sont fondamentalement limitées par l’artificialité des stimuli utilisés, les contraintes du protocole expérimental et le poids des connaissances a priori nécessaires. Le présent travail de thèse s’est intéressé { la mise en oeuvre d’une nouvelle méthode tirant parti de la situation de compréhension de parole dégradée pour mettre en évidence les indices acoustiques utilisés par l’auditeur.Dans un premier temps, nous nous sommes appuyés sur la littérature dans le domaine visuel en adaptant la méthode des Images de Classification à une tâche auditive de catégorisation de phonèmes dans le bruit. En reliant la réponse de l’auditeur { chaque essai à la configuration précise du bruit lors de cet essai, au moyen d’un Modèle Linéaire Généralisé, il est possible d’estimer le poids des différentes régions temps-fréquence dans la décision. Nous avons illustré l’efficacité de notre méthode, appelée Image de Classification Auditive, à travers deux exemples : une catégorisation /aba/-/ada/, et une catégorisation /da/-/ga/ en contexte /al/ ou /aʁ/. Notre analyse a confirmé l’implication des attaques des formants F2 et F3, déjà suggérée par de précédentes études, mais a également permis de révéler des indices inattendus. Dans un second temps, nous avons employé cette technique pour comparer les résultats de participants musiciens experts (N=19) ou dyslexiques (N=18) avec ceux de participants contrôles. Ceci nous a permis d’étudier les spécificités des stratégies d’écoute de ces différents groupes.L’ensemble des résultats suggèrent que les Images de Classification Auditives pourraient constituer une nouvelle approche, plus précise et plus naturelle, pour explorer et décrire les mécanismes { l’oeuvre au niveau de l’interface acoustico-phonétique
There is today a broad consensus in the scientific community regarding the involvement of acoustic cues in speech perception. Up to now, however, the precise mechanisms underlying the transformation from continuous acoustic stream into discrete linguistic units remain largely undetermined. This is partly due to the lack of an effective method for identifying and characterizing the auditory primitives of speech. Since the earliest studies on the acoustic–phonetic interface by the Haskins Laboratories in the 50’s, a number of approaches have been proposed; they are nevertheless inherently limited by the non-naturalness of the stimuli used, the constraints of the experimental apparatus, and the a priori knowledge needed. The present thesis aimed at introducing a new method capitalizing on the speech-in-noise situation for revealing the acoustic cues used by the listeners.As a first step, we adapted the Classification Image technique, developed in the visual domain, to a phoneme categorization task in noise. The technique relies on a Generalized Linear Model to link each participant’s response to the specific configuration of noise, on a trial-by-trail basis, thereby estimating the perceptual weighting of the different time-frequency regions for the decision. We illustrated the effectiveness of our Auditory Classification Image method through 2 examples: a /aba/-/ada/ categorization and a /da/-/ga/ categorization in context /al/ or /aʁ/. Our analysis confirmed that the F2 and F3 onsets were crucial for the tasks, as suggested in previous studies, but also revealed unexpected cues. In a second step, we relied on this new method to compare the results of musical experts (N=19) or dyslexics participants (N=18) to those of controls. This enabled us to explore the specificities of each group’s listening strategies.All the results taken together show that the Auditory Classification Image method may be a more precise and more straightforward approach to investigate the mechanisms at work at the acoustic-phonetic interface
APA, Harvard, Vancouver, ISO, and other styles
4

Löthgren, Anders. "de Bruijn-sekvenserDet effektiva paketbudet." Thesis, Örebro universitet, Institutionen för naturvetenskap och teknik, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:oru:diva-36148.

Full text
Abstract:
Denna uppsats behandlar specialfall av de Bruijn-sekvenser där varje sekvens av längd n i de Bruijn-sekvensen innehåller samtliga k olika element från ett alfabet Ak. Uppsatsen kommer att demonstrera hur man kan generera de Bruijn-sekvenser med hjälp av Eulercykler. Arbetet kommer därför även att ge en bakgrund om Eulercykler och även ange en metod för att bestämma antalet unika cykler.
APA, Harvard, Vancouver, ISO, and other styles
5

Bryant, Roy Dale. "Covering the de Bruijn graph." Thesis, Monterey, California. Naval Postgraduate School, 1986. http://hdl.handle.net/10945/21751.

Full text
Abstract:
Random-like sequences of 0's and l's are generated efficiently by binary shift registers. The output of n-stage shift registers viewed as a sequence of binary n-tuples also give rise to a special graph called the de Bruijn graph B . The de Bruijn graph is a directed graph with 2n nodes. Each node has 2 arcs entering it and 2 arcs going out of it. Thus, there are a total of 2n+1 arcs in Bn. In this thesis, we define a cover of the de Bruijn graph, different from the usual graph theoretic cover. A cover S of the de Bruijn graph is defined as an independent subset of the nodes of Bn that satisfy the following J property. For each node x in Bn - S, there exists a node y in S such that either the arc or the arc is in Bn. Combinatorially, we are able to place both upper and lower bounds on the cardinality of S. We find examples of covers that approach these bounds in cardinality. Several algorithms are presented that produce either a maximal or a minimal cover. Among them are Frugal, Sequential Fill, Double and Redouble, Greedy and Quartering.
APA, Harvard, Vancouver, ISO, and other styles
6

Hunt, D'Hania J. "Constructing higher-order de Bruijn graphs." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2002. http://library.nps.navy.mil/uhtbin/hyperion-image/02Jun%5FHunt.pdf.

Full text
Abstract:
Thesis (M.S. in Applied Mathematics)--Naval Postgraduate School, June 2002.
Thesis advisor(s): Harold Fredricksen, Craig W. Rasmussen. Includes bibliographical references (p. 45-46). Also available online.
APA, Harvard, Vancouver, ISO, and other styles
7

Alharthy, Shathaa. "De Bruijn Graphs and Lamplighter Groups." Thesis, Université d'Ottawa / University of Ottawa, 2019. http://hdl.handle.net/10393/38832.

Full text
Abstract:
De Bruijn graphs were originally introduced for finding a superstring representation for all fixed length words of a given finite alphabet. Later they found numerous applications, for instance, in DNA sequencing. Here we study a relationship between de Bruijn graphs and the family of lamplighter groups (a particular class of wreath products). We show how de Bruijn graphs and their generalizations can be presented as Cayley and Schreier graphs of lamplighter groups.
APA, Harvard, Vancouver, ISO, and other styles
8

Krahn, Gary William. "Double Eulerian cycles on de Bruijn digraphs." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1994. http://handle.dtic.mil/100.2/ADA283334.

Full text
Abstract:
Dissertation (Ph.D. in Applied Mathematics) Naval Postgraduate School, June 1994.
Dissertation supervisor(s): Harold Fredricksen. "June 1994" Includes bibliographical references. Also available online.
APA, Harvard, Vancouver, ISO, and other styles
9

Popovic, Lada McEliece Robert J. McEliece Robert J. "Finite state codes and generalized De Bruijn sequences /." Diss., Pasadena, Calif. : California Institute of Technology, 1991. http://resolver.caltech.edu/CaltechETD:etd-07092007-131600.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Zerbino, Daniel Robert. "Genome assembly and comparison using de Bruijn graphs." Thesis, University of Cambridge, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.611752.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Indices de De Bruijn"

1

Alfredo, Róspide López, ed. Polyaeni indices. Hildesheim: Olms-Weidmann, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Fiengo, Robert. Indices andidentity. Cambridge, Mass: MIT Press, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Chrysostom, John. Indices Chrysostomici. Hildesheim: Olms, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Griffith, Gethin Llywelyn. Deprivation indices. [Bangor (Gwynedd)]: Research Centre Wales, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Instituto Nacional de Colonização e Reforma Agrária. Diretoria de Cadastro Rural. Indices básicos 1997. Brasília, DF: INCRA, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

1951-, May Robert, ed. Indices and identity. Cambridge, Mass: MIT Press, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Abbasi, S. A. Water quality indices. Roorkee: INCOH Secretariat, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Abbasi, S. A. (Shahid A.), ed. Water quality indices. Amsterdam: Elsevier Science, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kotz, Samuel. Process capability indices. London: Chapman & Hall, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Fiengo, Robert. Indices and identity. Cambridge,Mass: MIT, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Indices de De Bruijn"

1

Tarau, Paul. "Ranking/Unranking of Lambda Terms with Compressed de Bruijn Indices." In Lecture Notes in Computer Science, 118–33. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-20615-8_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Tarau, Paul. "On Logic Programming Representations of Lambda Terms: de Bruijn Indices, Compression, Type Inference, Combinatorial Generation, Normalization." In Practical Aspects of Declarative Languages, 115–31. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-19686-2_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Helleseth, Tor. "De Bruijn Sequence." In Encyclopedia of Cryptography and Security, 315–16. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-1-4419-5906-5_344.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Freij, Ragnar. "Shifted de Bruijn Graphs." In Coding Theory and Applications, 195–202. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-17296-5_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Lin, Yu, and Pavel A. Pevzner. "Manifold de Bruijn Graphs." In Lecture Notes in Computer Science, 296–310. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-44753-6_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Bowe, Alexander, Taku Onodera, Kunihiko Sadakane, and Tetsuo Shibuya. "Succinct de Bruijn Graphs." In Lecture Notes in Computer Science, 225–35. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-33122-0_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Belazzougui, Djamal, Travis Gagie, Veli Mäkinen, and Marco Previtali. "Fully Dynamic de Bruijn Graphs." In String Processing and Information Retrieval, 145–52. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-46049-9_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Lin, Yaw-Ling, Charles Ward, Bharat Jain, and Steven Skiena. "Constructing Orthogonal de Bruijn Sequences." In Lecture Notes in Computer Science, 595–606. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22300-6_50.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Richa, Andréa, Christian Scheideler, and Phillip Stevens. "Self-Stabilizing De Bruijn Networks." In Lecture Notes in Computer Science, 416–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24550-3_31.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Shoenfield, Joseph R. "Indices." In Lecture Notes in Logic, 20–26. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/978-3-662-22378-9_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Indices de De Bruijn"

1

Marcovich, Sagi, Tuvi Etzion, and Eitan Yaakobi. "Balanced de Bruijn Sequences." In 2021 IEEE International Symposium on Information Theory (ISIT). IEEE, 2021. http://dx.doi.org/10.1109/isit45174.2021.9517873.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Boucher, Christina, Alex Bowe, Travis Gagie, Simon J. Puglisi, and Kunihiko Sadakane. "Variable-Order de Bruijn Graphs." In 2015 Data Compression Conference (DCC). IEEE, 2015. http://dx.doi.org/10.1109/dcc.2015.70.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Sonmez Turan, Meltem. "Evolutionary construction of de bruijn sequences." In the 4th ACM workshop. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/2046684.2046696.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Baier, Uwe, Thomas Buchler, Enno Ohlebusch, and Pascal Weber. "Edge Minimization in de Bruijn Graphs." In 2020 Data Compression Conference (DCC). IEEE, 2020. http://dx.doi.org/10.1109/dcc47342.2020.00030.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Zheng, Wei, Ying-li Cao, Yun-cheng Zhou, and Tong-yu Xu. "A generalization of modified de Bruijn sequences." In 2010 2nd International Conference on Information Science and Engineering (ICISE). IEEE, 2010. http://dx.doi.org/10.1109/icise.2010.5691994.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Chee, Yeow Meng, Tuvi Etzion, Han Mao Kiah, Van Khu Vu, and Eitan Yaakobi. "Constrained de Bruijn Codes and their Applications." In 2019 IEEE International Symposium on Information Theory (ISIT). IEEE, 2019. http://dx.doi.org/10.1109/isit.2019.8849237.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Mayhew, Gregory L. "Rooted tree graphs and de Bruijn graphs." In 2010 IEEE Aerospace Conference. IEEE, 2010. http://dx.doi.org/10.1109/aero.2010.5446922.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ulusoy, Ali Osman, Fatih Calakli, and Gabriel Taubin. "One-shot scanning using De Bruijn spaced grids." In 2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops. IEEE, 2009. http://dx.doi.org/10.1109/iccvw.2009.5457499.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ngoc Chi Nguyen and Thanh Vu-Dinh. "Optimal routing algorithms for Hyper-de Bruijn networks." In 2010 International Conference on Advanced Technologies for Communications (ATC 2010). IEEE, 2010. http://dx.doi.org/10.1109/atc.2010.5672730.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Johnson, Oliver, and Saikat Guha. "A de Bruijn identity for discrete random variables." In 2017 IEEE International Symposium on Information Theory (ISIT). IEEE, 2017. http://dx.doi.org/10.1109/isit.2017.8006658.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Indices de De Bruijn"

1

Moore, Joel R. Calculating Parameters of De Bruijn Graphs. Fort Belvoir, VA: Defense Technical Information Center, December 2014. http://dx.doi.org/10.21236/ada616735.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Boutin, Debra, and Victoria Horan. Identifying Codes on Directed De Bruijn Graphs. Fort Belvoir, VA: Defense Technical Information Center, December 2014. http://dx.doi.org/10.21236/ada623527.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Jacoby, H. D., and R. G. Prinn. Greenhouse gas indices. Final report. Office of Scientific and Technical Information (OSTI), September 1998. http://dx.doi.org/10.2172/656485.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Lamothe, D. Indices et gites de minéraux. Natural Resources Canada/ESS/Scientific and Technical Publishing Services, 2007. http://dx.doi.org/10.4095/223375.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Xu, Hui, and May M. Wu. Water Availability Indices – A Literature Review. Office of Scientific and Technical Information (OSTI), February 2017. http://dx.doi.org/10.2172/1348938.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Canavan, G. H. Sensitivity of stability indices to dealerting. Office of Scientific and Technical Information (OSTI), March 1998. http://dx.doi.org/10.2172/663410.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Sebring, Lynn, and Tina G. Butcher. NIST indices of NTEP device evaluations. Gaithersburg, MD: National Institute of Standards and Technology, 1999. http://dx.doi.org/10.6028/nist.ir.6304e1999.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Sebring, Lynn, Tina G. Butcher, and Henry R. Oppermann. NIST indices of NTEP device evaluations. Gaithersburg, MD: National Institute of Standards and Technology, 2000. http://dx.doi.org/10.6028/nist.ir.6304e2000.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

tate, David M. Hedonic Price Indices for Ground Vehicles. Fort Belvoir, VA: Defense Technical Information Center, May 2015. http://dx.doi.org/10.21236/ada617876.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Saltus, Christina, Todd Swannack, and S. McKay. Geospatial Suitability Indices Toolbox (GSI Toolbox). Engineer Research and Development Center (U.S.), September 2021. http://dx.doi.org/10.21079/11681/41881.

Full text
Abstract:
Habitat suitability models are widely adopted in ecosystem management and restoration, where these index models are used to assess environmental impacts and benefits based on the quantity and quality of a given habitat. Many spatially distributed ecological processes require application of suitability models within a geographic information system (GIS). Here, we present a geospatial toolbox for assessing habitat suitability. The Geospatial Suitability Indices (GSI) toolbox was developed in ArcGIS Pro 2.7 using the Python® 3.7 programming language and is available for use on the local desktop in the Windows 10 environment. Two main tools comprise the GSI toolbox. First, the Suitability Index Calculator tool uses thematic or continuous geospatial raster layers to calculate parameter suitability indices based on user-specified habitat relationships. Second, the Overall Suitability Index Calculator combines multiple parameter suitability indices into one overarching index using one or more options, including: arithmetic mean, weighted arithmetic mean, geometric mean, and minimum limiting factor. The resultant output is a raster layer representing habitat suitability values from 0.0 to 1.0, where zero is unsuitable habitat and one is ideal suitability. This report documents the model purpose and development as well as provides a user’s guide for the GSI toolbox.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Indices de De Bruijn' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography