Reactive blending of commercial PET and PC with freshly added catalysts

Reactive blending of commercial poly(ethylene terephthalate) (PET) and bisphenol A polycarbonate (PC), with catalysts added in the form of powder dispersed on the polymers just before melt mixing, was performed in a Brabender Plasticord 2000 apparatus at 275°C. Catalytic activity of the catalysts freshly added to polymers was found to be much higher as compared with that of the residues of the same type of catalysts remaining in PET after its synthesis. Furthermore, the catalytic activity appeared to be strongly dependent on the structure of the ligand that influences the catalyst solubility in the polymer melt. N.m.r. spectroscopy, selective degradation of PC fragments, solubility tests in methylene chloride and d.s.c. measurements made it possible to range the catalysts studied according to their catalytic activity.     

Bulk functionalization of ethylene–propylene copolymers. II. Influence of the initiator concentration and of the copolymer composition and chain microstructure on the reaction kinetics

The effect of the dicumylperoxide (DCPO) concentration on the kinetics of the bulk functionalization of an ethylene-propylene copolymer (EPR) has been studied. It has been found that, enhancing the DCPO initial concentration in the reaction mixture, results in both increased initial reaction rate and grafting process efficiency. DCPO content also affects degradation, which always accompanies the grafting reaction. At high DCPO content, products with a high degree of grafting and intrinsic viscosity close to that of the parent copolymer can be obtained. Furthermore, the influence of the EPR composition and chain microstructure on the functionalization as well as on the degradation processes has been investigated. By increasing the C₂ content in EPRs prepared by using vanadium-based conventional catalysts, obtains faster functionalization kinetics and a less pronounced degradation of the products. At fixed experimental conditions, the highest grafting degrees have been obtained by using EPRs prepared by high-yield titanium catalysts and characterized as a block-like microstructure. The experimental results have been interpreted on the basis of a proposed reaction mechanism.     

Epoxy Networks Modified by a New Class of Oligomeric Silsesquioxanes Bearing Multiple Intramolecular Rings Formed through Si?O?C Bonds

Summary: A new class of silsesquioxane (SSO), containing species with two to nine Si atoms bearing multiple intramolecular rings formed through Si? O? C bonds, was synthesized as a glassy powder. It was characterized by UV‐MALDI‐TOF MS, ²⁹Si NMR and FT IR. Solutions containing different amounts of SSO in the diglycidyl ether of bisphenol A (DGEBA), were homopolymerized in the presence of (4‐dimethylamino)pyridine (DMAP) as initiator, leading to SSO‐modified epoxy networks. SSO species were covalently bonded to the epoxy network without any evidence of phase separation. The SSO addition provoked an increase in the elastic modulus in the glassy state explained by an increase in the cohesive energy density. The SSO addition gave also place to an increase in the intensity of tan δ and a decrease in both the glass transition temperature and the elastic modulus in the rubbery state. This was explained by a decrease in crosslink density associated with the flexibility of SSO structures. DMAP was much more effective than other usual initiators (like benzyldimethylamine, BDMA), in increasing the crosslink density of the resulting epoxy network. This led to high values of the glass transition temperature and the elastic modulus in the rubbery state.

Schematic representation of the chemical structure of the most significant species containing three Si atoms, present in the silsesquioxane.     

Windows Mobile LiveSD Forensics

More and more often, smartphones are relevant targets of civil and criminal investigations. Currently, there are several tools available to acquire forensic evidence from smartphones. Unfortunately, most of these tools require to connect the smartphone under investigation through a cable to an external device, like a computer or a multimeter. Some tools even require to disassemble the chips from the smartphone board.In this paper, we propose LiveSD Forensics, an on-device live data acquisition solution, to acquire evidence from both the Random-Access Memory (RAM) and the Electronically Erasable Programmable Read Only Memory (EEPROM) of Windows Mobile Devices.To the best of our knowledge, LiveSD Forensics is the only tool that performs on-device live data acquisition of the RAM and the EEPROM of Windows Mobile Devices. LiveSD Forensics uses a standard SD-Card equipped with tailored code to perform the data acquisition. Compared to other existing tools, LiveSD also generates the smallest memory alteration. Finally, to assess the effectiveness of the proposed methodology, we test LiveSD in a practical scenario, that is retrieving from the RAM the cryptographic key used by a known on-the-fly encryption tool. Results support the quality and effectiveness of our proposal.     

