query: Semi-supervised clustering with metric learning: An adaptive kernel method

positive: Constrained K-means Clustering with Background Knowledge Clustering is traditionally viewed as an unsupervised method for data analysis. However, in some cases information about the problem domain is available in addition to the data instances themselves. In this paper, we demonstrate how the popular k-means clustering algorithm can be profitably modified to make use of this information. In experiments with artificial constraints on six data sets, we observe improvements in clustering accuracy. We also apply this method to the real-world problem of automatically detecting road lanes from GPS data and observe dramatic increases in performance.

positive: Integrating constraints and metric learning in semi-supervised clustering Semi-supervised clustering employs a small amount of labeled data to aid unsupervised learning. Previous work in the area has utilized supervised data in one of two approaches: 1) constraint-based methods that guide the clustering algorithm towards a better grouping of the data, and 2) distance-function learning methods that adapt the underlying similarity metric used by the clustering algorithm. This paper provides new methods for the two approaches as well as presents a new semi-supervised clustering algorithm that integrates both of these techniques in a uniform, principled framework. Experimental results demonstrate that the unified approach produces better clusters than both individual approaches as well as previously proposed semi-supervised clustering algorithms.

positive: Distance Metric Learning with Application to Clustering with Side-Information Many algorithms rely critically on being given a good metric over their inputs. For instance, data can often be clustered in many “plausible” ways, and if a clustering algorithm such as K-means initially fails to find one that is meaningful to a user, the only recourse may be for the user to manually tweak the metric until sufficiently good clusters are found. For these and other applications requiring good metrics, it is desirable that we provide a more systematic way for users to indicate what they consider “similar.” For instance, we may ask them to provide examples. In this paper, we present an algorithm that, given examples of similar (and, if desired, dissimilar) pairs of points in , learns a distance metric over that respects these relationships. Our method is based on posing metric learning as a convex optimization problem, which allows us to give efficient, local-optima-free algorithms. We also demonstrate empirically that the learned metrics can be used to significantly improve clustering performance.

positive: Learning with kernels All rights reserved. No part of this book may be reproduced in any form by any electronic or mechanical means (including photocopying, recording, or information storage and retrieval) without permission in writing from the publisher.

negative: Introduction: attachment theory and psychotherapy. In this introduction to the JCLP: In Session 69(11) issue on attachment theory and psychotherapy, the key points of attachment theory (Bowlby, , , 1981) and its relevance to psychotherapy are briefly described. The aim of this issue is to provide case illustrations of how an attachment theory perspective and principles can expand our understanding of psychotherapy practice.

negative: Neural Networks - A Systematic Introduction In what case do you like reading so much? What about the type of the neural networks a systematic introduction book? The needs to read? Well, everybody has their own reason why should read some books. Mostly, it will relate to their necessity to get knowledge from the book and want to read just to get entertainment. Novels, story book, and other entertaining books become so popular this day. Besides, the scientific books will also be the best reason to choose, especially for the students, teachers, doctors, businessman, and other professions who are fond of reading.

negative: Constrained Deep Metric Learning for Person Re-identification Person re-identification aims to re-identify the probe image from a given set of images under different camera views. It is challenging due to large variations of pose, illumination, occlusion and camera view. Since the convolutional neural networks (CNN) have excellent capability of feature extraction, certain deep learning methods have been recently applied in person re-identification. However, in person re-identification, the deep networks often suffer from the over-fitting problem. In this paper, we propose a novel CNN-based method to learn a discriminative metric with good robustness to the over-fitting problem in person re-identification. Firstly, a novel deep architecture is built where the Mahalanobis metric is learned with a weight constraint. This weight constraint is used to regularize the learning, so that the learned metric has a better generalization ability. Secondly, we find that the selection of intraclass sample pairs is crucial for learning but has received little attention. To cope with the large intra-class variations in pedestrian images, we propose a novel training strategy named moderate positive mining to prevent the training process from over-fitting to the extreme samples in intraclass pairs. Experiments show that our approach significantly outperforms state-of-the-art methods on several benchmarks of person re-identification.

negative: SQL-to-NoSQL Schema Denormalization and Migration: A Study on Content Management Systems Content management systems (CMSs) are able to let people, who have no technical skill to manage websites, rapidly create, edit, organize and publish online contents. For example, CMSs are often used to establish e-commerce online shops, community portals, personal blogs, or organization websites. Thus, CMSs play the role of collecting data and then can be easily extended to become intelligent Internet systems. Most popular CMSs, e.g., Word Press and Joomla, rely on relational databases or SQL databases, e.g., MySQL, PostgreSQL, etc. However, due to the explosive growth of huge data, the well-structured characteristic of SQL databases may limit the scalability to handle horizontal scaling. Therefore, regarding the flexibility and the feasibility of parallel processing, cloud computing takes Not Only SQL (NoSQL) databases into consideration. How to migrate the original CMS software from SQL databases to NoSQL databases becomes one emerging and critical research issue. This paper is motivated to propose an autonomous SQL-to-NoSQL schema denormalization and migration. At the same time, this paper also evaluates the proposed mechanism on the realistic CMS software. Based on our experimental results, our mechanism not only helps the current CMS software migrate into the cloud platform without re-designing their database schemas, but also improves at least 45% access performance after schema migration.

negative: Testing Unconstrained Optimization Software Much of the testing of optimization software is inadequate because the number of test functmns is small or the starting points are close to the solution. In addition, there has been too much emphasm on measurmg the efficmncy of the software and not enough on testing reliability and robustness. To address this need, we have produced a relatwely large but easy-to-use collection of test functions and designed gmdelines for testing the reliability and robustness of unconstrained optimization software.

negative:
Short Text Similarity with Word Embeddings Determining semantic similarity between texts is important in many tasks in information retrieval such as search, query suggestion, automatic summarization and image finding. Many approaches have been suggested, based on lexical matching, handcrafted patterns, syntactic parse trees, external sources of structured semantic knowledge and distributional semantics. However, lexical features, like string matching, do not capture semantic similarity beyond a trivial level. Furthermore, handcrafted patterns and external sources of structured semantic knowledge cannot be assumed to be available in all circumstances and for all domains. Lastly, approaches depending on parse trees are restricted to syntactically well-formed texts, typically of one sentence in length.
 We investigate whether determining short text similarity is possible using only semantic features---where by semantic we mean, pertaining to a representation of meaning---rather than relying on similarity in lexical or syntactic representations. We use word embeddings, vector representations of terms, computed from unlabelled data, that represent terms in a semantic space in which proximity of vectors can be interpreted as semantic similarity.
 We propose to go from word-level to text-level semantics by combining insights from methods based on external sources of semantic knowledge with word embeddings. A novel feature of our approach is that an arbitrary number of word embedding sets can be incorporated. We derive multiple types of meta-features from the comparison of the word vectors for short text pairs, and from the vector means of their respective word embeddings. The features representing labelled short text pairs are used to train a supervised learning algorithm. We use the trained model at testing time to predict the semantic similarity of new, unlabelled pairs of short texts
 We show on a publicly available evaluation set commonly used for the task of semantic similarity that our method outperforms baseline methods that work under the same conditions.

negative: Securing vulnerable home IoT devices with an in-hub security manager The proliferation of consumer Internet of Things (IoT) devices offers as many convenient benefits as it poses significant vulnerabilities. Patching or otherwise mitigating these vulnerabilities will be difficult for the existing home security ecosystem. This paper proposes a central security manager that is built on top of the smarthome's hub or gateway router and positioned to intercept all traffic to and from devices. Aware of the status of all devices in the home and of reported vulnerabilities, the security manager could intervene as needed to deter or alleviate many types of security risks. Modules built atop this manager could offer convenient installation of software updates, filter traffic that might otherwise exploit devices, and strengthen authentication for both legacy and future devices. We believe that this design offers the potential to increase security for smarthome IoT devices, and we encourage other researchers and regulators to explore and extend our ideas.

