Bibliographies thématiques / Binary word / Articles de revues

Articles de revues sur le sujet « Binary word »

Pour voir les autres types de publications sur ce sujet consultez le lien suivant : 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 :

Consultez les 50 meilleurs articles de revues pour votre recherche 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.

Parcourez les articles de revues sur diverses disciplines et organisez correctement votre bibliographie.

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.
11

Anh, Vo Ngoc, et Alistair Moffat. « Inverted Index Compression Using Word-Aligned Binary Codes ». Information Retrieval 8, no 1 (janvier 2005) : 151–66. http://dx.doi.org/10.1023/b:inrt.0000048490.99518.5c.

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

CASSAIGNE, JULIEN, GWÉNAËL RICHOMME, KALLE SAARI et LUCA Q. ZAMBONI. « AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY ». International Journal of Foundations of Computer Science 22, no 04 (juin 2011) : 905–20. http://dx.doi.org/10.1142/s0129054111008489.

Texte intégral
Résumé :
The notion of Abelian complexity of infinite words was recently used by the three last authors to investigate various Abelian properties of words. In particular, using van der Waerden's theorem, they proved that if a word avoids Abelian k-powers for some integer k, then its Abelian complexity is unbounded. This suggests the following question: How frequently do Abelian k-powers occur in a word having bounded Abelian complexity? In particular, does every uniformly recurrent word having bounded Abelian complexity begin in an Abelian k-power? While this is true for various classes of uniformly recurrent words, including for example the class of all Sturmian words, in this paper we show the existence of uniformly recurrent binary words, having bounded Abelian complexity, which admit an infinite number of suffixes which do not begin in an Abelian square. We also show that the shift orbit closure of any infinite binary overlap-free word contains a word which avoids Abelian cubes in the beginning. We also consider the effect of morphisms on Abelian complexity and show that the morphic image of a word having bounded Abelian complexity has bounded Abelian complexity. Finally, we give an open problem on avoidability of Abelian squares in infinite binary words and show that it is equivalent to a well-known open problem of Pirillo–Varricchio and Halbeisen–Hungerbühler.
Styles APA, Harvard, Vancouver, ISO, etc.
13

CHEN, XUE, GUANGDA HU et XIAOMING SUN. « THE COMPLEXITY OF WORD CIRCUITS ». Discrete Mathematics, Algorithms and Applications 02, no 04 (décembre 2010) : 483–92. http://dx.doi.org/10.1142/s1793830910000826.

Texte intégral
Résumé :
A word circuit [1] is a directed acyclic graph in which each edge holds a w-bit word (i.e., some x ∈ {0, 1}w) and each node is a gate computing some binary function g : {0, 1}w × {0, 1}w → {0, 1}w. The following problem was studied in [1]: How many binary gates are needed to compute a ternary function f : ({0, 1}w)3 → {0, 1}w. They proved that (2 + o(1))2w binary gates are enough for any ternary function, and there exists a ternary function which requires word circuits of size (1 - o(1))2w. One of the open problems in [1] is to get these bounds tight within a low order term. In this paper we solved this problem by constructing new word circuits for ternary functions of size (1 + o(1))2w. We investigate the problem in a general setting: How many k-input word gates are needed for computing an n-input word function f : ({0, 1}w)n → {0, 1}w (here n ≥ k). We show that for any fixed n, (1 - o(1))2(n - k)w basic gates are necessary and (1 + o(1))2(n - k)w gates are sufficient (assume w is sufficiently large). Since word circuit is a natural generalization of boolean circuit, we also consider the case when w is a constant and the number of inputs n is sufficiently large. We show that [Formula: see text] basic gates are necessary and sufficient in this case.
Styles APA, Harvard, Vancouver, ISO, etc.
14

Bera, Somnath, Sastha Sriram, Atulya K. Nagar, Linqiang Pan et K. G. Subramanian. « Algebraic Properties of Parikh Matrices of Binary Picture Arrays ». Journal of Mathematics 2020 (29 juin 2020) : 1–7. http://dx.doi.org/10.1155/2020/3236405.

