Abstract GENO (generic optimization) is a domain specific language for mathematical optimization. The software generates solver from specification of an optimization problem class. problems, that is, their objective function and constraints, are specified in formal language. then translated into general normal form. Problems form passed on to purpose solver. In its Iterations, the evaluates exp...

proton exchange membrane fuel cells (pemfcs) with a dead-ended anode and cathode can obtain high hydrogen and oxygen utilization by a comparatively simple system. nevertheless, the accumulation of the water in the anode and cathode channels might cause a local fuel starvation degrading the performance and durability of pemfcs. in this study, a brand new design for a polymer electrolyte membrane...

RAMACHANDRAN, SHANKAR. Stack Space Analysis for ARM Executables. (Under the direction of Dr. Alexander Dean). Bounding maximum stack depth for embedded system applications is essential in order to avoid conditions such as stack overflow. Stack usage information is useful for allocating the stack into a memory hierarchy. Prior work in stack space analysis addresses specific issues such as handli...

A stack-based processor where the instruction set acts on data resided on an evaluation stack, has its performance bottleneck due to the limit of access to the stack. Although the stack-based processor has low performance, it is very low cost to implement. This paper proposes a method to improve the performance of a stack-based processor. A number of fast registers are used to “cache” part of t...

Robert Weida and Diane Lit-man. Terminological reasoning with constraint networks and an application to plan recognition. In Proc. (a)g where S { called the Step Interpretation { is a function associating a newly generated function to each interval introduced by a decomposition operator. The representation of the Double-Stack plan in the extended language is: Double-Stack : = 3(x y) (x d ])(y d...

We consider the natural generalization of Alexeev and Knutson's stack of branchvarieties to the case of a Deligne-Mumford stack. The main results are a proof that the stack of branchvarieties is always algebraic, that limits of one-dimensional families always exist, and that the connected components of the stack of branchvarieties are proper over the base under certain hypotheses on the ambient...