OpenRaiser/Intern-Atlas huggingface dataset:
Robust Energy Management for Green and Survivable IP Networks
Venue: arXiv cs.NI 2014
Year: 2014

Despite the growing necessity to make Internet greener, it is worth pointing out that energy-aware strategies to minimize network energy consumption must not undermine the normal network operation. In particular, two very important issues that may limit the application of green networking techniques concern, respectively, network survivability, i.e. the network capability to react to device failures, and robustness to traffic variations. We propose novel modelling techniques to minimize the daily energy consumption of IP networks, while explicitly guaranteeing, in addition to typical QoS requirements, both network survivability and robustness to traffic variations. The impact of such limitations on final network consumption is exhaustively investigated. Daily traffic variations are modelled by dividing a single day into multiple time intervals (multi-period problem), and network consumption is reduced by putting to sleep idle line cards and chassis. To preserve network resiliency we consider two different protection schemes, i.e. dedicated and shared protection, according to which a backup path is assigned to each demand and a certain amount of spare capacity has to be available on each link. Robustness to traffic variations is provided by means of a specific modelling framework that allows to tune the conservatism degree of the solutions and to take into account load variations of different magnitude. Furthermore, we impose some inter-period constraints necessary to guarantee network stability and preserve the device lifetime. Both exact and heuristic methods are proposed. Experimentations carried out with realistic networks operated with flow-based routing protocols (i.e. MPLS) show that significant savings, up to 30%, can be achieved also when both survivability and robustness are fully guaranteed.
On the Real-time Prediction Problems of Bursting Hashtags in Twitter
Venue: arXiv cs.SI 2014
Year: 2014

Hundreds of thousands of hashtags are generated every day on Twitter. Only a few become bursting topics. Among the few, only some can be predicted in real-time. In this paper, we take the initiative to conduct a systematic study of a series of challenging real-time prediction problems of bursting hashtags. Which hashtags will become bursting? If they do, when will the burst happen? How long will they remain active? And how soon will they fade away? Based on empirical analysis of real data from Twitter, we provide insightful statistics to answer these questions, which span over the entire lifecycles of hashtags.
Upper Bounds on the Minimum Distance of Quasi-Cyclic LDPC codes Revisited
Venue: arXiv cs.IT 2014
Year: 2014

Two upper bounds on the minimum distance of type-1 quasi-cyclic low-density parity-check (QC LDPC) codes are derived. The necessary condition is given for the minimum code distance of such codes to grow linearly with the code length.
High speed data retrieval from national data center (ndc) reducing time and ignoring spelling error in search key based on double metaphone algorithm
Venue: arXiv cs.DB 2014
Year: 2014

Fast and efficient data management is one of the demanding technologies of todays aspect. This paper proposes a system which makes the working procedures of present manual system of storing and retrieving huge citizens information of Bangladesh automated and increases its effectiveness. The implemented search methodology is user friendly and efficient enough for high speed data retrieval ignoring spelling error in the input keywords used for searching a particular citizen. The main concern in this research is minimizing the total searching time for a given keyword. This can be done if we can pre-establish the idea of getting the data belonging to the searching keyword. The primary and secondary key-code generated by the Double Metaphone Algorithm for each word is used to establish that idea about the word. This algorithm is used for creating the map of the original database, through which the keyword is matched against the data.
Extension of Sparse Randomized Kaczmarz Algorithm for Multiple Measurement Vectors
Venue: arXiv cs.NA 2014
Year: 2014

