OpenRaiser/Intern-Atlas huggingface dataset:
On Convergence Property of Implicit Self-paced Objective
Venue: arXiv cs.AI 2017
Year: 2017

Self-paced learning (SPL) is a new methodology that simulates the learning principle of humans/animals to start learning easier aspects of a learning task, and then gradually take more complex examples into training. This new-coming learning regime has been empirically substantiated to be effective in various computer vision and pattern recognition tasks. Recently, it has been proved that the SPL regime has a close relationship to a implicit self-paced objective function. While this implicit objective could provide helpful interpretations to the effectiveness, especially the robustness, insights under the SPL paradigms, there are still no theoretical results strictly proved to verify such relationship. To this issue, in this paper, we provide some convergence results on this implicit objective of SPL. Specifically, we prove that the learning process of SPL always converges to critical points of this implicit objective under some mild conditions. This result verifies the intrinsic relationship between SPL and this implicit objective, and makes the previous robustness analysis on SPL complete and theoretically rational.
Hierarchical Surrogate Modeling for Illumination Algorithms
Venue: arXiv cs.NE 2017
Year: 2017

Evolutionary illumination is a recent technique that allows producing many diverse, optimal solutions in a map of manually defined features. To support the large amount of objective function evaluations, surrogate model assistance was recently introduced. Illumination models need to represent many more, diverse optimal regions than classical surrogate models. In this PhD thesis, we propose to decompose the sample set, decreasing model complexity, by hierarchically segmenting the training set according to their coordinates in feature space. An ensemble of diverse models can then be trained to serve as a surrogate to illumination.
Engineering DFS-Based Graph Algorithms
Venue: arXiv cs.DS 2017
Year: 2017

Depth-first search (DFS) is the basis for many efficient graph algorithms. We introduce general techniques for the efficient implementation of DFS-based graph algorithms and exemplify them on three algorithms for computing strongly connected components. The techniques lead to speed-ups by a factor of two to three compared to the implementations provided by LEDA and BOOST. We have obtained similar speed-ups for biconnected components algorithms. We also compare the graph data types of LEDA and BOOST.
A Short Review of Ethical Challenges in Clinical Natural Language Processing
Venue: arXiv cs.CL 2017
Year: 2017

Clinical NLP has an immense potential in contributing to how clinical practice will be revolutionized by the advent of large scale processing of clinical records. However, this potential has remained largely untapped due to slow progress primarily caused by strict data access policies for researchers. In this paper, we discuss the concern for privacy and the measures it entails. We also suggest sources of less sensitive data. Finally, we draw attention to biases that can compromise the validity of empirical research and lead to socially harmful applications.
Learning Inverse Mapping by Autoencoder based Generative Adversarial Nets
Venue: arXiv cs.LG 2017
Year: 2017

The inverse mapping of GANs'(Generative Adversarial Nets) generator has a great potential value.Hence, some works have been developed to construct the inverse function of generator by directly learning or adversarial learning.While the results are encouraging, the problem is highly challenging and the existing ways of training inverse models of GANs have many disadvantages, such as hard to train or poor performance.Due to these reasons, we propose a new approach based on using inverse generator ($IG$) model as encoder and pre-trained generator ($G$) as decoder of an AutoEncoder network to train the $IG$ model. In the proposed model, the difference between the input and output, which are both the generated image of pre-trained GAN's generator, of AutoEncoder is directly minimized. The optimizing method can overcome the difficulty in training and inverse model of an non one-to-one function.We also applied the inverse model of GANs' generators to image searching and translation.The experimental results prove that the proposed approach works better than the traditional approaches in image searching.
Exploiting Data Reduction Principles in Cloud-Based Data Management for Cryo-Image Data
Venue: arXiv cs.DC 2017
Year: 2017

Cloud computing is a cost-effective way for start-up life sciences laboratories to store and manage their data. However, in many instances the data stored over the cloud could be redundant which makes cloud-based data management inefficient and costly because one has to pay for every byte of data stored over the cloud. Here, we tested efficient management of data generated by an electron cryo microscopy (cryoEM) lab on a cloud-based environment. The test data was obtained from cryoEM repository EMPIAR. All the images were subjected to an in-house parallelized version of principal component analysis. An efficient cloud-based MapReduce modality was used for parallelization. We showed that large data in order of terabytes could be efficiently reduced to its minimal essential self in a cost-effective scalable manner. Furthermore, on-spot instance on Amazon EC2 was shown to reduce costs by a margin of about 27 percent. This approach could be scaled to data of any large volume and type.
Subatomic Proof Systems: Splittable Systems
Venue: arXiv cs.LO 2017
Year: 2017

