OpenRaiser/Intern-Atlas huggingface dataset:
Mapping the Geography of Science: Distribution Patterns and Networks of Relations among Cities and Institutes
Venue: arXiv cs.DL 2010
Year: 2010

Using Google Earth, Google Maps and/or network visualization programs such as Pajek, one can overlay the network of relations among addresses in scientific publications on the geographic map. We discuss the pros en cons of the various options, and provide software (freeware) for bridging existing gaps between the Science Citation Indices and Scopus, on the one side, and these various visualization tools, on the other. At the level of city names, the global map can be drawn reliably on the basis of the available address information. At the level of the names of organizations and institutes, there are problems of unification both in the ISI-databases and Scopus. Pajek enables us to combine the visualization with statistical analysis, whereas the Google Maps and its derivates provide superior tools at the Internet.
Computing coset leaders of binary codes
Venue: arXiv cs.IT 2010
Year: 2010

We present an algorithm for computing the set of all coset leaders of a binary code $\mathcal C \subset \mathbb{F}_2^n$. The method is adapted from some of the techniques related to the computation of Gröbner representations associated with codes. The algorithm provides a Gröbner representation of the binary code and the set of coset leaders $\mathrm{CL}(\mathcal C)$. Its efficiency stands of the fact that its complexity is linear on the number of elements of $\mathrm{CL}(\mathcal C)$, which is smaller than exhaustive search in $\mathbb{F}_2^n$.
Asymptotic Capacity of Large Fading Relay Networks with Random Node Failures
Venue: arXiv cs.IT 2010
Year: 2010

To understand the network response to large-scale physical attacks, we investigate the asymptotic capacity of a half-duplex fading relay network with random node failures when the number of relays $N$ is infinitely large. In this paper, a simplified independent attack model is assumed where each relay node fails with a certain probability. The noncoherent relaying scheme is considered, which corresponds to the case of zero forward-link channel state information (CSI) at the relays. Accordingly, the whole relay network can be shown equivalent to a Rayleigh fading channel, where we derive the $ε$-outage capacity upper bound according to the multiple access (MAC) cut-set, and the $ε$-outage achievable rates for both the amplify-and-forward (AF) and decode-and-forward (DF) strategies. Furthermore, we show that the DF strategy is asymptotically optimal as the outage probability $ε$ goes to zero, with the AF strategy strictly suboptimal over all signal to noise ratio (SNR) regimes. Regarding the rate loss due to random attacks, the AF strategy suffers a less portion of rate loss than the DF strategy in the high SNR regime, while the DF strategy demonstrates more robust performance in the low SNR regime.
A Rate-Distortion Exponent Approach to Multiple Decoding Attempts for Reed-Solomon Codes
Venue: arXiv cs.IT 2010
Year: 2010

Algorithms based on multiple decoding attempts of Reed-Solomon (RS) codes have recently attracted new attention. Choosing decoding candidates based on rate-distortion (R-D) theory, as proposed previously by the authors, currently provides the best performance-versus-complexity trade-off. In this paper, an analysis based on the rate-distortion exponent (RDE) is used to directly minimize the exponential decay rate of the error probability. This enables rigorous bounds on the error probability for finite-length RS codes and leads to modest performance gains. As a byproduct, a numerical method is derived that computes the rate-distortion exponent for independent non-identical sources. Analytical results are given for errors/erasures decoding.
Solar Still Coupled With Solar Collector and Storage Tank
Venue: arXiv cs.OH 2010
Year: 2010

Acute shortage of good, clean drinking water is a major problem for most developing countries of the world. In most cases, ponds, streams, wells and rivers are often polluted that they are unsafe for direct use as drinking water >.Often water sources are brackish and or contain harmful bacteria. Therefore cannot be used for drinking .In addition there are many coastal locations where sea water is abundant but potable water is not available. Solar distillation is one of the important methods of utilizing solar energy for the supply of potable water to small communities where natural supply of fresh water is inadequate or of poor quality .In this direction an experimental performance analysis was carried out on a single basin still compared with FPC coupled one. Test were carried out for different water samples namely borewell water, sea water, river water for a water depth of 20 mm
Local algorithms in (weakly) coloured graphs
Venue: arXiv cs.DC 2010
Year: 2010

A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum dominating set problem and the maximum matching problem in 2-coloured and weakly 2-coloured graphs. In a weakly 2-coloured graph, both problems admit a local algorithm with the approximation factor $(Δ+1)/2$, where $Δ$ is the maximum degree of the graph. We also give a matching lower bound proving that there is no local algorithm with a better approximation factor for either of these problems. Furthermore, we show that the stronger assumption of a 2-colouring does not help in the case of the dominating set problem, but there is a local approximation scheme for the maximum matching problem in 2-coloured graphs.
Extraction de termes, reconnaissance et labellisation de relations dans un thésaurus
Venue: arXiv cs.IR 2010
Year: 2010