Texte intégral
Résumé :
A word is a finite sequence of symbols. Parikh matrix of a word is an upper triangular matrix with ones in the main diagonal and nonnegative integers above the main diagonal which are counts of certain scattered subwords in the word. On the other hand, a picture array, which is a rectangular arrangement of symbols, is an extension of the notion of a word to two dimensions. Parikh matrices associated with a picture array have been introduced, and their properties have been studied. Here, we obtain certain algebraic properties of Parikh matrices of binary picture arrays based on the notions of power, fairness, and a restricted shuffle operator extending the corresponding notions studied in the case of words. We also obtain properties of Parikh matrices of arrays formed by certain geometric operations.
Styles APA, Harvard, Vancouver, ISO, etc.
15

Du, Chen Fei, et Jeffrey Shallit. « Similarity density of the Thue-Morse word with overlap-free infinite binary words ». Electronic Proceedings in Theoretical Computer Science 151 (21 mai 2014) : 231–45. http://dx.doi.org/10.4204/eptcs.151.16.

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

Blanchet-Sadri, F., Andrew Lohr et Shane Scott. « Computing the partial word avoidability indices of binary patterns ». Journal of Discrete Algorithms 23 (novembre 2013) : 113–18. http://dx.doi.org/10.1016/j.jda.2013.06.007.

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

El-Qawasmeh, Eyas. « Word prediction using a clustered optimal binary search tree ». Information Processing Letters 92, no 5 (décembre 2004) : 257–65. http://dx.doi.org/10.1016/j.ipl.2004.08.006.

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

Guimin Huang, Guimin Huang, et Maolin Li Guimin Huang. « An Errors Correction Model for the Errors of Non-word and Real-word in English Composition ». 電腦學刊 33, no 1 (février 2022) : 138–50. http://dx.doi.org/10.53106/199115992022023301013.

Texte intégral
Résumé :
<p>In the procedure from composing English, it is inevitable to face the phenomenon of word writing errors. In recent years, English composition automatic correcting system has attracted much attention. However, the precision of the existing word errors correcting system is vague generalization. So as to move forward the accuracy of checking and correcting word errors, this paper designs a word errors correction model based on natural language processing technology. This model designs phoneme matching method based on an improved IDM algorithm, and combined with a non-word input errors correction method based on character distance. The accuracy of correcting non-word errors in this model reached 86.5%. The study also proposes a real-word errors correction method, which is implemented basing on the real-word confusion set and combining the binary statistical model and the GloVe word vector model, improving the real-word errors correction method based on feature annotation of the real-word confusion set, with an accuracy of 77.9%. </p> <p>&nbsp;</p>
Styles APA, Harvard, Vancouver, ISO, etc.
19

Kotlyarov, Nikita V. « Existence of words over a binary alphabet free from squares with mismatches ». Discrete Mathematics and Applications 29, no 3 (26 juin 2019) : 175–88. http://dx.doi.org/10.1515/dma-2019-0016.

Texte intégral
Résumé :
Abstract The paper is concerned with the problem of existence of periodic structures in words from formal languages. Squares (that is, fragments of the form xx, where x is an arbitrary word) and Δ-squares (that is, fragments of the form xy, where a word x differs from a word y by at most Δ letters) are considered as periodic structures. We show that in a binary alphabet there exist arbitrarily long words free from Δ-squares with length at most 4Δ+4. In particular, a method of construction of such words for any Δ is given.
Styles APA, Harvard, Vancouver, ISO, etc.
20

Moshkov, Mikhail. « Decision Trees for Binary Subword-Closed Languages ». Entropy 25, no 2 (14 février 2023) : 349. http://dx.doi.org/10.3390/e25020349.

