Query: Evolutionary Cost-sensitive Extreme Learning Machine and Subspace Extension

Relevant passages:
GSA: A Gravitational Search Algorithm <=SEP=> In recent years, various heuristic optimization methods have been developed. Many of these methods are inspired by swarm behaviors in nature. In this paper, a new optimization algorithm based on the law of gravity and mass interactions is introduced. In the proposed algorithm, the searcher agents are a collection of masses which interact with each other based on the Newtonian gravity and the laws of motion. The proposed method has been compared with some well-known heuristic search methods. The obtained results confirm the high performance of the proposed method in solving various nonlinear functions. 2009 Elsevier Inc. All rights reserved.

Large scale metric learning from equivalence constraints <=SEP=> In this paper, we raise important issues on scalability and the required degree of supervision of existing Mahalanobis metric learning methods. Often rather tedious optimization procedures are applied that become computationally intractable on a large scale. Further, if one considers the constantly growing amount of data it is often infeasible to specify fully supervised labels for all data points. Instead, it is easier to specify labels in form of equivalence constraints. We introduce a simple though effective strategy to learn a distance metric from equivalence constraints, based on a statistical inference perspective. In contrast to existing methods we do not rely on complex optimization problems requiring computationally expensive iterations. Hence, our method is orders of magnitudes faster than comparable methods. Results on a variety of challenging benchmarks with rather diverse nature demonstrate the power of our method. These include faces in unconstrained environments, matching before unseen object instances and person re-identification across spatially disjoint cameras. In the latter two benchmarks we clearly outperform the state-of-the-art.

The AR face database <=SEP=> 

Predicting Facial Beauty without Landmarks <=SEP=> A fundamental task in artificial intelligence and computer vision is to build machines that can behave like a human in recognizing a broad range of visual concepts. This paper aims to investigate and develop intelligent systems for learning the concept of female facial beauty and producing human-like predictors. Artists and social scientists have long been fascinated by the notion of facial beauty, but study by computer scientists has only begun in the last few years. Our work is notably different from and goes beyond previous works in several aspects: 1) we focus on fully-automatic learning approaches that do not require costly manual annotation of landmark facial features but simply take the raw pixels as inputs; 2) our study is based on a collection of data that is an order of magnitude larger than that of any previous study; 3) we imposed no restrictions in terms of pose, lighting, background, expression, age, and ethnicity on the face images used for training and testing. These factors significantly increased the difficulty of the learning task. We show that a biologically-inspired model with multiple layers of trainable feature extractors can produce results that are much more human-like than the previously used eigenface approach. Finally, we develop a novel visualization method to interpret the learned model and revealed the existence of several beautiful features that go beyond the current averageness and symmetry hypotheses.

Universal approximation using incremental constructive feedforward networks with random hidden nodes <=SEP=> According to conventional neural network theories, single-hidden-layer feedforward networks (SLFNs) with additive or radial basis function (RBF) hidden nodes are universal approximators when all the parameters of the networks are allowed adjustable. However, as observed in most neural network implementations, tuning all the parameters of the networks may cause learning complicated and inefficient, and it may be difficult to train networks with nondifferential activation functions such as threshold networks. Unlike conventional neural network theories, this paper proves in an incremental constructive method that in order to let SLFNs work as universal approximators, one may simply randomly choose hidden nodes and then only need to adjust the output weights linking the hidden layer and the output layer. In such SLFNs implementations, the activation functions for additive nodes can be any bounded nonconstant piecewise continuous functions g : R --> R and the activation functions for RBF nodes can be any integrable piecewise continuous functions g : R --> R and integral of R g(x)dx not equal to 0. The proposed incremental method is efficient not only for SFLNs with continuous (including nondifferentiable) activation functions but also for SLFNs with piecewise continuous (such as threshold) activation functions. Compared to other popular methods such a new network is fully automatic and users need not intervene the learning process by manually tuning control parameters.

