Chemomechanical Systems: Study of Contraction and Mechanical Work of Poly(Acrylonitrile) Gel Fibers

Poly(acrylonim1e) fibers were preoxidated under stress, in the presence of air, then saponified by boiling in alkaline solutions. The chemomechani-cal behavior of these fibers, expressed as contraction and mechanical work, under different loads and in different solvent-nonsolvent and/or base-acid systems were investigated. Total nitrogen content, carboxyl groups content, tensile strength, and cross-link density were determined. Both contraction and mechanical work were expressed as functions of applied load in every studied system. The results of chemomechanical measurements were connected to those of chemical and physical investigations. Significant differences in chemomechanical behavior were found to be the result of different stress conditions during the preoxidation stage.     

Cyclic distillation technology – a mini‐review

Process intensification in distillation systems has received much attention during past decades, with the aim of increasing both energy and separation efficiency. Various techniques, such as internal heat‐integrated distillation, membrane distillation, rotating packed bed, dividing‐wall columns and reactive distillation were studied and reported in the literature. All these techniques employ the conventional continuous counter‐current contact of vapor and liquid phases. Cyclic distillation technology is based on an alternative operating mode using separate phase movement which leads to key practical advantages in both chemical and biochemical processes. This article provides a mini‐review of cyclic distillation technology. The topics covered include the working principle, design and control methods, main benefits and limitations as well as current industrial applications. Cyclic distillation can be rather easily implemented in existing columns by simply changing the internals and the operating mode, thus bringing new life to old distillation towers by significantly increasing the column throughput, reducing the energy requirements and offering better separation performance. © 2016 Society of Chemical Industry     

Load-Balanced Sparse Matrix–Vector Multiplication on Parallel Computers

We considered the load-balanced multiplication of a large sparse matrix with a large sequence of vectors on parallel computers. We propose a method that combines fast load-balancing with efficient message-passing techniques to alleviate computational and inter-node communications challenges. The performance of the proposed method was evaluated on benchmark as well as on synthetically generated matrices and compared with the current work. It is shown that, by using our approach, a tangible improvement over prior work can be obtained, particularly for very sparse and skewed matrices. Moreover, it is also shown that I/O overhead for this problem can be efficiently amortized through I/O latency hiding and overall load-balancing.     

Generic fitted shapes (GFS): Volumetric object segmentation in service robotics

In this paper, a simultaneous 3D volumetric segmentation and reconstruction method, based on the so-called Generic Fitted Shapes (GFS) is proposed. The aim of this work is to cope with the lack of volumetric information encountered in visually controlled mobile manipulation systems equipped with stereo or RGB-D cameras. Instead of using primitive volumes, such as cuboids or cylinders, for approximating objects in point clouds, their volumetric structure has been estimated based on fitted generic shapes. The proposed GFSs can capture the shapes of a broad range of object classes without the need of large a-priori shape databases. The fitting algorithm, which aims at determining the particular geometry of each object of interest, is based on a modified version of the active contours approach extended to the 3D Cartesian space. The proposed volumetric segmentation system produces comprehensive closed object surfaces which can be further used in mobile manipulation scenarios. Within the experimental setup, the proposed technique has been evaluated against two state-of-the-art methods, namely superquadrics and 3D Object Retrieval (3DOR) engines.     

A patchy approximation of explicit model predictive control

The explicit solution of multi-parametric optimisation problems (MPOP) has been used to construct an off-line solution to relatively small- and medium-sized constrained control problems. The control design principles are based on receding horizon optimisation and generally use linear prediction models for the system dynamics. In this context, it can be shown that the optimal control law is a piecewise linear (PWL) state feedback defined over polytopic cells of the state space. However, as the complexity of the related optimisation problems increases, the memory footprint and implementation of such explicit optimal solution may be burdensome for the available hardware, principally due to the high number of polytopic cells in the state-space partition. In this article we provide a solution to this problem by proposing a patchy PWL feedback control law, which intend to approximate the optimal control law. The construction is based on the linear interpolation of the exact solution at the vertices of a feasible set and the solution of an unconstrained linear quadratic regulator (LQR) problem. With a hybrid patchy control implementation, we show that closed-loop stability is preserved in the presence of additive measurement noise despite the existence of discontinuities at the switch between the overlapping regions in the state-space partition.     

Cyclic invariance for discrete time-delay systems