negative: Embedded image coding using zerotrees of wavelet coefficients The embedded zerotree wavelet algorithm (EZW) is a simple, yet remarkably effective, image compression algorithm, having the property that the bits in the bit stream are generated in order of importance, yielding a fully embedded code. The embedded code represents a sequence of binary decisions that distinguish a n image from the “null” image. Using a n embedded coding algorithm, a n encoder can terminate the encoding a t any point thereby allowing a target rate or target distortion metric to be met exactly. Also, given a bit stream, the decoder can cease decoding a t any point in the bit stream and still produce exactly the same image that would have been encoded a t the bit rate corresponding to the truncated bit stream. In addition to producing a fully embedded bit stream, EZW consistently produces compression results that a re competitive with virtually all known compression algorithms on standard test images. Yet this performance is achieved with a technique that requires absolutely no training, no pre-stored tables or codebooks, and requires no prior knowledge of the image source. The EZW algorithm is based on four key concepts: 1) a discrete wavelet transform or hierarchical subband decomposition, 2) prediction of the absence of significant information across scales by exploiting the self-similarity inherent in images, 3) entropy-coded successive-approximation quantization, and 4) universal lossless data compression which is achieved via adaptive arithmetic coding.

negative: Nutritional Ecology and Human Health. In contrast to the spectacular advances in the first half of the twentieth century with micronutrient-related diseases, human nutrition science has failed to stem the more recent rise of obesity and associated cardiometabolic disease (OACD). This failure has triggered debate on the problems and limitations of the field and what change is needed to address these. We briefly review the two broad historical phases of human nutrition science and then provide an overview of the main problems that have been implicated in the poor progress of the field with solving OACD. We next introduce the field of nutritional ecology and show how its ecological-evolutionary foundations can enrich human nutrition science by providing the theory to help address its limitations. We end by introducing a modeling approach from nutritional ecology, termed nutritional geometry, and demonstrate how it can help to implement ecological and evolutionary theory in human nutrition to provide new direction and to better understand and manage OACD.

negative: Innovative Cost Effective Approach for Cell Phone Based Remote Controlled Embedded System for Irrigation This work describes the development of innovative low cost cell phone based remote control application for induction motor-pump based irrigation in agriculture. Rural areas in many states of India are plagued by frequent power cuts and abnormal voltage conditions. The developed system ensures that water is distributed to field whenever normal conditions exist based on task specified. A novel concept of miscall for specified duration has been used to reduce the operational cost of the system and for the convenience of farmers facing difficulty in typing messages. Information is exchanged in form of miscalls / message between the system and the user cell phones. The system is based on AVR ATMega32 micro-controller and includes protection against single phasing, over-current, dry running and other desirable features. DS1307 and DS18S20 are used for time and temperature measurement respectively. It is expected that system will relieve hardships of farmers relating water distribution to a great extent.

negative: Predicting Domain-Specific Risk Taking With the HEXACO Personality Structure Although risk taking traditionally has been viewed as a unitary, stable individual difference variable, emerging evidence in behavioral decision-making research suggests that risk taking is a domain-specific construct. Utilizing a psychological risk-return framework that regresses risk taking on the perceived benefits and perceived riskiness of an activity (Weber & Milliman, 1997), this study examined the relations between risk attitude and broad personality dimensions using the new HEXACO personality framework (Lee &Ashton, 2004) across four risk domains. This personality framework, which has been replicated in lexical studies in over 12 natural languages, assess personality over six broad personality dimensions, as opposed to the traditional Five-Factor Model, or ‘‘Big Five.’’ Through path analysis, we regressed risk taking in four separate domains on risk perceptions, perceived benefits, and the six HEXACO dimensions. Across all risk domains, we found that the emotionality dimension was associated with heightened risk perceptions and high conscientiousness was associated with less perceived benefits. We also report several unique patterns of domain-specific relations between the HEXACO dimensions and risk attitude. Specifically, openness was associated with risk taking and perceived benefits for social and recreational risks, whereas lower honesty/humility was associated with greater health/safety and ethical risk taking. These findings extend our understanding of how individuals approach risk across a variety of contexts, and further highlight the utility of honesty/humility, a dimension not recovered in Big Five models, in individual differences research. Copyright # 2010 John Wiley & Sons, Ltd. key words risk taking; risk perception; risk-return framework; personality; HEXACO; honesty/humility Risk taking has traditionally been viewed as an enduring, stable, and domain-invariant construct in both behavioral decision making and personality research (e.g., Eysenck & Eysenck, 1977; Kahneman & Tversky, 1979; Paunonen & Jackson, 1996; Tellegen, 1985). However, recent advances suggest that risk taking is content, or domain, specific (Blais &Weber, 2006; Hanoch, Johnson, &Wilke, 2006; Soane & Chmiel, 2005; Weber, Blais, & Betz, 2002). In light of this knowledge, psychologists would benefit from a deeper ler, Decision Research, Eugene, OR 97401, USA. E-mail: jweller@decisionresearch.org

negative: Robust Interactive Image Segmentation Using Convex Active Contours The state-of-the-art interactive image segmentation algorithms are sensitive to the user inputs and often unable to produce an accurate boundary with a small amount of user interaction. They frequently rely on laborious user editing to refine the segmentation boundary. In this paper, we propose a robust and accurate interactive method based on the recently developed continuous-domain convex active contour model. The proposed method exhibits many desirable properties of an effective interactive image segmentation algorithm, including robustness to user inputs and different initializations, the ability to produce a smooth and accurate boundary contour, and the ability to handle topology changes. Experimental results on a benchmark data set show that the proposed tool is highly effective and outperforms the state-of-the-art interactive image segmentation algorithms.

negative: Model Reference Adaptive Control-Based Speed Control of Brushless DC Motors With Low-Resolution Hall-Effect Sensors A control system with a novel speed estimation approach based on model reference adaptive control (MRAC) is presented for low cost brushless dc motor drives with low-resolution hall sensors. The back EMF is usually used to estimate speed. But the estimation result is not accurate enough at low speeds because of the divided voltage of stator resistors and too small back EMF. Moreover, the stator resistor is always varying with the motor's temperature. A speed estimation algorithm based on MRAC was proposed to correct the speed error estimated by using back EMF. The proposed algorithm's most innovative feature is its adaptability to the entire speed range including low speeds and high speeds and temperature and different motors do not affect the accuracy of the estimation result. The effectiveness of the algorithm was verified through simulations and experiments.

negative: A Survey on Learning to Hash Nearest neighbor search is a problem of finding the data points from the database such that the distances from them to the query point are the smallest. Learning to hash is one of the major solutions to this problem and has been widely studied recently. In this paper, we present a comprehensive survey of the learning to hash algorithms, categorize them according to the manners of preserving the similarities into: pairwise similarity preserving, multiwise similarity preserving, implicit similarity preserving, as well as quantization, and discuss their relations. We separate quantization from pairwise similarity preserving as the objective function is very different though quantization, as we show, can be derived from preserving the pairwise similarities. In addition, we present the evaluation protocols, and the general performance analysis, and point out that the quantization algorithms perform superiorly in terms of search accuracy, search time cost, and space cost. Finally, we introduce a few emerging topics.

negative: KBQA: An Online Template Based Question Answering System over Freebase Question answering (QA) has become a popular way for humans to access billion-scale knowledge bases. QA systems over knowledge bases produce accurate and concise answers. The key of QA over knowledge bases is to map the question to a certain substructure in the knowledge base. To do this, KBQA (Question Answering over Knowledge Bases) uses a new kind of question representation: templates, learned from a million scale QA corpora. For example, for questions about a city’s population, KBQA learns templates such as What’s the population of $city?, How many people are there in $city?. It learns overall 1171303 templates for 4690 relations. Based on these templates, KBQA effectively and efficiently supports binary factoid questions or complex questions.