A reverse engineering approach for automatic annotation of Web pages

The Semantic Web is gaining increasing interest to fulfill the need of sharing, retrieving, and reusing information. Since Web pages are designed to be read by people, not machines, searching and reusing information on the Web is a difficult task without human participation. To this aim adding semantics (i.e meaning) to a Web page would help the machines to understand Web contents and better support the Web search process. One of the latest developments in this field is Google’s Rich Snippets, a service for Web site owners to add semantics to their Web pages. In this paper we provide a structured approach to automatically annotate a Web page with Rich Snippets RDFa tags. Exploiting a data reverse engineering method, combined with several heuristics, and a named entity recognition technique, our method is capable of recognizing and annotating a subset of Rich Snippets’ vocabulary, i.e., all the attributes of its Review concept, and the names of the Person and Organization concepts. We implemented tools and services and evaluated the accuracy of the approach on real E-commerce Web sites.     

Structural tractability of enumerating CSP solutions

The problem of deciding whether CSP instances admit solutions has been deeply studied in the literature, and several structural tractability results have been derived so far. However, constraint satisfaction comes in practice as a computation problem where the focus is either on finding one solution, or on enumerating all solutions, possibly projected to some given set of output variables. The paper investigates the structural tractability of the problem of enumerating (possibly projected) solutions, where tractability means here computable with polynomial delay (WPD), since in general exponentially many solutions may be computed. A framework based on the notion of tree projection of hypergraphs is considered, which generalizes all structural decomposition methods that are based on decomposing a given instance into suitable tree-like groups of polynomial-time computable subproblems. Tractability results have been obtained both for classes of structures where output variables are part of their specification, and for classes of structures where computability WPD must be ensured for any possible set of output variables. By exhibiting dichotomies, these results are shown to be tight for classes of structures having bounded arity.     

Scalable fine-grained behavioral clustering of HTTP-based malware

A large number of today’s botnets leverage the HTTP protocol to communicate with their botmasters or perpetrate malicious activities. In this paper, we present a new scalable system for network-level behavioral clustering of HTTP-based malware that aims to efficiently group newly collected malware samples into malware family clusters. The end goal is to obtain malware clusters that can aid the automatic generation of high quality network signatures, which can in turn be used to detect botnet command-and-control (C&C) and other malware-generated communications at the network perimeter.We achieve scalability in our clustering system by simplifying the multi-step clustering process proposed in [31], and by leveraging incremental clustering algorithms that run efficiently on very large datasets. At the same time, we show that scalability is achieved while retaining a good trade-off between detection rate and false positives for the signatures derived from the obtained malware clusters. We implemented a proof-of-concept version of our new scalable malware clustering system and performed experiments with about 65,000 distinct malware samples. Results from our evaluation confirm the effectiveness of the proposed system and show that, compared to [31], our approach can reduce processing times from several hours to a few minutes, and scales well to large datasets containing tens of thousands of distinct malware samples.     

Analysis of I/O Performance on an Amazon EC2 Cluster Compute and High I/O Platform

