OpenRaiser/Intern-Atlas huggingface dataset:
Why We Engage in FLOSS: Answers from Core Developers
Venue: arXiv cs.SE 2018
Year: 2018

The maintenance and evolution of Free/Libre Open Source Software (FLOSS) projects demand the constant attraction of core developers. In this paper, we report the results of a survey with 52 developers, who recently became core contributors of popular GitHub projects. We reveal their motivations to assume a key role in FLOSS projects (e.g., improving the projects because they are also using it), the project characteristics that most helped in their engagement process (e.g., a friendly community), and the barriers faced by the surveyed core developers (e.g., lack of time of the project leaders). We also compare our results with related studies about others kinds of open source contributors (casual, one-time, and newcomers).
RUSSE: The First Workshop on Russian Semantic Similarity
Venue: arXiv cs.CL 2018
Year: 2018

The paper gives an overview of the Russian Semantic Similarity Evaluation (RUSSE) shared task held in conjunction with the Dialogue 2015 conference. There exist a lot of comparative studies on semantic similarity, yet no analysis of such measures was ever performed for the Russian language. Exploring this problem for the Russian language is even more interesting, because this language has features, such as rich morphology and free word order, which make it significantly different from English, German, and other well-studied languages. We attempt to bridge this gap by proposing a shared task on the semantic similarity of Russian nouns. Our key contribution is an evaluation methodology based on four novel benchmark datasets for the Russian language. Our analysis of the 105 submissions from 19 teams reveals that successful approaches for English, such as distributional and skip-gram models, are directly applicable to Russian as well. On the one hand, the best results in the contest were obtained by sophisticated supervised models that combine evidence from different sources. On the other hand, completely unsupervised approaches, such as a skip-gram model estimated on a large-scale corpus, were able score among the top 5 systems.
A Structural Correlation Filter Combined with A Multi-task Gaussian Particle Filter for Visual Tracking
Venue: arXiv cs.CV 2018
Year: 2018

In this paper, we propose a novel structural correlation filter combined with a multi-task Gaussian particle filter (KCF-GPF) model for robust visual tracking. We first present an assemble structure where several KCF trackers as weak experts provide a preliminary decision for a Gaussian particle filter to make a final decision. The proposed method is designed to exploit and complement the strength of a KCF and a Gaussian particle filter. Compared with the existing tracking methods based on correlation filters or particle filters, the proposed tracker has several advantages. First, it can detect the tracked target in a large-scale search scope via weak KCF trackers and evaluate the reliability of weak trackers\rq decisions for a Gaussian particle filter to make a strong decision, and hence it can tackle fast motions, appearance variations, occlusions and re-detections. Second, it can effectively handle large-scale variations via a Gaussian particle filter. Third, it can be amenable to fully parallel implementation using importance sampling without resampling, thereby it is convenient for VLSI implementation and can lower the computational costs. Extensive experiments on the OTB-2013 dataset containing 50 challenging sequences demonstrate that the proposed algorithm performs favourably against 16 state-of-the-art trackers.
Accurate Facial Parts Localization and Deep Learning for 3D Facial Expression Recognition
Venue: arXiv cs.CV 2018
Year: 2018

Meaningful facial parts can convey key cues for both facial action unit detection and expression prediction. Textured 3D face scan can provide both detailed 3D geometric shape and 2D texture appearance cues of the face which are beneficial for Facial Expression Recognition (FER). However, accurate facial parts extraction as well as their fusion are challenging tasks. In this paper, a novel system for 3D FER is designed based on accurate facial parts extraction and deep feature fusion of facial parts. In particular, each textured 3D face scan is firstly represented as a 2D texture map and a depth map with one-to-one dense correspondence. Then, the facial parts of both texture map and depth map are extracted using a novel 4-stage process consists of facial landmark localization, facial rotation correction, facial resizing, facial parts bounding box extraction and post-processing procedures. Finally, deep fusion Convolutional Neural Networks (CNNs) features of all facial parts are learned from both texture maps and depth maps, respectively and nonlinear SVMs are used for expression prediction. Experiments are conducted on the BU-3DFE database, demonstrating the effectiveness of combing different facial parts, texture and depth cues and reporting the state-of-the-art results in comparison with all existing methods under the same setting.
Towards Clinical Diagnosis: Automated Stroke Lesion Segmentation on Multimodal MR Image Using Convolutional Neural Network
Venue: arXiv cs.CV 2018
Year: 2018

