in this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. in this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. to tackle the problem efficiently and effectively, an effici...

rust caused by phakopsora pachyrhizi syd. is a major constraint to soybean product in asia. early detection and possibilities of controlling plant diseases by the integration of several image processing methods has been the subject of extensive research. the main contribution of this paper is to present different methodologies for quantitatively detecting soybean rust at each stage of disease d...

We study an economy populated by three groups of myopic agents: Constrained agents subject to a portfolio constraint that limits their risk-taking, unconstrained agents subject to a standard nonnegative wealth constraint, and arbitrageurs with access to a credit facility. Such credit is valuable as it allows arbitrageurs to exploit the limited arbitrage opportunities that emerge endogenously in...

In the present note we discuss in details the Riemann problem for a one-dimensional hyperbolic conservation law subject to a point constraint. We investigate how the regularity of the constraint operator impacts the well--posedness of the problem, namely in the case, relevant for numerical applications, of a discretized exit capacity. We devote particular attention to the case in which the cons...

An algorithm that constructs a continuous piecewise linear representation, subject to a certain slope/segment length constraint, of a given set of data is described. The algorithm yields an optimal or near optimal representation, subject to this constraint, in the L∞ norm and does so in at worst O(nK) time, where n is the number of data points and K the number of segments. The constraint is det...

This paper studies the ANOVA decomposition of a d-variate function f defined on the whole of Rd, where f is the maximum of a smooth function and zero (or f could be the absolute value of a smooth function). Our study is motivated by option pricing problems. We show that under suitable conditions all terms of the ANOVA decomposition, except the one of highest order, can have unlimited smoothness...

Process discovery algorithms typically aim at discovering process models from event logs. Most discovery algorithms discover the model based on an event log, without allowing the domain expert to influence the discovery approach in any way. However, the user may have certain domain expertise which should be exploited to create a better process model. In this paper, we address this issue of inco...

QA-by-Dossier-with-Constraints is a new approach to Question Answering whereby candidate answers’ confidences are adjusted by asking auxiliary questions whose answers constrain the original answers. These constraints emerge naturally from the domain of interest, and enable application of real-world knowledge to QA. We show that our approach significantly improves system performance (75% relativ...

In this paper, we used Lyapunov theory and Linear Matrix Inequalities (LMI) to design a generalized observer by adding more complexity in the output of dynamic systems. Our designed is based on optimization problem, minimizing error between trajectories master slave systems subject incremental quadratic constraint. Moreover, an algorithm given our paper demonstrate method for obtaining desired ...