OpenRaiser/Intern-Atlas huggingface dataset:
"Mind your p's and q's": or the peregrinations of an apostrophe in 17th Century English
Venue: arXiv cs.CL 2010
Year: 2010

If the use of the apostrophe in contemporary English often marks the Saxon genitive, it may also indicate the omission of one or more let-ters. Some writers (wrongly?) use it to mark the plural in symbols or abbreviations, visual-ised thanks to the isolation of the morpheme "s". This punctuation mark was imported from the Continent in the 16th century. During the 19th century its use was standardised. However the rules of its usage still seem problematic to many, including literate speakers of English. "All too often, the apostrophe is misplaced", or "errant apostrophes are springing up every-where" is a complaint that Internet users fre-quently come across when visiting grammar websites. Many of them detail its various uses and misuses, and attempt to correct the most common mistakes about it, especially its mis-use in the plural, called greengrocers' apostro-phes and humorously misspelled "greengro-cers apostrophe's". While studying English travel accounts published in the seventeenth century, we noticed that the different uses of this symbol may accompany various models of metaplasms. We were able to highlight the linguistic variations of some lexemes, and trace the origin of modern grammar rules gov-erning its usage.
Channel Capacity Limitations versus Hardware Implementation for UWB Impulse Radio Communications
Venue: arXiv cs.NI 2010
Year: 2010

Starting from the Shannon channel capacity, we propose an IR-UWB channel capacity based on the delay spread for multipath time variant channels. This IR-UWB channel capacity is obtained from the no ISI (Inter Symbol Interference) assumption and for binary modulations. The impact of the kind of implementation is considered on the IR-UWB channel capacity. This study is lead for mixed and mostly digital implementation. The key parameters and theirs impacts on the channel capacity are exposed in each case: the data converters for mostly digital implementations and the pulse generator capabilities for mixed implementations. Finally, these two implementations are compared from a data rate point of view. Their behaviors regarding an increase of the operating frequency are also studied.
Some Relations between Divergence Derivatives and Estimation in Gaussian channels
Venue: arXiv cs.IT 2010
Year: 2010

The minimum mean square error of the estimation of a non Gaussian signal where observed from an additive white Gaussian noise channel's output, is analyzed. First, a quite general time-continuous channel model is assumed for which the behavior of the non-Gaussianess of the channel's output for small signal to noise ratio q, is proved. Then, It is assumed that the channel input's signal is composed of a (normalized) sum of N narrowband, mutually independent waves. It is shown that if N goes to infinity, then for any fixed q (no mater how big) both CMMSE and MMSE converge to the signal energy at a rate which is proportional to the inverse of N. Finally, a known result for the MMSE in the one-dimensional case, for small q, is used to show that all the first four terms in the Taylor expansion of the non-Gaussianess of the channel's output equal to zero.
Fastest Distributed Consensus on Path Network
Venue: arXiv cs.IT 2010
Year: 2010

Providing an analytical solution for the problem of finding Fastest Distributed Consensus (FDC) is one of the challenging problems in the field of sensor networks. Most of the methods proposed so far deal with the FDC averaging algorithm problem by numerical convex optimization methods and in general no closed-form solution for finding FDC has been offered up to now except in [3] where the conjectured answer for path has been proved. Here in this work we present an analytical solution for the problem of Fastest Distributed Consensus for the Path network using semidefinite programming particularly solving the slackness conditions, where the optimal weights are obtained by inductive comparing of the characteristic polynomials initiated by slackness conditions.
Gradual sub-lattice reduction and a new complexity for factoring polynomials
Venue: arXiv cs.SC 2010
Year: 2010