Cloud computing is currently being explored by the scientific community to assess its suitability for High Performance Computing (HPC) environments. In this novel paradigm, compute and storage resources, as well as applications, can be dynamically provisioned on a pay-per-use basis. This paper presents a thorough evaluation of the I/O storage subsystem using the Amazon EC2 Cluster Compute platform and the recent High I/O instance type, to determine its suitability for I/O-intensive applications. The evaluation has been carried out at different layers using representative benchmarks in order to evaluate the low-level cloud storage devices available in Amazon EC2, ephemeral disks and Elastic Block Store (EBS) volumes, both on local and distributed file systems. In addition, several I/O interfaces (POSIX, MPI-IO and HDF5) commonly used by scientific workloads have also been assessed. Furthermore, the scalability of a representative parallel I/O code has also been analyzed at the application level, taking into account both performance and cost metrics. The analysis of the experimental results has shown that available cloud storage devices can have different performance characteristics and usage constraints. Our comprehensive evaluation can help scientists to increase significantly (up to several times) the performance of I/O-intensive applications in Amazon EC2 cloud. An example of optimal configuration that can maximize I/O performance in this cloud is the use of a RAID 0 of 2 ephemeral disks, TCP with 9,000 bytes MTU, NFS async and MPI-IO on the High I/O instance type, which provides ephemeral disks backed by Solid State Drive (SSD) technology.     

Effect of a risk factor in convoy merging manoeuvres considering uncertainty in travelling times

Cooperative guiding, and especially in convoys, for automated, non-contaminating transport units is a line of research for sustainable urban transport. In this paper we propose a strategy for facilitating the merging manoeuvre between independent units travelling in a transport scenario (usually a city) and a convoy following a pre-defined peripheral trajectory in the same scenario. The proposal consists of an inexpensive computational cost algorithm, which is able to calculate the optimal merging point and the efficient route to reach it. An optimal merging node is the one on the periphery which minimises the merging time. In addition to the complexity of the problem is the uncertainty associated to travelling times, as is habitual in a real urban setting. Sources of uncertainty include weather conditions, the effect of the zone (proximity to centres of social services or cultural interest), the day and time on traffic density, etc. All this justifies the variability in the time taken by any vehicle moving along a section in the transport scenario.In order to delimit the randomness inherent to the problem, the authors incorporate a novel “risk factor” parameter, which conditions the solution. This risk factor limits the probability of a convoy reaching the merging node before the pursuer (failed merging manoeuvre).The possibility of having the travelling experiences from any unit moving in the transport scenario means that the statistics (mean and variance) associated to the expected travelling times can be updated dynamically. This task is executed in a remote centre which communicates with all the units in the transport scenario. This dynamic updating means that the objectives (optimal merging node and efficient routing) can be re-evaluated, and makes it possible to adapt to the changing conditions of the transport scenario, each time the pursuing unit reaches an intermediate node.In order to validate the algorithm described in this paper and evaluate the effect of the aforementioned novel risk factor, we have tested them on a simulated transport scenario using Player/Stage. The results and conclusions are also shown.     

Numerical simulations of particle migration in a viscoelastic fluid subjected to Poiseuille flow

In this work we present 2D numerical simulations on the migration of a particle suspended in a viscoelastic fluid under Poiseuille flow. A Giesekus model is chosen as constitutive equation of the suspending liquid. In order to study the sole effect of the fluid viscoelasticity, both fluid and particle inertia are neglected.The governing equations are solved through the finite element method with proper stabilization techniques to get convergent solutions at relatively large flow rates. An Arbitrary Lagrangian–Eulerian (ALE) formulation is adopted to manage the particle motion. The mesh grid is moved along the flow so as to limit particle motion only in the gradient direction to substantially reduce mesh distortion and remeshing.Viscoelasticity of the suspending fluid induces particle cross-streamline migration. Both large Deborah number and shear thinning speed up the migration velocity. When the particle is small compared to the gap (small confinement), the particle migrates towards the channel centerline or the wall depending on its initial position. Above a critical confinement (large particles), the channel centerline is no longer attracting, and the particle is predicted to migrate towards the closest wall when its initial position is not on the channel centerline. As the particle approaches the wall, the translational velocity in the flow direction is found to become equal to the linear velocity corresponding to the rolling motion over the wall without slip.