OpenRaiser/Intern-Atlas huggingface dataset:
On the Module of Internet Banking System
Venue: arXiv cs.OH 2010
Year: 2010

Because of the speed, flexibility, and efficiency that it offers, the Internet has become the means for conducting growing numbers of transactions between suppliers and large international corporations. In this way, the Internet has opened new markets to the world and has accelerated the diffusion of knowledge. The meaning of Internet markets or online business has been widely used in these days. The success of the business depends on its flexibility, availability and security. Since that the web-based systems should have a special way to design the system and implement it. Nowadays, the Internet Banking System widely used and the banks looking to provide the best quality system with highly available, fast response, secure and safe to use. The Unified Modelling Language (UML) is the uniquely language which is used to analyse and design any system. In this paper, the UML diagrams has been proposed to illustrate the design phase for any banking system. The authors, presented two types of architecture which is used for the Internet Banking System.
Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity
Venue: arXiv cs.DS 2010
Year: 2010

We present a near-linear time algorithm that approximates the edit distance between two strings within a polylogarithmic factor; specifically, for strings of length n and every fixed epsilon>0, it can compute a (log n)^O(1/epsilon) approximation in n^(1+epsilon) time. This is an exponential improvement over the previously known factor, 2^(O (sqrt(log n))), with a comparable running time (Ostrovsky and Rabani J.ACM 2007; Andoni and Onak STOC 2009). Previously, no efficient polylogarithmic approximation algorithm was known for any computational task involving edit distance (e.g., nearest neighbor search or sketching). This result arises naturally in the study of a new asymmetric query model. In this model, the input consists of two strings x and y, and an algorithm can access y in an unrestricted manner, while being charged for querying every symbol of x. Indeed, we obtain our main result by designing an algorithm that makes a small number of queries in this model. We then provide a nearly-matching lower bound on the number of queries. Our lower bound is the first to expose hardness of edit distance stemming from the input strings being "repetitive", which means that many of their substrings are approximately identical. Consequently, our lower bound provides the first rigorous separation between edit distance and Ulam distance, which is edit distance on non-repetitive strings, such as permutations.
Face Synthesis (FASY) System for Generation of a Face Image from Human Description
Venue: arXiv cs.CV 2010
Year: 2010

This paper aims at generating a new face based on the human like description using a new concept. The FASY (FAce SYnthesis) System is a Face Database Retrieval and new Face generation System that is under development. One of its main features is the generation of the requested face when it is not found in the existing database, which allows a continuous growing of the database also.
Incremental Training of a Detector Using Online Sparse Eigen-decomposition
Venue: arXiv cs.CV 2010
Year: 2010

The ability to efficiently and accurately detect objects plays a very crucial role for many computer vision tasks. Recently, offline object detectors have shown a tremendous success. However, one major drawback of offline techniques is that a complete set of training data has to be collected beforehand. In addition, once learned, an offline detector can not make use of newly arriving data. To alleviate these drawbacks, online learning has been adopted with the following objectives: (1) the technique should be computationally and storage efficient; (2) the updated classifier must maintain its high classification accuracy. In this paper, we propose an effective and efficient framework for learning an adaptive online greedy sparse linear discriminant analysis (GSLDA) model. Unlike many existing online boosting detectors, which usually apply exponential or logistic loss, our online algorithm makes use of LDA's learning criterion that not only aims to maximize the class-separation criterion but also incorporates the asymmetrical property of training data distributions. We provide a better alternative for online boosting algorithms in the context of training a visual object detector. We demonstrate the robustness and efficiency of our methods on handwriting digit and face data sets. Our results confirm that object detection tasks benefit significantly when trained in an online manner.
A Robust Beamformer Based on Weighted Sparse Constraint
Venue: arXiv cs.IT 2010
Year: 2010

