Abstract On the Design of Reliable Boolean Circuits that Contain (2008)
Dan Kleitman, Tom Leighton, Yuan Ma
Partially Unreliable Gates* We investigate a model of gate failure for Boolean circuits in which a faulty gate is restricted to out-put one of its input values. For some types of gates, the model...
Nabil Kahale, Tom Leighton, Yuan Ma, C. Greg Plaxton, Torsten Suel
7 We establish a lower bound of (1:12 \Gamma o(1)) n log n on the size of any n-input sorting network; this is the first lower bound that improves upon the trivial information-theoretic bound by more...
N Barrier, Tom Leighton, Yuan Ma, C. Greg Plaxton
In this paper, we study the problem of constructing a sorting circuit, network, or PRAM algorithm that is tolerant to faults. For the most part, we focus on fault patterns that are random, i.e.,...
Xiang, Yanjuan, Wu, Xiaochun, Liu, Dongfang, Jiang, Xingyu, Chu, Weiguo, Li, Zhiyuan, ...
In this letter, we report the competing growth of a Pd shell on the {110} and {100} facets of Au nanorods (Au NRs). This results in the disappearance of unstable {110} facets and the formation of...
CityU Call Number: HF5415.5.M155 2006
Thesis (Ph. D.)--Stony Brook University, 2005.
OPTIMAL MEMS PLATE DESIGN AND CONTROL FOR LARGE CHANNEL COUNT OPTICAL SWITCHES (2004)
The design and control of an optimal mirror plate actuator suitable for large channel count MEMS optical switch applications is researched. An optimal plate actuator structure is presented. Its...
OPTIMAL MEMS PLATE DESIGN AND CONTROL FOR LARGE CHANNEL COUNT OPTICAL SWITCHES (2004)
The design and control of an optimal mirror plate actuator suitable for large channel count MEMS optical switch applications is researched. An optimal plate actuator structure is presented. Its...
Optimal mems plate design and control for large channel count optical switches (2004)
Thesis (Ph. D.) -- University of Maryland, College Park, 2004.
CMOS optical micro-radiator vacuum sensor / (2002)
A thesis submitted to the Faculty of Graduate Studies and Research in partial fulfillment of the requirements for the degree of Doctor of Philosophy, Dept. of Electrical and Computer Engineering,...
Optimal Constructions of Hybrid Algorithms (2001)
Kao, Ming-Yang, Ma, Yuan, Sipser, Michael, Yin, Yiqun
We study on-line strategies for solving problems with hybrid algorithms. There is a problem Q and w basic algorithms for solving Q. For some lambda
Matching nuts and bolts in O(n log n) time (1998)
János Komlós, J Anos, Endre Szemerédi, Koml Os, Yuan Ma, ...
.<F3.783e+05> Given a set of<F3.804e+05> n<F3.783e+05> nuts of distinct widths and a set of<F3.804e+05> n<F3.783e+05> bolts such that each nut corresponds to a unique...
Magnetically actuated CMOS micromachined cantilever-in-cantilever devices / (1997)
Submitted to the Faculty of Graduate Studies and Research in partial fulfilment of the requirements for the degree of Master of Science, Department of Electrical and Computer Engineering.
An -size fault-tolerant sorting network (1996)
Abstract This thesis studies sorting circuits, networks, and PRAM algorithms that are tolerant to faults. We consider both worst-case and random fault models, although we mainly focus on the more...
On Probabilistic Networks for Selection, Merging, and Sorting (1995)
Tom Leighton, Yuan Ma, Torsten Suel
We study comparator networks for selection, merging, and sorting that output the correct result with high probability given a random input permutation. We prove tight bounds, up to constant factors,...
Lower Bounds for Sorting Networks (1995)
Nabil Kahale, Tom Leighton, Yuan Ma, C. Greg Plaxton, Torsten Suel, Endre Szemerédi
We establish a lower bound of (1:12 \Gamma o(1)) n log n on the size of any n-input sorting network; this is the first lower bound that improves upon the trivial information-theoretic bound by more...
Fault-tolerant sorting networks (1994)
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1994.
Fault-tolerant sorting networks / (1994)
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1994.
Fault-tolerant sorting networks (1994)
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1994.
Highly fault-tolerant sorting circuits (1991)
Tom Leighton, Yuan Ma, C. Greg Plaxton
In this paper, we consider the problem of constructing a sorting circuit that will work well even if a constant fraction of its comparators fail at random. We consider two types of comparator...
Highly passage of Spodoptera litura cell line causes its permissiveness to baculovirus infection
Zhang, Xuping, Lan, Wenjie, Deng, Yujie, Ma, Yuan, Liu, Kaiyu, Peng, Jianxin, ...
It is well known that the characteristics of cell lines possibly alter when cell lines are at high-passage number because of the environmental selection. We do not know whether non-permissive or...