188,117 research outputs found
The Relationship Between Pretend Play and Playfulness in Children With Autism Spectrum Disorder
No full textAbstract
Date Presented 3/30/2017
This study explored the relationship between pretend play and playfulness in children with autism spectrum disorder (ASD). Our findings suggest that it is important to assist children with ASD to engage in pretend play, for doing so could promote their internal experience of playfulness.
Primary Author and Speaker: Hsiu-Man Chiu
Additional Authors and Speakers: Kuan-Lin Chen
Contributing Authors: Ya-Chen Lee, Cheng-Te Chen, Chien-Ho Lin, Yu-Ching Lin</jats:p
Linear Insertion Deletion Codes in the High-Noise and High-Rate Regimes
Full text linkThis work continues the study of linear error correcting codes against adversarial insertion deletion errors (insdel errors). Previously, the work of Cheng, Guruswami, Haeupler, and Li [Kuan Cheng et al., 2021] showed the existence of asymptotically good linear insdel codes that can correct arbitrarily close to 1 fraction of errors over some constant size alphabet, or achieve rate arbitrarily close to 1/2 even over the binary alphabet. As shown in [Kuan Cheng et al., 2021], these bounds are also the best possible. However, known explicit constructions in [Kuan Cheng et al., 2021], and subsequent improved constructions by Con, Shpilka, and Tamo [Con et al., 2022] all fall short of meeting these bounds. Over any constant size alphabet, they can only achieve rate < 1/8 or correct < 1/4 fraction of errors; over the binary alphabet, they can only achieve rate < 1/1216 or correct < 1/54 fraction of errors. Apparently, previous techniques face inherent barriers to achieve rate better than 1/4 or correct more than 1/2 fraction of errors.
In this work we give new constructions of such codes that meet these bounds, namely, asymptotically good linear insdel codes that can correct arbitrarily close to 1 fraction of errors over some constant size alphabet, and binary asymptotically good linear insdel codes that can achieve rate arbitrarily close to 1/2. All our constructions are efficiently encodable and decodable. Our constructions are based on a novel approach of code concatenation, which embeds the index information implicitly into codewords. This significantly differs from previous techniques and may be of independent interest. Finally, we also prove the existence of linear concatenated insdel codes with parameters that match random linear codes, and propose a conjecture about linear insdel codes
Supplemental Material, sj-docx-1-ptd-10.1177_08968608231205851 - Weekly intraperitoneal steroid infusion to treat recurrent ascites in a patient with early stage of peritoneal dialysis–related encapsulating peritoneal sclerosis: A case report
No full textSupplemental Material, sj-docx-1-ptd-10.1177_08968608231205851 for Weekly intraperitoneal steroid infusion to treat recurrent ascites in a patient with early stage of peritoneal dialysis–related encapsulating peritoneal sclerosis: A case report by Huai-Liang Chen, Cheng-Chieh Hung, Ya-Chung Tian and Kuan-Hsing Chen in Peritoneal Dialysis International</p
Block Edit Errors with Transpositions: Deterministic Document Exchange Protocols and Almost Optimal Binary Codes
Full text linkDocument exchange and error correcting codes are two fundamental problems regarding communications. In the first problem, Alice and Bob each holds a string, and the goal is for Alice to send a short sketch to Bob, so that Bob can recover Alice’s string. In the second problem, Alice sends a message with some redundant information to Bob through a channel that can add adversarial errors, and the goal is for Bob to correctly recover the message despite the errors. In both problems, an upper bound is placed on the number of errors between the two strings or that the channel can add, and a major goal is to minimize the size of the sketch or the redundant information. In this paper we focus on deterministic document exchange protocols and binary error correcting codes.
Both problems have been studied extensively. In the case of Hamming errors (i.e., bit substitutions) and bit erasures, we have explicit constructions with asymptotically optimal parameters. However, other error types are still rather poorly understood. In a recent work [Kuan Cheng et al., 2018], the authors constructed explicit deterministic document exchange protocols and binary error correcting codes for edit errors with almost optimal parameters. Unfortunately, the constructions in [Kuan Cheng et al., 2018] do not work for other common errors such as block transpositions.
In this paper, we generalize the constructions in [Kuan Cheng et al., 2018] to handle a much larger class of errors. These include bursts of insertions and deletions, as well as block transpositions. Specifically, we consider document exchange and error correcting codes where the total number of block insertions, block deletions, and block transpositions is at most k <= alpha n/log n for some constant 0<alpha<1. In addition, the total number of bits inserted and deleted by the first two kinds of operations is at most t <= beta n for some constant 0<beta<1, where n is the length of Alice’s string or message. We construct explicit, deterministic document exchange protocols with sketch size O((k log n +t) log^2 n/{k log n + t}) and explicit binary error correcting code with O(k log n log log log n+t) redundant bits. As a comparison, the information-theoretic optimum for both problems is Theta(k log n+t). As far as we know, previously there are no known explicit deterministic document exchange protocols in this case, and the best known binary code needs Omega(n) redundant bits even to correct just one block transposition [L. J. Schulman and D. Zuckerman, 1999]
sj-docx-1-cll-10.1177_09636897221133821 – Supplemental material for Synergic Effect of Combined Therapy of Hyperbaric Oxygen and Adipose-Derived Mesenchymal Stem Cells on Improving Locomotor Recovery After Acute Traumatic Spinal Cord Injury in Rat Mainly Through Downregulating Inflammatory and Cell-Stress Signalings
No full textSupplemental material, sj-docx-1-cll-10.1177_09636897221133821 for Synergic Effect of Combined Therapy of Hyperbaric Oxygen and Adipose-Derived Mesenchymal Stem Cells on Improving Locomotor Recovery After Acute Traumatic Spinal Cord Injury in Rat Mainly Through Downregulating Inflammatory and Cell-Stress Signalings by Tsung-Cheng Yin, Pei-Lin Shao, Kuan-Hung Chen, Kun-Chen Lin, John Y. Chiang, Pei-Hsun Sung, Shun-Cheng Wu, Yi-Chen Li, Hon-Kan Yip and Mel S. Lee in Cell Transplantation</p
sj-docx-1-dhj-10.1177_20552076231205744 - Supplemental material for Machine learning approaches for predicting sleep arousal response based on heart rate variability, oxygen saturation, and body profiles
No full textSupplemental material, sj-docx-1-dhj-10.1177_20552076231205744 for Machine learning approaches for predicting sleep arousal response based on heart rate variability, oxygen saturation, and body profiles by Chih-Fan Kuo, Cheng-Yu Tsai, Wun-Hao Cheng, Wen-Hua Hs, Arnab Majumdar, Marc Stettler, Kang-Yun Lee, Yi-Chun Kuan, Po-Hao Feng, Chien-Hua Tseng, Kuan-Yuan Chen and
Jiunn-Horng Kang, Hsin-Chien Lee, Cheng-Jung Wu, Wen-Te Liu in DIGITAL HEALTH</p
Phortica (Ashima) pavriarista Cheng & Chen 2008
No full text14) Phortica (Ashima) pavriarista Cheng & Chen, 2008 Phortica (Phortica) pavriarista Cheng & Chen in Cheng et al., 2008: 620. Phortica speculum (Maca & Lin, 1993): Chen et al., 2005b: 420 (part, misidentification). Phortica (Ashima) pavriarista: Chen & Máca, 2012: 507. Diagnosis. Arista only very slightly expanded apically (“Fig. 14” in Cheng et al. 2008); all postgonites strongly sclerotized, apically more or less pointed; posterior postgonite on only one lateral lobe of aedeagal sheath; lateral lobes submedially separated from each other; one lateral lobe of aedeagal sheath with 2 relatively close anterior postgonites (“Fig. 17” in Cheng et al. 2008). Supplementary description (not repeating characters common to P. foliiseta). Supracervical setae 12–14. Dorsomedial, tentorial apodeme 1/2 as long as basal, parallel portion of dorsolateral, tentorial apodeme. Longest, dorsal branch of arista shorter than longest seta on pedicel. Cibarial, medial sensilla 9–10 per side; posterior sensilla 4–6 per side. All tarsi with gray tarsomere V. The antisymmetry is observed in the postgonites: in A-type, the left lateral lobe bears 2 anterior postgonites, and the right lobe 1 posterior and 1 anterior postgonites (“Fig. 17” in Cheng et al. 2008); but in B-type, vice versa. Specimen examined. Thailand: 1♂ (B-type), above Sangwal, Doi Suthep, Chiang Mai, 1,250 m a.s.l., 6.i.2008, H. Bänziger leg. (SEHU). Distribution. China (Yunnan), Thailand *. Remarks. This species resembles P. andreagigoni in having the less expanded apex of arista, but can be distinguished from it by the diagnostic characters.Published as part of Toda, Masanori J., Bänziger, Hans, Sati, Pradeep C., Fartyal, Rajendra S., Suwito, Awit & Katoh, Toru, 2020, Taxonomy and evolution of asymmetric male genitalia in the subgenus Ashima Chen (Diptera: Drosophilidae: Phortica Schiner), with descriptions of seven new species, pp. 1-54 in Zootaxa 4789 (1) on page 20, DOI: 10.11646/zootaxa.4789.1.1, http://zenodo.org/record/388461
Randomness Extractors in AC⁰ and NC¹: Optimal up to Constant Factors
Full text linkWe study randomness extractors in AC⁰ and NC¹. For the AC⁰ setting, we give a logspace-uniform construction such that for every k ≥ n/poly log n, ε ≥ 2^{-poly log n}, it can extract from an arbitrary (n, k) source, with a small constant fraction entropy loss, and the seed length is O(log n/(ε)). The seed length and output length are optimal up to constant factors matching the parameters of the best polynomial time construction such as [Guruswami et al., 2009]. The range of k and ε almost meets the lower bound in [Goldreich et al., 2015] and [Cheng and Li, 2018]. We also generalize the main lower bound of [Goldreich et al., 2015] for extractors in AC⁰, showing that when k < n/poly log n, even strong dispersers do not exist in non-uniform AC⁰. For the NC¹ setting, we also give a logspace-uniform extractor construction with seed length O(log n/(ε)) and a small constant fraction entropy loss in the output. It works for every k ≥ O(log² n), ε ≥ 2^{-O(√k)}.
Our main techniques include a new error reduction process and a new output stretch process, based on low-depth circuit implementations for mergers, condensers, and somewhere extractors
- …
