Results 1  10
of
18
Speed scaling to manage energy and temperature
 Journal of the ACM
"... We first consider online speed scaling algorithms to minimize the energy used subject to the constraint that every job finishes by its deadline. We assume that the power required to run at speed s is P s s. We provide a tight bound on the competitive ratio of the previously proposed Optimal A ..."
Abstract

Cited by 131 (15 self)
 Add to MetaCart
(Show Context)
We first consider online speed scaling algorithms to minimize the energy used subject to the constraint that every job finishes by its deadline. We assume that the power required to run at speed s is P s s. We provide a tight bound on the competitive ratio of the previously proposed Optimal Available algorithm. This improves the best known competitive ratio by a factor of . We then introduce a new online algorithm, and show that this algorithm’s competitive ratio is at most e. This competitive ratio is significantly better and is approximately e for large . Our result is essentially tight for large . In particular, as approaches infinity, we show that any algorithm must have competitive ratio e (up to lower order terms). We then turn to the problem of dynamic speed scaling to minimize the maximum temperature that the device ever reaches, again subject to the constraint that all jobs finish by their deadlines. We assume that the device cools according to Fourier’s law. We show how to solve this problem in polynomial time, within any error bound, using the Ellipsoid algorithm. 1.
Optimal boundary triangulations of an interpolating ruled surface
 Journal of Computing and Information Science in Engineering 5
, 2005
"... We investigate how to define a triangulated ruled surface interpolating two polygonal directrices that will meet a variety of optimization objectives which originate from many CAD/CAM and geometric modeling applications. This optimal triangulation problem is formulated as a combinatorial search prob ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
(Show Context)
We investigate how to define a triangulated ruled surface interpolating two polygonal directrices that will meet a variety of optimization objectives which originate from many CAD/CAM and geometric modeling applications. This optimal triangulation problem is formulated as a combinatorial search problem whose search space however has the size tightly factorial to the numbers of points on the two directrices. To tackle this bound, we introduce a novel computational tool called multilayer directed graph and establish an equivalence between the optimal triangulation and the singlesource shortest path problem on the graph. Well known graph search algorithms such as the Dijkstra’s are then employed to solve the singlesource shortest path problem, which effectively solves the optimal triangulation problem in O(mn) time, where n and m are the numbers of vertices on the two directrices respectively. Numerous experimental examples are provided to demonstrate the usefulness of the proposed optimal triangulation problem in a variety of engineering applications.
Constraints And Their Satisfaction In The Recovery Of Local Surface Structure
, 1997
"... Abstract This thesis deals with the problem of recovering the local structure of surfaces from discrete range data. It is assumed that this recovery is done mostly in a bottomup fashion, that is, without the help of a priori knowledge about the viewed surface. Because the problem is illposed, we ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract This thesis deals with the problem of recovering the local structure of surfaces from discrete range data. It is assumed that this recovery is done mostly in a bottomup fashion, that is, without the help of a priori knowledge about the viewed surface. Because the problem is illposed, we nevertheless need to place constraints on the recovered structure to get a unique solution. In a bottomup approach, these constraints must come from generic assumptions that apply to all surfaces. Many methods of bottomup surface reconstruction have been proposed up to now, some of them dealing with intensity surfaces, some with range surfaces. Each of these methods either explicitly or implicitly applies a set of constraints on the data. The way in which the constraints are applied also varies from method to method. The main contribution of this thesis is some success at unifying a number of those methods under a common formalism of energy minimization, which will permit to better compare the choice of constraints between methods. We also show that the most successful surface reconstruction methods form idempotent operators, which we argue is to be expected. One method, Sander's curvature consistency, is studied in more detail than the others because it has not been studied much elsewhere yet. ii TABLE OF CONTENTS TABLE OF CONTENTS Abstract : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 LIST OF FIGURES : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : iv Abstract : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 Sommaire : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2 Acknowledgements : : :...
Regularity of Solutions to SecondOrder Integral Functionals in Variational Calculus
, 707
"... We obtain regularity conditions of a new type of problems of the calculus of variations with secondorder derivatives. As a corollary, we get nonoccurrence of the Lavrentiev phenomenon. Our main result asserts that autonomous integral functionals of the calculus of variations with a Lagrangian havin ..."
Abstract
 Add to MetaCart
