King Khalid University Hospital

King Saud University Repository
Not a member yet
    13949 research outputs found

    Effectiveness of metal-organic frameworks for removal of refractory organo-sulfur compound present in liquid fuels

    No full text
    Adsorption of organo-sulfur compounds present in liquid fuels on metal-organic framework (MOF) compounds is an efficient alternative to the conventional hydrodesulfurization process. It has been demonstrated that the extent of dibenzothiophene (DBT) adsorption at temperatures close to ambient (304 K) is much higher on MOFs systems than on the benchmarked Y-type zeolite. In addition, the DBT adsorption capacity depends strongly on the MOF type as illustrated by the much higher extent of adsorption observed on the copper- (C300) and Al-containing (A100) MOF systems than on the Fe-containing (F300) MOF counterpart. With the aim to investigate the operation in consecutive cycles, the MOFs used in adsorption experiments were regenerated. In addition, the remaining S-containing compounds were identified and quantified by photoelectron spectroscopy (XPS). Examination of S2p core-level spectrum of the adsorbed S-compounds of regenerated MOFs pointed out that a fraction of these molecules become oxidized into S(VI) species

    A new low sar antenna structure for wireless handset applications

    No full text
    This paper proposes a new mobile handset antenna structure to reduce the value of the specific absorption rate (SAR). The antenna is based on the PIFA structure and operates at dual-bands of 0.9 GHz and 1.8 GHz. The chassis current is reduced using a metallic shim-layer inserted between the patch and chassis. This shim-layer is connected to the handset chassis through posts whose number and positions are determined using optimization techniques. Sidewalls are attached to increase the gain of the antenna and reduce the radiation towards human head. Simulations in the cheek mode show that the SAR reduction factor (SRF) of the proposed structure averaged over 10-g is more than 75% at 0.9 GHz and 46% at 1.8 GHz. The SRF values obtained using simulations and measurements are found to be better than 51% and 76% at 0.9 GHz and 1.8 GHz, respectively

    STRATEGY AND DIGITAL REALIZATION OF JOINT CONTROL FOR DIGITAL GOVERNORS IN A MULTI-UNIT POWER STATION.

    No full text
    [No abstract available

    MISE-PIPE: Magnetic Induction-based Wireless Sensor Networks for Underground Pipeline Monitoring

    No full text
    Underground pipelines constitute one of the most important ways to transport large amounts of fluid (e.g. oil and water) through long distances. However, existing leakage detection techniques do not work well in monitoring the underground pipelines due to the harsh underground environmental conditions. In this paper, a new solution, the magnetic induction (MI)-based wireless sensor network for underground pipeline monitoring (MISE-PIPE), is introduced to provide low-cost and real-time leakage detection and localization for underground pipelines. MISE-PIPE detects and localizes leakage by jointly utilizing the measurements of different types of sensors that are located both inside and around the underground pipelines. By adopting an MI waveguide technique, the measurements of different types of the sensors throughout the pipeline network can be reported to the administration center in real-time. The system architecture and operational framework of MISE-PIPE is first developed. Based on the operational framework, research challenges and open research issues are then discussed

    Direct Algorithms for Finding Minimal Unsatisfiable Subsets in Over-constrained CSPs

    No full text
    In many situations, an explanation of the reasons behind inconsistency in an overconstrained CSP is required. This explanation can be given in terms of minimal unsatisfiable subsets (MUSes) of constraints. This paper presents algorithms for finding minimal unsatisfiable subsets (MUSes) of constraints in overconstrained CSPs with finite domains and binary constraints. The approach followed is to generate subsets in the subset space, test them for consistency and record the inconsistent subsets found. We present three algorithms as variations of this basic approach. Each algorithm generates subsets in the subset space in a different order and curtails search by employing various search pruning mechanisms. The proposed algorithms are anytime algorithms: a time limit can be set on an algorithm's search and the algorithm can be made to find a subset of MUSes. Experimental evaluation of the proposed algorithms demonstrates that they perform two to three orders of magnitude better than the existing indirect algorithms. Furthermore, the algorithms are able to find MUSes in large CSP benchmarks

    Investigation of Golay Code (24,12,8) Structure in Improving Search Techniques

    No full text
    This paper presents a new technique for hash searching that is designed for approximate matching problem of multi-attribute objects. The suggested technique can be used for improving the search operation when the multi-attribute objects are partially distorted or when the searching criterion is not specified properly. The suggested approach is based upon reversing the conventional scheme of Golay code (24, 12, 8), which maps 24-bit vectors into 12-bit message words. In this technique, a multi-dimensional space is used to represent objects, where each object is given by a 24-bit vector. The closeness of the objects is determined by partitioning a 24-dimensional cube. In addition, the possibility of 1-bit distortions is considered through bit modifications of the 24-bit vectors. Thus, we proposed a hash table of 4096 entries that is fault-tolerant in the sense that the index is the same for any two different 24-bit vectors that share the same sphere. This allows rganizing a direct retrieval of a neighborhood of 24-bit vectors with two or possibly more mismatches. The simulation experiments measured the retrieval capabilities of the proposed system and the expected hash distribution

    Modeling and Designing a Service Oriented Framework for a Comprehensive Emergency System

    No full text
    Service oriented architecture introduces an effective way for connecting software components and sharing data. Most of the emergency systems lack the methodology to completely integrate and smoothly transfer data within its components. In this paper, we deal with this challenge by modeling and designing a service oriented framework for comprehensive emergency system. The proposed framework is composed of the following distributed subsystems: emergency application for mobile devices, GPS, Ambulances, Main central system, Health record and Hospitals. These subsystems are built using different technologies and completely integrated to handle any emergency event may occur. The framework behavior is illustrated within the internal flow of the collaboration model, which classifies the framework subsystems into provider or consumer. Moreover, the integration between subsystems is shown by handling the business process of emergency events. A real case study presenting the work of the CES framework is discusse

    Building an Advanced Wireless End to End Emergency Medical System

    No full text
    Effective communication in healthcare is important and especially critical in emergency situations. In this paper we propose a new comprehensive emergency system which will facilitate the communication process in emergency cases from ambulance dispatch to the patientโ€™s arrival and handover in the hospital. The proposed system has been designed to facilitate and computerise all the processes involved in an accident from finding the nearest ambulance through to accessing a patientโ€™s online health record which can assist in pre- hospital treatments. The proposed system will also locate the nearest hospital specialising in the patientโ€™s condition and will communicate patient identification to the emergency department. The components of the proposed system and the technologies used in building this system are outlined in this paper as well as the challenges expected and proposed solutions to these challenges

    Node Level Information Security in Common Information Exchange Model (CIEM)

    No full text
    This paper is the extended discussion of the previous study regarding [1]. Previous study was the proposal of a common information exchange model in order to integrate dissimilar military platforms working on a common battle field. That proposed model was a prototype-proposal for military architecture information exchange semantically. This study is the root cause of recent advancement in the defense industry of the Kingdom of Saudi Arabia to integrate different defense domains within a System of Systems (SoS) formerly known as C4I System. Focus & Result in this study: This study focuses and demonstrates the node level information security of RDF/XML document security policy, architecture & object. The study has given further extension to the previous model to cover the security granularity for XML documents using RDF statement. Rules related to access control are symbolized by RDF declarations having object, user and type access properties. Data is represented in the form of DTD and further described as tree nodes. We have discussed the tree representation of data and a usage repository file is also maintained for the web-crawlers to help in decision making for granting access to these nodes and history maintaining. This study will demonstrate more discrete and detail level of discussion of the early model or prototype approac

    ุงู„ุถูˆุงุจุท ุงู„ุนู€ู€ู€ุงู…ู€ู€ู€ู€ู€ู€ู€ู€ู€ุฉ ููŠ ู…ุฌุงู„ ุงู„ู€ู€ุณู‘ูŽู€ุจูŽู‚ ูˆุชุทุจูŠู‚ุงุชู‡ุง ุงู„ู…ุนู€ู€ู€ุงุตุฑุฉ

    No full text
    ุงู„ุจุญุซ ู…ุชุฎุตุต ููŠ ุจูŠุงู† ู…ุฌุงู„ ุงู„ุณู‘ูŽุจูŽู‚ ุฃูŠ : ุงู„ุฃุนู…ุงู„ ูˆุงู„ุฃู„ุนุงุจ ุงู„ุชูŠ ูŠุฌูˆุฒ ููŠู‡ุง ุจุฐู„ ุงู„ุณู‘ูŽุจูŽู‚ ูˆุงู„ุชูŠ ู„ุง ูŠุฌูˆุฒ ููŠู‡ุง ุจุฐู„ู‡ . ูˆุงู„ุณู‘ูŽุจูŽู‚ ู‡ูˆ : ( ุงู„ู…ุงู„ ุงู„ู…ุฎุตุต ู„ู„ุณุงุจู‚ ุนู„ู‰ ุณุจู‚ู‡ ) ุณูˆุงุกู‹ ูƒุงู† ู…ุจุฐูˆู„ุงู‹ ู…ู† ุจุนุถ ุงู„ู…ุชุณุงุจู‚ูŠู† ุฃูˆ ู…ู†ู‡ู… ุฌู…ูŠุนุงู‹ ุฃูˆ ูƒุงู† ู…ุจุฐูˆู„ุงู‹ ู…ู† ุฃุฌู†ุจูŠ ุนู†ู‡ู… . ูˆูŠุดุชุฑุท ู„ุตุญุชู‡ ุฃู† ูŠูƒูˆู† ู…ุงู„ุงู‹ ู…ุชู‚ูˆู…ุงู‹ ู…ุจุงุญุงู‹ ู…ุนู„ูˆู…ุงู‹ ู…ู‚ุฏูˆุฑุงู‹ ุนู„ู‰ ุชุณู„ูŠู…ู‡ , ูˆุฃู† ู„ุง ูŠูƒูˆู† ู‚ู…ุงุฑุงู‹, ูˆุฃู† ูŠูƒูˆู† ู…ุจุฐูˆู„ุงู‹ ููŠู…ุง ูŠุตุญู‘ู ุจุฐู„ู‡ ููŠู‡ . ูˆู‚ุฏ ุชุจูŠู† ู…ู† ุฎู„ุงู„ ู‡ุฐุง ุงู„ุจุญุซ ุฃู† ุงู„ุฃุนู…ุงู„ ูˆุงู„ุฃู„ุนุงุจ ู„ุง ุชุฎู„ูˆ ุจุงู„ู†ุณุจุฉ ู„ุญูƒู… ุจุฐู„ ุงู„ุณู‘ูŽุจูŽู‚ ููŠู‡ุง ู…ู† ุซู„ุงุซุฉ ุฃู‚ุณุงู… : ุงู„ู‚ุณู… ุงู„ุฃูˆู„ : ู…ุง ุงุชูู‚ ุงู„ุนู„ู…ุงุก ุนู„ู‰ ุญุฑู…ุฉ ุจุฐู„ ุงู„ุณู‘ูŽุจูŽู‚ ููŠู‡ : ูˆุถุงุจุท ุฐู„ูƒ ุฃู† ( ูƒู„ ู…ุง ุญุฑู… ูุนู„ู‡ ุญุฑู… ุจุฐู„ ุงู„ุณู‘ูŽุจูŽู‚ ููŠู‡ ) ุณูˆุงุกู‹ ูƒุงู† ู‡ุฐุง ุงู„ูุนู„ ู…ุญุฑู…ุงู‹ ุจุฐุงุชู‡ ุฃูˆ ุจุณุจุจูู ุทุฑุฃ ุนู„ูŠู‡ . ุงู„ู‚ุณู… ุงู„ุซุงู†ูŠ : ู…ุง ุงุชูู‚ ุงู„ุนู„ู…ุงุก ุนู„ู‰ ุฌูˆุงุฒ ุจุฐู„ ุงู„ุณู‘ูŽุจูŽู‚ ููŠู‡ : ูˆู‡ูŠ ุงู„ุฃู†ูˆุงุน ุงู„ุซู„ุงุซุฉ ุงู„ุชูŠ ูˆุฑุฏ ุงู„ู†ู‘ูŽุต ุจู‡ุง ( ุงู„ู†ู‘ูŽุตู„ , ูˆุงู„ุญุงูุฑ , ูˆุงู„ุฎููู‘ ) ูˆูŠู‚ุงุณ ุนู„ูŠู‡ุง : ูƒู„ ุณู„ุงุญ ุชุญู‚ู‚ุช ููŠู‡ ุนู„ุฉ ุฃุญุฏู‡ุง . ุงู„ู‚ุณู… ุงู„ุซุงู„ุซ : ู…ุง ุงุฎุชู„ู ุงู„ุนู„ู…ุงุก ููŠ ุฌูˆุงุฒ ุจุฐู„ ุงู„ุณู‘ูŽุจูŽู‚ ููŠู‡ : ูˆูŠุดู…ู„ ู‡ุฐุง ุงู„ู‚ุณู… ู†ูˆุนูŠู† : ุงู„ู†ูˆุน ุงู„ุฃูˆู„ : ู…ุง ูƒุงู† ููŠ ู…ุนู†ู‰ ู…ุง ูˆุฑุฏ ุจู‡ ุงู„ู†ุต , ูƒุงู„ู…ุณุงุจู‚ุฉ ุนู„ู‰ ุงู„ุฃู‚ุฏุงู… ูˆุงู„ุณุจุงุญุฉ ูˆุงู„ู…ุณุงุจู‚ุงุช ุงู„ุนู„ู…ูŠุฉ ูˆู†ุญูˆู‡ุง , ูˆู‚ุฏ ุชูˆุตู„ ุงู„ุจุงุญุซ ุฅู„ู‰ ุฌูˆุงุฒ ุจุฐู„ ุงู„ุณู‘ูŽุจูŽู‚ ููŠ ู‡ุฐุง ุงู„ู†ูˆุน , ูˆุฃู† ุถุงุจุทู‡ ( ุงู„ู†ูุน ููŠ ุงู„ุฏูŠู† ) , ููƒู„ ุนู…ู„ ุฃูˆ ู„ุนุจ ูŠูู†ุชูุน ุจู‡ ููŠ ุฃู…ูˆุฑ ุงู„ุฏูŠู† ูุฅู†ู‡ ูŠุฌูˆุฒ ุจุฐู„ ุงู„ุณู‘ูŽุจูŽู‚ ููŠู‡ . ุงู„ู†ูˆุน ุงู„ุซุงู†ูŠ : ุงู„ู…ุจุงุญุงุช ุงู„ุชูŠ ู„ูŠุณุช ููŠ ู…ุนู†ู‰ ู…ุง ูˆุฑุฏ ุจู‡ ุงู„ู†ุต , ูˆุฐู„ูƒ ูƒุงู„ู…ุณุงุจู‚ุงุช ุงู„ุซู‚ุงููŠุฉ ุงู„ุนุงู…ุฉ ูˆุงู„ูƒุฑุฉ ุจุฃู†ูˆุงุนู‡ุง ูˆู†ุญูˆ ุฐู„ูƒ ู…ู† ุงู„ู…ุจุงุญุงุช , ูˆู‚ุฏ ุชูˆุตู„ ุงู„ุจุงุญุซ ุฅู„ู‰ ุฃู† ุงู„ุฃุตู„ ุนุฏู… ุฌูˆุงุฒ ุจุฐู„ ุงู„ุณู‘ูŽุจูŽู‚ ููŠู‡ุง ูˆูŠูุณุชุซู†ู‰ ู…ู† ุฐู„ูƒ ู…ุง ุชุฏุนูˆ ุงู„ุญุงุฌุฉ ุฅู„ูŠู‡ ุฅุฐุง ูƒุงู† ู…ุจุฐูˆู„ุงู‹ ู…ู† ุฃุฌู†ุจูŠ ุนู† ุงู„ู…ุชุณุงุจู‚ูŠู† , ูˆูƒุงู† ุงู„ุณุจุงู‚ ู„ู‚ุตุฏ ู…ุนุชุจุฑ ุดุฑุนุงู‹ , ูˆู„ู… ูŠุชุถู…ู† ุดูŠุฆุงู‹ ู…ู† ุงู„ู…ูุงุณุฏ

    0

    full texts

    13,949

    metadata records
    Updated in lastย 30ย days.
    King Saud University Repository
    Access Repository Dashboard
    Do you manage Open Research Online? Become a CORE Member to access insider analytics, issue reports and manage access to outputs from your repository in the CORE Repository Dashboard! ๐Ÿ‘‡