Simple Algorithm Research Articles

An approach for coherent periodogram averaging of tilt-series data for improved CTF estimation.

Cryo-electron microscopy (cryo-EM) has become an indispensable technique for determining three-dimensional structures of biological macromolecules. A critical aspect of achieving high-resolution cryo-EM reconstructions is accurately determining and correcting for the microscope's contrast transfer function (CTF). The CTF introduces defocus-dependent distortions during imaging; if not properly accounted for, the CTF can distort features in and limit the resolution of 3D reconstructions. For tilt-series data used in cryo-electron tomography (cryo-ET), CTF estimation becomes even more challenging due to the tilt of the specimen, which introduces a defocus gradient across the field of view, as well as the low dose and signal in individual tilt images. Here, we describe a simple algorithm to improve the accuracy of CTF estimation of tilted images by leveraging the tilt-series alignment parameters determined for tomographic reconstruction to explicitly account for the tilted specimen geometry. In brief, each tilt image is divided into patches, each of which are then stretched according to their defocus shift. These are then summed to provide a coherent power spectra at the tilt axis, which can then be used in standard CTF estimation algorithms. This uses all the data in each image to enhance the visibility of Thon rings, thereby improving high-resolution CTF estimation and subsequent enhancements in the resolution of subtomogram averages.

Multimodal imaging-based treatment recommendations for managing submacular hemorrhage.

Submacular haemorrhage (SMH) is an emergency, and the most important immediate action in the treatment of SMH is the early displacement or evacuation of subretinal heme from below the fovea, followed by simultaneous or sequential treatment of the underlying cause. Photoreceptor damage can occur immediately after the onset of SMH for a variety of reasons, including toxins released from the blood, the diffusion barrier created by the blood for oxygen delivery and nutrition to the outer retinal layers, and shearing forces on the outer retinal layers, resulting in permanent visual deterioration. A clinician's decision to treat SMH is influenced by a number of factors, including presenting visual acuity, duration of visual symptoms, SMH aetiology and characteristics, availability of intraocular gases and tissue plasminogen activator, and pars plana vitrectomy facilities. For many clinicians, the duration of visual symptoms is the most important and first consideration when planning SMH treatment. Very little emphasis is given to the SMH's imaging characteristics. Currently, there are several treatment options for SMH removal. There is a need to develop a simplified treatment algorithm for SMH that is less reliant on the patient's visual complaints, considers heme characteristics on basic retinal imaging, and has the potential to achieve uniform and predictable treatment outcomes in real-world situations. In this short article, we discuss the various factors that can assist clinicians in the management of SMH and present a simplified treatment algorithm based on the SMH's retinal imaging characteristics.

Recommendations for early identification of heart failure in patients with diabetes: Consensus statement of the Swiss Society of Endocrinology and Diabetology and the Heart Failure Working Group of the Swiss Society of Cardiology.

Diabetes is a well-recognised risk factor for the development of heart failure, with a prevalence higher than 30% in patients with diabetes aged over 60 years. Heart failure often emerges as the primary cardiovascular manifestation in patients with type 2 diabetes and appears to be even more prevalent in type 1 diabetes. In Switzerland, there are approximately 500,000 individuals with diabetes, and the number of affected people has been steadily rising in recent years. Therefore, the consequences of heart failure will affect an increasing number of patients, further straining the Swiss healthcare system. Early lifestyle modification and initiation of appropriate treatment can prevent or at least significantly delay the onset of symptomatic heart failure by several years. These facts underscore the urgent need for early detection of individuals with subclinical heart failure, which often remains undiagnosed until the first episode of acute heart failure requiring hospital admission occurs. To address this issue, the European Society of Cardiology, the American Diabetes Association (ADA) and other international professional societies have published recommendations on heart failure screening, diagnosis and management. To address this issue in Switzerland, experts from the Swiss Society of Endocrinology and Diabetology, the Swiss Society of Cardiology and the General Internal Medicine specialty met and prepared a consensus report including a simple diagnostic algorithm for use in everyday practice.

