query: Output Range Analysis for Deep Feedforward Neural Networks

positive: Deep Learning Machine-learning technology powers many aspects of modern society: from web searches to content filtering on social networks to recommendations on e-commerce websites, and it is increasingly present in consumer products such as cameras and smartphones. Machine-learning systems are used to identify objects in images, transcribe speech into text, match news items, posts or products with users’ interests, and select relevant results of search. Increasingly, these applications make use of a class of techniques called deep learning. Conventional machine-learning techniques were limited in their ability to process natural data in their raw form. For decades, constructing a pattern-recognition or machine-learning system required careful engineering and considerable domain expertise to design a feature extractor that transformed the raw data (such as the pixel values of an image) into a suitable internal representation or feature vector from which the learning subsystem, often a classifier, could detect or classify patterns in the input. Representation learning is a set of methods that allows a machine to be fed with raw data and to automatically discover the representations needed for detection or classification. Deep-learning methods are representation-learning methods with multiple levels of representation, obtained by composing simple but non-linear modules that each transform the representation at one level (starting with the raw input) into a representation at a higher, slightly more abstract level. With the composition of enough such transformations, very complex functions can be learned. For classification tasks, higher layers of representation amplify aspects of the input that are important for discrimination and suppress irrelevant variations. An image, for example, comes in the form of an array of pixel values, and the learned features in the first layer of representation typically represent the presence or absence of edges at particular orientations and locations in the image. The second layer typically detects motifs by spotting particular arrangements of edges, regardless of small variations in the edge positions. The third layer may assemble motifs into larger combinations that correspond to parts of familiar objects, and subsequent layers would detect objects as combinations of these parts. The key aspect of deep learning is that these layers of features are not designed by human engineers: they are learned from data using a general-purpose learning procedure. Deep learning is making major advances in solving problems that have resisted the best attempts of the artificial intelligence community for many years. It has turned out to be very good at discovering intricate structures in high-dimensional data and is therefore applicable to many domains of science, business and government. In addition to beating records in image recognition and speech recognition, it has beaten other machine-learning techniques at predicting the activity of potential drug molecules, analysing particle accelerator data, reconstructing brain circuits, and predicting the effects of mutations in non-coding DNA on gene expression and disease. Perhaps more surprisingly, deep learning has produced extremely promising results for various tasks in natural language understanding, particularly topic classification, sentiment analysis, question answering and language translation. We think that deep learning will have many more successes in the near future because it requires very little engineering by hand, so it can easily take advantage of increases in the amount of available computation and data. New learning algorithms and architectures that are currently being developed for deep neural networks will only accelerate this progress.

positive: Formal Verification of Piece-Wise Linear Feed-Forward Neural Networks We present an approach for the verification of feed-forward neural networks in which all nodes have a piece-wise linear activation function. Such networks are often used in deep learning and have been shown to be hard to verify for modern satisfiability modulo theory (SMT) and integer linear programming (ILP) solvers. The starting point of our approach is the addition of a global linear approximation of the overall network behavior to the verification problem that helps with SMT-like reasoning over the network behavior. We present a specialized verification algorithm that employs this approximation in a search process in which it infers additional node phases for the non-linear nodes in the network from partial node phase assignments, similar to unit propagation in classical SAT solving. We also show how to infer additional conflict clauses and safe node fixtures from the results of the analysis steps performed during the search. The resulting approach is evaluated on collision avoidance and handwritten digit recognition case studies.

positive: Practical Black-Box Attacks against Deep Learning Systems using Adversarial Examples Machine learning (ML) models, e.g., state-of-the-art deep neural networks (DNNs), are vulnerable to adversarial examples: malicious inputs modified to yield erroneous model outputs, while appearing unmodified to human observers. Potential attacks include having malicious content like malware identified as legitimate or controlling vehicle behavior. Yet, all existing adversarial example attacks require knowledge of either the model internals or its training data. We introduce the first practical demonstration of an attacker controlling a remotely hosted DNN with no such knowledge. Indeed, the only capability of our black-box adversary is to observe labels given by the DNN to chosen inputs. Our attack strategy consists in training a local model to substitute for the target DNN, using inputs synthetically generated by an adversary and labeled by the target DNN. We then use the local substitute to craft adversarial examples, and find that they are misclassified by the targeted DNN. To perform a real-world and properly-blinded evaluation, we attack a DNN hosted by MetaMind, an online deep learning API. After labeling 6,400 synthetic inputs to train our substitute (an order of magnitude smaller than the training set used by MetaMind), we find that their DNN misclassifies adversarial examples crafted with our substitute at a rate of 84.24%. We demonstrate that our strategy generalizes to many ML techniques like logistic regression or SVMs, regardless of the ML model chosen for the substitute. We instantiate the same attack against models hosted by Amazon and Google, using logistic regression substitutes trained with only 800 label queries. They yield adversarial examples misclassified by Amazon and Google at rates of 96.19% and 88.94%. We also find that this black-box attack strategy is capable of evading defense strategies previously found to make adversarial example crafting harder. We conclude with experiments exploring why adversarial samples transfer between models.

positive: Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networks Deep neural networks have emerged as a widely used and effective means for tackling complex, real-world problems. However, a major obstacle in applying them to safety-critical systems is the great difficulty in providing formal guarantees about their behavior. We present a novel, scalable, and efficient technique for verifying properties of deep neural networks (or providing counter-examples). The technique is based on the simplex method, extended to handle the non-convex Rectified Linear Unit (ReLU ) activation function, which is a crucial ingredient in many modern neural networks. The verification procedure tackles neural networks as a whole, without making any simplifying assumptions. We evaluated our technique on a prototype deep neural network implementation of the next-generation airborne collision avoidance system for unmanned aircraft (ACAS Xu). Results show that our technique can successfully prove properties of networks that are an order of magnitude larger than the largest networks verified using existing methods.

positive: Learning representations by back-propagating errors We describe a new learning procedure, back-propagation, for networks of neurone-like units. The procedure repeatedly adjusts the weights of the connections in the network so as to minimize a measure of the difference between the actual output vector of the net and the desired output vector. As a result of the weight adjustments, internal ‘hidden’ units which are not part of the input or output come to represent important features of the task domain, and the regularities in the task are captured by the interactions of these units. The ability to create useful new features distinguishes back-propagation from earlier, simpler methods such as the perceptron-convergence procedure1.

negative: Alphasort: A cache-sensitive parallel external sort A new sort algorithm, called AlphaSort, demonstrates that commodity processors and disks can handle commercial batch workloads. Using commodity processors, memory, and arrays of SCSI disks, AlphaSort runs the industrystandard sort benchmark in seven seconds. This beats the best published record on a 32-CPU 32-disk Hypercube by 8:1. On another benchmark, AlphaSort sorted more than a gigabyte in one minute. AlphaSort is a cache-sensitive, memoryintensive sort algorithm. We argue that modern architectures require algorithm designers to re-examine their use of the memory hierarchy. AlphaSort uses clustered data structures to get good cache locality, file striping to get high disk bandwidth, QuickSort to generate runs, and replacement-selection to merge the runs. It uses shared memory multiprocessors to break the sort into subsort chores. Because startup times are becoming a significant part of the total time, we propose two new benchmarks: (1) MinuteSort: how much can you sort in one minute, and (2) PennySort: how much can you sort for one penny.

negative: Universal OWL Axiom Enrichment for Large Knowledge Bases The Semantic Web has seen a rise in the availability and usage of knowledge bases over the past years, in particular in the Linked Open Data initiative. Despite this growth, there is still a lack of knowledge bases that consist of high quality schema information and instance data adhering to this schema. Several knowledge bases only consist of schema information, while others are, to a large extent, a mere collection of facts without a clear structure. The combination of rich schema and instance data would allow powerful reasoning, consistency checking, and improved querying possibilities as well as provide more generic ways to interact with the underlying data. In this article, we present a light-weight method to enrich knowledge bases accessible via SPARQL endpoints with almost all types of OWL 2 axioms. This allows to semiautomatically create schemata, which we evaluate and discuss using DBpedia.

negative: Role-Based Access Controls While Mandatory Access Controls (MAC) are appropriate for multilevel secure military applications, Discretionary Access Controls (DAC) are often perceived as meeting the security processing needs of industry and civilian government. This paper argues that reliance on DAC as the principal method of access control is unfounded and inappropriate for many commercial and civilian government organizations. The paper describes a type of non-discretionary access control role-based access control (RBAC)  that is more central to the secure processing needs of non-military systems than DAC.

