Symbolic compaction with analogue constraints

A tool named SPARCS-A for compaction of integrated circuits with analogue constraints is presented. the approach is structured in two steps. First a robust and efficient constraint graph compaction algorithm produces a compacted layout quickly, where parasitics are controlled so as to guarantee that the performance constraints are met. Next the layout produced by the first step is fed into a linear programming (LP) solver which enforces symmetries and performs global interconnect length minimization. the computational cost of the iterative LP solver is modest, because its initial state is the configuration found by the constraint graph algorithm and only symmetry constraints need to be enforced. With considerable computational efficiency this algorithm produces a compacted layout which satisfies the high-level performance constraints and is feasible for practical use within industrial-strength analogue synthesis systems. the use of such a compactor allows one to relax the requirements on parasitic control during placement and routing, thus improving the efficiency of the entire layout design process.     

Issues About Retinex Theory and Contrast Enhancement

We present an interpretation of Land’s Retinex theory that we show to be consistent with the original formulation. The proposed model relies on the computation of the expectation value of a suitable random variable weighted with a kernel function, thus the name Kernel-Based Retinex (KBR) for the corresponding algorithm. KBR shares the same intrinsic characteristics of the original Retinex: it can reduce the effect of a color cast and enhance details in low-key images but, since it can only increase pixel intensities, it is not able to enhance over-exposed pictures. Comparing the analytical structure of KBR with that of a recent variational model of color image enhancement, we are able to perform an analysis of the action of KBR on contrast, showing the need to anti-symmetrize its equation in order to produce a two-sided contrast modification, able to enhance both under and over-exposed pictures. The anti-symmetrized KBR equations show clear correspondences with other existing color correction models, in particular ACE, whose relationship with Retinex has always been difficult to clarify. Finally, from an image processing point of view, we mention that both KBR and its antisymmetric version are free from the chromatic noise due to the use of paths in the original Retinex implementation and that they can be suitably approximated in order to reduce their computational complexity from to , being N the number of input pixels.     

A robust fault detection and isolation filter design under sensitivity constraint: An LMI approach

This paper deals with the design of a residual generator (RG) for linear time‐invariant systems subject to simultaneous different faults, disturbances and measurement noises. The objective is to design an RG filter that maximizes the transmission from a potential fault to a related residual, while minimizing the ones from nuisances (disturbances, measurement noises and other faults). The isolation of each fault is carried out by designing a bank of RG filters, each one insensitive, as much as possible, to nuisances and capable of detecting the occurrence of its related fault. The design is carried out through ℋ︁_∞ filtering techniques under an eigenstructure assignment constraint. Under mild assumptions, the RG filter can be obtained by solving a λ‐parameterized linear matrix inequality optimization problem. A comparison with existing fault detection and isolation (FDI) methods is considered in order to exhibit the relative merits of the proposed method. Copyright © 2008 John Wiley & Sons, Ltd.     

An ellipsoidal off-line MPC scheme for uncertain polytopic discrete-time systems

An off-line Model Predictive Control (MPC) method based on ellipsoidal calculus and viability theory is described in order to address control problems in the presence of state and input constraints for uncertain polytopic linear plants subject to persistent disturbances. In order to reduce the computational burdens and conservativeness of traditional polytopic MPC schemes, the present approach carries out off-line most of the computations and it makes use of closed-loop predictions to improve the control performance. This is done by recursively pre-computing suitable ellipsoidal inner approximations of the exact controllable sets and solving on-line a simple and numerically low-demanding optimization problem subject to a set-membership constraint. Comparisons with three other recent off-line MPC approaches are also provided in the final example.     

Clustering heteroskedastic time series by model-based procedures

Financial time series are often characterized by similar volatility structures. The detection of clusters of series displaying similar behavior could be important in understanding the differences in the estimated processes, without having to study and compare the estimated parameters across all the series. This is particularly relevant when dealing with many series, as in financial applications. The volatility of a time series can be characterized in terms of the underlying GARCH process. Using Wald tests and the Autoregressive metrics to measure the distance between GARCH processes, it is shown that it is possible to develop a clustering algorithm, which can provide three classifications (with increasing degree of deepness) based on the heteroskedastic patterns of the time series. The number of clusters is detected automatically and it is not fixed a priori or a posteriori. The procedure is evaluated by simulations and applied to the sector indices of the Italian market.     

Runtime Techniques to Enable a Highly-Scalable Global Address Space Model for Petascale Computing

