## Given a curve <i>c</i> represented by a closed walk of length at most ℓ on a combinatorial surface of complexity <i>n</i>, we describe simple algorithms to (1) compute the geometric intersection number of <i>c</i> in <i>O</i>(<i>n</i>+ ℓ<sup>2</sup>) time, (2) construct a curve homotopic to <i>c</i> that realizes this geometric intersection number in <i>O</i>(<i>n</i>+ℓ<sup>4</sup>) time, and (3) decide if the geometric intersection number of <i>c</i> is zero, i.

Computing the Geometric Intersection Number of Curves

## Two simple algorithms are proposed for implementing the proposed method, by first calculating the distribution of the real parts of all the characteristic roots, then the imaginary parts by using an iteration method.

Calculating Characteristic Roots of Multi-Delayed Systems with Accumulation Points via a Definite Integral Method

## Functionality of our framework was tested on a field programmable gate array (FPGA) using two simple algorithms and compared against software implementations of the same algorithms.

Tree-Based Hardware Recursion for Divide-and-Conquer Algorithms

## Implementing new RF applications has traditionally required significant time and expertise, even for relatively simple algorithms.

Rapid Implementation and Demonstration of Radio Applications Using WISCANet

## Although it is mathematically possible to accurately compute the 3D shapes of these stimuli using relatively simple algorithms, the results indicated that human observers are unable to do so.

Failures of stereoscopic shape constancy over changes of viewing distance and size for bilaterally symmetric polyhedra

## We show that CIS is NP-complete and present three simple algorithms for it: Deterministic, randomized with zero error and randomized with small one-sided error, with run time O(1.

Towards a more efficient approach for the satisfiability of two-variable logic

## Our main contribution are three simple algorithms which come with provable guarantees and provide interesting resilience-load tradeoffs, significantly outperforming any deterministic fast rerouting algorithm with high probability.

Local Fast Rerouting with Low Congestion: A Randomized Approach

## Moreover, we give different equivalent characterizations of such graphs and we propose simple algorithms to build these trees from the connections of stars.

Isolation Number versus Domination Number of Trees

## We propose simple algorithms for computing st-numberings and st-edge-numberings of graphs with running time O ( m ).

Simple computation of st-edge- and st-numberings from ear decompositions

## We demonstrate the potential of our results on three Principal Component Analysis (PCA) models resulting in extremely simple algorithms.

Dual Randomized Coordinate Descent Method for Solving a Class of Nonconvex Problems

## Compared to conventional MMC capacitor voltage balancing strategies, YMM features extremely simple algorithms and good reachability to high-level MMCs while maintaining the original half-bridge sub-module topology.

A Modular Multilevel Converter with Self Voltage Balancing

## Herein we present simple algorithms and their implementations to perform separation of the LTL with Since and Until, over discrete and complete linear orders, and translation from FOMLO formulas into equivalent temporal logic formulas.

Revisiting separation: Algorithms and complexity

## We then present simple algorithms to solve eventual consensus in static and dynamic systems.

Eventual Consensus: Applications to Storage and Blockchain : (Extended Abstract)

## Much of this chapter deals with the development of computationally simple algorithms that aim to reduce the computational aspects without comprising on the compression and decompression performance.

Computational Mechanisms for Exploiting Temporal Redundancies Supporting Multichannel EEG Compression

## Edge computing requires lightweight and computationally simple algorithms for sensor data analytics.

Compression Methods for Microclimate Data Based on Linear Approximation of Sensor Data

## Conclusion Simple algorithms accurately identified re-ICH in DSR and DNPR.

Validity of Simple Algorithms to Identify Recurrence of Intracerebral Hemorrhage in Two Danish Nationwide Registries

## Conclusions Simple algorithms can reproduce the results of GT3X+.

Comparison of Several Algorithms to Estimate Activity Counts with Smartphones as an Indication of Physical Activity Level

## However, previous research indicates that today’s complex neural recommendation methods are not always better than comparably simple algorithms in terms of prediction accuracy.

Empirical analysis of session-based recommendation algorithms

## However, previous research indicates that today's complex neural recommendation methods are not always better than comparably simple algorithms in terms of prediction accuracy.