negative: 1 Mobile Landscapes : using location data from cellphones for urban analysis The technology for determining the geographic location of cell phones and other hand-held devices is becoming increasingly available. It is opening the way to a wide range of applications, collectively referred to as Location Based Services (LBS), that are primarily aimed at individual users. However, if deployed to retrieve aggregated data in cities, LBS could become a powerful tool for urban analysis. This paper aims to review and introduce the potential of this technology to the urban planning community. In addition, it presents the ‘Mobile Landscapes’ project: an application in the metropolitan area of Milan, Italy, based on the geographical mapping of cell phone usage at different times of the day. The results enable a graphic representation of the intensity of urban activities and their evolution through space and time. Finally, a number of future applications are discussed and their potential for urban studies and planning is assessed.

negative: Effects of gratitude meditation on neural network functional connectivity and brain-heart coupling A sense of gratitude is a powerful and positive experience that can promote a happier life, whereas resentment is associated with life dissatisfaction. To explore the effects of gratitude and resentment on mental well-being, we acquired functional magnetic resonance imaging and heart rate (HR) data before, during, and after the gratitude and resentment interventions. Functional connectivity (FC) analysis was conducted to identify the modulatory effects of gratitude on the default mode, emotion, and reward-motivation networks. The average HR was significantly lower during the gratitude intervention than during the resentment intervention. Temporostriatal FC showed a positive correlation with HR during the gratitude intervention, but not during the resentment intervention. Temporostriatal resting-state FC was significantly decreased after the gratitude intervention compared to the resentment intervention. After the gratitude intervention, resting-state FC of the amygdala with the right dorsomedial prefrontal cortex and left dorsal anterior cingulate cortex were positively correlated with anxiety scale and depression scale, respectively. Taken together, our findings shed light on the effect of gratitude meditation on an individual’s mental well-being, and indicate that it may be a means of improving both emotion regulation and self-motivation by modulating resting-state FC in emotion and motivation-related brain regions.

negative: A Research on Iron Loss of IPMSM With a Fractional Number of Slot Per Pole In this paper, we investigated rotor iron loss of interior permanent magnet synchronous machine (IPMSM), which has distributed armature windings. In order to study the iron loss with the effect of slot-pole combination, two machines for high-speed operation such as electric vehicle were designed. One is fractional slot winding and the other is conventional one. In the analysis, we developed a new iron loss model of electrical machines for high-speed operation. The calculated iron loss was compared with the experimental data. It was clarified that the proposed method can estimate iron loss effectively at high-speed operation. Based on this newly proposed method, we analyzed iron loss of the two machines according to their driving conditions. From the analysis results, it was shown that rotor iron loss of machine employing fractional slot-winding is definitely large at load condition. In addition, it is interesting that the ratio (rotor iron loss/stator iron loss) becomes larger as the speed of the machines increase if the number of slot per pole is fractional.

