OpenRaiser/Intern-Atlas huggingface dataset:
twister - a P2P microblogging platform
Venue: arXiv cs.NI 2013
Year: 2013

This paper proposes a new microblogging architecture based on peer-to-peer networks overlays. The proposed platform is comprised of three mostly independent overlay networks. The first provides distributed user registration and authentication and is based on the Bitcoin protocol. The second one is a Distributed Hash Table (DHT) overlay network providing key/value storage for user resources and tracker location for the third network. The last network is a collection of possibly disjoint "swarms" of followers, based on the Bittorrent protocol, which can be used for efficient near-instant notification delivery to many users. By leveraging from existing and proven technologies, twister provides a new microblogging platform offering security, scalability and privacy features. A mechanism provides incentive for entities that contribute processing time to run the user registration network, rewarding such entities with the privilege of sending a single unsolicited ("promoted") message to the entire network. The number of unsolicited messages per day is defined in order to not upset users.
A Novel Scheme for Generating Secure Face Templates Using BDA
Venue: arXiv cs.CV 2013
Year: 2013

In identity management system, frequently used biometric recognition system needs awareness towards issue of protecting biometric template as far as more reliable solution is apprehensive. In sight of this biometric template protection algorithm should gratify the basic requirements viz. security, discriminability and cancelability. As no single template protection method is capable of satisfying these requirements, a novel scheme for face template generation and protection is proposed. The novel scheme is proposed to provide security and accuracy in new user enrolment and authentication process. This novel scheme takes advantage of both the hybrid approach and the binary discriminant analysis algorithm. This algorithm is designed on the basis of random projection, binary discriminant analysis and fuzzy commitment scheme. Publicly available benchmark face databases (FERET, FRGC, CMU-PIE) and other datasets are used for evaluation. The proposed novel scheme enhances the discriminability and recognition accuracy in terms of matching score of the face images for each stage and provides high security against potential attacks namely brute force and smart attacks. In this paper, we discuss results viz. averages matching score, computation time and security for hybrid approach and novel approach.
Constraint Satisfaction with Counting Quantifiers 2
Venue: arXiv cs.LO 2013
Year: 2013

We study constraint satisfaction problems (CSPs) in the presence of counting quantifiers $\exists^{\geq j}$, asserting the existence of $j$ distinct witnesses for the variable in question. As a continuation of our previous (CSR 2012) paper, we focus on the complexity of undirected graph templates. As our main contribution, we settle the two principal open questions proposed in (CSR 2012). Firstly, we complete the classification of clique templates by proving a full trichotomy for all possible combinations of counting quantifiers and clique sizes, placing each case either in P, NP-complete or Pspace-complete. This involves resolution of the cases in which we have the single quantifier $\exists^{\geq j}$ on the clique $K_{2j}$. Secondly, we confirm a conjecture from (CSR 2012), which proposes a full dichotomy for $\exists$ and $\exists^{\geq 2}$ on all finite undirected graphs. The main thrust of this second result is the solution of the complexity for the infinite path which we prove is a polynomial-time solvable problem. By adapting the algorithm for the infinite path we are then able to solve the problem for finite paths, and then trees and forests. Thus as a corollary to this work, combining with the other cases from (CSR 2012), we obtain a full dichotomy for $\exists$ and $\exists^{\geq 2}$ quantifiers on finite graphs, each such problem being either in P or NP-hard. Finally, we persevere with the work of (CSR 2012) in exploring cases in which there is dichotomy between P and Pspace-complete, in contrast with situations in which the intermediate NP-completeness may appear.
A Process Algebra for Wireless Mesh Networks used for Modelling, Verifying and Analysing AODV
Venue: arXiv cs.NI 2013
Year: 2013

