‎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 sh...

The that-trace effect is the fact that many languages (like English) ban extraction of embedded-clause subjects but not objects over an overt complementizer like that, while other Spanish) allow such extractions. and its cross-linguistic variation have been subject intense research remain largely a mystery, with no clear consensus on their underpinnings. We contribute novel evidence to these de...

As additive manufacturing expands into multi-material, there is a demand for efficient multi-material topology optimization, where one must simultaneously optimize the topology, and the distribution of various materials within the topology. The classic approach to multi-material optimization is to minimize compliance or stress while imposing two sets of constraints: (1) a total volume constrain...

We present and use a CPU-efficient activity-based simulation model to calculate the sojourn time of a packet and the packet loss rate in a tandem queueing network that depicts the path of a video flow. The video flow is characterized by a packet trace. Background traffic, also characterized by a trace, is allowed in the tandem queueing network. In our analysis we used real video traces (Telepre...

The report proposes a theoretical approach of the debugging of constraint programs based on the notion of explanation tree (D1.1.1 and D1.1.2 part 2). The proposed approach is an attempt to adapt algorithmic debugging to constraint programming. In this theoretical framework for domain reduction, explanations are proof trees explaining value removals. These proof trees are defined by inductive d...

Introduction This paper proposes a model for explanations in a set theoretical framework using the notions of closure or fixpoint. In this approach, sets of rules associated with monotonic operators allow to define proof trees (Aczel 1977). The proof trees may be considered as a declarative view of the trace of a computation. We claim they are explanations of the result of a computation. First,...

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...

The success of many machine learning and pattern recognition methods relies heavily upon the identification of an appropriate distance metric on the input data. It is often beneficial to learn such a metric from the input training data, instead of using a default one such as the Euclidean distance. In this work, we propose a boosting-based technique, termed BOOSTMETRIC, for learning a quadratic...

Statistical conditional optimization criteria lead to the development of an iterative algorithm that starts from the matched filter (or constraint vector) and generates a sequence of filters that converges to the minimum-variance-distortionless-response (MVDR) solution for any positive definite input autocorrelation matrix. Computationally, the algorithm is a simple, noninvasive, recursive proc...

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...