Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “constraint logic programming”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

31 records · Page 2

Specifying structural constraints of architectural patterns in the ARCHERY language

ARCHERY is an architectural description language for modelling and reasoning about distributed, heterogeneous and dynamically reconfigurable systems in terms of architectural patterns. The language supports the specification of architectures and their reconfiguration. This paper introduces a language extension for precisely describing the structural design decisions that pattern instances must respect in their (re)configurations. The extension is a propositional modal logic with recursion and nominals referencing components, i.e., a hybrid µ-calculus. Its expressiveness allows specifying safety and liveness constraints, as well as paths and cycles over structures. Refinements of classic architectural patterns are specified.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Waste management under multiple complexities: Inexact piecewise-linearization-based fuzzy flexible programming

Highlights: Black-Right-Pointing-Pointer Inexact piecewise-linearization-based fuzzy flexible programming is proposed. Black-Right-Pointing-Pointer It's the first application to waste management under multiple complexities. Black-Right-Pointing-Pointer It tackles nonlinear economies-of-scale effects in interval-parameter constraints. Black-Right-Pointing-Pointer It estimates costs more accurately than the linear-regression-based model. Black-Right-Pointing-Pointer Uncertainties are decreased and more satisfactory interval solutions are obtained. - Abstract: To tackle nonlinear economies-of-scale (EOS) effects in interval-parameter constraints for a representative waste management problem, an inexact piecewise-linearization-based fuzzy flexible programming (IPFP) model is developed. In IPFP, interval parameters for waste amounts and transportation/operation costs can be quantified; aspiration levels for net system costs, as well as tolerance intervals for both capacities of waste treatment facilities and waste generation rates can be reflected; and the nonlinear EOS effects transformed from objective function to constraints can be approximated. An interactive algorithm is proposed for solving the IPFP model, which in nature is an interval-parameter mixed-integer quadratically constrained programming model. To demonstrate the IPFP's advantages, two alternative models are developed to compare their performances. One is a conventional linear-regression-based inexact fuzzy programming model (IPFP2) and the other is an IPFP model with all right-hand-sides of fussy constraints being the corresponding interval numbers (IPFP3). The comparison results between IPFP and IPFP2 indicate that the optimized waste amounts would have the similar patterns in both models. However, when dealing with EOS effects in constraints, the IPFP2 may underestimate the net system costs while the IPFP can estimate the costs more accurately. The comparison results between IPFP and IPFP3 indicate that their solutions would be significantly different. The decreased system uncertainties in IPFP's solutions demonstrate its effectiveness for providing more satisfactory interval solutions than IPFP3. Following its first application to waste management, the IPFP can be potentially applied to other environmental problems under multiple complexities.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

A Maximin Approach for the Bi-criteria 0-1 Random Fuzzy Programming Problem Based on the Necessity Measure

This paper considers a bi-criteria general 0-1 random fuzzy programming problem based on the degree of necessity which include some previous 0-1 stochastic and fuzzy programming problems. The proposal problem is not well-defined due to including randomness and fuzziness. Therefore, by introducing chance constraint and fuzzy goals for objectives, and considering the maximization of the aspiration level for total profit and the degree of necessity that the objective function's value satisfies the fuzzy goal, the main problem is transformed into a deterministic equivalent problem. Furthermore, by using the assumption that each random variable is distributed according to a normal distribution, the problem is equivalently transformed into a basic 0-1 programming problem, and the efficient strict solution method to find an optimal solution is constructed.

99 GENERAL AND MISCELLANEOUS↗

Constraint Optimization Problem For The Cutting Of A Cobalt Chrome Refractory Material

This paper shows a complete approach to solve a given problem, from the experimentation to the optimization of different cutting parameters. In response to an industrial problem of slotting FSX 414, a Cobalt-based refractory material, we have implemented a design of experiment to determine the most influent parameters on the tool life, the surface roughness and the cutting forces. After theses trials, an optimization approach has been implemented to find the lowest manufacturing cost while respecting the roughness constraints and cutting force limitation constraints. The optimization approach is based on the Response Surface Method (RSM) using the Sequential Quadratic programming algorithm (SQP) for a constrained problem. To avoid a local optimum and to obtain an accurate solution at low cost, an efficient strategy, which allows improving the RSM accuracy in the vicinity of the global optimum, is presented. With these models and these trials, we could apply and compare our optimization methods in order to get the lowest cost for the best quality, i.e. a satisfying surface roughness and limited cutting forces.

