Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99


Any time

2019 ( 62 )

2018 ( 2219 )

2017 ( 2103 )

2016 ( 2090 )

Custom range...

Search Results: 1 - 10 of 126811 matches for " Yingda Li "
All listed articles are free for downloading (OA Articles)
Page 1 /126811
Display every page Item
Incidence and Predictors of Dysphagia Following Anterior Cervical Discectomy and Fusion: Prospective Observational Study  [PDF]
Yingda Li, Kerry Hitos, Su-Thet Mon, Natalie Knight, Nick Vrodos
Open Journal of Modern Neurosurgery (OJMN) , 2018, DOI: 10.4236/ojmn.2018.81011
Abstract: The incidence of dysphagia following anterior cervical discectomy and fusion (ACDF) reported in the literature varies due to differences in measures and time intervals applied, ranging from nearly 3/4 at 2 weeks to 13% at 12 months. The most commonly used dysphagia scales remain subjective, non-validated, and do not capture functional impact. Various risk factors have been identified, though few consistently reproduced and none studied in an Australasian context. The aims of this study were to use objective and validated measures, assess both traditional and novel risk factors, and determine the impact of dysphagia on dietary status, length of stay and complications. METHODS: Twenty-nine adults undergoing ACDF for degenerative pathologies were enrolled between March and November 2015 in an Australian institution. Bazaz dysphagia scale, Dysphagia short questionnaire, 3-ounce swallow test and dietary status were assessed preoperatively, and 2 days and 6 weeks postoperatively. Descriptive statistics were used to characterise the study sample and logistic regression modelling performed on risk factors. RESULTS: Dysphagia incidence ranged from 85% on day-2 Dysphagia short questionnaire to zero on 6-week 3-ounce swallow. All measures increased at 2 days and fell by 6 weeks. Failing day-2 3-ounce swallow was the only measure associated with modifications in solids (P = 0.06), showing significant linear correlation (P = 0.02). Respiratory comorbidity increased risk of failing day-2 3-ounce swallow by more than 32-fold (OR: 32.4; 95% CI: 1.8 - 587.7; P = 0.019) and scoring moderate or severe on Bazaz by almost 10-times (OR: 9.3; 95% CI: 0.9 - 95.95; P = 0.061). Psychiatric history also increased risk of failing day-2 3-ounce swallow by more than 10-fold (OR: 10.9; 95% CI: 1 - 123.7; P = 0.054). Failing 3-ounce swallow increased length of stay (5 versus 7 days; P = 0.013). CONCLUSIONS: Incidence of dysphagia following ACDF was dependent on the measure used, though all improved over time. The 3-ounce swallow test correlated with dietary modification and length of stay, while respiratory comorbidity posed the most significant risk. This may identify a group of patients who may benefit from early intervention.
Discontinuous Galerkin Methods for the Vlasov-Maxwell Equations
Yingda Cheng,Irene M. Gamba,Fengyan Li,Philip J. Morrison
Mathematics , 2013,
Abstract: Discontinuous Galerkin methods are developed for solving the Vlasov-Maxwell system, methods that are designed to be systematically as accurate as one wants with provable conservation of mass and possibly total energy. Such properties in general are hard to achieve within other numerical method frameworks for simulating the Vlasov-Maxwell system. The proposed scheme employs discontinuous Galerkin discretizations for both the Vlasov and the Maxwell equations, resulting in a consistent description of the distribution function and electromagnetic fields. It is proven, up to some boundary effects, that charge is conserved and the total energy can be preserved with suitable choices of the numerical flux for the Maxwell equations and the underlying approximation spaces. Error estimates are established for several flux choices. The scheme is tested on the streaming Weibel instability: the order of accuracy and conservation properties of the proposed method are verified.
Properties and nucleotide sequence of linear plasmid-like DNA pC4 from mitochondria ofCucumis sativus
Junying Li,Yingda Wen,Yanling Bai,Juan Fu,Xiuming Zhang,Caichang Gao
Chinese Science Bulletin , 2001, DOI: 10.1007/BF03184327
Abstract: Four kinds of mitochondrial plasmid-like DNAs, designated pC1, pC2, pC3 and pC4, were detected inCucumis sativus Jinyan No. 4. The electron microscopy observation showed that pC4 was linear conformation. Complete sequence of pC4 was cloned into pUC19 withE coli JM109 as host. Sequence analysis revealed that pC4 was 370 bp long, the shortest one among all the reported mitochondrial plasmid-like DNAs. pC4 was AT rich. It contained terminal direct repeat sequence (35 bp in length) as well as many short direct and inverted repeats. ORFs in pC4 were short. pC4 was found to be homologous to nuclear DNAs, but lack homology with main mitochondrial and chloroplast DNAs. pC4-homologous sequence also occurred in nuclear genome of Jinyan No. 7 which contained no mitochondrial plasmid-like DNAs. The hybridization pattern of Jinyan No. 7 was slightly different from that of Jinyan No. 4. This suggested that pC4 occurred at the forepart ofCucumis sativus species divergence and integrated into the nuclear genome, and the pC4-homologous sequence in nucleus varied during species diverging.
Grotesque Impressions Enhance the Gaze Cueing Effect
Matia Okubo,Yingda Jiang
International Journal of Social Science Studies , 2013, DOI: 10.11114/ijsss.v1i1.72
Abstract: A non-predictive gaze cue produces a reflexive shift of attention to the gazed-at location. The present study used a modified version of Posner's attentional cueing paradigm (a gaze cueing paradigm) to investigate role of grotesque facial expressions on a gaze cueing effect involving induced fear. Grotesque faces were created by vertically shifting the position of one of the two eyes (Experiment 1, N =28) or both eyes (Experiment 2, N =28). The grotesque faces of Experiment 1 produced a larger facilitative effect of a gaze cue than did original faces, whereas the less grotesque faces of Experiment 2 did not. Cooper & Wojan (2000) have shown that one-eye moved faces produce much more grotesque impressions than two-eye moved faces. Results suggest that a grotesque facial expression, which may induce fear, automatically attracts observers' attention and facilitates processing of the gaze, ultimately enhancing the gaze cueing effect.
A New Discontinuous Galerkin Finite Element Method for Directly Solving the Hamilton-Jacobi Equations
Yingda Cheng,Zixuan Wang
Mathematics , 2013, DOI: 10.1016/j.jcp.2014.02.041
Abstract: In this paper, we improve upon the discontinuous Galerkin (DG) method for Hamilton-Jacobi (HJ) equation with convex Hamiltonians in (Y. Cheng and C.-W. Shu, J. Comput. Phys. 223:398-415,2007) and develop a new DG method for directly solving the general HJ equations. The new method avoids the reconstruction of the solution across elements by utilizing the Roe speed at the cell interface. Besides, we propose an entropy fix by adding penalty terms proportional to the jump of the normal derivative of the numerical solution. The particular form of the entropy fix was inspired by the Harten and Hyman's entropy fix (A. Harten and J. M. Hyman. J. Comput. Phys. 50(2):235-269, 1983) for Roe scheme for the conservation laws. The resulting scheme is compact, simple to implement even on unstructured meshes, and is demonstrated to work for nonconvex Hamiltonians. Benchmark numerical experiments in one dimension and two dimensions are provided to validate the performance of the method.
On the Tradeoffs of Implementing Randomized Network Coding in Multicast Networks
Yingda Chen,Shalinee Kishore
Mathematics , 2008,
Abstract: Randomized network coding (RNC) greatly reduces the complexity of implementing network coding in large-scale, heterogeneous networks. This paper examines two tradeoffs in applying RNC: The first studies how the performance of RNC varies with a node's randomizing capabilities. Specifically, a limited randomized network coding (L-RNC) scheme - in which intermediate nodes perform randomized encoding based on only a limited number of random coefficients - is proposed and its performance bounds are analyzed. Such a L-RNC approach is applicable to networks in which nodes have either limited computation/storage capacity or have ambiguity about downstream edge connectivity (e.g., as in ad hoc sensor networks). A second tradeoff studied here examines the relationship between the reliability and the capacity gains of generalized RNC, i.e., how the outage probability of RNC relates to the transmission rate at the source node. This tradeoff reveals that significant reductions in outage probability are possible when the source transmits deliberately and only slightly below network capacity. This approach provides an effective means to improve the feasibility probability of RNC when the size of the finite field is fixed.

