OpenRaiser/Intern-Atlas huggingface dataset:
Enrichissement des contenus par la réindexation des usagers : un état de l'art sur la problématique
Venue: arXiv cs.IR 2009
Year: 2009

Information retrieval (IR) is a user approach to obtain relevant information which meets needs with the help of a IR system (IRS). However, the IRS shows certain differences between user relevance and system relevance. These gaps are essentially related to the imperfection of the indexing process (as approach related to the IR), to problems related to the misunderstanding of the natural language and the non correspondence between the real needs of the user and the results of his query. As idea is to think about an ?intellectual? indexing that takes into account the point of view of the user. By consulting the document, user can build information as added-value on the existing content: new information which grows contents and allows the semantic visibility or facilitates the reading by the annotations, by links to other content, by new descriptors, specific new abstracts of users: it is the reindexing of the contents by the contribution or the vote of the uses
Performance limitations for sparse matrix-vector multiplications on current multicore environments
Venue: arXiv cs.PF 2009
Year: 2009

The increasing importance of multicore processors calls for a reevaluation of established numerical algorithms in view of their ability to profit from this new hardware concept. In order to optimize the existent algorithms, a detailed knowledge of the different performance-limiting factors is mandatory. In this contribution we investigate sparse matrix-vector multiplication, which is the dominant operation in many sparse eigenvalue solvers. Two conceptually different storage schemes and computational kernels have been conceived in the past to target cache-based and vector architectures, respectively. Starting from a series of microbenchmarks we apply the gained insight on optimized sparse MVM implementations, whose serial and OpenMP-parallel performance we review on state-of-the-art multicore systems.
Articulation and Clarification of the Dendritic Cell Algorithm
Venue: arXiv cs.AI 2009
Year: 2009

The Dendritic Cell algorithm (DCA) is inspired by recent work in innate immunity. In this paper a formal description of the DCA is given. The DCA is described in detail, and its use as an anomaly detector is illustrated within the context of computer security. A port scan detection task is performed to substantiate the influence of signal selection on the behaviour of the algorithm. Experimental results provide a comparison of differing input signal mappings.
Information-theoretically Secret Key Generation for Fading Wireless Channels
Venue: arXiv cs.CR 2009
Year: 2009

The multipath-rich wireless environment associated with typical wireless usage scenarios is characterized by a fading channel response that is time-varying, location-sensitive, and uniquely shared by a given transmitter-receiver pair. The complexity associated with a richly scattering environment implies that the short-term fading process is inherently hard to predict and best modeled stochastically, with rapid decorrelation properties in space, time and frequency. In this paper, we demonstrate how the channel state between a wireless transmitter and receiver can be used as the basis for building practical secret key generation protocols between two entities. We begin by presenting a scheme based on level crossings of the fading process, which is well-suited for the Rayleigh and Rician fading models associated with a richly scattering environment. Our level crossing algorithm is simple, and incorporates a self-authenticating mechanism to prevent adversarial manipulation of message exchanges during the protocol. Since the level crossing algorithm is best suited for fading processes that exhibit symmetry in their underlying distribution, we present a second and more powerful approach that is suited for more general channel state distributions. This second approach is motivated by observations from quantizing jointly Gaussian processes, but exploits empirical measurements to set quantization boundaries and a heuristic log likelihood ratio estimate to achieve an improved secret key generation rate. We validate both proposed protocols through experimentations using a customized 802.11a platform, and show for the typical WiFi channel that reliable secret key establishment can be accomplished at rates on the order of 10 bits/second.
Sharp Load Thresholds for Cuckoo Hashing
Venue: arXiv cs.DS 2009
Year: 2009