We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type structure, where the target vectors are boundably short. For such applications, the complexity of the algorithm improves traditional lattice reduction by replacing some dependence on the bit-length of the input vectors by some dependence on the bound for the output vectors. If the bit-length of the target vectors is unrelated to the bit-length of the input, then our algorithm is only linear in the bit-length of the input entries, which is an improvement over the quadratic complexity floating-point LLL algorithms. To illustrate the usefulness of this algorithm we show that a direct application to factoring univariate polynomials over the integers leads to the first complexity bound improvement since 1984. A second application is algebraic number reconstruction, where a new complexity bound is obtained as well.
Towards a Unified Framework for Declarative Structured Communications
Venue: arXiv cs.PL 2010
Year: 2010

We present a unified framework for the declarative analysis of structured communications. By relying on a (timed) concurrent constraint programming language, we show that in addition to the usual operational techniques from process calculi, the analysis of structured communications can elegantly exploit logic-based reasoning techniques. We introduce a declarative interpretation of the language for structured communications proposed by Honda, Vasconcelos, and Kubo. Distinguishing features of our approach are: the possibility of including partial information (constraints) in the session model; the use of explicit time for reasoning about session duration and expiration; a tight correspondence with logic, which formally relates session execution and linear-time temporal logic formulas.
Discovery of Convoys in Trajectory Databases
Venue: arXiv cs.DB 2010
Year: 2010

As mobile devices with positioning capabilities continue to proliferate, data management for so-called trajectory databases that capture the historical movements of populations of moving objects becomes important. This paper considers the querying of such databases for convoys, a convoy being a group of objects that have traveled together for some time. More specifically, this paper formalizes the concept of a convoy query using density-based notions, in order to capture groups of arbitrary extents and shapes. Convoy discovery is relevant for real-life applications in throughput planning of trucks and carpooling of vehicles. Although there has been extensive research on trajectories in the literature, none of this can be applied to retrieve correctly exact convoy result sets. Motivated by this, we develop three efficient algorithms for convoy discovery that adopt the well-known filter-refinement framework. In the filter step, we apply line-simplification techniques on the trajectories and establish distance bounds between the simplified trajectories. This permits efficient convoy discovery over the simplified trajectories without missing any actual convoys. In the refinement step, the candidate convoys are further processed to obtain the actual convoys. Our comprehensive empirical study offers insight into the properties of the paper's proposals and demonstrates that the proposals are effective and efficient on real-world trajectory data.
The "Hot Potato" Case: Challenges in Multiplayer Pervasive Games Based on Ad hoc Mobile Sensor Networks and the Experimental Evaluation of a Prototype Game
Venue: arXiv cs.HC 2010
Year: 2010

In this work, we discuss multiplayer pervasive games that rely on the use of ad hoc mobile sensor networks. The unique feature in such games is that players interact with each other and their surrounding environment by using movement and presence as a means of performing game-related actions, utilizing sensor devices. We discuss the fundamental issues and challenges related to these type of games and the scenarios associated with them. We also present and evaluate an example of such a game, called the "Hot Potato", developed using the Sun SPOT hardware platform. We provide a set of experimental results, so as to both evaluate our implementation and also to identify issues that arise in pervasive games which utilize sensor network nodes, which show that there is great potential in this type of games.
A Comparative Study of Removal Noise from Remote Sensing Image
Venue: arXiv cs.CV 2010
Year: 2010

This paper attempts to undertake the study of three types of noise such as Salt and Pepper (SPN), Random variation Impulse Noise (RVIN), Speckle (SPKN). Different noise densities have been removed between 10% to 60% by using five types of filters as Mean Filter (MF), Adaptive Wiener Filter (AWF), Gaussian Filter (GF), Standard Median Filter (SMF) and Adaptive Median Filter (AMF). The same is applied to the Saturn remote sensing image and they are compared with one another. The comparative study is conducted with the help of Mean Square Errors (MSE) and Peak-Signal to Noise Ratio (PSNR). So as to choose the base method for removal of noise from remote sensing image.
Mining The Successful Binary Combinations: Methodology and A Simple Case Study
Venue: arXiv cs.DB 2010
Year: 2010

