1.

Dos equipamientos en Morella : la escuela hogar y el instituto
- Beltran Borràs, Júlia
La escuela hogar de Enric Miralles y Carme Pinós (1986-1995) y el instituto de Helio Piñón y Nicanor García (2001-2007) son dos obras arquitectónicas relevantes situadas en Morella, un pequeño núcleo fortificado en el interior de Castellón. En la escuela, los arquitectos tuvieron que afrontar el difícil encargo de construir fuera de las murallas que envuelven la ciudad, enfrentándose al paisaje, a la topografía de fuerte pendiente y al castillo, cuando la administración valenciana de patrimonio ya había rechazado un proyecto al considerar que no respetaba el valor histórico de la ciudad. El encargo posterior del instituto tendrá los mismos...

2.

Representing Configuration Knowledge with Weight Constraint Rules. AAAI
- Timo Soininen; Ilkka Niemelii; Juha Tiihonen; Reijo Sulonen
The paper demonstrates that product configuration ap-plications fit naturally the framework of answer set programming. It is shown that product configuration knowledge can be represented systematically and com-pactly using a logic program type rule language such that the answers of a configuration task, the config-urations, correspond to the models of the rule repre-sentation.. The paper pr.es.~nts such a"}ule-bised for-realization of a unified configuration oni~o]ogy using a" weight constraint rule language. The language extends normal logic programs with cardinality and weight con-straints which leads to a compact and simple formaliza-tion. The complexity of the configuration task defined by the formalization is...

3.

Maximizat ion of Organizational Upt ime Using an Interactive Genetic-Fuzzy Scheduling a n d Suppor t System
- Roger M. Stein; Vasant Dhar
This paper addresses the problem of scheduling multiple tinre and priority sensltlve tasks eflicientl, ~ in an envrron-ment where the number ofresources is litnited and the re-sources have vatying capabilities and restricted capacities. We use a help desk environrnenr as our work~ng model, however, the methodologv could also be adapted to a vari-ety ofjob shop scheduling problems in general. It'e intro-duce a metric called priority time usage as a measure of task urgency and of schedule efficiency. We also introdztce a method of considering user satisfaction in scheduling b-v uti!izing f u z y monotonic reasoning. CVe propose a meth-odology...

4.

Constraint Programming and Genetic Algorithms to Solve Layout Design Problem
- José Tavares
Abstract:- Real world optimization problems are typically complex and difficult to solve. In this work it is intended to address these problems through a combination of two techniques: Constraint Logic Programming (CLP) and Genetic Algorithms (GA). This approach aims to benefit, on the one hand, from the easiness and naturalness of the CLP to express problems whose formulation is based on constraints, and on the other hand, from the ability that GA have in attaining good solutions to a particular problem, manly when specific and efficient methods to solve the problem suitable way do not exist. As a case study...

5.

Some Electronically Programmable Logic Devices
- Marek A. Perkowski; Malgorzata Chrzanowska- Jeske
The paper proposes mvTANTs, three-level networks with multiple-valued inputs and binary outputs. These networks are a generalization of binary T A N T s (Three level And Not networks with True Inputs). One of pos-sible interpretations of m v T A N T is a four-level binary network with input decoders which realize multiple-valued literals. Similarly to mvPLAs, mvTANTs have regular structures with predictable timing. Compar-ing to mvPLAs, however, they have at least 25 % less input wares to the third-level (NAND) plane and not more outputs from the second-level (AND) plane than the mvPLA. Thus, in many cases they...

6.

Finite fields are better Booleans
Many research groups have described genetic networks as net-works of Boolean variables, and provided procedures for reverse engineering [1, 7, 3]. Recently, Laubenbacher and colleagues proposed using finite fields to represent genes and proteins in biological networks [4, 5, 6]. We demonstrate how to generalize Boolean genetic networks to finite field genetic network models. We develop a procedure for error-correction of microarray data based on majority logic de-coding, and we apply Hamming distance as a metric for cluster-ing. We demonstrate the utility of finite fields by applying the tech-niques to a data set developed at the University of Puerto Rico,...

7.