UPTIME: Ubiquitous pedestrian tracking using mobile phones <=SEP=> The mission of tracking a pedestrian is valuable for many applications including walking distance estimation for the purpose of pervasive healthcare, museum and shopping mall guides, and locating emergency responders. In this paper, we show how accurate and ubiquitous tracking of a pedestrian can be performed using only the inertial sensors embedded in his/her mobile phone. Our work depends on performing dead reckoning to track the user's movement. The main challenge that needs to be addressed is handling the noise of the low cost low quality inertial sensors in cell phones. Our proposed system combines two novel contributions: a novel step count estimation technique and a gait-based accurate variable step size detection algorithm. The step count estimation technique is based on a lightweight finite state machine approach that leverages orientation-independent features. In order to capture the varying stride length of the user, based on his changing gait, we employ a multi-class hierarchical Support Vector Machine classifier. Combining the estimated number of steps with the an accurate estimate of the individual stride length, we achieve ubiquitous and accurate tracking of a person in indoor environments. We implement our system on different Android-based phones and compare it to the state-of-the-art techniques in indoor and outdoor testbeds with arbitrary phone orientation. Our results in two different testbeds show that we can provide an accurate step count estimation with an error of 5.72%. In addition, our gait type classifier has an accuracy of 97.74%. This leads to a combined tracking error of 6.9% while depending only on the inertial sensors and turning off the GPS sensor completely. This highlights the ability of the system to provide ubiquitous, accurate, and energy efficient tracking.

Robust Discriminative Response Map Fitting with Constrained Local Models <=SEP=> We present a novel discriminative regression based approach for the Constrained Local Models (CLMs) framework, referred to as the Discriminative Response Map Fitting (DRMF) method, which shows impressive performance in the generic face fitting scenario. The motivation behind this approach is that, unlike the holistic texture based features used in the discriminative AAM approaches, the response map can be represented by a small set of parameters and these parameters can be very efficiently used for reconstructing unseen response maps. Furthermore, we show that by adopting very simple off-the-shelf regression techniques, it is possible to learn robust functions from response maps to the shape parameters updates. The experiments, conducted on Multi-PIE, XM2VTS and LFPW database, show that the proposed DRMF method outperforms state-of-the-art algorithms for the task of generic face fitting. Moreover, the DRMF method is computationally very efficient and is real-time capable. The current MATLAB implementation takes 1 second per image. To facilitate future comparisons, we release the MATLAB code and the pre-trained models for research purposes.

Permission Re-Delegation: Attacks and Defenses <=SEP=> Modern browsers and smartphone operating systems treat applications as mutually untrusting, potentially malicious principals. Applications are (1) isolated except for explicit IPC or inter-application communication channels and (2) unprivileged by default, requiring user permission for additional privileges. Although inter-application communication supports useful collaboration, it also introduces the risk of permission redelegation. Permission re-delegation occurs when an application with permissions performs a privileged task for an application without permissions. This undermines the requirement that the user approve each application’s access to privileged devices and data. We discuss permission re-delegation and demonstrate its risk by launching real-world attacks on Android system applications; several of the vulnerabilities have been confirmed as bugs. We discuss possible ways to address permission redelegation and present IPC Inspection, a new OS mechanism for defending against permission re-delegation. IPC Inspection prevents opportunities for permission redelegation by reducing an application’s permissions after it receives communication from a less privileged application. We have implemented IPC Inspection for a browser and Android, and we show that it prevents the attacks we found in the Android system applications.

Spatio-temporal proximity and social distance: a confirmation framework for social reporting <=SEP=> Social reporting is based on the idea that the members of a location-based social network observe real-world events and publish reports about their observations. Application scenarios include crisis management, bird watching or even some sorts of mobile games. A major issue in social reporting is the quality of the reports. We propose an approach to the quality problem that is based on the reciprocal confirmation of reports by other reports. This contrasts with approaches that require users to verify reports, that is, to explicitly evaluate their veridicality. We propose to use spatio-termporal proximity as a first criterion for confirmation and social distance as a second one. By combining these two measures we construct a graph containing the reports as nodes connected by confirmation edges that can adopt positive as well as negative values. This graph builds the basis for the computation of confirmation values for individual reports by different aggregation measures. By applying our approach to two use cases, we show the importance of a weighted combination, since the meaningfulness of the constituent measures varies between different contexts.

