OpenRaiser/Intern-Atlas huggingface dataset:
A Trustworthy and well-organized data disseminating scheme for ad-hoc wsns
Venue: arXiv cs.NI 2010
Year: 2010

Wireless Sensor Networks (WSNs) generate massive amount of live data and events sensed through dispersedly deployed tiny sensors. This generated data needed to be disseminate to the sink with slight consumption of network resources. One of the ways to efficiently transmit this bulk data is gossiping. An important consideration in gossip-based dissemination protocols is to keep routing table up to date. Considering the inherent resource constrained nature of adhoc wireless sensor networks, we propose a gossip based protocol that consumes little resources. Our proposed scheme aims to keep the routing table size R as low as possible yet it ensures that the diameter is small too. We learned the performance of our proposed protocol through simulations. Results show that our proposed protocol attains major improvement in network reachability and connectivity.
Defuzzification Method for a Faster and More Accurate Control
Venue: arXiv cs.OH 2010
Year: 2010

Today manufacturers are using fuzzy logic in everything from cameras to industrial process control. Fuzzy logic controllers are easier to design and so are cheaper to produce. Fuzzy logic captures the impreciseness inherent in most input data. Electromechanical controllers respond better to imprecise input if their behavior was modeled on spontaneous human reasoning. In a conventional PID controller, what is modeled is the system or process being controlled, whereas in the Fuzzy logic controller, the focus is the human operator behavior. In the first case, the system is modeled analytically by a set of differential equations and their solutions tells the PID controllers how to adjust the system's control parameters for each type of behavior required 3. In the Fuzzy controller these adjustments are handled by a Fuzzy rule based expert system. A logical model of the thinking process a person might go through in the course of manipulating the system. This shift in focus from process to person involved changes the entire approach to automatic control problems.
A Discussion of Thin Client Technology for Computer Labs
Venue: arXiv cs.OH 2010
Year: 2010

Computer literacy is not negotiable for any professional in an increasingly computerised environment. Educational institutions should be equipped to provide this new basic training for modern life. Accordingly, computer labs are an essential medium for education in almost any field. Computer labs are one of the most popular IT infrastructures for technical training in primary and secondary schools, universities and other educational institutions all over the world. Unfortunately, a computer lab is expensive, in terms of both initial purchase and annual maintenance costs, and especially when we want to run the latest software. Hence, research efforts addressing computer lab efficiency, performance or cost reduction would have a worldwide repercussion. In response to this concern, this paper presents a survey on thin client technology for computer labs in educational environments. Besides setting out the advantages and drawbacks of this technology, we aim to refute false prejudices against thin clients, identifying a set of educational scenarios where thin clients are a better choice and others requiring traditional solutions.
Chains-into-Bins Processes
Venue: arXiv cs.DS 2010
Year: 2010

The study of {\em balls-into-bins processes} or {\em occupancy problems} has a long history. These processes can be used to translate realistic problems into mathematical ones in a natural way. In general, the goal of a balls-into-bins process is to allocate a set of independent objects (tasks, jobs, balls) to a set of resources (servers, bins, urns) and, thereby, to minimize the maximum load. In this paper, we analyze the maximum load for the {\em chains-into-bins} problem, which is defined as follows. There are $n$ bins, and $m$ objects to be allocated. Each object consists of balls connected into a chain of length $\ell$, so that there are $m \ell$ balls in total. We assume the chains cannot be broken, and that the balls in one chain have to be allocated to $\ell$ consecutive bins. We allow each chain $d$ independent and uniformly random bin choices for its starting position. The chain is allocated using the rule that the maximum load of any bin receiving a ball of that chain is minimized. We show that, for $d \ge 2$ and $m\cdot\ell=O(n)$, the maximum load is $((\ln \ln m)/\ln d) +O(1)$ with probability $1-\tilde O(1/m^{d-1})$.
General Classes of Lower Bounds on the Probability of Error in Multiple Hypothesis Testing
Venue: arXiv cs.IT 2010
Year: 2010

In this paper, two new classes of lower bounds on the probability of error for $m$-ary hypothesis testing are proposed. Computation of the minimum probability of error which is attained by the maximum a-posteriori probability (MAP) criterion is usually not tractable. The new classes are derived using Holder's inequality and reverse Holder's inequality. The bounds in these classes provide good prediction of the minimum probability of error in multiple hypothesis testing. The new classes generalize and extend existing bounds and their relation to some existing upper bounds is presented. It is shown that the tightest bounds in these classes asymptotically coincide with the optimum probability of error provided by the MAP criterion for binary or multiple hypothesis testing problem. These bounds are compared with other existing lower bounds in several typical detection and classification problems in terms of tightness and computational complexity.
Saturation Throughput - Delay Analysis of IEEE 802.11 DCF in Fading Channel
Venue: arXiv cs.NI 2010
Year: 2010

