OpenRaiser/Intern-Atlas huggingface dataset:
Automated Guidance of Collective Movement in a Multi-Agent Model of Physarum polycephalum
Venue: arXiv cs.ET 2015
Year: 2015

Collective movement occurs in living systems where the simple movements of individual members of a pop- ulation are combined to generate movement of the collective as a whole, displaying complex dynamics which cannot be found in the component parts themselves. The plasmodium stage of slime mould Physarum polycephalum displays complex amoeboid movement during its foraging and hazard avoidance and its movement can be influenced by the spatial placement of attractant and repellent stimuli. Slime mould is attractive to robotics due to its simple component parts and the distributed nature of its control and locomotion mechanisms. We investigate methods of automated guidance of a multi-agent swarm collective along a pre-defined path to a goal location. We demonstrate a closed-loop feedback mechanism using attractant and repellent stimuli. We find that guidance by repellent stimuli (a light illumination mask) provides faster and more accurate guidance than attractant sources, which exhibit overshooting phenomena at path turns. The method allows traversal of convoluted arenas with challenging obstacles and provides an insight into how unconven- tional computing substrates may be hybridised with classical computing methods to take advantage of the benefits of both approaches.
Efficient Resource Sharing Through GPU Virtualization on Accelerated High Performance Computing Systems
Venue: arXiv cs.DC 2015
Year: 2015

The High Performance Computing (HPC) field is witnessing a widespread adoption of Graphics Processing Units (GPUs) as co-processors for conventional homogeneous clusters. The adoption of prevalent Single- Program Multiple-Data (SPMD) programming paradigm for GPU-based parallel processing brings in the challenge of resource underutilization, with the asymmetrical processor/co-processor distribution. In other words, under SPMD, balanced CPU/GPU distribution is required to ensure full resource utilization. In this paper, we propose a GPU resource virtualization approach to allow underutilized microprocessors to effi- ciently share the GPUs. We propose an efficient GPU sharing scenario achieved through GPU virtualization and analyze the performance potentials through execution models. We further present the implementation details of the virtualization infrastructure, followed by the experimental analyses. The results demonstrate considerable performance gains with GPU virtualization. Furthermore, the proposed solution enables full utilization of asymmetrical resources, through efficient GPU sharing among microprocessors, while incurring low overhead due to the added virtualization layer.
Spoken Language Translation for Polish
Venue: arXiv cs.CL 2015
Year: 2015

Spoken language translation (SLT) is becoming more important in the increasingly globalized world, both from a social and economic point of view. It is one of the major challenges for automatic speech recognition (ASR) and machine translation (MT), driving intense research activities in these areas. While past research in SLT, due to technology limitations, dealt mostly with speech recorded under controlled conditions, today's major challenge is the translation of spoken language as it can be found in real life. Considered application scenarios range from portable translators for tourists, lectures and presentations translation, to broadcast news and shows with live captioning. We would like to present PJIIT's experiences in the SLT gained from the Eu-Bridge 7th framework project and the U-Star consortium activities for the Polish/English language pair. Presented research concentrates on ASR adaptation for Polish (state-of-the-art acoustic models: DBN-BLSTM training, Kaldi: LDA+MLLT+SAT+MMI), language modeling for ASR & MT (text normalization, RNN-based LMs, n-gram model domain interpolation) and statistical translation techniques (hierarchical models, factored translation models, automatic casing and punctuation, comparable and bilingual corpora preparation). While results for the well-defined domains (phrases for travelers, parliament speeches, medical documentation, movie subtitling) are very encouraging, less defined domains (presentation, lectures) still form a challenge. Our progress in the IWSLT TED task (MT only) will be presented, as well as current progress in the Polish ASR.
Pedestrian Detection Inspired by Appearance Constancy and Shape Symmetry
Venue: arXiv cs.CV 2015
Year: 2015

The discrimination and simplicity of features are very important for effective and efficient pedestrian detection. However, most state-of-the-art methods are unable to achieve good tradeoff between accuracy and efficiency. Inspired by some simple inherent attributes of pedestrians (i.e., appearance constancy and shape symmetry), we propose two new types of non-neighboring features (NNF): side-inner difference features (SIDF) and symmetrical similarity features (SSF). SIDF can characterize the difference between the background and pedestrian and the difference between the pedestrian contour and its inner part. SSF can capture the symmetrical similarity of pedestrian shape. However, it's difficult for neighboring features to have such above characterization abilities. Finally, we propose to combine both non-neighboring and neighboring features for pedestrian detection. It's found that non-neighboring features can further decrease the average miss rate by 4.44%. Experimental results on INRIA and Caltech pedestrian datasets demonstrate the effectiveness and efficiency of the proposed method. Compared to the state-of-the-art methods without using CNN, our method achieves the best detection performance on Caltech, outperforming the second best method (i.e., Checkboards) by 1.63%.
Unsupervised Deep Feature Extraction for Remote Sensing Image Classification
Venue: arXiv cs.CV 2015
Year: 2015

