The Experts below are selected from a list of 3348 Experts worldwide ranked by ideXlab platform
Ron Steinfeld - One of the best experts on this subject based on the ideXlab platform.
-
faster fully homomorphic encryption
International Conference on the Theory and Application of Cryptology and Information Security, 2010Co-Authors: Damien Stehle, Ron SteinfeldAbstract:We describe two improvements to Gentry’s fully homomorphic scheme based on ideal lattices and its analysis: we provide a more aggressive analysis of one of the hardness assumptions (the one related to the Sparse Subset Sum Problem) and we introduce a probabilistic decryption algorithm that can be implemented with an algebraic circuit of low multiplicative degree. Combined together, these improvements lead to a faster fully homomorphic scheme, with a O(λ 3.5) bit complexity per elementary binary add/mult gate, where λ is the security parameter. These improvements also apply to the fully homomorphic schemes of Smart and Vercauteren [PKC’2010] and van Dijk et al. [Eurocrypt’2010].
Simo Särkkä - One of the best experts on this subject based on the ideXlab platform.
-
fully symmetric kernel quadrature
SIAM Journal on Scientific Computing, 2018Co-Authors: Toni Karvonen, Simo SärkkäAbstract:Kernel quadratures and other kernel-based approximation methods typically suffer from prohibitive cubic time and quadratic space complexity in the number of function evaluations. The problem arises because a system of linear equations needs to be solved. In this article we show that the weights of a kernel quadrature rule can be computed efficiently and exactly for up to tens of millions of nodes if the kernel, integration domain, and measure are fully symmetric and the node set is a union of fully symmetric sets. This is based on the observations that in such a setting there are only as many distinct weights as there are fully symmetric sets and that these weights can be solved from a linear system of equations constructed out of row sums of certain submatrices of the full kernel matrix. We present several numerical examples that show feasibility, both for a large number of nodes and in high dimensions, of the developed fully symmetric kernel quadrature rules. Most prominent of the fully symmetric kernel...
-
fully symmetric kernel quadrature
arXiv: Numerical Analysis, 2017Co-Authors: Toni Karvonen, Simo SärkkäAbstract:Kernel quadratures and other kernel-based approximation methods typically suffer from prohibitive cubic time and quadratic space complexity in the number of function evaluations. The problem arises because a system of linear equations needs to be solved. In this article we show that the weights of a kernel quadrature rule can be computed efficiently and exactly for up to tens of millions of nodes if the kernel, integration domain, and measure are fully symmetric and the node set is a union of fully symmetric sets. This is based on the observations that in such a setting there are only as many distinct weights as there are fully symmetric sets and that these weights can be solved from a linear system of equations constructed out of row sums of certain submatrices of the full kernel matrix. We present several numerical examples that show feasibility, both for a large number of nodes and in high dimensions, of the developed fully symmetric kernel quadrature rules. Most prominent of the fully symmetric kernel quadrature rules we propose are those that use sparse grids.
Alexander H. Hsia - One of the best experts on this subject based on the ideXlab platform.
-
Reversible Computing with Fast, Fully Static, Fully Adiabatic CMOS
2020Co-Authors: Michael P. Frank, Robert W. Brocato, Brian D. Tierney, Nancy A. Missert, Alexander H. HsiaAbstract:To advance the energy efficiency of general digital computing far beyond the thermodynamic limits that apply to conventional digital circuits will require utilizing the principles of reversible computing. It has been known since the early 1990s that reversible computing based on adiabatic switching is possible in CMOS, although almost all the "adiabatic" CMOS logic families in the literature are not actually fully adiabatic, which limits their achievable energy savings. The first CMOS logic style achieving truly, fully adiabatic operation if leakage was negligible (CRL) was not fully static, which led to practical engineering difficulties in the presence of certain nonidealities. Later, "static" adiabatic logic families were described, but they were not actually fully adiabatic, or fully static, and were much slower.In this paper, we describe a new logic family, Static 2-Level Adiabatic Logic (S2LAL), which is, to our knowledge, the first CMOS logic family that is both fully static, and truly, fully adiabatic (modulo leakage). In addition, S2LAL is, we think, the fastest possible such family (among fully pipelined sequential circuits), having a latency per logic stage of one tick (transition time), and a minimum clock period (initiation interval) of 8 ticks. S2LAL requires 8 phases of a trapezoidal power-clock waveform (plus constant power and ground references) to be supplied. We argue that, if implemented in a suitable fabrication process designed to aggressively minimize leakage, S2LAL should be capable of demonstrating a greater level of energy efficiency than any other semiconductor-based digital logic family known today.
-
Reversible Computing with Fast, Fully Static, Fully Adiabatic CMOS
arXiv: Hardware Architecture, 2020Co-Authors: Michael P. Frank, Robert W. Brocato, Brian D. Tierney, Nancy A. Missert, Alexander H. HsiaAbstract:To advance the energy efficiency of general digital computing far beyond the thermodynamic limits that apply to conventional digital circuits will require utilizing the principles of reversible computing. It has been known since the early 1990s that reversible computing based on adiabatic switching is possible in CMOS, although almost all of the "adiabatic" CMOS logic families in the literature are not actually fully adiabatic, which limits their achievable energy savings. The first CMOS logic style that achieved truly, fully adiabatic operation if leakage was negligible (CRL) is not fully static, which leads to a number of practical engineering difficulties in the presence of certain nonidealities. Later, "static" adiabatic logic families were described, but they were not actually fully adiabatic, or fully static, and were much slower. In this paper, we describe a new logic family, Static 2-Level Adiabatic Logic (S2LAL), which is, to our knowledge, the first CMOS logic family that is both fully static, and truly, fully adiabatic (modulo leakage). In addition, S2LAL is, we think, the fastest possible such family (among fully pipelined sequential circuits), having a latency per logic stage of one "tick" (transition time), and a minimum clock period (initiation interval) of 8 ticks. S2LAL requires 8 phases of a trapezoidal power-clock waveform (plus constant power and ground references) to be supplied. We argue that, if implemented in a suitable fabrication process designed to aggressively minimize leakage, S2LAL should be capable of demonstrating a greater level of energy efficiency than any other semiconductor-based digital logic family known today.
Yonghoon Lyon Lee - One of the best experts on this subject based on the ideXlab platform.
-
glucocorticoid induced laminitis with hepatopathy in a thoroughbred Filly
Journal of Veterinary Science, 2004Co-Authors: Seung Ho Ryu, Byung Sun Kim, Chang Woo Lee, Junghee Yoon, Yonghoon Lyon LeeAbstract:A 3-year-old Thoroughbred Filly was referred to the Equine Hospital, Korea Racing Association for evaluation of hematuria, inappetite, weight loss and depression. From 25 days prior to admission, the horse was treated for right carpal lameness with 20 mg intramuscular administration of triamcinolone acetonide per day for consecutive 10 days by a local veterinarian. Clinical and laboratory findings included vaginal hyperemia, flare in bladder wall, neutrophilia, lymphopenia, polyuria, polydipsia and laminitis in the end. High activities of aspartate transaminase and gamma glutamyltransferase and high concentration of total bilirubin indicated hepatopathy. Further hematology, serum biochemistry and urinalysis did not reveal any abnormalities. Medical history, physical and clinicopathologic findings suggest that the laminitis and hepatopathy in this horse were most likely induced by repeated administration of exogenous corticosteroid. However, guarded prognosis of treating laminitis undermined the benefit of improvement of hematuria following electroacupuncture stimulation. The combined stimulation of kidney related acupoints (Shen Peng, Shen Shu), lumber related acupoints (Yao Qian, Yao Zhong) and associate acupoints (Guan Yuan Shu, Bai Hui) at 5Hz, 1-2V, for 40 minutes was of value in the treatment of hematuria. This case shows that horses under steroids may exhibit laminitis and steroid hepatopathy. Early recognition and good management of laminitis are important in the limitation of complications.
Damien Stehle - One of the best experts on this subject based on the ideXlab platform.
-
faster fully homomorphic encryption
International Conference on the Theory and Application of Cryptology and Information Security, 2010Co-Authors: Damien Stehle, Ron SteinfeldAbstract:We describe two improvements to Gentry’s fully homomorphic scheme based on ideal lattices and its analysis: we provide a more aggressive analysis of one of the hardness assumptions (the one related to the Sparse Subset Sum Problem) and we introduce a probabilistic decryption algorithm that can be implemented with an algebraic circuit of low multiplicative degree. Combined together, these improvements lead to a faster fully homomorphic scheme, with a O(λ 3.5) bit complexity per elementary binary add/mult gate, where λ is the security parameter. These improvements also apply to the fully homomorphic schemes of Smart and Vercauteren [PKC’2010] and van Dijk et al. [Eurocrypt’2010].