Applying a sparse constraint on the beam pattern has been suggested to suppress the sidelobe level of a minimum variance distortionless response (MVDR) beamformer. In this letter, we introduce a weighted sparse constraint in the beamformer design to provide a lower sidelobe level and deeper nulls for interference avoidance, as compared with a conventional MVDR beamformer. The proposed beamformer also shows improved robustness against the mismatch between the steering angle and the direction of arrival (DOA) of the desired signal, caused by imperfect estimation of DOA.
The Algorithm Analysis of E-Commerce Security Issues for Online Payment Transaction System in Banking Technology
Venue: arXiv cs.CR 2010
Year: 2010

E-Commerce offers the banking industry great opportunity, but also creates a set of new risks and vulnerability such as security threats. Information security, therefore, is an essential management and technical requirement for any efficient and effective Payment transaction activities over the internet. Still, its definition is a complex endeavor due to the constant technological and business change and requires a coordinated match of algorithm and technical solutions. Ecommerce is not appropriate to all business transactions and, within e-commerce there is no one technology that can or should be appropriate to all requirements. E-commerce is not a new phenomenon; electronic markets, electronic data interchange and customer e-commerce. The use of electronic data interchanges as a universal and non-proprietary way of doing business. Through the electronic transaction the security is the most important phenomena to enhance the banking transaction security via payment transaction.
Content Base Image Retrieval Using Phong Shading
Venue: arXiv cs.MM 2010
Year: 2010

The digital image data is rapidly expanding in quantity and heterogeneity. The traditional information retrieval techniques does not meet the user's demand, so there is need to develop an efficient system for content based image retrieval. Content based image retrieval means retrieval of images from database on the basis of visual features of image like as color, texture etc. In our proposed method feature are extracted after applying Phong shading on input image. Phong shading, flattering out the dull surfaces of the image The features are extracted using color, texture & edge density methods. Feature extracted values are used to find the similarity between input query image and the data base image. It can be measure by the Euclidean distance formula. The experimental result shows that the proposed approach has a better retrieval results with phong shading.
Max-stable sketches: estimation of Lp-norms, dominance norms and point queries for non-negative signals
Venue: arXiv cs.DS 2010
Year: 2010

Max-stable random sketches can be computed efficiently on fast streaming positive data sets by using only sequential access to the data. They can be used to answer point and Lp-norm queries for the signal. There is an intriguing connection between the so-called p-stable (or sum-stable) and the max-stable sketches. Rigorous performance guarantees through error-probability estimates are derived and the algorithmic implementation is discussed.
A Meta-Programming Approach to Realizing Dependently Typed Logic Programming
Venue: arXiv cs.LO 2010
Year: 2010

Dependently typed lambda calculi such as the Logical Framework (LF) can encode relationships between terms in types and can naturally capture correspondences between formulas and their proofs. Such calculi can also be given a logic programming interpretation: the Twelf system is based on such an interpretation of LF. We consider here whether a conventional logic programming language can provide the benefits of a Twelf-like system for encoding type and proof-and-formula dependencies. In particular, we present a simple mapping from LF specifications to a set of formulas in the higher-order hereditary Harrop (hohh) language, that relates derivations and proof-search between the two frameworks. We then show that this encoding can be improved by exploiting knowledge of the well-formedness of the original LF specifications to elide much redundant type-checking information. The resulting logic program has a structure that closely resembles the original specification, thereby allowing LF specifications to be viewed as hohh meta-programs. Using the Teyjus implementation of lambdaProlog, we show that our translation provides an efficient means for executing LF specifications, complementing the ability that the Twelf system provides for reasoning about them.
Automated Reasoning and Presentation Support for Formalizing Mathematics in Mizar
Venue: arXiv cs.AI 2010
Year: 2010