The Kaczmarz algorithm is popular for iteratively solving an overdetermined system of linear equations. The traditional Kaczmarz algorithm can approximate the solution in few sweeps through the equations but a randomized version of the Kaczmarz algorithm was shown to converge exponentially and independent of number of equations. Recently an algorithm for finding sparse solution to a linear system of equations has been proposed based on weighted randomized Kaczmarz algorithm. These algorithms solves single measurement vector problem; however there are applications were multiple-measurements are available. In this work, the objective is to solve a multiple measurement vector problem with common sparse support by modifying the randomized Kaczmarz algorithm. We have also modeled the problem of face recognition from video as the multiple measurement vector problem and solved using our proposed technique. We have compared the proposed algorithm with state-of-art spectral projected gradient algorithm for multiple measurement vectors on both real and synthetic datasets. The Monte Carlo simulations confirms that our proposed algorithm have better recovery and convergence rate than the MMV version of spectral projected gradient algorithm under fairness constraints.
An Elias Bound on the Bhattacharyya Distance of Codes for Channels with a Zero-Error Capacity
Venue: arXiv cs.IT 2014
Year: 2014

In this paper, we propose an upper bound on the minimum Bhattacharyya distance of codes for channels with a zero-error capacity. The bound is obtained by combining an extension of the Elias bound introduced by Blahut, with an extension of a bound previously introduced by the author, which builds upon ideas of Gallager, Lovász and Marton.
STIMONT: A core ontology for multimedia stimuli description
Venue: arXiv cs.MM 2014
Year: 2014

Affective multimedia documents such as images, sounds or videos elicit emotional responses in exposed human subjects. These stimuli are stored in affective multimedia databases and successfully used for a wide variety of research in psychology and neuroscience in areas related to attention and emotion processing. Although important all affective multimedia databases have numerous deficiencies which impair their applicability. These problems, which are brought forward in the paper, result in low recall and precision of multimedia stimuli retrieval which makes creating emotion elicitation procedures difficult and labor-intensive. To address these issues a new core ontology STIMONT is introduced. The STIMONT is written in OWL-DL formalism and extends W3C EmotionML format with an expressive and formal representation of affective concepts, high-level semantics, stimuli document metadata and the elicited physiology. The advantages of ontology in description of affective multimedia stimuli are demonstrated in a document retrieval experiment and compared against contemporary keyword-based querying methods. Also, a software tool Intelligent Stimulus Generator for retrieval of affective multimedia and construction of stimuli sequences is presented.
An intuitionistic version of Ramsey Theorem (italian version)
Venue: arXiv cs.LO 2014
Year: 2014

Ramsey Theorem [6] for pairs is intuitionistically but not classically provable: it is equivalent to a subclassical principle [2]. In this note we show that Ramsey may be restated in an intuitionistically provable form, which is informative (or at least without negations), and classically equivalent to the original. With respect to previous works of the same kind, we do not use no counterexample as in [1], [5], nor we add a new principle to the intuitionism as in [4]. We claim that this intuitionistic version of Ramsey could be use to replace Ramsey Theorem in the convergence proof of programs included in [3]. [1] Gianluigi Bellin. Ramsey interpreted: a parametric version of Ramsey Theorem. In AMS, editor, Logic and Computation: Proceedings of a Symposium held at Carnegie Mellon University, volume 106. [2] Stefano Berardi, Silvia Steila, Ramsey Theorem for pairs as a classical principle in Intuitionistic Arithmetic, Submitted to the proceedings of Types 2013 in Toulouse. [3] Byron Cook, Abigail See, Florian Zuleger, Ramsey vs. Lexicographic Termination Proving, LNCS 7795, 2013, Springer Berlin Heidelberg. [4] Thierry Coquand. A direct proof of Ramsey Theorem. [5] Paulo Oliva and Thomas Powell. A Constructive Interpretation of Ramsey Theorem via the Product of Selection Functions. CoRR, arXiv:1204.5631, 2012. [6] F. P. Ramsey. On a problem in formal logic. Proc. London Math. Soc., 1930.
Dictionary-Based Concept Mining: An Application for Turkish
Venue: arXiv cs.CL 2014
Year: 2014

