Describing Videos by Exploiting Temporal Structure

Recent progress in using recurrent neural networks (RNNs) for image description has motivated the exploration of their application for video description. However, while images are static, working with videos requires modeling their dynamic temporal structure and then properly integrating that information into a natural language description model. In this context, we propose an approach that successfully takes into account both the local and global temporal structure of videos to produce descriptions. First, our approach incorporates a spatial temporal 3-D convolutional neural network (3-D CNN) representation of the short temporal dynamics. The 3-D CNN representation is trained on video action recognition tasks, so as to produce a representation that is tuned to human motion and behavior. Second we propose a temporal attention mechanism that allows to go beyond local temporal modeling and learns to automatically select the most relevant temporal segments given the text-generating RNN. Our approach exceeds the current state-of-art for both BLEU and METEOR metrics on the Youtube2Text dataset. We also present results on a new, larger and more challenging dataset of paired video and natural language descriptions.


How to Construct Deep Recurrent Neural Networks

In this paper, we explore different ways to extend a recurrent neural network (RNN) to a deep RNN. We start by arguing that the concept of depth in an RNN is not as clear as it is in feedforward neural networks. By carefully analyzing and understanding the architecture of an RNN, however, we find three points of an RNN which may be made deeper; (1) input-to-hidden function, (2) hidden-tohidden transition and (3) hidden-to-output function. Based on this observation, we propose two novel architectures of a deep RNN which are orthogonal to an earlier attempt of stacking multiple recurrent layers to build a deep RNN (Schmidhuber, 1992; El Hihi and Bengio, 1996). We provide an alternative interpretation of these deep RNNs using a novel framework based on neural operators. The proposed deep RNNs are empirically evaluated on the tasks of polyphonic music prediction and language modeling. The experimental result supports our claim that the proposed deep RNNs benefit from the depth and outperform the conventional, shallow RNNs.


A new approach to developing and implementing eager database replication protocols

Database replication is traditionally seen as a way to increase the availability and performance of distributed databases. Although a large number of protocols providing data consistency and fault-tolerance have been proposed, few of these ideas have ever been used in commercial products due to their complexity and performance implications. Instead, current products allow inconsistencies and often resort to centralized approaches which eliminates some of the advantages of replication. As an alternative, we propose a suite of replication protocols that addresses the main problems related to database replication. On the one hand, our protocols maintain data consistency and the same transactional semantics found in centralized systems. On the other hand, they provide flexibility and reasonable performance. To do so, our protocols take advantage of the rich semantics of group communication primitives and the relaxed isolation guarantees provided by most databases. This allows us to eliminate the possibility of deadlocks, reduce the message overhead and increase performance. A detailed simulation study shows the feasibility of the approach and the flexibility with which different types of bottlenecks can be circumvented.


Job performance prediction in a call center using a naive Bayes classifier

This study presents an approach to predict the performance of sales agents of a call center dedicated exclusively to sales and telemarketing activities. This approach is based on a naive Bayesian classifier. The objective is to know what levels of the attributes are indicative of individuals who perform well. A sample of 1037 sales agents was taken during the period between March and September of 2009 on campaigns related to insurance sales and service pre-paid phone services, to build the naive Bayes network. It has been shown that, socio-demographic attributes are not suitable for predicting performance. Alternatively, operational records were used to predict production of sales agents, achieving satisfactory results. In this case, the classifier training and testing is done through a stratified tenfold cross-validation. It classified the instances correctly 80.60% of times, with the proportion of false positives of 18.1% for class no (does not achieve minimum) and 20.8% for the class yes (achieves equal or above minimum acceptable). These results suggest that socio-demographic attributes has no predictive power on performance, while the operational information of the activities of the sale agent can predict the future performance of the


TUCH: Turning Cross-view Hashing into Single-view Hashing via Generative Adversarial Nets

Cross-view retrieval, which focuses on searching images as response to text queries or vice versa, has received increasing attention recently. Crossview hashing is to efficiently solve the cross-view retrieval problem with binary hash codes. Most existing works on cross-view hashing exploit multiview embedding method to tackle this problem, which inevitably causes the information loss in both image and text domains. Inspired by the Generative Adversarial Nets (GANs), this paper presents a new model that is able to Turn Crossview Hashing into single-view hashing (TUCH), thus enabling the information of image to be preserved as much as possible. TUCH is a novel deep architecture that integrates a language model network T for text feature extraction, a generator network G to generate fake images from text feature and a hashing network H for learning hashing functions to generate compact binary codes. Our architecture effectively unifies joint generative adversarial learning and cross-view hashing. Extensive empirical evidence shows that our TUCH approach achieves state-of-the-art results, especially on text to image retrieval, based on imagesentences datasets, i.e. standard IAPRTC-12 and large-scale Microsoft COCO.


Application of Machine Learning Algorithms to an online Recruitment System

In this work, we present a novel approach for evaluating job applicants in online recruitment systems, leveraging machine learning algorithms to solve the candidate ranking problem. An application of our approach is implemented in the form of a prototype system, whose functionality is showcased and evaluated in a real-world recruitment scenario. The proposed system extracts a set of objective criteria from the applicants’ LinkedIn profile, and infers their personality characteristics using linguistic analysis on their blog posts. Our system was found to perform consistently compared to human recruiters; thus, it can be trusted for the automation of applicant ranking and


Aggression in the Laboratory : Problems with the Validity of the Modified Taylor Competitive Reaction Time Test as a Measure of Aggression in Media Violence Studies

Many laboratory studies of aggression use a measure known as the modified Taylor Competitive Reaction Time Test (TCRTT), for which validation studies are lacking. Using sound blasts administered by the participant against a fictional human opponent, the TCRTT also allows for multiple methods of measuring aggression. The validity of the TCRTT was tested in 53 college student participants. Participants took a self-report measure of aggressiveness as well as neuropsychological measures of frontal lobe functioning predictive of aggression. Results were not supportive of the TCRTT’s validity and indicated concerns regarding the use of the TCRTT as a measure of aggression. Results suggest that labaratory studies of media violence using the TCRTT are of questionable validity.


Understanding consumers' continuance intention towards mobile purchase: A theoretical framework and empirical study - A case of China

Although mobile purchase is convenient in the age of mobile commerce, many consumers still do not utilize mobile purchase to its full potential. From the mobile vendor’s perspective, retaining current customers and facilitating their continued purchase are crucial to create profitability and achieve a sustainable development. An understanding of the continuance intention towards mobile purchase can provide insights into mobile vendors’ marketing campaigns. Therefore, it is important to examine the determinants that impact continuance intentions of consumers for mobile purchase. Drawing upon information success model, flow theory and trust, this study proposed and empirically tested an integrated model to better understand the determinants of consumers’ continued intention to purchase on mobile sites. Empirical data from 462 users who had experience with mobile purchase were tested against the proposed research model by using structural equation modelling (SEM). The results indicated that information quality, and privacy and security concerns are the main factors affecting trust, whereas service quality is the main factor affecting flow. System quality, and privacy and security concerns affect satisfaction. Trust affects flow, which in turn affects satisfaction. These three factors together affect continued intention towards mobile purchase. The findings of this study provide several important implications for mobile commerce research and practice. 2015 Elsevier Ltd. All rights reserved.


A Hybrid Word-Character Model for Abstractive Summarization

Automatic abstractive text summarization is an important and challenging research topic of natural language processing. Among many widely used languages, the Chinese language has a special property that a Chinese character contains rich information comparable to a word. Existing Chinese text summarization methods, either adopt totally character-based or word-based representations, fail to fully exploit the information carried by both representations. To accurately capture the essence of articles, we propose a hybrid word-character approach (HWC) which preserves the advantages of both wordbased and character-based representations. We evaluate the advantage of the proposed HWC approach by applying it to two existing methods, and discover that it generates state-of-the-art performance with a margin of 24 ROUGE points on a widely used dataset LCSTS. In addition, we find an issue contained in the LCSTS dataset and offer a script to remove overlapping pairs (a summary and a short text) to create a clean dataset for the community. The proposed HWC approach also generates the best performance on the new, clean LCSTS dataset.


Open Information Extraction with Meta-pattern Discovery in Biomedical Literature

Biomedical open information extraction (BioOpenIE) is a novel paradigm to automatically extract structured information from unstructured text with no or little supervision. It does not require any pre-specified relation types but aims to extract all the relation tuples from the corpus. A major challenge for open information extraction (OpenIE) is that it produces massive surface-name formed relation tuples that cannot be directly used for downstream applications. We propose a novel framework CPIE (Clause+Pattern-guided Information Extraction) that incorporates clause extraction and meta-pattern discovery to extract structured relation tuples with little supervision. Compared with previous OpenIE methods, CPIE produces massive but more structured output that can be directly used for downstream applications. We first detect short clauses from input sentences. Then we extract quality textual patterns and perform synonymous pattern grouping to identify relation types. Last, we obtain the corresponding relation tuples by matching each quality pattern in the text. Experiments show that CPIE achieves the highest precision in comparison with state-of-the-art OpenIE baselines, and also keeps the distinctiveness and simplicity of the extracted relation tuples. CPIE shows great potential in effectively dealing with real-world biomedical literature with complicated sentence structures and rich information.


Tensegrity II. How structural networks influence cellular information processing networks.

