OpenRaiser/Intern-Atlas huggingface dataset:
Tight Approximation of Image Matching
Venue: arXiv cs.DS 2011
Year: 2011

In this work we consider the {\em image matching} problem for two grayscale $n \times n$ images, $M_1$ and $M_2$ (where pixel values range from 0 to 1). Our goal is to find an affine transformation $T$ that maps pixels from $M_1$ to pixels in $M_2$ so that the differences over pixels $p$ between $M_1(p)$ and $M_2(T(p))$ is minimized. Our focus here is on sublinear algorithms that give an approximate result for this problem, that is, we wish to perform this task while querying as few pixels from both images as possible, and give a transformation that comes close to minimizing the difference. We give an algorithm for the image matching problem that returns a transformation $T$ which minimizes the sum of differences (normalized by $n^2$) up to an additive error of $ε$ and performs $\tilde{O}(n/ε^2)$ queries. We give a corresponding lower bound of $Ω(n)$ queries showing that this is the best possible result in the general case (with respect to $n$ and up to low order terms). In addition, we give a significantly better algorithm for a natural family of images, namely, smooth images. We consider an image smooth when the total difference between neighboring pixels is O(n). For such images we provide an approximation of the distance between the images to within an additive error of $ε$ using a number of queries depending polynomially on $1/ε$ and not on $n$. To do this we first consider the image matching problem for 2 and 3-dimensional {\em binary} images, and then reduce the grayscale image matching problem to the 3-dimensional binary case.
IT Security Issues Within the Video Game Industry
Venue: arXiv cs.CR 2011
Year: 2011

IT security issues are an important aspect for each and every organization within the video game industry. Within the video game industry alone, you might not normally think of security risks being an issue. But as we can and have seen in recent news, no company is immune to security risks no matter how big or how small. While each of these organizations will never be exactly the same as the next, there are common security issues that can and do affect each and every video game company. In order to properly address those security issues, one of the current leading video game companies was selected in order to perform an initial security assessment. This security assessment provided a starting point upon which specific goals and procedures were determined to help mitigate those risks. The information contained within was initially completed on the case study but has been generalized to allow the information to be easily applied to any video game company.
Information Security Plan for Flight Simulator Applications
Venue: arXiv cs.CR 2011
Year: 2011

The Department of Defense has a need for an identity management system that uses two factor authentications to ensure that only the correct individuals get access to their top secret flight simulator program. Currently the Department of Defense does not have a web interface sign in system. We will be creating a system that will allow them to access their programs, back office and administrator functions remotely. A security plan outlining our security architecture will be delivered prior to the final code roll out. The plan will include responses to encryption used and the security architecture applied in the final documentation. The code will be delivered in phases to work out any issues that may occur during the implementation
Monitoring Software Reliability using Statistical Process control: An MMLE approach
Venue: arXiv cs.SE 2011
Year: 2011

This paper consider an MMLE (Modified Maximum Likelihood Estimation) based scheme to estimate software reliability using exponential distribution. The MMLE is one of the generalized frameworks of software reliability models of Non Homogeneous Poisson Processes (NHPPs). The MMLE gives analytical estimators rather than an iterative approximation to estimate the parameters. In this paper we proposed SPC (Statistical Process Control) Charts mechanism to determine the software quality using inter failure times data. The Control charts can be used to measure whether the software process is statistically under control or not.
One-Hop Throughput of Wireless Networks with Random Connections
Venue: arXiv cs.IT 2011
Year: 2011

We consider one-hop communication in wireless networks with random connections. In the random connection model, the channel powers between different nodes are drawn from a common distribution in an i.i.d. manner. An scheme achieving the throughput scaling of order $n^{1/3-δ}$, for any $δ>0$, is proposed, where $n$ is the number of nodes. Such achievable throughput, along with the order $n^{1/3}$ upper bound derived by Cui et al., characterizes the throughput capacity of one-hop schemes for the class of connection models with finite mean and variance.
Lightweight Hierarchical Model for HWSNET
Venue: arXiv cs.NI 2011
Year: 2011

