Maghnite‐H+, a solid catalyst for the cationic polymerization of α‐methylstyrene

The polymerization of α‐methylstyrene (AMS) catalyzed by Maghnite‐H⁺ (Mag‐H) was investigated. Mag‐H is a montmorillonite sheet silicate clay, exchanged with protons. It was found that the cationic polymerization of AMS is initiated by Mag‐H at ambient temperature in bulk and in solution. The effect of the amount of Mag‐H, the temperature, and the solvent was studied. The polymerization rate increased with increase in the temperature and the proportion of catalyst, and it was larger in nonpolar solvents. These results indicated the cationic nature of the polymerization. It may be suggested that the polymerization is initiated by proton addition to monomer from Mag‐H. © 2008 Wiley Periodicals, Inc. J Appl Polym Sci, 2008     

2D and 3D image localization,compression and reconstruction using new hybrid moments

In this article, we will present a new set of hybrid polynomials and their corresponding moments, with a view to using them for the localization, compression and reconstruction of 2D and 3D images. These polynomials are formed from the Hahn and Krawtchouk polynomials. The process of calculating these is successfully stabilized using the modified recurrence relations with respect to the n order, the variable x and the symmetry property. The hybrid polynomial generation process is carried out in two forms: the first form contains the separable discrete orthogonal polynomials of Krawtchouk–Hahn (DKHP) and Hahn–Krawtchouk (DHKP). The latter are generated as the product of the discrete orthogonal Hahn and Krawtchouk polynomials, while the second form is the square equivalent of the first form, it consists of discrete squared Krawtchouk–Hahn polynomials (SKHP) and discrete polynomials of Hahn–Krawtchouk squared (SHKP). The experimental results clearly show the efficiency of hybrid moments based on hybrid polynomials in terms of localization property and computation time of 2D and 3D images compared to other types of moments; on the other hand, encouraging results have also been shown in terms of reconstruction quality and compression despite the superiority of classical polynomials.

     

A hybrid multiagent routing approach for wireless ad hoc networks

Wireless ad-hoc networks are infrastructureless networks that comprise wireless mobile nodes able to communicate each other outside wireless transmission range. Due to frequent network topology changes in one hand and the limited underlying bandwidth in the other hand, routing becomes a challenging task. In this paper we present a novel routing algorithm devoted for mobile ad hoc networks. It entails both reactive and proactive components. More precisely, the algorithm is based on ant general behavior, but differs from the classic ant methods inspired from Ant-Colony-Optimization algorithm [1]. We do not use, during the reactive phase, a broadcasting technique that exponentially increases the routing overhead, but we introduce a new reactive route discovery technique that considerably reduces the communication overhead. In the simulation results, we show that our protocol can outperform both Ad hoc On-demand Distance Vector (AODV) protocol [2], one of the most important current state-of-the-art algorithms, and AntHocNet protocol [5], one of the most important ant-based routing algorithms, in terms of end-to-end delay, packet delivery ratio and the communication overhead.     

On-Chip Tightly Confined Guiding and Splitting of Surface Acoustic Waves Using Line Defects in Phononic Crystals

Phononic crystals (PnCs) exhibit acoustic properties that are not usually found in natural materials, which leads to the possibility of new devices for the complex manipulation of acoustic waves. In this article, a micron-scale phononic waveguide constructed by line defects in PnCs to achieve on-chip, tightly confined guiding, bending, and splitting of surface acoustic waves (SAWs) is reported. The PnC is made of a square lattice of periodic nickel pillars on a piezoelectric substrate. The PnC lattice constant, pillar diameter, and pillar height are set to 10, 7.5, and 3.2 µm, respectively, leading to a complete bandgap centered at 195 MHz. Interdigitated transducers are monolithically integrated on the same substrate for SAW excitation. The guiding, bending, and splitting of SAWs in the phononic waveguide are experimentally observed through measurement of the out-of-plane displacement fields using a scanning optical interferometer. The combination of destructive interference due to the Bragg bandgap and the interaction of the propagating wave with the pillars around the channel results in a tight confinement of the displacement field. The proposed phononic waveguides demonstrate the feasibility of precise local manipulation of SAW that is essential for emerging frontier applications, notably for phonon-based classical and quantum information processing.     

ESHARP: Energy-Efficient and Smart Hierarchical Routing Protocol Based on Smart Slumber for Wireless Sensor Networks

Wireless Personal Communications - This paper proposes a new energy management function intended to be integrated in the Hierarchical Smart Routing Protocol (HSRP) mainly proposed for Wireless...     

A Behavioral Model of MEMS Convective Accelerometers for the Evaluation of Design and Calibration Strategies at System Level

This paper presents a behavioral model that can be used to improve the manufacturability of systems based on MEMS convective sensors. This model permits to handle faults related to process scattering, taking into account not only the electrical and lateral geometrical parameters but also the influence of the cavity depth. Moreover correlations between conductive and convective phenomena are included. The model is validated with respect to FEM simulations and a very good agreement is obtained between the behavioral model and FEM results. The proposed model can then be used in system-level simulations, for instance to evaluate the impact of process scattering on the performances of the sensing part and/or to investigate different design and calibration strategies with respect to the system robustness.     

