query: From Softmax to Sparsemax: A Sparse Model of Attention and Multi-Label Classification

positive: Glove: Global Vectors for Word Representation Recent methods for learning vector space representations of words have succeeded in capturing fine-grained semantic and syntactic regularities using vector arithmetic, but the origin of these regularities has remained opaque. We analyze and make explicit the model properties needed for such regularities to emerge in word vectors. The result is a new global logbilinear regression model that combines the advantages of the two major model families in the literature: global matrix factorization and local context window methods. Our model efficiently leverages statistical information by training only on the nonzero elements in a word-word cooccurrence matrix, rather than on the entire sparse matrix or on individual context windows in a large corpus. The model produces a vector space with meaningful substructure, as evidenced by its performance of 75% on a recent word analogy task. It also outperforms related models on similarity tasks and named entity recognition.

positive: On the limited memory BFGS method for large scale optimization We study the numerical performance of a limited memory quasi Newton method for large scale optimization which we call the L BFGS method We compare its performance with that of the method developed by Buckley and LeNir which combines cyles of BFGS steps and conjugate direction steps Our numerical tests indicate that the L BFGS method is faster than the method of Buckley and LeNir and is better able to use additional storage to accelerate convergence We show that the L BFGS method can be greatly accelerated by means of a simple scaling We then compare the L BFGSmethod with the partitioned quasi Newton method of Griewank and Toint a The results show that for some problems the partitioned quasi Newton method is clearly superior to the L BFGS method However we nd that for other problems the L BFGS method is very competitive due to its low iteration cost We also study the convergence properties of the L BFGS method and prove global convergence on uniformly convex problems

positive: Show, Attend and Tell: Neural Image Caption Generation with Visual Attention Inspired by recent work in machine translation and object detection, we introduce an attention based model that automatically learns to describe the content of images. We describe how we can train this model in a deterministic manner using standard backpropagation techniques and stochastically by maximizing a variational lower bound. We also show through visualization how the model is able to automatically learn to fix its gaze on salient objects while generating the corresponding words in the output sequence. We validate the use of attention with state-of-theart performance on three benchmark datasets: Flickr9k, Flickr30k and MS COCO.

positive: RCV1: A New Benchmark Collection for Text Categorization Research Reuters Corpus Volume I (RCV1) is an archive of over 800,000 manually categorized newswire stories recently made available by Reuters, Ltd. for research purposes. Use of this data for research on text categorization requires a detailed understanding of the real world constraints under which the data was produced. Drawing on interviews with Reuters personnel and access to Reuters documentation, we describe the coding policy and quality control procedures used in producing the RCV1 data, the intended semantics of the hierarchical category taxonomies, and the corrections necessary to remove errorful data. We refer to the original data as RCV1-v1, and the corrected data as RCV1-v2. We benchmark several widely used supervised learning methods on RCV1-v2, illustrating the collection’s properties, suggesting new directions for research, and providing baseline results for future studies. We make available detailed, per-category experimental results, as well as corrected versions of the category assignments and taxonomy structures, via online appendices.

positive: Teaching Machines to Read and Comprehend Teaching machines to read natural language documents remains an elusive challenge. Machine reading systems can be tested on their ability to answer questions posed on the contents of documents that they have seen, but until now large scale training and test datasets have been missing for this type of evaluation. In this work we define a new methodology that resolves this bottleneck and provides large scale supervised reading comprehension data. This allows us to develop a class of attention based deep neural networks that learn to read real documents and answer complex questions with minimal prior knowledge of language structure.

negative: SEQUENCE BASED HIERARCHICAL CONFLICT-FREE ROUTING STRATEGY OF BI-DIRECTIONAL AUTOMATED GUIDED VEHICLES Conflict-free routing is an important problem to be addressed in AGV Systems, in particular when they are bi-directional. This paper considers the problem of routing AGVs in the presence of contingencies. The importance of this work stems from the realization that path-planning approaches are ill suited to AGVSs subject to contingencies. In this paper, a two stage closed-loop control strategy is proposed. In the first control stage, a pre-planning method proposed by Kim and Tanchoco (1991) is used to establish the fastest conflict-free routes for AGVs. The objective of the second stage is the avoidance of deadlocks in the presence of interruptions while maintaining the planned routes. Copyright © 2005 IFAC

negative: Have I really met timing? - validating primetime timing reports with SPICE At sign-off everybody is wondering about how good the accuracy of the static timing analysis timing reports generated with PrimeTime¯ really is. Errors can be introduced by STA setup, interconnect modeling, library characterization etc. The claims that path timingcalculated by PrimeTime usually is within a few percent of Spice don't help to ease your uncertainty.When the Signal Integrity features were introduced to PrimeTime there was also a feature added that was hardly announced: PrimeTime can write out timing paths for simulation with Spice that can be used to validate the timing numbers calculated by PrimeTime. By comparingthe numbers calculated by PrimeTime to a simulation with Spice for selected paths the designers can verify the timing and build up confidence or identify errors.This paper will describe a validation flow for PrimeTime timing reports that is based on extraction of the Spice paths, starting the Spice simulation, parsing the simulation results, and creating a report comparing PrimeTime and Spice timing. All these steps are done inside the TCL environment of PrimeTime. It will describe this flow, what is needed for the Spice simulation, how it can be set up, what can go wrong, and what kind of problems in the STA can be identified.

negative: A comparative review of tone-mapping algorithms for high dynamic range video Tone-mapping constitutes a key component within the field of high dynamic range (HDR) imaging. Its importance is manifested in the vast amount of tone-mapping methods that can be found in the literature, which are the result of an active development in the area for more than two decades. Although these can accommodate most requirements for display of HDR images, new challenges arose with the advent of HDR video, calling for additional considerations in the design of tone-mapping operators (TMOs). Today, a range of TMOs exist that do support video material. We are now reaching a point where most camera captured HDR videos can be prepared in high quality without visible artifacts, for the constraints of a standard display device. In this report, we set out to summarize and categorize the research in tone-mapping as of today, distilling the most important trends and characteristics of the tone reproduction pipeline. While this gives a wide overview over the area, we then specifically focus on tone-mapping of HDR video and the problems this medium entails. First, we formulate the major challenges a video TMO needs to address. Then, we provide a description and categorization of each of the existing video TMOs. Finally, by constructing a set of quantitative measures, we evaluate the performance of a number of the operators, in order to give a hint on which can be expected to render the least amount of artifacts. This serves as a comprehensive reference, categorization and comparative assessment of the state-of-the-art in tone-mapping for HDR video.

negative: Energy Management Based on Frequency Approach for Hybrid Electric Vehicle Applications: Fuel-Cell/Lithium-Battery and Ultracapacitors This paper presents the ultracapacitors (U) and fuel-cell/lithium-battery connection with an original energy management method for hybrid electric vehicle (HEV) applications. The proposed method is focused on the frequency approach to meet the load energy requirement. The ultracapacitors are connected to the dc link through a buck-boost converter, and the fuel cell is connected to the dc link via a boost converter for the first topology. In the second topology, the lithium battery is connected to the dc link without a converter to avoid the dc-link voltage control. An asynchronous machine is used like the traction motor; it is related to the dc link through a dc/ac converter (inverter). The main contribution of this paper is focused on HEV energy management according to the dynamics (frequency) of the hybrid sources using polynomial correctors. The performances of the proposed method are evaluated through some simulations and the experimental tests, using the New European Driving Cycle (NEDC). This study is extended to an aggressive test cycle, such as the U.S. driving cycle (USDC), to understand the system response and the control performances.

negative:
Randomized clinical trial of cognitive behavioral therapy (CBT) versus acceptance and commitment therapy (ACT) for mixed anxiety disorders. OBJECTIVE
Randomized comparisons of acceptance-based treatments with traditional cognitive behavioral therapy (CBT) for anxiety disorders are lacking. To address this gap, we compared acceptance and commitment therapy (ACT) to CBT for heterogeneous anxiety disorders.

METHOD
One hundred twenty-eight individuals (52% female, mean age = 38, 33% minority) with 1 or more DSM-IV anxiety disorders began treatment following randomization to CBT or ACT; both treatments included behavioral exposure. Assessments at pre-treatment, post-treatment, and 6- and 12-month follow-up measured anxiety-specific (principal disorder Clinical Severity Ratings [CSRs], Anxiety Sensitivity Index, Penn State Worry Questionnaire, Fear Questionnaire avoidance) and non-anxiety-specific (Quality of Life Index [QOLI], Acceptance and Action Questionnaire-16 [AAQ]) outcomes. Treatment adherence, therapist competency ratings, treatment credibility, and co-occurring mood and anxiety disorders were investigated.

RESULTS
CBT and ACT improved similarly across all outcomes from pre- to post-treatment. During follow-up, ACT showed steeper linear CSR improvements than CBT (p < .05, d = 1.26), and at 12-month follow-up, ACT showed lower CSRs than CBT among completers (p < .05, d = 1.10). At 12-month follow-up, ACT reported higher AAQ than CBT (p = .08, d = 0.42; completers: p < .05, d = 0.56), whereas CBT reported higher QOLI than ACT (p < .05, d = 0.42). Attrition and comorbidity improvements were similar; ACT used more non-study psychotherapy at 6-month follow-up. Therapist adherence and competency were good; treatment credibility was higher in CBT.

CONCLUSIONS
Overall improvement was similar between ACT and CBT, indicating that ACT is a highly viable treatment for anxiety disorders.

