OpenRaiser/Intern-Atlas huggingface dataset:
Matching with Externalities for Context-Aware User-Cell Association in Small Cell Networks
Venue: arXiv cs.GT 2013
Year: 2013

In this paper, we propose a novel user-cell association approach for wireless small cell networks that exploits previously unexplored context information extracted from users' devices, i.e., user equipments (UEs). Beyond characterizing precise quality of service (QoS) requirements that accurately reflect the UEs' application usage, our proposed cell association approach accounts for the devices' hardware type (e.g., smartphone, tablet, laptop). This approach has the practical benefit of enabling the small cells to make better informed cell association decisions that handle practical device-specific QoS characteristics. We formulate the problem as a matching game between small cell base stations (SBSs) and UEs. In this game, the SBSs and UEs rank one another based on well-designed utility functions that capture composite QoS requirements, extracted from the context features (i.e., application in use, hardware type). We show that the preferences used by the nodes to rank one another are interdependent and influenced by the existing network-wide matching. Due to this unique feature of the preferences, we show that the proposed game can be classified as a many-to-one matching game with externalities. To solve this game, we propose a distributed algorithm that enables the players (i.e., UEs and SBSs) to self-organize into a stable matching that guarantees the required applications' QoS. Simulation results show that the proposed context-aware cell association scheme yields significant gains, reaching up to 52% improvement compared to baseline context-unaware approaches.
Packing a Knapsack of Unknown Capacity
Venue: arXiv cs.DS 2013
Year: 2013

We study the problem of packing a knapsack without knowing its capacity. Whenever we attempt to pack an item that does not fit, the item is discarded; if the item fits, we have to include it in the packing. We show that there is always a policy that packs a value within factor 2 of the optimum packing, irrespective of the actual capacity. If all items have unit density, we achieve a factor equal to the golden ratio. Both factors are shown to be best possible. In fact, we obtain the above factors using packing policies that are universal in the sense that they fix a particular order of the items and try to pack the items in this order, independent of the observations made while packing. We give efficient algorithms computing these policies. On the other hand, we show that, for any alpha>1, the problem of deciding whether a given universal policy achieves a factor of alpha is coNP-complete. If alpha is part of the input, the same problem is shown to be coNP-complete for items with unit densities. Finally, we show that it is coNP-hard to decide, for given alpha, whether a set of items admits a universal policy with factor alpha, even if all items have unit densities.
Anisotropic Diffusion for Details Enhancement in Multi-Exposure Image Fusion
Venue: arXiv cs.MM 2013
Year: 2013

We develop a multiexposure image fusion method based on texture features, which exploits the edge preserving and intraregion smoothing property of nonlinear diffusion filters based on partial differential equations (PDE). With the captured multiexposure image series, we first decompose images into base layers and detail layers to extract sharp details and fine details, respectively. The magnitude of the gradient of the image intensity is utilized to encourage smoothness at homogeneous regions in preference to inhomogeneous regions. Then, we have considered texture features of the base layer to generate a mask (i.e., decision mask) that guides the fusion of base layers in multiresolution fashion. Finally, well-exposed fused image is obtained that combines fused base layer and the detail layers at each scale across all the input exposures. Proposed algorithm skipping complex High Dynamic Range Image (HDRI) generation and tone mapping steps to produce detail preserving image for display on standard dynamic range display devices. Moreover, our technique is effective for blending flash/no-flash image pair and multifocus images, that is, images focused on different targets.
Dynamic Data Structure for Tree-Depth Decomposition
Venue: arXiv cs.DS 2013
Year: 2013

We present a dynamic data structure for representing a graph $G$ with tree-depth at most $D$. Tree-depth is an important graph parameter which arose in the study of sparse graph classes. The structure allows addition and removal of edges and vertices such that the resulting graph still has tree-depth at most $D$, in time bounds depending only on $D$. A tree-depth decomposition of the graph is maintained explicitly. This makes the data structure useful for dynamization of static algorithms for graphs with bounded tree-depth. As an example application, we give a dynamic data structure for MSO-property testing, with time bounds for removal depending only on $D$ and constant-time testing of the property, while the time for the initialization and insertion also depends on the size of the formula expressing the property.
Computational Complexity Comparison Of Multi-Sensor Single Target Data Fusion Methods By Matlab
Venue: arXiv cs.SY 2013
Year: 2013

Target tracking using observations from multiple sensors can achieve better estimation performance than a single sensor. The most famous estimation tool in target tracking is Kalman filter. There are several mathematical approaches to combine the observations of multiple sensors by use of Kalman filter. An important issue in applying a proper approach is computational complexity. In this paper, four data fusion algorithms based on Kalman filter are considered including three centralized and one decentralized methods. Using MATLAB, computational loads of these methods are compared while number of sensors increases. The results show that inverse covariance method has the best computational performance if the number of sensors is above 20. For a smaller number of sensors, other methods, especially group sensors, are more appropriate..
A two-layer Conditional Random Field for the classification of partially occluded objects
Venue: arXiv cs.CV 2013
Year: 2013

Conditional Random Fields (CRF) are among the most popular techniques for image labelling because of their flexibility in modelling dependencies between the labels and the image features. This paper proposes a novel CRF-framework for image labeling problems which is capable to classify partially occluded objects. Our approach is evaluated on aerial near-vertical images as well as on urban street-view images and compared with another methods.
Chaotic Variations of AES Algorithm
Venue: arXiv cs.CR 2013
Year: 2013

Advanced Encryption Standard (AES) algorithm is considered as a secured algorithm. Still, some security issues lie in the S-Box and the key used. In this paper, we have tried to give focus on the security of the key used. Here, the proposed modified algorithms for the AES have been simulated and tested with different chaotic variations such as 1-D logistic chaos equation, cross chaos equation as well as combination of both. For the evaluation purpose, the CPU time has been taken as the parameter. Though the variations of AES algorithms are taking some more time as compared to the standard AES algorithm, still the variations can be taken into consideration in case of more sensitive information. As we are giving more security to the key used for AES algorithm, our proposed algorithms are very much secured from unauthorized people.
Finding small patterns in permutations in linear time
Venue: arXiv cs.DS 2013
Year: 2013

Given two permutations $σ$ and $π$, the \textsc{Permutation Pattern} problem asks if $σ$ is a subpattern of $π$. We show that the problem can be solved in time $2^{O(\ell^2\log \ell)}\cdot n$, where $\ell=|σ|$ and $n=|π|$. In other words, the problem is fixed-parameter tractable parameterized by the size of the subpattern to be found. We introduce a novel type of decompositions for permutations and a corresponding width measure. We present a linear-time algorithm that either finds $σ$ as a subpattern of $π$, or finds a decomposition of $π$ whose width is bounded by a function of $|σ|$. Then we show how to solve the \textsc{Permutation Pattern} problem in linear time if a bounded-width decomposition is given in the input.
Action-based Character AI in Video-games with CogBots Architecture: A Preliminary Report
Venue: arXiv cs.AI 2013
Year: 2013

In this paper we propose an architecture for specifying the interaction of non-player characters (NPCs) in the game-world in a way that abstracts common tasks in four main conceptual components, namely perception, deliberation, control, action. We argue that this architecture, inspired by AI research on autonomous agents and robots, can offer a number of benefits in the form of abstraction, modularity, re-usability and higher degrees of personalization for the behavior of each NPC. We also show how this architecture can be used to tackle a simple scenario related to the navigation of NPCs under incomplete information about the obstacles that may obstruct the various way-points in the game, in a simple and effective way.
A dwt, dct and svd based watermarking technique to protect the image piracy
Venue: arXiv cs.MM 2013
Year: 2013

With the rapid development of information technology and multimedia, the use of digital data is increasing day by day. So it becomes very essential to protect multimedia information from piracy and also it is challenging. A great deal of Copyright owners is worried about protecting any kind of illegal repetition of their information. Hence, facing all these kinds of problems development of the techniques is very important. Digital watermarking considered as a solution to prevent the multimedia data. In this paper, an idea of watermarking is proposed and implemented. In proposed watermarking method, the original image is rearranged using zigzag sequence and DWT is applied on rearranged image. Then DCT and SVD are applied on all high bands LH, HL and HH. Watermark is then embedded by modifying the singular values of these bands. Extraction of watermark is performed by the inversion of watermark embedding process. For choosing of these three bands it gives facility of mid-band and pure high band that ensures good imperceptibility and more robustness against different kinds of attacks.
Report: A Model for Remote Parental Control System Using Smartphones
Venue: arXiv cs.CY 2013
Year: 2013

The mammoth growth in the information technology sector in terms of both quantity and pervasiveness has opened up a Pandora's Box of issues which are relevant in technical and social aspects. This paper attempts to address one of the critical issues among them which is concerned with the proper utilization of computer systems and mobile devices by children and teens. This paper proposes a model termed "RePort (Remote Parental Control System using Smartphones)" which is aimed towards monitoring the access behaviour of computers and smartphones in general and internet to be specific, by teens and children in a private environment. The model is built such that the access behaviour shall be monitored from a remote location with the help of smartphone devices. The access- characteristics are modelled using various parameters in four different layers of the model.The proposed model is validated with a prototype implementation in the Android platform for smartphones and as a background service for computer systems. Various experiments were conducted on the prototype implementation and results of the experiments validate the efficiency of the proposed model with respect to user's relevancy metric which is computed as 93.46%.
Universal truncation error upper bounds in irregular sampling restoration
Venue: arXiv cs.IT 2013
Year: 2013

