OpenRaiser/Intern-Atlas huggingface dataset:
Distributed and Big Data Storage Management in Grid Computing
Venue: arXiv cs.DC 2012
Year: 2012

Big data storage management is one of the most challenging issues for Grid computing environments, since large amount of data intensive applications frequently involve a high degree of data access locality. Grid applications typically deal with large amounts of data. In traditional approaches high-performance computing consists dedicated servers that are used to data storage and data replication. In this paper we present a new mechanism for distributed and big data storage and resource discovery services. Here we proposed an architecture named Dynamic and Scalable Storage Management (DSSM) architecture in grid environments. This allows in grid computing not only sharing the computational cycles, but also share the storage space. The storage can be transparently accessed from any grid machine, allowing easy data sharing among grid users and applications. The concept of virtual ids that, allows the creation of virtual spaces has been introduced and used. The DSSM divides all Grid Oriented Storage devices (nodes) into multiple geographically distributed domains and to facilitate the locality and simplify the intra-domain storage management. Grid service based storage resources are adopted to stack simple modular service piece by piece as demand grows. To this end, we propose four axes that define: DSSM architecture and algorithms description, Storage resources and resource discovery into Grid service, Evaluate purpose prototype system, dynamically, scalability, and bandwidth, and Discuss results. Algorithms at bottom and upper level for standardization dynamic and scalable storage management, along with higher bandwidths have been designed.
A Web Interface for Matita
Venue: arXiv cs.LO 2012
Year: 2012

This article describes a prototype implementation of a web interface for the Matita proof assistant. The interface supports all basic functionalities of the local Gtk interface, but takes advantage of the markup to enrich the document with several kinds of annotations or active elements. Annotations may have both a presentational/hypertextual nature, aimed to improve the quality of the proof script as a human readable document, or a more semantic nature, aimed to help the system in its processing of the script. The latter kind comprises information automatically generated by the proof assistant during previous compilations, and stored to improve the performance of re-executing expensive operations like disambiguation or automation.
BIGP- a new single protocol that can work as an igp (interior gateway protocol) as well as egp (exterior gateway protocol)
Venue: arXiv cs.NI 2012
Year: 2012

EGP and IGP are the key components of the present internet infrastructure. Routers in a domain forward IP packet within and between domains. Each domain uses an intra-domain routing protocol known as Interior Gateway Protocol (IGP) like IS-IS, OSPF, RIP etc to populate the routing tables of its routers. Routing information must also be exchanged between domains to ensure that a host in one domain can reach another host in remote domain. This role is performed by inter-domain routing protocol called Exterior Gateway Protocol (EGP). Basically EGP used these days is Border Gateway Protocol (BGP). Basic difference between the both is that BGP has smaller convergence as compared to the IGP's. And IGP's on the other hand have lesser scalability as compared to the BGP. So in this paper a proposal to create a new protocol is given which can act as an IGP when we consider inter-domain transfer of traffic and acts as BGP when we consider intra-domain transfer of traffic.
Dynamic Web Service Composition based on Network Modeling with Statistical Analysis and Backtracking
Venue: arXiv cs.SE 2012
Year: 2012

A Web service is a software system designed to support interoperable machine-to-machine interaction over a network. Web services provide a standard means of interoperating between different software applications, running on a variety of platforms and/or frameworks. One of the main advantages of the usage of web services is its ability to integrate with the other services through web service composition and realize the required functionality. This paper presents a new paradigm of dynamic web services composition using network analysis paired with backtracking. An algorithm called "Zeittafel" for the selection and scheduling of services that are to be composed is also presented. With the proposed system better percentage of job success rate is obtained compared to the existing methodology.
Implementation of Private Cloud using Eucalyptus and an open source Operating System
Venue: arXiv cs.DC 2012
Year: 2012

