Online video games drive a multi-billion dollar industry dedicated to maintaining a competitive and enjoyable experience for players. Traditional cheat detection systems struggle when facing new exploits or sophisticated fraudsters. More advanced solutions based on machine learning are more adaptive but rely heavily on in-game data, which means that each game has to develop its own cheat detection system. In this work, we propose a novel approach to cheat detection that doesn't require in-game data. Firstly, we treat the multimodal interactions between the player and the platform as multivariate time series. We then use convolutional neural networks to classify these time series as corresponding to legitimate or fraudulent gameplay. Our models achieve an average accuracy of respectively 99.2% and 98.9% in triggerbot and aimbot (two widespread cheats), in an experiment to validate the system's ability to detect cheating in players never seen before. Because this approach is based solely on player behavior, it can be applied to any game or input method, and even various tasks related to modeling human activity.

Multimedia content production is nowadays widespread due to technological advances, namely supported by smartphones and social media. Although the massive amount of media content brings new opportunities to the industry, it also obfuscates the relevance of marketing content, meant to maintain and lure new audiences. This leads to an emergent necessity of producing these kinds of contents as quickly and engagingly as possible. Creating these automatically would decrease both the production costs and time, particularly by using static media for the creation of short storytelling animated clips. We propose an innovative approach that uses context and content information to transform a still photo into an appealing context-aware video clip. Thus, our solution presents a contribution to the state-of-the-art in computer vision and multimedia technologies and assists content creators with a value-added service to automatically build rich contextualized multimedia stories from single photographs.

MOTIVATION: With the development of droplet based systems, massive single cell transcriptome data has become available, which enables analysis of cellular and molecular processes at single cell resolution and is instrumental to understanding many biological processes. While state-of-the-art clustering methods have been applied to the data, they face challenges in the following aspects: (i) the clustering quality still needs to be improved; (ii) most models need prior knowledge on number of clusters, which is not always available; (iii) there is a demand for faster computational speed. RESULTS: We propose to tackle these challenges with Parallelized Split Merge Sampling on Dirichlet Process Mixture Model (the Para-DPMM model). Unlike classic DPMM methods that perform sampling on each single data point, the split merge mechanism samples on the cluster level, which significantly improves convergence and optimality of the result. The model is highly parallelized and can utilize the computing power of high performance computing (HPC) clusters, enabling massive inference on huge datasets. Experiment results show the model outperforms current widely used models in both clustering quality and computational speed. AVAILABILITY AND IMPLEMENTATION: Source code is publicly available on https://github.com/tiehangd/Para_DPMM/tree/master/Para_DPMM_package. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

Technological advances are pushing into the mass market innovative wearable devices featuring increasing processing and sensing capacity, non-intrusiveness and ubiquitous use. Sensors built-in those devices, enable acquiring different types of data and by taking advantage of the available processing power, it is possible to run intelligent applications that process the sensed data to offer added-value to the user in multiple domains. Although not new to the modern society, it is unquestionable that the present exercise boom is rapidly spreading across all age groups. However, in a great majority of cases, people perform their physical activity on their own, either due to time or budget constraints and may easily get discouraged if they do not see results or perform exercises inadequately. This paper presents an application, running on a wearable device, aiming at operating as a personal trainer that validates a set of proposed exercises in a sports session. The developed solution uses inertial sensors of an Android Wear smartwatch and, based on a set of pattern recognition algorithms, detects the rate of success in the execution of a planned workout. The fact that all processing can be executed on the device is a differentiator factor to other existing solutions.

A botnet consists of a network of computers that run a special software that allows a third-party to remotely control them. This characteristic presents a major issue regarding security in the Internet. Although common malicious software infect the network with almost immediate visible consequences, there are cases where that software acts stealthy without direct visible effects on the host machine. This is the normal case of botnets. However, not always the bot software is created and used for illicit purposes. There is a need for further exploring the concepts behind botnets and network security. For this purpose, this paper presents and discusses an educational tool that consists of an open-source botnet software kit with built-in functionalities. The tool enables anyone with some computer technical knowledge, to experiment and find out how botnets work and can be changed and adapted to a variety of useful applications, such as introducing and exemplifying security and distributed systems' concepts.

BACKGROUND: One of the greatest challenges in Metabolic Engineering is to develop quantitative models and algorithms to identify a set of genetic manipulations that will result in a microbial strain with a desirable metabolic phenotype which typically means having a high yield/productivity. This challenge is not only due to the inherent complexity of the metabolic and regulatory networks, but also to the lack of appropriate modelling and optimization tools. To this end, Evolutionary Algorithms (EAs) have been proposed for in silico metabolic engineering, for example, to identify sets of gene deletions towards maximization of a desired physiological objective function. In this approach, each mutant strain is evaluated by resorting to the simulation of its phenotype using the Flux-Balance Analysis (FBA) approach, together with the premise that microorganisms have maximized their growth along natural evolution. RESULTS: This work reports on improved EAs, as well as novel Simulated Annealing (SA) algorithms to address the task of in silico metabolic engineering. Both approaches use a variable size set-based representation, thereby allowing the automatic finding of the best number of gene deletions necessary for achieving a given productivity goal. The work presents extensive computational experiments, involving four case studies that consider the production of succinic and lactic acid as the targets, by using S. cerevisiae and E. coli as model organisms. The proposed algorithms are able to reach optimal/near-optimal solutions regarding the production of the desired compounds and presenting low variability among the several runs. CONCLUSION: The results show that the proposed SA and EA both perform well in the optimization task. A comparison between them is favourable to the SA in terms of consistency in obtaining optimal solutions and faster convergence. In both cases, the use of variable size representations allows the automatic discovery of the approximate number of gene deletions, without compromising the optimality of the solutions.

In metabolic engineering it is difficult to identify which set of genetic manipulations will result in a microbial strain that achieves a desired production goal, due to the complexity of the metabolic and regulatory cellular networks and to the lack of appropriate modeling and optimization tools. In this work, evolutionary algorithms (EAs) are proposed for the optimization of the set of gene deletions to apply to a microorganism, in order to maximize a given objective function. Each mutant strain is evaluated by resorting to the simulation of its phenotype using the flux-balance analysis approach, together with the premise that microorganisms have maximized their growth along natural evolution. A new set based representation is used in the EAs, using variable size chromosomes, allowing for the automatic discovery of the optimal number of gene deletions. This approach was compared with a traditional binary-based genetic algorithm. Two case studies are presented considering the production of succinic and lactic acid as the target, with the bacterium E. coli. The variable size EAs, outperformed the other approaches tested, allowing to reach good results regarding the production of the desired compounds, and additionally presenting low variability among the several runs