Universal (pointwise uniform and time shifted) truncation error upper bounds are presented in Whittaker--Kotel'nikov--Shannon (WKS) sampling restoration sum for Bernstein function class $B_{π,d}^q\,,\ q \ge 1,$ $d\in \mathbb N\,,$ when the sampled functions decay rate is unknown. The case of multidimensional irregular sampling is discussed.
Universal truncation error upper bounds in sampling restoration
Venue: arXiv cs.IT 2013
Year: 2013

Universal (pointwise uniform and time shifted) truncation error upper bounds are presented for the Whittaker--Kotel'nikov--Shannon (WKS) sampling restoration sum for Bernstein function classes $B_{π,d}^q,\, q>1,\, d\in \mathbb N$, when the decay rate of the sampled functions is unknown. The case of regular sampling is discussed. Extremal properties of related series of sinc functions are investigated.
Comparative Study on Agile software development methodologies
Venue: arXiv cs.SE 2013
Year: 2013

Today-s business environment is very much dynamic, and organisations are constantly changing their software requirements to adjust with new environment. They also demand for fast delivery of software products as well as for accepting changing requirements. In this aspect, traditional plan-driven developments fail to meet up these requirements. Though traditional software development methodologies, such as life cycle-based structured and object oriented approaches, continue to dominate the systems development few decades and much research has done in traditional methodologies, Agile software development brings its own set of novel challenges that must be addressed to satisfy the customer through early and continuous delivery of the valuable software. It is a set of software development methods based on iterative and incremental development process, where requirements and development evolve through collaboration between self-organizing, cross-functional teams that allows rapid delivery of high quality software to meet customer needs and also accommodate changes in the requirements. In this paper, we significantly identify and describe the major factors, that Agile development approach improves software development process to meet the rapid changing business environments. We also provide a brief comparison of agile development methodologies with traditional systems development methodologies, and discuss current state of adopting agile methodologies. We speculate that from the need to satisfy the customer through early and continuous delivery of the valuable software, Agile software development is emerged as an alternative to traditional plan-based software development methods. The purpose of this paper, is to provide an in-depth understanding, the major benefits of agile development approach to software development industry, as well as provide a comparison study report of ASDM over TSDM.
Software as a Service - Common Service Bus (SAAS-CSB)
Venue: arXiv cs.DC 2013
Year: 2013

Software-as-a-Service (SaaS) is a form of cloud computing that relieves the user from the concern of hardware, software installation and management. It is an emerging business model that delivers software applications to the users through Web-based technology. Software vendors have varying requirements and SaaS applications most typically support such requirements. The various applications used by unique customers in a single instance are known as Multi-Tenancy. There would be a delay in service when the user sends the data from multiple applications to multiple destinations and from multiple applications to single destination due to the use of single CSB. This problem can be overcome by using multiple CSB concepts and hence multiple senders can efficiently send their data to multiple receivers at the same time. The multiple clouds are monitored and managed by the SaaS-CSB portal. The idea of SaaS-CSB Portal is to provide a single pane of glass for the user to consume and govern any service from any cloud. Thus, SaaS-CSB application allows companies to save their IT cost and valuable time.
Sip Overload Control Testbed: Design, Building and Evaluation
Venue: arXiv cs.NI 2013
Year: 2013

Having facilities such as being in text form, end-to-end connection establishment, and being independence from the type of transmitted data, SIP protocol is a good choice for signaling protocol in order to set up a connection between two users of an IP network. Although utilization of SIP protocol in a wide range of applications has made various vulnerabilities in this protocol, amongst which overload could make serious problems in SIP servers. A SIP is overloaded when it does not have sufficient resources (majorly CPU processing power and memory) to process all messages. In this paper the window-based overload control mechanism which does not require explicit feedback is developed and implemented on Asterisk open source proxy and evaluated. The results of implementation show that this method could practically maintain throughput in case of overload. As we know this is the only overload control method which is implemented on a real platform without using explicit feedback. The results show that the under load server maintains its throughput at the maximum capacity.
Pleasantly Consuming Linked Data with RDF Data Descriptions
Venue: arXiv cs.DB 2013
Year: 2013

Although the intention of RDF is to provide an open, minimally constraining way for representing information, there exists an increasing number of applications for which guarantees on the structure and values of an RDF data set become desirable if not essential. What is missing in this respect are mechanisms to tie RDF data to quality guarantees akin to schemata of relational databases, or DTDs in XML, in particular when translating legacy data coming with a rich set of integrity constraints - like keys or cardinality restrictions - into RDF. Addressing this shortcoming, we present the RDF Data Description language (RDD), which makes it possible to specify instance-level data constraints over RDF. Making such constraints explicit does not only help in asserting and maintaining data quality, but also opens up new optimization opportunities for query engines and, most importantly, makes query formulation a lot easier for users and system developers. We present design goals, syntax, and a formal, First-order logics based semantics of RDDs and discuss the impact on consuming Linked Data.
On Nicod's Condition, Rules of Induction and the Raven Paradox
Venue: arXiv cs.AI 2013
Year: 2013

Philosophers writing about the ravens paradox often note that Nicod's Condition (NC) holds given some set of background information, and fails to hold against others, but rarely go any further. That is, it is usually not explored which background information makes NC true or false. The present paper aims to fill this gap. For us, "(objective) background knowledge" is restricted to information that can be expressed as probability events. Any other configuration is regarded as being subjective and a property of the a priori probability distribution. We study NC in two specific settings. In the first case, a complete description of some individuals is known, e.g. one knows of each of a group of individuals whether they are black and whether they are ravens. In the second case, the number of individuals having a particular property is given, e.g. one knows how many ravens or how many black things there are (in the relevant population). While some of the most famous answers to the paradox are measure-dependent, our discussion is not restricted to any particular probability measure. Our most interesting result is that in the second setting, NC violates a simple kind of inductive inference (namely projectability). Since relative to NC, this latter rule is more closely related to, and more directly justified by our intuitive notion of inductive reasoning, this tension makes a case against the plausibility of NC. In the end, we suggest that the informal representation of NC may seem to be intuitively plausible because it can easily be mistaken for reasoning by analogy.
Speedy Object Detection based on Shape
Venue: arXiv cs.CV 2013
Year: 2013

This study is a part of design of an audio system for in-house object detection system for visually impaired, low vision personnel by birth or by an accident or due to old age. The input of the system will be scene and output as audio. Alert facility is provided based on severity levels of the objects (snake, broke glass etc) and also during difficulties. The study proposed techniques to provide speedy detection of objects based on shapes and its scale. Features are extraction to have minimum spaces using dynamic scaling. From a scene, clusters of objects are formed based on the scale and shape. Searching is performed among the clusters initially based on the shape, scale, mean cluster value and index of object(s). The minimum operation to detect the possible shape of the object is performed. In case the object does not have a likely matching shape, scale etc, then the several operations required for an object detection will not perform; instead, it will declared as a new object. In such way, this study finds a speedy way of detecting objects.
Adaptive Keywords Extraction with Contextual Bandits for Advertising on Parked Domains
Venue: arXiv cs.IR 2013
Year: 2013

Domain name registrars and URL shortener service providers place advertisements on the parked domains (Internet domain names which are not in service) in order to generate profits. As the web contents have been removed, it is critical to make sure the displayed ads are directly related to the intents of the visitors who have been directed to the parked domains. Because of the missing contents in these domains, it is non-trivial to generate the keywords to describe the previous contents and therefore the users intents. In this paper we discuss the adaptive keywords extraction problem and introduce an algorithm based on the BM25F term weighting and linear multi-armed bandits. We built a prototype over a production domain registration system and evaluated it using crowdsourcing in multiple iterations. The prototype is compared with other popular methods and is shown to be more effective.
Linear Precoders for Non-Regenerative Asymmetric Two-way Relaying in Cellular Systems
Venue: arXiv cs.IT 2013
Year: 2013

Two-way relaying (TWR) reduces the spectral-efficiency loss caused in conventional half-duplex relaying. TWR is possible when two nodes exchange data simultaneously through a relay. In cellular systems, data exchange between base station (BS) and users is usually not simultaneous e.g., a user (TUE) has uplink data to transmit during multiple access (MAC) phase, but does not have downlink data to receive during broadcast (BC) phase. This non-simultaneous data exchange will reduce TWR to spectrally-inefficient conventional half-duplex relaying. With infrastructure relays, where multiple users communicate through a relay, a new transmission protocol is proposed to recover the spectral loss. The BC phase following the MAC phase of TUE is now used by the relay to transmit downlink data to another user (RUE). RUE will not be able to cancel the back-propagating interference. A structured precoder is designed at the multi-antenna relay to cancel this interference. With multiple-input multiple-output (MIMO) nodes, the proposed precoder also triangulates the compound MAC and BC phase MIMO channels. The channel triangulation reduces the weighted sum-rate optimization to power allocation problem, which is then cast as a geometric program. Simulation results illustrate the effectiveness of the proposed protocol over conventional solutions.