With the emergence of Role Based Access Control (RBAC) as the de facto access control model, organizations can now implement and manage many high level security policies. As a means of migration from traditional access control systems to RBAC, di↵erent role mining algorithms have been proposed in recent years for finding a minimal set of roles from existing user-permission assignments. While de...

Given a network and a set of source destination pairs (connections), we consider the problem of maximizing the sum of the flow under proportional delay constraints. In this paper, the delay for crossing a link is proportional to the total flow crossing this link. If a connection supports non-zero flow, then the sum of the delay along any path corresponding to that connection must be lower than ...

In this paper we study the protein structure comparison problem where each protein is modeled as a sequence of 3D points, and a contact edge is placed between every two of these points that are sufficiently close. Given two proteins represented this way, our problem is to find a subset of points from each protein, and a bijective matching of points between these two subsets, with the objective ...

To maximize the daily production from an oil and gas field, mathematical optimization may be used to find the optimal operating point. When optimizing, a model of the system is used to predict the outcome for different operating points. The model is, however, subject to uncertainty, e.g., the gas oil ratio estimates may be imprecise. The uncertainty is often ignored, and what is known as the ex...

Decision making is indispensable to any optimization in intelligent computing. In this study, we discuss a mathematical foundation for bilateral decision making under synchronous and asynchronous time constraint. The problem on time constraint is to evaluate the cost of time or the value of the entire duration of certain decision process. We propose a formula to compute the cost of time by intr...

In many real-life optimization problems involving multiple agents, the rewards are not necessarily known exactly in advance, but rather depend on sources of exogenous uncertainty. For instance, delivery companies might have to coordinate to choose who should serve which foreseen customer, under uncertainty in the locations of the customers. The framework of Distributed Constraint Optimization u...

We present a new approach to solve optimal control problems of the monotone follower type. The key feature of our approach is that it allows to include an arbitrary dynamic fuel constraint. Instead of dynamic programming, we use the convexity of our cost functional to derive a first order characterization of optimal policies based on the Snell envelope of the objective functional’s gradient at ...

a concept of weak $f$-property for a set-valued mapping is introduced‎, ‎and then under some suitable assumptions‎, ‎which do not involve any information‎ ‎about the solution set‎, ‎the lower semicontinuity of the solution mapping to‎ ‎the parametric‎ ‎set-valued vector equilibrium-like problems are derived by using a density result and scalarization method‎, ‎where the‎ ‎constraint set $k$...

Physicians all through the world visit patients under time limitations. The most important troubled clinical skill under "time constraint" is the diagnostic approach. In this situation, clinicians need some diagnostic approaches to reduce both diagnostic time and errors. It seems that highly experienced physicians utilize some special tactics in this regard. Evidence-based medicine (EBM) as a r...

‎This paper proposes a new form of optimization problem which is a two-level programming problem with infinitely many lower level constraints‎. ‎Firstly‎, ‎we consider some lower level constraint qualifications (CQs) for this problem‎. ‎Then‎, ‎under these CQs‎, ‎we derive formula for estimating the subdifferential of its valued function‎. ‎Finally‎, ‎we present some necessary optimality condit...