The importance of finding the characteristics leading to either a success or a failure is one of the driving forces of data mining. The various application areas of finding success/failure factors cover vast variety of areas such as credit risk evaluation and granting loans, micro array analysis, health factors and health risk factors, and parameter combination leading to a product success. This paper presents a new approach for making inferences about dichotomous data. The objective is to determine rules that lead to a certain result. The method consists of four phases: in the first phase, the data is processed into a binary format of a truth table, in the second phase; rules are found by utilizing an algorithm that minimizes Boolean functions. In the third phase the rules are checked and filtered. In the fourth phase, simple rules that involve one to two features are revealed.
Efficient Password-Typed Key Agreement Scheme
Venue: arXiv cs.CR 2010
Year: 2010

In this paper, we will study Lee, Kim and Yoo, a verifier password typed key agreement scheme and demonstrate that the scheme is not secure. Then, the authors will propose an enhanced verifier typed key agreement scheme relied on Lee, Kim and Yoo scheme and demonstrate that the propose scheme resists against password guessing attack and stolen verifier attack. The authors are claimed that the proposed scheme is more secure and efficient compare with Lee, Kim and Yoo.
A Strategy to enable Prefix of Multicast VoD through dynamic buffer allocation
Venue: arXiv cs.MM 2010
Year: 2010

In this paper we have proposed a dynamic buffer allocation algorithm for the prefix, based on the popularity of the videos. More cache blocks are allocated for most popular videos and a few cache blocks are allocated for less popular videos. Buffer utilization is also maximized irrespective of the load on the Video-on-Demand system. Overload can lead the server getting slowed down. By storing the first few seconds of popular video clips, a multimedia local server can shield the users from the delay, throughput, and loss properties of the path between the local server and the central server. The key idea of controlled multicast is used to allow clients to share a segment of a video stream even when the requests arrive at different times. This dynamic buffer allocation algorithm is simulated and its performance is evaluated based on the buffer utilization by multimedia servers and average buffer allocation for the most popular videos. Our simulation results shows efficient utilization of network bandwidth and reduced hard disk utilization hence resulting in increase in the number of requests being served.
Geometric Programming Problem with Co-Efficients and Exponents Associated with Binary Numbers
Venue: arXiv cs.NA 2010
Year: 2010

Geometric programming (GP) provides a power tool for solving a variety of optimization problems. In the real world, many applications of geometric programming (GP) are engineering design problems in which some of the problem parameters are estimating of actual values. This paper develops a solution procedure to solve nonlinear programming problems using GP technique by splitting the cost coefficients, constraint coefficients and exponents with the help of binary numbers. The equivalent mathematical programming problems are formulated to find their corresponding value of the objective function based on the duality theorem. The ability of calculating the cost coefficients, constraint coefficients and exponents developed in this paper might help lead to more realistic modeling efforts in engineering design areas. Standard nonlinear programming software has been used to solve the proposed optimization problem. Two numerical examples are presented to illustrate the method.
Efficient Packet Forwarding Approach in Vehicular Ad Hoc Networks Using EBGR Algorithm
Venue: arXiv cs.NI 2010
Year: 2010

VANETs (Vehicular Ad hoc Networks) are highly mobile wireless ad hoc networks and will play an important role in public safety communications and commercial applications. Routing of data in VANETs is a challenging task due to rapidly changing topology and high speed mobility of vehicles. Conventional routing protocols in MANETs (Mobile Ad hoc Networks) are unable to fully address the unique characteristics in vehicular networks. In this paper, we propose EBGR (Edge Node Based Greedy Routing), a reliable greedy position based routing approach to forward packets to the node present in the edge of the transmission range of source/forwarding node as most suitable next hop, with consideration of nodes moving in the direction of the destination. We propose Revival Mobility model (RMM) to evaluate the performance of our routing technique. This paper presents a detailed description of our approach and simulation results show that packet delivery ratio is improved considerably compared to other routing techniques of VANET.
Collecting Coded Coupons over Overlapping Generations
Venue: arXiv cs.IT 2010
Year: 2010