Texte intégral
Résumé :
In this paper, we study arbitrary subword-closed languages over the alphabet {0,1} (binary subword-closed languages). For the set of words L(n) of the length n belonging to a binary subword-closed language L, we investigate the depth of the decision trees solving the recognition and the membership problems deterministically and nondeterministically. In the case of the recognition problem, for a given word from L(n), we should recognize it using queries, each of which, for some i∈{1,…,n}, returns the ith letter of the word. In the case of the membership problem, for a given word over the alphabet {0,1} of the length n, we should recognize if it belongs to the set L(n) using the same queries. With the growth of n, the minimum depth of the decision trees solving the problem of recognition deterministically is either bounded from above by a constant or grows as a logarithm, or linearly. For other types of trees and problems (decision trees solving the problem of recognition nondeterministically and decision trees solving the membership problem deterministically and nondeterministically), with the growth of n, the minimum depth of the decision trees is either bounded from above by a constant or grows linearly. We study the joint behavior of the minimum depths of the considered four types of decision trees and describe five complexity classes of binary subword-closed languages.
Styles APA, Harvard, Vancouver, ISO, etc.
21

Lee, Suwon. « Binary Visual Word Generation Techniques for A Fast Image Search ». Journal of KIISE 44, no 12 (31 décembre 2017) : 1313–18. http://dx.doi.org/10.5626/jok.2017.44.12.1313.

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

Cotter, D., et S. C. Cotter. « Algorithm for binary word recognition suited to ultrafast nonlinear optics ». Electronics Letters 29, no 11 (27 mai 1993) : 945–47. http://dx.doi.org/10.1049/el:19930630.

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

Kawabata, Takeshi, et Junta Doi. « Improvement of protein secondary structure prediction using binary word encoding ». Proteins : Structure, Function, and Genetics 27, no 1 (janvier 1997) : 36–46. http://dx.doi.org/10.1002/(sici)1097-0134(199701)27:1<36 ::aid-prot5>3.0.co;2-l.

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

Andreev, Andrey, et Nikolay Kirov. « Hausdorff Distances for Searching in Binary Text Images ». Serdica Journal of Computing 3, no 1 (15 mai 2009) : 23–46. http://dx.doi.org/10.55630/sjc.2009.3.23-46.

Texte intégral
Résumé :
Hausdorff distance (HD) seems the most efficient instrument for measuring how far two compact non-empty subsets of a metric space are from each other. This paper considers the possibilities provided by HD and some of its modifications used recently by many authors for resemblance between binary text images. Summarizing part of the existing word image matching methods, relied on HD, we investigate a new similar parameterized method which contains almost all of them as particular cases. Numerical experiments for searching words in binary text images are carried out with 333 pages of old Bulgarian typewritten text, 200 printed pages of Bulgarian Chrestomathy from year 1884, and 200 handwritten pages of Slavonic manuscript from year 1574. They outline how the parameters must be set in order to use the advantages of the proposed method for the purposes of word matching in scanned document images.
Styles APA, Harvard, Vancouver, ISO, etc.
25

Dolce, Francesco, et Edita Pelantová. « On Morphisms Preserving Palindromic Richness ». Fundamenta Informaticae 185, no 1 (18 mars 2022) : 1–25. http://dx.doi.org/10.3233/fi-222102.

Texte intégral
Résumé :
It is known that each word of length n contains at most n + 1 distinct palindromes. A finite rich word is a word with maximal number of palindromic factors. The definition of palindromic richness can be naturally extended to infinite words. Sturmian words and Rote complementary symmetric sequences form two classes of binary rich words, while episturmian words and words coding symmetric d-interval exchange transformations give us other examples on larger alphabets. In this paper we look for morphisms of the free monoid, which allow us to construct new rich words from already known rich words. We focus on morphisms in Class Pret. This class contains morphisms injective on the alphabet and satisfying a particular palindromicity property: for every morphism ϕ in the class there exists a palindrome w such that ϕ(a)w is a first complete return word to w for each letter a. We characterize Pret morphisms which preserve richness over a binary alphabet. We also study marked Pret morphisms acting on alphabets with more letters. In particular we show that every Arnoux-Rauzy morphism is conjugated to a morphism in Class Pret and that it preserves richness.
Styles APA, Harvard, Vancouver, ISO, etc.
26

Crvenković, Siniša, et Igor Dolinka. « A Variety with Undecidable Equational Theory and Solvable Word Problem ». International Journal of Algebra and Computation 08, no 06 (décembre 1998) : 625–30. http://dx.doi.org/10.1142/s0218196798000302.

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

