for fr$acute{mathbf{text{e}}}$chet algebras $(a, (p_n))$ and $(b, (q_n))$, a linear map $t:arightarrow b$ is textit{almost multiplicative} with respect to $(p_n)$ and $(q_n)$, if there exists $varepsilongeq 0$ such that $q_n(tab - ta tb)leq varepsilon p_n(a) p_n(b),$ for all $n in mathbb{n}$, $a, b in a$, and it is called textit{weakly almost multiplicative} with respect to $(p_n)$ and $(q_n)$,...

The traditional representation of a program as a linear sequence of text forces a particular style of program construction to ensure good programming practice. Tools such as syntax directed editors, compilers, linkers and file managers are required to translate and execute these linear sequences of text. At some stage in the execution sequence the source text is checked for type correctness and...

In this article, we report significant findings resulting from an investigation into the correlation between adjective density, calculated as the proportion of adjectives in word tokens, and degrees of text formality as part of an attempt to examine the potential application of adjectives in automatic text classification and identification. Correlations obtained from the training corpus will be...

The amount of information processed by computers grows very dramatically. Now every application should contain an information searching engine. Let us deal with exact substring matching for one pattern-text pair. There are a lot of pattern matching algorithms with the same function but each of them is optimal in different field. Standard algorithms (Aho-Corasick or Boyer-Moore) sequentially com...

Hypertext is a generalization of the conventional linear text into a non-linear text formed by adding cross-reference and structural links between different pieces of text. A hypertext can be regarded as an extension of a textual database by adding a link structure among the different text objects it stores. We present a tool for finding information in a distributed hypertext such as the World-...

The passage from linear text to hypertext poses the challenge of expressing discourse coherence in non-linear text, where linguistic discourse markers no longer work. While hypertext introduces new possibilities for discourse organisation, it also requires the use of new devices which can support the expression of coherence by exploiting the technical characteristics and expressive richness of ...

The suffix tree of string w is a text indexing structure that represents all suffixes ofw. A sparse suffix tree ofw represents only a subset of suffixes of w. An application to sparse suffix trees is composite pattern discovery from biological sequences. In this paper, we introduce a new data structure named sparse directed acyclic word graphs (SDAWGs), which are a sparse text indexing version ...

Current approaches to electronic implementations of voting protocols involve translating legal text to source code of an imperative programming language. Because the gap between legal text and source code is very large, it is difficult to trust that the program meets its legal specification. In response, we promote linear logic as a high-level language for both specifying and implementing votin...

An exploratory study is described in which the same text was presented to subjects in one of four formats, of which two were hypertext (TIES and Hypercard) and two were linear (Word Processor and paper). Subjects were required to use the text to answer 12 questions. Measurement was made of their time and accuracy and their movement through the document was recorded, in addition to a variety of ...

text classification is an important research field in information retrieval and text mining. the main task in text classification is to assign text documents in predefined categories based on documents’ contents and labeled-training samples. since word detection is a difficult and time consuming task in persian language, bayesian text classifier is an appropriate approach to deal with different...