OpenRaiser/Intern-Atlas huggingface dataset:
Does Python Smell Like Java? Tool Support for Design Defect Discovery in Python
Venue: arXiv cs.SE 2017
Year: 2017

The context of this work is specification, detection and ultimately removal of detectable harmful patterns in source code that are associated with defects in design and implementation of software. In particular, we investigate five code smells and four antipatterns previously defined in papers and books. Our inquiry is about detecting those in source code written in Python programming language, which is substantially different from all prior research, most of which concerns Java or C-like languages. Our approach was that of software engineers: we have processed existing research literature on the topic, extracted both the abstract definitions of nine design defects and their concrete implementation specifications, implemented them all in a tool we have programmed and let it loose on a huge test set obtained from open source code from thousands of GitHub projects. When it comes to knowledge, we have found that more than twice as many methods in Python can be considered too long (statistically extremely longer than their neighbours within the same project) than in Java, but long parameter lists are seven times less likely to be found in Python code than in Java code. We have also found that Functional Decomposition, the way it was defined for Java, is not found in the Python code at all, and Spaghetti Code and God Classes are extremely rare there as well. The grounding and the confidence in these results comes from the fact that we have performed our experiments on 32'058'823 lines of Python code, which is by far the largest test set for a freely available Python parser. We have also designed the experiment in such a way that it aligned with prior research on design defect detection in Java in order to ease the comparison if we treat our own actions as a replication. Thus, the importance of the work is both in the unique open Python grammar of highest quality, tested on millions of lines of code, and in the design defect detection tool which works on something else than Java.
Quicksilver: Fast Predictive Image Registration - a Deep Learning Approach
Venue: arXiv cs.CV 2017
Year: 2017

This paper introduces Quicksilver, a fast deformable image registration method. Quicksilver registration for image-pairs works by patch-wise prediction of a deformation model based directly on image appearance. A deep encoder-decoder network is used as the prediction model. While the prediction strategy is general, we focus on predictions for the Large Deformation Diffeomorphic Metric Mapping (LDDMM) model. Specifically, we predict the momentum-parameterization of LDDMM, which facilitates a patch-wise prediction strategy while maintaining the theoretical properties of LDDMM, such as guaranteed diffeomorphic mappings for sufficiently strong regularization. We also provide a probabilistic version of our prediction network which can be sampled during the testing time to calculate uncertainties in the predicted deformations. Finally, we introduce a new correction network which greatly increases the prediction accuracy of an already existing prediction network. We show experimental results for uni-modal atlas-to-image as well as uni- / multi- modal image-to-image registrations. These experiments demonstrate that our method accurately predicts registrations obtained by numerical optimization, is very fast, achieves state-of-the-art registration results on four standard validation datasets, and can jointly learn an image similarity measure. Quicksilver is freely available as an open-source software.
Approximate Minimum Diameter
Venue: arXiv cs.CG 2017
Year: 2017

We study the minimum diameter problem for a set of inexact points. By inexact, we mean that the precise location of the points is not known. Instead, the location of each point is restricted to a contineus region ($\impre$ model) or a finite set of points ($\indec$ model). Given a set of inexact points in one of $\impre$ or $\indec$ models, we wish to provide a lower-bound on the diameter of the real points. In the first part of the paper, we focus on $\indec$ model. We present an $O(2^{\frac{1}{ε^d}} \cdot ε^{-2d} \cdot n^3 )$ time approximation algorithm of factor $(1+ε)$ for finding minimum diameter of a set of points in $d$ dimensions. This improves the previously proposed algorithms for this problem substantially. Next, we consider the problem in $\impre$ model. In $d$-dimensional space, we propose a polynomial time $\sqrt{d}$-approximation algorithm. In addition, for $d=2$, we define the notion of $α$-separability and use our algorithm for $\indec$ model to obtain $(1+ε)$-approximation algorithm for a set of $α$-separable regions in time $O(2^{\frac{1}{ε^2}}\allowbreak . \frac{n^3}{ε^{10} .\sin(α/2)^3} )$.
All Cognitive MIMO: A New Multiuser Detection Approach with Different Priorities
Venue: arXiv cs.IT 2017
Year: 2017

A new detection scheme for multiuser multiple-input multiple-output (MIMO) systems is analytically presented. In particular, the transmitting users are being categorized in two distinct priority service groups, while they communicate directly with a multi-antenna receiver. The linear zero-forcing scheme is applied in two consecutive detection stages upon the signal reception. In the first stage, the signals of one service group are detected, followed by the second stage including the corresponding detection of the remaining signals. An appropriate switching scheme based on specific transmission quality requirements is utilized prior to the detection so as to allocate the signals of a given service group to the suitable detection stage. The objective is the enhancement of the reception quality for both service groups. The proposed approach can be implemented directly in cognitive radio communication assigning the secondary users to the appropriate service group. The exact outage probability of the considered system is derived in closed form. The special case of massive MIMO is further studied yielding some useful engineering outcomes; the effective channel coherence time and a certain optimality condition defining both the transmission quality and effective number of independent transmissions.
Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Data
Venue: arXiv cs.LG 2017
Year: 2017

