An Optimal Algorithm for Bisection for Bounded-Treewidth Graph

Author(s):  
Tesshu Hanaka ◽  
Yasuaki Kobayashi ◽  
Taiga Sone
Author(s):  
Алексей Дмитриевич Акишин ◽  
Иван Павлович Семчук ◽  
Александр Петрович Николаев

Постоянно растущий интерес к разработке новых неинвазивных и безманжетных методов измерения параметров сердечной деятельности, использование которых давало бы возможность непрерывного и удаленного контроля сердечно-сосудистой системы, обуславливает актуальность данной работы. В многочисленных публикациях продолжаются обсуждения преимуществ и недостатков различных методов ранней диагностики сердечно-сосудистых заболеваний. Однако артефакты движения являются сильной помехой, мешающей точной оценке показателей функционирования сердечно-сосудистой системы. Одним из перспективных методов контроля является метод оценки физиологических параметров с использованием фотоплетизмографии. Данная статья посвящена разработке устройства для фотоплетизмографических исследований и алгоритмических методов обработки регистрируемых сигналов для обеспечения мониторинга сердечного ритма с заданной точностью. В работе используются технологии цифровой адаптивной фильтрации полученных сигналов для мониторинга сердечного ритма в условиях внешних механических и электрических помеховых воздействий, ухудшающих точностные характеристики системы, а также разработана архитектура системы и изготовлен макет устройства, который позволил провести измерения для определения оптимального алгоритма цифровой обработки сигналов. При использовании устройства применялись методы адаптивной фильтрации на основе фильтров Винера, фильтров на основе метода наименьших квадратов и Калмановской фильтрации. Разработанное устройство для фотоплетизмографических исследований обеспечило возможность мониторинга сердечного ритма с заданной точностью, контроля текущего состояния организма и может быть использовано в качестве средства диагностики заболеваний сердца The constantly growing interest in the development of new non-invasive and cuff-free methods for measuring the parameters of cardiac activity, the use of which would give the possibility of continuous and remote monitoring of the cardiovascular system, determines the relevance of this work. Numerous publications continue to discuss the advantages and disadvantages of various methods of early diagnosis of cardiovascular disease. However, motion artifacts are a strong hindrance to the accurate assessment of the performance of the cardiovascular system. One of the promising control methods is the method for assessing physiological parameters using photoplethysmography. This article is devoted to the development of a device for photoplethysmographic studies and algorithmic methods for processing recorded signals to ensure monitoring of the heart rate with a given accuracy. The work uses technologies of digital adaptive filtering of the received signals to monitor the heart rate in conditions of external mechanical and electrical interference, which worsen the accuracy characteristics of the system, as well as the architecture of the system and a prototype of the device, which made it possible to carry out measurements to determine the optimal algorithm for digital signal processing. When using the device, the methods of adaptive filtering based on Wiener filters, filters based on the least squares method and Kalman filtering were used. The developed device for photoplethysmographic studies provided the ability to monitor the heart rate with a given accuracy, control the current state of the body and can be used as a means of diagnosing heart diseases


2012 ◽  
Vol 23 (9) ◽  
pp. 2261-2272 ◽  
Author(s):  
Ting-Wen LIU ◽  
Yong SUN ◽  
Dong-Bo BU ◽  
Li GUO ◽  
Bin-Xing FANG

2014 ◽  
Vol 35 (10) ◽  
pp. 2328-2334
Author(s):  
Jun Liu ◽  
Liang-lun Cheng ◽  
Jian-hua Wang

Algorithmica ◽  
2021 ◽  
Author(s):  
Édouard Bonnet ◽  
Nidhi Purohit

AbstractA resolving set S of a graph G is a subset of its vertices such that no two vertices of G have the same distance vector to S. The Metric Dimension problem asks for a resolving set of minimum size, and in its decision form, a resolving set of size at most some specified integer. This problem is NP-complete, and remains so in very restricted classes of graphs. It is also W[2]-complete with respect to the size of the solution. Metric Dimension has proven elusive on graphs of bounded treewidth. On the algorithmic side, a polynomial time algorithm is known for trees, and even for outerplanar graphs, but the general case of treewidth at most two is open. On the complexity side, no parameterized hardness is known. This has led several papers on the topic to ask for the parameterized complexity of Metric Dimension with respect to treewidth. We provide a first answer to the question. We show that Metric Dimension parameterized by the treewidth of the input graph is W[1]-hard. More refinedly we prove that, unless the Exponential Time Hypothesis fails, there is no algorithm solving Metric Dimension in time $$f(\text {pw})n^{o(\text {pw})}$$ f ( pw ) n o ( pw ) on n-vertex graphs of constant degree, with $$\text {pw}$$ pw the pathwidth of the input graph, and f any computable function. This is in stark contrast with an FPT algorithm of Belmonte et al. (SIAM J Discrete Math 31(2):1217–1243, 2017) with respect to the combined parameter $$\text {tl}+\Delta$$ tl + Δ , where $$\text {tl}$$ tl is the tree-length and $$\Delta$$ Δ the maximum-degree of the input graph.


2019 ◽  
Vol 46 (1) ◽  
pp. 41-43
Author(s):  
Lin Yang ◽  
Lei Deng ◽  
Mohammad H. Hajiesmaili ◽  
Cheng Tan ◽  
Wing Shing Wong
Keyword(s):  

1995 ◽  
Vol 43 (2) ◽  
pp. 367-371 ◽  
Author(s):  
Yvan Dumas ◽  
Jacques Desrosiers ◽  
Eric Gelinas ◽  
Marius M. Solomon

Author(s):  
Na Geng ◽  
Zhiting Chen ◽  
Quang A. Nguyen ◽  
Dunwei Gong

AbstractThis paper focuses on the problem of robot rescue task allocation, in which multiple robots and a global optimal algorithm are employed to plan the rescue task allocation. Accordingly, a modified particle swarm optimization (PSO) algorithm, referred to as task allocation PSO (TAPSO), is proposed. Candidate assignment solutions are represented as particles and evolved using an evolutionary process. The proposed TAPSO method is characterized by a flexible assignment decoding scheme to avoid the generation of unfeasible assignments. The maximum number of successful tasks (survivors) is considered as the fitness evaluation criterion under a scenario where the survivors’ survival time is uncertain. To improve the solution, a global best solution update strategy, which updates the global best solution depends on different phases so as to balance the exploration and exploitation, is proposed. TAPSO is tested on different scenarios and compared with other counterpart algorithms to verify its efficiency.


Sign in / Sign up

Export Citation Format

Share Document