the realization optimality theory is a recent development in the original optimality theory which is proposed to deal with morphological issues especially the inflectional ones. its main idea is to consider the morphological realization rules as ranked violable language-specific constraints that control the realization processes and provide phonological information of grammatical morphemes. thi...

We propose a re-formulation of the Einstein evolution equations that cleanly separates the conformal degrees of freedom and the non-conformal degrees of freedom with the latter satisfying a first order strongly hyperbolic system. The conformal degrees of freedom are taken to be determined by the choice of slicing and the initial data, and are regarded as given functions (along with the lapse an...

This paper studies the situation in which the system under test and the system model are distributed and have the same structure; they have corresponding remote components that communicate asynchronously. In testing, a component with interface Ci has its own local tester that interacts with Ci and this local tester observes a local trace consisting of inputs, outputs and durations as perceived ...

The ZETA system is a Z-based tool environment for developing formal specifications. It contains a component for executing the Z language based on the implementation technique of concurrent constraint resolution. In this paper, we present a case-study for the environment, by providing an executable encoding of temporal interval logics in the Z language. As an application of this setting, test-ca...

Abstract We derive the math (objective and gradients) for three closely-related Gaussian-based data models. All three are based on Factor Analysis (FA). The first is a simplification of FA; the second is FA itself; the third is our extension of FA to use a smooth trace norm prior on the factor loading matrix (in place of the hard rank constraint used by FA). See [3] for some background on Facto...

‎in this paper, using the idea of convexificators, we study boundedness and nonemptiness of lagrange multipliers satisfying the first order necessary conditions. we consider a class of nons- mooth fractional programming problems with equality, inequality constraints and an arbitrary set constraint. within this context, define generalized mangasarian-fromovitz constraint qualification and show t...

There exist several important empirical and theoretical issues in dealing with English wh-questions. Among these are syntactic connectivity between the wh-filler and its putative gap, so-called that-trace effect, and constraints in the formation of infinitival wh-questions. Many attempts have been made to account for these, but few succeeded in obtaining satisfactory support. This paper offers ...

Business process enactment is generally supported by information systems that record data about process executions, which can be extracted as event logs. Predictive process monitoring is concerned with exploiting such event logs to predict how running (uncompleted) cases will unfold up to their completion. In this paper, we propose a predictive process monitoring framework for estimating the pr...

When formalizing security protocols, different specification languages support very different reasoning methodologies, whose results are not directly or easily comparable. Therefore, establishing clear mappings among different frameworks is highly desirable, as it permits various methodologies to cooperate by interpreting theoretical and practical results of one system in another. In this paper...