In this paper, we analytically analyzed the impact of an error-prone channel over all performance measures in a trafficsaturated IEEE 802.11 WLAN. We calculated station's transmission probability by using the modified Markov chain model of the backoff window size that considers the frame-error rates and maximal allowable number of retransmission attempts. The frame error rate has a significant impact over theoretical throughput, mean frame delay, and discard probability. The peak throughput of a WLAN is insensitive of the maximal number of retransmissions. Discard probabilities are insensitive to the station access method, Basic or RTS/CTS.
Virtual Texturing
Venue: arXiv cs.GR 2010
Year: 2010

In this thesis a rendering system and an accompanying tool chain for Virtual Texturing is presented. Our tools allow to automatically retexture existing geometry in order to apply unique texturing on each face. Furthermore we investigate several techniques that try to minimize visual artifacts in the case that only a small amount of pages can be streamed per frame. We analyze the influence of different heuristics that are responsible for the page selection. Alongside these results we present a measurement method to allow the comparison of our heuristics.
Self-Organized Authentication Architecture for Mobile Ad-hoc Networks
Venue: arXiv cs.CR 2010
Year: 2010

This work proposes a new architecture, called Global Authentication Scheme for Mobile Ad-hoc Networks (GASMAN), for fully distributed and self-organized authentication. In this paper apart from describing all the GASMAN components, special emphasis is placed on proving that it fulfils every requirement of a secure distributed authentication scheme, including limited physical protection of broadcast medium, frequent route changes caused by mobility, lack of structured hierarchy, etc. Furthermore, an extensive analysis through simulation experiments in different scenarios is described and discussed.
Exploration of AWGNC and BSC Pseudocodeword Redundancy
Venue: arXiv cs.IT 2010
Year: 2010

The AWGNC, BSC, and max-fractional pseudocodeword redundancy of a code is defined as the smallest number of rows in a parity-check matrix such that the corresponding minimum pseudoweight is equal to the minimum Hamming distance of the code. This paper provides new results on the AWGNC, BSC, and max-fractional pseudocodeword redundancies of codes. The pseudocodeword redundancies for all codes of small length (at most 9) are computed. Also, comprehensive results are provided on the cases of cyclic codes of length at most 250 for which the eigenvalue bound of Vontobel and Koetter is sharp.
Groebner bases in Java with applications in computer graphics
Venue: arXiv cs.MS 2010
Year: 2010

In this paper we present a Java implementation of the algorithm that computes Buchbereger's and reduced Groebner's basis step by step. The Java application enables graphical representation of the intersection of two surfaces in 3-dimensional space and determines conditions of existence and planarity of the intersection.
A Study on Potential of Integrating Multimodal Interaction into Musical Conducting Education
Venue: arXiv cs.MM 2010
Year: 2010

With the rapid development of computer technology, computer music has begun to appear in the laboratory. Many potential utility of computer music is gradually increasing. The purpose of this paper is attempted to analyze the possibility of integrating multimodal interaction such as vision-based hand gesture and speech interaction into musical conducting education. To achieve this purpose, this paper is focus on discuss some related research and the traditional musical conducting education. To do so, six musical conductors had been interviewed to share their musical conducting learning/ teaching experience. These interviews had been analyzed in this paper to show the syllabus and the focus of musical conducting education for beginners.
Democracy, essential element of the electronic government
Venue: arXiv cs.CY 2010
Year: 2010

This paper emphasizes a determinant aim of identifying different approaches, as comparing to the education and democracy ways specific to e-government system. Introducing the information technology should offer the possibility by which reform processes of the government should become more efficient, transparent and much more public for the citizens; in this way, their ability of participating directly to government activities should prove the carrying out of a democratic and free frame. One of the essential issues of such phenomenon is that of proving that adopting the information and communication technology programs to government process or electronic government depends upon a series of external factors, such as the level of state's development, the cultural level, the frame of developing the structures of central and local public authority, criteria that differentiate the applicability of such system, to various countries. This difference is especially seen as comparing to the East states of European Union. Information systems can be applied in order to allow the citizens to monitor and coordinate the providing of local services; such exchanges have created trust and the feeling of influence, encouraging the participation to political life. Carrying into effect the new informational technologies, aiming to issuing, informing and to participation of citizens to political life, will model the concept of democracy within a new frame.
Molecular Programming Pseudo-code Representation to Molecular Electronics
Venue: arXiv cs.PL 2010
Year: 2010