One of the defining properties of deep learning is that models are chosen to have many more parameters than available training data. In light of this capacity for overfitting, it is remarkable that simple algorithms like SGD reliably return solutions with low test error. One roadblock to explaining these phenomena in terms of implicit regularization, structural properties of the solution, and/or easiness of the data is that many learning bounds are quantitatively vacuous when applied to networks learned by SGD in this "deep learning" regime. Logically, in order to explain generalization, we need nonvacuous bounds. We return to an idea by Langford and Caruana (2001), who used PAC-Bayes bounds to compute nonvacuous numerical bounds on generalization error for stochastic two-layer two-hidden-unit neural networks via a sensitivity analysis. By optimizing the PAC-Bayes bound directly, we are able to extend their approach and obtain nonvacuous generalization bounds for deep stochastic neural network classifiers with millions of parameters trained on only tens of thousands of examples. We connect our findings to recent and old work on flat minima and MDL-based explanations of generalization.
Spectral Methods for Nonparametric Models
Venue: arXiv cs.LG 2017
Year: 2017

Nonparametric models are versatile, albeit computationally expensive, tool for modeling mixture models. In this paper, we introduce spectral methods for the two most popular nonparametric models: the Indian Buffet Process (IBP) and the Hierarchical Dirichlet Process (HDP). We show that using spectral methods for the inference of nonparametric models are computationally and statistically efficient. In particular, we derive the lower-order moments of the IBP and the HDP, propose spectral algorithms for both models, and provide reconstruction guarantees for the algorithms. For the HDP, we further show that applying hierarchical models on dataset with hierarchical structure, which can be solved with the generalized spectral HDP, produces better solutions to that of flat models regarding likelihood performance.
Opinion Mining on Non-English Short Text
Venue: arXiv cs.CL 2017
Year: 2017

As the type and the number of such venues increase, automated analysis of sentiment on textual resources has become an essential data mining task. In this paper, we investigate the problem of mining opinions on the collection of informal short texts. Both positive and negative sentiment strength of texts are detected. We focus on a non-English language that has few resources for text mining. This approach would help enhance the sentiment analysis in languages where a list of opinionated words does not exist. We propose a new method projects the text into dense and low dimensional feature vectors according to the sentiment strength of the words. We detect the mixture of positive and negative sentiments on a multi-variant scale. Empirical evaluation of the proposed framework on Turkish tweets shows that our approach gets good results for opinion mining.
Efficient Asymmetric Co-Tracking using Uncertainty Sampling
Venue: arXiv cs.CV 2017
Year: 2017

Adaptive tracking-by-detection approaches are popular for tracking arbitrary objects. They treat the tracking problem as a classification task and use online learning techniques to update the object model. However, these approaches are heavily invested in the efficiency and effectiveness of their detectors. Evaluating a massive number of samples for each frame (e.g., obtained by a sliding window) forces the detector to trade the accuracy in favor of speed. Furthermore, misclassification of borderline samples in the detector introduce accumulating errors in tracking. In this study, we propose a co-tracking based on the efficient cooperation of two detectors: a rapid adaptive exemplar-based detector and another more sophisticated but slower detector with a long-term memory. The sampling labeling and co-learning of the detectors are conducted by an uncertainty sampling unit, which improves the speed and accuracy of the system. We also introduce a budgeting mechanism which prevents the unbounded growth in the number of examples in the first detector to maintain its rapid response. Experiments demonstrate the efficiency and effectiveness of the proposed tracker against its baselines and its superior performance against state-of-the-art trackers on various benchmark videos.
Customizing First Person Image Through Desired Actions
Venue: arXiv cs.CV 2017
Year: 2017

This paper studies a problem of inverse visual path planning: creating a visual scene from a first person action. Our conjecture is that the spatial arrangement of a first person visual scene is deployed to afford an action, and therefore, the action can be inversely used to synthesize a new scene such that the action is feasible. As a proof-of-concept, we focus on linking visual experiences induced by walking. A key innovation of this paper is a concept of ActionTunnel---a 3D virtual tunnel along the future trajectory encoding what the wearer will visually experience as moving into the scene. This connects two distinctive first person images through similar walking paths. Our method takes a first person image with a user defined future trajectory and outputs a new image that can afford the future motion. The image is created by combining present and future ActionTunnels in 3D where the missing pixels in adjoining area are computed by a generative adversarial network. Our work can provide a travel across different first person experiences in diverse real world scenes.
The Stochastic Processes Generation in OpenModelica
Venue: arXiv cs.MS 2017
Year: 2017