negative: Phylogeography of Y-chromosome haplogroup I reveals distinct domains of prehistoric gene flow in europe. To investigate which aspects of contemporary human Y-chromosome variation in Europe are characteristic of primary colonization, late-glacial expansions from refuge areas, Neolithic dispersals, or more recent events of gene flow, we have analyzed, in detail, haplogroup I (Hg I), the only major clade of the Y phylogeny that is widespread over Europe but virtually absent elsewhere. The analysis of 1,104 Hg I Y chromosomes, which were identified in the survey of 7,574 males from 60 population samples, revealed several subclades with distinct geographic distributions. Subclade I1a accounts for most of Hg I in Scandinavia, with a rapidly decreasing frequency toward both the East European Plain and the Atlantic fringe, but microsatellite diversity reveals that France could be the source region of the early spread of both I1a and the less common I1c. Also, I1b*, which extends from the eastern Adriatic to eastern Europe and declines noticeably toward the southern Balkans and abruptly toward the periphery of northern Italy, probably diffused after the Last Glacial Maximum from a homeland in eastern Europe or the Balkans. In contrast, I1b2 most likely arose in southern France/Iberia. Similarly to the other subclades, it underwent a postglacial expansion and marked the human colonization of Sardinia approximately 9,000 years ago.

negative: Hierarchical Gaussian Descriptors with Application to Person Re-Identification Describing the color and textural information of a person image is one of the most crucial aspects of person re-identification (re-id). In this paper, we present novel meta-descriptors based on a hierarchical distribution of pixel features. Although hierarchical covariance descriptors have been successfully applied to image classification, the mean information of pixel features, which is absent from the covariance, tends to be the major discriminative information for person re-id. To solve this problem, we describe a local region in an image via hierarchical Gaussian distribution in which both means and covariances are included in their parameters. More specifically, the region is modeled as a set of multiple Gaussian distributions in which each Gaussian represents the appearance of a local patch. The characteristics of the set of Gaussians are again described by another Gaussian distribution. In both steps, we embed the parameters of the Gaussian into a point of Symmetric Positive Definite (SPD) matrix manifold. By changing the way to handle mean information in this embedding, we develop two hierarchical Gaussian descriptors. Additionally, we develop feature norm normalization methods with the ability to alleviate the biased trends that exist on the descriptors. The experimental results conducted on five public datasets indicate that the proposed descriptors achieve remarkably high performance on person re-id.

negative: On Covert Acoustical Mesh Networks in Air Covert channels can be used to circumvent system and network policies by establishing communications that have not been considered in the design of the computing system. We construct a covert channel between different computing systems that utilizes audio modulation/demodulation to exchange data between the computing systems over the air medium. The underlying network stack is based on a communication system that was originally designed for robust underwater communication. We adapt the communication system to implement covert and stealthy communications by utilizing the ultrasonic frequency range. We further demonstrate how the scenario of covert acoustical communication over the air medium can be extended to multi-hop communications and even to wireless mesh networks. A covert acoustical mesh network can be conceived as a meshed botnet or malnet that is accessible via inaudible audio transmissions. Different applications of covert acoustical mesh networks are presented, including the use for remote keylogging over multiple hops. It is shown that the concept of a covert acoustical mesh network renders many conventional security concepts useless, as acoustical communications are usually not considered. Finally, countermeasures against covert acoustical mesh networks are discussed, including the use of lowpass filtering in computing systems and a host-based intrusion detection system for analyzing audio input and output in order to detect any irregularities.

negative: A developmental, mentalization-based approach to the understanding and treatment of borderline personality disorder. The precise nature and etiopathogenesis of borderline personality disorder (BPD) continues to elude researchers and clinicians. Yet, increasing evidence from various strands of research converges to suggest that affect dysregulation, impulsivity, and unstable relationships constitute the core features of BPD. Over the last two decades, the mentalization-based approach to BPD has attempted to provide a theoretically consistent way of conceptualizing the interrelationship between these core features of BPD, with the aim of providing clinicians with a conceptually sound and empirically supported approach to BPD and its treatment. This paper presents an extended version of this approach to BPD based on recently accumulated data. In particular, we suggest that the core features of BPD reflect impairments in different facets of mentalization, each related to impairments in relatively distinct neural circuits underlying these facets. Hence, we provide a comprehensive account of BPD by showing how its core features are related to each other in theoretically meaningful ways. More specifically, we argue that BPD is primarily associated with a low threshold for the activation of the attachment system and deactivation of controlled mentalization, linked to impairments in the ability to differentiate mental states of self and other, which lead to hypersensitivity and increased susceptibility to contagion by other people's mental states, and poor integration of cognitive and affective aspects of mentalization. The combination of these impairments may explain BPD patients' propensity for vicious interpersonal cycles, and their high levels of affect dysregulation and impulsivity. Finally, the implications of this expanded mentalization-based approach to BPD for mentalization-based treatment and treatment of BPD more generally are discussed.

negative: Statistical Methods for Fighting Financial Crimes

negative: Design and Measurement of Reconfigurable Millimeter Wave Reflectarray Cells With Nematic Liquid Crystal Numerical simulations are used to study the electromagnetic scattering from phase agile microstrip reflectarray cells which exploit the voltage controlled dielectric anisotropy property of nematic state liquid crystals (LCs). In the computer model two arrays of equal size elements constructed on a 15 mum thick tuneable LC layer were designed to operate at center frequencies of 102 GHz and 130 GHz. Micromachining processes based on the metallization of quartz/silicon wafers and an industry compatible LCD packaging technique were employed to fabricate the grounded periodic structures. The loss and the phase of the reflected signals were measured using a quasi-optical test bench with the reflectarray inserted at the beam waist of the imaged Gaussian beam, thus eliminating some of the major problems associated with traditional free-space characterization at these frequencies. By applying a low frequency AC bias voltage of 10 V, a 165deg phase shift with a loss 4.5-6.4 dB at 102 GHz and 130deg phase shift with a loss variation between 4.3-7 dB at 130 GHz was obtained. The experimental results are shown to be in close agreement with the computer model.

negative: Reasoning about Categories in Conceptual Spaces Understanding the process of categorization is a primary research goal in artificial intelligence. The conceptual space framework provides a flexible approach to modeling context-sensitive categorization via a geometrical representation designed for modeling and managing concepts. In this paper we show how algorithms developed in computational geometry, and the Region Connection Calculus can be used to model important aspects of categorization in conceptual spaces. In particular, we demonstrate the feasibility of using existing geometric algorithms to build and manage categories in conceptual spaces, and we show how the Region Connection Calculus can be used to reason about categories and other conceptual regions.

negative: Towards the Development of Realistic Botnet Dataset in the Internet of Things for Network Forensic Analytics: Bot-IoT Dataset The proliferation of IoT systems, has seen them targeted by malicious third parties. To address this, realistic protection and investigation countermeasures need to be developed. Such countermeasures include network intrusion detection and network forensic systems. For that purpose, a well-structured and representative dataset is paramount for training and validating the credibility of the systems. Although there are several network, in most cases, not much information is given about the Botnet scenarios that were used. This paper, proposes a new dataset, Bot-IoT, which incorporates legitimate and simulated IoT network traffic, along with various types of attacks. We also present a realistic testbed environment for addressing the existing dataset drawbacks of capturing complete network information, accurate labeling, as well as recent and complex attack diversity. Finally, we evaluate the reliability of the BoT-IoT dataset using different statistical and machine learning methods for forensics purposes compared with the existing datasets. This work provides the baseline for allowing botnet identificaiton across IoT-specific networks. The Bot-IoT dataset can be accessed at [1].

negative: Binary Input Layer: Training of CNN models with binary input data For the efficient execution of deep convolutional neural networks (CNN) on edge devices, various approaches have been presented which reduce the bit width of the network parameters down to 1 bit. Binarization of the first layer was always excluded, as it leads to a significant error increase. Here, we present the novel concept of binary input layer (BIL), which allows the usage of binary input data by learning bit specific binary weights. The concept is evaluated on three datasets (PAMAP2, SVHN, CIFAR-10). Our results show that this approach is in particular beneficial for multimodal datasets (PAMAP2) where it outperforms networks using full precision weights in the first layer by 1.92 percentage points (pp) while consuming only 2% of the chip area.

negative: Leveraging Legacy Code to Deploy Desktop Applications on the Web Xax is a browser plugin model that enables developers to leverage existing tools, libraries, and entire programs to deliver feature-rich applications on the web. Xax employs a novel combination of mechanisms that collectively provide security, OS-independence, performance, and support for legacy code. These mechanisms include memory-isolated native code execution behind a narrow syscall interface, an abstraction layer that provides a consistent binary interface across operating systems, system services via hooks to existing browser mechanisms, and lightweight modifications to existing tool chains and code bases. We demonstrate a variety of applications and libraries from existing code bases, in several languages, produced with various tool chains, running in multiple browsers on multiple operating systems. With roughly two person-weeks of effort, we ported 3.3 million lines of code to Xax, including a PDF viewer, a Python interpreter, a speech synthesizer, and an OpenGL pipeline.

negative: Stacked Convolutional and Recurrent Neural Networks for Music Emotion Recognition This paper studies the emotion recognition from musical tracks in the 2-dimensional valence-arousal (V-A) emotional space. We propose a method based on convolutional (CNN) and recurrent neural networks (RNN), having significantly fewer parameters compared with state-of-theart method for the same task. We utilize one CNN layer followed by two branches of RNNs trained separately for arousal and valence. The method was evaluated using the “MediaEval2015 emotion in music” dataset. We achieved an RMSE of 0.202 for arousal and 0.268 for valence, which is the best result reported on this dataset.

