OpenRaiser/Intern-Atlas huggingface dataset:
Heat Sink Performance Analysis through Numerical Technique
Venue: arXiv cs.OH 2010
Year: 2010

The increase in dissipated power per unit area of electronic components sets higher demands on the performance of the heat sink. Also if we continue at our current rate of miniaturisation, laptops and other electronic devices can get heated up tremendously. Hence we require a better heat dissipating system to overcome the excess heat generating problem of using nanoelectronics, which is expected to power the next generation of computers. To handle the excessive and often unpredictable heating up of high performance electronic components like microprocessors, we need to predict the temperature profile of the heat sink used. This also helps us to select the best heat sink for the operating power range of any microprocessor. Understanding the temperature profile of a heat sink and a microprocessor helps us to handle its temperature efficiently for a range of loads. In this work, a method to estimate the normal response of a heat sink to various loads of a microprocessor is explained.
Range-Free Localization with the Radical Line
Venue: arXiv cs.IT 2010
Year: 2010

Due to hardware and computational constraints, wireless sensor networks (WSNs) normally do not take measurements of time-of-arrival or time-difference-of-arrival for rangebased localization. Instead, WSNs in some applications use rangefree localization for simple but less accurate determination of sensor positions. A well-known algorithm for this purpose is the centroid algorithm. This paper presents a range-free localization technique based on the radical line of intersecting circles. This technique provides greater accuracy than the centroid algorithm, at the expense of a slight increase in computational load. Simulation results show that for the scenarios studied, the radical line method can give an approximately 2 to 30% increase in accuracy over the centroid algorithm, depending on whether or not the anchors have identical ranges, and on the value of DOI.
Performance and Fault Tolerance in the StoreTorrent Parallel Filesystem
Venue: arXiv cs.DC 2010
Year: 2010

With a goal of supporting the timely and cost-effective analysis of Terabyte datasets on commodity components, we present and evaluate StoreTorrent, a simple distributed filesystem with integrated fault tolerance for efficient handling of small data records. Our contributions include an application-OS pipelining technique and metadata structure to increase small write and read performance by a factor of 1-10, and the use of peer-to-peer communication of replica-location indexes to avoid transferring data during parallel analysis even in a degraded state. We evaluated StoreTorrent, PVFS, and Gluster filesystems using 70 storage nodes and 560 parallel clients on an 8-core/node Ethernet cluster with directly attached SATA disks. StoreTorrent performed parallel small writes at an aggregate rate of 1.69 GB/s, and supported reads over the network at 8.47 GB/s. We ported a parallel analysis task and demonstrate it achieved parallel reads at the full aggregate speed of the storage node local filesystems.
Girth-12 Quasi-Cyclic LDPC Codes with Consecutive Lengths
Venue: arXiv cs.IT 2010
Year: 2010

A method to construct girth-12 (3,L) quasi-cyclic low-density parity-check (QC-LDPC) codes with all lengths larger than a certain given number is proposed, via a given girth-12 code subjected to some constraints. The lengths of these codes can be arbitrary integers of the form LP, provided that P is larger than a tight lower bound determined by the maximal element within the exponent matrix of the given girth-12 code. By applying the method to the case of row-weight six, we obtained a family of girth-12 (3,6) QC-LDPC codes for arbitrary lengths above 2688, which includes 30 member codes with shorter code lengths compared with the shortest girth-12 (3,6) QC-LDPC codes reported by O'Sullivan.
Digital Mathematics Libraries: The Good, the Bad, the Ugly
Venue: arXiv cs.DL 2010
Year: 2010

