Regular String Research Articles

Open-answer question with regular expression templates and string completion hinting

Open-answer question with regular expression templates and string completion hinting

Topology in thermodynamics of regular black strings with Kaluza–Klein reduction

We study the topological defects in the thermodynamics of regular black strings (from a four-dimensional perspective) that is symmetric under the double Wick rotation and constructed in the high-dimensional spacetime with an extra dimension compactified on a circle. We observe that the thermodynamic phases of regular black strings can be topologically classified by the positive and negative winding numbers (at the defects) which correspond to the thermodynamically stable and unstable branches. This topological classification implies a phase transition due to the decay of a thermodynamically unstable regular black string to another which is thermodynamically stable. We confirm these topological properties of the thermodynamics of regular black strings by investigating their free energy, heat capacity, and Ruppeiner scalar curvature of the state space. The Ruppeiner scalar curvature of regular black strings is found to be always negative, implying that the interactions among the microstructures of regular black strings are only attractive.

Spinning strings: λ-deformation and non-Abelian T-dual limit

The simplest example of the λ-deformation connects the SU(2) Wess-Zumino-Witten model with the non-Abelian T-dual (NATD) of the SU(2) principal chiral model. We analyze spinning strings with one spin propagating through the truncation of an S-dual embedding of the λ-deformation of the target space into type IIB supergravity. We show that the situation apart from the NATD limit parallels the undeformed case. We demonstrate that regular spinning strings are either folded or circular, and that nearly degenerate spinning strings are either nearly point-like, fast, or slow. The effects of the λ-deformation are both the overall increment of the energy of spinning strings and the enlargement of the gap between the energies of folded and circular strings. In the NATD limit, we prove that circular strings disappear and that fast strings realize the dispersion relation of Gubser-Klebanov-Polyakov strings.

Black String Bounce to Traversable Wormhole

In this work, a regular black string solution is presented from the method used by Simpson–Visser to regularize the Schwarzschild solution. As in the Simpson–Visser work, in this new black string solution, it is possible to represent both a regular black hole and a wormhole simply by changing the value of a parameter “a” used in its metric. Tensors and curvature invariants are analyzed to verify the regularity of the solution as well as the energy conditions of the system. It is found that the null energy condition is always violated for the entire space. An additional analysis of the thermodynamic properties of the regular black string is carried out, in which the modifications generated about the original solution of the black string are evaluated, specifically, the Hawking temperature, entropy, its thermal capacity, and the Helmholtz free energy. Finally, we investigate the possible stable or unstable circular orbits for photons and massive particles. The results are compared with those for the non-regular black string, seeking to make a parallel with the Simpson–Visser work.

A Survey on Malware Attacks Analysis and Detected

Malware is one of the biggest problems modern internet users face. Private data and pricey computing resources are seriously threatened by the rise in malware attacks. Anti-malware businesses rely on signatures, which do in fact involve regular expressions and strings, to find malware and its related families. Recent malware attacks in recent years have demonstrated that signature-based techniques are error-prone and easily avoided by sophisticated malware programs. This essay provides an introductory overview of malware and analysis techniques used, as well as detection techniques used by researchers.

Regular string token fuzzy Petri nets

Fuzzy Petri nets are a type of classical Petri nets designed to deal with imprecise and ambiguous data, that have been widely used to represent fuzzy production rules and fuzzy rule-based reasoning. In this paper, we introduce a new model called string token fuzzy Petri nets to generate fuzzy regular languages. Also, we study the equivalences of fuzzy regular grammar and regular string token fuzzy Petri net and establish some closure properties such as union, catenation, kleene closure, reversal, homomorphism and inverse homomorphism of the languages generated by the regular string token fuzzy Petri nets.

Four-dimensional regular black strings in bilocal gravity

In this paper, we obtain a static black string solution for a bilocal gravitational source in 3+1 dimensions. The solution is regular at the origin and tends asymptotically to the ordinary static uncharged black string solution of general relativity. It allows an event horizon and an internal horizon depending on the value of the mass density. A mass remnant associated with a vanishing Hawking temperature is also found. In order to stabilize the solution, a perfect cosmological fluid with state parameter ω>−1 should be present throughout space. However, energy conditions do not exclude an exotic substance nearby the black string. Finally, we find the stationary counterpart of the solution and analyze the behavior of the horizons according to the mass and angular momentum of the spinning object.