36 MATERIALS SCIENCE↗

Teuchos C++ memory management classes, idioms, and related topics, the complete reference : a comprehensive strategy for safe and efficient memory management in C++ for high performance computing.

The ubiquitous use of raw pointers in higher-level code is the primary cause of all memory usage problems and memory leaks in C++ programs. This paper describes what might be considered a radical approach to the problem which is to encapsulate the use of all raw pointers and all raw calls to new and delete in higher-level C++ code. Instead, a set of cooperating template classes developed in the Trilinos package Teuchos are used to encapsulate every use of raw C++ pointers in every use case where it appears in high-level code. Included in the set of memory management classes is the typical reference-counted smart pointer class similar to boost::shared ptr (and therefore C++0x std::shared ptr). However, what is missing in boost and the new standard library are non-reference counted classes for remaining use cases where raw C++ pointers would need to be used. These classes have a debug build mode where nearly all programmer errors are caught and gracefully reported at runtime. The default optimized build mode strips all runtime checks and allows the code to perform as efficiently as raw C++ pointers with reasonable usage. Also included is a novel approach for dealing with the circular references problem that imparts little extra overhead and is almost completely invisible to most of the code (unlike the boost and therefore C++0x approach). Rather than being a radical approach, encapsulating all raw C++ pointers is simply the logical progression of a trend in the C++ development and standards community that started with std::auto ptr and is continued (but not finished) with std::shared ptr in C++0x. Using the Teuchos reference-counted memory management classes allows one to remove unnecessary constraints in the use of objects by removing arbitrary lifetime ordering constraints which are a type of unnecessary coupling [23]. The code one writes with these classes will be more likely to be correct on first writing, will be less likely to contain silent (but deadly) memory usage errors, and will be much more robust to later refactoring and maintenance. The level of debug-mode runtime checking provided by the Teuchos memory management classes is stronger in many respects than what is provided by memory checking tools like Valgrind and Purify while being much less expensive. However, tools like Valgrind and Purify perform a number of types of checks (like usage of uninitialized memory) that makes these tools very valuable and therefore complement the Teuchos memory management debug-mode runtime checking. The Teuchos memory management classes and idioms largely address the technical issues in resolving the fragile built-in C++ memory management model (with the exception of circular references which has no easy solution but can be managed as discussed). All that remains is to teach these classes and idioms and expand their usage in C++ codes. The long-term viability of C++ as a usable and productive language depends on it. Otherwise, if C++ is no safer than C, then is the greater complexity of C++ worth what one gets as extra features? Given that C is smaller and easier to learn than C++ and since most programmers don't know object-orientation (or templates or X, Y, and Z features of C++) all that well anyway, then what really are most programmers getting extra out of C++ that would outweigh the extra complexity of C++ over C? C++ zealots will argue this point but the reality is that C++ popularity has peaked and is becoming less popular while the popularity of C has remained fairly stable over the last decade22. Idioms like are advocated in this paper can help to avert this trend but it will require wide community buy-in and a change in the way C++ is taught in order to have the greatest impact. To make these programs more secure, compiler vendors or static analysis tools (e.g. klocwork23) could implement a preprocessor-like language similar to OpenMP24 that would allow the programmer to declare (in comments) that certain blocks of code should be ''pointer-free'' or allow smaller blocks to be 'pointers allowed'. This would significantly improve the robustness of code that uses the memory management classes described here.

99 GENERAL AND MISCELLANEOUS↗

SQUARE: Strategic Quantum Ancilla Reuse for Modular Quantum Programs via Cost-Effective Uncomputation

