query: Distributed Learning over Unreliable Networks

positive: Accurate, Large Minibatch SGD: Training ImageNet in 1 Hour Deep learning thrives with large neural networks and large datasets. However, larger networks and larger datasets result in longer training times that impede research and development progress. Distributed synchronous SGD offers a potential solution to this problem by dividing SGD minibatches over a pool of parallel workers. Yet to make this scheme efficient, the per-worker workload must be large, which implies nontrivial growth in the SGD minibatch size. In this paper, we empirically show that on the ImageNet dataset large minibatches cause optimization difficulties, but when these are addressed the trained networks exhibit good generalization. Specifically, we show no loss of accuracy when training with large minibatch sizes up to 8192 images. To achieve this result, we adopt a linear scaling rule for adjusting learning rates as a function of minibatch size and develop a new warmup scheme that overcomes optimization challenges early in training. With these simple techniques, our Caffe2-based system trains ResNet50 with a minibatch size of 8192 on 256 GPUs in one hour, while matching small minibatch accuracy. Using commodity hardware, our implementation achieves ∼90% scaling efficiency when moving from 8 to 256 GPUs. This system enables us to train visual recognition models on internetscale data with high efficiency.

positive: Machine Learning with Adversaries: Byzantine Tolerant Gradient Descent We study the resilience to Byzantine failures of distributed implementations of Stochastic Gradient Descent (SGD). So far, distributed machine learning frameworks have largely ignored the possibility of failures, especially arbitrary (i.e., Byzantine) ones. Causes of failures include software bugs, network asynchrony, biases in local datasets, as well as attackers trying to compromise the entire system. Assuming a set of n workers, up to f being Byzantine, we ask how resilient can SGD be, without limiting the dimension, nor the size of the parameter space. We first show that no gradient aggregation rule based on a linear combination of the vectors proposed by the workers (i.e, current approaches) tolerates a single Byzantine failure. We then formulate a resilience property of the aggregation rule capturing the basic requirements to guarantee convergence despite f Byzantine workers. We propose Krum, an aggregation rule that satisfies our resilience property, which we argue is the first provably Byzantine-resilient algorithm for distributed SGD. We also report on experimental evaluations of Krum.

positive: Deep learning with Elastic Averaging SGD We study the problem of stochastic optimization for deep learning in the parallel computing environment under communication constraints. A new algorithm is proposed in this setting where the communication and coordination of work among concurrent processes (local workers), is based on an elastic force which links the parameters they compute with a center variable stored by the parameter server (master). The algorithm enables the local workers to perform more exploration, i.e. the algorithm allows the local variables to fluctuate further from the center variable by reducing the amount of communication between local workers and the master. We empirically demonstrate that in the deep learning setting, due to the existence of many local optima, allowing more exploration can lead to the improved performance. We propose synchronous and asynchronous variants of the new algorithm. We provide the stability analysis of the asynchronous variant in the round-robin scheme and compare it with the more common parallelized method ADMM. We show that the stability of EASGD is guaranteed when a simple stability condition is satisfied, which is not the case for ADMM. We additionally propose the momentum-based version of our algorithm that can be applied in both synchronous and asynchronous settings. Asynchronous variant of the algorithm is applied to train convolutional neural networks for image classification on the CIFAR and ImageNet datasets. Experiments demonstrate that the new algorithm accelerates the training of deep architectures compared to DOWNPOUR and other common baseline approaches and furthermore is very communication efficient.

positive: Large-scale matrix factorization with distributed stochastic gradient descent We provide a novel algorithm to approximately factor large matrices with millions of rows, millions of columns, and billions of nonzero elements. Our approach rests on stochastic gradient descent (SGD), an iterative stochastic optimization algorithm. We first develop a novel "stratified" SGD variant (SSGD) that applies to general loss-minimization problems in which the loss function can be expressed as a weighted sum of "stratum losses." We establish sufficient conditions for convergence of SSGD using results from stochastic approximation theory and regenerative process theory. We then specialize SSGD to obtain a new matrix-factorization algorithm, called DSGD, that can be fully distributed and run on web-scale datasets using, e.g., MapReduce. DSGD can handle a wide variety of matrix factorizations. We describe the practical techniques used to optimize performance in our DSGD implementation. Experiments suggest that DSGD converges significantly faster and has better scalability properties than alternative algorithms.

positive: OverFeat: Integrated Recognition, Localization and Detection using Convolutional Networks We present an integrated framework for using Convolutional Networks for classification , localization and detection. We show how a multiscale and sliding window approach can be efficiently implemented within a ConvNet. We also introduce a novel deep learning approach to localization by learning to predict object boundaries. Bounding boxes are then accumulated rather than suppressed in order to increase detection confidence. We show that different tasks can be learned simultaneously using a single shared network. This integrated framework is the winner of the localization task of the ImageNet Large Scale Visual Recognition Challenge 2013 (ILSVRC2013) and obtained very competitive results for the detection and classifications tasks. In post-competition work, we establish a new state of the art for the detection task. Finally, we release a feature extractor from our best model called OverFeat.

negative: ON MILLIMETER-WAVE IMAGING OF CONCEALED OBJECTS : APPLICATION USING BACK-PROJECTION ALGORITHM Millimeter-wave (MMW) imaging is a powerful tool for the detection of objects concealed under clothing. Several factors including different kinds of objects, variety of covering materials and their thickness, accurate imaging of near-field scattered data affect the success of detection. To practice with such considerations, this paper presents the two-dimensional (2D) images of different targets hidden under various fabric sheets. The W-band inverse synthetic aperture radar (ISAR) data of various target-covering situations are acquired and imaged by applying both the focusing operator based inversion algorithm and the spherical back-projection algorithm. Results of these algorithms are demonstrated and compared to each other to assess the performance of the MMW imaging in detecting the concealed objects of both metallic and dielectric types.

negative:
A study of prefix hijacking and interception in the internet There have been many incidents of prefix hijacking in the Internet. The hijacking AS can blackhole the hijacked traffic. Alternatively, it can transparently intercept the hijacked traffic by forwarding it onto the owner. This paper presents a study of such prefix hijacking and interception with the following contributions: (1). We present a methodology for prefix interception, (2). We estimate the fraction of traffic to any prefix that can be hijacked and intercepted in the Internet today, (3). The interception methodology is implemented and used to intercept real traffic to our prefix, (4). We conduct a detailed study to detect ongoing prefix interception.
 We find that: Our hijacking estimates are in line with the impact of past hijacking incidents and show that ASes higher up in the routing hierarchy can hijack a significant amount of traffic to any prefix, including popular prefixes. A less apparent result is that the same holds for prefix interception too. Further, our implementation shows that intercepting traffic to a prefix in the Internet is almost as simple as hijacking it. Finally, while we fail to detect ongoing prefix interception, the detection exercise highlights some of the challenges posed by the prefix interception problem.

negative: Development of a Dynamic Simulation Tool for the ExoMars Rover Future planetary missions, including the 2011 European Space Agency (ESA) ExoMars mission, will require rovers to travel further, faster, and over more demanding terrain than has been encountered to date. To improve overall mobility, advances need to be made in autonomous navigation, power collection, and locomotion. In this paper we focus on the locomotion problem and discuss the development of a planetary rover chassis simulation tool that allows us to study key locomotion test cases such as slope climbing in loose soil. We have also constructed rover wheels and obtained experimental data to validate the wheel-soil interaction module. The main conclusion is that to fully validate such a complex simulation, experimental data from a full rover chassis is required. This is a first step in an on-going effort to validate the simulation with experimental data obtained from a full rover prototype.

negative: Accurate Angle Estimator for High-Frame-Rate 2-D Vector Flow Imaging This paper presents a novel approach for estimating 2-D flow angles using a high-frame-rate ultrasound method. The angle estimator features high accuracy and low standard deviation (SD) over the full 360° range. The method is validated on Field II simulations and phantom measurements using the experimental ultrasound scanner SARUS and a flow rig before being tested in vivo. An 8-MHz linear array transducer is used with defocused beam emissions. In the simulations of a spinning disk phantom, a 360° uniform behavior on the angle estimation is observed with a median angle bias of 1.01° and a median angle SD of 1.8°. Similar results are obtained on a straight vessel for both simulations and measurements, where the obtained angle biases are below 1.5° with SDs around 1°. Estimated velocity magnitudes are also kept under 10% bias and 5% relative SD in both simulations and measurements. An in vivo measurement is performed on a carotid bifurcation of a healthy individual. A 3-s acquisition during three heart cycles is captured. A consistent and repetitive vortex is observed in the carotid bulb during systoles.

