Fartlek (speedplay) adalah suatu sistem latihan daya tahan tubuh yang dimaksudkan untuk membangun, mengembangkan dan memelihara kondisi tubuh seseorang. latihan yang tujuannya untuk meningkatkan daya tahan dan kecepatan dalam waktu yang lama. Penelitian ini adalah penelitian eksperimen dengan one group pretest-postest design yang bertujuan untuk mengetahui pengaruh latihan fartlek terhadap daya tahan cardiovascular siswa ekstrakurikuler futsal Madrasah Aliyah AIAI Sungaiselan. Penelitian dilakukan pada siswa ekstrakurikuler futsal yang berjumlah sebanyak 20 orang siswa yang akan diberikan perlakuan latihan fartlek. Pertemuan dilakukan sebanyak 16 kali pertemuan, sudah termasuk pretest dan postes. Hasil penelitian menunjukkan, bahwa nilai hasil uji normalitas dari pretest (tes awal) adalah -438,68, sedangkan hasil postest (tes akhir) adalah -694,97. Berdasarkan hasil pengujian hipotesis menggunakan uji-t berhubungan diperoleh nilai thitungย > ttabel pada taraf signifikan 0,05 yaitu 11,83 > 1,729, sehingga dapat diambil keputusan bahwa Ho ditolak dan Ha diterima. Hal ini membuktikan, ada pengaruh signifikan latihan fartlek terhadap daya tahan cardiovascular siswa ekstrakurikuler futsal Madrasah Aliyah AIAI Sungaiselan.
Works on quantum computing and cryptanalysis have increased significantly in the past few years. Various constructions of quantum arithmetic circuits as one of the primary elements in the field have also been proposed. However, there have only been a few studies on finite field inversion despite its essential use in realizing quantum algorithms, such as in Shor's algorithm for Elliptic Curve Discrete Logarithm Problem (ECDLP). In this study, we propose to reduce the depth of the existing quantum Fermat's Little Theorem (FLT)-based inversion circuit for the binary finite field. In particular, we propose to follow a complete waterfall approach to translate the Itoh-Tsujii's variant of FLT to the corresponding quantum circuit and remove the inverse squaring operations employed in the previous work by Banegas et al., lowering the number of CNOT gates (i.e., CNOT count) as well as slightly reducing the T depth, which contributes to a reduced overall depth and gate count. Furthermore, we concretely verify our method and compare it with the previous work in Qiskit, a quantum computer simulation environment, by constructing both our method and the previous work from scratch and performing the resource analysis. Additionally, we propose employing the relative-phase Toffoli gate by Gidney as opposed to the standard Toffoli implementation, which yields a significantly lower T depth while further reducing the overall depth. Our approach can serve as an alternative for a time-efficient implementation.
Low-frequency noise and hole lifetime in silicon-on-insulator (SOI) metal-oxide-semiconductor field-effect transistors (MOSFETs) are analyzed, considering their use in photon detection based on single-hole counting. The noise becomes minimum at around the transition point between front- and back-channel operations when the substrate voltage is varied, and increases largely on both negative and positive sides of the substrate voltage showing peculiar Lorentzian (generation-recombination) noise spectra. Hole lifetime is evaluated by the analysis of drain current histogram at different substrate voltages. It is found that the peaks in the histogram corresponding to the larger number of stored holes become higher as the substrate bias becomes larger. This can be attributed to the prolonged lifetime caused by the higher electric field inside the body of SOI MOSFET. It can be concluded that, once the inversion channel is induced for detection of the photo-generated holes, the small absolute substrate bias is favorable for short lifetime and low noise, leading to high-speed operation.
This paper examines the asymptotic performance of multiplication and the cost of quantum implementation for the Naive schoolbook, Karatsuba, and Toom-Cook methods in the classical and quantum cases and provides insights into multiplication roles in the post-quantum cryptography (PQC) era. Further, considering that the lattice-based PQC algorithm is based on polynomial multiplication algorithms, including the Toom-Cook 4-way multiplier as its fundamental building block, we propose a higher-degree multiplier, the Toom-Cook 8-way multiplier, which has the lowest asymptotic performance and implementation cost. Additionally, the designed multiplication will include additional sub-operations to complete the multiplication of large integers in order to prevent side-channel attacks. To design our Toom-Cook 8-way in detail, we employ detailed step computations such as splitting, evaluation, point-wise multiplication, interpolation, and recomposition, as well as several strategies to reduce space and time requirements. Existing asymptotic performance and quantum implementation cost multipliers are compared with our 2way, 4-way, and 8-way Toom-Cook multiplier designs. Our Toom-Cook 8-way quantum multiplier has the lowest asymptotic performance analysis or qubit count in terms of space efficiency, with ๐( 15 8 ) log 15(2 log 15โlog 8) log 8 ๐ or asymptotically ๎ป(๐ 1.245 ). The design has the lowest logical Toffoli counts bound at 112๐ log 8 15 โ 128๐ and Toffoli depth of ๐( 15 8 ) 1โ log 15 (2 log 15โlog 8) log 8 ๐ , asymptotically close to ๎ป(๐ 1.0569 ), which corresponds to a space-and time-efficient multiplication.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citationsโcitations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright ยฉ 2024 scite LLC. All rights reserved.
Made with ๐ for researchers
Part of the Research Solutions Family.