OpenRaiser/Intern-Atlas huggingface dataset:
A Novel Solution to the Short Range Bluetooth Communication
Venue: arXiv cs.NI 2011
Year: 2011

Bluetooth is developed for short range communication. Bluetooth Devices are normally having low power and low cost. This is a wireless communication technology designed to connect phones, laptops and PDAs. The greater availability of portable devices with Bluetooth connectivity imposes wireless connection between enabled devices. On an average the range of Bluetooth devices is about 10 meters. The basic limitation of the Bluetooth communication is this range limitation. In this paper I have studied the limitations of Bluetooth communication and consider range constraint as the major limitation. I propose a new expanded Blue tooth network to overcome the range constraint of Bluetooth device. This creates a network of Bluetooth enabled devices that will include laptops, set top devices and also mobile phones. The main purpose of this proposal is to establish a network will enable the users to communicate outside the range without any range constraint.
High Performance Controllers for Speed and Position Induction Motor Drive using New Reaching Law
Venue: arXiv cs.RO 2011
Year: 2011

This paper present new approach in robust indirect rotor field oriented (IRFOC) induction motor (IM) control. The introduction of new exponential reaching law (ERL) based sliding mode control (SMC) improve significantly the performances compared to the conventional SMC which are well known susceptible to the annoying chattering phenomenon, so, the elimination of the chattering is achieved while simplicity and high performance speed and position tracking are maintained. Simulation results are given to discuss the performances of the proposed control method.
Scaling Up Estimation of Distribution Algorithms For Continuous Optimization
Venue: arXiv cs.NE 2011
Year: 2011

Since Estimation of Distribution Algorithms (EDA) were proposed, many attempts have been made to improve EDAs' performance in the context of global optimization. So far, the studies or applications of multivariate probabilistic model based continuous EDAs are still restricted to rather low dimensional problems (smaller than 100D). Traditional EDAs have difficulties in solving higher dimensional problems because of the curse of dimensionality and their rapidly increasing computational cost. However, scaling up continuous EDAs for higher dimensional optimization is still necessary, which is supported by the distinctive feature of EDAs: Because a probabilistic model is explicitly estimated, from the learnt model one can discover useful properties or features of the problem. Besides obtaining a good solution, understanding of the problem structure can be of great benefit, especially for black box optimization. We propose a novel EDA framework with Model Complexity Control (EDA-MCC) to scale up EDAs. By using Weakly dependent variable Identification (WI) and Subspace Modeling (SM), EDA-MCC shows significantly better performance than traditional EDAs on high dimensional problems. Moreover, the computational cost and the requirement of large population sizes can be reduced in EDA-MCC. In addition to being able to find a good solution, EDA-MCC can also produce a useful problem structure characterization. EDA-MCC is the first successful instance of multivariate model based EDAs that can be effectively applied a general class of up to 500D problems. It also outperforms some newly developed algorithms designed specifically for large scale optimization. In order to understand the strength and weakness of EDA-MCC, we have carried out extensive computational studies of EDA-MCC. Our results have revealed when EDA-MCC is likely to outperform others on what kind of benchmark functions.
A Survey on Open Problems for Mobile Robots
Venue: arXiv cs.RO 2011
Year: 2011

Gathering mobile robots is a widely studied problem in robotic research. This survey first introduces the related work, summarizing models and results. Then, the focus shifts on the open problem of gathering fat robots. In this context, "fat" means that the robot is not represented by a point in a bidimensional space, but it has an extent. Moreover, it can be opaque in the sense that other robots cannot "see through" it. All these issues lead to a redefinition of the original problem and an extension of the CORDA model. For at most 4 robots an algorithm is provided in the literature, but is gathering always possible for n>4 fat robots? Another open problem is considered: Boundary Patrolling by mobile robots. A set of mobile robots with constraints only on speed and visibility is working in a polygonal environment having boundary and possibly obstacles. The robots have to perform a perpetual movement (possibly within the environment) so that the maximum timespan in which a point of the boundary is not being watched by any robot is minimized.
Repeated Games With Intervention: Theory and Applications in Communications
Venue: arXiv cs.IT 2011
Year: 2011

