2.0-//128.220.13.76//NONSGML kigkonsult.se iCalcreator 2.26.9//GREGORIANPUBLISHDepartment of Computer ScienceThe New Age of Discoveryhttps://www.cs.jhu.eduAmerica/New_YorkAmerica/New_YorkAmerica/New_York2019-11-03T02:00:002020-11-01T02:00:00EST-04:00-05:002019-03-10T02:00:002020-03-08T02:00:00EDT-05:00-04:00seminar-554@www.cs.jhu.edu2019-08-18T16:01:16ZComputer Science Student Defense: Kuan Cheng, Johns Hopkins University – “Pseudorandom Constructions: Computing in Parallel and Applications to Edit Distance”<h4>Location</h4>
<p>Malone 228</p>
<h4>Abstract</h4>
<p>The thesis focus on two problems about pseudorandom constructions.</p>
<p>The first problem is how to compute pseudorandom constructions by constant depth circuits. Pseudorandom constructions are deterministic functions which are used to substitute random constructions in various computational tasks. Constant depth circuits here refer to the computation model which can compute functions using circuits of AND , OR and negation gates, with constant depth, unbounded fan-in, taking function inputs by input wires and giving function outputs by output wires. They can be simulated by fast parallel algorithms. We study such constructions mainly for randomness extractors, secret sharing schemes and their applications. Randomness extractors are functions which transform biased random bits to uniform ones. They can be used to recycle random bits in computations if there are some entropies remaining. Secret sharing schemes efficiently share secrets among multi-parties s.t. the collusion of a bounded number of parties cannot recover any information of the secret while a certain larger number of parties can recover the secret. Our work constructs these objects with near optimal parameters and explores their applications.</p>
<p>The second problem is about applying pseudorandom constructions to build error correcting codes (ECCs) for edit distance. ECCs project messages to codewords in a metric space s.t. one can recover the codewords even if there are bounded number of errors which can drive the codeword away by some bounded distance. They are widely used in both the theoretical and practical part of computer science. Classic errors are hamming errors which are substitutions and erasures of symbols. They are well studied by numerous literatures before. We consider one kind of more general errors i.e. edit errors, consists of insertions and deletions that may change the positions of symbols. Our work give explicit constructions of binary ECCs for edit errors with redundancy length near optimal. The constructions utilize document exchange protocols which can let two party synchronize their strings with bounded edit distance, by letting one party send a short sketch of its string to the other. We apply various pseudorandom constructions to get deterministic document exchange protocols from randomized ones. Then we construct ECCs using them. We also extend these constructions to handle block insertions/deletions and transpositions. All these constructions have near optimal parameters.</p>
<h4>Bio</h4>
<p>I am a PhD candidate at Johns Hopkins University, Computer Science Department, advised by Xin Li.</p>
<p>My current research is about Randomness and Combinatorics in Computation, and their applications to Complexity Theory, Information Theory, etc.<br />
Machine Learning, Networks and other topics in Computer Science are also interesting to me.</p>
<p>Before Hopkins, I received a MSE degree from Tsinghua University and a B.E. degree from Shandong University.</p>
<p>I like playing soccer, basketball, music and travelling in my spare time.</p>
<h4>Host</h4>
<p>Prof. Xin Li</p>America/New_York2019-05-21T10:00:00America/New_York2019-05-21T12:00:00en-USSeminar0https://www.cs.jhu.edu/events/computer-science-student-defense-kuan-cheng-johns-hopkins-university-pseudorandom-constructions-computing-in-parallel-and-applications-to-edit-error-correction/