Smooth Gowdy-symmetric generalised Taub–NUT solutions with polynomial initial data

Abstract We consider smooth Gowdy-symmetric generalised Taub–NUT solutions, a class of inhomogeneous cosmological models with spatial three-sphere topology. They are characterised by existence of a smooth past Cauchy horizon and, with the exception of certain singular cases, they also develop a regular future Cauchy horizon. Several examples of exact solutions were previously constructed, where the initial data (in form of the initial Ernst potentials) are polynomials of low degree. Here, we generalise to polynomial initial data of arbitrary degree. Utilising methods from soliton theory, we obtain a simple algorithm that allows us to construct the resulting Ernst potential with purely algebraic calculations. We also derive an explicit formula in terms of determinants, and we illustrate the method with two examples.

SkipNet: an adaptive neural network equalization algorithm for future passive optical networking

In this paper, we propose an original adaptive neural network equalizer (NNE) algorithm named SkipNet, which is suitable for rapid training on a packet-by-packet basis for burst-mode non-linear equalization in upstream PON transmission. SkipNet uses the simple LMS algorithm and avoids complex neural network training algorithms such as backpropagation and mini-batch training. We demonstrate SkipNet on captured continuous mode 100 Gbit/s PAM4 signals using an SOA preamplifier to achieve the challenging 29 dB PON optical loss budget. The adaptive SkipNet equalizer is shown to overcome combinations of severe SOA patterning effects and fiber dispersion impairments to achieve >29dB dynamic range back-to-back and >22.9dB dynamic range for up to 81.6 ps/nm accumulated dispersion. It can adapt in as little as 250 training symbols to each impairment scenario, which is equivalent to existing FFE/DFE solutions, while matching the non-linear performance of previously proposed static NNE solutions. To the best of our knowledge, SkipNet is the first ever adaptive NNE framework that can realistically be trained and adapted on a packet-by-packet basis and within strict PON packet preamble lengths.

A landslide runout model for sediment transport, landscape evolution, and hazard assessment applications

Abstract. We developed a new rule-based, cellular-automaton algorithm for predicting the hazard extent, sediment transport, and topographic change associated with the runout of a landslide. This algorithm, which we call MassWastingRunout (MWR), is coded in Python and implemented as a component for the package Landlab. MWR combines the functionality of simple runout algorithms used in landscape evolution and watershed sediment yield models with the predictive detail typical of runout models used for landslide inundation hazard mapping. An initial digital elevation model (DEM), a regolith depth map, and the location polygon of the landslide source area are the only inputs required to run MWR to model the entire runout process. Runout relies on the principle of mass conservation and a set of topographic rules and empirical formulas that govern erosion and deposition. For the purpose of facilitating rapid calibration to a site, MWR includes a calibration utility that uses an adaptive Bayesian Markov chain Monte Carlo algorithm to automatically calibrate the model to match observed runout extent, deposition, and erosion. Additionally, the calibration utility produces empirical probability density functions of each calibration parameter that can be used to inform probabilistic implementation of MWR. Here we use a series of synthetic terrains to demonstrate basic model response to topographic convergence and slope, test calibrated model performance relative to several observed landslides, and briefly demonstrate how MWR can be used to develop a probabilistic runout hazard map. A calibrated runout model may allow for region-specific and more insightful predictions of landslide impact on landscape morphology and watershed-scale sediment dynamics and should be further investigated in future modeling studies.

An Algorithm for Simplifying 3D Building Models with Consideration for Detailed Features and Topological Structure

To tackle problems such as the destruction of topological structures and the loss of detailed features in the simplification of 3D building models, we propose a 3D building model simplification algorithm that considers detailed features and topological structures. Based on the edge collapse algorithm, the method defines the region formed by the first-order neighboring triangles of the endpoints of the edge to be collapsed as the simplification unit. It incorporates the centroid displacement of the simplification unit, significance level, and approximate curvature of the edge as influencing factors for the collapse cost to control the edge collapse sequence and preserve model details. Additionally, considering the unique properties of 3D building models, boundary edge detection and face overlay are added as constraints to maintain the model’s topological structure. The experimental results show that the algorithm is superior to the classic QEM algorithm in terms of preserving the topological structure and detailed features of the model. Compared to the QEM algorithm and the other two comparison algorithms selected in this paper, the simplified model resulting from this algorithm exhibit a reduction in Hausdorff distance, mean error, and mean square error to varying degrees. Moreover, the advantages of this algorithm become more pronounced as the simplification rate increases. The research findings can be applied to the simplification of 3D building models.