negative: Leveraging the schema in latent factor models for knowledge graph completion We focus on the problem of predicting missing links in large Knowledge Graphs (KGs), so to discover new facts. Over the last years, latent factor models for link prediction have been receiving an increasing interest: they achieve state-of-the-art accuracy in link prediction tasks, while scaling to very large KGs. However, KGs are often endowed with additional schema knowledge, describing entity classes, their sub-class relationships, and the domain and range of each predicate: the schema is actually not used by latent factor models proposed in the literature. In this work, we propose an unified method for leveraging additional schema knowledge in latent factor models, with the aim of learning more accurate link prediction models. Our experimental evaluations show the effectiveness of the proposed method on several KGs.

negative: A new miniaturized antenna for ISM 433 MHz frequency band A new miniaturized antenna for 433MHz frequency band is introduced for sensor networks. The antenna is a magnetic monopole loaded with a capacitor, which can significantly decrease the resonant frequency of the structure. It is designed to operate in the ISM 433MHz band on a small PCB (103mm⋆55mm) and has at least 3MHz bandwidth. Moreover, its radiation efficiency is suitable for the possible applications and its pattern is omnidirectionnal.

negative: HeidelPlace: An Extensible Framework for Geoparsing Geographic information extraction from textual data sources, called geoparsing, is a key task in text processing and central to subsequent spatial analysis approaches. Several geoparsers are available that support this task, each with its own (often limited or specialized) gazetteer and its own approaches to toponym detection and resolution. In this demonstration paper, we present HeidelPlace, an extensible framework in support of geoparsing. Key features of HeidelPlace include a generic gazetteer model that supports the integration of place information from different knowledge bases, and a pipeline approach that enables an effective combination of diverse modules tailored to specific geoparsing tasks. This makes HeidelPlace a valuable tool for testing and evaluating different gazetteer sources and geoparsing methods. In the demonstration, we show how to set up a geoparsing workflow with HeidelPlace and how it can be used to compare and consolidate the output of different geoparsing approaches.

negative: Learning Recurrent Span Representations for Extractive Question Answering The reading comprehension task, that asks questions about a given evidence document, is a central problem in natural language understanding. Recent formulations of this task have typically focused on answer selection from a set of candidates pre-defined manually or through the use of an external NLP pipeline. However, Rajpurkar et al. (2016) recently released the SQUAD dataset in which the answers can be arbitrary strings from the supplied text. In this paper, we focus on this answer extraction task, presenting a novel model architecture that efficiently builds fixed length representations of all spans in the evidence document with a recurrent network. We show that scoring explicit span representations significantly improves performance over other approaches that factor the prediction into separate predictions about words or start and end markers. Our approach improves upon the best published results of Wang & Jiang (2016) by 5% and decreases the error of Rajpurkar et al.’s baseline by > 50%.

negative: Optimizing 2D Gabor Filters for Iris Recognition The randomness and richness present in the iris texture make the 2D Gabor filter bank analysis a suitable technique to be used for iris recognition systems. To accurately characterize complex texture structures using 2D Gabor filters it is necessary to use multiple sets of parameters of this type of filters. This paper proposes a technique of optimizing multiple sets of 2D Gabor filter parameters to gradually enhance the accuracy of an iris recognition system. The proposed methodology is suitable to be applied on both near infrared and visible spectrum iris images. To illustrate the efficiency of the filter bank design technique, UBIRISv1 database was used for benchmarking.

negative: Investigation of a new GaN AC/DC topology for battery charging application Switching losses are reduced by gallium nitride (GaN) technology, which allows faster device switching speeds. At the same time, the weight and size of converters utilizing these devices are greatly reduced in several applications by using high frequency (HF) transformers. A new, low voltage high current, GaN-based AC/DC topology for battery charging applications is simulated, modeled, and investigated in this paper. The proposed topology is designed to operate at 1 MHz for 120Vac to 48Vdc/60Vdc conversion for 1.4 kW load. The integration of GaN totem-pole power factor correction rectifier (TP-PFC), high-frequency series-resonant converter (SRC), and current doubler rectifier (CDR) presents an opportunity to further increase the efficiency and compactness of this GaN battery charging system. In this work, a new GaN topology to combine the advantages of TP-PFC and SRC with CDR in a battery charging converter is investigated, simulated, and modelled. Loss analysis of the proposed topology is addressed.

negative: BodyAvatar: creating freeform 3D avatars using first-person body gestures BodyAvatar is a Kinect-based interactive system that allows users without professional skills to create freeform 3D avatars using body gestures. Unlike existing gesture-based 3D modeling tools, BodyAvatar centers around a first-person "you're the avatar" metaphor, where the user treats their own body as a physical proxy of the virtual avatar. Based on an intuitive body-centric mapping, the user performs gestures to their own body as if wanting to modify it, which in turn results in corresponding modifications to the avatar. BodyAvatar provides an intuitive, immersive, and playful creation experience for the user. We present a formative study that leads to the design of BodyAvatar, the system's interactions and underlying algorithms, and results from initial user trials.

negative: Reduction in gravitational torques of an industrial robot equipped with 2 DOF passive counterbalance mechanisms In most 6 DOF robot arms, considerable amounts of gravitational torques due to the robot's own weight are applied to pitch joints of the robot, which causes most arms to use high capacity motors and speed reducers. A spring-based counterbalance mechanism can compensate for this gravitational torque, thus leading to a significant reduction in the effect of gravity. However, a simple installation of counterbalance mechanisms at each pitch joint does not work properly because the gravitational torque at each joint is dependent also on the other joints. To achieve multi-DOF counterbalancing, we propose a parallelogram linkage combined with dual counterbalance mechanisms, each being composed of a slider-crank mechanism and springs. Simulations and experimental results showed that the counterbalance robot arm based on the proposed counterbalance mechanisms effectively reduced the torques required to support the robot mass, thus allowing the prospective use of much smaller motors and speed reducers than traditional industrial robots.

negative: 3D Deep Learning for Efficient and Robust Landmark Detection in Volumetric Data Recently, deep learning has demonstrated great success in computer vision with the capability to learn powerful image features from a large training set. However, most of the published work has been confined to solving 2D problems, with a few limited exceptions that treated the 3D space as a composition of 2D orthogonal planes. The challenge of 3D deep learning is due to a much larger input vector, compared to 2D, which dramatically increases the computation time and the chance of over-fitting, especially when combined with limited training samples (hundreds to thousands), typical for medical imaging applications. To address this challenge, we propose an efficient and robust deep learning algorithm capable of full 3D detection in volumetric data. A two-step approach is exploited for efficient detection. A shallow network (with one hidden layer) is used for the initial testing of all voxels to obtain a small number of promising candidates, followed by more accurate classification with a deep network. In addition, we propose two approaches, i.e., separable filter decomposition and network sparsification, to speed up the evaluation of a network. To mitigate the over-fitting issue, thereby increasing detection robustness, we extract small 3D patches from a multi-resolution image pyramid. The deeply learned image features are further combined with Haar wavelet features to increase the detection accuracy. The proposed method has been quantitatively evaluated for carotid artery bifurcation detection on a head-neck CT dataset from 455 patients. Compared to the state-ofthe-art, the mean error is reduced by more than half, from 5.97 mm to 2.64 mm, with a detection speed of less than 1 s/volume.

negative: Simple Personalized Search Based on Long-Term Behavioral Signals Extensive research has shown that content-based Web result ranking can be significantly improved by considering personal behavioral signals (such as past queries) and global behavioral signals (such as global click frequencies). In this work we present a new approach to incorporating click behavior into document ranking, using ideas of click models as well as learning to rank. We show that by training a click model with pairwise loss, as is done in ranking problems, our approach achieves personalized reranking performance comparable to the stateof-the-art while eliminating much of the complexity required by previous models. This contrasts with other approaches that rely on complex feature engineering.

negative: Development of a Biomimetic Hand Exotendon Device (BiomHED) for Restoration of Functional Hand Movement Post-Stroke Significant functional impairment of the hand is common among stroke survivors and restoration of hand function should be prioritized during post-stroke rehabilitation. The goal of this study was to develop a novel biomimetic device to assist patients in producing complex hand movements with a limited number of actuators. The Biomimetic Hand Exoskeleton Device (BiomHED) is actuated by exotendons that mimic the geometry of the major tendons of the hand. Ten unimpaired subjects and four chronic stroke survivors participated in experiments that tested the efficacy of the system. The exotendons reproduced distinct spatial joint coordination patterns similar to their target muscle-tendon units for both subject groups. In stroke survivors, the exotendon-produced joint angular displacements were smaller, but not significantly different, than those of unimpaired subjects (\mbi p = 0.15-0.84). Even with limited use of the BiomHED, the kinematic workspace of the index finger increased by 63%-1014% in stroke survivors. The device improved the kinematics of the tip-pinch task in stroke survivors and resulted in a significant reduction in the fingertip-thumb tip distance ( 17.9 ±15.3 mm). This device is expected to enable effective “task-oriented” training of the hand post-stroke.