Control of Pneumatic Conveying Using
- D. Neuffer
Abstract- The control of dense-phase pneumatic conveying systems is notoriously difficult. Specifically, achieving sufficiently low air velocity to ensure efficient power utilisation, low product degradation and plant wear, whilst ensuring that blockage of the pipeline does not occur, is the greatest challenge. ECT could potentially offer a cheap, durable and potentially effective method of visualising solids movement within conveying pipelines and ultimately act as a primary sensory input to an opti-mal control system. A pneumatic conveying rig has been designed and constructed in order to simulate the slug flow of plastic pellets when using air as a transportation media. Twelve...

8.

RACE CODING AND WHITE SUPPORT FOR CRIME SPENDING:
- Stephenie E. Franks; James C. Garand
Crime is an important issue to many Americans, and as a result, there appears to be a strong public affinity for crime control policies. But is this support based on some underlying animus toward racial minorities? Gilens (1999) might argue that it is. In a series of studies on opposition to welfare, Gilens claims that welfare is a “race-coded ” issue in that it evokes negative racial attitudes among whites toward blacks, in turn negatively impacting their opinions on this race-neutral policy. Furthermore, Gilens asserts that the media is responsible for creating negative linkages of blacks with poverty, which has...

9.

Trust-based design and check of fpga circuits using two-level randomized ecc structures
- Shantanu Dutt; Li Li
A novel trust-based design method for FPGA circuits that uses error-correcting code (ECC) structures for detecting design tampers—changes, deletion of existing logic, and addition of extra-design logic like Trojans—is proposed in this paper. We determine ECC-based CLB (configuration logic block) “parity groups ” and embed the check CLBs for each parity group in the FPGA circuit. During a trust-checking phase, a Test-Pattern Generator (TPG) and an Output Response Analyzer (ORA), configured in the FPGA, are used to check that each parity group of CLB outputs produce the expected parities. We use two levels of randomization to thwart attempts by an...

10.

A Robust Model for Optimal Time-of-Day Speed Control at Highway Work Zones
- Kyeong-pyo Kang; Gang-len Chang
Abstract—This paper proposes a new speed control strategy, named time-of-day speed limit (TOD SL) control, for highway work-zone operations. The main purposes of the TOD SL control are to overcome the difficulty in setting the optimal real-time speed limit due to the lack of detectors and to maximize the use of available data such as the historical volume data on the target work zone. Its core logic is to divide the entire day of operations into a number of control periods and to accommodate the time-varying traffic conditions within each control period. The measure of effectiveness (MOE) selected in the...

11.

Spatio-Temporal Stream Reasoning with Incomplete Spatial Information
- Fredrik Heintz; Daniel De Leng; Fredrik Heintz; Daniel De Leng
Abstract. Reasoning about time and space is essential for many ap-plications, especially for robots and other autonomous systems that act in the real world and need to reason about it. In this paper we present a pragmatic approach to spatio-temporal stream reasoning in-tegrated in the Robot Operating System through the DyKnow frame-work. The temporal reasoning is done in the Metric Temporal Logic and the spatial reasoning in the Region Connection Calculus RCC-8. Progression is used to evaluate spatio-temporal formulas over in-crementally available streams of states. To handle incomplete infor-mation the underlying first-order logic is extended to a three-valued logic. When...

12.

S.K.: Automatic verification of safety and liveness for pipelined machines using web refinement
- Panagiotis Manolios; Sudarshan K. Srinivasan
We show how to automatically verify that complex pipelined machine models satisfy the same safety and liveness properties as their instruction-set architecture (ISA) models by using well-founded equivalence bisimulation (WEB) refinement. We show how to reduce WEB-refinement proof obliga-tions to formulas expressible in the decidable logic of counter arithmetic with lambda expressions and uninterpreted functions (CLU). This allows us to automate the verification of the pipelined machine models by using the UCLID decision procedure to transform CLU formulas to Boolean satisfiability problems. To relate pipelined machine states to ISA states, we use the commitment and flushing refinement maps. We evaluate...

13.

Model checking for pi-calculus using proof search
- Alwen Tiu
Abstract. Model checking for transition systems specified in pi-calculus has been a difficult problem due to the infinite-branching nature of in-put prefix, name-restriction and scope extrusion. We propose here an approach to model checking for pi-calculus by encoding it into a logic which supports reasoning about bindings and fixed points. This logic, called FOλ∆∇, is a conservative extension of Church’s Simple Theory of Types with a “generic ” quantifier. By encoding judgments about transi-tions in pi-calculus into this logic, various conditions on the scoping of names and restrictions on name instantiations are captured naturally by the quantification theory of the...