Detection of anti-personnel mines of the “leg breakers” type by analyzing thermographic images captured from a drone at different heights

A method for the detection of plastic anti-personnel mines called “ leg breakers ” is presented from images of the ground acquired remotely by a drone at heights between 1 and 5 m. The proposal achieved an accuracy of 92.13 % and a sensitivity of 82.4 % when evaluating the performance on 260 test images, a number higher than that used in previous works, and with mines buried in real terrain with the presence of vegetation. The above on images acquired on different dates with different environmental conditions and soil moisture. In addition, it was found that the method was adapted to three different thermographic cameras, being necessary only to adjust the gamma parameter associated with the thermal contrast enhancement technique used. It was corroborated that mines are easier to detect to the extent that they are buried more superficially, and when the flight height of the drone is between 1 and 2 m. Finally, it is highlighted that the proposal has the potential to be executed in processing systems onboard the drone, thanks to its algorithmic simplicity.

A reservoir computing approach in active noise control for vehicle applications

Reservoir Computing (RC) is an alternative approach to Recurrent Neural Networks (RNN) that can avoid some shortcomings of conventional gradient decent-training that are mainly related to high computational complexity and the reduced ability to "learn" long-range dependencies. In RC the input data are transformed into patterns in a high-dimensional space by an RNN called the "reservoir", which remains unchanged during training. The desired output signal is generated as a linear combination of the neuron's signals from the input-excited reservoir. The linear part of the RC architecture, which is called the "readout" can be trained with a simple learning algorithm such as linear regression. In this work an RC architecture is proposed for the attenuation of acoustic disturbances encountered in vehicle cabins such as aircrafts and yachts. At first, a dataset of acoustic pressure measurements from real-world cabins was used to generate the readout and reservoir layers. Subsequent computer simulations demonstrated that the proposed architecture can successfully attenuate such acoustic disturbances. Finally, the performance of RC in Active Noise Cancellation task was compared with both the linear FxLMS algorithm and a conventional RNN, showing that it has several advantages regarding acoustic pressure reduction combined with relatively low computational complexity.

A Fast Grasp Planning Algorithm for Humanoid Robot Hands.

Grasp planning is crucial for robots to perform precision grasping tasks, where determining the grasp points significantly impacts the performance of the robotic hand. Currently, the majority of grasp planning methods based on analytic approaches solve the problem by transforming it into a nonlinear constrained planning problem. This method often requires performing convex hull computations, which tend to have high computational complexity. This paper proposes a new algorithm for calculating multi-finger force-closure grasps of three-dimensional objects based on humanoid multi-fingered hands. Firstly, sufficient conditions for the multi-finger force-closure grasps of three-dimensional objects are derived from a point contact model with friction. These three-dimensional force-closure conditions are then transformed into two-dimensional plane conditions, leading to a simple algorithm for multi-finger force-closure determination. This method is purely based on geometric analysis, resulting in low computational demands and enabling the rapid assessment of force-closure grasps, which are beneficial for real-time applications. Finally, the algorithm is validated through two case studies, demonstrating its feasibility and effectiveness.

Multi-label semantic segmentation of magnetic resonance images of the prostate gland