We propose AWN (Algebra for Wireless Networks), a process algebra tailored to the modelling of Mobile Ad hoc Network (MANET) and Wireless Mesh Network (WMN) protocols. It combines novel treatments of local broadcast, conditional unicast and data structures. In this framework we present a rigorous analysis of the Ad hoc On-Demand Distance Vector (AODV) protocol, a popular routing protocol designed for MANETs and WMNs, and one of the four protocols currently standardised by the IETF MANET working group. We give a complete and unambiguous specification of this protocol, thereby formalising the RFC of AODV, the de facto standard specification, given in English prose. In doing so, we had to make non-evident assumptions to resolve ambiguities occurring in that specification. Our formalisation models the exact details of the core functionality of AODV, such as route maintenance and error handling, and only omits timing aspects. The process algebra allows us to formalise and (dis)prove crucial properties of mesh network routing protocols such as loop freedom and packet delivery. We are the first to provide a detailed proof of loop freedom of AODV. In contrast to evaluations using simulation or model checking, our proof is generic and holds for any possible network scenario in terms of network topology, node mobility, etc. Due to ambiguities and contradictions the RFC specification allows several interpretations; we show for more than 5000 of them whether they are loop free or not, thereby demonstrating how the reasoning and proofs can relatively easily be adapted to protocol variants. Using our formal and unambiguous specification, we find shortcomings of AODV that affect performance, e.g. the establishment of non-optimal routes, and some routes not being found at all. We formalise improvements in the same process algebra; carrying over the proofs is again easy.
Humanistic approach in mobile ad hoc network: HAMANET
Venue: arXiv cs.NI 2013
Year: 2013

Human society is a complex and most organized networks, in which many communities have different cultural livelihood. The creation/formation of one or more communities within a society and the way of associations can be mapped to MANET. By involving human characteristics and behavior, surely it would pave a new way, for further development. In this paper we have presented a new approach called "HAMANET" which is not only robust and secure but it certainly meets the challenges of MANET (such as name resolution, address allocation and authentication). Our object oriented design defines a service in terms of Arts, Culture, and Machine. The 'Art' is the smallest unit of work (defined as an interface), the 'Culture' is the integration/assembling of one or more Arts (defined as a class) and finally the 'Machine' which is an instance of a Culture that defines a service. The grouping of the communicable Machines of the same Culture forms a 'Community'. We have used the term 'Society' for MANET consisting of one or more communities and modeled using humanistic approach. We have compared our design with GloMoSim and proposed the implementation of file transfer service using the said approach. Our approach gives better results in terms of implementation of the basic services, security, reliability, throughput, extensibility, scalability etc.
Towards supporting simultaneous use of process-based quality approaches
Venue: arXiv cs.SE 2013
Year: 2013

In this paper we describe the first steps of a PhD programme, having the goal to develop a common meta-model for different software quality approaches and methods. We focus on presenting the structure of quality approaches emphasizing the similarities amongst them. Understanding the structure of quality approaches helps supporting organizations in using multiple quality approaches and methods in the same time.
Knowledge-based Expressive Technologies within Cloud Computing Environments
Venue: arXiv cs.SE 2013
Year: 2013

Presented paper describes the development of comprehensive approach for knowledge processing within e-Sceince tasks. Considering the task solving within a simulation-driven approach a set of knowledge-based procedures for task definition and composite application processing can be identified. This procedures could be supported by the use of domain-specific knowledge being formalized and used for automation purpose. Within this work the developed conceptual and technological knowledge-based toolbox for complex multidisciplinary task solv-ing support is proposed. Using CLAVIRE cloud computing environment as a core platform a set of interconnected expressive technologies were developed.
Assessment of Customer Credit through Combined Clustering of Artificial Neural Networks, Genetics Algorithm and Bayesian Probabilities
Venue: arXiv cs.AI 2013
Year: 2013

