Percutaneous creation of a biliary enteric neo-anastomosis in a pediatric liver transplant patient using a vascular re-entry device

Habiba Hassan,Khaled Alzahrani,Mohammad Alotaibi,Mohammad Almoaiqel,Mohammad Arabi 소화기인터벤션의학회 2023 International journal of gastrointestinal interven Vol.12 No.4

Establishing access across a post-liver transplant anastomotic obstruction is paramount to allow future management with serial dilatation and to avoid surgical interventions. Several techniques have been reported to facilitate crossing complete anastomotic obstructions. Here, we report a case of successful off-label use of a vascular re-entry device to cross a complete anastomotic obstruction in a child after failed antegrade and retrograde attempts.

Performance Evaluation of the VoIP Services of the Cognitive Radio System, Based on DTMC

Habiba, Ummy,Islam, Md. Imdadul,Amin, M.R. Korea Information Processing Society 2014 Journal of information processing systems Vol.10 No.1

In recent literature on traffic scheduling, the combination of the two-dimensional discrete-time Markov chain (DTMC) and the Markov modulated Poisson process (MMPP) is used to analyze the capacity of VoIP traffic in the cognitive radio system. The performance of the cognitive radio system solely depends on the accuracy of spectrum sensing techniques, the minimization of false alarms, and the scheduling of traffic channels. In this paper, we only emphasize the scheduling of traffic channels (i.e., traffic handling techniques for the primary user [PU] and the secondary user [SU]). We consider the following three different traffic models: the cross-layer analytical model, M/G/1(m) traffic, and the IEEE 802.16e/m scheduling approach to evaluate the performance of the VoIP services of the cognitive radio system from the context of blocking probability and throughput.

Carbon Particle-Doped Polymer Layers on Metals as Chemically and Mechanically Resistant Composite Electrodes for Hot Electron Electrochemistry

Habiba, Nur-E,Uddin, Rokon,Salminen, Kalle,Sariola, Veikko,Kulmala, Sakari The Korean Electrochemical Society 2022 Journal of electrochemical science and technology Vol.13 No.1

This paper presents a simple and inexpensive method to fabricate chemically and mechanically resistant hot electron-emitting composite electrodes on reusable substrates. In this study, the hot electron emitting composite electrodes were manufactured by doping a polymer, nylon 6,6, with few different brands of carbon particles (graphite, carbon black) and by coating metal substrates with the aforementioned composite ink layers with different carbon-polymer mass fractions. The optimal mass fractions in these composite layers allowed to fabricate composite electrodes that can inject hot electrons into aqueous electrolyte solutions and clearly generate hot electron- induced electrochemiluminescence (HECL). An aromatic terbium (III) chelate was used as a probe that is known not to be excited on the basis of traditional electrochemistry but to be efficiently electrically excited in the presence of hydrated electrons and during injection of hot electrons into aqueous solution. Thus, the presence of hot, pre-hydrated or hydrated electrons at the close vicinity of the composite electrode surface were monitored by HECL. The study shows that the extreme pH conditions could not damage the present composite electrodes. These low-cost, simplified and robust composite electrodes thus demonstrate that they can be used in HECL bioaffinity assays and other applications of hot electron electrochemistry.

Performance Evaluation of the VoIP Services of the Cognitive Radio System, Based on DTMC

( Ummy Habiba ),( Imdadul Islam ),( M R Amin ) 한국정보처리학회 2014 Journal of information processing systems Vol.10 No.1

In recent literature on traffic scheduling, the combination of the two dimensional discrete-time Markov chain (DTMC) and the Markov modulated Poisson process (MMPP) is used to analyze the capacity of VoIP traffic in the cognitive radio system. The performance of the cognitive radio system solely depends on the accuracy of spectrum sensing techniques, the minimization of false alarms, and the scheduling of traffic channels. In this paper, we only emphasize the scheduling of traffic channels (i.e., traffic handling techniques for the primary user [PU] and the secondary user [SU]). We consider the following three different traffic models: the cross-layer analytical model, M/G/1(m) traffic, and the IEEE 802.16e/m scheduling approach to evaluate the performance of the VoIP services of the cognitive radio system from the context of blocking probability and throughput.