THE METHOD FOR STRENGTH ABILITIES RAISING OF 12-13 YEAR OLD BOYS

In these modern days teenagers are often interested in body-building. These hobbies can be used to generate interest in exercising in general and promote the development of muscle strength in particular. Middle school age is coincident with the end of the organism formation. At this time, the motor individuality of adult is finally formed. The deterioration of motor coordination with the intensive development of speed and speed-strength abilities is characterized for teenagers. There is a complex process of character and interests formation in life. The purpose of the article is – to demonstrate the influence of advanced method aimed at increasing the level of strength abilities for 12-13 year old boys. The research was performed from September 2020 to April 2021, experimentation facility was Gymnasium №107, Zaporizhia. It was attended by 57 boys aged 12-13 who were divided into experimental (n=29) and control (n=28) groups, all boys were classified in the main medical group. The advanced method has a clear applied orientation and is implemented mainly through the using of practical methods and forms, organization of lessons and aimed at implementing the variative principle. It includes: curriculum planning according to material and technical resources, staffing; age-sex characteristics of pupils, interests, provides succession and continuity between lessons; has a developmental character, applied orientation of the educational process and is aimed at forming a harmonious person. Important in organization of physical training lessons is the regular string of exercises focused on developing various strengths forms and their combination with other exercises. The obtained results showed that the indexes of strength training for 12-13 year old boys in the experimental group improve by 12.28%, and in the control group only by 6.42%. The positive influence of the elaborated method has been stated. The efficiency of the given method has been proved by the obtained data.

Designing efficient algorithms for querying large corpora

I describe several new efficient algorithms for querying large annotated corpora. The search algorithms as they are implemented in several popular corpus search engines are less than optimal in two respects: regular expression string matching in the lexicon is done in linear time, and regular expressions over corpus positions are evaluated starting in those corpus positions that match the constraints of the initial edges of the corresponding network. To address these shortcomings, I have developed an algorithm for regular expression matching on suffix arrays that allows fast lexicon lookup, and a technique for running finite state automata from edges with lowest corpus counts. The implementation of the lexicon as suffix array also lends itself to an elegant and efficient treatment of multi-valued and set-valued attributes. The described techniques have been implemented in a fully functional corpus management system and are also used in a treebank query system.

A new approach to regular & indeterminate strings

In this paper we propose a new, more appropriate definition of regular and indeterminate strings. A regular string is one that is “isomorphic” to a string whose entries all consist of a single letter, but which nevertheless may itself include entries containing multiple letters. A string that is not regular is said to be indeterminate. We begin by proposing a new model for the representation of strings, regular or indeterminate, then go on to describe a linear time algorithm to determine whether or not a string x=x[1..n] is regular and, if so, to replace it by a lexicographically least (lex-least) string y whose entries are all single letters. Furthermore, we connect the regularity of a string to the transitive closure problem on a graph, which in our special case can be efficiently solved. We then introduce the idea of a feasible palindrome array MP of a string, and prove that every feasible MP corresponds to some (regular or indeterminate) string. We describe an algorithm that constructs a string x corresponding to given feasible MP, while ensuring that whenever possible x is regular and if so, then lex-least. A final section outlines new research directions suggested by this changed perspective on regular and indeterminate strings.

Identification Word Spacing of Erroneous Sentences on Indonesian Scientific

Scientific writings in Indonesian language must the rules of the General Guide to the Reformed Indonesian Spelling especially in terms of word spacing. good word spacing is proportional to the width of the typeface. generally use the align right facility in order to have article look neat in typing, but causes space from word to word over space. Additionally, according to the General Guide book for the updated Indonesian spelling, there are rules that use the distance of words with punctuation after and before punctuation. This research is intended to make for detecting applications using word spacing of the Regular Expression String algorithm and to comment on articles based on principles that are in accordance with the General Guidelines for Indonesian Reformed Spelling.

Efficient pattern matching in degenerate strings with the Burrows–Wheeler transform