Background: Component-based modeling language Modelica (OpenModelica is open source implementation) is used for the numerical simulation of complex processes of different nature represented by ODE system. However, in OpenModelica standard library there is no routines for pseudo-random numbers generation, which makes it impossible to use for stochastic modeling processes. Purpose: The goal of this article is a brief overview of a number of algorithms for generation a sequence of uniformly distributed pseudo random numbers and quality assessment of the sequence given by them, as well as the ways to implement some of these algorithms in OpenModelica system. Methods: All the algorithms are implemented in C language, and the results of their work tested using open source package DieHarder. For those algorithms that do not use bit operations, we describe there realisation using OpwnModelica. The other algorithms can be called in OpenModelica as C functions Results: We have implemented and tested about nine algorithms. DieHarder testing revealed the highest quality pseudo-random number generators. Also we have reviewed libraries Noise and AdvancedNoise, who claim to be adding to the Modelica Standard Library. Conclusions: In OpenModelica system can be implemented generators of uniformly distributed pseudo-random numbers, which is the first step towards to make OpenModelica suitable for simulation of stochastic processes.
People Counting in Crowded and Outdoor Scenes using a Hybrid Multi-Camera Approach
Venue: arXiv cs.CV 2017
Year: 2017

This paper presents two novel approaches for people counting in crowded and open environments that combine the information gathered by multiple views. Multiple camera are used to expand the field of view as well as to mitigate the problem of occlusion that commonly affects the performance of counting methods using single cameras. The first approach is regarded as a direct approach and it attempts to segment and count each individual in the crowd. For such an aim, two head detectors trained with head images are employed: one based on support vector machines and another based on Adaboost perceptron. The second approach, regarded as an indirect approach employs learning algorithms and statistical analysis on the whole crowd to achieve counting. For such an aim, corner points are extracted from groups of people in a foreground image and computed by a learning algorithm which estimates the number of people in the scene. Both approaches count the number of people on the scene and not only on a given image or video frame of the scene. The experimental results obtained on the benchmark PETS2009 video dataset show that proposed indirect method surpasses other methods with improvements of up to 46.7% and provides accurate counting results for the crowded scenes. On the other hand, the direct method shows high error rates due to the fact that the latter has much more complex problems to solve, such as segmentation of heads.
Ultra-Dense Networks: Is There a Limit to Spatial Spectrum Reuse?
Venue: arXiv cs.NI 2017
Year: 2017

The aggressive spatial spectrum reuse (SSR) by network densification using smaller cells has successfully driven the wireless communication industry onward in the past decades. In our future journey toward ultra-dense networks (UDNs), a fundamental question needs to be answered. Is there a limit to SSR? In other words, when we deploy thousands or millions of small cell base stations (BSs) per square kilometer, is activating all BSs on the same time/frequency resource the best strategy? In this paper, we present theoretical analyses to answer such question. In particular, we find that both the signal and interference powers become bounded in practical UDNs with a non-zero BS-to-UE antenna height difference and a finite UE density, which leads to a constant capacity scaling law. As a result, there exists an optimal SSR density that can maximize the network capacity. Hence, the limit to SSR should be considered in the operation of future UDNs.
Requirements-Driven Dynamic Adaptation to Mitigate Runtime Uncertainties for Self-Adaptive Systems
Venue: arXiv cs.SE 2017
Year: 2017

Self-adaptive systems are capable of adjusting their behavior to cope with the changes in environment and itself. These changes may cause runtime uncertainty, which refers to the system state of failing to achieve appropriate reconfigurations. However, it is often infeasible to exhaustively anticipate all the changes. Thus, providing dynamic adaptation mechanisms for mitigating runtime uncertainty becomes a big challenge. This paper suggests solving this challenge at requirements phase by presenting REDAPT, short for REquirement-Driven adAPTation. We propose an adaptive goal model (AGM) by introducing adaptive elements, specify dynamic properties of AGM by providing logic based grammar, derive adaptation mechanisms with AGM specifications and achieve adaptation by monitoring variables, diagnosing requirements violations, determining reconfigurations and execution. Our approach is demonstrated with an example from the Intelligent Transportation System domain and evaluated through a series of simulation experiments.
Exploratory Testing: One Size Doesn't Fit All
Venue: arXiv cs.SE 2017
Year: 2017