Cloud computing is bringing a revolution in computing environment replacing traditional software installations, licensing issues into complete on-demand services through internet. Microsoft office 365 a cloud based office application is available to clients online hence no need to buy and install the software. On Facebook a social networking website, users upload videos which uses cloud provider's storage service so less hardware cost for clients.Virtualization technology has great contribution in advent of cloud computing. Paper describes implementation of Private Cloud using open source operating system Ubuntu 10.04 server edition, installation of Ubuntu Enterprise Cloud with Eucalyptus 1.6.2 and providing CentOS 5.3 operating system through cloud.
Non-Local Euclidean Medians
Venue: arXiv cs.CV 2012
Year: 2012

In this letter, we note that the denoising performance of Non-Local Means (NLM) at large noise levels can be improved by replacing the mean by the Euclidean median. We call this new denoising algorithm the Non-Local Euclidean Medians (NLEM). At the heart of NLEM is the observation that the median is more robust to outliers than the mean. In particular, we provide a simple geometric insight that explains why NLEM performs better than NLM in the vicinity of edges, particularly at large noise levels. NLEM can be efficiently implemented using iteratively reweighted least squares, and its computational complexity is comparable to that of NLM. We provide some preliminary results to study the proposed algorithm and to compare it with NLM.
Isomorphisms of types in the presence of higher-order references (extended version)
Venue: arXiv cs.LO 2012
Year: 2012

