International Journal of Foundations of Computer Science最新文献

英文中文

Algorithmic Aspects of Outer-Independent Double Roman Domination in Graphs 图中与外无关的双罗马支配的算法方面

IF 0.8 4区计算机科学 Q4 Computer Science

International Journal of Foundations of Computer Science

Pub Date : 2024-03-28 DOI: 10.1142/s0129054124500059

Amit Sharma, P. Venkata Subba Reddy, S. Arumugam, Jakkepalli Pavan Kumar

Let $G = (V, E)$ be graph. For any function $h : V \to {0, 1, 2, 3}$ , let $V_{i} = {v \in V : h (v) = i}$ , $0 \leq i \leq 3$ . The function $h$ is called an outer-independent double Roman dominating function (OIDRDF) if the following conditions are satisfied.

⁽ⁱ⁾	If $v \in V_{0}$ , then $\| N (v) \cap V_{3} \| \geq 1$ or $\| N (v) \cap V_{2} \| \geq 2$
⁽ⁱⁱ⁾	If $v \in V_{1}$ , then $\| N (v) \cap (V_{2} \cup V_{3}) \| \geq 1$
⁽ⁱⁱⁱ⁾	设 G=(V,E) 为图。对于任意函数 h:V→{0,1,2,3}，设 Vi={v∈V:h(v)=i}，0≤i≤3。如果满足以下条件，函数 h 称为外部独立双罗马支配函数（OIDRDF）：(i)如果 v∈V0，则\|N(v)∩V3\|≥1 或\|N(v)∩V2\|≥2(ii)如果 v∈V1，则\|N(v)∩(V2∪V3)\|≥1(iii)V0 是独立的。G 的外独立双罗马支配数定义为 γoidR(G)=min∑v∈Vh(v):h 是 G 的一个 OIDRDF。我们证明，与 γoidR(G) 对应的决策问题 MOIDRDP 对于分裂图来说是 NP-完全的。我们还证明，对于连通的阈值图和有界树宽图，它是线性时间可解的。最后，我们证明 MOIDRDP 和 domination 在计算复杂性方面并不等同。 {"title":"Algorithmic Aspects of Outer-Independent Double Roman Domination in Graphs","authors":"Amit Sharma, P. Venkata Subba Reddy, S. Arumugam, Jakkepalli Pavan Kumar","doi":"10.1142/s0129054124500059","DOIUrl":"https://doi.org/10.1142/s0129054124500059","url":null,"abstract":"<p>Let <span><math altimg=\"eq-00001.gif\" display=\"inline\" overflow=\"scroll\"><mi>G</mi><mo>=</mo><mo stretchy=\"false\">(</mo><mi>V</mi><mo>,</mo><mi>E</mi><mo stretchy=\"false\">)</mo></math></span><span></span> be graph. For any function <span><math altimg=\"eq-00002.gif\" display=\"inline\" overflow=\"scroll\"><mi>h</mi><mo>:</mo><mi>V</mi><mo>→</mo><mo stretchy=\"false\">{</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo stretchy=\"false\">}</mo></math></span><span></span>, let <span><math altimg=\"eq-00003.gif\" display=\"inline\" overflow=\"scroll\"><msub><mrow><mi>V</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>=</mo><mo stretchy=\"false\">{</mo><mi>v</mi><mo>∈</mo><mi>V</mi><mo>:</mo><mi>h</mi><mo stretchy=\"false\">(</mo><mi>v</mi><mo stretchy=\"false\">)</mo><mo>=</mo><mi>i</mi><mo stretchy=\"false\">}</mo></math></span><span></span>, <span><math altimg=\"eq-00004.gif\" display=\"inline\" overflow=\"scroll\"><mn>0</mn><mo>≤</mo><mi>i</mi><mo>≤</mo><mn>3</mn></math></span><span></span>. The function <span><math altimg=\"eq-00005.gif\" display=\"inline\" overflow=\"scroll\"><mi>h</mi></math></span><span></span> is called an outer-independent double Roman dominating function (OIDRDF) if the following conditions are satisfied.</p><table border=\"0\" list-type=\"order\" width=\"95%\"><tr><td valign=\"top\"><sup>(i)</sup></td><td colspan=\"5\" valign=\"top\"><p>If <span><math altimg=\"eq-00006.gif\" display=\"inline\" overflow=\"scroll\"><mi>v</mi><mo>∈</mo><msub><mrow><mi>V</mi></mrow><mrow><mn>0</mn></mrow></msub></math></span><span></span>, then <span><math altimg=\"eq-00007.gif\" display=\"inline\" overflow=\"scroll\"><mo>\|</mo><mi>N</mi><mo stretchy=\"false\">(</mo><mi>v</mi><mo stretchy=\"false\">)</mo><mo stretchy=\"false\">∩</mo><msub><mrow><mi>V</mi></mrow><mrow><mn>3</mn></mrow></msub><mo>\|</mo><mo>≥</mo><mn>1</mn></math></span><span></span> or <span><math altimg=\"eq-00008.gif\" display=\"inline\" overflow=\"scroll\"><mo>\|</mo><mi>N</mi><mo stretchy=\"false\">(</mo><mi>v</mi><mo stretchy=\"false\">)</mo><mo stretchy=\"false\">∩</mo><msub><mrow><mi>V</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>\|</mo><mo>≥</mo><mn>2</mn></math></span><span></span></p></td></tr><tr><td valign=\"top\"><sup>(ii)</sup></td><td colspan=\"5\" valign=\"top\"><p>If <span><math altimg=\"eq-00009.gif\" display=\"inline\" overflow=\"scroll\"><mi>v</mi><mo>∈</mo><msub><mrow><mi>V</mi></mrow><mrow><mn>1</mn></mrow></msub></math></span><span></span>, then <span><math altimg=\"eq-00010.gif\" display=\"inline\" overflow=\"scroll\"><mo>\|</mo><mi>N</mi><mo stretchy=\"false\">(</mo><mi>v</mi><mo stretchy=\"false\">)</mo><mo stretchy=\"false\">∩</mo><mo stretchy=\"false\">(</mo><msub><mrow><mi>V</mi></mrow><mrow><mn>2</mn></mrow></msub><mo stretchy=\"false\">∪</mo><msub><mrow><mi>V</mi></mrow><mrow><mn>3</mn></mrow></msub><mo stretchy=\"false\">)</mo><mo>\|</mo><mo>≥</mo><mn>1</mn></math></span><span></span></p></td></tr><tr><td valign=\"top\"><sup>(iii)</sup></td><td colspan=\"5\" valign=\"top\"><p><span><math altimg=\"eq-00011.gif\" display=\"inline\" overflow=","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2024-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140316560","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0} 引用次数: 0 A Note of Reliability Analysis of SM-λ in Folded-Crossed Hypercube with Conditional Faults 带条件故障的折叠交叉超立方体中 SM-λ 的可靠性分析说明 IF 0.8 4区计算机科学 Q4 Computer Science International Journal of Foundations of Computer Science Pub Date : 2024-03-19 DOI: 10.1142/s0129054124500035 Jinjie Ma, Mingzu Zhang, Chenxi Li, Hengji Qiao, Yang Fan The fault tolerance of an interconnection network of parallel and distributed systems can be evaluated by various topological parameters of its underlying graph $G$ , with strong Menger edge connectivity being a vital parameter in this regard. A connected graph $G$ is called strongly Menger edge connected (SM- $λ$ ) if it connects any pair of vertices $u$ and $v$ with $min {d_{G} (u), d_{G} (v)}$ number of edge-disjoint paths. Under the uniform distribution of faults in a large interconnection network, it is improbable that each faulty edge incident to a vertex will occur simultaneously. Thus, $m$ -strongly Menger edge connected of order $t$ was introduced in 2018 by He et al. Here, $G$ is called as $m$ -strongly Menger edge connected of order $t$ , if $G - F$ remains SM- $λ$ , where $F$ is an arbitrary edge set in a graph $G$ with $\| F \| \leq m$ and the minimum degree of the remaining graph $δ 并行和分布式系统互连网络的容错性可通过其底层图 G 的各种拓扑参数来评估，而强门格尔边连接性是这方面的一个重要参数。如果连通图 G 连接任意一对顶点 u 和 v 的边缘相交路径数最小为{dG(u),dG(v)}，则称其为强门格尔边缘连接图（SM-λ）。在大型互连网络的故障均匀分布情况下，顶点的每条故障边不可能同时出现。因此，He等人在2018年提出了阶数为t的m-strongly Menger edge connected，这里，如果G-F保持SM-λ，则称G为阶数为t的m-strongly Menger edge connected，其中F是图G中的任意边集，\|F\|\leqm，且剩余图的最小度δ（G-F）\geqt。保持 G-F 是 SM-λ 的最大 m 表示为 smλt(G)。在超立方体的变体中，n 维折叠交叉超立方体 FCQn 近年来备受关注。本文主要计算 FCQn 的最大条件边缘容错数 t 阶的精确值，即 smλt(FCQn)=2t(n+1-t)-(n+1)，对于两个整数 1\leqt\leqn-2 和 n\geq3。求助PDF {"title":"A Note of Reliability Analysis of SM-λ in Folded-Crossed Hypercube with Conditional Faults","authors":"Jinjie Ma, Mingzu Zhang, Chenxi Li, Hengji Qiao, Yang Fan","doi":"10.1142/s0129054124500035","DOIUrl":"https://doi.org/10.1142/s0129054124500035","url":null,"abstract":"<p>The fault tolerance of an interconnection network of parallel and distributed systems can be evaluated by various topological parameters of its underlying graph <span><math altimg=\"eq-00003.gif\" display=\"inline\" overflow=\"scroll\"><mi>G</mi></math></span><span></span>, with strong Menger edge connectivity being a vital parameter in this regard. A connected graph <span><math altimg=\"eq-00004.gif\" display=\"inline\" overflow=\"scroll\"><mi>G</mi></math></span><span></span> is called strongly Menger edge connected (SM-<span><math altimg=\"eq-00005.gif\" display=\"inline\" overflow=\"scroll\"><mi>λ</mi></math></span><span></span>) if it connects any pair of vertices <span><math altimg=\"eq-00006.gif\" display=\"inline\" overflow=\"scroll\"><mi>u</mi></math></span><span></span> and <span><math altimg=\"eq-00007.gif\" display=\"inline\" overflow=\"scroll\"><mi>v</mi></math></span><span></span> with <span><math altimg=\"eq-00008.gif\" display=\"inline\" overflow=\"scroll\"><mo>min</mo><mo stretchy=\"false\">{</mo><msub><mrow><mi>d</mi></mrow><mrow><mi>G</mi></mrow></msub><mo stretchy=\"false\">(</mo><mi>u</mi><mo stretchy=\"false\">)</mo><mo>,</mo><msub><mrow><mi>d</mi></mrow><mrow><mi>G</mi></mrow></msub><mo stretchy=\"false\">(</mo><mi>v</mi><mo stretchy=\"false\">)</mo><mo stretchy=\"false\">}</mo></math></span><span></span> number of edge-disjoint paths. Under the uniform distribution of faults in a large interconnection network, it is improbable that each faulty edge incident to a vertex will occur simultaneously. Thus, <span><math altimg=\"eq-00009.gif\" display=\"inline\" overflow=\"scroll\"><mi>m</mi></math></span><span></span>-strongly Menger edge connected of order <span><math altimg=\"eq-00010.gif\" display=\"inline\" overflow=\"scroll\"><mi>t</mi></math></span><span></span> was introduced in 2018 by He <i>et al.</i> Here, <span><math altimg=\"eq-00011.gif\" display=\"inline\" overflow=\"scroll\"><mi>G</mi></math></span><span></span> is called as <span><math altimg=\"eq-00012.gif\" display=\"inline\" overflow=\"scroll\"><mi>m</mi></math></span><span></span>-strongly Menger edge connected of order <span><math altimg=\"eq-00013.gif\" display=\"inline\" overflow=\"scroll\"><mi>t</mi></math></span><span></span>, if <span><math altimg=\"eq-00014.gif\" display=\"inline\" overflow=\"scroll\"><mi>G</mi><mo stretchy=\"false\">-</mo><mi>F</mi></math></span><span></span> remains SM-<span><math altimg=\"eq-00015.gif\" display=\"inline\" overflow=\"scroll\"><mi>λ</mi></math></span><span></span>, where <span><math altimg=\"eq-00016.gif\" display=\"inline\" overflow=\"scroll\"><mi>F</mi></math></span><span></span> is an arbitrary edge set in a graph <span><math altimg=\"eq-00017.gif\" display=\"inline\" overflow=\"scroll\"><mi>G</mi></math></span><span></span> with <span><math altimg=\"eq-00018.gif\" display=\"inline\" overflow=\"scroll\"><mo>\|</mo><mi>F</mi><mo>\|</mo><mo>\leq</mo><mi>m</mi></math></span><span></span> and the minimum degree of the remaining graph <span><math altimg=\"eq-00019.gif\" display=\"inline\" overflow=\"scroll\"><mi>δ</mi><mo stretchy=\"fal","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2024-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140196741","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0} 引用次数: 0 引用批量引用Non-Adaptive and Adaptive Two-Sided Search with Fast Objects 快速对象的非适应性和适应性双面搜索 IF 0.8 4区计算机科学 Q4 Computer Science International Journal of Foundations of Computer Science Pub Date : 2024-02-29 DOI: 10.1142/s0129054124500023 Alexey Lebedev, Christian Deppe In 1946, Koopman introduced a two-sided search model. In this model, a searched object is active and can move, at most, one step after each test. We analyze the model of a combinatorial two-sided search by allowing more moves of the searched object after each test. We give strategies and show that they are optimal. We consider adaptive and non-adaptive strategies. We show the surprising result that with the combinatorial two-sided search on a path graph, the optimal non-adaptive search needs the same number of tests as the corresponding adaptive strategy does. The strategy obtained can also be used as an encoding strategy to sent the position of a moving element through a transmission channel. 1946 年，库普曼提出了一种双面搜索模型。在这个模型中，搜索对象是活动的，每次测试后最多只能移动一步。我们分析了组合式双面搜索模型，允许搜索对象在每次测试后有更多的移动。我们给出了策略，并证明这些策略是最优的。我们考虑了自适应和非自适应策略。我们展示了一个令人惊讶的结果：在路径图上进行组合双面搜索时，最优的非自适应搜索所需的测试次数与相应的自适应策略相同。所获得的策略还可用作编码策略，通过传输信道发送移动元素的位置。求助PDF {"title":"Non-Adaptive and Adaptive Two-Sided Search with Fast Objects","authors":"Alexey Lebedev, Christian Deppe","doi":"10.1142/s0129054124500023","DOIUrl":"https://doi.org/10.1142/s0129054124500023","url":null,"abstract":"<p>In 1946, Koopman introduced a two-sided search model. In this model, a searched object is active and can move, at most, one step after each test. We analyze the model of a combinatorial two-sided search by allowing more moves of the searched object after each test. We give strategies and show that they are optimal. We consider adaptive and non-adaptive strategies. We show the surprising result that with the combinatorial two-sided search on a path graph, the optimal non-adaptive search needs the same number of tests as the corresponding adaptive strategy does. The strategy obtained can also be used as an encoding strategy to sent the position of a moving element through a transmission channel.</p>","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2024-02-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140045330","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0} 引用次数: 0 引用批量引用The Generalized 3-Connectivity of Exchanged Crossed Cube 交换交叉立方体的广义三连通性 IF 0.8 4区计算机科学 Q4 Computer Science International Journal of Foundations of Computer Science Pub Date : 2024-02-06 DOI: 10.1142/s0129054124500011 Wantao Ning, Litao Guo Let [Formula: see text] be a connected graph, and [Formula: see text] with [Formula: see text]. [Formula: see text] refers to the maximum number [Formula: see text] of edge-disjoint trees [Formula: see text] in [Formula: see text] such that [Formula: see text] for distinct [Formula: see text]. The generalized [Formula: see text]-connectivity of [Formula: see text], denoted by [Formula: see text], is defined as the minimum value of [Formula: see text] over all [Formula: see text] with [Formula: see text]. In fact, [Formula: see text] is exactly the traditional connectivity of [Formula: see text]. Exchanged crossed cube [Formula: see text], a variation of hypercube, has better properties than other variations of hypercube. In this work we obtain that [Formula: see text] with [Formula: see text]. 设[公式：见正文]为连通图，且[公式：见正文]具有[公式：见正文]。[式：见文本]是指在[式：见文本]中，对于不同的[式：见文本]，[式：见文本]的边相交树[式：见文本]的最大数目。公式：见文本]的广义[公式：见文本]连接性（用[公式：见文本]表示）定义为[公式：见文本]在所有具有[公式：见文本]的[公式：见文本]上的最小值。事实上，[公式：见文本]正是[公式：见文本]的传统连通性。交换交叉立方体[式：见文本]是超立方体的一种变体，它比超立方体的其他变体具有更好的性质。在这项工作中，我们用[公式：见正文]得到了[公式：见正文]。求助PDF {"title":"The Generalized 3-Connectivity of Exchanged Crossed Cube","authors":"Wantao Ning, Litao Guo","doi":"10.1142/s0129054124500011","DOIUrl":"https://doi.org/10.1142/s0129054124500011","url":null,"abstract":"Let [Formula: see text] be a connected graph, and [Formula: see text] with [Formula: see text]. [Formula: see text] refers to the maximum number [Formula: see text] of edge-disjoint trees [Formula: see text] in [Formula: see text] such that [Formula: see text] for distinct [Formula: see text]. The generalized [Formula: see text]-connectivity of [Formula: see text], denoted by [Formula: see text], is defined as the minimum value of [Formula: see text] over all [Formula: see text] with [Formula: see text]. In fact, [Formula: see text] is exactly the traditional connectivity of [Formula: see text]. Exchanged crossed cube [Formula: see text], a variation of hypercube, has better properties than other variations of hypercube. In this work we obtain that [Formula: see text] with [Formula: see text].","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2024-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139862084","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0} 引用次数: 0 引用批量引用The Generalized 3-Connectivity of Exchanged Crossed Cube 交换交叉立方体的广义三连通性 IF 0.8 4区计算机科学 Q4 Computer Science International Journal of Foundations of Computer Science Pub Date : 2024-02-06 DOI: 10.1142/s0129054124500011 Wantao Ning, Litao Guo Let [Formula: see text] be a connected graph, and [Formula: see text] with [Formula: see text]. [Formula: see text] refers to the maximum number [Formula: see text] of edge-disjoint trees [Formula: see text] in [Formula: see text] such that [Formula: see text] for distinct [Formula: see text]. The generalized [Formula: see text]-connectivity of [Formula: see text], denoted by [Formula: see text], is defined as the minimum value of [Formula: see text] over all [Formula: see text] with [Formula: see text]. In fact, [Formula: see text] is exactly the traditional connectivity of [Formula: see text]. Exchanged crossed cube [Formula: see text], a variation of hypercube, has better properties than other variations of hypercube. In this work we obtain that [Formula: see text] with [Formula: see text]. 设[公式：见正文]为连通图，且[公式：见正文]具有[公式：见正文]。[式：见文本]是指在[式：见文本]中，对于不同的[式：见文本]，[式：见文本]的边相交树[式：见文本]的最大数目。公式：见文本]的广义[公式：见文本]连接性（用[公式：见文本]表示）定义为[公式：见文本]在所有具有[公式：见文本]的[公式：见文本]上的最小值。事实上，[公式：见文本]正是[公式：见文本]的传统连通性。交换交叉立方体[式：见文本]是超立方体的一种变体，它比超立方体的其他变体具有更好的性质。在这项工作中，我们用[公式：见正文]得到了[公式：见正文]。求助PDF {"title":"The Generalized 3-Connectivity of Exchanged Crossed Cube","authors":"Wantao Ning, Litao Guo","doi":"10.1142/s0129054124500011","DOIUrl":"https://doi.org/10.1142/s0129054124500011","url":null,"abstract":"Let [Formula: see text] be a connected graph, and [Formula: see text] with [Formula: see text]. [Formula: see text] refers to the maximum number [Formula: see text] of edge-disjoint trees [Formula: see text] in [Formula: see text] such that [Formula: see text] for distinct [Formula: see text]. The generalized [Formula: see text]-connectivity of [Formula: see text], denoted by [Formula: see text], is defined as the minimum value of [Formula: see text] over all [Formula: see text] with [Formula: see text]. In fact, [Formula: see text] is exactly the traditional connectivity of [Formula: see text]. Exchanged crossed cube [Formula: see text], a variation of hypercube, has better properties than other variations of hypercube. In this work we obtain that [Formula: see text] with [Formula: see text].","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2024-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139802095","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0} 引用次数: 0 引用批量引用Special Issue — Articles Dedicated to the Memory of Magnus Steinby: Preface 特刊 - 纪念马格努斯-斯坦比的文章：序言 IF 0.8 4区计算机科学 Q4 Computer Science International Journal of Foundations of Computer Science Pub Date : 2024-01-10 DOI: 10.1142/s0129054123020057 Zoltán Fülöp, George Rahonis, Kai Salomaa 求助PDF {"title":"Special Issue — Articles Dedicated to the Memory of Magnus Steinby: Preface","authors":"Zoltán Fülöp, George Rahonis, Kai Salomaa","doi":"10.1142/s0129054123020057","DOIUrl":"https://doi.org/10.1142/s0129054123020057","url":null,"abstract":"","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2024-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139627511","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0} 引用次数: 0 引用批量引用Smooth Subsum Search A Heuristic for Practical Integer Factorization 用于实用整数因式分解的平滑子和搜索启发式 IF 0.8 4区计算机科学 Q4 Computer Science International Journal of Foundations of Computer Science Pub Date : 2023-12-29 DOI: 10.1142/s0129054123500296 Markus Hittmeir The two currently fastest general-purpose integer factorization algorithms are the Quadratic Sieve and the Number Field Sieve. Both techniques are used to find so-called smooth values of certain polynomials, i.e., values that factor completely over a set of small primes (the factor base). As the names of the methods suggest, a sieving procedure is used for the task of quickly identifying smooth values among the candidates in a certain range. While the Number Field Sieve is asymptotically faster, the Quadratic Sieve is still considered the most efficient factorization technique for numbers up to around 100 digits. In this paper, we challenge the Quadratic Sieve by presenting a novel approach based on representing smoothness candidates as sums that are always divisible by several of the primes in the factor base. The resulting values are generally smaller than those considered in the Quadratic Sieve, increasing the likelihood of them being smooth. Using the fastest implementations of the Self-initializing Quadratic Sieve in Python as benchmarks, a Python implementation of our approach runs consistently 5 to 7 times faster for numbers with 45-100 digits, and around 10 times faster for numbers with 30-40 digits. We discuss several avenues for further improvements and applications of the technique. 目前最快的两种通用整数因式分解算法是二次筛法和数域筛法。这两种技术都用于寻找某些多项式的所谓平滑值，即在一组小素数（因数基）上完全因数分解的值。正如这两种方法的名称所暗示的，筛分程序用于在一定范围内的候选值中快速找出平滑值。虽然数域筛法在渐进上更快，但对于 100 位以内的数字，二次筛法仍被认为是最有效的因式分解技术。在本文中，我们提出了一种新方法，将平滑度候选数表示为总是能被因数基中的几个素数整除的和，从而对二次筛法提出了挑战。这样得到的值通常比二次筛法中考虑的值要小，从而增加了它们成为平滑值的可能性。以 Python 中自初始化二次筛的最快实现为基准，我们方法的 Python 实现在处理 45-100 位数的数字时，运行速度持续提高 5 到 7 倍，在处理 30-40 位数的数字时，运行速度提高约 10 倍。我们讨论了进一步改进和应用该技术的几种途径。求助PDF {"title":"Smooth Subsum Search A Heuristic for Practical Integer Factorization","authors":"Markus Hittmeir","doi":"10.1142/s0129054123500296","DOIUrl":"https://doi.org/10.1142/s0129054123500296","url":null,"abstract":"<p>The two currently fastest general-purpose integer factorization algorithms are the Quadratic Sieve and the Number Field Sieve. Both techniques are used to find so-called smooth values of certain polynomials, i.e., values that factor completely over a set of small primes (the factor base). As the names of the methods suggest, a sieving procedure is used for the task of quickly identifying smooth values among the candidates in a certain range. While the Number Field Sieve is asymptotically faster, the Quadratic Sieve is still considered the most efficient factorization technique for numbers up to around 100 digits. In this paper, we challenge the Quadratic Sieve by presenting a novel approach based on representing smoothness candidates as sums that are always divisible by several of the primes in the factor base. The resulting values are generally smaller than those considered in the Quadratic Sieve, increasing the likelihood of them being smooth. Using the fastest implementations of the Self-initializing Quadratic Sieve in Python as benchmarks, a Python implementation of our approach runs consistently 5 to 7 times faster for numbers with 45-100 digits, and around 10 times faster for numbers with 30-40 digits. We discuss several avenues for further improvements and applications of the technique.</p>","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2023-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140045282","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0} 引用次数: 0 引用批量引用A Verifiable Multi-Secret Sharing Scheme Based on ℓ-Intersection Pair of Cyclic Codes 基于ℓ-交集对循环码的可验证多密共享方案 IF 0.8 4区计算机科学 Q4 Computer Science International Journal of Foundations of Computer Science Pub Date : 2023-11-29 DOI: 10.1142/s0129054123500284 Md Ajaharul Hossain, Ramakrishna Bandi A verifiable multi-secret sharing (VMSS) scheme addresses various security issues, helping in cheating detection and cheater identification. The dimension of the intersection of a given pair of cyclic codes over a finite field [Formula: see text] is represented by [Formula: see text]. In this paper, we propose a VMSS scheme based on an [Formula: see text]-intersection pair of cyclic codes. The proposed scheme is very useful for sharing a large number of secrets. If [Formula: see text] is the number of secrets in a threshold [Formula: see text] scheme, then for [Formula: see text], the computational complexity and the public values required in the reconstruction phase are much less compared to many existing schemes in the literature. Overall, the proposed scheme comprises nearly all the features, like being verifiable, testing participants’ integrity, checking Verifier frauds, and most importantly, it is of multi-use type. 可验证多机密共享（VMSS）方案解决了各种安全问题，有助于发现作弊和识别作弊者。有限域上一对给定循环码的交集维数[公式：见正文]用[公式：见正文]表示。在本文中，我们提出了一种基于一对循环码[式：见正文]交集的 VMSS 方案。所提出的方案对于共享大量秘密非常有用。如果[公式：见正文]是阈值[公式：见正文]方案中的秘密数量，那么对于[公式：见正文]，与文献中的许多现有方案相比，计算复杂度和重构阶段所需的公共值都要少得多。总之，所提出的方案几乎包含了所有特点，如可验证、测试参与者的完整性、检查验证者的欺诈行为，最重要的是，它是多用途类型的。求助PDF {"title":"A Verifiable Multi-Secret Sharing Scheme Based on ℓ-Intersection Pair of Cyclic Codes","authors":"Md Ajaharul Hossain, Ramakrishna Bandi","doi":"10.1142/s0129054123500284","DOIUrl":"https://doi.org/10.1142/s0129054123500284","url":null,"abstract":"A verifiable multi-secret sharing (VMSS) scheme addresses various security issues, helping in cheating detection and cheater identification. The dimension of the intersection of a given pair of cyclic codes over a finite field [Formula: see text] is represented by [Formula: see text]. In this paper, we propose a VMSS scheme based on an [Formula: see text]-intersection pair of cyclic codes. The proposed scheme is very useful for sharing a large number of secrets. If [Formula: see text] is the number of secrets in a threshold [Formula: see text] scheme, then for [Formula: see text], the computational complexity and the public values required in the reconstruction phase are much less compared to many existing schemes in the literature. Overall, the proposed scheme comprises nearly all the features, like being verifiable, testing participants’ integrity, checking Verifier frauds, and most importantly, it is of multi-use type.","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2023-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139209229","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0} 引用次数: 0 引用批量引用Tree-Based Generation of Restricted Graph Languages 基于树的受限图语言生成 IF 0.8 4区计算机科学 Q4 Computer Science International Journal of Foundations of Computer Science Pub Date : 2023-11-24 DOI: 10.1142/s0129054123480106 Henrik Björklund, Johanna Björklund, Petter Ericson Order-preserving DAG grammars (OPDGs) is a formalism for representing languages of structurally restricted graphs. As demonstrated in [17], they are sufficiently expressive to model abstract meaning representations in natural language processing, a graph-based form of semantic representation in which nodes encode objects and edges relations. At the same time, they can be parsed in [Formula: see text], where [Formula: see text] and [Formula: see text] are the sizes of the grammar and the input graph, respectively. In this work, we provide an initial algebra semantic for OPDGs, which allows us to view them as regular tree grammars under an equivalence theory. This makes it possible to transfer results from the field of formal tree languages to the domain of OPDGs, both in the unweighted and the weighted case. In particular, we show that deterministic OPDGs can be minimised efficiently, and that they are learnable under the “minimal adequeate teacher” paradigm, that is, by querying an oracle for equivalence between languages, and membership of individual graphs. To conclude, we demonstrate that the languages generated by OPDGs are definable in monadic second-order logic. 保序 DAG 语法（OPDGs）是一种表示结构受限图语言的形式主义。正如文献[17]所证明的，OPDGs 有足够的表现力来模拟自然语言处理中的抽象意义表示，这是一种基于图的语义表示形式，其中节点编码对象，边编码关系。同时，它们可以用[公式：见正文]进行解析，其中[公式：见正文]和[公式：见正文]分别是语法和输入图的大小。在这项工作中，我们为 OPDGs 提供了一个初始代数语义，使我们可以将其视为等价理论下的规则树语法。这使得我们有可能将形式树语言领域的结果转移到 OPDGs 领域，包括无权和有权情况。特别是，我们证明了确定性 OPDGs 可以高效地最小化，而且它们可以在 "最小拟合教师 "范式下学习，即通过查询语言之间的等价性和单个图的成员资格。最后，我们证明了 OPDGs 生成的语言可在一元二阶逻辑中定义。求助PDF {"title":"Tree-Based Generation of Restricted Graph Languages","authors":"Henrik Björklund, Johanna Björklund, Petter Ericson","doi":"10.1142/s0129054123480106","DOIUrl":"https://doi.org/10.1142/s0129054123480106","url":null,"abstract":"Order-preserving DAG grammars (OPDGs) is a formalism for representing languages of structurally restricted graphs. As demonstrated in [17], they are sufficiently expressive to model abstract meaning representations in natural language processing, a graph-based form of semantic representation in which nodes encode objects and edges relations. At the same time, they can be parsed in [Formula: see text], where [Formula: see text] and [Formula: see text] are the sizes of the grammar and the input graph, respectively. In this work, we provide an initial algebra semantic for OPDGs, which allows us to view them as regular tree grammars under an equivalence theory. This makes it possible to transfer results from the field of formal tree languages to the domain of OPDGs, both in the unweighted and the weighted case. In particular, we show that deterministic OPDGs can be minimised efficiently, and that they are learnable under the “minimal adequeate teacher” paradigm, that is, by querying an oracle for equivalence between languages, and membership of individual graphs. To conclude, we demonstrate that the languages generated by OPDGs are definable in monadic second-order logic.","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2023-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139240397","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0} 引用次数: 0 引用批量引用Author Index Volume 34 (2023) 作者索引第 34 卷（2023 年） IF 0.8 4区计算机科学 Q4 Computer Science International Journal of Foundations of Computer Science Pub Date : 2023-11-20 DOI: 10.1142/s0129054123990010 求助PDF {"title":"Author Index Volume 34 (2023)","authors":"","doi":"10.1142/s0129054123990010","DOIUrl":"https://doi.org/10.1142/s0129054123990010","url":null,"abstract":"","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2023-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139257455","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0} 引用次数: 0 引用批量引用首页上一页 1234567 ... 10 下一页尾页类型全部化学•材料生命科学医学物理工程技术环境•农林材料科学地球科学法学管理学化学环境科学与生态学计算机科学教育学经济学农林科学人文科学生物学数学物理与天体物理心理学综合性期刊其他工业工程理学历史学农学文学信息工程数据库全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley 期刊 International Journal of Foundations of Computer Science 全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem. ﹀\times 文献原料相关产品\times 引用 GB/T 7714-2015 复制 MLA 复制 APA 复制导出至 BibTeX EndNote RefMan NoteFirst NoteExpress\times 快捷登录密码登录未注册的手机号，验证通过后自动注册获取验证码勾选即代表同意《Book学术使用协议》注册新账号两周内记住我忘记密码？注册新账号打开微信，扫描二维码您必须已注册Book学术，并关注『Book学术』公众号绑定账户。请完成安全验证 \times0 微信客服QQ 扫码关注我们反馈顶部\times 意见反馈请填写您的意见或建议请填写您的手机或邮箱\times 求助内容：标题： DOI：期刊：作者：出版日期：数据库：积分：文献类型：期刊论文学位论文图书其他 (专利、报告等) 补充材料：只需要正文仅需补充材料注：不可同时求助正文和补充材料，需分开求助。应助结果提醒方式：微信（请自行确认已关注Book学术公众号）邮件保存保存后同步修改账户信息中的邮箱确认发布求助\times 没积分了多种获得积分方式，供你选择！查看如何获取积分\times 处理提示您的部分求助已有人上传文件，您还尚未处理，请先处理完毕再发起新的求助点击查看\times 努力提交中提交成功继续求助查看详情\times 提示您的信息不完整，为了账户安全，请先补充。现在去补充\times 提示您因 "违规操作" 具体请查看互助需知我知道了\times 提示现在去查看取消\times 提示确定Book学术文献互助群群号：481959085 文献互助智能选刊最新文献互助须知联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 Book学术 All rights reserved. 京公网安备 11010802042870号京ICP备2023020795号-1\timesvar fclearShow $(function () { $("#fkeyword").val($("#tkeyword").val()); if ($("#fkeyword").val().trim().length > 0) { $("#fclear").show(); fclearShow = true; } $("#fclear").click(function () { $("#fkeyword").val(""); $("#fclear").hide(); fclearShow = false; $("#fkeyword").focus(); }); $("#fkeyword").keyup(function (event) { var which = event.which; if ($(this).val().trim().length > 0) { if (!fclearShow) { $("#fclear").show(); fclearShow = true; } } else { if (fclearShow) { $("#fclear").hide(); fclearShow = false; } } if (which==13) { $("#fsearch").click(); } }); $("#fkeyword").change(function () { if ($(this).val().trim().length > 0) { if (!fclearShow) { $("#fclear").show(); fclearShow = true; } } else { if (fclearShow) { $("#fclear").hide(); fclearShow = false; } } }); $("#fsearch").click(function () { if ($("#fkeyword").val().trim() == "") { alert("请输入搜索关键字"); $("#fkeyword").focus(); return; } var regex = /\b(10[.][0-9]{4,}(?:[.][0-9]+)\/(?:(?![\\|"&\'])\S)+)(?:\+?\|\b)/g; const optionarr = $("#fkeyword").val().trim().match(regex); if ((optionarr != undefined && optionarr.length > 0) \|\| isPaperGo($("#fkeyword").val().trim())) { window.open("/literature/literaturelist?keyword=" + encodeURIComponent($("#fkeyword").val())); } else { window.location.href = "/literature/literaturelist?keyword=" + encodeURIComponent($("#fkeyword").val()); } }); $(window).scroll(function () { var scrollTop = $(this).scrollTop(); if (scrollTop > $("#menufloat").offset().top) { $("#fkeyword").val($("#tkeyword").val()); $("#menufloat2").show(); $("#menufloat").css("visibility", "hidden"); } else if (scrollTop <= $("#menufloat").offset().top) { $("#menufloat2").hide(); $("#menufloat").css("visibility", ""); } }) }) function isPaperGo(s) { let pos = 0; let digitCount = 0; let flag = false; const searchCleanArr = s.split(/[., ]/).map(item => item.trim()).filter(item => item !== ''); for (const item of searchCleanArr) { if (!flag) { if (!isNaN(parseInt(item[0]))) { flag = !flag; } else { pos += item.length; } } else { for (const i of item) { if (!isNaN(i)) { digitCount++; } } } } const sLength = (searchCleanArr.join('')).substring(pos).length; if (sLength === 0 \|\| digitCount / sLength < 0.5) { return false; } return true; }var clearShow = false; $(function () { if ($("#tkeyword").val().trim().length > 0) { $("#clear").show(); clearShow = true; } $("#tkeyword").keydown(function (e) { var curKey = e.which; if (curKey == 13) { } }); $("#SearchBtn").click(function () { var keyWordHome = $("#tkeyword").val(); var fullWidthRegex = /[\u3000-\u303F\u3040-\u309F\u30A0-\u30FF\u3100-\u312F\u3130-\u318F\u3190-\u319F\u31A0-\u31BF\u31C0-\u31EF\u31F0-\u31FF\u3200-\u32FF\u3300-\u33FF\uFF00-\uFFEF\u4E00-\u9FFF]/; if (keyWordHome.trim().length == 0) { alert("请输入搜索关键字"); $("#tkeyword").focus(); return; } if (/[\u4e00-\u9fa5]/.test($("#tkeyword").val())) { if ($("#tkeyword").val().trim().length > 200) { alert("关键词长度不能大于200个字符"); return; } } else { if ($("#tkeyword").val().trim().length > 500) { alert("关键词长度不能大于500个字符"); return; } } if (fullWidthRegex.test(keyWordHome)) { keyWordHome = toHalfWidth(keyWordHome); } var regex = /\b(10[.][0-9]{4,}(?:[.][0-9]+)\/(?:(?![\\|"&\'])\S)+)(?:\+?\|\b)/g; const optionarr = keyWordHome.trim().match(regex); if ((optionarr != undefined && optionarr.length > 0) \|\| isPaperGo(keyWordHome.trim())) { window.open('/literature/literaturelist?keyword=' + encodeURIComponent(keyWordHome)); } else { window.location.href = '/literature/literaturelist?keyword=' + encodeURIComponent(keyWordHome); } }); $(":text.ssi").unbind().keyup(function (event) { var which = event.which; if (which != 13) { if ($("[data-module='scisearch']").length > 0) { $("[data-module='scisearch']").attr("data-search-value", $(this).val()); } } else { $("#SearchBtn").click(); } }); $(":text.ssi").on('input', function () { if ($("[data-module='scisearch']").length > 0) { $("[data-module='scisearch']").attr("data-search-value", $(this).val()); } }); $("#clear").click(function () { $("#tkeyword").val(""); $("#clear").hide(); clearShow = false; $("#tkeyword").focus(); }); $("#tkeyword").keyup(function () { if ($(this).val().trim().length > 0) { if (!clearShow) { $("#clear").show(); clearShow = true; } } else { if (clearShow) { $("#clear").hide(); clearShow = false; } } }); $("#tkeyword").change(function () { if ($(this).val().trim().length > 0) { if (!clearShow) { $("#clear").show(); clearShow = true; } } else { if (clearShow) { $("#clear").hide(); clearShow = false; } } }) if (getCookie("userName") == null) { if (getCookie("_sci_uid") == null) { var uuidstr = getuuid(); setCookie("_sci_uid", "sci_" + uuidstr, 9999); } } }); function isPaperGo(s) { let pos = 0; let digitCount = 0; let flag = false; const searchCleanArr = s.split(/[., ]/).map(item => item.trim()).filter(item => item !== ''); for (const item of searchCleanArr) { if (!flag) { if (!isNaN(parseInt(item[0]))) { flag = !flag; } else { pos += item.length; } } else { for (const i of item) { if (!isNaN(i)) { digitCount++; } } } } const sLength = (searchCleanArr.join('')).substring(pos).length; if (sLength === 0 \|\| digitCount / sLength < 0.5) { return false; } return true; }$