negative: Predictive Data Mining for Diagnosis of Thyroid Disease using Neural Network This paper presents a systematic approach for earlier diagnosis of Thyroid disease using back propagation algorithm used in neural network. Back propagation algorithm is a widely used algorithm in this field. ANN has been developed based on back propagation of error used for earlier prediction of disease. ANN was subsequently trained with experimental data and testing is carried out using data that was not used during training process. Results show that outcome of ANN is in good agreement with experimental data; this indicates that developed neural network can be used as an alternative for earlier prediction of a disease. Keywords—Back propagation, decision tree, gradient descent, prediction, Supervised Learning

negative: A Robust Single-Phase PLL System With Stable and Fast Tracking Phase, frequency, and amplitude of single-phase voltages are the most important and basic information required for single-phase grid-connected applications. This paper proposes a method for instantly and robustly estimating the phase, frequency, and amplitude of frequency-varying single-phase signals for such applications, which is a phase-locked loop (PLL) method based on a structure. The proposed method has the following attractive features: 1) the estimation system results in a nonlinear system, but it can be stabilized; 2) all subsystems constructing the system can be easily designed; 3) "two-phase signal generator"; can autotune a single system parameter in response to varying frequency of the injected signal; 4) high-order "PLL-Controllers" allowing fast tracking can be stably used; and 5) even in hostile envelopments, favorable instant estimates can be obtained. This paper proposes the estimation method and verifies its usefulness by extensive numerical experiments.

negative: MixedFusion: Real-Time Reconstruction of an Indoor Scene with Dynamic Objects Real-time indoor scene reconstruction aims to recover the 3D geometry of an indoor scene in real time with a sensor scanning the scene. Previous works of this topic consider pure static scenes, but in this paper, we focus on more challenging cases that the scene contains dynamic objects, for example, moving people and floating curtains, which are quite common in reality and thus are eagerly required to be handled. We develop an end-to-end system using a depth sensor to scan a scene on the fly. By proposing a Sigmoid-based Iterative Closest Point (S-ICP) method, we decouple the camera motion and the scene motion from the input sequence and segment the scene into static and dynamic parts accordingly. The static part is used to estimate the camera rigid motion, while for the dynamic part, graph node-based motion representation and model-to-depth fitting are applied to reconstruct the scene motions. With the camera and scene motions reconstructed, we further propose a novel mixed voxel allocation scheme to handle static and dynamic scene parts with different mechanisms, which helps to gradually fuse a large scene with both static and dynamic objects. Experiments show that our technique successfully fuses the geometry of both the static and dynamic objects in a scene in real time, which extends the usage of the current techniques for indoor scene reconstruction.

negative: Faceted Search We live in an information age that requires us, more than ever, to represent, access, and use information. Over the last several decades, we have developed a modern science and technology for information retrieval, relentlessly pursuing the vision of a “memex” that Vannevar Bush proposed in his seminal article, “As We May Think.” Faceted search plays a key role in this program. Faceted search addresses weaknesses of conventional search approaches and has emerged as a foundation for interactive information retrieval. User studies demonstrate that faceted search provides more effective information-seeking support to users than best-first search. Indeed, faceted search has become increasingly prevalent in online information access systems, particularly for e-commerce and site search. In this lecture, we explore the history, theory, and practice of faceted search. Although we cannot hope to be exhaustive, our aim is to provide sufficient depth and breadth to offer a useful resource to both researchers and practitioners. Because faceted search is an area of interest to computer scientists, information scientists, interface designers, and usability researchers, we do not assume that the reader is a specialist in any of these fields. Rather, we offer a self-contained treatment of the topic, with an extensive bibliography for those who would like to pursue particular aspects in more depth.

negative:
Classifying distinct basal cell carcinoma subtype by means of dermatoscopy and reflectance confocal microscopy. BACKGROUND
The current guidelines for the management of basal cell carcinoma (BCC) suggest a different therapeutic approach according to histopathologic subtype. Although dermatoscopic and confocal criteria of BCC have been investigated, no specific studies were performed to evaluate the distinct reflectance confocal microscopy (RCM) aspects of BCC subtypes.

OBJECTIVES
To define the specific dermatoscopic and confocal criteria for delineating different BCC subtypes.

METHODS
Dermatoscopic and confocal images of histopathologically confirmed BCCs were retrospectively evaluated for the presence of predefined criteria. Frequencies of dermatoscopic and confocal parameters are provided. Univariate and adjusted odds ratios were calculated. Discriminant analyses were performed to define the independent confocal criteria for distinct BCC subtypes.

RESULTS
Eighty-eight BCCs were included. Dermatoscopically, superficial BCCs (n=44) were primarily typified by the presence of fine telangiectasia, multiple erosions, leaf-like structures, and revealed cords connected to the epidermis and epidermal streaming upon RCM. Nodular BCCs (n=22) featured the classic dermatoscopic features and well outlined large basaloid islands upon RCM. Infiltrative BCCs (n=22) featured structureless, shiny red areas, fine telangiectasia, and arborizing vessels on dermatoscopy and dark silhouettes upon RCM.

LIMITATIONS
The retrospective design.

CONCLUSION
Dermatoscopy and confocal microscopy can reliably classify different BCC subtypes.

negative: Fitted Natural Actor-Critic: A New Algorithm for Continuous State-Action MDPs In this paper we address reinforcement learning problems with continuous state-action spaces. We propose a new algorithm, tted natural actor-critic (FNAC), that extends the work in [1] to allow for general function approximation and data reuse. We combine the natural actor-critic architecture [1] with a variant of tted value iteration using importance sampling. The method thus obtained combines the appealing features of both approaches while overcoming their main weaknesses: the use of a gradient-based actor readily overcomes the di culties found in regression methods with policy optimization in continuous action-spaces; in turn, the use of a regression-based critic allows for e cient use of data and avoids convergence problems that TD-based critics often exhibit. We establish the convergence of our algorithm and illustrate its application in a simple continuous space, continuous action problem.

negative: Deep Learning for Video Classification and Captioning Accelerated by the tremendous increase in Internet bandwidth and storage space, video data has been generated, published and spread explosively, becoming an indispensable part of today's big data. In this paper, we focus on reviewing two lines of research aiming to stimulate the comprehension of videos with deep learning: video classification and video captioning. While video classification concentrates on automatically labeling video clips based on their semantic contents like human actions or complex events, video captioning attempts to generate a complete and natural sentence, enriching the single label as in video classification, to capture the most informative dynamics in videos. In addition, we also provide a review of popular benchmarks and competitions, which are critical for evaluating the technical progress of this vibrant field.

negative: Cyber security for home users: A new way of protection through awareness enforcement We are currently living in an age, where the use of the Internet has become second nature to millions of people. Not only do businesses depend on the Internet for all types of electronic transactions, but more and more home users are experiencing the immense benefit of the Internet. However, this dependence and use of the Internet bring new and dangerous risks. This is due to increasing attempts from unauthorised third parties to compromise private information for their own benefit – the whole wide area of cyber crime. It is therefore essential that all users understand the risks of using the Internet, the importance of securing their personal information and the consequences if this is not done properly. It is well known that home users are specifically vulnerable, and that cyber criminals have such users squarely in their target. This vulnerability of home users are due to many factors, but one of the most important ones is the fact that such home users are in many cases not aware of the risks of using the Internet, and often venture into cyber space without any awareness preparation for this journey. This paper specifically investigates the position of the home user, and proposes a new model, The E-Awareness Model (E-AM), in which home users can be forced to acquaint themselves with the risks involved in venturing into cyber space. The E-AM consists of two components : the awareness component housed in the E-Awareness Portal, and the enforcement component. This model proposes a way to improve information security awareness amongst home users by presenting some information security content and enforcing the absorption of this content. The main difference between the presented model and other existing information security awareness models, is that in the presented model the acquiring/absorption of the awareness content is compulsory the user is forced to proceed via the E-Awareness Portal without the option of bypassing it.

