104,920 research outputs found
A Study of Sindhi Related and Arabic Script Adapted languages Recognition
A large number of publications are available for the Optical Character
Recognition (OCR). Significant researches, as well as articles are present for
the Latin, Chinese and Japanese scripts. Arabic script is also one of mature
script from OCR perspective. The adaptive languages which share Arabic script
or its extended characters; still lacking the OCRs for their language. In this
paper we present the efforts of researchers on Arabic and its related and
adapted languages. This survey is organized in different sections, in which
introduction is followed by properties of Sindhi Language. OCR process
techniques and methods used by various researchers are presented. The last
section is dedicated for future work and conclusion is also discussed.Comment: 11 pages, 8 Figures, Sindh Univ. Res. Jour. (Sci. Ser.
Abstract State Machines 1988-1998: Commented ASM Bibliography
An annotated bibliography of papers which deal with or use Abstract State
Machines (ASMs), as of January 1998.Comment: Also maintained as a BibTeX file at http://www.eecs.umich.edu/gasm
A Survey on Continuous Time Computations
We provide an overview of theories of continuous time computation. These
theories allow us to understand both the hardness of questions related to
continuous time dynamical systems and the computational power of continuous
time analog models. We survey the existing models, summarizing results, and
point to relevant references in the literature
Mathematical Logic in Computer Science
The article retraces major events and milestones in the mutual influences
between mathematical logic and computer science since the 1950s
Four-valued monitorability of -regular languages
Runtime Verification (RV) is a lightweight formal technique in which program
or system execution is monitored and analyzed, to check whether certain
properties are satisfied or violated after a finite number of steps. The use of
RV has led to interest in deciding whether a property is monitorable: whether
it is always possible for the satisfaction or violation of the property to be
determined after a finite future continuation. However, classical two-valued
monitorability suffers from two inherent limitations. First, a property can
only be evaluated as monitorable or non-monitorable; no information is
available regarding whether only one verdict (satisfaction or violation) can be
detected. Second, monitorability is defined at the language-level and does not
tell us whether satisfaction or violation can be detected starting from the
current monitor state during system execution.
To address these limitations, this paper proposes a new notion of four-valued
monitorability for -languages and applies it at the state-level.
Four-valued monitorability is more informative than two-valued monitorability
as a property can be evaluated as a four-valued result, denoting that only
satisfaction, only violation, or both are active for a monitorable property. We
can also compute state-level weak monitorability, i.e., whether satisfaction or
violation can be detected starting from a given state in a monitor, which
enables state-level optimizations of monitoring algorithms. Based on a new
six-valued semantics, we propose procedures for computing four-valued
monitorability of -regular languages, both at the language-level and at
the state-level. We have developed a new tool that implements the proposed
procedure for computing monitorability of LTL formulas.Comment: 16 page
Logic Column 14: Nominal Logic and Abstract Syntax
Formalizing syntactic proofs of properties of logics, programming languages,
security protocols, and other formal systems is a significant challenge, in
large part because of the obligation to handle name-binding correctly. We
present an approach called nominal abstract syntax that has attracted
considerable interest since its introduction approximately six years ago. After
an overview of other approaches, we describe nominal abstract syntax and
nominal logic, a logic for reasoning about nominal abstract syntax. We also
discuss applications of nominal techniques to programming, automated reasoning,
and identify some future directions.Comment: 24 page
A Comparison of NOOP to Structural Domain-Theoretic Models of OOP
Mainstream object-oriented programming languages such as Java, C#, C++ and
Scala are all almost entirely nominally-typed. NOOP is a recently developed
domain-theoretic model of OOP that was designed to include full nominal
information found in nominally-typed OOP. This paper compares NOOP to the most
widely known domain-theoretic models of OOP, namely, the models developed by
Cardelli and Cook, which were structurally-typed models. Leveraging the
development of NOOP, the comparison presented in this paper provides a clear
and precise mathematical account for the relation between nominal and
structural OO type systems.Comment: 17 page
Universal, Unsupervised (Rule-Based), Uncovered Sentiment Analysis
We present a novel unsupervised approach for multilingual sentiment analysis
driven by compositional syntax-based rules. On the one hand, we exploit some of
the main advantages of unsupervised algorithms: (1) the interpretability of
their output, in contrast with most supervised models, which behave as a black
box and (2) their robustness across different corpora and domains. On the other
hand, by introducing the concept of compositional operations and exploiting
syntactic information in the form of universal dependencies, we tackle one of
their main drawbacks: their rigidity on data that are structured differently
depending on the language concerned. Experiments show an improvement both over
existing unsupervised methods, and over state-of-the-art supervised models when
evaluating outside their corpus of origin. Experiments also show how the same
compositional operations can be shared across languages. The system is
available at http://www.grupolys.org/software/UUUSA/Comment: 19 pages, 5 Tables, 6 Figures. This is the authors version of a work
that was accepted for publication in Knowledge-Based System
A General Overview of Formal Languages for Individual-Based Modelling of Ecosystems
Various formal languages have been proposed in the literature for the
individual-based modelling of ecological systems. These languages differ in
their treatment of time and space. Each modelling language offers a distinct
view and techniques for analyzing systems. Most of the languages are based on
process calculi or P systems. In this article, we present a general overview of
the existing modelling languages based on process calculi. We also discuss,
briefly, other approaches such as P systems, cellular automata and Petri nets.
Finally, we show advantages and disadvantages of these modelling languages and
we propose some future research directions.Comment: arXiv admin note: text overlap with arXiv:1610.08171 by other author
Revisiting Elementary Denotational Semantics
Operational semantics have been enormously successful, in large part due to
its flexibility and simplicity, but they are not compositional. Denotational
semantics, on the other hand, are compositional but the lattice-theoretic
models are complex and difficult to scale to large languages. However, there
are elementary models of the -calculus that are much less complex: by
Coppo, Dezani-Ciancaglini, and Salle (1979), Engeler (1981), and Plotkin
(1993).
This paper takes first steps toward answering the question: can elementary
models be good for the day-to-day work of language specification,
mechanization, and compiler correctness? The elementary models in the
literature are simple, but they are not as intuitive as they could be. To
remedy this, we create a new model that represents functions literally as
finite graphs. Regarding mechanization, we give the first machine-checked proof
of soundness and completeness of an elementary model with respect to an
operational semantics. Regarding compiler correctness, we define a polyvariant
inliner for the call-by-value -calculus and prove that its output is
contextually equivalent to its input. Toward scaling elementary models to
larger languages, we formulate our semantics in a monadic style, give a
semantics for System F with general recursion, and mechanize the proof of type
soundness.Comment: 25 pages, revision of POPL 2018 submission, now under submission to
ESOP 201
- …