#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1994

2010

- This year (0)
- Last 5 years (0)
- Last 10 years (2)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- John Risch, Anne Kao, Steve Poteet, Yuan-Jye Jason Wu
- Visual Data Mining
- 2008

- Andrew Booker, Michelle Condliff, +5 authors Yuan-Jye Jason Wu
- Computing in Science and Engineering
- 1999

documents in electronic form, we now have an opportunity to better track and identify technological advances, market changes, competitors’ trends, and even enemy advances. However, to extract from this wealth of information those pieces that are relevant to an application, analysts need fast, flexible, and efficient analysis tools. The ability to visualize… (More)

- K. J. Ray Liu, Dianne P. O'Leary, G. W. Stewart, Yuan-Jye Jason Wu
- IEEE Trans. Signal Processing
- 1994

Esprit is an algorithm for determining the xed directions of arrival of a set of narrowband signals at an array of sensors. Unfortunately, its computational burden makes it unsuitable for real time processing of signals with time-varying directions of arrival. In this work we develop a new implementation of esprit that has potential for real time… (More)

Recent semi-synthetic studies of erythromycin A culminated in the discovery of two ketolide drug candidates, HMR-3647 and ABT-773, for the treatment of community-acquired bacterial infections caused by both macrolide- and beta-lactam-susceptible and -resistant S. pneumoniae, gram negative bacteria, and intracellular atypical pathogens. The discovery of… (More)

- Dianne P. O'Leary, Yuan-Jye Jason Wu
- SIAM J. Matrix Analysis Applications
- 1996

Grassman, Taksar, and Heyman have proposed an algorithm for computing the stationary vector of a Markov chain. Analysis by O'Cinneide confirmed the results of numerical experiments, proving that the GTH algorithm computes an approximation to the stationary vector with low relative error in each component. In this work, we develop a block form of the GTH… (More)

- Shaw-Jye Wu, Yuan-Jye J. Wu, Joe J. Shawx
- 1996

Computational problems for which an algorithm cannot be determined in polynomial time are classiied as NP-complete problems. Because of their great capacity to conduct parallel reactions, DNA molecules and their experimental protocols have been proposed to solve such problems, which otherwise are time-consuming for electronic computers. Based on a working… (More)

- John Risch, Shawn Bohn, Steve Poteet, Anne Kao, Lesley Quach, Yuan-Jye Jason Wu
- Encyclopedia of Machine Learning and Data Mining
- 2010

- Y J Wu
- Current pharmaceutical design
- 2000

Earlier semi-synthetic studies of erythromycin A culminated in the discovery of two successful second generation macrolide antibiotics, azithromycin and clarithromycin, for the treatment of community-acquired bacterial infections. More recent structural modifications of erythromycin A have resulted in the discovery of novel ketolide antibiotics and new… (More)

The GTH algorithm is a very accurate direct method for nding the stationary distribution of a nite-state, discrete time, irreducible Markov chain. O'Leary and Wu developed the block-GTH algorithm and successfully demonstrated the eeciency of the algorithm on vector pipeline machines and on workstations with cache memory. In this paper, we discuss the… (More)

Developing a generalized useful DNA computer has been one of the main interests since the inception of molecular computation. Toward that goal it is important to equip DNA with the ability to perform mathematical calculations. Here, a simple procedure that allows DNA-based bit arithmetic calculations is presented. Oligonucleotides encoding input bit numbers… (More)

- ‹
- 1
- ›