Empirical Analysis of Session-Based Recommendation Algorithms

## The majority of existing methods and methodology involves linear diffusions, which then yield simple algorithms involving repeated matrix-vector operations.

Nonlinear Diffusion for Community Detection and Semi-Supervised Learning

## The first is an adaption of recent auxiliary gradient based-sampling schemes to the global-local shrinkage framework, which yields simple algorithms for sampling from generalized linear models.

Bayesian Generalized Horseshoe Estimation of Generalized Linear Models

## Second, several simple algorithms were established to estimate the loss of daylight availability due to the pollutant deposition at the external surface of vertical glazing.

A Dynamic Analysis Of The Impact Of Air Pollution On The daylight Availability In An Open-plan Office In London

## The residual between the two equalized images was then analyzed using several simple algorithms such as direct subtraction and global Reed-Xiaoli (GRX) detector.

Change detection using Landsat and Worldview images

## Following simple algorithms, the guidelines aim to assist adult and pediatric physicians in the better care of patients with AD.

Clinical practice guidelines for the diagnosis and management of atopic dermatitis.

## Moreover, while humans are able to exploit computer players following simple algorithms, they are also vulnerable to exploitation by more sophisticated ones.

Strategic interactions between humans and artificial intelligence: Lessons from experiments with computer players

## The majority of existing methods and methodology involves linear diffusions, which then yield simple algorithms involving repeated matrix-vector operations.

Nonlinear Diffusion for Community Detection and Semi-Supervised Learning

## Then, simple algorithms involving the probability distribution of the amplitude values of the detected signals, as well as the recorded signal structure, could allow noise and PD identification, thus enabling noise rejection, and recognition and identification of the type of sources generating discharges.

Noise rejection and partial discharge source identification in insulation system under DC voltage supply

10.4230/OASIcs.SOSA.2019.3

## We study a class of simple algorithms for concurrently computing the connected components of an $n$-vertex, $m$-edge graph.

Simple Concurrent Labeling Algorithms for Connected Components

## In future, the fast and accurate computational capabilities with simple algorithms are expecting to play important role for the solution of multi-objective optimization tasks in hybrid power generation.

Review on Multi-Objectives Optimization Methods in Hybrid Power Generation

10.1016/j.aej.2019.11.012

## In the present paper, we use efficient and simple algorithms of the fractional power series and Adomain polynomial methods that provide effective tools for solving such linear and nonlinear fractional differential equations in the sense of conformable derivative.

Series solutions for the Laguerre and Lane-Emden fractional differential equations in the sense of conformable fractional derivative

10.1007/978-3-030-03633-1_6

## Like Volume I of the Book of Nature being written in the language of mathematics, Volume II, addressing complexity, is composed of simple algorithms decoding reality.

Volume II: The Simplicity of Complexity

10.1007/s10570-019-02502-0

## The approach employed in this work is based on the use of attenuated total reflection Fourier transform infrared spectroscopy, and simple algorithms were developed from the spectra to estimate fiber maturity directly.

Investigation of fiber maturity measurement by cross-sectional image analysis and Fourier transform infrared spectroscopy on developing and developed upland cottons

10.1007/978-3-030-20131-9_312

## The minimization of the Joint-Forces is achieved by using simple algorithms as Bisection and Regula-Falsi Illinois.

Dynamic Synthesis of a Crank-Rocker Mechanism Minimizing its Joint-Forces

## The Parallel Research Kernels are a set of simple algorithms that correspond to popular classes of high-performance computing applications.

Evaluating data parallelism in C++ using the Parallel Research Kernels

10.1109/GLOBECOM38437.2019.9013797

## We focus on Certified Propagation Algorithm (CPA), one of the simple algorithms that does not rely on a cryptographic infrastructure and has a proven guarantee on resilience (number of node failures tolerated).

Reliable Broadcast in Networks with Trusted Nodes

10.1007/s11042-019-7547-y

## Most of the conventional studies on acoustic event detection adopt limited types of acoustic data and are based on simple algorithms, such as energy-based determination.

Sound learning–based event detection for acoustic surveillance sensors

10.1109/CPEE47179.2019.8949097

## Simple algorithms of modeling the arc furnace and the compensating device are presented.

