This paper proposes a new algorithm for the solution of fully fuzzy Multi objective linear programming problems involving triangular fuzzy number without converting them to equivalent classical problems. Based on the fuzzy ideal and fuzzy negative ideal solution of each single fuzzy objective function we propose an algorithm which provides a fuzzy Pareto-optimal solution for the given fully fuz...

A repeated game is a formal model for analyzing cooperation in long-term relationships. The case where each player observes her opponent’s action with some observation errors (imperfect private monitoring) is difficult to analyze, and existing works show that cooperative relations can be sustainable only in ideal situations. We deal with a generic problem that can model both the prisoner’s dile...

ion, encapsulation, and information hiding. These can be difficult concepts to apply, especially for those accustomed to a structured or functional approach. The guidelines can be especially helpful for those who begin using Ada with no experience in design or those with only programming experience in assembler languages. The guidelines can also be used as an important part of design and code r...

We perform Monte Carlo simulations of a four-dimensional gauge invariant spin system which describes random surfaces with gonihedric action. We develop the analogy between the flat-crumpled phase transition of the lattice surface model and the liquid-gas phase transition of non-ideal gases, and identify the self-intersection coupling constant k of the surface model with the pressure P. As k inc...

Infinitesimal robustness employs first order asymptotics to derive results on uniform (weak) convergence on shrinking neighborhoods around an ideal central model. In the case of the median in the one–dimensional location setup, we refine such a result concerning the convergence of the MSE, proceeding to higher order asymptotics — up to order 1/n , for sample size n . In contrast to usual higher...

A simple modification of existing divisible load scheduling algorithms, boosting link speed by M for M parallel channels per link, allows time optimal load scheduling and performance prediction for parallel channel systems. The situation for multicore models is more complex but can be handled by a substitution involving equivalent processor speed. These modifications yield upper bounds on such ...

In this work we consider how to enforce norms in the Situation Calculus based programming language Golog and its relatives. We define a notion of norm compliant sequence of actions with respect to norms prescribing some actions to be forbidden or obliged (ought-to-do norms), norms prescribing that a state-condition is forbidden (oughtto-be norms) and norms that are a form of deadline. We then s...

The concept of indirectness (using of tools) in automatic problem solving is investigated, and a formal approach is suggested within the framework of the Situation Calculus. The "Robot and Box" problem serves as an illustrative example throughout the paper.

The situation calculus is a logical formalism that has been extensively developed for planning. We apply the formalism in a complex multi-agent domain, modelled on the game of Clue. We find that the situation calculus, with suitable extensions, supplies a unified representation of (1) the interaction protocol, or structure of the game, (2) the dynamics of the knowledge and common knowledge of t...

Business Process Verification (BPV) works as one of the important functions in the emerging Business Process Management Systems. Current proposed approaches are not yet well applied because of the gap between formal models defined in the academia and informal models used in the industry. This paper attempts to propose a hybrid approach to solve this problem. XPDL will be used to describe busine...