The idea of a World digital mathematics library (DML) has been around since the turn of the 21th century. We feel that it is time to make it a reality, starting in a modest way from successful bricks that have already been built, but with an ambitious goal in mind. After a brief historical overview of publishing mathematics, an estimate of the size and a characterisation of the bulk of documents to be included in the DML, we turn to proposing a model for a Reference Digital Mathematics Library--a network of institutions where the digital documents would be physically archived. This pattern based rather on the bottom-up strategy seems to be more practicable and consistent with the digital nature of the DML. After describing the model we summarise what can and should be done in order to accomplish the vision. The current state of some of the local libraries that could contribute to the global views are described with more details.
An Adaptive Dynamic Replacement Approach for a Multicast based Popularity Aware Prefix Cache Memory System
Venue: arXiv cs.MM 2010
Year: 2010

In this paper we have proposed an adaptive dynamic cache replacement algorithm for a multimedia servers cache system. The goal is to achieve an effective utilization of the cache memory which stores the prefix of popular videos. A replacement policy is usually evaluated using hit ratio, the frequency with which any video is requested. Usually discarding the least recently used page is the policy of choice in cache management. The adaptive dynamic replacement approach for prefix cache is a self tuning, low overhead algorithm that responds online to changing access patterns. It constantly balances between lru and lfu to improve combined result. It automatically adapts to evolving workloads. Since in our algorithm we have considered a prefix caching with multicast transmission of popular objects it utilizes the hard disk and network bandwidth efficiently and increases the number of requests being served.
Fingerprint Recognition Using Minutia Score Matching
Venue: arXiv cs.CR 2010
Year: 2010

The popular Biometric used to authenticate a person is Fingerprint which is unique and permanent throughout a person's life. A minutia matching is widely used for fingerprint recognition and can be classified as ridge ending and ridge bifurcation. In this paper we projected Fingerprint Recognition using Minutia Score Matching method (FRMSM). For Fingerprint thinning, the Block Filter is used, which scans the image at the boundary to preserves the quality of the image and extract the minutiae from the thinned image. The false matching ratio is better compared to the existing algorithm.
Optimization of Multiple Vehicle Routing Problems using Approximation Algorithms
Venue: arXiv cs.DC 2010
Year: 2010

This paper deals with generating of an optimized route for multiple Vehicle routing Problems (mVRP). We used a methodology of clustering the given cities depending upon the number of vehicles and each cluster is allotted to a vehicle. k- Means clustering algorithm has been used for easy clustering of the cities. In this way the mVRP has been converted into VRP which is simple in computation compared to mVRP. After clustering, an optimized route is generated for each vehicle in its allotted cluster. Once the clustering had been done and after the cities were allocated to the various vehicles, each cluster/tour was taken as an individual Vehicle Routing problem and the steps of Genetic Algorithm were applied to the cluster and iterated to obtain the most optimal value of the distance after convergence takes place. After the application of the various heuristic techniques, it was found that the Genetic algorithm gave a better result and a more optimal tour for mVRPs in short computational time than other Algorithms due to the extensive search and constructive nature of the algorithm.
Hybrid Workflow Policy Management for Heart Disease Identification
Venue: arXiv cs.OH 2010
Year: 2010

As science technology grows, medical application is becoming more complex to solve the physiological problems within expected time. Workflow management systems (WMS) in Grid computing are promising solution to solve the sophisticated problem such as genomic analysis, drug discovery, disease identification, etc. Although existing WMS can provide basic management functionality in Grid environment, consideration of user requirements such as performance, reliability and interaction with user is missing. In this paper, we propose hybrid workflow management system for heart disease identification and discuss how to guarantee different user requirements according to user SLA. The proposed system is applied to Physio-Grid e-health platform to identify human heart disease with ECG analysis and Virtual Heart Simulation (VHS) workflow applications.
Towards Effective Sentence Simplification for Automatic Processing of Biomedical Text
Venue: arXiv cs.CL 2010
Year: 2010