negative: Local-global ranking for facial expression intensity estimation Facial action units provide an objective characterization of facial muscle movements. Automatic estimation of facial action unit intensities is a challenging problem given individual differences in neutral face appearances and the need to generalize across different pose, illumination and datasets. In this paper, we introduce the Local-Global Ranking method as a novel alternative to direct prediction of facial action unit intensities. Our method takes advantage of the additional information present in videos and image collections of the same person (e.g. a photo album). Instead of trying to estimate facial expression intensities independently for each image, our proposed method performs a two-stage ranking: a local pair-wise ranking followed by a global ranking. The local ranking is designed to be accurate and robust by making a simple 3-class comparison (higher, equal, or lower) between randomly sampled pairs of images. We use a Bayesian model to integrate all these pair-wise rankings and construct a global ranking. Our Local-Global Ranking method shows state-of-the-art performance on two publicly-available datasets. Our cross-dataset experiments also show better generalizability.

negative: Development of humanoid robot HRP-3P A development of humanoid robot HRP-3P, which is a humanoid robot HRP-3 prototype, is presented in this paper. HRP-3 is under development as the succession humanoid to HRP-2, which we developed in phase two of HRP (humanoid robotics project). One of futures of HRP-3P is that its main mechanical and structural components are designed for protection against dust and water. Another is that node controllers are developed for realization of distributed control system. Real-time communication on Ethernet is also newly developed for communication between main controller and node controllers. In this paper, mechanical features and electrical features are presented with specifications of HRP-3P

negative: An Algebraic Fault Attack on the LED Block Cipher In this paper we propose an attack on block ciphers where we combine techniques derived from algebraic and fault based cryptanalysis. The recently introduced block cipher LED serves us as a target for our attack. We show how to construct an algebraic representation of the encryption map and how to cast the side channel information gained from a fault injection into polynomial form. The resulting polynomial system is converted into a logical formula in conjunctive normal form and handed over to a SAT solver for reconstruction of the secret key. Following this approach we were able to mount a new, successful attack on the version of LED that uses a 64-bit secret key, requiring only a single fault injection.

negative: The building blocks of economic complexity. For Adam Smith, wealth was related to the division of labor. As people and firms specialize in different activities, economic efficiency increases, suggesting that development is associated with an increase in the number of individual activities and with the complexity that emerges from the interactions between them. Here we develop a view of economic growth and development that gives a central role to the complexity of a country's economy by interpreting trade data as a bipartite network in which countries are connected to the products they export, and show that it is possible to quantify the complexity of a country's economy by characterizing the structure of this network. Furthermore, we show that the measures of complexity we derive are correlated with a country's level of income, and that deviations from this relationship are predictive of future growth. This suggests that countries tend to converge to the level of income dictated by the complexity of their productive structures, indicating that development efforts should focus on generating the conditions that would allow complexity to emerge to generate sustained growth and prosperity.

negative: 3D spatial pyramid: descriptors generation from point clouds for indoor scene classification Traditionally, the indoor scene classification problem has been approached from a 2D image recognition point of view. In most visual scene classification systems, a descriptor for the input image is generated to obtain a suitable representation that includes features related to color, shape or spatial information. Techniques based on the use of a spatial pyramid have proven to be adequate to perform this step. In the past years, on the other hand, 3D sensors have become widely available, which allows to include new information sources to the framework previously described. In this work we rely on RGB-D data to extend the spatial pyramid approach, aimed at building descriptors that can lead to a more robust representation against changing lighting conditions. The proposed descriptors are evaluated on the RobotVision@ImageCLEF-2013 benchmark dataset, remarkably outperforming state-of-the-art 3D local and global descriptors.

negative: METAMEMORY : A THEORETICAL FRAMEWORK AND NEW FINDINGS Although there has been excellent research by many investigators on the topic of metamemory, here we will focus on our own research program. This article will begin with a description of a theoretical framework that has evolved out of metamemory research, followed by a few remarks about our methodology, and will end with a review of our previously unpublished findings. (Our published findings will not be systematically reviewed here; instead, they will be mentioned only when necessary for continuity .)

negative: Customer churn analysis : A case study on the telecommunication industry of Thailand Customer churn creates a huge anxiety in highly competitive service sectors especially the telecommunications sector. The objective of this research was to develop a predictive churn model to predict the customers that will be to churn; this is the first step to construct a retention management plan. The dataset was extracted from the data warehouse of the mobile telecommunication company in Thailand. The system generated the customer list, to implement a retention campaign to manage the customers with tendency to leave the company. WEKA software was used to implement the followings techniques: C4.5 decision trees algorithm, the logistic regression algorithm and the neural network algorithm. The C4.5 algorithm of decision trees proved optimal among the models. The findings are unequivocally beneficial to industry and other partners.

negative: A New Concave Hull Algorithm and Concaveness Measure for n-dimensional Datasets Convex and concave hulls are useful concepts for a wide variety of application areas, such as pattern recognition, image processing, statistics, and classification tasks. Concave hull performs better than convex hull, but it is difficult to formulate and few algorithms are suggested. Especially, an n-dimensional concave hull is more difficult than a 2or 3dimensional one. In this paper, we propose a new concave hull algorithm for n-dimensional datasets. It is simple but creative. We show its application to dataset analysis. We also suggest a concaveness measure and a graph that captures geometric shape of an n-dimensional dataset. Proposed concave hull algorithm and concaveness measure/graph are implemented using java, and are posted to http://user.dankook.ac.kr/ ~bitl/dkuCH.

negative: User Migration in Online Social Networks: A Case Study on Reddit During a Period of Community Unrest Platforms like Reddit have attracted large and vibrant communities, but the individuals in those communities are free to migrate to other platforms at any time. History has borne this out with the mass migration from Slashdot to Digg. The underlying motivations of individuals who migrate between platforms, and the conditions that favor migration online are not well-understood. We examine Reddit during a period of community unrest affecting millions of users in the summer of 2015, and analyze large-scale changes in user behavior and migration patterns to Reddit-like alternative platforms. Using self-reported statements from user comments, surveys, and a computational analysis of the activity of users with accounts on multiple platforms, we identify the primary motivations driving user migration. While a notable number of Reddit users left for other platforms, we found that an important pull factor that enabled Reddit to retain users was its long tail of niche content. Other platforms may reach critical mass to support popular or “mainstream” topics, but Reddit’s large userbase provides a key advantage in supporting niche top-

negative: Innovative technology-based interventions for autism spectrum disorders: a meta-analysis. This article reports the results of a meta-analysis of technology-based intervention studies for children with autism spectrum disorders. We conducted a systematic review of research that used a pre-post design to assess innovative technology interventions, including computer programs, virtual reality, and robotics. The selected studies provided interventions via a desktop computer, interactive DVD, shared active surface, and virtual reality. None employed robotics. The results provide evidence for the overall effectiveness of technology-based training. The overall mean effect size for posttests of controlled studies of children with autism spectrum disorders who received technology-based interventions was significantly different from zero and approached the medium magnitude, d = 0.47 (confidence interval: 0.08-0.86). The influence of age and IQ was not significant. Differences in training procedures are discussed in the light of the negative correlation that was found between the intervention durations and the studies' effect sizes. The results of this meta-analysis provide support for the continuing development, evaluation, and clinical usage of technology-based intervention for individuals with autism spectrum disorders.

negative: Social recommendation using Euclidean embedding Traditional recommender systems assume that all the users are independent, and they usually face the cold start and data sparse problems. To alleviate these problems, social recommender systems use social relations as an additional input to improve recommendation accuracy. Social recommendation follows the intuition that people with social relationships share some kinds of preference towards items. Current social recommendation methods commonly apply the Matrix Factorization (MF) model to incorporate social information into the recommendation process. As an alternative model to MF, we propose a novel social recommendation approach based on Euclidean Embedding (SREE) in this paper. The idea is to embed users and items in a unified Euclidean space, where users are close to both their desired items and social friends. Experimental results conducted on two real-world data sets illustrate that our proposed approach outperforms the state-of-the-art methods in terms of recommendation accuracy.

