523,286 research outputs found
Joshua Davis: Author of Spare Parts
Full text linkCitation: K-State First (2016). Joshua Davis: Author of Spare Parts [Flier]. Manhattan, Kansas: K-State First.Flyer advertising Joshua Davis's author talk at Kansas State University
High-k/InGaAs interface defects at cryogenic temperature
Full text linkOxide defects in the high-k/InGaAs MOS system are investigated. The behaviour of these traps is explored from room temperature down to 10 K. This study reveals that the exchange of free carriers between oxide states and either the conduction or the valence band is strongly temperature dependant. The capture and emission of electrons is strongly suppressed at 10 K as demonstrated by the collapse of the capacitance frequency dispersion in accumulation for n-InGaAs MOS devices, though hysteresis in the C-V sweeps is still present at 10 K. Phonon assisted tunnelling processes are considered in the simulation of electrical characteristics. The simulated data match very well the experimental characteristics and provide energy and spatial mapping of oxide defects. The multi phonon theory also help explain the impedance data temperature dependence. This study also reveals an asymmetry in the free carrier trapping between n and p type devices, where hole trapping is more significant at 10 K
Inverse systems of spectra and generalizations of a theorem of W.H. Lin
Full text linkIn this thesis we generalize a theorem of W. H. Lin.
Lin's results are concerned with the homotopy and cohomotopy
of an inverse system of spectra {P-k }. Using the quadratic
construction we construct an inverse system of spectra {P-k(E)}
We generalize Lin's results by studying the homotopy and cohomotopy
of {P-k(E)}
Steven Johnson Author Talk Poster
No full textK-State Book NetworkA poster advertising an author talk by Steven Johnson at Kansas State University on September 3, 2014. Steven Johnson's book "The Ghost Map" was the 2014-2015 common book
(11(3):39-45)A REPORT ON THE EXPERIMENT OF OPTIMUM N-P-K FERTILIZER RATIO FOR BANANA
No full text本試驗係於民國四十九年及五十年分別在水裡抗及林邊兩地舉行二年之試驗成績結果如下:
(l）由於每次試驗結果均表示極顯著之F-值，吾人可知三要素對香蕉的肥效極為可靠。
(2）每次試驗均表示平行增加三要素量時，其肥效均比單獨增加某一種要素時為高。可知香蕉施肥必須考慮三要素之平衡。
(3) 就以單要素之肥效觀之，磷肥肥效聶低，氮、鉀之肥效較高，水裡坑氮肥肥效大於鉀肥，林邊則鉀肥大於氮肥。
1. N. P and K have significant effects on the crop yield of banana according to this experriment.
2. Increasing N. P and K id propartion gave more increament in crop yield than increasing single element alone. This fact implies balanced N. P and K are important in banana fertilization.
3. Phosphorus is the least effective of the three elements. N and K are very impor-tant. In Shwei-li-keng, N was more important than K. but in Lin-pen, K was more important than K
Workflow of K-Means & Kernighan-Lin Combined Algorithm.
No full textWorkflow of K-Means & Kernighan-Lin Combined Algorithm.</p
Constructing vertex-disjoint paths in (n,k)-star graphs
No full text[[abstract]]This work describes a novel routing algorithm for constructing a container of width n - 1 between a pair of vertices in an (n, k)-star graph with connectivity it - 1. Since Lin et al. [T.C. Lin, D.R. Duh, H.C. Cheng, Wide diameter of (n, k)-star networks, in: Proceedings of the International Conference on Computing, Communications and Control Technologies, vol. 5, 2004 pp. 160-165] already calculated the wide diameters in (n, n - 1)-star and (n, 1)-star graphs, this study only considers an (n, k)-star with 2 <= k <= n - 2. The length of the longest container among all constructed containers serves as the upper bound of the wide diameter of an (n, k)-star graph. The lower bound of the wide diameter of an (n, k)-star graph with 2 <= k <= [n/2] and the lower bound of the wide diameter of a regular graph with a connectivity of 2 or above are also computed. Measurement results indicate that the wide diameter of an (n, k)-star graph is its diameter plus 2 for 2 <= k <= [n/2], or its diameter plus a value between 1 and 2 for [n/2] + 1 <= k <= n - 2. (c) 2007 Elsevier Inc. All rights reserved.[[note]]SC
Sample Efficient Search to Decision for LIN
Full text linkThe LIN problem concerns solving noisy systems of random sparse linear equations mod 2. It gives rise to natural candidate hard CSP distributions and is a cornerstone of local cryptography. Recently, it was used in advanced cryptographic constructions, under the name \u27sparse LPN\u27.
For constant sparsity and inverse polynomial noise rate, both search and decision versions of LIN are statistically possible and conjectured to be computationally hard for , where is the number of -sparse linear equations, and is the number of variables.
We show an algorithm that given access to a distinguisher for
LIN with samples, solves search LIN with roughly samples. Previously, it was only known how to reduce from search LIN with samples, yielding meaningful guarantees for decision LIN only when .
The reduction succeeds even if the distinguisher has sub-constant advantage at a small additive cost in sample complexity. Our technique applies with some restrictions to Goldreich\u27s function and LIN with random coefficients over other finite fields
LIN-39 does not regulate TRN fate markers in AVM.
No full text(A) AVM was posteriorly displaced in lin-39(n1760) mutants, but the expression of TRN fate marker uIs115[mec-17p::TagRFP] was not affected in lin-39 mutants. (B) The displaced AVM also expressed the TRN fate marker zdIs5[mec-4p::GFP] in lin-39 mutants. Scale Bars = 100 μm. (TIF)</p
- …
