Synthesis,Structure Characterization and Biological Activity of Co (II), Cu (II), and Zn (II) Complexes with (Z)‐3‐((3‐hydroxybenzylidene)amino)pyridin‐1‐ium 4‐(dodecan‐4‐yl)benzenesulfonate Surfactant

(Z)‐3‐((3‐hydroxybenzylidene)amino)pyridin‐1‐ium4‐dodecylbenzenesulfonate anionic surfactant and its cobalt, copper and zinc complexes were synthesized (I, I‐Co, I‐Cu and I‐Zn). The chemical structures of it were characterized by elemental analysis, FTIR, ¹H‐NMR, UV–Vis spectroscopy and atomic adsorption. The effects of the chemical structures of the synthesized anionic surfactant and the type of transition metals on the surface activity are presented in this paper. The thermodynamic parameters show that adsorption and micellization processes are spontaneous. The results of biological activity measurements showed that the synthesized compounds have a great efficiency against gram positive (Bacillus subtilis and Staphylococcus aureus), gram‐ negative bacteria (Pseudomonas aeruginosa and Escherichia coli) and fungi (Candida albicans and Aspergillus niger) as well as the sulfate reducing bacteria (Desulfomonas pigra). The complexation of the anionic surfactant with Co²⁺, Cu²⁺ and Zn²⁺ increase the antimicrobial activity values.     

Implementation and experimental performance evaluation of a hybrid interrupt-handling scheme

The performance of network hosts can be severely degraded when subjected to heavy traffic of today’s Gigabit networks. This degradation occurs as a result of the interrupt overhead associated with the high rate of packet arrivals. NAPI, a packet reception mechanism integrated into the latest version of Linux networking subsystem, was designed to improve Linux performance to suit today’s Gigabit traffic. NAPI is definitely a major step up from earlier reception mechanisms; however, NAPI has shortcomings and its performance can be further enhanced. A hybrid interrupt-handling scheme, which was recently proposed in Salah et al. [K. Salah, K. El-Badawi, F. Haidari, Performance Analysis and Comparison of Interrupt-Handling Schemes in Gigabit Networks, International Journal of Computer Communications, Elsevier, Amsterdam 30 (17) (2007) 3425–3441], can better improve the performance of Gigabit network hosts. The hybrid scheme switches between interrupt disabling–enabling (DE) and polling (NAPI). In this paper, we present and discuss major changes required to implement such a hybrid scheme in the latest version of Linux kernel 2.6.15. We prove experimentally that the hybrid scheme can significantly improve the performance of general-purpose network desktops or servers running network I/O-bound applications, when subjecting such network hosts to both light and heavy traffic load conditions. The performance is measured and analyzed in terms of throughput, packet loss, latency, and CPU availability.     

Sampling‐based hierarchical motion planning for a reconfigurable wheel‐on‐leg planetary analogue exploration rover

Reconfigurable mobile planetary rovers are versatile platforms that may safely traverse cluttered environments by morphing their physical geometry. Planning paths for these adaptive robots is challenging due to their many degrees of freedom, and the need to consider potentially continuous platform reconfiguration along the length of the path. We propose a novel hierarchical structure for asymptotically optimal (AO) sampling‐based planners and specifically apply it to the state‐of‐the‐art Fast Marching Tree (FMT*) AO planner. Our algorithm assumes a decomposition of the full configuration space into multiple subspaces, and begins by rapidly finding a set of paths through one such subspace. This set of solutions is used to generate a biased sampling distribution, which is then explored to find a solution in the full configuration space. This technique provides a novel way to incorporate prior knowledge of subspaces to efficiently bias search within existing AO sampling‐based planners. Importantly, probabilistic completeness and asymptotic optimality are preserved. Experimental results in simulation are provided that benchmark the algorithm against state‐of‐the‐art sampling‐based planners without the hierarchical variation. Additional experimental results performed with a physical wheel‐on‐leg platform demonstrate application to planetary rover mobility and showcase how constraints such as actuator failures and sensor pointing may be easily incorporated into the planning problem. In minimizing an energy objective that combines an approximation of the mechanical work required for platform locomotion with that required for reconfiguration, the planner produces intuitive behaviors where the robot dynamically adjusts its footprint, varies its height, and clambers over obstacles using legged locomotion. These results illustrate the generality of the planner in exploiting the platform's mechanical ability to fluidly transition between various physical geometric configurations, and wheeled/legged locomotion modes, without the need for predefined configurations.     

An Efficient Path Planning and Control Algorithm for RUAV’s in Unknown and Cluttered Environments

This paper presents an efficient planning and execution algorithm for the navigation of an autonomous rotary wing UAV (RUAV) manoeuvering in an unknown and cluttered environment. A Rapidly-exploring Random Tree (RRT) variant is used for the generation of a collision free path and linear Model Predictive Control(MPC) is applied to follow this path. The guidance errors are mapped to the states of the linear MPC structure by using the nonlinear kinematic equations. The proposed path planning algorithm considers the run time of the planning stage explicitly and generates a continuous curvature path whenever replanning occurs. Simulation results show that the RUAV with the proposed methodology successfully achieves autonomous navigation regardless of its lack of prior information about the environment.     

Special Issue on Generating Realistic Visual Data of Human Behavior

International Journal of Computer Vision -     

Mapping the IEC 62264 models onto the Zachman framework for analysing products information traceability: a case study

In order to face new regulation directives regarding the environment and also for improving their customer relationship, enterprises have to increasingly be more able to manage their product information during the entire lifecycle. One of the objectives among others in this paper is to deal with product traceability along the product lifecycle. To meet this objective, the information system has to be designed and, further built in such a way all information regarding products is recorded. The IEC 62264 standards define generic logical models for exchanging product and process information between business and manufacturing levels of enterprise applications. Thus, it can be a base for product information traceability. However, its complexity comes from the fact it mixes conceptual and implementation details while no methodology exists that defines how to instantiate it. Product traceability is then needed to increase its abstraction level in order to concentrate on its concepts and managing its application by providing a methodology for its instantiation. In this paper, we propose to map the IEC 62264 standard models to a particular view of Zachman framework in order to make the framework concrete as a guideline for applying the standard and for providing the key players in information systems design with a methodology to use the standard for traceability purposes.     

Data stream classification with novel class detection: a review,comparison and challenges

Knowledge and Information Systems - Developing effective and efficient data stream classifiers is challenging for the machine learning community because of the dynamic nature of data streams. As a...     

A Model for Incident Tickets Correlation in Network Management

In Information Technology Service Management (ITSM), network management teams typically use an Incident Ticket System (ITS) as a tool to track, troubleshoot, and coordinate the resolution of network incidents that occur during the daily operation of the network. A well organized ITS may positively impact on the efficiency of the incident management process. Nevertheless, in many cases the handling of tickets by the management team is not completely systematic and may be incoherent and inefficient. This way, irrelevant or redundant tickets for the same incident may be issued, thus creating a redundancy in the system that leads to inefficiencies. In this paper, we suggest a model aimed to correlate redundant tickets in order to reduce the information to a single ticket per incident. We validate the proposed correlation model by evaluating it with two datasets taken from a real ticketing system of a telecommunications network company. Using this model as a basis, we also develop and evaluate a methodology that assesses the efficiency of the management team during the process of tickets creation and management. Based on it, we also get some insights on the performance of the different management groups involved in the ticket creation process. These analyses can be leveraged for improving both the management groups functioning and the policies for the tickets’ creation.