In this study, a dictionary-based method is used to extract expressive concepts from documents. So far, there have been many studies concerning concept mining in English, but this area of study for Turkish, an agglutinative language, is still immature. We used dictionary instead of WordNet, a lexical database grouping words into synsets that is widely used for concept extraction. The dictionaries are rarely used in the domain of concept mining, but taking into account that dictionary entries have synonyms, hypernyms, hyponyms and other relationships in their meaning texts, the success rate has been high for determining concepts. This concept extraction method is implemented on documents, that are collected from different corpora.
On a Duality Between Recoverable Distributed Storage and Index Coding
Venue: arXiv cs.IT 2014
Year: 2014

In this paper, we introduce a model of a single-failure locally recoverable distributed storage system. This model appears to give rise to a problem seemingly dual of the well-studied index coding problem. The relation between the dimensions of an optimal index code and optimal distributed storage code of our model has been established in this paper. We also show some extensions to vector codes.
A parameterless scale-space approach to find meaningful modes in histograms - Application to image and spectrum segmentation
Venue: arXiv cs.CV 2014
Year: 2014

In this paper, we present an algorithm to automatically detect meaningful modes in a histogram. The proposed method is based on the behavior of local minima in a scale-space representation. We show that the detection of such meaningful modes is equivalent in a two classes clustering problem on the length of minima scale-space curves. The algorithm is easy to implement, fast, and does not require any parameters. We present several results on histogram and spectrum segmentation, grayscale image segmentation and color image reduction.
Clearing Markets via Bundles
Venue: arXiv cs.GT 2014
Year: 2014

We study algorithms for combinatorial market design problems, where a set of heterogeneous and indivisible objects are priced and sold to potential buyers subject to equilibrium constraints. Extending the CWE notion introduced by Feldman et al. [STOC 2013], we introduce the concept of a Market-Clearing Combinatorial Walrasian Equilibium (MC-CWE) as a natural relaxation of the classical Walrasian equilibrium (WE) solution concept. The only difference between a MC-CWE and a WE is the ability for the seller to bundle the items prior to sale. This innocuous and natural bundling operation imposes a plethora of algorithmic and economic challenges and opportunities. Unlike WE, which is guaranteed to exist only for (gross) substitutes valuations, a MC-CWE always exists. The main algorithmic challenge, therefore, is to design computationally efficient mechanisms that generate MC-CWE outcomes that approximately maximize social welfare. For a variety of valuation classes encompassing substitutes and complements (including super-additive, single-minded and budget-additive valuations), we design polynomial-time MC-CWE mechanisms that provide tight welfare approximation results.
Hardware Implementation of four byte per clock RC4 algorithm
Venue: arXiv cs.AR 2014
Year: 2014

In the field of cryptography till date the 2-byte in 1-clock is the best known RC4 hardware design [1], while 1-byte in 1-clock [2], and the 1-byte in 3 clocks [3][4] are the best known implementation. The design algorithm in[2] considers two consecutive bytes together and processes them in 2 clocks. The design [1] is a pipelining architecture of [2]. The design of 1-byte in 3-clocks is too much modular and clock hungry. In this paper considering the RC4 algorithm, as it is, a simpler RC4 hardware design providing higher throughput is proposed in which 6 different architecture has been proposed. In design 1, 1-byte is processed in 1-clock, design 2 is a dynamic KSA-PRGA architecture of Design 1. Design 3 can process 2 byte in a single clock, where as Design 4 is Dynamic KSA-PRGA architecture of Design 3. Design 5 and Design 6 are parallelization architecture design 2 and design 4 which can compute 4 byte in a single clock. The maturity in terms of throughput, power consumption and resource usage, has been achieved from design 1 to design 6. The RC4 encryption and decryption designs are respectively embedded on two FPGA boards as co-processor hardware, the communication between the two boards performed using Ethernet.
What is the effect of country-specific characteristics on the research performance of scientific institutions? Using multi-level statistical models to rank and map universities and research-focused institutions worldwide
Venue: arXiv cs.DL 2014
Year: 2014