Modeling and Verification of a Six-Phase Interior Permanent Magnet Synchronous Motor <=SEP=> In this paper, a new mathematical modeling for a six-phase interior permanent magnet synchronous motor (IPMSM) is presented. The proposed model utilizes two synchronous reference frames. First, the flux model in the <inline-formula> <tex-math notation="LaTeX">$abcxyz$</tex-math></inline-formula> frame is mapped into the stationary <inline-formula> <tex-math notation="LaTeX">$dq$</tex-math></inline-formula> frames and then to two synchronous rotating frames. Then, differentiating the flux models, voltage equations are derived in rotating frames. Through this analysis, the interaction between the <inline-formula><tex-math notation="LaTeX">$abc$</tex-math></inline-formula> and <inline-formula><tex-math notation="LaTeX">$xyz$</tex-math></inline-formula> subsystems is properly described by a coupling matrix. The torque equation is also derived using the two reference current variables. Flux model was verified through FEM analysis. Experiments were done using a 100 kW six-phase IPMSM in a dynamo system. The validity of the torque equation was checked with some experimental results under a shorted condition on an <inline-formula><tex-math notation="LaTeX">$xyz$</tex-math></inline-formula> subsystem.

Autonomous exploration of motor skills by skill babbling <=SEP=> Autonomous exploration of motor skills is a key capability of learning robotic systems. Learning motor skills can be formulated as inverse modeling problem, which targets at finding an inverse model that maps desired outcomes in some task space, e.g., via points of a motion, to appropriate actions, e.g., motion control policy parameters. In this paper, autonomous exploration of motor skills is achieved by incrementally learning inverse models starting from an initial demonstration. The algorithm is referred to as skill babbling, features sample-efficient learning, and scales to high-dimensional action spaces. Skill babbling extends ideas of goal-directed exploration, which organizes exploration in the space of goals. The proposed approach provides a modular framework for autonomous skill exploration by separating the learning of the inverse model from the exploration mechanism and a model of achievable targets, i.e. the workspace. The effectiveness of skill babbling is demonstrated for a range of motor tasks comprising the autonomous bootstrapping of inverse kinematics and parameterized motion primitives.

NestedNet: Learning Nested Sparse Structures in Deep Neural Networks <=SEP=> Recently, there have been increasing demands to construct compact deep architectures to remove unnecessary redundancy and to improve the inference speed. While many recent works focus on reducing the redundancy by eliminating unneeded weight parameters, it is not possible to apply a single deep network for multiple devices with different resources. When a new device or circumstantial condition requires a new deep architecture, it is necessary to construct and train a new network from scratch. In this work, we propose a novel deep learning framework, called a nested sparse network, which exploits an n-in-1-type nested structure in a neural network. A nested sparse network consists of multiple levels of networks with a different sparsity ratio associated with each level, and higher level networks share parameters with lower level networks to enable stable nested learning. The proposed framework realizes a resource-aware versatile architecture as the same network can meet diverse resource requirements, i.e., anytime property. Moreover, the proposed nested network can learn different forms of knowledge in its internal networks at different levels, enabling multiple tasks using a single network, such as coarse-to-fine hierarchical classification. In order to train the proposed nested network, we propose efficient weight connection learning and channel and layer scheduling strategies. We evaluate our network in multiple tasks, including adaptive deep compression, knowledge distillation, and learning class hierarchy, and demonstrate that nested sparse networks perform competitively, but more efficiently, compared to existing methods.

Marketing actions can modulate neural representations of experienced pleasantness. <=SEP=> Despite the importance and pervasiveness of marketing, almost nothing is known about the neural mechanisms through which it affects decisions made by individuals. We propose that marketing actions, such as changes in the price of a product, can affect neural representations of experienced pleasantness. We tested this hypothesis by scanning human subjects using functional MRI while they tasted wines that, contrary to reality, they believed to be different and sold at different prices. Our results show that increasing the price of a wine increases subjective reports of flavor pleasantness as well as blood-oxygen-level-dependent activity in medial orbitofrontal cortex, an area that is widely thought to encode for experienced pleasantness during experiential tasks. The paper provides evidence for the ability of marketing actions to modulate neural correlates of experienced pleasantness and for the mechanisms through which the effect operates.

