Manganese ferrite nanoparticles synthesized through a nanocasting route as a highly active Fenton catalyst

Spinel ferrite MnFe₂O₄ nanoparticles were synthesized by means of a nanocasting technique using a low-cost mesoporous silica gel as a hard template. The magnetic nanoparticles, of <10 nm diameter and with a surface area of around 100 m²/g, were tested as a heterogeneous Fenton catalyst for the decomposition of hydrogen peroxide under neutral and basic conditions. This catalyst shows a much higher activity than previous heterogeneous catalysts reported in the literature, which is mainly ascribed to its small particle size. Furthermore, the magnetic catalyst can be easily separated from the reaction medium by means of an external magnetic field. The effects of residual silica and the purity of the catalyst (hematite formation) on catalytic activity have been studied and correlated. The results obtained show this catalyst to be a suitable candidate for the removal of pollutants in wastewaters by means of the Fenton heterogeneous reaction.     

A new tantalum sulfur compound as electrode material for non-aqueous alkali metal batteries

Polycrystalline (PbS)_1.14(TaS₂)₂, a misfit layer sulfide, was used as cathodic material for lithium secondary battery. One molar LiClO₄ in propylene carbonate (PC) was used as electrolyte. The cell could be galvanostatic discharged down to x = 4.6 [Li_x(PbS)_1.14(TaS₂)₂] when the current density was 65 μA cm⁻² and the cell was cycled more than 100 times between 3.5 and 1.5 V at a current density of 260 μA cm⁻². Lattice expansion increased linearly with lithium content and was less than that reported for the Li/TaS₂ system. Chemical diffusion coefficients were determined by a modified version of the galvanostatic intermittent titration technique and they were fairly constant in the composition range 0.2 < x < 1, and an average value of 8.1 × 10⁻¹¹ cm² s⁻¹ was calculated. Sodium intercalation was also accomplished, but the uptake of this ion resulting in a significant lattice expansion compared with that observed for lithium ions. Moreover, a similar dependence of the sodium chemical diffusion coefficient on the composition was observed with an average value of 1.4 × 10⁻¹⁰ cm² s⁻¹, somewhat higher than that of lithium ion. We believe that differences in lattice expansion may be responsible for the differences found in the chemical diffusivity values.     

Separation and determination of mono-, Di-, and triglycerides in monoglyceride concentrates

Summary Monoglyceride concentrates are quantitatively separated into mono-, di-, and triglyceride components on silica gel columns by an adsorption chromatographic technique. The separated glycerides are determined gravimetrically. The adsorption on silica gel is dependent on the number of hydroxyl groups in the molecule, and the influence of unsaturation and chain length is minimized. Combinations of benzene and ethyl ether are used for elution, thus preventing isomerization, which frequently results when polar solvents such as alcohols are used. The procedure for the chromatographic separation is simple and straightforward. The equipment used is easily obtainable. The silica gel adsorbent requires only adjustment of its water content before use. Mixtures of both saturated and unsaturated glycerides and those having different fatty acid chain length have been separated. Known mixtures have also been analyzed. For a known mixture containing 15% tripalmitin, 45% distearin, and 38% monopalmitin the average deviations from the calculated values were 0.4%, 0.2%, and 0.6%, respectively     

Spectrocolorimetric and microscopic techniques for the evaluation of plasticized PVC cleaning: a case study applicable to three-dimensional objects at museums

For the validation of a cleaning method in conservation, the examination of the object's surface after the cleaning and the quantification of the cleaning efficiency are significant steps. In this study, several cleaning solutions were tested on a plasticized poly(vinyl chloride) object whose surface was characterized before and after cleaning by optical microscopy and noncontact profilometry. In addition, different methods to quantify the cleaning efficiency based on spectrocolorimetric and microscopic techniques were provided. The results showed that noncontact profilometry supported by optical microscopy and spectrocolorimetry was very useful for the characterization of the plasticized poly(vinyl chloride) surface before and after the cleaning and also for the determination of the cleaners' efficiency.     

Efficient wavelet-based ECG processing for single-lead FHR extraction

This paper describes a novel model for fetal heart rate (FHR) monitoring from single-lead mother?s abdomen ECG (AECG) measurements. This novel method is divided in two stages: the first step consists on a one-step wavelet-based preprocessing for simultaneous baseline and high-frequency noise suppression, while the second stage efficiently detects fetal QRS complexes allowing FHR monitoring. The presented structure has been simplified as much as possible, in order to reduce computational cost and thus enable possible custom hardware implementations. Moreover, the proposed scheme and its fixed-point modeling have been tested using real abdominal ECG signals, which allow the validation of the presented approach and provide high accuracy.     

On the complexity of bandwidth allocation in radio networks