negative: CRF-CNN: Modeling Structured Information in Human Pose Estimation Deep convolutional neural networks (CNN) have achieved great success. On the other hand, modeling structural information has been proved critical in many vision problems. It is of great interest to integrate them effectively. In a classical neural network, there is no message passing between neurons in the same layer. In this paper, we propose a CRF-CNN framework which can simultaneously model structural information in both output and hidden feature layers in a probabilistic way, and it is applied to human pose estimation. A message passing scheme is proposed, so that in various layers each body joint receives messages from all the others in an efficient way. Such message passing can be implemented with convolution between features maps in the same layer, and it is also integrated with feedforward propagation in neural networks. Finally, a neural network implementation of endto-end learning CRF-CNN is provided. Its effectiveness is demonstrated through experiments on two benchmark datasets.

negative: Attentive Tensor Product Learning for Language Generation and Grammar Parsing This paper proposes a new architecture — Attentive Tensor Product Learning (ATPL) — to represent grammatical structures in deep learning models. ATPL is a new architecture to bridge this gap by exploiting Tensor Product Representations (TPR), a structured neural-symbolic model developed in cognitive science, aiming to integrate deep learning with explicit language structures and rules. The key ideas of ATPL are: 1) unsupervised learning of role-unbinding vectors of words via TPR-based deep neural network; 2) employing attention modules to compute TPR; and 3) integration of TPR with typical deep learning architectures including Long Short-Term Memory (LSTM) and Feedforward Neural Network (FFNN). The novelty of our approach lies in its ability to extract the grammatical structure of a sentence by using role-unbinding vectors, which are obtained in an unsupervised manner. This ATPL approach is applied to 1) image captioning, 2) part of speech (POS) tagging, and 3) constituency parsing of a sentence. Experimental results demonstrate the effectiveness of the proposed approach.

negative: Cross-Lingual Propagation for Deep Sentiment Analysis Across the globe, people are voicing their opinion in social media and various other online fora. Given such data, modern deep learning-based sentiment analysis methods excel at determining the sentiment polarity of what is being said about companies, products, etc. Unfortunately, such deep methods require significant training data, while for many languages, resources and training data are scarce. In this work, we present a cross-lingual propagation algorithm that yields sentiment embedding vectors for numerous languages. We then rely on a dual-channel convolutional neural architecture to incorporate them into the network. This allows us to achieve gains in deep sentiment analysis across a range of languages and domains.

negative: Chainer : a Next-Generation Open Source Framework for Deep Learning Software frameworks for neural networks play key roles in the development and application of deep learning methods. However, as new types of deep learning models are developed, existing frameworks designed for convolutional neural networks are becoming less useful. In this paper, we introduce Chainer, a Pythonbased, standalone open source framework for deep learning models. Chainer provides a flexible, intuitive, and high performance means of implementing a full range of deep learning models, including state-of-the-art models such as recurrent neural networks and variational autoencoders.

negative: Improving neural networks by preventing co-adaptation of feature detectors When a large feedforward neural network is trained on a small training set, it typically performs poorly on held-out test data. This overfitting is greatly reduced by randomly omitting half of the feature detectors on each training case. This prevents complex co-adaptations in which a feature detector is only helpful in the context of several other specific feature detectors. Instead, each neuron learns to detect a feature that is generally helpful for producing the correct answer given the combinatorially large variety of internal contexts in which it must operate. Random “dropout” gives big improvements on many benchmark tasks and sets new records for speech and object recognition. A feedforward, artificial neural network uses layers of non-linear hidden units between its inputs and its outputs. By adapting the weights on the incoming connections of these hidden units it learns feature detectors that enable it to predict the correct output when given an input vector [15]. If the relationship between the input and the correct output is complicated and the network has enough hidden units to model it accurately, there will typically be many different settings of the weights that can model the training set almost perfectly, especially if there is only a limited amount of labeled training data. Each of these weight vectors will make different predictions on held-out test data and almost all of them will do worse on the test data than on the training data because the feature detectors have been tuned to work well together on the training data but not on the test data. Overfitting can be reduced by using “dropout” to prevent complex co-adaptations on the training data. On each presentation of each training case, each hidden unit is randomly omitted from the network with a probability of 0.5, so a hidden unit cannot rely on other hidden units being present. Another way to view the dropout procedure is as a very efficient way of performing model averaging with neural networks. A good way to reduce the error on the test set is to average the predictions produced by a very large number of different networks. The standard way to do this is to train many separate networks and then to apply each of these networks to the test data, but this is computationally expensive during both training and testing. Random dropout makes it possible to train a huge number of different networks in a reasonable time. There is almost certainly a different network for each presentation of each training case but all of these networks share the same weights for the hidden units that are present. We use the standard, stochastic gradient descent procedure for training the dropout neural networks on mini-batches of training cases, but we modify the penalty term that is normally used to prevent the weights from growing too large. Instead of penalizing the squared length (L2 norm) of the whole weight vector, we set an upper bound on the L2 norm of the incoming weight vector for each individual hidden unit. If a weight-update violates this constraint, we renormalize the weights of the hidden unit by division. Using a constraint rather than a penalty prevents weights from growing very large no matter how large the proposed weight-update is. This makes it possible to start with a

