OpenRaiser/Intern-Atlas huggingface dataset:
Protocol design and stability/delay analysis of half-duplex buffered cognitive relay systems
Venue: arXiv cs.IT 2010
Year: 2010

In this paper, we quantify the benefits of employing relay station in large-coverage cognitive radio systems which opportunistically access the licensed spectrum of some small-coverage primary systems scattered inside. Through analytical study, we show that even a simple decode-and-forward (SDF) relay, which can hold only one packet, offers significant path-loss gain in terms of the spatial transmission opportunities and link reliability. However, such scheme fails to capture the spatial-temporal burstiness of the primary activities, that is, when either the source-relay (SR) link or relay-destination (RD) link is blocked by the primary activities, the cognitive spectrum access has to stop. To overcome this obstacle, we further propose buffered decode-and-forward (BDF) protocol. By exploiting the infinitely long buffer at the relay, the blockage time on either SR or RD link is saved for cognitive spectrum access. The buffer gain is shown analytically to improve the stability region and average end-to-end delay performance of the cognitive relay system.
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs
Venue: arXiv cs.CC 2010
Year: 2010

The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [Bod90],[YBFT99]. We give restricted space algorithms for these problems proving the following results: - Isomorphism for bounded tree distance width graphs is in L and thus complete for the class. We also show that for this kind of graphs a canon can be computed within logspace. - For bounded treewidth graphs, when both input graphs are given together with a tree decomposition, the problem of whether there is an isomorphism which respects the decompositions (i.e. considering only isomorphisms mapping bags in one decomposition blockwise onto bags in the other decomposition) is in L. - For bounded treewidth graphs, when one of the input graphs is given with a tree decomposition the isomorphism problem is in LogCFL. - As a corollary the isomorphism problem for bounded treewidth graphs is in LogCFL. This improves the known TC1 upper bound for the problem given by Grohe and Verbitsky [GroVer06].
The Role of Head-Up Display in Computer- Assisted Instruction
Venue: arXiv cs.HC 2010
Year: 2010

We investigated the role of HUDs in CAI. HUDs have been used in various situations in daily lives by recent downsizing and cost down of the display devices. CAI is one of the promising applications for HUDs. We have developed an HUD-based CAI system for effectively presenting instructions of the equipment in the transportable earth station. This chapter described HUDs in CAI from a viewpoint of human-computer interaction based on the development experience.
The Labor Economics of Paid Crowdsourcing
Venue: arXiv cs.HC 2010
Year: 2010

Crowdsourcing is a form of "peer production" in which work traditionally performed by an employee is outsourced to an "undefined, generally large group of people in the form of an open call." We present a model of workers supplying labor to paid crowdsourcing projects. We also introduce a novel method for estimating a worker's reservation wage--the smallest wage a worker is willing to accept for a task and the key parameter in our labor supply model. It shows that the reservation wages of a sample of workers from Amazon's Mechanical Turk (AMT) are approximately log normally distributed, with a median wage of $1.38/hour. At the median wage, the point elasticity of extensive labor supply is 0.43. We discuss how to use our calibrated model to make predictions in applied work. Two experimental tests of the model show that many workers respond rationally to offered incentives. However, a non-trivial fraction of subjects appear to set earnings targets. These "target earners" consider not just the offered wage--which is what the rational model predicts--but also their proximity to earnings goals. Interestingly, a number of workers clearly prefer earning total amounts evenly divisible by 5, presumably because these amounts make good targets.
A complete algorithm to find exact minimal polynomial by approximations
Venue: arXiv cs.SC 2010
Year: 2010

We present a complete algorithm for finding an exact minimal polynomial from its approximate value by using an improved parameterized integer relation construction method. Our result is superior to the existence of error controlling on obtaining an exact rational number from its approximation. The algorithm is applicable for finding exact minimal polynomial of an algebraic number by its approximate root. This also enables us to provide an efficient method of converting the rational approximation representation to the minimal polynomial representation, and devise a simple algorithm to factor multivariate polynomials with rational coefficients. Compared with the subsistent methods, our method combines advantage of high efficiency in numerical computation, and exact, stable results in symbolic computation. we also discuss some applications to some transcendental numbers by approximations. Moreover, the Digits of our algorithm is far less than the LLL-lattice basis reduction technique in theory. In this paper, we completely implement how to obtain exact results by numerical approximate computations.
Named Models in Coalgebraic Hybrid Logic
Venue: arXiv cs.LO 2010
Year: 2010