The major challenge in biology today is biocomplexity: the need to explain how cell and tissue behaviors emerge from collective interactions within complex molecular networks. Part I of this two-part article, described a mechanical model of cell structure based on tensegrity architecture that explains how the mechanical behavior of the cell emerges from physical interactions among the different molecular filament systems that form the cytoskeleton. Recent work shows that the cytoskeleton also orients much of the cell's metabolic and signal transduction machinery and that mechanical distortion of cells and the cytoskeleton through cell surface integrin receptors can profoundly affect cell behavior. In particular, gradual variations in this single physical control parameter (cell shape distortion) can switch cells between distinct gene programs (e.g. growth, differentiation and apoptosis), and this process can be viewed as a biological phase transition. Part II of this article covers how combined use of tensegrity and solid-state mechanochemistry by cells may mediate mechanotransduction and facilitate integration of chemical and physical signals that are responsible for control of cell behavior. In addition, it examines how cell structural networks affect gene and protein signaling networks to produce characteristic phenotypes and cell fate transitions during tissue development.


Alternating Directions Dual Decomposition

We propose AD, a new algorithm for approximate maximum a posteriori (MAP) inference on factor graphs based on the alternating directions method of multipliers. Like dual decomposition algorithms, AD uses worker nodes to iteratively solve local subproblems and a controller node to combine these local solutions into a global update. The key characteristic of AD is that each local subproblem has a quadratic regularizer, leading to a faster consensus than subgradient-based dual decomposition, both theoretically and in practice. We provide closed-form solutions for these AD subproblems for binary pairwise factors and factors imposing first-order logic constraints. For arbitrary factors (large or combinatorial), we introduce an active set method which requires only an oracle for computing a local MAP configuration, making AD applicable to a wide range of problems. Experiments on synthetic and realworld problems show that AD compares favorably with the state-of-the-art.


Artificial intelligence framework for simulating clinical decision-making: A Markov decision process approach

OBJECTIVE
In the modern healthcare system, rapidly expanding costs/complexity, the growing myriad of treatment options, and exploding information streams that often do not effectively reach the front lines hinder the ability to choose optimal treatment decisions over time. The goal in this paper is to develop a general purpose (non-disease-specific) computational/artificial intelligence (AI) framework to address these challenges. This framework serves two potential functions: (1) a simulation environment for exploring various healthcare policies, payment methodologies, etc., and (2) the basis for clinical artificial intelligence - an AI that can "think like a doctor".

METHODS
This approach combines Markov decision processes and dynamic decision networks to learn from clinical data and develop complex plans via simulation of alternative sequential decision paths while capturing the sometimes conflicting, sometimes synergistic interactions of various components in the healthcare system. It can operate in partially observable environments (in the case of missing observations or data) by maintaining belief states about patient health status and functions as an online agent that plans and re-plans as actions are performed and new observations are obtained. This framework was evaluated using real patient data from an electronic health record.

RESULTS
The results demonstrate the feasibility of this approach; such an AI framework easily outperforms the current treatment-as-usual (TAU) case-rate/fee-for-service models of healthcare. The cost per unit of outcome change (CPUC) was $189 vs. $497 for AI vs. TAU (where lower is considered optimal) - while at the same time the AI approach could obtain a 30-35% increase in patient outcomes. Tweaking certain AI model parameters could further enhance this advantage, obtaining approximately 50% more improvement (outcome change) for roughly half the costs.

CONCLUSION
Given careful design and problem formulation, an AI simulation framework can approximate optimal decisions even in complex and uncertain environments. Future work is described that outlines potential lines of research and integration of machine learning algorithms for personalized medicine.


Seq2seq Fingerprint: An Unsupervised Deep Molecular Embedding for Drug Discovery

Many of today's drug discoveries require expertise knowledge and insanely expensive biological experiments for identifying the chemical molecular properties. However, despite the growing interests of using supervised machine learning algorithms to automatically identify those chemical molecular properties, there is little advancement of the performance and accuracy due to the limited amount of training data. In this paper, we propose a novel unsupervised molecular embedding method, providing a continuous feature vector for each molecule to perform further tasks, e.g., solubility classification. In the proposed method, a multi-layered Gated Recurrent Unit (GRU) network is used to map the input molecule into a continuous feature vector of fixed dimensionality, and then another deep GRU network is employed to decode the continuous vector back to the original molecule. As a result, the continuous encoding vector is expected to contain rigorous and enough information to recover the original molecule and predict its chemical properties. The proposed embedding method could utilize almost unlimited molecule data for the training phase. With sufficient information encoded in the vector, the proposed method is also robust and task-insensitive. The performance and robustness are confirmed and interpreted in our extensive experiments.


Social disconnectedness, perceived isolation, and health among older adults.

Previous research has identified a wide range of indicators of social isolation that pose health risks, including living alone, having a small social network, infrequent participation in social activities, and feelings of loneliness. However multiple forms of isolation are rarely studied together making it difficult to determine which aspects of isolation are most deleterious for health. Using population-based data from the National Social Life, Health, and Aging Project, we combine multiple indicators of social isolation into scales assessing social disconnectedness (e.g., small social network, infrequent participation in social activities) and perceived isolation (e.g., loneliness, perceived lack of social support). We examine the extent to which social disconnectedness and perceived isolation have distinct associations with physical and mental health among older adults. Results indicate that social disconnectedness and perceived isolation are independently associated with lower levels of self-rated physical health. However, the association between disconnectedness and mental health may operate through the strong relationship between perceived isolation and mental health. We conclude that health researchers need to consider social disconnectedness and perceived isolation simultaneously.


FC^4: Fully Convolutional Color Constancy with Confidence-Weighted Pooling

Improvements in color constancy have arisen from the use of convolutional neural networks (CNNs). However, the patch-based CNNs that exist for this problem are faced with the issue of estimation ambiguity, where a patch may contain insufficient information to establish a unique or even a limited possible range of illumination colors. Image patches with estimation ambiguity not only appear with great frequency in photographs, but also significantly degrade the quality of network training and inference. To overcome this problem, we present a fully convolutional network architecture in which patches throughout an image can carry different confidence weights according to the value they provide for color constancy estimation. These confidence weights are learned and applied within a novel pooling layer where the local estimates are merged into a global solution. With this formulation, the network is able to determine what to learn and how to pool automatically from color constancy datasets without additional supervision. The proposed network also allows for end-to-end training, and achieves higher efficiency and accuracy. On standard benchmarks, our network outperforms the previous state-of-the-art while achieving 120x greater efficiency.


Internet addiction among Norwegian adults: a stratified probability sample study.

Most Norwegians are Internet users. We conducted a stratified probability sample study (Norway, 2007, age-group 16-74 years, N= 3,399, response rate 35.3%, 87.1% Internet users) to assess the prevalence of Internet addiction and at-risk Internet use by the Young Diagnostic Questionnaire (YDQ). The prevalence of Internet addiction (YDQ score 5-8) was 1.0% and an additional 5.2% were at-risk Internet users (YDQ score 3-4). Internet addiction and at-risk Internet use was strongly dependent on gender and age with highest prevalences among young males (16-29 years 4.1% and 19.0%, 30-39 years 3.3% and 10.7%). Logistic regression showed that male gender, young age, university level education, and an unsatisfactory financial situation were factors positively associated with "problematic Internet use" (at-risk and addicted use combined). Time spent on the Internet and prevalence of self-reported sleeping disorders, depression, and other psychological impairments increased linearly with YDQ score. Problematic Internet use clearly affects the lives of many people.


Pseudo random number generator and Hash function for embedded microprocessors

Embedded microprocessors are commonly used for future technologies such as Internet of Things(IoT), RFID and Wireless Sensor Networks(WSN). However, the microprocessors have limited computing power and storages so straight-forward implementation of traditional services on resource constrained devices is not recommenced. To overcome this problem, lightweight implementation techniques should be concerned for practical implementations. Among various requirements, security applications should be conducted on microprocessors for secure and robust service environments. In this paper, we presented a light weight implementation techniques for efficient Pseudo Random Number Generator(PRNG) and Hash function. To reduce memory consumption and accelerate performance, we adopted AES accelerator based implementation. This technique is firstly introduced in INDOCRYPT'12, whose idea exploits peripheral devices for efficient hash computations. With this technique, we presented block cipher based light-weight pseudo random number generator and simple hash function on embedded microprocessors.


Shape driven kernel adaptation in Convolutional Neural Network for robust facial trait recognition

One key challenge of facial trait recognition is the large non-rigid appearance variations due to some irrelevant real world factors, such as viewpoint and expression changes. In this paper, we explore how the shape information, i.e. facial landmark positions, can be explicitly deployed into the popular Convolutional Neural Network (CNN) architecture to disentangle such irrelevant non-rigid appearance variations. First, instead of using fixed kernels, we propose a kernel adaptation method to dynamically determine the convolutional kernels according to the spatial distribution of facial landmarks, which helps learning more robust features. Second, motivated by the intuition that different local facial regions may demand different adaptation functions, we further propose a tree-structured convolutional architecture to hierarchically fuse multiple local adaptive CNN subnetworks. Comprehensive experiments on WebFace, Morph II and MultiPIE databases well validate the effectiveness of the proposed kernel adaptation method and tree-structured convolutional architecture for facial trait recognition tasks, including identity, age and gender recognition. For all the tasks, the proposed architecture consistently achieves the state-of-the-art performances.


Story generation after TALE-SPIN

