作者: GUEER 時間: 2025-3-21 22:30
Representations of Linear Dynamic Systems,lowing direct implementations when the input scanner is deterministic. Alternatively, one may use more human friendly descriptions based on some simple basic transformations (e.g., copy, duplicate, erase, reverse) and various combinators such as function composition or extensions of regular operatio作者: 蔓藤圖飾 時間: 2025-3-22 02:55
https://doi.org/10.1007/978-1-4842-3321-4 removes channel harmful configurations prior to transmission. In this method, user messages are encoded with an error correction code, and therefore the number of bit flips should be kept small not to overburden the decoder. We formulate the problem of minimizing the number of bit flips as a binary作者: 自制 時間: 2025-3-22 05:05 作者: Asseverate 時間: 2025-3-22 12:43 作者: MIME 時間: 2025-3-22 14:04 作者: 歡呼 時間: 2025-3-22 20:52 作者: VOC 時間: 2025-3-22 23:38 作者: 狂熱語言 時間: 2025-3-23 04:39 作者: 鎮(zhèn)壓 時間: 2025-3-23 09:26 作者: 設(shè)施 時間: 2025-3-23 13:38 作者: Toxoid-Vaccines 時間: 2025-3-23 14:49 作者: 柱廊 時間: 2025-3-23 19:31
Encryption Steps: Simple Substitutionne such problem: Given a planar graph on . vertices and disjoint pairs of its edges ., perfect matching . is . (REM) if . is even for each .. A straightforward algorithm finds a REM or asserts that no REM exists in . steps and we conjecture that no deterministic or randomised algorithm has complexit作者: 反叛者 時間: 2025-3-24 01:30
Anatomy of Language: Frequenciesian channels, have been published. Also, for improving the performances of these codes several new algorithms have been defined. In this paper we proposed a new modification of existing cryptcodes obtaining new cryptcodes suitable for transmission in burst channels. For generating burst errors we us作者: 表示向下 時間: 2025-3-24 03:31
Asymptotic Disturbance Decoupling,In this paper, we improve the theoretical background of the attacks on the DSA schemes of a previous paper, and we present some new more practical attacks.作者: 性冷淡 時間: 2025-3-24 09:41 作者: braggadocio 時間: 2025-3-24 11:20 作者: defendant 時間: 2025-3-24 17:51 作者: Substance-Abuse 時間: 2025-3-24 19:29 作者: 逃避現(xiàn)實 時間: 2025-3-25 01:42 作者: Anecdote 時間: 2025-3-25 05:29 作者: uveitis 時間: 2025-3-25 10:29
Rational Weighted Tree Languages with Storage and the Kleene-Goldstine TheoremWe introduce rational weighted tree languages with storage over commutative, complete semirings and show a Kleene-Goldstine theorem.作者: 牛的細(xì)微差別 時間: 2025-3-25 14:45 作者: Bone-Scan 時間: 2025-3-25 19:31
Representations of Linear Dynamic Systems,lowing direct implementations when the input scanner is deterministic. Alternatively, one may use more human friendly descriptions based on some simple basic transformations (e.g., copy, duplicate, erase, reverse) and various combinators such as function composition or extensions of regular operations.作者: 鞭子 時間: 2025-3-25 22:56
https://doi.org/10.1007/978-3-030-21363-3artificial intelligence; automata theory; coding theory; computer algebra; computer architecture; compute作者: Narrative 時間: 2025-3-26 01:47 作者: exercise 時間: 2025-3-26 06:05
Modular Descriptions of Regular Functionslowing direct implementations when the input scanner is deterministic. Alternatively, one may use more human friendly descriptions based on some simple basic transformations (e.g., copy, duplicate, erase, reverse) and various combinators such as function composition or extensions of regular operations.作者: Nibble 時間: 2025-3-26 11:33 作者: 粗俗人 時間: 2025-3-26 14:24 作者: Visual-Field 時間: 2025-3-26 16:55
Constraint Satisfaction Through GBP-Guided Deliberate Bit Flipping constraint satisfaction problem, and devise a . guided method to find approximate solutions. Applied to a data-dependent binary channel with the set of 2-D isolated bit configurations as its harmful configurations, we evaluated the performance of our proposed method in terms of uncorrectable bit-error rate.作者: 變色龍 時間: 2025-3-26 22:27
Parallelisms of , Invariant Under Cyclic Groups of Order 4the Baer involution have already been classified. In the present paper, we classify all (we establish that their number is 252738) parallelisms in . that are invariant under cyclic automorphism groups of order 4. We compute the order of their automorphism groups and obtain invariants based on the type of their spreads and duality.作者: Fortuitous 時間: 2025-3-27 03:29
New Cryptcodes for Burst Channelse the model of Gilbert-Elliott burst channel. Experimental results for bit-error and packet-error probabilities obtained for different channel and code parameters are presented. Also, we made comparison of the results obtained with the old and the new algorithms for RCBQ.作者: Sinus-Rhythm 時間: 2025-3-27 09:11 作者: Matrimony 時間: 2025-3-27 12:27 作者: poliosis 時間: 2025-3-27 14:29 作者: 拖債 時間: 2025-3-27 20:00 作者: EXUDE 時間: 2025-3-27 22:48 作者: GAVEL 時間: 2025-3-28 03:55 作者: ear-canal 時間: 2025-3-28 09:35 作者: 分解 時間: 2025-3-28 13:20 作者: 緯度 時間: 2025-3-28 17:36
Aims and Methods of Cryptographyal bounds are optimal here. Seeing commutative languages as generalizing unary languages is a guiding theme. For our results we take a closer look at a canonical automaton model for commutative languages.作者: prostate-gland 時間: 2025-3-28 21:25
Maximal Diameter on a Class of Circulant Graphstorization . and ., is equal to .. This way we further improve the upper bound of Saxena, Severini and Shparlinski. Moreover, we characterize all such extremal graphs. We also show that the upper bound is attainable for integral circulant graphs . such that ..作者: 羊欄 時間: 2025-3-28 23:59 作者: 暫時別動 時間: 2025-3-29 04:20 作者: outer-ear 時間: 2025-3-29 09:51
0302-9743 in June/July 2019.. .The 20 revised papers presented were carefully reviewed and selected from 35 submissions. The papers?present research at the intersection of theoretical computer science, algebra, and related areas. They?report?original unpublished research and cover a broad range of topics fro作者: 宣誓書 時間: 2025-3-29 13:14 作者: 使入迷 時間: 2025-3-29 18:41
Encryption Steps: Transposition as points in varieties as they occur in solutions of multivariate polynomial equation systems. To solve these systems we apply polynomial solvers based on the theory of Gr?bner bases and exhaustive search using serial and parallel programming techniques.作者: 克制 時間: 2025-3-29 21:42
Encryption Steps: Simple Substitutionhtforward algorithm finds a REM or asserts that no REM exists in . steps and we conjecture that no deterministic or randomised algorithm has complexity asymptotically smaller than .. Our motivation is also to pinpoint the curse of dimensionality of the . problem for graphs embedded into orientable surfaces: a basic problem of statistical physics.作者: EVICT 時間: 2025-3-30 02:31
Algebraic Systems Motivated by DNA Origamiey-Lieb algebras, we identify a set of relations that characterize the origami monoid. We present several observations about Green’s relations for the origami monoid and study the relations to a direct product of Jones monoids, which is a morphic image of an origami monoid.作者: 星球的光亮度 時間: 2025-3-30 06:53
Algebraic Models for Arbitrary Strength Covering Arrays over ,-ary Alphabets as points in varieties as they occur in solutions of multivariate polynomial equation systems. To solve these systems we apply polynomial solvers based on the theory of Gr?bner bases and exhaustive search using serial and parallel programming techniques.作者: Occipital-Lobe 時間: 2025-3-30 09:14
The Precise Complexity of Finding Rainbow Even Matchingshtforward algorithm finds a REM or asserts that no REM exists in . steps and we conjecture that no deterministic or randomised algorithm has complexity asymptotically smaller than .. Our motivation is also to pinpoint the curse of dimensionality of the . problem for graphs embedded into orientable surfaces: a basic problem of statistical physics.作者: 爆炸 時間: 2025-3-30 13:14
Modular Descriptions of Regular Functionslowing direct implementations when the input scanner is deterministic. Alternatively, one may use more human friendly descriptions based on some simple basic transformations (e.g., copy, duplicate, erase, reverse) and various combinators such as function composition or extensions of regular operatio作者: Mhc-Molecule 時間: 2025-3-30 19:28
Constraint Satisfaction Through GBP-Guided Deliberate Bit Flipping removes channel harmful configurations prior to transmission. In this method, user messages are encoded with an error correction code, and therefore the number of bit flips should be kept small not to overburden the decoder. We formulate the problem of minimizing the number of bit flips as a binary作者: 鉆孔 時間: 2025-3-30 22:15 作者: CORE 時間: 2025-3-31 01:12
Fast Computing the Algebraic Degree of Boolean Functions and thereafter the algebraic degree by using the weight-lexicographic order (WLO) of the vectors of the .-dimensional Boolean cube. Byte-wise and bitwise versions of a search based on the WLO and their implementations are discussed. They are compared with the usual exhaustive search applied in comp作者: Retrieval 時間: 2025-3-31 05:57
Maximal Diameter on a Class of Circulant Graphsbe transferred between nodes of the quantum networks modeled by integral circulant graphs and this task is related to calculating the maximal diameter of a graph. The integral circulant graph . has the vertex set . and vertices . and . are adjacent if ., where .. Motivated by the result on the upper作者: patella 時間: 2025-3-31 09:55
Parallelisms of , Invariant Under Cyclic Groups of Order 4lelisms in small finite projective spaces is of interest for problems from projective geometry, design theory, network coding, error-correcting codes, cryptography, etc. All parallelisms of . and . are known and parallelisms of . which are invariant under automorphisms of odd prime orders and under 作者: 協(xié)迫 時間: 2025-3-31 13:31
Detecting Arrays for Main Effectsany factors and interactions among them. Of particular concern is to determine which settings of the factors (main effects) impact the behaviour significantly. Detecting arrays for main effects are test suites that ensure that the impact of each main effect is witnessed even in the presence of . or 作者: 異端邪說下 時間: 2025-3-31 17:30
Regular Languages as Local Functions with Small Alphabetset of cardinality depending on the size of the language recognizer. We allow strictly locally testable (slt) languages of degree greater than two, and instead of a homomorphism, we use a rational function of the local type. By encoding the automaton computations using comma-free codes, we prove that作者: Heart-Attack 時間: 2025-4-1 01:40
Commutative Regular Languages – Properties and State Complexityvariants will be introduced which generalize known notions from unary languages used for refined state complexity statements and existing notions for commutative languages used for the subclass of periodic languages. Our bound for shuffle is formulated in terms of these invariants and shown to be op作者: Spinous-Process 時間: 2025-4-1 05:52
Algebraic Systems Motivated by DNA Origami by their composition. These building blocks are taken as generators of a monoid, called the origami monoid, and motivated by the well studied Temperley-Lieb algebras, we identify a set of relations that characterize the origami monoid. We present several observations about Green’s relations for the