Hybrid logic extends modal logic with support for reasoning about individual states, designated by so-called nominals. We study hybrid logic in the broad context of coalgebraic semantics, where Kripke frames are replaced with coalgebras for a given functor, thus covering a wide range of reasoning principles including, e.g., probabilistic, graded, default, or coalitional operators. Specifically, we establish generic criteria for a given coalgebraic hybrid logic to admit named canonical models, with ensuing completeness proofs for pure extensions on the one hand, and for an extended hybrid language with local binding on the other. We instantiate our framework with a number of examples. Notably, we prove completeness of graded hybrid logic with local binding.
Random Indexing K-tree
Venue: arXiv cs.IR 2010
Year: 2010

Random Indexing (RI) K-tree is the combination of two algorithms for clustering. Many large scale problems exist in document clustering. RI K-tree scales well with large inputs due to its low complexity. It also exhibits features that are useful for managing a changing collection. Furthermore, it solves previous issues with sparse document vectors when using K-tree. The algorithms and data structures are defined, explained and motivated. Specific modifications to K-tree are made for use with RI. Experiments have been executed to measure quality. The results indicate that RI K-tree improves document cluster quality over the original K-tree algorithm.
Linear Probability Forecasting
Venue: arXiv cs.LG 2010
Year: 2010

Multi-class classification is one of the most important tasks in machine learning. In this paper we consider two online multi-class classification problems: classification by a linear model and by a kernelized model. The quality of predictions is measured by the Brier loss function. We suggest two computationally efficient algorithms to work with these problems and prove theoretical guarantees on their losses. We kernelize one of the algorithms and prove theoretical guarantees on its loss. We perform experiments and compare our algorithms with logistic regression.
Multi-cell MIMO Downlink with Fairness Criteria: the Large System Limit
Venue: arXiv cs.IT 2010
Year: 2010

We consider the downlink of a cellular network with multiple cells and multi-antenna base stations including arbitrary inter-cell cooperation, realistic distance-dependent pathloss and general "fairness" requirements. Beyond Monte Carlo simulation, no efficient computation method to evaluate the ergodic throughput of such systems has been provided so far. We propose an analytic method based on the combination of the large random matrix theory with Lagrangian optimization. The proposed method is computationally much more efficient than Monte Carlo simulation and provides a very accurate approximation (almost indistinguishable) for the actual finite-dimensional case, even for of a small number of users and base station antennas. Numerical examples include linear 2-cell and planar three-sectored 7-cell layouts, with no inter-cell cooperation, sector cooperation, and full cooperation.
New ways of scientific publishing and accessing human knowledge inspired by transdisciplinary approaches
Venue: arXiv cs.DL 2010
Year: 2010

Inspired by interdisciplinary work touching biology and microtribology, the authors propose a new, dynamic way of publishing research results, the establishment of a tree of knowledge and the localisation of scientific articles on this tree. 'Technomimetics' is proposed as a new method of knowledge management in science and technology: it shall help find and organise information in an era of over-information. Such ways of presenting and managing research results would be accessible by people with different kinds of backgrounds and levels of education, and allow for full use of the ever- increasing number of scientific and technical publications. This approach would dramatically change and revolutionize the way we are doing science, and contribute to overcoming the three gaps between the world of ideas, inventors, innovators and investors as introduced by Gebeshuber, Gruber and Drack in 2009 for accelerated scientific and technological breakthroughs to improve the human condition. Inspiration for the development of above methods was the fact that - generally - tribologists and biologists do not see many overlaps of their professions. However, both deal with materials, structures and processes. Tribology is omnipresent in biology and many biological systems have impressive tribological properties. Tribologists can therefore get valuable input and inspiration from living systems. The aim of biomimetics is knowledge transfer from biology to technology and successful biomimetics in tribology needs collaboration between biologists and tribologists. Literature search shows that the number of papers regarding biotribology is steadily increasing. However, at the moment, most scientific papers of the other respective field are hard to access and hard to understand, in terms of concepts and specific wording.
The Capacity of Finite-State Channels in the High-Noise Regime
Venue: arXiv cs.IT 2010
Year: 2010

This paper considers the derivative of the entropy rate of a hidden Markov process with respect to the observation probabilities. The main result is a compact formula for the derivative that can be evaluated easily using Monte Carlo methods. It is applied to the problem of computing the capacity of a finite-state channel (FSC) and, in the high-noise regime, the formula has a simple closed-form expression that enables series expansion of the capacity of a FSC. This expansion is evaluated for a binary-symmetric channel under a (0,1) run-length limited constraint and an intersymbol-interference channel with Gaussian noise.
Decisional Processes with Boolean Neural Network: the Emergence of Mental Schemes
Venue: arXiv cs.AI 2010
Year: 2010

