Browsing by Author "LEE, YY"
Now showing 1 - 3 of 3
- Results Per Page
- Sort Options
Item type:Item, A PRECISION EXPERIMENT ON ELECTRONS, PHOTONS AND MUONS AT LHC(1993-02-01) ;AZIZ, T ;BOCK, R ;BRAUNSCHWEIG, W ;GEULIG, EHILGERS, KWe describe the upgrade of the L3 detector for running at LHC. The principle goals are the precise measurement of electrons, photons and muons.Item type:Item, KINETICS OF THE REACTION OF HSO WITH O3 AT TEMPERATURES 273-423 K(1994-01-01) ;LEE, YY ;LEE, YP ;WANG, NS ;應用化學系Department of Applied ChemistryThe rate coefficient of the reaction of HSO with O3 at five temperatures in the range 273-423 K was determined by means of the discharge-flow/laser-induced-fluorescence technique. The laser-induced fluorescence of HSO was detected by the gated photon-counting technique; a detection limit approximately 4 X 10(9) molecules cm -3 was achieved. The reaction was carried out under pseudo-first-order conditions with [03] much greater than [HSO]; the rate coefficient was determined to be k = (4.7 +/- 1.0) X 10(-14) CM3 Molecule-1 s-1 at 298 K, approximately 30% greater than, but within experimental uncertainty of the only previous measurement by Wang and Howard by means of the discharge-flow/laser-magnetic-resonance technique. The temperature dependence of the rate coefficient is expressed in the Arrhenius form, k(T) = (2.1 +/- 0.7) X 10(-12) exp[- (1120 +/- 320)/T] cm3 molecule-1 s-1.Item type:Item, THE MOST VITAL EDGES WITH RESPECT TO THE NUMBER OF SPANNING-TREES IN 2-TERMINAL SERIES-PARALLEL GRAPHS(1992) ;JAN, RH ;HSU, LH ;LEE, YY ;資訊工程學系Department of Computer ScienceA set E' of k edges in a multigraph G = (V, E) is said to be a k most vital edge set (k-MVE set) if these edges being removed from G, the resultant graph G' = (V,E - E') has minimum number of spanning trees. The problem of finding a k-MVE set for two-terminal series-parallel graphs is considered in this paper. We present an O(Absolute value of E) time algorithm for the case k = 1, and an O(Absolute value of V(k) + Absolute value of E) time algorithm for arbitrary k.