negative: My First Deep Learning System of 1991 + Deep Learning Timeline 1962-2013 Deep Learning has attracted significant attention in recent years. Here I present a brief overview of my first Deep Learner of 1991, and its historic context, with a timeline of Deep Learning highlights. Note: As a machine learning researcher I am obsessed with proper credit assignment. This draft is the result of an experiment in rapid massive open online peer review. Since 20 September 2013, subsequent revisions published under www.deeplearning.me have absorbed many suggestions for improvements by experts. The abbreviation “TL” is used to refer to subsections of the timeline section. Figure 1: My first Deep Learning system of 1991 used a deep stack of recurrent neural networks (a Neural Hierarchical Temporal Memory) pre-trained in unsupervised fashion to accelerate subsequent supervised learning [79, 81, 82]. 1 ar X iv :1 31 2. 55 48 v1 [ cs .N E ] 1 9 D ec 2 01 3 In 2009, our Deep Learning Artificial Neural Networks became the first Deep Learners to win official international pattern recognition competitions [40, 83] (with secret test sets known only to the organisers); by 2012 they had won eight of them (TL 1.13), including the first contests on object detection in large images (ICPR 2012) [2, 16] and image segmentation (ISBI 2012) [3, 15]. In 2011, they achieved the world’s first superhuman visual pattern recognition results [20, 19]. Others have implemented very similar techniques, e.g., [51], and won additional contests or set benchmark records since 2012, e.g., (TL 1.13, TL 1.14). The field of Deep Learning research is far older though—compare the timeline (TL) further down. My first Deep Learner dates back to 1991 [79, 81, 82] (TL 1.7). It can perform credit assignment across hundreds of nonlinear operators or neural layers, by using unsupervised pre-training for a stack of recurrent neural networks (RNN) (deep by nature) as in Figure 1. Such RNN are general computers more powerful than normal feedforward NN, and can encode entire sequences of input vectors. The basic idea is still relevant today. Each RNN is trained for a while in unsupervised fashion to predict its next input. From then on, only unexpected inputs (errors) convey new information and get fed to the next higher RNN which thus ticks on a slower, self-organising time scale. It can easily be shown that no information gets lost. It just gets compressed (much of machine learning is essentially about compression). We get less and less redundant input sequence encodings in deeper and deeper levels of this hierarchical temporal memory, which compresses data in both space (like feedforward NN) and time. There also is a continuous variant [84]. One ancient illustrative Deep Learning experiment of 1993 [82] required credit assignment across 1200 time steps, or through 1200 subsequent nonlinear virtual layers. The top level code of the initially unsupervised RNN stack, however, got so compact that (previously infeasible) sequence classification through additional supervised learning became possible. There is a way of compressing higher levels down into lower levels, thus partially collapsing the hierarchical temporal memory. The trick is to retrain lower-level RNN to continually imitate (predict) the hidden units of already trained, slower, higher-level RNN, through additional predictive output neurons [81, 79, 82]. This helps the lower RNN to develop appropriate, rarely changing memories that may bridge very long time lags. The Deep Learner of 1991 was a first way of overcoming the Fundamental Deep Learning Problem identified and analysed in 1991 by my very first student (now professor) Sepp Hochreiter (TL 1.6): the problem of vanishing or exploding gradients [46, 47, 10]. The latter motivated all our subsequent Deep Learning research of the 1990s and 2000s. Through supervised LSTM RNN (1997) (e.g., [48, 32, 39, 36, 37, 40, 38, 83], TL 1.8) we could eventually perform similar feats as with the 1991 system [81, 82], overcoming the Fundamental Deep Learning Problem without any unsupervised pre-training. Moreover, LSTM could also learn tasks unlearnable by the partially unsupervised 1991 chunker [81, 82]. Particularly successful are stacks of LSTM RNN [40] trained by Connectionist Temporal Classification (CTC) [36]. On faster computers of 2009, this became the first RNN system ever to win an official international pattern recognition competition [40, 83], through the work of my PhD student and postdoc Alex Graves, e.g., [40]. To my knowledge, this also was the first Deep Learning system ever (recurrent or not) to win such a contest (TL 1.10). (In fact, it won three different ICDAR 2009 contests on connected handwriting in three different languages, e.g., [83, 40], TL 1.10.) A while ago, Alex moved on to Geoffrey Hinton’s lab (Univ. Toronto), where a stack [40] of our bidirectional LSTM RNN [39] also broke a famous TIMIT speech recognition record [38] (TL 1.14), despite thousands of man years previously spent on HMM-based speech recognition research. CTC-LSTM also helped to score first at NIST’s OpenHaRT2013 evaluation [11]. Recently, well-known entrepreneurs also got interested [43, 52] in such hierarchical temporal memories [81, 82] (TL 1.7). The expression Deep Learning actually got coined relatively late, around 2006, in the context of unsupervised pre-training for less general feedforward networks [44] (TL 1.9). Such a system reached 1.2% error rate [44] on the MNIST handwritten digits [54, 55], perhaps the most famous benchmark of Machine Learning. Our team first showed that good old backpropagation (TL 1.2) on GPUs (with training pattern distortions [6, 86] but without any unsupervised pre-training) can actually achieve a three times better result of 0.35% [17] back then, a world record (a previous standard net achieved 0.7% [86]; a backprop-trained [54, 55] Convolutional NN (CNN or convnet) [29, 30, 54, 55] got 0.39% [70](TL 1.9);

negative: Neural networks for computer-aided diagnosis: detection of lung nodules in chest radiograms The paper describes a neural-network-based system for the computer aided detection of lung nodules in chest radiograms. Our approach is based on multiscale processing and artificial neural networks (ANNs). The problem of nodule detection is faced by using a two-stage architecture including: 1) an attention focusing subsystem that processes whole radiographs to locate possible nodular regions ensuring high sensitivity; 2) a validation subsystem that processes regions of interest to evaluate the likelihood of the presence of a nodule, so as to reduce false alarms and increase detection specificity. Biologically inspired filters (both LoG and Gabor kernels) are used to enhance salient image features. ANNs of the feedforward type are employed, which allow an efficient use of a priori knowledge about the shape of nodules, and the background structure. The images from the public JSRT database, including 247 radiograms, were used to build and test the system. We performed a further test by using a second private database with 65 radiograms collected and annotated at the Radiology Department of the University of Florence. Both data sets include nodule and nonnodule radiographs. The use of a public data set along with independent testing with a different image set makes the comparison with other systems easier and allows a deeper understanding of system behavior. Experimental results are described by ROC/FROC analysis. For the JSRT database, we observed that by varying sensitivity from 60 to 75% the number of false alarms per image lies in the range 4-10, while accuracy is in the range 95.7-98.0%. When the second data set was used comparable results were obtained. The observed system performances support the undertaking of system validation in clinical settings.


query: Robust Structured Light Coding for 3D Reconstruction

positive: Pattern codification strategies in structured light systems Coded structured light is considered one of the most reliable techniques for recovering the surface of objects. This technique is based on projecting a light pattern and viewing the illuminated scene from one or more points of view. Since the pattern is coded, correspondences between image points and points of the projected pattern can be easily found. The decoded points can be triangulated and 3D information is obtained. We present an overview of the existing techniques, as well as a new and de nitive classi cation of patterns for structured light sensors. We have implemented a set of representative techniques in this eld and present some comparative results. The advantages and constraints of the di5erent patterns are also discussed. ? 2003 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.

positive: Rapid Shape Acquisition Using Color Structured Light and Multi-pass Dynamic Programming This paper presents a color structured light technique for recovering object shape from one or more images. The technique works by projecting a pattern of stripes of alternating colors and matching the projected color transitions with observed edges in the image. The correspondence problem is solved using a novel, multi-pass dynamic programming algorithm that eliminates global smoothness assumptions and strict ordering constraints present in previous formulations. The resulting approach is suitable for generating both highspeed scans of moving objects when projecting a single stripe pattern and high-resolution scans of static scenes using a short sequence of time-shifted stripe patterns. In the latter case, spacetime analysis is used at each sensor pixel to obtain inter-frame depth localization. Results are demonstrated for a variety of complex scenes.

positive: A robust-coded pattern projection for dynamic 3D scene measurement This paper presents a new coded structured light pattern which permits to solve the correspondence problem by a single shot and without using geometrical constraints. The pattern is composed by the projection of a grid made by coloured slits in such a way that each slit with its two neighbours appears only once in the pattern. The technique proposed permits a rapid and robust 3D scene measurement, even with moving objects. Ó 1998 Elsevier Science B.V. All rights reserved.

