The paper is an introduction to the use of classical Newton–Puiseux procedure, oriented towards algorithmic description it. This procedure allows obtain polynomial approximations for parameterizations branches algebraic plane curve at a singular point. We look approach that can be easily grasped and almost self-contained. illustrate algorithm first in completely worked out example with point mu...

Service function chaining (SFC) is an indispensable technique for Internet service providers to efficiently manage their networks. However, SFC poses requirements of additional processing time functions (SFs) and increased routing owing detoured paths. In this paper, we introduce the use a programmable data plane (PDP) reduce times in SFC. We first classify existing PDP-empowered schemes analyz...

Given a set of pairwise disjoint polygonal obstacles in the plane, finding an obstacle-avoiding Euclidean shortest path between two points is classical problem computational geometry and has been studied extensively. Previously, Hershberger Suri (in SIAM Journal on Computing , 1999) gave algorithm O(n log n ) time space, where total number vertices all obstacles. Recently, by modifying Suri’s a...

this paper is concerned with the problem of designing discrete-time control systems with closed-loop eigenvalues in a prescribed region of stability. first, we obtain a state feedback matrix which assigns all the eigenvalues to zero, and then by elementary similarity operations we find a state feedback which assigns the eigenvalues inside a circle with center   and radius. this new algorithm ca...

A geometric graph is a graph whose vertices are points in the plane and whose edges are straight-line segments between the points. A plane spanning tree in a geometric graph is a spanning tree that is non-crossing. Let R and B be two disjoint sets of points in the plane where the points of R are colored red and the points of B are colored blue, and let n = |R ∪ B|. A bichromatic plane spanning ...