This paper presents a combination of several automated reasoning and proof presentation tools with the Mizar system for formalization of mathematics. The combination forms an online service called MizAR, similar to the SystemOnTPTP service for first-order automated reasoning. The main differences to SystemOnTPTP are the use of the Mizar language that is oriented towards human mathematicians (rather than the pure first-order logic used in SystemOnTPTP), and setting the service in the context of the large Mizar Mathematical Library of previous theorems,definitions, and proofs (rather than the isolated problems that are solved in SystemOnTPTP). These differences poses new challenges and new opportunities for automated reasoning and for proof presentation tools. This paper describes the overall structure of MizAR, and presents the automated reasoning systems and proof presentation tools that are combined to make MizAR a useful mathematical service.
Parametrizing Program Analysis by Lifting to Cardinal Power Domains
Venue: arXiv cs.PL 2010
Year: 2010

A parametric analysis is an analysis whose input and output are parametrized with a number of parameters which can be instantiated to abstract properties after analysis is completed. This paper proposes to use Cousot and Cousot's Cardinal power domain to capture functional dependencies of analysis output on its input and obtain a parametric analysis by parametrizing a non-parametric base analysis. We illustrate the method by parametrizing a $\pos$ based groundness analysis of logic programs to a parametric groundness analysis. In addition, a prototype implementation shows that generality of the parametric groundness analysis comes with a negligible extra cost.
Introduction to the Report "Interlanguages and Synchronic Models of Computation."
Venue: arXiv cs.PL 2010
Year: 2010

A novel language system has given rise to promising alternatives to standard formal and processor network models of computation. An interstring linked with a abstract machine environment, shares sub-expressions, transfers data, and spatially allocates resources for the parallel evaluation of dataflow. Formal models called the a-Ram family are introduced, designed to support interstring programming languages (interlanguages). Distinct from dataflow, graph rewriting, and FPGA models, a-Ram instructions are bit level and execute in situ. They support sequential and parallel languages without the space/time overheads associated with the Turing Machine and lambda-calculus, enabling massive programs to be simulated. The devices of one a-Ram model, called the Synchronic A-Ram, are fully connected and simpler than FPGA LUT's. A compiler for an interlanguage called Space, has been developed for the Synchronic A-Ram. Space is MIMD. strictly typed, and deterministic. Barring memory allocation and compilation, modules are referentially transparent. At a high level of abstraction, modules exhibit a state transition system, aiding verification. Data structures and parallel iteration are straightforward to implement, and allocations of sub-processes and data transfers to resources are implicit. Space points towards highly connected architectures called Synchronic Engines, that are more general purpose than systolic arrays and GPUs, and bypass programmability and conflict issues associated with multicores.
Dynamic Motion Modelling for Legged Robots
Venue: arXiv cs.RO 2010
Year: 2010

An accurate motion model is an important component in modern-day robotic systems, but building such a model for a complex system often requires an appreciable amount of manual effort. In this paper we present a motion model representation, the Dynamic Gaussian Mixture Model (DGMM), that alleviates the need to manually design the form of a motion model, and provides a direct means of incorporating auxiliary sensory data into the model. This representation and its accompanying algorithms are validated experimentally using an 8-legged kinematically complex robot, as well as a standard benchmark dataset. The presented method not only learns the robot's motion model, but also improves the model's accuracy by incorporating information about the terrain surrounding the robot.
Proofs, proofs, proofs, and proofs
Venue: arXiv cs.AI 2010
Year: 2010

In logic there is a clear concept of what constitutes a proof and what not. A proof is essentially defined as a finite sequence of formulae which are either axioms or derived by proof rules from formulae earlier in the sequence. Sociologically, however, it is more difficult to say what should constitute a proof and what not. In this paper we will look at different forms of proofs and try to clarify the concept of proof in the wider meaning of the term. This has implications on how proofs should be represented formally.
Wirtinger's Calculus in general Hilbert Spaces
Venue: arXiv cs.LG 2010
Year: 2010