TALE-SPIN, the laat major AI attempt at atory generation, approached the problem of making up atoriea primarily from the perspective of an impartial world simulator. AUTHOR ia a program (under development) which generates atoriea as a creative reaaoner in purauit of her own narrative goals. It is thus intended to aimulate an author's mind aa ahe makes up a story, rather than the world as things happen in it. The four major forces driving the atory generation process, according to the AUTHOR model, are (1) author intentionality, (2) conceptual reformulation, (3) reminding, and (4) the opportunity enhancement metagoal. 1. World Simulation Based Story Generation TALE-SPIN [Meehan, 1976] is a program which made up Aesop-fable-like conceptual atoriea, which it then expressed in natural language. Each atory TALE-SPIN made up waa based on a model of the storyworld, including the characters in it and their goala, peraonalities, and interperaonal relatione. Storiea were apun by working out consequences of the model. Thus, central to TALE-SPIN waa the idea of world simulation. The three levels TALE-SPIN was most concerned with simulating were: 1. character intentionality-e.g., if Joe Bear was hungry, he would try to get something to eat 2. social conatrainta-e.g., if Joe Bear believed Irving Bird to be hia friend, he could aak an outright favor; if Joe Bear believed their relation to be a bit cooler, he would feel obliged to offer something in return (auch aa a worm) 3. phyaical cauaality-e.g., if Irving Bird ate a worm, the worm would cease to exist; after "fooling around", Aa oppoaed to Sheldon Klein's ayetem which only produced atory texts and which ia incapable, in principle, of understanding the atoriea it "makes up" [Klein et el., 1976]. characters felt "wiped out" World simulation, however, fails to reflect the proctaa that an author goes through in making up a atory-storyworlds are developed by authors aa needed, frequently as post hoc justification for eventa that the author has already decided ahe wants as part of the story. As illustration, let us consider the question of why, in the Star Wars aequel, "The Empire Strikes Back", Princess Leia and Solo go to visit Landeau. If one asks a reader (or viewer) this question, the anawer will be along the lines of, "They needed a place to hide from imperial stormtroopers until they got the hyperdrive fixed, and Landeau was an old buddy of Solo's, and ..." • …


A Multimodal Embedded Sensor System for Scalable Robotic and Prosthetic Fingers

The development of dexterous and robust anthropomorphic hands with rich sensor feedback remains a challenging task for both humanoid robotics as well as prosthetics as of today. The design of hands that are scalable in size and equipped with integrated multimodal sensor systems is a key requirement for advanced control schemes and reactive behaviour. In this paper, we present the design of a scalable and low cost robotic finger with a soft fingertip and position, temperature as well as normal and shear force sensors. All cables and sensors are completely enclosed inside the finger to ensure an anthropometric appearance. The finger is modelled based on a 50th percentile male little finger and can be easily adapted to other dimensions in terms of size and sensor system configuration. We describe the design of the sensor system, provide an experimental analysis for the characterization of the different sensor types in terms of sensor range, resolution, creep, spatial response as well as temperature flux.


A Fuzzy-Neural Intelligent Trading Model for Stock Price Prediction

In this paper, Fuzzy logic and Neural Network approaches for predicting financial stock price are investigated. A study of a knowledge based system for stock price prediction is carried out. We explore Trapezoidal membership function method and Sugeno-type fuzzy inference engine to optimize the estimated result. Our model utilizes the performance of artificial neural networks trained using back propagation and supervised learning methods respectively. The system is developed based on the selection of stock data history obtained from Nigerian Stock Exchange in Nigeria, which are studied and used in training the system. A computer simulation is designed to assist the experimental decision for the best control action. The system is developed using MySQL, NetBeans, Java, and MatLab. The experimental result shows that the model has such properties as fast convergence, high precision and strong function approximation ability. It has shown to perform well in the context of various trading strategies involving stocks.


Heterogeneous Feature Selection With Multi-Modal Deep Neural Networks and Sparse Group LASSO

Heterogeneous feature representations are widely used in machine learning and pattern recognition, especially for multimedia analysis. The multi-modal, often also high- dimensional , features may contain redundant and irrelevant information that can deteriorate the performance of modeling in classification. It is a challenging problem to select the informative features for a given task from the redundant and heterogeneous feature groups. In this paper, we propose a novel framework to address this problem. This framework is composed of two modules, namely, multi-modal deep neural networks and feature selection with sparse group LASSO. Given diverse groups of discriminative features, the proposed technique first converts the multi-modal data into a unified representation with different branches of the multi-modal deep neural networks. Then, through solving a sparse group LASSO problem, the feature selection component is used to derive a weight vector to indicate the importance of the feature groups. Finally, the feature groups with large weights are considered more relevant and hence are selected. We evaluate our framework on three image classification datasets. Experimental results show that the proposed approach is effective in selecting the relevant feature groups and achieves competitive classification performance as compared with several recent baseline methods.


On the Margin Theory of Feedforward Neural Networks

Past works have shown that, somewhat surprisingly, over-parametrization can help generalization in neural networks. Towards explaining this phenomenon, we adopt a margin-based perspective. We establish: 1) for multilayer feedforward relu networks, the global minimizer of a weakly-regularized cross-entropy loss has the maximum normalized margin among all networks, 2) as a result, increasing the over-parametrization improves the normalized margin and generalization error bounds for two-layer networks. In particular, an infinite-size neural network enjoys the best generalization guarantees. The typical infinite feature methods are kernel methods; we compare the neural net margin with that of kernel methods and construct natural instances where kernel methods have much weaker generalization guarantees. We validate this gap between the two approaches empirically. Finally, this infinite-neuron viewpoint is also fruitful for analyzing optimization. We show that a perturbed gradient flow on infinite-size networks finds a global optimizer in polynomial time.


Social interaction detection using a multi-sensor approach

In the context of a social gathering, such as a cocktail party, the memorable moments are often captured by professional photographers or the participants. The latter case is generally undesirable because many participants would rather enjoy the event instead of being occupied by the tedious photo capturing task. Motivated by this scenario, we propose an automated social event photo-capture framework for which, given the multiple sensor data streams and the information from the Web as input, will output the visually appealing photos of the social event. Our proposal consists of three components: (1) social attribute extraction from both the physical space and the cyberspace; (2) social attribute fusion; and (3) active camera control. Current work is presented and we conclude with expected contributions as well as future direction.


Psychopaths know right from wrong but don't care.

Adult psychopaths have deficits in emotional processing and inhibitory control, engage in morally inappropriate behavior, and generally fail to distinguish moral from conventional violations. These observations, together with a dominant tradition in the discipline which sees emotional processes as causally necessary for moral judgment, have led to the conclusion that psychopaths lack an understanding of moral rights and wrongs. We test an alternative explanation: psychopaths have normal understanding of right and wrong, but abnormal regulation of morally appropriate behavior. We presented psychopaths with moral dilemmas, contrasting their judgments with age- and sex-matched (i) healthy subjects and (ii) non-psychopathic, delinquents. Subjects in each group judged cases of personal harms (i.e. requiring physical contact) as less permissible than impersonal harms, even though both types of harms led to utilitarian gains. Importantly, however, psychopaths' pattern of judgments on different dilemmas was the same as those of the other subjects. These results force a rejection of the strong hypothesis that emotional processes are causally necessary for judgments of moral dilemmas, suggesting instead that psychopaths understand the distinction between right and wrong, but do not care about such knowledge, or the consequences that ensue from their morally inappropriate behavior.


The role of emotions for moral judgments depends on the type of emotion and moral scenario.

Emotions seem to play a critical role in moral judgment. However, the way in which emotions exert their influence on moral judgments is still poorly understood. This study proposes a novel theoretical approach suggesting that emotions influence moral judgments based on their motivational dimension. We tested the effects of two types of induced emotions with equal valence but with different motivational implications (anger and disgust), and four types of moral scenarios (disgust-related, impersonal, personal, and beliefs) on moral judgments. We hypothesized and found that approach motivation associated with anger would make moral judgments more permissible, while disgust, associated with withdrawal motivation, would make them less permissible. Moreover, these effects varied as a function of the type of scenario: the induced emotions only affected moral judgments concerning impersonal and personal scenarios, while we observed no effects for the other scenarios. These findings suggest that emotions can play an important role in moral judgment, but that their specific effects depend upon the type of emotion induced. Furthermore, induced emotion effects were more prevalent for moral decisions in personal and impersonal scenarios, possibly because these require the performance of an action rather than making an abstract judgment. We conclude that the effects of induced emotions on moral judgments can be predicted by taking their motivational dimension into account. This finding has important implications for moral psychology, as it points toward a previously overlooked mechanism linking emotions to moral judgments.


Gossip in Evolutionary Perspective

Conversation is a uniquely human phenomenon. Analyses of freely forming conversations indicate that approximately two thirds of conversation time is devoted to social topics, most of which can be given the generic label gossip. This article first explores the origins of gossip as a mechanism for bonding social groups, tracing these origins back to social grooming among primates. It then asks why social gossip in this sense should form so important a component of human interaction and presents evidence to suggest that, aside from servicing social networks, a key function may be related explicitly to controlling free riders. Finally, the author reviews briefly the role of social cognition in facilitating conversations of this kind.


Limbic abnormalities in affective processing by criminal psychopaths as revealed by functional magnetic resonance imaging

BACKGROUND
Psychopathy is a complex personality disorder of unknown etiology. Central to the disorder are anomalies or difficulties in affective processing.

