Background: MRI facilitates early recognition of rheumatoid arthritis (RA) by depicting inflammation. Contrast-enhanced T1-weighted and T2-weighted fat-suppressed sequences have been sensitive thus recommended, but are hampered invasiveness, costs long scan time. Therefore we introduced a modified Dixon-sequence (mDixon) which is more patient-friendly, reduces cost, times 83%. However, it not k...

The sequence selected from a sequence R(0)R(1) . . . by a language L is the subsequence of all bits R(n + 1) such that the prefix R(0) . . . R(n) is in L. By a result of Agafonoff [1], a sequence is normal if and only if any subsequence selected by a regular language is again normal. Kamae and Weiss [11] and others have raised the question of how complex a language must be such that selecting a...

Abstract A sequence is said to be k-automatic if the nth term of this sequence is generated by a finite state machine with n in base k as input. Regular sequences were first defined by Allouche and Shallit as a generalization of automatic sequences. Given a prime p and a polynomial f(x) ∈ Qp[x], we consider the sequence {vp(f(n))}n=0, where vp is the p-adic valuation. We show that this sequence...

We show that the abelian complexity function of the ordinary paperfolding word is a 2-regular sequence.

Abstract Sequence theories are an extension of strings with infinite alphabet letters, together a corresponding theory (e.g. linear integer arithmetic). Sequences natural abstractions extendable arrays, which permit wealth operations including append, map, split, and concatenation. In spite the growing amount tool support for sequences by leading SMT-solvers, little is known about decidability ...

Inspired by RNA-editing as occurs in transcriptional processes in the living cell, we introduce an abstract notion of string adjustment, called guided rewriting. This formalism allows simultaneously inserting and deleting elements. We prove that guided rewriting preserves regularity: for every regular language its closure under guided rewriting is regular too. This contrasts an earlier abstract...

We define a new notation called netcharts for describing sets of message sequence chart scenarios (MSCs). Netcharts correspond to a distributed version of High-level Message Sequence Charts (HMSCs). Netcharts improve on HMSCs in two respects. (i) Netcharts admit a natural and direct translation into communicating finite-state machines, unlike HMSCs, for which the realization problem is nontrivi...

For the set of graphs with a given degree sequence, consisting of any number of 2s and 1s, and its subset of bipartite graphs, we characterize the optimal graphs who maximize and minimize the number of m-matchings. We find the expected value of the number of m-matchings of r-regular bipartite graphs on 2n vertices with respect to the two standard measures. We state and discuss the conjectured u...

Regular expressions are extremely useful, because they allow us to work with text in terms of patterns. They are considered the most sophisticated means of performing operations such as string searching, manipulation, validation, and formatting in all applications that deal with text data. Character recognition problem scenarios in sequence analysis that are ideally suited for the application o...

ABanach space B is said to satisfy the Banach-Saks property with respect a regular summability method if every bounded subsequence has summable subsequence. We show that Banach satisfies Robison-Hamilton method, for double sequence there exists ?-subsequence whose subsequences are all same limit.