Revisiting Batch Normalization For Practical Domain Adaptation <=SEP=> Deep neural networks (DNN) have shown unprecedented success in various computer vision applications such as image classification and object detection. However, it is still a common annoyance during the training phase, that one has to prepare at least thousands of labeled images to fine-tune a network to a specific domain. Recent study (Tommasi et al. 2015) shows that a DNN has strong dependency towards the training dataset, and the learned features cannot be easily transferred to a different but relevant task without finetuning. In this paper, we propose a simple yet powerful remedy, called Adaptive Batch Normalization (AdaBN) to increase the generalization ability of a DNN. By modulating the statistics in all Batch Normalization layers across the network, our approach achieves deep adaptation effect for domain adaptation tasks. In contrary to other deep learning domain adaptation methods, our method does not require additional components, and is parameter-free. It archives stateof-the-art performance despite its surprising simplicity. Furthermore, we demonstrate that our method is complementary with other existing methods. Combining AdaBN with existing domain adaptation treatments may further improve model performance.

Effects of psychological and social factors on organic disease: a critical assessment of research on coronary heart disease. <=SEP=> An extensive research literature in the behavioral sciences and medicine suggests that psychological and social factors may play a direct role in organic coronary artery disease (CAD) pathology. However, many in the medical and scientific community regard this evidence with skepticism. This chapter critically examines research on the impact of psychological and psychosocial factors on the development and outcome of coronary heart disease, with particular emphasis on studies employing verifiable outcomes of CAD morbidity or mortality. Five key variables identified as possible psychosocial risk factors for CAD are addressed: acute and chronic stress, hostility, depression, social support, and socioeconomic status. Evidence regarding the efficacy of psychosocial interventions is also presented. It is suggested that, taken as a whole, evidence for a psychological and social impact on CAD morbidity and mortality is convincing. However, continued progress in this area requires multidisciplinary research integrating expertise in cardiology and the behavioral sciences, and more effective efforts to communicate research findings to a biomedical audience.

Automatic Transliteration of Proper Nouns from Arabic to English <=SEP=> After providing a brief introduction to the transliteration problem, and highlighting some issues specific to Arabic to English translation, a three phase algorithm is introduced as a computational solution to the problem. The algorithm is based on a Hidden Markov Model approach, but also leverages information available in on-line databases. The algorithm is then evaluated, and shown to achieve accuracy approaching 80%.

A glasses-type wearable device for monitoring the patterns of food intake and facial activity <=SEP=> Here we present a new method for automatic and objective monitoring of ingestive behaviors in comparison with other facial activities through load cells embedded in a pair of glasses, named GlasSense. Typically, activated by subtle contraction and relaxation of a temporalis muscle, there is a cyclic movement of the temporomandibular joint during mastication. However, such muscular signals are, in general, too weak to sense without amplification or an electromyographic analysis. To detect these oscillatory facial signals without any use of obtrusive device, we incorporated a load cell into each hinge which was used as a lever mechanism on both sides of the glasses. Thus, the signal measured at the load cells can detect the force amplified mechanically by the hinge. We demonstrated a proof-of-concept validation of the amplification by differentiating the force signals between the hinge and the temple. A pattern recognition was applied to extract statistical features and classify featured behavioral patterns, such as natural head movement, chewing, talking, and wink. The overall results showed that the average F1 score of the classification was about 94.0% and the accuracy above 89%. We believe this approach will be helpful for designing a non-intrusive and un-obtrusive eyewear-based ingestive behavior monitoring system.

A survey of dynamic replication and replica selection strategies based on data mining techniques in data grids <=SEP=> Mining grid data is an interesting research field which aims at analyzing grid systems with data mining techniques in order to efficiently discover new meaningful knowledge to enhance grid management. In this paper, we focus particularly on how extracted knowledge enables enhancing data replication and replica selection strategies which are important data management techniques commonly used in data grids. Indeed, relevant knowledge such as file access patterns, file correlations, user or job access behavior, prediction of future behavior or network performance, and so on, can be efficiently discovered. These findings are then used to enhance both data replication and replica selection strategies. Various works in this respect are then discussed along with their merits and demerits. In addition, we propose a new guideline to data mining application in the context of data replication and replica selection strategies. & 2015 Elsevier Ltd. All rights reserved.