The patient with ischemic stroke can benefit most from the earliest possible definitive diagnosis. While the high quality medical resources are quite scarce across the globe, an automated diagnostic tool is expected in analyzing the magnetic resonance (MR) images to provide reference in clinical diagnosis. In this paper, we propose a deep learning method to automatically segment ischemic stroke lesions from multi-modal MR images. By using atrous convolution and global convolution network, our proposed residual-structured fully convolutional network (Res-FCN) is able to capture features from large receptive fields. The network architecture is validated on a large dataset of 212 clinically acquired multi-modal MR images, which is shown to achieve a mean dice coefficient of 0.645 with a mean number of false negative lesions of 1.515. The false negatives can reach a value that close to a common medical image doctor, making it exceptive for a real clinical application.
XNORBIN: A 95 TOp/s/W Hardware Accelerator for Binary Convolutional Neural Networks
Venue: arXiv cs.CV 2018
Year: 2018

Deploying state-of-the-art CNNs requires power-hungry processors and off-chip memory. This precludes the implementation of CNNs in low-power embedded systems. Recent research shows CNNs sustain extreme quantization, binarizing their weights and intermediate feature maps, thereby saving 8-32\x memory and collapsing energy-intensive sum-of-products into XNOR-and-popcount operations. We present XNORBIN, an accelerator for binary CNNs with computation tightly coupled to memory for aggressive data reuse. Implemented in UMC 65nm technology XNORBIN achieves an energy efficiency of 95 TOp/s/W and an area efficiency of 2.0 TOp/s/MGE at 0.8 V.
Paradigm and Paradox in Topology Control of Power Grids
Venue: arXiv cs.SY 2018
Year: 2018

Corrective Transmission Switching can be used by the grid operator to relieve line overloading and voltage violations, improve system reliability, and reduce system losses. Power grid optimization by means of line switching is typically formulated as a mixed integer programming problem (MIP). Such problems are known to be computationally intractable, and accordingly, a number of heuristic approaches to grid topology reconfiguration have been proposed in the power systems literature. By means of some low order examples (3-bus systems), it is shown that within a reasonably large class of greedy heuristics, none can be found that perform better than the others across all grid topologies. Despite this cautionary tale, statistical evidence based on a large number of simulations using using IEEE 118- bus systems indicates that among three heuristics, a globally greedy heuristic is the most computationally intensive, but has the best chance of reducing generation costs while enforcing N-1 connectivity. It is argued that, among all iterative methods, the locally optimal switches at each stage have a better chance in not only approximating a global optimal solution but also greatly limiting the number of lines that are switched.
Neural Network Quine
Venue: arXiv cs.AI 2018
Year: 2018

Self-replication is a key aspect of biological life that has been largely overlooked in Artificial Intelligence systems. Here we describe how to build and train self-replicating neural networks. The network replicates itself by learning to output its own weights. The network is designed using a loss function that can be optimized with either gradient-based or non-gradient-based methods. We also describe a method we call regeneration to train the network without explicit optimization, by injecting the network with predictions of its own parameters. The best solution for a self-replicating network was found by alternating between regeneration and optimization steps. Finally, we describe a design for a self-replicating neural network that can solve an auxiliary task such as MNIST image classification. We observe that there is a trade-off between the network's ability to classify images and its ability to replicate, but training is biased towards increasing its specialization at image classification at the expense of replication. This is analogous to the trade-off between reproduction and other tasks observed in nature. We suggest that a self-replication mechanism for artificial intelligence is useful because it introduces the possibility of continual improvement through natural selection.
Power Grid Decomposition Based on Vertex Cut Sets and Its Applications to Topology Control and Power Trading
Venue: arXiv cs.SY 2018
Year: 2018