A degenerate or indeterminate string on an alphabet Σ is a sequence of non-empty subsets of Σ. Given a degenerate string t of length n and its Burrows–Wheeler transform we present a new method for searching for a degenerate pattern of length m in t running in O(mn) time on a constant size alphabet Σ. Furthermore, it is a hybrid pattern matching technique that works on both regular and degenerate strings. A degenerate string is said to be conservative if its number of non-solid letters is upper-bounded by a fixed positive constant q; in this case we show that the search time complexity is O(qm2) for counting the number of occurrences and O(qm2+occ) for reporting the found occurrences where occ is the number of occurrences of the pattern in t. Experimental results show that our method performs well in practice.

Stable Longitudinal Control of Heterogeneous Vehicular Platoon With Disturbances and Information Delays

This paper presents a robust control method for heterogeneous vehicle platoon subject to varying road slopes, aerodynamic drag, and wireless communication delay. First, a heterogeneous vehicle platoon is built, including parameter uncertainty, equivalent communication delay, network-induced delay caused by discrete data in sensor and wireless communication, and external disturbance (i.e., road slope and wind). Second, a Lyapunov–Krasovskii functional-based $H_\infty $ controller is designed to generate the state-feedback control which could ensure inner-vehicle stability and string stability of platoon simultaneously. Third, $\mathcal {L}_{2} $ string stability is proposed to ensure the platoon stability that guarantees the perturbations that do not grow unbounded as they propagate through the platoon. Simulation results indicate the proposed robust controller achieves tracking of desired inter-vehicle spacing and string stable of platoon while comparing with the regular string stability controller.

Indeterminate String Factorizations and Degenerate Text Transformations

The data explosion problem continues to escalate requiring novel and ingenious solutions. Pattern inference focusing on repetitive structures in data is a vigorous field of endeavor aimed at shrinking volumes of data by means of concise descriptions. The Burrows–Wheeler transformation computes a permutation of a string of letters over an alphabet, and is well-suited to compression-related applications due to its invertability and data clustering properties. For space efficiency the input to the transform can be preprocessed into Lyndon factors. Rather than this classic deterministic approach for letter based strings, we consider scenarios with uncertainty regarding the data: a position in an indeterminate or degenerate string is a set of letters. We first define indeterminate Lyndon words and establish their associated unique string factorization; then we introduce the novel degenerate Burrows–Wheeler transformation which may apply the indeterminate Lyndon factorization. A core computation in Burrows–Wheeler type transforms is the linear sorting of all conjugates of the input string—we achieve this in the degenerate case with lex-extension ordering. Like the original forms, indeterminate Lyndon factorization and the degenerate transform and its inverse can all be computed in linear time and space with respect to total input size of degenerate strings. Regular molecular biological strings yield a wealth of applications of big data—an important motivation for generalizing to degenerate strings is their extensive use in expressing polymorphism in DNA sequences.

Gravitating non-Abelian cosmic strings

In this paper, we study regular cosmic string solutions of the non-Abelian Higgs model coupled with gravity. In order to develop this analysis, we constructed a set of coupled non-linear differential equations. Because there is no closed solution for this set of equations, we solve it numerically. The solutions we are interested in asymptote to a flat spacetime with a planar angle deficit. The model under consideration presents two bosonic sectors, besides the non-Abelian gauge field. The two bosonic sectors may present a direct coupling, so we investigate the relevance of this coupling on the system, specifically in the linear energy density of the string and on the planar angle deficit. We also analyze the behaviors of these quantities as a function of the energy scale where the gauge symmetry is spontaneously broken.

Indeterminate strings, prefix arrays & undirected graphs

An integer array y=y[1..n] is said to be feasible if and only if y[1]=n and, for every i∈2..n, i≤i+y[i]≤n+1. A string is said to be indeterminate if and only if at least one of its elements is a subset of cardinality greater than one of a given alphabet Σ; otherwise it is said to be regular. A feasible array y is said to be regular if and only if it is the prefix array of some regular string. We show using a graph model that every feasible array of integers is a prefix array of some (indeterminate or regular) string, and for regular strings corresponding to y, we use the model to provide a lower bound on the alphabet size. We show further that there is a 1–1 correspondence between labelled simple graphs and indeterminate strings, and we show how to determine the minimum alphabet size σ of an indeterminate string x based on its associated graphGx. Thus, in this sense, indeterminate strings are a more natural object of combinatorial interest than the strings on elements of Σ that have traditionally been studied.