positive: Recent progress in coded structured light as a technique to solve the correspondence problem: a survey We present a survey of the most significant techniques, used in the last few years, concerning the coded structured light methods employed to get 3D information. In fact, depth perception is one of the most important subjects in computer vision. Stereovision is an attractive and widely used method, but, it is rather limited to make 3D surface maps, due to the correspondence problem. The correspondence problem can be improved using a method based on structured light concept, projecting a given pattern on the measuring surfaces. However, some relations between the projected pattern and the reflected one must be solved. This relationship can be directly found codifying the projected light, so that, each imaged region of the projected pattern carries the needed information to solve the correspondence problem. ( 1998 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved. Pattern projection Correspondence problem Active stereo Depth perception Range data Computer vision.

positive: A low cost 3D scanner based on structured light Automatic 3D acquisition devices (often called 3D scanners) allow to build highly accurate models of real 3D objects in a costand time-effective manner. We have experimented this technology in a particular application context: the acquisition of Cultural Heritage artefacts. Specific needs of this domain are: medium-high accuracy, easy of use, affordable cost of the scanning device, self-registered acquisition of shape and color data, and finally operational safety for both the operator and the scanned artefacts. According to these requirements, we designed a low-cost 3D scanner based on structured light which adopts a new, versatile colored stripe pattern approach. We present the scanner architecture, the software technologies adopted, and the first results of its use in a project regarding the 3D acquisition of an archeological statue.

negative: Classification of Defect Clusters on Semiconductor Wafers Via the Hough Transformation The Hough transformation employing a normal line-to-point parameterization is widely applied in digital image processing for feature detection. In this paper, we demonstrate how this same transformation can be adapted to classify defect signatures on semiconductor wafers as an aid to visual defect metrology. Given a rectilinear grid of die centers on a wafer, we demonstrate an efficient and effective procedure for classifying defect clusters composed of lines at angles of 0deg, 45deg, 90deg, and 135deg from the horizontal, as well as adjacent compositions of such lines. Included are defect clusters representing stripes, scratches at arbitrary angles, and center and edge defects. The principle advantage of the procedure over current industrial practice is that it can be fully automated to screen wafers for further engineering analysis.

negative: The Columbia-GWU System at the 2016 TAC KBP BeSt Evaluation We present the components of the ColumbiaGWU contribution to the 2016 TAC KBP BeSt Evaluation.

negative: Network Monitoring as a Streaming Analytics Problem Programmable switches potentially make it easier to perform flexible network monitoring queries at line rate, and scalable stream processors make it possible to fuse data streams to answer more sophisticated queries about the network in real-time. However, processing such network monitoring queries at high traffic rates requires both the switches and the stream processors to filter the traffic iteratively and adaptively so as to extract only that traffic that is of interest to the query at hand. While the realization that network monitoring is a streaming analytics problem has been made earlier, our main contribution in this paper is the design and implementation of Sonata, a closed-loop system that enables network operators to perform streaming analytics for network monitoring applications at scale. To achieve this objective, Sonata allows operators to express a network monitoring query by considering each packet as a tuple. More importantly, Sonata allows them to partition the query across both the switches and the stream processor, and through iterative refinement, Sonata's runtime attempts to extract only the traffic that pertains to the query, thus ensuring that the stream processor can scale to satisfy a large number of queries for traffic at very high rates. We show with a simple example query involving DNS reflection attacks and traffic traces from one of the world's largest IXPs that Sonata can capture 95% of all traffic pertaining to the query, while reducing the overall data rate by a factor of about 400 and the number of required counters by four orders of magnitude.

negative: Real Time Identification and Prevention of Doziness using Face Recognition System A large number of road accidents in the world occur due to driver’s not taking proper breaks while driving long distances. This System is used to detect fatigue behaviour of the driver well and before any accident occurs. In this system driver’s facial appearance is extracted via high speed camera which is placed in car in front of driver. This camera will capture the frames at every instant of time. Each of this frame will be processed using image processing algorithm. The mouth and eye region is separated from each of the frames and analyzed for concluding whether the driver is dozy or not. The system draws conclusion if the eyes are found closed for five consecutive frame. If doziness is detected, a signal alert is triggered. In case accidents occurs, message is sent to the desired number.

negative: Enhancing information retrieval and resource discovery from data using the Semantic Web Data are everywhere. Often the sheer quantities of data that is stored or archived in repositories or digital libraries make it difficult to navigate data; information in the data is obscured, particularly where we have Big Data. Traditionally, we record metadata on our data items to assist data classification and some information retrieval. The Semantic Web enables us to further unlock and enrich our data, by exploring how different data are related or connected. Using ontologies and Linked Data we can declare, navigate and discover semantic relationships. Relationships exist both locally, within the data, and globally, such that we can enhance our data with information retrieved from a wider context. To illustrate how the application of Semantic Web technologies aids data discovery and information retrieval, I discuss two case studies: (1) Sharing Ancient Wisdoms (SAWS), a Dynamic Library of information on selected ancient wisdom literature; and (2) the DEFRA DTC archive, a repository of data about freshwater quality in the UK.

negative: Combining equilibrium , resampling , and analysts ’ views in portfolio optimization Portfolio optimization methodologies play a central role in strategic asset allocation (SAA), where it is desirable to have portfolios that are efficient, diversified, and stable. Since the development of the traditional mean-variance approach of Markowitz (1952), many improvements have been made to overcome problems such as lack of diversification and strong sensitivity of optimal portfolio weights to expected returns.

negative: Selective Transfer Learning for Cross Domain Recommendation Collaborative filtering (CF) aims to predict users’ ratings on items according to historical user-item preference data. In many realworld applications, preference data are usually sparse, which would make models overfit and fail to give accurate predictions. Recently, several research works show that by transferring knowledge from some manually selected source domains, the data sparseness problem could be mitigated. However for most cases, parts of source domain data are not consistent with the observations in the target domain, which may misguide the target domain model building. In this paper, we propose a novel criterion based on empirical prediction error and its variance to better capture the consistency across domains in CF settings. Consequently, we embed this criterion into a boosting framework to perform selective knowledge transfer. Comparing to several state-of-the-art methods, we show that our proposed selective transfer learning framework can significantly improve the accuracy of rating prediction tasks on several real-world recommendation tasks.

negative: A recent development of antenna-in-package for 5G millimeter-wave applications (Invited paper) Millimeter-wave technology brings a new paradigm of wireless communication in various areas including mobile devices, automotive, IoT (Internet of Things), medical, military and many others. In this paper, we present our recently developed antenna in a package and system for 5G (Fifth-Generation) millimeter-wave applications. The antenna is configured to be an array to compensate path loss and maintain data link budget. The antenna is designed with a multi-layer laminate substrate and is integrated with a 5G mmW RFIC. 5G NR (New Radio) wireless connection is demonstrated with a RFIC transceiver at 28 GHz band. Interoperability test is conducted to ensure compatibility with the 3GPP standard. Finally, indoor and outdoor field test including beamforming and beamtracking are presented to show realistic system-level throughput performance.

negative: Dilated convolutions for image classification and object localization Yu et al.[1] showed that dilated convolutions are very effective in dense prediction problems such as semantic segmentation. In this work, we propose a new ResNet[2] based convolutional neural network model using dilated convolutions and show that this model can achieve lower error rate for image classification than ResNet with reduction of the number of the parameters of the network by 94% and that this model has high ability to localize objects despite being trained on image-level labels. We evaluated this model on ImageNet[5] which has 50 class labels randomly selected from 1000 class labels.

negative: Successful failure: what Foucault can teach us about privacy self-management in a world of Facebook and big data The “privacy paradox” refers to the discrepancy between the concern individuals express for their privacy and the apparently low value they actually assign to it when they readily trade personal information for low-value goods online. In this paper, I argue that the privacy paradox masks a more important paradox: the self-management model of privacy embedded in notice-and-consent pages on websites and other, analogous practices can be readily shown to underprotect privacy, even in the economic terms favored by its advocates. The real question, then, is why privacy self-management occupies such a prominent position in privacy law and regulation. Borrowing from Foucault’s late writings, I argue that this failure to protect privacy is also a success in ethical subject formation, as it actively pushes privacy norms and practices in a neoliberal direction. In other words, privacy self-management isn’t about protecting people’s privacy; it’s about inculcating the idea that privacy is an individual, commodified good that can be traded for other market goods. Along the way, the self-management regime forces privacy into the market, obstructs the functioning of other, more social, understandings of privacy, and occludes the various ways that individuals attempt to resist adopting the market-based view of themselves and their privacy. Throughout, I use the analytics practices of Facebook and social networking sites as a sustained case study of the point.

negative: Evaluation of a 900 V SiC MOSFET in a 13.56 MHz 2 kW resonant inverter for wireless power transfer This paper demonstrates the performance of a 900 V silicon carbide (SiC) power MOSFET operating at 13.56 MHz in a 2 kW resonant inverter targeted for wireless power transfer (WPT) systems. Operating at multi-MHz switching frequency leads to smaller passive components and has the potential to improve power density and reduce weight for weight-sensitive applications. In addition, the advent of wide band gap (WBG) power semiconductors with higher breakdown voltages than silicon (Si) allows the design of high-power (2 kW or more) inverters even when operating at MHz frequencies. Previous work described the design and implementation of a class Φ2 inverter using an enhancement mode gallium nitride (eGaN) FET at output power of 1.3 kW and switching at 13.56 MHz [1]. While eGaN FETs have promising electrical characteristics for high-frequency operation, SiC MOSFETs are becoming available with higher temperature ratings, higher breakdown voltages and higher avalanche ratings to operate at tens of MHz switching frequency. In this work, we study and evaluate the electrical characteristics of a 900 V, 7L D2PAK SiC MOSFET and demonstrate the design of a 2 kW single-ended resonant inverter operating at 13.56 MHz.

negative: Incremental tessellation of trimmed parametric surfaces This paper presents an incremental approach for tessellating trimmed parametric surfaces. A database is built to keep the tessellation of a CAD model. With the topological information provided, the database is efficiently updated when the model is modified. This enhances the tessellation process as only a slight change of the existing tessellation is required. The tessellation which involves the insertion and removal of trimlines is performed completely in the parametric space. The topological information also facilitates the triangles classification and the merging of boundaries between surfaces. The algorithm is particularly suitable for the generation of a valid triangulation of a complex CAD model for many downstream applications, e.g. in rapid prototyping (RP). q 2000 Elsevier Science Ltd. All rights reserved.

negative: Cannabinoids in the Treatment of Epilepsy. Despite the availability of more than 20 different antiseizure drugs and the provision of appropriate medical therapy, 30% of people with epilepsy continue to have seizures.1,2 The approval of many new antiseizure drugs during the past two decades, including several with novel mechanisms of action, has not substantially reduced the proportion of patients with medically refractory disease.1 The safety and side-effect profile of antiseizure drugs has improved, but side effects related to the central nervous system are common and affect quality of life.3 Patients need new treatments that control seizures and have fewer side effects. This treatment gap has led patients and families to seek alternative treatments. Cannabis-based treatment for epilepsy has recently received prominent attention in the lay press4 and in social media, with reports of dramatic improvements in seizure control in children with severe epilepsy. In response, many states have legalized cannabis for the treatment of epilepsy (and other medical conditions) in children and adults (for a list of medical marijuana laws according to state, see www . ncsl . org/ research/ health/ state-medical-marijuana-laws . aspx). Cannabis has been used medicinally for millennia and was used in the treatment of epilepsy as early as 1800 b.c.e. in Sumeria.5 Victorian-era neurologists used Indian hemp to treat epilepsy and reported dramatic success.5,6 The use of cannabis therapy for the treatment of epilepsy diminished with the introduction of phenobarbital (1912) and phenytoin (1937) and the passage of the Marijuana Tax Act (1937). The discovery of an endogenous cannabinoid-signaling system in the 1990s7 rekindled interest in therapies derived from constituents of cannabis for nervous system disorders such as epilepsy (see ClinicalTrials.gov numbers, NCT02091375, NCT02224690, NCT02324673, NCT02318537, and NCT02318563). This review addresses the current preclinical and clinical data that suggest that compounds found in cannabis have efficacy against seizures. The pharmacokinetic properties of cannabinoids and related safety and regulatory issues that may affect clinical use are also discussed, as are the distinct challenges of conducting rigorous clinical trials of these compounds. More than 545 distinct compounds have been isolated from cannabis species; the most abundant are the cannabinoids, a family of molecules that have a 21-carbon terpenophenolic skeleton and includes numerous metabolites.8 The best studied of these cannabinoids (termed “phytocannabinoids” if derived from the plant) are Δ9-tetrahydrocannabinol (Δ9-THC) and cannabidiol and their metabolites. (See Fig. 1 for the structure of Δ9-THC, cannabidiol, and one other cannabinoid, cannabidivarin, as well as their targets in the central nervous system, and their actions.) Most of the psychoactive effects of cannabis are mediated by Δ9-THC. Many of the noncannabinoid molecules in cannabis plants may have biologic activity. This review focuses on cannabinoids, since other cannabis-derived compounds have been less well studied. From the Department of Neurology, New York University Langone School of Medicine, New York. Address reprint requests to Dr. Friedman at the Department of Neurology, NYU Langone School of Medicine, 223 E. 34th St., New York, NY 10016, or at daniel . friedman@ nyumc . org.

negative: SharesSkew: An algorithm to handle skew for joins in MapReduce In this paper, we investigate the problem of computing a multiway join in one round of MapReduce when the data may be skewed. We optimize on communication cost, i.e., the amount of data that is transferred from the mappers to the reducers. We identify join attributes values that appear very frequently, Heavy Hitters (HH). We distribute HH valued records to reducers avoiding skew by using an adaptation of the Shares [3] algorithm to achieve minimum communication cost. Our algorithm is implemented for experimentation and is offered as open source software. Furthermore, we investigate a class of multiway joins for which a simpler variant of the algorithm can handle skew. We offer closed forms for computing the parameters of the algorithm for chain and symmetric joins.

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: Selective stiffening of soft actuators based on jamming The ability to selectively stiffen otherwise compliant soft actuators increases their versatility and dexterity. We investigate granular jamming and layer jamming as two possible methods to achieve stiffening with PneuFlex actuators, a type of soft continuum actuator. The paper details five designs of jamming compartments that can be attached to an actuator. We evaluate the stiffening of the five different prototypes, achieving an up to 8-fold increase in stiffness. The strength of the most effective prototype based on layer jamming is also validated in the context of pushing buttons, resulting in an 2.23-fold increase in pushing force.

negative: Two-dimensional Disjunctively Constrained Knapsack Problem: Heuristic and exact approaches

negative: Multiple extended object tracking using Gaussian processes The goal of multi-object tracking is to estimate the number of objects and their states recursively over time. In the presence of extended objects, i.e. objects with an extent that is not negligible in comparison to sensor resolution and which give rise to multiple measurements per time step, the tracking task is even more challenging: To fully utilize all available information and to achieve accurate estimation results, measurement models that are able to represent the object shape as well as algorithms that tackle the aggravated track-to-measurements association problem are necessary. In this work, the Gaussian process measurement model is integrated in the recently developed labeled multi-Bernoulli filter for extended objects. Thus, the ability of Gaussian processes to estimate and represent a wide range of free-from shapes is combined with a principled approach to the multiple extended objects tracking problem. The filter performance is demonstrated for simulated and experimental vehicle tracking using a laser scanner. For this particular application, a new, approximately axis-symmetric covariance function is additionally introduced.

negative: IC-CRIME : A Collaborative , Web-Based , 3 D System for the Investigation , Analysis , and Annotation of Crime Scenes Modern day crime scene investigation methods are continually being enhanced by the application of new technologies to improve the analysis and presentation of crime scene information, helping to solve and prosecute crimes. This paper describes a new system called IC-CRIME that integrates several new technologies to meet both of these needs. IC-CRIME employs laser scanning to produce realistic 3D models of a crime scene which it then incorporates into a 3D virtual environment. ICCRIME creates an integrated platform that encourages investigators and forensic experts to view, explore, and annotate these models at any time from any web browser. A key goal of the system is to expand opportunities for collaboration between professionals whose geographic locations and time commitments would otherwise limit their ability to contribute to the analysis of the actual crime scene.

negative: The Networked Sensory Landscape: Capturing and Experiencing Ecological Change Across Scales What role will ubiquitous sensing play in our understanding and experience of ecology in the future? What opportunities are created by weaving a continuously sampling, geographically dense web of sensors into the natural environment, from the ground up? In this article, we explore these questions holistically, and present our work on an environmental sensor network designed to support a diverse array of applications, interpretations, and artistic expressions, from primary ecological research to musical composition. Over the past four years, we have been incorporating our ubiquitous sensing framework into the design and implementation of a large-scale wetland restoration, creating a broad canvas for creative exploration at the landscape scale. The projects we present here span the development and wide deployment of custom sensor node hardware, novel web services for providing real-time sensor data to end user applications, public-facing user interfaces for open-ended exploration of the data, as well as more radical UI modalities, through unmanned aerial vehicles, virtual and augmented reality, and wearable devices for sensory augmentation. From this work, we distill the Networked Sensory Landscape, a vision for the intersection of ubiquitous computing and environmental restoration. Sensor network technologies and novel approaches to interaction promise to reshape presence, opening up sensorial connections to ecological processes across spatial and temporal scales.

negative: Contact System Design to Improve Energy Efficiency in Copper Electrowinning Processes To improve energy efficiency in copper electrowinning, different technologies have been developed. These include electrode positioning capping boards and 3-D grids, electrode spacers, and segmented intercell bars. This paper introduces a design concept to avoid electrode open circuits and reduce contact resistances. The design is based on a female tooth shape for the contacts on the intercell bar. This leads to improved electrode alignment, reduced contact resistances, easier contact cleaning, and ensured electrical contact for the electrodes. It results in lower operational temperature for the electrodes, reduced plant housekeeping, increased lifespan for capping boards, and higher rate of grade A copper production. The comparative results presented should be a useful guideline for any type of intercell bar. Improvements in production levels and energy efficiency should reach 0.5% and 3%, respectively. A 3-D finite-element-based analysis and industrial measurements are used to verify the results.

negative:
ADHD comorbidity findings from the MTA study: comparing comorbid subgroups. OBJECTIVES
Previous research has been inconclusive whether attention-deficit/hyperactivity disorder (ADHD), when comorbid with disruptive disorders (oppositional defiant disorder [ODD] or conduct disorder [CD]), with the internalizing disorders (anxiety and/or depression), or with both, should constitute separate clinical entities. Determination of the clinical significance of potential ADHD + internalizing disorder or ADHD + ODD/CD syndromes could yield better diagnostic decision-making, treatment planning, and treatment outcomes.

METHOD
Drawing upon cross-sectional and longitudinal information from 579 children (aged 7-9.9 years) with ADHD participating in the NIMH Collaborative Multisite Multimodal Treatment Study of Children With Attention-Deficit/Hyperactivity Disorder (MTA), investigators applied validational criteria to compare ADHD subjects with and without comorbid internalizing disorders and ODD/CD.

RESULTS
Substantial evidence of main effects of internalizing and externalizing comorbid disorders was found. Moderate evidence of interactions of parent-reported anxiety and ODD/CD status were noted on response to treatment, indicating that children with ADHD and anxiety disorders (but no ODD/CD) were likely to respond equally well to the MTA behavioral and medication treatments. Children with ADHD-only or ADHD with ODD/CD (but without anxiety disorders) responded best to MTA medication treatments (with or without behavioral treatments), while children with multiple comorbid disorders (anxiety and ODD/CD) responded optimally to combined (medication and behavioral) treatments.

CONCLUSIONS
Findings indicate that three clinical profiles, ADHD co-occurring with internalizing disorders (principally parent-reported anxiety disorders) absent any concurrent disruptive disorder (ADHD + ANX), ADHD co-occurring with ODD/CD but no anxiety (ADHD + ODD/CD), and ADHD with both anxiety and ODD/CD (ADHD + ANX + ODD/CD) may be sufficiently distinct to warrant classification as ADHD subtypes different from "pure" ADHD with neither comorbidity. Future clinical, etiological, and genetics research should explore the merits of these three ADHD classification options.

negative: A General Optimization Framework for Multi-Document Summarization Using Genetic Algorithms and Swarm Intelligence Extracting summaries via integer linear programming and submodularity are popular and successful techniques in extractive multi-document summarization. However, many interesting optimization objectives are neither submodular nor factorizable into an integer linear program. We address this issue and present a general optimization framework where any function of input documents and a system summary can be plugged in. Our framework includes two kinds of summarizers – one based on genetic algorithms, the other using a swarm intelligence approach. In our experimental evaluation, we investigate the optimization of two information-theoretic summary evaluation metrics and find that our framework yields competitive results compared to several strong summarization baselines. Our comparative analysis of the genetic and swarm summarizers reveals interesting complementary properties.

negative: SQL server column store indexes The SQL Server 11 release (code named "Denali") introduces a new data warehouse query acceleration feature based on a new index type called a column store index. The new index type combined with new query operators processing batches of rows greatly improves data warehouse query performance: in some cases by hundreds of times and routinely a tenfold speedup for a broad range of decision support queries. Column store indexes are fully integrated with the rest of the system, including query processing and optimization. This paper gives an overview of the design and implementation of column store indexes including enhancements to query processing and query optimization to take full advantage of the new indexes. The resulting performance improvements are illustrated by a number of example queries.

negative: A new weighted SVDD algorithm for outlier detection Traditional Support Vector Domain Description (SVDD) and some improved SVDD algorithms are suboptimal in detecting some complex outliers. To solve the difficulty, we proposed a novel adaptive weighted SVDD (AW-SVDD) algorithm. Firstly, a weighting is computed for each data point based on their spatial position distribution and density distribution in a training dataset. The weighting can be used to measure the degree of the data point to be an outlier. Then the weighted data are trained by traditional SVDD. Lastly, a sphere shaped data description can be obtained for the training data. Experimental results demonstrate that AW-SVDD can overcome the interference from some complex outliers objectively, therefore the algorithm has a better performance than traditional SVDD and other improved SVDD algorithms.

negative: An analysis of 3D point cloud reconstruction from light field images Current methodologies for the generation of 3D point cloud from real world scenes rely upon a set of 2D images capturing the scene from several points of view. Novel plenoptic cameras sample the light field crossing the main camera lens creating a light field image. The information available in a plenoptic image must be processed in order to render a view or create the depth map of the scene. This paper analyses a method for the reconstruction of 3D models. The reconstruction of the model is obtained from a single image shot. Exploiting the properties of plenoptic images, a point cloud is generated and compared with a point cloud of the same object but generated with a different plenoptic camera.

negative: Multiview Photometric Stereo This paper addresses the problem of obtaining complete, detailed reconstructions of textureless shiny objects. We present an algorithm which uses silhouettes of the object, as well as images obtained under changing illumination conditions. In contrast with previous photometric stereo techniques, ours is not limited to a single viewpoint but produces accurate reconstructions in full 3D. A number of images of the object are obtained from multiple viewpoints, under varying lighting conditions. Starting from the silhouettes, the algorithm recovers camera motion and constructs the object's visual hull. This is then used to recover the illumination and initialize a multiview photometric stereo scheme to obtain a closed surface reconstruction. There are two main contributions in this paper: First, we describe a robust technique to estimate light directions and intensities and, second, we introduce a novel formulation of photometric stereo which combines multiple viewpoints and, hence, allows closed surface reconstructions. The algorithm has been implemented as a practical model acquisition system. Here, a quantitative evaluation of the algorithm on synthetic data is presented together with complete reconstructions of challenging real objects. Finally, we show experimentally how, even in the case of highly textured objects, this technique can greatly improve on correspondence-based multiview stereo results.

negative: Holistic 3D Scene Parsing and Reconstruction from a Single RGB Image We propose a computational framework to jointly parse a single RGB image and reconstruct a holistic 3D configuration composed by a set of CAD models using a stochastic grammar model. Specifically, we introduce a Holistic Scene Grammar (HSG) to represent the 3D scene structure, which characterizes a joint distribution over the functional and geometric space of indoor scenes. The proposed HSG captures three essential and often latent dimensions of the indoor scenes: i) latent human context, describing the affordance and the functionality of a room arrangement, ii) geometric constraints over the scene configurations, and iii) physical constraints that guarantee physically plausible parsing and reconstruction. We solve this joint parsing and reconstruction problem in an analysis-by-synthesis fashion, seeking to minimize the differences between the input image and the rendered images generated by our 3D representation, over the space of depth, surface normal, and object segmentation map. The optimal configuration, represented by a parse graph, is inferred using Markov chain Monte Carlo (MCMC), which efficiently traverses through the non-differentiable solution space, jointly optimizing object localization, 3D layout, and hidden human context. Experimental results demonstrate that the proposed algorithm improves the generalization ability and significantly outperforms prior methods on 3D layout estimation, 3D object detection, and holistic scene understanding.

