Over the past few years electrochemical capacitors (ECs) or, as they are so often referred to today, superor ultracapacitors, have become increasingly interesting for a certain critical group of applications because of their unique attributes. The first of these EC attributes is exceptional power performance, even at very low temperatures. The second is an essentially unlimited cycle life when ...

It is well understood that induction motors draw higher currents during their starting operations than is the case under full load running conditions. Since the early days of induction motor availability, starting methods other than Direct-on-Line have been used, and in some cases mandated by Utilities, to reduce the effect of these high starting currents on the electrical distribution network....

A new homotopy method for solving systems of polynomial equations is presented. The homotopy equation is extremely simple: It is linear with respect to the homotopy parameter and only one auxiliary parameter is needed to regularize the problem. Within some limits, an arbitrary starting problem can be chosen, as long as its solution set is known. No restrictions on the polynomial systems are mad...

We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r ∈ P , and a length constraint B, one needs to find a path starting from r that visits as many points of P as possible and of length not exceeding B. We present a (1 − ε)-approximation algorithm for this problem that runs in nO(1/ε) time; the computed path visits at least (1 − ε)kopt points of...

Maniezzo and Mingozzi (Operations Research Letters 25 (1999), pp. 175–182) study a project scheduling problem with irregular starting time costs. Starting from the assumption that its computational complexity status is open, they develop a branch-and-bound procedure and they identify special cases that are solvable in polynomial time. In this note, we present a collection of previously establis...

This paper presents an experimental investigation into the properties of the optimal communication spanning tree (OCST) problem. The OCST problem seeks a spanning tree that connects all the nodes and satisfies their communication requirements at a minimum total cost. The paper compares the properties of random trees to the properties of the best solutions for the OCST problem that are found usi...