Neural embedding-based indices for semantic search <=SEP=> Traditional information retrieval techniques that primarily rely on keyword-based linking of the query and document spaces face challenges such as the vocabulary mismatch problem where relevant documents to a given query might not be retrieved simply due to the use of different terminology for describing the same concepts. As such, semantic search techniques aim to address such limitations of keyword-based retrieval models by incorporating semantic information from standard knowledge bases such as Freebase and DBpedia. The literature has already shown that while the sole consideration of semantic information might not lead to improved retrieval performance over keyword-based search, their consideration enables the retrieval of a set of relevant documents that cannot be retrieved by keyword-based methods. As such, building indices that store and provide access to semantic information during the retrieval process is important. While the process for building and querying keyword-based indices is quite well understood, the incorporation of semantic information within search indices is still an open challenge. Existing work have proposed to build one unified index encompassing both textual and semantic information or to build separate yet integrated indices for each information type but they face limitations such as increased query process time. In this paper, we propose to use neural embeddings-based representations of term, semantic entity, semantic type and documents within the same embedding space to facilitate the development of a unified search index that would consist of these four information types. We perform experiments on standard and widely used document collections including Clueweb09-B and Robust04 to evaluate our proposed indexing strategy from both effectiveness and efficiency perspectives. Based on our experiments, we find that when neural embeddings are used to build inverted indices; hence relaxing the requirement to explicitly observe the posting list key in the indexed document: (a) retrieval efficiency will increase compared to a standard inverted index, hence reduces the index size and query processing time, and (b) while retrieval efficiency, which is the main objective of an efficient indexing mechanism improves using our proposed method, retrieval effectiveness also retains competitive performance compared to the baseline in terms of retrieving a reasonable number of relevant documents from the indexed corpus. Email addresses: fatemeh.lashkari@unb.ca (Fatemeh Lashkari), bagheri@ryerson.ca (Ebrahim Bagheri), ghorbani@unb.ca (Ali A. Ghorbani) Preprint submitted to Information Processing and Management September 11, 2018

Secure and reconfigurable network design for critical information dissemination in the Internet of battlefield things (IoBT) <=SEP=> The Internet of things (IoT) is revolutionizing the management and control of automated systems leading to a paradigm shift in areas such as smart homes, smart cities, health care, transportation, etc. The IoT technology is also envisioned to play an important role in improving the effectiveness of military operations in battlefields. The interconnection of combat equipment and other battlefield resources for coordinated automated decisions is referred to as the Internet of battlefield things (IoBT). IoBT networks are significantly different from traditional IoT networks due to the battlefield specific challenges such as the absence of communication infrastructure, and the susceptibility of devices to cyber and physical attacks. The combat efficiency and coordinated decision-making in war scenarios depends highly on real-time data collection, which in turn relies on the connectivity of the network and the information dissemination in the presence of adversaries. This work aims to build the theoretical foundations of designing secure and reconfigurable IoBT networks. Leveraging the theories of stochastic geometry and mathematical epidemiology, we develop an integrated framework to study the communication of mission-critical data among different types of network devices and consequently design the network in a cost effective manner.

Deep transfer learning with ontology for image classification <=SEP=> Purely, data-driven large scale image classification has been achieved using various feature descriptors like SIFT, HOG etc. Major milestone in this regards is Convolutional Neural Networks (CNN) based methods which learn optimal feature descriptors as filters. Little attention has been given to the use of domain knowledge. Ontology plays an important role in learning to categorize images into abstract classes where there may not be a clear visual connect between category and image, for example identifying image mood - happy, sad and neutral. Our algorithm combines CNN and ontology priors to infer abstract patterns in Indian Monument Images. We use a transfer learning based approach in which, knowledge of domain is transferred to CNN while training (top down transfer) and inference is made using CNN prediction and ontology tree/priors (bottom up transfer ). We classify images to categories like Tomb, Fort and Mosque. We demonstrate that our method improves remarkably over logistic classifier and other transfer learning approach. We conclude with a remark on possible applications of the model and note about scaling this to bigger ontology.

