OpenRaiser/Intern-Atlas huggingface dataset:
Sensors Lifetime Enhancement Techniques in Wireless Sensor Networks - A Survey
Venue: arXiv cs.NI 2010
Year: 2010

Wireless Sensor Networks are basically used for gathering information needed by smart environments but they are particularly useful in unattended situations where terrain, climate and other environmental constraints may hinder in the deployment of wired/conventional networks. Unlike traditional networks, these sensor networks do not have a continuous power supply at their disposal. Rather the individual sensors are battery operated and the lifetime of the individual sensors and thus the overall network depend heavily on duty cycle of these sensors. Analysis on WSNs shows that communication module is the main part which consumes most of the sensor energy and that is why energy conservation is the major optimization goal. Since routing protocols and MAC protocols directly access the communication module therefore the design of protocols in these two domains should take into account the energy conservation goal. In this paper, we discuss different state-of-the-art protocols both in MAC and routing domains that have been proposed for WSNs to achieve the overall goal of prolonging the network lifetime. The routing protocols in WSNs are generally categorized into three groups - data centric, hierarchical and location-based but we focus on only the first two categories because location-based routing protocols generally require a prior knowledge about sensors location which most of the times is not available due to random deployment of the sensors. We then discuss how schedule-based and contention-based MAC protocols can contribute to achieve optimal utilization of the limited energy resource by avoiding or reducing the chances of collisions and thus the need for retransmission.
A Route Optimization technique for registered and unregistered CN's in NEMO
Venue: arXiv cs.NI 2010
Year: 2010

As the demand of, requesting the Internet without any disturbance by the mobile users of any network is increasing the IETF started working on Network Mobility (NEMO). Maintaining the session of all the nodes in mobile network with its home network and external nodes can be provided by the basic Network Mobility support protocol. It provides mobility at IP level to complete networks, allowing a Mobile Network to change its point of attachment to the Internet, while maintaining the ongoing sessions of the nodes of the network. The Mobile Router (MR) manages the mobility even though the nodes don't know the status of mobility. This article discusses few basic concepts and limitations of NEMO protocol and proposes two ways to optimize the NEMO routing technique for registered and unregistered Correspondent Nodes (CN) of the Mobile Network Node (MNN).
Image Segmentation by Using Threshold Techniques
Venue: arXiv cs.CV 2010
Year: 2010

This paper attempts to undertake the study of segmentation image techniques by using five threshold methods as Mean method, P-tile method, Histogram Dependent Technique (HDT), Edge Maximization Technique (EMT) and visual Technique and they are compared with one another so as to choose the best technique for threshold segmentation techniques image. These techniques applied on three satellite images to choose base guesses for threshold segmentation image.
A Novel Method for Intrusion Detection System to Enhance Security in Ad hoc Network
Venue: arXiv cs.CR 2010
Year: 2010

The notion of an ad hoc network is a new paradigm that allows mobile hosts (nodes) to communicate without relying on a predefined infrastructure to keep the network connected. Most nodes are assumed to be mobile and communication is assumed to be wireless. The mobility of nodes in an ad-hoc network means that both the population and the topology of the network are highly dynamic. It is very difficult to design a once-for-all intrusion detection system. A secure protocol should atleast include mechanisms against known attack types. In addition, it should provide a scheme to easily add new security features in the future. The paper includes the detailed description of Proposed Intrusion Detection System based on Local Reputation Scheme. The proposed System also includes concept of Redemption and Fading these are mechanism that allow nodes previously considered malicious to become a part of the network again. The simulation of the proposed system is to be done using NS-2 simulator.
Classification of Polar-Thermal Eigenfaces using Multilayer Perceptron for Human Face Recognition
Venue: arXiv cs.CV 2010
Year: 2010

This paper presents a novel approach to handle the challenges of face recognition. In this work thermal face images are considered, which minimizes the affect of illumination changes and occlusion due to moustache, beards, adornments etc. The proposed approach registers the training and testing thermal face images in polar coordinate, which is capable to handle complicacies introduced by scaling and rotation. Polar images are projected into eigenspace and finally classified using a multi-layer perceptron. In the experiments we have used Object Tracking and Classification Beyond Visible Spectrum (OTCBVS) database benchmark thermal face images. Experimental results show that the proposed approach significantly improves the verification and identification performance and the success rate is 97.05%.
A Structured Framework for Assessing the "Goodness" of Agile Methods
Venue: arXiv cs.SE 2010
Year: 2010