Compiling high-level quantum programs to machines that are size constrained (i.e. limited number of quantum bits) and time constrained (i.e. limited number of quantum operations) is challenging. In this paper, we present SQUARE (Strategic QUantum Ancilla REuse), a compilation infrastructure that tackles allocation and reclamation of scratch qubits (called ancilla) in modular quantum programs. At its core, SQUARE strategically performs uncomputation to create opportunities for qubit reuse. Current Noisy Intermediate-Scale Quantum (NISQ) computers and forward-looking Fault-Tolerant (FT) quantum computers have fundamentally different constraints such as data locality, instruction parallelism, and communication overhead. Our heuristic-based ancilla-reuse algorithm balances these considerations and fits computations into resource-constrained NISQ or FT quantum machines, throttling parallelism when necessary. To precisely capture the workload of a program, we propose an improved metric, the "active quantum volume," and use this metric to evaluate the effectiveness of our algorithm. Furthermore, our results show that SQUARE improves the average success rate of NISQ applications by 1.47X. Surprisingly, the additional gates for uncomputation create ancilla with better locality, and result in substantially fewer swap gates and less gate noise overall. SQUARE also achieves an average reduction of 1.5X (and up to 9.6X) in active quantum volume for FT machines.

compiler optimization↗

Interval-parameter semi-infinite fuzzy-stochastic mixed-integer programming approach for environmental management under multiple uncertainties

In this study, an interval-parameter semi-infinite fuzzy-chance-constrained mixed-integer linear programming (ISIFCIP) approach is developed for supporting long-term planning of waste-management systems under multiple uncertainties in the City of Regina, Canada. The method improves upon the existing interval-parameter semi-infinite programming (ISIP) and fuzzy-chance-constrained programming (FCCP) by incorporating uncertainties expressed as dual uncertainties of functional intervals and multiple uncertainties of distributions with fuzzy-interval admissible probability of violating constraint within a general optimization framework. The binary-variable solutions represent the decisions of waste-management-facility expansion, and the continuous ones are related to decisions of waste-flow allocation. The interval solutions can help decision-makers to obtain multiple decision alternatives, as well as provide bases for further analyses of tradeoffs between waste-management cost and system-failure risk. In the application to the City of Regina, Canada, two scenarios are considered. In Scenario 1, the City's waste-management practices would be based on the existing policy over the next 25 years. The total diversion rate for the residential waste would be approximately 14%. Scenario 2 is associated with a policy for waste minimization and diversion, where 35% diversion of residential waste should be achieved within 15 years, and 50% diversion over 25 years. In this scenario, not only landfill would be expanded, but also CF and MRF would be expanded. Through the scenario analyses, useful decision support for the City's solid-waste managers and decision-makers has been generated. Three special characteristics of the proposed method make it unique compared with other optimization techniques that deal with uncertainties. Firstly, it is useful for tackling multiple uncertainties expressed as intervals, functional intervals, probability distributions, fuzzy sets, and their combinations; secondly, it has capability in addressing the temporal variations of the functional intervals; thirdly, it can facilitate dynamic analysis for decisions of facility-expansion planning and waste-flow allocation within a multi-facility, multi-period and multi-option context.

54 ENVIRONMENTAL SCIENCES↗

GPU Based General-Purpose Parallel computing to Solve Nuclear Reactor In-Core fuel Management Design and Operation Problem

In-core fuel management study is a crucial activity in nuclear power plant design and operation. Its common problem is to find an optimum arrangement of fuel assemblies inside the reactor core. Main objective for this activity is to reduce the cost of generating electricity, which can be done by altering several physical properties of the nuclear reactor without violating any of the constraints imposed by operational and safety considerations. This research try to address the problem of nuclear fuel arrangement problem, which is, leads to the multi-objective optimization problem. However, the calculation of the reactor core physical properties itself is a heavy computation, which became obstacle in solving the optimization problem by using genetic algorithm optimization.This research tends to address that problem by using the emerging General Purpose Computation on Graphics Processing Units (GPGPU) techniques implemented by C language for CUDA (Compute Unified Device Architecture) parallel programming. By using this parallel programming technique, we develop parallelized nuclear reactor fitness calculation, which is involving numerical finite difference computation. This paper describes current prototype of the parallel algorithm code we have developed on CUDA, that performs one hundreds finite difference calculation for nuclear reactor fitness evaluation in parallel by using GPU G9 Hardware Series developed by NVIDIA.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Inexact fuzzy-stochastic constraint-softened programming - A case study for waste management

