| viXra.org > Data Structures and Algorithms > 2604 |
 |
 |
| viXra.org > Data Structures and Algorithms > 2604 |
|
|
[4] viXra:2604.0109 [pdf] submitted on 2026-04-28 23:30:20
Authors: Riccardo Fantoni
Comments: 12 Pages.
We propose a new quantum simulation method for a many body quantum liquid of identical particlesat finite (non-zero) temperature. The new scheme expands the high temperature density matrix on the over complete set of single particles coherent states of John Rider Klauder instead of the usual plane waves as in conventional path integral methods. One is free to tune the elastic constant and/or the mass of the harmonic oscillator subtending the coherent states so as to maximize the computational efficiency of the algorithm. We prove that in the limit of an extremely stiff harmonic oscillator the results for the internal energy tends towards the correct expected values. Moreover we suggest that a stiff harmonic oscillator could allow the use of larger (imaginary) timesteps. This additional degree of freedom is the characteristic feature of our new algorithm and is not available in more conventional path integral methods.
Category: Data Structures and Algorithms
[3] viXra:2604.0090 [pdf] submitted on 2026-04-24 01:00:35
Authors: Sambuddha Majumder, Jayanta Majumder
Comments: 11 Pages.
dstr is a compact language for describing finite dynamic systems in a form that is both easyto write and semantically explicit. Its primary interface is a small s—expression DSL in which one states variables, initial conditions, actions, invariants, and reachability goals without the verbosity that often discourages exploratory modeling. The resulting description is not intended merely to support a checker run. It is intended to generate an explicit state graph that can subsequently be queried, transformed, filtered, and published. The central claim of this paper is that a state—action language becomes substantially more valuable when its semantics are treated as a first—class graph artifact, suitable not only for validation but also for downstream graph analysis and presentation.
Category: Data Structures and Algorithms
[2] viXra:2604.0057 [pdf] submitted on 2026-04-15 20:07:22
Authors: Jay Kumar
Comments: 7 Pages. (Note by viXra Admin: Please submit article written with AI assistance to ai.viXra.org)
Modern data processing increasingly relies on workflows centered on filtering, transforming, aggregating, and routing structured data, yet mainstream programming paradigms do not always treat explicit data flow and composable transformation as primary computational concerns. This paper synthesizes three related lines of inquiry: the conceptual formulation of Flow-Oriented Programming (FLOP), the design and implementation of XF as an experimental realization of that model, and the empirical evaluation of XF across representative data-oriented workloads. Through this synthesis,the paper examines the historical development of programming languages and paradigms through the lens of composability, abstraction, and data transformation, and positions flow-oriented programmingas a data-first model centered on explicit transformation pipelines. XF is then considered as a practical implementation of this model, emphasizing composable operations, decentralized control flow, and explicit value-state semantics. Benchmark results across CSV aggregation, transformation pipelines, pattern processing, and concurrency scaling suggest that while XF does not yet match the raw performance of mature language ecosystems, it demonstrates that flow-oriented programming is both expressively coherent and practically implementable as a distinct approach to data-intensive computation.
Category: Data Structures and Algorithms
[1] viXra:2604.0005 [pdf] submitted on 2026-04-02 21:27:57
Authors: Sarthak Agrawal, Sanjeev Saxena
Comments: 22 Pages. (Note by viXra Admin: Please submit article written with AI assistance to ai.viXra.org)
We consider two variations of the classical secretary problem. * A variation of the returning secretary problem where each interviewee may appear a second time with a fixed probability p. The decision-maker observes interviewees sequentially and must choose whether to accept or reject each appearance. We characterize the optimal threshold rule and examine its dependence on the reappearance probability p, highlighting how additional information from repeated appearances improves selection performance.* A variation of the secretary problem in which success is defined as selecting any one of the top three interviewees rather than the single best. Interviewees are observed sequentially in random order, and decisions are irreversible. We estimated the success probability under this relaxed success criterion using the threshold strategy of the classical secretary problem. The results show that allowing selection among the top three significantly increases the success probability and shifts the optimal stopping threshold earlier than in the classical problem. This model provides insight into realistic decision-making scenarios where top interviewees are more or less similar.
Category: Data Structures and Algorithms
| Third-Party Links: |
|