negative: Effective or Efficient ? Effects of Beijing ’ s Vehicle Lottery System on Fleet Composition and Environment * To control vehicle growth and air pollution, Beijing’s municipal government imposed a vehicle lottery system in 2011, which randomly allocated a quota of licenses to potential buyers. This paper investigates the effect of this policy on fleet composition, fuel consumption, air pollution, and social welfare. Using car registration data, we estimate a random coefficient discrete choice model and conduct counterfactual analysis based on the estimated parameters. We find that the lottery reduced new passenger vehicle *We gratefully acknowledge the kind help and constructive comments of Professors Andrew Cassey, Ana Espinola-Arredondo, Benjamin Cowan, Gregmar Galinato, Dong Lu, Jill McCluskey, Mark Gibson, Shanjun Li, Jia Yan, Dan Yang and seminar participants at Washington State University. Financial support from the China National Science Fund (grant #71620107005) is acknowledged. †Corresponding author. Email: yziying1988@gmail.com (Z. Yang), fmunoz@wsu.edu (F. Muñoz-García), tangmp.sicau@gmail.com (M. Tang). sales by 50.15%, fuel consumption by 48.69%, and pollutant emissions by 48.69% in 2012. Also, such lottery shifted new auto purchases towards high-end but less fuel efficient vehicles. In our counterfactual analysis, we show that a progressive tax scheme works better than the lottery system at decreasing fuel consumption and air pollution, and leads to a higher fleet fuel efficiency and less welfare loss.

negative: Smoothed Sarsa: Reinforcement learning for robot delivery tasks Our goal in this work is to make high level decisions for mobile robots. In particular, given a queue of prioritized object delivery tasks, we wish to find a sequence of actions in real time to accomplish these tasks efficiently. We introduce a novel reinforcement learning algorithm called Smoothed Sarsa that learns a good policy for these delivery tasks by delaying the backup reinforcement step until the uncertainty in the state estimate improves. The state space is modeled by a Dynamic Bayesian Network and updated using a Region-based Particle Filter. We take advantage of the fact that only discrete (topological) representations of entity locations are needed for decision-making, to make the tracking and decision making more efficient. Our experiments show that policy search leads to faster task completion times as well as higher total reward compared to a manually crafted policy. Smoothed Sarsa learns a policy orders of magnitude faster than previous policy search algorithms. We demonstrate our results on the Player/Stage simulator and on the Pioneer robot.

negative: A Wideband Dual-Polarized Dielectric Magnetoelectric Dipole Antenna A new wideband ±45° dual-polarized metal loop dielectric resonator magnetoelectric antenna is proposed in this communication. The antenna consists of two orthogonal dielectric bars that support two orthogonal electric dipoles and two cross interlaced metal semi-loops that are equivalent to two orthogonal magnetic dipoles above the ground. With a legitimate combination of the electric and magnetic dipoles, a unidirectional radiation with low backward radiation and equal E-plane and H-plane radiation patterns can be achieved. The antenna can be made of a monolithic dielectric block with simple installation. To validate the new antenna configuration, a prototype is designed, manufactured, and measured. The prototype antenna using ceramic with the electrical size of <inline-formula> <tex-math notation="LaTeX">$0.33\lambda _{o} \times 0.33\lambda _{o} \times 0.21\lambda _{o}$ </tex-math></inline-formula> demonstrates that an impedance bandwidth of 11.4% (<inline-formula> <tex-math notation="LaTeX">$\vert S_{11}\vert < -15$ </tex-math></inline-formula> dB) in the 3.5 GHz frequency band can be achieved with the measured forward/backward ratio of better than 22 dB. The proposed antenna is suitable as antenna element for massive-MIMO array antennas, where a large number of antenna elements need to be installed in a compact space.

negative: Neural Monkey: The Current State and Beyond Neural Monkey is an open-source toolkit for sequence-to-sequence learning. The focus of this paper is to present the current state of the toolkit to the intended audience, which includes students and researchers, both active in the deep learning community and newcomers. For each of these target groups, we describe the most relevant features of the toolkit, including the simple configuration scheme, methods of model inspection that promote useful intuitions, or a modular design for easy prototyping. We summarize relevant contributions to the research community which were made using this toolkit and discuss the characteristics of our toolkit with respect to other existing systems. We conclude with a set of proposals for future development.

negative: Introduction to the talking points project A number of systems, technological and otherwise, exist for helping blind and visually impaired users navigate from place to place. [5, 3] However, in focusing only on the destination, these systems often neglect the journey. We propose to rectify this, with a device to improve a user’s peripheral awareness of their surroundings. This is the motivation and the primary goal of this project. The Talking Points project aims to create a system for attaching information to places and objects, in a format that can be easily converted to speech. It allows blind and visually impaired users to get information about the places and objects they are walking by, and can also be used to provide digital information to other passersby. We have created a proof-of-concept of this system. The system reads passive RFID tags from a mobile reader. It looks up a tag’s ID number to find associated text, then uses text-to-speech software to read that speech to the user.

negative: CAST: Collaborative Agents for Simulating Teamwork Psychological studies on teamwork have shown that an effective team often can anticipate information needs of teammates based on a shared mental model. Existing multi-agent models for teamwork are limited in their ability to support proactive information exchange among teammates. To address this issue, we have developed and implemented a multi-agent architecture called CAST that simulates teamwork and supports proactive information exchange in a dynamic environment. We present a formal model for proactive information exchange. Knowledge regarding the structure and process of a team is described in a language called MALLET. Beliefs about shared team processes and their states are represented using Petri Nets. Based on this model, CAST agents offer information proactively to those who might need it using an algorithm called DIARG. Empirical evaluations using a multi-agent synthetic testbed application indicate that CAST enhances the effectiveness of teamwork among agents without sacrificing a high cost for communications.

negative: Community Detection in Networks using Node Attributes and Modularity Community detection in network is of vital importance to find cohesive subgroups. Node attributes can improve the accuracy of community detection when combined with link information in a graph. Community detection using node attributes has not been investigated in detail. To explore the aforementioned idea, we have adopted an approach by modifying the Louvain algorithm. We have proposed Louvain-ANDAttribute (LAA) and Louvain-OR-Attribute (LOA) methods to analyze the effect of using node attributes with modularity. We compared this approach with existing community detection approaches using different datasets. We found the performance of both algorithms better than Newman’s Eigenvector method in achieving modularity and relatively good results of gain in modularity in LAA than LOA. We used density, internal and external edge density for the evaluation of quality of detected communities. LOA provided highly dense partitions in the network as compared to Louvain and Eigenvector algorithms and close values to Clauset. Moreover, LOA achieved few numbers of edges between communities. Keywords—Community Detection; Louvain algorithm; Node attributes; and Modularity

negative: ON SUPERVISED AND SEMI-SUPERVISED k-NEAREST NEIGHBOR ALGORITHMS The k-nearest neighbor (kNN) is one of the simplest classification methods used in machine learning. Since the main component of kNN is a distance metric, kernelization of kNN is possible. In this paper kNN and semi-supervised kNN algorithms are empirically compared on two data sets (the USPS data set and a subset of the Reuters-21578 text categorization corpus). We use a soft version of the kNN algorithm to handle multi-label classification settings. Semi-supervision is performed by using data-dependent kernels.

negative: Maximum Margin Clustering We propose a new method for clustering based on finding maximum margin hyperplanes through data. By reformulating the problem in terms of the implied equivalence relation matrix, we can pose the problem as a convex integer program. Although this still yields a difficult computational problem, the hard-clustering constraints can be relaxed to a soft-clustering formulation which can be feasibly solved with a semidefinite program. Since our clustering technique only depends on the data through the kernel matrix, we can easily achieve nonlinear clusterings in the same manner as spectral clustering. Experimental results show that our maximum margin clustering technique often obtains more accurate results than conventional clustering methods. The real benefit of our approach, however, is that it leads naturally to a semi-supervised training method for support vector machines. By maximizing the margin simultaneously on labeled and unlabeled training data, we achieve state of the art performance by using a single, integrated learning principle.

negative: Semi-Supervised Kernel Matching for Domain Adaptation In this paper, we propose a semi-supervised kernel matching method to address domain adaptation problems where the source distribution substantially differs from the target distribution. Specifically, we learn a prediction function on the labeled source data while mapping the target data points to similar source data points by matching the target kernel matrix to a submatrix of the source kernel matrix based on a Hilbert Schmidt Independence Criterion. We formulate this simultaneous learning and mapping process as a non-convex integer optimization problem and present a local minimization procedure for its relaxed continuous form. Our empirical results show the proposed kernel matching method significantly outperforms alternative methods on the task of cross domain sentiment classification.

negative: Kernel auto-encoder for semi-supervised hashing Hashing-based approaches have gained popularity for large-scale image retrieval in recent years. It has been shown that semi-supervised hashing, which incorporates similarity/dissimilarity information into hash function learning could improve the hashing quality. In this paper, we present a novel kernel-based semi-supervised binary hashing model for image retrieval by taking into account auxiliary information, i.e., similar and dissimilar data pairs in achieving high quality hashing. The main idea is to map the data points into a highly non-linear feature space and then map the non-linear features into compact binary codes such that similar/dissimilar data points have similar/dissimilar hash codes. Empirical evaluations on three benchmark datasets demonstrate the superiority of the proposed method over several existing unsupervised and semi-supervised hash function learning methods.

negative: Semi-supervised Semantic Pattern Discovery with Guidance from Unsupervised Pattern Clusters We present a simple algorithm for clustering semantic patterns based on distributional similarity and use cluster memberships to guide semi-supervised pattern discovery. We apply this approach to the task of relation extraction. The evaluation results demonstrate that our novel bootstrapping procedure significantly outperforms a standard bootstrapping. Most importantly, our algorithm can effectively prevent semantic drift and provide semi-supervised learning with a natural stopping criterion.

negative: Semi-supervised Learning by Entropy Minimization We consider the semi-supervised learning problem, where a decision rule is to be learned from labeled and unlabeled data. In this framework, we motivate minimum entropy regularization, which enables to incorporate unlabeled data in the standard supervised learning. Our approach includes other approaches to the semi-supervised problem as particular or limiting cases. A series of experiments illustrates that the proposed solutions benefit from unlabeled data. The method challenges mixture models when the data are sampled from the distribution class spanned by the generative model. The performances are definitely in favor of minimum entropy regularization when generative models are misspecified, and the weighting of unlabeled data provides robustness to the violation of the “cluster assumption”. Finally, we also illustrate that the method can also be far superior to manifold learning in high dimension spaces.

negative: Supervised LogEuclidean Metric Learning for Symmetric Positive Definite Matrices Metric learning has been shown to be highly effective to improve the performance of nearest neighbor classification. In this paper, we address the problem of metric learning for symmetric positive definite (SPD) matrices such as covariance matrices, which arise in many real-world applications. Naively using standard Mahalanobis metric learning methods under the Euclidean geometry for SPD matrices is not appropriate, because the difference of SPD matrices can be a non-SPD matrix and thus the obtained solution can be uninterpretable. To cope with this problem, we propose to use a properly parameterized LogEuclidean distance and optimize the metric with respect to kernel-target alignment, which is a supervised criterion for kernel learning. Then the resulting non-trivial optimization problem is solved by utilizing the Riemannian geometry. Finally, we experimentally demonstrate the usefulness of our LogEuclidean metric learning algorithm on real-world classification tasks for EEG signals and texture patches.


query: Predicting task from eye movements: On the importance of spatial distribution, dynamics, and image features

positive: Quantitative Analysis of Human-Model Agreement in Visual Saliency Modeling: A Comparative Study Visual attention is a process that enables biological and machine vision systems to select the most relevant regions from a scene. Relevance is determined by two components: 1) top-down factors driven by task and 2) bottom-up factors that highlight image regions that are different from their surroundings. The latter are often referred to as “visual saliency.” Modeling bottom-up visual saliency has been the subject of numerous research efforts during the past 20 years, with many successful applications in computer vision and robotics. Available models have been tested with different datasets (e.g., synthetic psychological search arrays, natural images or videos) using different evaluation scores (e.g., search slopes, comparison to human eye tracking) and parameter settings. This has made direct comparison of models difficult. Here, we perform an exhaustive comparison of 35 state-of-the-art saliency models over 54 challenging synthetic patterns, three natural image datasets, and two video datasets, using three evaluation scores. We find that although model rankings vary, some models consistently perform better. Analysis of datasets reveals that existing datasets are highly center-biased, which influences some of the evaluation scores. Computational complexity analysis shows that some models are very fast, yet yield competitive eye movement prediction accuracy. Different models often have common easy/difficult stimuli. Furthermore, several concerns in visual saliency modeling, eye movement datasets, and evaluation scores are discussed and insights for future work are provided. Our study allows one to assess the state-of-the-art, helps to organizing this rapidly growing field, and sets a unified comparison framework for gauging future efforts, similar to the PASCAL VOC challenge in the object recognition and detection domains.

positive: Task and context determine where you look. The deployment of human gaze has been almost exclusively studied independent of any specific ongoing task and limited to two-dimensional picture viewing. This contrasts with its use in everyday life, which mostly consists of purposeful tasks where gaze is crucially involved. To better understand deployment of gaze under such circumstances, we devised a series of experiments, in which subjects navigated along a walkway in a virtual environment and executed combinations of approach and avoidance tasks. The position of the body and the gaze were monitored during the execution of the task combinations and dependence of gaze on the ongoing tasks as well as the visual features of the scene was analyzed. Gaze distributions were compared to a random gaze allocation strategy as well as a specific "saliency model." Gaze distributions showed high similarity across subjects. Moreover, the precise fixation locations on the objects depended on the ongoing task to the point that the specific tasks could be predicted from the subject's fixation data. By contrast, gaze allocation according to a random or a saliency model did not predict the executed fixations or the observed dependence of fixation locations on the specific task.