Wang, Xiao Feng, et Hai Jian Li. « Research on Information Hiding Method Based on Word Text ». Advanced Materials Research 926-930 (mai 2014) : 2815–18. http://dx.doi.org/10.4028/www.scientific.net/amr.926-930.2815.

Texte intégral
Résumé :
This paper proposes an information hiding method based on word text, according to the theory of the human eye cones for the color sensitivity; the human eye is least sensitive to blue. I change the lowest two bits of G component in the carrier text character RGB color value, change the lowest two bits of R component in the carrier text character RGB color value, and change the lowest four bits of B component in the carrier text character RGB color value, So that each carrier text character can hide 8 bits binary information. RGB color value of character underline can hide 24 bits information; the combination of these two methods can hide 32 bits binary information. After testing, the results show that the algorithm hiding rate is high, the algorithm is stable and easy to implement, has a certain application value.
Styles APA, Harvard, Vancouver, ISO, etc.
28

Madry, Małgorzata. « λ-Representability of Integer, Word and Tree Functions ». Fundamenta Informaticae 17, no 3 (1 septembre 1992) : 253–70. http://dx.doi.org/10.3233/fi-1992-17306.

Texte intégral
Résumé :
Six λ-languages over function-types between algebras B, N and Υ are considered. Type N = ( 0 → 0 ) → ( 0 → 0 ) is called a non-negative integers type; B = ( 0 → 0 ) → ( ( 0 → 0 ) → ( 0 → 0 ) ) is called a binary words type; Υ = ( 0 → ( 0 → 0 ) ) → ( 0 → 0 ) is called a binary trees type. These associations come from the isomorphism between the types and corresponding algebraic structures. Closed terms whose types are the above mentioned function-types represent unary functions of appropriate types. The problem is: what class of functions is represented by the closed terms of the examined type. It is proved that for B → N, N → B, Υ → N, Υ → B there exists a finite base of functions such that any λ-definable function is some combination of the base functions. The algorithm which, for every closed term, returns the function in the form of a combination of the base functions is given. For two other types, B → Υ and N → Υ, a method of constructing λ-representable functions using primitive recursion is shown.
Styles APA, Harvard, Vancouver, ISO, etc.
29

MARCHÉ, CLAUDE. « THE WORD PROBLEM OF ACD-GROUND THEORIES IS UNDECIDABLE ». International Journal of Foundations of Computer Science 03, no 01 (mars 1992) : 81–92. http://dx.doi.org/10.1142/s0129054192000085.

Texte intégral
Résumé :
We prove that there exists an ACD-ground theory, i.e., an equational theory defined by a set of ground equations plus the associativity and commutativity of two binary symbols * and +, and the distributivity of * over +, for which the word problem is undecidable.
Styles APA, Harvard, Vancouver, ISO, etc.
30

Bajić, Dragana, Goran Dimić et Nikola Zogović. « Splitting Sequences for Coding and Hybrid Incremental ARQ with Fragment Retransmission ». Mathematics 9, no 20 (17 octobre 2021) : 2620. http://dx.doi.org/10.3390/math9202620.

Texte intégral
Résumé :
This paper proposes a code defined on a finite ring ℤpM, where pM = 2m−1 is a Mersenne prime, and m is a binary size of ring elements. The code is based on a splitting sequence (splitting set) S, defined for the given multiplier set E=±20, ±21,…, ±2m−1. The elements of E correspond to the weights of binary error patterns that can be corrected, with the bidirectional single-bit error being the representative that occurs the most. The splitting set splits the code-word into sub-words, which inspired the name splitting code. Each sub-word, provided with auxiliary control symbols that are a byproduct of the coding procedure, corrects a single symbol error. The code can be defined, with some constraints, for general Mersenne numbers as well, while the multiplier set can be adjusted for adjacent binary errors correction. The application proposed for this code is a hybrid three-stage incremental ARQ procedure that transmits the code-word in the first stage, auxiliary control symbols in the second stage, and retransmits the sub-words detected as incorrect in the third stage. At each stage, error correction can be turned on or off, keeping both the retransmission rate and residual error rate at a low level.
Styles APA, Harvard, Vancouver, ISO, etc.
31