negative: Learning Discriminative Affine Regions via We present an accurate method for estimation of the affine shape of local features. The method is trained in a novel way, exploiting the recently proposed HardNet triplet loss. The loss function is driven by patch descriptor differences, avoiding problems with symmetries. Moreover, such training process does not require precisely geometrically aligned patches. The affine shape is represented in a way amenable to learning by stochastic gradient descent. When plugged into a state-of-the-art wide baseline matching algorithm, the performance on standard datasets improves in both the number of challenging pairs matched and the number of inliers. Finally, AffNet with combination of Hessian detector and HardNet descriptor improves bag-of-visual-words based state of the art on Oxford5k and Paris6k by large margin, 4.5 and 4.2 mAP points respectively. The source code and trained networks are available at https://github.com/ducha-aiki/affnet

negative: Evaluating the Effectiveness of Serious Games for Cultural Awareness: The Icura User Study There is an increasing awareness about the potential of serious games for education and training in many disciplines. However, research still witnesses a lack of methodologies, guidelines and best practices on how to develop effective serious games and how to integrate them in the actual learning and training processes. This process of integration heavily depends on providing and spreading evidence of the effectiveness of serious games This paper reports a user study to evaluate the effectiveness of Icura, a serious game about Japanese culture and etiquette. The evaluation methodology extends the set of instruments used in previous studies by evaluating the effects of the game on raising awareness, by avoiding the selective attention bias and by assessing the medium-term retention. . With this research we aim to provide a handy toolkit for evaluating the effectiveness a serious games for cultural awareness and heritage.

negative: Feature selection via sensitivity analysis of SVM probabilistic outputs Feature selection is an important aspect of solving data-mining and machine-learning problems. This paper proposes a feature-selection method for the Support Vector Machine (SVM) learning. Like most feature-selection methods, the proposed method ranks all features in decreasing order of importance so that more relevant features can be identified. It uses a novel criterion based on the probabilistic outputs of SVM. This criterion, termed Feature-based Sensitivity of Posterior Probabilities (FSPP), evaluates the importance of a specific feature by computing the aggregate value, over the feature space, of the absolute difference of the probabilistic outputs of SVM with and without the feature. The exact form of this criterion is not easily computable and approximation is needed. Four approximations, FSPP1-FSPP4, are proposed for this purpose. The first two approximations evaluate the criterion by randomly permuting the values of the feature among samples of the training data. They differ in their choices of the mapping function from standard SVM output to its probabilistic output: FSPP1 uses a simple threshold function while FSPP2 uses a sigmoid function. The second two directly approximate the criterion but differ in the smoothness assumptions of criterion with respect to the features. The performance of these approximations, used in an overall feature-selection scheme, is then evaluated on various artificial problems and real-world problems, including datasets from the recent Neural Information Processing Systems (NIPS) feature selection competition. FSPP1-3 show good performance consistently with FSPP2 being the best overall by a slight margin. The performance of FSPP2 is competitive with some of the best performing feature-selection methods in the literature on the datasets that we have tested. Its associated computations are modest and hence it is suitable as a feature-selection method for SVM applications.

negative: BzTree: A High-Performance Latch-free Range Index for Non-Volatile Memory Storing a database (rows and indexes) entirely in non-volatile memory (NVM) potentially enables both high performance and fast recovery. To fully exploit parallelism on modern CPUs, modern main-memory databases use latch-free (lock-free) index structures, e.g. Bw-tree or skip lists. To achieve high performance NVMresident indexes also need to be latch-free. This paper describes the design of the BzTree, a latch-free B-tree index designed for NVM. The BzTree uses a persistent multi-word compare-and-swap operation (PMwCAS) as a core building block, enabling an index design that has several important advantages compared with competing index structures such as the Bw-tree. First, the BzTree is latch-free yet simple to implement. Second, the BzTree is fast showing up to 2x higher throughput than the Bw-tree in our experiments. Third, the BzTree does not require any special-purpose recovery code. Recovery is near-instantaneous and only involves rolling back (or forward) any PMwCAS operations that were in-flight during failure. Our end-to-end recovery experiments of BzTree report an average recovery time of 145 μs. Finally, the same BzTree implementation runs seamlessly on both volatile RAM and NVM, which greatly reduces the cost of code maintenance. PVLDB Reference Format: Joy Arulraj, Justin Levandoski, Umar Farooq Minhas,Per-Ake Larson. BzTree: A High-Performance Latch-free Range Index for Non-Volatile Memory. PVLDB, 11(4): xxxx-yyyy, 2018. DOI: https://doi.org/10.1145/3164135.3164147

negative: DynamicFusion: Reconstruction and tracking of non-rigid scenes in real-time We present the first dense SLAM system capable of reconstructing non-rigidly deforming scenes in real-time, by fusing together RGBD scans captured from commodity sensors. Our DynamicFusion approach reconstructs scene geometry whilst simultaneously estimating a dense volumetric 6D motion field that warps the estimated geometry into a live frame. Like KinectFusion, our system produces increasingly denoised, detailed, and complete reconstructions as more measurements are fused, and displays the updated model in real time. Because we do not require a template or other prior scene model, the approach is applicable to a wide range of moving objects and scenes.

negative: Learning Heterogeneous Knowledge Base Embeddings for Explainable Recommendation Providing model-generated explanations in recommender systems is important to user experience. State-of-the-art recommendation algorithms — especially the collaborative filtering (CF)-based approaches with shallow or deep models — usually work with various unstructured information sources for recommendation, such as textual reviews, visual images, and various implicit or explicit feedbacks. Though structured knowledge bases were considered in content-based approaches, they have been largely ignored recently due to the availability of vast amounts of data and the learning power of many complex models. However, structured knowledge bases exhibit unique advantages in personalized recommendation systems. When the explicit knowledge about users and items is considered for recommendation, the system could provide highly customized recommendations based on users’ historical behaviors and the knowledge is helpful for providing informed explanations regarding the recommended items. A great challenge for using knowledge bases for recommendation is how to integrate large-scale structured and unstructured data, while taking advantage of collaborative filtering for highly accurate performance. Recent achievements in knowledge-base embedding (KBE) sheds light on this problem, which makes it possible to learn user and item representations while preserving the structure of their relationship with external knowledge for explanation. In this work, we propose to explain knowledge-base embeddings for explainable recommendation. Specifically, we propose a knowledge-base representation learning framework to embed heterogeneous entities for recommendation, and based on the embedded knowledge base, a soft matching algorithm is proposed to generate personalized explanations for the recommended items. Experimental results on real-world e-commerce datasets verified the superior recommendation performance and the explainability power of our approach compared with state-of-the-art baselines.

negative: Optimal Mass Transport: Signal processing and machine-learning applications Transport-based techniques for signal and data analysis have recently received increased interest. Given their ability to provide accurate generative models for signal intensities and other data distributions, they have been used in a variety of applications, including content-based retrieval, cancer detection, image superresolution, and statistical machine learning, to name a few, and they have been shown to produce state-of-the-art results. Moreover, the geometric characteristics of transport-related metrics have inspired new kinds of algorithms for interpreting the meaning of data distributions. Here, we provide a practical overview of the mathematical underpinnings of mass transport-related methods, including numerical implementation, as well as a review, with demonstrations, of several applications. Software accompanying this article is available from [43].

negative: Design and Experiment of a Conformal Monopulse Antenna for Passive Radar Applications This paper proposed a design scheme of wide band monopulse antenna system for the passive radar seeker (PRS) of anti-radiation missile (ARM). To save the installation space of the PRS, the conical conformal log periodic antennas (LPDA) are employed to form the monopulse antenna system. The specific implementation scheme of PRS based on the conically conformal monopulse antennas was designed and analyzed. A practical monopulse antenna system composed of two log periodic antennas was designed and fabricated over the operating frequency range of 1GHz to 8GHz. A loaded resistor with impedance equal to 50Ω is used to reduce the return loss at low frequency. The experimental results demonstrate that acceptable wide band impedance matching and port isolation for each fabricated antenna was achieved. Furthermore, the wide band sum and difference radiation patterns were formed, which validates the proposed conformal monopulse antenna design scheme for the PRS application.

negative: Prediction of Web Users Browsing Behavior : A Review In Web Usage Mining (WUM), Classification technique is useful in web user prediction, where user’s browsing behavior is predicted. In Web prediction, classification is done first to predict the next Web pages set that a user may visit based on history of previously visited pages. Predicting user’s behavior effectively is important in various applications like recommendation systems, smart phones etc. Currently various prediction systems are available based on Markov model, Association Rule Mining (ARM), classification techniques, etc. In Markov prediction model it cannot predict for a session that was not observed previously in the training set and prediction time is also constant. In ARM, Apriori algorithm requires more time to generate item sets. This paper presents review of various prediction models used to predict web users browsing behavior. Key Words— WUM, classification, Browsing behavior, prediction, ARM, session