negative: Anchoring : accessibility as a cause of judgmental assimilation Anchoring denotes assimilation of judgment toward a previously considered value — an anchor. The selective accessibility model argues that anchoring is a result of selective accessibility of information compatible with an anchor. The present review shows the similarities between anchoring and knowledge accessibility effects. Both effects depend on the applicability of the accessible information, which is also used similarly. Furthermore, both knowledge accessibility and anchoring influence the time needed for the judgment and both display temporal robustness. Finally, we offer recent evidence for the selective accessibility model and demonstrate how the model can be applied to reducing the anchoring effect.

negative: POSTER: Watch Out Your Smart Watch When Paired We coin a new term called \textit{data transfusion} as a phenomenon that a user experiences when pairing a wearable device with the host device. A large amount of data stored in the host device (e.g., a smartphone) is forcibly copied to the wearable device (e.g., a smart watch) due to pairing while the wearable device is usually less attended. To the best of knowledge, there is no previous work that manipulates how sensitive data is transfused even without user's consent and how users perceive and behave regarding such a phenomenon for smart watches. We tackle this problem by conducting an experimental study of data extraction from commodity devices, such as in Android Wear, watchOS, and Tizen platforms, and a following survey study with 205 smart watch users, in two folds. The experimental studies have shown that a large amount of sensitive data was transfused, but there was not enough user notification. The survey results have shown that users have lower perception on smart watches for security and privacy than smartphones, but they tend to set the same passcode on both devices when needed. Based on the results, we perform risk assessment and discuss possible mitigation that involves volatile transfusion.

negative: ARGoS: a modular, parallel, multi-engine simulator for multi-robot systems We present a novel multi-robot simulator named ARGoS. ARGoS is designed to simulate complex experiments involving large swarms of robots of different types. ARGoS is the first multi-robot simulator that is at the same time both efficient (fast performance with many robots) and flexible (highly customizable for specific experiments). Novel design choices in ARGoS have enabled this breakthrough. First, in ARGoS, it is possible to partition the simulated space into multiple sub-spaces, managed by different physics engines running in parallel. Second, ARGoS’ architecture is multi-threaded, thus designed to optimize the usage of modern multi-core CPUs. Finally, the architecture of ARGoS is highly modular, enabling easy addition of custom features and appropriate allocation of computational resources. We assess the efficiency of ARGoS and showcase its flexibility with targeted experiments. Experimental results demonstrate that simulation run-time increases linearly with the number of robots. A 2D-dynamics simulation of 10,000 e-puck robots can be performed in 60 % of the time taken by the corresponding real-world experiment. We show how ARGoS can be extended to suit the needs of an experiment in which custom functionality is necessary to achieve sufficient simulation accuracy. ARGoS is open source software licensed under GPL3 and is downloadable free of charge.

negative: Storytelling in Information Visualizations: Does it Engage Users to Explore Data? We present the results of three web-based field experiments, in which we evaluate the impact of using initial narrative visualization techniques and storytelling on user-engagement with exploratory information visualizations. We conducted these experiments on a popular news and opinion outlet, and on a popular visualization gallery website. While data-journalism exposes visualizations to a large public, we do not know how effectively this public makes sense of interactive graphics, and in particular if people explore them to gain additional insight to that provided by the journalists. In contrast to our hypotheses, our results indicate that augmenting exploratory visualizations with introductory 'stories' does not seem to increase user-engagement in exploration.

negative: We can learn your #hashtags: Connecting tweets to explicit topics In Twitter, users can annotate tweets with hashtags to indicate the ongoing topics. Hashtags provide users a convenient way to categorize tweets. From the system's perspective, hashtags play an important role in tweet retrieval, event detection, topic tracking, and advertising, etc. Annotating tweets with the right hashtags can lead to a better user experience. However, two problems remain unsolved during an annotation: (1) Before the user decides to create a new hashtag, is there any way to help her/him find out whether some related hashtags have already been created and widely used? (2) Different users may have different preferences for categorizing tweets. However, few work has been done to study the personalization issue in hashtag recommendation. To address the above problems, we propose a statistical model for personalized hashtag recommendation in this paper. With millions of <;tweet, hashtag> pairs being published everyday, we are able to learn the complex mappings from tweets to hashtags with the wisdom of the crowd. Two questions are answered in the model: (1) Different from traditional item recommendation data, users and tweets in Twitter have rich auxiliary information like URLs, mentions, locations, social relations, etc. How can we incorporate these features for hashtag recommendation? (2) Different hashtags have different temporal characteristics. Hashtags related to breaking events in the physical world have strong rise-and-fall temporal pattern while some other hashtags remain stable in the system. How can we incorporate hashtag related features to serve for hashtag recommendation? With all the above factors considered, we show that our model successfully outperforms existing methods on real datasets crawled from Twitter.

negative: Big Data , Digital Media , and Computational Social Science : Possibilities and Perils We live life in the network. We check our e-mails regularly, make mobile phone calls from almost any location ... make purchases with credit cards ... [and] maintain friendships through online social networks. ... These transactions leave digital traces that can be compiled into comprehensive pictures of both individual and group behavior, with the potential to transform our understanding of our lives, organizations, and societies.

negative: Environment-Driven Lexicon Induction for High-Level Instructions As described in the main paper, we collected a dataset D = (x(n), e(n), a(n), π(n))500 n=1. Environment Complexity. Our environments are 3D scenarios consisting of complex objects such as fridge, microwave and television with many states. These objects can be in different spatial relations with respect to other objects. For example, “bag of chips” can be found behind the television. Figure 1 shows some sample environments from our dataset. For example, an object of category television consists of 6 channels, volume level and power status. An object can have different values of states in different environment and different environment consists of different set of objects and their placement. For example, television might be powered on in one environment and closed in another, microwave might have an object inside it or not in different environment, etc. Moreover, there are often more than one object of the same category. For example, our environment typically have two books, five couches, four pillows etc. Objects of the same category can have different appearance. For example, a book can have the cover of a math book or a Guinness book of world record; resulting in complex object descriptions such as in “throw the sticky stuff in the bowl”. They can also have the same appearance making people use spatial relations or other means while describing them such as in “get me the cup next to the microwave”. This dataset is significantly more challenging compared to the 2D navigation dataset or GUI actions in windows dataset considered earlier.

negative: Early Breast Cancer Detection using Mammogram Images: A Review of Image Processing Techniques Breast cancer is one of the most common cancers worldwide among women so that one in eight women is affected by this disease during their lifetime. Mammography is the most effective imaging modality for early detection of breast cancer in early stages. Because of poor contrast and low visibility in the mammographic images, early detection of breast cancer is a significant step to efficient treatment of the disease. Different computeraided detection algorithms have been developed to help radiologists provide an accurate diagnosis. This paper reviews the most common image processing approaches developed for detection of masses and calcifications. The main focus of this review is on image segmentation methods and the variables used for early breast cancer detection. Texture analysis is the crucial step in any image segmentation techniques which are based on a local spatial variation of intensity or color. Therefore, various methods of texture analysis for mass and micro-calcification detection in mammography are discussed in details.

negative: Is beautiful really usable? Toward understanding the relation between usability, aesthetics, and affect in HCI This paper analyzes the relation between usability and aesthetics. In a laboratory study, 80 participants used one of four different versions of the same online shop, differing in interface-aesthetics (low vs. high) and interface-usability (low vs. high). Participants had to find specific items and rate the shop before and after usage on perceived aesthetics and perceived usability, which were assessed using four validated instruments. Results show that aesthetics does not affect perceived usability. In contrast, usability has an effect on post-use perceived aesthetics. Our findings show that the “what is beautiful is usable” notion, which assumes that aesthetics enhances the perception of usability can be reversed under certain conditions (here: strong usability manipulation combined with a medium to large aesthetics manipulation). Furthermore, our results indicate that the user’s affective experience with the usability of the shop might serve as a mediator variable within the aestheticsusability relation: The frustration of poor usability lowers ratings on perceived aesthetics. The significance of the results is discussed in context of the existing research on the relation between aesthetics and usability.

negative: SAR automatic target recognition based on a visual cortical system Human Vision system is the most complex and accurate system. In order to extract better features about Synthetic Aperture Radar (SAR) targets, a SAR automatic target recognition (ATR) algorithm based on human visual cortical system is proposed. This algorithm contains three stages: (1) Image preprocessing (we use a Kuan filter to do the enhancement and an adaptive Intersecting Cortical Model (ICM) to do the segmentation) (2) Feature extraction using a sparse autoencoder. (3) Classification using a softmax regression classifier. Experiment result of MSTAR public data shows a better performance of recognition.

negative: Deep Expectation of Real and Apparent Age from a Single Image Without Facial Landmarks In this paper we propose a deep learning solution to age estimation from a single face image without the use of facial landmarks and introduce the IMDB-WIKI dataset, the largest public dataset of face images with age and gender labels. If the real age estimation research spans over decades, the study of apparent age estimation or the age as perceived by other humans from a face image is a recent endeavor. We tackle both tasks with our convolutional neural networks (CNNs) of VGG-16 architecture which are pre-trained on ImageNet for image classification. We pose the age estimation problem as a deep classification problem followed by a softmax expected value refinement. The key factors of our solution are: deep learned models from large data, robust face alignment, and expected value formulation for age regression. We validate our methods on standard benchmarks and achieve state-of-the-art results for both real and apparent age estimation.