(Show Context)
We obtain regularity conditions of a new type of problems of the calculus of variations with secondorder derivatives. As a corollary, we get nonoccurrence of the Lavrentiev phenomenon. Our main result asserts that autonomous integral functionals of the calculus of variations with a Lagrangian having superlinearity partial derivatives with respect to the higherorder derivatives admit only minimizers with essentially bounded derivatives.
Abstract
, 705
"... We study a boundaryvalue quasilinear elliptic problem on a generic time scale. Making use of the fixedpoint index theory, sufficient conditions are given to obtain existence, multiplicity, and infinite solvability of positive solutions. ..."
Abstract
 Add to MetaCart
(Show Context)
We study a boundaryvalue quasilinear elliptic problem on a generic time scale. Making use of the fixedpoint index theory, sufficient conditions are given to obtain existence, multiplicity, and infinite solvability of positive solutions.
Domain Adaptation for Statistical Classifiers
"... The most basic assumption used in statistical learning theory is that training data and test data are drawn from the same underlying distribution. Unfortunately, in many applications, the “indomain ” test data is drawn from a distribution that is related, but not identical, to the “outofdomain ” ..."
Abstract
 Add to MetaCart
(Show Context)
The most basic assumption used in statistical learning theory is that training data and test data are drawn from the same underlying distribution. Unfortunately, in many applications, the “indomain ” test data is drawn from a distribution that is related, but not identical, to the “outofdomain ” distribution of the training data. We consider the common case in which labeled outofdomain data is plentiful, but labeled indomain data is scarce. We introduce a statistical formulation of this problem in terms of a simple mixture model and present an instantiation of this framework to maximum entropy classifiers and their linear chain counterparts. We present efficient inference algorithms for this special case based on the technique of conditional expectation maximization. Our experimental results show that our approach leads to improved performance on three real world tasks on four different data sets from the natural language processing domain. 1.
Charlie C. L. Wang Department of Automation and ComputerAided Engineering,
"... Ruled surfaces are widely used in computeraided design and manufacturing �CAD/CAM � and computer graphics applications. For example, they are utilized to approximate freeform surfaces so that efficient NC tool paths can be generated �1�. In Ref. �2� ..."
Abstract
 Add to MetaCart
Ruled surfaces are widely used in computeraided design and manufacturing �CAD/CAM � and computer graphics applications. For example, they are utilized to approximate freeform surfaces so that efficient NC tool paths can be generated �1�. In Ref. �2�
Quantum Algorithm for Continuous Global Optimization
, 2001
"... We investigate the entwined roles of information and quantum algorithms in reducing the complexity of the global optimization problem (GOP). We show that: (i) a modest amount of additional information is su±cient to map the general continuous GOP into the (discrete) Grover problem; (ii) while this a ..."
Abstract
 Add to MetaCart
(Show Context)
We investigate the entwined roles of information and quantum algorithms in reducing the complexity of the global optimization problem (GOP). We show that: (i) a modest amount of additional information is su±cient to map the general continuous GOP into the (discrete) Grover problem; (ii) while this additional information is actually available in some classes of GOPs, it cannot be taken advantage of within classical optimization algorithms; (iii) on the contrary, quantum algorithms o®er a natural framework for the e±cient use of this information resulting in a speedup of the solution of the GOP. 1 1 Global Optimization Problem Optimization problems are ubiquitous and extremely consequential. The theoretical and practical interest they have generated has continued to grow from the ¯rst recorded instance of Queen Dido's problem [13] to present day forays in complexity theory or large scale logistics applications (see Refs. [14], [9], [8], [6], and references therein). The formulation
3.1p On Optimality of Adiabatic Switching in MOS EnergyRecovery Circuit
"... The principle of adiabatic switching in conventional energyrecovery adiabatic circuit is generally explained with the help of a rudimentary RC circuit being driven by a constant current source. However, it is not strictly accurate to approximate a MOS adiabatic circuit by such an elementary model ow ..."
Abstract
 Add to MetaCart
(Show Context)
The principle of adiabatic switching in conventional energyrecovery adiabatic circuit is generally explained with the help of a rudimentary RC circuit being driven by a constant current source. However, it is not strictly accurate to approximate a MOS adiabatic circuit by such an elementary model owing to its failure to incorporate the nonlinearity of very deep submicron transistors. This paper employs the theory of variational calculus in order to extend the principle of optimality used in this RC model to general MOS adiabatic circuits. Our experimental results include energy dissipation comparison in various adiabatic schemes using optimal power clocking versus other waveforms.