Agile Methods are designed for customization; they offer an organization or a team the flexibility to adopt a set of principles and practices based on their culture and values. While that flexibility is consistent with the agile philosophy, it can lead to the adoption of principles and practices that can be sub-optimal relative to the desired objectives. We question then, how can one determine if adopted practices are "in sync" with the identified principles, and to what extent those principles support organizational objectives? In this research, we focus on assessing the "goodness" of an agile method adopted by an organization based on (1) its adequacy, (2) the capability of the organization to provide the supporting environment to competently implement the method, and (3) its effectiveness. To guide our assessment, we propose the Objectives, Principles and Practices (OPP) framework. The design of the OPP framework revolves around the identification of the agile objectives, principles that support the achievement of those objectives, and practices that reflect the "spirit" of those principles. Well-defined linkages between the objectives and principles, and between the principles and practices are also established to support the assessment process. We traverse these linkages in a top-down fashion to assess adequacy and a bottom-up fashion to assess capability and effectiveness. This is a work-in-progress paper, outlining our proposed research, preliminary results and future directions.
An Adaptive Power Efficient Packet Scheduling Algorithm for Wimax Networks
Venue: arXiv cs.NI 2010
Year: 2010

Admission control schemes and scheduling algorithms are designed to offer QoS services in 802.16/802.16e networks and a number of studies have investigated these issues. But the channel condition and priority of traffic classes are very rarely considered in the existing scheduling algorithms. Although a number of energy saving mechanisms have been proposed for the IEEE 802.16e, to minimize the power consumption of IEEE 802.16e mobile stations with multiple real-time connections has not yet been investigated. Moreover, they mainly consider non real- time connections in IEEE 802.16e networks. In this paper, we propose to design an adaptive power efficient packet scheduling algorithm that provides a minimum fair allocation of the channel bandwidth for each packet flow and additionally minimizes the power consumption. In the adaptive scheduling algorithm, packets are transmitted as per allotted slots from different priority of traffic classes adaptively, depending on the channel condition. Suppose if the buffer size of the high priority traffic queues with bad channel condition exceeds a threshold, then the priority of those flows will be increased by adjusting the sleep duty cycle of existing low priority traffic, to prevent the starvation. By simulation results, we show that our proposed scheduler achieves better channel utilization while minimizing the delay and power consumption.
Genetic algorithms and the art of Zen
Venue: arXiv cs.NE 2010
Year: 2010

In this paper we present a novel genetic algorithm (GA) solution to a simple yet challenging commercial puzzle game known as the Zen Puzzle Garden (ZPG). We describe the game in detail, before presenting a suitable encoding scheme and fitness function for candidate solutions. We then compare the performance of the genetic algorithm with that of the A* algorithm. Our results show that the GA is competitive with informed search in terms of solution quality, and significantly out-performs it in terms of computational resource requirements. We conclude with a brief discussion of the implications of our findings for game solving and other "real world" problems.
Towards an architecture for semantic integration of business components
Venue: arXiv cs.SE 2010
Year: 2010

Today, reusable components are available in several repositorys. These are certainly conceived for re-use. However, this re-use is not immediate, it requires, in effect, to pass by some essential conceptual operations, among which in particular, research, integration, adaptation, and composition. We are interested in the present work to the problem of semantic integration of heterogeneous Business Components. This problem is often put in syntactical terms, while the real stake is of semantic order. Our contribution concerns an architecture proposal for Business components integration and a resolution method of semantic naming conflicts, met during the integration of Business Components
A basic gesture and motion format for virtual reality multisensory applications
Venue: arXiv cs.HC 2010
Year: 2010

The question of encoding movements such as those produced by human gestures may become central in the coming years, given the growing importance of movement data exchanges between heterogeneous systems and applications (musical applications, 3D motion control, virtual reality interaction, etc.). For the past 20 years, various formats have been proposed for encoding movement, especially gestures. Though, these formats, at different degrees, were designed in the context of quite specific applications (character animation, motion capture, musical gesture, biomechanical concerns...). The article introduce a new file format, called GMS (for 'Gesture and Motion Signal'), with the aim of being more low-level and generic, by defining the minimal features a format carrying movement/gesture information needs, rather than by gathering all the information generally given by the existing formats. The article argues that, given its growing presence in virtual reality situations, the "gesture signal" itself must be encoded, and that a specific format is needed. The proposed format features the inner properties of such signals: dimensionality, structural features, types of variables, and spatial and temporal properties. The article first reviews the various situations with multisensory virtual objects in which gesture controls intervene. The proposed format is then deduced, as a mean to encode such versatile and variable "gestural and animated scene".
A Novel Algorithm for Informative Meta Similarity Clusters Using Minimum Spanning Tree
Venue: arXiv cs.OH 2010
Year: 2010

The minimum spanning tree clustering algorithm is capable of detecting clusters with irregular boundaries. In this paper we propose two minimum spanning trees based clustering algorithm. The first algorithm produces k clusters with center and guaranteed intra-cluster similarity. The radius and diameter of k clusters are computed to find the tightness of k clusters. The variance of the k clusters are also computed to find the compactness of the clusters. The second algorithm is proposed to create a dendrogram using the k clusters as objects with guaranteed inter-cluster similarity. The algorithm is also finds central cluster from the k number of clusters. The first algorithm uses divisive approach, where as the second algorithm uses agglomerative approach. In this paper we used both the approaches to find Informative Meta similarity clusters.
Fairness in Combinatorial Auctions
Venue: arXiv cs.GT 2010
Year: 2010

The market economy deals with many interacting agents such as buyers and sellers who are autonomous intelligent agents pursuing their own interests. One such multi-agent system (MAS) that plays an important role in auctions is the combinatorial auctioning system (CAS). We use this framework to define our concept of fairness in terms of what we call as "basic fairness" and "extended fairness". The assumptions of quasilinear preferences and dominant strategies are taken into consideration while explaining fairness. We give an algorithm to ensure fairness in a CAS using a Generalized Vickrey Auction (GVA). We use an algorithm of Sandholm to achieve optimality. Basic and extended fairness are then analyzed according to the dominant strategy solution concept.
Spectral Shape of Check-Hybrid GLDPC Codes
Venue: arXiv cs.IT 2010
Year: 2010

This paper analyzes the asymptotic exponent of both the weight spectrum and the stopping set size spectrum for a class of generalized low-density parity-check (GLDPC) codes. Specifically, all variable nodes (VNs) are assumed to have the same degree (regular VN set), while the check node (CN) set is assumed to be composed of a mixture of different linear block codes (hybrid CN set). A simple expression for the exponent (which is also referred to as the growth rate or the spectral shape) is developed. This expression is consistent with previous results, including the case where the normalized weight or stopping set size tends to zero. Furthermore, it is shown how certain symmetry properties of the local weight distribution at the CNs induce a symmetry in the overall weight spectral shape function.
Predicting Influential Users in Online Social Networks
Venue: arXiv cs.CY 2010
Year: 2010

Who are the influential people in an online social network? The answer to this question depends not only on the structure of the network, but also on details of the dynamic processes occurring on it. We classify these processes as conservative and non-conservative. A random walk on a network is an example of a conservative dynamic process, while information spread is non-conservative. The influence models used to rank network nodes can be similarly classified, depending on the dynamic process they implicitly emulate. We claim that in order to correctly rank network nodes, the influence model has to match the details of the dynamic process. We study a real-world network on the social news aggregator Digg, which allows users to post and vote for news stories. We empirically define influence as the number of in-network votes a user's post generates. This influence measure, and the resulting ranking, arises entirely from the dynamics of voting on Digg, which represents non-conservative information flow. We then compare predictions of different influence models with this empirical estimate of influence. The results show that non-conservative models are better able to predict influential users on Digg. We find that normalized alpha-centrality metric turns out to be one of the best predictors of influence. We also present a simple algorithm for computing this metric and the associated mathematical formulation and analytical proofs.
Parallel QR decomposition in LTE-A systems
Venue: arXiv cs.OH 2010
Year: 2010

The QR Decomposition (QRD) of communication channel matrices is a fundamental prerequisite to several detection schemes in Multiple-Input Multiple-Output (MIMO) communication systems. Herein, the main feature of the QRD is to transform the non-causal system into a causal system, where consequently efficient detection algorithms based on the Successive Interference Cancellation (SIC) or Sphere Decoder (SD) become possible. Also, QRD can be used as a light but efficient antenna selection scheme. In this paper, we address the study of the QRD methods and compare their efficiency in terms of computational complexity and error rate performance. Moreover, a particular attention is paid to the parallelism of the QRD algorithms since it reduces the latency of the matrix factorization.
Integrating Structured Metadata with Relational Affinity Propagation
Venue: arXiv cs.AI 2010
Year: 2010

Structured and semi-structured data describing entities, taxonomies and ontologies appears in many domains. There is a huge interest in integrating structured information from multiple sources; however integrating structured data to infer complex common structures is a difficult task because the integration must aggregate similar structures while avoiding structural inconsistencies that may appear when the data is combined. In this work, we study the integration of structured social metadata: shallow personal hierarchies specified by many individual users on the SocialWeb, and focus on inferring a collection of integrated, consistent taxonomies. We frame this task as an optimization problem with structural constraints. We propose a new inference algorithm, which we refer to as Relational Affinity Propagation (RAP) that extends affinity propagation (Frey and Dueck 2007) by introducing structural constraints. We validate the approach on a real-world social media dataset, collected from the photosharing website Flickr. Our empirical results show that our proposed approach is able to construct deeper and denser structures compared to an approach using only the standard affinity propagation algorithm.
Backpressure-based Packet-by-Packet Adaptive Routing in Communication Networks
Venue: arXiv cs.NI 2010
Year: 2010

Backpressure-based adaptive routing algorithms where each packet is routed along a possibly different path have been extensively studied in the literature. However, such algorithms typically result in poor delay performance and involve high implementation complexity. In this paper, we develop a new adaptive routing algorithm built upon the widely-studied back-pressure algorithm. We decouple the routing and scheduling components of the algorithm by designing a probabilistic routing table which is used to route packets to per-destination queues. The scheduling decisions in the case of wireless networks are made using counters called shadow queues. The results are also extended to the case of networks which employ simple forms of network coding. In that case, our algorithm provides a low-complexity solution to optimally exploit the routing-coding tradeoff.
Time Segmentation Approach Allowing QoS and Energy Saving for Wireless Sensor Networks
Venue: arXiv cs.NI 2010
Year: 2010

Wireless sensor networks are conceived to monitor a certain application or physical phenomena and are supposed to function for several years without any human intervention for maintenance. Thus, the main issue in sensor networks is often to extend the lifetime of the network by reducing energy consumption. On the other hand, some applications have high priority traffic that needs to be transferred within a bounded end-to-end delay while maintaining an energy efficient behavior. We propose MaCARI, a time segmentation protocol that saves energy, improves the overall performance of the network and enables quality of service in terms of guaranteed access to the medium and end-to-end delays. This time segmentation is achieved by synchronizing the activity of nodes using a tree-based beacon propagation and allocating activity periods for each cluster of nodes. The tree-based topology is inspired from the cluster-tree proposed by the ZigBee standard. The efficiency of our protocol is proven analytically, by simulation and through real testbed measurements.
Radio Frequency Identifiers: What are the Possibilities?
Venue: arXiv cs.OH 2010
Year: 2010

This paper defines the components of radio frequency identifiers (RFID). It also explores the different areas and sectors where RFID can be beneficial. The paper discusses the uses and advantages of RFID in deference, consumer packaged goods (CPG), healthcare, logistics, manufacturing, and retail.
An Empirical Study of the Manipulability of Single Transferable Voting
Venue: arXiv cs.AI 2010
Year: 2010

Voting is a simple mechanism to combine together the preferences of multiple agents. Agents may try to manipulate the result of voting by mis-reporting their preferences. One barrier that might exist to such manipulation is computational complexity. In particular, it has been shown that it is NP-hard to compute how to manipulate a number of different voting rules. However, NP-hardness only bounds the worst-case complexity. Recent theoretical results suggest that manipulation may often be easy in practice. In this paper, we study empirically the manipulability of single transferable voting (STV) to determine if computational complexity is really a barrier to manipulation. STV was one of the first voting rules shown to be NP-hard. It also appears one of the harder voting rules to manipulate. We sample a number of distributions of votes including uniform and real world elections. In almost every election in our experiments, it was easy to compute how a single agent could manipulate the election or to prove that manipulation by a single agent was impossible.
Algorithmic Aspects of Golomb Ruler Construction
Venue: arXiv cs.DM 2010
Year: 2010

We consider Golomb rulers and their construction. Common rulers feature marks at every unit measure, distances can often be measured with numerous pairs of marks. On Golomb rulers, for every distance there are at most two marks measuring it. The construction of optimal---with respect to shortest length for given number of marks or maximum number of marks for given length---is nontrivial, various problems regarding this are NP-complete. We give a simplified hardness proof for one of them. We use a hypergraph characterization of rulers and Golomb rulers to illuminate structural properties. This gives rise to a problem kernel in a fixed-parameter approach to a construction problem. We also take a short look at the practical implications of these considerations.
Dynamic management of transactions in distributed real-time processing system
Venue: arXiv cs.DC 2010
Year: 2010

Managing the transactions in real time distributed computing system is not easy, as it has heterogeneously networked computers to solve a single problem. If a transaction runs across some different sites, it may commit at some sites and may failure at another site, leading to an inconsistent transaction. The complexity is increase in real time applications by placing deadlines on the response time of the database system and transactions processing. Such a system needs to process Transactions before these deadlines expired. A series of simulation study have been performed to analyze the performance under different transaction management under conditions such as different workloads, distribution methods, execution mode-distribution and parallel etc. The scheduling of data accesses are done in order to meet their deadlines and to minimize the number of transactions that missed deadlines. A new concept is introduced to manage the transactions in dynamic ways rather than setting computing parameters in static ways. With this approach, the system gives a significant improvement in performance.