Coding over subsets (known as generations) rather than over all content blocks in P2P distribution networks and other applications is necessary for a number of practical reasons such as computational complexity. A penalty for coding only within generations is an overall throughput reduction. It has been previously shown that allowing contiguous generations to overlap in a head-to-toe manner improves the throughput. We here propose and study a scheme, referred to as the {\it random annex code}, that creates shared packets between any two generations at random rather than only the neighboring ones. By optimizing very few design parameters, we obtain a simple scheme that outperforms both the non-overlapping and the head-to-toe overlapping schemes of comparable computational complexity, both in the expected throughput and in the rate of convergence of the probability of decoding failure to zero. We provide a practical algorithm for accurate analysis of the expected throughput of the random annex code for finite-length information. This algorithm enables us to quantify the throughput vs.computational complexity tradeoff, which is necessary for optimal selection of the scheme parameters.
A Minimum Relative Entropy Controller for Undiscounted Markov Decision Processes
Venue: arXiv cs.AI 2010
Year: 2010

Adaptive control problems are notoriously difficult to solve even in the presence of plant-specific controllers. One way to by-pass the intractable computation of the optimal policy is to restate the adaptive control as the minimization of the relative entropy of a controller that ignores the true plant dynamics from an informed controller. The solution is given by the Bayesian control rule-a set of equations characterizing a stochastic adaptive controller for the class of possible plant dynamics. Here, the Bayesian control rule is applied to derive BCR-MDP, a controller to solve undiscounted Markov decision processes with finite state and action spaces and unknown dynamics. In particular, we derive a non-parametric conjugate prior distribution over the policy space that encapsulates the agent's whole relevant history and we present a Gibbs sampler to draw random policies from this distribution. Preliminary results show that BCR-MDP successfully avoids sub-optimal limit cycles due to its built-in mechanism to balance exploration versus exploitation.
Cuspidal and Noncuspidal Robot Manipulators
Venue: arXiv cs.RO 2010
Year: 2010

This article synthezises the most important results on the kinematics of cuspidal manipulators i.e. nonredundant manipulators that can change posture without meeting a singularity. The characteristic surfaces, the uniqueness domains and the regions of feasible paths in the workspace are defined. Then, several sufficient geometric conditions for a manipulator to be noncuspidal are enumerated and a general necessary and sufficient condition for a manipulator to be cuspidal is provided. An explicit DH-parameter-based condition for an orthogonal manipulator to be cuspidal is derived. The full classification of 3R orthogonal manipulators is provided and all types of cuspidal and noncuspidal orthogonal manipulators are enumerated. Finally, some facts about cuspidal and noncuspidal 6R manipulators are reported.
Refinement and Verification of Real-Time Systems
Venue: arXiv cs.LO 2010
Year: 2010

This paper discusses highly general mechanisms for specifying the refinement of a real-time system as a collection of lower level parallel components that preserve the timing and functional requirements of the upper level specification. These mechanisms are discussed in the context of ASTRAL, which is a formal specification language for real-time systems. Refinement is accomplished by mapping all of the elements of an upper level specification into lower level elements that may be split among several parallel components. In addition, actions that can occur in the upper level are mapped to actions of components operating at the lower level. This allows several types of implementation strategies to be specified in a natural way, while the price for generality (in terms of complexity) is paid only when necessary. The refinement mechanisms are first illustrated using a simple digital circuit; then, through a highly complex phone system; finally, design guidelines gleaned from these specifications are presented.
Implementing Genetic Algorithms on Arduino Micro-Controllers
Venue: arXiv cs.NE 2010
Year: 2010

