OpenRaiser/Intern-Atlas huggingface dataset:
A new application of Multi modal Biometrics in home and office security system
Venue: arXiv cs.CR 2012
Year: 2012

Biometric door lock security systems are used at those places where you have important information and stuffs. In that kind of places multibiometric electronic door lock security systems that are based on finger print and iris recognization.Multibiometric door lock security systems are used to prevent the door related burglaries such as break ins occurred in different forms so this is the best method to prevent this type of happenings. Unlike keyed locks, there is no need to take the keys with you when you go out without necessary of worrying about losing keys.This paper proposes a multimodal biometrics door lock system with iris and fingerprint as a computer application for automatically identifying or verifying a person from fingerprint iris recognition system. The first stage is identification and second one is verifying that whether he is a genuine user or imposter. During second stage system compares the input set with all available stored set in database. This comparison gives a ranked list of matches. Based on the rank retrieved an alarm is activated automatically when any unauthorized person tries to open the door. So this kind of multimodal biometrics will provide a highly secured and authenticated access.
An Effective Fusion Technique of Cloud Computing and Networking Series
Venue: arXiv cs.CR 2012
Year: 2012

Cloud computing is making it possible to separate the process of building an infrastructure for service provisioning from the business of providing end user services. Today, such infrastructures are normally provided in large data centres and the applications are executed remotely from the users. One reason for this is that cloud computing requires a reasonably stable infrastructure and networking environment, largely due to management reasons. Networking of Information (NetInf) is an information centric networking paradigm that can support cloud computing by providing new possibilities for network transport and storage. It offers direct access to information objects through a simple API, independent of their location in the network. This abstraction can hide much of the complexity of storage and network transport systems that cloud computing today has to deal with. In this paper we analyze how cloud computing and NetInf can be combined to make cloud computing infrastructures easier to manage, and potentially enable deployment in smaller and more dynamic networking environments. NetInf should thus be understood as an enhancement to the infrastructure for cloud computing rather than a change to cloud computing technology as such. To illustrate the approach taken by NetInf, we also describe how it can be implemented by introducing a specific name resolution and routing mechanism.
A Performance Analysis of LAR Protocol for Vehicular Ad Hoc Networks in City Scenarios
Venue: arXiv cs.NI 2012
Year: 2012

In this paper, performance analysis of Location Aided Routing (LAR) protocol in different city scenarios has been done. The mobility model considered is Manhattan model. This mobility model used to emulate the movement pattern of nodes i.e., vehicles on streets defined by maps. Our objective is to provide a qualitative analysis of the LAR protocol in different city scenarios in Vehicular Ad hoc Networks. We have considered three different city scenarios for the analysis of the protocol. The simulation work has been conducted using the Glomosim 2.03 simulator. The results show that LAR1 protocol achieves maximum packet delivery ratio is 99.68 % and maximum average end-to-end delay is 7.319969 ms when the network is sparsely populated. Further, for densely populated network maximum achieved packet delivery ratio is 87.58% and average end-to-end delay is 0.017684 ms.
Extensional Models of Untyped Lambda-mu Calculus
Venue: arXiv cs.LO 2012
Year: 2012

This paper proposes new mathematical models of the untyped Lambda-mu calculus. One is called the stream model, which is an extension of the lambda model, in which each term is interpreted as a function from streams to individual data. The other is called the stream combinatory algebra, which is an extension of the combinatory algebra, and it is proved that the extensional equality of the Lambda-mu calculus is equivalent to equality in stream combinatory algebras. In order to define the stream combinatory algebra, we introduce a combinatory calculus SCL, which is an abstraction-free system corresponding to the Lambda-mu calculus. Moreover, it is shown that stream models are algebraically characterized as a particular class of stream combinatory algebras.
Applying Gödel's Dialectica Interpretation to Obtain a Constructive Proof of Higman's Lemma
Venue: arXiv cs.LO 2012
Year: 2012

We use Gödel's Dialectica interpretation to analyse Nash-Williams' elegant but non-constructive "minimal bad sequence" proof of Higman's Lemma. The result is a concise constructive proof of the lemma (for arbitrary decidable well-quasi-orders) in which Nash-Williams' combinatorial idea is clearly present, along with an explicit program for finding an embedded pair in sequences of words.
Pseudo-scheduling: A New Approach to the Broadcast Scheduling Problem
Venue: arXiv cs.DS 2012
Year: 2012

The broadcast scheduling problem asks how a multihop network of broadcast transceivers operating on a shared medium may share the medium in such a way that communication over the entire network is possible. This can be naturally modeled as a graph coloring problem via distance-2 coloring (L(1,1)-labeling, strict scheduling). This coloring is difficult to compute and may require a number of colors quadratic in the graph degree. This paper introduces pseudo-scheduling, a relaxation of distance-2 coloring. Centralized and decentralized algorithms that compute pseudo-schedules with colors linear in the graph degree are given and proved.
Contemporary Semantic Web Service Frameworks: An Overview and Comparisons
Venue: arXiv cs.SE 2012
Year: 2012

The growing proliferation of distributed information systems, allows organizations to offer their business processes to a worldwide audience through Web services. Semantic Web services have emerged as a means to achieve the vision of automatic discovery, selection, composition, and invocation of Web services by encoding the specifications of these software components in an unambiguous and machine-interpretable form. Several frameworks have been devised as enabling technologies for Semantic Web services. In this paper, we survey the prominent Semantic Web service frameworks. In addition, a set of criteria is identified and the discussed frameworks are evaluated and compared with respect to these criteria. Knowing the strengths and weaknesses of the Semantic Web service frameworks can help researchers to utilize the most appropriate one according to their needs.
Adaptive Quantizers for Estimation
Venue: arXiv cs.IT 2012
Year: 2012

In this paper, adaptive estimation based on noisy quantized observations is studied. A low complexity adaptive algorithm using a quantizer with adjustable input gain and offset is presented. Three possible scalar models for the parameter to be estimated are considered: constant, Wiener process and Wiener process with deterministic drift. After showing that the algorithm is asymptotically unbiased for estimating a constant, it is shown, in the three cases, that the asymptotic mean squared error depends on the Fisher information for the quantized measurements. It is also shown that the loss of performance due to quantization depends approximately on the ratio of the Fisher information for quantized and continuous measurements. At the end of the paper the theoretical results are validated through simulation under two different classes of noise, generalized Gaussian noise and Student's-t noise.
A Flexible Mixed Integer Programming framework for Nurse Scheduling
Venue: arXiv cs.DS 2012
Year: 2012

In this paper, a nurse-scheduling model is developed using mixed integer programming model. It is deployed to a general care ward to replace and automate the current manual approach for scheduling. The developed model differs from other similar studies in that it optimizes both hospitals requirement as well as nurse preferences by allowing flexibility in the transfer of nurses from different duties. The model also incorporated additional policies which are part of the hospitals requirement but not part of the legislations. Hospitals key primary mission is to ensure continuous ward care service with appropriate number of nursing staffs and the right mix of nursing skills. The planning and scheduling is done to avoid additional non essential cost for hospital. Nurses preferences are taken into considerations such as the number of night shift and consecutive rest days. We will also reformulate problems from another paper which considers the penalty objective using the model but without the flexible components. The models are built using AIMMS which solves the problem in very short amount of time.
Inference of Fine-grained Attributes of Bengali Corpus for Stylometry Detection
Venue: arXiv cs.CL 2012
Year: 2012

Stylometry, the science of inferring characteristics of the author from the characteristics of documents written by that author, is a problem with a long history and belongs to the core task of Text categorization that involves authorship identification, plagiarism detection, forensic investigation, computer security, copyright and estate disputes etc. In this work, we present a strategy for stylometry detection of documents written in Bengali. We adopt a set of fine-grained attribute features with a set of lexical markers for the analysis of the text and use three semi-supervised measures for making decisions. Finally, a majority voting approach has been taken for final classification. The system is fully automatic and language-independent. Evaluation results of our attempt for Bengali author's stylometry detection show reasonably promising accuracy in comparison to the baseline model.
A Unified Analytical Design Method of Standard Controllers using Inversion Formulae
Venue: arXiv cs.SY 2012
Year: 2012

The aim of this paper is to present a comprehensive range of design techniques for the synthesis of the standard compensators (Lead and Lag networks as well as PID controllers) that in the last twenty years have proved to be of great educational value in a vast number of undergraduate and postgraduate courses in Control throughout Italy, but that to-date remain mostly confined within this country. These techniques hinge upon a set of simple closed-form formulae for the computation of the parameters of the controller as functions of the typical specifications introduced in Control courses, i.e., the steady-state performance, the stability margins and the crossover frequencies.
Starting a Dialog between Model Checking and Fault-tolerant Distributed Algorithms
Venue: arXiv cs.FL 2012
Year: 2012

Fault-tolerant distributed algorithms are central for building reliable spatially distributed systems. Unfortunately, the lack of a canonical precise framework for fault-tolerant algorithms is an obstacle for both verification and deployment. In this paper, we introduce a new domain-specific framework to capture the behavior of fault-tolerant distributed algorithms in an adequate and precise way. At the center of our framework is a parameterized system model where control flow automata are used for process specification. To account for the specific features and properties of fault-tolerant distributed algorithms for message-passing systems, our control flow automata are extended to model threshold guards as well as the inherent non-determinism stemming from asynchronous communication, interleavings of steps, and faulty processes. We demonstrate the adequacy of our framework in a representative case study where we formalize a family of well-known fault-tolerant broadcasting algorithms under a variety of failure assumptions. Our case study is supported by model checking experiments with safety and liveness specifications for a fixed number of processes. In the experiments, we systematically varied the assumptions on both the resilience condition and the failure model. In all cases, our experiments coincided with the theoretical results predicted in the distributed algorithms literature. This is giving clear evidence for the adequacy of our model. In a companion paper, we are addressing the new model checking techniques necessary for parametric verification of the distributed algorithms captured in our framework.
Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints
Venue: arXiv cs.CR 2012
Year: 2012

The workflow satisfiability problem is concerned with determining whether it is possible to find an allocation of authorized users to the steps in a workflow in such a way that all constraints are satisfied. The problem is NP-hard in general, but is known to be fixed-parameter tractable for certain classes of constraints. The known results on fixed-parameter tractability rely on the symmetry (in some sense) of the constraints. In this paper, we provide the first results that establish fixed-parameter tractability of the satisfiability problem when the constraints are asymmetric. In particular, we introduce the notion of seniority constraints, in which the execution of steps is determined, in part, by the relative seniority of the users that perform them. Our results require new techniques, which make use of tree decompositions of the graph of the binary relation defining the constraint. Finally, we establish a lower bound for the hardness of the workflow satisfiability problem.
Location-Based Events Detection on Micro-Blogs
Venue: arXiv cs.SI 2012
Year: 2012

The increasing use of social networks generates enormous amounts of data that can be used for many types of analysis. Some of these data have temporal and geographical information, which can be used for comprehensive examination. In this paper, we propose a new method to analyze the massive volume of messages available in Twitter to identify places in the world where topics such as TV shows, climate change, disasters, and sports are emerging. The proposed method is based on a neural network that is used to detect outliers from a time series, which is built upon statistical data from tweets located on different political divisions (i.e., countries, cities). The outliers are used to identify topics within an abnormal behavior in Twitter. The effectiveness of our method is evaluated in an online environment indicating new findings on modeling local people's behavior from different places.
Relational Theories with Null Values and Non-Herbrand Stable Models
Venue: arXiv cs.LO 2012
Year: 2012

Generalized relational theories with null values in the sense of Reiter are first-order theories that provide a semantics for relational databases with incomplete information. In this paper we show that any such theory can be turned into an equivalent logic program, so that models of the theory can be generated using computational methods of answer set programming. As a step towards this goal, we develop a general method for calculating stable models under the domain closure assumption but without the unique name assumption.
Outage Probability Analysis of Dual Hop Relay Networks in Presence of Interference
Venue: arXiv cs.IT 2012
Year: 2012

Cooperative relaying improves the performance of wireless networks by forming a network of multiple independent virtual sources transmitting the same information as the source node. However, interference induced in the network reduces the performance of cooperative communications. In this work the statistical properties, the cumulative distribution function (CDF) and the probability density function (PDF) for a basic dual hop cooperative relay network with an arbitrary number of interferers over Rayleigh fading channels are derived. Two system models are considered: in the first system model, the interferers are only at the relay node; and in the second system model, interferers are both at the relay and the destination. This work is further extended to Nakagami-m faded interfering channels. Simulation results are presented on outage probability performance to verify the theoretical analysis.
Deterministic Selection of Phase Sequences in Low Complexity SLM Scheme
Venue: arXiv cs.IT 2012
Year: 2012

Selected mapping (SLM) is a suitable scheme, which can solve the peak-to-average power ratio (PAPR) problem. Recently, many researchers have concentrated on reducing the computational complexity of the SLM schemes. One of the low complexity SLM schemes is the Class III SLM scheme which uses only one inverse fast fourier transform (IFFT) operation for generating one orthogonal frequency division multiplexing (OFDM) signal sequence. By selecting rotations and cyclic shifts randomly, it can generate $N^3$ alternative OFDM signal sequences, where $N$ is the FFT size. But this selection can not guarantee the optimal PAPR reduction performances. Therefore, in this paper, we propose a simple deterministic cyclic shifts selection method which is optimal in case of having low variance of correlation coefficient between two alternative OFDM signal sequences. And we show that cyclic shifts are highly dependent on the PAPR reduction performance than rotations. For small FFT size and the number of alternative signal sequences is close to $N/8$, simulation results show that the proposed scheme can achieve better PAPR reduction performance than the Class III SLM scheme.
Communications with decode-and-forward relays in mesh networks
Venue: arXiv cs.IT 2012
Year: 2012

