oalib

Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99

Submit

Any time

2019 ( 13 )

2018 ( 94 )

2017 ( 86 )

2016 ( 106 )

Custom range...

Search Results: 1 - 10 of 8240 matches for " Yuefei Shao "
All listed articles are free for downloading (OA Articles)
Page 1 /8240
Display every page Item
Rapid Separation of Five Cyclosporin Analogs by Supercritical Fluid Chromatography  [PDF]
Yuefei Shao, Chunlei Wang, Atsu Apedo, Oliver Mcconnell
Journal of Analytical Sciences, Methods and Instrumentation (JASMI) , 2016, DOI: 10.4236/jasmi.2016.62004
Abstract: Recently there has been a resurgence of interest in cyclic peptides due to their therapeutic advantages in terms of potency, permeability, proteolytic stability, and unique selectivity relative to traditional smaller drug molecules. Cyclosporin is a family of cyclic peptides widely used as autoimmune suppression agents. Cyclosporin analogs consist of eleven amino acids with the main difference lying at the side chain of its amino acid residues. In this study, a single step separation method was developed utilizing Supercritical Fluid Chromatography (SFC) to resolve five naturally occurring cyclosporin analogs (Cyclosporin A, B, C, D, and H) on a bare silica-packed column. The optimized method involved use of ethanol-modified carbon dioxide as mobile phase on a bare silica column at 80 °C and UV detection at 220 nm. Although column temperature and back pressure generally had insignificant effect on SFC separation, it was found in our study that increasing temperature and pressure greatly improved peak shape and resolution.
One Sound and Complete R-Calculus with Pseudo-Subtheory Minimal Change Property  [PDF]
Wei Li, Yuefei Sui
Journal of Computer and Communications (JCC) , 2013, DOI: 10.4236/jcc.2013.15004
Abstract:

The AGM axiom system is for the belief revision (revision by a single belief), and the DP axiom system is for the iterated revision (revision by a finite sequence of beliefs). Li [1] gave an R-calculus for R-configurations Δ|Γ, where Δ is a set of atomic formulas or the negations of atomic formulas, and Γ is a finite set of formulas. In propositional logic programs, one R-calculus N will be given in this paper, such that N is sound and complete with respect to operator s(Δ,t), where s(Δ,t)is a pseudo-theory minimal change of t by Δ.

The Sound and Complete R-Calculi with Respect to Pseudo-Revision and Pre-Revision  [PDF]
Wei Li, Yuefei Sui
International Journal of Intelligence Science (IJIS) , 2013, DOI: 10.4236/ijis.2013.32012
Abstract: The AGM postulates ([1]) are for the belief revision (revision by a single belief), and the DP postulates ([2]) are for the iterated revision (revision by a finite sequence of beliefs). Li [3] gave an R-calculus for R-configurations |Γ, where Δ is a set of literals, and Γ is a finite set of formulas. We shall give two R-calculi such that for any consistent set Γ and finite consistent set of formulas in the propositional logic, in one calculus, there is a pseudo-revision Θ of Γ by Δ such that \"\" is provable and \"\" and in another calculus, there is a pre-revision Ξ
Wandering domains in the transcendental dynamics
Yuefei Wang
Chinese Science Bulletin , 2001, DOI: 10.1007/BF03183203
Abstract: It is shown that new classes of non-critically finite entire functions do not have wandering domains.
The polynomially exponential time restrained analytical hierarchy
The Polynomially Exponential Time Restrained Analytical Hierarchy

Yuefei Sui,
Sui
,Yuefei

计算机科学技术学报 , 1991,
Abstract: A polynomially exponential time restrained analytical hierarchy is introduced with the basic properties of the hierarchy followed. And it will be shown that there is a recursive setA such thatA does not belong to any level of thep-arithmetical hierarchies. Then we shall prove that there are recursive setsA andB such that the different levels of the analytical hierarchy relative toA are different and for somen every level higher thann of the analytical hierarchy relative toB is the same as then-th level. And whether the higher levels are collapsed into some lower level is neither provable nor disprovable in set theory and several other results. Research supported by the Youth NSF grant JJ890407.
Classification of the index sets of low [n] pand high [n] p
Classification of the Index Sets of Low[n]~p and High [n]~p