YU Yingda,PING Dehai,PENG Hongring,LI Douxing,YE Heneaiang,

金属学报 , 1997,
Abstract: Elemental mapping with a high spatial resolution is indispensable to characterization of the nanoscale microstructure in the research of materials science. In the present paper, Gatan Model 678 Imaging Filter, which has been attached to HF-2000 FEG TEM, has been employed to study the microstructures at namometer scale in several materials.
A New Digital Signature Algorithm Similar to ELGamal Type
Haipeng Chen,Xuanjing Shen,Yingda Lv
Journal of Software , 2010, DOI: 10.4304/jsw.5.3.320-327
Abstract: Application of digital signature technology becomes more extensive, but many exposed digital signature algorithms have increasingly revealed some shortcomings and deficiencies. Aiming directly at the frequently used digital signature technologies, which are weak to Substitution Attack and Homeostasis Attack, the authors perform the hash transformation on messages before signature. Then, a hash round function is constructed, which simultaneously satisfies the characters of balance, high nonlinearity, strict avalanche criterion and realization of software. Moreover, making use of the hash round function, a new hash algorithm named HRFA (Hash Round Function Algorithm) is contrived. On this basis, aiming at the defect that the existing digital signature algorithms are weak to active attack and impersonation attack, using the hash algorithm named HRFA and the self-certified public key system, a new kind of digital signature algorithm, which is similar to ELGamal, named H-S DSA (Hash Round Function and Self-certified Public Key System Digital Signature Algorithm) is raised and realized. Finally, the authors analyze the H-S DSA from two aspects of security and time-complexity. And, the results show that the new designed digital signature algorithm named H-S DSA not only has better security strength, but also has lower timecomplexity.
An Implicit ELGamal Digital Signature Scheme
Haipeng Chen,Xuanjing Shen,Yingda Lv
Journal of Software , 2011, DOI: 10.4304/jsw.6.7.1329-1336
Abstract: This paper introduced a detail ElGamal digital signature scheme, and mainly analyzed the existing problems of the ElGamal digital signature scheme. Then improved the scheme according to the existing problems of ElGamal digital signature scheme, and proposed an implicit ElGamal type digital signature scheme with the function of message recovery. As for the problem that message recovery not being allowed by ElGamal signature scheme, this article approached a method to recover message. This method will make ElGamal signature scheme have the function of message recovery. On this basis, against that part of signature was used on most attacks for ElGamal signature scheme, a new implicit signature scheme with the function of message recovery was formed, after having tried to hid part of signature message and refining forthcoming implicit type signature scheme. The safety of the refined scheme was anlyzed, and its results indicated that the new scheme was better than the old one.
Energy-conserving discontinuous Galerkin methods for the Vlasov-Ampère system
Yingda Cheng,Andrew J. Christlieb,Xinghui Zhong
Mathematics , 2013, DOI: 10.1016/j.jcp.2013.09.013
Abstract: In this paper, we propose energy-conserving numerical schemes for the Vlasov-Amp\`{e}re (VA) systems. The VA system is a model used to describe the evolution of probability density function of charged particles under self consistent electric field in plasmas. It conserves many physical quantities, including the total energy which is comprised of the kinetic and electric energy. Unlike the total particle number conservation, the total energy conservation is challenging to achieve. For simulations in longer time ranges, negligence of this fact could cause unphysical results, such as plasma self heating or cooling. In this paper, we develop the first Eulerian solvers that can preserve fully discrete total energy conservation. The main components of our solvers include explicit or implicit energy-conserving temporal discretizations, an energy-conserving operator splitting for the VA equation and discontinuous Galerkin finite element methods for the spatial discretizations. We validate our schemes by rigorous derivations and benchmark numerical examples such as Landau damping, two-stream instability and bump-on-tail instability.
Page 1 /126811
Display every page Item

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