We define and study an optimization problem that is motivated by bandwidth allocation in radio networks. Because radio transmissions are subject to interference constraints in radio networks, physical space is a common resource that the nodes have to share in such a way, that concurrent transmissions do not interfere. The bandwidth allocation problem we study under these constraints is the following. Given bandwidth (traffic) demands between the nodes of the network, the objective is to schedule the radio transmissions in such a way that the traffic demands are satisfied. The problem is similar to a multicommodity flow problem, where the capacity constraints are replaced by the more complex notion of non-interfering transmissions. We provide a formal specification of the problem that we call round weighting  . By modeling non-interfering radio transmissions as independent sets, we relate the complexity of round weighting to the complexity of various independent set problems (e.g. maximum weight independent set, vertex coloring, fractional coloring). From this relation, we deduce that in general, round weighting is hard to approximate within n^1−ε$n^{1-\epsilon }$ (n$n$ being the size of the radio network). We also provide polynomial (exact or approximation) algorithms e.g. in the following two cases: (a) when the interference constraints are specific (for instance for a network whose vertices belong to the Euclidean space), or (b) when the traffic demands are directed towards a unique node in the network (also called gathering, analogous to single commodity flow).     

A constant-time dynamic storage allocator for real-time systems

Dynamic memory allocation has been used for decades. However, it has seldom been used in real-time systems since the worst case of spatial and temporal requirements for allocation and deallocation operations is either unbounded or bounded but with a very large bound. In this paper, a new allocator called TLSF (Two Level Segregated Fit) is presented. TLSF is designed and implemented to accommodate real-time constraints. The proposed allocator exhibits time-bounded behaviour, O(1), and maintains a very good execution time. This paper describes in detail the data structures and functions provided by TLSF. We also compare TLSF with a representative set of allocators regarding their temporal cost and fragmentation. Although the paper is mainly focused on timing analysis, a brief study and comparative analysis of fragmentation incurred by the allocators has been also included in order to provide a global view of the behaviour of the allocators. The temporal and spatial results showed that TLSF is also a fast allocator and produces a fragmentation close to that caused by the best existing allocators.

Optimal infinite scheduling for multi-priced timed automata

This paper is concerned with the derivation of infinite schedules for timed automata that are in some sense optimal. To cover a wide class of optimality criteria we start out by introducing an extension of the (priced) timed automata model that includes both costs and rewards as separate modelling features. A precise definition is then given of what constitutes optimal infinite behaviours for this class of models. We subsequently show that the derivation of optimal non-terminating schedules for such double-priced timed automata is computable. This is done by a reduction of the problem to the determination of optimal mean-cycles in finite graphs with weighted edges. This reduction is obtained by introducing the so-called corner-point abstraction, a powerful abstraction technique of which we show that it preserves optimal schedules. This work has been mostly done while visiting CISS at Aalborg University in Denmark and has been supported by CISS and by ACI Cortos, a program of the French Ministry of Research.     

AVCOL: Availability-aware information aggregation in large distributed systems under uncollaborative behavior

Aggregation of system-wide information in large-scale distributed systems, such as p2p systems and Grids, can be unfairly influenced by nodes that are selfish, colluding with each other, or are offline most of the time. We present AVCOL, which uses probabilistic and gossip-style techniques to provide availability-aware aggregation. Concretely, AVCOL is the first aggregation system that: (1) implements any (arbitrary) global predicate that explicitly specifies any node’s probability of inclusion in the global aggregate, as a mathematical function of that node’s availability (i.e., percentage time online); (2) probabilistically tolerates large numbers of selfish nodes and large groups of colluders; and (3) scales well with hundreds to thousands of nodes. AVCOL uses several unique design decisions: per-aggregation tree construction where nodes are allowed a limited but flexible probabilistic choice of parents or children, probabilistic aggregation along trees, and auditing of nodes both during aggregation as well as in gossip-style (i.e., periodically). We have implemented AVCOL, and we experimentally evaluated it using real-life churn traces. Our evaluation and our mathematical analysis show that AVCOL satisfies arbitrary predicates, scales well, and withstands a variety of selfish and colluding attacks.     

SPIDER: An availability-aware framework for the service function chain placement in distributed scenarios

The network function virtualization (NFV) paradigm replaces hardware-dependent network functions by virtual network functions (VNFs) that can be deployed in commodity hardware, including legacy servers. Consequently, the use of NFV is expected to reduce operating and capital expenses, as well as improve service deployment operation and management flexibility. For many use cases, the VNFs must be visited and invoked following a specific order of execution in order to compose a complete network service, named service function chain (SFC). Nonetheless, despite the benefits from NFV and SFC virtualization technologies, their introduction must not harm network performance and service availability. On the one hand, redundancy is seen by network service planners as a mechanism well established to combat availability issues. At same time, there is a goal to optimize resource utilization in order to reduce operational expenditure. In this article, we share our experience in the design use of a framework, named SPIDER, focused on SFC placement that considers the network infrastructure condition and the required SFC availability to define the placement strategy. The SPIDER monitors the status of infrastructure nodes and links and defines which servers the VNFs should be placed on and the number of redundant replicas needed. We present a proof-of-concept of SPIDER using Kubernetes to launch the VNFs as containers. We also use Kubernetes to forward the traffic between the VNFs, composing the service chain. We perform experiments to evaluate the runtime of SPIDER and the SFC delay under different network conditions.