We report on the design and implementation of the AC/DC gradient descent solver for a class of optimization problems over normalized databases. AC/DC decomposes an optimization problem into a set of aggregates over the join of the database relations. It then uses the answers to these aggregates to iteratively improve the solution to the problem until it converges. The challenges faced by AC/DC ...

Abstract: Today’s motor drives widely use Digital Signal Processor (DSP) or Microcontroller to implement the digital control algorithm. Most recently new requirements have arisen. These include faster torque control update with flexible design capability of motion peripherals for high performance military servo drive applications. A Complete digital hardware based AC servo drive development sys...

Affective computing (AC) adopts a computational approach to study affect. We highlight the AC approach towards automated affect measures that jointly model machine-readable physiological/behavioral signals with affect estimates as reported by humans or experimentally elicited. We describe the conceptual and computational foundations of the approach followed by two case studies: one on discrimin...

One potential future for the next generation of smart grids is use decentralized optimization algorithms and secured communications coordinating renewable (e.g., wind/solar), dispatchable devices coal/gas/nuclear generations), demand response, battery & storage facilities, topology optimization. The Alternating Direction Method Multipliers (ADMM) has been widely used in community to address suc...

POWERED ARM T AC 2 3 Abstract Dynamically recompiling from one machine code to another can be used to emulate modern microprocessors at realistic speeds. This report is a discussion of the techniques used in implementing a dynamically recompiling emulator of an ARM processor for use in an emulation of a complete computer system.

In this paper we rst give a uniform AC 0 algorithm which uses partial sums to compute multiple addition. Then we use it to show that multiple addition is computable in uniform TC 0 by using count only once sequentially. By constructing bit matrix for multiple addition, we prove that multiple product with poly-logarithmic size is computable in uniform TC 0 (by using count k + 1 times sequentiall...