Heterogeneous wireless sensor networks (HWSNET) are more suitable for real life applications as compared to the homogeneous counterpart. Security of HWSNET becomes a very important issue with the rapid development of HWSNET. Intrusion detection system is one of the major and efficient defensive methods against attacks in HWSNET. Because of different constraints of sensor networks, security solutions have to be designed with limited usage of computation and resources. A particularly devastating attack is the sleep deprivation attack. Here a malicious node forces legitimate nodes to waste their energy by resisting the sensor nodes from going into low power sleep mode. The target of this attack is to maximize the power consumption of the affected node, thereby decreasing its battery life. Existing works on sleep deprivation attack have mainly focused on mitigation using MAC based protocols, such as S-MAC (sensor MAC), T-MAC (timeout MAC), B-MAC (Berkley MAC), G-MAC (gateway MAC). In this article, a brief review of some of the recent intrusion detection systems in wireless sensor network environment is presented. Finally, a framework of cluster based layered countermeasure for Insomnia Detection has been proposed for heterogeneous wireless sensor network (HWSNET) to efficiently detect sleep deprivation attack. Simulation results on MATLAB exhibit the effectiveness of the proposed model.
Semantic-Driven e-Government: Application of Uschold and King Ontology Building Methodology for Semantic Ontology Models Development
Venue: arXiv cs.AI 2011
Year: 2011

Electronic government (e-government) has been one of the most active areas of ontology development during the past six years. In e-government, ontologies are being used to describe and specify e-government services (e-services) because they enable easy composition, matching, mapping and merging of various e-government services. More importantly, they also facilitate the semantic integration and interoperability of e-government services. However, it is still unclear in the current literature how an existing ontology building methodology can be applied to develop semantic ontology models in a government service domain. In this paper the Uschold and King ontology building methodology is applied to develop semantic ontology models in a government service domain. Firstly, the Uschold and King methodology is presented, discussed and applied to build a government domain ontology. Secondly, the domain ontology is evaluated for semantic consistency using its semi-formal representation in Description Logic. Thirdly, an alignment of the domain ontology with the Descriptive Ontology for Linguistic and Cognitive Engineering (DOLCE) upper level ontology is drawn to allow its wider visibility and facilitate its integration with existing metadata standard. Finally, the domain ontology is formally written in Web Ontology Language (OWL) to enable its automatic processing by computers. The study aims to provide direction for the application of existing ontology building methodologies in the Semantic Web development processes of e-government domain specific ontology models; which would enable their repeatability in other e-government projects and strengthen the adoption of semantic technologies in e-government.
The Urge to Merge: When Cellular Service Providers Pool Capacity
Venue: arXiv cs.NI 2011
Year: 2011

As cellular networks are turning into a platform for ubiquitous data access, cellular operators are facing a severe data capacity crisis due to the exponential growth of traffic generated by mobile users. In this work, we investigate the benefits of sharing infrastructure and spectrum among two cellular operators. Specifically, we provide a multi-cell analytical model using stochastic geometry to identify the performance gain under different sharing strategies, which gives tractable and accurate results. To validate the performance using a realistic setting, we conduct extensive simulations for a multi-cell OFDMA system using real base station locations. Both analytical and simulation results show that even a simple cooperation strategy between two similar operators, where they share spectrum and base stations, roughly quadruples capacity as compared to the capacity of a single operator. This is equivalent to doubling the capacity per customer, providing a strong incentive for operators to cooperate, if not actually merge.
Intrinsically Dynamic Network Communities
Venue: arXiv cs.SI 2011
Year: 2011