On Laser Ranging Based on High-Speed/Energy Laser Diode Pulses and Single-Photon Detection Techniques <=SEP=> This paper discusses the construction principles and performance of a pulsed time-of-flight (TOF) laser radar based on high-speed (FWHM ~100 ps) and high-energy (~1 nJ) optical transmitter pulses produced with a specific laser diode working in an “enhanced gain-switching” regime and based on single-photon detection in the receiver. It is shown by analysis and experiments that single-shot precision at the level of 2W3 cm is achievable. The effective measurement rate can exceed 10 kHz to a noncooperative target (20% reflectivity) at a distance of > 50 m, with an effective receiver aperture size of 2.5 cm2. The effect of background illumination is analyzed. It is shown that the gating of the SPAD detector is an effective means to avoid the blocking of the receiver in a high-level background illumination case. A brief comparison with pulsed TOF laser radars employing linear detection techniques is also made.

Visualizing RFM Segmentation <=SEP=> Segmentation based on RFM (Recency, Frequency, and Monetary) has been used for over 50 years by direct marketers to target a subset of their customers, save mailing costs, and improve profits. RFM analysis is commonly performed using the Arthur Hughes method, which bins each of the three RFM attributes independently into five equal frequency bins. The resulting 125 cells are depicted in a tabular format or as bar graphs and analyzed by marketers, who determine the best cells (customer segments) to target. We propose an interactive visualization of RFM that helps marketers visualize and quickly identify important customer segments. Additionally, we show an integrated filtering approach that allows marketers to interactively explore the RFM segments in relation to other customer attributes, such as behavioral or demographic, to identify interesting subsegments in the customer base. We depict these RFM visualizations on two large real-world data sets and discuss how customers have used these visualizations in practice to glean interesting insights from their data. Given, the widespread use of RFM as a critical, and many times the only, segmentation tool, we believe that the proposed intuitive and interactive visualization will provide significant business value.

SLANGZY: a fuzzy logic-based algorithm for English slang meaning selection <=SEP=> The text present on online forums and social media platforms conventionally does not follow a standard sentence structure and uses words that are commonly termed as slang or Internet language. Online text mining involves a surfeit of slang words; however, there is a distinct lack of reliable resources available to find accurate meanings of these words. We aim to bridge this gap by introducing SLANGZY, a fuzzy logic-based algorithm for English slang meaning selection which uses a mathematical factor termed as “slang factor” to judge the accuracy of slang word definitions found in Urban Dictionary, the largest Slang Dictionary on the Internet. This slang factor is used to rank definitions of English slang words retrieved from over 4 million unique words on popular social media platforms such as Twitter, YouTube and Reddit. We investigate the usefulness of SLANGZY over Urban Dictionary to find meanings of slang words in social media text and achieve encouraging results due to recognizing the importance of multiple criteria in the calculation of slang factor in the algorithm over successive experiments. The performance of SLANGZY with optimum weights for each criterion is further assessed using the accuracy, error rate, F-Score as well as a difference factor for English slang word definitions. To further illustrate the results, a web portal is created to display the contents of the Slang Dictionary consisting of definitions ranked according to the calculated slang factors.

Prognostics and Health Management of Industrial Equipment <=SEP=> Prognostics and health management (PHM) is a field of research and application which aims at making use of past, present and future information on the environmental, operational and usage conditions of an equipment in order to detect its degradation, diagnose its faults, predict and proactively manage its failures. The present paper reviews the state of knowledge on the methods for PHM, placing these in context with the different information and data which may be available for performing the task and identifying the current challenges and open issues which must be addressed for achieving reliable deployment in practice. The focus is predominantly on the prognostic part of PHM, which addresses the prediction of equipment failure occurrence and associated residual useful life (RUL).

Constraint-based sequential pattern mining: the pattern-growth methods <=SEP=> Constraints are essential for many sequential pattern mining applications. However, there is no systematic study on constraint-based sequential pattern mining. In this paper, we investigate this issue and point out that the framework developed for constrained frequent-pattern mining does not fit our mission well. An extended framework is developed based on a sequential pattern growth methodology. Our study shows that constraints can be effectively and efficiently pushed deep into the sequential pattern mining under this new framework. Moreover, this framework can be extended to constraint-based structured pattern mining as well.

