Bibliographies thématiques / Binary word

Littérature scientifique sur le sujet « Binary word »

Auteur : Grafiati
Publié le 10 mars 2023

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Sommaire

Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Binary word ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Articles de revues sur le sujet "Binary word"

1

Teh, Wen Chean. « On Core Words and the Parikh Matrix Mapping ». International Journal of Foundations of Computer Science 26, no 01 (janvier 2015) : 123–42. http://dx.doi.org/10.1142/s0129054115500069.

Texte intégral
Résumé :
Core of a binary word, recently introduced, is a refined way to characterize binary words having the same Parikh matrices, as well as bridging the connection between binary words and partitions of natural numbers. This paper continues the work by generalizing to higher alphabet. The core of a word as well as the relatived version is the essential part of a word that captures the key information of the word from the perspective of its Parikh matrix. Various nice properties of the cores and some interesting results regarding the M-equivalence classes of ternary words are obtained.
Styles APA, Harvard, Vancouver, ISO, etc.
2

Holmberg, Anders. « Icelandic Word Order and Binary Branching ». Nordic Journal of Linguistics 8, no 2 (décembre 1985) : 161–95. http://dx.doi.org/10.1017/s0332586500001323.

Texte intégral
Résumé :
Certain word order facts in Icelandic have been claimed, by several linguists, to provide evidence that Icelandic has no VP constituent (in s-structure) in sentences where the main verb is finite. If correct, this entails that Icelandic phrase structure is not always binary branching, contradicting the hypothesis that all phrase structure is binary branching. It is shown to be incorrect. A new theory of Icelandic sentence structure is presented, based on Platzack (in press), but strictly observing binary branching. The theory presented is shown to be empirically more adequate than the less constrainedĀ-nary branching theories.
Styles APA, Harvard, Vancouver, ISO, etc.
3

Ilić, Aleksandar, Sandi Klavžar et Yoomi Rho. « The index of a binary word ». Theoretical Computer Science 452 (septembre 2012) : 100–106. http://dx.doi.org/10.1016/j.tcs.2012.05.025.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Wang, Yuwei, Yi Zeng, Jianbo Tang et Bo Xu. « Biological Neuron Coding Inspired Binary Word Embeddings ». Cognitive Computation 11, no 5 (24 juillet 2019) : 676–84. http://dx.doi.org/10.1007/s12559-019-09643-1.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

HADRAVOVÁ, JANA, et ŠTĚPÁN HOLUB. « LARGE SIMPLE BINARY EQUALITY WORDS ». International Journal of Foundations of Computer Science 23, no 06 (septembre 2012) : 1385–403. http://dx.doi.org/10.1142/s0129054112500207.

Texte intégral
Résumé :
Let two nonperiodic binary morphisms g,h: {a,b}* → Δ* be given. A word w is called a solution of g and h if g(w)=h(w). We say that a solution w is simple if whenever w1, w1u, w2and w2u' are prefixes of wωsuch that [Formula: see text] for some word z, then |u|=|u'|=k|w|, for some k ∈ ℕ. In this paper we will study simple solutions and show that if a word w is a simple solution containing at least nine occurrences of the letter a and at least nine occurrences of the letter b, then either w=(ab)ia, or w=ajbkwith gcd (j, k) = 1, up to the exchange of letters a and b.
Styles APA, Harvard, Vancouver, ISO, etc.
6

Tissier, Julien, Christophe Gravier et Amaury Habrard. « Near-Lossless Binarization of Word Embeddings ». Proceedings of the AAAI Conference on Artificial Intelligence 33 (17 juillet 2019) : 7104–11. http://dx.doi.org/10.1609/aaai.v33i01.33017104.

Texte intégral
Résumé :
Word embeddings are commonly used as a starting point in many NLP models to achieve state-of-the-art performances. However, with a large vocabulary and many dimensions, these floating-point representations are expensive both in terms of memory and calculations which makes them unsuitable for use on low-resource devices. The method proposed in this paper transforms real-valued embeddings into binary embeddings while preserving semantic information, requiring only 128 or 256 bits for each vector. This leads to a small memory footprint and fast vector operations. The model is based on an autoencoder architecture, which also allows to reconstruct original vectors from the binary ones. Experimental results on semantic similarity, text classification and sentiment analysis tasks show that the binarization of word embeddings only leads to a loss of ∼2% in accuracy while vector size is reduced by 97%. Furthermore, a top-k benchmark demonstrates that using these binary vectors is 30 times faster than using real-valued vectors.
Styles APA, Harvard, Vancouver, ISO, etc.
7

Kowalski, Jacek M., et Andrzej Pękalski. « On evolving chains of cube-free binary sequences ». Notes on Number Theory and Discrete Mathematics 27, no 3 (septembre 2021) : 79–94. http://dx.doi.org/10.7546/nntdm.2021.27.3.79-94.

Texte intégral
Résumé :
Chains of concatenated finite binary words are considered, where each word, except possibly the very first one, is composed of alternating blocks of zeroes and ones with block lengths not exceeding two. These chains are formed following two evolution schemes. The first scheme is standard, where alternating blocks are visited at random. In the second approach, proposed by us in this paper, each subsequent word of the chain is uniquely determined by its immediate predecessor, being formed as a specifically inflated version of that word. Famous Kolakoski sequence is then just one, very special example of such deterministic evolution when one starts from its third element. We present heuristic arguments supported by simulations indicating that all such deterministic infinite chains should have the asymptotic density of digit 1 equal 1/2 and that the subsequent word lengths asymptotically scale with factor of 3/2 and hence the density of 1’s in subsequent finite words may also tend to 1/2.
Styles APA, Harvard, Vancouver, ISO, etc.
8

Kumova Metin, Senem, et Bahar Karaoğlan. « STOP WORD DETECTION AS A BINARY CLASSIFICATION PROBLEM ». ANADOLU UNIVERSITY JOURNAL OF SCIENCE AND TECHNOLOGY A - Applied Sciences and Engineering 18, no 2 (30 juin 2017) : 1. http://dx.doi.org/10.18038/aubtda.322136.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Gabric, Daniel, et Jeffrey Shallit. « The simplest binary word with only three squares ». RAIRO - Theoretical Informatics and Applications 55 (2021) : 3. http://dx.doi.org/10.1051/ita/2021001.

