The Design of Algorithms for Hypersurfaces Mowing with Curvature-Dependent Speed

1989 ◽  
pp. 544-551 ◽  
Author(s):  
James Sethian ◽  
Stanley J. Osher
Keyword(s):  
Design Of Algorithms

Review of selected papers on design of algorithms by Donald E. Knuth

2014 ◽  
Vol 45 (2) ◽  
pp. 14-16
Author(s):  
Daniel Apon
Keyword(s):  
Design Of Algorithms

scholarly journals Empowering the configuration-IP: new PTAS results for scheduling with setup times

2021 ◽  
Author(s):  
Klaus Jansen ◽  
Kim-Manuel Klein ◽  
Marten Maack ◽  
Malin Rau
Keyword(s):  
Approximation Scheme ◽  
Constant Factor ◽  
Setup Times ◽  
Linear Programs ◽  
Scheduling Problems ◽  
Design Of Algorithms ◽  
Packing Problems ◽  
Integer Linear Programs ◽  
One Machine ◽  
Target Locations

AbstractInteger linear programs of configurations, or configuration IPs, are a classical tool in the design of algorithms for scheduling and packing problems where a set of items has to be placed in multiple target locations. Herein, a configuration describes a possible placement on one of the target locations, and the IP is used to choose suitable configurations covering the items. We give an augmented IP formulation, which we call the module configuration IP. It can be described within the framework of n-fold integer programming and, therefore, be solved efficiently. As an application, we consider scheduling problems with setup times in which a set of jobs has to be scheduled on a set of identical machines with the objective of minimizing the makespan. For instance, we investigate the case that jobs can be split and scheduled on multiple machines. However, before a part of a job can be processed, an uninterrupted setup depending on the job has to be paid. For both of the variants that jobs can be executed in parallel or not, we obtain an efficient polynomial time approximation scheme (EPTAS) of running time $$f(1/\varepsilon )\cdot \mathrm {poly}(|I|)$$ f ( 1 / ε ) · poly ( | I | ) . Previously, only constant factor approximations of 5/3 and $$4/3 + \varepsilon $$ 4 / 3 + ε , respectively, were known. Furthermore, we present an EPTAS for a problem where classes of (non-splittable) jobs are given, and a setup has to be paid for each class of jobs being executed on one machine.

A point-process model of human heartbeat intervals: new definitions of heart rate and heart rate variability

2005 ◽  
Vol 288 (1) ◽  
pp. H424-H435 ◽  
Author(s):  
Riccardo Barbieri ◽  
Eric C. Matten ◽  
AbdulRasheed A. Alabi ◽  
Emery N. Brown
Keyword(s):  
Heart Rate ◽  
Heart Rate Variability ◽  
Point Process ◽  
Process Model ◽  
Goodness Of Fit ◽  
Gaussian Model ◽  
Quantitative Measure ◽  
Local Maximum ◽  
Inverse Gaussian ◽  
Design Of Algorithms

Heart rate is a vital sign, whereas heart rate variability is an important quantitative measure of cardiovascular regulation by the autonomic nervous system. Although the design of algorithms to compute heart rate and assess heart rate variability is an active area of research, none of the approaches considers the natural point-process structure of human heartbeats, and none gives instantaneous estimates of heart rate variability. We model the stochastic structure of heartbeat intervals as a history-dependent inverse Gaussian process and derive from it an explicit probability density that gives new definitions of heart rate and heart rate variability: instantaneous R-R interval and heart rate standard deviations. We estimate the time-varying parameters of the inverse Gaussian model by local maximum likelihood and assess model goodness-of-fit by Kolmogorov-Smirnov tests based on the time-rescaling theorem. We illustrate our new definitions in an analysis of human heartbeat intervals from 10 healthy subjects undergoing a tilt-table experiment. Although several studies have identified deterministic, nonlinear dynamical features in human heartbeat intervals, our analysis shows that a highly accurate description of these series at rest and in extreme physiological conditions may be given by an elementary, physiologically based, stochastic model.

scholarly journals Greedy algorithms in Datalog

