OpenRaiser/Intern-Atlas huggingface dataset:
(RCFT) ReClustering Formation Technique in Hierarchical Sensor Network
Venue: arXiv cs.NI 2009
Year: 2009

TBecause of limited energy of nodes, an important issue for sensor network is efficient use of the energy. The clustering technique reduces energy consumption as cluster head sends sensed information to a sink node. Because of such character of clustering technique, electing cluster head is an important element for networks. This paper proposes RCFT (ReClustering Formation Technique) that reconstruct clusters in hierarchical sensor networks. RCFT is a protocol that reconstructed clusters considering position of a cluster head and nodes in randomly constructed clusters. And this paper demonstrated that clusters are composed evenly through simulation, accordingly this simulation shows the result reducing energy consumption.
Large Families of Optimal Two-Dimensional Optical Orthogonal Codes
Venue: arXiv cs.IT 2009
Year: 2009

Nine new 2-D OOCs are presented here, all sharing the common feature of a code size that is much larger in relation to the number of time slots than those of constructions appearing previously in the literature. Each of these constructions is either optimal or asymptotically optimal with respect to either the original Johnson bound or else a non-binary version of the Johnson bound introduced in this paper. The first 5 codes are constructed using polynomials over finite fields - the first construction is optimal while the remaining 4 are asymptotically optimal. The next two codes are constructed using rational functions in place of polynomials and these are asymptotically optimal. The last two codes, also asymptotically optimal, are constructed by composing two of the above codes with a constant weight binary code. Also presented, is a three-dimensional OOC that exploits the polarization dimension. Finally, phase-encoded optical CDMA is considered and construction of two efficient codes are provided.
Accelerating the pace of discovery by changing the peer review algorithm
Venue: arXiv cs.DL 2009
Year: 2009

The number of scientific publications is constantly rising, increasing the strain on the review process. The number of submissions is actually higher, as each manuscript is often reviewed several times before publication. To face the deluge of submissions, top journals reject a considerable fraction of manuscripts without review, potentially declining manuscripts with merit. The situation is frustrating for authors, reviewers and editors alike. Recently, several editors wrote about the ``tragedy of the reviewer commons', advocating for urgent corrections to the system. Almost every scientist has ideas on how to improve the system, but it is very difficult, if not impossible, to perform experiments to test which measures would be most effective. Surprisingly, relatively few attempts have been made to model peer review. Here I implement a simulation framework in which ideas on peer review can be quantitatively tested. I incorporate authors, reviewers, manuscripts and journals into an agent-based model and a peer review system emerges from their interactions. As a proof-of-concept, I contrast an implementation of the current system, in which authors decide the journal for their submissions, with a system in which journals bid on manuscripts for publication. I show that, all other things being equal, this latter system solves most of the problems currently associated with the peer review process. Manuscripts' evaluation is faster, authors publish more and in better journals, and reviewers' effort is optimally utilized. However, more work is required from editors. This modeling framework can be used to test other solutions for peer review, leading the way for an improvement of how science is disseminated.
Algorithm as Defining Dynamic Systems
Venue: arXiv cs.DS 2009
Year: 2009

This paper proposes a new view to algorithms, Algorithms as defining dynamic systems. This view extends the traditional, deterministic view that an algorithm is a step by step procedure with nondeterminism. As a dynamic system can be designed by a set of its defining laws, it is also desirable to design an algorithm by a (possibly nondeterministic) set of defining laws. This observation requires some changes to algorithm development. We propose a two step approach, the first step is to design an algorithm via a set of defining laws of dynamic system. The second step is to translate these laws (written in a natural language) into a formal language such as linear logic.
A Wavelet-Based Digital Watermarking for Video
Venue: arXiv cs.MM 2009
Year: 2009

A novel video watermarking system operating in the three dimensional wavelet transform is here presented. Specifically the video sequence is partitioned into spatio temporal units and the single shots are projected onto the 3D wavelet domain. First a grayscale watermark image is decomposed into a series of bitplanes that are preprocessed with a random location matrix. After that the preprocessed bitplanes are adaptively spread spectrum and added in 3D wavelet coefficients of the video shot. Our video watermarking algorithm is robust against the attacks of frame dropping, averaging and swapping. Furthermore, it allows blind retrieval of embedded watermark which does not need the original video and the watermark is perceptually invisible. The algorithm design, evaluation, and experimentation of the proposed scheme are described in this paper.
A Cost Effective RFID Based Customized DVD-ROM to Thwart Software Piracy
Venue: arXiv cs.CR 2009
Year: 2009

