In this paper we study the properties of systems of bounded arithmetic capturing small complexity classes and state conditions sufficient for such systems to capture the corresponding complexity class tightly. Our class of systems of bounded arithmetic is the class of secondorder systems with comprehension axiom for a syntactically restricted class of formulas Φ ⊂ Σ 1 based on a logic in the de...

We describe our development and use of DescriptiveEnvironment (DE). This is a program to aid researchers in Finite Model Theory and students of logic to automatically generate examples, counterexamples of conjectures, reductions between problems, and visualizations of structures and queries. DescriptiveEnvironment is available for free use under an ISC license at http://www.cs.umass.edu/∼immerm...

In t h i s paper we f o r m a l i z e d i f f e r e n t methods f o r d e s c r i b i n g c o n t r o l knowledge in p roduc t i on systems by the concept of p r o d u c t i o n system schemes. In t h i s framework these methods are compared from the v iewpo in t o f d e s c r i p t i o n a l comp lex i t y g i v i n g us some i n s i g h t by which means problems can be descr ibed in an easy a...

In this paper we propose two dynamic voltage scaling (DVS) policies for a GALS NoC, which is designed based on fully asynchronous switch architectures. The first one is a history-based DVS policy, which exploits the link utilization and adjusts the voltages of different parts of the router among a few voltage levels. The second one is a FIFO-adaptive DVS, which uses two FIFO threshold levels fo...