High-temperature stabilization of polypropylene using hindered phenol–thioester stabilizer combinations,Part 1: Optimization and efficacy via nondust blends

The thermal degradation of unstabilized polypropylene has been investigated under long-term processing (twin extruder) and thermal aging at 150°C, with additive concentration studies on combinations of an established hindered phenolic antioxidant (pentaerythritol tetrakis (3-(3,5-di-tert-butyl-4-hydroxyphenyl) propionate) [S1010] and two popular thioesters (distearyl-3,3′-thiodipropionate [DSTDP] and didodecyl-3,3′-thiodipropionate [DLTDP]) using melt flow rate, carbonyl index and powder diffuse reflectance infrared Fourier transform spectroscopy (DRIFTS) (FTIR), and differential scanning calorimetry (DSC) (oxidation induction time [OIT]) and ultimate embrittlement time (Fracture) on injection-molded test pieces. It was found that 20:80 phenol:thioester ratios provided the best long-term thermal stability (LTTS); however, this was the reverse for processing stabilization (80:20), underlining the antioxidant nature of the two stabilizers (long term vs. melt). Melt preblending of the stabilizers (to form a no-dust blend) gave rise to improved LTTS. DRIFTS FTIR indicated that there was an improvement in preblending the additives, which removed any volatile impurities. Increased additive dispersion and localized potential efficacy in the stabilization cycle is important, as well as possible improved addition of the additives to the extruder rather than fine powder. The data are discussed in relation to the long-term stabilization of polypropylene in high-temperature applications such as under the bonnet of automobiles where minimizing stabilizer losses and maximizing synergy are important.     

Plant-wide control for the economic operation of modified single mixed refrigerant process for an offshore natural gas liquefaction plant

The marine operation of floating liquefied natural gas (FLNG) demands process compactness, flexibility, simplicity of operation, safety, and higher efficiency. The modified single mixed refrigerant (MSMR) process satisfies the FLNG process requirements and is accepted as a suitable technology for FLNG operation. The aim of this study was to develop a plant-wide control structure or strategy that can sustain the economic efficiency of the MSMR process. The NGL recovery and liquefaction units were integrated in the MSMR process to provide a compact plant structure with an efficient operation. Steady-state optimality analysis was intensively conducted in a rigorous dynamic simulation environment to determine the correct variable to sustain the economic efficiency of MSMR process. The results showed that the flow rate ratio of heavy and light mixed refrigerant (HK/LK ratio) is a promising self-optimizing controlled variable. Controlling this variable can sustain the MSMR optimality, even when the process is operated under off-design operating conditions or in the presence of disturbances. Based on the control structure tests, the control configuration with the HK/LK ratio loop showed excellent performance, maintaining the process stability against a range of disturbances. The proposed approach can also be applied to any cryogenic liquefaction technology for determining a possible optimizing controlled variable.     

Improving job scheduling performance with parallel access to replicas in Data Grid environment

Data Grid has evolved to be the solution for data-intensive applications, such as High Energy Physics (HEP), astrophysics, and computational genomics. These applications usually have large input of data to be analyzed and these input data are widely replicated across Data Grid to improve the performance. The job scheduling performance on traditional computing jobs can be studied using queuing theory. However, with the addition of data transfer, the job scheduling performance is too complex to be modeled. In this research, we study the impact of data transfer on the performance of job scheduling in the Data Grid environment. We have proposed a parallel downloading system that supports replicating data fragments and parallel downloading of replicated data fragments, to improve the job scheduling performance. The performance of the parallel downloading system is compared with non-parallel downloading system, using three scheduling heuristics: Shortest Turnaround Time (STT), Least Relative Load (LRL) and Data Present (DP). Our simulation results show that the proposed parallel download approach greatly improves the Data Grid performance for all three scheduling algorithms, in terms of the geometric mean of job turnaround time. The advantage of parallel downloading system is most evident when the Data Grid has relatively low network bandwidth and relatively high computing power.     

A portable toolkit for supporting end-user personalization and control in context-aware applications

A context-aware application in the pervasive computing environment provides intuitive user centric services using implicit context cues. Personalization and control are important issues for this class of application as they enable end-users to understand and configure the behavior of an application. However most development efforts for building context-aware applications focus on the sensor fusion and machine learning algorithms to generate and distribute context cues that drive the application with little emphasis on user-centric issues. We argue that, to elevate user experiences with context-aware applications, it is very important to address these personalization and control issues at the system interface level in parallel to context centric design. Towards this direction, we present Persona, a toolkit that provides support for extending context-aware applications with end-user personalization and control features. Specifically, Persona exposes a few application programming interfaces that abstract end-user customization and control mechanisms and enables developers to integrate these user-centric aspects with rest of the application seamlessly. There are two primary advantages of Persona. First, it can be used with various existing middlewares as a ready-to-use plug-in to build customizable and controllable context-aware applications. Second, existing context-aware applications can easily be augmented to provide end-user personalization and control support. In this paper, we discuss the design and implementation of Persona and demonstrate its usefulness through the development and augmentation of a range of common context-aware applications.     

A novel design of variable-rate RS encoder for ubiquitous high performance multimedia service in Gbps transmission system

In this paper, we have first reviewed the state-of-the-art technologies related to DOCSIS 3.0 high-speed data transmission system and also looked at current trends in the next generation Gbps transmission technology, which is one of key technology for ubiquitous high performance multimedia service environments. Also, we implemented the RS encoder which was designed using VHDL and verified its operation in order to confirm our design through the ModelSim simulation analysis tool.     

On fast microscopic browsing of MPEG-compressed video

MPEG has been established as a compression standard for efficient storage and transmission of digital video. However, users are limited to VCR-like (and tedious) functionalities when viewing MPEG video. The usefulness of MPEG video is presently limited by the lack of tools available for fast browsing, manipulation and processing of MPEG video. In this paper, we first address the problem of rapid access to individual shots and frames in MPEG video. We build upon the compressed-video-processing framework proposed in [1, 8], and propose new and fast algorithms based on an adaptive mixture of approximation techniques for extracting spatially reduced image sequence of uniform quality from MPEG video across different frame types and also under different motion activities in the scenes. The algorithms execute faster than real time on a Pentium personal computer. We demonstrate how the reduced images facilitate fast and convenient shot- and frame-level video browsing and access, shot-level editing and annotation, without the need for frequent decompression of MPEG video. We further propose methods for reducing the auxiliary data size associated with the reduced images through exploitation of spatial and temporal redundancy. We also address how the reduced images lead to computationally efficient algorithms for video analysis based on intra- and inter-shot processing for video database and browsing applications. The algorithms, tools for browsing and techniques for video processing presented in this paper have been used by many in IBM Research on more than 30 h of MPEG-1 video for video browsing and analysis.     

Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems

In the Hitting Set problem, we are given a collection F of subsets of a ground set V and an integer p, and asked whether V has a p-element subset that intersects each set in F. We consider two parameterizations of Hitting Set below tight upper bounds, p=m−k and p=n−k. In both cases k is the parameter. We prove that the first parameterization is fixed-parameter tractable, but has no polynomial kernel unless coNP ⊆ NP/poly. The second parameterization is W[1]-complete, but the introduction of an additional parameter, the degeneracy of the hypergraph H=(V,F), makes the problem not only fixed-parameter tractable, but also one with a linear kernel. Here the degeneracy of H=(V,F) is the minimum integer d such that for each X⊂V the hypergraph with vertex set V?X and edge set containing all edges of F without vertices in X, has a vertex of degree at most d.In Nonblocker (Directed Nonblocker), we are given an undirected graph (a directed graph) G on n vertices and an integer k, and asked whether G has a set X of n−k vertices such that for each vertex y∉X there is an edge (arc) from a vertex in X to y. Nonblocker can be viewed as a special case of Directed Nonblocker (replace an undirected graph by a symmetric digraph). Dehne et al. (Proc. SOFSEM 2006) proved that Nonblocker has a linear-order kernel. We obtain a linear-order kernel for Directed Nonblocker.     

Dissipative particle dynamics simulations for fibre suspensions in newtonian and viscoelastic fluids

A versatile model of fibre suspensions in Newtonian and viscoelastic fluids has been developed using dissipative particle dynamics method. The viscoelastic fluid is modelled by linear chains with linear connector spring force (the Oldroyd-B model), which is known to be a reasonable model for the so-called Boger fluid (a dilute suspension of polymer in a highly viscous solvent). The numerical results are in excellent agreement with the analytical results of the Oldroyd-B model in simple shear flow. An effective meso-scale model of fibre in DPD is proposed and then incorporated with simple Newtonian fluid and our Boger fluid to enable entirely study rheological properties of fibre suspensions in both Newtonian and viscoelastic solvents. The numerical results are well compared with available experimental data and other numerical models.     

A taxonomy of market‐based resource management systems for utility‐driven cluster computing

In utility‐driven cluster computing, cluster Resource Management Systems (RMSs) need to know the specific needs of different users in order to allocate resources according to their needs. This in turn is vital to achieve service‐oriented Grid computing that harnesses resources distributed worldwide based on users' objectives. Recently, numerous market‐based RMSs have been proposed to make use of real‐world market concepts and behavior to assign resources to users for various computing platforms. The aim of this paper is to develop a taxonomy that characterizes and classifies how market‐based RMSs can support utility‐driven cluster computing in practice. The taxonomy is then mapped to existing market‐based RMSs designed for both cluster and other computing platforms to survey current research developments and identify outstanding issues. Copyright © 2006 John Wiley & Sons, Ltd.     

Fixed-Parameter Complexity of Minimum Profile Problems

The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supergraph. Since computing the profile of a graph is an NP-hard problem, we consider parameterized versions of the problem. Namely, we study the problem of deciding whether the profile of a connected graph of order n is at most n−1+k, considering k as the parameter; this is a parameterization above guaranteed value, since n−1 is a tight lower bound for the profile. We present two fixed-parameter algorithms for this problem. The first algorithm is based on a forbidden subgraph characterization of interval graphs. The second algorithm is based on two simple kernelization rules which allow us to produce a kernel with linear number of vertices and edges. For showing the correctness of the second algorithm we need to establish structural properties of graphs with small profile which are of independent interest. A preliminary version of the paper is published in Proc. IWPEC 2006, LNCS vol. 4169, 60–71.