A finite volume–finite difference method with a stiff ordinary differential equation solver for advection–diffusion–reaction equation

A model for atmospheric pollutant transport is proposed considering an advection–diffusion–reaction equation. A splitting method is used to decouple the advection, diffusion and reaction parts. A scheme based on finite volume, finite difference and backward differentiation formula is used for solving an atmospheric transport-chemistry problem.     

Predicting teamwork results from social network analysis

Modelling students' behaviours has reached a status that can only be overcome by improving the ability of predicting the results on teamwork. Indeed, teamwork is an important piece on the learning process, but understanding their mechanisms and predicting the results achieved is far from being solved by traditional classifiers. In this paper, we address the problem of predicting teamwork results, and propose a recommender system that suggests new teams, in the context of a given curricular unit. Any student, who is looking for a team, may use the system; in particular, he may ask for the best team to join, either considering all available colleagues or just the set of his previous teammates. Our system makes use of social network analysis and classification methods as the algorithmic core of the decision‐making process. System evaluation is presented through a set of experimental results, which report the performance of social network analysis and classification algorithms over real datasets.     

Factors influencing the decision to crowdsource: A systematic literature review

Crowdsourcing is currently attracting much attention from organisations for its competitive advantages over traditional work structures regarding how to utilise skills and labour and especially to harvest expertise and innovation. Prior research suggests that the decision to crowdsource cannot simply be based on perceived advantages; rather multiple factors should be considered. However, a structured account and integration of the most important decision factors is still lacking. This research fills the gap by providing a systematic literature review of the decision to crowdsource. Our results identify nine factors and sixteen sub-factors influencing this decision. These factors are structured into a decision framework concerning task, people, management, and environmental factors. Based on this framework, we give several recommendations for managers making the crowdsourcing decision.     

A two‐step control approach for docking of autonomous underwater vehicles

This paper presents a novel integrated guidance and control strategy for docking of autonomous underwater vehicles. The approach to the base, and hence the control design, is divided in two steps: (i) in the first, at higher speed, the vehicle dynamics is assumed to be underactuated, and an appropriate control law is derived to steer the vehicle towards the final docking path, achieving convergence to zero of the appropriate error variables for almost all initial conditions; (ii) in the second stage, at low speed, the vehicle is assumed to be fully actuated, and a robust control law is designed that achieves convergence to zero of the appropriate error variables for all initial conditions, in the presence of parametric model uncertainty. Simulations are presented illustrating the performance of the proposed controllers, including model uncertainty and sensor noise. Copyright © 2014 John Wiley & Sons, Ltd.     

A globally asymptotically stabilizing trajectory tracking controller for fully actuated rigid bodies using landmark‐based information

In this paper, we address the problem of designing a control law based on sensor measurements that provides global asymptotic stabilization to a reference trajectory defined on the . The proposed control law is a function of the angular velocity, of vector measurements characterizing the position of some given landmarks, and of their rate of change. We provide sufficient conditions for the existence of synergistic potential functions on SO(3) which are pivotal in the generation of a suitable hybrid control law. We also provide sufficient conditions on the geometry of the landmarks to solve the given problem. Finally, the proposed solution is simulated and compared with a continuous feedback control law. Copyright © 2014 John Wiley & Sons, Ltd.     

Optimizing content placement in a peer-assisted VoD architecture

Recently, a new peer-assisted architecture to build content delivery systems has been presented. This architecture is based on the use of the storage capacity of end-users’ set-top boxes (STBs), connected in a peer-to-peer (P2P) manner in order to help the content servers in the delivery process. In these systems, the contents are usually split into a set of smaller pieces, called sub-streams, which are randomly injected at the STBs. The present paper is focused on Video on Demand (VoD) streaming and it is assumed that the STB-based content delivery system is deployed over the global Internet, where the clients are distributed over different ISP networks. In this scenario, three different strategies are studied for increasing the percentage of data uploaded by peers, in order to offload the content servers as much as possible. First of all, a new mechanism is presented which determines which sub-stream has to be placed at which STB by a Non-Linear Programming (NLP) formulation. A different strategy for reducing the content server load is to take advantage of the available bandwidth in the different ISP networks. In this sense, two new mechanisms for forwarding the VoD requests to different ISP networks are presented. Finally, the present paper also shows that in some situations the available uplink bandwidth is associated with STBs that do not have the required sub-streams. Regarding this concern, a new mechanism has been designed that dynamically re-allocates some streams, which are being transmitted from specific STBs, to different STBs, in order to find the necessary resources to start new streaming sessions.     

Service-Oriented Security Architecture and its Implications for Security Department Organization Structures

ABSTRACT

Cyber-crime and malware has evolved so drastically over the last two years that it is a challenge for an IT professional to stay on top of recent malware trends and technological advances in cyber-security. This paper provides a look from inside the antivirus laboratory at current malware attacks and technology developments for effective defenses.     

Generative face alignment through 2.5D active appearance models

This work addresses the matching of a 3D deformable face model to 2D images through a 2.5D Active Appearance Models (AAM). We propose a 2.5D AAM that combines a 3D metric Point Distribution Model (PDM) and a 2D appearance model whose control points are defined by a full perspective projection of the PDM. The advantage is that, assuming a calibrated camera, 3D metric shapes can be retrieved from single view images. Two model fitting algorithms and their computational efficient approximations are proposed: the Simultaneous Forwards Additive (SFA) and the Normalization Forwards Additive (NFA), both based on the Lucas–Kanade framework. The SFA algorithm searches for shape and appearance parameters simultaneously whereas the NFA projects out the appearance from the error image and searches only for the shape parameters. SFA is therefore more accurate. Robust solutions for the SFA and NFA are also proposed in order to take into account the self-occlusion or partial occlusion of the face. Several performance evaluations for the SFA, NFA and theirs efficient approximations were performed. The experiments include evaluating the frequency of converge, the fitting performance in unseen data and the tracking performance in the FGNET Talking Face sequence. All results show that the 2.5D AAM can outperform both the 2D + 3D combined models and the 2D standard methods. The robust extensions to occlusion were tested on a synthetic sequence showing that the model can deal efficiently with large head rotation.     

Regularized continuous estimation of distribution algorithms

Regularization is a well-known technique in statistics for model estimation which is used to improve the generalization ability of the estimated model. Some of the regularization methods can also be used for variable selection that is especially useful in high-dimensional problems. This paper studies the use of regularized model learning in estimation of distribution algorithms (EDAs) for continuous optimization based on Gaussian distributions. We introduce two approaches to the regularized model estimation and analyze their effect on the accuracy and computational complexity of model learning in EDAs. We then apply the proposed algorithms to a number of continuous optimization functions and compare their results with other Gaussian distribution-based EDAs. The results show that the optimization performance of the proposed RegEDAs is less affected by the increase in the problem size than other EDAs, and they are able to obtain significantly better optimization values for many of the functions in high-dimensional settings.