Over the past decade, the trajectory to the petascale has been built on increased complexity and scale of the underlying parallel architectures. Meanwhile, software developers have struggled to provide tools that maintain the productivity of computational science teams using these new systems. In this regard, Global Address Space (GAS) programming models provide a straightforward and easy to use addressing model, which can lead to improved productivity. However, the scalability of GAS depends directly on the design and implementation of the runtime system on the target petascale distributed-memory architecture. In this paper, we describe the design, implementation, and optimization of the Aggregate Remote Memory Copy Interface (ARMCI) runtime library on the Cray XT5 2.3 PetaFLOPs computer at Oak Ridge National Laboratory. We optimized our implementation with the flow intimation technique that we have introduced in this paper. Our optimized ARMCI implementation improves scalability of both the Global Arrays programming model and a real-world chemistry application—NWChem—from small jobs up through 180,000 cores.     

Preferential CO oxidation over Pt/3A zeolite catalysts in H2-rich gas for fuel cell application

Even traces of CO in the hydrogen-rich gas fed to proton exchange membrane fuel cells (PEMFC) poison the platinum anode electrode and dramatically decrease the cell power output. In this work, several 1%Pt catalysts, all on 3A-type zeolite support, were prepared starting from different precursors and employing different methods: cation exchange (CE), wet impregnation (WI) and incipient wetness impregnation (IWI). The catalysts were characterised in terms of platinum dispersion and tested under realistic conditions in the quest of a catalyst for the removal of CO via the CO preferential oxidation (CO-PROX) reaction. The best catalytic performance was shown by the 1%Pt–3A catalyst prepared by IWI starting from Pt(NH₃)₄Cl₂ as a precursor, thanks to its highest platinum dispersion.     

意大利遗址公园规划设计探究——以罗马图拉真考古遗址公园为例

遗址公园作为遗址保护、展示教育与考古研究的有效途径，在世界范围内得以广泛推广与发展。意大利在文化遗产保护领域走在世界前列，其完备的法律保护制度、成熟的遗产保护理念和文物保护技术都有一定的借鉴意义。以罗马图拉真遗址公园为例，通过对其历史沿革的梳理，从遗址的空间结构和历史时序性上解读遗址时空特性，探讨其在坚持遗址原真性的基础上，如何从遗址保护理念、规划设计策略和实施技术路径3个层面对遗址进行保护与阐释，旨在解析意大利在遗址公园规划设计中的理念与方法，探讨其对于遗址公园建设实践的价值。     

Energy savings and better performances through variable speed drive application in desalination plant brine blowdown pump service

Brine blowdown represents an essential service for thermal desalination (both MSF and MED) and its operation is linked to the overall process reliability and availability.

Even if the brine blowdown pump represents a relatively minor utility in MSF plants, this utility is often the object of a service of very delicate nature. Different options are available in the market to design the blowdown pumping system, reducing EPC and operating costs and increasing reliability.

In this paper, the use of variable speed drive has been analysed for a centrifugal pump brine blowdown service in a desalination plant application. Today, the price of variable speed drive up to 250 kW is lower than 10 years ago, allowing the application of these devices in industrial applications with no price increase for the customer.

Due to the particular nature of the service (level regulation inside evaporator), the combination of low head and large capacity imposes the selection of high Nq hydraulics with consequently a flat performance curve. Under these conditions, regulation by throttling is awkward because a small variation in the system losses results in a large variation of pumped quantity. Moreover, high Nq hydraulics show a relatively narrower operating range that increases the regulation problem.

Therefore, the centrifugal pump selection is difficult because the machine works badly when too far away from the design point and, thus, the use of an inverter associated to the pump’s electric motor could allow to regulate the pump speed according to the pump requested performances. This solution improves performance because it allows the machine to work not too far away from the best efficiency point thus reducing power absorption. In addition, the pump works at BEP with less vibration and requires less maintenance over time.

Briefly, the main characteristics of the most used pump in this kind of service have been analysed and a simple type of control logic has been proposed. Furthermore, the present paper aims at overviewing the different project options, comparing costs and taking corrective actions on the factors causing operational troubles.     

H∞ generalized minimum sensitivity control design

This paper presents a two-stage approach to the H_∞ generalized sensitivity minimization problem (H_∞-GSM) for SISO, continuous-time plants. Besides some possible advantages in the control law evaluation with respect to alternative polynomial methods, the proposed approach provides a direct link with the solution of an underlying generalized minimum variance (H₂-GMV) problem and allows one to identify the class of the joint H₂/H_∞-GMV (equalizing H₂-GMV) optimal controllers.