This paper introduces the use of single layer and deep convolutional networks for remote sensing data analysis. Direct application to multi- and hyper-spectral imagery of supervised (shallow or deep) convolutional networks is very challenging given the high input data dimensionality and the relatively small amount of available labeled data. Therefore, we propose the use of greedy layer-wise unsupervised pre-training coupled with a highly efficient algorithm for unsupervised learning of sparse features. The algorithm is rooted on sparse representations and enforces both population and lifetime sparsity of the extracted features, simultaneously. We successfully illustrate the expressive power of the extracted representations in several scenarios: classification of aerial scenes, as well as land-use classification in very high resolution (VHR), or land-cover classification from multi- and hyper-spectral images. The proposed algorithm clearly outperforms standard Principal Component Analysis (PCA) and its kernel counterpart (kPCA), as well as current state-of-the-art algorithms of aerial classification, while being extremely computationally efficient at learning representations of data. Results show that single layer convolutional networks can extract powerful discriminative features only when the receptive field accounts for neighboring pixels, and are preferred when the classification requires high resolution and detailed results. However, deep architectures significantly outperform single layers variants, capturing increasing levels of abstraction and complexity throughout the feature hierarchy.
moGrams: a network-based methodology for visualizing the set of non-dominated solutions in multiobjective optimization
Venue: arXiv cs.OH 2015
Year: 2015

An appropriate visualization of multiobjective non-dominated solutions is a valuable asset for decision making. Although there are methods for visualizing the solutions in the design space, they do not provide any information about their relationship. In this work, we propose a novel methodology that allows the visualization of the non-dominated solutions in the design space and their relationships by means of a network. The nodes represent the solutions in the objective space, while the edges show the relationships between the solutions in the design space. Our proposal (called moGrams) thus provides a joint visualization of both objective and design spaces. It aims at helping the decision maker to get more understanding of the problem so that (s)he can choose the more appropriate final solution. moGrams can be applied to any multicriteria problem in which the solutions are related by a similarity metric. Besides, the decision maker interaction is facilitated by modifying the network based on the current preferences to obtain a clearer view. An exhaustive experimental study is performed using three multiobjective problems in order to show both the usefulness and versatility of moGrams. The results exhibit interesting characteristics of our methodology for visualizing and analyzing solutions of multiobjective problems.
Welfare of Sequential Allocation Mechanisms for Indivisible Goods
Venue: arXiv cs.AI 2015
Year: 2015

Sequential allocation is a simple and attractive mechanism for the allocation of indivisible goods. Agents take turns, according to a policy, to pick items. Sequential allocation is guaranteed to return an allocation which is efficient but may not have an optimal social welfare. We consider therefore the relation between welfare and efficiency. We study the (computational) questions of what welfare is possible or necessary depending on the choice of policy. We also consider a novel control problem in which the chair chooses a policy to improve social welfare.
Cross-layer Chase Combining with Selective Retransmission, Analysis and Throughput Optimization for OFDM Systems
Venue: arXiv cs.IT 2015
Year: 2015

In this paper, we present bandwidth efficient retransmission method employong selective retransmission approach at modulation layer under orthogonal frequency division multiplexing (OFDM) signaling. Our proposed cross-layer design embeds a selective retransmission sublayer in physical layer (PHY) that targets retransmission of information symbols transmitted over poor quality OFDM sub-carriers. Most of the times, few errors in decoded bit stream result in packet failure at medium access control (MAC) layer. The unnecessary retransmission of good quality information symbols of a failed packet has detrimental effect on overall throughput of transceiver. We propose a cross-layer Chase combining with selective retransmission (CCSR) method by blending Chase combining at MAC layer and selective retransmission in PHY. The selective retransmission in PHY targets the poor quality information symbols prior to decoding, which results into lower hybrid automatic repeat reQuest (HARQ) retransmissions at MAC layer. We also present tight bit-error rate (BER) upper bound and tight throughput lower bound for CCSR method. In order to maximize throughput of the proposed method, we formulate optimization problem with respect to the amount of information to be retransmitted in selective retransmission. The simulation results demonstrate significant throughput gain of the proposed CCSR method as compared to conventional Chase combining method.
Sic Transit Gloria Manuscriptum: Two Views of the Aggregate Fate of Ancient Papers
Venue: arXiv cs.DL 2015
Year: 2015