RAPD Analysis of Three Deer Species in Malaysia

El-Jaafari, Habiba A.A.,Panandam, Jothi M.,Idris, Ismail,Siraj, Siti Shapor Asian Australasian Association of Animal Productio 2008 Animal Bioscience Vol.21 No.9

The genetic variability within and among three deer species in Malaysia, namely Cervus nippon (sika), Cervus timorensis (rusa) and Cervus unicolor (sambar), were evaluated using the RAPD technique. The DNA extracted from the buffy coat of 34 sika, 38 rusa and 9 sambar were analysed using ten primers that gave bands which showed good resolution. The primers generated 164 RAPD markers in total, and these ranged in size from 150 to 900 bp. The percent of polymorphism of the bands generated per primer ranged from 66.66-93.33% for rusa, 36.84-61.14% for sambar and 52.38-100% for sika. The overall percent polymorphism observed for the 164 RAPD markers was 99.39%. The results revealed five exclusive, monomorphic markers for sambar and one exclusive, monomorphic marker for sika; none was observed for rusa. However, these cannot be declared as markers for the identification of the species without analysis of more samples, populations and species. The means of within population genetic distances, based on Dice's and Jaccard's similarity indices, were similar for the rusa (0.383 and 0.542, respectively) and sika (0.397 and 0.558, respectively) populations with the sambar population being the least variable (0.194 and 0.323, respectively). The Dice based genetic distances within the species ranged from 0.194 to 0.397 and the genetic distances among the species were 0.791-0.911. The genetic distances based on Dice's and Jaccard's similarity indices between the rusa and sambar were 0.556 and 0.713, between the rusa and sika populations were 0.552 and 0.710, and between sambar and sika were 0.622 and 0.766, respectively.

Bacteriocins of Lactic Acid Bacteria and Their Industrial Application

Bamgbose Timothy,Atta Habiba Iliyasu,Anupkumar R. Anvikar 한국유산균·프로바이오틱스학회 2021 Current Topic in Lactic Acid Bacteria and Probioti Vol.7 No.1

Contribution of Geophysics to the Study of Barite Mineralization in the Paleozoic Formations of Asdaf Tinejdad (Eastern Anti Atlas Morocco)

Dakir Ibrahim,Benamara Ahmed,Aassoumi Habiba,Ouallali Abdessalam,Ait Bahammou Youssef 대한자원환경지질학회 2020 자원환경지질 Vol.53 No.3

The use of the geophysical method in mining prospecting has been studied in the Asdaf region (South-East of Morocco). The objective of the study is to examine the aptitude of the electrical technique, in this case induced polarization (IP) and electric tomography, combined with the electromagnetic method (VLF), in the exploration of barite . The result obtained by the pseudo-sections of electrical tomography and that of KH filtration highlighted anomalies of resistant contact (greater than 400Ω.m) and of high charge chargeability (5mV / V). These contacts are hosted in less resistant Devonian age shale and sandstone. The resistivity response obtained at their level is characteristic of the venous structures associated with barite mineralization. The direction of the mineralized veins is parallel to the direction of the fractured zones (NE-SW), which indicates that the mineralization in place is due to the tectonic movements of the Hercynian orogeny (from Devonian to Permian). These veins are aligned with the locations of abandoned mine shafts and with surface mining areas. Geophysical technique therefore seems to play a key role in barite mining exploration.

Effects of single-dose, low-level laser therapy on pain associated with the initial stage of fixed orthodontic treatment

Irfan Qamruddin,Mohammad Khursheed Alam,Habiba Abdullah,Muhammad Abdullah Kamran,Nausheen Jawaid,Verda Mahroof 대한치과교정학회 2018 대한치과교정학회지 Vol.48 No.2