Texte intégral
Résumé :
We re-examine previous constructions of infinite binary words containing few distinct squares with the goal of finding the “simplest”, in a certain sense. We exhibit several new constructions. Rather than using tedious case-based arguments to prove that the constructions have the desired property, we rely instead on theorem-proving software for their correctness.
Styles APA, Harvard, Vancouver, ISO, etc.
10

Anh, V. N., et A. Moffat. « Improved word-aligned binary compression for text indexing ». IEEE Transactions on Knowledge and Data Engineering 18, no 6 (juin 2006) : 857–61. http://dx.doi.org/10.1109/tkde.2006.99.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
Plus de sources

Thèses sur le sujet "Binary word"

1

Oudjida, Abdelkrim Kamel. « Binary Arithmetic for Finite-Word-Length Linear Controllers : MEMS Applications ». Thesis, Besançon, 2014. http://www.theses.fr/2014BESA2001/document.

Texte intégral
Résumé :
Cette thèse traite le problème d'intégration hardware optimale de contrôleurs linéaires à taille de mot finie, dédiés aux applications MEMS. Le plus grand défi est d'assurer des performances de contrôle satisfaisantes avec un minimum de ressources logiques. Afin d'y parvenir, deux optimisations distinctes mais complémentaires peuvent être entreprises: en théorie de contrôle et en arithmétique binaire. Seule cette dernière est considérée dans ce travail.Comme cette arithmétique cible des applications MEMS, elle doit faire preuve de vitesse afin de prendre en charge la dynamique rapide des MEMS, à faible consommation de puissance pour un contrôle intégré, hautement re-configurabe pour un ajustement facile des performances de contrôle, et facilement prédictible pour fournir une idée précise sur les ressources logiques nécessaires avant l'implémentation même.L'exploration d'un certain nombre d'arithmétiques binaires a montré que l'arithmétique radix-2r est celle qui répond au mieux aux exigences précitées. Elle a été pleinement exploitée afin de concevoir des circuits de multiplication efficaces, qui sont au fait, le véritable moteur des systèmes linéaires.L'arithmétique radix-2r a été appliquée à l'intégration hardware de deux structures linéaires à taille de mot finie: un contrôleur PID variant dans le temps et à un contrôleur LQG invariant dans le temps,avec un filtre de Kalman. Le contrôleur PID a montré une nette supériorité sur ses homologues existants. Quant au contrôleur LQG, une réduction très importante des ressources logiques a été obtenue par rapport à sa forme initiale non optimisée
This thesis addresses the problem of optimal hardware-realization of finite-word-length(FWL) linear controllers dedicated to MEMS applications. The biggest challenge is to ensuresatisfactory control performances with a minimal hardware. To come up, two distinct butcomplementary optimizations can be undertaken: in control theory and in binary arithmetic. Only thelatter is involved in this work.Because MEMS applications are targeted, the binary arithmetic must be fast enough to cope withthe rapid dynamic of MEMS; power-efficient for an embedded control; highly scalable for an easyadjustment of the control performances; and easily predictable to provide a precise idea on therequired logic resources before the implementation.The exploration of a number of binary arithmetics showed that radix-2r is the best candidate that fitsthe aforementioned requirements. It has been fully exploited to designing efficient multiplier cores,which are the real engine of the linear systems.The radix-2r arithmetic was applied to the hardware integration of two FWL structures: a linear timevariant PID controller and a linear time invariant LQG controller with a Kalman filter. Both controllersshowed a clear superiority over their existing counterparts, or in comparison to their initial forms
Styles APA, Harvard, Vancouver, ISO, etc.
2

Tergino, Christian Sean. « Efficient Binary Field Multiplication on a VLIW DSP ». Thesis, Virginia Tech, 2009. http://hdl.handle.net/10919/33693.

Texte intégral
Résumé :
Modern public-key cryptography relies extensively on modular multiplication with long operands. We investigate the opportunities to optimize this operation in a heterogeneous multiprocessing platform such as TI OMAP3530. By migrating the long operand modular multiplication from a general-purpose ARM Cortex A8 to a specialized C64x+ VLIW DSP, we are able to exploit the XOR-Multiply instruction and the inherent parallelism of the DSP. The proposed multiplication utilizes Multi-Precision Binary Polynomial Multiplication with Unbalanced Exponent Modular Reduction. The resulting DSP implementation performs a GF(2^233) multiplication in less than 1.31us, which is over a seven times speed up when compared with the ARM implementation on the same chip. We present several strategies for different field sizes and field polynomials, and show that a 360MHz DSP easily outperforms the 500MHz ARM.
Master of Science
Styles APA, Harvard, Vancouver, ISO, etc.
3

Tissier, Julien. « Improving methods to learn word representations for efficient semantic similarites computations ». Thesis, Lyon, 2020. http://www.theses.fr/2020LYSES008.

Texte intégral
Résumé :
De nombreuses applications en traitement du langage naturel (TALN) reposent sur les représentations de mots, ou “word embeddings”. Ces représentations doivent capturer à la fois de l’information syntaxique et sémantique pour donner des bonnes performances dans les tâches en aval qui les utilisent. Cependant, les méthodes courantes pour les apprendre utilisent des textes génériques comme Wikipédia qui ne contiennent pas d’information sémantique précise. De plus, un espace mémoire important est requis pour pouvoir les sauvegarder car le nombre de représentations de mots à apprendre peut être de l’ordre du million. Le sujet de ma thèse est de développer de nouveaux algorithmes pour améliorer l’information sémantique dans les word embeddings tout en réduisant leur taille en mémoire lors de leur utilisation dans des tâches en aval de TALN.La première partie de mes travaux améliore l’information sémantique contenue dans les word embeddings. J’ai développé dict2vec, un modèle qui utilise l’information des dictionnaires linguistiques lors de l’apprentissage des word embeddings. Les word embeddings appris par dict2vec obtiennent des scores supérieurs d’environ 15% par rapport à ceux appris avec d’autres méthodes sur des tâches de similarités sémantiques de mots. La seconde partie de mes travaux consiste à réduire la taille mémoire des word embeddings. J’ai développé une architecture basée sur un auto-encodeur pour transformer des word embeddings à valeurs réelles en vecteurs binaires, réduisant leur taille mémoire de 97% avec seulement une baisse de précision d’environ 2% dans des tâches de TALN en aval
Many natural language processing applications rely on word representations (also called word embeddings) to achieve state-of-the-art results. These numerical representations of the language should encode both syntactic and semantic information to perform well in downstream tasks. However, common models (word2vec, GloVe) use generic corpus like Wikipedia to learn them and they therefore lack specific semantic information. Moreover it requires a large memory space to store them because the number of representations to save can be in the order of a million. The topic of my thesis is to develop new learning algorithms to both improve the semantic information encoded within the representations while making them requiring less memory space for storage and their application in NLP tasks.The first part of my work is to improve the semantic information contained in word embeddings. I developed dict2vec, a model that uses additional information from online lexical dictionaries when learning word representations. The dict2vec word embeddings perform ∼15% better against the embeddings learned by other models on word semantic similarity tasks. The second part of my work is to reduce the memory size of the embeddings. I developed an architecture based on an autoencoder to transform commonly used real-valued embeddings into binary embeddings, reducing their size in memory by 97% with only a loss of ∼2% in accuracy in downstream NLP tasks
Styles APA, Harvard, Vancouver, ISO, etc.
4