METHODS
Functional magnetic resonance imaging was used to elucidate the neurobiological correlates of these anomalies in criminal psychopaths during performance of an affective memory task.

RESULTS
Compared with criminal nonpsychopaths and noncriminal control participants, criminal psychopaths showed significantly less affect-related activity in the amygdala/hippocampal formation, parahippocampal gyrus, ventral striatum, and in the anterior and posterior cingulate gyri. Psychopathic criminals also showed evidence of overactivation in the bilateral fronto-temporal cortex for processing affective stimuli.

CONCLUSIONS
These data suggest that the affective abnormalities so often observed in psychopathic offenders may be linked to deficient or weakened input from limbic structures.


Impairment of social and moral behavior related to early damage in human prefrontal cortex

The long-term consequences of early prefrontal cortex lesions occurring before 16 months were investigated in two adults. As is the case when such damage occurs in adulthood, the two early-onset patients had severely impaired social behavior despite normal basic cognitive abilities, and showed insensitivity to future consequences of decisions, defective autonomic responses to punishment contingencies and failure to respond to behavioral interventions. Unlike adult-onset patients, however, the two patients had defective social and moral reasoning, suggesting that the acquisition of complex social conventions and moral rules had been impaired. Thus early-onset prefrontal damage resulted in a syndrome resembling psychopathy.


Multimodal Classification for Analysing Social Media

Classification of social media data is an important approach in understanding user behavior on the Web. Although information on social media can be of different modalities such as texts, images, audio or videos, traditional approaches in classification usually leverage only one prominent modality. Techniques that are able to leverage multiple modalities are often complex and susceptible to the absence of some modalities. In this paper, we present simple models that combine information from different modalities to classify social media content and are able to handle the above problems with existing techniques. Our models combine information from different modalities using a pooling layer and an auxiliary learning task is used to learn a common feature space. We demonstrate the performance of our models and their robustness to the missing of some modalities in the emotion classification domain. Our approaches, although being simple, can not only achieve significantly higher accuracies than traditional fusion approaches but also have comparable results when only one modality is available.


A Case Study on Quality Attribute Measurement using MARF and GIPSY

This literature focuses on doing a comparative analysis between Modular Audio Recognition Framework (MARF) and the General Intentional Programming System (GIPSY) with the help of different software metrics. At first, we understand the general principles, architecture and working of MARF and GIPSY by looking at their frameworks and running them in the Eclipse environment. Then, we study some of the important metrics including a few state of the art metrics and rank them in terms of their usefulness and their influence on the different quality attributes of a software. The quality attributes are viewed and computed with the help of the Logiscope and McCabe IQ tools. These tools perform a comprehensive analysis on the case studies and generate a quality report at the factor level, criteria level and metrics level. In next step, we identify the worst code at each of these levels, extract the worst code and provide recommendations to improve the quality. We implement and test some of the metrics which are ranked as the most useful metrics with a set of test cases in JDeodorant. Finally, we perform an analysis on both MARF and GIPSY by doing a fuzzy code scan using MARFCAT to find the list of weak and vulnerable classes.


Pair-Wise Temporal Pooling Method for Rapid Training of the HTM Networks Used in Computer Vision Applications

In the paper, several modifications to the conventional learning algorithms of the Hierarchical Temporal Memory (HTM) – a biologically inspired largescale model of the neocortex by Numenta – have been proposed. Firstly, an alternative spatial pooling method has been introduced, which makes use of a random pattern generator exploiting the Metropolis-Hastings algorithm. The original inference algorithm by Numenta has been reformulated, in order to reduce a number of tunable parameters and to optimize its computational efficiency. The main contribution of the paper consists in the proposal of a novel temporal pooling method – the pair-wise explorer – which allows faster and more reliable training of the HTM networks using data without inherent temporal information (e.g., static images). While the conventional temporal pooler trains the HTM network on a finite segment of the smooth Brownian-like random walk across the training images, the 902 S. Štolc, I. Bajla, K. Valent́ın, R. Škoviera proposed method performs training by means of the pairs of patterns randomly sampled (in a special manner) from a virtually infinite smooth random walk. We have conducted a set of experiments with the single-layer HTM network applied to the position, scale, and rotation-invariant recognition of geometric objects. The obtained results provide a clear evidence that the pair-wise method yields significantly faster convergence to the theoretical maximum of the classification accuracy with respect to both the length of the training sequence (defined by the maximum allowed number of updates of the time adjacency matrix – TAM) and the number of training patterns. The advantage of the proposed explorer manifested itself mostly in the lower range of TAM updates where it caused up to 10% relative accuracy improvement over the conventional method. Therefore we suggest to use the pair-wise explorer, instead of the smooth explorer, always when the HTM network is trained on a set of static images, especially when the exhaustive training is impossible due to the complexity of the given task.


Mapping interference resolution across task domains: A shared control process in left inferior frontal gyrus

Work in functional neuroimaging has mapped interference resolution processing onto left inferior frontal regions for both verbal working memory and a variety of semantic processing tasks. The proximity of the identified regions from these different tasks suggests the existence of a common, domain-general interference resolution mechanism. The current research specifically tests this idea in a within-subject design using fMRI to assess the activation associated with variable selection requirements in a semantic retrieval task (verb generation) and a verbal working memory task with a trial-specific proactive interference manipulation (recent-probes). High interference trials on both tasks were associated with activity in the midventrolateral region of the left inferior frontal gyrus, and the regions activated in each task strongly overlapped. The results indicate that an elemental component of executive control associated with interference resolution during retrieval from working memory and from semantic memory can be mapped to a common portion of the left inferior frontal gyrus.


Creativity support for novice digital filmmaking

Machinima is a new form of creative digital filmmaking that leverages the real time graphics rendering of computer game engines. Because of the low barrier to entry, machinima has become a popular creative medium for hobbyists and novices while still retaining borrowed conventions from professional filmmaking. Can novice machinima creators benefit from creativity support tools? A preliminary study shows novices generally have difficulty adhering to cinematographic conventions. We identify and document four cinematic conventions novices typically violate. We report on a Wizard-of-Oz study showing a rule-based intelligent system that can reduce the frequency of errors that novices make by providing information about rule violations without prescribing solutions. We discuss the role of error reduction in creativity support tools.


System architecture directions for networked sensors

Technological progress in integrated, low-power, CMOS communication devices and sensors makes a rich design space of networked sensors viable. They can be deeply embedded in the physical world and spread throughout our environment like smart dust. The missing elements are an overall system architecture and a methodology for systematic advance. To this end, we identify key requirements, develop a small device that is representative of the class, design a tiny event-driven operating system, and show that it provides support for efficient modularity and concurrency-intensive operation. Our operating system fits in 178 bytes of memory, propagates events in the time it takes to copy 1.25 bytes of memory, context switches in the time it takes to copy 6 bytes of memory and supports two level scheduling. The analysis lays a groundwork for future architectural advances.


Recent Development in Big Data Analytics for Business Operations and Risk Management

“Big data” is an emerging topic and has attracted the attention of many researchers and practitioners in industrial systems engineering and cybernetics. Big data analytics would definitely lead to valuable knowledge for many organizations. Business operations and risk management can be a beneficiary as there are many data collection channels in the related industrial systems (e.g., wireless sensor networks, Internet-based systems, etc.). Big data research, however, is still in its infancy. Its focus is rather unclear and related studies are not well amalgamated. This paper aims to present the challenges and opportunities of big data analytics in this unique application domain. Technological development and advances for industrial-based business systems, reliability and security of industrial systems, and their operational risk management are examined. Important areas for future research are also discussed and revealed.


Computational design of linkage-based characters

We present a design system for linkage-based characters, combining form and function in an aesthetically-pleasing manner. Linkage-based character design exhibits a mix of discrete and continuous problems, making for a highly unintuitive design space that is difficult to navigate without assistance. Our system significantly simplifies this task by allowing users to interactively browse different topology options, thus guiding the discrete set of choices that need to be made. A subsequent continuous optimization step improves motion quality and, crucially, safeguards against singularities. We demonstrate the flexibility of our method on a diverse set of character designs, and then realize our designs by physically fabricating prototypes.


Automated Summarization Evaluation with Basic Elements

As part of evaluating a summary automatically, it is usual to determine how much of the contents of one or more human-produced ‘ideal’ summaries it contains. Past automated methods such as ROUGE compare using fixed word ngrams, which are not ideal for a variety of reasons. In this paper we describe a framework in which summary evaluation measures can be instantiated and compared, and we implement a specific evaluation method using very small units of content, called Basic Elements, that address some of the shortcomings of ngrams. This method is tested on DUC 2003, 2004, and 2005 systems and produces very good correlations with human judgments.


Computational Intelligence, Networked Systems and Their Applications

This paper presents the metro constant illumination controller, which is designed to solve the current problem that the interior illumination in a moving metro fluctuates drastically with the changes of exterior environment. By detecting the real-time interior illumination values and adjusting the lights in a metro with PID controller based on BP neural network, the controller can keep the metro interior illumination values around the preset value. Simulations and actual test results show that the PID controller based on BP neural network has strong adaptability and robustness in a nonlinear system. It can both save energy and solve the problem of drastically fluctuating illumination in a moving metro, which cannot be achieved in conventional PID controllers.


Modelling of Mechanical and Mechatronic Systems MMaMS 2014 Pressure Distribution in Transtibial Prostheses Socket and the Stump Interface