Modeling FACTS Device Impact on Voltage Flicker in the Electric Arc Furnace Supply System

10.1109/SACI46893.2019.9111631

## In the present paper the originally suggested control algorithm is equipped with two different and simple algorithms that were developed for noise reduction in the time domain that can be simply applied in a combined way.

Investigation of Noise-sensitivity of a Fixed Point Iteration-based Adaptive Controller for a Pendulum-like Electric Cart

## This work addresses this lack of lower bounds and rigorously bounds the optimization time of simple algorithms using uniform crossover on the search space {0, 1}n from below via two novel techniques called decoupling and family graphs.

Lower bounds on the runtime of crossover-based algorithms via decoupling and family graphs

## This paper reviews the machine learning techniques used in the literature, following their evolution from simple algorithms such as logistic regression to more advanced methods like support vector machines and modern deep neural networks.

Machine learning techniques for protein function prediction

10.1109/PEE.2019.8923291

## The proposed method uses a phase shifted PWM to produce the injection and simple algorithms of field current response analyzes.

Rotor Position Estimation Using Field Current Response to Phase-shifted PWM for Synchronous Homopolar Motor

## Simple algorithms to calculate the matrices for LMI representation of the proposed convex pole regions are provided in a concise way.

LMI Pole Regions for a Robust Discrete-Time Pole Placement Controller Design

10.1016/j.oraloncology.2019.05.030

## The heterogeneous nature of head and neck cancers, as well as the diversity of patient characteristics, has precluded the clinicians from using simple algorithms in the early stage glottic cancers.

Conceptual interpretation of findings on systematic review and meta-analysis of altered-fractionation radiotherapy improves local control in the early-stage glottic carcinoma.

10.1007/978-3-030-36808-1_77

## CasPer also had similar training efficiency to simple algorithms such as SVM, yet had a higher predictive ability.

A Comparison of CasPer Against Other ML Techniques for Stress Recognition

10.1109/SYNCHROINFO.2019.8814156

## Moreover, to estimate the upper-bound performance with given features, we compared the simple algorithms with Random Forest, Gradient Boosting and a feed-forward neural network.

Lightweight Machine Learning Classifiers of IoT Traffic Flows

10.1007/s11042-019-08104-z

## It also is a sincere effort to accomplish the same using not very complicated techniques and to make use of a combination of simple algorithms like tent map and logistic map.

A multilevel distributed image based encryption for full integrity

10.1109/PEDG.2019.8807734

## Due to financial considerations, traditional SWTs implement either no MPPT or very simple algorithms such an Incremental Conductance (InCond) or Perturb and Observe (P&O).

MPPT for Small Wind Turbines: Zero-Oscillation Sensorless Strategy

## We conclude that physical, including neural, processes associated with everyday motor actions can be adequately represented with a set of simple algorithms leading to sloppy, but satisfactory, solutions.

Sloppy, But Acceptable, Control of Biological Movement: Algorithm-Based Stabilization of Subspaces in Abundant Spaces

10.23919/ECC.2019.8796157

## Early applications of the technique, made to simple systems of an academic nature, were implemented by simple algorithms requiring modest computational efforts.

Tracking Control by the Newton-Raphson Flow: Applications to Autonomous Vehicles

10.23919/EUSIPCO.2019.8903050

## The benefit of the unconstrained null space approach is that it leads to simple algorithms while the benefit of the rank-one constrained null space approach is that it leads to relaxed identifiability conditions.

Joint Low-Rank Factorizations with Shared and Unshared Components: Identifiability and Algorithms

10.1016/J.SIMPAT.2018.10.006

## Here, we focus on the Cloud virtual machine (VM) scheduling that is usually based on simple algorithms, e.

VMSAGE: A virtual machine scheduling algorithm based on the gravitational effect for green Cloud computing

## Many satellite-based GPP models have been developed due to the simple algorithms and the low requirements of model inputs.

Contrasting the Performance of Eight Satellite-Based GPP Models in Water-Limited and Temperature-Limited Grassland Ecosystems

## These results suggest that a classification-tree analysis lends itself to the construction of simple algorithms that have high clinical utility and may advance the feasibility and utility of evidence-based assessment strategies in real-world practice settings by balancing cost effectiveness, administration demands, and accuracy.