positive: A Model of Saliency-Based Visual Attention for Rapid Scene Analysis A visual attention system, inspired by the behavior and the neuronal architecture of the early primate visual system, is presented. Multiscale image features are combined into a single topographical saliency map. A dynamical neural network then selects attended locations in order of decreasing saliency. The system breaks down the complex problem of scene understanding by rapidly selecting, in a computationally efficient manner, conspicuous locations to be analyzed in detail.

positive: Task constraints in visual working memory This paper examines the nature of visual representations that direct ongoing performance in sensorimotor tasks. Performance of such natural tasks requires relating visual information from different gaze positions. To explore this we used the technique of making task relevant display changes during saccadic eye movements. Subjects copied a pattern of colored blocks on a computer monitor, using the mouse to drag the blocks across the screen. Eye position was monitored using a dual-purkinje eye tracker, and the color of blocks in the pattern was changed at different points in task performance. When the target of the saccade changed color during the saccade, the duration of fixations on the model pattern increased, depending on the point in the task that the change was made. Thus different fixations on the same visual stimulus served a different purpose. The results also indicated that the visual information that is retained across successive fixations depends on moment by moment task demands. This is consistent with previous suggestions that visual representations are limited and task dependent. Changes in blocks in addition to the saccade target led to greater increases in fixation duration. This indicated that some global aspect of the pattern was retained across different fixations. Fixation durations revealed effects of the display changes that were not revealed in perceptual report. This can be understood by distinguishing between processes that operate at different levels of description and different time scales. Our conscious experience of the world may reflect events over a longer time scale than those underlying the substructure of the perceptuo-motor machinery.

positive: An Integrated Model of Top-Down and Bottom-Up Attention for Optimizing Detection Speed Integration of goal-driven, top-down attention and image-driven, bottom-up attention is crucial for visual search. Yet, previous research has mostly focused on models that are purely top-down or bottom-up. Here, we propose a new model that combines both. The bottom-up component computes the visual salience of scene locations in different feature maps extracted at multiple spatial scales. The topdown component uses accumulated statistical knowledge of the visual features of the desired search target and background clutter, to optimally tune the bottom-up maps such that target detection speed is maximized. Testing on 750 artificial and natural scenes shows that the model’s predictions are consistent with a large body of available literature on human psychophysics of visual search. These results suggest that our model may provide good approximation of how humans combine bottom-up and top-down cues such as to optimize target detection speed.

negative: Factors affecting the acceptance of information systems supporting emergency operations centres Despite the recognition that information system acceptance is an important antecedent of effective emergency management, there has been comparatively very little research examining this aspect of technology acceptance. The current research responded to this gap in literature by adapting and integrating existing models of technology acceptance. This was done in order to examine how a range of technology acceptance factors could affect the acceptance of emergency operations centre information systems. Relationships between several of these factors were also examined. Questionnaire data from 383 end-users of four different emergency operations centre information systems were analysed using structural equation modelling. This analysis concluded that technology acceptance factors of performance expectancy, effort expectancy, social influence and information quality explained 65 percent of variance in symbolic adoption, which is a combination of mental acceptance and psychological attachment towards an information system. A number of moderating effects of age, gender, experience of use and domain experience were also identified. A mediating component, of performance expectancy, explained 49 percent of variance between facilitating conditions, information quality, effort expectancy, and resulting symbolic adoption. These findings highlight a need to re-focus technology acceptance research on both mediating and moderating effects and the importance of considering domain specific factors. Applied recommendations are also made, for successfully implementing relevant information

negative: Interventions to address the academic impairment of children and adolescents with ADHD. There exists a strong link between ADHD and academic underachievement. Both the core behavioral symptoms of ADHD and associated executive functioning deficits likely contribute to academic impairment. Current evidence-based approaches to the treatment of ADHD (i.e., stimulant medication, clinical behavior therapy and classroom behavioral interventions) have demonstrated a robust impact on behavioral variables such as attention and disruptive behavior within classroom analogue settings; however, their efficacy in improving academic outcomes is much less clear. Although surprisingly few treatment outcome studies of ADHD have attempted to incorporate interventions that specifically target academic outcomes, the studies that are available suggest that these interventions may be beneficial. The state of the treatment literature for addressing academic impairment in children and adolescents with ADHD will be reviewed herein, as well as limitations of current research, and directions for future research.

negative: Intravesical stone formation on intrauterine contraceptive device Since more than 30 years, intrauterine contraceptive devices (IUCD) have been used for a contraceptive opportunity. Although they are termed to be a safe and effective method for contraception, they also have some type of complications and uterine perforation, septic abortion, pelvic abscess are the serious complications of these devices. The incidence of uterine perforation is very low, but in the literature nearly 100 cases were reported about the extra uterine localization of IUCD. Migration may occur to the adjacent organs. We here in describe a case of a 31 year-old woman who had an IUCD with stone formation in the bladder. In the literature all of the cases were reported as IUCD migration, but although it seems technically impossible, IUCD placement into the bladder should also be considered in misplaced IUCDs.

negative: Offset calibration technique for capacitive transimpedance amplifier used in uncooled infrared detection This paper presents a novel readout circuit of uncooled, bolometer-based, focal plane arrays (FPAs). The offset and flicker noise are the design challenges of microbolometer readout circuits (ROCs). The ROC is not only required to apply careful noise cancellation techniques, but also to be insensitive to process and supply voltage variations. The proposed circuit involves a new offset cancellation technique which overcomes process variations, noise, random, and systematic offset. & 2016 Elsevier Ltd. All rights reserved.

negative: Big data framework for students' academic performance prediction: A systematic literature review Big Data is becoming an integral part of education system worldwide, bringing in so much of prediction potential and therefore opportunities to improve learning and teaching methodologies. In fact, it has become the digital policy instrument for policy makers to make strategic decisions supported by big data analytics. This paper uses Systematic Literature Review (SLR) to establish a general overview and background in establishing gaps that need to be addressed in big data analytics for education landscape. A total of 59 research papers from 473 papers were chosen and analyzed. There is an increased trend in incorporating big data in education however, it is not sufficient and need more research in this area particularly predictive models and frameworks for educational settings.

negative: Seismic surveying with drone-mounted geophones Seismic imaging is the primary technique for subsurface exploration. Traditional seismic imaging techniques rely heavily on manual labor to plant sensors, lay miles of cabling, and then recover the sensors. Often sites of resource or rescue interest may be difficult or hazardous to access. Thus, there is a substantial need for unmanned sensors that can be deployed by air and potentially in large numbers. This paper presents working prototypes of autonomous drones equipped with geophones (vibration sensors) that can fly to a site, land, listen for echoes and vibrations, store the information on-board, and subsequently return to home base. The design uses four geophone sensors (with spikes) in place of the landing gear. This provides a stable landing attitude, redundancy in sensing, and ensures the geophones are oriented perpendicular to the ground. The paper describes hardware experiments demonstrating the efficacy of this technique and a comparison with traditional manual techniques. The performance of the seismic drone was comparable to a well planted geophone, proving the drone mount system is a feasible alternative to traditional seismic sensors.

negative:
Prevalence of diabetes mellitus and impaired fasting glucose levels in the Eastern Province of Saudi Arabia: results of a screening campaign. INTRODUCTION
This study aimed to estimate the prevalence of diagnosed and undiagnosed diabetes mellitus (DM) in the Eastern Province of Saudi Arabia, and to study its relationship with socioeconomic factors.