In this study, an inexact fuzzy-stochastic constraint-softened programming method is developed for municipal solid waste (MSW) management under uncertainty. The developed method can deal with multiple uncertainties presented in terms of fuzzy sets, interval values and random variables. Moreover, a number of violation levels for the system constraints are allowed. This is realized through introduction of violation variables to soften system constraints, such that the model's decision space can be expanded under demanding conditions. This can help generate a range of decision alternatives under various conditions, allowing in-depth analyses of tradeoffs among economic objective, satisfaction degree, and constraint-violation risk. The developed method is applied to a case study of planning a MSW management system. The uncertain and dynamic information can be incorporated within a multi-layer scenario tree; revised decisions are permitted in each time period based on the realized values of uncertain events. Solutions associated with different satisfaction degree levels have been generated, corresponding to different constraint-violation risks. They are useful for supporting decisions of waste flow allocation and system-capacity expansion within a multistage context.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Optimal Allocation of Water Resources Using a Two-Stage Stochastic Programming Method with Interval and Fuzzy Parameters

Efficient water allocation is one of the most prominent issues in water resources management. In this research, a two-stage interval-parameter stochastic fuzzy programming with type 2 membership functions was used to allocate water resources optimally to different users under uncertainty. This method can handle uncertainties expressed as probability distributions, discrete intervals, and fuzzy sets. The model considers treated wastewater as an allocable water resource in a scenario, in addition to water that is extracted from wellheads, springs, and qanats. Moreover, the loss rate of water during distribution, surplus water in the reservoir in the previous and the next period, and treated wastewater parameters have been incorporated into the model. This model was applied to a case study of water resources allocation within a multi-user and multi-reservoir context in the Zarand region of Kerman, Iran. The results indicate that reasonable solutions have been generated, in the form of interval and fuzzy information under different scenarios that could help managers provide optimal water resources allocation plans. The results also demonstrate that establishing a wastewater treatment station increases the system net benefits, surplus water in wellheads for the next period, and system reliability (level of satisfying the fuzzy goal and constraints), and decreases encountering water shortages.

58 GEOSCIENCES↗

An algorithm for linearizing convex extremal problems

This paper suggests a method of approximating the solution of minimization problems for convex functions of several variables under convex constraints is suggested. The main idea of this approach is the approximation of a convex function by a piecewise linear function, which results in replacing the problem of convex programming by a linear programming problem. To carry out such an approximation, the epigraph of a convex function is approximated by the projection of a polytope of greater dimension. In the first part of the paper, the problem is considered for functions of one variable. In this case, an algorithm for approximating the epigraph of a convex function by a polygon is presented, it is shown that this algorithm is optimal with respect to the number of vertices of the polygon, and exact bounds for this number are obtained. After this, using an induction procedure, the algorithm is generalized to certain classes of functions of several variables. Applying the suggested method, polynomial algorithms for an approximate calculation of the L{sub p}-norm of a matrix and of the minimum of the entropy function on a polytope are obtained. Bibliography: 19 titles.

97 MATHEMATICS AND COMPUTING↗

A high performance cost-effective digital complex correlator for an X-band polarimetry survey

The detailed knowledge of the Milky Way radio emission is important to characterize galactic foregrounds masking extragalactic and cosmological signals. The update of the global sky models describing radio emissions over a very large spectral band requires high sensitivity experiments capable of observing large sky areas with long integration times. Here, we present the design of a new 10 GHz (X-band) polarimeter digital backend to map the polarization components of the galactic synchrotron radiation field of the Northern Hemisphere sky. The design follows the digital processing trends in radio astronomy and implements a large bandwidth (1 GHz) digital complex cross-correlator to extract the Stokes parameters of the incoming synchrotron radiation field. The hardware constraints cover the implemented VLSI hardware description language code and the preliminary results. The implementation is based on the simultaneous digitized acquisition of the Cartesian components of the two linear receiver polarization channels. The design strategy involves a double data rate acquisition of the ADC interleaved parallel bus, and field programmable gate array device programming at the register transfer mode. The digital core of the back-end is capable of processing 32 Gbps and is built around an Altera field programmable gate array clocked at 250 MHz, 1 GSps analog to digital converters and a clock generator. The control of the field programmable gate array internal signal delays and a convenient use of its phase locked loops provide the timing requirements to achieve the target bandwidths and sensitivity. This solution is convenient for radio astronomy experiments requiring large bandwidth, high functionality, high volume availability and low cost. Of particular interest, this correlator was developed for the Galactic Emission Mapping project and is suitable for large sky area polarization continuum surveys. The solutions may also be adapted to be used at signal processing subsystem levels for large projects like the square kilometer array testbeds.