DReX

We present DReX, a declarative language that can express all regular string-to string transformations, and can still be efficiently evaluated. The class of regular string transformations has a robust theoretical foundation including multiple characterizations, closure properties, and decidable analysis questions, and admits a number of string operations such as insertion, deletion, substring swap, and reversal. Recent research has led to a characterization of regular string transformations using a primitive set of function combinators analogous to the definition of regular languages using regular expressions. While these combinators form the basis for the language DReX proposed in this paper, our main technical focus is on the complexity of evaluating the output of a DReX program on a given input string. It turns out that the natural evaluation algorithm involves dynamic programming, leading to complexity that is cubic in the length of the input string. Our main contribution is identifying a consistency restriction on the use of combinators in DReX programs, and a single-pass evaluation algorithm for consistent programs with time complexity that is linear in the length of the input string and polynomial in the size of the program. We show that the consistency restriction does not limit the expressiveness, and whether a DReX program is consistent can be checked efficiently. We report on a prototype implementation, and evaluate it using a representative set of text processing tasks.

Regular bulk solutions and black strings from dynamical braneworlds with variable tension

Regular black strings solutions associated to a dynamical Friedmann-Robertson-Walker braneworld are obtained as a particular case of a regular bulk metric, in the context of a variable brane tension. By analyzing the 5D Kretschmann invariants, we show that the variable brane tension is capable to remove bulk singularities, along some eras of the evolution of the Universe. In particular, the black string time-dependent profile in the bulk is analyzed in the context of the McVittie metric on an E\"otv\"os fluid braneworld, wherein the fluid dynamical brane tension depends on the brane temperature. The whole bulk is shown to be regular for a Universe dominated by non-relativistic matter or by relativistic matter/radiation, as the cosmological time elapses. In a particular case the associated black strings are shown to have finite extension along the extra dimension, what prominently modify the higher-dimensional physical singularities. For a Universe dominated by matter or radiation, we show that the brane singularities are removed along the extra dimension, as an effect of the variable brane tension, corresponding also to the vanishing of the black string horizon. In this case there is a regular solution in the bulk. We show further that no additional physical singularity is introduced in the bulk when the Universe is dominated by a cosmological constant.

New helical folds in α-peptides with alternating chirality.

In α-peptides, the 8/10 helix is theoretically predicted to be energetically unstable and has not been experimentally observed so far. Based on our earlier studies on 'helical induction' and 'hybrid helices', we have adopted the 'end-capping' strategy to induce the 8/10 helix in α-peptides by using short α/β-peptides. Thus, α-peptides containing a regular string of α-amino acids with alternating chirality were end capped by α/β-peptides with 11/9-helical motifs at the termini. Extensive NMR spectroscopy studies of these peptides revealed the presence of a hitherto unknown 8/10-helical pattern; the H-bonds in the shorter pseudorings were rather weak. The approach of using short helical motifs to induce new mixed helices in α-peptides could provide avenues for more versatile design strategies.

Non-extremal and non-BPS extremal five-dimensional black strings from generalized special real geometry

We construct non-extremal as well as extremal black string solutions in minimal five-dimensional supergravity coupled to vector multiplets using dimensional reduction to three Euclidean dimensions. Our method does not assume that the scalar manifold is a symmetric space, and applies as well to a class of non-supersymmetric theories governed by a generalization of special real geometry. We find that five-dimensional black string solutions correspond to geodesics in a specific totally geodesic para-Kähler submanifold of the scalar manifold of the dimensionally reduced theory, and identify the subset of geodesics that corresponds to regular black string solutions in five dimensions. Extremal solutions are distinguished by whether or not the corresponding geodesics are along the eigendirections of the para-complex structure, which for supersymmetric theories reduces to the usual notion of BPS and non-BPS solutions. For non-extremal black strings the values of the scalars at the outer and inner horizon are not independent integration constants but determined by certain functions of the charges and moduli. By lifting solutions from three to four dimensions we obtain non-extremal versions of small black holes, and find that while the outer horizon takes finite size, the inner horizon is still degenerate.