The pose of a polyhedral object can be determined with range data obtained from a set of simple light-stripe range sensors. However, localization results are highly dependent on sensor placement. This paper presents a method for designing an optimal sensor placement of three light-stripe sensors with which to determine the pose of an arbitrarily positioned object. We evaluate a sensor placement...

The integration of distributed energy resources (DER) into power systems presents substantial challenges to network planners. Assessing accurately the impact that installed DER will have is critical in areas such as: control of the network within statutory and operational limits; quality of supply; losses; and financial objectives. In particular, identifying the optimal placement, capacity and ...

In this paper the impacts of income and consumption taxes are analyzed within a model of stochastic endogenous growth with congestion. It is shown that the optimal amount of governmental input diminishes with uncertainty and that the optimal financing depends on the relation between the degrees of rivalry and relative risk aversion. Due to the insurance effect associated with the taxation of st...

Wie schwer ist es zu multiplizieren? Jeder hat in der Schule die Methode zum ” schriftlichen“ Multiplizieren – die sog. ” Schulmethode der Multiplikation“ – kennen gelernt. Unsere Schulkenntnisse reichen also aus, einen effizienten Algorithmus zum Multiplizieren von langen Zahlen anzugeben. Um zwei n-stellige Zahlen zu multiplizieren, benötigt man mit der Schulmethode Θ(n) Additionen und Multip...

The study of chaotic phenomena in partial differential equations is a challenging subject. In this paper, we survey the recent progress in the study of chaotic vibration of the linear wave equation with nonlinear boundary feedback control law. We show that when there is linear energy injection at one end of the boundary and the self-regulating or van der Pol nonlinearity at the other end of the...

We develop new optimal partitioning and placement codes for end-case processing in top-down standard-cell placement. Such codes are based on either enumeration or branch-and-bound, and are invoked for instances below prescribed size thresholds (e.g., < 30 cells for partitioning, or < 10 cells for placement). Our optimal partitioners handle tight balance constraints and uneven cell sizes transpa...