Software piracy has been a very perilous adversary of the software based industry, from the very beginning of the development of the latter into a significant business. There has been no developed foolproof system that has been developed to appropriately tackle this vile issue. We have in our scheme tried to develop a way to embark upon this problem using a very recently developed technology of RFID.
Novel Intrusion Detection using Probabilistic Neural Network and Adaptive Boosting
Venue: arXiv cs.NE 2009
Year: 2009

This article applies Machine Learning techniques to solve Intrusion Detection problems within computer networks. Due to complex and dynamic nature of computer networks and hacking techniques, detecting malicious activities remains a challenging task for security experts, that is, currently available defense systems suffer from low detection capability and high number of false alarms. To overcome such performance limitations, we propose a novel Machine Learning algorithm, namely Boosted Subspace Probabilistic Neural Network (BSPNN), which integrates an adaptive boosting technique and a semi parametric neural network to obtain good tradeoff between accuracy and generality. As the result, learning bias and generalization variance can be significantly minimized. Substantial experiments on KDD 99 intrusion benchmark indicate that our model outperforms other state of the art learning algorithms, with significantly improved detection accuracy, minimal false alarms and relatively small computational complexity.
Proposed platform for improving grid security by trust management system
Venue: arXiv cs.CR 2009
Year: 2009

With increasing the applications of grid system, the risk in security field is enhancing too. Recently Trust management system has been recognized as a noticeable approach in enhancing of security in grid systems. In this article due to improve the grid security a new trust management system with two levels is proposed. The benefits of this platform are adding new domain in grid system, selecting one service provider which has closest adaption with user requests and using from domains security attribute as an important factor in computing the trust value.
Optimization and Evaluation of Nested Queries and Procedures
Venue: arXiv cs.DB 2009
Year: 2009

Many database applications perform complex data retrieval and update tasks. Nested queries, and queries that invoke user-defined functions, which are written using a mix of procedural and SQL constructs, are often used in such applications. A straight-forward evaluation of such queries involves repeated execution of parameterized sub-queries or blocks containing queries and procedural code. An important problem that arises while optimizing nested queries as well as queries with joins, aggregates and set operations is the problem of finding an optimal sort order from a factorial number of possible sort orders. We show that even a special case of this problem is NP-Hard, and present practical heuristics that are effective and easy to incorporate in existing query optimizers. We also consider iterative execution of queries and updates inside complex procedural blocks such as user-defined functions and stored procedures. Parameter batching is an important means of improving performance as it enables set-orientated processing. The key challenge to parameter batching lies in rewriting a given procedure/function to process a batch of parameter values. We propose a solution, based on program analysis and rewrite rules, to automate the generation of batched forms of procedures and replace iterative database calls within imperative loops with a single call to the batched form. We present experimental results for the proposed techniques, and the results show significant gains in performance.
ANN-based Innovative Segmentation Method for Handwritten text in Assamese
Venue: arXiv cs.CL 2009
Year: 2009

Artificial Neural Network (ANN) s has widely been used for recognition of optically scanned character, which partially emulates human thinking in the domain of the Artificial Intelligence. But prior to recognition, it is necessary to segment the character from the text to sentences, words etc. Segmentation of words into individual letters has been one of the major problems in handwriting recognition. Despite several successful works all over the work, development of such tools in specific languages is still an ongoing process especially in the Indian context. This work explores the application of ANN as an aid to segmentation of handwritten characters in Assamese- an important language in the North Eastern part of India. The work explores the performance difference obtained in applying an ANN-based dynamic segmentation algorithm compared to projection- based static segmentation. The algorithm involves, first training of an ANN with individual handwritten characters recorded from different individuals. Handwritten sentences are separated out from text using a static segmentation method. From the segmented line, individual characters are separated out by first over segmenting the entire line. Each of the segments thus obtained, next, is fed to the trained ANN. The point of segmentation at which the ANN recognizes a segment or a combination of several segments to be similar to a handwritten character, a segmentation boundary for the character is assumed to exist and segmentation performed. The segmented character is next compared to the best available match and the segmentation boundary confirmed.
Enhanced Trustworthy and High-Quality Information Retrieval System for Web Search Engines
Venue: arXiv cs.IR 2009
Year: 2009

The WWW is the most important source of information. But, there is no guarantee for information correctness and lots of conflicting information is retrieved by the search engines and the quality of provided information also varies from low quality to high quality. We provide enhanced trustworthiness in both specific (entity) and broad (content) queries in web searching. The filtering of trustworthiness is based on 5 factors: Provenance, Authority, Age, Popularity, and Related Links. The trustworthiness is calculated based on these 5 factors and it is stored thereby increasing the performance in retrieving trustworthy websites. The calculated trustworthiness is stored only for static websites. Quality is provided based on policies selected by the user. Quality based ranking of retrieved trusted information is provided using WIQA (Web Information Quality Assessment) Framework.
Hybrid, Optical and Wireless Near-Gigabit Communications System
Venue: arXiv cs.NI 2009
Year: 2009