Prostate segmentation is a substantial factor in the diagnostic pathway of suspicious prostate lesions. Medical doctors are assisted by computer-aided detection and diagnosis systems systems and methods derived from artificial intelligence deep learning-based systems have to be trained on existing data. Especially freely available labeled prostate magnetic resonance imaging data is rare. With regard to this problem, we show a method to combine two existing small datasets to form a bigger one. We present a data processing pipeline consisting of a cascaded network architecture that is able to perform multi-label semantic segmentation, hence, capable of classifying each pixel in a T2\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\ extrm{T}_{2}$$\\end{document}-weighted image not only to one class but to a subset of the prostate zones and classes of interest. This delivers richer information such as overlapping zones that are key to medical radiological examination. Additionally, we describe how to integrate expert knowledge in our deep learning system. To increase data variety for training and evaluation we use image augmentation on our two datasets—a freely available dataset and our new open-source dataset. To combine the datasets we denoise the contourings in our dataset by using an effective yet simple algorithm based on standard computer vision methods only. The performance of the presented methodology is compared and evaluated using the dice score metric and 5-fold cross-validation on all datasets. Although we trained on tiny datasets our method achieves excellent segmentation quality and is even able to detect prostate cancer. Our method to combine the two datasets reduces segmentation errors and increases data variety. The proposed architecture significantly improves performance by including expert knowledge via feature-map concatenation. On the initiative for collaborative computer vision benchmarking dataset we achieve on average dice scores of approximately 91% for the whole prostate gland, 67% for the peripheral zone and 75% for the prostate central gland. We find that image augmentation except contrast limited adaptive histogram equalisation did not have much influence on the segmentation quality. Derived and enhanced from existing methods we present an approach that is able to deliver multi-label semantic segmentation results for prostate magnetic resonance imaging. This approach is simple and could be applied to other applications of deep learning as well. It improves the segmentation results by a large margin. Once tweaked to the data, our denoising and combination algorithm delivers robust and accurate results even on data with segmentation errors.

Optimized distributed formation control using identifier–critic–actor reinforcement learning for a class of stochastic nonlinear multi-agent systems

This article is to propose an adaptive reinforcement learning (RL)-based optimized distributed formation control for the unknown stochastic nonlinear single-integrator dynamic multi-agent system (MAS). For solving the issue of unknown dynamic, an adaptive identifier neural network (NN) is developed to determine the stochastic MAS under expectation sense. And then, for deriving the optimized formation control, the RL is putted into effect via constructing a pair of critic and actor NNs. With regard of the traditional RL optimal controls, their algorithm exists the inherent complexity, because their adaptive RL algorithm are derived from negative gradient of the square of Hamilton–Jacobi–Bellman (HJB) equation. As a result, these methods are difficultly extended to stochastic dynamical systems. However, since this adaptive RL laws are derived from a simple positive function rather than the square of HJB equation, it can make optimal control with simple algorithm. Therefore, this optimized formation scheme can be smoothly performed to the stochastic MAS. Finally, according to theorem proof and computer simulation, the optimized method can realize the required control objective.

Role of two isothermal cylinders towards three-dimensional flow and melting of phase-change materials

Recently, investigators focused on examining the melting of phase change materials (PCM) in regular two-dimensional or three-dimensional flow domains. At the same time, this topic still needs more study to get a better understanding of it. Also, such problems should be reported using the local thermal non-equilibrium (LTNE) model because the latent heat substances and the included porous elements have different temperatures. Therefore, this study examines the three-dimensional flow and melting process of phase change materials (PCM) within cubic enclosures filled with copper foam, using a local thermal non-equilibrium model (LTNE). The system includes two isothermal cylinders with different temperature conditions, varying distances, and radii, placed within the flow domain. The enthalpy-porosity approach is applied to model the PCM behavior, while the Brinkman-extended non-Darcy model accounts for high-velocity flow situations. A magnetic field is introduced to control the flow, with the Lorentz force acting opposite to gravity. The governing equations are solved using a home-developed code based on the finite volume method with the SIMPLE algorithm. Key parameters investigated include cylinder radii, Fourier number, Hartmann number, horizontal and vertical distances between cylinders, and Darcy number. The results are presented through streamlines, temperature distributions for fluid and solid phases, and profiles of the Nusselt number and average liquid fraction.

Generating implicit object fragment datasets for machine learning

