Using parametric set constraints for locating errors in CLP programs

This paper introduces a framework of parametric descriptive directional types for constraint logic programming (CLP). It proposes a method for locating type errors in CLP programs and presents a prototype debugging tool. The main technique used is checking correctness of programs w.r.t. type specifications. The approach is based on a generalization of known methods for proving correctness of logic programs to the case of parametric specifications. Set-constraint techniques are used for formulating and checking verification conditions for (parametric) polymorphic type specifications. The specifications are expressed in a parametric extension of the formalism of term grammars. The soundness of the method is proved and the prototype debugging tool supporting the proposed approach is illustrated on examples. The paper is a substantial extension of the previous work by the same authors concerning monomorphic directional types.Comment: 64 pages, To appear in Theory and Practice of Logic Programmin

Algorithm Development and Analysis for Advanced EngineTechnologies including Piezoelectric Fuel Injection and VariableValve Actuation

As vehicle emissions standards and fuel economy constraints become increasingly strict, the automotive industry must employ the use of advanced engine technologies to overcome these challenges. Fuel injection rate shaping and cylinder deactivation (CDA) are two such technologies, and both of them require the design and implementation of algorithms using various hardware and software tools. Fuel injection rate shaping is one path towards cleaner and more efficient diesel engines. Piezoelectrically-actuated fuel injectors are well-suited for rate shaping operation, but are difficult to control. Control-related challenges arise primarily due to the lack of measurements available in a fuel injection system on-engine, the inherent complexity in the dynamics of a piezoelectric fuel injector, and variability from injector-to-injector and over the life of a given injector. Although these challenges are significant, model-based fuel flow rate estimation and control is of the utmost importance due to the fact that the brake torque in a diesel engine is primarily influenced by the total amount of injected fuel per engine cycle. This thesis studies the effect of injector model parameter uncertainties on the model-based estimate of the injector\u27s output fuel flow rate. Specifically, the relationship between the injector\u27s needle seat area and needle lift is investigated. While off-engine experiments can be conducted to determine this parameter, this study presents an on-engine parameter estimation strategy that can accommodate for some of the aforementioned injector variability. In the presence of an initial parameter error of 25\%, the parameter estimator improved the model-based prediction of total injected fuel by approximately 10\% in Matlab simulations. CDA is another technology that enables improved fuel economy and reduced tailpipe emissions in diesel engines. As the name suggests, CDA involves deactivating some combination of an engine\u27s cylinders in order to temporarily reduce the total displacement of the engine. Reduced engine displacement can improve fuel economy and reduce harmful engine emissions (by means of reduced air-to-fuel ratio and reduced pumping work), especially at low engine speed and load conditions. However, there are a few challenges that CDA presents. First, engine lubricating oil can accumulate in deactivated cylinders as time progresses. Second, cylinders may not perform normally immediately upon reactivation (a concept referred to as first-fire readiness ) due to this oil accumulation as well as low in-cylinder temperatures that are the result of a prolonged deactivation. Third, changing the combination of firing cylinders can yield undesirable torsional vibrations during CDA operation. This thesis analyzes the first and second of these issues using in-cylinder pressure measurements to study combustion in cylinders that have been reactivated after prolonged periods of deactivation. Experiments show that as more time is spent in CDA mode, more oil accumulates in deactivated cylinders. This oil accumulation can be as much as 500 mg for cylinders that have been deactivated for 20 minutes. CDA durations of 5 and 10 minutes yield accumulated oil masses of up to 376 mg and 255 mg, respectively, while a CDA duration of 0.5 minutes yields an oil accumulation of less than 1 mg. Since the combustion of this accumulated oil causes abnormally large cumulative heat releases in the engine cycles following the transition from CDA to six cylinder mode, the brake torque does not smoothly transition between these two engine modes. For CDA times of 5, 10, and 20 minutes, these torque fluctuations make such long periods of CDA-only operation unacceptable from a first-fire readiness perspective. Finally, this thesis presents a basic cylinder recharging strategy that can be used in future work to mitigate the effect of oil accumulation and improve first-fire readiness. While improvements in piston ring design can prevent oil accumulation, this cylinder recharging strategy uses software to reactivate all deactivated cylinders for a single engine cycle at regular intervals in an effort to raise in-cylinder pressures enough to prevent oil from seeping into deactivated cylinders. The ability to perform these recharge events has been added to the engine test cell used in this study and has been validated experimentally. Although CDA-only operation is unacceptable for periods of time greater than or equal to 5 minutes, CDA operation with regularly-spaced recharge events could enable prolonged CDA operation by mitigating the effects of oil accumulation and first-fire readiness

Image data processing system requirements study. Volume 2: Appendixes

Supporting information for the ERS loading study contains computer simulation loading output including printout description, and similar output representing data that include night station contacts

Image data processing system requirements study. Volume 1: Analysis

Digital image processing, image recorders, high-density digital data recorders, and data system element processing for use in an Earth Resources Survey image data processing system are studied. Loading to various ERS systems is also estimated by simulation

EOS image data processing system definition study

The Image Processing System (IPS) requirements and configuration are defined for NASA-sponsored advanced technology Earth Observatory System (EOS). The scope included investigation and definition of IPS operational, functional, and product requirements considering overall system constraints and interfaces (sensor, etc.) The scope also included investigation of the technical feasibility and definition of a point design reflecting system requirements. The design phase required a survey of present and projected technology related to general and special-purpose processors, high-density digital tape recorders, and image recorders

The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation

We study the computational complexity of problems that arise in abstract argumentation in the context of dynamic argumentation, minimal change, and aggregation. In particular, we consider the following problems where always an argumentation framework F and a small positive integer k are given. - The Repair problem asks whether a given set of arguments can be modified into an extension by at most k elementary changes (i.e., the extension is of distance k from the given set). - The Adjust problem asks whether a given extension can be modified by at most k elementary changes into an extension that contains a specified argument. - The Center problem asks whether, given two extensions of distance k, whether there is a "center" extension that is a distance at most (k-1) from both given extensions. We study these problems in the framework of parameterized complexity, and take the distance k as the parameter. Our results covers several different semantics, including admissible, complete, preferred, semi-stable and stable semantics