negative: Real-time 3D scene reconstruction with dynamically moving object using a single depth camera Online 3D reconstruction of real-world scenes has been attracting increasing interests from both the academia and industry, especially with the consumer-level depth cameras becoming widely available. Recent most online reconstruction systems take live depth data from a moving Kinect camera and incrementally fuse them to a single high-quality 3D model in real time. Although most real-world scenes have static environment, the daily objects in a scene often move dynamically, which are non-trivial to reconstruct especially when the camera is also not still. To solve this problem, we propose a single depth camera-based real-time approach for simultaneous reconstruction of dynamic object and static environment, and provide solutions for its key issues. In particular, we first introduce a robust optimization scheme which takes advantage of raycasted maps to segment moving object and background from the live depth map. The corresponding depth data are then fused to the volumes, respectively. These volumes are raycasted to extract views of the implicit surface which can be used as a consistent reference frame for the next iteration of segmentation and tracking. Particularly, in order to handle fast motion of dynamic object and handheld camera in the fusion stage, we propose a sequential 6D pose prediction method which largely increases the registration robustness and avoids registration failures occurred in conventional methods. Experimental results show that our approach can reconstruct moving object as well as static environment with rich details, and outperform conventional methods in multiple aspects.

negative: 3D Reconstruction from Hyperspectral Images 3D reconstruction from hyper spectral images has seldom been addressed in the literature. This is a challenging problem because 3D models reconstructed from different spectral bands demonstrate different properties. If we use a single band or covert the hyper spectral image to gray scale image for the reconstruction, fine structural information may be lost. In this paper, we present a novel method to reconstruct a 3D model from hyper spectral images. Our proposed method first generates 3D point sets from images at each wavelength using the typical structure from motion approach. A structural descriptor is developed to characterize the spatial relationship between the points, which allows robust point matching between two 3D models at different wavelength. Then a 3D registration method is introduced to combine all band-level models into a single and complete hyper spectral 3D model. As far as we know, this is the first attempt in reconstructing a complete 3D model from hyper spectral images. This work allows fine structural-spectral information of an object be captured and integrated into the 3D model, which can be used to support further research and applications.

negative: Pattern Recognition In this paper a novel reconstruction method is presented that uses the topological relationship of detected image features to create a highly abstract but semantically rich 3D model of the reconstructed scenes. In the first step, a combined image-based reconstruction of points and lines is performed based on the current state of art structure from motion methods. Subsequently, connected planar threedimensional structures are reconstructed by a novel method that uses the topological relationships between the detected image features. The reconstructed 3D models enable a simple extraction of geometric shapes, such as rectangles, in the scene.

negative: Indoor scene segmentation using a structured light sensor In this paper we explore how a structured light depth sensor, in the form of the Microsoft Kinect, can assist with indoor scene segmentation. We use a CRF-based model to evaluate a range of different representations for depth information and propose a novel prior on 3D location. We introduce a new and challenging indoor scene dataset, complete with accurate depth maps and dense label coverage. Evaluating our model on this dataset reveals that the combination of depth and intensity images gives dramatic performance gains over intensity images alone. Our results clearly demonstrate the utility of structured light sensors for scene understanding.