Bad to the bone: facial structure predicts unethical behaviour. <=SEP=> Researchers spanning many scientific domains, including primatology, evolutionary biology and psychology, have sought to establish an evolutionary basis for morality. While researchers have identified social and cognitive adaptations that support ethical behaviour, a consensus has emerged that genetically determined physical traits are not reliable signals of unethical intentions or actions. Challenging this view, we show that genetically determined physical traits can serve as reliable predictors of unethical behaviour if they are also associated with positive signals in intersex and intrasex selection. Specifically, we identify a key physical attribute, the facial width-to-height ratio, which predicts unethical behaviour in men. Across two studies, we demonstrate that men with wider faces (relative to facial height) are more likely to explicitly deceive their counterparts in a negotiation, and are more willing to cheat in order to increase their financial gain. Importantly, we provide evidence that the link between facial metrics and unethical behaviour is mediated by a psychological sense of power. Our results demonstrate that static physical attributes can indeed serve as reliable cues of immoral action, and provide additional support for the view that evolutionary forces shape ethical judgement and behaviour.

Impact of social media usage on students academic performance in Saudi Arabia <=SEP=> Social media is a popular method for communication amongst university students in Saudi Arabia. However excessive social media use can raise questions about whether academic performance is affected. This research explores this question by conducting a survey on university students in Saudi Arabia in regards to social media usage and their academic performance. The survey also explored which social network is the most popular amongst Saudi students, what students thought about their social media usage and factors besides social media usage which negatively affect academic performance. The survey received 108 responses and descriptive statistics including normality tests i.e. scatter plots were used to examine the relationship between the average number of hours students spent of social media a week and GPA scores of the students. The results demonstrated that there was no linear relationship between social media usage in a week and GPA score. Students highlighted that besides social media use, time management is a factor which affects students ‘studies negatively. The findings of the paper can be used to propose the effective plans for improving the academic performance of the students in such a way that a balance in the leisure, information exchange and academic performance can be maintained. 2014 Elsevier Ltd. All rights reserved.

Patterns of Play: Play-Personas in User-Centred Game Development <=SEP=> In recent years certain trends from User-Centered design have been seeping into the practice of designing computer games. The balance of power between game designers and players is being renegotiated in order to find a more active role for players and provide them with control in shaping the experiences that games are meant to evoke. A growing player agency can turn both into an increased sense of player immersion and potentially improve the chances of critical acclaim. This paper presents a possible solution to the challenge of involving the user in the design of interactive entertainment by adopting and adapting the "persona" framework introduced by Alan Cooper in the field of Human Computer Interaction. The original method is improved by complementing the traditional ethnographic descriptions of personas with parametric, quantitative, data-oriented models of patterns of user behaviour for computer games. Author

Common Consensus : a web-based game for collecting commonsense goals <=SEP=> In our research on Commonsense reasoning, we have found that an especially important kind of knowledge is knowledge about human goals. Especially when applying Commonsense reasoning to interface agents, we need to recognize goals from user actions (plan recognition), and generate sequences of actions that implement goals (planning). We also often need to answer more general questions about the situations in which goals occur, such as when and where a particular goal might be likely, or how long it is likely to take to achieve. In past work on Commonsense knowledge acquisition, users have been directly asked for such information. Recently, however, another approach has emerged—to entice users into playing games where supplying the knowledge is the means to scoring well in the game, thus motivating the players. This approach has been pioneered by Luis von Ahn and his colleagues, who refer to it as Human Computation. Common Consensus is a fun, self-sustaining web-based game, that both collects and validates Commonsense knowledge about everyday goals. It is based on the structure of the TV game show Family Feud1. A small user study showed that users find the game fun, knowledge quality is very good, and the rate of knowledge collection is rapid. ACM Classification: H.3.3 [INFORMATION STORAGE AND RETRIEVAL]: Information Search and Retrieval; I.2.6 [ARTIFICIAL INTELLIGENCE]: Learning