negative: Testing and evaluation of a wearable augmented reality system for natural outdoor environments This paper describes performance evaluation of a wearable augmented reality system for natural outdoor environments. Applied Research Associates (ARA), as prime integrator on the DARPA ULTRA-Vis (Urban Leader Tactical, Response, Awareness, and Visualization) program, is developing a soldier-worn system to provide intuitive ‘heads-up’ visualization of tactically-relevant geo-registered icons. Our system combines a novel pose estimation capability, a helmet-mounted see-through display, and a wearable processing unit to accurately overlay geo-registered iconography (e.g., navigation waypoints, sensor points of interest, blue forces, aircraft) on the soldier’s view of reality. We achieve accurate pose estimation through fusion of inertial, magnetic, GPS, terrain data, and computer-vision inputs. We leverage a helmet-mounted camera and custom computer vision algorithms to provide terrain-based measurements of absolute orientation (i.e., orientation of the helmet with respect to the earth). These orientation measurements, which leverage mountainous terrain horizon geometry and mission planning landmarks, enable our system to operate robustly in the presence of external and body-worn magnetic disturbances. Current field testing activities across a variety of mountainous environments indicate that we can achieve high icon geo-registration accuracy (<10mrad) using these vision-based methods.

negative: Position Paper: Physical Unclonable Functions for IoT Security Devices in the Internet of Things (IoT) introduce unique security challenges due to their operating conditions and device limitations. Existing security solutions based on classical cryptography have significant drawbacks in IoT devices, primarily due to the possibility of physical and side channel attacks. As an alternative approach, this position paper advocates the use of physical unclonable functions (PUFs) as a security primitive for developing security solutions for IoT devices. Preliminary work on developing a PUF based mutual authentication protocol is also presented.

negative: Design of prototype humanoid robotics platform for HRP This paper presents a prototype humanoid robotics platform developed for HRP-2. HRP-2 is a new humanoid robotics platform, which we have been developing in phase two of HRP. HRP is a humanoid robotics project, which has been lunched by Ministry of Economy, Trade and Industry (METI) of Japan from 1998FY to 2002FY for five years. The ability of the biped locomotion of HRP-2 is improved so that HRP-2 can cope with rough terrain in the open air and can prevent the possible damages to a humanoid robot’s own self in the event of tipping over. The ability of whole body motion of HRP-2 is also improved so that HRP-2 can get up by a humanoid robot’s own self even tough HRP-2 tips over. In this paper, the mechanisms and specifications of developed prototype humanoid robotics platform, and its electrical system are introduced.

negative: Predicting at-risk novice Java programmers through the analysis of online protocols In this study, we attempted to quantify indicators of novice programmer progress in the task of writing programs, and we evaluated the use of these indicators for identifying academically at-risk students. Over the course of nine weeks, students completed five different graded programming exercises in a computer lab. Using an instrumented version of BlueJ, an integrated development environment for Java, we collected novice compilations and explored the errors novices encountered, the locations of these errors, and the frequency with which novices compiled their programs. We identified which frequently encountered errors and which compilation behaviors were characteristic of at-risk students. Based on these findings, we developed linear regression models that allowed prediction of students' scores on a midterm exam. However, the models derived could not accurately predict the at-risk students. Although our goal of identifying at-risk students was not attained, we have gained insights regarding the compilation behavior of our students, which may help us identify students who are in need of intervention.

negative: Device analyzer: largescale mobile data collection We collected usage information from 12,500 Android devices in the wild over the course of nearly 2 years. Our dataset contains 53 billion data points from 894 models of devices running 687 versions of Android. Processing the collected data presents a number of challenges ranging from scalability to consistency and privacy considerations. We present our system architecture for collection and analysis of this highly-distributed dataset, discuss how our system can reliably collect time-series data in the presence of unreliable timing information, and discuss issues and lessons learned that we believe apply to many other big data collection projects.

negative: An analysis of unreliability and asymmetry in low-power wireless links Experimental studies have demonstrated that the behavior of real links in low-power wireless networks (such as wireless sensor networks) deviates to a large extent from the ideal binary model used in several simulation studies. In particular, there is a large transitional region in wireless link quality that is characterized by significant levels of unreliability and asymmetry, significantly impacting the performance of higher-layer protocols. We provide a comprehensive analysis of the root causes of unreliability and asymmetry. In particular, we derive expressions for the distribution, expectation, and variance of the packet reception rate as a function of distance, as well as for the location and extent of the transitional region. These expressions incorporate important environmental and radio parameters such as the path loss exponent and shadowing variance of the channel, and the modulation, encoding, and hardware variance of the radios.

negative: Optimizing distributions over molecular space . An Objective-Reinforced Generative Adversarial Network for Inverse-design Chemistry ( ORGANIC ) Molecular discovery seeks to generate chemical species tailored to very specific needs. In this paper, we present ORGANIC, a framework based on Objective-Reinforced Generative Adversarial Networks (ORGAN), capable of producing a distribution over molecular space that matches with a certain set of desirable metrics. This methodology combines two successful techniques from the machine learning community: a Generative Adversarial Network (GAN), to create non-repetitive sensible molecular species, and Reinforcement Learning (RL), to bias this generative distribution towards certain attributes. We explore several applications, from optimization of random physicochemical properties to candidates for drug discovery and organic photovoltaic material design. 1

negative: Learning to Create Jazz Melodies Using a Product of Experts We describe a neural network architecture designed to learn the musical structure of jazz melodies over chord progressions, then to create new melodies over arbitrary chord progressions from the resulting connectome (representation of neural network structure). Our architecture consists of two sub-networks, the interval expert and the chord expert, each being LSTM (long short-term memory) recurrent networks. These two sub-networks jointly learn to predict a probability distribution over future notes conditioned on past notes in the melody. We describe a training procedure for the network and an implementation as part of the opensource Impro-Visor (Improvisation Advisor) application, and demonstrate our method by providing improvised melodies based on a variety of training sets.

negative: Automated detection of smuggled high-risk security threats using Deep Learning The security infrastructure is ill-equipped to detect and deter the smuggling of non-explosive devices that enable terror attacks such as those recently perpetrated in western Europe. The detection of so-called “small metallic threats” (SMTs) in cargo containers currently relies on statistical risk analysis, intelligence reports, and visual inspection of X-ray images by security officers. The latter is very slow and unreliable due to the difficulty of the task: objects potentially spanning less than 50 pixels have to be detected in images containing more than 2 million pixels against very complex and cluttered backgrounds. In this contribution, we demonstrate for the first time the use of Convolutional Neural Networks (CNNs), a type of Deep Learning, to automate the detection of SMTs in fullsize X-ray images of cargo containers. Novel approaches for dataset augmentation allowed to train CNNs from-scratch despite the scarcity of data available. We report fewer than 6% false alarms when detecting 90% SMTs synthetically concealed in streamof-commerce images, which corresponds to an improvement of over an order of magnitude over conventional approaches such as Bag-of-Words (BoWs). The proposed scheme offers potentially super-human performance for a fraction of the time it would take for a security officers to carry out visual inspection (processing time is approximately 3.5s per container image).

negative: A Survey of Fog Computing: Concepts, Applications and Issues Despite the increasing usage of cloud computing, there are still issues unsolved due to inherent problems of cloud computing such as unreliable latency, lack of mobility support and location-awareness. Fog computing can address those problems by providing elastic resources and services to end users at the edge of network, while cloud computing are more about providing resources distributed in the core network. This survey discusses the definition of fog computing and similar concepts, introduces representative application scenarios, and identifies various aspects of issues we may encounter when designing and implementing fog computing systems. It also highlights some opportunities and challenges, as direction of potential future work, in related techniques that need to be considered in the context of fog computing.