Community finding algorithms for networks have recently been extended to dynamic data. Most of these recent methods aim at exhibiting community partitions from successive graph snapshots and thereafter connecting or smoothing these partitions using clever time-dependent features and sampling techniques. These approaches are nonetheless achieving longitudinal rather than dynamic community detection. We assume that communities are fundamentally defined by the repetition of interactions among a set of nodes over time. According to this definition, analyzing the data by considering successive snapshots induces a significant loss of information: we suggest that it blurs essentially dynamic phenomena - such as communities based on repeated inter-temporal interactions, nodes switching from a community to another across time, or the possibility that a community survives while its members are being integrally replaced over a longer time period. We propose a formalism which aims at tackling this issue in the context of time-directed datasets (such as citation networks), and present several illustrations on both empirical and synthetic dynamic networks. We eventually introduce intrinsically dynamic metrics to qualify temporal community structure and emphasize their possible role as an estimator of the quality of the community detection - taking into account the fact that various empirical contexts may call for distinct `community' definitions and detection criteria.
Pushing Your Point of View: Behavioral Measures of Manipulation in Wikipedia
Venue: arXiv cs.SI 2011
Year: 2011

As a major source for information on virtually any topic, Wikipedia serves an important role in public dissemination and consumption of knowledge. As a result, it presents tremendous potential for people to promulgate their own points of view; such efforts may be more subtle than typical vandalism. In this paper, we introduce new behavioral metrics to quantify the level of controversy associated with a particular user: a Controversy Score (C-Score) based on the amount of attention the user focuses on controversial pages, and a Clustered Controversy Score (CC-Score) that also takes into account topical clustering. We show that both these measures are useful for identifying people who try to "push" their points of view, by showing that they are good predictors of which editors get blocked. The metrics can be used to triage potential POV pushers. We apply this idea to a dataset of users who requested promotion to administrator status and easily identify some editors who significantly changed their behavior upon becoming administrators. At the same time, such behavior is not rampant. Those who are promoted to administrator status tend to have more stable behavior than comparable groups of prolific editors. This suggests that the Adminship process works well, and that the Wikipedia community is not overwhelmed by users who become administrators to promote their own points of view.
SATzilla: Portfolio-based Algorithm Selection for SAT
Venue: arXiv cs.AI 2011
Year: 2011

It has been widely observed that there is no single "dominant" SAT solver; instead, different solvers perform best on different instances. Rather than following the traditional approach of choosing the best solver for a given class of instances, we advocate making this decision online on a per-instance basis. Building on previous work, we describe SATzilla, an automated approach for constructing per-instance algorithm portfolios for SAT that use so-called empirical hardness models to choose among their constituent solvers. This approach takes as input a distribution of problem instances and a set of component solvers, and constructs a portfolio optimizing a given objective function (such as mean runtime, percent of instances solved, or score in a competition). The excellent performance of SATzilla was independently verified in the 2007 SAT Competition, where our SATzilla07 solvers won three gold, one silver and one bronze medal. In this article, we go well beyond SATzilla07 by making the portfolio construction scalable and completely automated, and improving it by integrating local search solvers as candidate solvers, by predicting performance score instead of runtime, and by using hierarchical hardness models that take into account different types of SAT instances. We demonstrate the effectiveness of these new techniques in extensive experimental results on data sets including instances from the most recent SAT competition.
Genetic Algorithm (GA) in Feature Selection for CRF Based Manipuri Multiword Expression (MWE) Identification
Venue: arXiv cs.CL 2011
Year: 2011

This paper deals with the identification of Multiword Expressions (MWEs) in Manipuri, a highly agglutinative Indian Language. Manipuri is listed in the Eight Schedule of Indian Constitution. MWE plays an important role in the applications of Natural Language Processing(NLP) like Machine Translation, Part of Speech tagging, Information Retrieval, Question Answering etc. Feature selection is an important factor in the recognition of Manipuri MWEs using Conditional Random Field (CRF). The disadvantage of manual selection and choosing of the appropriate features for running CRF motivates us to think of Genetic Algorithm (GA). Using GA we are able to find the optimal features to run the CRF. We have tried with fifty generations in feature selection along with three fold cross validation as fitness function. This model demonstrated the Recall (R) of 64.08%, Precision (P) of 86.84% and F-measure (F) of 73.74%, showing an improvement over the CRF based Manipuri MWE identification without GA application.
Secured Data Consistency and Storage Way in Untrusted Cloud using Server Management Algorithm
Venue: arXiv cs.DC 2011
Year: 2011

It is very challenging part to keep safely all required data that are needed in many applications for user in cloud. Storing our data in cloud may not be fully trustworthy. Since client doesn't have copy of all stored data, he has to depend on Cloud Service Provider. But dynamic data operations, Read-Solomon and verification token construction methods don't tell us about total storage capacity of server allocated space before and after the data addition in cloud. So we have to introduce a new proposed system of efficient storage measurement and space comparison algorithm with time management for measuring the total allocated storage area before and after the data insertion in cloud. So by using our proposed scheme, the value or weight of stored data before and after is measured by client with specified time in cloud storage area with accuracy. And here we also have proposed the multi-server restore point in server failure condition. If there occurs any server failure, by using this scheme the data can be recovered automatically in cloud server. Our proposed scheme efficiently checks space for the in-outsourced data to maintain integrity. Here the TPA necessarily doesn't have the delegation to audit user's data.
A semantically enriched web usage based recommendation model
Venue: arXiv cs.DB 2011
Year: 2011

With the rapid growth of internet technologies, Web has become a huge repository of information and keeps growing exponentially under no editorial control. However the human capability to read, access and understand Web content remains constant. This motivated researchers to provide Web personalized online services such as Web recommendations to alleviate the information overload problem and provide tailored Web experiences to the Web users. Recent studies show that Web usage mining has emerged as a popular approach in providing Web personalization. However conventional Web usage based recommender systems are limited in their ability to use the domain knowledge of the Web application. The focus is only on Web usage data. As a consequence the quality of the discovered patterns is low. In this paper, we propose a novel framework integrating semantic information in the Web usage mining process. Sequential Pattern Mining technique is applied over the semantic space to discover the frequent sequential patterns. The frequent navigational patterns are extracted in the form of Ontology instances instead of Web page views and the resultant semantic patterns are used for generating Web page recommendations to the user. Experimental results shown are promising and proved that incorporating semantic information into Web usage mining process can provide us with more interesting patterns which consequently make the recommendation system more functional, smarter and comprehensive.
Quantitative Analysis of Information Leakage in Probabilistic and Nondeterministic Systems
Venue: arXiv cs.CR 2011
Year: 2011

This thesis addresses the foundational aspects of formal methods for applications in security and in particular in anonymity. More concretely, we develop frameworks for the specification of anonymity properties and propose algorithms for their verification. Since in practice anonymity protocols always leak some information, we focus on quantitative properties, which capture the amount of information leaked by a protocol. The main contribution of this thesis is cpCTL, the first temporal logic that allows for the specification and verification of conditional probabilities (which are the key ingredient of most anonymity properties). In addition, we have considered several prominent definitions of information-leakage and developed the first algorithms allowing us to compute (and even approximate) the information leakage of anonymity protocols according to these definitions. We have also studied a well-known problem in the specification and analysis of distributed anonymity protocols, namely full-information scheduling. To overcome this problem, we have proposed an alternative notion of scheduling and adjusted accordingly several anonymity properties from the literature. Our last major contribution is a debugging technique that helps on the detection of flaws in security protocols.
A Survey on Web-based AR Applications
Venue: arXiv cs.MM 2011
Year: 2011

Due to the increase of interest in Augmented Reality (AR), the potential uses of AR are increasing also. It can benefit the user in various fields such as education, business, medicine, and other. Augmented Reality supports the real environment with synthetic environment to give more details and meaning to the objects in the real word. AR refers to a situation in which the goal is to supplement a user's perception of the real-world through the addition of virtual objects. This paper is an attempt to make a survey of web-based Augmented Reality applications and make a comparison among them.
Digital Manifolds and the Theorem of Jordan-Brouwer
Venue: arXiv cs.CV 2011
Year: 2011

We give an answer to the question given by T.Y.Kong in his article "Can 3-D Digital Topology be Based on Axiomatically Defined Digital Spaces?" In this article he asks the question, if so called "good pairs" of neighborhood relations can be found on the set Z^n such that the existence of digital manifolds of dimension n-1, that separate their complement in exactly two connected sets, is guaranteed. To achieve this, we use a technique developed by M. Khachan et.al. A set given in Z^n is translated into a simplicial complex that can be used to study the topological properties of the original discrete point-set. In this way, one is able to define the notion of a (n-1)-dimensional digital manifold and prove the digital analog of the Jordan-Brouwer-Theorem.
A Comprehensive Study of Commonly Practiced Heavy and Light Weight Software Methodologies
Venue: arXiv cs.SE 2011
Year: 2011

Software has been playing a key role in the development of modern society. Software industry has an option to choose suitable methodology/process model for its current needs to provide solutions to give problems. Though some companies have their own customized methodology for developing their software but majority agrees that software methodologies fall under two categories that are heavyweight and lightweight. Heavyweight methodologies (Waterfall Model, Spiral Model) are also known as the traditional methodologies, and their focuses are detailed documentation, inclusive planning, and extroverted design. Lightweight methodologies (XP, SCRUM) are, referred as agile methodologies. Light weight methodologies focused mainly on short iterative cycles, and rely on the knowledge within a team. The aim of this paper is to describe the characteristics of popular heavyweight and lightweight methodologies that are widely practiced in software industries. We have discussed the strengths and weakness of the selected models. Further we have discussed the strengths and weakness between the two opponent methodologies and some criteria is also illustrated that help project managers for the selection of suitable model for their projects.
Trees over Infinite Structures and Path Logics with Synchronization
Venue: arXiv cs.LO 2011
Year: 2011

We provide decidability and undecidability results on the model-checking problem for infinite tree structures. These tree structures are built from sequences of elements of infinite relational structures. More precisely, we deal with the tree iteration of a relational structure M in the sense of Shelah-Stupp. In contrast to classical results where model-checking is shown decidable for MSO-logic, we show decidability of the tree model-checking problem for logics that allow only path quantifiers and chain quantifiers (where chains are subsets of paths), as they appear in branching time logics; however, at the same time the tree is enriched by the equal-level relation (which holds between vertices u, v if they are on the same tree level). We separate cleanly the tree logic from the logic used for expressing properties of the underlying structure M. We illustrate the scope of the decidability results by showing that two slight extensions of the framework lead to undecidability. In particular, this applies to the (stronger) tree iteration in the sense of Muchnik-Walukiewicz.