EPEC: an efficient privacy-preserving energy consumption scheme for smart grid communications

In this paper, we propose an efficient privacy-preserving energy consumption scheme with updating certificates, called EPEC, for secure smart grid communications. Specifically, the proposed EPEC scheme consists of four phases: gateways initialization, party registration, privacy-preserving energy consumption, and updating certificates. Based on the bilinear pairing, the identity-based encryption, and the strategy of updating certificates, EPEC can achieve data privacy, gateway privacy, and is robust to data replay attack, availability attack, modification attack, man-in-the-middle attack, and Sybil attack. Through extensive performance evaluations, we demonstrate the effectiveness of EPEC in terms of transmission delay performance at the HAN gateway and average delivery ratio, by implementing three types of curves including, the Barreto–Naehrig curve with modulus 256 bits, the Kachisa–Schaefer–Scott curve with modulus 512 bits, and the Barreto–Lynn–Scott curve with modulus 640 bits.     

Towards SoC Validation Through Prototyping: A Systematic Approach Based on Reconfigurable Platform

Hardware/software covalidation is becoming one of the most critical issues in current System-on-Chip (SoC) design. Nowadays, covalidation is usually performed by cosimulation which is slow and lacks accuracy. The other alternative is to build a hardware prototype specific to the application. However, this alternative is expensive in terms of time, man-power, and cost. As SoCs increase in complexity, validation becomes more and more difficult, time consuming and error prone. Thus, a new approach for covalidation is inescapable. In this paper, we present a novel efficient prototyping approach for complex SoC covalidation. The proposed approach enables systematic prototyping of embedded applications on a reconfigurable platform. The process starts from the RT level model of the application. The application and the reconfigurable platform have to be adapted to obtain the prototype. We decompose the prototyping process into four steps, in order to match the application and the platform. Besides, we propose adapted solutions to deal with constraints typically encountered in existing reconfigurable platforms. The main advantages of this method are: fast and accurate validation, systematic prototyping flow, and large application field. Prototyping of a subset of VDSL using the ARM Integrator platform illustrates the effectiveness of our approach.     

Semi-supervised superpixel classification for medical images segmentation: application to detection of glaucoma disease

Glaucoma is a disease characterized by damaging the optic nerve head, this can result in severe vision loss. An early detection and a good treatment provided by the ophthalmologist are the keys to preventing optic nerve damage and vision loss from glaucoma. Its screening is based on the manual optic cup and disc segmentation to measure the vertical cup to disc ratio (CDR). However, obtaining the regions of interest by the expert ophthalmologist can be difficult and is often a tedious task. In most cases, the unlabeled images are more numerous than the labeled ones.We propose an automatic glaucoma screening approach named Super Pixels for Semi-Supervised Segmentation “SP3S”, which is a semi-supervised superpixel-by-superpixel classification method, consisting of three main steps. The first step has to prepare the labeled and unlabeled data, applying the superpixel method and bringing in an expert for the labeling of superpixels. In the second step, We incorporate prior knowledge of the optic cup and disc by including color and spatial information. In the final step, semi-supervised learning by the Co-forest classifier is trained only with a few number of labeled superpixels and a large number of unlabeled superpixels to generate a robust classifier. For the estimation of the optic cup and disc regions, the active geometric shape model is used to smooth the disc and cup boundary for the calculation of the CDR. The obtained results for glaucoma detection, via an automatic cup and disc segmentation, established a potential solution for glaucoma screening. The SP3S performance shows quantitatively and qualitatively similar correspondence with the expert segmentation, providing an interesting tool for semi-automatic recognition of the optic cup and disc in order to achieve a medical progress of glaucoma disease.     

Scheduling with accurate communication delay model and scheduler implementation for multiprocessor system-on-chip

In multiprocessor system-on-chip, tasks and communications should be scheduled carefully since their execution order affects the performance of the entire system. When we implement an MPSoC according to the scheduling result, we may find that the scheduling result is not correct or timing constraints are not met unless it takes into account the delays of MPSoC architecture. The unexpected scheduling results are mainly caused from inaccurate communication delays and or runtime scheduler’s overhead. Due to the big complexity of scheduling problem, most previous work neglects the inter-processor communication, or just assumes a fixed delay proportional to the communication volume, without taking into consideration subtle effects like the communication congestion and synchronization delay, which may change dynamically throughout tasks execution. In this paper, we propose an accurate scheduling model of hardware/software communication architecture to improve timing accuracy by taking into account the effects of dynamic software synchronization and detailed hardware resource constraints such as communication congestion and buffer sharing. We also propose a method for runtime scheduler implementation and consider its performance overhead in scheduling. In particular, we introduce efficient hardware and software scheduler architectures. Furthermore, we address the issue of centralized implementation versus distributed implementation of the schedulers. We investigate the pros and cons of the two different scheduler implementations. Through experiments with significant demonstration examples, we show the effectiveness of the proposed approach.