Within the documentary system domain, the integration of thesauri for indexing and retrieval information steps is usual. In libraries, documents own rich descriptive information made by librarians, under descriptive notice based on Rameau thesaurus. We exploit two kinds of information in order to create a first semantic structure. A step of conceptualization allows us to define the various modules used to automatically build the semantic structure of the indexation work. Our current work focuses on an approach that aims to define an ontology based on a thesaurus. We hope to integrate new knowledge characterizing the territory of our structure (adding "toponyms" and links between concepts) thanks to a geographic information system (GIS).
Caractérisation des défauts d'une surface sphérique par décomposition modale
Venue: arXiv cs.OH 2010
Year: 2010

The [ISO 1101] standard specifies the form errors with geometrical tolerances using the zone concept.To complete this concept, we present a generic method which adapts to any geometry and allows to describe any kind of errors. Thus,we can dissociate the part errors according to reference categories: position, orientation,form, waviness and roughnesses. Starting from a cloud of poinds representing the error measurement, the "modal" method decompose, like Fourier series,this error in a sum of sorted errors according to the ircomplexity degree (a number of "wavinesses"). In addition, we propose to show, on a simple example, that according to error complexity to be characterized, an interpolation by the modal method allows to optimize the measuring strategy.
Inertial tolerancing and capability indices in an assembly production
Venue: arXiv cs.OH 2010
Year: 2010

Traditional tolerancing considers the conformity of a batch when the batch satisfies the specifications. The characteristic is considered for itself and not according to its incidence in the assembly. Inertial tolerancing proposes another alternative of tolerancing in order to guarantee the final assembly characteristic. The inertia I2 = \sqrt{δ^2 + σ^2} is not toleranced by a tolerance interval but by a scalar representing the maximum inertia that the characteristic should not exceed. We detail how to calculate the inertial tolerances according to two cases, one aims to guarantee an inertia of the assembly characteristic the other a tolerance interval on the assembly characteristic by a Cpk capability index, in the particular but common case of uniform tolerances or more general with non uniform tolerances. An example will be detailed to show the results of the different tolerancing methods.
Feature Level Clustering of Large Biometric Database
Venue: arXiv cs.CV 2010
Year: 2010

This paper proposes an efficient technique for partitioning large biometric database during identification. In this technique feature vector which comprises of global and local descriptors extracted from offline signature are used by fuzzy clustering technique to partition the database. As biometric features posses no natural order of sorting, thus it is difficult to index them alphabetically or numerically. Hence, some supervised criteria is required to partition the search space. At the time of identification the fuzziness criterion is introduced to find the nearest clusters for declaring the identity of query sample. The system is tested using bin-miss rate and performs better in comparison to traditional k-means approach.
VRAC: Theory #1
Venue: arXiv cs.NI 2010
Year: 2010

In order to make full use of geographic routing techniques developed for sensor networks, nodes must be localized. However, traditional localization and virtual localization techniques are dependent either on expensive and sometimes unavailable hardware (e.g. GPS) or on sophisticated localization calculus (e.g. triangulation) which are both error-prone and with a costly overhead. Instead of actually localizing nodes in the physical two-dimensional Euclidean space, we use directly the raw distance to a set of anchors to produce multi-dimensional coordinates. We prove that the image of the physical two-dimensional Euclidean space is a two-dimensional surface, and we show that it is possible to adapt geographic routing strategies on this surface, simply, efficiently and successfully.
Software defined radio layer for IR-UWB systems in Wireless Sensor Network Context
Venue: arXiv cs.NI 2010
Year: 2010

This paper addresses the radio interface problematic for MANET (Mobile Ad-hoc NETwork) applications. Here we propose to study the radio reconfigurability in order to provide a unique physical layer which is able to deal with all MANET applications. For implementing this reconfigurable physical layer, we propose to use Impulse Radio Ultra WideBand (IRUWB). This paper presents also our two level design approach for obtaining our reconfigurable IR-UWB receiver on FPGA (Field Programmable Gate Array).
SOPC Co-Design Platform for UWB Systems in Wireless Sensor Network Context
Venue: arXiv cs.NI 2010
Year: 2010

This paper presents our approach of the radio interface problematic for Wireless Sensor Network. We introduce the WSN context and constraints associated. We propose an IR-UWB solution and illustrate why it could be a viable solution for WSN. A high level modelling and simulation platform for IR-UWB radio interface is proposed on Matlab. It allows us to determine according to BER versus Eb/N0 criteria and the WSN constraints what kind of design is more adequate. Moreover, a co-design co-simulation platform Matlab VHDL is proposed here. Using this platform we designed IR-UWB transceiver having reconfigurable capabilities, such as data rate reconfiguration, time hopping code, spectrum occupation and radio range reconfiguration.
What Can Heterogeneity Add to the Scientometric Map? Steps towards algorithmic historiography
Venue: arXiv cs.DL 2010
Year: 2010

