Rewriting systems and biautomatic structures for Chinese, hypoplactic, and sylvester monoids

This paper studies complete rewriting systems and biautomaticity for three interesting classes of finite-rank homogeneous monoids: Chinese monoids, hypoplactic monoids, and sylvester monoids. For Chinese monoids, we first give new presentations via finite complete rewriting systems, using more lucid constructions and proofs than those given independently by Chen & Qui and Güzel Karpuz; we then construct biautomatic structures. For hypoplactic monoids, we construct finite complete rewriting systems and biautomatic structures. For sylvester monoids, which are not finitely presented, we prove that the standard presentation is an infinite complete rewriting system, and construct biautomatic structures. Consequently, the monoid algebras corresponding to monoids of these classes are automaton algebras in the sense of Ufnarovskij

Children's Foreign Language Anxiety Scale: Preliminary Tests of Reliability and Validity

Foreign language anxiety (FLA), which constitutes a serious problem in the foreign language learning process, has been mainly seen as a research issue regarding adult language learners, while it has been overlooked in children. This is because there is a lack of appropriate tools to measure FLA among children, whereas there are many studies on the scales that aim to measure anxiety levels among adult learners. Thus, the current study aims to conduct the preliminary tests of reliability and validity of the Children's Foreign Language Anxiety Scale (CFLAS) and to report on the pilot examination of reliability, validity and factor structure of the CFLAS. The findings of the pilot study show that CFLAS is a reliable and valid tool to measure FLA levels among children who learn English as a foreign language (EFL) within the age range of 7-12 in a Turkish EFL context

Biologically modified microelectrode sensors provide enhanced sensitivity for detection of nucleic acid sequences from Mycobacterium tuberculosis

This paper describes improved sensitivity when using biosensors based on microfabricated microelectrodes to detect DNA, with the goal of progressing towards a low cost and mass manufacturable assay for antibiotic resistance in tuberculosis (TB). The microelectrodes gave a near 20 times improvement in sensitivity compared to polycrystalline macroelectrodes. In addition, experimental parameters such as redox mediator concentration and experimental technique were investigated and optimised. It was found that lower concentrations of redox mediator gave higher signal changes when measuring hybridisation events and, at these lower concentrations, square wave voltammetry was more sensitive and consistent than differential pulse voltammetry. Together, this paper presents a quantifiable comparison of macroelectrode and microelectrode DNA biosensors. The final assay demonstrates enhanced sensitivity through reduction of sensor size, reduction of redox mediator concentration and judicious choice of detection technique, therefore maintaining manufacturability for incorporation into point of care tests and lab-on-a-chip devices

Application of the linear principle for the strongly-correlated variables: Calculations of differences between spectra

In this paper the authors suggest a new method of detection of possible differences between similar near infrared (NIR) spectra based on the self-similar (fractal) property. This property is a general characteristic that belongs to a wide class of the strongly-correlated systems. As an example we take a set of NIR spectra measured for three systems: (1) glassy carbon (GC) electrodes, (2) GC electrodes affected by azobenzene (AB) substance and finally (3) films (AB-FILM). Besides the physical model that should describe the intrinsic properties of these substances we found the fitting function that follow from the linear principle for the strongly-correlated variables. This function expressed in the form of linear combination of 4 power-law functions describes with the high accuracy the integrated curves that were obtained from the averaged values of the initially measured spectra. The nine fitting parameters can be considered as the quantitative "finger prints" for detection of the differences between similar spectra. Besides this result we established the self-similar behavior of the remnant functions. In other words, the difference between the initially integrated function and its fitting function can be expressed in the form of linear combinations of periodical functions having a set of frequencies following to relationship ω(k)=ω0ξk, where the initial frequency ω0 and scaling factor ξ are determined by the eigen-coordinates method. This behavior in the NIR spectra was discovered in the first time and physical reasons of such behavior merit an additional research. © 2011

Two-dimensional rule language for querying sensor log data: a framework and use cases

Motivated by two industrial use cases that involve detecting events of interest in (asynchronous) time series from sensors in manufacturing rigs and gas turbines, we design an expressive rule language DslD equipped with interval aggregate functions (such as weighted average over a time interval), Allen’s interval relations and various metric constructs. We demonstrate how to model events in the uses cases in terms of DslD programs. We show that answering DslD queries in our use cases can be reduced to evaluating SQL queries. Our experiments with the use cases, carried out on the Apache Spark system, show that such SQL queries scale well on large real-world datasets

The virtual knowledge graph system Ontop

Ontop is a popular open-source virtual knowledge graph system that can expose heterogeneous data sources as a unified knowledge graph. Ontop has been widely used in a variety of research and industrial projects. In this paper, we describe the challenges, design choices, new features of the latest release of Ontop v4, summarizing the development efforts of the last 4 years

Finite Gr\"obner--Shirshov bases for Plactic algebras and biautomatic structures for Plactic monoids

This paper shows that every Plactic algebra of finite rank admits a finite Gr\"obner--Shirshov basis. The result is proved by using the combinatorial properties of Young tableaux to construct a finite complete rewriting system for the corresponding Plactic monoid, which also yields the corollaries that Plactic monoids of finite rank have finite derivation type and satisfy the homological finiteness properties left and right $FP_\infty$. Also, answering a question of Zelmanov, we apply this rewriting system and other techniques to show that Plactic monoids of finite rank are biautomatic.Comment: 16 pages; 3 figures. Minor revision: typos fixed; figures redrawn; references update

On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids

This paper investigates the class of finitely presented monoids defined by homogeneous (length-preserving) relations from a computational perspective. The properties of admitting a finite complete rewriting system, having finite derivation type, being automatic, and being biautomatic are investigated for this class of monoids. The first main result shows that for any consistent combination of these properties and their negations, there is a homogeneous monoid with exactly this combination of properties. We then introduce the new concept of abstract Rees-commensurability (an analogue of the notion of abstract commensurability for groups) in order to extend this result to show that the same statement holds even if one restricts attention to the class of n-ary homogeneous monoids (where every side of every relation has fixed length n). We then introduce a new encoding technique that allows us to extend the result partially to the class of n-ary multihomogenous monoids

On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids

This paper investigates the class of finitely presented monoids defined by homogeneous (length-preserving) relations from a computational perspective. The properties of admitting a finite complete rewriting system, having finite derivation type, being automatic, and being biautomatic are investigated for this class of monoids. The first main result shows that for any consistent combination of these properties and their negations, there is a homogeneous monoid with exactly this combination of properties. We then introduce the new concept of abstract Rees-commensurability (an analogue of the notion of abstract commensurability for groups) in order to extend this result to show that the same statement holds even if one restricts attention to the class of n-ary homogeneous monoids (where every side of every relation has fixed length n). We then introduce a new encoding technique that allows us to extend the result partially to the class of n-ary multihomogenous monoids