Since their conception in 1975, Genetic Algorithms have been an extremely popular approach to find exact or approximate solutions to optimization and search problems. Over the last years there has been an enhanced interest in the field with related techniques, such as grammatical evolution, being developed. Unfortunately, work on developing genetic optimizations for low-end embedded architectures hasn't embraced the same enthusiasm. This short paper tackles that situation by demonstrating how genetic algorithms can be implemented in Arduino Duemilanove, a 16 MHz open-source micro-controller, with limited computation power and storage resources. As part of this short paper, the libraries used in this implementation are released into the public domain under a GPL license.
The Fast Haar Wavelet Transform for Signal & Image Processing
Venue: arXiv cs.MM 2010
Year: 2010

A method for the design of Fast Haar wavelet for signal processing and image processing has been proposed. In the proposed work, the analysis bank and synthesis bank of Haar wavelet is modified by using polyphase structure. Finally, the Fast Haar wavelet was designed and it satisfies alias free and perfect reconstruction condition. Computational time and computational complexity is reduced in Fast Haar wavelet transform.
Analysis of Large Scale Propagation Models for Mobile Communications in Urban Area
Venue: arXiv cs.NI 2010
Year: 2010

Channel properties influence the development of wireless communication systems. Unlike wired channels that are stationary and predictable, radio channels are extremely random and dont offer easy analysis. A Radio Propagation Model (RPM), also known as the Radio Wave Propagation Model (RWPM), is an empirical mathematical formulation for the characterization of radio wave propagation as a function of frequency. In mobile radio systems, path loss models are necessary for proper planning, interference estimations, frequency assignments and cell parameters which are the basic for network planning process as well as Location Based Services (LBS) techniques. Propagation models that predict the mean signal strength for an arbitrary transmitter receiver (T R) separation distance which is useful in estimating the radio coverage area of a transmitter are called large scale propagation models, since they characterize signal strength over large TR separation distances. In this paper, the large scale propagation performance of Okumura, Hata, and Lee models has been compared varying Mobile Station (MS) antenna height, Transmitter Receiver (TR) distance and Base Station (BS) antenna height, considering the system to operate at 900 MHz. Through the MATLAB simulation it is turned out that the Okumura model shows the better performance than that of the other large scale propagation models.
Modeling of Human Criminal Behavior using Probabilistic Networks
Venue: arXiv cs.AI 2010
Year: 2010

Currently, criminals profile (CP) is obtained from investigators or forensic psychologists interpretation, linking crime scene characteristics and an offenders behavior to his or her characteristics and psychological profile. This paper seeks an efficient and systematic discovery of nonobvious and valuable patterns between variables from a large database of solved cases via a probabilistic network (PN) modeling approach. The PN structure can be used to extract behavioral patterns and to gain insight into what factors influence these behaviors. Thus, when a new case is being investigated and the profile variables are unknown because the offender has yet to be identified, the observed crime scene variables are used to infer the unknown variables based on their connections in the structure and the corresponding numerical (probabilistic) weights. The objective is to produce a more systematic and empirical approach to profiling, and to use the resulting PN model as a decision tool.
Fighting Online Click-Fraud Using Bluff Ads
Venue: arXiv cs.CR 2010
Year: 2010

Online advertising is currently the greatest source of revenue for many Internet giants. The increased number of specialized websites and modern profiling techniques, have all contributed to an explosion of the income of ad brokers from online advertising. The single biggest threat to this growth, is however, click-fraud. Trained botnets and even individuals are hired by click-fraud specialists in order to maximize the revenue of certain users from the ads they publish on their websites, or to launch an attack between competing businesses. In this note we wish to raise the awareness of the networking research community on potential research areas within this emerging field. As an example strategy, we present Bluff ads; a class of ads that join forces in order to increase the effort level for click-fraud spammers. Bluff ads are either targeted ads, with irrelevant display text, or highly relevant display text, with irrelevant targeting information. They act as a litmus test for the legitimacy of the individual clicking on the ads. Together with standard threshold-based methods, fake ads help to decrease click-fraud levels.