One of the primary challenges inherent in utilizing deep learning models is the scarcity and accessibility hurdles associated with acquiring datasets of sufficient size to facilitate effective training of these networks. This is particularly significant in object detection, shape completion, and fracture assembly. Instead of scanning a large number of real-world fragments, it is possible to generate massive datasets with synthetic pieces. However, realistic fragmentation is computationally intensive in the preparation (e.g., pre-factured models) and generation. Otherwise, simpler algorithms such as Voronoi diagrams provide faster processing speeds at the expense of compromising realism. In this context, it is required to balance computational efficiency and realism. This paper introduces a GPU-based framework for the massive generation of voxelized fragments derived from high-resolution 3D models, specifically prepared for their utilization as training sets for machine learning models. This rapid pipeline enables controlling how many pieces are produced, their dispersion and the appearance of subtle effects such as erosion. We have tested our pipeline with an archaeological dataset, producing more than 1M fragmented pieces from 1,052 Iberian vessels (). Although this work primarily intends to provide pieces as implicit data represented by voxels, triangle meshes and point clouds can also be inferred from the initial implicit representation. To underscore the unparalleled benefits of CPU and GPU acceleration in generating vast datasets, we compared against a realistic fragment generator that highlights the potential of our approach, both in terms of applicability and processing time. We also demonstrate the synergies between our pipeline and realistic simulators, which frequently cannot select the number and size of resulting pieces. To this end, a deep learning model was trained over realistic fragments and our dataset, showcasing similar results.

Public Health Nurse Perspectives on Predicting Preterm Labor Using Risk Factors and Simple Machine Learning Algorithms

Public Health Nurse Perspectives on Predicting Preterm Labor Using Risk Factors and Simple Machine Learning Algorithms

Optimizing Over Serial Dictatorships

Motivated by the success of the serial dictatorship mechanism in social choice settings, we explore its usefulness in tackling various combinatorial optimization problems. We do so by considering an abstract model, in which a set of agents are asked to act in a particular ordering, called the action sequence. Each agent acts in a way that gives her the maximum possible value, given the actions of the agents who preceded her in the action sequence. Our goal is to compute action sequences that yield approximately optimal total value to the agents (a.k.a., social welfare). We assume query access to the value vi(S)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$v_i(S)$$\\end{document} that the agent i gets when she acts after the agents in the ordered set S. We establish tight bounds on the social welfare that can be achieved using polynomially many queries. Even though these bounds show a marginally sublinear approximation of optimal social welfare in general, excellent approximations can be obtained when the valuations stem from an underlying combinatorial domain. Indicatively, when the valuations are defined using bipartite matchings, arborescences in directed graphs, and satisfiability of Boolean expressions, simple query-efficient algorithms yield 2-approximations. We discuss issues related to truthfulness and show how some of our algorithms can be implemented truthfully using VCG-like payments. Finally, we introduce and study the price of serial dictatorship, a notion that provides an optimistic measure of the quality of combinatorial optimization solutions generated by action sequences.

Robust Low-Tubal-Rank Tensor Completion Based on Tensor Factorization and Maximum Correntopy Criterion.

The goal of tensor completion is to recover a tensor from a subset of its entries, often by exploiting its low-rank property. Among several useful definitions of tensor rank, the low tubal rank was shown to give a valuable characterization of the inherent low-rank structure of a tensor. While some low-tubal-rank tensor completion algorithms with favorable performance have been recently proposed, these algorithms utilize second-order statistics to measure the error residual, which may not work well when the observed entries contain large outliers. In this article, we propose a new objective function for low-tubal-rank tensor completion, which uses correntropy as the error measure to mitigate the effect of the outliers. To efficiently optimize the proposed objective, we leverage a half-quadratic minimization technique whereby the optimization is transformed to a weighted low-tubal-rank tensor factorization problem. Subsequently, we propose two simple and efficient algorithms to obtain the solution and provide their convergence and complexity analysis. Numerical results using both synthetic and real data demonstrate the robust and superior performance of the proposed algorithms.

Home Blood Pressure Variability Risk Prediction Score for Cardiovascular Disease Using Data From the J-HOP Study.

