Program inversion has been successfully applied to several areas such as optimistic parallel discrete event simulation (OPDES) and reverse debugging. This paper introduces a new program inversion algorithm for imperative languages, and focuses on handling arbitrary control flows and basic operations. By building a value search graph that represents recoverability relationships between variable ...

    In this paper, a new revenue efficiency data envelopment analysis (RE-DEA) approach is considered for finding the most revenue efficient unit with price uncertainty in both optimistic and pessimistic perspectives. The optimistic and pessimistic perspectives use efficient frontier and inefficient frontier, respectively. An integrated model is introduced to find decision making units (DMUs) t...

To address the adaptive value of optimism/pessimism an operational definition is required. I define a behavioural decision as relatively optimistic if it is consistent with the animal having either, a higher expectation of reward, or a lower expectation of punishment (threat), than the same animal in a different state (or a different animal). Pessimism is the inverse of optimism. Such relative ...

The use of versioned data has proven its value in many areas of Computer Science including concurrency control. In this paper we examine the use of versioned objects in object bases for the purpose of enhancing concurrency. We provide a framework for discussing multi-version objects which includes fundamental deenitions, the abstraction of objects as automata and a model of object method execut...

Transactional Memory(TM) is an optimistic speculative synchronization scheme that provides atomic execution for a region of code marked as a transaction by the programmer. TM avoids many of the problems associated with mutual-exclusion-based synchronization and can make writing parallel programs relatively easier. Programs with critical sections that are not heavily contended benefit from the o...

The stochastic non-linear fractional knapsack problem is a challenging optimization problem with numerous applications, including resource allocation. The goal is to find the most valuable mix of materials that fits within a knapsack of fixed capacity. When the value functions of the involved materials are fully known and differentiable, the most valuable mixture can be found by direct applicat...

Managers make decisions on behalf of shareholders. In this context, financial economists have promoted executive stock options as a means to realign the incentives of managers with those of shareholders. We argue that overconfidence and optimism, which are likely to characterize managers, provide an alternative solution to this agency problem. Whereas risk-averse rational managers tend to postp...

We consider two-player zero-sum games with countably infinite action spaces and bounded payoff functions. The players’ strategies are finitely additive probability measures, called charges. Since a strategy profile does not always induce a unique expected payoff, we distinguish two extreme attitudes of players. A player is viewed as pessimistic if he always evaluates the range of possible expec...