It is well known that the reserves/redundancies built into the transmission grid in order to address a variety of contingencies over a long planning horizon may, in the short run, cause economic dispatch inefficiency. Accordingly, power grid optimization by means of short term line switching has been proposed and is typically formulated as a mixed integer programming problem by treating the state of the transmission lines as a binary decision variable, i.e. in-service or out-of-service, in the optimal power flow problem. To handle the combinatorial explosion, a number of heuristic approaches to grid topology reconfiguration have been proposed in the literature. This paper extends our recent results on the iterative heuristics and proposes a fast grid decomposition algorithm based on vertex cut sets with the purpose of further reducing the computational cost. The paper concludes with a discussion of the possible relationship between vertex cut sets in transmission networks and power trading.
Some Closure Results for Polynomial Factorization and Applications
Venue: arXiv cs.CC 2018
Year: 2018

In a sequence of seminal results in the 80's, Kaltofen showed that the complexity class VP is closed under taking factors. A natural question in this context is to understand if other natural classes of multivariate polynomials, for instance, arithmetic formulas, algebraic branching programs, bounded depth arithmetic circuits or the class VNP, are closed under taking factors. In this paper, we show that all factors of degree at most $\log^a n$ of polynomials with poly(n) size depth $k$ circuits have poly(n) size circuits of depth at most $O(k + a)$. This partially answers a question of Shpilka-Yehudayoff and has applications to hardness-randomness tradeoffs for bounded depth arithmetic circuits. More precisely, this shows that a superpolynomial lower bound for bounded depth arithmetic circuits, for a family of explicit polynomials of degree poly$(\log n)$ implies deterministic sub-exponential time algorithms for polynomial identity testing (PIT) for bounded depth arithmetic circuits. This is incomparable to a beautiful result of Dvir et al., where they showed that super-polynomial lower bounds for constant depth arithmetic circuits for any explicit family of polynomials (of potentially high degree) implies sub-exponential time deterministic PIT for bounded depth circuits of bounded individual degree. Thus, we remove the "bounded individual degree" condition in [DSY09] at the cost of strengthening the hardness assumption to hold for polynomials of low degree. As direct applications of our techniques, we also show that the complexity class VNP is closed under taking factors, thereby confirming a conjecture of Bürgisser and get an alternate proof of the fact (first shown by Dutta et al.) that if a polynomial $Q$ of degree at most $d$ divides a polynomial $P$ computable by a formula of size $s$, then $Q$ has a formula of size at most poly$(s, d^{\log d}, deg(P))$.
Chiron: Privacy-preserving Machine Learning as a Service
Venue: arXiv cs.CR 2018
Year: 2018

Major cloud operators offer machine learning (ML) as a service, enabling customers who have the data but not ML expertise or infrastructure to train predictive models on this data. Existing ML-as-a-service platforms require users to reveal all training data to the service operator. We design, implement, and evaluate Chiron, a system for privacy-preserving machine learning as a service. First, Chiron conceals the training data from the service operator. Second, in keeping with how many existing ML-as-a-service platforms work, Chiron reveals neither the training algorithm nor the model structure to the user, providing only black-box access to the trained model. Chiron is implemented using SGX enclaves, but SGX alone does not achieve the dual goals of data privacy and model confidentiality. Chiron runs the standard ML training toolchain (including the popular Theano framework and C compiler) in an enclave, but the untrusted model-creation code from the service operator is further confined in a Ryoan sandbox to prevent it from leaking the training data outside the enclave. To support distributed training, Chiron executes multiple concurrent enclaves that exchange model parameters via a parameter server. We evaluate Chiron on popular deep learning models, focusing on benchmark image classification tasks such as CIFAR and ImageNet, and show that its training performance and accuracy of the resulting models are practical for common uses of ML-as-a-service.
Real-time Deep Pose Estimation with Geodesic Loss for Image-to-Template Rigid Registration
Venue: arXiv cs.CV 2018
Year: 2018

