300,986 research outputs found
Joshua Davis: Author of Spare Parts
No full textCitation: 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
[19] F. Lin and W. M. Wonham, 1990. Decentralized control and coordination of discrete event systems with partial observation.
No full textdiscrete event systems. Discrete Event Dynamic Systems: Theory and Applications, 4(3), pp. 221-236. [9] M. Heymann and F. Lin, 1996. Nonblocking supervisory control of nondeterministic systems, Technion CIS Report #9620, October 1996. [10] M. Heymann and F. Lin, 1995. On observability and nondeterminism in discrete event control, Proceedings of the 33rd Allerton Conference on Communication, Control, and Computing, pp. 136-145. [11] M. Heymann and F. Lin, 1996. Discrete event control of nondeterministic discrete event systems, Proceedings of the 35th IEEE Conference on Decision and Control, to appear. [12] J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979. [13] K. Inan, 1994. Nondeterministic supervision under partial observation. in G. Cohen and J.-P. Quadrat, Eds., 11th International Conference on Analysis and Optimization o
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
Yi-Fang Lin Piano Recital Program Notes
No full textThis report is Yi-Fang Lin Piano Recital Program Notes on April., 23, 2019. The two pieces on the program include Piano Sonata in C minor, K.457 by W.A. Mozart, and Piano Concerto No.1 in F-Sharp minor, Op.1 by S. Rachmaninoff. The note will introduce the life of two composers, the compositional background of individual work, and the analysis of the structure, including tonal design and thematic material in each work
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
No full textThe 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
Figure 50. Singaporemma shenzhen Lin & Li in Taxonomy notes on twenty-eight spider species (Arachnida: Araneae) from Asia
No full textFigure 50. Singaporemma shenzhen Lin & Li, sp. nov., habitus. A–B. Dorsal view; C–D. Ventral view; E–F. Lateral view. Scale bars = 0.3 mm.Published as part of Lin, Yejie, Zhao, Huifeng, Koh, Joseph K H & Li, Shuqiang, 2022, Taxonomy notes on twenty-eight spider species (Arachnida: Araneae) from Asia, pp. 198-270 in Zoological Systematics 47 (3) on page 255, DOI: 10.11865/zs.2022303, http://zenodo.org/record/717585
Tz-Lin Hsu Piano Recital Program Notes
No full textThis is the Program Notes of Tz-Lin Hsu\ue2s piano recital held on May 20th, 2020. The recital program includes Johann Sebastian Bach\ue2s The Well-Tempered Clavier, Book 1, Prelude and Fugue No. 17 in A-flat Major, BWV 862; Ludwig van Beethoven\ue2s Sonata No. 7 in D Major, Op. 10, No. 3, Jakob Ludwig Felix Mendelssohn Bartholdy\ue2s Fantasy in F-sharp minor, Op. 28; and Ignacy Jan Paderewski\ue2s Th\uc3\ua8me vari\uc3\ua8 in A Major, Op. 16, No. 3. The program notes will briefly introduce these four composers\ue2 lives, their compositional backgrounds, and the structure of each work, including the tonal organization and thematic materials
Joint Reliability Importance in Linear <i>m</I>-consecutive-<i>k< F Systems
No full textEryilmaz, Serkan/0000-0002-2108-1781We study the joint reliability importance (JRI) of two components in Lin/m/Con/k/n : F systems. A Lin/m/Con/k/n : F system consists of n linearly ordered binary components, and the system fails iff there are at least m nonoverlapping runs of k consecutive failed components (n >= mk). In particular, we obtain expressions for the JRI in Lin/m/Con/k/n : F systems when the components are s-independent & identical, when the components are s-independent & nonidentical, and when the components are exchangeable & s-dependent. We present extensive numerical illustrations
Inverse systems of spectra and generalizations of a theorem of W.H. Lin
No full textIn 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)}
- …