In communication systems where users share common resources, users' selfish behavior usually results in suboptimal resource utilization. There have been extensive works that model communication systems with selfish users as one-shot games and propose incentive schemes to achieve Pareto optimal action profiles as non-cooperative equilibria. However, in many communication systems, due to strong negative externalities among users, the sets of feasible payoffs in one-shot games are nonconvex. Thus, it is possible to expand the set of feasible payoffs by having users choose convex combinations of different payoffs. In this paper, we propose a repeated game model generalized by intervention. First, we use repeated games to convexify the set of feasible payoffs in one-shot games. Second, we combine conventional repeated games with intervention, originally proposed for one-shot games, to achieve a larger set of equilibrium payoffs and loosen requirements for users' patience to achieve it. We study the problem of maximizing a welfare function defined on users' equilibrium payoffs, subject to minimum payoff guarantees. Given the optimal equilibrium payoff, we derive the minimum intervention capability required and design corresponding equilibrium strategies. The proposed generalized repeated game model applies to various communication systems, such as power control and flow control.
A more appropriate Protein Classification using Data Mining
Venue: arXiv cs.CE 2011
Year: 2011

Research in bioinformatics is a complex phenomenon as it overlaps two knowledge domains, namely, biological and computer sciences. This paper has tried to introduce an efficient data mining approach for classifying proteins into some useful groups by representing them in hierarchy tree structure. There are several techniques used to classify proteins but most of them had few drawbacks on their grouping. Among them the most efficient grouping technique is used by PSIMAP. Even though PSIMAP (Protein Structural Interactome Map) technique was successful to incorporate most of the protein but it fails to classify the scale free property proteins. Our technique overcomes this drawback and successfully maps all the protein in different groups, including the scale free property proteins failed to group by PSIMAP. Our approach selects the six major attributes of protein: a) Structure comparison b) Sequence Comparison c) Connectivity d) Cluster Index e) Interactivity f) Taxonomic to group the protein from the databank by generating a hierarchal tree structure. The proposed approach calculates the degree (probability) of similarity of each protein newly entered in the system against of existing proteins in the system by using probability theorem on each six properties of proteins.
The asymptotic behavior of Grassmannian codes
Venue: arXiv cs.DM 2011
Year: 2011

The iterated Johnson bound is the best known upper bound on a size of an error-correcting code in the Grassmannian $\mathcal{G}_q(n,k)$. The iterated Schönheim bound is the best known lower bound on the size of a covering code in $\mathcal{G}_q(n,k)$. We use probabilistic methods to prove that both bounds are asymptotically attained for fixed $k$ and fixed radius, as $n$ approaches infinity. We also determine the asymptotics of the size of the best Grassmannian codes and covering codes when $n-k$ and the radius are fixed, as $n$ approaches infinity.
8-Valent Fuzzy Logic for Iris Recognition and Biometry
Venue: arXiv cs.AI 2011
Year: 2011

This paper shows that maintaining logical consistency of an iris recognition system is a matter of finding a suitable partitioning of the input space in enrollable and unenrollable pairs by negotiating the user comfort and the safety of the biometric system. In other words, consistent enrollment is mandatory in order to preserve system consistency. A fuzzy 3-valued disambiguated model of iris recognition is proposed and analyzed in terms of completeness, consistency, user comfort and biometric safety. It is also shown here that the fuzzy 3-valued model of iris recognition is hosted by an 8-valued Boolean algebra of modulo 8 integers that represents the computational formalization in which a biometric system (a software agent) can achieve the artificial understanding of iris recognition in a logically consistent manner.
A Simple Network Management Architecture for Supporting Network Administrator and QoS Requirements
Venue: arXiv cs.NI 2011
Year: 2011