The Actor Network represents heterogeneous entities as actants (Callon et al., 1983; 1986). Although computer programs for the visualization of social networks increasingly allow us to represent heterogeneity in a network using different shapes and colors for the visualization, hitherto this possibility has scarcely been exploited (Mogoutov et al., 2008). In this contribution to the Festschrift, I study the question of what heterogeneity can add specifically to the visualization of a network. How does an integrated network improve on the one-dimensional ones (such as co-word and co-author maps)? The oeuvre of Michel Callon is used as the case materials, that is, his 65 papers which can be retrieved from the (Social) Science Citation Index since 1975.
Medium Access Control for Wireless Sensor Networks based on Impulse Radio Ultra Wideband
Venue: arXiv cs.NI 2010
Year: 2010

This paper describes a detailed performance evaluation of distributed Medium Access Control (MAC) protocols for Wireless Sensor Networks based on Impulse Radio Ultra Wideband (IR-UWB) Physical layer (PHY). Two main classes of Medium Access Control protocol have been considered: Slotted and UnSlotted with reliability. The reliability is based on Automatic Repeat ReQuest (ARQ). The performance evaluation is performed using a complete Wireless Sensor Networks (WSN) simulator built on the Global Mobile Information System Simulator (GloMoSim). The optimal operating parameters are first discussed for IR-UWB in terms of slot size, retransmission delay and the number of retransmission, then a comparison between IR-UWB and other transmission techniques in terms of reliability latency and power efficiency.
Performance Evaluation of Impluse Radio Ultra Wide Band Wireless Sensor Networks
Venue: arXiv cs.NI 2010
Year: 2010

This paper presents a performance evaluation of Wireless Sensor Networks (WSN) based on Impulse Radio Ultra Wideband (IR-UWB) over a new simulation platform developed for this purpose. The simulation platform is built on an existing network simulator: Global Mobile Information System Simulator (GloMoSim). It mainly focuses on the accurately modeling of IR-UWB PHYsical (PHY) and Medium Access Control (MAC) layer. Pulse collision is modeled according to the used time hopping sequence (THS) and the pulse propagation delay in order to increase the simulation fidelity. It also includes a detection and identification application based on a new sensing channel and new sensor device models. The proposed architecture is generic so it can be reused for any simulation platform. The performance evaluation is based on one of the typical WSN applications: local area protection, where sensor nodes are densely scattered in an access regulated area in order to detect, identify and report non authorized accesses to a base station for analysis. Two networks topologies using different protocol stacks are investigated. Their performance evaluation is presented in terms of reliability and latency.
New methodology to design advanced MR-IRUWB communication system
Venue: arXiv cs.NI 2010
Year: 2010

A new model is proposed giving the channel capability of a MB-IR-UWB system versus the number of subband and the duty cycle. The architecture simulated shows data rate ranging from 1.434 Gbits/s to 0.9 Gbits/s for 16 to 10 subbands and duty cycle ranging from 20% to 12%.
Recherche de relations spatio-temporelles : une méthode basée sur l'analyse de corpus textuels
Venue: arXiv cs.IR 2010
Year: 2010

This paper presents a work package realized for the GéOnto project. A new method is proposed for an enrichment of a first geographical ontology developed beforehand. This method relies on text analysis by lexico-syntactic patterns. From the retrieve of n-ary relations the method automatically detect those involved in a spatial and/or temporal relation in a context of a description of journeys.
Simplifying Parallelization of Scientific Codes by a Function-Centric Approach in Python
Venue: arXiv cs.DC 2010
Year: 2010

The purpose of this paper is to show how existing scientific software can be parallelized using a separate thin layer of Python code where all parallel communication is implemented. We provide specific examples on such layers of code, and these examples may act as templates for parallelizing a wide set of serial scientific codes. The use of Python for parallelization is motivated by the fact that the language is well suited for reusing existing serial codes programmed in other languages. The extreme flexibility of Python with regard to handling functions makes it very easy to wrap up decomposed computational tasks of a serial scientific application as Python functions. Many parallelization-specific components can be implemented as generic Python functions, which may take as input those functions that perform concrete computational tasks. The overall programming effort needed by this parallelization approach is rather limited, and the resulting parallel Python scripts have a compact and clean structure. The usefulness of the parallelization approach is exemplified by three different classes of applications in natural and social sciences.
Aggregating Algorithm competing with Banach lattices
Venue: arXiv cs.LG 2010
Year: 2010

