نتایج جستجو برای: expander

تعداد نتایج: 2208  

Journal: :Research, Society and Development 2021

Angle Class III malocclusion results in aesthetic and functional concerns, thus it is essential that this treated as early possible, so dentocraniofacial development occurs properly. A 7-year-old male patient with Asperger's syndrome had a subdivision right malocclusion, anterior posterior crossbite. To gain the patient's trust collaboration, we used behavioral management technique tell-show-do...

Journal: :Random Struct. Algorithms 2014
Itai Benjamini Gady Kozma Nicholas C. Wormald

We show that the total variation mixing time of the simple random walk on the giant component of supercritical G(n, p) and G(n,m) is Θ(log n). This statement was only recently proved, independently, by Fountoulakis and Reed. Our proof follows from a structure result for these graphs which is interesting in its own right. We show that these graphs are “decorated expanders” — an expander glued to...

Journal: :CoRR 2012
Michael Viderman

A code C ⊆ Fn 2 is a (c, ǫ, δ)-expander code if it has a Tanner graph, where every variable node has degree c, and every subset of variable nodes L0 such that |L0| ≤ δn has at least ǫc|L0| neighbors. Feldman et al. (IEEE IT, 2007) proved that LP decoding corrects 3ǫ−2 2ǫ−1 · (δn − 1) errors of (c, ǫ, δ)expander code, where ǫ > 2 3 + 1 3c . In this paper, we provide a simpler proof of their resu...

2014
Kong Ying

A scroll expander exhaust recovery system with the battery is proposed to improve exhaust recovery efficiency. Based on the exhaust flow, storage pressure and the battery current, expander supply pressure was optimized with the loss model based on the expansion and generator loss. And then the supply pressure controller was designed to track the optimized supply pressure reference using the inp...

2003
Christine Kelley Joachim Rosenthal Deepak Sridhara

The design of LDPC codes based on a class of expander graphs is investigated. Graph products, such as the zig-zag product [9], of smaller expander graphs have been shown to yield larger expanders. LDPC codes are designed based on the zigzag product graph of two component Cayley graphs. The results for specific cases simulated reveal that the resulting LDPC codes compare well with other random L...

2008
David Jao Stephen D. Miller Ramarathnam Venkatesan

We present a construction of expander graphs obtained from Cayley graphs of narrow ray class groups, whose eigenvalue bounds follow from the Generalized Riemann Hypothesis. Our result implies that the Cayley graph of (Z/qZ)∗ with respect to small prime generators is an expander. As another application, we show that the graph of small prime degree isogenies between ordinary elliptic curves achie...

Journal: :Journal of engineering for gas turbines and power 2022

Abstract In-cylinder expansion of internal combustion engines based on Diesel or Otto cycles cannot be completely brought down to ambient pressure, causing a 20% theoretical energy loss. Several systems have been implemented recover and use this such as turbocharging, turbomechanical turbo-electrical compounding, the implementation Miller cycles. In all these cases however, amount recovered is ...

Journal: :international journal of group theory 0
alfredo donno università di roma "la sapienza"

‎we investigate two constructions‎ - ‎the replacement and the zig-zag‎ ‎product of graphs‎ - ‎describing several fascinating connections‎ ‎with combinatorics‎, ‎via the notion of expander graph‎, ‎group‎ ‎theory‎, ‎via the notion of semidirect product and cayley graph‎, ‎and‎ ‎with markov chains‎, ‎via the lamplighter random walk‎. ‎many examples‎ ‎are provided‎.

Journal: :IEEE Transactions on Information Theory 2006

Journal: :Bulletin of the American Mathematical Society 2006

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید