introduction: the critical dependence of healthcare services systems on information along with the indigenous restriction of paper documents in satisfying this need has caused a trend toward computer information systems. the main goal of such systems is to achieve electronic health records (ehr). however, implementation of ehr in healthcare organizations is difficult and complicated. this resea...

Multi-leader multi-follower games are a class of hierarchical games in which a collection of leaders compete in a Nash game constrained by the equilibrium conditions of another Nash game amongst the followers. Much of the extant research on this topic is either model specific or relies on weaker notions of equilibria. We observe that when this original game is modified to ensure that the leader...

the purpose of this research is to study the effects of board of director structure on financing constraints for the companies listed on tehran stock exchange (tse). for this purpose, indigenised kaplan and zingales (kz) index  has been used as a proxy for financing constraints. the population consists of 56 companies of tse spanning 2007-2013 and the multivariate logistic regression is used. t...

Philosophers have often noted a contrast between practical and theoretical reasons when it comes to cases involving equally balanced reasons. When there are strong for A-ing, some incompatible option, B-ing, the agent is permitted make an arbitrary choice them, having sufficient reason A B. But evidence P ~ P, one isn’t simply believe or other. Instead, must withhold belief, neither believing t...

This paper proposes the methodology to evaluate the road network anti-hazardous ability by the concept of network capacity reliability. The methodology proposed here considers the area-traffic regulation, which may be implemented when a large disaster occurs in Japan. The model to calculate entry permission rates is formulated as MPEC (Mathematical Programming with Equilibrium Constraints) in w...

Mathematical programs whose formulation is symmetric often take a long time to solve using Branch-and-Bound type algorithms, because of the several symmetric optima. A simple technique used in these cases is to adjoin symmetry breaking constraints to the formulation before solving the problem. These constraints: (a) aim to guarantee that at least one optimum is feasible, whilst making some of t...

Many CSPs can be effectively represented and efficiently solved using matrix models, in which the matrices may have symmetry between their rows and/or columns. Eliminating all such symmetry can be very costly as there are in general exponentially many symmetries. Cost-effective methods have been proposed to break much of the symmetry, if not all. In this paper, we continue with this line of res...

We review research on the ̄uency heuristic as a basis for the subjective experience of familiarity. Then, we explore the links between the construct of ̄uency and the automatic versus consciously controlled memory processes that are estimated using the process dissociation procedure, and the phenomenological experiences studied using ``Remember'' and ``Know'' judgements. Although the ̄uency tha...