The complexity of sentences characteristic to biomedical articles poses a challenge to natural language parsers, which are typically trained on large-scale corpora of non-technical text. We propose a text simplification process, bioSimplify, that seeks to reduce the complexity of sentences in biomedical abstracts in order to improve the performance of syntactic parsers on the processed sentences. Syntactic parsing is typically one of the first steps in a text mining pipeline. Thus, any improvement in performance would have a ripple effect over all processing steps. We evaluated our method using a corpus of biomedical sentences annotated with syntactic links. Our empirical results show an improvement of 2.90% for the Charniak-McClosky parser and of 4.23% for the Link Grammar parser when processing simplified sentences rather than the original sentences in the corpus.
Statistical Mechanical Analysis of Compressed Sensing Utilizing Correlated Compression Matrix
Venue: arXiv cs.IT 2010
Year: 2010

We investigate a reconstruction limit of compressed sensing for a reconstruction scheme based on the L1-norm minimization utilizing a correlated compression matrix with a statistical mechanics method. We focus on the compression matrix modeled as the Kronecker-type random matrix studied in research on multi-input multi-output wireless communication systems. We found that strong one-dimensional correlations between expansion bases of original information slightly degrade reconstruction performance.
Extensional and Intensional Strategies
Venue: arXiv cs.GT 2010
Year: 2010

This paper is a contribution to the theoretical foundations of strategies. We first present a general definition of abstract strategies which is extensional in the sense that a strategy is defined explicitly as a set of derivations of an abstract reduction system. We then move to a more intensional definition supporting the abstract view but more operational in the sense that it describes a means for determining such a set. We characterize the class of extensional strategies that can be defined intensionally. We also give some hints towards a logical characterization of intensional strategies and propose a few challenging perspectives.
Superdevelopments for Weak Reduction
Venue: arXiv cs.LO 2010
Year: 2010

We study superdevelopments in the weak lambda calculus of Cagman and Hindley, a confluent variant of the standard weak lambda calculus in which reduction below lambdas is forbidden. In contrast to developments, a superdevelopment from a term M allows not only residuals of redexes in M to be reduced but also some newly created ones. In the lambda calculus there are three ways new redexes may be created; in the weak lambda calculus a new form of redex creation is possible. We present labeled and simultaneous reduction formulations of superdevelopments for the weak lambda calculus and prove them equivalent.
Specification of Products and Product Lines
Venue: arXiv cs.SE 2010
Year: 2010

The study of variability in software development has become increasingly important in recent years. A common mechanism to represent the variability in a product line is by means of feature models. However, the relationship between these models and UML design models is not straightforward. UML statecharts are extended introducing variability in their main components, so that the behavior of product lines can be specified. The contribution of this work is the proposal of a rule-based approach that defines a transformation strategy from extended statecharts to concrete UML statecharts. This is accomplished via the use of feature models, in order to describe the common and variant components, in such a way that, starting from different feature configurations and applying the rule-based method, concrete state machines corresponding to different products of a line can be obtained.
Principal Typings in a Restricted Intersection Type System for Beta Normal Forms with De Bruijn Indices
Venue: arXiv cs.LO 2010
Year: 2010

The lambda-calculus with de Bruijn indices assembles each alpha-class of lambda-terms in a unique term, using indices instead of variable names. Intersection types provide finitary type polymorphism and can characterise normalisable lambda-terms through the property that a term is normalisable if and only if it is typeable. To be closer to computations and to simplify the formalisation of the atomic operations involved in beta-contractions, several calculi of explicit substitution were developed mostly with de Bruijn indices. Versions of explicit substitutions calculi without types and with simple type systems are well investigated in contrast to versions with more elaborate type systems such as intersection types. In previous work, we introduced a de Bruijn version of the lambda-calculus with an intersection type system and proved that it preserves subject reduction, a basic property of type systems. In this paper a version with de Bruijn indices of an intersection type system originally introduced to characterise principal typings for beta-normal forms is presented. We present the characterisation in this new system and the corresponding versions for the type inference and the reconstruction of normal forms from principal typings algorithms. We briefly discuss the failure of the subject reduction property and some possible solutions for it.
Janus: Automatic Ontology Builder from XSD Files
Venue: arXiv cs.DB 2010
Year: 2010

