Hwang F.K.

F.K. Hwang

Information about the author F.K. Hwang will soon be added to the site.
Found 14 papers in total
A new index of component importance
A new index of component importance
2001
Several indices of component importance have been proposed in the literature. The...
Directional-quasi-convexity, asymmetric Schur-convexity and optimality of consecutive partitions
Directional-quasi-convexity, asymmetric Schur-convexity and optimality of consecutive partitions
1996
The current paper has the following distinct goals: 1. To generalize standard...
Rare-event component importance for the consecutive-k system
Rare-event component importance for the consecutive-k system
2002
Various indices of component importance with respect to system reliability have been...
A new index of component importance
A new index of component importance
2001
Several indices of component importance have been proposed in the literature. The...
Partition polytopes over 1-dimensional points
Partition polytopes over 1-dimensional points
1999
We consider partitions of a finite set whose elements are associated with a single...
An optimal group testing algorithm on k disjoint sets
An optimal group testing algorithm on k disjoint sets
1993
Chang and Hwang proved that for two disjoint sets with m and n items each containing...
The capacity of the subarray partial concentrators
The capacity of the subarray partial concentrators
1992
A partial concentrator with parameters n,m, and c , is an n (inputs)× m...
An improved upper bound for the subarray partial concentrators
An improved upper bound for the subarray partial concentrators
1992
Partial concentrators are used for the assignment of inlets to first-stage switches in...
Generalization of an engineering principle
Generalization of an engineering principle
1992
The authors generalized the well known engineering principle ‘component-level...
A primer of the Euclidean Steiner problem
A primer of the Euclidean Steiner problem
1991
The paper gives an up-to-date survey on the Euclidean Steiner problem which deals with...
A direct argument for Kaplansky’s theorem on a cyclic arrangement and its generalization
A direct argument for Kaplansky’s theorem on a cyclic arrangement and its generalization
1991
Kaplansky gave a formula which determines the number of ways of selecting j objects,...
Binary vectors with exactly k nonoverlapping m-tuples of consecutive ones
Binary vectors with exactly k nonoverlapping m-tuples of consecutive ones
1991
Recently, Apostol studied the number of binary vectors in n- space containing exactly...
A mathematical abstraction of the rearrangeability conjecture for shuffle-exchange networks
A mathematical abstraction of the rearrangeability conjecture for shuffle-exchange networks
1989
Shuffle-exchange networks have received a great deal of attention as interconnecting...
Optimal assignment of components to a two-stage k-out-of-n system
Optimal assignment of components to a two-stage k-out-of-n system
1989
A two-stage k -out-of- n system is a l -out-of- m system except that each of the m...
Papers per page: