OpenRaiser/Intern-Atlas huggingface dataset:
The Value of Feedback in Decentralized Detection
Venue: arXiv cs.IT 2011
Year: 2011

We consider the decentralized binary hypothesis testing problem in networks with feedback, where some or all of the sensors have access to compressed summaries of other sensors' observations. We study certain two-message feedback architectures, in which every sensor sends two messages to a fusion center, with the second message based on full or partial knowledge of the first messages of the other sensors. We also study one-message feedback architectures, in which each sensor sends one message to a fusion center, with a group of sensors having full or partial knowledge of the messages from the sensors not in that group. Under either a Neyman-Pearson or a Bayesian formulation, we show that the asymptotically optimal (in the limit of a large number of sensors) detection performance (as quantified by error exponents) does not benefit from the feedback messages, if the fusion center remembers all sensor messages. However, feedback can improve the Bayesian detection performance in the one-message feedback architecture if the fusion center has limited memory; for that case, we determine the corresponding optimal error exponents.
Analysis of Recent Checkpointing Techniques for Mobile Computing Systems
Venue: arXiv cs.NI 2011
Year: 2011

Recovery from transient failures is one of the prime issues in the context of distributed systems. These systems demand to have transparent yet efficient techniques to achieve the same. Checkpoint is defined as a designated place in a program where normal processing of a system is interrupted to preserve the status information. Checkpointing is a process of saving status information. Mobile computing systems often suffer from high failure rates that are transient and independent in nature. To add reliability and high availability to such distributed systems, checkpoint based rollback recovery is one of the widely used techniques for applications such as scientific computing, database, telecommunication applications and mission critical applications. This paper surveys the algorithms which have been reported in the literature for checkpointing in Mobile Computing Systems.
Towards Configuration of applied Web-based information system
Venue: arXiv cs.SE 2011
Year: 2011

In the paper, combinatorial synthesis of structure for applied Web-based systems is described. The problem is considered as a combination of selected design alternatives for system parts/components into a resultant composite decision (i.e., system configuration design). The solving framework is based on Hierarchical Morphological Multicriteria Design (HMMD) approach: (i) multicriteria selection of alternatives for system parts, (ii) composing the selected alternatives into a resultant combination (while taking into account ordinal quality of the alternatives above and their compatibility). A lattice-based discrete space is used to evaluate (to integrate) quality of the resultant combinations (i.e., composite system decisions or system configurations). In addition, a simplified solving framework based on multicriteria multiple choice problem is considered. A multistage design process to obtain a system trajectory is described as well. The basic applied example is targeted to an applied Web-based system for a communication service provider. Two other applications are briefly described (corporate system and information system for academic application).
Integrated Solution Scheme for Handover Latency Diminution in Proxy Mobile IPv6
Venue: arXiv cs.NI 2011
Year: 2011

Recent trends show that there are swift developments and fast convergence of wireless and mobile communication networks with internet services to provide the quality of ubiquitous access to network users. Most of the wireless networks and mobile cellular networks are moving to be all IP based. These networks are connected through the private IP core networks using the TCP/IP protocol or through the Internet. As such, there is room to improve the mobility support through the Internet and support ubiquitous network access by providing seamless handover. This is especially true with the invention of portable mobile and laptop devices that can be connected almost everywhere at any time. However, the recent explosion on the usage of mobile and laptop devices has also generated several issues in terms of performance and quality of service. Nowadays, mobile users demand high quality performance, best quality of services and seamless connections that support real-time application such as audio and video streaming. The goal of this paper is to study the impact and evaluate the mobility management protocols under micro mobility domain on link layer and network layer handover performance. Therefore, this paper proposes an integration solution of network-based mobility management framework, based on Proxy Mobile IPv6, to alleviate handover latency, packet loss and increase throughput and the performance of video transmission when mobile host moves to new network during handover on high speed mobility. Simulations are conducted to analyze the relationship between the network performances with the moving speed of mobile host over mobility protocols. Based on simulation results, we presented and analyzed the results of mobility protocols under intra-domain traffics in micro mobility domain.
Compression and Quantitative Analysis of Buffer Map Message in P2P Streaming System
Venue: arXiv cs.MM 2011
Year: 2011

BM compression is a straightforward and operable way to reduce buffer message length as well as to improve system performance. In this paper, we thoroughly discuss the principles and protocol progress of different compression schemes, and for the first time present an original compression scheme which can nearly remove all redundant information from buffer message. Theoretical limit of compression rates are deduced in the theory of information. Through the analysis of information content and simulation with our measured BM trace of UUSee, the validity and superiority of our compression scheme are validated in term of compression ratio.
Biometric Authorization System using Gait Biometry
Venue: arXiv cs.CV 2011
Year: 2011

Human gait, which is a new biometric aimed to recognize individuals by the way they walk have come to play an increasingly important role in visual surveillance applications. In this paper a novel hybrid holistic approach is proposed to show how behavioural walking characteristics can be used to recognize unauthorized and suspicious persons when they enter a surveillance area. Initially background is modelled from the input video captured from cameras deployed for security and the foreground moving object in the individual frames are segmented using the background subtraction algorithm. Then gait representing spatial, temporal and wavelet components are extracted and fused for training and testing multi class support vector machine models (SVM). The proposed system is evaluated using side view videos of NLPR database. The experimental results demonstrate that the proposed system achieves a pleasing recognition rate and also the results indicate that the classification ability of SVM with Radial Basis Function (RBF) is better than with other kernel functions.
Anisotropic k-Nearest Neighbor Search Using Covariance Quadtree
Venue: arXiv cs.CV 2011
Year: 2011

We present a variant of the hyper-quadtree that divides a multidimensional space according to the hyperplanes associated to the principal components of the data in each hyperquadrant. Each of the $2^λ$ hyper-quadrants is a data partition in a $λ$-dimension subspace, whose intrinsic dimensionality $λ\leq d$ is reduced from the root dimensionality $d$ by the principal components analysis, which discards the irrelevant eigenvalues of the local covariance matrix. In the present method a component is irrelevant if its length is smaller than, or comparable to, the local inter-data spacing. Thus, the covariance hyper-quadtree is fully adaptive to the local dimensionality. The proposed data-structure is used to compute the anisotropic K nearest neighbors (kNN), supported by the Mahalanobis metric. As an application, we used the present k nearest neighbors method to perform density estimation over a noisy data distribution. Such estimation method can be further incorporated to the smoothed particle hydrodynamics, allowing computer simulations of anisotropic fluid flows.
A Radio Based Intelligent Railway Grade Crossing System to Avoid Collision
Venue: arXiv cs.SY 2011
Year: 2011

Railway grade crossing is become the major headache for the transportation system. This paper describes an intelligent railway crossing control system for multiple tracks that features a controller which receives messages from incoming and outgoing trains by sensors. These messages contain detail information including the direction and identity of a train. Depending on those messages the controller device decides whenever the railroad crossing gate will close or open.
DNA Lossless Differential Compression Algorithm based on Similarity of Genomic Sequence Database
Venue: arXiv cs.DS 2011
Year: 2011

Modern biological science produces vast amounts of genomic sequence data. This is fuelling the need for efficient algorithms for sequence compression and analysis. Data compression and the associated techniques coming from information theory are often perceived as being of interest for data communication and storage. In recent years, a substantial effort has been made for the application of textual data compression techniques to various computational biology tasks, ranging from storage and indexing of large datasets to comparison of genomic databases. This paper presents a differential compression algorithm that is based on production of difference sequences according to op-code table in order to optimize the compression of homologous sequences in dataset. Therefore, the stored data are composed of reference sequence, the set of differences, and differences locations, instead of storing each sequence individually. This algorithm does not require a priori knowledge about the statistics of the sequence set. The algorithm was applied to three different datasets of genomic sequences, it achieved up to 195-fold compression rate corresponding to 99.4% space saving.
A Framework for Devanagari Script-based Captcha
Venue: arXiv cs.CR 2011
Year: 2011

Human Interactive Proofs (HIPs) are automatic reverse Turing tests designed to distinguish between various groups of users. Completely Automatic Public Turing test to tell Computers and Humans Apart (CAPTCHA) is a HIP system that distinguish between humans and malicious computer programs. Many CAPTCHAs have been proposed in the literature that text-graphical based, audio-based, puzzle-based and mathematical questions-based. The design and implementation of CAPTCHAs fall in the realm of Artificial Intelligence. We aim to utilize CAPTCHAs as a tool to improve the security of Internet based applications. In this paper we present a framework for a text-based CAPTCHA based on Devanagari script which can exploit the difference in the reading proficiency between humans and computer programs. Our selection of Devanagari script-based CAPTCHA is based on the fact that it is used by a large number of Indian languages including Hindi which is the third most spoken language. There is potential for an exponential rise in the applications that are likely to be developed in that script thereby making it easy to secure Indian language based applications.
Fully Retroactive Approximate Range and Nearest Neighbor Searching
Venue: arXiv cs.CG 2011
Year: 2011

We describe fully retroactive dynamic data structures for approximate range reporting and approximate nearest neighbor reporting. We show how to maintain, for any positive constant $d$, a set of $n$ points in $\R^d$ indexed by time such that we can perform insertions or deletions at any point in the timeline in $O(\log n)$ amortized time. We support, for any small constant $ε>0$, $(1+ε)$-approximate range reporting queries at any point in the timeline in $O(\log n + k)$ time, where $k$ is the output size. We also show how to answer $(1+ε)$-approximate nearest neighbor queries for any point in the past or present in $O(\log n)$ time.
Anti-Structure Problems
Venue: arXiv cs.IT 2011
Year: 2011

The recent success of structured solutions for a class of information-theoretic network problems, calls for exploring their limits. We show that sum-product channels resist a solution by structured (as well as random) codes. We conclude that the structured approach fails whenever the channel operations do not commute (or for general functional channels, when the channel function is non decomposable).
Quality Up in Polynomial Homotopy Continuation by Multithreaded Path Tracking
Venue: arXiv cs.DC 2011
Year: 2011

Speedup measures how much faster we can solve the same problem using many cores. If we can afford to keep the execution time fixed, then quality up measures how much better the solution will be computed using many cores. In this paper we describe our multithreaded implementation to track one solution path defined by a polynomial homotopy. Limiting quality to accuracy and confusing accuracy with precision, we strive to offset the cost of multiprecision arithmetic running multithreaded code on many cores.
Framework to Integrate Business Intelligence and Knowledge Management in Banking Industry
Venue: arXiv cs.OH 2011
Year: 2011

In this digital age organizations depend upon the technologies to provide customer-centric solutions by understanding well about their customers' behaviour and continuously improving business process of the organization. Business intelligence (BI) applications will play a vital role at this stage by discovering the knowledge hidden in internal as well as external sources. On the other hand, Knowledge Management (KM) will enhance the organisations performance by providing collaborative tools to learn, create and share the knowledge among the employees. The main intention of the BI is to enhance the employees' knowledge with information that allows them to make decisions to achieve its organisational strategies. However only twenty percent of data exist in structured form, majority of banks knowledge is in unstructured or minds of its employees. Organizations are needed to integrate KM with Knowledge which is discovered from data and information. The purpose of this paper is to discuss the need of business insiders in the process of knowledge discovery and distribution, to make BI more relevant to business of the bank. We have also discussed about the BI/KM applications in banking industry and provided a framework to integrate BI and KM in banking industry.
The Weight Distributions of Cyclic Codes and Elliptic Curves
Venue: arXiv cs.IT 2011
Year: 2011

Cyclic codes with two zeros and their dual codes as a practically and theoretically interesting class of linear codes, have been studied for many years. However, the weight distributions of cyclic codes are difficult to determine. From elliptic curves, this paper determines the weight distributions of dual codes of cyclic codes with two zeros for a few more cases.
Mathematical Analysis of the BIBEE Approximation for Molecular Solvation: Exact Results for Spherical Inclusions
Venue: arXiv cs.CE 2011
Year: 2011

We analyze the mathematically rigorous BIBEE (boundary-integral based electrostatics estimation) approximation of the mixed-dielectric continuum model of molecular electrostatics, using the analytically solvable case of a spherical solute containing an arbitrary charge distribution. Our analysis, which builds on Kirkwood's solution using spherical harmonics, clarifies important aspects of the approximation and its relationship to Generalized Born models. First, our results suggest a new perspective for analyzing fast electrostatic models: the separation of variables between material properties (the dielectric constants) and geometry (the solute dielectric boundary and charge distribution). Second, we find that the eigenfunctions of the reaction-potential operator are exactly preserved in the BIBEE model for the sphere, which supports the use of this approximation for analyzing charge-charge interactions in molecular binding. Third, a comparison of BIBEE to the recent GB$ε$ theory suggests a modified BIBEE model capable of predicting electrostatic solvation free energies to within 4% of a full numerical Poisson calculation. This modified model leads to a projection-framework understanding of BIBEE and suggests opportunities for future improvements.
Generic Optimization of Linear Precoding in Multibeam Satellite Systems
Venue: arXiv cs.IT 2011
Year: 2011

Multibeam satellite systems have been employed to provide interactive broadband services to geographical areas under-served by terrestrial infrastructure. In this context, this paper studies joint multiuser linear precoding design in the forward link of fixed multibeam satellite systems. We provide a generic optimization framework for linear precoding design to handle any objective functions of data rate with general linear and nonlinear power constraints. To achieve this, an iterative algorithm which optimizes the precoding vectors and power allocation alternatingly is proposed and most importantly, the proposed algorithm is proved to always converge. The proposed optimization algorithm is also applicable to nonlinear dirty paper coding. In addition, the aforementioned problems and algorithms are extended to the case that each terminal has multiple co-polarization or dual-polarization antennas. Simulation results demonstrate substantial performance improvement of the proposed schemes over conventional multibeam satellite systems, zero-forcing and regularized zero-forcing precoding schemes in terms of meeting the traffic demand. The performance of the proposed linear precoding scheme is also shown to be very close to the dirty paper coding.
A Novel Methodology for Thermal Analysis & 3-Dimensional Memory Integration
Venue: arXiv cs.AR 2011
Year: 2011