In this paper, a simple network management architecture for supporting both QoS requirements and organization network management policies is purposed. By grouping the traffic flows according to the QoS requirements or certain network management policies, the network resources are effectively controlled. The purposed architecture is easy to deploy; the gateway is the only equipment that needs installation, leaving the rest of the system untouched. The architecture has not significantly degraded the overall system utilization when applying it to the outgoing bound of the gateway. The architecture can also be implemented on the wireless LAN at the access point because the architecture is designed in such the way that it is independent to both the lower and upper protocol layers.
Using Contextual Information as Virtual Items on Top-N Recommender Systems
Venue: arXiv cs.LG 2011
Year: 2011

Traditionally, recommender systems for the Web deal with applications that have two dimensions, users and items. Based on access logs that relate these dimensions, a recommendation model can be built and used to identify a set of N items that will be of interest to a certain user. In this paper we propose a method to complement the information in the access logs with contextual information without changing the recommendation algorithm. The method consists in representing context as virtual items. We empirically test this method with two top-N recommender systems, an item-based collaborative filtering technique and association rules, on three data sets. The results show that our method is able to take advantage of the context (new dimensions) when it is informative.
Performance Evaluation of Different Scheduling Algorithms in WiMAX
Venue: arXiv cs.NI 2011
Year: 2011

Worldwide Interoperability for Microwave Access (WiMAX) networks were expected to be the main Broadband Wireless Access (BWA) technology that provided several services such as data, voice, and video services including different classes of Quality of Services (QoS), which in turn were defined by IEEE 802.16 standard. Scheduling in WiMAX became one of the most challenging issues, since it was responsible for distributing available resources of the network among all users; this leaded to the demand of constructing and designing high efficient scheduling algorithms in order to improve the network utilization, to increase the network throughput, and to minimize the end-to-end delay. In this study, we presenedt a simulation study to measure the performance of several scheduling algorithms in WiMAX, which were Strict Priority algorithm, Round-Robin (RR), Weighted Round Robin (WRR), Weighted Fair Queuing (WFQ), Self-Clocked Fair (SCF), and Diff-Serv Algorithm.
Performance of Cache Memory Subsystems for Multicore Architectures
Venue: arXiv cs.AR 2011
Year: 2011

Advancements in multi-core have created interest among many research groups in finding out ways to harness the true power of processor cores. Recent research suggests that on-board component such as cache memory plays a crucial role in deciding the performance of multi-core systems. In this paper, performance of cache memory is evaluated through the parameters such as cache access time, miss rate and miss penalty. The influence of cache parameters over execution time is also discussed. Results obtained from simulated studies of multi-core environments with different instruction set architectures (ISA) like ALPHA and X86 are produced.
A fusion algorithm for joins based on collections in Odra (Object Database for Rapid Application development)
Venue: arXiv cs.DB 2011
Year: 2011

In this paper we present the functionality of a currently under development database programming methodology called ODRA (Object Database for Rapid Application development) which works fully on the object oriented principles. The database programming language is called SBQL (Stack based query language). We discuss some concepts in ODRA for e.g. the working of ODRA, how ODRA runtime environment operates, the interoperability of ODRA with .net and java .A view of ODRA's working with web services and xml. Currently the stages under development in ODRA are query optimization. So we present the prior work that is done in ODRA related to Query optimization and we also present a new fusion algorithm of how ODRA can deal with joins based on collections like set, lists, and arrays for query optimization.
Context Tree Switching
Venue: arXiv cs.IT 2011
Year: 2011

This paper describes the Context Tree Switching technique, a modification of Context Tree Weighting for the prediction of binary, stationary, n-Markov sources. By modifying Context Tree Weighting's recursive weighting scheme, it is possible to mix over a strictly larger class of models without increasing the asymptotic time or space complexity of the original algorithm. We prove that this generalization preserves the desirable theoretical properties of Context Tree Weighting on stationary n-Markov sources, and show empirically that this new technique leads to consistent improvements over Context Tree Weighting as measured on the Calgary Corpus.
Time Interference Alignment via Delay Offset for Long Delay Networks
Venue: arXiv cs.IT 2011
Year: 2011