The paper deals with on-line regression settings with signals belonging to a Banach lattice. Our algorithms work in a semi-online setting where all the inputs are known in advance and outcomes are unknown and given step by step. We apply the Aggregating Algorithm to construct a prediction method whose cumulative loss over all the input vectors is comparable with the cumulative loss of any linear functional on the Banach lattice. As a by-product we get an algorithm that takes signals from an arbitrary domain. Its cumulative loss is comparable with the cumulative loss of any predictor function from Besov and Triebel-Lizorkin spaces. We describe several applications of our setting.
Performance and Stability of the Chelonia Storage Cloud
Venue: arXiv cs.DC 2010
Year: 2010

In this paper we present the Chelonia storage cloud middleware. It was designed to fill the requirements gap between those of large, sophisticated scientific collaborations which have adopted the grid paradigm for their distributed storage needs, and of corporate business communities which are gravitating towards the cloud paradigm. The similarities to and differences between Chelonia and several well-known grid- and cloud-based storage solutions are commented. The design of Chelonia has been chosen to optimize high reliability and scalability of an integrated system of heterogeneous, geographically dispersed storage sites and the ability to easily expand the system dynamically. The architecture and implementation in term of web-services running inside the Advanced Resource Connector Hosting Environment Dameon (ARC HED) are described. We present results of tests in both local-area and wide-area networks that demonstrate the fault-tolerance, stability and scalability of Chelonia.
A Framework for Agile Development of Component-Based Applications
Venue: arXiv cs.SE 2010
Year: 2010

Agile development processes and component-based software architectures are two software engineering approaches that contribute to enable the rapid building and evolution of applications. Nevertheless, few approaches have proposed a framework to combine agile and component-based development, allowing an application to be tested throughout the entire development cycle. To address this problematic, we have built CALICO, a model-based framework that allows applications to be safely developed in an iterative and incremental manner. The CALICO approach relies on the synchronization of a model view, which specifies the application properties, and a runtime view, which contains the application in its execution context. Tests on the application specifications that require values only known at runtime, are automatically integrated by CALICO into the running application, and the captured needed values are reified at execution time to resume the tests and inform the architect of potential problems. Any modification at the model level that does not introduce new errors is automatically propagated to the running system, allowing the safe evolution of the application. In this paper, we illustrate the CALICO development process with a concrete example and provide information on the current implementation of our framework.
Heuristic Contraction Hierarchies with Approximation Guarantee
Venue: arXiv cs.DS 2010
Year: 2010

We present a new heuristic point-to-point routing algorithm based on contraction hierarchies (CH). Given an epsilon >= 0, we can prove that the length of the path computed by our algorithm is at most (1+epsilon) times the length of the optimal (shortest) path. CH is based on node contraction: removing nodes from a network and adding shortcut edges to preserve shortest path distances. Our algorithm tries to avoid shortcuts even when a replacement path is epsilon times longer.
Odds-On Trees
Venue: arXiv cs.CG 2010
Year: 2010

Let R^d -> A be a query problem over R^d for which there exists a data structure S that can compute P(q) in O(log n) time for any query point q in R^d. Let D be a probability measure over R^d representing a distribution of queries. We describe a data structure called the odds-on tree, of size O(n^ε) that can be used as a filter that quickly computes P(q) for some query values q in R^d and relies on S for the remaining queries. With an odds-on tree, the expected query time for a point drawn according to D is O(H*+1), where H* is a lower-bound on the expected cost of any linear decision tree that solves P. Odds-on trees have a number of applications, including distribution-sensitive data structures for point location in 2-d, point-in-polytope testing in d dimensions, ray shooting in simple polygons, ray shooting in polytopes, nearest-neighbour queries in R^d, point-location in arrangements of hyperplanes in R^d, and many other geometric searching problems that can be solved in the linear-decision tree model. A standard lifting technique extends these results to algebraic decision trees of constant degree. A slightly different version of odds-on trees yields similar results for orthogonal searching problems that can be solved in the comparison tree model.
A CHAID Based Performance Prediction Model in Educational Data Mining
Venue: arXiv cs.LG 2010
Year: 2010

The performance in higher secondary school education in India is a turning point in the academic lives of all students. As this academic performance is influenced by many factors, it is essential to develop predictive data mining model for students' performance so as to identify the slow learners and study the influence of the dominant factors on their academic performance. In the present investigation, a survey cum experimental methodology was adopted to generate a database and it was constructed from a primary and a secondary source. While the primary data was collected from the regular students, the secondary data was gathered from the school and office of the Chief Educational Officer (CEO). A total of 1000 datasets of the year 2006 from five different schools in three different districts of Tamilnadu were collected. The raw data was preprocessed in terms of filling up missing values, transforming values in one form into another and relevant attribute/ variable selection. As a result, we had 772 student records, which were used for CHAID prediction model construction. A set of prediction rules were extracted from CHIAD prediction model and the efficiency of the generated CHIAD prediction model was found. The accuracy of the present model was compared with other model and it has been found to be satisfactory.