The semiconductor industry is reaching a fascinating confluence in several evolutionary trends that will likely lead to a number of revolutionary changes in the design, implementation, scaling, and the use of computer systems. However, recently Moore's law has come to a stand-still since device scaling beyond 65 nm is not practical. 2D integration has problems like memory latency, power dissipation, and large foot-print. 3D technology comes as a solution to the problems posed by 2D integration. The utilization of 3D is limited by the problem of temperature crisis. It is important to develop an accurate power profile extraction methodology to design 3D structure. In this paper, design of 3D integration of memory is considered and hence the static power dissipation of the memory cell is analysed in transistor level and is used to accurately model the inter-layer thermal effects for 3D memory stack. Subsequently, packaging of the chip is considered and modelled using an architecture level simulator. This modelling is intended to analyse the thermal effects of 3D memory, its reliability and lifetime of the chip, with greater accuracy.
Problems in Modern High Performance Parallel I/O Systems
Venue: arXiv cs.DC 2011
Year: 2011

In the past couple of decades, the computational abilities of supercomput- ers have increased tremendously. Leadership scale supercomputers now are capable of petaflops. Likewise, the problem size targeted by applications running on such computers has also scaled. These large applications have I/O throughput requirements on the order of tens of gigabytes per second. For a variety of reasons, the I/O subsystems of such computers have not kept pace with the computational increases, and the time required for I/O in an application has become one of the dominant bottlenecks. Also troublesome is the fact that scientific applications do not attain near the peak theoretical bandwidth of the I/O subsystems. In addressing the two prior issues, one must also question the nature of the data itself; one can ask whether contem- porary practices of data dumping and analysis are optimal and whether they will continue to be applicable as computers continue to scale. These three topics, the I/O subsystem, the nature of scientific data output, and future possible optimizations are discussed in this report.
Tunable Dual-band IFA Antenna using LC Resonators
Venue: arXiv cs.IT 2011
Year: 2011

A tunable dual-band inverted F antenna (IFA) is presented in this paper. By placing a LC resonator on the radiating arm, dual-band characteristic is achieved. Especially, the capacitor in the resonator is a tunable thin-film BST capacitor, which has a 3.3:1 tuning ratio. The capacitance of the BST capacitors can be tuned by an external DC bias voltage. By varying the capacitance, both the lower band and the upper band of the IFA antenna can be tuned. And the total bandwidth can cover six systems, i.e., GSM-850, GSM-900, GPS, DCS, PCS, and UMTS.
SAGA: A DSL for Story Management
Venue: arXiv cs.PL 2011
Year: 2011

Video game development is currently a very labour-intensive endeavour. Furthermore it involves multi-disciplinary teams of artistic content creators and programmers, whose typical working patterns are not easily meshed. SAGA is our first effort at augmenting the productivity of such teams. Already convinced of the benefits of DSLs, we set out to analyze the domains present in games in order to find out which would be most amenable to the DSL approach. Based on previous work, we thus sought those sub-parts that already had a partially established vocabulary and at the same time could be well modeled using classical computer science structures. We settled on the 'story' aspect of video games as the best candidate domain, which can be modeled using state transition systems. As we are working with a specific company as the ultimate customer for this work, an additional requirement was that our DSL should produce code that can be used within a pre-existing framework. We developed a full system (SAGA) comprised of a parser for a human-friendly language for 'story events', an internal representation of design patterns for implementing object-oriented state-transitions systems, an instantiator for these patterns for a specific 'story', and three renderers (for C++, C# and Java) for the instantiated abstract code.
Building-Blocks for Performance Oriented DSLs
Venue: arXiv cs.PL 2011
Year: 2011

Domain-specific languages raise the level of abstraction in software development. While it is evident that programmers can more easily reason about very high-level programs, the same holds for compilers only if the compiler has an accurate model of the application domain and the underlying target platform. Since mapping high-level, general-purpose languages to modern, heterogeneous hardware is becoming increasingly difficult, DSLs are an attractive way to capitalize on improved hardware performance, precisely by making the compiler reason on a higher level. Implementing efficient DSL compilers is a daunting task however, and support for building performance-oriented DSLs is urgently needed. To this end, we present the Delite Framework, an extensible toolkit that drastically simplifies building embedded DSLs and compiling DSL programs for execution on heterogeneous hardware. We discuss several building blocks in some detail and present experimental results for the OptiML machine-learning DSL implemented on top of Delite.