Guillon, B. « Two-wayness : Automata and Transducers ». Doctoral thesis, Università degli Studi di Milano, 2016. http://hdl.handle.net/2434/385609.

Texte intégral
Résumé :
This PhD is about two natural extensions of Finite Automata (FA): the 2-way fa (2FA) and the 2-way transducers (2T). It is well known that 2FA s are computably equivalent to FAs, even in their nondeterministic (2nfa) variant. However, in the field of descriptional complexity, some questions remain. Raised by Sakoda and Sipser in 1978, the question of the cost of the simulation of 2NFA by 2DFA (the deterministic variant of 2FA) is still open. In this manuscript, we give an answer in a restricted case in which the nondeterministic choices of the simulated 2NFA may occur at the boundaries of the input tape only (2ONFA). We show that every 2ONFA can be simulated by a 2DFA of subexponential (but superpolynomial) size. Under the assumptions L=NL, this cost is reduced to the polynomial level. Moreover, we prove that the complementation and the simulation by a halting 2ONFA is polynomial. We also consider the anologous simulations for alternating devices. Providing a one-way write-only output tape to FAs leads to the notion of transducer. Contrary to the case of finite automata which are acceptor, 2-way transducers strictly extends the computational power of 1-way one, even in the case where both the input and output alphabets are unary. Though 1-way transducers enjoy nice properties and characterizations (algebraic, logical, etc. . . ), 2-way variants are less known, especially the nondeterministic case. In this area, this manuscript gives a new contribution: an algebraic characterization of the relations accepted by two-way transducers when both the input and output alphabets are unary. Actually, it can be reformulated as follows: each unary two-way transducer is equivalent to a sweeping (and even rotating) transducer. We also show that the assumptions made on the size of the alphabets are required, that is, sweeping transducers weakens the 2-way transducers whenever at least one of the alphabet is non-unary. On the path, we discuss on the computational power of some algebraic operations on word relations, introduced in the aim of describing the behavior of 2-way transducers or, more generally, of 2-way weighted automata. In particular, the mirror operation, consisting in reversing the input word in order to describe a right to left scan, draws our attention. Finally, we study another kind of operations, more adapted for binary word relations: the composition. We consider the transitive closure of relations. When the relation belongs to some very restricted sub-family of rational relations, we are able to compute its transitive closure and we set its complexity. This quickly becomes uncomputable when higher classes are considered.
Styles APA, Harvard, Vancouver, ISO, etc.
5

Kelan, Elisabeth Kristina. « Binary logic ? : doing gender in information communication technology work ». Thesis, London School of Economics and Political Science (University of London), 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.429370.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Culnane, Christopher. « Mark my words : binary watermarking robust to printing and scanning ». Thesis, University of Surrey, 2009. http://epubs.surrey.ac.uk/843362/.

Texte intégral
Résumé :
Binary Watermarking, robust to printing and scanning, is the process of imperceptibly hiding information in binary documents, typically text documents, so that the hidden information can still be recovered following the printing and scanning of a document. It presents a challenging problem, both in finding an imperceptible way to hide data within a sparse text document, and providing an embedding strategy that can handle the myriad of distortions introduced during printing and scanning. Our goal was to develop a scheme that had sufficient capacity to embed our proposed authenticating and localising watermark. Existing schemes did not provide sufficient capacity, requiring us to develop techniques to increase the embedding capacity whilst maintaining the robustness to printing and scanning. In this thesis we present two distinct approaches to binary watermarking robust to printing and scanning. Our first approach, Binary Text Watermarking, is based on the principle of adjusting white space between adjacent words in order to embed a watermark, and forms the main focus of this thesis. A fundamental requirement of Binary Text Watermarking is the correct classification of white space, which is a difficult task due to the variation between different fonts, font sizes and the small tolerances between success and failure. The task is compounded by the requirement to classify white space in the same way, following printing and scanning, and even photocopying. The techniques we have proposed: Frequency Thresholding, Frequency Shaping and PDF Analysis have been designed to cope with distortion and mitigate against the possibility of misclassification. We have analysed 864 test documents to validate our white space classification techniques. In doing so we have discovered a number of interesting characteristics associated with the distribution of white space within documents. In order to increase available embedding capacity within a document we have proposed a new set allocation process in the form of Continuous Line Watermarking. In addition we have introduced two new set modulation techniques: Quad Set Watermarking and Ternary Watermarking. We have achieved an overall increase in capacity of 174%, in comparison to previous work, whilst mainting robustness to printing and scanning, and even photocopying. In order to validate this we printed and scanned 504 test documents, consisting of different fonts and variants of our scheme. We have developed an end-user application that provides a fully featured user interface to allow users to analyse, embed, detect and authenticate documents using our watermarking schemes. Our second approach to binary watermarking is our Imperceptible Yellow Printer Dots method, which is orthogonal to our Binary Text Watermarking method. The concept is based on the methods used by printer manufacturers to identify the printer on which the document was printed. The method relies on the imperfections of the human visual system, which prevent humans seeing tiny yellow dots on white paper. The novelty of our approach is the automatic embedding and detection of a custom watermark using an off-the-shelf printer and scanner. It must handle similar distortions to those incurred by our Binary Text Watermarking method, whilst still successfully finding the tiny yellow dots. Our proposed, Imperceptible Yellow Printer Dots, scheme provides a capacity over 18 times greater than our Binary Text Watermarking method.
Styles APA, Harvard, Vancouver, ISO, etc.
7