The construction of a reference ontology for a large domain still remains an hard human task. The process is sometimes assisted by software tools that facilitate the information extraction from a textual corpus. Despite of the great use of XML Schema files on the internet and especially in the B2B domain, tools that offer a complete semantic analysis of XML schemas are really rare. In this paper we introduce Janus, a tool for automatically building a reference knowledge base starting from XML Schema files. Janus also provides different useful views to simplify B2B application integration.
Formal Modelling of a Usable Identity Management Solution for Virtual Organisations
Venue: arXiv cs.SE 2010
Year: 2010

This paper attempts to accurately model security requirements for computational grid environments with particular focus on authentication. We introduce the Audited Credential Delegation (ACD) architecture as a solution to some of the virtual organisations identity management usability problems. The approach uses two complementary models: one is state based, described in Z notation, and the other is event-based, expressed in the Process Algebra of Hoare's Communicating Sequential Processes (CSP). The former will be used to capture the state of the WS and to model back-end operations on it whereas the latter will be used to model behavior, and in particular, front-end interactions and communications. The modelling helps to clearly and precisely understand functional and security requirements and provide a basis for verifying that the system meets its intended requirements.
An in-place truncated Fourier transform and applications to polynomial multiplication
Venue: arXiv cs.DS 2010
Year: 2010

The truncated Fourier transform (TFT) was introduced by van der Hoeven in 2004 as a means of smoothing the "jumps" in running time of the ordinary FFT algorithm that occur at power-of-two input sizes. However, the TFT still introduces these jumps in memory usage. We describe in-place variants of the forward and inverse TFT algorithms, achieving time complexity O(n log n) with only O(1) auxiliary space. As an application, we extend the second author's results on space-restricted FFT-based polynomial multiplication to polynomials of arbitrary degree.
An Efficient Hidden Markov Model for Offline Handwritten Numeral Recognition
Venue: arXiv cs.NI 2010
Year: 2010

Traditionally, the performance of ocr algorithms and systems is based on the recognition of isolated characters. When a system classifies an individual character, its output is typically a character label or a reject marker that corresponds to an unrecognized character. By comparing output labels with the correct labels, the number of correct recognition, substitution errors misrecognized characters, and rejects unrecognized characters are determined. Nowadays, although recognition of printed isolated characters is performed with high accuracy, recognition of handwritten characters still remains an open problem in the research arena. The ability to identify machine printed characters in an automated or a semi automated manner has obvious applications in numerous fields. Since creating an algorithm with a one hundred percent correct recognition rate is quite probably impossible in our world of noise and different font styles, it is important to design character recognition algorithms with these failures in mind so that when mistakes are inevitably made, they will at least be understandable and predictable to the person working with the
Implementation of Connectivity and Handover through Wireless Sensor Node based Techniques
Venue: arXiv cs.NI 2010
Year: 2010

In this paper a scheme for handoff and connectivity, based on wireless sensor nodetechniques is proposed. Scenes are created in Qualnet and simulated for a simple case. Results are discussed.
Bulking II: Classifications of Cellular Automata
Venue: arXiv cs.FL 2010
Year: 2010

This paper is the second part of a series of two papers dealing with bulking: a way to define quasi-order on cellular automata by comparing space-time diagrams up to rescaling. In the present paper, we introduce three notions of simulation between cellular automata and study the quasi-order structures induced by these simulation relations on the whole set of cellular automata. Various aspects of these quasi-orders are considered (induced equivalence relations, maximum elements, induced orders, etc) providing several formal tools allowing to classify cellular automata.
Dominion -- A constraint solver generator
Venue: arXiv cs.AI 2010
Year: 2010

This paper proposes a design for a system to generate constraint solvers that are specialised for specific problem models. It describes the design in detail and gives preliminary experimental results showing the feasibility and effectiveness of the approach.
Spectral Analysis of Virus Spreading in Random Geometric Networks
Venue: arXiv cs.MA 2010
Year: 2010

