From Millennium ERM to Proquest 360 Resource Manager: Implementing a new Electronic Resources Management System ERMS in an International Graduate Research University in Saudi Arabia
Name:
ERMS_Implementation2017.pdf
Size:
29.06Mb
Format:
PDF
Description:
Presentation Slides
Type
PresentationAuthors
Ramli, Rindra M.
KAUST Department
University LibraryDate
2017-05-17Permanent link to this record
http://hdl.handle.net/10754/623657Metadata
Show full item recordAbstract
An overview of the Recommendation Study and the subsequent Implementation of a new Electronic Resources Management system ERMS in an international graduate research university in the Kingdom of Saudi Arabia. It covers the timeline, deliverables and challenges as well as lessons learnt by the Project Team.Collections
PresentationsRelated items
Showing items related by title, author, creator and subject.
-
Permanent Genetic Resources added to Molecular Ecology Resources Database 1 October 2011 - 30 November 2011(Molecular Ecology Resources, Wiley, 2012-02-01) [Article]This article documents the addition of 139 microsatellite marker loci and 90 pairs of single-nucleotide polymorphism sequencing primers to the Molecular Ecology Resources Database. Loci were developed for the following species: Aglaoctenus lagotis, Costus pulverulentus, Costus scaber, Culex pipiens, Dascyllus marginatus, Lupinus nanus Benth, Phloeomyzus passerini, Podarcis muralis, Rhododendron rubropilosum Hayata var. taiwanalpinum and Zoarces viviparus. These loci were cross-tested on the following species: Culex quinquefasciatus, Rhododendron pseudochrysanthum Hay. ssp. morii (Hay.) Yamazaki and R. pseudochrysanthum Hayata. This article also documents the addition of 48 sequencing primer pairs and 90 allele-specific primers for Engraulis encrasicolus. © 2012 Blackwell Publishing Ltd.
-
Dynamic pricing of a resource(2013-06-04) [Patent]A method of dynamic pricing of a resource is presented. For example, the method includes determining a set of anticipated demands for one or more users to acquire the resource according to uncertainty of the one or more users in preferring one or more certain time periods of a plurality of time periods for acquiring the resource. Prices for the resource differ between at least two of the plurality of time periods. Each anticipated demand of the set is associated with a different one of the plurality of time periods. The method further includes setting prices for the resource during each of the plurality of time periods according to the determined set of anticipated demands. The determining of the set of anticipated demands and/or the setting of prices are implemented as instruction code executed on a processor device.
-
Location-Based Resource Allocation for OFDMA(2011-05) [Thesis]
Advisor: Alouini, Mohamed-Slim
Committee members: Sultan Salem, Ahmed Kamal; Tempone, Raul F.Cognitive radio is one of the hot topics for emerging and future wireless communication. It has been proposed as a suitable solution for the spectrum scarcity caused by the increase in frequency demand. The concept is based on allowing unlicensed users, called cognitive or secondary users, to share the unoccupied frequency bands with their owners, called the primary users, under constraints on the interference they cause to them. In order to estimate this interference, the cognitive system usually uses the channel state information to the primary user, which is often impractical to obtain. However, we propose to use location information, which is easier to obtain, to estimate this interference. The purpose of this work is to propose a subchannel and power allocation method which maximizes the secondary users' total capacity under the constraints of limited budget power and total interference to the primary under certain threshold. We model the problem as a constrained optimization problem for both downlink and uplink cases. Then, we propose low-complexity resource allocation schemes based on the waterfilling algorithm. The simulation results show the efficiency of the proposed method with comparison to the exhaustive search algorithm.