The paper deals with the problem of a biomechanical solution for human locomotion after amputation of a lower limb. With an inappropriately designed transtibial prostheses socket, the interaction between the socket and the stump occurs, leading to increased friction and subsequent surface damage to the soft tissue. In individual types of transtibial prostheses, locations are defined which can be loaded and which cannot be loaded. On the basis of the study of the anterior side of the stump, three loadable and two non-loadable areas were monitored using the TACTILUS tactile pressure sensor (Sensor Products Inc., Madison, New Jersey, USA). Methods of measuring individual values were proposed for the purpose of sensing the pressure in the socket and the liner interface, the stump and the liner interface. Each method includes the methodological preparation of the patient, the preparation of the room, the preparation of the measuring system, and the subsequent method of data processing. In the submitted paper, 11 stumps were non-invasively monitored. The method of assessing the pressure exerted on the stumps was focused on the monitoring of the pressure distribution in the selected areas. The results obtained by the pressure measurements were statistically processed. In both cases of the pressure system placement, the p-value was higher than 0.05; therefore, we can state that the sets are equal. © 2014 The Authors. Published by Elsevier Ltd. Peer-review under responsibility of organizing committee of the Modelling of Mechanical and Mechatronic Systems MMaMS 2014.


DATS - Data Containers for Web Applications

Data containers enable users to control access to their data while untrusted applications compute on it. However, they require replicating an application inside each container - compromising functionality, programmability, and performance. We propose DATS - a system to run web applications that retains application usability and efficiency through a mix of hardware capability enhanced containers and the introduction of two new primitives modeled after the popular model-view-controller (MVC) pattern. (1) DATS introduces a templating language to create views that compose data across data containers. (2) DATS uses authenticated storage and confinement to enable an untrusted storage service, such as memcached and deduplication, to operate on plain-text data across containers. These two primitives act as robust declassifiers that allow DATS to enforce non-interference across containers, taking large applications out of the trusted computing base (TCB). We showcase eight different web applications including Gitlab and a Slack-like chat, significantly improve the worst-case overheads due to application replication, and demonstrate usable performance for common-case usage.


Development of a wall-climbing robot using a tracked wheel mechanism

In this paper, a new concept of a wall-climbing robot able to climb a vertical plane is presented. A continuous locomotive motion with a high climbing speed of 15m/min is realized by adopting a series chain on two tracked wheels on which 24 suction pads are installed. While each tracked wheel rotates, the suction pads which attach to the vertical plane are activated in sequence by specially designed mechanical valves. The engineering analysis and detailed mechanism design of the tracked wheel, including mechanical valves and the overall features, are described in this paper. It is a self-contained robot in which a vacuum pump and a power supply are integrated and is controlled remotely. The climbing performance, using the proposed mechanism, is evaluated on a vertical steel plate. Finally, the procedures are presented for an optimization experiment using Taguchi methodology to maximize vacuum pressure which is a critical factor for suction force.


Information Fusion for Diabetic Retinopathy CAD in Digital Color Fundus Photographs

The purpose of computer-aided detection or diagnosis (CAD) technology has so far been to serve as a second reader. If, however, all relevant lesions in an image can be detected by CAD algorithms, use of CAD for automatic reading or prescreening may become feasible. This work addresses the question how to fuse information from multiple CAD algorithms, operating on multiple images that comprise an exam, to determine a likelihood that the exam is normal and would not require further inspection by human operators. We focus on retinal image screening for diabetic retinopathy, a common complication of diabetes. Current CAD systems are not designed to automatically evaluate complete exams consisting of multiple images for which several detection algorithm output sets are available. Information fusion will potentially play a crucial role in enabling the application of CAD technology to the automatic screening problem. Several different fusion methods are proposed and their effect on the performance of a complete comprehensive automatic diabetic retinopathy screening system is evaluated. Experiments show that the choice of fusion method can have a large impact on system performance. The complete system was evaluated on a set of 15 000 exams (60 000 images). The best performing fusion method obtained an area under the receiver operator characteristic curve of 0.881. This indicates that automated prescreening could be applied in diabetic retinopathy screening programs.


High speed locomotion for a quadrupedal microrobot

Research over the past several decades has elucidated some of the mechanisms behind high speed, highly efficient and robust locomotion in insects such as cockroaches. Roboticists have used this information to create biologically-inspired machines capable of running, jumping, and climbing robustly over a variety of terrains. To date, little work has been done to develop an at-scale insect-inspired robot capable of similar feats due to challenges in fabrication, actuation, and electronics integration for a centimeter-scale device. This paper addresses these challenges through the design, fabrication, and control of a 1.27g walking robot, the Harvard Ambulatory MicroRobot (HAMR). The current design is manufactured using a method inspired by pop-up books that enables fast and repeatable assembly of the miniature walking robot. Methods to drive HAMR at low and high speeds are presented, resulting in speeds up to 0.44m/s (10.1 body lengths per second) and the ability to maneuver and control the robot along desired trajectories.


Topic Detection and Tracking using idf-Weighted Cosine Coefficient

The goal of TDT Topic Detection and Tracking is to develop aut omatic methods of identifying topically related stories wit hin a stream of news media. We describe approaches for both detection and tr cking based on the well-known idf -weighted cosine coefficient similarity metric. The surprising outcome of this research is th at we achieved very competitive results for tracking using a very simple method of feature selection, without word stemming and with ou a score normalization scheme. The detection task results wer e not as encouraging though we attribute this more to the clustering algorithm than the underlying similarity metric. 1. The Tracking Task The goal of the topic tracking task for TDT2 is to identify new s stories on a particular event defined by a small number ( Nt) of positive training examples and a greater number of negative examples . All stories in the news stream subsequent to the final positive ex ample are to be classified as on-topic if they pertain to the event or off-topic if they do not. Although the task is similar to IR routing and fi ltering tasks, the definition of event leads to at least one significan t difference. An event is defined as an occurrence at a given place and t ime covered by the news media. Stories are on-topic if they cover th event itself or any outcome (strictly-defined in [2]) of the e vent. By this definition, all stories prior to the occurrence are offt pic, which contrary to the IR tasks mentioned, theoretically provides for unlimited off-topic training material (assuming retrospective corpora are available). We expected to be able to take advantage of these unlimited negative examples but in our final implementation did so only to the extent that we used a retrospective corpus to improve t erm statistics of our database. 1.1. idf-Weighted Cosine Coefficient As the basis for our approach we used the idf -weighted cosine coefficient described in [1] often referred to as tf idf . Using this metric, the tracking task becomes two-fold. Firstly, choosing an op timal set of features to represent topics, i.e. feature selection. Th e approach must choose features from a single story as well as from multi ple stories (forNt > 1). Secondly, determining a threshold (potentially one per topic) which optimizes the miss and false alarm proba bilities for a particular cost function, effectively normalizing th e similarity scores across topics. The cosine coefficient is a document similarity metric which has been investigated extensively. Here documents (and querie s) ar represented as vectors in an n-dimensional space, where n is the number of unique terms in the database. The coefficients of th e vector for a given document are the term frequencies ( tf ) for that dimension. The resulting vectors are extremely sparse and t ypically high frequency words (mostly closed class) are ignored. The cosine of the angle between two vectors is an indication of vector si milarity and is equal to the dot-product of the vectors normalized by the product of the vector lengths. cos( ) = ~ A ~ B k ~ Akk ~ Bk tf idf (term frequency times inverse document frequency) weighting is an ad-hoc modification to the cosine coefficient calcul tion which weights words according to their usefulness in discriminating documents. Words that appear in few documents are more usefu l than words that appear in many documents. This is captured in the equation for the inverse document frequency of a word: idf(w) = log10 N df(w) Wheredf(w) is the number of documents in a collection which contain wordw andN is the total number of documents in the collection. For our implementation we weighted only the topic vector by idf and left the story vector under test unchanged. This allows u s to calculate and fix anidf -scaled topic vector immediately after training on the last positive example story for a topic. The resulting calculation for the similarity measure becomes: sim(a; b) = Pnw=1 tfa(w) tfb(w) idf(w) pPnw=1 tf2 a (w) pPnw=1 tf2 b (w) 1.2. UPENN System Attributes To facilitate testing, the stories were loaded into a simple document processing system. Once in the system, stories are proc ssed in chronological order testing all topics simultaneously w ith a single pass over the data 1 at a rate of approximately 6000 stories per minute on a Pentium 266 MHz machine. The system tokenizer delimits on white space and punctuation (and discards it), col lapses case, but provides no stemming. A list of 179 stop words consi sti g almost entirely of close classed words was also employed. In order to improve word statistics, particularly for the beginning of the test set, we prepended a retrospective corpus (the TDT Pilot Data [3]) of approximately 16 thousand stories. 1In accordance with the evaluation specification for this pro ject [2] no information is shared across topics. 1.3. Feature Selection Thechoice as well asnumber of features (words) used to represent a topic has a direct effect on the trade-off between miss and f lse alarm probabilities. We investigated four methods of produ cing lists of features sorted by their effectiveness in discriminatin g a topic. This then allowed us to easily vary the number of those featur s for the topic vectors 2. 1. Keep all features except those words belonging to the stop word list. 2. Relative to training stories, sort words by document coun t, keepn most frequent. This approach has the advantage of finding those words which are common across training stories, an d therefore are more general to the topic area, but has the disa dvantage of extending poorly from the Nt = 16 case to the Nt = 1 case. 3. For each story, sort by word count ( tf ), keepn most frequent. While this approach tends to ignore low count words which occur in multiple training documents, it generalizes well f rom theNt = 16 to theNt = 1 case. 4. As a variant on the previous method we tried adding to the initial n features using a simple greedy algorithm. Against a database containing all stories up to and including the Nt-th training story, we queried the database with the n f atures plus the next most frequent term. If the separation of on-topic an d off-topic stories increased, we kept the term, if not we igno red it and tested the next term in the list. We defined separation as the difference between the average on-topic scores and th e average of the 20 highest scoring off-topic documents. Of the feature selection methods we tried the forth one yield ed the best results across varying values of Nt, although only slightly better than the much simpler third method. Occam’s Razor prompt ed us to omit this complication from the algorithm. The DET curves 3 in Figure 1. show the effect of varying the number of features (o btained from method 3) on the miss and false alarm probabilities. The upper right most curve results from choosing the single most fr equent feature. Downward to the left, in order are the curves for 5, 1 0, 50, 150 and 300 features. After examining similar plots from the pilot, training4, and development-test data sets, we set the number of features for our system to 50. It can be seen that there is limited benefit in adding features after this point. 1.4. Normalization / Threshold Selection With a method of feature selection in place, a threshold for t he similarity score must be determined above which stories will be d e med on-topic, and below which they will not. Since each topic is r epresented by its own unique vector it cannot be expected that the same threshold value will be optimal across all topics unless the scores are normalized. We tried two approaches for normalizing the topic similarity scores. For the first approach we calculated the similarity of a rando m sample of several hundred off-topic documents in order to estim a e an 2We did not employ feature selection on the story under test bu t used the text in entirety. 3See [5] for detailed description of DET curves. 4The first two month period of TDT2 data is called the training s et, not to be confused with training data. 1 2 5 10 20 40 60 80 90 .01 .02 .05 .1 .2 .5 1 2 5 10 20 40 60 80 90 M is s pr ob ab ili ty ( in % ) False Alarms probability (in %) random performance num_features=1 num_features=5 num_features=10 num_features=50 num_features=150 num_features=300 Figure 1: DET curve for varying number of features. (Nt=4, TD T2 evaluation data set, newswire and ASR transcripts) average off-topic score relative to the topic vector. The no rmalized score is then a function of the average on-topic 5 and off-topic scores and the off-topic standard deviation 6. The second approach looked at only thehighest scoringoff-topic stories returned from a query of the topic vector against a retrospective database with th e score normalized in a similar fashion to the first approach. Both attempts reduced the story-weighted miss probability by approximately 10 percent at low false alarm probability relat ive. However, this results was achieved at the expense of higher miss probability at higher false alarm probability, and a higher cost a t the operating point defined by the cost function for the task 7. Ctrack = Cmiss P (miss) Ptopic +Cfa P (fa) (1 Ptopic) where Cmiss = 1: (the cost of a miss) Cfa = 1: (the cost of a false alarm) Ptopic = 0:02: (thea priori probability of a story being on a given topic was chosen based on the TDT2 training topics and traini ng corpus.) Because of the less optimal trade-off between error probabi lities at the point defined by the cost function, we choose to ignore nor malization and look directly at cost as a function of a single thr es old value across all topics. We plotted tf idf score against story and topic-weighted cost for the training and development-test data sets. As our global threshold we averaged the scores at which story and topic-weighted cost were minimized. This is depicted in figu re 2. Figure 3 shows the same curves for the evaluation data set. Th e threshold resulting from the traini


