The present study aimed to develop effective moral educational interventions based on social psychology by using stories of moral exemplars. We tested whether motivation to engage in voluntary service as a form of moral behavior was better promoted by attainable and relevant exemplars or by unattainable and irrelevant exemplars. First, experiment 1, conducted in a lab, showed that stories of at...

Abstract. We consider a controlled system of differential equations modeling a firm that takes a loan in order to expand its production activities. The objective is to determine the optimal loan repayment schedule using the variables of the business current profitability, the bank’s interest rate on the loan and the cost of reinvestment of capital. The portion of the annual profit which a firm ...

We study online learning where a decision maker interacts with Nature with the objective of maximizing her long-term average reward subject to some sample path average constraints. We define the reward-in-hindsight as the highest reward the decision maker could have achieved, while satisfying the constraints, had she known Nature’s choices in advance. We show that in general the reward-in-hinds...

Considering a controllable, square, linear multivariable system, which is decouplable by static state feedback, we completely characterize in this paper the structure of the decoupled closed-loop system. The family of all attainable transfer function matrices for the decoupled closed-loop system is characterized, which also completely establishes all possible combinations of attainable finite p...

The hidden meaning of Cloud Computing is entering or storing or sharing the data on the internet. In accustomed scheme, cloud computing is spreading and growing day by day and become most important factor in industries both government or private industries. An extreme concern in cloud computing paradigm is proper load balancing over the attainable resources. Assorted Load balancing algorithm an...

In quantum cryptography, the level of security attainable by a protocol which implements a particular task N times bears no simple relation to the level of security attainable by a protocol implementing the task once. Useful partial security, and even near-perfect security in an appropriate sense, can be obtained for N copies of a task which itself cannot be securely implemented. We illustrate ...