This paper presents the first in a series of results that allow us to develop a theory providing finer control over the complexity of normalisation, and in particular of cut elimination. By considering atoms as self-dual non-commutative connectives, we are able to classify a vast class of inference rules in a uniform and very simple way. This allows us to define simple conditions that are easily verifiable and that ensure normalisation and cut elimination by way of a general theorem. In this paper we define and consider splittable systems, which essentially comprise a large class of linear logics, including MLL and BV, and we prove for them a splitting theorem, guaranteeing cut elimination and other admissibility results as corollaries. In papers to follow, we will extend this result to non-linear logics. The final outcome will be a comprehensive theory giving a uniform treatment for most existing logics and providing a blueprint for the design of future proof systems.
Planning and Resilient Execution of Policies For Manipulation in Contact with Actuation Uncertainty
Venue: arXiv cs.RO 2017
Year: 2017

We propose a method for planning motion for robots with actuation uncertainty that incorporates contact with the environment and the compliance of the robot to reliably perform manipulation tasks. Our approach consists of two stages: (1) Generating partial policies using a sampling-based motion planner that uses particle-based models of uncertainty and simulation of contact and compliance; and (2) Resilient execution that updates the planned policies to account for unexpected behavior in execution which may arise from model or environment inaccuracy. We have tested our planner and policy execution in simulated SE(2) and SE(3) environments and Baxter robot. We show that our methods efficiently generate policies to perform manipulation tasks involving significant contact and compare against several simpler methods. Additionally, we show that our policy adaptation is resilient to significant changes during execution; e.g. adding a new obstacle to the environment.
What Do Practitioners Vary in Using Scrum?
Venue: arXiv cs.SE 2017
Year: 2017

Background: Agile software development has become a popular way of developing software. Scrum is the most frequently used agile framework, but it is often reported to be adapted in practice. Objective: Thus, we aim to understand how Scrum is adapted in different contexts and what are the reasons for these changes. Method: Using a structured interview guideline, we interviewed ten German companies about their concrete usage of Scrum and analysed the results qualitatively. Results: All companies vary Scrum in some way. The least variations are in the Sprint length, events, team size and requirements engineering. Many users varied the roles, effort estimations and quality assurance. Conclusions: Many variations constitute a substantial deviation from Scrum as initially proposed. For some of these variations, there are good reasons. Sometimes, however, the variations are a result of a previous non-agile, hierarchical organisation.
A Generalized-Impedance Based Stability Criterion for Three-Phase Grid-Connected Voltage Source Converters
Venue: arXiv cs.SY 2017
Year: 2017

The output impedance matrices of three-phase grid-connected voltage source converters (VSCs) are widely used in power system stability analysis. Regardless of how the impedance is modeled, there always exist coupling terms in the impedance matrix, which makes the system a multi-input- multi-output (MIMO) system. Some approximation approaches omit the coupling terms so that a three-phase system can be treated like a single-phase one, and the impedance-based stability criterion for a single-input-single-output (SISO) system is applicable. However, such handling may result in analytical errors or even incorrect conclusions in a mirror frequency coupled system. By introducing the concept of generalized- impedances, this letter proposes a new stability criterion based on a virtual SISO system, which can effectively handle the coupling terms. Further, the effects of the phase-locked-loop (PLL) parameters on system stability are studied based on the proposed criterion. The effectiveness of the proposed criterion is verified by a hardware-in-the-loop (HIL) simulation based on RT-LAB.
Design of Soft Viterbi Algorithm Decoder Enhanced With Non-Transmittable Codewords for Storage Media
Venue: arXiv cs.IT 2017
Year: 2017

Viterbi Algorithm Decoder Enhanced with Non-transmittable Codewords is one of the best decoding algorithm which effectively improves forward error correction performance. HoweverViterbi decoder enhanced with NTCs is not yet designed to work in storage media devices. Currently Reed Solomon (RS) Algorithm is almost the dominant algorithm used in correcting error in storage media. Conversely, recent studies show that there still exist low reliability of data in storage media while the demand for storage media increases drastically. This study proposes a design of the Soft Viterbi Algorithm decoder enhanced with Non-transmittable Codewords (SVAD-NTCs) to be used in storage media for error correction. Matlab simulation was used in this design in order to investigate behavior and effectiveness of SVAD-NTCs in correcting errors in data retrieving from storage media.Sample data of one million bits are randomly generated, Additive White Gaussian Noise (AWGN) was used as data distortion model and Binary Phase- Shift Keying (BPSK) was applied for simulation modulation. Results show that,behaviors of SVAD-NTC performance increase as you increase the NTCs, but beyond 6NTCs there is no significant change and SVAD-NTCs design drastically reduce the total residual error from 216,878 of Reed Solomon to 23,900.
Channel Sensing and Communication over a Time-Correlated Channel with an Energy Harvesting Transmitter
Venue: arXiv cs.IT 2017
Year: 2017