2001 ◽  
Vol 1 (4) ◽  
pp. 381-407 ◽  
Author(s):  
SERGIO GRECO ◽  
CARLO ZANIOLO
Keyword(s):  
Optimization Problems ◽  
Greedy Algorithms ◽  
Design Of Algorithms ◽  
Effective Implementation ◽  
Implementation Techniques ◽  
Research Challenge ◽  
Storage Structures ◽  
Selection Of ◽  
Stable Models

In the design of algorithms, the greedy paradigm provides a powerful tool for solving efficiently classical computational problems, within the framework of procedural languages. However, expressing these algorithms within the declarative framework of logic-based languages has proven a difficult research challenge. In this paper, we extend the framework of Datalog-like languages to obtain simple declarative formulations for such problems, and propose effective implementation techniques to ensure computational complexities comparable to those of procedural formulations. These advances are achieved through the use of the choice construct, extended with preference annotations to effect the selection of alternative stable-models and nondeterministic fixpoints. We show that, with suitable storage structures, the differential fixpoint computation of our programs matches the complexity of procedural algorithms in classical search and optimization problems.

Feature Matching-based Approaches to Improve the Robustness of Android Visual GUI Testing

2022 ◽  
Vol 31 (2) ◽  
pp. 1-32
Author(s):  
Luca Ardito ◽  
Andrea Bottino ◽  
Riccardo Coppola ◽  
Fabrizio Lamberti ◽  
Francesco Manigrasso ◽  
...  
Keyword(s):  
Computer Vision ◽  
Feature Matching ◽  
State Of The Art ◽  
Design Of Algorithms ◽  
Computational Burden ◽  
Domain Specific ◽  
Gui Testing ◽  
Wide Range ◽  
Full Screen ◽  
Feature Based

In automated Visual GUI Testing (VGT) for Android devices, the available tools often suffer from low robustness to mobile fragmentation, leading to incorrect results when running the same tests on different devices. To soften these issues, we evaluate two feature matching-based approaches for widget detection in VGT scripts, which use, respectively, the complete full-screen snapshot of the application ( Fullscreen ) and the cropped images of its widgets ( Cropped ) as visual locators to match on emulated devices. Our analysis includes validating the portability of different feature-based visual locators over various apps and devices and evaluating their robustness in terms of cross-device portability and correctly executed interactions. We assessed our results through a comparison with two state-of-the-art tools, EyeAutomate and Sikuli. Despite a limited increase in the computational burden, our Fullscreen approach outperformed state-of-the-art tools in terms of correctly identified locators across a wide range of devices and led to a 30% increase in passing tests. Our work shows that VGT tools’ dependability can be improved by bridging the testing and computer vision communities. This connection enables the design of algorithms targeted to domain-specific needs and thus inherently more usable and robust.

Cancellable Biometrics for On-line Signature Recognition

2011 ◽  
pp. 290-315 ◽  
Author(s):  
Emanuele Maiorana ◽  
Patrizio Campisi ◽  
Alessandro Neri
Keyword(s):  
Recognition System ◽  
Design Of Algorithms ◽  
Biometric Data ◽  
The Public ◽  
Protection Scheme ◽  
Protection Method ◽  
Signature Database ◽  
On Line ◽  
Signature Recognition ◽  
Recognition Systems

With the widespread diffusion of biometrics-based recognition systems, there is an increasing awareness of the risks associated with the use of biometric data. Significant efforts are therefore being dedicated to the design of algorithms and architectures able to secure the biometric characteristics, and to guarantee the necessary privacy to their owners. In this work we discuss a protected on-line signature-based biometric recognition system, where the considered biometrics are secured by applying a set of non-invertible transformations, thus generating modified templates from which retrieving the original information is computationally as hard as random guessing it. The advantages of using a protection method based on non-invertible transforms are exploited by presenting three different strategies for the matching of the transformed templates, and by proposing a multi-biometrics approach based on score-level fusion to improve the performances of the considered system. The reported experimental results, evaluated on the public MCYT signature database, show that the achievable recognition rates are only slightly affected by the proposed protection scheme, which is able to guarantee the desired security and renewability for the considered biometrics.

Sign in / Sign up

Export Citation Format

Share Document