negative: RPL-based multipath Routing Protocols for Internet of Things on Wireless Sensor Networks In the last few years, Wireless Sensor Network (WSN) emerges and appears as an essential platform for prominent concept of Internet of Things (IoT). Their application ranges from so-called “smart cities”, “smart homes” over environmental monitoring. The connectivity in IoT mainly relies on RPL (IPv6 Routing Protocol for Low Power and Lossy Network) - a routing algorithm that constructs and maintains DODAGs (Destination Oriented Directed Acyclic Graph) to transmit data from sensors to root over a single path. However, due to the resource constraints of sensor nodes and the unreliability of wireless links, single-path routing approaches cannot be considered effective techniques to meet the performance demands of various applications. In order to overcome these problems, many individuals and group research focuses on multi-path solutions for RPL routing protocol. In this paper, we propose three multipath schemes based on RPL (Energy Load Balancing-ELB, Fast Local Repair-FLR and theirs combination-ELB-FLR) and integrate them in a modified IPv6 communication stack for IoT. These schemes are implemented in OMNET++ simulator and the experiment outcomes show that our approaches have achieved better energy efficiency, better end-to-end delay, packet delivery rate and network load balance compared to traditional solution of RPL.


query: Spacetime expression cloning for blendshapes

positive: A Morphable Model for the Synthesis of 3D Faces In this paper, a new technique for modeling textured 3D faces is introduced. 3D faces can either be generated automatically from one or more photographs, or modeled directly through an intuitive user interface. Users are assisted in two key problems of computer aided face modeling. First, new face images or new 3D face models can be registered automatically by computing dense one-to-one correspondence to an internal face model. Second, the approach regulates the naturalness of modeled faces avoiding faces with an “unlikely” appearance. Starting from an example set of 3D face models, we derive a morphable face model by transforming the shape and texture of the examples into a vector space representation. New faces and expressions can be modeled by forming linear combinations of the prototypes. Shape and texture constraints derived from the statistics of our example faces are used to guide manual modeling or automated matching algorithms. We show 3D face reconstructions from single images and their applications for photo-realistic image manipulations. We also demonstrate face manipulations according to complex parameters such as gender, fullness of a face or its distinctiveness.

positive: Face poser: Interactive modeling of 3D facial expressions using facial priors This article presents an intuitive and easy-to-use system for interactively posing 3D facial expressions. The user can model and edit facial expressions by drawing freeform strokes, by specifying distances between facial points, by incrementally editing curves on the face, or by directly dragging facial points in 2D screen space. Designing such an interface for 3D facial modeling and editing is challenging because many unnatural facial expressions might be consistent with the user's input. We formulate the problem in a maximum a posteriori framework by combining the user's input with priors embedded in a large set of facial expression data. Maximizing the posteriori allows us to generate an optimal and natural facial expression that achieves the goal specified by the user. We evaluate the performance of our system by conducting a thorough comparison of our method with alternative facial modeling techniques. To demonstrate the usability of our system, we also perform a user study of our system and compare with state-of-the-art facial expression modeling software (Poser 7).

positive: High-quality passive facial performance capture using anchor frames We present a new technique for passive and markerless facial performance capture based on anchor frames. Our method starts with high resolution per-frame geometry acquisition using state-of-the-art stereo reconstruction, and proceeds to establish a single triangle mesh that is propagated through the entire performance. Leveraging the fact that facial performances often contain repetitive subsequences, we identify anchor frames as those which contain similar facial expressions to a manually chosen reference expression. Anchor frames are automatically computed over one or even multiple performances. We introduce a robust image-space tracking method that computes pixel matches directly from the reference frame to all anchor frames, and thereby to the remaining frames in the sequence via sequential matching. This allows us to propagate one reconstructed frame to an entire sequence in parallel, in contrast to previous sequential methods. Our anchored reconstruction approach also limits tracker drift and robustly handles occlusions and motion blur. The parallel tracking and mesh propagation offer low computation times. Our technique will even automatically match anchor frames across different sequences captured on different occasions, propagating a single mesh to all performances.

positive: Good features to track No feature-based vision system can work unless good features can be identi ed and tracked from frame to frame. Although tracking itself is by and large a solved problem, selecting features that can be tracked well and correspond to physical points in the world is still hard. We propose a feature selection criterion that is optimal by construction because it is based on how the tracker works, and a feature monitoring method that can detect occlusions, disocclusions, and features that do not correspond to points in the world. These methods are based on a new tracking algorithm that extends previous Newton-Raphson style search methods to work under a ne image transformations. We test performance with several simulations and experiments.

positive: Hierarchical Model-Based Motion Estimation This paper describes a hierarchical estimation framework for the computation of diverse representations of motion information. The key features of the resulting framework (or family of algorithms) a,re a global model that constrains the overall structure of the motion estimated, a local rnodel that is used in the estimation process, and a coa,rse-fine refinement strategy. Four specific motion models: affine flow, planar surface flow, rigid body motion, and general optical flow, are described along with their application to specific examPles.

negative: Detailed Real-Time Urban 3D Reconstruction from Video The paper presents a system for automatic, geo-registered, real-time 3D reconstruction from video of urban scenes. The system collects video streams, as well as GPS and inertia measurements in order to place the reconstructed models in geo-registered coordinates. It is designed using current state of the art real-time modules for all processing steps. It employs commodity graphics hardware and standard CPU’s to achieve real-time performance. We present the main considerations in designing the system and the steps of the processing pipeline. Our system extends existing algorithms to meet the robustness and variability necessary to operate out of the lab. To account for the large dynamic range of outdoor videos the processing pipeline estimates global camera gain changes in the feature tracking stage and efficiently compensates for these in stereo estimation without impacting the real-time performance. The required accuracy for many applications is achieved with a two-step stereo reconstruction process exploiting the redundancy across frames. We show results on real video sequences comprising hundreds of thousands of frames.

negative: Establishment of the Diagnosis of Follicular Occlusion Tetrad Background: Follicular occlusion tetrad (FOT) is a clinical syndrome consisting of suppurative hidradenitis, acne conglobata, dissecting cellulitis of the scalp, and pilonidal sinus. FOT is a rare case that is mostly found in severe conditions resulting in resistance to therapy. Diagnostic accuracy and therapy for all components of FOT is extremely important. Case: A 43-year old male presented with small, painful blisters and bumps filled with pus that had been ongoing for five years. We found pustules and erythematous nodules and multiple abscess with atrophic scars on the scalp, anterior and posterior trunks, abdomen, groin and gluteal regions on the facial region, we found multiple atrophic scars. The pus culture showed the presence of Escherichia coli, and fistulography examination revealed multiple cutaneous fistules and enterocutaneous sinus. The histopathological examination indicated rupture of hair follicles, follicular plugs, and infiltration of heavy-mixed infiltrate cells. Discussion: The FOT diagnosis was established through medical history recording, physical and histopathological examinations, and fistulography. Upon medical history recording and physical examination, we found pustules and nodules in several hairy areas. The fistulographic examination showed some fistules and sinus tracts, and the histopathological examination showed adnexal tissue damage caused by occlusion of hair follicles and inflammation due to accumulation of keratin and debris. All these findings led to the FOT diagnosis. ISSN 2476-2415

negative: Temporal Pattern Attention for Multivariate Time Series Forecasting Forecasting of multivariate time series data, for instance the prediction of electricity consumption, solar power production, and polyphonic piano pieces, has numerous valuable applications. However, complex and non-linear interdependencies between time steps and series complicate this task. To obtain accurate prediction, it is crucial to model long-term dependency in time series data, which can be achieved by recurrent neural networks (RNNs) with an attention mechanism. The typical attention mechanism reviews the information at each previous time step and selects relevant information to help generate the outputs; however, it fails to capture temporal patterns across multiple time steps. In this paper, we propose using a set of filters to extract time-invariant temporal patterns, similar to transforming time series data into its “frequency domain”. Then we propose a novel attention mechanism to select relevant time series, and use its frequency domain information for multivariate forecasting. We apply the proposed model on several real-world tasks and achieve state-of-the-art performance in all of these with a single exception. Our source code is available at https://github.com/gantheory/TPA-LSTM. * indicates equal contribution. This work was financially supported by the Ministry of Science and Technology of Taiwan. Shun-Yao Shih National Taiwan University E-mail: shunyaoshih@gmail.com Fan-Keng Sun National Taiwan University E-mail: b03901056@ntu.edu.tw Hung-yi Lee National Taiwan University E-mail: hungyilee@ntu.edu.tw ar X iv :1 80 9. 04 20 6v 2 [ cs .L G ] 2 7 N ov 2 01 8 2 Shun-Yao Shih* et al. Fig. 1 Historical prices of crude oil, gasoline, and lumber. Units are omitted and scales are normalized for simplicity.