Today, with respect to the increasing growth of demand to get credit from the customers of banks and finance and credit institutions, using an effective and efficient method to decrease the risk of non-repayment of credit given is very necessary. Assessment of customers' credit is one of the most important and the most essential duties of banks and institutions, and if an error occurs in this field, it would leads to the great losses for banks and institutions. Thus, using the predicting computer systems has been significantly progressed in recent decades. The data that are provided to the credit institutions' managers help them to make a straight decision for giving the credit or not-giving it. In this paper, we will assess the customer credit through a combined classification using artificial neural networks, genetics algorithm and Bayesian probabilities simultaneously, and the results obtained from three methods mentioned above would be used to achieve an appropriate and final result. We use the K_folds cross validation test in order to assess the method and finally, we compare the proposed method with the methods such as Clustering-Launched Classification (CLC), Support Vector Machine (SVM) as well as GA+SVM where the genetics algorithm has been used to improve them.
Probabilistic Model Checking for Energy Analysis in Software Product Lines
Venue: arXiv cs.SE 2013
Year: 2013

In a software product line (SPL), a collection of software products is defined by their commonalities in terms of features rather than explicitly specifying all products one-by-one. Several verification techniques were adapted to establish temporal properties of SPLs. Symbolic and family-based model checking have been proven to be successful for tackling the combinatorial blow-up arising when reasoning about several feature combinations. However, most formal verification approaches for SPLs presented in the literature focus on the static SPLs, where the features of a product are fixed and cannot be changed during runtime. This is in contrast to dynamic SPLs, allowing to adapt feature combinations of a product dynamically after deployment. The main contribution of the paper is a compositional modeling framework for dynamic SPLs, which supports probabilistic and nondeterministic choices and allows for quantitative analysis. We specify the feature changes during runtime within an automata-based coordination component, enabling to reason over strategies how to trigger dynamic feature changes for optimizing various quantitative objectives, e.g., energy or monetary costs and reliability. For our framework there is a natural and conceptually simple translation into the input language of the prominent probabilistic model checker PRISM. This facilitates the application of PRISM's powerful symbolic engine to the operational behavior of dynamic SPLs and their family-based analysis against various quantitative queries. We demonstrate feasibility of our approach by a case study issuing an energy-aware bonding network device.
Direction of Arrival Estimation Using Co-prime Arrays: A Super Resolution Viewpoint
Venue: arXiv cs.IT 2013
Year: 2013

We consider the problem of direction of arrival (DOA) estimation using a newly proposed structure of non-uniform linear arrays, referred to as co-prime arrays, in this paper. By exploiting the second order statistical information of the received signals, co-prime arrays exhibit O(MN) degrees of freedom with only M + N sensors. A sparsity based recovery method is proposed to fully utilize these degrees of freedom. Unlike traditional sparse recovery methods, the proposed method is based on the developing theory of super resolution, which considers a continuous range of possible sources instead of discretizing this range into a discrete grid. With this approach, off-grid effects inherited in traditional sparse recovery can be neglected, thus improving the accuracy of DOA estimation. In this paper we show that in the noiseless case one can theoretically detect up to M N sources with only 2M + N sensors. The noise 2 statistics of co-prime arrays are also analyzed to demonstrate the robustness of the proposed optimization scheme. A source number detection method is presented based on the spectrum reconstructed from the sparse method. By extensive numerical examples, we show the superiority of the proposed method in terms of DOA estimation accuracy, degrees of freedom, and resolution ability compared with previous methods, such as MUSIC with spatial smoothing and the discrete sparse recovery method.
Approximating the Bethe partition function
Venue: arXiv cs.LG 2013
Year: 2013

When belief propagation (BP) converges, it does so to a stationary point of the Bethe free energy $F$, and is often strikingly accurate. However, it may converge only to a local optimum or may not converge at all. An algorithm was recently introduced for attractive binary pairwise MRFs which is guaranteed to return an $ε$-approximation to the global minimum of $F$ in polynomial time provided the maximum degree $Δ=O(\log n)$, where $n$ is the number of variables. Here we significantly improve this algorithm and derive several results including a new approach based on analyzing first derivatives of $F$, which leads to performance that is typically far superior and yields a fully polynomial-time approximation scheme (FPTAS) for attractive models without any degree restriction. Further, the method applies to general (non-attractive) models, though with no polynomial time guarantee in this case, leading to the important result that approximating $\log$ of the Bethe partition function, $\log Z_B=-\min F$, for a general model to additive $ε$-accuracy may be reduced to a discrete MAP inference problem. We explore an application to predicting equipment failure on an urban power network and demonstrate that the Bethe approximation can perform well even when BP fails to converge.
Audit Maturity Model
Venue: arXiv cs.SE 2013
Year: 2013