When PageRank began to be used for ranking in Web search, a concern soon arose that older pages have an inherent --- and potentially unfair --- advantage over emerging pages of high quality, because they have had more time to acquire hyperlink citations. Algorithms were then proposed to compensate for this effect. Curiously, in bibliometry, the opposite concern has often been raised: that a growing body of recent papers crowds out older papers, resulting in a collective amnesia in research communities, which potentially leads to reinventions, redundancies, and missed opportunities to connect ideas. A recent paper by Verstak et al. reported experiments on Google Scholar data, which seemed to refute the amnesia, or aging, hypothesis. They claimed that more recently written papers have a larger fraction of outbound citations targeting papers that are older by a fixed number of years, indicating that ancient papers are alive and well-loved and increasingly easily found, thanks in part to Google Scholar. In this paper we show that the full picture is considerably more nuanced. Specifically, the fate of a fixed sample of papers, as they age, is rather different from what Verstak et al.'s study suggests: there is clear and steady abandonment in favor of citations to newer papers. The two apparently contradictory views are reconciled by the realization that, as time passes, the number of papers older than a fixed number of years grows rapidly.
Value of Information Aware Opportunistic Duty Cycling in Solar Harvesting Sensor Networks
Venue: arXiv cs.NI 2015
Year: 2015

The energy-harvested Wireless Sensor Networks (WSNs) may operate perpetually with the extra energy supply from ambient natural energy, such as solar energy. Nevertheless, the harvested energy is still limited so it's not able to support the perpetual network operation with full duty cycle. To achieve the perpetual network operation and process the data with high importance, measured by Value of Information (VoI), the network has to operate under partial duty cycle and to improve the efficiency to consume the harvested energy. The challenging problem is how to deal with the stochastic feature of the natural energy and the variable data VoI. We consider the energy consumption during storing and the diversity of the data process including sampling, transmitting and receiving, which consume different power levels. The problem is then mapped as the budget-dynamic Multi-Arm Bandit (MAB) problem by treating the energy as the budget and the data process as arm pulling. This paper proposes an Opportunistic Duty Cycling (ODC) scheme to improve the energy efficiency while satisfying the perpetual network operation. ODC chooses the proper opportunities to store the harvested energy or to spend it on the data process based on the historical information of the energy harvesting and the VoI of the processed data. With this scheme, each sensor node need only estimate the ambient natural energy in short term so as to reduce the computation and the storage for the historical information. It also can distributively adjust its own duty cycle according to its local historical information. This paper also conducts the extensive analysis on the performance of our scheme ODC, and the theoretical results validate the regret, which is the difference between the optimal scheme and ours. Our experimental results also manifest the promising performance of ODC.
On the use of BGP communities for fine-grained inbound traffic engineering
Venue: arXiv cs.NI 2015
Year: 2015

In the context of Border Gateway Protocol (BGP), inbound inter-domain traffic engineering (TE) remains a difficult problem without panacea. Each of previously investigated method solves a part of the problem. In this study, we try to complement the map by exploring the use of BGP communities. With BGP community based polices enabled in transit provider networks, we are able to manipulate incoming traffic for stub Autonomous System (AS) in a finer granularity than known techniques by customizing the AS-paths perceived by remote networks. We analyze the constraints using this technique, along with its effectiveness and granularity.
Energy-Efficient User Association with Open Loop Power Control for Uplink Heterogeneous Cellular Networks
Venue: arXiv cs.IT 2015
Year: 2015

Energy reduction for wireless systems becomes more and more important due to its impact on the operation cost and global carbon footprint. In this paper, we investigate three kinds of energy-efficient association schemes under open loop power control for uplink heterogeneous cellular networks, which are formulated as a whole energy efficiency maximization problem, a sum energy efficiency maximization problem and a utility maximization problem respectively. The third case takes account of load balancing level and user's fairness in the energy-efficient association. Considering that the first problem is in a fractional mixed-integer form, we introduce an energy efficiency parameter to convert it into a parametric subtractive form, and then design an effective iterative algorithm to achieve the optimal solutions. As for the third problem, we first introduce a dual variable to decouple the constraint and then develop a distributed algorithm using dual decomposition. In addition, we also give the convergence proof for the proposed algorithms. In order to confirm the effectiveness of energy-efficient user association algorithms, we introduce other association rules for comparison, and investigate the influences of different parameters on the association performance of these association rules.
On Basic Properties of Jumping Finite Automata
Venue: arXiv cs.FL 2015
Year: 2015

We complete the initial study of jumping finite automata, which was started in a former article of Meduna and Zemek \citep{athMED1}. The open questions about basic closure properties are solved. Besides this, we correct erroneous results presented in the article. Finally, we point out important relations between jumping finite automata and some other models studied in the literature.
OntoSeg: a Novel Approach to Text Segmentation using Ontological Similarity
Venue: arXiv cs.CL 2015
Year: 2015