Time Interference Alignment is a flavor of Interference Alignment that increases the network capacity by suitably staggering the transmission delays of the senders. In this work the analysis of the existing literature is generalized and the focus is on the computation of the dof for networks with randomly placed users in a n-dimensional Euclidean space. In the basic case without coordination among the transmitters analytical expressions of the sum dof can be derived. If the transmit delays are coordinated, in 20% of the cases time Interference Alignment yields additional dof with respect to orthogonal access schemes. The potential capacity improvements for satellite networks are also investigated.
Infinite Excess Entropy Processes with Countable-State Generators
Venue: arXiv cs.IT 2011
Year: 2011

We present two examples of finite-alphabet, infinite excess entropy processes generated by invariant hidden Markov models (HMMs) with countable state sets. The first, simpler example is not ergodic, but the second is. It appears these are the first constructions of processes of this type. Previous examples of infinite excess entropy processes over finite alphabets admit only invariant HMM presentations with uncountable state sets.
Functional-Decode-Forward for the General Discrete Memoryless Two-Way Relay Channel
Venue: arXiv cs.IT 2011
Year: 2011

We consider the general discrete memoryless two-way relay channel, where two users exchange messages via a relay, and propose two functional-decode-forward coding strategies for this channel. Functional-decode-forward involves the relay decoding a function of the users' messages rather than the individual messages themselves. This function is then broadcast back to the users, which can be used in conjunction with the user's own message to decode the other user's message. Via a numerical example, we show that functional-decode-forward with linear codes is capable of achieving strictly larger sum rates than those achievable by other strategies.
The cross-correlation distribution of a $p$-ary $m$-sequence of period $p^{2m}-1$ and its decimation by $\frac{(p^{m}+1)^{2}}{2(p^{e}+1)}$
Venue: arXiv cs.IT 2011
Year: 2011

Let $n=2m$, $m$ odd, $e|m$, and $p$ odd prime with $p\equiv1\ \mathrm{mod}\ 4$. Let $d=\frac{(p^{m}+1)^{2}}{2(p^{e}+1)}$. In this paper, we study the cross-correlation between a $p$-ary $m$-sequence $\{s_{t}\}$ of period $p^{2m}-1$ and its decimation $\{s_{dt}\}$. Our result shows that the cross-correlation function is six-valued and that it takes the values in $\{-1,\ \pm p^{m}-1,\ \frac{1\pm p^{\frac{e}{2}}}{2}p^{m}-1,\ \frac{(1- p^{e})}{2}p^{m}-1\}$. Also, the distribution of the cross-correlation is completely determined.
C++ Standard Template Library by template specialized containers
Venue: arXiv cs.PL 2011
Year: 2011

The C++ Standard Template Library is the flagship example for libraries based on the generic programming paradigm. The usage of this library is intended to minimize the number of classical C/C++ errors, but does not warrant bug-free programs. Furthermore, many new kinds of errors may arise from the inaccurate use of the generic programming paradigm, like dereferencing invalid iterators or misunderstanding remove-like algorithms. In this paper we present some typical scenarios that may cause runtime or portability problems. We emit warnings and errors while these risky constructs are used. We also present a general approach to emit "customized" warnings. We support the so-called "believe-me marks" to disable warnings. We present another typical usage of our technique, when classes become deprecated during the software lifecycle.
The function space to describe the dynamics of linear systems
Venue: arXiv cs.SY 2011
Year: 2011

Usually, the dynamics of linear time-invariant systems described by an integral operator of convolution type, which is defined in the Hilbert space of Lebesgue square integrable functions on the whole line. Such a description leads to contradictions. It is shown that the transition to the Hilbert space of almost periodic functions leads to the elimination of the detected inconsistencies. Multiple signals and interference with discrete spectrum are systems of sets. The properties of these systems lead to a new more effective method to combat noise in this space. The method used to identify the differential equations for the airbus. Baseline data were obtained during automatic landing.
CompChall: Addressing Password Guessing Attacks
Venue: arXiv cs.CR 2011
Year: 2011

