• 沒有找到結果。

短文一 作

N/A
N/A
Protected

Academic year: 2022

Share "短文一 作"

Copied!
1
0
0

加載中.... (立即查看全文)

全文

(1)

i i

“C38N13” — 2014/3/28 — 11:51 — page 21 — #6

i i

i i

i i 我和數學研究的第一次邂逅 21

萬次, 用群試法, 則只是幾百次 (群試是把多人的血液樣本抽一些混在一起試, 如通過則這群人 一起通過), 現在則已在非洲多國用來測試 AIDS 患者。 我早先就做群試問題, 不過是或然率型 的, 此時看到了離散型的群試問題可以借用併序法的成果, 即大力介紹這一新觀點, 及因而得到 的新成果, 前後寫了文章和書。 群試又可以用到通訊網路上, 也寫了文章, 拿了專利。 最近又用 在 DNA 測試上 (寫了一本書)。 所以你看我的第一次數學研究一個失敗的經驗竟引出了後面這 麼多好事。 做研究真好!

誌謝: 本文承陳宏賓博士改寫成符合投稿規定的 pdf 形式, 深表感謝。 並謝邵子凡、 任元兩學 長閱讀初稿, 賜以鼓勵。

參考資料

1. Ford, L. R. Jr. and Johnson, S. B., A tournament problem, Amer. Math. Monthly, 66(1959), 387-389.

2. Hwang, F. and Lin, S., A simple algorithm for merging two linearly-ordered sets, SIAM J. Comput., 1(1972), 31-39.

3. Knuth, D., The Art of Computer Programming, Vol.7, Addison-Wesley,1975, 6, 2, 4.

4. Wells, M., Note on the fact that S12> log 12!, Proc. IFIP65 Congress, 2(1965), 497-498.

5. Hwang, F. and Lin, S., Optimal merging of 2 elements with n elements, Acta Informat- ica, 1(1971), 148-158.

6. Hwang, F., Optimal merging of 3 elements with n elements, SIAM J. Comput., 9(1980), 298-320.

—本文作者為國立交通大學應用數學系講座教授 (已退休)

小品 短文一

作者 : 蘇珮瑄、 陳若瑜

一個零對另一個零說:「我們在一起吧! 我許你一個無限大的未來。」

—本文作者為中國科技大學行銷與流通管理系學生—

參考文獻

相關文件

makes any (robust) regular classification algorithm cost-sensitive theoretical guarantee: cost equivalence. algorithmic use: a novel and simple algorithm CSOVO experimental

In this paper we study data trees in which the data values come from a linearly ordered domain, and in addition to equality test, we can test whether the data value in a node is

Klee, Recursive structure of S- matrices and an O(m 2 ) algorithm for recognizing strong sign solvability, Lin- ear Algebra Appl.. Ladner, Qualitative ma- trices:

[r]

Theorem 3.1, together with some algebraic manipulations, implies that the quantum corrections attached to the extremal ray exactly remedy the defect caused by the classical product

2, we describe the basic mathematical equations in a fluid- mixture form that will be used later in a numerical method for constructing approximate solutions of our model

Branch-name is the primary-key of the branch entity set. Therefore, while merging the two banks’ entity sets, if both banks have a branch with the same name, one of them will be

263 HERMANO FRID, Correction to "Maps of Convex Sets and Invariant Regions for. Finite Difference Systems of Conservation L a w