Anchor DMUs are a new class in the general classification of Decision Making Units (DMUs) in Data Envelopment Analysis (DEA). An anchor DMU in DEA is an extreme-efficient DMU that defines the transition from the efficient frontier to the free-disposability part of the boundary of the Production Possibility Set (PPS). In this paper, the anchor points of the PPS of the CCR model are investigated....

To a convex set in a Banach space we associate a convex function (the separating function), whose subdifferential provides useful information on the nature of the supporting and exposed points of the convex set. These points are shown to be also connected to the solutions of a minimization problem involving the separating function. We investigate some relevant properties of this function and of...

objectives: the present study aimed at studying the health status of the elderly supported by imam khomeini relief foundation in birjand in 2007. methods & materials: this descriptive analytical study was done on 250 elderly people who were supported by imam khomeini committee in birjand. for data collection the comprehensive health questionnaire of the elderly was used. the questionnaire was f...

One of the main important issues in Data Envelopment Analysis (DEA) is to recognize set anchor points which subset extreme efficient production possibility (PPS). An point an located on intersection strong frontier and weak frontier. In other word, each delineate from So, if a decision making unit (DMU) point, then there at least one supporting hyperplane whose gradient vector has some zero com...

internationally early intervention programmes for infants and preschoolers with disabilities have proved to be remarkably successful. in many countries, they began with teachers for visually impaired or hearing impaired children visiting the family home to teach parents how they could overcome the child's impairments. the logic of early intervention was inequitable. for example, the sooner...

We develop the (co)homological tools that make effective the construction of the quaternionic Darmon points introduced by Matthew Greenberg. In addition, we use the overconvergent cohomology techniques of Pollack–Pollack to allow for the efficient calculation of such points. Finally, we provide the first numerical evidence supporting the conjectures on their rationality.

Consider the continuum of points along the edges of a network, i.e., a connected, undirected graph with positive edge weights. We measure the distance between these points in terms of the weighted shortest path distance, called the network distance. Within this metric space, we study farthest points and farthest distances. We introduce a data structure supporting queries for the farthest distan...

Micro-computed tomography(micro-CT) is becoming an accepted research tool for the noninvasive examination of laboratory animals such as mice and rats, but to date, in vivo scanning has largely been limited to the evaluation of skeletal tissues. We use a commercially available micro-CT device to perform respiratory gated in vivo acquisitions suitable for thoracic imaging. The instrument is descr...