Cao, Ronghua, Liu, Xiaoguang, Gao, Kexiang, Mendgen, Kurt, Kang, Zhensheng, Gao, Jianfeng, ...
Antagonism of three endophytic fungi isolated from common reed (Phragmites australis) against eight soilborne pathogenic fungi was investigated on potato dextrose agar by light microscopy, scanning...
Bmc Bioinformatics, Guanrao Chen, Peter Larsen, Eyad Almasri, Yang Dai
Research article Rank-based edge reconstruction for scale-free genetic regulatory networks
Abstract. A new kernel has been developed for vectors derived from a coding scheme of the tri-peptide composition for protein sequences. This kernel defines the sequence similarity through a mapping...
Improved protein fold assignment using support (2008)
Vector Machines, Robert E. Langlois, Alice Diec, Ognjen Perisic, Yang Dai, Hui Lu
Abstract: Because of the relatively large gap of knowledge between number of protein sequences and protein structures, the ability to construct a computational model predicting structure from...
Rank-based edge reconstruction for scale-free genetic regulatory networks (2008)
Chen, Guanrao, Larsen, Peter, Almasri, Eyad, Dai, Yang
Abstract Background The reconstruction of genetic regulatory networks from microarray gene expression data has been a challenging task in bioinformatics. Various approaches to this problem have been...
On the Influence of Outliers in the Support Vector Machine Framework (2008)
Yang Dai, Junichi Tanaka, Osamu Watanabe
A Support Vector Machine (SVM in short) is a mechanism for data analysis such as classification, regression, and clustering. In this paper, we consider the soft margin formulation of SVM for...
acknowledgments to financial supports: The first and the forth authors started this research while visiting the Centre de Recerca
Science, Sports and Culture of Japan. (2007)
Abstract: The problem of unequal sphere packing in a 3-dimensional polytope is analyzed. Given a set of unequal spheres and a polytope, the double goal is the assembly of the spheres in such a way...
Danny Z. Chen, Ovidiu Daescu, Yang Dai, Naoki Katoh, Xiaodong Wu, Jinhui Xu
The problem of optimizing the sum of m linear fractional functions (SOLF) in a xed dimension d, subject to n linear constraints, arises in a number of theoretical and applied areas. This paper...
Danny Z. Chen, Ovidiu Daescu, Yang Dai, Naoki Katoh, Xiaodong Wu, Jinhui Xu
The problem of optimizing the sum of m linear fractional functions (SOLF) in a xed dimension d, subject to n linear constraints, arises in a number of theoretical and applied areas. This paper...
Akiko Takeda, Yang Dai, Mituhiro Fukuda, Masakazu Kojima
Recently Kojima and Tuncel proposed new successive convex relaxation methods and their localized-discretized variants for general nonconvex quadratic optimization problems. Although an upper bound of...
A New Probabilistic Analysis of Karger's Randomized Algorithm for Minimum Cut Problems (2007)
Yang Dai, Kazuo Iwano, Naoki Katoh
Recently Karger proposed a new randomized algorithm for finding a minimum cut of an n-vertex graph (weighted or unweighted) with probability\Omega n
Generalized LMT-Skeleton Heuristics for Several New Classes of Optimal Triangulations 1 (2007)
Yang Dai, Naoki Katoh, Siu-wing Cheng
Given a planar point set, we consider three classes of optimal triangulations: (1) the minimum weight triangulation with angular constraints (constraints on the minimum angle and the maximum angle in...
Larsen, Peter, Almasri, Eyad, Chen, Guanrao, Dai, Yang
Abstract Background The incorporation of prior biological knowledge in the analysis of microarray data has become important in the reconstruction of transcription regulatory networks in a cell. Most...
Abstract Background The accomplishment of the various genome sequencing projects resulted in accumulation of massive amount of gene sequence information. This calls for a large-scale computational...
Impact of the CYP3A5 polymorphism on the metabolic disposition of calcineurin inhibitors / (2006)
Thesis (Ph. D.)--University of Washington, 2006.
Background: The accomplishment of the various genome sequencing projects resulted in accumulation of massive amount of gene sequence information. This calls for a large-scale computational method for...
Prediction of MHC class II binding peptides based on an iterative learning model (2005)
Abstract Background Prediction of the binding ability of antigen peptides to major histocompatibility complex (MHC) class II molecules is important in vaccine development. The variable length of each...
An SVM-based system for predicting protein subnuclear localizations (2005)
Abstract Background The large gap between the number of protein sequences in databases and the number of functionally characterized proteins calls for the development of a fast computational tool for...
Select-reject difference in choice under risk involving negative prospects / (2005)
Thesis (M.S.)--UCLA, 2005.
Yang Dai, Sunyoung Kim, Masakazu Kojima
Abstract. All isolated solutions of the cyclic-n polynomial equations are not known for larger dimensions than 11. We exploit two types of symmetric structures in the cyclic-n polynomial to compute...
Yang Dai, Sunyoung Kim, Masakazu Kojima
Abstract. All isolated solutions of the cyclic-n polynomial equations are not known for larger dimensions than 8 except the dimensions 10 and 11. We exploit two types of symmetric structures in the...
Building text classifiers using positive and unlabeled examples (2003)
Bing Liu, Yang Dai, Xiaoli Li, Wee Sun Lee, Philip S. Yu
This paper studies the problem of building text classifiers using positive and unlabeled examples. The key feature of this problem is that there is no negative example for learning. Recently, a few...
Building Text Classifiers Using Positive and Unlabeled Examples (2003)
Bing Liu, Yang Dai, Xiaoli Li, Wee Sun Lee, Philip S. Yu
This paper studies the problem of building text classifiers using positive and unlabeled examples. The key feature of this problem is that there is no negative example for learning. Recently, a few...
Feedback Control of Multi-Story Structures under Seismic Excitations (2002)
This dissertation studies the feedback control of the dynamic response of multi-story structures to seismic excitations. The seismic excitations are represented by arbitrary unknown stochastic...
Feedback Control of Multi-Story Structures under Seismic Excitations (2002)
This dissertation studies the feedback control of the dynamic response of multi-story structures to seismic excitations. The seismic excitations are represented by arbitrary unknown stochastic...
Feedback control of multi-story structures under seismic excitations (2002)
Thesis (Ph. D.)--Virginia Polytechnic Institute and State University, 2002.
Feedback control of multi-story structures under seismic excitations [electronic resource] / (2002)
This dissertation studies the feedback control of the dynamic response of multi-story structures to seismic excitations. The seismic excitations are represented by arbitrary unknown stochastic...
Feedback control of multi-story structures under seismic excitations (2002)
Thesis (Ph. D.)--Virginia Polytechnic Institute and State University, 2002.
Provably fast support vector regression using random sampling, to appear (2002)
José L. Balcázar, Yang Dai, Osamu Watanabe
Support Vector Machines are a family of data analysis algorithms, based on convex Quadratic Programming. Their use has been demonstrated in classification, regression, and clustering problems. In...
Provably Fast Support Vector Regression Using Random Sampling (2002)
Jose Balcazar Departament, Jose L. Balcazar, Yang Dai, Osamu Watanabe
Support Vector Machines are a family of data analysis algorithms, based on convex Quadratic Programming. Their use has been demonstrated in classification, regression, and clustering problems. In...
Provably fast training algorithms for support vector machines (2001)
Jose L. Balcazar, Yang Dai, Osamu Watanabe
Support Vector Machines are a family of data analysis algorithms, based on convex Quadratic Programming. We focus on their use for classification: in that case the SVM algorithms work by maximizing...
Provably Fast Training Algorithms for Support Vector Machines (2001)
Jose Balcazar Departament, Jose L. Balcazar, Yang Dai, Osamu Watanabe
Support Vector Machines are a family of data analysis algorithms, based on convex Quadratic Programming. We focus on their use for classification: in that case the SVM algorithms work by maximizing...
Yang Dai, S. Kim, M. Kojima, Sunyoung Kim, Masakazu Kojima
All isolated solutions of the cyclic-n polynomial equations are not known for larger dimensions than 8 except the dimensions 10 and 11. We exploit two types of symmetric structures in the cyclic-n...
Provably fast training algorithms for support vector machines (2001)
José L. Balcázar, Yang Dai, Osamu Watanabe
Support Vector Machines are a family of data analysis algorithms, based on convex Quadratic Programming. We focus on their use for classification: in that case the SVM algorithms work by maximizing...
A Study of the Global Optimaization Approach to Spherical Packing Problems (2000)
: We consider a spherical packing problem in a 3-dimensional polytope. Given a set of unequal spheres and a polytope, our goal is to pack them in a way that (1) the spheres do not overlap with each...
Optimizing the sum of linear fractional functions and applications (2000)
Chen, Danny Z., Daescu, Ovidiu, Dai, Yang, Katoh, Naoki, Wu, Xiadong, Xu, Jinhui
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, January 9-11, 2000 -- T.p. verso ; This symposium was sponsored by the ACM Special Interest...
Akiko Takeda, Yang Dai, Mituhiro Fukuda, Masakazu Kojima
. Recently Kojima and Tun¸cel proposed new successive convex relaxation methods and their localized-discretized variants for general nonconvex quadratic programs. Although an upper bound of the...
Akiko Takeda, Yang Dai, Mituhiro Fukuda, Masakazu Kojima
Recently Kojima and Tun¸cel proposed new successive convex relaxation methods and their localized-discretized variants for general nonconvex quadratic optimization problems. Although an upper bound...
Computing New Classes of Optimal Triangulations with Angular Constraints (1998)
Given a planar point set S, a triangulation of S is a maximal set of nonintersecting edges connecting points in S. Triangulating a point set has many applications in computational geometry and other...
Chakravorty, Soumitesh, Aladegbami, Bola, Motiwala, Alifiya S., Dai, Yang, Safi, Hassan, Brimacombe, Michael, ...
Rifampin resistance is a key prognostic marker for treatment success in tuberculosis patients. Recently, Wang et al. demonstrated that Rv2629 A191C mutations were present in 99.1% of...
Provably Fast Training Algorithms for Support Vector Machines
Jose Balcazar, Yang Dai, Junichi Tanaka, Osamu Watanabe
Support Vector Machines are a family of algorithms for the analysis of data based on convex Quadratic Programming. We focus on their use for classification, where the SVM algorithms work by...