Quantifying the semantic relatedness of two terms is a field with vast amounts of research, as the knowledge provided by it has applications for many Natural Language Processing problems. While many algorithmic measures have been proposed, it is often hard to say if one measure outperforms another, since their evaluation often lacks meaningful comparisons to human judgement on semantic relatedn...

Parametric timing constraints are expressed naturally in timing diagram logics. Algorithmic veriication of parametrically constrained timing properties is a diicult problem, known to be undecidable in most general cases. This paper establishes that a class of parametrically constrained timing properties can be veriied algorithmically against nite-state systems; alternatively stated, containment...

In this report, we review the connections between regularity theory, low rank approximation of matrices and tensors, and approximate constraint satisfaction problems. Our presentation of the algorithmic aspects of regularity theory follows parts of [1, 2, 7]; wherever possible we cast the material in the modern language advocated by Tao [15]. One main motivation is to understand the power and l...

We have designed and implemented an API for grid computing that can be used for developing grid-distributed parallel programs without leaving the level of the language in which the core application is written. Our software framework is able to utilize the information about heterogeneous grid environments in order to adapt the algorithmic structure of parallel programs to the particular situatio...

The paper presents work-in-progress aiming at deploying runtime verification techniques to observe whether state changes in a database system conform with temporal business rules. A high level language for tailoring enterprise database systems with temporal business rules is defined. Furthermore we present an algorithmic framework for checking temporal business rules at runtime, i.e. we recomme...

The algorithmic generation of textual descriptions of real world image sequences requires conceptual knowledge. The algorithmic generation of synthetic image sequences from textual descriptions requires conceptual knowledge, too. An explicit representation formalism for behavioral knowledge based on formal logic is presented which can be utilized in both tasks – Understanding and Creation of vi...

In this paper we present the first comprehensive debugger for the algorithmic subset of the Modelica language, which augments previous work in our group on declarative static and dynamic debugging of equations in Modelica. This replaces debugging of algorithmic code using primitive means such as print statements or asserts which is complex, time-consuming and errorprone. The debugger is portabl...

The speeds at which transactions are completed in global financial markets accelerating and, the process, connecting centers around globe like never before. Algorithmic trading...

The process of developing architectural forms has greatly been changed by advances in digital technology, especially in design tools and applications. In recent years, the advent of graphical scripting languages in the design process has profoundly affected 3D modeling. Scripting languages help develop algorithms and geometrical grammar of shapes based on their constituent parameters. This stud...

This study presents an algorithmic method for creating ornaments linked to skeletal base-notes. In developing this model, a data structure for encoding ornament-types is presented. This data structure employs contour theory, variable harmonic scaling, temporal/iterative parameters, and stochastic noise. In order to tune these parameters, the laments and funeral music of the Csángó, a music rich...