Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99


Search Results: 1 - 10 of 11 matches for " Sitan Illiassou "
All listed articles are free for downloading (OA Articles)
Page 1 /11
Display every page Item
Secondary Spontaneous Rupture of the Diaphragm in a Child after Blunt Chest Trauma  [PDF]
Seydou Togo, Bourama Kané, Moussa Abdoulaye Ouattara, Issa Boubacar Maiga, Yunping Lu, Donghui Jin, Allaye Ombotimbé, Ibrahim Sangaré, Maiga Abdoul Aziz, Cheik Amed Sekou Touré, Ibrahim Coulibaly, Adama Issa Koné, Sitan Illiassou, Jaques Saye, Cheik Sadibou Traoré, Sékou Koumaré, Moussa Camara, Koita Adama Kononba, Mody Traoré, Zimogo Zié Sanogo, Sadio Yéna, Djibril Sangaré
Open Journal of Respiratory Diseases (OJRD) , 2016, DOI: 10.4236/ojrd.2016.62006
Abstract: Traumatic diaphragmatic rupture (TDR) is very rare in the pediatric age group. Because of its rarity and its coexistence with more injuries, the diagnosis is often delayed. Very little has been written about this condition in the pediatric age group. TDR, while uncommon, should be considered in cases of blunt thoracic trauma. All patients should undergo meticulous examination preoperatively. The clinical presentation and importance of making an accurate diagnosis and surgery is highlighted. We report a case of secondary spontaneous traumatic left-sided diaphragmatic rupture in a child that was managed by delayed surgical repair.
Cellular Automata to More Efficiently Compute the Collatz Map
Sitan Chen
Physics , 2013,
Abstract: The Collatz, or 3x+1, Conjecture claims that for every positive integer n, there exists some k such that T^k(n)=1, where T is the Collatz map. We present three cellular automata (CA) that transform the global problem of mimicking the Collatz map in bases 2, 3, and 4 into a local one of transforming the digits of iterates. The CAs streamline computation first by bypassing calculation of certain parts of trajectories: the binary CA bypasses division by two altogether. In addition, they allow for multiple trajectories to be calculated simultaneously, representing both a significant improvement upon existing sequential methods of computing the Collatz map and a demonstration of the efficacy of using a massively parallel approach with cellular automata to tackle iterative problems like the Collatz Conjecture.
On the Rank Number of Grid Graphs
Sitan Chen
Mathematics , 2012,
Abstract: A vertex k-ranking is a labeling of the vertices of a graph with integers from 1 to k so any path connecting two vertices with the same label will pass through a vertex with a greater label. The rank number of a graph is defined to be the minimum possible k for which a k-ranking exists for that graph. For mxn grid graphs, the rank number has been found only for m<4. In this paper, we determine its for m=4 and improve its upper bound for general grids. Furthermore, we improve lower bounds on the rank numbers for square and triangle grid graphs from logarithmic to linear. These new lower bounds are key to characterizing the rank number for general grids, and our results have applications in optimizing VLSI circuit design and parallel processing, search, and scheduling.
Basis Collapse for Holographic Algorithms Over All Domain Sizes
Sitan Chen
Computer Science , 2015,
Abstract: The theory of holographic algorithms introduced by Valiant represents a novel approach to achieving polynomial-time algorithms for seemingly intractable counting problems via a reduction to counting planar perfect matchings and a linear change of basis. Two fundamental parameters in holographic algorithms are the \emph{domain size} and the \emph{basis size}. Roughly, the domain size is the range of colors involved in the counting problem at hand (e.g. counting graph $k$-colorings is a problem over domain size $k$), while the basis size $\ell$ captures the dimensionality of the representation of those colors. A major open problem has been: for a given $k$, what is the smallest $\ell$ for which any holographic algorithm for a problem over domain size $k$ "collapses to" (can be simulated by) a holographic algorithm with basis size $\ell$? Cai and Lu showed in 2008 that over domain size 2, basis size 1 suffices, opening the door to an extensive line of work on the structural theory of holographic algorithms over the Boolean domain. Cai and Fu later showed for signatures of full rank that over domain sizes 3 and 4, basis sizes 1 and 2, respectively, suffice, and they conjectured that over domain size $k$ there is a collapse to basis size $\lfloor\log_2 k\rfloor$. In this work, we resolve this conjecture in the affirmative for signatures of full rank for all $k$.
Prognosis of Acute Renal Failure of the Child during Severe Malaria in Niamey-Niger  [PDF]
Zeinabou Ma?ga Moussa Tondi, Moumouni Garba, Guillaume Mahamat Abderraman, Hassane Diongole Moussa, Ibrahim Hamat, Elmoctar Seydou Toure, Ide Abdou, Illiassou Soumeila Toure, Aboubacar Illiassou, Salamatou Niourou
Open Journal of Nephrology (OJNeph) , 2018, DOI: 10.4236/ojneph.2018.81002
Abstract: Introduction: In malaria-endemic areas, acute renal failure (ARF) is one of the most serious complications, it occurs in 40% of severe forms of malaria in adults and is linked to 75% of deaths, especially when extra-renal cleaning is not available. In children, studies of ARF during malaria are limited. We have no published studies on this topic in Niger. The main objective of our study is to evaluate the prognosis of ARF during severe malaria in children. Patients and Method: This is a one-year prospective study (January 1, 2016 to December 31, 2016) conducted in the resuscitation unit of the pediatric department of the National Lamordé Hospital of Niamey (Niger). We included in the study children aged 0 to 15 years hospitalized for severe malaria with impaired renal function. Patients who had chronic renal failure or who had acute renal failure with a thick negative drop were excluded from the study. Acute renal failure is defined according to Kidney Disease Improving Global Outcomes (KDIGO) criteria basing on creatinine clearance. Results: The incidence of ARF was 12.60%. The mean age of the patients was 4.25 ± 1.3 years [8 months - 15 years]. The mean hemoglobin level was 8.2 ± 2.7 g/dl. In 54.02% of cases, the hemoglobin level is ≤5 g/dl. Mean serum creatinine was 543.7 ± 69.5 μmol/l [107 - 2500 μmol/l] and mean azotemia was 27.5 ± 3.5 mmol/l. Severe anemia (54.02%) were more related to the occurrence of ARF(with p = 0.014). According to the RIFLE classification, 55 patients (63.22%) were in the Risk stage, 18 patients (20.69%) were in the injury stage and 14 patients (16.09%) in the failure stage. All patients were placed on injectable Artesunate. The average length of hospital stay was 8.6 ± 4.5 days [5 to 22 days]. Dialysis was reported in 15/87 (17.24%). For technical and financial reasons only 8 patients were hemodialysed. Indications for dialysis were severe uremic syndrome 7 cases (8.04%), fluid overload 5 cases (5.75%) and severe hyperkalemia 3 cases (3.45%). Conclusion: The etiological factors of ARI in malaria were massive hemoglobinuria, severe anemia and shock. Adequate management of simple cases of malaria and the early transfer of severe cases to resuscitation services can prevent certain complications such as acute renal failure.
Assessment of Domestic Wastewater Management Practices in the Communal District I of Maradi City, Niger Republic  [PDF]
Ousmane Laminou Manzo, Hassidou Saidou, Salamatou Abdourahamane Illiassou, Saoudé Tidjani Idrissa
Journal of Geoscience and Environment Protection (GEP) , 2015, DOI: 10.4236/gep.2015.38006
Abstract: Wastewater treatment is a problem with much acuity in the city of Maradi in general, and particularly in the Communal District I of Maradi. It is for this reason that the present study was conducted which deals with wastewater sanitation. The main objective of this study conducted through a survey is to investigate in the domestic wastewater sanitation in the Communal District I of Maradi city. Specifically, the study aims to estimate the amount of wastewater produced by households and to analyze the sanitation system at household and at district levels. The wastewater management practices in this district were assessed through a descriptive cross sectional study in which a total of 129 households were selected by sample distribution technique in the district neighborhoods and studied using interviewer and administered questionnaires at communal and household levels. The results of the study showed that the amount of domestic wastewater generated is quite large, about 32.27 m3 per person per day, and this comes from several sources including showers, laundry, dishwashing and income generating activities. The results also revealed that the unhealthy state of the Communal District I of Maradi is related to the absence of a wastewater treatment system, the methods and practices used in its management, and the population is also largely responsible for this unhealthy state and not willing to participate to a sanitation project.
Pseudorandomness for Read-Once, Constant-Depth Circuits
Sitan Chen,Thomas Steinke,Salil Vadhan
Computer Science , 2015,
Abstract: For Boolean functions computed by read-once, depth-$D$ circuits with unbounded fan-in over the de Morgan basis, we present an explicit pseudorandom generator with seed length $\tilde{O}(\log^{D+1} n)$. The previous best seed length known for this model was $\tilde{O}(\log^{D+4} n)$, obtained by Trevisan and Xue (CCC `13) for all of $AC^0$ (not just read-once). Our work makes use of Fourier analytic techniques for pseudorandomness introduced by Reingold, Steinke, and Vadhan (RANDOM `13) to show that the generator of Gopalan et al. (FOCS `12) fools read-once $AC^0$. To this end, we prove a new Fourier growth bound for read-once circuits, namely that for every $F: \{0,1\}^n\to\{0,1\}$ computed by a read-once, depth-$D$ circuit, \begin{equation*}\sum_{s\subseteq[n], |s|=k}|\hat{F}[s]|\le O(\log^{D-1}n)^k,\end{equation*} where $\hat{F}$ denotes the Fourier transform of $F$ over $\mathbb{Z}^n_2$.
Rapid and Reproducible Dibutylation Derivatization Coupled with Ultra-High Performance Liquid Chromatography-Tandem Mass Spectrometry for the Simultaneous Determination of Dopamine, Norepinephrine and 5-Hydroxytryptamine in Rat Brain Microdialysates  [PDF]
Jinlian Lu, Weimin Hu, Weiqun Cao, Sitan Xie, Zhiyu Li, Yi Tao, Xin Zhang
International Journal of Analytical Mass Spectrometry and Chromatography (IJAMSC) , 2018, DOI: 10.4236/ijamsc.2018.62002
Abstract: A rapid and reproducible method has been developed for the simultaneous quantification of dopamine (DA), norepinephrine (NE), and serotonin (5-HT) in rat brain microdialysates. Derivatization was processed through reductive amination with butyraldehyde and sodium cyanoborohydride at 60℃ for 80 min incubation. Dibutylated monoamine neurotransmitters (MANTs) were directly analyzed with ultra-high-performance liquid chromatography-tandem mass spectrometry (UPLC-MS/MS). The chromatographic run time was shorter (2.1 min/sample) than previous studies [15] [18] [20]. Good linearity (R2 > 0.99) was obtained for DA, NE and 5-HT in the range of 25 - 5000 pg/mL, 5 - 1000 pg/mL and 2.5 - 500 pg/mL, respectively. Acceptable precision (CV, 8.5% - 13.4%) as well as accuracy (recovery, 94.1% - 106.8%) could be acquired by analysis of six batches of quality control samples (QCs) at four different concentrations, which demonstrated the reliability and reproducibility of current method. This method was successfully applied to the simultaneous determination of DA, NE and 5-HT in rat brain microdialysates, where basal levels as well as elevated levels after dosing with amphetamine (AMPH) were quantified for all three MANTs. This study provides a simple and rapid way to analyze MANTs in the biofluid in the future.
Journal of the Chilean Chemical Society , 2007, DOI: 10.4067/S0717-97072007000400004
Abstract: a new unsymmetrical solid schiff base (lli) was synthesized using l-lysine, salicylaldehyde and furfural. solid lanthanum(iii) complex of this ligand [lal(no3)]no3-2h20 have been prepared and characterized by elemental analyses, ir , uv and molar conductance .the thermal decomposition kinetics of the complex for the second stage was studied under non-isothermal condition by tg and dtg methods. the kinetic equation may be expressed as : da/dt = a · e-elrt. (1-a)2 y the kinetic parameters(δ, a), activation entropy δs* and activation free-energy δg* were also gained, e = 212.7 kj/molδlnla =44.12, ?s*=116.8 j/mol-kδδg*=148.1 kj/mol
A Pair-Wise Key Establishment Scheme for AD HOC Network
Isra Sitan Al-Qasrawi,Obaida Mohammed Al-Hazaimeh
International Journal of Computer Networks & Communications , 2013,
Abstract: Ad hoc networks are a new wireless networking. However, these kinds of networks do not have anunderlying fixed infrastructure as well as tend to be vulnerable to a number of attacks due to dynamicnetwork topology and the lack of centralized network management functionality. In this paper, we haveproposed a new scheme that will allow two ad hoc nodes to establish a pair-wise shared key on the fly(dynamic) during any stage of the network operations based on cellular automata (CA) rules withoutrequiring the use of on-line key distribution centre. Our proposed scheme consists of a simple, but strongto provide a secure communication against node compromise due to pair-wise key establishment. Inaddition, the proposed scheme is computationally efficient because it only relies on simple symmetric keycryptography with high randomness, and meets desired levels of high reliability with low storagerequirements.
Page 1 /11
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.