Results 21 to 30 of about 294,257 (261)

A Proof-of-Concept Study: Simple and Effective Detection of P and T Waves in Arrhythmic ECG Signals

open access: yesBioengineering, 2016
A robust and numerically-efficient method based on two moving average filters, followed by a dynamic event-related threshold, has been developed to detect P and T waves in electrocardiogram (ECG) signals as a proof-of-concept.
Mohamed Elgendi   +2 more
doaj   +1 more source

Efficient Strategies Algorithms for Resource Allocation Problems

open access: yesAlgorithms, 2020
Strategic modelling with a panoramic view plays an important role in decision-making problems. It offers the possibility of generating different solutions before making a decision. This is particularly relevant in critical situations.
Yacouba Adama Koné   +3 more
doaj   +1 more source

Fast algorithm for efficient simulation of quantum algorithm gates on classical computer [PDF]

open access: yesJournal of Systemics, Cybernetics and Informatics, 2004
The general approach for quantum algorithm simulation on classical computer is introduced.
Sergey Panfilov   +3 more
doaj  

Space-efficient Local Computation Algorithms [PDF]

open access: yesProceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012
Recently Rubinfeld et al. (ICS 2011, pp. 223--238) proposed a new model of sublinear algorithms called \emph{local computation algorithms}. In this model, a computation problem $F$ may have more than one legal solution and each of them consists of many bits.
Alon, Noga   +3 more
openaire   +3 more sources

An Efficient Algorithm for Basic Elementary Matrix Functions with Specified Accuracy and Application

open access: yesAppliedMath
If the matrix function f(At) posses the properties of f(At)=gf(tkA, then the recurrence formula fi−1=gfi,i=N,N−1,⋯,1,f(tA)=f0, can be established. Here, fN=f(AN)=∑j=0majANj,AN=tkNA. This provides an algorithm for computing the matrix function f(At).
Huizeng Qin, Youmin Lu
doaj   +1 more source

Exploring Preferences for a Digital Single‐Session Intervention for Adolescent Siblings of Youth With Cancer

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Introduction Adolescent siblings of children with cancer are at elevated risk for psychosocial problems. Unfortunately, various barriers such as limited family time and resources, conflicting schedules, and psychosocial staffing constraints at cancer centers hinder sibling access to support.
Christina M. Amaro   +10 more
wiley   +1 more source

A genetics algorithms for optimizing a function over the integer efficient set

open access: yesCroatian Operational Research Review
In this paper, we propose an algorithm called Directional Exploration Genetic Algorithm (DEGA) to resolve a function \(Phi\) over the efficient set of a multi-objective integer linear programming problem (MOILP).
Ali Zaidi   +4 more
doaj   +1 more source

Criterion‐Related Validity of the Neuropsychological Quick Assessment for Screening Cognitive, Motor, and Behavioral Impairments in Patients With Pediatric Brain Tumors: An Observational Pilot Study

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Neuropsychological complications may impair the qualitative prognosis of patients with pediatric brain tumors. However, multifaceted evaluations cannot be conducted in all patients because they are time consuming and burdensome for patients.
Ami Tabata   +9 more
wiley   +1 more source

Adjunctive Therapeutic Plasma Exchange in Refractory Adult‐Onset Still's Disease Complicated by Secondary Macrophage Activation Syndrome: A Single‐Center Experience

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Introduction Adult‐onset Still's disease (AOSD) complicated by macrophage activation syndrome (MAS) carries substantial mortality. The role of therapeutic plasma exchange (TPE) remains uncertain. Methods We retrospectively analyzed patients with AOSD‐MAS treated with TPE at a single‐center.
Masataka Ueda   +15 more
wiley   +1 more source

Efficient maximum matching algorithms for trapezoid graphs

open access: yesElectronic Journal of Graph Theory and Applications, 2017
Trapezoid graphs are intersection graphs of trapezoids between two horizontal lines. Many NP-hard problems can be solved in polynomial time if they are restricted on trapezoid graphs.
Phan-Thuan Do   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy