OpenRaiser/Intern-Atlas huggingface dataset:
Lifting $\ell_1$-optimization strong and sectional thresholds
Venue: arXiv cs.IT 2013
Year: 2013

In this paper we revisit under-determined linear systems of equations with sparse solutions. As is well known, these systems are among core mathematical problems of a very popular compressed sensing field. The popularity of the field as well as a substantial academic interest in linear systems with sparse solutions are in a significant part due to seminal results \cite{CRT,DonohoPol}. Namely, working in a statistical scenario, \cite{CRT,DonohoPol} provided substantial mathematical progress in characterizing relation between the dimensions of the systems and the sparsity of unknown vectors recoverable through a particular polynomial technique called $\ell_1$-minimization. In our own series of work \cite{StojnicCSetam09,StojnicUpper10,StojnicEquiv10} we also provided a collection of mathematical results related to these problems. While, Donoho's work \cite{DonohoPol,DonohoUnsigned} established (and our own work \cite{StojnicCSetam09,StojnicUpper10,StojnicEquiv10} reaffirmed) the typical or the so-called \emph{weak threshold} behavior of $\ell_1$-minimization many important questions remain unanswered. Among the most important ones are those that relate to non-typical or the so-called \emph{strong threshold} behavior. These questions are usually combinatorial in nature and known techniques come up short of providing the exact answers. In this paper we provide a powerful mechanism that that can be used to attack the "tough" scenario, i.e. the \emph{strong threshold} (and its a similar form called \emph{sectional threshold}) of $\ell_1$-minimization.
The revised SNIP indicator of Elsevier's Scopus
Venue: arXiv cs.DL 2013
Year: 2013

The modified SNIP indicator of Elsevier, as recently explained by Waltman et al. (2013) in this journal, solves some of the problems which Leydesdorff & Opthof (2010 and 2011) indicated in relation to the original SNIP indicator (Moed, 2010 and 2011). The use of an arithmetic average, however, remains unfortunate in the case of scientometric distributions because these can be extremely skewed (Seglen, 1992 and 1997). The new indicator cannot (or hardly) be reproduced independently when used for evaluation purposes, and remains in this sense opaque from the perspective of evaluated units and scholars.
Analysis of Multi-Cell Downlink Cooperation with a Constrained Spatial Model
Venue: arXiv cs.IT 2013
Year: 2013

Multi-cell cooperation (MCC) mitigates intercell interference and improves throughput at the cell edge. This paper considers a cooperative downlink, whereby cell-edge mobiles are served by multiple cooperative base stations. The cooperating base stations transmit identical signals over paths with non-identical path losses, and the receiving mobile performs diversity combining. The analysis in this paper is driven by a new expression for the conditional outage probability when signals arriving over different paths are combined in the presence of noise and interference, where the conditioning is with respect to the network topology and shadowing. The channel model accounts for path loss, shadowing, and Nakagami fading, and the Nakagami fading parameters do not need to be identical for all paths. To study performance over a wide class of network topologies, a random spatial model is adopted, and performance is found by statistically characterizing the rates provided on the downlinks. To model realistic networks, the model requires a minimum separation among base stations. Having adopted a realistic model and an accurate analysis, the paper proceeds to determine performance under several resource-allocation policies and provides insight regarding how the cell edge should be defined.
Fast branching algorithm for Cluster Vertex Deletion
Venue: arXiv cs.DS 2013
Year: 2013

In the family of clustering problems, we are given a set of objects (vertices of the graph), together with some observed pairwise similarities (edges). The goal is to identify clusters of similar objects by slightly modifying the graph to obtain a cluster graph (disjoint union of cliques). Hueffner et al. [Theory Comput. Syst. 2010] initiated the parameterized study of Cluster Vertex Deletion, where the allowed modification is vertex deletion, and presented an elegant O(2^k * k^9 + n * m)-time fixed-parameter algorithm, parameterized by the solution size. In our work, we pick up this line of research and present an O(1.9102^k * (n + m))-time branching algorithm.
Designing an Efficient Delay Sensitive Routing Metric for IEEE 802.16 Mesh Networks
Venue: arXiv cs.NI 2013
Year: 2013

Quality of Service provisioning is one of the major design goals of IEEE 802.16 mesh networks. In order to provide quality delivery of delay sensitive services such as voice, video etc., it is required to route such traffic over a minimum delay path. In this paper we propose a routing metric for delay sensitive services in IEEE 802.16 mesh networks. We design a new cross layer routing metric, namely Expected Scheduler Delay (ESD), based on HoldOff exponent and the current load at each node of the network. This proposed metric takes into account the expected theoretical end-to-end delay of routing paths as well as network congestion to find the best suited path. We propose an efficient distributed scheme to calculate ESD and route the packets using source routing mechanism based on ESD. The simulation results demonstrate that our metric achieves reduced delay compared to a standard scheme used in IEEE 802.16 mesh, that takes hop count to find the path.
Non-Monotonic Snapshot Isolation
Venue: arXiv cs.DC 2013
Year: 2013

Many distributed applications require transactions. However, transactional protocols that require strong synchronization are costly in large scale environments. Two properties help with scalability of a transactional system: genuine partial replication (GPR), which leverages the intrinsic parallelism of a workload, and snapshot isolation (SI), which decreases the need for synchronization. We show that, under standard assumptions (data store accesses are not known in advance, and transactions may access arbitrary objects in the data store), it is impossible to have both SI and GPR. To circumvent this impossibility, we propose a weaker consistency criterion, called Non-monotonic Snapshot Isolation (NMSI). NMSI retains the most important properties of SI, i.e., read-only transactions always commit, and two write-conflicting updates do not both commit. We present a GPR protocol that ensures NMSI, and has lower message cost (i.e., it contacts fewer replicas and/or commits faster) than previous approaches.
Copula-based Randomized Mechanisms for Truthful Scheduling on Two Unrelated Machines
Venue: arXiv cs.GT 2013
Year: 2013

We design a Copula-based generic randomized truthful mechanism for scheduling on two unrelated machines with approximation ratio within $[1.5852, 1.58606]$, offering an improved upper bound for the two-machine case. Moreover, we provide an upper bound 1.5067711 for the two-machine two-task case, which is almost tight in view of the lower bound of 1.506 for the scale-free truthful mechanisms [4]. Of independent interest is the explicit incorporation of the concept of Copula in the design and analysis of the proposed approximation algorithm. We hope that techniques like this one will also prove useful in solving other problems in the future.
The Appliance Pervasive of Internet of Things in Healthcare Systems
Venue: arXiv cs.SY 2013
Year: 2013

In fact, information systems are the foundation of new productivity sources, medical organizational forms, and erection of a global economy. IoT based healthcare systems play a significant role in ICT and have contribution in growth of medical information systems, which are underpinning of recent medical and economic development strategies. However, to take advantages of IoT, it is essential that medical enterprises and community should trust the IoT systems in terms of performance, security, privacy, reliability and return-on-investment, which are open challenges of current IoT systems. For heightening of healthcare system; tracking, tracing and monitoring of patients and medical objects are more essential. But due to the inadequate healthcare situation, medical environment, medical technologies and the unique requirements of some healthcare applications, the obtainable tools cannot meet them accurately. The tracking, tracing and monitoring of patients and healthcare actors activities in healthcare system are challenging research directions for IoT researchers. State-of-the-art IoT based healthcare system should be developed which ensure the safety of patients and other healthcare activities. With this manuscript, we elaborate the essential role of IoT in healthcare systems; immense prospects of Internet of things in healthcare systems; extensive aspect of the use of IoT is dissimilar among different healthcare components and finally the participation of IoT between the useful research and present realistic applications. IoT and few other modern technologies are still in underpinning stage; mainly in the healthcare system.
The Number of Terms and Documents for Pseudo-Relevant Feedback for Ad-hoc Information Retrieval
Venue: arXiv cs.IR 2013
Year: 2013

In Information Retrieval System (IRS), the Automatic Relevance Feedback (ARF) is a query reformulation technique that modifies the initial one without the user intervention. It is applied mainly through the addition of terms coming from the external resources such as the ontologies and or the results of the current research. In this context we are mainly interested in the local analysis technique for the ARF in ad-hoc IRS on Arabic documents. In this article, we have examined the impact of the variation of the two parameters implied in this technique, that is to say, the number of the documents «D» and the number of terms «T», on an Arabic IRS performance. The experimentation, carried out on an Arabic corpus text, enables us to deduce that there are queries which are not easily improvable with the query reformulation. In addition, the success of the ARF is due mainly to the selection of a sufficient number of documents D and to the extraction of a very reduced set of relevant terms T for retrieval.
Hybrid Indexes for Repetitive Datasets
Venue: arXiv cs.DS 2013
Year: 2013

Advances in DNA sequencing mean databases of thousands of human genomes will soon be commonplace. In this paper we introduce a simple technique for reducing the size of conventional indexes on such highly repetitive texts. Given upper bounds on pattern lengths and edit distances, we preprocess the text with LZ77 to obtain a filtered text, for which we store a conventional index. Later, given a query, we find all matches in the filtered text, then use their positions and the structure of the LZ77 parse to find all matches in the original text. Our experiments show this also significantly reduces query times.
Attack Planning in the Real World
Venue: arXiv cs.CR 2013
Year: 2013

Assessing network security is a complex and difficult task. Attack graphs have been proposed as a tool to help network administrators understand the potential weaknesses of their network. However, a problem has not yet been addressed by previous work on this subject; namely, how to actually execute and validate the attack paths resulting from the analysis of the attack graph. In this paper we present a complete PDDL representation of an attack model, and an implementation that integrates a planner into a penetration testing tool. This allows to automatically generate attack paths for penetration testing scenarios, and to validate these attacks by executing the corresponding actions -including exploits- against the real target network. We present an algorithm for transforming the information present in the penetration testing tool to the planning domain, and show how the scalability issues of attack graphs can be solved using current planners. We include an analysis of the performance of our solution, showing how our model scales to medium-sized networks and the number of actions available in current penetration testing tools.
Web Service Testing Tools: A Comparative Study
Venue: arXiv cs.SE 2013
Year: 2013

Quality of Service (QoS) has gained more importance with the increase in usage and adoption of web services. In recent years, various tools and techniques developed for measurement and evaluation of QoS of web services. There are commercial as well as open-source tools available today which are being used for monitoring and testing QoS for web services. These tools facilitate in QoS measurement and analysis and are helpful in evaluation of service performance in real-time network. In this paper, we describe three popular open-source tools and compare them in terms of features, usability, performance, and software requirements. Results of the comparison will help in adoption and usage of these tools, and also promote development and usage of open-source web service testing tools.
An Efficient Distributed Data Extraction Method for Mining Sensor Networks Data
Venue: arXiv cs.DB 2013
Year: 2013

A wide range of Sensor Networks (SNs) are deployed in real world applications which generate large amount of raw sensory data. Data mining technique to extract useful knowledge from these applications is an emerging research area due to its crucial importance but still its a challenge to discover knowledge efficiently from the sensor network data. In this paper we proposed a Distributed Data Extraction (DDE) method to extract data from sensor networks by applying rules based clustering and association rule mining techniques. A significant amount of sensor readings sent from the sensors to the data processing point(s) may be lost or corrupted. DDE is also estimating these missing values from available sensor reading instead of requesting the sensor node to resend lost reading. DDE also apply data reduction which is able to reduce the data size while transmitting to sink. Results show our proposed approach exhibits the maximum data accuracy and efficient data extraction in term of the entire networks energy consumption.
Blended Learning or E-learning?
Venue: arXiv cs.CY 2013
Year: 2013

ICT or Information and Communication Technology has pervaded the fields of education.In recent years the term e-learning has emerged as a result of the integration of ICT in the education fields. Following the application this technology into teaching, some pitfalls have been identified and this have led to the Blended learning phenomenon.However the preference on this new method has been debated quite extensively.The aim of this paper is to investigate the advantages of blended learning over face to face instruction through reviews of related literature.The present survey revealed that blended learning is more favorable than pure e-learning and offers many advantages for learners like producing a sense of community or belonging.This study concludes that blended learning can be considered as an efficient approach of distance learning in terms of students' learning experience student-student interaction as well as studentinstructor interaction and is likely to emerge as the predominant education model in the future.
Optimal Relay Placement for Capacity and Performance Improvement using a Fluid Model for Heterogeneous Wireless Networks
Venue: arXiv cs.NI 2013
Year: 2013

In this paper, we address the problem of optimal relay placement in a cellular network assuming network densification, with the aim of maximizing cell capacity. In our model, a fraction of radio resources is dedicated to the base-station (BS)/relay nodes (RN) communication. In the remaining resources, BS and RN transmit simultaneously to users. During this phase, the network is densified in the sense that the transmitters density and so network capacity are increased. Intra- and inter-cell interference is taken into account in Signal to Interference plus Noise Ratio (SINR) simple formulas derived from a fluid model for heterogeneous network. Optimization can then be quickly performed using Simulated Annealing. Performance results show that cell capacity is boosted thanks to densification despite a degradation of the signal quality. Bounds are also provided on the fraction of resources dedicated to the BS-RN link.
Growth in the number of references in engineering journal papers during the 1972-2013 period
Venue: arXiv cs.DL 2013
Year: 2013

The number of references per paper, perhaps the best single index of a journal's scholarliness, has been studied in different disciplines and periods. In this paper we present a four decade study of eight engineering journals. A data set of over 70000 references was generated after automatic data gathering and manual inspection for errors. Results show a significant increase in the number of references per paper, the average rises from 8 in 1972 to 25 in 2013. This growth presents an acceleration around the year 2000, consistent with a much easier access to search engines and documents produced by the generalization of the Internet.
An Overview of the Research on Texture Based Plant Leaf Classification
Venue: arXiv cs.CV 2013
Year: 2013

Plant classification has a broad application prospective in agriculture and medicine, and is especially significant to the biology diversity research. As plants are vitally important for environmental protection, it is more important to identify and classify them accurately. Plant leaf classification is a technique where leaf is classified based on its different morphological features. The goal of this paper is to provide an overview of different aspects of texture based plant leaf classification and related things. At last we will be concluding about the efficient method i.e. the method that gives better performance compared to the other methods.
Hypergraph covering problems motivated by genome assembly questions
Venue: arXiv cs.DS 2013
Year: 2013

The Consecutive-Ones Property (C1P) is a classical concept in discrete mathematics that has been used in several genomics applications, from physical mapping of contemporary genomes to the assembly of ancient genomes. A common issue in genome assembly concerns repeats, genomic sequences that appear in several locations of a genome. Handling repeats leads to a variant of the C1P, the C1P with multiplicity (mC1P), that can also be seen as the problem of covering edges of hypergraphs by linear and circular walks. In the present work, we describe variants of the mC1P that address specific issues of genome assembly, and polynomial time or fixed-parameter algorithms to solve them.
Some Results on Open Edge and Open Mobile Guarding of Polygons and Triangulations
Venue: arXiv cs.CG 2013
Year: 2013

This paper focuses on a variation of the Art Gallery problem that considers open edge guards and open mobile guards. A mobile guard can be placed on edges and diagonals of a polygon, and the "open" prefix means that the endpoints of such edge or diagonal are not taken into account for visibility purposes. This paper studies the number of guards that are sufficient and sometimes necessary to guard some classes of simple polygons for both open edge and open mobile guards. This problem is also considered for planar triangulation graphs using open edge guards.
Modeling a repository of modules for ports Terminals Operating System (TOS)
Venue: arXiv cs.SE 2013
Year: 2013

The purpose of this paper is the modeling of a repository for modules and interfaces that must include all integrated information system management of a port terminal.Modules will provide a basic framework necessary for automatic management of internal operations and activities of all Port Terminals worldwide.
A Generic Scheme and Properties of Bidirectional Transformations
Venue: arXiv cs.PL 2013
Year: 2013

The recent rise of interest in bidirectional transformations (BXs) has led to the development of many BX frameworks, originating in diverse computer science disciplines. From a user perspective, these frameworks vary significantly in both interface and predictability of the underlying bidirectionalization technique. In this paper we start by presenting a generic BX scheme that can be instantiated to different concrete interfaces, by plugging-in the desired notion of update and traceability. Based on that scheme, we then present several desirable generic properties that may characterize a BX framework, and show how they can be instantiated to concrete interfaces. This generic presentation is useful when exploring the BX design space: it might help developers when designing new frameworks and end-users when comparing existing ones. We support the latter claim, by applying it in a comparative survey of popular existing BX frameworks.
Robust State and fault Estimation of Linear Discrete Time Systems with Unknown Disturbances
Venue: arXiv cs.SY 2013
Year: 2013

This paper presents a new robust fault and state estimation based on recursive least square filter for linear stochastic systems with unknown disturbances. The novel elements of the algorithm are : a simple, easily implementable, square root method which is shown to solve the numerical problems affecting the unknown input filter algorithm and related information filter and smoothing algorithms; an iterative framework, where information and covariance filters and smoothing are sequentially run in order to estimate the state and fault. This method provides a direct estimate of the state and fault in a single block with a simple formulation. A numerical example is given in order to illustrate the performance of the proposed filter.
From Bits to Atoms: 3D Printing in the Context of Supply Chain Strategies
Venue: arXiv cs.CY 2013
Year: 2013

A lot of attention in supply chain management has been devoted to understanding customer requirements. What are customer priorities in terms of price and service level, and how can companies go about fulfilling these requirements in an optimal way? New manufacturing technology in the form of 3D printing is about to change some of the underlying assumptions for different supply chain set-ups. This paper explores opportunities and barriers of 3D printing technology, specifically in a supply chain context. We are proposing a set of principles that can act to bridge existing research on different supply chain strategies and 3D printing. With these principles, researchers and practitioners alike can better understand the opportunities and limitations of 3D printing in a supply chain management context.
Time Efficient Approach To Offline Hand Written Character Recognition Using Associative Memory Net
Venue: arXiv cs.NE 2013
Year: 2013

In this paper, an efficient Offline Hand Written Character Recognition algorithm is proposed based on Associative Memory Net (AMN). The AMN used in this work is basically auto associative. The implementation is carried out completely in 'C' language. To make the system perform to its best with minimal computation time, a Parallel algorithm is also developed using an API package OpenMP. Characters are mainly English alphabets (Small (26), Capital (26)) collected from system (52) and from different persons (52). The characters collected from system are used to train the AMN and characters collected from different persons are used for testing the recognition ability of the net. The detailed analysis showed that the network recognizes the hand written characters with recognition rate of 72.20% in average case. However, in best case, it recognizes the collected hand written characters with 88.5%. The developed network consumes 3.57 sec (average) in Serial implementation and 1.16 sec (average) in Parallel implementation using OpenMP.