negative: A Case Study of Automated Face Recognition: The Boston Marathon Bombings Suspects While face recognition can be a useful tool, helping authorities to narrow leads and confirm a criminal suspect's identity, the media tended to highlight the technology's limitations in the Boston Marathon bombings investigation. Consequently, we were motivated to reexamine the efficacy of unconstrained face recognition using this incident as a case study. We chose two automated face recognition systems known for their superior unconstrained matching performance based on tests conducted by the US National Institute of Standards and Technology: NEC's NeoFace v3.1 and Google-owned Pittsburgh Pattern Recognition v5.2.2. To conduct the experiment, we added six reference images of the Tsarnaevs taken from press releases and news articles following their identification to a background database of 1 million mug shots. Against this database, we searched for matches of the five face images of the brothers extracted by the FBI from surveillance, smartphone, or point-and-shoot camera footage before their identification.

negative: Using link structure to infer opinions in social networks The emergence of online social networks in the past few years has generated an enormous amount of information about potentially any subject. Valuable data containing users' opinions and thoughts are available on those repositories and several sentiment analysis techniques have been proposed that address the problem of understanding the opinion orientation of the users' postings. In this paper, we take a different perspective to the problem through a user centric approach, which uses a graph to model users (and their postings) and applies link mining techniques to infer opinions of users. Preliminary experiments on a Twitter corpus have shown promising results.

negative: Political Facebook groups: Micro-activism and the digital front stage The growth of social networking sites (SNS), like Facebook, has caused many to rethink how we understand political activism and citizen engagement. In 2010, 43% of Internet users reported using social networking sites " several times a day, " a sizeable increase from 2009 where only 34% reported using social networking at the same rate (Pew 2010). Research on digital activism has emphasized the use of websites, listservs, and other forums by formal organizations to raise awareness for their specific causes (McCaughey and Ayers 2003; Van de Donk 2004). Information communication technologies (ICT's) have been regarded as particularly effective tools in mobilizing disparate, resource-poor counter-spheres in collective off-line activity (Van de Donk 2004). In recent years, scholars have moved away from viewing information communication technologies (ICT's) as simply a tool for formal activist organizations. Breindl (2010) argues that on-line digital activism has largely been examined through a classic " social movement paradigm. " She calls for scholarship that looks at how the meaning and structure of activism has been transformed by ICT's. One key way it has been transformed is by allowing for small scale, many-to-many forms of politically oriented communication, what I conceptualize as a new term: microactivism. Examples include the formation of political Facebook groups, re-tweeting of articles of political interest and sharing politically relevant videos on YouTube. These acts reflect micro-level intentions and are not necessarily geared towards mobilization like more traditional forms of digital activism. This microactivism has helped bring about a radical reformulation of the political arena. One major change that emerges from the ease of many-to-many communication brought about by SMS is the reduced incentive to join social movements (Earl and Schussman 2003). These new applications encourage movement entrepreneurs (Garrett 2006) not affiliated with formal social movements but interested in fomenting social change. The ease with which individuals can create content and connect with one another to share content is viewed by others as a harbinger of a more democratic and egalitarian society (Benkler 2006, Jenkins 2007, Shirky 2010). Salter (2005) argues that sites like SNS' provide new radical public spheres that provide additional spaces for voice cultivation and political citizenship formation. More importantly, in his view information technologies help shift political discourse to more informal venues that are less subject to elite control (Dahlberg 2004). Social critics like Morozov (2009) suggest, however, that microactivism might do more harm than good. Morozov (2009) refers …

negative: Classification of Model Transformation Approaches While the current OMG standards such as the Meta Object Facility (MOF) [MOF] and the UML [UML] provide a well-established foundation for defining PIMs and PSMs, no such wellestablished foundation exists for transforming PIMs into PSMs [GLR+02]. In 2002, in its effort to change this situation, the OMG initiated a standardization process by issuing a Request for Proposal (RFP) on Query / Views / Transformations (QVT) [QVT]. This process will eventually lead to an OMG standard for defining model transformations, which will be of interest not only for PIM-to-PSM transformations, but also for defining views on models and synchronization between models. Driven by practical needs and the OMG’s request, a large number of approaches to model transformation have recently been proposed.

negative: Slant: A Blackboard System to Generate Plot, Figuration, and Narrative Discourse Aspects of Stories We introduce Slant, a system that integrates more than a decade of research into computational creativity, and specifically story generation, by connecting subsystems that deal with plot, figuration, and the narrative discourse using a blackboard. The process of integrating these systems highlights differences in the representation of story and has led to a better understanding of how story can be usefully abstracted. The plot generator MEXICA and a component of Curveship are used with little modification in Slant, while the figuration subsystem Fig-S and the template generator GRIOT-Gen, inspired by GRIOT, are also components. The development of the new subsystem Verso, which deals with genre, shows how different genres can be computationally modeled and applied to in-development stories to generate results that are surprising in terms of their connections and valuable in terms of their relationship to cultural questions. Example stories are discussed, as is the potential of the system to allow for broader collaboration, the empirical testing of how subsystems interrelate, and possible contributions in literary and artistic contexts.

negative: Probabilistic Horn Abduction and Bayesian Networks This paper presents a simple framework for Horn clause abduc tion with probabilities associated with hypotheses The framework incorporates assumptions about the rule base and independence as sumptions amongst hypotheses It is shown how any probabilistic knowledge representable in a discrete Bayesian belief network can be represented in this framework The main contribution is in nding a relationship between logical and probabilistic notions of evidential reasoning This provides a useful representation language in its own right providing a compromise between heuristic and epistemic ad equacy It also shows how Bayesian networks can be extended be yond a propositional language This paper also shows how a language with only unconditionally independent hypotheses can represent any probabilistic knowledge and argues that it is better to invent new hy potheses to explain dependence rather than having to worry about dependence in the language Scholar Canadian Institute for Advanced Research Probabilistic Horn abduction and Bayesian networks

negative: Locking the Elbow: Improved Antibody Fab Fragments as Chaperones for Structure Determination. Antibody Fab fragments have been exploited with significant success to facilitate the structure determination of challenging macromolecules as crystallization chaperones and as molecular fiducial marks for single particle cryo-electron microscopy approaches. However, the inherent flexibility of the "elbow" regions, which link the constant and variable domains of the Fab, can introduce disorder and thus diminish their effectiveness. We have developed a phage display engineering strategy to generate synthetic Fab variants that significantly reduces elbow flexibility, while maintaining their high affinity and stability. This strategy was validated using previously recalcitrant Fab-antigen complexes where introduction of an engineered elbow region enhanced crystallization and diffraction resolution. Furthermore, incorporation of the mutations appears to be generally portable to other synthetic antibodies and may serve as a universal strategy to enhance the success rates of Fabs as structure determination chaperones.

negative: Double Pole Four Throw switch design with CMOS inverter To avoid the uses of multiple RF chain associated with the multiple antennas, RF switch is most essential component. Multiple antennas systems are used to replace traditional single antennas circuitry in the radio transceiver system in order to improve the transmission capability and reliability. The desired switching system must have low cost and simple structure, yet still can capture all the advantage of Multiple Inputs Multiple Output (MIMO) systems. In this paper, we have proposed a Double Pole Four Throw (DP4T) RF switch using Complementary Metal Oxide Semiconductor (CMOS) technology with inverter property. This switch is low in cost, and capable of selecting data streams to or from the two antennas for transmitting or receiving processes, respectively.

negative: Understanding Instructions on Large Scale for Human-Robot Interaction Correctly interpreting human instructions is the first step to human-robot interaction. Previous approaches to semantically parsing the instructions relied on large numbers of training examples with annotation to widely cover all words in a domain. Annotating large enough instructions with semantic forms needs exhaustive engineering efforts. Hence, we propose propagating the semantic lexicon to learn a semantic parser from limited annotations, whereas the parser still has the ability of interpreting instructions on a large scale. We assume that the semantically-close words have the same semantic form based on the fact that human usually uses different words to refer to a same object or task. Our approach softly maps the unobserved words/phrases to the semantic forms learned from the annotated copurs through a metric for knowledge-based lexical similarity. Experiments on the collected instructions showed that the semantic parser learned with lexicon propagation outperformed the baseline. Our approach provides an opportunity for the robots to understand the human instructions on a large scale.