We consider mesh networks composed of groups of relaying nodes which operate in decode-and-forward mode, where each node from a group relays information to all the nodes in the next group. We study these networks in two setups, one where the nodes have complete channel state information from the nodes that transmit to them, and another when they only have the statistics of the channel. We derive recursive expressions for the probabilities of errors of the nodes and present several implementations of detectors used in these networks. We compare the mesh networks with multihop networks, the latter being formed by a set of parallel sections of multiple relaying nodes. We demonstrate with numerous simulations that there are significant improvements in performance of mesh over multihop networks in various scenarios.
A Direct Proof of a Theorem Concerning Singular Hamiltonian Systems
Venue: arXiv cs.SY 2012
Year: 2012

This technical report presents a direct proof of Theorem~1 in [1] and some consequences that also account for (20) in [1]. This direct proof exploits a state space change of basis which replaces the coupled difference equations (10) in [1] with two equivalent difference equations which, instead, are decoupled.
Epitome for Automatic Image Colorization
Venue: arXiv cs.CV 2012
Year: 2012

Image colorization adds color to grayscale images. It not only increases the visual appeal of grayscale images, but also enriches the information contained in scientific images that lack color information. Most existing methods of colorization require laborious user interaction for scribbles or image segmentation. To eliminate the need for human labor, we develop an automatic image colorization method using epitome. Built upon a generative graphical model, epitome is a condensed image appearance and shape model which also proves to be an effective summary of color information for the colorization task. We train the epitome from the reference images and perform inference in the epitome to colorize grayscale images, rendering better colorization results than previous method in our experiments.
Coherent Fading Channels Driven by Arbitrary Inputs: Asymptotic Characterization of the Constrained Capacity and Related Information- and Estimation-Theoretic Quantities
Venue: arXiv cs.IT 2012
Year: 2012

We consider the characterization of the asymptotic behavior of the average minimum mean-squared error (MMSE) and the average mutual information in scalar and vector fading coherent channels, where the receiver knows the exact fading channel state but the transmitter knows only the fading channel distribution, driven by a range of inputs. We construct low-snr and -- at the heart of the novelty of the contribution -- high-snr asymptotic expansions for the average MMSE and the average mutual information for coherent channels subject to Rayleigh fading, Ricean fading or Nakagami fading and driven by discrete inputs (with finite support) or various continuous inputs. We reveal the role that the so-called canonical MMSE in a standard additive white Gaussian noise (AWGN) channel plays in the characterization of the asymptotic behavior of the average MMSE and the average mutual information in a fading coherent channel. We also reveal connections to and generalizations of the MMSE dimension. The most relevant element that enables the construction of these non-trivial expansions is the realization that the integral representation of the estimation- and information- theoretic quantities can be seen as an h-transform of a kernel with a monotonic argument: this enables the use of a novel asymptotic expansion of integrals technique -- the Mellin transform method -- that leads immediately to not only the high-snr but also the low-snr expansions of the average MMSE and -- via the I-MMSE relationship -- to expansions of the average mutual information. We conclude with applications of the results to the characterization and optimization of the constrained capacity of a bank of parallel independent coherent fading channels driven by arbitrary discrete inputs.
A Robust Complex Division in Scilab
Venue: arXiv cs.MS 2012
Year: 2012

The most widely used algorithm for floating point complex division, known as Smith's method, may fail more often than expected. This document presents two improved complex division algorithms. We present a proof of the robustness of the first improved algorithm. Numerical simulations show that this algorithm performs well in practice and is significantly more robust than other known implementations. By combining additionnal scaling methods with this first algorithm, we were able to create a second algorithm, which rarely fails.
Optimal Achievable Rates for Interference Networks with Random Codes
Venue: arXiv cs.IT 2012
Year: 2012

The optimal rate region for interference networks is characterized when encoding is restricted to random code ensembles with superposition coding and time sharing. A simple simultaneous nonunique decoding rule, under which each receiver decodes for the intended message as well as the interfering messages, is shown to achieve this optimal rate region regardless of the relative strengths of signal, interference, and noise. This result implies that the Han-Kobayashi bound, the best known inner bound on the capacity region of the two-user-pair interference channel, cannot be improved merely by using the optimal maximum likelihood decoder.