negative: Teaching-to-Learn and Learning-to-Teach for Multi-label Propagation Multi-label propagation aims to transmit the multi-label information from labeled examples to unlabeled examples based on a weighted graph. Existing methods ignore the specific propagation difficulty of different unlabeled examples and conduct the propagation in an imperfect sequence, leading to the error-prone classification of some difficult examples with uncertain labels. To address this problem, this paper associates each possible label with a “teacher”, and proposes a “Multi-Label Teaching-to-Learn and Learning-toTeach” (ML-TLLT) algorithm, so that the entire propagation process is guided by the teachers and manipulated from simple examples to more difficult ones. In the teaching-to-learn step, the teachers select the simplest examples for the current propagation by investigating both the definitiveness of each possible label of the unlabeled examples, and the dependencies between labels revealed by the labeled examples. In the learning-to-teach step, the teachers reversely learn from the learner’s feedback to properly select the simplest examples for the next propagation. Thorough empirical studies show that due to the optimized propagation sequence designed by the teachers, ML-TLLT yields generally better performance than seven state-of-the-art methods on the typical multi-label benchmark datasets.

negative: Transductive Event Classification through Heterogeneous Networks Events can be defined as "something that occurs at specific place and time associated with some specific actions". In general, events extracted from news articles and social networks are used to map the information from web to the various phenomena that occur in our physical world. One of the main steps to perform this relationship is the use of machine learning algorithms for event classification, which has received great attention in the web document engineering field in recent years. Traditional machine learning algorithms are based on vector space model representations and supervised classification. However, events are composed of multiple representations such as textual data, temporal information, geographic location and other types of metadata. All these representations are poorly represented together in a vector space model. Moreover, supervised classification requires the labeling of a significant sample of events to construct a training set for learning process, thereby hampering the practical application of event classification. In this paper, we propose a method called TECHN (Transductive Event Classification through Heterogeneous Networks), which considers event metadata as different objects in an heterogeneous network. Besides, the TECHN method has the ability to automatically learn which types of network objects (event metadata) are most efficient in the classification task. In addition, our TECHN method is based on a transductive classification that considers both labeled events and a vast amount of unlabeled events. The experimental results show that TECHN method obtains promising results, especially when we consider different weights of importance for each type of event metadata and a small set of labeled events.

negative: The Effects of Hyperparameters on SGD Training of Neural Networks The performance of neural network classifiers is determined by a number of hyperparameters, including learning rate, batch size, and depth. A number of attempts have been made to explore these parameters in the literature, and at times, to develop methods for optimizing them. However, exploration of parameter spaces has often been limited. In this note, I report the results of large scale experiments exploring these different parameters and their interactions. 1 Datasets and Libraries All experiments reported here were carried out using the Torch library [1] and CUDA (some of the experiments have been reproduced on a smaller scale with other libraries). The dataset for all the experiments is MNIST [3, 2]. Characters were deskewed prior to all experiments. Deskewing significantly reduces error rates in nearest neighbor classifiers. Skew corresponds to a simple one-parameter family of linear transformations in feature space and causes decision regions to become highly anisotropic. Without deskewing, differences in performance between different architectures might primarily reduce to their ability to “learn deskewing”. With deskewing, MNIST character classification become more of an instance of a typical classification problem. Prior results on classifying deskewed MNIST data both with neural networks and with other methods are shown in the table below. 2 Logistic vs Softmax Outputs Multi-Layer Perceptrons (MLPs) used for classification usually attempt to approximate posterior probabilities and use those as their discriminant function. Two common approaches to this are the use of least square regression with logistic output units trained with a least square error measure (“logistic outputs”) 1 ar X iv :1 50 8. 02 78 8v 1 [ cs .N E ] 1 2 A ug 2 01 5 Method Test Error Preprocessing Reference Reduced Set SVM deg 5 polynomial 1 deskewing LeCun et al. 1998 SVM deg 4 polynomial 1.1 deskewing LeCun et al. 1998 K-nearest-neighbors, L3 1.22 deskewing, noise removal, blurring, 2 pixel shift Kenneth Wilder, U. Chicago K-nearest-neighbors, L3 1.33 deskewing, noise removal, blurring, 1 pixel shift Kenneth Wilder, U. Chicago 2-layer NN, 300 HU 1.6 deskewing LeCun et al. 1998 Table 1: Other previously reported results on the MNIST database. and a softmax output layer (“softmax outputs”). In the limit of infinite amounts of training data, both approaches converge to true posterior probability estimates. Softmax output layers have the property that they are guaranteed to produce a normalized posterior probability distribution across all classes, while least square regression with logistic output units generates independent probability estimates for each class membership without any guarantees that these probabilities sum up to one. Softmax is often preferred, although there is no obvious theoretical reason why it should yield better discriminant functions or lower classification error for finite training sets. In OCR and speech recognition, some practitioners have observed that logistic outputs yield better posterior probability estimates and better results when combined with probabilistic language models. In addition, when the sum of the posterior probability estimates derived from logistic outputs differs significantly from unity, that is a strong indication that the input lies outside the training set and should be rejected. Figure 1 shows a scatterplot of test vs training error for a large number of MLPs with one hidden layer at different learning rates, different number of hidden units, and different batch sizes. Such scatterplots show what error rates are achievable by the different architectures, hyperparameter choices, initializations, and order of sample presentations. The lowest points in the vertical direction indicate the lowest test set error achievable by the architecture in this set of experiments. The scatterplot shows that logistic outputs achieve test set error rates of about 1.0% vs 1.1% for softmax outputs. At the same time, logistic outputs never achieve zero percent training set error, while softmax outputs frequently do. In order to ascertain that the difference in test set error between the two

negative: Efficient calibration for rssi-based indoor localization by bayesian experimental design on multi-task classification RSSI-based indoor localization is getting much attention. Thanks to a number of researchers, the localization accuracy has already reached a sufficient level. However, it is still not easy-to-use technology because of its heavy installation cost. When an indoor localization system is installed, it needs to collect RSSI data for training classifiers. Existing techniques need to collect enough data at each location. This is why the installation cost is very heavy. We propose a technique to gather data efficiently by using machine learning techniques. Our proposed algorithm is based on multi-task learning and Bayesian optimization. This algorithm can remove the need to collect data of all location labels and select location labels to acquire new data efficiently. We verify this algorithm by using a Wi-Fi RSSI dataset collected in a building. The empirical results suggest that the algorithm is superior to an existing algorithm applying single-task learning and Active Class Selection.

negative: Use of the stair vision library within the ISPRS 2D semantic labeling benchmark (Vaihingen) This report describes experiments conducted using the multi-class image classification framework implemented in the stair vision library (SVL, (Gould et al., 2008)) in the context of the ISPRS 2D semantic labeling benchmark. The motivation was to get results from a well-established and public available software (Gould, 2014), as a kind of baseline. Besides the use of features implemented in the SVL which makes use of three channel images, assuming RGB, we also included features derived from the height model and the NDVI which is specific here, because the benchmark dataset provides surface models and CIR images. Another point of interest concerned the impact the segmentation had on the overall result. To this end a pre-study was performed where different parameters for the graph-based segmentation method introduced by Felzenszwalb and Huttelocher (2004) have been tested, in addition we only applied a simple chessboard segmentation. Other experiments focused on the question whether the conditional random field classification approach helps to enhance the overall performance. The official evaluation of all experiments described here is available at http://www2.isprs.org/vaihingen-2d-semantic-labeling-contest.html (SVL_1 to SVL_6). The normalized height models are available through the ReseachGate profile of the author (http://www.researchgate.net/profile/Markus_Gerke)


query: BlueGene/L Failure Analysis and Prediction Models

positive: Analysis and implementation of software rejuvenation in cluster systems Several recent studies have reported the phenomenon of "software aging", one in which the state of a software system degrades with time. This may eventually lead to performance degradation of the software or crash/hang failure or both. "Software rejuvenation" is a pro-active technique aimed to prevent unexpected or unplanned outages due to aging. The basic idea is to stop the running software, clean its internal state and restart it. In this paper, we discuss software rejuvenation as applied to cluster systems. This is both an innovative and an efficient way to improve cluster system availability and productivity. Using Stochastic Reward Nets (SRNs), we model and analyze cluster systems which employ software rejuvenation. For our proposed time-based rejuvenation policy, we determine the optimal rejuvenation interval based on system availability and cost. We also introduce a new rejuvenation policy based on prediction and show that it can dramatically increase system availability and reduce downtime cost. These models are very general and can capture a multitude of cluster system characteristics, failure behavior and performability measures, which we are just beginning to explore. We then briefly describe an implementation of a software rejuvenation system that performs periodic and predictive rejuvenation, and show some empirical data from systems that exhibit aging

positive: Predicting Rare Events In Temporal Domains Temporal data mining aims at finding patterns in historical data. Our work proposes an approach to extract temporal patterns from data to predict the occurrence of target events, such as computer attacks on host networks, or fraudulent transactions in financial institutions. Our problem formulation exhibits two major challenges: 1) we assume events being characterized by categorical features and displaying uneven inter-arrival times; such an assumption falls outside the scope of classical time-series analysis, 2) we assume target events are highly infrequent; predictive techniques must deal with the class-imbalance problem. We propose an efficient algorithm that tackles the challenges above by transforming the event prediction problem into a search for all frequent eventsets preceding target events. The class imbalance problem is overcome by a search for patterns on the minority class exclusively; the discrimination power of patterns is then validated against other classes. Patterns are then combined into a rule-based model for prediction. Our experimental analysis indicates the types of event sequences where target events can be accurately predicted.