Human decisional processes result from the employment of selected quantities of relevant information, generally synthesized from environmental incoming data and stored memories. Their main goal is the production of an appropriate and adaptive response to a cognitive or behavioral task. Different strategies of response production can be adopted, among which haphazard trials, formation of mental schemes and heuristics. In this paper, we propose a model of Boolean neural network that incorporates these strategies by recurring to global optimization strategies during the learning session. The model characterizes as well the passage from an unstructured/chaotic attractor neural network typical of data-driven processes to a faster one, forward-only and representative of schema-driven processes. Moreover, a simplified version of the Iowa Gambling Task (IGT) is introduced in order to test the model. Our results match with experimental data and point out some relevant knowledge coming from psychological domain.
An information inequality and evaluation of Marton's inner bound for binary input broadcast channels
Venue: arXiv cs.IT 2010
Year: 2010

We establish an information inequality that is intimately connected to the evaluation of the sum rate given by Marton's inner bound for two receiver broadcast channels with a binary input alphabet. This generalizes a recent result where the inequality was established for a particular channel, the binary skew-symmetric broadcast channel. The inequality implies that randomized time-division strategy indeed achieves the sum rate of Marton's inner bound for all binary input broadcast channels.
Performance of Optimum Combining in a Poisson Field of Interferers and Rayleigh Fading Channels
Venue: arXiv cs.IT 2010
Year: 2010

This paper studies the performance of antenna array processing in distributed multiple access networks without power control. The interference is represented as a Poisson point process. Desired and interfering signals are subject to both path-loss fading (with an exponent greater than 2) and to independent Rayleigh fading. Using these assumptions, we derive the exact closed form expression for the cumulative distribution function of the output signal-to-interference-plus-noise ratio when optimum combining is applied. This results in a pertinent measure of the network performance in terms of the outage probability, which in turn provides insights into the network capacity gain that could be achieved with antenna array processing. We present and discuss examples of applications, as well as some numerical results.
Fooling functions of halfspaces under product distributions
Venue: arXiv cs.CC 2010
Year: 2010

We construct pseudorandom generators that fool functions of halfspaces (threshold functions) under a very broad class of product distributions. This class includes not only familiar cases such as the uniform distribution on the discrete cube, the uniform distribution on the solid cube, and the multivariate Gaussian distribution, but also includes any product of discrete distributions with probabilities bounded away from 0. Our first main result shows that a recent pseudorandom generator construction of Meka and Zuckerman [MZ09], when suitably modifed, can fool arbitrary functions of d halfspaces under product distributions where each coordinate has bounded fourth moment. To eps-fool any size-s, depth-d decision tree of halfspaces, our pseudorandom generator uses seed length O((d log(ds/eps)+log n) log(ds/eps)). For monotone functions of d halfspaces, the seed length can be improved to O((d log(d/eps)+log n) log(d/eps)). We get better bounds for larger eps; for example, to 1/polylog(n)-fool all monotone functions of (log n)= log log n halfspaces, our generator requires a seed of length just O(log n). Our second main result generalizes the work of Diakonikolas et al. [DGJ+09] to show that bounded independence suffices to fool functions of halfspaces under product distributions. Assuming each coordinate satisfies a certain stronger moment condition, we show that any function computable by a size-s, depth-d decision tree of halfspaces is eps-fooled by O(d^4s^2/eps^2)-wise independence.
Tiling for Performance Tuning on Different Models of GPUs
Venue: arXiv cs.DC 2010
Year: 2010

The strategy of using CUDA-compatible GPUs as a parallel computation solution to improve the performance of programs has been more and more widely approved during the last two years since the CUDA platform was released. Its benefit extends from the graphic domain to many other computationally intensive domains. Tiling, as the most general and important technique, is widely used for optimization in CUDA programs. New models of GPUs with better compute capabilities have, however, been released, new versions of CUDA SDKs were also released. These updated compute capabilities must to be considered when optimizing using the tiling technique. In this paper, we implement image interpolation algorithms as a test case to discuss how different tiling strategies affect the program's performance. We especially focus on how the different models of GPUs affect the tiling's effectiveness by executing the same program on two different models of GPUs equipped testing platforms. The results demonstrate that an optimized tiling strategy on one GPU model is not always a good solution when execute on other GPU models, especially when some external conditions were changed.
Infinite-message Interactive Function Computation in Collocated Networks
Venue: arXiv cs.IT 2010
Year: 2010

