A Self-Repairing Execution Unit for Microprogrammed Processors

Describes a processor which dynamically reconfigures its internal microcode to execute each instruction using only fault-free blocks from the execution unit. Working without redundant or spare computational blocks, this self-repair approach permits a graceful performance degradatio

Lazy Model Expansion: Interleaving Grounding with Search

Finding satisfying assignments for the variables involved in a set of constraints can be cast as a (bounded) model generation problem: search for (bounded) models of a theory in some logic. The state-of-the-art approach for bounded model generation for rich knowledge representation languages, like ASP, FO(.) and Zinc, is ground-and-solve: reduce the theory to a ground or propositional one and apply a search algorithm to the resulting theory. An important bottleneck is the blowup of the size of the theory caused by the reduction phase. Lazily grounding the theory during search is a way to overcome this bottleneck. We present a theoretical framework and an implementation in the context of the FO(.) knowledge representation language. Instead of grounding all parts of a theory, justifications are derived for some parts of it. Given a partial assignment for the grounded part of the theory and valid justifications for the formulas of the non-grounded part, the justifications provide a recipe to construct a complete assignment that satisfies the non-grounded part. When a justification for a particular formula becomes invalid during search, a new one is derived; if that fails, the formula is split in a part to be grounded and a part that can be justified. The theoretical framework captures existing approaches for tackling the grounding bottleneck such as lazy clause generation and grounding-on-the-fly, and presents a generalization of the 2-watched literal scheme. We present an algorithm for lazy model expansion and integrate it in a model generator for FO(ID), a language extending first-order logic with inductive definitions. The algorithm is implemented as part of the state-of-the-art FO(ID) Knowledge-Base System IDP. Experimental results illustrate the power and generality of the approach

Incremental Interpretation: Applications, Theory, and Relationship to Dynamic Semantics

Why should computers interpret language incrementally? In recent years psycholinguistic evidence for incremental interpretation has become more and more compelling, suggesting that humans perform semantic interpretation before constituent boundaries, possibly word by word. However, possible computational applications have received less attention. In this paper we consider various potential applications, in particular graphical interaction and dialogue. We then review the theoretical and computational tools available for mapping from fragments of sentences to fully scoped semantic representations. Finally, we tease apart the relationship between dynamic semantics and incremental interpretation.Comment: Procs. of COLING 94, LaTeX (2.09 preferred), 8 page

Recursive SDN for Carrier Networks

Control planes for global carrier networks should be programmable (so that new functionality can be easily introduced) and scalable (so they can handle the numerical scale and geographic scope of these networks). Neither traditional control planes nor new SDN-based control planes meet both of these goals. In this paper, we propose a framework for recursive routing computations that combines the best of SDN (programmability) and traditional networks (scalability through hierarchy) to achieve these two desired properties. Through simulation on graphs of up to 10,000 nodes, we evaluate our design's ability to support a variety of routing and traffic engineering solutions, while incorporating a fast failure recovery mechanism

Conformant Planning as a Case Study of Incremental QBF Solving

We consider planning with uncertainty in the initial state as a case study of incremental quantified Boolean formula (QBF) solving. We report on experiments with a workflow to incrementally encode a planning instance into a sequence of QBFs. To solve this sequence of incrementally constructed QBFs, we use our general-purpose incremental QBF solver DepQBF. Since the generated QBFs have many clauses and variables in common, our approach avoids redundancy both in the encoding phase and in the solving phase. Experimental results show that incremental QBF solving outperforms non-incremental QBF solving. Our results are the first empirical study of incremental QBF solving in the context of planning and motivate its use in other application domains.Comment: added reference to extended journal article; revision (camera-ready, to appear in the proceedings of AISC 2014, volume 8884 of LNAI, Springer

Propagation of Pericentral Necrosis During Acetaminophen-Induced Liver Injury: Evidence for Early Interhepatocyte Communication and Information Exchange.

Acetaminophen (APAP)-induced liver injury is clinically significant, and APAP overdose in mice often serves as a model for drug-induced liver injury in humans. By specifying that APAP metabolism, reactive metabolite formation, glutathione depletion, and mitigation of mitochondrial damage within individual hepatocytes are functions of intralobular location, an earlier virtual model mechanism provided the first concrete multiattribute explanation for how and why early necrosis occurs close to the central vein (CV). However, two characteristic features could not be simulated consistently: necrosis occurring first adjacent to the CV, and subsequent necrosis occurring primarily adjacent to hepatocytes that have already initiated necrosis. We sought parsimonious model mechanism enhancements that would manage spatiotemporal heterogeneity sufficiently to enable meeting two new target attributes and conducted virtual experiments to explore different ideas for model mechanism improvement at intrahepatocyte and multihepatocyte levels. For the latter, evidence supports intercellular communication via exosomes, gap junctions, and connexin hemichannels playing essential roles in the toxic effects of chemicals, including facilitating or counteracting cell death processes. Logic requiring hepatocytes to obtain current information about whether downstream and lateral neighbors have triggered necrosis enabled virtual hepatocytes to achieve both new target attributes. A virtual hepatocyte that is glutathione-depleted uses that information to determine if it will initiate necrosis. When a less-stressed hepatocyte is flanked by at least two neighbors that have triggered necrosis, it too will initiate necrosis. We hypothesize that the resulting intercellular communication-enabled model mechanism is analogous to the actual explanation for APAP-induced hepatotoxicity at comparable levels of granularity