This technical communique introduces a new concept of set invariance with respect to linear discrete time dynamics affected by delay. We are interested in the definition and characterization of sequences of cyclically invariant subsets in the state space. The algebraic conditions established in the late ’80s for linear dynamics are generalized to invariance analysis in the presence of delays for given sequences of polyhedral sets.     

Dynamic Verification of Memory Consistency in Cache-Coherent Multithreaded Computer Architectures

Multithreaded servers with cache-coherent shared memory are the dominant type of machines used to run critical network services and database management systems. To achieve the high availability required for these tasks, it is necessary to incorporate mechanisms for error detection and recovery. Correct operation of the memory system is defined by the memory consistency model. Errors can therefore be detected by checking if the observed memory system behavior deviates from the specified consistency model. Based on recent work, we design a framework for dynamic verification of memory consistency (DVMC). The framework consists of mechanisms to verify three invariants that are proven to guarantee that a specified memory consistency model is obeyed. We describe an implementation of the framework for the SPARCv9 architecture, and we experimentally evaluate its performance using full-system simulation of commercial workloads.     

Discrete‐time sector based hands‐off control for nonlinear system

This article presents a hands‐off control design for discrete‐time nonlinear system with a special type of nonlinear sector termed as “discrete‐time sector.” The design method to define the boundary of a discrete‐time sector is done with control‐Lyapunov function. The generalization of nonlinear system is viewed in the perspective of a comparison function. By means of a proposed sector, a switching control is designed such that no control action is experienced inside the sector thus, saving unnecessary control efforts. However, to study the robustness for discrete‐time system, a hands‐off control is modified to ensure the monotonic decrease in the energy of the system. Finally, the proposed approach is verified with the simulation results.     

Fault-aware Communication Mapping for NoCs with Guaranteed Latency

As feature sizes shrink, transient failures of on-chip network links become a critical problem. At the same time, many applications require guarantees on both message arrival probability and response time. We address the problem of transient link failures by means of temporally and spatially redundant transmission of messages, such that designer-imposed message arrival probabilities are guaranteed. Response time minimisation is achieved by a heuristic that statically assigns multiple copies of each message to network links, intelligently combining temporal and spatial redundancy. Concerns regarding energy consumption are addressed in two ways. First, we reduce the total amount of transmitted messages, and, second, we minimise the application response time such that the resulted time slack can be exploited for energy savings through voltage reduction. The advantages of the proposed approach are guaranteed message arrival probability and guaranteed worst case application response time.     

Lidar-based mapping of leaf area index and its use for validating GLOBCARBON satellite LAI product in a temperate forest of the southern USA

Lidar provides enhanced abilities to remotely map leaf area index (LAI) with improved accuracies. We aim to further explore the capability of discrete-return lidar for estimating LAI over a pine-dominated forest in East Texas, with a secondary goal to compare the lidar-derived LAI map and the GLOBCARBON moderate-resolution satellite LAI product. Specific problems we addressed include (1) evaluating the effects of analysts and algorithms on in-situ LAI estimates from hemispherical photographs (hemiphoto), (2) examining the effectiveness of various lidar metrics, including laser penetration, canopy height and foliage density metrics, to predict LAI, (3) assessing the utility of integrating Quickbird multispectral imagery with lidar for improving the LAI estimate accuracy, and (4) developing a scheme to co-register the lidar and satellite LAI maps and evaluating the consistency between them. Results show that the use of different analysts or algorithms in analyzing hemiphotos caused an average uncertainty of 0.35 in in-situ LAI, and that several laser penetration metrics in logarithm models were more effective than other lidar metrics, with the best one explaining 84% of the variation in the in-situ LAI (RMSE = 0.29 LAI). The selection of plot size and height threshold in calculating laser penetration metrics greatly affected the effectiveness of these metrics. The combined use of NDVI and lidar metrics did not significantly improve estimation over the use of lidar alone. We also found that mis-registration could induce a large artificial discrepancy into the pixelwise comparison between the coarse-resolution satellite and fine-resolution lidar-derived LAI maps. By compensating for a systematic sub-pixel shift error, the correlation between two maps increased from 0.08 to 0.85 for pines (n = 24 pixels). However, the absolute differences between the two LAI maps still remained large due to the inaccuracy in accounting for clumping effects. Overall, our findings imply that lidar offers a superior tool for mapping LAI at local to regional scales as compared to optical remote sensing, accuracies of lidar-estimate LAI are affected not only by the choice of models but also by the absolute accuracy of in-situ reference LAI used for model calibration, and lidar-derived LAI maps can serve as reliable references for validating moderate-resolution satellite LAI products over large areas.