http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Suyash Singh,Arun Kumar Srivastava,Jayesh Sardhara,Kamlesh Singh Bhaisora,Kuntal Kanti Das,Anant Mehrotra,Awadhesh Kumar Jaiswal,Manas Kumar Panigrahi,Sanjay Behari 대한척추신경외과학회 2021 Neurospine Vol.18 No.1
Objective: Joint manipulation for craniovertebral junction instability is often hindered by the C2-ganglion (C2G). Our study aims to compare the surgical outcome among patients with or without C2G preservation and discuss the technical nuances. Methods: We did a prospective, bicentric study and included all the operated patients with craniovertebral junction anomaly. The outcome was assessed by the Pain Numeric Rating Scale, Patient Satisfactions Score, and Stony Brook Scar Evaluation Scale. The fusion was assessed using Lenke fusion grade. Results: One hundred seventy-one patients (88 in group A and 83 in group B) were included. The most common symptom was spastic quadriparesis (n=165, 96.5%) with median Nurick grade 3.3. Thirteen patients had suboccipital numbness and 12 patients had paraesthesia. Mean blood loss in group A was 490±96.2 mL and group B was 525±45.7 mL; median operative time was 217.9 and 162.2 minutes in the groups A and B, respectively (p<0.05). At the follow-up (median, 46.8 months), Lenke fusion grade A was achieved in 92.4% and grade B in 7.6%. A trend suggesting better functional outcomes (numbness, parestheisa, scar outcome, and postoperative ulcer formation) in group A was seen with all 6 patients, who underwent O-C2 fixation, developed pressure sore. Conclusion: Our results support ganglion preservation, especially in the subset of patients where occipital plating is required. Although the study fails to show any statistical significance, we suggest that one should always start with an ‘intent’ of preservation as the functional outcome is better.
Kamlesh Rangari,Kuntal Kanti Das,Suyash Singh,Krishna G. Kumar,Kamlesh Singh Bhaisora,Jayesh Sardhara,Anant Mehrotra,Arun Kumar Srivastava,Awadhesh Kumar Jaiswal,Sanjay Behari 대한척추신경외과학회 2021 Neurospine Vol.18 No.1
Objective: Posterior fossa decompression is the treatment of choice in type 1 Chiari malformation (CM-1) without bony instability. Although surgical fixation has been recommended by a few authors recently, comparative studies to evaluate these treatment strategies using objective outcome tools are lacking. Methods: Seventy-three patients with pure CM-1 (posterior fossa bony decompression [PFBD], n=21; posterior fossa bony and dural decompression [PFBDD], n=40; and posterior fixation [PF], n=12) underwent a postoperative outcome assessment using Chicago Chiari Outcome Score (CCOS). Logistic regression analysis detected predictors of an unfavorable outcome. Results: Minimally symptomatic patients generally underwent a PFBD while most of the clinically severe patients underwent a PFBDD (p=0.049). The mean CCOS score at discharge was highest in the PF (12.0±1.41) and lowest in PFBDD group (10.98±1.73, p=0.087). Patients with minimal preoperative clinical disease severity (adjusted odds ratio [AOR], 4.58; 95% confidence interval [CI], 1.29–16.31) and PFBDD (AOR, 7.56; 95% CI, 1.70–33.68) represented risks for an unfavorable short-term postoperative outcome. Though long-term outcomes (CCOS) did not differ among the 3 groups (p=0.615), PFBD group showed the best long-term improvements (mean follow-up CCOS, 13.71±0.95), PFBDD group improved to a comparable degree despite a poorer short-term outcome while PF had the lowest scores. Late deteriorations (n=3, 4.1%) occurred in the PFBDD group. Conclusion: Minimally symptomatic patients and PFBDD predict a poor short-term postoperative outcome. PFBD appears to be a durable procedure while PFBDD group is marred by complications and late deteriorations. PF does not provide any better results than posterior fossa decompression alone in the long run.
A Token Based Protocol for Mutual Exclusion in Mobile Ad Hoc Networks
Sharma, Bharti,Bhatia, Ravinder Singh,Singh, Awadhesh Kumar Korea Information Processing Society 2014 Journal of information processing systems Vol.10 No.1
Resource sharing is a major advantage of distributed computing. However, a distributed computing system may have some physical or virtual resource that may be accessible by a single process at a time. The mutual exclusion issue is to ensure that no more than one process at a time is allowed to access some shared resource. The article proposes a token-based mutual exclusion algorithm for the clustered mobile ad hoc networks (MANETs). The mechanism that is adapted to handle token passing at the inter-cluster level is different from that at the intra-cluster level. It makes our algorithm message efficient and thus suitable for MANETs. In the interest of efficiency, we implemented a centralized token passing scheme at the intra-cluster level. The centralized schemes are inherently failure prone. Thus, we have presented an intra-cluster token passing scheme that is able to tolerate a failure. In order to enhance reliability, we applied a distributed token circulation scheme at the inter-cluster level. More importantly, the message complexity of the proposed algorithm is independent of N, which is the total number of nodes in the system. Also, under a heavy load, it turns out to be inversely proportional to n, which is the (average) number of nodes per each cluster. We substantiated our claim with the correctness proof, complexity analysis, and simulation results. In the end, we present a simple approach to make our protocol fault tolerant.
A Token Based Protocol for Mutual Exclusion in Mobile Ad Hoc Networks
( Bharti Sharma ),( Ravinder Singh Bhatia ),( Awadhesh Kumar Singh ) 한국정보처리학회 2014 Journal of information processing systems Vol.10 No.1
Resource sharing is a major advantage of distributed computing. However, a distributed computing system may have some physical or virtual resource that may be accessible by a single process at a time. The mutual exclusion issue is to ensure that no more than one process at a time is allowed to access some shared resource. The article proposes a token-based mutual exclusion algorithm for the clustered mobile ad hoc networks (MANETs). The mechanism that is adapted to handle token passing at the inter-cluster level is different from that at the intra-cluster level. It makes our algorithm message efficient and thus suitable for MANETs. In the interest of efficiency, we implemented a centralized token passing scheme at the intra-cluster level. The centralized schemes are inherently failure prone. Thus, we have presented an intracluster token passing scheme that is able to tolerate a failure. In order to enhance reliability, we applied a distributed token circulation scheme at the inter-cluster level. More importantly, the message complexity of the proposed algorithm is independent of N, which is the total number of nodes in the system. Also, under a heavy load, it turns out to be inversely proportional to n, which is the (average) number of nodes per each cluster. We substantiated our claim with the correctness proof, complexity analysis, and simulation results. In the end, we present a simple approach to make our protocol fault tolerant.