We investigate the problem of type isomorphisms in the presence of higher-order references. We first introduce a finitary programming language with sum types and higher-order references, for which we build a fully abstract games model following the work of Abramsky, Honda and McCusker. Solving an open problem by Laurent, we show that two finitely branching arenas are isomorphic if and only if they are geometrically the same, up to renaming of moves (Laurent's forest isomorphism). We deduce from this an equational theory characterizing isomorphisms of types in our language. We show however that Laurent's conjecture does not hold on infinitely branching arenas, yielding new non-trivial type isomorphisms in a variant of our language with natural numbers.
Deconvolution of vibroacoustic images using a simulation model based on a three dimensional point spread function
Venue: arXiv cs.CV 2012
Year: 2012

Vibro-acoustography (VA) is a medical imaging method based on the difference-frequency generation produced by the mixture of two focused ultrasound beams. VA has been applied to different problems in medical imaging such as imaging bones, microcalcifications in the breast, mass lesions, and calcified arteries. The obtained images may have a resolution of 0.7--0.8 mm. Current VA systems based on confocal or linear array transducers generate C-scan images at the beam focal plane. Images on the axial plane are also possible, however the system resolution along depth worsens when compared to the lateral one. Typical axial resolution is about 1.0 cm. Furthermore, the elevation resolution of linear array systems is larger than that in lateral direction. This asymmetry degrades C-scan images obtained using linear arrays. The purpose of this article is to study VA image restoration based on a 3D point spread function (PSF) using classical deconvolution algorithms: Wiener, constrained least-squares (CLSs), and geometric mean filters. To assess the filters' performance, we use an image quality index that accounts for correlation loss, luminance and contrast distortion. Results for simulated VA images show that the quality index achieved with the Wiener filter is 0.9 (1 indicates perfect restoration). This filter yielded the best result in comparison with the other ones. Moreover, the deconvolution algorithms were applied to an experimental VA image of a phantom composed of three stretched 0.5 mm wires. Experiments were performed using transducer driven at two frequencies, 3075 kHz and 3125 kHz, which resulted in the difference-frequency of 50 kHz. Restorations with the theoretical line spread function (LSF) did not recover sufficient information to identify the wires in the images. However, using an estimated LSF the obtained results displayed enough information to spot the wires in the images.
Dimension Reduction by Mutual Information Feature Extraction
Venue: arXiv cs.LG 2012
Year: 2012

During the past decades, to study high-dimensional data in a large variety of problems, researchers have proposed many Feature Extraction algorithms. One of the most effective approaches for optimal feature extraction is based on mutual information (MI). However it is not always easy to get an accurate estimation for high dimensional MI. In terms of MI, the optimal feature extraction is creating a feature set from the data which jointly have the largest dependency on the target class and minimum redundancy. In this paper, a component-by-component gradient ascent method is proposed for feature extraction which is based on one-dimensional MI estimates. We will refer to this algorithm as Mutual Information Feature Extraction (MIFX). The performance of this proposed method is evaluated using UCI databases. The results indicate that MIFX provides a robust performance over different data sets which are almost always the best or comparable to the best ones.
Memory Efficient De Bruijn Graph Construction
Venue: arXiv cs.DS 2012
Year: 2012

Massively parallel DNA sequencing technologies are revolutionizing genomics research. Billions of short reads generated at low costs can be assembled for reconstructing the whole genomes. Unfortunately, the large memory footprint of the existing de novo assembly algorithms makes it challenging to get the assembly done for higher eukaryotes like mammals. In this work, we investigate the memory issue of constructing de Bruijn graph, a core task in leading assembly algorithms, which often consumes several hundreds of gigabytes memory for large genomes. We propose a disk-based partition method, called Minimum Substring Partitioning (MSP), to complete the task using less than 10 gigabytes memory, without runtime slowdown. MSP breaks the short reads into multiple small disjoint partitions so that each partition can be loaded into memory, processed individually and later merged with others to form a de Bruijn graph. By leveraging the overlaps among the k-mers (substring of length k), MSP achieves astonishing compression ratio: The total size of partitions is reduced from $Θ(kn)$ to $Θ(n)$, where $n$ is the size of the short read database, and $k$ is the length of a $k$-mer. Experimental results show that our method can build de Bruijn graphs using a commodity computer for any large-volume sequence dataset.
Information Retrieval Model: A Social Network Extraction Perspective
Venue: arXiv cs.IR 2012
Year: 2012

Future Information Retrieval, especially in connection with the internet, will incorporate the content descriptions that are generated with social network extraction technologies and preferably incorporate the probability theory for assigning the semantic. Although there is an increasing interest about social network extraction, but a little of them has a significant impact to infomation retrieval. Therefore this paper proposes a model of information retrieval from the social network extraction.
Approximating the diameter of a graph
Venue: arXiv cs.DS 2012
Year: 2012

In this paper we consider the fundamental problem of approximating the diameter $D$ of directed or undirected graphs. In a seminal paper, Aingworth, Chekuri, Indyk and Motwani [SIAM J. Comput. 1999] presented an algorithm that computes in $\Ot(m\sqrt n + n^2)$ time an estimate $\hat{D}$ for the diameter of an $n$-node, $m$-edge graph, such that $\lfloor 2/3 D \rfloor \leq \hat{D} \leq D$. In this paper we present an algorithm that produces the same estimate in $\Ot(m\sqrt n)$ expected running time. We then provide strong evidence that a better approximation may be hard to obtain if we insist on an $O(m^{2-\eps})$ running time. In particular, we show that if there is some constant $\eps>0$ so that there is an algorithm for undirected unweighted graphs that runs in $O(m^{2-\eps})$ time and produces an approximation $\hat{D}$ such that $ (2/3+\eps) D \leq \hat{D} \leq D$, then SAT for CNF formulas on $n$ variables can be solved in $O^{*}((2-δ)^{n})$ time for some constant $δ>0$, and the strong exponential time hypothesis of [Impagliazzo, Paturi, Zane JCSS'01] is false. Motivated by this somewhat negative result, we study whether it is possible to obtain a better approximation for specific cases. For unweighted directed or undirected graphs, we show that if $D=3h+z$, where $h\geq 0$ and $z\in {0,1,2}$, then it is possible to report in $\tilde{O}(\min{m^{2/3} n^{4/3},m^{2-1/(2h+3)}})$ time an estimate $\hat{D}$ such that $2h+z \leq \hat{D}\leq D$, thus giving a better than 3/2 approximation whenever $z\neq 0$. This is significant for constant values of $D$ which is exactly when the diameter approximation problem is hardest to solve. For the case of unweighted undirected graphs we present an $\tilde{O}(m^{2/3} n^{4/3})$ time algorithm that reports an estimate $\hat{D}$ such that $\lfloor 4D/5\rfloor \leq \hat{D}\leq D$.
Identify Web-page Content meaning using Knowledge based System for Dual Meaning Words
Venue: arXiv cs.IR 2012
Year: 2012

Meaning of Web-page content plays a big role while produced a search result from a search engine. Most of the cases Web-page meaning stored in title or meta-tag area but those meanings do not always match with Web-page content. To overcome this situation we need to go through the Web-page content to identify the Web-page meaning. In such cases, where Webpage content holds dual meaning words that time it is really difficult to identify the meaning of the Web-page. In this paper, we are introducing a new design and development mechanism of identifying the Web-page content meaning which holds dual meaning words in their Web-page content.
Formal Checking of Multiple Firewalls
Venue: arXiv cs.CR 2012
Year: 2012

When enterprises deploy multiple firewalls, a packet may be examined by different sets of firewalls. It has been observed that the resulting complex firewall network is highly error prone and causes serious security holes. Hence, automated solutions are needed in order to check its correctness. In this paper, we propose a formal and automatic method for checking whether multiple firewalls react correctly with respect to a security policy given in a high level declarative language. When errors are detected, some useful feedback is returned in order to correct the firewall configurations. Furthermore, we propose a priority-based approach to ensure that no incoherencies exist within the security policy. We show that our method is both correct and complete. Finally, it has been implemented in a prototype of verifier based on a satisfiability solver modulo theories. Experiment conducted on relevant case studies demonstrates the efficiency of our approach.
Hybrid Grey Interval Relation Decision-Making in Artistic Talent Evaluation of Player
Venue: arXiv cs.AI 2012
Year: 2012

This paper proposes a grey interval relation TOPSIS method for the decision making in which all of the attribute weights and attribute values are given by the interval grey numbers. In this paper, all of the subjective and objective weights are obtained by interval grey number and decision-making is based on four methods such as the relative approach degree of grey TOPSIS, the relative approach degree of grey incidence and the relative approach degree method using the maximum entropy estimation using 2-dimensional Euclidean distance. A multiple attribute decision-making example for evaluation of artistic talent of Kayagum (stringed Korean harp) players is given to show practicability of the proposed approach.
CBHRP: A Cluster Based Routing Protocol for Wireless Sensor Network
Venue: arXiv cs.NI 2012
Year: 2012

A new two layer hierarchical routing protocol called Cluster Based Hierarchical Routing Protocol (CBHRP) is proposed in this paper. It is an extension of LEACH routing protocol. We introduce cluster head-set idea for cluster-based routing where several clusters are formed with the deployed sensors to collect information from target field. On rotation basis, a head-set member receives data from the neighbor nodes and transmits the aggregated results to the distance base station. This protocol reduces energy consumption quite significantly and prolongs the life time of sensor network. It is found that CBHRP performs better than other well accepted hierarchical routing protocols like LEACH in term of energy consumption and time requirement.
Impact of Different Spreading Codes Using FEC on DWT Based MC-CDMA System
Venue: arXiv cs.IT 2012
Year: 2012

The effect of different spreading codes in DWT based MC-CDMA wireless communication system is investigated. In this paper, we present the Bit Error Rate (BER) performance of different spreading codes (Walsh-Hadamard code, Orthogonal gold code and Golay complementary sequences) using Forward Error Correction (FEC) of the proposed system. The data is analyzed and is compared among different spreading codes in both coded and uncoded cases. It is found via computer simulation that the performance of the proposed coded system is much better than that of the uncoded system irrespective of the spreading codes and all the spreading codes show approximately similar nature for both coded and uncoded in all modulation schemes.
Developments and Obstacles in Chinese eBook Market
Venue: arXiv cs.DL 2012
Year: 2012

The purpose of this study was to provide insights into the eBook market in China through case studies on eBook companies and a survey research with individual eBook users. The information from three companies, Beijing Superstar Electric Company, Beijing Founder APABI Technology Limited, and Beijing Sursen Electronic Technology Company Limited, showed that the B2B market has been developed due to the huge requirement from organization customers, universities libraries in particularly, and the B2C market is still immature. The information from interviews and relative data revealed that both Superstar and Sursen have serious copyright infringement which is an important problem impeding the further development of the eBook market. The questionnaire explored awareness, purchase, reading and other experiences of eBook end-users. Questions indicated that readers were attracted by the technical advantages including costless to copy, easy to transfer, searchable and easy to store, but did not want to pay for eBooks. Because the computers, especially desktop PCs, were the main device for reading and the CRT displays were massive used while there were few dedicated reading device in the market, many eBook end-users still preferred to read extended passages of text on papers rather than screens. Today the copyrights issue, user acceptance and the reading device are three significant obstacles for eBook industry in China.
A Complete Anytime Algorithm for Treewidth
Venue: arXiv cs.DS 2012
Year: 2012

In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect elimination ordering of vertices of the graph. The algorithm uses novel pruning and propagation techniques which are derived from the theory of graph minors and graph isomorphism. We present a new algorithm called minor-min-width for computing a lower bound on treewidth that is used within the branch and bound algorithm and which improves over earlier available lower bounds. Empirical evaluation of QuickBB on randomly generated graphs and benchmarks in Graph Coloring and Bayesian Networks shows that it is consistently better than complete algorithms like QuickTree [Shoikhet and Geiger, 1997] in terms of cpu time. QuickBB also has good anytime performance, being able to generate a better upper bound on treewidth of some graphs whose optimal treewidth could not be computed up to now.
The Minimum Information Principle for Discriminative Learning
Venue: arXiv cs.LG 2012
Year: 2012

Exponential models of distributions are widely used in machine learning for classiffication and modelling. It is well known that they can be interpreted as maximum entropy models under empirical expectation constraints. In this work, we argue that for classiffication tasks, mutual information is a more suitable information theoretic measure to be optimized. We show how the principle of minimum mutual information generalizes that of maximum entropy, and provides a comprehensive framework for building discriminative classiffiers. A game theoretic interpretation of our approach is then given, and several generalization bounds provided. We present iterative algorithms for solving the minimum information problem and its convex dual, and demonstrate their performance on various classiffication tasks. The results show that minimum information classiffiers outperform the corresponding maximum entropy models.
Metrics for Finite Markov Decision Processes
Venue: arXiv cs.AI 2012
Year: 2012

We present metrics for measuring the similarity of states in a finite Markov decision process (MDP). The formulation of our metrics is based on the notion of bisimulation for MDPs, with an aim towards solving discounted infinite horizon reinforcement learning tasks. Such metrics can be used to aggregate states, as well as to better structure other value function approximators (e.g., memory-based or nearest-neighbor approximators). We provide bounds that relate our metric distances to the optimal values of states in the given MDP.
Sensitivity Analysis in Bayesian Networks: From Single to Multiple Parameters
Venue: arXiv cs.AI 2012
Year: 2012

Previous work on sensitivity analysis in Bayesian networks has focused on single parameters, where the goal is to understand the sensitivity of queries to single parameter changes, and to identify single parameter changes that would enforce a certain query constraint. In this paper, we expand the work to multiple parameters which may be in the CPT of a single variable, or the CPTs of multiple variables. Not only do we identify the solution space of multiple parameter changes that would be needed to enforce a query constraint, but we also show how to find the optimal solution, that is, the one which disturbs the current probability distribution the least (with respect to a specific measure of disturbance). We characterize the computational complexity of our new techniques and discuss their applications to developing and debugging Bayesian networks, and to the problem of reasoning about the value (reliability) of new information.