79 ASTRONOMY AND ASTROPHYSICS↗

Secure & Restore Critical Fisheries Habitat, Flathead Subbasin, FY2008 Annual Report.

The construction of Hungry Horse Dam inundated 125 km of adfluvial trout habitat in the South Fork of the Flathead River and its tributaries, impacting natural fish reproduction and rearing. Rapid residential and commercial growth in the Flathead Watershed now threaten the best remaining habitats and restrict our opportunities to offset natural resource losses. Hydropower development and other land disturbances caused severe declines in the range and abundance of our focal resident fish species, bull trout and westslope cutthroat trout. Bull trout were listed as threatened in 1998 under the Endangered Species Act and westslope cutthroat were petitioned for listing under ESA. Westslope cutthroat are a species of special concern in Montana and a species of special consideration by the Confederated Salish and Kootenai Tribes. The Secure & Protect Fisheries Habitat project follows the logical progression towards habitat restoration outlined in the Hungry Horse Dam Fisheries Mitigation Implementation Plan approved by the NWPPC in 1993. This project is also consistent with the 2000 Fish and Wildlife Program and the Flathead River Subbasin Plan that identifies the protection of habitats for these populations as one of the most critical needs in the subbasin and directs actions to offset habitat losses. The Flathead basin is one of the fastest growing human population centers in Montana. Riparian habitats are being rapidly developed and subdivided, causing habitat degradation and altering ecosystem functions. Remaining critical habitats in the Flathead Watershed need to be purchased or protected with conservation easements if westslope cutthroat and bull trout are to persist and expand within the subbasin. In addition, habitats degraded by past land uses need to be restored to maximize the value of remaining habitats and offset losses caused by the construction of Hungry Horse Dam. Securing and restoring remaining riparian habitat will benefit fish by shading and moderating water temperatures, stabilizing banks and protecting the integrity of channel dimension, improving woody debris recruitment for in-channel habitat features, producing terrestrial insects and leaf litter for recruitment to the stream, and helping to accommodate and attenuate flood flows. The purpose of this project is to work with willing landowners to protect the best remaining habitats in the Flathead subbasin as identified in the Flathead River Subbasin Plan. The target areas for land protection activities follow the priorities established in the Flathead subbasin plan and include: (1) Class 1 waters as identified in the Flathead River Subbasin Plan; (2) Class 2 watersheds as identified in the Flathead River Subbasin Plan; and (3) 'Offsite mitigation' defined as those Class 1 and Class 2 watersheds that lack connectivity to the mainstem Flathead River or Flathead Lake. This program focuses on conserving the highest quality or most important riparian or fisheries habitat areas consistent with program criteria. The success of our efforts is subject to a property's actual availability and individual landowner negotiations. The program is guided using biological and project-based criteria that reflect not only the priority needs established in the Flathead subbasin plan, but also such factors as cost, credits, threats, and partners. The implementation of this project requires both an expense and a capital budget to allow work to be completed. This report addresses accomplishments under both budgets during FY08 as the two budgets are interrelated. The expense budget provided pre-acquisition funding to conduct activities such as surveys, appraisals, staff support, etc. The capital budget was used to purchase the interest in each parcel including closing costs. Both the pre-acquisition contract funds and the capital funds used to purchase fee title or conservation easements were spent in accordance with the terms negotiated within the FY08 through FY09 MOA between the Tribes, State, and BPA. In FY08, the focus of this project was to pursue all possible properties targeted by the Tribes and Montana Fish, Wildlife and Parks. Although we were not be able to acquire an interest in all properties targeted this fiscal year due to limited time, BPA staff constraints, and negotiation constraints, we expended approximately $4.2M providing BPA with 4.2 km of credit. The Siderius and Gardner parcels were protected with conservation easements. The Siderius conservation easement is held by the Flathead Land Trust and the Gardner conservation easement is held by the Tribes. Fee title was acquired for three parcels with the Tribes holding title to the Cole and Firestone parcels and MFWP holding title to the parcels acquired from Plum Creek Timber Company. All stream kilometers credited to BPA offset construction and inundation impacts (not operations related impacts) associated with Hungry Horse Dam as defined in the 1991 Hungry Horse Loss Assessment.

13 HYDRO ENERGY↗