Jecker, Ismaël, et Emmanuel Filiot. « Multi-Sequential Word Relations ». International Journal of Foundations of Computer Science 29, no 02 (février 2018) : 271–95. http://dx.doi.org/10.1142/s0129054118400075.

Texte intégral
Résumé :
Rational relations are binary relations of finite words that are realised by non-deterministic finite state transducers (NFT). A multi-sequential relation is a rational relation which is equal to a finite union of (graphs) of partial sequential functions, i.e. functions realised by input-deterministic transducers. The particular case of multi-sequential functions was studied by Choffrut and Schützenberger who proved that given a rational function (as a transducer), it is decidable whether it is multi-sequential. Their procedure is based on an effective characterisation of unambiguous transducers that do not define multi-sequential functions, that we call the fork property. In this paper, we show that the fork property also characterises the class of transducers that do not define multi-sequential relations. Moreover, we prove that the fork property can be decided in PTime. This leads to a PTime procedure which, given a transducer, decides whether it defines a multi-sequential relation.
Styles APA, Harvard, Vancouver, ISO, etc.
32

Zhang, Shi Ru, Xiao Chun Meng, Xin Fu Liu et Wen Yuan Chen. « A Digital Text Watermarking for Word Document ». Applied Mechanics and Materials 614 (septembre 2014) : 347–51. http://dx.doi.org/10.4028/www.scientific.net/amm.614.347.

Texte intégral
Résumé :
Text documents are the most dominant medium being used in the digital time and they require complete protection. A text watermarking algorithm based on Word Software (Microsoft Word or WPS Word) for document protection and copyright protection is proposed. The complete imperceptibility is achieved by the Font.Hidden attribute of Office Word. We implement this algorithm in C++ language and use a binary image as the watermark in the embedding algorithm. Experimental results demonstrate that this algorithm has completely imperceptibility, high robustness and can authenticate the copyright.
Styles APA, Harvard, Vancouver, ISO, etc.
33

Zacicev, M. V., et D. D. Repovs. « Identities on algebras and combinatorial properties of binary words ». Доклады Академии наук 489, no 5 (20 décembre 2019) : 449–51. http://dx.doi.org/10.31857/s0869-56524895449-451.

Texte intégral
Résumé :
We consider polynomial identities and codimension growth of nonassociative algebras over a field of characte-ristics zero. We offer new approach which allows to construct nonassociative algebras starting from a given infinite binary word. The sequence of codimensions of such an algebra is closeely connected with combinatorial complexity of the defining word. These constructions give new examples of algebras with abnormal codimension growth. The first important achievement is that our algebras are finitely generated. The second one is that asymptotic behavior of codimension sequences is quite different unlike all previous examples.
Styles APA, Harvard, Vancouver, ISO, etc.
34

Ago, Kristina, et Bojan Bašić. « On a theorem concerning partially overlapping subpalindromes of a binary word ». Advances in Applied Mathematics 134 (mars 2022) : 102302. http://dx.doi.org/10.1016/j.aam.2021.102302.

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

Rivest, Ronald L. « The invertibility of the XOR of rotations of a binary word ». International Journal of Computer Mathematics 88, no 2 (4 décembre 2010) : 281–84. http://dx.doi.org/10.1080/00207161003596708.

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

Gao, Jun, et XiXian Chen. « Probabilistic word classification based on a context-sensitive binary tree method ». Computer Speech & ; Language 11, no 4 (octobre 1997) : 307–20. http://dx.doi.org/10.1006/csla.1997.0033.

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

NAKANO, KOJI. « PREFIX-SUMS ALGORITHMS ON RECONFIGURABLE MESHES ». Parallel Processing Letters 05, no 01 (mars 1995) : 23–35. http://dx.doi.org/10.1142/s0129626495000047.

Texte intégral
Résumé :
This paper shows that the prefix-sums of n binary values can be computed in [Formula: see text] time on an n × m reconfigurable mesh of the word model. It also shows that prefix-sums of n binary values can be computed in [Formula: see text] time on an n × m reconfigurable mesh of the word model if the reconfigurable mesh has communication capability that allows simultaneous sending to the same bus.
Styles APA, Harvard, Vancouver, ISO, etc.
38

