Results 51 to 60 of about 118,666 (308)

Centrifugal Compressor Polytropic Performance—Improved Rapid Calculation Results—Cubic Polynomial Methods

open access: yesInternational Journal of Turbomachinery, Propulsion and Power, 2021
This paper presents a new improved approach to calculation of polytropic performance of centrifugal compressors. This rapid solution technique is based upon a constant efficiency, temperature-entropy polytropic path represented by cubic polynomials.
Matt Taher, Fred Evans
doaj   +1 more source

Enhanced FRER Mechanism in Time-Sensitive Networking for Reliable Edge Computing

open access: yesSensors
Time-Sensitive Networking (TSN) and edge computing are promising networking technologies for the future of the Industrial Internet. TSN provides a reliable and deterministic low-latency communication service for edge computing.
Shaoliu Hu   +3 more
doaj   +1 more source

Computing as a service pattern based on edge computing

open access: yesDianzi Jishu Yingyong, 2019
Edge computing is a computational model for all terminal devices from cloud to edge path, which emerges in the era of interconnection of all things. The existing server pattern under cloud computing model cannot satisfy the application requirements of ...
Wang Tengfei   +5 more
doaj   +1 more source

Optimization and Prediction Techniques for Self-Healing and Self-Learning Applications in a Trustworthy Cloud Continuum

open access: yesInformation, 2021
The current IT market is more and more dominated by the “cloud continuum”. In the “traditional” cloud, computing resources are typically homogeneous in order to facilitate economies of scale.
Juncal Alonso   +6 more
doaj   +1 more source

On the Groupoid Model of Computational Paths

open access: yesCoRR, 2015
The main objective of this work is to study mathematical properties of computational paths. Originally proposed by de Queiroz \& Gabbay (1994) as `sequences or rewrites', computational paths are taken to be terms of the identity type of Martin Löf's Intensional Type Theory, since these paths can be seen as the grounds on which the propositional ...
Arthur F. Ramos   +2 more
openaire   +2 more sources

Algorithms for computing QoS paths with restoration [PDF]

open access: yesIEEE/ACM Transactions on Networking, 2003
There is a growing interest among service providers to offer new services with quality of service (QoS) guaranties that are also resilient to failures. Supporting QoS connections requires the existence of a routing mechanism, that computes the QoS paths, i.e., paths that satisfy QoS constraints (e.g., delay or bandwidth). Resilience to failures, on the
Yigal Bejerano   +4 more
openaire   +2 more sources

Why does malaria transmission continue at high levels despite universal vector control? Quantifying persistent malaria transmission by Anopheles funestus in Western Province, Zambia

open access: yesParasites & Vectors
Background Some settings continue to experience a high malaria burden despite scale-up of malaria vector control to high levels of coverage. Characterisation of persistent malaria transmission in the presence of standard control measures, also termed ...
Ruth A. Ashton   +23 more
doaj   +1 more source

Computational intelligence and soft computing: some thoughts on already explored and not yet explored paths [PDF]

open access: yesInternational Journal of Computational Intelligence Systems, 2010
We comment upon the very essence, roots, potentials, and applicability of computational intelligence and soft computing. We followed a different path than those traditionally employed, and which are so well and in a deep and comprehensive way documented ...
Janusz Kacprzyk
doaj   +1 more source

Modelling stem cell differentiation related processes—A practical overview for biologists

open access: yesFEBS Letters, EarlyView.
Stem cell differentiation is complex and difficult to control experimentally. This review introduces suitable computational modelling approaches that can support stem cell research, from mechanistic ODE and abstract models to multiscale and deep learning methods.
Ricco Zeegelaar   +4 more
wiley   +1 more source

Extending SQL for Computing Shortest Paths [PDF]

open access: yesProceedings of the Fifth International Workshop on Graph Data-management Experiences & Systems, 2017
Reachability and shortest paths are among two of the most common queries realized on graphs. While graph frameworks and property graph databases provide an extensive and convenient built-in support for these operations, it is still both clunky and inefficient to perform on standard SQL DBMSs.
D. De Leo (Dean), P.A. Boncz (Peter)
openaire   +2 more sources

Home - About - Disclaimer - Privacy