With an aim to increase the capture range and accelerate the performance of state-of-the-art inter-subject and subject-to-template 3D registration, we propose deep learning-based methods that are trained to find the 3D position of arbitrarily oriented subjects or anatomy based on slices or volumes of medical images. For this, we propose regression CNNs that learn to predict the angle-axis representation of 3D rotations and translations using image features. We use and compare mean square error and geodesic loss to train regression CNNs for 3D pose estimation used in two different scenarios: slice-to-volume registration and volume-to-volume registration. Our results show that in such registration applications that are amendable to learning, the proposed deep learning methods with geodesic loss minimization can achieve accurate results with a wide capture range in real-time (<100ms). We also tested the generalization capability of the trained CNNs on an expanded age range and on images of newborn subjects with similar and different MR image contrasts. We trained our models on T2-weighted fetal brain MRI scans and used them to predict the 3D pose of newborn brains based on T1-weighted MRI scans. We showed that the trained models generalized well for the new domain when we performed image contrast transfer through a conditional generative adversarial network. This indicates that the domain of application of the trained deep regression CNNs can be further expanded to image modalities and contrasts other than those used in training. A combination of our proposed methods with accelerated optimization-based registration algorithms can dramatically enhance the performance of automatic imaging devices and image processing methods of the future.
Research on Cross-platform Measurement method of online Advertising
Venue: arXiv cs.CY 2018
Year: 2018

There are a large number of competing ADXs on the Internet. It is the primary demand to identify and compare the advertising performance of ADX. Traditional method relies on training artificial online personas to represent behavioral traits. Then it uncovers existing correlation between users each exhibiting a certain behavioral trait and the display ads shown to them. This approach only measures and evaluates the performance of a single ADX. Due to without common measurement basis, this method does not able to apply to the comparative study of the performance of multiple ADXs. Therefore, in this tech report, a synchronous cross-platform measurement method is proposed and implemented. This method can realize the comparison of the performance of different ADXs, and help advertisers select the appropriate ADX.
A Location-based Approach for Distributed Kiosk Design
Venue: arXiv cs.CY 2018
Year: 2018

Electronic kiosk interface design and implementation metrics have been well established. The problem arises when more than one kiosk is utilized in a different location within the same geographic proximity using the same basic informational parameters. This manuscript describes the design implications of a distributed kiosk environment from the standpoint of a field experiment. The log files from 2 kiosks deployed in the same building are analyzed for correlations among kiosk location and information required. The results show that while kiosk systems deployed in primary entrances should have a broad view of pertinent information, kiosks deployed in more remote locations should have information pertinent to that area initially presented to the individual. This research provides both confirmatory evidence and a checklist of implementation decision points for those who wish to implement a distributed kiosk architecture.
Review on Master Patient Index
Venue: arXiv cs.CY 2018
Year: 2018

In today's health care establishments there is a great diversity of information systems. Each with different specificities and capacities, proprietary communication methods, and hardly allow scalability. This set of characteristics hinders the interoperability of all these systems, in the search for the good of the patient. It is vulgar that, when we look at all the databases of each of these information systems, we come across different registers that refer to the same person; records with insufficient data; records with erroneous data due to errors or misunderstandings when inserting patient data; and records with outdated data. These problems cause duplicity, incoherence, discontinuation and dispersion in patient data. With the intention of minimizing these problems that the concept of a Master Patient Index is necessary. A Master Patient Index proposes a centralized repository, which indexes all patient records of a given set of information systems. Which is composed of a set of demographic data sufficient to unambiguously identify a person and a list of identifiers that identify the various records that the patient has in the repositories of each information system. This solution allows for synchronization between all the actors, minimizing incoherence, out datedness, lack of data, and a decrease in duplicate registrations. The Master Patient Index is an asset to patients, the medical staff and health care providers.
|{Math, Philosophy, Programming, Writing}| = 1
Venue: arXiv cs.CY 2018
Year: 2018