METHODS
The study targeted all Saudi subjects aged 30 years and above who resided in the Eastern Province in 2004. DM screening was conducted by taking the capillary fasting blood glucose (CFBG) after eight hours or more of fasting, or the casual capillary blood glucose (CCBG). A positive screening test for hyperglycaemia was defined as CFBG more than or equal to 100 mg/dl (5.6 mmol/l), or CCBG more than or equal to 140 mg/dl (7.8 mmol/l). A positive result was confirmed on another day through the measurement of fasting plasma glucose (FPG) levels from a venous sample. A diagnosis of DM was considered if FPG was more than or equal to 126 mg/dl (7.0 mmol/l), or when there was a history of a previous diagnosis.

RESULTS
Out of 197,681 participants, 35,929 (18.2 percent) had a positive history of DM or a positive screening test for hyperglycaemia. After confirmation by venous blood testing, the prevalence of DM dropped to 17.2 percent while the prevalence of newly diagnosed DM was 1.8 percent. The prevalence increased with age and was higher in women, widows, divorcees, those who had a low education level and the unemployed.

CONCLUSION
The prevalence of DM in Saudi Arabia is one of the highest reported in the world, and its yield of screening is high.

negative:
Articulation points guided redundancy elimination for betweenness centrality Betweenness centrality (BC) is an important metrics in graph analysis which indicates critical vertices in large-scale networks based on shortest path enumeration. Typically, a BC algorithm constructs a shortest-path DAG for each vertex to calculate its BC score. However, for emerging real-world graphs, even the state-of-the-art BC algorithm will introduce a number of redundancies, as suggested by the existence of articulation points. Articulation points imply some common sub-DAGs in the DAGs for different vertices, but existing algorithms do not leverage such information and miss the optimization opportunity.
 We propose a redundancy elimination approach, which identifies the common sub-DAGs shared between the DAGs for different vertices. Our approach leverages the articulation points and reuses the results of the common sub-DAGs in calculating the BC scores, which eliminates redundant computations. We implemented the approach as an algorithm with two-level parallelism and evaluated it on a multicore platform. Compared to the state-of-the-art implementation using shared memory, our approach achieves an average speedup of 4.6x across a variety of real-world graphs, with the traversal rates up to 45 ~ 2400 MTEPS (Millions of Traversed Edges per Second).

negative: Audio-Visual Person Recognition in Multimedia Data From the Iarpa Janus Program Currently, datasets that support audio-visual recognition of people in videos are scarce and limited. In this paper, we introduce an expansion of video data from the IARPA Janus program to support this research area. We refer to the expanded set, which adds labels for voice to the already-existing face labels, as the Janus Multimedia dataset. We first describe the speaker labeling process, which involved a combination of automatic and manual criteria. We then discuss two evaluation settings for this data. In the core condition, the voice and face of the labeled individual are present in every video. In the full condition, no such guarantee is made. The power of audiovisual fusion is then shown using these publicly-available videos and labels, showing significant improvement over only recognizing voice or face alone. In addition to this work, several other possible paths for future research with this dataset are discussed.

negative: Development of 24 GHz rectennas for Fixed Wireless Access We need electricity to use wireless information. If we reduce amount of batteries or electrical wires with a wireless power transmission technology via microwave (MPT), it is a green communication system. We Kyoto University propose a Fixed Wireless Access (FWA) system with the MPT with NTT, Japan. In this paper, we show mainly development results of 24GHz rectennas, rectifying antenna, for FWA. We developed some types of the rectennas. Finally we achieve 65% of RF-DC conversion efficiency with output filter of harmonic balance.

negative: A Weighted Dictionary Learning Model for Denoising Images Corrupted by Mixed Noise This paper proposes a general weighted l2-l0 norms energy minimization model to remove mixed noise such as Gaussian-Gaussian mixture, impulse noise, and Gaussian-impulse noise from the images. The approach is built upon maximum likelihood estimation framework and sparse representations over a trained dictionary. Rather than optimizing the likelihood functional derived from a mixture distribution, we present a new weighting data fidelity function, which has the same minimizer as the original likelihood functional but is much easier to optimize. The weighting function in the model can be determined by the algorithm itself, and it plays a role of noise detection in terms of the different estimated noise parameters. By incorporating the sparse regularization of small image patches, the proposed method can efficiently remove a variety of mixed or single noise while preserving the image textures well. In addition, a modified K-SVD algorithm is designed to address the weighted rank-one approximation. The experimental results demonstrate its better performance compared with some existing methods.

negative: Maladaptive and adaptive emotion regulation through music: a behavioral and neuroimaging study of males and females Music therapists use guided affect regulation in the treatment of mood disorders. However, self-directed uses of music in affect regulation are not fully understood. Some uses of music may have negative effects on mental health, as can non-music regulation strategies, such as rumination. Psychological testing and functional magnetic resonance imaging (fMRI) were used explore music listening strategies in relation to mental health. Participants (n = 123) were assessed for depression, anxiety and Neuroticism, and uses of Music in Mood Regulation (MMR). Neural responses to music were measured in the medial prefrontal cortex (mPFC) in a subset of participants (n = 56). Discharge, using music to express negative emotions, related to increased anxiety and Neuroticism in all participants and particularly in males. Males high in Discharge showed decreased activity of mPFC during music listening compared with those using less Discharge. Females high in Diversion, using music to distract from negative emotions, showed more mPFC activity than females using less Diversion. These results suggest that the use of Discharge strategy can be associated with maladaptive patterns of emotional regulation, and may even have long-term negative effects on mental health. This finding has real-world applications in psychotherapy and particularly in clinical music therapy.

negative: Guido: A Musical Score Recognition System This paper presents an optical music recognition system Guido that can automatically recognize the main musical symbols of music scores that were scanned or taken by a digital camera. The application is based on object model of musical notation and uses linguistic approach for symbol interpretation and error correction. The system offers musical editor with a partially automatic error correction.

negative: Batteries and Ultracapacitors for Electric, Hybrid, and Fuel Cell Vehicles The application of batteries and ultracapacitors in electric energy storage units for battery powered (EV) and charge sustaining and plug-in hybrid-electric (HEV and PHEV) vehicles have been studied in detail. The use of IC engines and hydrogen fuel cells as the primary energy converters for the hybrid vehicles was considered. The study focused on the use of lithium-ion batteries and carbon/carbon ultracapacitors as the energy storage technologies most likely to be used in future vehicles. The key findings of the study are as follows. 1) The energy density and power density characteristics of both battery and ultracapacitor technologies are sufficient for the design of attractive EVs, HEVs, and PHEVs. 2) Charge sustaining, engine powered hybrid-electric vehicles (HEVs) can be designed using either batteries or ultracapacitors with fuel economy improvements of 50% and greater. 3) Plug-in hybrids (PHEVs) can be designed with effective all-electric ranges of 30-60 km using lithium-ion batteries that are relatively small. The effective fuel economy of the PHEVs can be very high (greater than 100 mpg) for long daily driving ranges (80-150 km) resulting in a large fraction (greater than 75%) of the energy to power the vehicle being grid electricity. 4) Mild hybrid-electric vehicles (MHEVs) can be designed using ultracapacitors having an energy storage capacity of 75-150 Wh. The fuel economy improvement with the ultracapacitors is 10%-15% higher than with the same weight of batteries due to the higher efficiency of the ultracapacitors and more efficient engine operation. 5) Hybrid-electric vehicles powered by hydrogen fuel cells can use either batteries or ultracapacitors for energy storage. Simulation results indicate the equivalent fuel economy of the fuel cell powered vehicles is 2-3 times higher than that of a gasoline fueled IC vehicle of the same weight and road load. Compared to an engine-powered HEV, the equivalent fuel economy of the hydrogen fuel cell vehicle would be 1.66-2.0 times higher

negative: Multi-label Text Categorization with Model Combination based on F1-score Maximization Text categorization is a fundamental task in natural language processing, and is generally defined as a multi-label categorization problem, where each text document is assigned to one or more categories. We focus on providing good statistical classifiers with a generalization ability for multi-label categorization and present a classifier design method based on model combination and F1-score maximization. In our formulation, we first design multiple models for binary classification per category. Then, we combine these models to maximize the F1-score of a training dataset. Our experimental results confirmed that our proposed method was useful especially for datasets where there were many combinations of category labels.

