3,783 research outputs found
Quantum RAM Cosmology v1.1.0.2: Recursive Information Storage and Entropic Collapse Framework
No full textQuantum RAM Cosmology v1.1.0.2 is an updated and expanded preprint building on the initial Quantum RAM Cosmology v1.0 framework (Williams, 2025). This theory proposes a novel cosmological model where the universe operates as a distributed quantum memory system, encoding information across cosmic cycles via quantum entanglement, black holes, and Hawking radiation. Version 1.1.0.2 refines the mathematical and conceptual structure of the model, corrects and clarifies earlier diagrams, and integrates improved references, formatting, and citations. The updated schematic figures more accurately illustrate the cyclical phases of information storage, release, and cosmic reset that underpin the Quantum RAM loop hypothesis. The paper addresses the black hole information paradox, the nature of dark matter and dark energy, and the potential for recursive cosmological cycles triggered by information saturation at the quantum boundary. Falsifiability, experimental predictions, and testable criteria are discussed to encourage further research and peer review. Key features of v1.1.0.2: Enhanced clarity and editing throughout the text Corrected and improved schematic figures and references Full integration of hyperlinks and supporting documentation Updated author information and project metadata
Disclaimer: This work does not propose or rely on simulation theory. Any analogies to computational systems are strictly metaphorical, used for explanatory clarity, and do not imply the universe is a computer simulation. This is a physical, information-theoretic framework grounded in testable, falsifiable models of quantum information and cosmology
3SUM and Related Problems in Fine-Grained Complexity (Invited Talk)
No full text3SUM is a simple to state problem: given a set S of n numbers, determine whether S contains three a,b,c so that a+b+c = 0. The fastest algorithms for the problem run in n² poly(log log n)/(log n)² time both when the input numbers are integers [Ilya Baran et al., 2005] (in the word RAM model with O(log n) bit words) and when they are real numbers [Timothy M. Chan, 2020] (in the real RAM model).
A hypothesis that is now central in Fine-Grained Complexity (FGC) states that 3SUM requires n^{2-o(1)} time (on the real RAM for real inputs and on the word RAM with O(log n) bit numbers for integer inputs). This hypothesis was first used in Computational Geometry by Gajentaan and Overmars [A. Gajentaan and M. Overmars, 1995] who built a web of reductions showing that many geometric problems are hard, assuming that 3SUM is hard. The web of reductions within computational geometry has grown considerably since then (see some citations in [V. Vassilevska Williams, 2018]).
A seminal paper by Pǎtraşcu [Mihai Pǎtraşcu, 2010] showed that the integer version of the 3SUM hypothesis can be used to prove polynomial conditional lower bounds for several problems in data structures and graph algorithms as well, extending the implications of the hypothesis to outside computational geometry. Pǎtraşcu proved an important tight equivalence between (integer) 3SUM and a problem called 3SUM-Convolution (see also [Timothy M. Chan and Qizheng He, 2020]) that is easier to use in reductions: given an integer array a of length n, do there exist i,j ∈ [n] so that a[i]+a[j] = a[i+j]. From 3SUM-Convolution, many 3SUM-based hardness results have been proven: e.g. to listing graphs in triangles, dynamically maintaining shortest paths or bipartite matching, subset intersection and many more.
It is interesting to consider more runtime-equivalent formulations of 3SUM, with the goal of uncovering more relationships to different problems. The talk will outline some such equivalences. For instance, 3SUM (over the reals or the integers) is equivalent to All-Numbers-3SUM: given a set S of n numbers, determine for every a ∈ S whether there are b,c ∈ S with a+b+c = 0 (e.g. [V. Vassilevska Williams and R. Williams, 2018]).
The equivalences between 3SUM, 3SUM-Convolution and All-Numbers 3SUM are (n²,n²)-fine-grained equivalences that imply that if there is an O(n^{2-ε}) time algorithm for one of the problems for ε > 0, then there is also an O(n^{2-ε'}) time algorithm for the other problems for some ε' > 0. More generally, for functions a(n),b(n), there is an (a,b)-fine-grained reduction [V. Vassilevska Williams, 2018; V. Vassilevska Williams and R. Williams, 2010; V. Vassilevska Williams and R. Williams, 2018] from problem A to problem B if for every ε > 0 there is a δ > 0 and an O(a(n)^{1-δ}) time algorithm for A that does oracle calls to instances of B of sizes n₁,…,n_k (for some k) so that ∑_{j = 1}^k b(n_j)^{1-ε} ≤ a(n)^{1-δ}. With such a reduction, an O(b(n)^{1-ε}) time algorithm for B can be converted into an O(a(n)^{1-δ}) time algorithm for A by replacing the oracle calls by calls to the B algorithm. A and B are (a,b)-fine-grained equivalent if A (a,b)-reduces to B and B (b,a)-reduces to A.
One of the main open problems in FGC is to determine the relationship between 3SUM and the other central FGC problems, in particular All-Pairs Shortest Paths (APSP). A classical graph problem, APSP in n node graphs has been known to be solvable in O(n³) time since the 1950s. Its fastest known algorithm runs in n³/exp(√{log n}) time [Ryan Williams, 2014]. The APSP Hypothesis states that n^{3-o(1)} time is needed to solve APSP in graphs with integer edge weights in the word-RAM model with O(log n) bit words. It is unknown whether APSP and 3SUM are fine-grained reducible to each other, in either direction. The two problems are very similar. Problems such as (min,+)-convolution (believed to require n^{2-o(1)} time) have tight fine-grained reductions to both APSP and 3SUM, and both 3SUM and APSP have tight fine-grained reductions to problems such as Exact Triangle [V. Vassilevska Williams and R. Williams, 2018; V. Vassilevska and R. Williams, 2009; V. Vassilevska Williams and Ryan Williams, 2013] and (since very recently) Listing triangles in sparse graphs [Mihai Pǎtraşcu, 2010; Tsvi Kopelowitz et al., 2016; V. Vassilevska Williams and Yinzhan Xu, 2020]. The talk will discuss these relationships and some of their implications, e.g. to dynamic algorithms
GRAM - General RAM
No full textGRAM is a General RAM block device kernel module based on the ZRAM compression RAM Block Device kernel module. The source code of ZRAM was reworked to remove compression, meaning it has the performance of ZRAM however but does not compress data. GRAM was created for DisTRaC https://github.com/DiamondLightSource/DisTRaC.https://github.com/DiamondLightSource/GRAM/tree/v1.0.
Standardising medical records: improving patient care and informing the evidence base
Get PDFPoor organisation and partial or inaccurate completion of clinical notes can cause problems ranging from frustration to litigation. Despite this, no country has processes in place to regulate record-keeping across medical facilities. In our Guest Editorial, Iain Carpenter, Mala Bridgelal Ram, and John G. Williams contemplate how new initiatives in the UK to standardise recording of clinical details could not only improve patient health care but also perhaps fill the gaps in the evidence not answered by RCTs
Deformation and Aerodynamic Performance of a Ram-Air Wing
No full textRam-air wings form an ever increasing market of soft fabric, air inflated wings. They are primairily used in air sports such as parachuting, paragliding and kiting. Ram-air kites may also be used for electric power generation by letting the kite pull a cable from a drum that is connected to a generator. An example if this principle is the Laddermill concept. But since ram-air wings are flexible by nature they will deform and depart from their intended design shape when they are loaded by aerodynamic forces. These deformations generally affect the performance of the wings adversely. Kites with a higher lift-to-drag ratio on the Laddermill could mean a direct increase of the energy produced per square meter of kite. Besides this benefit for the Laddermill there is a huge, world-wide market of parachuting, paragliding and kiting that can benefit from more research and a better understanding of the deformation and aerodynamic performance of ram-air wings. The goals of this thesis are to be able to point out where a ram-air kite departs from the intended design shape, to investigate how well the kite performs, to understand how the deformations affect the airflow and to make suggestions for possible improvements of the design. Since little has been published about these subjects this report will most of all form a basis for further research. This report presents a method to analyse the shape and the aerodynamics of a ram-air kite. The kite is tested in the windtunnel. Its 3D shape is captured using two techniques: photogrammetry and laser scanning. Using the geometry data the structural deformation of the wing is dissected. With computational fluid dynamics the aerodynamics of the deformed shape is analyzed. An extra result of this study is the comparison of photogrammetry and laser scanning in terms of their suitability to capture the 3D shape of the ram-air kite. A number of interesting deformations and flow features were found on the ram-air wing: - Theoretically the bumps (ballooning) and grooves on a ram-air wing hinder the spanwise flow on a 3-dimensional wing, but in practise this effect is only visible on small parts of the upper surface. - The pull of the suspension lines on the under surface and the internal construction of the wing make the upper surface of the wing deform. This results in a decrease of the upper surface curvature, especially near the nose. This curvature decrease causes a loss of lift of at least 5%. - Because the flat, 2-dimensional fabric is inflated into a 3-dimensional shape the fabric wrinkles. The wrinkles continue from the top and bottom surface into the ribs that internally connect and support the top and bottom surface. On average these wrinkles shorten the ribs in chordwise direction by 3.5%. This decreases the surface area of the wing and it makes the ribs effectively thicker. Many more details became visible with the thorough analysis of the wing’s shape. The conclusion is that the performance of the ram-air wing can be improved by changing these details. The photogrammetry measuring technique gave better results than laser scanning and is very suitable tool to make these details visible. It allows a designer to identify where the real flying shape deviates from the design shape. This can help kite designers and designers of other ram-air wings to reverse-Aerospace Engineerin
Great Expectatrics: Great Papers, Great Journals, Great Econometrics
Get PDFThe paper discusses alternative Research Assessment Measures (RAM), with an emphasis on the Thomson Reuters ISI Web of Science database (hereafter ISI). The various ISI RAM that are calculated annually or updated daily are defined and analysed, including the classic 2-year impact factor (2YIF), 5-year impact factor (5YIF), Immediacy (or zero-year impact factor (0YIF)), Eigenfactor score, Article Influence, C3PO (Citation Performance Per Paper Online), h-index, Zinfluence, and PI-BETA (Papers Ignored - By Even The Authors). The ISI RAM data are analysed for 8 leading econometrics journals and 4 leading statistics journals. The application to econometrics can be used as a template for other areas in economics, for other scientific disciplines, and as a benchmark for newer journals in a range of disciplines. In addition to evaluating high quality research in leading econometrics journals, the paper also compares econometrics and statistics, alternative RAM, highlights the similarities and differences in alternative RAM criteria, finds that several ISI RAM capture similar performance characteristics for the leading econometrics and statistics journals while the new PI-BETA criterion is not highly correlated with any of the other ISI RAM, and hence conveys additional information regarding ISI RAM, highlights major research areas in leading journals in econometrics, and discusses some likely future uses of RAM.Research assessment measures, impact factors, Immediacy, Eigenfactor score, Article influence, h-index, C3PO, Zinfluence, PI-BETA
Scientometric portrait of Ram Gopal Rastogi
Get PDFPublication productivity of Indian scientist (R.G. Rastogi) has been documented.
Scientometric analysis of 312 papers by Ram Gopal Rastogi published during 1954 to 1992 in various domains: (a) Luni -solar activity and quiet -time E & F- region (57); (b) Equatorial electric field and low and mid latitude iof:osphere (78); (c) Ionospheric E- region irregularities (19); (dj Ionospheric F- region irregularities (32); and (e) Magnetic disturbance effects on the equatorial low and mid latitude ionosphere (23) were analysed. Interdomainery contents and of the number of papers: a+b were 36; b+c and b+d were 20 each; b+e were 16;. c+e were 5; a+e were 3; d+e were 2; and a+d had only one publication. Highest collaborations were with H. Chandra (61), M.R. Deshpande (42), and G. Sethia (19) out of his total 97 collaborators. His highest productivity was during 1978 with 28 papers followed by 19 papers during 1977. The core journals preferred by him for publishing papers were: Indian Journal of Radio & Space Physics, India, and Journal of Atomic & Terrestrial Physics, UK (59 each), followed by Proceedings of the Indian Academy of Sciences, India (34). Most prolific title keywords with their frequencies were: Ionosphere (92); Equatorial (61); F-region (53); Equatorial electrojet region (40), and Magnetic equator (30)
Great Expectatrics: Great Papers, Great Journals, Great Econometrics
Get PDFThe paper discusses alternative Research Assessment Measures (RAM), with an emphasis on the Thomson Reuters ISI Web of Science database (hereafter ISI). The various ISI RAM that are calculated annually or updated daily are defined and analysed, including the classic 2-year impact factor (2YIF), 5-year impact factor (5YIF), Immediacy (or zero-year impact factor (0YIF)), Eigenfactor score, Article Influence, C3PO (Citation Performance Per Paper Online), h-index, Zinfluence, and PI-BETA (Papers Ignored - By Even The Authors). The ISI RAM data are analysed for 8 leading econometrics journals and 4 leading statistics journals. The application to econometrics can be used as a template for other areas in economics, for other scientific disciplines, and as a benchmark for newer journals in a range of disciplines. In addition to evaluating high quality research in leading econometrics journals, the paper also compares econometrics and statistics, alternative RAM, highlights the similarities and differences in alternative RAM criteria, finds that several ISI RAM capture similar performance characteristics for the leading econometrics and statistics journals while the new PI-BETA criterion is not highly correlated with any of the other ISI RAM, and hence conveys additional information regarding ISI RAM, highlights major research areas in leading journals in econometrics, and discusses some likely future uses of RAM.Research assessment measures; impact factors; Immediacy; Eigenfactor score; Article influence; h-index; C3PO; Zinfluence; PI-BETA
Optimal Oblivious RAM with Integrity
No full textOblivious RAM (ORAM), introduced by Goldreich and Ostrovsky (J. ACM ’96), is a protocol that allows a client to perform RAM computations on a server without revealing any information about the underlying data, even via the access pattern. For a memory of size N, well-known lower bounds show that a multiplicative overhead of Ω(log N) in the number of RAM operations is necessary. A long sequence of works culminated in the asymptotically optimal construction of Asharov, Komargodski, Lin, and Shi (CRYPTO 2021) with O(log N) worst-case overhead and O(1) client storage.
However, this optimal ORAM construction is only known to be secure in the semi-honest setting, where an adversary is allowed to observe the access patterns but not modify the contents of the memory. If an adversary is allowed to tamper with the database, this construction, as well as many existing ORAM constructions, in fact become insecure.
In this work, we construct an ORAM protocol with worst-case O(log N) overhead and O(1) client storage that also protects against tampering adversaries. This matches the efficiency of the best known ORAM constructions while additionally providing security against tampering. We achieve this by adapting the construction of Asharov et al. in a non-black-box way by using a combination of online and offline memory checking techniques, as introduced by Blum et al. (Algorithmica, 1994).S.M
Steady-State Solver for a Ram-Air Kite Aeroelastic Model Based on Dynamic Relaxation
No full textWe present a computationally efficient steady-state solution method to model the aeroelastic deformation of a ram-air kite for airborne wind energy applications. The kite’s weight in comparison to the aerodynamic forces is small which justifies a quasi-steady analysis, neglecting gravitational and inertial force effects [1]. The approach is suitable to efficiently determine the deformed configuration of a ram-air kite for design and optimization purposes as found in [2]. Because of the expected large deformations and changes in the flow field, fluid-structure interaction has to be taken into account in the analysis.Wind Energ
- …
