Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “Path (computing)”

Autonomic computing: The path towards controlling cloud computing services

Dan Ionescu · 2011

In this paper various design principles and autonomic computing algorithms for on the-cloud services are discussed. The emphasis will be set on issues such as real-time architectures for autonomic computing with reference to virtualization and on-the-cloud computing, the self-organizing algorithms for the local autonomic computing cell present in every on-the-cloud service, and adaptive strategies for the global on-the-cloud service. The talk will be illustrated by practical examples as implemented on geographically dispersed on-the-cloud severs.

Cited by 2

Magnetic Gate Opens New Computing Path

Adrian Cho · Science · 2002

SPINTRONICSA tiny device that answers no when it's told yes and vice versa could mark the first step toward microchips that calculate magnetically, a team of physicists reports. The NOT gate, described on page [2003][1], uses a trick of geometry to manipulate magnetism as conventional devices do electric charge. [1]: http://www.sciencemag.org/cgi/content/short/296/5575/2003

Cited by 3

Path Privacy in Location-aware Computing

Marco Gruteser, Jonathan Bredin, Dirk Grunwald · 2004

Context-aware applications often require sharing private data with a service provider. Most contextual information, such as location, changes over time. Privacy mechanisms that can safeguard information when shared with less trusted organizations, however, remain more suitable for static or point-in-time information. We make the case for developing privacy mechanisms that adequately address time-series, such as locational path information, and discuss our work in-progress in path segmentation and minutiae suppression.

Cited by 0

Computing Path Signature Varieties in Macaulay2

Carlos Améndola, Angelo El Saliby, Felix Lotter et al. · ArXiv.org · 2025

The signature of a path is a non-commutative power series whose coefficients are given by certain iterated integrals over the path coordinates. This series almost uniquely characterizes the path up to translation and reparameterization. Taking only fixed degree parts of these series yields signature tensors. We introduce the Macaulay2 package $\texttt{PathSignatures}$ to simplify the study of these interesting objects for piecewise polynomial paths. It allows for the creation and manipulation of parametrized families of paths and provides methods for computing their signature tensors and their associated algebraic varieties.

Cited by 0Open access

SEset: Computing Statistically-Equivalent Path Models

Oisín Ryan · 2022

Tools to compute and analyze the set of statistically-equivalent (Gaussian, linear) path models which generate the input precision or (partial) correlation matrix. This procedure is useful for understanding how statistical network models such as the Gaussian Graphical Model (GGM) perform as causal discovery tools. The statistical-equivalence set of a given GGM expresses the uncertainty we have about the sign, size and direction of directed relationships based on the weights matrix of the GGM alone. The derivation of the equivalence set and its use for understanding GGMs as causal discovery tools is described by Ryan, O., Bringmann, L.F., &amp; Schuurman, N.K. (2022) &lt;<a href="https://doi.org/10.31234%2Fosf.io%2Fryg69" target="_top">doi:10.31234/osf.io/ryg69</a>&gt;.

Cited by 0Open access

Automatically computing path complexity of programs

Lucas Bang, Abdulbaki Aydin, Tevfik Bultan · 2015

Recent automated software testing techniques concentrate on achieving path coverage. We present a complexity measure that provides an upper bound for the number of paths in a program, and hence, can be used for assessing the difficulty of achieving path coverage for a given method. We define the path complexity of a program as a function that takes a depth bound as input and returns the number of paths in the control flow graph that are within that bound. We show how to automatically compute the path complexity function in closed form, and the asymptotic path complexity which identifies the dominant term in the path complexity function. Our results demonstrate that path complexity can be computed efficiently, and it is a better complexity measure for path coverage compared to cyclomatic complexity and NPATH complexity.

Cited by 19

Quantum Resonance Computing (QRC): *The* Path Forward for Quantum Computing

Quni-Gudzinas, Rowan Brad · Zenodo (CERN European Organization for Nuclear Research) · 2025

The field of quantum computing, despite immense promise, confronts significant inherent challenges that impede its path to practical, large-scale applications. Current gate-based quantum computing approaches struggle with the extreme fragility of qubits, leading to rapid decoherence and high error rates that necessitate extensive error correction. Furthermore, fundamental limitations exist in scaling the number of physical qubits due to complex entanglement management, physical connectivity requirements, and the need for extreme hardware isolation (e.g., cryogenics). These systems often struggle with the broad algorithmic scope required for real-world, non-linear problems. Quantum Resonance Computing (QRC) emerges as a distinct computational paradigm, fundamentally designed to overcome these limitations by moving beyond the discrete particle model. QRC encodes information within h-qubits (Harmonic Qubits), which are stable, resonant electromagnetic field patterns maintained within a precisely engineered Wave-Sustaining Medium (WSM). This inherent field-based nature grants QRC intrinsic resilience to environmental perturbations, significantly reducing decoherence and minimizing the need for extensive error correction through the natural dampening of non-harmonic states. The design of QRC inherently facilitates native entanglement and parallelism, as information is processed as components of a multi-modal field rather than isolated particles. This directly addresses conventional scalability and interconnect bottlenecks. Its resonant, field-based architecture enables a direct approach to solving intractable non-linear problems that are often beyond the scope of traditional gate-based quantum algorithms. Consequently, QRC presents a unique path to establishing a robust, scalable, and inherently resilient quantum computing platform.

Cited by 0Open access

Desktop virtualization: Path to pervasive computing in cloud computing era

Hai Jin · 2011

Virtualization is being widely used now as an emerging trend. Among the applications, using virtualization technology on the desktops (e.g. the PC workstations and laptops) is an important branch. Desktop virtualization has the potential to offer a new, cost efficient paradigm shift to ease the demand for resources while maximizing the return on investment. Combining the potential cost savings with other advantages such as disaster recovery, robustness, scalability and security makes this an attractive computing model to deploy. With the development of cloud computing, virtualized desktop will be the “virtualized” cloud end device to integrate many personalized applications. So, virtualized desktop will be another way to step forward to pervasive computing in cloud computing era.

Cited by 3

New Path for high-efficiency Advanced Computing: Generative Structure Computing

Fan Zhang, Yanzhao Gao, Jiangxing Wu et al. · Scientia Sinica Informationis · 2026

随着摩尔定律与迪纳德缩放定律逐渐逼近其物理极限，依赖集成电路制程工艺进步提升计算系统性能与效能面临愈发严峻的挑战。在此背景下，先进计算的研究和发展已成为业界公认的重要方向。本文首先深度剖析了智能计算时代计算系统所遭遇的发展困局，并据此概括了先进计算的发展愿景。针对当前困局，本文提出了相应的的破局之策。随后，从软件定义节点和生成式互连结构等关键视角，深入阐述了生成式结构计算的内涵。最后，在综合分析生成式结构计算理想载体应具备的特征的基础上，本文介绍了软件定义晶上系统，并给出生成式结构计算的典型案例，旨在为未来计算体系架构的发展提供一条切实可行的技术途径。

Cited by 0

Quantum Computing - the Path towards lndustrial Applications

Tutschku, Christian Klaus, Stephan, Chiara · Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft) · 2022

Quantum computing (QC) has attracted great interest in recent years. The long-term potential of quantum computing in industrial applications is well-known, but contemporary quantum solutions need to incorporate all the characteristic hardware restrictions that define the computers of today’s noisy intermediate scale quantum (NISQ) era. The main goal of the applied research project SEQUOIA is to develop near-term, hybrid quantum solutions for industrial use cases in close collaboration with companies of its enterprise network. As such, the SEQUOIA project directly elaborates on the path from the quantum computing theory towards near-term industrial applications.

Cited by 0