Bornmann, Stefaner, de Moya Anegon, and Mutz (in press) have introduced a web application (www.excellencemapping.net) which is linked to both academic ranking lists published hitherto (e.g. the Academic Ranking of World Universities) as well as spatial visualization approaches. The web application visualizes institutional performance within specific subject areas as ranking lists and on custom tile-based maps. The new, substantially enhanced version of the web application and the multilevel logistic regression on which it is based are described in this paper. Scopus data were used which have been collected for the SCImago Institutions Ranking. Only those universities and research-focused institutions are considered that have published at least 500 articles, reviews and conference papers in the period 2006 to 2010 in a certain Scopus subject area. In the enhanced version, the effect of single covariates (such as the per capita GDP of a country in which an institution is located) on two performance metrics (best paper rate and best journal rate) is examined and visualized. A covariate-adjusted ranking and mapping of the institutions is produced in which the single covariates are held constant. The results on the performance of institutions can then be interpreted as if the institutions all had the same value (reference point) for the covariate in question. For example, those institutions can be identified worldwide showing a very good performance despite a bad financial situation in the corresponding country.
A Leapfrog Strategy for Pursuit-Evasion in a Polygonal Environment
Venue: arXiv cs.CG 2014
Year: 2014

We study pursuit-evasion in a polygonal environment with polygonal obstacles. In this turn based game, an evader $e$ is chased by pursuers $p_1, p_2, ..., p_{\ell}$. The players have full information about the environment and the location of the other players. The pursuers are allowed to coordinate their actions. On the pursuer turn, each $p_i$ can move to any point at distance at most 1 from his current location. On the evader turn, he moves similarly. The pursuers win if some pursuer becomes co-located with the evader in finite time. The evader wins if he can evade capture forever. It is known that one pursuer can capture the evader in any simply-connected polygonal environment, and that three pursuers are always sufficient in any polygonal environment (possibly with polygonal obstacles). We contribute two new results to this field. First, we fully characterize when an environment with a single obstacles is one-pursuer-win or two-pursuer-win. Second, we give sufficient (but not necessary) conditions for an environment to have a winning strategy for two pursuers. Such environments can be swept by a \emph{leapfrog strategy} in which the two cops alternately guard/increase the currently controlled area. The running time of this algorithm is $O(n \cdot h \cdot {diam}(P))$ where $n$ is the number of vertices, $h$ is the number of obstacles and ${diam}(P)$ is the diameter of $P$. More concretely, for an environment with $n$ vertices, we describe an $O(n^2)$ algorithm that (1) determines whether the obstacles are well-separated, and if so, (2) constructs the required partition for a leapfrog strategy.
Investigating Cellular Automata Based Network Intrusion Detection System For Fixed Networks (NIDWCA)
Venue: arXiv cs.NI 2014
Year: 2014

Network Intrusion Detection Systems (NIDS) are computer systems which monitor a network with the aim of discerning malicious from benign activity on that network. With the recent growth of the Internet such security limitations are becoming more and more pressing. Most of the current network intrusion detection systems relay on labeled training data. An Unsupervised CA based anomaly detection technique that was trained with unlabelled data is capable of detecting previously unseen attacks. This new approach, based on the Cellular Automata classifier (CAC) with Genetic Algorithms (GA), is used to classify program behavior as normal or intrusive. Parameters and evolution process for CAC with GA are discussed in detail. This implementation considers both temporal and spatial information of network connections in encoding the network connection information into rules in NIDS. Preliminary experiments with KDD Cup data set show that the CAC classifier with Genetic Algorithms can effectively detect intrusive attacks and achieve a low false positive rate. Training a NIDWCA (Network Intrusion Detection with Cellular Automata) classifier takes significantly shorter time than any other conventional techniques.
Use Case Point Approach Based Software Effort Estimation using Various Support Vector Regression Kernel Methods
Venue: arXiv cs.SE 2014
Year: 2014