An interactive function computation problem in a collocated network is studied in a distributed block source coding framework. With the goal of computing a desired function at the sink, the source nodes exchange messages through a sequence of error-free broadcasts. The infinite-message minimum sum-rate is viewed as a functional of the joint source pmf and is characterized as the least element in a partially ordered family of functionals having certain convex-geometric properties. This characterization leads to a family of lower bounds for the infinite-message minimum sum-rate and a simple optimality test for any achievable infinite-message sum-rate. An iterative algorithm for evaluating the infinite-message minimum sum-rate functional is proposed and is demonstrated through an example of computing the minimum function of three sources.
Fusion Discrete Logarithm Problems
Venue: arXiv cs.CR 2010
Year: 2010

The Discrete Logarithm Problem is well-known among cryptographers, for its computational hardness that grants security to some of the most commonly used cryptosystems these days. Still, many of these are limited to a small number of candidate algebraic structures which permit implementing the algorithms. In order to extend the applicability of discrete-logarithm-based cryptosystems to a much richer class of algebraic structures, we present a generalized form of exponential function. Our extension relaxes some assumptions on the exponent, which is no longer required to be an integer. Using an axiomatic characterization of the exponential function, we show how to construct mappings that obey the same rules as exponentials, but can raise vectors to the power of other vectors in an algebraically sound manner. At the same time, computational hardness is not affected (in fact, the problem could possibly be strengthened). Setting up standard cryptosystems in terms of our generalized exponential function is simple and requires no change to the existing security proofs. This opens the field for building much more general schemes than the ones known so far.
Web-Based Expert System for Civil Service Regulations: RCSES
Venue: arXiv cs.AI 2010
Year: 2010

Internet and expert systems have offered new ways of sharing and distributing knowledge, but there is a lack of researches in the area of web based expert systems. This paper introduces a development of a web-based expert system for the regulations of civil service in the Kingdom of Saudi Arabia named as RCSES. It is the first time to develop such system (application of civil service regulations) as well the development of it using web based approach. The proposed system considers 17 regulations of the civil service system. The different phases of developing the RCSES system are presented, as knowledge acquiring and selection, ontology and knowledge representations using XML format. XML Rule-based knowledge sources and the inference mechanisms were implemented using ASP.net technique. An interactive tool for entering the ontology and knowledge base, and the inferencing was built. It gives the ability to use, modify, update, and extend the existing knowledge base in an easy way. The knowledge was validated by experts in the domain of civil service regulations, and the proposed RCSES was tested, verified, and validated by different technical users and the developers staff. The RCSES system is compared with other related web based expert systems, that comparison proved the goodness, usability, and high performance of RCSES.
The Peacock Encryption Method
Venue: arXiv cs.CR 2010
Year: 2010

Here is described a preliminary method that enables secure 'anti-search-engine' encryption, where the middleman can participate in the encrypted information exchange, without being able to understand the exchanged information, encrypted using a one-way function, as well as being unaware of one of two main exchange participants.
Optimal incorporation of sparsity information by weighted $\ell_1$ optimization
Venue: arXiv cs.IT 2010
Year: 2010

Compressed sensing of sparse sources can be improved by incorporating prior knowledge of the source. In this paper we demonstrate a method for optimal selection of weights in weighted $L_1$ norm minimization for a noiseless reconstruction model, and show the improvements in compression that can be achieved.
Architecture of Network Management Tools for Heterogeneous System
Venue: arXiv cs.NI 2010
Year: 2010

Managing heterogeneous network systems is a difficult task because each of these networks has its own curious management system. These networks usually are constructed on independent management protocols which are not compatible with each other. This results in the coexistence of many management systems with different managing functions and services across enterprises. Incompatibility of different management systems makes management of whole system a very complex and often complicated job. Ideally, it is necessary to implement centralized metalevel management across distributed heterogeneous systems and their underlying supporting network systems where the information flow and guidance is provided via a single console or single operating panels which integrates all the management functions in spite of their individual protocols and structures. This paper attempts to provide a novel network management tool architecture which supports heterogeneous managements across many different architectural platforms. Furthermore, an architectural approach to integrate heterogeneous network is proposed. This architecture takes into account both wireless fixed and mobile nodes.
A New Image Steganography Based On First Component Alteration Technique
Venue: arXiv cs.MM 2010
Year: 2010

In this paper, A new image steganography scheme is proposed which is a kind of spatial domain technique. In order to hide secret data in cover-image, the first component alteration technique is used. Techniques used so far focuses only on the two or four bits of a pixel in a image (at the most five bits at the edge of an image) which results in less peak to signal noise ratio and high root mean square error. In this technique, 8 bits of blue components of pixels are replaced with secret data bits. Proposed scheme can embed more data than previous schemes and shows better image quality. To prove this scheme, several experiments are performed, and are compared the experimental results with the related previous works.