12,465 research outputs found
Data for: Design of a Compact Proton Beam Energy Modulator for Imaging
No full textRaw data for Design of Compact Proton Beam Energy Modulator for Imaging by Aggarwal et al
Just Take the Average! An Embarrassingly Simple 2^n-Time Algorithm for SVP (and CVP)
No full textWe show a 2^{n+o(n)}-time (and space) algorithm for the Shortest Vector Problem on lattices (SVP) that works by repeatedly running an embarrassingly simple "pair and average" sieving-like procedure on a list of lattice vectors. This matches the running time (and space) of the current fastest known algorithm, due to Aggarwal, Dadush, Regev, and Stephens-Davidowitz (ADRS, in STOC, 2015), with a far simpler algorithm. Our algorithm is in fact a modification of the ADRS algorithm, with a certain careful rejection sampling step removed.
The correctness of our algorithm follows from a more general "meta-theorem," showing that such rejection sampling steps are unnecessary for a certain class of algorithms and use cases. In particular, this also applies to the related 2^{n + o(n)}-time algorithm for the Closest Vector Problem (CVP), due to Aggarwal, Dadush, and Stephens-Davidowitz (ADS, in FOCS, 2015), yielding a similar embarrassingly simple algorithm for gamma-approximate CVP for any gamma = 1+2^{-o(n/log n)}. (We can also remove the rejection sampling procedure from the 2^{n+o(n)}-time ADS algorithm for exact CVP, but the resulting algorithm is still quite complicated.
How do variations in Urban Heat Islands in space and time influence household water use? The case of Phoenix, Arizona
No full textabstract: This paper explores how urbanization, through its role in the evolution of Urban Heat Island (UHI), affects residential water consumption. Using longitudinal data and drawing on a mesoscale atmospheric model, we examine how variations in surface temperature at the census tract level have affected water use in single family residences in Phoenix, Arizona. Results show that each Fahrenheit rise in nighttime temperature increases water consumption by 1.4%. This temperature effect is found to vary significantly with lot size and pool size. The study provides insights into the links between urban form and water use, through the dynamics of UHI.Corresponding Author:
Rimjhim M. Aggarwal
Arizona State University
[email protected]
Heterogeneity in nomenclature and abbreviation usage for anti-synthetase syndrome: a scoping review
No full textAnti-synthetase syndrome constitutes a dynamically evolving subset of Idiopathic Inflammatory Myopathy, however, the nomenclature and abbreviations for this syndrome are plagued by heterogeneity, leading to lack of consistency in literature. The objective of this study is to evaluate existing diversity in disease names and abbreviations, with a future goal to develop consensus on the nomenclature. A scoping review format was used for analysis. A comprehensive PUBMED search was conducted from January 1, 1984 (the initial description of anti-synthetase autoantibodies) to November 30, 2023, encompassing all pertinent articles published within this timeframe. Search terms included, ((antisynthetase syndrome) OR (anti synthetase syndrome)) OR (anti-synthetase syndrome)). The articles were screened for presence of terminology and abbreviations used. The search yielded 936 items with the specified terms. After excluding 303 irrelevant articles and 58 non-English publications, the remaining n = 575 articles underwent detailed review of the abstract and full article. Out of n = 575, 54.7% (n = 314) used ‘antisynthetase syndrome’ and 43.4% (n = 249) preferred ‘anti-synthetase syndrome’ with few novel names also. Among these, 394 articles used abbreviations while 181 did not. Most utilized term was ASS; in 64.7% (n = 255), followed AS in 11.9% (n = 47), ASSD in 9.9% (n = 39) and ASyS in 7.6% (n = 30). A discordance in nomenclature is evident, with about half using antisynthetase syndrome and other half using anti-synthetase syndrome. Moreover, significant heterogeneity exists in abbreviation use aswell. There is a pressing need to bridge this disparity and establish a uniform identifier for the disease with an objective to develop greater coherence in future research, educational initiatives, and interdisciplinary collaboration
Dynamic pupillary abnormalities associated with orbital varices
No full textEkta Aggarwal, Simon N Madge, John Crompton and Dinesh Selv
Efficient signature system using optimized elliptic curve cryptosystem over GF(2(n)).
No full textElliptic curve cryptography was proposed independently by Neil Koblitz and Victor Miller in the middle of 80's. The security of Elliptic Curve Cryptography depends upon the elliptic curve discrete logarithm problem. For providing the same strength, it uses a smaller key size than that for RSA. This advantage makes it particularly suitable for some devices and applications, which have a resource constraint. Digital Signature Systems are one of the most important applications of cryptography. In Y2K IEEE has included two Elliptic Cryptography based methods in its new standard P1363. The elliptic curve cryptosystem uses "point" operations like point doubling and addition. As a consequence, optimization of, point operations plays a key role in determining the efficiency of computation. Today's technology easily permits the fabrication of multiple simple "processors" on a single chip. For such devices, a serial-parallel computation has been proposed by Adnan and Mohammad [AM03][AM03a] for a faster computation of elliptic algorithms. This thesis presents a new optimized point operations algorithm for elliptic curve cryptosystems over GF(2 n). We have designed and implemented the new algorithm for a more efficient digital signature system. Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis2004 .W37. Source: Masters Abstracts International, Volume: 43-01, page: 0247. Adviser: Akshai Aggarwal. Thesis (M.Sc.)--University of Windsor (Canada), 2004
Optimal-Degree Polynomial Approximations for Exponentials and Gaussian Kernel Density Estimation
No full textFor any real numbers B ≥ 1 and δ ∈ (0,1) and function f: [0,B] → ℝ, let d_{B; δ}(f) ∈ ℤ_{> 0} denote the minimum degree of a polynomial p(x) satisfying sup_{x ∈ [0,B]} |p(x) - f(x)| < δ. In this paper, we provide precise asymptotics for d_{B; δ}(e^{-x}) and d_{B; δ}(e^x) in terms of both B and δ, improving both the previously known upper bounds and lower bounds. In particular, we show d_{B; δ}(e^{-x}) = Θ(max{√{B log(δ^{-1})}, log(δ^{-1})/{log(B^{-1} log(δ^{-1}))}}), and d_{B; δ}(e^{x}) = Θ(max{B, log(δ^{-1})/{log(B^{-1} log(δ^{-1}))}}), and we explicitly determine the leading coefficients in most parameter regimes.
Polynomial approximations for e^{-x} and e^x have applications to the design of algorithms for many problems, including in scientific computing, graph algorithms, machine learning, and statistics. Our degree bounds show both the power and limitations of these algorithms.
We focus in particular on the Batch Gaussian Kernel Density Estimation problem for n sample points in Θ(log n) dimensions with error δ = n^{-Θ(1)}. We show that the running time one can achieve depends on the square of the diameter of the point set, B, with a transition at B = Θ(log n) mirroring the corresponding transition in d_{B; δ}(e^{-x}):
- When B = o(log n), we give the first algorithm running in time n^{1 + o(1)}.
- When B = κ log n for a small constant κ > 0, we give an algorithm running in time n^{1 + O(log log κ^{-1} /log κ^{-1})}. The log log κ^{-1} /log κ^{-1} term in the exponent comes from analyzing the behavior of the leading constant in our computation of d_{B; δ}(e^{-x}).
- When B = ω(log n), we show that time n^{2 - o(1)} is necessary assuming SETH
A New Secure Data Dissemination Model in Internet of Drones
No full textData Dissemination is the distribution of data/statistics to the end users. With the adoption of Internet of Drones (IoD) environment for data dissemination, an efficient scheme is proposed which provides data integrity, identity anonymity, authentication, authorization, accountability (AAA) to the system model. We propose a system model having Ethereum based public blockchain distributed network in order to secure drone communication for the data collection and transmission. The proposed model provides secure communication between the drones and the users in a decentralized way. In this paper, blockchain technology is used for the storage of collected data from the drones and update the information into the distributed ledgers to reduce the burden of drones. It also provides integrity, authentication, and authorization to the collected data by the drones in the system model. Motivated by this consideration, the goal of this paper is threefold. First, we select a forger node from the number of drones. Second, we create blocks and validate their processes. Third, we provide secure data dissemination by applying Proof-of-Stake consensus mechanism. Afterward, we evaluate the security of the presented system model compared against the corresponding ones of some state-of-the-art in terms of communication time/cost. The results confirm that our system model is reliable and scalable for data dissemination in the IoD environment
Data for: Design of a Compact Proton Beam Energy Modulator for Imaging
No full textRaw data for Design of Compact Proton Beam Energy Modulator for Imaging by Aggarwal et al.THIS DATASET IS ARCHIVED AT DANS/EASY, BUT NOT ACCESSIBLE HERE. TO VIEW A LIST OF FILES AND ACCESS THE FILES IN THIS DATASET CLICK ON THE DOI-LINK ABOV
- …