Today it is crucial for organizations to pay even greater attention on quality management as the importance of this function in achieving ultimate business objectives is increasingly becoming clearer. Importance of the Quality Management Function in achieving basic need by ensuring compliance with Capability Maturity Model Integrated or International Organization for Standardization is a basic demand from business nowadays. However, Quality Management Function and its processes need to be made much more mature to prevent delivery outages and to achieve business excellence through their review and auditing capability. Many organizations now face challenges in determining the maturity of the Quality Management group along with the service offered by them and the right way to elevate the maturity of the same. The objective of this whitepaper is to propose a new model, the Audit Maturity Model which will provide organizations with a measure of their maturity in quality management in the perspective of auditing, along with recommendations for preventing delivery outage, and identifying risk to achieve business excellence. This will enable organizations to assess Quality Management maturity higher than basic hygiene and will also help them to identify gaps and to take corrective actions for achieving higher maturity levels. Hence the objective is to envisage a new auditing model as a part of organisation quality management function which can be a guide for them to achieve higher level of maturity and ultimately help to achieve delivery and business excellence.
Fast Algorithm for Partial Covers in Words
Venue: arXiv cs.DS 2013
Year: 2013

A factor $u$ of a word $w$ is a cover of $w$ if every position in $w$ lies within some occurrence of $u$ in $w$. A word $w$ covered by $u$ thus generalizes the idea of a repetition, that is, a word composed of exact concatenations of $u$. In this article we introduce a new notion of $α$-partial cover, which can be viewed as a relaxed variant of cover, that is, a factor covering at least $α$ positions in $w$. We develop a data structure of $O(n)$ size (where $n=|w|$) that can be constructed in $O(n\log n)$ time which we apply to compute all shortest $α$-partial covers for a given $α$. We also employ it for an $O(n\log n)$-time algorithm computing a shortest $α$-partial cover for each $α=1,2,\ldots,n$.
On the Limits of Depth Reduction at Depth 3 Over Small Finite Fields
Venue: arXiv cs.CC 2013
Year: 2013

Recently, Gupta et.al. [GKKS2013] proved that over Q any $n^{O(1)}$-variate and $n$-degree polynomial in VP can also be computed by a depth three $ΣΠΣ$ circuit of size $2^{O(\sqrt{n}\log^{3/2}n)}$. Over fixed-size finite fields, Grigoriev and Karpinski proved that any $ΣΠΣ$ circuit that computes $Det_n$ (or $Perm_n$) must be of size $2^{Ω(n)}$ [GK1998]. In this paper, we prove that over fixed-size finite fields, any $ΣΠΣ$ circuit for computing the iterated matrix multiplication polynomial of $n$ generic matrices of size $n\times n$, must be of size $2^{Ω(n\log n)}$. The importance of this result is that over fixed-size fields there is no depth reduction technique that can be used to compute all the $n^{O(1)}$-variate and $n$-degree polynomials in VP by depth 3 circuits of size $2^{o(n\log n)}$. The result [GK1998] can only rule out such a possibility for depth 3 circuits of size $2^{o(n)}$. We also give an example of an explicit polynomial ($NW_{n,ε}(X)$) in VNP (not known to be in VP), for which any $ΣΠΣ$ circuit computing it (over fixed-size fields) must be of size $2^{Ω(n\log n)}$. The polynomial we consider is constructed from the combinatorial design. An interesting feature of this result is that we get the first examples of two polynomials (one in VP and one in VNP) such that they have provably stronger circuit size lower bounds than Permanent in a reasonably strong model of computation. Next, we prove that any depth 4 $ΣΠ^{[O(\sqrt{n})]}ΣΠ^{[\sqrt{n}]}$ circuit computing $NW_{n,ε}(X)$ (over any field) must be of size $2^{Ω(\sqrt{n}\log n)}$. To the best of our knowledge, the polynomial $NW_{n,ε}(X)$ is the first example of an explicit polynomial in VNP such that it requires $2^{Ω(\sqrt{n}\log n)}$ size depth four circuits, but no known matching upper bound.
The DFLU flux for systems of conservation laws
Venue: arXiv cs.NA 2013
Year: 2013