Frost, R. A. « The binary-relational view and aspects of database and knowledge base systems work ». Thesis, University of Strathclyde, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.381496.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Vizenor, Katie Virginia. « Binary Lives| Digital Citizenship and Disability Participation in a User Content Created Virtual World ». Thesis, State University of New York at Buffalo, 2014. http://pqdtopen.proquest.com/#viewpdf?dispub=3613110.

Texte intégral
Résumé :

Digital Citizenship is a concept typically used in discussions of how technology impacts our relationships with others and our physical world communities. It is also used to describe ways that we can leverage our technology use and skill to make our communities and nations better and stronger. Educators are now teaching "good digital citizenship" as part of a larger civics curriculum.

But, there is a second, emerging concept that I refer to as platform specific digital citizenship. I define this platform specific citizenship as the deep and abiding commitment and sense of responsibility that people develop in relation to a particular technology, such as software or technology brand. It may also refer to the ideas that people express in regard to how technology should ideally be used and what rights and responsibilities it requires of its adherents.

Massively Multiplayer Online Worlds (MMOWs) are one place researchers are finding this deep, platform specific digital citizenship emerging. These are persistent digital universes where people from all over the world develop online personas, leadership structures, discussion forums, and business and non-profit entities. The ability and extent to which this online organization is possible is largely due to the underlying structure, rules and allowances of the world of which people choose to be a part.

One online world, Second Life, has a large, active and vocal disabled population. They have committed to this environment because of the unique opportunities and freedoms that it provides. As a user content created environment, residents, as Second Life participants are referred to, are given an unprecedented amount of freedom to create the kind of experience they want. This may involve developing relationships and projects with other disabled residents. It can also involve exploring other aspects of themselves and their interests that are often neglected in their real lives due to social exclusion, and/or lack of financial and physical access.

Most of the research and popular media examinations of disability in Second Life centers on participation in disability specific communities or the benefits of identity exploration through avatar design. But, the reasons disabled people stay here is much broader and varied than what this limited discussion suggests. Commitment to Second Life is strong precisely because disability community commitment and disability expression are not the only options but exist among a wide range of choices. Moreover, the expression of disability and use of such mediated environments is constantly debated in both word and deed.

This dissertation explores the concept of digital citizenship and why people that identify as disabled in real life are attracted to committed participation in virtual worlds, in particular, Second Life. What opportunities and rights are disabled people afforded here through the technology structure? What are the avenues of entry into the Second Life community, and what does the variety of these entry points and special interest sub-communities tell us about what is important to them? How is commitment debated and deepened through the use of public spaces and forums? And, what can researchers, public health and information professionals learn from these features that can improve their own outreach?

Styles APA, Harvard, Vancouver, ISO, etc.
9

Bull, Brooks A. « Parents of Non-Binary Children : Stories of Understanding and Support ». Antioch University / OhioLINK, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=antioch1620153478670169.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Kindbom, Hannes. « LSTM vs Random Forest for Binary Classification of Insurance Related Text ». Thesis, KTH, Matematisk statistik, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-252748.

Texte intégral
Résumé :
The field of natural language processing has received increased attention lately, but less focus is put on comparing models, which differ in complexity. This thesis compares Random Forest to LSTM, for the task of classifying a message as question or non-question. The comparison was done by training and optimizing the models on historic chat data from the Swedish insurance company Hedvig. Different types of word embedding were also tested, such as Word2vec and Bag of Words. The results demonstrated that LSTM achieved slightly higher scores than Random Forest, in terms of F1 and accuracy. The models’ performance were not significantly improved after optimization and it was also dependent on which corpus the models were trained on. An investigation of how a chatbot would affect Hedvig’s adoption rate was also conducted, mainly by reviewing previous studies about chatbots’ effects on user experience. The potential effects on the innovation’s five attributes, relative advantage, compatibility, complexity, trialability and observability were analyzed to answer the problem statement. The results showed that the adoption rate of Hedvig could be positively affected, by improving the first two attributes. The effects a chatbot would have on complexity, trialability and observability were however suggested to be negligible, if not negative.
Det vetenskapliga området språkteknologi har fått ökad uppmärksamhet den senaste tiden, men mindre fokus riktas på att jämföra modeller som skiljer sig i komplexitet. Den här kandidatuppsatsen jämför Random Forest med LSTM, genom att undersöka hur väl modellerna kan användas för att klassificera ett meddelande som fråga eller icke-fråga. Jämförelsen gjordes genom att träna och optimera modellerna på historisk chattdata från det svenska försäkringsbolaget Hedvig. Olika typer av word embedding, så som Word2vec och Bag of Words, testades också. Resultaten visade att LSTM uppnådde något högre F1 och accuracy än Random Forest. Modellernas prestanda förbättrades inte signifikant efter optimering och resultatet var också beroende av vilket korpus modellerna tränades på. En undersökning av hur en chattbot skulle påverka Hedvigs adoption rate genomfördes också, huvudsakligen genom att granska tidigare studier om chattbotars effekt på användarupplevelsen. De potentiella effekterna på en innovations fem attribut, relativ fördel, kompatibilitet, komplexitet, prövbarhet and observerbarhet analyserades för att kunna svara på frågeställningen. Resultaten visade att Hedvigs adoption rate kan påverkas positivt, genom att förbättra de två första attributen. Effekterna en chattbot skulle ha på komplexitet, prövbarhet och observerbarhet ansågs dock vara försumbar, om inte negativ.
Styles APA, Harvard, Vancouver, ISO, etc.
Plus de sources

Livres sur le sujet "Binary word"

1

Lipunov, V. M. In the world of binary stars. Moscow : Mir Publishers, 1989.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