Evidence-based assessment in clinical settings: Reducing assessment burden for a structured measure of child and adolescent anxiety.

10.2989/10220119.2018.1505779

## Both complex and simple algorithms have been developed to determine ET.

Estimating evapotranspiration in semi-arid rangelands: connecting reference to actual evapotranspiration and the role of soil evaporation

10.1007/978-3-319-91361-2_17

## This chapter provides a framework to obtain a focus patient history, accomplish an appropriate oral examination, and develop a differential diagnosis and recommendations for the management of specific entities using simple algorithms.

Soft Tissue Oral Pathology

10.1109/TDEI.2019.008210

## Then, simple algorithms involving the probability distribution of the amplitude values of the detected signals, as well as the recorded signal structure, could allow noise and PD identification, thus enabling noise rejection, and recognition and identification of the type of sources generating discharges.

Noise rejection and partial discharge source identification in insulation system under DC voltage supply

## The primary goal of the experiment was to demonstrate that a longwave infrared library of solids and minerals collected as directional-hemispherical reflectance spectra in the laboratory could be used directly for HSI field identification along with simple algorithms for a rapid survey of the target materials.

Hyperspectral imaging of minerals in the longwave infrared: the use of laboratory directional-hemispherical reference measurements for field exploration data

## This paper proposes Fulib-Scenarios as means to explain data modelling, GUI Mockups, and simple algorithms to non-IT people.

Explaining Business Process Software with Fulib-Scenarios

## We introduce new and simple algorithms for the calculation of the number of perfect matchings of complex weighted, undirected graphs with and without loops.

A Faster Hafnian Formula for Complex Matrices and Its Benchmarking on a Supercomputer

## The key idea of this process is to include extra geometric information of the calligraphy to facilitate the registration process, using simple algorithms.

3D point set registration of Chinese calligraphy

10.1007/s13410-019-00783-6

## In order to provide physicians with a simple guidance on different aspects of insulin use including choosing the right insulin and regime to match the individual patient, the RSSDI for the first time has formulated this guideline on insulin therapy using simple algorithms for insulin initiation as well as titrations based on a systematic literature search of new clinical evidences on all aspects of insulin use.

RSSDI consensus recommendations on insulin therapy in the management of diabetes

## All thermodynamic properties of gases including entropy, enthalpy, Gibbs energy, and Helmholtz energy are directly estimated using simple algorithms based on simple molecular and physical properties, without resource to tables of standard values; both free energies are measures of quantum field states and of minimal statistical degeneracy, decreasing with temperature and declining density.

A Simple Method to Estimate Entropy and Free Energy of Atmospheric Gases from Their Action

10.1109/EICONRUS.2019.8657092

## Modern noise standards are based on simple algorithms of the "sound ray detour" method, which is implemented in ISO 9613-2, the most common standard used in Russia and Europe.

Engineering Geometrical Acoustic Method for Higher-Order Diffraction of Sound in Building

10.1007/978-3-030-17953-3_10

## Motivated by recent work on covering integer programs (CIPs) [4, 7] we show that simple algorithms based on randomized rounding followed by alteration, similar to those of Bansal et al.

$\ell_1$-sparsity Approximation Bounds for Packing Integer Programs

10.1109/CarpathianCC.2019.8765920

## From many variants of ILC available in the literature, few simple algorithms were presented: the well-known PD – type algorithms.

Iterative Learning Control for Active Suspension System of a Railway Vehicle

10.1109/ICSSE.2019.8823138

## Without carrier and only level comparation, it makes for simple algorithms, less memory, reduces the number of switching so the losses of switching process of components are also decreased.

Sliding Mode Control for Cascaded Multilevel Inverters

## Simple algorithms using EMR variables yielded good diagnostic performance for identification of T1D and CART further improved performance.

1672-P: Identifying Type 1 Diabetes in Electronic Medical Records Data in Ontario: A Validation Study

10.1109/ICSSE.2019.8823138

## Without carrier and only level comparation, it makes for simple algorithms, less memory, reduces the number of switching so the losses of switching process of components are also decreased.

Sliding Mode Control for Cascaded Multilevel Inverters