Auinger, Karl. « The word problem for the bifree combinatorial strict regular semigroup ». Mathematical Proceedings of the Cambridge Philosophical Society 113, no 3 (mai 1993) : 519–33. http://dx.doi.org/10.1017/s0305004100076179.

Texte intégral
Résumé :
AbstractA class of regular semigroups closed under taking direct products, regular subsemigroups and homomorphic images is ane(xistence)-variety of regular semigroups. The classof all combinatorial strict regular semigroups is thee-variety generated by the five element non-orthodox completely 0-simple semigroup and consists of all regular subdirect products of combinatorial completely 0-simple semigroups and/or rectangular bands. The bifree objecton the setXinis the natural concept of a ‘free object’ in the class.is generated by the setXand the set of formal inversesX′ under the two binary operations of multiplication · and forming the sandwich element ∧A. Henceis a homomorphic image of the absolutely free algebraof type 〈2, 2〉 generated by X ∪X′. In this paper we shall describe the associated congruence onF〈2, 2〉(X∪X′) and construct a model ofin terms of sets and binary relations. As an application, a model of the free strict pseudosemilattice on a setXis obtained.
Styles APA, Harvard, Vancouver, ISO, etc.
39

Al-Jarrah, Ahmad, Amer Albsharat et Mohammad Al-Jarrah. « Word-based encryption algorithm using dictionary indexing with variable encryption key length ». International Journal of Electrical and Computer Engineering (IJECE) 12, no 1 (1 février 2022) : 669. http://dx.doi.org/10.11591/ijece.v12i1.pp669-683.

Texte intégral
Résumé :
<p>This paper proposes a new algorithm for text encryption utilizing English words as a unit of encoding. The algorithm vanishes any feature that could be used to reveal the encrypted text through adopting variable code lengths for the English words, utilizing a variable-length encryption key, applying two-dimensional binary shuffling techniques at the bit level, and utilizing four binary logical operations with randomized shuffling inputs. English words that alphabetically sorted are divided into four lookup tables where each word has assigned an index. The strength of the proposed algorithm concluded from having two major components. Firstly, each lookup table utilizes different index sizes, and all index sizes are not multiples of bytes. Secondly, the shuffling operations are conducted on a two-dimensional binary matrix with variable length. Lastly, the parameters of the shuffling operation are randomized based on a randomly selected encryption key with varying size. Thus, the shuffling operations move adjacent bits away in a randomized fashion. Definitively, the proposed algorithm vanishes any signature or any statistical features of the original message. Moreover, the proposed algorithm reduces the size of the encrypted message as an additive advantage which is achieved through utilizing the smallest possible index size for each lookup table.</p>
Styles APA, Harvard, Vancouver, ISO, etc.
40

Dryer, Matthew S. « On the Six-Way Word Order Typology ». Studies in Language 21, no 1 (1 janvier 1997) : 69–103. http://dx.doi.org/10.1075/sl.21.1.04dry.

Texte intégral
Résumé :
A number of arguments are given against the traditional word order typology based on the six types SOV, SVO, VSO, VOS, OVS, and OSV, and in favour of an alternative typology based on two binary parameters OV vs. VO and SV vs. VS. The arguments given include ones based on various advantages of collapsing VSO and VOS into a single type, the infrequency of clauses containing a noun subject and noun object, the value of isolating the more predictive parameter of OV vs. VO, and the fact that the traditional typology ignores the position of intransitive subjects.
Styles APA, Harvard, Vancouver, ISO, etc.
41

Roca, Iggy. « On the sources of word prosody ». Phonology 9, no 2 (août 1992) : 267–87. http://dx.doi.org/10.1017/s0952675700001615.