The job of software effort estimation is a critical one in the early stages of the software development life cycle when the details of requirements are usually not clearly identified. Various optimization techniques help in improving the accuracy of effort estimation. The Support Vector Regression (SVR) is one of several different soft-computing techniques that help in getting optimal estimated values. The idea of SVR is based upon the computation of a linear regression function in a high dimensional feature space where the input data are mapped via a nonlinear function. Further, the SVR kernel methods can be applied in transforming the input data and then based on these transformations, an optimal boundary between the possible outputs can be obtained. The main objective of the research work carried out in this paper is to estimate the software effort using use case point approach. The use case point approach relies on the use case diagram to estimate the size and effort of software projects. Then, an attempt has been made to optimize the results obtained from use case point analysis using various SVR kernel methods to achieve better prediction accuracy.
Secret Message Transmission by HARQ with Multiple Encoding
Venue: arXiv cs.CR 2014
Year: 2014

Secure transmission between two agents, Alice and Bob, over block fading channels can be achieved similarly to conventional hybrid automatic repeat request (HARQ) by letting Alice transmit multiple blocks, each containing an encoded version of the secret message, until Bob informs Alice about successful decoding by a public error-free return channel. In existing literature each block is a differently punctured version of a single codeword generated with a Wyner code that uses a common randomness for all blocks. In this paper instead we propose a more general approach where multiple codewords are generated from independent randomnesses. The class of channels for which decodability and secrecy is ensured is characterized, with derivations for the existence of secret codes. We show in particular that the classes are not a trivial subset (or superset) of those of existing schemes, thus highlighting the novelty of the proposed solution. The result is further confirmed by deriving the average achievable secrecy throughput, thus taking into account both decoding and secrecy outage.
A Boosting Approach to Learning Graph Representations
Venue: arXiv cs.LG 2014
Year: 2014

Learning the right graph representation from noisy, multisource data has garnered significant interest in recent years. A central tenet of this problem is relational learning. Here the objective is to incorporate the partial information each data source gives us in a way that captures the true underlying relationships. To address this challenge, we present a general, boosting-inspired framework for combining weak evidence of entity associations into a robust similarity metric. We explore the extent to which different quality measurements yield graph representations that are suitable for community detection. We then present empirical results on both synthetic and real datasets demonstrating the utility of this framework. Our framework leads to suitable global graph representations from quality measurements local to each edge. Finally, we discuss future extensions and theoretical considerations of learning useful graph representations from weak feedback in general application settings.
Advanced Self-interference Cancellation and Multiantenna Techniques for Full-Duplex Radios
Venue: arXiv cs.OH 2014
Year: 2014

In an in-band full-duplex system, radios transmit and receive simultaneously in the same frequency band at the same time, providing a radical improvement in spectral efficiency over a half-duplex system. However, in order to design such a system, it is necessary to mitigate the self-interference due to simultaneous transmission and reception, which seriously limits the maximum transmit power of the full-duplex device. Especially, large differences in power levels in the receiver front-end sets stringent requirements for the linearity of the transceiver electronics. We present an advanced architecture for a compact full-duplex multiantenna transceiver combining antenna design with analog and digital cancellation, including both linear and nonlinear signal processing.
Back-pressure traffic signal control with unknown routing rates
Venue: arXiv cs.SY 2014
Year: 2014

The control of a network of signalized intersections is considered. Previous works proposed a feedback control belonging to the family of the so-called back-pressure controls that ensures provably maximum stability given pre-specified routing probabilities. However, this optimal back-pressure controller (BP*) requires routing rates and a measure of the number of vehicles queuing at a node for each possible routing decision. It is an idealistic assumption for our application since vehicles (going straight, turning left/right) are all gathered in the same lane apart from the proximity of the intersection and cameras can only give estimations of the aggregated queue length. In this paper, we present a back-pressure traffic signal controller (BP) that does not require routing rates, it requires only aggregated queue lengths estimation (without direction information) and loop detectors at the stop line for each possible direction. A theoretical result on the Lyapunov drift in heavy load conditions under BP control is provided and tends to indicate that BP should have good stability properties. Simulations confirm this and show that BP stabilizes the queuing network in a significant part of the capacity region.