oalib

Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99

Submit

Any time

2019 ( 29 )

2018 ( 214 )

2017 ( 219 )

2016 ( 197 )

Custom range...

Search Results: 1 - 10 of 12635 matches for " Luo Yixi "
All listed articles are free for downloading (OA Articles)
Page 1 /12635
Display every page Item
Expression of ERBB3 binding protein 1 (EBP1) in salivary adenoid cystic carcinoma and its clinicopathological relevance
Sun Jian,Luo Yixi,Tian Zhen,Gu Liang
BMC Cancer , 2012, DOI: 10.1186/1471-2407-12-499
Abstract: Background ERBB3 binding protein 1 (EBP1) gene transfer into human salivary adenoid cystic carcinoma cells has been shown to significantly inhibit cell proliferation and reduce tumor metastasis in mouse models. In the current study, to evaluate if EBP1 is a novel biomarker capable of identifying patients at higher risk of disease progression and recurrence, we examined the EBP1 expression profile in adenoid cystic carcinoma (ACC) patients and analyzed its clinicopathological relevance. To understand the underlying anti-metastatic mechanism, we investigated if EBP1 regulates invasion-related molecules. Methods We performed immunohistochemical analysis on 132 primary adenoid cystic carcinoma and adjacent non-cancerous tissues using commercial EBP1, MMP9, E-cadherin and ICAM-1 antibodies. Results were correlated to clinicopathological parameters, long-term survival and invasion-related molecules by statistical analysis. Cell motility and invasiveness of vector or wild-type EBP1-transfected ACC-M cell lines were evaluated using wound healing and Boyden chamber assays. MMP9, E-cadherin and ICAM-1 proteins in these cell lines were detected using western blot assay. Results The expression of EBP1 was significantly higher in non-cancerous adjacent tissues compared with corresponding cancer tissues. The intensity and percentage of cells that reacted with EBP1 antibodies were significantly higher in cases with tubular pattern than those with solid pattern (P<0.0001). We also found adenoid cystic carcinoma with local lymphatic metastasis had significantly lower EBP1 expression than ACC with no local lymphatic node metastasis (P<0.0001). Similar findings were observed in ACC with lung metastasis compared with cases with no lung metastasis (P<0.0001), in particular, in cases with perineural invasion compared with cases with no perineural invasion (P<0.0001). Furthermore, a decrease in EBP1 expression was positively associated with a reduction in overall survival of ACC patients. Of note, EBP1 inhibits migration and invasiveness of ACC cells by upregulating E-cadherin but downregulating MMP9. In clinical adenoid cystic carcinoma patients, higher EBP1 expression was positively correlated with E-cadherin levels (P<0.001) but negatively correlated with MMP9 expression (P=0.0002). Conclusions EBP1 expression is reduced in adenoid cystic carcinoma, indicating unfavorable prognosis of ACC patients. Its regulation of MMP9 and E-cadherin protein levels suggests a critical therapeutic potential.
Analysis of a splitting estimator for rare event probabilities in Jackson networks
Jose Blanchet,Kevin Leder,Yixi Shi
Stochastic Systems , 2011,
Abstract: We consider a standard splitting algorithm for the rare-event simulation of overflow probabilities in any subset of stations in a Jackson network at level n, starting at a fixed initial position. It was shown in [8] that a subsolution to the Isaacs equation guarantees that a subexponential number of function evaluations (in n) suffices to estimate such overflow probabilities within a given relative accuracy. Our analysis here shows that in fact O(n2βV+1) function evaluations suffice to achieve a given relative precision, where βV is the number of bottleneck stations in the subset of stations under consideration in the network. This is the first rigorous analysis that favorably compares splitting against directly computing the overflow probability of interest, which can be evaluated by solving a linear system of equations with O(nd) variables.
A Semantic-Aware Algorithm to Rank Concepts in an OWL Ontology Graph
Yixi Chen,Keting Yin,Xiaohu Yang
Information Technology Journal , 2010,
Abstract: In order to help person understand complex and large-scale ontologies, we presented a concept ranking algorithm for OWL (Web Ontology Language) ontologies. This algorithm is based on the ontological structure and semantic meanings of concepts/relations. Different from the traditional ranking methods, this algorithm applies semantic meanings (patterns) on concepts and relations. The importance of concepts reinforces one another in an iterative manner; only the semantically correct paths can flood relevant components of importance vector from a concept to its neighbors in ontology graphs. The experimental results show that such a semantically ranking method provides more reasonable ranking result than PageRank-like algorithms.
Modeling the interdependency of low-priority congestion control and active queue management
YiXi Gong,Dario Rossi,Emilio Leonardi
Computer Science , 2013,
Abstract: Recently, a negative interplay has been shown to arise when scheduling/AQM techniques and low-priority congestion control protocols are used together: namely, AQM resets the relative level of priority among congestion control protocols. This work explores this issue by (i) studying a fluid model that describes system dynamics of heterogeneous congestion control protocols competing on a bottleneck link governed by AQM and (ii) proposing a system level solution able to reinstate priorities among protocols.
Analysis of a Splitting Estimator for Rare Event Probabilities in Jackson Networks
Jose Blanchet,Kevin Leder,Yixi Shi
Computer Science , 2010,
Abstract: We consider a standard splitting algorithm for the rare-event simulation of overflow probabilities in any subset of stations in a Jackson network at level n, starting at a fixed initial position. It was shown in DeanDup09 that a subsolution to the Isaacs equation guarantees that a subexponential number of function evaluations (in n) suffice to estimate such overflow probabilities within a given relative accuracy. Our analysis here shows that in fact O(n^{2{\beta}+1}) function evaluations suffice to achieve a given relative precision, where {\beta} is the number of bottleneck stations in the network. This is the first rigorous analysis that allows to favorably compare splitting against directly computing the overflow probability of interest, which can be evaluated by solving a linear system of equations with O(n^{d}) variables.
ENANTIOSELECTIVE EXTRACTION OF RACEMIC OFLOXACIN BY DI(2-ETHYLHEXYL)PHOSPHORIC ACID AND TARTARIC ACID DERIVATIVES AS MIXED COMPLEX CHIRAL SELECTORS
TIAN,LINGXING; YANG,WEIJIE; CHEN,XIAOQING; XIE,YIXI;
Journal of the Chilean Chemical Society , 2011, DOI: 10.4067/S0717-97072011000200003
Abstract: the distribution behavior of ofloaxcin (oflx) enantiomers in a two-phase system was examined using a new mixed complex chiral selector consisting of di(2-ethylhexyl) phosphoric acid (d2ehpa) and two tartaric acid derivatives with n-octanol as diluents. the influence of composition of mixed complex chiral selector, initial concentration of oflx, ph of aqueous phase and temperature was investigated. a maximum enantioselectivity of 2.43 was obtained when the molar concentration ratio of l-(-)-dbta to l-(-)-dtta is 2:3 l-(-)-dtta concentration 0.18 mol/l, l-(-)-dbta concentration 0.12mol/l) and the ph of aqueous phase is 6.86 at 25°c, with dd and dl up to a relative high value of 10.2 and 4.20, respectively. the results indicated a useful way of searching new efficient chiral selectors and it was proved also helpful to optimize the extraction systems and realize the large-scale production of the pure isomer of racemic mixtures with extraction methods.
Optimizing Performance of Composite Services in Multiple Networks Enterprise Environment
Shuai Zhang,Jianling Sun,Yuanhong Shen,Yixi Chen
Information Technology Journal , 2011,
Abstract: Many approaches have been proposed for performance optimization of centralized services composition. However, with the prevalence of web services, services orchestration evolves from intra-enterprise integration to cross-enterprise integration and involves multiple networks. In such environment, the centralized orchestration suffers from several performance and reliability issues due to the limitation of centralized execution engine and the network conditions. In this paper, we try to optimize the performance of composite services in enterprise environment by adjusting the deployment location of component services. First, we propose a decentralized orchestration model for multiple networks environment. Based on this model, we propose the concept called service interaction strength, which is denoted by the data interaction between component services in a composite service as well as the importance of composite service itself. Then we design an objective function for all composition services with overall minimum cross domains service interaction costs and thus reduce the response latency and increase the performance of composite services. At last we introduce a mixed repair genetic algorithm to get the optimized deployment plans for all component services. Experimental results on simulation prototype show the optimization effectiveness of our approach and the performance of algorithm itself is also acceptable.
ENANTIOSELECTIVE EXTRACTION OF RACEMIC OFLOXACIN BY DI(2-ETHYLHEXYL)PHOSPHORIC ACID AND TARTARIC ACID DERIVATIVES AS MIXED COMPLEX CHIRAL SELECTORS
LINGXING TIAN,WEIJIE YANG,XIAOQING CHEN,YIXI XIE
Journal of the Chilean Chemical Society , 2011,
Abstract: The distribution behavior of ofloaxcin (OFLX) enantiomers in a two-phase system was examined using a new mixed complex chiral selector consisting of di(2-ethylhexyl) phosphoric acid (D2EHPA) and two tartaric acid derivatives with n-octanol as diluents. The influence of composition of mixed complex chiral selector, initial concentration of OFLX, pH of aqueous phase and temperature was investigated. A maximum enantioselectivity of 2.43 was obtained when the molar concentration ratio of L-(-)-DBTA to L-(-)-DTTA is 2:3 L-(-)-DTTA concentration 0.18 mol/L, L-(-)-DBTA concentration 0.12mol/L) and the pH of aqueous phase is 6.86 at 25°C, with Dd and Dl up to a relative high value of 10.2 and 4.20, respectively. The results indicated a useful way of searching new efficient chiral selectors and it was proved also helpful to optimize the extraction systems and realize the large-scale production of the pure isomer of racemic mixtures with extraction methods.
Weak magnetism and the Mott-state of vanadium in superconducting Sr2VO3FeAs
Franziska Hummel,Yixi Su,Anatoliy Senyshyn,Dirk Johrendt
Physics , 2013, DOI: 10.1103/PhysRevB.88.144517
Abstract: We report neutron scattering data and DFT calculations of the stoichiometric iron-arsenide superconductor Sr2VO3FeAs. Rietveld refinements of neutron powder patterns confirm the ideal composition without oxygen deficiencies. Experiments with polarized neutrons prove weak magnetic ordering in the V-sublattice of Sr2VO3FeAs at ~ 45 K with a probable propagation vector q = (1/8,1/8,0). The ordered moment of ~ 0.1 muB is too small to remove the V-3d bands from the Fermi level by magnetic exchange splitting, and much smaller than predicted from a recent LDA+U study. By using DFT calculations with a GGA+EECE functional we recover the typical quasi-nested Fermi-surface even without magnetic moment. From this we suggest that the V-atoms are in a Mott-state where the electronic correlations are dominated by on-site Coulomb-repulsion which shifts the V-3d states away from the Fermi energy. Our results are consistent with photoemission data and clearly reveal that Sr2VO3FeAs is a typical iron-arsenide superconductor with quasi-nested hole- and electron-like Fermi surface sheets, and constitutes no new paradigm. We suggest that intrinsic electron-doping through V3+/V4+ mixed valence is responsible for the absence of SDW ordering.
A New Technique for Estimating the Lower Bound of the Trust-Region Subproblem  [PDF]
Xinlong Luo
Applied Mathematics (AM) , 2011, DOI: 10.4236/am.2011.24052
Abstract: Trust-region methods are popular for nonlinear optimization problems. How to determine the predicted reduction of the trust-region subproblem is a key issue for trust-region methods. Powell gave an estimation of the lower bound of the trust-region subproblem by considering the negative gradient direction. In this article, we give an alternate way to estimate the same lower bound of the trust-region subproblem.
Page 1 /12635
Display every page Item


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