This research paper is proposing the idea of pseudo code representation to molecular programming used in designing molecular electronics devices. Already the schematic representation of logical gates like AND, OR, NOT etc.from molecular diodes or resonant tunneling diode are available. This paper is setting a generic pseudo code model so that various logic gates can be formulated. These molecular diodes have designed from organic molecules or Bio-molecules. Our focus is on to give a scenario of molecular computation through molecular programming. We have restricted our study to molecular rectifying diode and logic device as AND gate from organic molecules only.
Combining Multiple Feature Extraction Techniques for Handwritten Devnagari Character Recognition
Venue: arXiv cs.CV 2010
Year: 2010

In this paper we present an OCR for Handwritten Devnagari Characters. Basic symbols are recognized by neural classifier. We have used four feature extraction techniques namely, intersection, shadow feature, chain code histogram and straight line fitting features. Shadow features are computed globally for character image while intersection features, chain code histogram features and line fitting features are computed by dividing the character image into different segments. Weighted majority voting technique is used for combining the classification decision obtained from four Multi Layer Perceptron(MLP) based classifier. On experimentation with a dataset of 4900 samples the overall recognition rate observed is 92.80% as we considered top five choices results. This method is compared with other recent methods for Handwritten Devnagari Character Recognition and it has been observed that this approach has better success rate than other methods.
Bio-Authentication based Secure Transmission System using Steganography
Venue: arXiv cs.CR 2010
Year: 2010

Biometrics deals with identity verification of an individual by using certain physiological or behavioral features associated with a person. Biometric identification systems using fingerprints patterns are called AFIS (Automatic Fingerprint Identification System). In this paper a composite method for Fingerprint recognition is considered using a combination of Fast Fourier Transform (FFT) and Sobel Filters for improvement of a poor quality fingerprint image. Steganography hides messages inside other messages in such a way that an "adversary" would not even know a secret message were present. The objective of our paper is to make a bio-secure system. In this paper bio-authentication has been implemented in terms of finger print recognition and the second part of the paper is an interactive steganographic system hides the user's data by two options- creating a songs list or hiding the data in an image.
Distantly Labeling Data for Large Scale Cross-Document Coreference
Venue: arXiv cs.AI 2010
Year: 2010

Cross-document coreference, the problem of resolving entity mentions across multi-document collections, is crucial to automated knowledge base construction and data mining tasks. However, the scarcity of large labeled data sets has hindered supervised machine learning research for this task. In this paper we develop and demonstrate an approach based on ``distantly-labeling'' a data set from which we can train a discriminative cross-document coreference model. In particular we build a dataset of more than a million people mentions extracted from 3.5 years of New York Times articles, leverage Wikipedia for distant labeling with a generative model (and measure the reliability of such labeling); then we train and evaluate a conditional random field coreference model that has factors on cross-document entities as well as mention-pairs. This coreference model obtains high accuracy in resolving mentions and entities that are not present in the training data, indicating applicability to non-Wikipedia data. Given the large amount of data, our work is also an exercise demonstrating the scalability of our approach.
Bayesian Cramér-Rao Bound for Noisy Non-Blind and Blind Compressed Sensing
Venue: arXiv cs.IT 2010
Year: 2010

In this paper, we address the theoretical limitations in reconstructing sparse signals (in a known complete basis) using compressed sensing framework. We also divide the CS to non-blind and blind cases. Then, we compute the Bayesian Cramer-Rao bound for estimating the sparse coefficients while the measurement matrix elements are independent zero mean random variables. Simulation results show a large gap between the lower bound and the performance of the practical algorithms when the number of measurements are low.
Global Modeling and Prediction of Computer Network Traffic
Venue: arXiv cs.NI 2010
Year: 2010

We develop a probabilistic framework for global modeling of the traffic over a computer network. This model integrates existing single-link (-flow) traffic models with the routing over the network to capture the global traffic behavior. It arises from a limit approximation of the traffic fluctuations as the time--scale and the number of users sharing the network grow. The resulting probability model is comprised of a Gaussian and/or a stable, infinite variance components. They can be succinctly described and handled by certain 'space-time' random fields. The model is validated against simulated and real data. It is then applied to predict traffic fluctuations over unobserved links from a limited set of observed links. Further, applications to anomaly detection and network management are briefly discussed.
Lightweight Mutual Authentication Protocol for Low Cost RFID Tags
Venue: arXiv cs.CR 2010
Year: 2010