Objective: The aim of this study was to assess the analgesic effect of a single application of low-level laser therapy (LLLT) on spontaneous pain and pain on chewing after placement of initial archwires. Methods: Forty-two patients (26 women, 16 men) were randomly recruited for this split-mouth randomized clinical trial. Each patient received super-elastic nickel-titanium (NiTi) initial archwires (0.012, 0.014, 0.016, and 0.018-inch [in]) in the maxilla for leveling and alignment for an interval of 4 weeks between archwires. One side of the mouth was randomly designated as experimental, while the other side served as placebo. After insertion of each archwire, the experimental side was irradiated with a diode laser for 3 seconds each on 5 points facially and palatally per tooth, from the central incisor to first molar. On the placebo side, the laser device was held the same way but without laser application. A numerical rating scale was used to assess the intensity of spontaneous and masticatory pain for the following 7 days. The Mann–Whitney U test was used to compare pain scores between sides. Results: Patients in the LLLT group exhibited significantly lower mean scores for spontaneous pain after insertion of the initial two archwires (0.012-in and 0.014-in NiTi; p < 0.05), while there was no significant difference for 0.016-in and 0.018-in wires between the LLLT and placebo groups. LLLT significantly reduced chewing pain scores (p < 0.05) for all archwires. Conclusions: A single dose of LLLT considerably lessened postoperative pain accompanying the placement of super-elastic NiTi wires for initial alignment and leveling.

A Data Mining Approach for Selecting Bitmap Join Indices

Bellatreche, Ladjel,Missaoui, Rokia,Necir, Hamid,Drias, Habiba Korean Institute of Information Scientists and Eng 2007 Journal of Computing Science and Engineering Vol.1 No.2

Index selection is one of the most important decisions to take in the physical design of relational data warehouses. Indices reduce significantly the cost of processing complex OLAP queries, but require storage cost and induce maintenance overhead. Two main types of indices are available: mono-attribute indices (e.g., B-tree, bitmap, hash, etc.) and multi-attribute indices (join indices, bitmap join indices). To optimize star join queries characterized by joins between a large fact table and multiple dimension tables and selections on dimension tables, bitmap join indices are well adapted. They require less storage cost due to their binary representation. However, selecting these indices is a difficult task due to the exponential number of candidate attributes to be indexed. Most of approaches for index selection follow two main steps: (1) pruning the search space (i.e., reducing the number of candidate attributes) and (2) selecting indices using the pruned search space. In this paper, we first propose a data mining driven approach to prune the search space of bitmap join index selection problem. As opposed to an existing our technique that only uses frequency of attributes in queries as a pruning metric, our technique uses not only frequencies, but also other parameters such as the size of dimension tables involved in the indexing process, size of each dimension tuple, and page size on disk. We then define a greedy algorithm to select bitmap join indices that minimize processing cost and verify storage constraint. Finally, in order to evaluate the efficiency of our approach, we compare it with some existing techniques.

A Data Mining Approach for Selecting Bitmap Join Indices

Ladjel Bellatreche,Rokia Missaoui,Hamid Necir,Habiba Drias 한국정보과학회 2007 Journal of Computing Science and Engineering Vol.1 No.2

Index selection is one of the most important decisions to take in the physical design of relational data warehouses. Indices reduce significantly the cost of processing complex OLAP queries, but require storage cost and induce maintenance overhead. Two main types of indices are available: mono-attribute indices (e.g., B-tree, bitmap, hash, etc.) and multi-attribute indices (join indices, bitmap join indices). To optimize star join queries characterized by joins between a large fact table and multiple dimension tables and selections on dimension tables, bitmap join indices are well adapted. They require less storage cost due to their binary representation. However, selecting these indices is a difficult task due to the exponential number of candidate attributes to be indexed. Most of approaches for index selection follow two main steps: (1) pruning the search space (i.e., reducing the number of candidate attributes) and (2) selecting indices using the pruned search space. In this paper, we first propose a data mining driven approach to prune the search space of bitmap join index selection problem. As opposed to an existing our technique that only uses frequency of attributes in queries as a pruning metric, our technique uses not only frequencies, but also other parameters such as the size of dimension tables involved in the indexing process, size of each dimension tuple, and page size on disk. We then define a greedy algorithm to select bitmap join indices that minimize processing cost and verify storage constraint. Finally, in order to evaluate the efficiency of our approach, we compare it with some existing techniques.