Texte intégral
Résumé :
In SPE (Chomsky & Halle 1968), stress was formalised as a distinctive feature, on a par with [consonantal], [continuant] and so on. Serious problems with this approach were pinpointed in Liberman & Prince (1977). Building on Liberman (1975), these authors conceived of stress as the product of a syllable-grounded network of hierarchical relations. In particular, they argued that, in any given domain (say, a word), syllables are prosodically organised into layers of binary constituents, each constituent made up of a strong element, construable as the ‘head’, and its weak sister. A path linking heads uninterruptedly leads from the tree root to the most salient, and thus primary stressed, syllable of the domain, which they named the ‘designated terminal element’.
Styles APA, Harvard, Vancouver, ISO, etc.
42

Forsyth, Michael, Amlesh Jayakumar, Jarkko Peltomäki et Jeffrey Shallit. « Remarks on Privileged Words ». International Journal of Foundations of Computer Science 27, no 04 (juin 2016) : 431–42. http://dx.doi.org/10.1142/s0129054116500088.

Texte intégral
Résumé :
We discuss the notion of privileged word, recently introduced by Kellendonk, Lenz and Savinien. A word w is privileged if it is of length ≤ 1, or has a privileged border that occurs exactly twice in w. We prove the following results: (1) if wk is privileged for some [Formula: see text], then wj is privileged for all [Formula: see text]; (2) the language of privileged words is not context-free; (3) there is a linear-time algorithm to check if a given word is privileged; and (4) there are at least [Formula: see text] privileged binary words of length n.
Styles APA, Harvard, Vancouver, ISO, etc.
43

Baril, Jean-Luc, Sergey Kirgizov et Vincent Vajnovszki. « Asymptotic bit frequency in Fibonacci words ». Pure Mathematics and Applications 30, no 1 (1 juin 2022) : 23–30. http://dx.doi.org/10.2478/puma-2022-0005.

Texte intégral
Résumé :
Abstract It is known that binary words containing no k consecutive 1s are enumerated by k-step Fibonacci numbers. In this note we discuss the expected value of a random bit in a random word of length n having this property.
Styles APA, Harvard, Vancouver, ISO, etc.
44

Du, Chen Fei, Jeffrey Shallit et Arseny M. Shur. « Optimal Bounds for the Similarity Density of the Thue-Morse Word with Overlap-Free and 73-Power-Free Infinite Binary Words ». International Journal of Foundations of Computer Science 26, no 08 (décembre 2015) : 1147–65. http://dx.doi.org/10.1142/s012905411540016x.

Texte intégral
Résumé :
We consider a measure of similarity for infinite words that generalizes the usual number-theoretic notion of asymptotic or natural density for subsets of natural numbers. We show that every [Formula: see text]-power-free infinite binary word, other than the Thue-Morse word t and its complement [Formula: see text], has this measure of similarity with t between [Formula: see text] and [Formula: see text], and that this bound is optimal in a strong sense just for the class of overlap-free words. This is a generalization of a classical 1927 result of Kurt Mahler.
Styles APA, Harvard, Vancouver, ISO, etc.
45

Yasuda, Seigou, Toshiki Kawamoto, Takashi Ariyoshi, Syouji Kuriki, Jun-ichiroh Fujimoto et Tomofumi Nakatani. « Development of a Spoken Word Recognition System using Binary Time-Spectrum Pattern ». IEEJ Transactions on Electronics, Information and Systems 108, no 10 (1988) : 858–65. http://dx.doi.org/10.1541/ieejeiss1987.108.10_858.

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

Thomas, Nobin, Lisa Mathew, Sastha Sriram, Atulya K. Nagar et K. G. Subramanian. « Certain Distance-Based Topological Indices of Parikh Word Representable Graphs ». Journal of Mathematics 2021 (25 mai 2021) : 1–7. http://dx.doi.org/10.1155/2021/5567663.

Texte intégral
Résumé :
Relating graph structures with words which are finite sequences of symbols, Parikh word representable graphs (PWRGs) were introduced. On the other hand, in chemical graph theory, graphs have been associated with molecular structures. Also, several topological indices have been defined in terms of graph parameters and studied for different classes of graphs. In this study, we derive expressions for computing certain topological indices of PWRGs of binary core words, thereby enriching the study of PWRGs.
Styles APA, Harvard, Vancouver, ISO, etc.
47