artist), HIMA (Comic book, Allen Jocelyne 1974- et Beepee, dir. Accel World : The binary stars of destiny. New York, NY : Yen Press, 2016.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Abels, Birgit. Music Worlding in Palau. Nieuwe Prinsengracht 89 1018 VR Amsterdam Nederland : Amsterdam University Press, 2022. http://dx.doi.org/10.5117/9789463725125.

Texte intégral
Résumé :
Music Worlding in Palau: Chanting, Atmospheres, and Meaningfulness is a detailed study of the performing arts in Palau, Micronesia as holistic techniques enabling the experiential corporeality of music’s meaningfulness—that distinctly musical way of making sense of the world with which the felt body immediately resonates but which, to a significant extent, escapes interpretive techniques. Drawing on long-term ethnographic research alongside Pacific Islander and neo-phenomenological conceptual frameworks, Music Worlding distinguishes between meaning(s) and meaningfulness in Palauan music-making. These are not binary phenomena, but deeply intertwined. However, unlike meaning, meaningfulness to a significant extent suspends language and is thus often prematurely considered ineffable. The book proposes a broader understanding of how the performing arts give rise to a sense of meaningfulness whose felt-bodily affectivity is pivotal to music-making and lived realities. Music Worlding thus seeks to draw the reader closer to the holistic complexity of music-making both in Palau and more generally.
Styles APA, Harvard, Vancouver, ISO, etc.
4

Veshkurtsev, Yury. THE FOUNDATIONS OF THE THEORY OF CONSTRUCTION OF NEW-GENERATION MODEMS. au : AUS PUBLISHERS, 2022. http://dx.doi.org/10.26526/monography_628a8925151ca0.71125494.

Texte intégral
Résumé :
The monography presents the fundamentals of the theory of construction new-generation modems. Modems are built on the principles of statistical communication theory, based on the use of a random signal (chaos) as a carrier of information. In such a signal, a characteristic function is modulated, which is a fundamental characteristic of a random process. The signal modulation and demodulation method is patented and allows you to create modems with efficiency and noise immunity indicators several orders of magnitude higher than those of the known devices of the same name. New-generation modems immediately improve the technical characteristics of digital IT equipment by several orders of magnitude, since they work without errors in wired and radio channels when receiving one hundred duodecillion of binary symbols. The book is recommended for scientists and specialists in the field of digital communication systems, statistical radio engineering and instrumentation, and may be useful for graduate students, masters and students of relevant specialties.
Styles APA, Harvard, Vancouver, ISO, etc.
5

McLeod, Frank E. Binary Word : God's Binary Logic in the Bible. Independently Published, 2019.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Lipp, Deborah. Bending the Binary : Polarity Magic in a Non-Binary World. Llewellyn Publications, 2023.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Bending the Binary : Polarity Magic in a Non-Binary World. Llewellyn Publications, 2023.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Noubary, Reza. E1ther, 0r : Exploring the Binary World. BookBaby, 2020.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Gender Stories : Negotiating Identity in a Binary World. Waveland Press, Incorporated, 2012.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Carlson, Nicholas. How binary system works about one world USA Empire. Lulu Press, Inc., 2009.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
Plus de sources

Chapitres de livres sur le sujet "Binary word"

1

Vorobyova, E. G. « On efficiency of prefix word-encoding of binary messages ». Dans Fundamentals of Computation Theory, 477–78. Berlin, Heidelberg : Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/3-540-18740-5_104.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

He, Yan, et Yang Liu. « Chinese Word Order Analysis Based on Binary Dependency Relationships ». Dans Lecture Notes in Computer Science, 149–58. Cham : Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-49508-8_15.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Dey, Sounak, Anguelos Nicolaou, Josep Llados et Umapada Pal. « Local Binary Pattern for Word Spotting in Handwritten Historical Document ». Dans Lecture Notes in Computer Science, 574–83. Cham : Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-49055-7_51.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Shah, Khushboo, Hardik Joshi et Hiren Joshi. « Evaluating Binary Classifiers with Word Embedding Techniques for Public Grievances ». Dans Soft Computing and its Engineering Applications, 209–21. Cham : Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-05767-0_17.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Alatabbi, Ali, Carl Barton, Costas S. Iliopoulos et Laurent Mouchard. « Querying Highly Similar Structured Sequences via Binary Encoding and Word Level Operations ». Dans IFIP Advances in Information and Communication Technology, 584–92. Berlin, Heidelberg : Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-33412-2_60.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Jaworski, Rafał, Krzysztof Jassem et Krzysztof Stroński. « Binary Classification Algorithms for the Detection of Sparse Word Forms in New Indo-Aryan Languages ». Dans Human Language Technology. Challenges for Computer Science and Linguistics, 123–36. Cham : Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-93782-3_10.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Houdré, Christian, et Trevis J. Litherland. « Asymptotics for the Length of the Longest Increasing Subsequence of a Binary Markov Random Word ». Dans Malliavin Calculus and Stochastic Analysis, 511–24. Boston, MA : Springer US, 2013. http://dx.doi.org/10.1007/978-1-4614-5906-4_23.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Restivo, Antonio, et Sergio Salemi. « Binary Patterns in Infinite Binary Words ». Dans Lecture Notes in Computer Science, 107–16. Berlin, Heidelberg : Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45711-9_8.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

hicks, benjamin lee. « Beyond This or That : Challenging the Limits of Binary Language in Elementary Education Through Poetry, Word Art, and Creative Bookmaking ». Dans Teaching, Affirming, and Recognizing Trans and Gender Creative Youth, 81–106. New York : Palgrave Macmillan US, 2016. http://dx.doi.org/10.1057/978-1-137-56766-6_5.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Dabashi, Hamid. « Breaking the Binary ». Dans Being a Muslim in the World, 19–41. New York : Palgrave Macmillan US, 2013. http://dx.doi.org/10.1057/9781137301291_3.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.

Actes de conférences sur le sujet "Binary word"

1

Johnson, Christian. « Binary Encoded Word Mover’s Distance ». Dans Proceedings of the 7th Workshop on Representation Learning for NLP. Stroudsburg, PA, USA : Association for Computational Linguistics, 2022. http://dx.doi.org/10.18653/v1/2022.repl4nlp-1.17.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Zhang, Bin, Sargur N. Srihari et Chen Huang. « Word image retrieval using binary features ». Dans Electronic Imaging 2004, sous la direction de Elisa H. Barney Smith, Jianying Hu et James Allan. SPIE, 2003. http://dx.doi.org/10.1117/12.523968.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Sheen, Spencer, et Jiancheng Lyu. « Median Binary-Connect Method and a Binary Convolutional Neural Network for Word Recognition ». Dans 2019 Data Compression Conference (DCC). IEEE, 2019. http://dx.doi.org/10.1109/dcc.2019.00116.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Martineau, Justin, Tim Finin, Anupam Joshi et Shamit Patel. « Improving binary classification on text problems using differential word features ». Dans Proceeding of the 18th ACM conference. New York, New York, USA : ACM Press, 2009. http://dx.doi.org/10.1145/1645953.1646291.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Mostard, Wouter, Lambert Schomaker et Marco Wiering. « Semantic Preserving Siamese Autoencoder for Binary Quantization of Word Embeddings ». Dans NLPIR 2021 : 2021 5th International Conference on Natural Language Processing and Information Retrieval. New York, NY, USA : ACM, 2021. http://dx.doi.org/10.1145/3508230.3508235.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Puzrla, Premysl, Frédéric Bimbot et Christoph Windheuser. « Distributed binary representations for word recognition by TDNN-DTW hybrid systems ». Dans 4th European Conference on Speech Communication and Technology (Eurospeech 1995). ISCA : ISCA, 1995. http://dx.doi.org/10.21437/eurospeech.1995-412.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Ma, Changyi, et Wenye Li. « Evaluation of Sparse Binary Word Vectors in Chinese-English Machine Translations ». Dans 2021 8th International Conference on Soft Computing & Machine Intelligence (ISCMI). IEEE, 2021. http://dx.doi.org/10.1109/iscmi53840.2021.9654808.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Voyiatzis, Ioannis. « Symmetric transparent on-line BIST of word-organized memories with binary adders ». Dans 2015 20th IEEE European Test Symposium (ETS). IEEE, 2015. http://dx.doi.org/10.1109/ets.2015.7138744.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Gooding, Sian, Ekaterina Kochmar, Advait Sarkar et Alan Blackwell. « Comparative judgments are more consistent than binary classification for labelling word complexity ». Dans Proceedings of the 13th Linguistic Annotation Workshop. Stroudsburg, PA, USA : Association for Computational Linguistics, 2019. http://dx.doi.org/10.18653/v1/w19-4024.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Oudjida, A. K., A. Liacha, M. L. Berrandjia et N. Chaillet. « A new binary arithmetic for finite-word-length linear controllers : MEMS applications ». Dans 2014 9th International Design & Test Symposium (IDT). IEEE, 2014. http://dx.doi.org/10.1109/idt.2014.7038608.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.

Rapports d'organisations sur le sujet "Binary word"

1

Skinner, Corey Michael. Summer term 2018 work with IMC radiative transport in binary stochastic media. Office of Scientific and Technical Information (OSTI), août 2018. http://dx.doi.org/10.2172/1467246.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Colaço, Rajeev, et Stephanie Watson-Grant. A Global Call to Action for Gender-Inclusive Data Collection and Use. RTI Press, décembre 2021. http://dx.doi.org/10.3768/rtipress.2021.pb.0026.2112.

Texte intégral
Résumé :
The global data community has made—and is continuing to make—enormous strides toward collecting, analyzing, and using sex-disaggregated data to improve international development programs. Historically, however, sex-disaggregation has been—and largely continues to be—a binary representation of cisgender female and cisgender male populations. This binary interpretation excludes transgender and gender-nonconforming people and further perpetuates marginalization and discrimination of these populations. In a world where disparities are increasing, it is paramount to highlight and share the experiences of marginalized populations so we are better able to serve all beneficiary needs and end disparities. To this end, we call for a paradigm shift from binary sex-disaggregation to multinomial gender-disaggregation, which is more inclusive and equitable. This call to action is aimed particularly at surveyors, researchers, program implementors, policy makers, and gender rights advocates in both resource-sufficient and resource-constrained settings. The lack of adequate gender-disaggregated data is a universal problem.
Styles APA, Harvard, Vancouver, ISO, etc.
3

Barakat, Sarah, Alexia Pretari et Jaynie Vonk. Centring Gender and Power in Evaluation and Research : Sharing experiences from Oxfam GB's quantitative impact evaluations. Oxfam GB, juillet 2021. http://dx.doi.org/10.21201/2021/7789.

Texte intégral
Résumé :
Bringing a feminist intent to research, monitoring and evaluation practices leads to defining these as tools to contribute to transforming the lives of women, girls and non-binary people, and to bringing about social justice. This has meant putting gender and power at the centre of our practice, which has in turn shaped the technical choices made specifically in quantitative impact evaluations. This paper focuses on describing how these technical choices, as well as ethical considerations, are changed by this feminist intent. The paper also presents the lessons learned and questions raised along the way, which may be useful for MEAL and research practitioners, as well as programme managers. How can we bring intersectionality to the fore? What does it mean to go beyond the gender binary? How can this work be transformative?
Styles APA, Harvard, Vancouver, ISO, etc.
4

Farhi, Edward, et Hartmut Neven. Classification with Quantum Neural Networks on Near Term Processors. Web of Open Science, décembre 2020. http://dx.doi.org/10.37686/qrl.v1i2.80.

Texte intégral
Résumé :
We introduce a quantum neural network, QNN, that can represent labeled data, classical or quantum, and be trained by supervised learning. The quantum circuit consists of a sequence of parameter dependent unitary transformations which acts on an input quantum state. For binary classification a single Pauli operator is measured on a designated readout qubit. The measured output is the quantum neural network’s predictor of the binary label of the input state. We show through classical simulation that parameters can be found that allow the QNN to learn to correctly distinguish the two data sets. We then discuss presenting the data as quantum superpositions of computational basis states corresponding to different label values. Here we show through simulation that learning is possible. We consider using our QNN to learn the label of a general quantum state. By example we show that this can be done. Our work is exploratory and relies on the classical simulation of small quantum systems. The QNN proposed here was designed with near-term quantum processors in mind. Therefore it will be possible to run this QNN on a near term gate model quantum computer where its power can be explored beyond what can be explored with simulation.
Styles APA, Harvard, Vancouver, ISO, etc.
5

Allen, Jeffrey, Robert Moser, Zackery McClelland, Md Mohaiminul Islam et Ling Liu. Phase-field modeling of nonequilibrium solidification processes in additive manufacturing. Engineer Research and Development Center (U.S.), décembre 2021. http://dx.doi.org/10.21079/11681/42605.

Texte intégral
Résumé :
This project models dendrite growth during nonequilibrium solidification of binary alloys using the phase-field method (PFM). Understanding the dendrite formation processes is important because the microstructural features directly influence mechanical properties of the produced parts. An improved understanding of dendrite formation may inform design protocols to achieve optimized process parameters for controlled microstructures and enhanced properties of materials. To this end, this work implements a phase-field model to simulate directional solidification of binary alloys. For applications involving strong nonequilibrium effects, a modified antitrapping current model is incorporated to help eject solute into the liquid phase based on experimentally calibrated, velocity-dependent partitioning coefficient. Investigated allow systems include SCN, Si-As, and Ni-Nb. The SCN alloy is chosen to verify the computational method, and the other two are selected for a parametric study due to their different diffusion properties. The modified antitrapping current model is compared with the classical model in terms of predicted dendrite profiles, tip undercooling, and tip velocity. Solidification parameters—the cooling rate and the strength of anisotropy—are studied to reveal their influences on dendrite growth. Computational results demonstrate effectiveness of the PFM and the modified antitrapping current model in simulating rapid solidification with strong nonequilibrium at the interface.
Styles APA, Harvard, Vancouver, ISO, etc.
6

Li, Cheng, Xi Gao, Steven Rowan, Bryan Hughes, Jeremy Harris et William Rogers. Experimental investigation on the binary/ternary fluidization behavior of Geldart D type spherical LDPE, Geldart D type cylindrical wood and Geldart B type sand particles. Office of Scientific and Technical Information (OSTI), mars 2021. http://dx.doi.org/10.2172/1776642.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Ratmanski, Kiril, et Sergey Vecherin. Resilience in distributed sensor networks. Engineer Research and Development Center (U.S.), octobre 2022. http://dx.doi.org/10.21079/11681/45680.

Texte intégral
Résumé :
With the advent of cheap and available sensors, there is a need for intelligent sensor selection and placement for various purposes. While previous research was focused on the most efficient sensor networks, we present a new mathematical framework for efficient and resilient sensor network installation. Specifically, in this work we formulate and solve a sensor selection and placement problem when network resilience is also a factor in the optimization problem. Our approach is based on the binary linear programming problem. The generic formulation is probabilistic and applicable to any sensor types, line-of-site and non-line-of-site, and any sensor modality. It also incorporates several realistic constraints including finite sensor supply, cost, energy consumption, as well as specified redundancy in coverage areas that require resilience. While the exact solution is computationally prohibitive, we present a fast algorithm that produces a near-optimal solution that can be used in practice. We show how such formulation works on 2D examples, applied to infrared (IR) sensor networks designed to detect and track human presence and movements in a specified coverage area. Analysis of coverage and comparison of sensor placement with and without resilience considerations is also performed.
Styles APA, Harvard, Vancouver, ISO, etc.
8

Mawassi, Munir, Adib Rowhani, Deborah A. Golino, Avichai Perl et Edna Tanne. Rugose Wood Disease of Grapevine, Etiology and Virus Resistance in Transgenic Vines. United States Department of Agriculture, novembre 2003. http://dx.doi.org/10.32747/2003.7586477.bard.

Texte intégral
Résumé :
Rugose wood is a complex disease of grapevines, which occurs in all growing areas. The disease is spread in the field by vector transmission (mealybugs). At least five elongated-phloem- limited viruses are implicated in the various rugose wood disorders. The most fully characterized of these are Grapevine virus A (GV A) and GVB, members of a newly established genus, the vitivirus. GVC, a putative vitivirus, is much less well characterized than GV A or GVB. The information regarding the role of GVC in the etiology and epidemiology of rugose wood is fragmentary and no sequence data for GVC are available. The proposed research is aimed to study the etiology and epidemiology of rugose wood disease, and to construct genetically engineered virus-resistant grapevines. The objectives of our proposed research were to construct transgenic plants with coat protein gene sequences designed to induce post-transcriptional gene silencing (pTGS); to study the epidemiology and etiology of rugose wood disease by cloning and sequencing of GVC; and surveying of rugose wood- associated viruses in Californian and Israeli vineyards. In an attempt to experimentally define the role of the various genes of GV A, we utilized the infectious clone, inserted mutations in every ORF, and studied the effect on viral replication, gene expression, symptoms and viral movement. We explored the production of viral RNAs in a GV A-infected Nicotiana benthamiana herbaceous host, and characterized one nested set of three 5'-terminal sgRNAs of 5.1, 5.5 and 6.0 kb, and another, of three 3'-terminal sgRNAs of 2.2, 1.8 and 1.0 kb that could serve for expression of ORFs 2-3, respectively. Several GV A constructs have been assembled into pCAMBIA 230 I, a binary vector which is used for Angrobacterium mediated transformation: GV A CP gene; two copies of the GV A CP gene arranged in the same antisense orientation; two copies of the GV A CP gene in which the downstream copy is in an antigens orientation; GV A replicase gene; GV A replicase gene plus the 3' UTR sequence; and the full genome of GV A. Experiments for transformation of N. benthamiana and grapevine cell suspension with these constructs have been initiated. Transgenic N. benthamiana plants that contained the CP gene, the replicase gene and the entire genome of GV A were obtained. For grapevine transformation, we have developed efficient protocols for transformation and successfully grapevine plantlets that contained the CP gene and the replicase genes of GV A were obtained. These plants are still under examination for expression of the trans genes. The construction of transgenic plants with GV A sequences will provide, in the long run, a means to control one of the most prevalent viruses associated with grapevines. Our many attempts to produce a cDNA library from the genome of GVC failed. For surveying of rugose wood associated viruses in California vineyards, samples were collected from different grape growing areas and tested by RT-PCR for GV A, GVB and GVD. The results indicated that some of the samples were infected with multiple viruses, but overall, we found higher incidence of GVB and GV A infection in California vineyards and new introduction varieties, respectively. In this research we also conducted studies to increase our understanding of virus - induced rootstock decline and its importance in vineyard productivity. Our results provided supporting evidence that the rootstock response to virus infection depends on the rootstock genotype and the virus type. In general, rootstocks are differ widely in virus susceptibility. Our data indicated that a virus type or its combination with other viruses was responsible in virus-induced rootstock decline. As the results showed, the growth of the rootstocks were severely affected when the combination of more than one virus was present.
Styles APA, Harvard, Vancouver, ISO, etc.
9

Wilson, Thomas E., Avraham A. Levy et Tzvi Tzfira. Controlling Early Stages of DNA Repair for Gene-targeting Enhancement in Plants. United States Department of Agriculture, mars 2012. http://dx.doi.org/10.32747/2012.7697124.bard.

Texte intégral
Résumé :
Gene targeting (GT) is a much needed technology as a tool for plant research and for the precise engineering of crop species. Recent advances in this field have shown that the presence of a DNA double-strand break (DSB) in a genomic locus is critical for the integration of an exogenous DNA molecule introduced into this locus. This integration can occur via either non-homologous end joining (NHEJ) into the break or homologous recombination (HR) between the broken genomic DNA and the introduced vector. A bottleneck for DNA integration via HR is the machinery responsible for homology search and strand invasion. Important proteins in this pathway are Rad51, Rad52 and Rad54. We proposed to combine our respective expertise: on the US side, in the design of zincfinger nucleases (ZFNs) for the induction of DNA DSBs at any desired genomic locus and in the integration of DNA molecules via NHEJ; and on the Israeli side in the HR events, downstream of the DSB, that lead to homology search and strand invasion. We sought to test three major pathways of targeted DNA integration: (i) integration by NHEJ into DSBs induced at desired sites by specially designed ZFNs; (ii) integration into DSBs induced at desired sites combined with the use of Rad51, Rad52 and Rad54 proteins to maximize the chances for efficient and precise HR-mediated vector insertion; (iii) stimulation of HR by Rad51, Rad52 and Rad54 in the absence of DSB induction. We also proposed to study the formation of dsT-DNA molecules during the transformation of plant cells. dsT-DNA molecules are an important substrate for HR and NHEJ-mediatedGT, yet the mode of their formation from single stranded T-DNA molecules is still obscure. In addition we sought to develop a system for assembly of multi-transgene binary vectors by using ZFNs. The latter may facilitate the production of binary vectors that may be ready for genome editing in transgenic plants. ZFNs were proposed for the induction of DSBs in genomic targets, namely, the FtsH2 gene whose loss of function can easily be identified in somatic tissues as white sectors, and the Cruciferin locus whose targeting by a GFP or RFP reporter vectors can give rise to fluorescent seeds. ZFNs were also proposed for the induction of DSBs in artificial targets and for assembly of multi-gene vectors. We finally sought to address two important cell types in terms of relevance to plant transformation, namely GT of germinal (egg) cells by floral dipping, and GT in somatic cells by root and leave transformation. To be successful, we made use of novel optimized expression cassettes that enable coexpression of all of the genes of interest (ZFNs and Rad genes) in the right tissues (egg or root cells) at the right time, namely when the GT vector is delivered into the cells. Methods were proposed for investigating the complementation of T-strands to dsDNA molecules in living plant cells. During the course of this research, we (i) designed, assembled and tested, in vitro, a pair of new ZFNs capable of targeting the Cruciferin gene, (ii) produced transgenic plants which expresses for ZFN monomers for targeting of the FtsH2 gene. Expression of these enzymes is controlled by constitutive or heat shock induced promoters, (iii) produced a large population of transgenic Arabidopsis lines in which mutated mGUS gene was incorporated into different genomic locations, (iv) designed a system for egg-cell-specific expression of ZFNs and RAD genes and initiate GT experiments, (v) demonstrated that we can achieve NHEJ-mediated gene replacement in plant cells (vi) developed a system for ZFN and homing endonuclease-mediated assembly of multigene plant transformation vectors and (vii) explored the mechanism of dsTDNA formation in plant cells. This work has substantially advanced our understanding of the mechanisms of DNA integration into plants and furthered the development of important new tools for GT in plants.
Styles APA, Harvard, Vancouver, ISO, etc.
10

Miles, Gaines E., Yael Edan, F. Tom Turpin, Avshalom Grinstein, Thomas N. Jordan, Amots Hetzroni, Stephen C. Weller, Marvin M. Schreiber et Okan K. Ersoy. Expert Sensor for Site Specification Application of Agricultural Chemicals. United States Department of Agriculture, août 1995. http://dx.doi.org/10.32747/1995.7570567.bard.

Texte intégral
Résumé :
In this work multispectral reflectance images are used in conjunction with a neural network classifier for the purpose of detecting and classifying weeds under real field conditions. Multispectral reflectance images which contained different combinations of weeds and crops were taken under actual field conditions. This multispectral reflectance information was used to develop algorithms that could segment the plants from the background as well as classify them into weeds or crops. In order to segment the plants from the background the multispectrial reflectance of plants and background were studied and a relationship was derived. It was found that using a ratio of two wavelenght reflectance images (750nm and 670nm) it was possible to segment the plants from the background. Once ths was accomplished it was then possible to classify the segmented images into weed or crop by use of the neural network. The neural network developed for this work is a modification of the standard learning vector quantization algorithm. This neural network was modified by replacing the time-varying adaptation gain with a constant adaptation gain and a binary reinforcement function. This improved accuracy and training time as well as introducing several new properties such as hill climbing and momentum addition. The network was trained and tested with different wavelength combinations in order to find the best results. Finally, the results of the classifier were evaluated using a pixel based method and a block based method. In the pixel based method every single pixel is evaluated to test whether it was classified correctly or not and the best weed classification results were 81% and its associated crop classification accuracy is 57%. In the block based classification method, the image was divided into blocks and each block was evaluated to determine whether they contained weeds or not. Different block sizes and thesholds were tested. The best results for this method were 97% for a block size of 8 inches and a pixel threshold of 60. A simulation model was developed to 1) quantify the effectiveness of a site-specific sprayer, 2) evaluate influence of diffeent design parameters on efficiency of the site-specific sprayer. In each iteration of this model, infected areas (weed patches) in the field were randomly generated and the amount of required herbicides for spraying these areas were calculated. The effectiveness of the sprayer was estimated for different stain sizes, nozzle types (conic and flat), nozzle sizes and stain detection levels of the identification system. Simulation results indicated that the flat nozzle is much more effective as compared to the conic nozzle and its relative efficiency is greater for small nozzle sizes. By using a site-specific sprayer, the average ratio between the spraying areas and the stain areas is about 1.1 to 1.8 which can save up to 92% of herbicides, especially when the proportion of the stain areas is small.
Styles APA, Harvard, Vancouver, ISO, etc.
Vous pouvez également être intéressé par les bibliographies sur le sujet « Binary word » pour d’autres types de sources :
Articles de revues Thèses Livres
Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!

Vers la bibliographie