The problem of minimum-time damping of a pendulum is a classical problem of control theory. In the linear case, described by the equation ẍ+ x = u, |u| ≤ 1, its solution is stated in [1]. The optimal control is of bang-bang type, i.e. it takes values u = ±1, and the switching curve which separates the domain of the phase plane, where u = −1 from the domain u = +1 consists of unit semicircles ce...

In an orthogonal drawing of a plane graph, any edge is drawn as a sequence of line segments, each having either a horizontal or a vertical direction. A bend is a point where an edge changes its direction. A drawing is called a bend-minimum orthogonal drawing if the number of bends is minimum among all orthogonal drawings. This paper presents a linear-time algorithm to find a bend-minimum orthog...

This paper analyzes the feasibility of quantifying design tradeoffs on the transient step response of a class of nonlinear systems. This feasibility analysis builds on available tools for the characterization of performance limitations in the optimal quadratic response of the class of strict feedback nonlinear systems. We present results that show that, as in linear systems, for certain classes...

This paper presents a lower bound of ~ (D + p n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in n-vertex networks of diameter D = (logn), in the bounded message model. This establishes the asymptotic near-optimality of existing time-e cient distributed algorithms for the problem, whose complexity is O(D + p n log n).

We consider the problem of inferring the structure and dynamics of an unknown network driven by unknown noise inputs. For linear, time-invariant systems of minimal order, with hidden states and one noise source per measured state, we characterise under what conditions this problem is wellposed and present two main results. First, for networks with stable interactions between measured states and...

We describe a method to detect instances of a walking person carrying an object seen from a stationary camera. We take a correspondence-free motion-based recognition approach, that exploits known shape and periodicity cues of the human silhouette shape. Specifically, we subdivide the binary silhouette into four horizontal segments, and analyze the temporal behavior of the bounding box width ove...

We consider a special case of the generalized minimum spanning tree problem (GMST) and the generalized travelling salesman problem (GTSP) where we are given a set of points inside the integer grid (in Euclidean plane) where each gride cell is 1 × 1. In the MST version of the problem, the goal is to find a minimum tree that contains exactly one point from each non-empty grid cell (cluster). Simi...

Discrete-time linear time-varying can be represented using infinite dimensional operators. Using this representation the well-known definition of the entropy for time-invariant systems can be extended to this class of systems. In this paper we characterize the controller which minimizes the entropy in the case that full information is available.

The Ethernet standard is a standard solution for interconnecting industrial devices despite its intrinsic drawbacks, particularly its nondeterministic medium access method. Many Ethernet-based commercial solutions available (COTS Components Off the Shelves) on the market guarantee time performance. This means that user selection of one particular solution is a critical decision, but the choice ...

We present an algorithm for finding a smallest Resolution refutation of any 2CNF in polynomial time.