The DFLU numerical flux was introduced in order to solve hyperbolic scalar conservation laws with a flux function discontinuous in space. We show how this flux can be used to solve certain class of systems of conservation laws such as systems modeling polymer flooding in oil reservoir engineering. Furthermore, these results are extended to the case where the flux function is discontinuous in the space variable. Such a situation arises for example while dealing with oil reservoirs which are heterogeneous. Numerical experiments are presented to illustrate the efficiency of this new scheme compared to other standard schemes like upstream mobility, Lax-Friedrichs and Force schemes.
Unbalanced Allocations
Venue: arXiv cs.DM 2013
Year: 2013

We consider the unbalanced allocation of $m$ balls into $n$ bins by a randomized algorithm using the "power of two choices". For each ball, we select a set of bins at random, then place the ball in the fullest bin within the set. Applications of this generic algorithm range from cost minimization to condensed matter physics. In this paper, we analyze the distribution of the bin loads produced by this algorithm, considering, for example, largest and smallest loads, loads of subsets of the bins, and the likelihood of bins having equal loads.
Design and implementation of the Customer Experience Data Mart in the Telecommunication Industry: Application Order-To-Payment end to end process
Venue: arXiv cs.OH 2013
Year: 2013

Facing the new market challenges, service providers are looking for solutions to improve three major business areas namely the Customer Experience, The Operational Efficiency and Revenue and Margin. To meet the business requiements related to these areas, service providers are going through three major transformation programs namely the Business Support Systems transformation program for Customer related aspects, the Operations Support System transformation program for mainly service Fulfillment and Assurance and Resource, Fulfillment and Assurance, and Time To Market Transformation program for Products ans Services development and management. These transformations are about making a transition from a current situation with all its views to a desired one. The information view transformation is about reorganizing and reengineering the existing information to be used for the day to day activities and reporting to support decision making. For reporting purpose, service providers have to invest in Business Intelligence solutions. For which the main purpose is to provide the right information in a timely manner to efficiently support the decision making. One of the key BI challenges is to model an information structure where to host all the information coming from multiple sources. The purpose of this paper is to suggest a step by step methodology to design a Telco Data Mart, one of the fundamental BI components. Order-To-Payment, an end to end customer process, will be used as an application for this methodology. Our methodology consists on bringing together the concepts of business intelligence and the telecom business frameworks developed by the TM Forum: the Business Process Framework, the Information Framework, and the Business Metrics. The advantage of this solution is its ability to adapt to any telecom enterprise architecture since it's built around the business standards.
Privacy Preserving Social Network Publication Against Mutual Friend Attacks
Venue: arXiv cs.DB 2013
Year: 2013

Publishing social network data for research purposes has raised serious concerns for individual privacy. There exist many privacy-preserving works that can deal with different attack models. In this paper, we introduce a novel privacy attack model and refer it as a mutual friend attack. In this model, the adversary can re-identify a pair of friends by using their number of mutual friends. To address this issue, we propose a new anonymity concept, called k-NMF anonymity, i.e., k-anonymity on the number of mutual friends, which ensures that there exist at least k-1 other friend pairs in the graph that share the same number of mutual friends. We devise algorithms to achieve the k-NMF anonymity while preserving the original vertex set in the sense that we allow the occasional addition but no deletion of vertices. Further we give an algorithm to ensure the k-degree anonymity in addition to the k-NMF anonymity. The experimental results on real-word datasets demonstrate that our approach can preserve the privacy and utility of social networks effectively against mutual friend attacks.