Radio Frequency Identification (RFID) technology one of the most promising technologies in the field of ubiquitous computing. Indeed, RFID technology may well replace barcode technology. Although it offers many advantages over other identification systems, there are also associated security risks that are not easy to be addressed. When designing a real lightweight authentication protocol for low cost RFID tags, a number of challenges arise due to the extremely limited computational, storage and communication abilities of Low-cost RFID tags. This paper proposes a real mutual authentication protocol for low cost RFID tags. The proposed protocol prevents passive attacks as active attacks are discounted when designing a protocol to meet the requirements of low cost RFID tags. However the implementation of the protocol meets the limited abilities of low cost RFID tags.
Physically-based particle simulation and visualization of pastes and gels
Venue: arXiv cs.GR 2010
Year: 2010

This paper is focused on the question of simulation and visualiza- tion of 3D gel and paste dynamic effects. In a first part, we introduce a 3D physically based particle (or mass-interaction) model, with a small number of masses and few powerful interaction parameters, which is able to generate the dynamic features of both gels and pastes. This model proves that the 3D mass-interaction method is relevant for the simulation of such phenomena, without an explicit knowledge of their underly- ing physics. In a second part, we expose an original rendering process, the Flow Structuring Method that enhances the dynamic properties of the simulation and offers a realistic visualization. This process ignores all the properties of the underlying physical model. It leads to a reconstruction of the spatial structure of the gel (or paste) flow only through an analysis of the output of the simula- tion which is a set of unorganized points moving in a 3D space. Finally, the paper presents realistic renderings obtained by using implicit surfaces and ray-tracing techniques on the Structured Flow previously obtained.
Defining and Mining Functional Dependencies in Probabilistic Databases
Venue: arXiv cs.DB 2010
Year: 2010

Functional dependencies -- traditional, approximate and conditional are of critical importance in relational databases, as they inform us about the relationships between attributes. They are useful in schema normalization, data rectification and source selection. Most of these were however developed in the context of deterministic data. Although uncertain databases have started receiving attention, these dependencies have not been defined for them, nor are fast algorithms available to evaluate their confidences. This paper defines the logical extensions of various forms of functional dependencies for probabilistic databases and explores the connections between them. We propose a pruning-based exact algorithm to evaluate the confidence of functional dependencies, a Monte-Carlo based algorithm to evaluate the confidence of approximate functional dependencies and algorithms for their conditional counterparts in probabilistic databases. Experiments are performed on both synthetic and real data evaluating the performance of these algorithms in assessing the confidence of dependencies and mining them from data. We believe that having these dependencies and algorithms available for probabilistic databases will drive adoption of probabilistic data storage in the industry.
Adapting Mathematical Domain Reasoners
Venue: arXiv cs.MS 2010
Year: 2010

Mathematical learning environments help students in mastering mathematical knowledge. Mature environments typically offer thousands of interactive exercises. Providing feedback to students solving interactive exercises requires domain reasoners for doing the exercise-specific calculations. Since a domain reasoner has to solve an exercise in the same way a student should solve it, the structure of domain reasoners should follow the layered structure of the mathematical domains. Furthermore, learners, teachers, and environment builders have different requirements for adapting domain reasoners, such as providing more details, disallowing or enforcing certain solutions, and combining multiple mathematical domains in a new domain. In previous work we have shown how domain reasoners for solving interactive exercises can be expressed in terms of rewrite strategies, rewrite rules, and views. This paper shows how users can adapt and configure such domain reasoners to their own needs. This is achieved by enabling users to explicitly communicate the components that are used for solving an exercise.
(Unconditional) Secure Multiparty Computation with Man-in-the-middle Attacks
Venue: arXiv cs.CR 2010
Year: 2010

In secure multi-party computation $n$ parties jointly evaluate an $n$-variate function $f$ in the presence of an adversary which can corrupt up till $t$ parties. Almost all the works that have appeared in the literature so far assume the presence of authenticated channels between the parties. This assumption is far from realistic. Two directions of research have been borne from relaxing this (strong) assumption: (a) The adversary is virtually omnipotent and can control all the communication channels in the network, (b) Only a partially connected topology of authenticated channels is guaranteed and adversary controls a subset of the communication channels in the network. This work introduces a new setting for (unconditional) secure multiparty computation problem which is an interesting intermediate model with respect to the above well studied models from the literature (by sharing a salient feature from both the above models). We consider the problem of (unconditional) secure multi-party computation when 'some' of the communication channels connecting the parties can be corrupted passively as well as actively. For this setting, some honest parties may be connected to several other honest parties via corrupted channels and may not be able to authentically communicate with them. Such parties may not be assured the canonical guarantees of correctness or privacy. We present refined definitions of security for this new intermediate model of unconditional multiparty computation. We show how to adapt protocols for (Unconditional) secure multiparty computation to realize the definitions and also argue the tightness of the results achieved by us.