Text segmentation (TS) aims at dividing long text into coherent segments which reflect the subtopic structure of the text. It is beneficial to many natural language processing tasks, such as Information Retrieval (IR) and document summarisation. Current approaches to text segmentation are similar in that they all use word-frequency metrics to measure the similarity between two regions of text, so that a document is segmented based on the lexical cohesion between its words. Various NLP tasks are now moving towards the semantic web and ontologies, such as ontology-based IR systems, to capture the conceptualizations associated with user needs and contents. Text segmentation based on lexical cohesion between words is hence not sufficient anymore for such tasks. This paper proposes OntoSeg, a novel approach to text segmentation based on the ontological similarity between text blocks. The proposed method uses ontological similarity to explore conceptual relations between text segments and a Hierarchical Agglomerative Clustering (HAC) algorithm to represent the text as a tree-like hierarchy that is conceptually structured. The rich structure of the created tree further allows the segmentation of text in a linear fashion at various levels of granularity. The proposed method was evaluated on a wellknown dataset, and the results show that using ontological similarity in text segmentation is very promising. Also we enhance the proposed method by combining ontological similarity with lexical similarity and the results show an enhancement of the segmentation quality.
An analysis of the factors affecting keypoint stability in scale-space
Venue: arXiv cs.CV 2015
Year: 2015

The most popular image matching algorithm SIFT, introduced by D. Lowe a decade ago, has proven to be sufficiently scale invariant to be used in numerous applications. In practice, however, scale invariance may be weakened by various sources of error inherent to the SIFT implementation affecting the stability and accuracy of keypoint detection. The density of the sampling of the Gaussian scale-space and the level of blur in the input image are two of these sources. This article presents a numerical analysis of their impact on the extracted keypoints stability. Such an analysis has both methodological and practical implications, on how to compare feature detectors and on how to improve SIFT. We show that even with a significantly oversampled scale-space numerical errors prevent from achieving perfect stability. Usual strategies to filter out unstable detections are shown to be inefficient. We also prove that the effect of the error in the assumption on the initial blur is asymmetric and that the method is strongly degraded in presence of aliasing or without a correct assumption on the camera blur.
Bayesian Network Models for Adaptive Testing
Venue: arXiv cs.AI 2015
Year: 2015

Computerized adaptive testing (CAT) is an interesting and promising approach to testing human abilities. In our research we use Bayesian networks to create a model of tested humans. We collected data from paper tests performed with grammar school students. In this article we first provide the summary of data used for our experiments. We propose several different Bayesian networks, which we tested and compared by cross-validation. Interesting results were obtained and are discussed in the paper. The analysis has brought a clearer view on the model selection problem. Future research is outlined in the concluding part of the paper.
A C-LSTM Neural Network for Text Classification
Venue: arXiv cs.CL 2015
Year: 2015

Neural network models have been demonstrated to be capable of achieving remarkable performance in sentence and document modeling. Convolutional neural network (CNN) and recurrent neural network (RNN) are two mainstream architectures for such modeling tasks, which adopt totally different ways of understanding natural languages. In this work, we combine the strengths of both architectures and propose a novel and unified model called C-LSTM for sentence representation and text classification. C-LSTM utilizes CNN to extract a sequence of higher-level phrase representations, and are fed into a long short-term memory recurrent neural network (LSTM) to obtain the sentence representation. C-LSTM is able to capture both local features of phrases as well as global and temporal sentence semantics. We evaluate the proposed architecture on sentiment classification and question classification tasks. The experimental results show that the C-LSTM outperforms both CNN and LSTM and can achieve excellent performance on these tasks.
Bandwidth and Wavefront Reduction for Static Variable Ordering in Symbolic Model Checking
Venue: arXiv cs.SE 2015
Year: 2015

We demonstrate the applicability of bandwidth and wavefront reduction algorithms to static variable ordering. In symbolic model checking event locality plays a major role in time and memory usage. For example, in Petri nets event locality can be captured by dependency matrices, where nonzero entries indicate whether a transition modifies a place. The quality of event locality has been expressed as a metric called (weighted) event span. The bandwidth of a matrix is a metric indicating the distance of nonzero elements to the diagonal. Wavefront is a metric indicating the degree of nonzeros on one end of the diagonal of the matrix. Bandwidth and wavefront are well studied metrics used in sparse matrix solvers. In this work we prove that span is limited by twice the bandwidth of a matrix. This observation makes bandwidth reduction algorithms useful for obtaining good variable orders. One major issue we address is that the reduction algorithms can only be applied on symmetric matrices, while the dependency matrices are asymmetric. We show that the Sloan algorithm executed on the total graph of the adjacency graph gives the best variable orders. Practically, we demonstrate that our work allows to call standard sparse matrix operations in Boost and ViennaCL, computing very good static variable orders in milliseconds. Future work is promising, because a whole new spectrum of more off-the-shelf algorithms, including metaheuristic ones, become available for variable ordering.