negative: Trellis: Privilege Separation for Multi-user Applications Made Easy Operating systems provide a wide variety of resource isolation and access control mechanisms, ranging from traditional user-based security models to fine-grained permission systems as found in modern mobile operating systems. However, comparatively little assistance is available for defining and enforcing access control policies within multiuser applications. These applications, often found in enterprise environments, allow multiple users to operate at different privilege levels in terms of exercising application functionality and accessing data. Developers of such applications bear a heavy burden in ensuring that security policies over code and data in this setting are properly expressed and enforced. We present Trellis, an approach for expressing hierarchical access control policies in applications and enforcing these policies during execution. The approach enhances the development toolchain to allow programmers to partially annotate code and data with simple privilege level tags, and uses a static analysis to infer suitable tags for the entire application. At runtime, policies are extracted from the resulting binaries and are enforced by a modified operating system kernel. Our evaluation demonstrates that this approach effectively supports the development of secure multi-user applications with modest runtime performance overhead.

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

negative: White matter lesion extension to automatic brain tissue segmentation on MRI A fully automated brain tissue segmentation method is optimized and extended with white matter lesion segmentation. Cerebrospinal fluid (CSF), gray matter (GM) and white matter (WM) are segmented by an atlas-based k-nearest neighbor classifier on multi-modal magnetic resonance imaging data. This classifier is trained by registering brain atlases to the subject. The resulting GM segmentation is used to automatically find a white matter lesion (WML) threshold in a fluid-attenuated inversion recovery scan. False positive lesions are removed by ensuring that the lesions are within the white matter. The method was visually validated on a set of 209 subjects. No segmentation errors were found in 98% of the brain tissue segmentations and 97% of the WML segmentations. A quantitative evaluation using manual segmentations was performed on a subset of 6 subjects for CSF, GM and WM segmentation and an additional 14 for the WML segmentations. The results indicated that the automatic segmentation accuracy is close to the interobserver variability of manual segmentations.

negative: T-bar reconstruction of constricted ears and a new classification. For the correction of constricted ears, many techniques are described in the literature, the majority based on Tanzer's classification of 1975. The improvements in ear reconstruction published by Brent, Nagata, Firmin and Park make better outcomes possible. It is therefore that a new classification for constricted ears is proposed, together with an alternative technique for correction of group IIA and IIB deformities, using a T-strut of costal cartilage to reconstruct the underdeveloped or missing superior crus of the antihelix.

negative: Enterprise Architecture Characteristics in Context Enterprise Governance Base On COBIT 5 Framework The existence of the enterprise architecture is an attempt of managing and planning over the evolution of information systems in the sphere of an enterprise with model-based. In developing the enterprise architecture, there are several tools definition of components in the system. This tool is known as enterprises architecture (EA) framework. In this paper, we present a method to build a model of enterprise architecture in accordance with the needs of the Organization by Understanding the characteristics of the EA framework such as Zachman, TOGAF, and FEAF. They are selected as the EA framework will be used to determine the characteristics of an EA because the framework is most widely used in corporate or Government. In COBIT 5 framework, there is a process associated with enterprise architecture it is APO03 Manage Enterprise Architecture. At this stage of the research, we describe the link between the characteristics of the EA with one process in COBIT 5 framework. The results contribute to give a recommendation how to design EA for organization based on the characteristic of EA in Context Enterprise Governance using COBIT 5 Framework.

negative: Penetration testing in a box Network and application vulnerability assessments have a tendency to be difficult and costly; however, failing to have an assessment done and fixing security loopholes may result in a security breach by malicious attackers. A security breach can cost an organization time and money remediating the damage, such as lost confidential business information, which far exceeds the cost of a security assessment. Our solution for this problem is a semi-automated system that can help a penetration tester, security professional, or systems administrator, scan and report on the vulnerabilities of a network and services running on the network. It is also able to perform some simulated attacks. This system relies on a miniaturized computer to host the necessary components to conduct a security assessment. This system has been done in an open source manner to allow others to contribute and benefit from a community effort in the name of security.

negative: X-Band GaN SPDT MMIC with over 25 Watt Linear Power Handling Single pole double throw (SPDT) switches are becoming more and more key components in phased-array radar transmit/receive modules. An SPDT switch must be able to handle the output power of a high power amplifier and must provide enough isolation to protect the low noise amplifier in the receive chain when the T/R module is transmitting. Therefore gallium nitride technology seems to become a key technology for high power SPDT switch design. The technology shows good performance on microwave frequencies and is able to handle high power. An X-band SPDT switch, with a linear power handling of over 25 W, has been designed, measured and evaluated. The circuit is designed in the coplanar waveguide AlGaN/GaN technology established at QinetiQ.

negative: The nature of procrastination: a meta-analytic and theoretical review of quintessential self-regulatory failure. Procrastination is a prevalent and pernicious form of self-regulatory failure that is not entirely understood. Hence, the relevant conceptual, theoretical, and empirical work is reviewed, drawing upon correlational, experimental, and qualitative findings. A meta-analysis of procrastination's possible causes and effects, based on 691 correlations, reveals that neuroticism, rebelliousness, and sensation seeking show only a weak connection. Strong and consistent predictors of procrastination were task aversiveness, task delay, self-efficacy, and impulsiveness, as well as conscientiousness and its facets of self-control, distractibility, organization, and achievement motivation. These effects prove consistent with temporal motivation theory, an integrative hybrid of expectancy theory and hyperbolic discounting. Continued research into procrastination should not be delayed, especially because its prevalence appears to be growing.

negative: Ultrasound measurements of axillary recess capsule thickness in unilateral frozen shoulder: study of correlation with MRI measurements The aims of this study were to compare the ultrasound thickness of the affected axillary recess capsule (ARC) with that of the unaffected ARC in patients with frozen shoulder (FS), to analyze whether the ultrasound measurements of the ARC thickness correlate with those obtained using MRI, and to assess whether the ultrasound thickness of the ARC correlates with the patterns of range of motion limitation. Forty-four patients with clinically diagnosed unilateral FS and MRI evaluation performed ultrasound measurement of ARC. The ultrasound measurement of the ARC thickness was performed with the patients in a supine position with their shoulder abducted by 40°. The ARC thickness was also measured by MRI on oblique coronal images by another physician blinded to the ultrasound measurements. With both ultrasound and MRI, ARC thickness was determined at the widest portion of the capsule. The ultrasound thickness of ARC was significantly higher in the affected shoulder (4.4 ± 1.1 mm) than in the unaffected one (2.2 ± 0.5 mm) (p < 0.001). The ultrasound thickness of the ARC in the affected shoulder correlated with that measured by MRI (8.9 ± 1.9 mm) (p < 0.001, r = 0.83). The ARC thickness, whether measured by ultrasound or MRI, was not significantly related to the limitation of movement in specific directions. Ultrasound can demonstrate the difference in ARC thickness between affected and unaffected shoulders in patients with unilateral FS. The ARC thickness measured by ultrasound correlates with that measured by MRI.

negative: Morpheo: Traceable Machine Learning on Hidden data Morpheo is a transparent and secure machine learning platform collecting and analysing large datasets. It aims at building state-of-the art prediction models in various fields where data are sensitive. Indeed, it offers strong privacy of data and algorithm, by preventing anyone to read the data, apart from the owner and the chosen algorithms. Computations in Morpheo are orchestrated by a blockchain infrastructure, thus offering total traceability of operations. Morpheo aims at building an attractive economic ecosystem around data prediction by channelling cryptomoney from prediction requests to useful data and algorithms providers. Morpheo is designed to handle multiple data sources in a transfer learning approach in order to mutualize knowledge acquired from large datasets for applications with smaller but similar datasets. Document purpose: This is a white-paper: an introduction to the technology powering Morpheo. It is evolving with the project to reflect the current vision and development status of Morpheo. It introduces Morpheo as a data-agnostic platform, although Morpheo is originally developed for a medical application, namely sleep data analysis. For technical details about Morpheo, see the online documentation and source code.

negative: A Method for Refocusing Photos using Depth from Defocus This paper will describe a method for refocusing photos taken with a regular camera. By capturing a series of images from the same viewpoint with varying focal depth, a depth metric for the scene can be calculated and used to artificially blur the photo in a realistic way to emulate a new focal depth.