positive: The impact of technology scaling on lifetime reliability The relentless scaling of CMOS technology has provided a steady increase in processor performance for the past three decades. However, increased power densities (hence temperatures) and other scaling effects have an adverse impact on long-term processor lifetime reliability. This paper represents a first attempt at quantifying the impact of scaling on lifetime reliability due to intrinsic hard errors, taking workload characteristics into consideration. For our quantitative evaluation, we use RAMP (Srinivasan et al., 2004), a previously proposed industrial-strength model that provides reliability estimates for a workload, but for a given technology. We extend RAMP by adding scaling specific parameters to enable workload-dependent lifetime reliability evaluation at different technologies. We show that (1) scaling has a significant impact on processor hard failure rates - on average, with SPEC benchmarks, we find the failure rate of a scaled 65nm processor to be 316% higher than a similarly pipelined 180nm processor; (2) time-dependent dielectric breakdown and electromigration have the largest increases; and (3) with scaling, the difference in reliability from running at worst-case vs. typical workload operating conditions increases significantly, as does the difference from running different workloads. Our results imply that leveraging a single microarchitecture design for multiple remaps across a few technology generations will become increasingly difficult, and motivate a need for workload specific, microarchitectural lifetime reliability awareness at an early design stage.

positive: Temperature-Aware Microarchitecture With power density and hence cooling costs rising exponentially, processor packaging can no longer be designed for the worst case, and there is an urgent need for runtime processor-level techniques that can regulate operating temperature when the package's capacity is exceeded. Evaluating such techniques, however, requires a thermal model that is practical for architectural studies.This paper describes HotSpot, an accurate yet fast model based on an equivalent circuit of thermal resistances and capacitances that correspond to microarchitecture blocks and essential aspects of the thermal package. Validation was performed using finite-element simulation. The paper also introduces several effective methods for dynamic thermal management (DTM): "temperature-tracking" frequency scaling, localized toggling, and migrating computation to spare hardware units. Modeling temperature at the microarchitecture level also shows that power metrics are poor predictors of temperature, and that sensor imprecision has a substantial impact on the performance of DTM.

positive: CMAR: Accurate and Efficient Classification Based on Multiple Class-Association Rules Previous studies propose that associative classification has high classification accuracy and strong flexibility at handling unstructured data. However, it still suffers from the huge set of mined rules and sometimes biased classification or overfitting since the classification is based on only single high-confidence rule. In this study, we propose a new associative classification method, CMAR, i.e., Classification based on Multiple Association Rules. The method extends an efficient frequent pattern mining method, FP-growth, constructs a class distribution-associated FP-tree, and mines large database efficiently. Moreover, it applies a CR-tree structure to store and retrieve mined association rules efficiently, and prunes rules effectively based on confidence, correlation and database coverage. The classification is performed based on a weighted analysis using multiple strong association rules. Our extensive experiments on databases from UCI machine learning database repository show that CMAR is consistent, highly effective at classification of various kinds of databases and has better average classification accuracy in comparison with CBA and C4.5. Moreover, our performance study shows that the method is highly efficient and scalable in comparison with other reported associative classification methods.

negative: ApLeaf: An efficient android-based plant leaf identification system To automatically identify plant species is very useful for ecologists, amateur botanists, educators, and so on. The Leafsnap is the first successful mobile application system which tackles this problem. However, the Leafsnap is based on the IOS platform. And to the best of our knowledge, as the mobile operation system, the Android is more popular than the IOS. In this paper, an Android-based mobile application designed to automatically identify plant species according to the photographs of tree leaves is described. In this application, one leaf image can be either a digital image from one existing leaf image database or a picture collected by a camera. The picture should be a single leaf placed on a light and untextured background without other clutter. The identification process consists of three steps: leaf image segmentation, feature extraction, and species identification. The demo system is evaluated on the ImageCLEF2012 Plant Identification database which contains 126 tree species from the French Mediterranean area. The outputs of the system to users are the top several species which match the query leaf image the best, as well as the textual descriptions and additional images about plant leaves, flowers, etc. Our system works well with state-of-the-art identification performance.

negative: Usability evaluation considered harmful (some of the time) Current practice in Human Computer Interaction as encouraged by educational institutes, academic review processes, and institutions with usability groups advocate usability evaluation as a critical part of every design process. This is for good reason: usability evaluation has a significant role to play when conditions warrant it. Yet evaluation can be ineffective and even harmful if naively done 'by rule' rather than 'by thought'. If done during early stage design, it can mute creative ideas that do not conform to current interface norms. If done to test radical innovations, the many interface issues that would likely arise from an immature technology can quash what could have been an inspired vision. If done to validate an academic prototype, it may incorrectly suggest a design's scientific worthiness rather than offer a meaningful critique of how it would be adopted and used in everyday practice. If done without regard to how cultures adopt technology over time, then today's reluctant reactions by users will forestall tomorrow's eager acceptance. The choice of evaluation methodology - if any - must arise from and be appropriate for the actual problem or research question under consideration.

negative: Competing for Attention in Social Media under Information Overload Conditions Modern social media are becoming overloaded with information because of the rapidly-expanding number of information feeds. We analyze the user-generated content in Sina Weibo, and find evidence that the spread of popular messages often follow a mechanism that differs from the spread of disease, in contrast to common belief. In this mechanism, an individual with more friends needs more repeated exposures to spread further the information. Moreover, our data suggest that for certain messages the chance of an individual to share the message is proportional to the fraction of its neighbours who shared it with him/her, which is a result of competition for attention. We model this process using a fractional susceptible infected recovered (FSIR) model, where the infection probability of a node is proportional to its fraction of infected neighbors. Our findings have dramatic implications for information contagion. For example, using the FSIR model we find that real-world social networks have a finite epidemic threshold in contrast to the zero threshold in disease epidemic models. This means that when individuals are overloaded with excess information feeds, the information either reaches out the population if it is above the critical epidemic threshold, or it would never be well received.

negative: An adaptive FEC algorithm using hidden Markov chains Anumber of performance issues must be addressed in order to transmit continuous media stream over the Internet with acceptable quality [9, 6] . These include reducing jitter and recovering from packet losses mainly due to congestion in the routers . Several methods can be used to deal with the loss of a packet such as : retransmission schemes, error concealment, error resilience, interleaving, and FEC (forward error correction) . Each has its advantages/disadvantages depending on the network scenario and conditions (RTT, propagation delay, topology, channel error rate, congestion in the sender/receiver path, etc.) . In this work we focus on FEC techniques. FEC works by adding redundant information to the stream being transmitted in order to reconstruct the original stream at the receiver when packet losses occur. Among its advantages are the small delays introduced to recover information compared to retransmission, for instance, and simplicity of implementation . A clear disadvantage is the increase in the transmission rate due to the redundancy added. One of the simplest approaches among FEC techniques that have been proposed in the literature [11] is to add a packet to each group of N 1 packets with a payload equal to the result of an XOR operation performed in the group. Clearly, if one packet out of the N is lost, the stream is completely recovered . This is accomplished at the expense ofextra bandwidth, in this example an increase of 1/(N 1) . In [4] a clever FEC scheme was proposed in which each packet carries a sample of the previous transmitted packet but compression is used to reduce the overhead . In [7] another technique was developed aimed at maintaining a good compromise between recovery efficiency and bandwidth usage. Since packet losses are mostly due to congestion, increasing the amount of protection using FEC may be unfair to flow controlled streams and also may even have an adverse effect on the results [1] . Therefore, the FEC algorithm should be carefully chosen according to the error characteristics ofthe path between the sender and receiver. Another issue is to develop accurate models ofthe loss process . Many studies exist to characterize the loss process [2, 14, 8] . Simple models such as the Bernoulli process, the Gilbert model and sophisticated Markov models have been proposed. Using either the Bernoulli or the Gilbert process, the work of[3] propose an adaptive algorithm based on the FECscheme of[4] . Recently, the work of Salamatian and Vaton [13] has shown that Hidden

negative: Brain–machine interface via real-time fMRI: Preliminary study on thought-controlled robotic arm Real-time functional MRI (rtfMRI) has been used as a basis for brain-computer interface (BCI) due to its ability to characterize region-specific brain activity in real-time. As an extension of BCI, we present an rtfMRI-based brain-machine interface (BMI) whereby 2-dimensional movement of a robotic arm was controlled by the regulation (and concurrent detection) of regional cortical activations in the primary motor areas. To do so, the subjects were engaged in the right- and/or left-hand motor imagery tasks. The blood oxygenation level dependent (BOLD) signal originating from the corresponding hand motor areas was then translated into horizontal or vertical robotic arm movement. The movement was broadcasted visually back to the subject as a feedback. We demonstrated that real-time control of the robotic arm only through the subjects' thought processes was possible using the rtfMRI-based BMI trials.