An energy harvesting (EH) transmitter communicating over a time-correlated wireless channel is considered. The transmitter is capable of sensing the current channel state, albeit at the cost of both energy and transmission time. The EH transmitter aims to maximize its long-term throughput by choosing one of the following actions: $i)$ defer its transmission to save energy for future use, $ii)$ transmit reliably at a low rate, $iii)$ transmit at a high rate, and $iv)$ sense the channel to reveal the channel state at a cost of energy and transmission time, and then decide to defer or to transmit. The problem is formulated as a partially observable Markov decision process with a belief on the channel state. The optimal policy is shown to exhibit a threshold behavior on the belief state, with battery-dependent threshold values. The optimal threshold values and performance are characterized numerically via the value iteration algorithm as well as a policy search algorithm that exploits the threshold structure of the optimal policy. Our results demonstrate that, despite the associated time and energy cost, sensing the channel intelligently to track the channel state improves the achievable long-term throughput significantly as compared to the performance of those protocols lacking this ability as well as the one that always senses the channel.
Fleet management for autonomous vehicles: Online PDP under special constraints
Venue: arXiv cs.DM 2017
Year: 2017

The VIPAFLEET project consists in developing models and algorithms for man- aging a fleet of Individual Public Autonomous Vehicles (VIPA). Hereby, we consider a fleet of cars distributed at specified stations in an industrial area to supply internal transportation, where the cars can be used in different modes of circulation (tram mode, elevator mode, taxi mode). One goal is to develop and implement suitable algorithms for each mode in order to satisfy all the requests under an economic point of view by minimizing the total tour length. The innovative idea and challenge of the project is to develop and install a dynamic fleet management system that allows the operator to switch between the different modes within the different periods of the day according to the dynamic transportation demands of the users. We model the underlying online transportation system and propose a correspond- ing fleet management framework, to handle modes, demands and commands. We consider two modes of circulation, tram and elevator mode, propose for each mode appropriate on- line algorithms and evaluate their performance, both in terms of competitive analysis and practical behavior.
Geometric Affordances from a Single Example via the Interaction Tensor
Venue: arXiv cs.CV 2017
Year: 2017

This paper develops and evaluates a new tensor field representation to express the geometric affordance of one object over another. We expand the well known bisector surface representation to one that is weight-driven and that retains the provenance of surface points with directional vectors. We also incorporate the notion of affordance keypoints which allow for faster decisions at a point of query and with a compact and straightforward descriptor. Using a single interaction example, we are able to generalize to previously-unseen scenarios; both synthetic and also real scenes captured with RGBD sensors. We show how our interaction tensor allows for significantly better performance over alternative formulations. Evaluations also include crowdsourcing comparisons that confirm the validity of our affordance proposals, which agree on average 84% of the time with human judgments, and which is 20-40% better than the baseline methods.
Study on Resource Efficiency of Distributed Graph Processing
Venue: arXiv cs.DC 2017
Year: 2017

Graphs may be used to represent many different problem domains -- a concrete example is that of detecting communities in social networks, which are represented as graphs. With big data and more sophisticated applications becoming widespread in recent years, graph processing has seen an emergence of requirements pertaining data volume and volatility. This multidisciplinary study presents a review of relevant distributed graph processing systems. Herein they are presented in groups defined by common traits (distributed processing paradigm, type of graph operations, among others), with an overview of each system's strengths and weaknesses. The set of systems is then narrowed down to a set of two, upon which quantitative analysis was performed. For this quantitative comparison of systems, focus was cast on evaluating the performance of algorithms for the problem of detecting communities. To help further understand the evaluations performed, a background is provided on graph clustering.
Deep Neural Network Optimized to Resistive Memory with Nonlinear Current-Voltage Characteristics
Venue: arXiv cs.ET 2017
Year: 2017

Artificial Neural Network computation relies on intensive vector-matrix multiplications. Recently, the emerging nonvolatile memory (NVM) crossbar array showed a feasibility of implementing such operations with high energy efficiency, thus there are many works on efficiently utilizing emerging NVM crossbar array as analog vector-matrix multiplier. However, its nonlinear I-V characteristics restrain critical design parameters, such as the read voltage and weight range, resulting in substantial accuracy loss. In this paper, instead of optimizing hardware parameters to a given neural network, we propose a methodology of reconstructing a neural network itself optimized to resistive memory crossbar arrays. To verify the validity of the proposed method, we simulated various neural network with MNIST and CIFAR-10 dataset using two different specific Resistive Random Access Memory (RRAM) model. Simulation results show that our proposed neural network produces significantly higher inference accuracies than conventional neural network when the synapse devices have nonlinear I-V characteristics.
BanglaLekha-Isolated: A Comprehensive Bangla Handwritten Character Dataset
Venue: arXiv cs.CL 2017
Year: 2017

