The library is always known to be the warehouse of resources in terms of books and non-book materials. This paper generally discussed the medical library which is a library that is found or situated ...in any health related establishment, as well as the resources and services obtainable from it. It also emphasized on the need to provide varied information services and ICTs resources in the delivery of qualitative Medicare to clients of these libraries. The paper also stressed why medical libraries should be used effectively thereby giving that qualitative approach to quality Medical care services to her clients.
Device-to-Device (D2D) communications and cloud radio access network (C-RAN) can improve Spectrum Efficiency (SE). However, extremely severe intra-cell interference and inter-cell interference hinder ...the improvement of energy efficiency (EE). In the existing typical work, a centralized interference mitigation algorithm is deployed in cellular infrastructure to try to eliminate these types of interferences. Although this method improves the quality of service, it hardly reduces the energy consumption of cellular user equipments (UEs). Moreover, it increases the energy consumption of cellular infrastructure. In this paper, we first introduce out-band D2D relays to assist the cellular communications, which can shorten the average transmission distance of cellular UEs and thus make them improve their EE and reduce the inter-cell interference for each other. Then, we propose an energy-efficient resource sharing scheme to determine channel selection and power allocation. Next, we formulate the resource sharing problem as the noncooperative game model, where each UE optimizes its EE respectively with the aid of the remote radio heads in C-RAN. Finally, in order to obtain the optimal EE of each UE, we let the non-concave optimization problem be transformed into the concave form by using constraint relaxation and nonlinear fractional programming and solve the transformed problem by Dinkelbach's method and the Lagrangian duality theory. The simulation results show that the SE and EE of cellular UEs can be improved by 64.63% and 24.97%, respectively when adopting the parameters with the best values in our relay selection strategies.
Shared resources are common among supply chain partners and also occur in multiple linked stages of an internal network. The sharing of these resources impacts the organization’s profits. This study ...is focused on the potential benefits of resource sharing on a three-stage network system and on the profit improvement allocation. Previous treatments concentrate on defining optimal proportions to allocate resources and disregard the impacts of allocations to promote cooperation and are limited to static evaluations. Data Envelopment Analysis performs the decision-making units (DMUs) efficiency measurement. Methodological advances have resulted in models that analyze their internal structure and temporal impacts on efficiency. We propose an integrated cooperative game and dynamic network DEA that considers known quantities of resources used in each stage and the time effects to optimize the system’s profit. Each DMU stage is a player, and we investigate performance before and after resource sharing. Using Shapley value and Nucleolus, it is possible to allocate the benefits obtained based on the marginal contributions of each stage, providing incentives to motivate and maintain cooperation. A numerical example is used to illustrate the method. The results confirm the identification of inefficient DMUs and that sharing resources allows for profit increase for all of them.
Information Theoretic Cutting of a Cake Delgosha, Payam; Gohari, Amin
IEEE transactions on information theory,
11/2017, Volume:
63, Issue:
11
Journal Article
Peer reviewed
Open access
Cutting a cake is a metaphor for the problem of dividing a resource (cake) among several agents. The problem becomes non-trivial when the agents have different valuations for different parts of the ...cake (i.e., one agent may like chocolate, while the other may like cream). A fair division of the cake is one that takes into account the individual valuations of agents and partitions of the cake based on some fairness criterion. Fair division may be accomplished in a distributed or centralized way. Due to its natural and practical appeal, it has been a subject of study in economics. To the best of our knowledge, the role of partial information in fair division has not been studied so far from an information theoretic perspective. Given the diversity of problems in fair division, we consider certain specific (yet important) problems that capture different aspects of information exchange in a fair division setting. From the class of distributed algorithms, we consider the classical divide and choose (DC) problem between two parties. Here, we study the effect of partial spying and voluntarily sharing of information in both one-shot and asymptotic scenarios. Furthermore, we consider implicit information transmission through actions for the repeated version of the problem. While identifying subgame perfect Nash equilibrium in repeated games with incomplete information on both sides is very difficult in general, for the special case of division of two items, we find a more stringent trembling hand perfect equilibrium. Next, from the class of centralized algorithms, we consider the Adjusted Winner (AW) algorithm between two players Alice and Bob. Brams and Taylor showed that if Alice can fully spy on Bob, she can trick the algorithm. We consider the same setup when partial spying is allowed and study the growth rate of Alice's utility per spying bit. Via a transformation from AW to DC, it is shown that the problem reduces to the one studied earlier for DC. However, if Alice is forced to only spy certain simple structured functions of Bob's valuation, an upper bound on the growth rate of utility per spying bit is derived. This bound is shown to be tight in some cases. We also consider a centralized algorithm for maximizing the overall welfare of the agents under the Nash collective utility function (CUF). This corresponds to a clustering problem. By observing a link between this problem and the portfolio selection problem in stock markets, we provide an upper bound on the increase of the Nash CUF for a clustering refinement.
The present study addresses the existence of a central pool of domain-general resources in working memory. For this purpose, we examined interference between processing and storage activities ...involving information pertaining to different domain (verbal vs. visuo-spatial) while explicitly minimising representation-based interference at the peripheral level of working memory. Experiment 1 required maintenance of auditorily presented letters for further oral recall while concurrently judging visually presented spatial configurations by pressing keys. Experiment 2 required maintenance of visually presented random locations for further manual recall while concurrently judging auditorily presented words by giving oral responses. In both experiments, the cognitive load of processing was manipulated, a manipulation that clearly affected recall performance. This suggests strongly that working memory comprises a pool of domain-general attentional resources at the central level.
Caching and virtualization have been considered as the promising techniques in 5G Networks. In 5G networks with virtualization, the caching resources deployed by infrastructure providers (InPs) can ...be abstracted into isolated slices and transparently shared by mobile virtual network operators (MVNOs). In this case, one of the most important issues is how the MVNOs to share the caching resource. To solve this issue, different from previous works, a hierarchical caching architecture that core network and radio access network (RAN) have the caching capability in 5G networks with virtualization is first considered in this paper. Then, we study the problem of hierarchical caching resource sharing for MVNOs, and a competitive game to maximize their expectation revenue based on the oligopoly market model is formulated. As it is a hard problem to find the optimal solution in the hierarchical caching resource sharing problem, we decompose the optimization problem into two independent caching resource sharing problems in RAN and core network, respectively. Then the local optimal solutions are solved and the global Nash equilibrium solution is achieved. Finally, simulation results are illustrated to demonstrate the performance of the proposed scheme.
Caching at the user devices is a key technology to alleviate backhaul load and improve users' quality of experience in mobile edge networks. However, due to the concern of privacy and limited battery ...life, users are not willing to share their resources. In this study, the authors jointly design the caching strategy and incentive scheme to encourage the users to share their storage resources and improve the social welfare of the cellular network. First, the user equipments (UEs) are classified into different types according to their preference to share cache resources. Then, based on contract theory, an optimisation problem with necessary constraints is formulated aiming at maximising the base station (BS)'s utility. The reward the BS pays for a UE is based on the total amount of contents it shares with other UEs, which is related to the caching policy of UEs. A heuristic caching strategy is proposed and the optimal contract is obtained. Finally, the system performance of the proposed solution is analysed, simulation results show that the incentive scheme can improve the willingness of users to share contents, and the proposed caching strategy contributes more to the social welfare compared with two baseline caching schemes: fair caching and random caching.
As the size and the complexity of optical mesh networks grow, double-link failures become more probable. To protect against double-link failures, we generally have to provision more backup resources ...with respect to single-link failures. To improve the resource efficiency, it is important to reduce backup resources used for surviving double-link failures. In this paper, we investigate some representative sharing schemes and propose an enhanced resource sharing scheme with resource contention resolution for double-link failures in survivable optical mesh networks. By fully taking into account the temporal and spatial factors, our scheme can accommodate reasonable contention for sharing resources and minimize backup resources for reservation with 100% protection guarantee. Simulation results show that this enhanced resource sharing scheme can achieve satisfactory performance in terms of resource utilization ratio and blocking probability.
An introduction to a series of essays honoring Erich Meyerhoff (1919-2015), AHIP, FMLA, who was active in and contributed to the Medical Library Association for generations.
PDF