Even though passwords are the most convenient means of authentication, they bring along themselves the threat of dictionary attacks. Dictionary attacks may be of two kinds: online and offline. While offline dictionary attacks are possible only if the adversary is able to collect data for a successful protocol execution by eavesdropping on the communication channel and can be successfully countered using public key cryptography, online dictionary attacks can be performed by anyone and there is no satisfactory solution to counter them. This paper presents a new authentication protocol which is called CompChall (computational challenge). The proposed protocol uses only one way hash functions as the building blocks and attempts to eliminate online dictionary attacks by implementing a challenge-response system. This challenge-response system is designed in a fashion that it does not pose any difficulty to a genuine user but is time consuming and computationally intensive for an adversary trying to launch a large number of login requests per unit time as in the case of an online dictionary attack. The protocol is stateless and thus less vulnerable to DoS (Denial of Service) attacks.
Offloadable Apps using SmartDiet: Towards an analysis toolkit for mobile application developers
Venue: arXiv cs.DC 2011
Year: 2011

Offloading work to cloud is one of the proposed solutions for increasing the battery life of mobile devices. Most prior research has focused on computation-intensive applications, even though such applications are not the most popular ones. In this paper, we first study the feasibility of method-level offloading in network-intensive applications, using an open source Twitter client as an example. Our key observation is that implementing offloading transparently to the developer is difficult: various constraints heavily limit the offloading possibilities, and estimation of the potential benefit is challenging. We then propose a toolkit, SmartDiet, to assist mobile application developers in creating code which is suitable for energy-efficient offloading. SmartDiet provides fine-grained offloading constraint identification and energy usage analysis for Android applications. In addition to outlining the overall functionality of the toolkit, we study some of its key mechanisms and identify the remaining challenges.
The Object Projection Feature Estimation Problem in Unsupervised Markerless 3D Motion Tracking
Venue: arXiv cs.CV 2011
Year: 2011

3D motion tracking is a critical task in many computer vision applications. Existing 3D motion tracking techniques require either a great amount of knowledge on the target object or specific hardware. These requirements discourage the wide spread of commercial applications based on 3D motion tracking. 3D motion tracking systems that require no knowledge on the target object and run on a single low-budget camera require estimations of the object projection features (namely, area and position). In this paper, we define the object projection feature estimation problem and we present a novel 3D motion tracking system that needs no knowledge on the target object and that only requires a single low-budget camera, as installed in most computers and smartphones. Our system estimates, in real time, the three-dimensional position of a non-modeled unmarked object that may be non-rigid, non-convex, partially occluded, self occluded, or motion blurred, given that it is opaque, evenly colored, and enough contrasting with the background in each frame. Our system is also able to determine the most relevant object to track in the screen. Our 3D motion tracking system does not impose hard constraints, therefore it allows a market-wide implementation of applications that use 3D motion tracking.
Proposed Cellular Network for Indian Conditions for Enhancement of Spectral Density and Reduction of Power Consumption & RF Pollution
Venue: arXiv cs.CY 2011
Year: 2011

With the exponentially increasing demand for wireless communications the capacity of current cellular systems will soon become incapable of handling the growing traffic. Since radio frequencies are diminishing natural resources, there seems to be a fundamental barrier to further capacity increase. The solution can be found by using smart antenna systems. Smart or adaptive antenna arrays consist of an array of antenna elements with signal processing capability that optimizes the radiation and reception of a desired signal, dynamically. Smart antenna can place nulls in the direction of interferers via adapting adaptive updating of weights linked to each antenna element. They thus cancel out most of the cochannel interference resulting in better quality of reception and lower dropped calls. Smart antenna can also track the user within a cell via direction of arrival algorithms. This paper focuses on about the smart antenna in hierarchical cell clustering (overlay-underlay) with demand based frequency allocation techniques in cellular mobile radio networks in INDIA.