negative: On accelerating pair-HMM computations in programmable hardware This paper explores hardware acceleration to significantly improve the runtime of computing the forward algorithm on Pair-HMM models, a crucial step in analyzing mutations in sequenced genomes. We describe 1) the design and evaluation of a novel accelerator architecture that can efficiently process real sequence data without performing wasteful work; and 2) aggressive memoization techniques that can significantly reduce the number of invocations of, and the amount of data transferred to the accelerator. We describe our demonstration of the design on a Xilinx Virtex 7 FPGA in an IBM Power8 system. Our design achieves a 14.85× higher throughput than an 8-core CPU baseline (that uses SIMD and multi-threading) and a 147.49 × improvement in throughput per unit of energy expended on the NA12878 sample.

negative: The human connectome: Origins and challenges The human connectome refers to a map of the brain's structural connections, rendered as a connection matrix or network. This article attempts to trace some of the historical origins of the connectome, in the process clarifying its definition and scope, as well as its putative role in illuminating brain function. Current efforts to map the connectome face a number of significant challenges, including the issue of capturing network connectivity across multiple spatial scales, accounting for individual variability and structural plasticity, as well as clarifying the role of the connectome in shaping brain dynamics. Throughout, the article argues that these challenges require the development of new approaches for the statistical analysis and computational modeling of brain network data, and greater collaboration across disciplinary boundaries, especially with researchers in complex systems and network science.

negative: NLTK: The Natural Language Toolkit NLTK, the Natural Language Toolkit, is a suite of open source program modules, tutorials and problem sets, providing ready-to-use computational linguistics courseware. NLTK covers symbolic and statistical natural language processing, and is interfaced to annotated corpora. Students augment and replace existing components, learn structured programming by example, and manipulate sophisticated models from the outset.

negative: Fully convolutional networks for multi-modality isointense infant brain image segmentation The segmentation of infant brain tissue images into white matter (WM), gray matter (GM), and cerebrospinal fluid (CSF) plays an important role in studying early brain development. In the isointense phase (approximately 6–8 months of age), WM and GM exhibit similar levels of intensity in both T1 and T2 MR images, resulting in extremely low tissue contrast and thus making the tissue segmentation very challenging. The existing methods for tissue segmentation in this isointense phase usually employ patch-based sparse labeling on single T1, T2 or fractional anisotropy (FA) modality or their simply-stacked combinations without fully exploring the multi-modality information. To address the challenge, in this paper, we propose to use fully convolutional networks (FCNs) for the segmentation of isointense phase brain MR images. Instead of simply stacking the three modalities, we train one network for each modality image, and then fuse their high-layer features together for final segmentation. Specifically, we conduct a convolution-pooling stream for multimodality information from T1, T2, and FA images separately, and then combine them in high-layer for finally generating the segmentation maps as the outputs. We compared the performance of our approach with that of the commonly used segmentation methods on a set of manually segmented isointense phase brain images. Results showed that our proposed model significantly outperformed previous methods in terms of accuracy. In addition, our results also indicated a better way of integrating multi-modality images, which leads to performance improvement.

negative: A 24-GHz high-gain Yagi-Uda antenna array A compact 24-GHz Yagi-Uda antenna has been developed using standard design tables and simple scaling to take into account the added capacitance due to the supporting dielectric substrate. The antenna results in a directivity of 9.3 dB, a front-to-back ratio of 11 dB, and a bandwidth of 2.5-3%. The Yagi-Uda antenna has been implemented in an 11-beam system using a planar array and a 2-inch Teflon spherical lens. The measured patterns show a 22 dB gain beam, a cross-polarization level of -24 dB, and a crossover level of -6 dB. The design method presented in this paper is quite straightforward, and can be used to develop low-, medium-, and even high-gain endfire Yagi-Uda antennas.

negative: A Decomposed Dual-Cross Generative Adversarial Network for Image Rain Removal Rain removal is important for many computer vision applications, such as surveillance, autonomous car, etc. Traditionally, rain removal is regarded as a signal removal problem which usually causes over-smoothing by removing texture details in non-rain background regions. This paper considers the issue of rain removal from a completely different perspective, to treat rain removal as a signal decomposition problem. Specifically, we decompose the rain image into two components, namely non-rain background image and rain streaks image. Then, we introduce an adversarial training mechanism to synthesize non-rain background image and rain streaks image in a Dual-Cross manner, which makes the two adversarial branches interact with each other, archiving a win-win result ultimately. The proposed Decomposed Dual-Cross Generative Adversarial Network (DDC-GAN) shows significantly performance improvement compared with stateof-the-art methods on both synthetic and real-world images in terms of qualitative and quantitative measures (over 3dB gains in PSNR).

negative: Content-based audio segmentation using support vector machines Audio exists at everywhere, but is often out-of-order. It is necessary to arrange them into regularized classes in order to use them more easily. It is also useful, especially in video content analysis, to segment an audio stream according to audio types. In this paper, we present our work in applying support vector machines (SVMs) in audio segmentation and classification. Five audio classes are considered: silence, music, background sound, pure speech, and non-pure speech which includes speech over music and speech over noise. A SVM learns optimal class boundaries from training data to best separate between two classes. A sound clip is segmented by classifying each sub-clip of one second into one of these five classes. Experiments on a database composed of clips of 14870 seconds in total length show that the average accuracy rate for the SVM method is much better than that of the traditional Euclidean distance based (nearest neighbor) method.

negative: Building contextual visual vocabulary for large-scale image applications Not withstanding its great success and wide adoption in Bag-of-visual Words representation, visual vocabulary created from single image local features is often shown to be ineffective largely due to three reasons. First, many detected local features are not stable enough, resulting in many noisy and non-descriptive visual words in images. Second, single visual word discards the rich spatial contextual information among the local features, which has been proven to be valuable for visual matching. Third, the distance metric commonly used for generating visual vocabulary does not take the semantic context into consideration, which renders them to be prone to noise. To address these three confrontations, we propose an effective visual vocabulary generation framework containing three novel contributions: 1) we propose an effective unsupervised local feature refinement strategy; 2) we consider local features in groups to model their spatial contexts; 3) we further learn a discriminant distance metric between local feature groups, which we call discriminant group distance. This group distance is further leveraged to induce visual vocabulary from groups of local features. We name it contextual visual vocabulary, which captures both the spatial and semantic contexts. We evaluate the proposed local feature refinement strategy and the contextual visual vocabulary in two large-scale image applications: large-scale near-duplicate image retrieval on a dataset containing 1.5 million images and image search re-ranking tasks. Our experimental results show that the contextual visual vocabulary shows significant improvement over the classic visual vocabulary. Moreover, it outperforms the state-of-the-art Bundled Feature in the terms of retrieval precision, memory consumption and efficiency.

negative: Paraphrase Identification Based on Weighted URAE, Unit Similarity and Context Correlation Feature A deep learning model adaptive to both sentence-level and articlelevel paraphrase identification is proposed in this paper. It consists of pairwise unit similarity feature and semantic context correlation feature. In this model, sentences are represented by word and phrase embedding while articles are represented by sentence embedding. Those phrase and sentence embedding are learned from parse trees through Weighted Unfolding Recursive Autoencoders (WURAE), an unsupervised learning algorithm. Then, unit similarity matrix is calculated by matching the pairwise lists of embedding. It is used to extract the pairwise unit similarity feature through CNN and k-max pooling layers. In addition, semantic context correlation feature is taken into account, which is captured by the combination of CNN and LSTM. CNN layers learn collocation information between adjacent units while LSTM extracts the long-term dependency feature of the text based on the output of CNN. This model is experimented on a famous English sentence paraphrase corpus, MSRPC, and a Chinese article paraphrase corpus. The results show that the deep semantic feature of text could be extracted based on WURAE, unit similarity and context correlation feature. We release our code of WURAE, deep learning model for paraphrase identification and pre-trained phrase end sentence embedding data for use by the community.