Bangla handwriting recognition is becoming a very important issue nowadays. It is potentially a very important task specially for Bangla speaking population of Bangladesh and West Bengal. By keeping that in our mind we are introducing a comprehensive Bangla handwritten character dataset named BanglaLekha-Isolated. This dataset contains Bangla handwritten numerals, basic characters and compound characters. This dataset was collected from multiple geographical location within Bangladesh and includes sample collected from a variety of aged groups. This dataset can also be used for other classification problems i.e: gender, age, district. This is the largest dataset on Bangla handwritten characters yet.
Learning and Trust in Auction Markets
Venue: arXiv cs.GT 2017
Year: 2017

In this paper, we study behavior of bidders in an experimental launch of a new advertising auction platform by Zillow, as Zillow switched from negotiated contracts to using auctions in several geographically isolated markets. A unique feature of this experiment is that the bidders in this market are real estate agents that bid on their own behalf, not using third-party intermediaries. To help bidders, Zillow also provided a recommendation tool that suggested a bid for each bidder. Our main focus in this paper is on the decisions of bidders whether or not to adopt the platform-provided bid recommendation. We observe that a significant proportion of bidders do not use the recommended bid. Using the bid history of the agents we infer their value, and compare the agents' regret with their actual bidding history with results they would have obtained following the recommendation. We find that for half of the agents not following the recommendation, the increased effort of experimenting with alternate bids results in increased regret, i.e., they get decreased net value out of the system. The proportion of agents not following the recommendation slowly declines as markets mature, but it remains large in most markets that we observe. We argue that the main reason for this phenomenon is the lack of trust in the platform-provided tool. Our work provides an empirical insight into possible design choices for auction-based online advertising platforms. While search advertising platforms (such as Google or Bing) allow bidders to submit bids on their own, many display advertising platforms (such as Facebook) optimize bids on bidders' behalf and eliminate the need for bids. Our empirical analysis shows that the latter approach is preferred for markets where bidders are individuals, who don't have access to third party tools, and who may question the fairness of platform-provided suggestions.
A Decision Support System for Communication Network Analysis Based on Hybrid Petri Net Models
Venue: arXiv cs.SY 2017
Year: 2017

It is well known that the complex system operation requires the use of new scientific tools and computer simulation. This paper presents a modular approach for modeling and analysis of the complex systems (in communication or transport systems area) using Hybrid Petri nets. The performance evaluation of the hybrid model is made by a simulation methodology that allows building up various functioning scenarios. A Decision Support System based on the above mentioned methodologies of modeling and analysis will be designed for performance evaluation and time optimization of large scale communication and/or transport systems.
N-gram Language Modeling using Recurrent Neural Network Estimation
Venue: arXiv cs.CL 2017
Year: 2017

We investigate the effective memory depth of RNN models by using them for $n$-gram language model (LM) smoothing. Experiments on a small corpus (UPenn Treebank, one million words of training data and 10k vocabulary) have found the LSTM cell with dropout to be the best model for encoding the $n$-gram state when compared with feed-forward and vanilla RNN models. When preserving the sentence independence assumption the LSTM $n$-gram matches the LSTM LM performance for $n=9$ and slightly outperforms it for $n=13$. When allowing dependencies across sentence boundaries, the LSTM $13$-gram almost matches the perplexity of the unlimited history LSTM LM. LSTM $n$-gram smoothing also has the desirable property of improving with increasing $n$-gram order, unlike the Katz or Kneser-Ney back-off estimators. Using multinomial distributions as targets in training instead of the usual one-hot target is only slightly beneficial for low $n$-gram orders. Experiments on the One Billion Words benchmark show that the results hold at larger scale: while LSTM smoothing for short $n$-gram contexts does not provide significant advantages over classic N-gram models, it becomes effective with long contexts ($n > 5$); depending on the task and amount of data it can match fully recurrent LSTM models at about $n=13$. This may have implications when modeling short-format text, e.g. voice search/query LMs. Building LSTM $n$-gram LMs may be appealing for some practical situations: the state in a $n$-gram LM can be succinctly represented with $(n-1)*4$ bytes storing the identity of the words in the context and batches of $n$-gram contexts can be processed in parallel. On the downside, the $n$-gram context encoding computed by the LSTM is discarded, making the model more expensive than a regular recurrent LSTM LM.
Measurement Results for Millimeter Wave pure LOS MIMO Channels
Venue: arXiv cs.IT 2017
Year: 2017

In this paper we present measurement results for pure line-of-sight MIMO links operating in the millimeter wave range. We show that the estimated condition numbers and capacities of the measured channels are in good agreement with the theory for various transmission distances and antenna setups. Furthermore, the results show that orthogonal channel vectors can be observed if the spacing criterion is fulfilled, thus facilitating spatial multiplexing and achieving high spectral efficiencies even over fairly long distances. Spacings generating ill-conditioned channel matrices show on the other hand significantly reduced performance.