This paper presents the study and the realization of a hybrid 60 GHz wireless communications system. As the 60 GHz radio link operates only in a single-room configuration, an additional Radio over Fibre (RoF) link is used to ensure the communications in all the rooms of a residential environment. A single carrier architecture is adopted. The system uses low complexity baseband processing modules. A byte/frame synchronization technique is designed to provide a high value of the preamble detection probability and a very small value of the false alarm probability. Conventional RS (255, 239) encoder and decoder are used to correct errors in the transmission channel. Results of Bit Error Rate (BER) measurements are presented for various antennas configurations.
Ergodic Fading One-sided Interference Channels without State Information at Transmitters
Venue: arXiv cs.IT 2009
Year: 2009

This work studies the capacity region of a two-user ergodic interference channel with fading, where only one of the users is subject to interference from the other user, and the channel state information (CSI) is only available at the receivers. A layered erasure model with one-sided interference and with arbitrary fading statistics is studied first, whose capacity region is completely determined as a polygon. Each dominant rate pair can be regarded as the outcome of a trade-off between the rate gain of the interference-free user and the rate loss of the other user due to interference. Using insights from the layered erasure model, inner and outer bounds of the capacity region are provided for the one-sided fading Gaussian interference channels. In particular, the inner bound is achieved by artificially creating layers in the signaling of the interference-free user. The outer bound is developed by characterizing a similar trade-off as in the erasure model by taking a "layered" view using the incremental channel approach. Furthermore, the gap between the inner and outer bounds is no more than 12.772 bits per channel use per user, regardless of the signal-to-noise ratios and fading statistics.
Sharp Dichotomies for Regret Minimization in Metric Spaces
Venue: arXiv cs.DS 2009
Year: 2009

The Lipschitz multi-armed bandit (MAB) problem generalizes the classical multi-armed bandit problem by assuming one is given side information consisting of a priori upper bounds on the difference in expected payoff between certain pairs of strategies. Classical results of (Lai and Robbins 1985) and (Auer et al. 2002) imply a logarithmic regret bound for the Lipschitz MAB problem on finite metric spaces. Recent results on continuum-armed bandit problems and their generalizations imply lower bounds of $\sqrt{t}$, or stronger, for many infinite metric spaces such as the unit interval. Is this dichotomy universal? We prove that the answer is yes: for every metric space, the optimal regret of a Lipschitz MAB algorithm is either bounded above by any $f\in ω(\log t)$, or bounded below by any $g\in o(\sqrt{t})$. Perhaps surprisingly, this dichotomy does not coincide with the distinction between finite and infinite metric spaces; instead it depends on whether the completion of the metric space is compact and countable. Our proof connects upper and lower bound techniques in online learning with classical topological notions such as perfect sets and the Cantor-Bendixson theorem. Among many other results, we show a similar dichotomy for the "full-feedback" (a.k.a., "best-expert") version.
The relation between Pearson's correlation coefficient r and Salton's cosine measure
Venue: arXiv cs.IR 2009
Year: 2009

The relation between Pearson's correlation coefficient and Salton's cosine measure is revealed based on the different possible values of the division of the L1-norm and the L2-norm of a vector. These different values yield a sheaf of increasingly straight lines which form together a cloud of points, being the investigated relation. The theoretical results are tested against the author co-citation relations among 24 informetricians for whom two matrices can be constructed, based on co-citations: the asymmetric occurrence matrix and the symmetric co-citation matrix. Both examples completely confirm the theoretical results. The results enable us to specify an algorithm which provides a threshold value for the cosine above which none of the corresponding Pearson correlations would be negative. Using this threshold value can be expected to optimize the visualization of the vector space.
Information Geometry and Evolutionary Game Theory
Venue: arXiv cs.IT 2009
Year: 2009

The Shahshahani geometry of evolutionary game theory is realized as the information geometry of the simplex, deriving from the Fisher information metric of the manifold of categorical probability distributions. Some essential concepts in evolutionary game theory are realized information-theoretically. Results are extended to the Lotka-Volterra equation and to multiple population systems.
Managing Innovation and Technology in Developing Countries
Venue: arXiv cs.CY 2009
Year: 2009

