125,905 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
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
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
Rathalos treecko Lin & Zhao & Koh & Li 2022, comb. nov.
No full textRathalos treecko (Lin & Li, 2021) comb. nov. Anyphaena treecko Lin & Li, In: Lin et al., 2021: 101, figs 9A–C, 10A–B, 14I–J. Material examined. Holotype ♂ (IZCAS-Ar42404), China: Hainan, Changjiang County, Bawangling, Dongsizhan (19.0495°N, 109.1157°E), 23 April 2009, G. Tang leg. (examined). Paratypes. 2♀ (IZCAS-Ar42405–Ar42406), same data as holotype (examined). Diagnosis. See Lin et al. (2021). Description. See Lin et al. (2021). Distribution. China (Hainan). Comments. The cymbial apophysis, the triangular epigyne and the straight copulatory duct indicate that this species belongs to Rathalos Lin & Li, gen. nov. Thus, we transfer it from Anyphaena to Rathalos Lin & Li, gen. nov.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 201, DOI: 10.11865/zs.2022303, http://zenodo.org/record/717585
Compact Adaptively Secure ABE from k-Lin: Beyond NC1 and towards NL
No full textWe present a new general framework for constructing compact and adaptively secure attribute-based encryption (ABE) schemes from -Lin in asymmetric bilinear pairing groups. Previously, the only construction [Kowalczyk and Wee, Eurocrypt \u2719] that simultaneously achieves compactness and adaptive security from static assumptions supports policies represented by Boolean formulae. Our framework enables supporting more expressive policies represented by arithmetic branching programs.
Our framework extends to ABE for policies represented by uniform models of computation such as Turing machines. Such policies enjoy the feature of being applicable to attributes of arbitrary lengths. We obtain the first compact adaptively secure ABE for deterministic and non-deterministic finite automata (DFA and NFA) from -Lin, previously unknown from any static assumptions. Beyond finite automata, we obtain the first ABE for large classes of uniform computation, captured by deterministic and non-deterministic logspace Turing machines (the complexity classes and ) based on -Lin. Our ABE scheme has compact secret keys of size linear in the description size of the Turing machine . The ciphertext size grows linearly in the input length, but also linearly in the time complexity, and exponentially in the space complexity. Irrespective of compactness, we stress that our scheme is the first that supports large classes of Turing machines based solely on standard assumptions. In comparison, previous ABE for general Turing machines all rely on strong primitives related to indistinguishability obfuscation
Spatial Chow-Lin Methods for Data Completion in Econometric Flow Models
No full textFlow data across regions can be modeled by spatial econometric models, see LeSage and Pace (2009). Recently, regional studies became interested in the aggregation and disaggregation of flow models, because trade data cannot be obtained at a disaggregated level but data are published on an aggregate level. Furthermore, missing data in disaggregated flow models occur quite often since detailed measurements are often not possible at all observation points in time and space. In this paper we develop classical and Bayesian methods to complete flow data. The Chow and Lin (1971) method was developed for completing disaggregated incomplete time series data. We will extend this method in a general framework to spatially correlated flow data using the cross-sectional Chow-Lin method of Polasek et al. (2009). The missing disaggregated data can be obtained either by feasible GLS prediction or by a Bayesian (posterior) predictive density.Missing values in spatial econometrics, MCMC, non-spatial Chow-Lin (CL) and spatial Chow-Lin (SCL) methods, spatial internal flow (SIF) models, origin and destination (OD) data
Workflow of K-Means & Kernighan-Lin Combined Algorithm.
No full textWorkflow of K-Means & Kernighan-Lin Combined Algorithm.</p
Optimal generation of spatially coherent soft X-ray isolated attosecond pulses in a gas-filled waveguide using two-color synthesized laser pulses
No full textCitation: Jin, C., Hong, K. H., & Lin, C. D. (2016). Optimal generation of spatially coherent soft X-ray isolated attosecond pulses in a gas-filled waveguide using two-color synthesized laser pulses. Scientific Reports, 6, 11. doi:10.1038/srep38165We numerically demonstrate the generation of intense, low-divergence soft X-ray isolated attosecond pulses in a gas-filled hollow waveguide using synthesized few-cycle two-color laser waveforms. The waveform is a superposition of a fundamental and its second harmonic optimized such that highest harmonic yields are emitted from each atom. We then optimize the gas pressure and the length and radius of the waveguide such that bright coherent high-order harmonics with angular divergence smaller than 1 mrad are generated, for photon energy from the extreme ultraviolet to soft X-rays. By selecting a proper spectral range enhanced isolated attosecond pulses are generated. We study how dynamic phase matching caused by the interplay among waveguide mode, neutral atomic dispersion, and plasma effect is achieved at the optimal macroscopic conditions, by performing time-frequency analysis and by analyzing the evolution of the driving laser's electric field during the propagation. Our results, when combined with the on-going push of high-repetition-rate lasers (sub- to few MHz's) may eventually lead to the generation of high-flux, low-divergence soft X-ray tabletop isolated attosecond pulses for applications
Succinct and Adaptively Secure ABE for ABP from k-Lin
No full textWe present *succinct* and *adaptively secure* attribute-based encryption (ABE)
schemes for *arithmetic branching programs*, based on k-Lin in pairing groups.
Our key-policy ABE scheme has ciphertexts of *constant size*, independent of
the length of the attributes, and our ciphertext-policy ABE scheme has secret
keys of *constant size*. Our schemes improve upon the recent succinct ABE
schemes in [Attrapadung and Tomida, Asiacrypt \u2720], which only handle Boolean
formulae. All other prior succinct ABE schemes either achieve only selective
security or rely on -type assumptions.
Our schemes are obtained through a general and modular approach that combines
a public-key inner-product functional encryption satisfying a new security
notion called gradual simulation security and an information-theoretic
randomized encoding scheme called arithmetic key garbling scheme
- …