15 Planar Antenna Technology for mm-Wave Automotive Radar , Sensing

Planar antennas are common components in sensing applications due to their low cost, low profile and simple integration with systems. They can be used commonly at frequencies as high as 77 GHz and above, for example in automotive sensing. Also, new ultra-wideband communication systems operating around 60 GHz will heavily rely on planar antennas due to their unique properties. One special advantage of planar elements is that they can easily form array structures combining very simple elements, like microstrip patches. Also phased and conformal arrays can be built. Due to all these characteristics, planar antennas are very good candidates for building front ends for mm-wave applications in radar, sensing or communications. For some applications, which are either established today or which will become commercial in a few years, general requirements can be given. In addition to automotive radar, this mainly applies to 60 GHz ultra-broadband wireless indoor communications. Microwave imaging at 94 GHz and above is still much under research, as well as other sensing applications in the millimeter-wave region above 100 GHz. Prominent frequency bands are in the 122 and 140 GHz range1. Typical antenna requirements are multi-beam or scanning capability, high gain up to 30..36 dBi and moderate to low sidelobes. In monopulse radar systems, the sidelobes may be included in the angle determination scheme, then the sidelobe level requirements are rather relaxed. Loss is generally an important issue. Comparing a planar approach to a commercially available dielectric lens, the planar antenna exhibits significantly higher losses, especially if the beamforming device is included. The antenna efficiency of 77 GHz planar array columns is roughly 50%. These losses are caused by dielectric losses and conductor losses. To attain reliable predictions of the losses in full-wave simulations, care has to be taken in the


Live-streaming mobile video: production as civic engagement

Live-streaming mobile video is an emerging medium. Few have measured how this new form of production is contributing to civic engagement or broadening the public sphere by circulating visual footage of community interest. Here I explore the overall trends in production of live-streaming mobile video from producers around the world, and focus more narrowly on the motivations and practices surrounding the production of civic content. Informing my study are mobile videos on Qik.com, a popular web service for live-streaming mobile video. I offer a quantitative content analysis of 1,000 videos, summarizing general trends in content production as well as analyzing the motivations behind the production of civic content, based on qualitative interviews with frequent producers. Results indicate that production is higher among those who self-identify as activists, journalists, community leaders or educators, suggesting this new medium can be best appropriated by those who are already civically engaged.


Improving Deep Visual Representation for Person Re-identification by Global and Local Image-language Association

Person re-identification is an important task that requires learning discriminative visual features for distinguishing different person identities. Diverse auxiliary information has been utilized to improve the visual feature learning. In this paper, we propose to exploit natural language description as additional training supervisions for effective visual features. Compared with other auxiliary information, language can describe a specific person from more compact and semantic visual aspects, thus is complementary to the pixel-level image data. Our method not only learns better global visual feature with the supervision of the overall description but also enforces semantic consistencies between local visual and linguistic features, which is achieved by building global and local image-language associations. The global image-language association is established according to the identity labels, while the local association is based upon the implicit correspondences between image regions and noun phrases. Extensive experiments demonstrate the effectiveness of employing language as training supervisions with the two association schemes. Our method achieves state-of-the-art performance without utilizing any auxiliary information during testing and shows better performance than other joint embedding methods for the image-language association.


Design-Space Exploration in MDE: An Initial Pattern Catalogue

A designer often has to evaluate alternative designs during the development of a system. A multitude of Design-Space Exploration (DSE) techniques exist in the literature. Integration of these techniques into the modelling paradigm is needed when a model-driven engineering approach is used for designing systems. To a greater or lesser extent, the integration of those different DSE techniques share characteristics with each other. Inspired by software design patterns, we introduce an initial pattern catalogue to categorise the embedding of different DSE techniques in an MDE context. We demonstrate their use by a literature survey and discuss the consequences of each pattern.


Real-time Convolutional Networks for Depth-based Human Pose Estimation

We propose to combine recent Convolutional Neural Networks (CNN) models with depth imaging to obtain a reliable and fast multi-person pose estimation algorithm applicable to Human Robot Interaction (HRI) scenarios. Our hypothesis is that depth images contain less structures and are easier to process than RGB images while keeping the required information for human detection and pose inference, thus allowing the use of simpler networks for the task. Our contributions are threefold. (i) we propose a fast and efficient network based on residual blocks (called RPM) for body landmark localization from depth images; (ii) we created a public dataset DIH comprising more than 170k synthetic images of human bodies with various shapes and viewpoints as well as real (annotated) data for evaluation; (iii) we show that our model trained on synthetic data from scratch can perform well on real data, obtaining similar results to larger models initialized with pre-trained networks. It thus provides a good trade-off between performance and computation. Experiments on real data demonstrate the validity of our approach.


IT doesn't matter

This publication contains reprint articles for which IEEE does not hold copyright. Full text is not available on IEEE Xplore for these articles.


Elliptic Curve Multiset Hash

A homomorphic, or incremental, multiset hash function, associates a hash value to arbitrary collections of objects (with possible repetitions) in such a way that the hash of the union of two collections is easy to compute from the hashes of the two collections themselves: it is simply their sum under a suitable group operation. In particular, hash values of large collections can be computed incrementally and/or in parallel. Homomorphic hashing is thus a very useful primitive with applications ranging from database integrity verification to streaming set/multiset comparison and network coding. Unfortunately, constructions of homomorphic hash functions in the literature are hampered by two main drawbacks: they tend to be much longer than usual hash functions at the same security level (e.g. to achieve a collision resistance of 2, they are several thousand bits long, as opposed to 256 bits for usual hash functions), and they are also quite slow. In this paper, we introduce the Elliptic Curve Multiset Hash (ECMH), which combines a usual bit string-valued hash function like BLAKE2 with an efficient encoding into binary elliptic curves to overcome both difficulties. On the one hand, the size of ECMH digests is essentially optimal: 2m-bit hash values provideO(2) collision resistance. On the other hand, we demonstrate a highly-efficient software implementation of ECMH, which our thorough empirical evaluation shows to be capable of processing over 3 million set elements per second on a 4 GHz Intel Haswell machine at the 128-bit security level— many times faster than previous practical methods. While incremental hashing based on elliptic curves has been considered previously [1], the proposed method was less efficient, susceptible to timing attacks, and potentially patent-encumbered [2], and no practical implementation was demonstrated.