negative: Similarity-Based Approach for Positive and Unlabeled Learning Positive and unlabelled learning (PU learning) has been investigated to deal with the situation where only the positive examples and the unlabelled examples are available. Most of the previous works focus on identifying some negative examples from the unlabelled data, so that the supervised learning methods can be applied to build a classifier. However, for the remaining unlabelled data, which can not be explicitly identified as positive or negative (we call them ambiguous examples), they either exclude them from the training phase or simply enforce them to either class. Consequently, their performance may be constrained. This paper proposes a novel approach, called similarity-based PU learning (SPUL) method, by associating the ambiguous examples with two similarity weights, which indicate the similarity of an ambiguous example towards the positive class and the negative class, respectively. The local similarity-based and global similarity-based mechanisms are proposed to generate the similarity weights. The ambiguous examples and their similarity-weights are thereafter incorporated into an SVM-based learning phase to build a more accurate classifier. Extensive experiments on real-world datasets have shown that SPUL outperforms state-of-the-art PU learning methods.

negative: FLATM: A fuzzy logic approach topic model for medical documents One of the challenges for text analysis in medical domains is analyzing large-scale medical documents. As a consequence, finding relevant documents has become more difficult. One of the popular methods to retrieve information based on discovering the themes in the documents is topic modeling. The themes in the documents help to retrieve documents on the same topic with and without a query. In this paper, we present a novel approach to topic modeling using fuzzy clustering. To evaluate our model, we experiment with two text datasets of medical documents. The evaluation metrics carried out through document classification and document modeling show that our model produces better performance than LDA, indicating that fuzzy set theory can improve the performance of topic models in medical domains.

negative: Systematic Variation of Prosthetic Foot Spring Affects Center-of-Mass Mechanics and Metabolic Cost During Walking Lower-limb amputees expend more energy to walk than non-amputees and have an elevated risk of secondary disabilities. Insufficient push-off by the prosthetic foot may be a contributing factor. We aimed to systematically study the effect of prosthetic foot mechanics on gait, to gain insight into fundamental prosthetic design principles. We varied a single parameter in isolation, the energy-storing spring in a prototype prosthetic foot, the controlled energy storage and return (CESR) foot, and observed the effect on gait. Subjects walked on the CESR foot with three different springs. We performed parallel studies on amputees and on non-amputees wearing prosthetic simulators. In both groups, spring characteristics similarly affected ankle and body center-of-mass (COM) mechanics and metabolic cost. Softer springs led to greater energy storage, energy return, and prosthetic limb COM push-off work. But metabolic energy expenditure was lowest with a spring of intermediate stiffness, suggesting biomechanical disadvantages to the softest spring despite its greater push-off. Disadvantages of the softest spring may include excessive heel displacements and COM collision losses. We also observed some differences in joint kinetics between amputees and non-amputees walking on the prototype foot. During prosthetic push-off, amputees exhibited reduced energy transfer from the prosthesis to the COM along with increased hip work, perhaps due to greater energy dissipation at the knee. Nevertheless, the results indicate that spring compliance can contribute to push-off, but with biomechanical trade-offs that limit the degree to which greater push-off might improve walking economy.

negative: Meta-Learning in Distributed Data Mining Systems: Issues and Approaches Data mining systems aim to discover patterns and extract useful information from facts recorded in databases. A widely adopted approach to this objective is to apply various machine learning algorithms to compute descriptive models of the available data. Here, we explore one of the main challenges in this research area, the development of techniques that scale up to large and possibly physically distributed databases. Meta-learning is a technique that seeks to compute higher-level classifiers (or classification models), called meta-classifiers, that integrate in some p rincipled fashion multiple classifiers computed separately over different databas es. This study, describes meta-learning and presents the JAM system (Java Ag ents for Meta-learning), an agent-based meta-learning system for large-scale data mining applications. Specifically, it identifies and addresses several impor tant desiderata for distributed data mining systems that stem from thei r additional complexity compared to centralized or host-based systems. Distributed systems may need to deal with heterogenous platforms, with multiple databases and (possibly) different schemas, with the design and imp lementation of scalable and effective protocols for communicating among the data sites, and the selective and efficient use of the information that is gat hered from other peer data sites. Other important problems, intrinsic wi thin ∗Supported in part by an IBM fellowship. data mining systems that must not be ignored, include, first, the abil ity to take advantage of newly acquired information that was not previously av ailable when models were computed and combine it with existing models, and second, the flexibility to incorporate new machine learning methods and d ta mining technologies. We explore these issues within the context of JAM and evaluate various proposed solutions through extensive empirical st udie .

negative:
Observations on periorbital and midface aging. BACKGROUND
Many of the anatomical changes of facial aging are still poorly understood. This study looked at the aging process in individuals linearly over time, focusing on aspects of periorbital aging and the upper midface.

METHODS
The author compared photographs of patients' friends and relatives taken 10 to 50 years before with closely matched recent follow-up pictures. The best-matching old and recent pictures were equally sized and superimposed in the computer. The images were then assembled into GIF animations, which automate the fading of one image into the other and back again indefinitely.

RESULTS
The following findings were new to the author: (1) the border of the pigmented lid skin and thicker cheek skin (the lid-cheek junction) is remarkably stable in position over time, becoming more visible by contrast, not by vertical descent as is commonly assumed. (2) Orbicularis wrinkles on the cheek and moles and other markers on the upper midface were also stable over decades. (3) With aging, there can be a distinct change in the shape of the upper eyelid. The young upper lid frequently has a medially biased peak. The upper lid peak becomes more central in the older lid. This article addresses these three issues. No evidence was seen here for descent of the globe in the orbit.

CONCLUSIONS
There seems to be very little ptosis (inferior descent) of the lid-cheek junction or of the upper midface. These findings suggest that vertical descent of skin, and by association, subcutaneous tissue, is not necessarily a major component of aging in those areas. In addition, the arc of the upper lid changes shape in a characteristic way in some patients. Other known changes of the periorbital area are visualized.

negative: Performance of elasticsearch in cloud environment with nGram and non-nGram indexing The fact that technology have changed the lives of human beings cannot be denied. It has drastically reduced the effort needed to perform a particular task and has increased the productivity and efficiency. Computers especially have been playing a very important role in almost all fields in today's world. They are used to store large amount of data in almost all sectors, be it business and industrial sectors, personal lives or any other. The research areas of science and technology uses computers to solve complex and critical problems. Information is the most important requirement of each individual. In this era of quick-growing and huge data, it has become increasingly illogical to analyse it with the help of traditional techniques or relational databases. New big data instruments, architectures and designs have come into existence to give better support to the requirements of organizations/institutions in analysing large data. Specifically, Elasticsearch, a full-text java based search engine, designed keeping cloud environment in mind solves issues of scalability, search in real time, and efficiency that relational databases were not able to address. In this paper, we present our own experience with Elasticsearch an open source, Apache Lucene based, full-text search engine that provides near real-time search ability, as well as a RESTful API for the ease of user in the field of research.

negative:
Development of the radiographic union score for tibial fractures for the assessment of tibial fracture healing after intramedullary fixation. BACKGROUND
: The objective was to evaluate the newly developed Radiographic Union Score for Tibial fractures (RUST). Because there is no "gold standard," it was hypothesized that the RUST score would provide substantial improvements compared with previous scores presented in the literature.

METHODS
: Forty-five sets of X-rays of tibial shaft fractures treated with intramedullary fixation were selected. Seven orthopedic reviewers independently scored bony union using RUST. Radiographs were reassessed at 9 weeks. Intraclass correlation coefficients (ICC) with 95% confidence intervals (CI) measured agreement.

RESULTS
: Overall agreement was substantial (ICC, 0.86; 95% CI, 0.79-0.91). There was improved reliability among traumatologists compared with others (ICC = 0.86, 0.81, and 0.83, respectively). Overall intraobserver reliability was also substantial (ICC, 0.88; 95% CI, 0.80-0.96).

CONCLUSIONS
: The RUST score exhibits substantial improvements in reliability from previously published scores and produces equally reproducible results among a variety of orthopedic specialties and experience levels. Because no "gold standards" currently exist against which RUST can be compared, this study provides only the initial step in the score's full validation for use in a clinical context.

negative: Comparison of Measurement-Based Call Admission Control Algorithms for Controlled-Load Service We compare the performance of four admission control algorithms—one parameter-based and three measurementbased—for controlled-load service. The parameter-based admission control ensures that the sum of reserved resources is bounded by capacity. The three measurementbased algorithms are based on measured bandwidth, acceptance region [9], and equivalent bandwidth [7]. We use simulationon several network scenarios to evaluate the link utilization and adherence to service commitment achieved by these four algorithms.

negative:
Development and Validation of a Deep Learning System for Diabetic Retinopathy and Related Eye Diseases Using Retinal Images From Multiethnic Populations With Diabetes. Importance
A deep learning system (DLS) is a machine learning technology with potential for screening diabetic retinopathy and related eye diseases.

Objective
To evaluate the performance of a DLS in detecting referable diabetic retinopathy, vision-threatening diabetic retinopathy, possible glaucoma, and age-related macular degeneration (AMD) in community and clinic-based multiethnic populations with diabetes.

Design, Setting, and Participants
Diagnostic performance of a DLS for diabetic retinopathy and related eye diseases was evaluated using 494 661 retinal images. A DLS was trained for detecting diabetic retinopathy (using 76 370 images), possible glaucoma (125 189 images), and AMD (72 610 images), and performance of DLS was evaluated for detecting diabetic retinopathy (using 112 648 images), possible glaucoma (71 896 images), and AMD (35 948 images). Training of the DLS was completed in May 2016, and validation of the DLS was completed in May 2017 for detection of referable diabetic retinopathy (moderate nonproliferative diabetic retinopathy or worse) and vision-threatening diabetic retinopathy (severe nonproliferative diabetic retinopathy or worse) using a primary validation data set in the Singapore National Diabetic Retinopathy Screening Program and 10 multiethnic cohorts with diabetes.