negative: The impact of cyberloafing towards Malaysia employees' productivity: A conceptual framework The increasing use of the internet has changed the way we live and work. Moreover, in countries where there is a use of internet on a large scale, changes in the content and context of work have been observed. The use of Internet has become a tool to achieve competitive advantage by organizations. Also, it has been associated with many negative consequences such as reduced employees' productivity. Despite its importance, there is a lack of cyberloafing studies in Malaysia. The paper proposes a modified version of Triandis's theory of interpersonal behaviour by incorporating a new independent variable, ability to hide cyberloafing that directly predicts employees cyberloafing. This paper also recommends examining the relationship between cyberloafing and employees' productivity. Some studies believe that cyberloafing is beneficial for employees' productivity but other studies suggest that it is harmful to employees' productivity. By understanding what causes cyberloafing and its impacts, organizations can be more effective in managing the issue.

negative: SCA-CNN: Spatial and Channel-Wise Attention in Convolutional Networks for Image Captioning Visual attention has been successfully applied in structural prediction tasks such as visual captioning and question answering. Existing visual attention models are generally spatial, i.e., the attention is modeled as spatial probabilities that re-weight the last conv-layer feature map of a CNN encoding an input image. However, we argue that such spatial attention does not necessarily conform to the attention mechanism — a dynamic feature extractor that combines contextual fixations over time, as CNN features are naturally spatial, channel-wise and multi-layer. In this paper, we introduce a novel convolutional neural network dubbed SCA-CNN that incorporates Spatial and Channel-wise Attentions in a CNN. In the task of image captioning, SCA-CNN dynamically modulates the sentence generation context in multi-layer feature maps, encoding where (i.e., attentive spatial locations at multiple layers) and what (i.e., attentive channels) the visual attention is. We evaluate the proposed SCA-CNN architecture on three benchmark image captioning datasets: Flickr8K, Flickr30K, and MSCOCO. It is consistently observed that SCA-CNN significantly outperforms state-of-the-art visual attention-based image captioning methods.

negative: Driver fatigue detection based on saccadic eye movements The correct determination of driver's level of fatigue has been of vital importance for the safety of driving. There are various methods, such as analyzing facial expression, eyelid activity, and head movements to assess the fatigue level of drivers. This paper describes the design and prototype implementation of a driver fatigue level determination system based on detection of saccadic eye movements. Driver's eye movement speed is used to assess driver's fatigue level. The information about eyes is obtained via infrared led camera device. Movements of pupils were recorded in two driving scenarios with different traffic density. In the first scenario, the traffic density was set to low while the second scenario was based on high density and aggressive traffic. Based on the movements of pupils, the data on saccadic eye movement was analyzed to determine fatigue level of the driver. Acceleration, speed, and size of pupils at both traffic scenarios were compared with data mining techniques, such as segmentation adaptive peak, entropy, and data distribution analyses. Significantly different levels of fatigue were found between the tired and vigorous driver for the different types of scenarios.

negative: How does EMDR work ? Eye movement desensitisation and reprocessing (EMDR) is an effective treatment for alleviating trauma symptoms, and the positive effects of this treatment have been scientifically confirmed under wellcontrolled conditions. This has provided an opportunity to explore how EMDR works. The present paper reports on the findings of a long series of experiments that disproved the hypothesis that eye movements or other ‘dual tasks’ are unnecessary. These experiments also disproved the idea that ‘bilateral stimulation’ is needed; moving the eyes up and down produces the same effect as horizontal eye movement, and so do tasks that require no eye movement at all. However, it is important that the dual task taxes working memory. Several predictions can be derived from the working memory explanation for eye movements in EMDR. These seem to hold up extremely well in critical experimental tests, and create a solid explanation on how eye movements work. This paper discusses the implications that this theory and the empirical findings may have for the EMDR technique. © Copyright 2012 Textrum Ltd. All rights reserved.

negative: Predictive coding: a fresh view of inhibition in the retina. Interneurons exhibiting centre--surround antagonism within their receptive fields are commonly found in peripheral visual pathways. We propose that this organization enables the visual system to encode spatial detail in a manner that minimizes the deleterious effects of intrinsic noise, by exploiting the spatial correlation that exists within natural scenes. The antagonistic surround takes a weighted mean of the signals in neighbouring receptors to generate a statistical prediction of the signal at the centre. The predicted value is subtracted from the actual centre signal, thus minimizing the range of outputs transmitted by the centre. In this way the entire dynamic range of the interneuron can be devoted to encoding a small range of intensities, thus rendering fine detail detectable against intrinsic noise injected at later stages in processing. This predictive encoding scheme also reduces spatial redundancy, thereby enabling the array of interneurons to transmit a larger number of distinguishable images, taking into account the expected structure of the visual world. The profile of the required inhibitory field is derived from statistical estimation theory. This profile depends strongly upon the signal: noise ratio and weakly upon the extent of lateral spatial correlation. The receptive fields that are quantitatively predicted by the theory resemble those of X-type retinal ganglion cells and show that the inhibitory surround should become weaker and more diffuse at low intensities. The latter property is unequivocally demonstrated in the first-order interneurons of the fly's compound eye. The theory is extended to the time domain to account for the phasic responses of fly interneurons. These comparisons suggest that, in the early stages of processing, the visual system is concerned primarily with coding the visual image to protect against subsequent intrinsic noise, rather than with reconstructing the scene or extracting specific features from it. The treatment emphasizes that a neuron's dynamic range should be matched to both its receptive field and the statistical properties of the visual pattern expected within this field. Finally, the analysis is synthetic because it is an extension of the background suppression hypothesis (Barlow & Levick 1976), satisfies the redundancy reduction hypothesis (Barlow 1961 a, b) and is equivalent to deblurring under certain conditions (Ratliff 1965).

negative: Top-down control of visual attention in object detection Current computational models of visual attention focus on bottom-up information and ignore scene context. However, studies in visual cognition show that humans use context to facilitate object detection in natural scenes by directing their attention or eyes to diagnostic regions. Here we propose a model of attention guidance based on global scene config uration. We show that the statistics of low-level features across the scene image determine where a specific object (e.g. a person) should be located. Human eye movements show that regions chosen by the top-down model agree with regions scrutinized by human observers performing a visual search task for people. The results validate the proposition that top-down information from visual context modulates the saliency of image regions during the task of object de tection. Contextual information provides a shortcut for effi cient object detection systems.

negative: Strabismus Recognition Using Eye-Tracking Data and Convolutional Neural Networks Strabismus is one of the most common vision diseases that would cause amblyopia and even permanent vision loss. Timely diagnosis is crucial for well treating strabismus. In contrast to manual diagnosis, automatic recognition can significantly reduce labor cost and increase diagnosis efficiency. In this paper, we propose to recognize strabismus using eye-tracking data and convolutional neural networks. In particular, an eye tracker is first exploited to record a subject's eye movements. A gaze deviation (GaDe) image is then proposed to characterize the subject's eye-tracking data according to the accuracies of gaze points. The GaDe image is fed to a convolutional neural network (CNN) that has been trained on a large image database called ImageNet. The outputs of the full connection layers of the CNN are used as the GaDe image's features for strabismus recognition. A dataset containing eye-tracking data of both strabismic subjects and normal subjects is established for experiments. Experimental results demonstrate that the natural image features can be well transferred to represent eye-tracking data, and strabismus can be effectively recognized by our proposed method.

negative: Learning Hand-Eye Coordination for Robotic Grasping with Large-Scale Data Collection We describe a learning-based approach to hand-eye coordination for robotic grasping from monocular images. To learn hand-eye coordination for grasping, we trained a large convolutional neural network to predict the probability that task-space motion of the gripper will result in successful grasps, using only monocular camera images and independently of camera calibration or the current robot pose. This requires the network to observe the spatial relationship between the gripper and objects in the scene, thus learning hand-eye coordination. We then use this network to servo the gripper in real time to achieve successful grasps. To train our network, we collected over 800,000 grasp attempts over the course of two months, using between 6 and 14 robotic manipulators at any given time, with differences in camera placement and hardware. Our experimental evaluation demonstrates that our method achieves effective real-time control, can successfully grasp novel objects, and corrects mistakes by continuous servoing.