Philosophical thinking has a side effect: by aiming to find the essence of a diverse set of phenomena, it often makes it difficult to see the differences between them. This can be the case with Mathematics, Programming, Writing and Philosophy itself. Their unified essence is having a shared understanding of the world helped by off-loading our cognitive efforts to suitable languages.
Beyond Patient Monitoring: Conversational Agents Role in Telemedicine & Healthcare Support For Home-Living Elderly Individuals
Venue: arXiv cs.CY 2018
Year: 2018

There is a need for systems to dynamically interact with ageing populations to gather information, monitor health condition and provide support, especially after hospital discharge or at-home settings. Several smart devices have been delivered by digital health, bundled with telemedicine systems, smartphone and other digital services. While such solutions offer personalised data and suggestions, the real disruptive step comes from the interaction of new digital ecosystem, represented by chatbots. Chatbots will play a leading role by embodying the function of a virtual assistant and bridging the gap between patients and clinicians. Powered by AI and machine learning algorithms, chatbots are forecasted to save healthcare costs when used in place of a human or assist them as a preliminary step of helping to assess a condition and providing self-care recommendations. This paper describes integrating chatbots into telemedicine systems intended for elderly patient after their hospital discharge. The paper discusses possible ways to utilise chatbots to assist healthcare providers and support patients with their condition.
CPVNF:Cost-efficient Proactive VNF Placement and Chaining for Value-Added Services in Content Delivery Networks
Venue: arXiv cs.NI 2018
Year: 2018

Value-added services (e.g., overlaid video advertisements) have become an integral part of today's Content Delivery Networks (CDNs). To offer cost-efficient, scalable and more agile provisioning of new value-added services in CDNs, Network Functions Virtualization (NFV) paradigm may be leveraged to allow implementation of fine-grained services as a chain of Virtual Network Functions (VNFs) to be placed in CDN. The manner in which these chains are placed is critical as it both affects the quality of service (QoS) and provider cost. The problem is however, very challenging due to the specifics of the chains (e.g.,one of their end-points is not known prior to the placement). We formulate it as an Integer Linear Program (ILP) and propose a cost efficient Proactive VNF placement and chaining (CPVNF)algorithm. The objective is to find the optimal number of VNFs along with their locations in such a manner that the cost is minimized while QoS is met. Apart from cost minimization, the support for large-scale CDNs with a large number of servers and end-users is an important feature of the proposed algorithm. Through simulations, the algorithm's behaviour for small-scale to large-scale CDN networks is analyzed.
Zero-Shot Object Detection: Learning to Simultaneously Recognize and Localize Novel Concepts
Venue: arXiv cs.CV 2018
Year: 2018

Current Zero-Shot Learning (ZSL) approaches are restricted to recognition of a single dominant unseen object category in a test image. We hypothesize that this setting is ill-suited for real-world applications where unseen objects appear only as a part of a complex scene, warranting both the `recognition' and `localization' of an unseen category. To address this limitation, we introduce a new \emph{`Zero-Shot Detection'} (ZSD) problem setting, which aims at simultaneously recognizing and locating object instances belonging to novel categories without any training examples. We also propose a new experimental protocol for ZSD based on the highly challenging ILSVRC dataset, adhering to practical issues, e.g., the rarity of unseen objects. To the best of our knowledge, this is the first end-to-end deep network for ZSD that jointly models the interplay between visual and semantic domain information. To overcome the noise in the automatically derived semantic descriptions, we utilize the concept of meta-classes to design an original loss function that achieves synergy between max-margin class separation and semantic space clustering. Furthermore, we present a baseline approach extended from recognition to detection setting. Our extensive experiments show significant performance boost over the baseline on the imperative yet difficult ZSD problem.