Exposures
Use of a deep learning system.

Main Outcomes and Measures
Area under the receiver operating characteristic curve (AUC) and sensitivity and specificity of the DLS with professional graders (retinal specialists, general ophthalmologists, trained graders, or optometrists) as the reference standard.

Results
In the primary validation dataset (n = 14 880 patients; 71 896 images; mean [SD] age, 60.2 [2.2] years; 54.6% men), the prevalence of referable diabetic retinopathy was 3.0%; vision-threatening diabetic retinopathy, 0.6%; possible glaucoma, 0.1%; and AMD, 2.5%. The AUC of the DLS for referable diabetic retinopathy was 0.936 (95% CI, 0.925-0.943), sensitivity was 90.5% (95% CI, 87.3%-93.0%), and specificity was 91.6% (95% CI, 91.0%-92.2%). For vision-threatening diabetic retinopathy, AUC was 0.958 (95% CI, 0.956-0.961), sensitivity was 100% (95% CI, 94.1%-100.0%), and specificity was 91.1% (95% CI, 90.7%-91.4%). For possible glaucoma, AUC was 0.942 (95% CI, 0.929-0.954), sensitivity was 96.4% (95% CI, 81.7%-99.9%), and specificity was 87.2% (95% CI, 86.8%-87.5%). For AMD, AUC was 0.931 (95% CI, 0.928-0.935), sensitivity was 93.2% (95% CI, 91.1%-99.8%), and specificity was 88.7% (95% CI, 88.3%-89.0%). For referable diabetic retinopathy in the 10 additional datasets, AUC range was 0.889 to 0.983 (n = 40 752 images).

Conclusions and Relevance
In this evaluation of retinal images from multiethnic cohorts of patients with diabetes, the DLS had high sensitivity and specificity for identifying diabetic retinopathy and related eye diseases. Further research is necessary to evaluate the applicability of the DLS in health care settings and the utility of the DLS to improve vision outcomes.

negative:
ProteusTM: Abstraction Meets Performance in Transactional Memory The Transactional Memory (TM) paradigm promises to greatly simplify the development of concurrent applications. This led, over the years, to the creation of a plethora of TM implementations delivering wide ranges of performance across workloads. Yet, no universal implementation fits each and every workload. In fact, the best TM in a given workload can reveal to be disastrous for another one. This forces developers to face the complex task of tuning TM implementations, which significantly hampers their wide adoption. In this paper, we address the challenge of automatically identifying the best TM implementation for a given workload. Our proposed system, ProteusTM, hides behind the TM interface a large library of implementations. Underneath, it leverages a novel multi-dimensional online optimization scheme, combining two popular learning techniques: Collaborative Filtering and Bayesian Optimization.
 We integrated ProteusTM in GCC and demonstrate its ability to switch between TMs and adapt several configuration parameters (e.g., number of threads). We extensively evaluated ProteusTM, obtaining average performance <3% from optimal, and gains up to 100x over static alternatives.

negative: Upper limb exoskeleton control based on sliding mode control and feedback linearization Exoskeletons have potential to improve human quality of life by relieving loads on the human musculoskeletal system or by helping motor rehabilitation. Controllers that were initially developed for industrial applications are also applied to control an exoskeleton, despite of major differences in requirements. Nevertheless, which controller has better performance for this specific application remains an open question. This paper presents a comparison between sliding mode control and feedback linearization control. The implementation of the sliding mode controller assumes a complete measurement of the biological system's dynamics. On the other hand, the feedback linearization method does not need any information from the biological system. Our results indicate that a model combining biological control and dynamics could improve several characteristics of robotic exoskeleton, such as energy consumption.

negative: Part 5: Machine Translation Evaluation Chapter 5.1 Introduction The evaluation of machine translation (MT) systems is a vital field of research, both for determining the effectiveness of existing MT systems and for optimizing the performance of MT systems. This part describes a range of different evaluation approaches used in the GALE community and introduces evaluation protocols and methodologies used in the program. We discuss the development and use of automatic, human, task-based and semi-automatic (human-in-the-loop) methods of evaluating machine translation, focusing on the use of a human-mediated translation error rate HTER as the evaluation standard used in GALE. We discuss the workflow associated with the use of this measure, including post editing, quality control, and scoring. We document the evaluation tasks, data, protocols, and results of recent GALE MT Evaluations. In addition, we present a range of different approaches for optimizing MT systems on the basis of different measures. We outline the requirements and specific problems when using different optimization approaches and describe how the characteristics of different MT metrics affect the optimization. Finally, we describe novel recent and ongoing work on the development of fully automatic MT evaluation metrics that can have the potential to substantially improve the effectiveness of evaluation and optimization of MT systems. Progress in the field of machine translation relies on assessing the quality of a new system through systematic evaluation, such that the new system can be shown to perform better than pre-existing systems. The difficulty arises in the definition of a better system. When assessing the quality of a translation, there is no single correct answer; rather, there may be any number of possible correct translations. In addition, when two translations are only partially correct but in different ways it is difficult to distinguish quality. Moreover, quality assessments may be dependent on the intended use for the translation, e.g., the tone of a translation may be crucial in some applications, but irrelevant in other applications. Traditionally, there are two paradigms of machine translation evaluation: (1) Glass Box evaluation, which measures the quality of a system based upon internal system properties, and (2) Black Box evaluation, which measures the quality of a system based solely upon its output, without respect to the internal mechanisms of the translation system. Glass Box evaluation focuses upon an examination of the system's linguistic

negative: A Model-Based Method for Computer-Aided Medical Decision-Making While MYCIN and PIP were under development at Stanford and Tufts! M.I. T., a group of computer scientists at Rutgers University was developing a system to aid in the evaluation and treatment of patients with glaucoma. The group was led by Professor Casimir K ulikou1ski, a researcher with extensive background in mathematical and pattern-recognition approaches to computer-based medical decision making (Nordyke et al., 1971), working within the Rutgers Research Resource on Computers in Biomedicine headed by Professor Saul Amarel. Working collaboratively with Dr. Arin Safir, Professor of Ophthalmology, "who was then based at the Mt. Sinai School of Medicine in New York City, Kulikowski and Sholom Weiss (a graduate student at Rutgers who "went on to become a research scientist there) developed a method of computer-assisted medical decision making that was based on causal-associational network (CASNET) models of disease. Although the work was inspired by the glaucoma domain, the approach had general features that were later refined in the development of the EXPERT system-building tool (see Chapters 18 and 20). A CASNET model consists of three rnain components: observations of a patient, pathophysiological states, and disease classifications. As observations are recorded, they are associated with the appropriate intennediate states. These states, in turn, are typically causally related, thereby forming a network that summarizes the mechanisms of disease. It is these patterns of states in the network that are linked to individual disease classes. Strat-

negative: Storage and Querying of E-Commerce Data New generation of e-commerce applications require data sch emas that are constantly evolving and sparsely populated. The co nventional horizontal row representation fails to meet these re quir ments. We represent objects in a vertical format storing an o bject as a set of tuples. Each tuple consists of an object identifier and attribute name-value pair. Schema evolution is now easy. Ho wever, writing queries against this format becomes cumberso me. We create a logical horizontal view of the vertical representa tion and transform queries on this view to the vertical table. We pres ent alternative implementations and performance results that s ow the effectiveness of the vertical representation for sparse da ta. We also identify additional facilities needed in database systems to support these applications well.

negative: Jitter and Phase Noise in Ring Oscillators A companion analysis of clock jitter and phase noise of single-ended and differential ring oscillators is presented. The impulse sensitivity functions are used to derive expressions for the jitter and phase noise of ring oscillators. The effect of the number of stages, power dissipation, frequency of oscillation, and shortchannel effects on the jitter and phase noise of ring oscillators is analyzed. Jitter and phase noise due to substrate and supply noise is discussed, and the effect of symmetry on the upconversion of 1/f noise is demonstrated. Several new design insights are given for low jitter/phase-noise design. Good agreement between theory and measurements is observed.

negative: Infinite Edge Partition Models for Overlapping Community Detection and Link Prediction A hierarchical gamma process infinite edge partition model is proposed to factorize the binary adjacency matrix of an unweighted undirected relational network under a Bernoulli-Poisson link. The model describes both homophily and stochastic equivalence, and is scalable to big sparse networks by focusing its computation on pairs of linked nodes. It can not only discover overlapping communities and inter-community interactions, but also predict missing edges. A simplified version omitting inter-community interactions is also provided and we reveal its interesting connections to existing models. The number of communities is automatically inferred in a nonparametric Bayesian manner, and efficient inference via Gibbs sampling is derived using novel data augmentation techniques. Experimental results on four real networks demonstrate the models’ scalability and state-of-the-art performance.

negative: GCap: Graph-based Automatic Image Captioning Given an image, how do we automatically assign keywords to it? In this paper, we propose a novel, graph-based approach (GCap) which outperforms previously reported methods for automatic image captioning. Moreover, it is fast and scales well, with its training and testing time linear to the data set size. We report auto-captioning experiments on the "standard" Corel image database of 680 MBytes, where GCap outperforms recent, successful auto-captioning methods by up to 10 percentage points in captioning accuracy (50% relative improvement).