The paradigm of many choices has influenced significantly the design of efficient data structures and, most notably, hash tables. Cuckoo hashing is a technique that extends this concept. There,we are given a table with $n$ locations, and we assume that each location can hold one item. Each item to be inserted chooses randomly k>1 locations and has to be placed in any one of them. How much load can cuckoo hashing handle before collisions prevent the successful assignment of the available items to the chosen locations? Practical evaluations of this method have shown that one can allocate a number of elements that is a large proportion of the size of the table, being very close to 1 even for small values of k such as 4 or 5. In this paper we show that there is a critical value for this proportion: with high probability, when the amount of available items is below this value, then these can be allocated successfully, but when it exceeds this value, the allocation becomes impossible. We give explicitly for each k>1 this critical value. This answers an open question posed by Mitzenmacher (ESA '09) and underpins theoretically the experimental results. Our proofs are based on the translation of the question into a hypergraph setting, and the study of the related typical properties of random k-uniform hypergraphs.
On Detection With Partial Information In The Gaussian Setup
Venue: arXiv cs.IT 2009
Year: 2009

We introduce the problem of communication with partial information, where there is an asymmetry between the transmitter and the receiver codebooks. Practical applications of the proposed setup include the robust signal hashing problem within the context of multimedia security and asymmetric communications with resource-lacking receivers. We study this setup in a binary detection theoretic context for the additive colored Gaussian noise channel. In our proposed setup, the partial information available at the detector consists of dimensionality-reduced versions of the transmitter codewords, where the dimensionality reduction is achieved via a linear transform. We first derive the corresponding MAP-optimal detection rule and the corresponding conditional probability of error (conditioned on the partial information the detector possesses). Then, we constructively quantify an optimal class of linear transforms, where the cost function is the expected Chernoff bound on the conditional probability of error of the MAP-optimal detector.
Continuum Equilibria and Global Optimization for Routing in Dense Static Ad Hoc Networks
Venue: arXiv cs.GT 2009
Year: 2009

We consider massively dense ad hoc networks and study their continuum limits as the node density increases and as the graph providing the available routes becomes a continuous area with location and congestion dependent costs. We study both the global optimal solution as well as the non-cooperative routing problem among a large population of users where each user seeks a path from its origin to its destination so as to minimize its individual cost. Finally, we seek for a (continuum version of the) Wardrop equilibrium. We first show how to derive meaningful cost models as a function of the scaling properties of the capacity of the network and of the density of nodes. We present various solution methodologies for the problem: (1) the viscosity solution of the Hamilton-Jacobi-Bellman equation, for the global optimization problem, (2) a method based on Green's Theorem for the least cost problem of an individual, and (3) a solution of the Wardrop equilibrium problem using a transformation into an equivalent global optimization problem.
On the stability of two-chunk file-sharing systems
Venue: arXiv cs.OS 2009
Year: 2009

We consider five different peer-to-peer file sharing systems with two chunks, with the aim of finding chunk selection algorithms that have provably stable performance with any input rate and assuming non-altruistic peers who leave the system immediately after downloading the second chunk. We show that many algorithms that first looked promising lead to unstable or oscillating behavior. However, we end up with a system with desirable properties. Most of our rigorous results concern the corresponding deterministic large system limits, but in two simplest cases we provide proofs for the stochastic systems also.
Metric and Kernel Learning using a Linear Transformation
Venue: arXiv cs.LG 2009
Year: 2009

Metric and kernel learning are important in several machine learning applications. However, most existing metric learning algorithms are limited to learning metrics over low-dimensional data, while existing kernel learning algorithms are often limited to the transductive setting and do not generalize to new data points. In this paper, we study metric learning as a problem of learning a linear transformation of the input data. We show that for high-dimensional data, a particular framework for learning a linear transformation of the data based on the LogDet divergence can be efficiently kernelized to learn a metric (or equivalently, a kernel function) over an arbitrarily high dimensional space. We further demonstrate that a wide class of convex loss functions for learning linear transformations can similarly be kernelized, thereby considerably expanding the potential applications of metric learning. We demonstrate our learning approach by applying it to large-scale real world problems in computer vision and text mining.
A Secure Communication Game with a Relay Helping the Eavesdropper
Venue: arXiv cs.IT 2009
Year: 2009

In this work a four terminal Gaussian network composed of a source, a destination, an eavesdropper and a jammer relay is studied. The jammer relay does not hear the source transmission. It assists the eavesdropper and aims to decrease the achievable secrecy rates. The source, on the other hand, aims to increase the achievable secrecy rates. Assuming Gaussian strategies at the source and the jammer relay, this problem is formulated as a two-player zero-sum continuous game, where the payoff is the achieved secrecy rate. For this game the Nash Equilibrium is generally achieved with mixed strategies. The optimal cumulative distribution functions for the source and the jammer relay that achieve the value of the game, which is the equilibrium secrecy rate, are found.
An Alternative To Common Content Management Techniques
Venue: arXiv cs.OH 2009
Year: 2009

Content management systems use various strategies to store and manage information. One of the most usual methods encountered in commercial products is to make use of the file system to store the raw content information, while the associated metadata is kept synchronized in a relational database management system. This strategy has its advantages but we believe it also has significant limitations which should be addressed and eventually solved. In this paper we propose an alternative method of storing and managing content aiming at finding solutions for current limitations both in terms of functional and nonfunctional requirements.
Detecting Botnet Activities Based on Abnormal DNS traffic
Venue: arXiv cs.NI 2009
Year: 2009

IThe botnet is considered as a critical issue of the Internet due to its fast growing mechanism and affect. Recently, Botnets have utilized the DNS and query DNS server just like any legitimate hosts. In this case, it is difficult to distinguish between the legitimate DNS traffic and illegitimate DNS traffic. It is important to build a suitable solution for botnet detection in the DNS traffic and consequently protect the network from the malicious Botnets activities. In this paper, a simple mechanism is proposed to monitors the DNS traffic and detects the abnormal DNS traffic issued by the botnet based on the fact that botnets appear as a group of hosts periodically. The proposed mechanism is also able to classify the DNS traffic requested by group of hosts (group behavior) and single hosts (individual behavior), consequently detect the abnormal domain name issued by the malicious Botnets. Finally, the experimental results proved that the proposed mechanism is robust and able to classify DNS traffic, and efficiently detects the botnet activity with average detection rate of 89 percent.
Energy Efficient Security Architecture for Wireless BioMedical Sensor Networks
Venue: arXiv cs.CR 2009
Year: 2009

Latest developments in VLSI, wireless communications, and biomedical sensing devices allow very small, lightweight, low power, intelligent sensing devices called biosensors. A set of these devices can be integrated into a Wireless Biomedical Sensor Network (WBSN), a new breakthrough technology used in telemedicine for monitoring the physiological condition of an individual. The biosensor nodes in WBSN has got resource limitations in terms of battery lifetime, CPU processing capability, and memory capacity. Replacement or recharging of batteries on thousands of biosensor nodes is quiet difficult or too costly. So, a key challenge in wireless biomedical sensor networks is the reduction of energy and memory consumption. Considering, the sensitivity of information in WBSN, we must provide security and patient privacy, as it is an important issue in the design of such systems. Hence this paper proposes an energy efficient security protocol for WBSN where security is provided to the physiological data, which is being transmitted from the sensor node to the sink device. This is achieved by authenticating the data using patients biometric, encrypting the data using Quasi Group cryptography after compressing the image data using an energy efficient number theory based technique.
A Context-based Trust Management Model for Pervasive Computing Systems
Venue: arXiv cs.CR 2009
Year: 2009

Trust plays an important role in making collaborative decisions about service evaluation and service selection in pervasive computing. Context is a fundamental concept in pervasive systems, which is based on the interpretation of environment and systems. The dynamic nature of context can strongly affect trust management and service selection. In this paper, we present a context-based trust management model for pervasive computing systems. The concept of context is considered in basic components of the model such as trust computation module, recommender assessment module, transaction management module, and request responder. In order to measure a predicted trustworthiness according to the fuzzy nature of trust in pervasive environments, fuzzy concepts are integrated in the proposed model.
An Innovative Scheme For Effectual Fingerprint Data Compression Using Bezier Curve Representations
Venue: arXiv cs.CV 2009
Year: 2009

Naturally, with the mounting application of biometric systems, there arises a difficulty in storing and handling those acquired biometric data. Fingerprint recognition has been recognized as one of the most mature and established technique among all the biometrics systems. In recent times, with fingerprint recognition receiving increasingly more attention the amount of fingerprints collected has been constantly creating enormous problems in storage and transmission. Henceforth, the compression of fingerprints has emerged as an indispensable step in automated fingerprint recognition systems. Several researchers have presented approaches for fingerprint image compression. In this paper, we propose a novel and efficient scheme for fingerprint image compression. The presented scheme utilizes the Bezier curve representations for effective compression of fingerprint images. Initially, the ridges present in the fingerprint image are extracted along with their coordinate values using the approach presented. Subsequently, the control points are determined for all the ridges by visualizing each ridge as a Bezier curve. The control points of all the ridges determined are stored and are used to represent the fingerprint image. When needed, the fingerprint image is reconstructed from the stored control points using Bezier curves. The quality of the reconstructed fingerprint is determined by a formal evaluation. The proposed scheme achieves considerable memory reduction in storing the fingerprint.
Visualizing Graphs with Node and Edge Labels
Venue: arXiv cs.DM 2009
Year: 2009

When drawing graphs whose edges and nodes contain text or graphics, such informa tion needs to be displayed without overlaps, either as part of the initial layout or as a post-processing step. The core problem in removing overlaps lies in retaining the structural information inherent in a layout, minimizing the additional area required, and keeping edges as straight as possible. This paper presents a unified node and edge overlap removal algorithm that does well at solving this problem.
Toward a Gigabit Wireless Communications System
Venue: arXiv cs.NI 2009
Year: 2009

This paper presents the design and the realization of a hybrid wireless Gigabit Ethernet indoor communications system operating at 60 GHz. As the 60 GHz radio link operates only in a single-room configuration, an additional Radio over Fiber (RoF) link is used to ensure the communications within all the rooms of a residential environment. The system uses low complexity baseband processing modules. A byte synchronization technique is designed to provide a high value of the preamble detection probability and a very small value of the false detection probability. Conventional RS (255, 239) encoder and decoder are used for channel forward error correction (FEC). The FEC parameters are determined by the tradeoff between higher coding gain and hardware complexity. The results of bit error rate measurements at 875 Mbps are presented for various antennas configurations.
Let's Make a Difference!
Venue: arXiv cs.DM 2009
Year: 2009

We study the behaviour of iterations of the difference operator delta on streams over {0,1}. In particular, we show that a stream sigma is eventually periodic if and only if the sequence of differences sigma, delta(sigma), delta(delta(sigma)), ..., the `delta-orbit' of sigma as we call it, is eventually periodic. Moreover, we generalise this result to operations delta_d that sum modulo 2 the elements of each consecutive block of length d+1 in a given 01-stream. Some experimentation with delta-orbits of well-known streams reveals a surprising connexion between the Sierpinski stream and the Mephisto Waltz.
On the Capacity of Constrained Systems
Venue: arXiv cs.IT 2009
Year: 2009

In the first chapter of Shannon's "A Mathematical Theory of Communication," it is shown that the maximum entropy rate of an input process of a constrained system is limited by the combinatorial capacity of the system. Shannon considers systems where the constraints define regular languages and uses results from matrix theory in his derivations. In this work, the regularity constraint is dropped. Using generating functions, it is shown that the maximum entropy rate of an input process is upper-bounded by the combinatorial capacity in general. The presented results also allow for a new approach to systems with regular constraints. As an example, the results are applied to binary sequences that fulfill the (j,k) run-length constraint and by using the proposed framework, a simple formula for the combinatorial capacity is given and a maxentropic input process is defined.
Retrieval of very large numbers of items in the Web of Science: an exercise to develop accurate search strategies
Venue: arXiv cs.DL 2009
Year: 2009

The current communication presents a simple exercise with the aim of solving a singular problem: the retrieval of extremely large amounts of items in the Web of Science interface. As it is known, Web of Science interface allows a user to obtain at most 100,000 items from a single query. But what about queries that achieve a result of more than 100,000 items? The exercise developed one possible way to achieve this objective. The case study is the retrieval of the entire scientific production from the United States in a specific year. Different sections of items were retrieved using the field Source of the database. Then, a simple Boolean statement was created with the aim of eliminating overlapping and to improve the accuracy of the search strategy. The importance of team work in the development of advanced search strategies was noted.
Optimal Approximation Algorithms for Multi-agent Combinatorial Problems with Discounted Price Functions
Venue: arXiv cs.MA 2009
Year: 2009

Submodular functions are an important class of functions in combinatorial optimization which satisfy the natural properties of decreasing marginal costs. The study of these functions has led to strong structural properties with applications in many areas. Recently, there has been significant interest in extending the theory of algorithms for optimizing combinatorial problems (such as network design problem of spanning tree) over submodular functions. Unfortunately, the lower bounds under the general class of submodular functions are known to be very high for many of the classical problems. In this paper, we introduce and study an important subclass of submodular functions, which we call discounted price functions. These functions are succinctly representable and generalize linear cost functions. In this paper we study the following fundamental combinatorial optimization problems: Edge Cover, Spanning Tree, Perfect Matching and Shortest Path, and obtain tight upper and lower bounds for these problems. The main technical contribution of this paper is designing novel adaptive greedy algorithms for the above problems. These algorithms greedily build the solution whist rectifying mistakes made in the previous steps.
Improving Software Development Processes with Multicriteria Methods
Venue: arXiv cs.SE 2009
Year: 2009

All software development processes include steps where several alternatives induce a choice, a decision-making. Sometimes, methodologies offer a way to make decisions. However, in a lot of cases, the arguments to carry out the decision are very poor and the choice is made in an intuitive and hazardous way. The aim of our work is to offer a scientifically founded way to guide the engineer through tactical choices with the application of multicriteria methods in software development processes. This approach is illustrated with three cases: risks, use cases and tools within Rational Unified Process.
Applicability of Telemedicine in Bangladesh: Current Status and Future Prospects
Venue: arXiv cs.CY 2009
Year: 2009

Telemedicine refers to the use of information and communication technology to provide and support health care mainly for the purpose of providing consultation. It is also a way to provide medical procedures or examinations to remote locations. It has the potential to improve both the quality and the access to health care services delivery while lowering costs even in the scarcity of resources. Understanding the potentiality of telemedicine, many developing countries are implementing telemedicine to provide health care facility to remote area where health care facilities are deficient. Bangladesh is not an exception to this either. In this paper we mention the reasons why Bangladesh has to move for telemedicine. We also present the past and on-going telemedicine activities and projects in Bangladesh. Analyzing these projects we have found out some factors which should be assessed carefully for successful implementation of telemedicine application. Finally we propose a prototype telemedicine network for Bangladesh that can improve health facilities through telemedicine by making a connection between rural health facility providers and special hospitals.