Yuefei Sui,
Sui
,Yuefei

计算机科学技术学报 , 1991,
Abstract: In this paper we will first give the characterization of thep lowp degree, and prove that a p.r.e. degree
Robust Digital Image Stabilization Technique for Car Camera
Yuefei Zhang,Mei Xie
Information Technology Journal , 2011,
Abstract: This research studies the digital image stabilization technique for the In-Car videos which are acquired from a car camera. Firstly, the relationship is established between the lane-line positions in a camera coordinate and an image plane. Then an analysis is performed to reveal the positions of the lane-lines in In-Car videos. Next, a digital image stabilization method for car cameras is proposed based on lane-line matching. This method begins with extracting the lane-lines from an In-Car video. Then, feature triangles are constructed to estimate the global inter-frame motions of the input video and a series of compensating motion vectors are yielded by using Kalman filter based algorithm with the inter-frame motions. Finally, repositioning the frames of the input video, according to the compensating motion vectors, can produce a stabilized In-Car video. The proposed method is resistant to the scene changes of In-Car videos. The experimental results, both for the simulated In-Car videos and the real ones, have demonstrated that the proposed method can robustly reduce the effects of undesired car camera motions on In-Car videos.
Proof of Forward Security for Password-based Authenticated Key Exchange
Shuhua Wu,Yuefei Zhu
International Journal of Network Security , 2008,
Abstract: Recently, M. Abdalla et al. proposed a slightly different variant of AuthA, based on the scheme proposed by E. Bresson et al., and provided the first complete proof of forward-secrecy for AuthA. They claimed that under the Gap Diffie-Hellman assumption the variant of AuthA was forward-secure in the random-oracle model. In this paper, we present an active attack to reveal a previously unpublished flaw in their proof. To fix their proof, we have to introduce one more variant Diffie-Hellman assumption. If so, we found the scheme proposed by E. Bresson et al. could be proved forward secure as well. Since the proposal of E. Bresson et al. is simpler for implementation in practice, we only provided the rigorous proof of forward security for it.
New Efficient Searchable Encryption Schemes from Bilinear Pairings
Chunxiang Gu,Yuefei Zhu
International Journal of Network Security , 2010,
Abstract: Public key encryption with keyword search (PEKS) enables user Alice to send a secret key T_W to a server that will enable the server to locate all encrypted messages containing the keyword W, but learn nothing else. In this paper, we propose a new PEKS scheme based on bilinear pairings. There is no pairing operation involved in the encryption procedure and so our new PEKS scheme is more efficient than the scheme of Boneh et.al. in [5]. Then, we provide further discussions on removing secure channel from PEKS, and present an efficient secure channel free PEKS scheme. Our two new schemes can be proved secure in the random oracle model, under the appropriate computational assumptions.
Client-to-client Password-Based Authenticated Key Establishment in a Cross-Realm Setting
Shuhua Wu,Yuefei Zhu
Journal of Networks , 2009, DOI: 10.4304/jnw.4.7.649-656
Abstract: The area of password-based authenticated key establishment protocols has been the subject of a vast amount of work in the last few years due to its practical aspects. Despite the attention given to it, most passwordauthenticated key establishment (PAKE) schemes in the literature consider authentication between a client and a sever. Although some of them are extended to a threeparty PAKE protocol, in which a trusted server exists to mediate between two clients to allow mutual authentication, they are less considered in a cross-realm setting like in kerberos system. In this paper, we propose a provably secure password-authenticated key establishment protocol in a cross-realm setting where two clients in different realms obtain a secret session key as well as mutual authentication, with the help of respective servers. We deal with it using ideas similar to those used in the three-party protocol due to M. Abdalla et al. In our protocol, each client firstly establish secure channel with its server and then the servers securely distribute a fresh common session key to the two clients. One of the attractive features is that our protocol can be easily extended to a more general scenario where a common key should be established among more than two clients. Moreover, analysis shows that the proposed protocol has a per-user computational cost of the underlying two-party encrypted key exchange.
Page 1 /8240
Display every page Item


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