In this paper, we study the dynamics of a viral spreading process in random geometric graphs (RGG). The spreading of the viral process we consider in this paper is closely related with the eigenvalues of the adjacency matrix of the graph. We deduce new explicit expressions for all the moments of the eigenvalue distribution of the adjacency matrix as a function of the spatial density of nodes and the radius of connection. We apply these expressions to study the behavior of the viral infection in an RGG. Based on our results, we deduce an analytical condition that can be used to design RGG's in order to tame an initial viral infection. Numerical simulations are in accordance with our analytical predictions.
Sobolev Duals for Random Frames and Sigma-Delta Quantization of Compressed Sensing Measurements
Venue: arXiv cs.IT 2010
Year: 2010

Quantization of compressed sensing measurements is typically justified by the robust recovery results of Candès, Romberg and Tao, and of Donoho. These results guarantee that if a uniform quantizer of step size $δ$ is used to quantize $m$ measurements $y = Φx$ of a $k$-sparse signal $x \in \R^N$, where $Φ$ satisfies the restricted isometry property, then the approximate recovery $x^#$ via $\ell_1$-minimization is within $O(δ)$ of $x$. The simplest and commonly assumed approach is to quantize each measurement independently. In this paper, we show that if instead an $r$th order $ΣΔ$ quantization scheme with the same output alphabet is used to quantize $y$, then there is an alternative recovery method via Sobolev dual frames which guarantees a reduction of the approximation error by a factor of $(m/k)^{(r-1/2)α}$ for any $0 < α< 1$, if $m \gtrsim_r k (\log N)^{1/(1-α)}$. The result holds with high probability on the initial draw of the measurement matrix $Φ$ from the Gaussian distribution, and uniformly for all $k$-sparse signals $x$ that satisfy a mild size condition on their supports.
Face Identification by SIFT-based Complete Graph Topology
Venue: arXiv cs.CV 2010
Year: 2010

This paper presents a new face identification system based on Graph Matching Technique on SIFT features extracted from face images. Although SIFT features have been successfully used for general object detection and recognition, only recently they were applied to face recognition. This paper further investigates the performance of identification techniques based on Graph matching topology drawn on SIFT features which are invariant to rotation, scaling and translation. Face projections on images, represented by a graph, can be matched onto new images by maximizing a similarity function taking into account spatial distortions and the similarities of the local features. Two graph based matching techniques have been investigated to deal with false pair assignment and reducing the number of features to find the optimal feature set between database and query face SIFT features. The experimental results, performed on the BANCA database, demonstrate the effectiveness of the proposed system for automatic face identification.
Étude et traitement automatique de l'anglais du XVIIe siècle : outils morphosyntaxiques et dictionnaires
Venue: arXiv cs.CL 2010
Year: 2010

In this article, we record the main linguistic differences or singularities of 17th century English, analyse them morphologically and syntactically and propose equivalent forms in contemporary English. We show how 17th century texts may be transcribed into modern English, combining the use of electronic dictionaries with rules of transcription implemented as transducers. Après avoir exposé la constitution du corpus, nous recensons les principales différences ou particularités linguistiques de la langue anglaise du XVIIe siècle, les analysons du point de vue morphologique et syntaxique et proposons des équivalents en anglais contemporain (AC). Nous montrons comment nous pouvons effectuer une transcription automatique de textes anglais du XVIIe siècle en anglais moderne, en combinant l'utilisation de dictionnaires électroniques avec des règles de transcriptions implémentées sous forme de transducteurs.
Individual focus and knowledge contribution
Venue: arXiv cs.CY 2010
Year: 2010

Before contributing new knowledge, individuals must attain requisite background knowledge or skills through schooling, training, practice, and experience. Given limited time, individuals often choose either to focus on few areas, where they build deep expertise, or to delve less deeply and distribute their attention and efforts across several areas. In this paper we measure the relationship between the narrowness of focus and the quality of contribution across a range of both traditional and recent knowledge sharing media, including scholarly articles, patents, Wikipedia, and online question and answer forums. Across all systems, we observe a small but significant positive correlation between focus and quality.