14.

Symbol Statistics for Concept Formation in AI Agents
- Jason R. Chen
Abstract—High level conceptual thought seems to be at the basis of the impressive human cognitive ability. Classical top-down (Logic based) and bottom-up (Connectionist) approaches to the problem have had limited success to date. We identify a small body of work that represents a different approach to AI. We call this work the Bottom Up Symbolic (BUS) approach and present a new BUS method to concept construction. The main novelty of our work is that we apply statistical methods in the concept construction process. Our findings here suggest that such methods are necessary since a symbolic description of the true agent-environment...

15.

QUANTIFIERS DEFINABLE BY SECOND ORDER MEANS
- Marcin Mostowski; Instytut Filozofii; Uniwersytet Warszawski
The concept of generalized quantifiers, as defined by Lindström, for some purposes is too general. A bit more subtle concept would be useful, when discussing axiomatizability of logics with such quantifiers. We say that a generalized quantifier Q is definable by second order means if and only if there is a second order formula φ(P1,..., Pn) with only free variables P1,..., Pn such that Qx1... xn(φ1,..., φn) is semantically equivalent to φ(φ1,..., φn) ( – a result of substitution of φi in φ in a place of Pi defined in a natural way, for i = 1,..., n). In such...

16.

Applying kaos services to ensure policy compliance for semantic web services workflow composition and enactment
- Andrzej Uszok; Jeffrey M. Bradshaw; Renia Jeffers; Austin Tate; Jeff Dalton
In this paper we describe our experience in applying KAoS services to ensure policy compliance for Semantic Web Services workflow composition and enactment. We are developing these capabilities within the context of two applications: Coalition Search and Rescue (CoSAR-TS) and Semantic Firewall (SFW). We describe how this work has uncovered requirements for increasing the expressivity of policy beyond what can be done with description logic (e.g., role-value-maps), and how we are extending our representation and reasoning mechanisms in a carefully controlled manner to that end. Since KAoS employs OWL for policy representation, it fits naturally with the use of OWL-S...

17.

A semantic approach to interpolation
- Andrei Popescu; Traian Florin Şerbănuţă
Abstract. Interpolation results are investigated for various types of for-mulae. By shifting the focus from syntactic to semantic interpolation, we generate, prove and classify more than twenty interpolation results for first-order logic and some for richer logics. A few of these results non-trivially generalize known interpolation results. All the others are new. 1

18.

Intel Corporation
- Intel Senior Fellow
All engineers are familiar with Murphy’s Law, namely that if something can go wrong it will go wrong. All of us are familiar with experiments and projects that didn’t work quite as expected, at least not the first time. Sometimes that’s a good thing. Sometimes serendipity trumps Murphy’s Law. Intel’s invention of uniaxial strained silicon transistors had a serendipitous beginning after some early experiments didn’t work quite as expected. First some background on how Intel organizes research and development for our silicon process technologies. Portland Technology Development is the organization within Intel that is responsible for developing logic technologies for...

19.

Hybrid System Analysis and Control via Mixed Integer Optimization. CPC-6
- Manfred Morari
The paper discusses a framework for modeling, analyzing and controlling systems whose behavior is governed by interde-pendent physical laws, logic rules, and operating constraints, denoted as Mixed Logical Dynamical (MLD) systems. They are described by linear dynamic equations subject to linear inequalities involving real and integer variables. MLD models are equivalent to various other system descriptions like Piece Wise Affine (PWA) systems and Linear Complementarity (LC) systems. They have the advantage, however, that all problems of system analysis (like controllability, observability, stability and verification) and all problems of synthesis (like controller design and filter design) can be readily expressed as...

20.

l A Framework for Hybrid Planning
- Max Garagnani; Walton Hall; Max Garagnani
Abstract. Hybrid models are characterised by the integration of two (or more) different paradigms of representation within the same sys-tem. Most current planning problem description languages are purely sentential, i.e., based on predicate logic formalisms [3, 14]. The ram-ification of the effects of action [16] makes the sentential description of planning problems that involve the spatial movement of physi-cal entities over-complex and inefficient. Evidence from research in knowledge representation and planning [6, 9, 8] indicates that these problems are more effectively modelled using homomorphic [1] (or analogical) representations. As for sentential descriptions, however, the complexity of the real world prevents...