Voronoi treemaps for the visualization of software metrics

In this paper we present a hierarchy-based visualization approach for software metrics using Treemaps. Contrary to existing rectangle-based Treemap layout algorithms, we introduce layouts based on arbitrary polygons that are advantageous with respect to the aspect ratio between width and height of the objects and the identification of boundaries between and within the hierarchy levels in the Treemap. The layouts are computed by the iterative relaxation of Voronoi tessellations. Additionally, we describe techniques that allow the user to investigate software metric data of complex systems by utilizing transparencies in combination with interactive zooming.


Chemoinformatics and Drug Discovery

This article reviews current achievements in the field of chemoinformatics and their impact on modern drug discovery processes. The main data mining approaches used in cheminformatics, such as descriptor computations, structural similarity matrices, and classification algorithms, are outlined. The applications of cheminformatics in drug discovery, such as compound selection, virtual library generation, virtual high throughput screening, HTS data mining, and in silico ADMET are discussed. At the conclusion, future directions of chemoinformatics are suggested.


Hierarchical Grouping to Optimize an Objective Function

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use.


A Hybrid Reverse Engineering Approach Combining Metrics and Program Visualization

Surprising as it may seem, many of the early adopters of the object-oriented paradigm already face a number of problems typically encountered in large-scale legacy systems. Consequently, reverse engineering techniques are relevant in an object-oriented context as well. This paper investigates a hybrid approach, combining the immediate appeal of visualisations with the scalability of metrics. We validate such a hybrid approach by showing how CodeCrawler —the experimental platform we built— allowed us to understand the program structure of, and identify potential design anomalies in a public domain software system.


Centroidal Voronoi Tessellations: Applications and Algorithms

A centroidal Voronoi tessellation is a Voronoi tessellation whose generating points are the centroids (centers of mass) of the corresponding Voronoi regions. We give some applications of such tessellations to problems in image compression, quadrature, finite difference methods, distribution of resources, cellular biology, statistics, and the territorial behavior of animals. We discuss methods for computing these tessellations, provide some analyses concerning both the tessellations and the methods for their determination, and, finally, present the results of some numerical experiments.


Graph-based forensic investigation of Bitcoin transactions

This thesis illustrates forensic research work on Bitcoin, an innovative Internet based global transaction system that attracts ascending popularity during the recent few years. As an open, public and scalable distributed payment system, Bitcoin brings forward significant economic and technological impact to our world. Meanwhile, a new notion of virtual currency, “Bitcoin” comes into existence such that Bitcoin currency can be “mined” from all over world complying with specific algorithms. Mined bit “coins” has practical monetary values that turn the Bitcoin system into a digital currency circulation system. Due to Bitcoin’s decentralized semantics, Bitcoin transaction and currency are not subject to control and censorship from any single authority. Therefore, Bitcoin brings out various security concerns about its application as a long-term reliable system. The research in the thesis focuses on forensic study on Bitcoin. It covers experimental study on the Bitcoin network as a peer-to-peer system and a graph-based forensic approach against Bitcoin’s transaction data. Major contributions include network data evaluation and transaction history analysis. In case of forensic investigation is needed against criminal incidents such as fraud, false transactions and money theft, which are commonly seen in commonly used digital payment systems, the research provides a guidance of efficient information collection and framework of evidence data processing and extraction.


Antecedents and consequences of customer-company identification: expanding the role of relationship marketing.

This article presents an empirical test of organizational identification in the context of customer-company (C-C) relationships. It investigates whether customers identify with companies and what the antecedents and consequences of such identification are. The model posits that perceived company characteristics, construed external image, and the perception of the company's boundary-spanning agent lead to C-C identification. In turn, such identification is expected to impact both in-role behavior (i.e., product utilization) as well as extra-role behavior (i.e., citizenship). The model was tested in a consultative selling context of pharmaceutical sales reps calling on physicians. Results from the empirical test indicated that customers do indeed identify with organizations and that C-C identification positively impacts both product utilization behavior and extra-role behavior even when the effect of brand perception is accounted for. Second, the study found that the organization's characteristics as well as the salesperson's characteristics contributed to the development of C-C identification.


WAVES: A Wearable Asymmetric Vibration Excitation System for Presenting Three-Dimensional Translation and Rotation Cues

WAVES, a Wearable Asymmetric Vibration Excitation System, is a novel wearable haptic device for presenting three dimensions of translation and rotation guidance cues. In contrast to traditional vibration feedback, which usually requires that users learn to interpret a binary cue, asymmetric vibrations have been shown to induce a pulling sensation in a desired direction. When attached to the fingers, a single voicecoil actuator presents a translation guidance cue and a pair of voicecoil actuators presents a rotation guidance cue. The directionality of mechanoreceptors in the skin led to our choice of the location and orientation of the actuators in order to elicit very strong sensations in certain directions. For example, users distinguished a "left" cue versus a "right" cue 94.5% of the time. When presented with one of six possible direction cues, users on average correctly identified the direction of translation cues 86.1% of the time and rotation cues 69.0% of the time.


Automated detection of vulnerabilities in privileged programs by execution monitoring

We present a method for detecting exploitations of vulnerabilities in privileged programs by monitoring their execution using audit trials, where the monitoring is with respect to specifications of the security-relevant behavior of the programs. Our work is motivated by the intrusion detection paradigm, but is a n attempt to avoid a d hoc approaches to codifying misuse behavior. Our approach as based on the observation that although privileged programs can be exploited (due to errors) to cause security compromise in systems because of the privileges accorded to them, the intended behavior of privileged programs is, of course, limited a n d benign. The key, then i s to specify the intended behavior (Le., the program policy) and to detect any action by privileged program that is outside the intended behavior a n d that imperils security. We describe a program policy specification language, which is based on simple predicate logic and regular expressions. I n addition, we present specifications of privileged programs in Unix, and Q prototype execution monitor for analyzing audit trails with respect to these specifications. The program policies are surprisingly concise and clear, a n d an addition, capable of detecting exploitations of known vulnerabilities in these programs. Although our work has been motivated by the known vulnerabilities in Unix, we believe that by tightly restricting the behavior of all privileged programs, exploitations of unknown vulnerabilities can be detected. A s Q check on the specifications, work is in progress on verifying them with respect to a n abstract security policy. *This work is funded in part by the National Security Agency University Research Program under Contract No. DOD-MDA904-93-C4083 and by ARPA under Contract No. USNN00014-94-1-0065.


A review and outlook for a 'Building Information Model' (BIM): A multi-standpoint framework for technological development

1474-0346/$ see front matter 2010 Elsevier Ltd. A doi:10.1016/j.aei.2010.06.003 * Tel.: +386 1 4768 521; fax: +386 1 4250 681. E-mail address: tomo.cerovsek@fgg.uni-lj.si This study provides a review of important issues for ‘Building Information Modelling’ (BIM) tools and standards and comprehensive recommendations for their advancement and development that may improve BIM technologies and provide a basis for inter-operability, integration, model-based communication, and collaboration in building projects. Based on a critical review of Building Product Modelling, including the development of standards for exchange and the features of over 150 AEC/O (Architecture, Engineering, Construction, and Operation) tools and digital models, a methodological framework is proposed for improvements to both BIM tools and schemata. The features relevant to the framework were studied using a conceptual process model and a ‘BIM System-of-Systems’ (BIM-SoS) model. The development, implementation, and use of the BIM Schema are analysed from the standpoint of standardisation. The results embrace the requirements for a BIM research methodology, with an example of methods and procedures, an R&D review with critique, and a multi-standpoint framework for developments with concrete recommendations, supported by BIM metrics, upon which the progress of tools, models, and standards may be measured, evaluated, streamlined, and judged. It is also proposed that any BIM Schema will never be ‘completed’ but should be developed as evolutionary ontology by ‘segmented standpoint models’ to better account for evolving tools and AEC/O practices. 2010 Elsevier Ltd. All rights reserved.


On the 1.1 Edge-Coloring of Multigraphs


Privacy protection issues in social networking sites

Social Networking Sites (SNS) have become very popular during the past few years, as they allow users to both express their individuality and meet people with similar interests. Nonetheless, there are also many potential threats to privacy associated with these SNS such as identity theft and disclosure of sensitive information. However, many users still are not aware of these threats and the privacy settings provided by SNS are not flexible enough to protect user data. In addition, users do not have any control over what others reveal about them. As such, we conduct a preliminary study which examines the privacy protection issues on Social Networking Sites (SNS) such as MySpace, Facebook and LinkedIn. Based on this study, we identify three privacy problems in SNS and propose a Privacy Framework as a foundation to cope with these problems.


Hesitant Fuzzy Sets: State of the Art and Future Directions