Dodel, Jean-Pierre, et Rajjan Shinghal. « Recognition of Handwritten Worded Amounts on Checks Using Symbolic and Neural Classifiers ». International Journal of Pattern Recognition and Artificial Intelligence 11, no 05 (août 1997) : 735–55. http://dx.doi.org/10.1142/s0218001497000329.

Texte intégral
Résumé :
This paper proposes symbolic and neural classifiers to read unconstrained handwritten worded amounts in bankchecks. Features are extracted from the binary image of the worded amount. Depending on the features extracted, some words are recognized entirely symbolically, some words entirely neurally, and the remaining both symbolically and neurally. Results of experiments at word level and check level are provided.
Styles APA, Harvard, Vancouver, ISO, etc.
48

MIGNOSI, FILIPPO, et ANTONIO RESTIVO. « A NEW COMPLEXITY FUNCTION FOR WORDS BASED ON PERIODICITY ». International Journal of Algebra and Computation 23, no 04 (juin 2013) : 963–87. http://dx.doi.org/10.1142/s0218196713400080.

Texte intégral
Résumé :
Motivated by the extension of the critical factorization theorem to infinite words, we study the (local) periodicity function, i.e. the function that, for any position in a word, gives the size of the shortest square centered in that position. We prove that this function characterizes any binary word up to exchange of letters. We then introduce a new complexity function for words (the periodicity complexity) that, for any position in the word, gives the average value of the periodicity function up to that position. The new complexity function is independent from the other commonly used complexity measures as, for instance, the factor complexity. Indeed, whereas any infinite word with bounded factor complexity is periodic, we will show a recurrent non-periodic word with bounded periodicity complexity. Further, we will prove that the periodicity complexity function grows as Θ( log n) in the case of the Fibonacci infinite word and that it grows as Θ(n) in the case of the Thue–Morse word. Finally, we will show examples of infinite recurrent words with arbitrary high periodicity complexity.
Styles APA, Harvard, Vancouver, ISO, etc.
49

SALOMAA, ARTO, et SHENG YU. « SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES ». International Journal of Foundations of Computer Science 21, no 01 (février 2010) : 91–111. http://dx.doi.org/10.1142/s0129054110007155.

Texte intégral
Résumé :
We investigate the number of occurrences of a word u as a (scattered) subword of a word w. The notion of a Parikh matrix, recently introduced, is a basic tool in this investigation. In general, several words are associated with a Parikh matrix. The ambiguity can be resolved by associating a unique word called the Lyndon image to each Parikh matrix. In this paper we will investigate properties of Lyndon images and the corresponding questions of ambiguity. We give an exhaustive characterization in the case of a binary alphabet. Our main results in the general case deal with the comparison of unambiguous words and Lyndon images, algorithms for constructing Lyndon images, as well as classes of words with the same Parikh matrix, obtained by circular variance.
Styles APA, Harvard, Vancouver, ISO, etc.
50

Malakar, Samir, Manosij Ghosh, Ram Sarkar et Mita Nasipuri. « Development of a Two-Stage Segmentation-Based Word Searching Method for Handwritten Document Images ». Journal of Intelligent Systems 29, no 1 (4 juillet 2018) : 719–35. http://dx.doi.org/10.1515/jisys-2017-0384.

Texte intégral
Résumé :
Abstract Word searching or keyword spotting is an important research problem in the domain of document image processing. The solution to the said problem for handwritten documents is more challenging than for printed ones. In this work, a two-stage word searching schema is introduced. In the first stage, all the irrelevant words with respect to a search word are filtered out from the document page image. This is carried out using a zonal feature vector, called pre-selection feature vector, along with a rule-based binary classification method. In the next step, a holistic word recognition paradigm is used to confirm a pre-selected word as search word. To accomplish this, a modified histogram of oriented gradients-based feature descriptor is combined with a topological feature vector. This method is experimented on a QUWI English database, which is freely available through the International Conference on Document Analysis and Recognition 2015 competition entitled “Writer Identification and Gender Classification.” This technique not only provides good retrieval performance in terms of recall, precision, and F-measure scores, but it also outperforms some state-of-the-art methods.
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 :
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