The present report, has been inspired by the need of the author and its colleagues to understand the underlying theory of Wirtinger's Calculus and to further extend it to include the kernel case. The aim of the present manuscript is twofold: a) it endeavors to provide a more rigorous presentation of the related material, focusing on aspects that the author finds more insightful and b) it extends the notions of Wirtinger's calculus on general Hilbert spaces (such as Reproducing Hilbert Kernel Spaces).
Simulation de traces réelles d'E/S disque de PC
Venue: arXiv cs.PF 2010
Year: 2010

Under Windows operating system, existing I/O benchmarking tools does not allow a developer to efficiently define a file access strategy according to the applications' constraints. This is essentially due to the fact that the existing tools do allow only a restricted set of I/O workloads that does not generally correspond to the target applications. To cope with this problem, we designed and implemented a precise I/O simulator allowing to simulate whatever real I/O trace on a given defined architecture, and in which most of file and disk cache strategies, their interactions and the detailed storage system architecture are implemented. Simulation results on different workloads and architectures show a very high degree of precision. In fact, the mean error rate as compared to real measures is of about 6% with a maximum of 10% on global throughput.
Efficient Support Coupled Frequent Pattern Mining Over Progressive Databases
Venue: arXiv cs.DB 2010
Year: 2010

There have been many recent studies on sequential pattern mining. The sequential pattern mining on progressive databases is relatively very new, in which we progressively discover the sequential patterns in period of interest. Period of interest is a sliding window continuously advancing as the time goes by. As the focus of sliding window changes, the new items are added to the dataset of interest and obsolete items are removed from it and become up to date. In general, the existing proposals do not fully explore the real world scenario, such as items associated with support in data stream applications such as market basket analysis. Thus mining important knowledge from supported frequent items becomes a non trivial research issue. Our proposed novel approach efficiently mines frequent sequential pattern coupled with support using progressive mining tree.
On the clustering aspect of nonnegative matrix factorization
Venue: arXiv cs.LG 2010
Year: 2010

This paper provides a theoretical explanation on the clustering aspect of nonnegative matrix factorization (NMF). We prove that even without imposing orthogonality nor sparsity constraint on the basis and/or coefficient matrix, NMF still can give clustering results, thus providing a theoretical support for many works, e.g., Xu et al. [1] and Kim et al. [2], that show the superiority of the standard NMF as a clustering method.
Component Evolution in General Random Intersection Graphs
Venue: arXiv cs.DM 2010
Year: 2010

Random intersection graphs (RIGs) are an important random structure with applications in social networks, epidemic networks, blog readership, and wireless sensor networks. RIGs can be interpreted as a model for large randomly formed non-metric data sets. We analyze the component evolution in general RIGs, and give conditions on existence and uniqueness of the giant component. Our techniques generalize existing methods for analysis of component evolution: we analyze survival and extinction properties of a dependent, inhomogeneous Galton-Watson branching process on general RIGs. Our analysis relies on bounding the branching processes and inherits the fundamental concepts of the study of component evolution in Erdős-Rényi graphs. The major challenge comes from the underlying structure of RIGs, which involves its both the set of nodes and the set of attributes, as well as the set of different probabilities among the nodes and attributes.
Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform
Venue: arXiv cs.DS 2010
Year: 2010

The problems of random projections and sparse reconstruction have much in common and individually received much attention. Surprisingly, until now they progressed in parallel and remained mostly separate. Here, we employ new tools from probability in Banach spaces that were successfully used in the context of sparse reconstruction to advance on an open problem in random pojection. In particular, we generalize and use an intricate result by Rudelson and Vershynin for sparse reconstruction which uses Dudley's theorem for bounding Gaussian processes. Our main result states that any set of $N = \exp(\tilde{O}(n))$ real vectors in $n$ dimensional space can be linearly mapped to a space of dimension $k=O(\log N\polylog(n))$, while (1) preserving the pairwise distances among the vectors to within any constant distortion and (2) being able to apply the transformation in time $O(n\log n)$ on each vector. This improves on the best known $N = \exp(\tilde{O}(n^{1/2}))$ achieved by Ailon and Liberty and $N = \exp(\tilde{O}(n^{1/3}))$ by Ailon and Chazelle. The dependence in the distortion constant however is believed to be suboptimal and subject to further investigation. For constant distortion, this settles the open question posed by these authors up to a $\polylog(n)$ factor while considerably simplifying their constructions.
A generic tool to generate a lexicon for NLP from Lexicon-Grammar tables
Venue: arXiv cs.CL 2010
Year: 2010

Lexicon-Grammar tables constitute a large-coverage syntactic lexicon but they cannot be directly used in Natural Language Processing (NLP) applications because they sometimes rely on implicit information. In this paper, we introduce LGExtract, a generic tool for generating a syntactic lexicon for NLP from the Lexicon-Grammar tables. It is based on a global table that contains undefined information and on a unique extraction script including all operations to be performed for all tables. We also present an experiment that has been conducted to generate a new lexicon of French verbs and predicative nouns.
Implementation of a Cloud Data Server (CDS) for Providing Secure Service in E-Business
Venue: arXiv cs.DC 2010
Year: 2010

Cloud Data Servers is the novel approach for providing secure service to e-business .Millions of users are surfing the Cloud for various purposes, therefore they need highly safe and persistent services. Usually hackers target particular Operating Systems or a Particular Controller. Inspiteof several ongoing researches Conventional Web Servers and its Intrusion Detection System might not be able to detect such attacks. So we implement a Cloud Data Server with Session Controller Architecture using Redundancy and Disconnected Data Access Mechanism. In this paper, we generate the hash code using MD5 algorithm. With the help of which we can circumvent even the attacks, which are undefined by traditional Systems .we implement Cloud Data Sever using Java and Hash Code backup Management using My SQL. Here we Implement AES Algorithm for providing more Security for the hash Code. The CDS using the Virtual Controller controls and monitors the Connections and modifications of the page so as to prevent malicious users from hacking the website. In the proposed approach an activity analyzer takes care of intimating the administrator about possible intrusions and the counter measures required to tackle them. The efficiency ratio of our approach is 98.21% compared with similar approaches.
On Infinitary Rational Relations and Borel Sets
Venue: arXiv cs.LO 2010
Year: 2010

We prove in this paper that there exists some infinitary rational relations which are Sigma^0_3-complete Borel sets and some others which are Pi^0_3-complete. This implies that there exists some infinitary rational relations which are Delta^0_4-sets but not (Sigma^0_3U Pi^0_3)-sets. These results give additional answers to questions of Simonnet and of Lescow and Thomas.
Reliable Self-Stabilizing Communication for Quasi Rendezvous
Venue: arXiv cs.DC 2010
Year: 2010

The paper presents three self-stabilizing protocols for basic fair and reliable link communication primitives. We assume a link-register communication model under read/write atomicity, where every process can read from but cannot write into its neighbours' registers. The first primitive guarantees that any process writes a new value in its register(s) only after all its neighbours have read the previous value, whatever the initial scheduling of processes' actions. The second primitive implements a "weak rendezvous" communication mechanism by using an alternating bit protocol: whenever a process consecutively writes n values (possibly the same ones) in a register, each neighbour is guaranteed to read each value from the register at least once. On the basis of the previous protocol, the third primitive implements a "quasi rendezvous": in words, this primitive ensures furthermore that there exists exactly one reading between two writing operations All protocols are self-stabilizing and run in asynchronous arbitrary networks. The goal of the paper is in handling each primitive by a separate procedure, which can be used as a "black box" in more involved self-stabilizing protocols.
An Effective Extension of the Wagner Hierarchy to Blind Counter Automata
Venue: arXiv cs.LO 2010
Year: 2010

The extension of the Wagner hierarchy to blind counter automata accepting infinite words with a Muller acceptance condition is effective. We determine precisely this hierarchy.