The necessity of dealing with uncertainty in real wold problems has been a long-term research challenge that has originated different methodologies and theories. Fuzzy sets along with their extensions such as, type-2 fuzzy sets, interval valued fuzzy sets, Atanassov’s intuitionistic fuzzy sets, etc., have provided a wide range of tools able to deal with uncertainty in different type of problems. Recently, a new extension of fuzzy sets so-called hesitant fuzzy sets has been introduced to deal with hesitant situations which were not well managed by the previous tools. Hesitant fuzzy sets have attracted very quickly the attention of many researchers that have proposed diverse extensions, several type of operators to compute with such type of information, and eventually some applications have been developed. Because of such a growth, this paper presents an overview on hesitant fuzzy sets with the aim of providing a clear perspective on the different concepts, tools and trends related to this extension of fuzzy sets.


Violence Detection in Movies

As violence in movies has harmful influence on children, in this paper, we propose an algorithm to detect violent scene in movies. Under our definition of violence, the task of violent scene detection is decomposed into action scene detection and bloody frame detection. While previous approaches addressed on shot level of video structure only, our approach works on more semantic-complete scene structure of video. The input video (digital movie) is first segmented into several scenes. Based on the filmmaking characteristics of action scene, some features of the scene are extracted to feed into the support vector machine for classification. Finally, the face, blood and motion information are integrated to determine whether the action scene has violent content. Experimental results show that the proposed approach works reasonably well in detecting most of the violent scenes. Compared with related work, our approach is computationally simple yet effective.


A comparative study of metamodeling methods for multiobjective crashworthiness optimization

The response surface methodology (RSM), which typically uses quadratic polynomials, is predominantly used for metamodeling in crashworthiness optimization because of the high computational cost of vehicle crash simulations. Research shows, however, that RSM may not be suitable for modeling highly nonlinear responses that can often be found in impact related problems, especially when using limited quantity of response samples. The radial basis functions (RBF) have been shown to be promising for highly nonlinear problems, but no application to crashworthiness problems has been found in the literature. In this study, metamodels by RSM and RBF are used for multiobjective optimization of a vehicle body in frontal collision, with validations by finite element simulations using the full-scale vehicle model. The results show that RSM is able to produce good approximation models for energy absorption, and the model appropriateness can be well predicted by ANOVA. However, in the case of peak acceleration, RBF is found to generate better models than RSM based on the same number of response samples, with the multiquadric function identified to be the most stable RBF. Although RBF models are computationally more expensive, the optimization results of RBF models are found to be more accurate. 2005 Elsevier Ltd. All rights reserved.


Accuracy of Ultrasound-Guided Genicular Nerve Block: A Cadaveric Study.

BACKGROUND
Genicular nerve block has recently emerged as a novel alternative treatment in chronic knee pain. The needle placement for genicular nerve injection is made under fluoroscopic guidance with reference to bony landmarks.

OBJECTIVE
To investigate the anatomic landmarks for medial genicular nerve branches and to determine the accuracy of ultrasound-guided genicular nerve block in a cadaveric model.

STUDY DESIGN
Cadaveric accuracy study.

SETTING
University hospital anatomy laboratory.

METHODS
Ten cadaveric knee specimens without surgery or major procedures were used in the study. The anatomic location of the superior medial genicular nerve (SMGN) and the inferior medial genicular nerve (IMGN) was examined using 4 knee dissections. The determined anatomical sites of the genicular nerves in the remaining 6 knee specimens were injected with 0.5 mL red ink under ultrasound guidance. The knee specimens were subsequently dissected to assess for accuracy. If the nerve was dyed with red ink, it was considered accurate placement. All other locations were considered inaccurate.

RESULTS
The course of the SMGN is that it curves around the femur shaft and passes between the adductor magnus tendon and the femoral medial epicondyle, then descends approximately one cm anterior to the adductor tubercle. The IMGN is situated horizontally around the tibial medial epicondyle and passes beneath the medial collateral ligament at the midpoint between the tibial medial epicondyle and the tibial insertion of the medial collateral ligament. The adductor tubercle for the SMGN and the medial collateral ligament for the IMGN were determined as anatomic landmarks for ultrasound. The bony cortex one cm anterior to the peak of the adductor tubercle and the bony cortex at the midpoint between the peak of the tibial medial epicondyle and the initial fibers inserting on the tibia of the medial collateral ligament were the target points for the injections of SMGN and IMGN, respectively. In the cadaver dissections both genicular nerves were seen to be dyed with red ink in all the injections of the 6 knees.

LIMITATIONS
The small number of cadavers might have led to some anatomic variations of genicular nerves being overlooked.

CONCLUSIONS
The result of this cadaveric study suggests that ultrasound-guided medial genicular nerve branch block can be performed accurately using the above-stated anatomic landmarks.


#Proana: Pro-Eating Disorder Socialization on Twitter.

PURPOSE
Pro-eating disorder (ED) online movements support engagement with ED lifestyles and are associated with negative health consequences for adolescents with EDs. Twitter is a popular social media site among adolescents that provides a unique setting for Pro-ED content to be publicly exchanged. The purpose of this study was to investigate Pro-ED Twitter profiles' references to EDs and how their social connections (followers) reference EDs.

METHODS
A purposeful sample of 45 Pro-ED profiles was selected from Twitter. Profile information, all tweets, and a random sample of 100 of their followers' profile information were collected for content analysis using the Twitter Application Programming Interface. A codebook based on ED screening guidelines was applied to evaluate ED references. For each Pro-ED profile, proportion of tweets with ED references and proportion of followers with ED references in their own profile were evaluated.

RESULTS
In total, our 45 Pro-ED profiles generated 4,245 tweets for analysis. A median of 36.4% of profiles' tweets contained ED references. Pro-ED profiles had a median of 173 followers, and a median of 44.5% of followers had ED references. Pro-ED profiles with more tweets with ED references also tended to have more followers with ED references (β = .37, p < .01).

CONCLUSIONS
Findings suggest that profiles which self-identify as Pro-ED express disordered eating patterns through tweets and have an audience of followers, many of whom also reference ED in their own profiles. ED socialization on Twitter might provide social support, but in the Pro-ED context this activity might also reinforce an ED identity.


Phased array systems and technologies in SELEX-Sistemi Integrati: State of art and new challenges

This paper is a follow-on of [1] and [2], presented at 1996 and 2003 IEEE Intl. Symposium on Phased Array Systems and Technology, respectively. After a brief recall of 3D Long Range phased array concepts, already presented in [2], the focus is on the G-band multifunction radar systems and on the technological capabilities that SELEX-Sistemi Integrati is developing by taking advantage of its Research and Development facilities. At the end, future trends about new challenging applications and technological issues are presented and discussed.


Morpho-syntactic Lexical Generalization for CCG Semantic Parsing

In this paper, we demonstrate that significant performance gains can be achieved in CCG semantic parsing by introducing a linguistically motivated grammar induction scheme. We present a new morpho-syntactic factored lexicon that models systematic variations in morphology, syntax, and semantics across word classes. The grammar uses domain-independent facts about the English language to restrict the number of incorrect parses that must be considered, thereby enabling effective learning from less data. Experiments in benchmark domains match previous models with one quarter of the data and provide new state-of-the-art results with all available data, including up to 45% relative test-error reduction.


Factors affecting the Choice of High Tech Engineering majors for University women and Men in Bangladesh

In contrast to western countries which are experiencing declines in female enrollment in high tech engineering (HTE), Bangladesh has experienced a continuous increase in female enrollment in engineering. In order to better understand the factors driving the choice of HTE as a major, survey data was collected from 590 male and female students in HTE majors in Bangladesh. Hypotheses related to gender differences in the influence of various factors on major choice were examined using t-tests. Results revealed that, while several factors had a similar impact for women and men, gender differences in selfefficacy and socio-economic status persist and may represent barriers to women’s participation.


Learning long-range vision for autonomous off-road driving

Most vision-based approaches to mobile robotics suffer from the limitations imposed by stereo obstacle detection, which is short-range and prone to failure. We present a self-supervised learning process for long-range vision that is able to accurately classify complex terrain at distances up to the horizon, thus allowing superior strategic planning. The success of the learning process is due to the self-supervised training data that is generated on every frame: robust, visually consistent labels from a stereo module, normalized wide-context input windows, and a discriminative and concise feature representation. A deep hierarchical network is trained to extract informative and meaningful features from an input image, and the features are used to train a realtime classifier to predict traversability. The trained classifier sees obstacles and paths from 5 to over 100 meters, far beyond the maximum stereo range of 12 meters, and adapts very quickly to new environments. The process was developed and tested on the LAGR mobile robot. Results from a ground truth dataset are given as well as field test results.


Hybrid encryption/decryption technique using new public key and symmetric key algorithm

This research study proposes Hybrid Encryption System using new public key algorithm and private key algorithm. A hybrid cryptosystem is one which combines the convenience of a public-key cryptosystem with the efficiency of a symmetrickey cryptosystem. Here, we propose a provably two way secured data encryption system, which addresses the concerns of user’s privacy, authentication and accuracy. This system has two different encryption algorithms have been used both in the Encryption and decryption sequence. One is public key cryptography based on linear block cipher another one is private key cryptography based on simple symmetric algorithm. This cryptography algorithm provides more security as well as authentication comparing to other existing hybrid algorithm.


A One-Layer Recurrent Neural Network with a Discontinuous Activation Function for Linear Programming

A one-layer recurrent neural network with a discontinuous activation function is proposed for linear programming. The number of neurons in the neural network is equal to that of decision variables in the linear programming problem. It is proven that the neural network with a sufficiently high gain is globally convergent to the optimal solution. Its application to linear assignment is discussed to demonstrate the utility of the neural network. Several simulation examples are given to show the effectiveness and characteristics of the neural network.