Exploratory testing (ET) is a powerful and efficient way of testing software by integrating design, execution, and analysis of tests during a testing session. ET is often contrasted with scripted testing, and seen as a choice between black and white. We pose that there are different levels of exploratory testing from fully exploratory to fully scripted and propose a scale for the degree of exploration for ET. The degree is defined through levels of ET, which correspond to the way test charters are formulated. We have evaluated the classification through focus groups at four companies and identified factors that influence the level of exploratory testing. The results show that the proposed ET levels have distinguishing characteristics and that the levels can be used as a guide to structure test charters. Our study also indicates that applying a combination of ET levels can be beneficial in achieving effective testing.
RiPLE: Recommendation in Peer-Learning Environments Based on Knowledge Gaps and Interests
Venue: arXiv cs.CY 2017
Year: 2017

Various forms of Peer-Learning Environments are increasingly being used in post-secondary education, often to help build repositories of student generated learning objects. However, large classes can result in an extensive repository, which can make it more challenging for students to search for suitable objects that both reflect their interests and address their knowledge gaps. Recommender Systems for Technology Enhanced Learning (RecSysTEL) offer a potential solution to this problem by providing sophisticated filtering techniques to help students to find the resources that they need in a timely manner. Here, a new RecSysTEL for Recommendation in Peer-Learning Environments (RiPLE) is presented. The approach uses a collaborative filtering algorithm based upon matrix factorization to create personalized recommendations for individual students that address their interests and their current knowledge gaps. The approach is validated using both synthetic and real data sets. The results are promising, indicating RiPLE is able to provide sensible personalized recommendations for both regular and cold-start users under reasonable assumptions about parameters and user behavior.
Effects of Degree Correlations in Interdependent Security: Good or Bad?
Venue: arXiv cs.SI 2017
Year: 2017

We study the influence of degree correlations or network mixing in interdependent security. We model the interdependence in security among agents using a dependence graph and employ a population game model to capture the interaction among many agents when they are strategic and have various security measures they can choose to defend themselves. The overall network security is measured by what we call the average risk exposure (ARE) from neighbors, which is proportional to the total (expected) number of attacks in the network. We first show that there exists a unique pure-strategy Nash equilibrium of a population game. Then, we prove that as the agents with larger degrees in the dependence graph see higher risks than those with smaller degrees, the overall network security deteriorates in that the ARE experienced by agents increases and there are more attacks in the network. Finally, using this finding, we demonstrate that the effects of network mixing on ARE depend on the (cost) effectiveness of security measures available to agents; if the security measures are not effective, increasing assortativity of dependence graph results in higher ARE. On the other hand, if the security measures are effective at fending off the damages and losses from attacks, increasing assortativity reduces the ARE experienced by agents.
A Passivity-Based Design for Stability and Robustness in Event-Triggered Networked Control Systems with Communication Delays, Signal Quantizations and Packet Dropouts
Venue: arXiv cs.SY 2017
Year: 2017

In this report, we introduce a comprehensive design framework for Event-Triggered Networked Control Systems based on the passivity-based concept of Input Feed-Forward Output Feedback Passive (IF-OFP) systems. Our approach is comprehensive in the sense that we show finite-gain $L_2$-stability and robustness for the networked control system by considering the effects of time-varying or constant network induced delays, signal quantizations, and data losses in communication links from the plant to controller and the controller to plant. Our design is based on the need for a more efficient utilization of band-limited shared communication networks which is a necessity for the design of Large-Scale Cyber-Physical systems. To achieve this, we introduce simple triggering conditions that do not require the exact knowledge of the sub-systems and are located on both sides of the communication network: the plant's output and the controller's output. This specifically leads to a great decrease in the communication rate between the controller and plant. Additionally, we show lower-bounds on inter-event time intervals for the triggering conditions and show the design's robustness against external noise and disturbance. We illustrate the relationship amongst stability, robustness and passivity levels for the plant and controller. We analyze our design's robustness against packet dropouts and loss of communication. Our results are design-oriented in the sense that based on our proposed framework, the designer can easily observe the trade-offs amongst different components of the networked control system, time-varying delays, effects of signal quantizations and triggering conditions, stability, robustness and performance of networked control system and make design decisions accordingly.
Computing monotone policies for Markov decision processes: a nearly-isotonic penalty approach
Venue: arXiv cs.SY 2017
Year: 2017

This paper discusses algorithms for solving Markov decision processes (MDPs) that have monotone optimal policies. We propose a two-stage alternating convex optimization scheme that can accelerate the search for an optimal policy by exploiting the monotone property. The first stage is a linear program formulated in terms of the joint state-action probabilities. The second stage is a regularized problem formulated in terms of the conditional probabilities of actions given states. The regularization uses techniques from nearly-isotonic regression. While a variety of iterative method can be used in the first formulation of the problem, we show in numerical simulations that, in particular, the alternating method of multipliers (ADMM) can be significantly accelerated using the regularization step.