negative: ROUTERLESS NETWORKS-ON-CHIP Traditional bus-based interconnects are simple and easy to implement, but the scalability is greatly limited. While router-based networks-on-chip (NoCs) offer superior scalability, they also incur significant power and area overhead due to complex router structures. In this paper, we explore a new class of on-chip networks, referred to as Routerless NoCs, where routers are completely eliminated. We propose a novel design that utilizes on-chip wiring resources smartly to achieve comparable hop count and scalability as router-based NoCs. Several effective techniques are also proposed that significantly reduce the resource requirement to avoid new network abnormalities in routerless NoC designs. Evaluation results show that, compared with a conventional mesh, the proposed routerless NoC achieves 9.5X reduction in power, 7.2X reduction in area, 2.5X reduction in zero-load packet latency, and 1.7X increase in throughput. Compared with a state-of-the-art low-cost NoC design, the proposed approach achieves 7.7X reduction in power, 3.3X reduction in area, 1.3X reduction in zero-load packet latency, and 1.6X increase

negative: Transferable Semi-Supervised Semantic Segmentation The performance of deep learning based semantic segmentation models heavily depends on sufficient data with careful annotations. However, even the largest public datasets only provide samples with pixel-level annotations for rather limited semantic categories. Such data scarcity critically limits scalability and applicability of semantic segmentation models in real applications. In this paper, we propose a novel transferable semi-supervised semantic segmentation model that can transfer the learned segmentation knowledge from a few strong categories with pixel-level annotations to unseen weak categories with only image-level annotations, significantly broadening the applicable territory of deep segmentation models. In particular, the proposed model consists of two complementary and learnable components: a Label transfer Network (L-Net) and a Prediction transfer Network (PNet). The L-Net learns to transfer the segmentation knowledge from strong categories to the images in the weak categories and produces coarse pixel-level semantic maps, by effectively exploiting the similar appearance shared across categories. Meanwhile, the P-Net tailors the transferred knowledge through a carefully designed adversarial learning strategy and produces refined segmentation results with better details. Integrating the L-Net and P-Net achieves 96.5% and 89.4% performance of the fully-supervised baseline using 50% and 0% categories with pixel-level annotations respectively on PASCAL VOC 2012. With such a novel transfer mechanism, our proposed model is easily generalizable to a variety of new categories, only requiring image-level annotations, and offers appealing scalability in real applications.

negative: Quantum Field Theory in Curved Spacetime We review the mathematically rigorous formulation of the quantum theory of a linear field propagating in a globally hyperbolic spacetime. This formulation is accomplished via the algebraic approach, which, in essence, simultaneously admits all states in all possible (unitarily inequivalent) Hilbert space constructions. The physically nonsingular states are restricted by the requirement that their two-point function satisfy the Hadamard condition, which insures that the ultra-violet behavior of the state be similar to that of the vacuum state in Minkowski spacetime, and that the expected stress-energy tensor in the state be finite. We briefly review the Unruh and Hawking effects from the perspective of the theoretical framework adopted here. A brief discussion also is given of several open issues and questions in quantum field theory in curved spacetime regarding the treatment of “backreaction”, the validity of some version of the “averaged null energy condition”, and the formulation and properties of quantum field theory in causality violating

negative: Comparison and evaluation of code clone detection techniques and tools: A qualitative approach Over the last decade many techniques and tools for software clone detection have been proposed. In this paper, we provide a qualitative comparison and evaluation of the current state-of-the-art in clone detection techniques and tools, and organize the large amount of information into a coherent conceptual framework. We begin with background concepts, a generic clone detection process and an overall taxonomy of current techniques and tools. We then classify, compare and evaluate the techniques and tools in two different dimensions. First, we classify and compare approaches based on a number of facets, each of which has a set of (possibly overlapping) attributes. Second, we qualitatively evaluate the classified techniques and tools with respect to a taxonomy of editing scenarios designed to model the creation of Type-1, Type-2, Type-3 and Type-4 clones. Finally, we provide examples of how one might use the results of this study to choose the most appropriate clone detection tool or technique in the context of a particular set of goals and constraints. The primary contributions of this paper are: (1) a schema for classifying clone detection techniques and tools and a classification of current clone detectors based on this schema, and (2) a taxonomy of editing scenarios that produce different clone types and a qualitative evaluation of current clone detectors based on this taxonomy.

negative: Proofs of Space-Time and Rational Proofs of Storage We introduce a new cryptographic primitive: Proofs of SpaceTime (PoSTs) and construct a practical protocol for implementing these proofs. A PoST allows a prover to convince a verifier that she spent a “spacetime” resource (storing data—space—over a period of time). Formally, we define the PoST resource as a linear tradeoff between CPU work and space-time (under reasonable cost assumptions, a rational user will prefer to use the lower-cost space-time resource over CPU work). Compared to a proof-of-work, a PoST requires less energy use, as the “difficulty” can be increased by extending the time period over which data is stored without increasing computation costs. Our definition is very similar to “Proofs of Space” [ePrint 2013/796, 2013/805] but, unlike the previous definitions, takes into account amortization attacks and storage duration. Moreover, our protocol uses a very different (and simpler) technique, making use of the fact that we explicitly allow a space-time tradeoff.

negative:
A parallel and efficient approach to large scale clone detection Over the past few years, researchers have implemented various algorithms to improve the scalability of clone detection. Most of these algorithms focus on scaling vertically on a single machine, and require complex intermediate data structures (e.g., suffix tree, etc.). However, several new use-cases of clone detection have emerged, which are beyond the computational capacity of a single machine. Moreover, for some of these use-cases it may be expensive to invest upfront in the cost of building these data structures.
 In this paper, we propose a technique to horizontally scale clone detection across multiple machines using the popular MapReduce framework. The technique does not require building any complex intermediate data structures. Moreover, in order to increase the efficiency, the technique uses a filtering heuristic to prune the number of code block comparisons. The filtering heuristic is independent of our approach and it can be used in conjunction with other approaches to increase their efficiency. In our experiments, we found that: (i) the computation time to detect clones decreases by almost half every time we double the number of nodes; and (ii) the scaleup is linear, with a decline of not more than 70% compared to the ideal case, on a cluster of 2-32 nodes for 150-2800 projects.

negative: SoftGUESS: Visualization and Exploration of Code Clones in Context We introduce SoftGUESS, a code clone exploration system. SoftGUESS is built on the more general GUESS system which provides users with a mechanism to interactively explore graph structures both through direct manipulation as well as a domain-specific language. We demonstrate SoftGUESS through a number of mini-applications to analyze evolutionary code-clone behavior in software systems. The mini-applications of SoftGUESS represent a novel way of looking at code-clones in the context of many system features. It is our hope that SoftGUESS will form the basis for other analysis tools in the software-engineering domain.

negative: The nucleotide sequence of a HMW glutenin subunit gene located on chromosome 1A of wheat (Triticum aestivum L.). A cloned 8.2 kb EcoRI fragment has been isolated from a genomic library of DNA derived from Triticum aestivum L. cv. Cheyenne. This fragment contains sequences related to the high molecular weight (HMW) subunits of glutenin, proteins considered to be important in determining the elastic properties of gluten. The cloned HMW subunit gene appears to be derived from chromosome 1A. The nucleotide sequence of this gene has provided new information on the structure and evolution of the HMW subunits. However, hybrid-selection translation experiments suggest that this gene is silent.

negative: Expression Cloning of TMEM16A as a Calcium-Activated Chloride Channel Subunit Calcium-activated chloride channels (CaCCs) are major regulators of sensory transduction, epithelial secretion, and smooth muscle contraction. Other crucial roles of CaCCs include action potential generation in Characean algae and prevention of polyspermia in frog egg membrane. None of the known molecular candidates share properties characteristic of most CaCCs in native cells. Using Axolotl oocytes as an expression system, we have identified TMEM16A as the Xenopus oocyte CaCC. The TMEM16 family of "transmembrane proteins with unknown function" is conserved among eukaryotes, with family members linked to tracheomalacia (mouse TMEM16A), gnathodiaphyseal dysplasia (human TMEM16E), aberrant X segregation (a Drosophila TMEM16 family member), and increased sodium tolerance (yeast TMEM16). Moreover, mouse TMEM16A and TMEM16B yield CaCCs in Axolotl oocytes and mammalian HEK293 cells and recapitulate the broad CaCC expression. The identification of this new family of ion channels may help the development of CaCC modulators for treating diseases including hypertension and cystic fibrosis.