negative: A cortical motor nucleus drives the basal ganglia-recipient thalamus in singing birds The pallido-recipient thalamus transmits information from the basal ganglia to the cortex and is critical for motor initiation and learning. Thalamic activity is strongly inhibited by pallidal inputs from the basal ganglia, but the role of nonpallidal inputs, such as excitatory inputs from cortex, remains unclear. We simultaneously recorded from presynaptic pallidal axon terminals and postsynaptic thalamocortical neurons in a basal ganglia–recipient thalamic nucleus that is necessary for vocal variability and learning in zebra finches. We found that song-locked rate modulations in the thalamus could not be explained by pallidal inputs alone and persisted following pallidal lesion. Instead, thalamic activity was likely driven by inputs from a motor cortical nucleus that is also necessary for singing. These findings suggest a role for cortical inputs to the pallido-recipient thalamus in driving premotor signals that are important for exploratory behavior and learning.

negative: A Graph Traversal Based Approach to Answer Non-Aggregation Questions Over DBpedia We present a question answering system over DBpedia, filling the gap between user information needs expressed in natural language and a structured query interface expressed in SPARQL over the underlying knowledge base (KB). Given the KB, our goal is to comprehend a natural language query and provide corresponding accurate answers. Focusing on solving the non-aggregation questions, in this paper, we construct a subgraph of the knowledge base from the detected entities and propose a graph traversal method to solve both the semantic item mapping problem and the disambiguation problem in a joint way. Compared with existing work, we simplify the process of query intention understanding and pay more attention to the answer path ranking. We evaluate our method on a non-aggregation question dataset and further on a complete dataset. Experimental results show that our method achieves best performance compared with several state-of-the-art systems.

negative: Optimal Cell Load and Throughput in Green Small Cell Networks With Generalized Cell Association This paper thoroughly explores the fundamental interactions between cell association, cell load, and throughput in a green (energy-efficient) small cell network in which all base stations form a homogeneous Poisson point process (PPP) of intensity λB and all users form another independent PPP of intensity λ∪. Cell voidness, usually disregarded due to rarity in cellular network modeling, is first theoretically analyzed under generalized (channel-aware) cell association (GCA). We show that the void cell probability cannot be neglected any more since it is bounded above by exp(-λ∪/λB) that is typically not small in a small cell network. The accurate expression of the void cell probability for GCA is characterized and it is used to derive the average cell and user throughputs. We learn that cell association and cell load λ∪/λB significantly affect these two throughputs. According to the average cell and user throughputs, the green cell and user throughputs are defined respectively to reflect whether the energy of a base station is efficiently used to transmit information or not. In order to achieve satisfactory throughput with certain level of greenness, cell load should be properly determined. We present the theoretical solutions of the optimal cell loads that maximize the green cell and user throughputs, respectively, and verify their correctness by simulation.

negative: Scalable Graph Exploration on Multicore Processors Many important problems in computational sciences, social network analysis, security, and business analytics, are data-intensive and lend themselves to graph-theoretical analyses. In this paper we investigate the challenges involved in exploring very large graphs by designing a breadth-first search (BFS) algorithm for advanced multi-core processors that are likely to become the building blocks of future exascale systems. Our new methodology for large-scale graph analytics combines a highlevel algorithmic design that captures the machine-independent aspects, to guarantee portability with performance to future processors, with an implementation that embeds processorspecific optimizations. We present an experimental study that uses state-of-the-art Intel Nehalem EP and EX processors and up to 64 threads in a single system. Our performance on several benchmark problems representative of the power-law graphs found in real-world problems reaches processing rates that are competitive with supercomputing results in the recent literature. In the experimental evaluation we prove that our graph exploration algorithm running on a 4-socket Nehalem EX is (1) 2.4 times faster than a Cray XMT with 128 processors when exploring a random graph with 64 million vertices and 512 millions edges, (2) capable of processing 550 million edges per second with an R-MAT graph with 200 million vertices and 1 billion edges, comparable to the performance of a similar graph on a Cray MTA-2 with 40 processors and (3) 5 times faster than 256 BlueGene/L processors on a graph with average degree 50.

negative:
Noninvasive prediction of glucose by near-infrared diffuse reflectance spectroscopy. BACKGROUND
Self-monitoring of blood glucose by diabetics is crucial in the reduction of complications related to diabetes. Current monitoring techniques are invasive and painful, and discourage regular use. The aim of this study was to demonstrate the use of near-infrared (NIR) diffuse reflectance over the 1050-2450 nm wavelength range for noninvasive monitoring of blood glucose.

METHODS
Two approaches were used to develop calibration models for predicting the concentration of blood glucose. In the first approach, seven diabetic subjects were studied over a 35-day period with random collection of NIR spectra. Corresponding blood samples were collected for analyte analysis during the collection of each NIR spectrum. The second approach involved three nondiabetic subjects and the use of oral glucose tolerance tests (OGTTs) over multiple days to cause fluctuations in blood glucose concentrations. Twenty NIR spectra were collected over the 3.5-h test, with 16 corresponding blood specimens taken for analyte analysis.

RESULTS
Statistically valid calibration models were developed on three of the seven diabetic subjects. The mean standard error of prediction through cross-validation was 1.41 mmol/L (25 mg/dL). The results from the OGTT testing of three nondiabetic subjects yielded a mean standard error of calibration of 1.1 mmol/L (20 mg/dL). Validation of the calibration model with an independent test set produced a mean standard error of prediction equivalent to 1.03 mmol/L (19 mg/dL).

CONCLUSIONS
These data provide preliminary evidence and allow cautious optimism that NIR diffuse reflectance spectroscopy using the 1050-2450 nm wavelength range can be used to predict blood glucose concentrations noninvasively. Substantial research is still required to validate whether this technology is a viable tool for long-term home diagnostic use by diabetics.

negative: Stock market prediction system with modular neural networks This paper discusses a buying and selling timing prediction system for stocks on the Tokyo Stock Exchange and analysis of intemal representation. It is based on modular neural networks[l][2]. We developed a number of learning algorithms and prediction methods for the TOPIX(Toky0 Stock Exchange Prices Indexes) prediction system. The prediction system achieved accurate predictions and the simulation on stocks tradmg showed an excellent profit. The prediction system was developed by Fujitsu and Nikko Securities.

negative: Forecasting the behavior of multivariate time series using neural networks Abstract--This pal~er presents a neural network approach to multivariate time-series anal.lwis. Real world observations ~?/flottr /.'ices in three cities have been used as a benchmark in our ev~eriments, l"eed/orward connectionist networks have bt,t,tl ~k,.signed to model flottr l , ices over the period/iom ..lltgttsl 1972 to Novt,mher 1980./or the cities ~?[Blt[]ith~. :lliltneapoli.s, and Kansas Cit): Remarkable sttccess has heen achieved ill training the lletworks to leatvt the price CllrlV [i," each t?/these cities and in m a k i l l g acc l t ra le price predictions. Our r¢,~lt/l.s show that the it¢ltral network al~proat'h is a leading contender with the statistical modeling apl,oaches.

negative: Why software fails [software failure] Most IT experts agree that software failures occur far more often than they should despite the fact that, for the most part, they are predictable and avoidable. It is unfortunate that most organizations don't see preventing failure as an urgent matter, even though that view risks harming the organization and maybe even destroying it. Because software failure has tremendous implications for business and society, it is important to understand why this attitude persists.

negative: The Role of Asymmetric Dimethylarginine (ADMA) in Endothelial Dysfunction and Cardiovascular Disease Endothelium plays a crucial role in the maintenance of vascular tone and structure. Endothelial dysfunction is known to precede overt coronary artery disease. A number of cardiovascular risk factors, as well as metabolic diseases and systemic or local inflammation cause endothelial dysfunction. Nitric oxide (NO) is one of the major endothelium derived vaso-active substances whose role is of prime importance in maintaining endothelial homeostasis. Low levels of NO are associated with impaired endothelial function. Asymmetric dimethylarginine (ADMA), an analogue of L-arginine, is a naturally occurring product of metabolism found in human circulation. Elevated levels of ADMA inhibit NO synthesis and therefore impair endothelial function and thus promote atherosclerosis. ADMA levels are increased in people with hypercholesterolemia, atherosclerosis, hypertension, chronic heart failure, diabetes mellitus and chronic renal failure. A number of studies have reported ADMA as a novel risk marker of cardiovascular disease. Increased levels of ADMA have been shown to be the strongest risk predictor, beyond traditional risk factors, of cardiovascular events and all-cause and cardiovascular mortality in people with coronary artery disease. Interventions such as treatment with L-arginine have been shown to improve endothelium-mediated vasodilatation in people with high ADMA levels. However the clinical utility of modifying circulating ADMA levels remains uncertain.

negative: Chip-level and board-level CDM ESD tests on IC products The electrostatic discharge (ESD) transient currents and failure analysis (FA) between chip-level and board-level charged-device-model (CDM) ESD tests are investigated in this work. The discharging current waveforms of three different printed circuit boards (PCBs) are characterized first. Then, the chip-level and board-level CDM ESD tests are performed to an ESD-protected dummy NMOS and a high-speed receiver front-end circuit, respectively. Scanning electron microscope (SEM) failure pictures show that the board-level CDM ESD test causes much severer failure than that caused by the chip-level CDM ESD test.