From proprietary to open source—Growing an open source ecosystem

In today's business and software arena, Free/Libre/Open Source Software has emerged as a promising platform for software ecosystems. Following this trend, more and more companies are releasing their proprietary software as open source, forming a software ecosystem of related development projects complemented with a social ecosystem of community members. Since the trend is relatively recent, there are few guidelines on how to create and maintain a sustainable open source ecosystem for a proprietary software. This paper studies the problem of building open source communities for industrial software that was originally developed as closed source. Supporting processes, guidelines and best practices are discussed and illustrated through an industrial case study. The research is paving the road for new directions in growing a thriving open source ecosystem.     

Towards automated visual surveillance using gait for identity recognition and tracking across multiple non-intersecting cameras

Despite the fact that personal privacy has become a major concern, surveillance technology is now becoming ubiquitous in modern society. This is mainly due to the increasing number of crimes as well as the essential necessity to provide secure and safer environment. Recent research studies have confirmed now the possibility of recognizing people by the way they walk i.e. gait. The aim of this research study is to investigate the use of gait for people detection as well as identification across different cameras. We present a new approach for people tracking and identification between different non-intersecting un-calibrated stationary cameras based on gait analysis. A vision-based markerless extraction method is being deployed for the derivation of gait kinematics as well as anthropometric measurements in order to produce a gait signature. The novelty of our approach is motivated by the recent research in biometrics and forensic analysis using gait. The experimental results affirmed the robustness of our approach to successfully detect walking people as well as its potency to extract gait features for different camera viewpoints achieving an identity recognition rate of 73.6 % processed for 2270 video sequences. Furthermore, experimental results confirmed the potential of the proposed method for identity tracking in real surveillance systems to recognize walking individuals across different views with an average recognition rate of 92.5 % for cross-camera matching for two different non-overlapping views.     

Performance analysis for automated gait extraction and recognition in multi-camera surveillance

Many studies have confirmed that gait analysis can be used as a new biometrics. In this research, gait analysis is deployed for people identification in multi-camera surveillance scenarios. We present a new method for viewpoint independent markerless gait analysis that does not require camera calibration and works with a wide range of walking directions. These properties make the proposed method particularly suitable for gait identification in real surveillance scenarios where people and their behaviour need to be tracked across a set of cameras. Tests on 300 synthetic and real video sequences, with subjects walking freely along different walking directions, have been performed. Since the choice of the cameras’ characteristics is a key-point for the development of a smart surveillance system, the performance of the proposed approach is measured with respect to different video properties: spatial resolution, frame-rate, data compression and image quality. The obtained results show that markerless gait analysis can be achieved without any knowledge of camera’s position and subject’s pose. The extracted gait parameters allow recognition of people walking from different views with a mean recognition rate of 92.2% and confirm that gait can be effectively used for subjects’ identification in a multi-camera surveillance scenario.     

Numerical investigation of a flexible slider–crank mechanism with multijoints with clearance

This paper aims to study the dynamic behavior of a slider–crank mechanism with flexible components and a multijoint clearance. A numerical investigation was developed for this objective. The mechanism model used for the simulation tests has been performed under MSC ADAMS software using the contact force under the “Impact-function” library. The obtained results illustrate that the mechanism performance is more significantly influenced with multiple joints with clearance. Three contact modes are involved: (i) a continuous contact motion, (ii) a free motion, and (iii) an impact motion. Numerical outcomes prove that the clearance dimension and location have a determinant effect on the slider responses precision. The mechanism reliability decay and a random overall behavior govern the dynamic response along the free flight mode.     

Solid Lipid Nanoparticle-Based Calix[n]arenes and Calix-Resorcinarenes as Building Blocks: Synthesis,Formulation and Characterization

Solid lipid nanoparticles (SLNs) have attracted increasing attention during recent years. This paper presents an overview about the use of calix[n]arenes and calix-resorcinarenes in the formulation of SLNs. Because of their specific inclusion capability both in the intraparticle spaces and in the host cavities as well as their capacity for functionalization, these colloidal nanostructures represent excellent tools for the encapsulation of different active pharmaceutical ingredients (APIs) in the area of drug targeting, cosmetic additives, contrast agents, etc. Various synthetic routes to the supramolecular structures will be given. These various routes lead to the formulation of the corresponding SLNs. Characterization, properties, toxicological considerations as well as numerous corresponding experimental studies and analytical methods will be also exposed and discussed.     

Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times

In this article, we consider a single-machine scheduling problem with one unavailability period, with the aim of minimizing the weighted sum of the completion times. We propose three exact methods for solving such a problem: a branch-and-bound method based on new properties and lower bounds, a mixed integer programming model, and a dynamic programming method. These methods were coded and tested on randomly generated instances, and their performances were analyzed. Our numerical experiments show that the branch-and-bound method and the dynamic programming method are complementary. Using these approaches, we are able to solve problems with up to 3000 jobs within a reasonable computation time.     

Camera calibration using court models for real-time augmenting soccer scenes

In this paper, we present a procedure to estimate the position, orientation and focal length of a camera in a soccer field. These parameters are then used in real-time overlay of graphics on a soccer pitch. The method uses court model composed by arcs and lines. A means of automatically initializing the tracking process is also presented which uses Hough transform with a combination of a non-linear least squares optimization method. For the tracking of camera parameters, two cases arise: the center of the pitch and the 18 m area. A combination of automatic court model recognition with the Kanade-Lucas-Tomasi (KLT) algorithm is also used.     

Implementation of ISO 22000 in cereal food industry “SMID” in Tunisia

Cereal products (flour and semolina) are of great importance in the Tunisian diet. Over one million tons of cereal (soft and hard wheat) are consumed a year. Bread, pasta and couscous are the main forms of cereal consumption providing more than 70% of dietary proteins. The SMID, a wheat grinding company has implemented the ISO 22000 system involving essentially the prerequisite programs (PRPs) and the HACCP principals. The objective of this study is to determine food safety practices and procedures related to the food safety management system (ISO 22000). The PRPs were identified to prepare for the HACCP.     

Analysis of a discrete time table polling system with MAP input and time‐limited service discipline

An iterative procedure based on the MAP/PH/1 and MAP/PH/1/K queues with vacation is presented for approximating the performance measures of a table polling system. Each queue has a time limit after which it relinquishes the server. This is formally known as the token holding time (THT) in IEEE 802.5 and IEEE 802.4 standards. The polling table can be tailored such that queues with limits on the cycle time are visited more frequently, thus, limiting the delays for real time applications. The visit period and vacation period distributions were obtained based on the properties of the discrete phase distribution. Several examples are presented and they show that the algorithm converges fairly fast and gives reasonable results. This revised version was published online in June 2006 with corrections to the Cover Date.     

Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval

In a recent paper [Theoretical Computer Science 363, 257–265], He, Zhong and Gu considered the non-resumable case of the scheduling problem with a fixed non-availability interval under the non-resumable scenario. They proposed a polynomial time approximation scheme (PTAS) to minimize the total completion time.In this paper, we propose a fully polynomial-time approximation scheme to minimize the total weighted completion time. The FPTAS has O(n²/ε²) time complexity, where n is the number of jobs and ε is the required error bound. The proposed FPTAS outperforms all the previous approximation algorithms designed for this problem and its running time is strongly polynomial.