Innovation and technology management is an inevitable issue in the high end technological and innovative organizations. Today, most of the innovations are limited with developed countries like USA, Japan and Europe while developing countries are still behind in the field of innovation and management of technology. But it is also becoming a subject for rapid progress and development in developing countries. Innovation and technology environment in developing countries are by nature, problematic, characterized by poor business models, political instability and governance conditions, low education level and lack of world-class research universities, an underdeveloped and mediocre physical infrastructure, and lack of solid technology based on trained human resources. This paper provides a theoretical and conceptual framework analysis for managing innovation and technology in developing countries like India and China. We present the issues and challenges in innovation and technology management and come up with proposed solutions.
Biological Computing Fundamentals and Futures
Venue: arXiv cs.CE 2009
Year: 2009

The fields of computing and biology have begun to cross paths in new ways. In this paper a review of the current research in biological computing is presented. Fundamental concepts are introduced and these foundational elements are explored to discuss the possibilities of a new computing paradigm. We assume the reader to possess a basic knowledge of Biology and Computer Science
Multi-Objective Optimisation Method for Posture Prediction and Analysis with Consideration of Fatigue Effect and its Application Case
Venue: arXiv cs.RO 2009
Year: 2009

Automation technique has been widely used in manufacturing industry, but there are still manual handling operations required in assembly and maintenance work in industry. Inappropriate posture and physical fatigue might result in musculoskeletal disorders (MSDs) in such physical jobs. In ergonomics and occupational biomechanics, virtual human modelling techniques have been employed to design and optimize the manual operations in design stage so as to avoid or decrease potential MSD risks. In these methods, physical fatigue is only considered as minimizing the muscle or joint stress, and the fatigue effect along time for the posture is not considered enough. In this study, based on the existing methods and multiple objective optimisation method (MOO), a new posture prediction and analysis method is proposed for predicting the optimal posture and evaluating the physical fatigue in the manual handling operation. The posture prediction and analysis problem is mathematically described and a special application case is demonstrated for analyzing a drilling assembly operation in European Aeronautic Defence & Space Company (EADS) in this paper.
Different goals in multiscale simulations and how to reach them
Venue: arXiv cs.AI 2009
Year: 2009

In this paper we sum up our works on multiscale programs, mainly simulations. We first start with describing what multiscaling is about, how it helps perceiving signal from a background noise in a ?ow of data for example, for a direct perception by a user or for a further use by another program. We then give three examples of multiscale techniques we used in the past, maintaining a summary, using an environmental marker introducing an history in the data and finally using a knowledge on the behavior of the different scales to really handle them at the same time.
GEDI: Scalable Algorithms for Genotype Error Detection and Imputation
Venue: arXiv cs.DS 2009
Year: 2009

Genome-wide association studies generate very large datasets that require scalable analysis algorithms. In this report we describe the GEDI software package, which implements efficient algorithms for performing several common tasks in the analysis of population genotype data, including genotype error detection and correction, imputation of both randomly missing and untyped genotypes, and genotype phasing. Experimental results show that GEDI achieves high accuracy with a runtime scaling linearly with the number of markers and samples. The open source C++ code of GEDI, released under the GNU General Public License, is available for download at http://dna.engr.uconn.edu/software/GEDI/
On a Gel'fand-Yaglom-Peres theorem for f-divergences
Venue: arXiv cs.IT 2009
Year: 2009

It is shown that the $f$-divergence between two probability measures $P$ and $R$ equals the supremum of the same $f$-divergence computed over all finite measurable partitions of the original space, thus generalizing results previously proved by Gel'fand and Yaglom and by Peres for the Information Divergence and more recently by Dukkipati, Bhatnagar and Murty for the Tsallis' and Renyi's divergences.
Pseudo-Power Avoidance
Venue: arXiv cs.FL 2009
Year: 2009

Repetition avoidance has been studied since Thue's work. In this paper, we considered another type of repetition, which is called pseudo-power. This concept is inspired by Watson-Crick complementarity in DNA sequence and is defined over an antimorphic involution $ϕ$. We first classify the alphabet $Σ$ and the antimorphic involution $ϕ$, under which there exists sufficiently long pseudo-$k$th-power-free words. Then we present algorithms to test whether a finite word $w$ is pseudo-$k$th-power-free.
A New Look at the Classical Entropy of Written English
Venue: arXiv cs.CL 2009
Year: 2009

A simple method for finding the entropy and redundancy of a reasonable long sample of English text by direct computer processing and from first principles according to Shannon theory is presented. As an example, results on the entropy of the English language have been obtained based on a total of 20.3 million characters of written English, considering symbols from one to five hundred characters in length. Besides a more realistic value of the entropy of English, a new perspective on some classic entropy-related concepts is presented. This method can also be extended to other Latin languages. Some implications for practical applications such as plagiarism-detection software, and the minimum number of words that should be used in social Internet network messaging, are discussed.