Home blood pressure (BP) is more closely associated with cardiovascular event risk than office BP, but cardiovascular risk prediction based on home BP variability is lacking. This study developed a simple cardiovascular event prediction score, including home BP variability data, from the J-HOP study (Japan Morning Surge-Home Blood Pressure). The J-HOP study extended follow-up from December 2017 to May 2018 generated the study data set (4231 patients). Cardiovascular events included fatal/nonfatal stroke (n=94), coronary heart disease (n=124), heart failure (n=42), and aortic dissection (n=8). Cox proportional hazards models were used to predict overall cardiovascular risk. Potential covariates included age, sex, body mass index, smoking, history of diabetes, statin use, history of cardiovascular disease, total cholesterol:high-density lipoprotein cholesterol ratio, office systolic BP (SBP), mean of morning-evening average (MEave), home SBP, and average real variability of MEave home SBP. A risk score and models were constructed, and model performance was assessed. Model performance was best when average real variability of MEave SBP was included (C statistic, 0.760). The risk score assigns points for age (5-year bands), sex, cardiovascular disease history, high-density lipoprotein cholesterol, mean MEave home SBP, and average real variability of MEave home SBP. Estimated 10-year cardiovascular risk ranged from ≤0.6% (score ≤0) to >32% (score ≥26). Calibration 2 statistics values for the model (2.66) and risk score (5.29) indicated excellent goodness of fit. This simple cardiovascular disease prediction algorithm, including day-by-day home BP variability, could be used as part of a home BP-centered approach to hypertension management in clinical practice.

Enhancing Hepatitis C Care in Primary Care: A Nurse Practitioner–Led Intervention

This quality improvement (QI) project at a Federally Qualified Health Center explores enhancing hepatitis C (HCV) treatment in primary care settings. It focuses on nurse practitioner (NP)-led interventions to improve sustained viral response (SVR) rates among high-risk groups. The project, conducted from June 2021 to January 2023, identified challenges in treatment uptake and continuity, emphasizing the role of NPs in bridging care gaps. Innovative approaches, including simplified treatment algorithms and integrated behavioral health services, were implemented. The project highlights the potential of primary care settings in managing HCV, aligning with the World Health Organization’s goal of eliminating HCV by 2030.

Implementation of Skogestad’s Internal Model Control Rule in Tuning Proportional-Integral Controllers for Two-Input and Two-Output Systems Considering Individual Controller Performance Trade-off

Abstract In industrial plants, tuning of decentralized Proportional-Integral-Derivative feedback (PID) controllers in Multiple-Input and Multiple-Output (MIMO) systems is a complex problem, due to input and output interactions, that must be done to ensure individual control objectives are met, while system being sufficiently robust. In this study, a two-input and two-output (TITO) PI controller tuning algorithm was developed considering controller performance prioritization given performance trade-offs, expressed as the novel Individual Controller Performance Trade-off Coefficient (ICPTC), and system robustness, expressed as sensitivity peaks from the generalized Nyquist stability plot. Simplified effective open-loop transfer functions (EOTFs) of the two input-output channels were derived and used along with Skogestad’s Internal Model Control (SIMC) to calculate PI controller gains. Extensive simulations using Wood-Berry (WB) and Vinante-Luyben (VL) distillation column models were made to observe how the sensitivity peaks behave across the simulations, which was then used as the basis of the developed tuning algorithm. A simplified tuning algorithm, which requires less information compared to the main algorithm, was also derived. A mapping algorithm was also created, allowing specific controller gains from other studies to be mapped to an equivalent set of controller gains in the algorithm’s search field. The effectiveness of the three algorithms were tested using Wardle-Wood distillation column (WW) and Xiong and Cai (XC) process models. It was demonstrated using the main algorithm that there is a trade-off between controller performances when ICPTC is varied, at different values of design sensitivity peaks between 1.96 to 4. The usefulness of the simplified tuning and mapping algorithms were also illustrated in the study. This study is potentially useful in tuning TITO PI controllers in industrial plants, where meeting individual control objectives while maintaining robustness is more important than optimizing overall control performance.