OpenRaiser/Intern-Atlas huggingface dataset:
Strange Beta: An Assistance System for Indoor Rock Climbing Route Setting Using Chaotic Variations and Machine Learning
Venue: arXiv cs.AI 2011
Year: 2011

This paper applies machine learning and the mathematics of chaos to the task of designing indoor rock-climbing routes. Chaotic variation has been used to great advantage on music and dance, but the challenges here are quite different, beginning with the representation. We present a formalized system for transcribing rock climbing problems, then describe a variation generator that is designed to support human route-setters in designing new and interesting climbing problems. This variation generator, termed Strange Beta, combines chaos and machine learning, using the former to introduce novelty and the latter to smooth transitions in a manner that is consistent with the style of the climbs This entails parsing the domain-specific natural language that rock climbers use to describe routes and movement and then learning the patterns in the results. We validated this approach with a pilot study in a small university rock climbing gym, followed by a large blinded study in a commercial climbing gym, in cooperation with experienced climbers and expert route setters. The results show that {\sc Strange Beta} can help a human setter produce routes that are at least as good as, and in some cases better than, those produced in the traditional manner.
Open Input: A New Way for Websites to Grow
Venue: arXiv cs.HC 2011
Year: 2011

Regardless of current web 2.0 and 3.0 trends, there are still a lot of websites made in web 1.0 style. These websites have fixed pages which are editable only by owner and not by community. It is normal for a lot of cases, but looks like not modern and engaging approach. Are there any ways to make these sites closer to life? This paper is devoted to open input technique, a way for websites of web 1.0 era to grow and evolve community. The idea of open input, in general, means that anybody from the web can add information to any section of the website even without registration on that website. People can add news, billboard announcements, testimonials, questions, pictures, videos etc - whatever site owner permitted. We have tested this idea in practice and have positive results approving that open input is a vital approach for collaboration on the web.
Algorithms for the strong chromatic index of Halin graphs, distance-hereditary graphs and maximal outerplanar graphs
Venue: arXiv cs.DS 2011
Year: 2011

We show that there exist linear-time algorithms that compute the strong chromatic index of Halin graphs, of maximal outerplanar graphs and of distance-hereditary graphs.
Autonomous Agents Coordination: Action Languages meet CLP(FD) and Linda
Venue: arXiv cs.LO 2011
Year: 2011

The paper presents a knowledge representation formalism, in the form of a high-level Action Description Language for multi-agent systems, where autonomous agents reason and act in a shared environment. Agents are autonomously pursuing individual goals, but are capable of interacting through a shared knowledge repository. In their interactions through shared portions of the world, the agents deal with problems of synchronization and concurrency; the action language allows the description of strategies to ensure a consistent global execution of the agents' autonomously derived plans. A distributed planning problem is formalized by providing the declarative specifications of the portion of the problem pertaining a single agent. Each of these specifications is executable by a stand-alone CLP-based planner. The coordination among agents exploits a Linda infrastructure. The proposal is validated in a prototype implementation developed in SICStus Prolog. To appear in Theory and Practice of Logic Programming (TPLP).
Compress-Forward without Wyner-Ziv Binning for the One-Way and Two-Way Relay Channels
Venue: arXiv cs.IT 2011
Year: 2011

We consider the role of Wyner-Ziv binning in compress-forward for relay channels. In the one-way relay channel, we analyze a compress-forward scheme without Wyner- Ziv binning but with joint decoding of both the message and compression index. It achieves the same rate as the original compress-forward scheme with binning and successive decoding. Therefore, binning helps reduce decoding complexity by allowing successive decoding, but has no impact on achievable rate for the one-way relay channel. On the other hand, no binning simplifies relay operation. By extending compress-forward without binning to the two-way relay channel, we can achieve a larger rate region than the original compress-forward scheme when the channel is asymmetric for the two users. Binning and successive decoding limits the compression rate to match the weaker of the channels from relay to two users, whereas without binning, this restriction no longer applies. Compared with noisy network coding, compress-forward without binning achieves the same rate region in certain Gaussian channel configurations, and it has much less delay. This work is a step toward understanding the role of Wyner-Ziv binning in compress-forward relaying.
Rapid, Impartial and Comprehensive (RIC) publishing: A new concept for scientific journals
Venue: arXiv cs.DL 2011
Year: 2011

Publishing scientific journals governed by editors relying on anonymous peer reviewing is slow (even one round of reviewing involves several communications between authors, editor and reviewers), partial (arguments of authors can hardly overrule those of reviewers) and not using all available scientific material (even the most thorough and insightful reviews remain for the eyes of authors and editors only). Here I propose a new concept for scientific journals that ensures rapid, impartial and comprehensive (RIC) publishing. RIC concept is based on implementation of two novel publishing principles: the first (rapid) editorial screening of a submitted manuscript should result in its either "rejection" or "acceptance with optional revisions", and, in the latter case, the optionally revised (taking into account open reviews) paper should be published along with all (positive and negative) reviews, presenting thereby to the scientific community all available scientific material on the topic in question.
A Novel Elliptic curve cryptography Processor using NoC design
Venue: arXiv cs.CR 2011
Year: 2011

In this paper, we propose an elliptic curve key generation processor over GF(2m) and GF(P) with Network-on-Chip (NoC) design scheme based on binary scalar multiplication algorithm. Over the Two last decades, Elliptic Curve Cryptography (ECC) has gained increasing acceptance in the industry and the academic community. This interest is mainly caused by the same level of security with relatively small keys provided by ECC comparing to large key size in Rivest Shamir Adleman (RSA). Parallelism can be utilized in different hierarchy levels as shown in many publications. By using NoC, a new method with the reduced latency of point multiplication (with parallel field arithmetic) is introduced in this paper.
Rotation, Scaling and Translation Analysis of Biometric Signature Templates
Venue: arXiv cs.CV 2011
Year: 2011

Biometric authentication systems that make use of signature verification methods often render optimum performance only under limited and restricted conditions. Such methods utilize several training samples so as to achieve high accuracy. Moreover, several constraints are imposed on the end-user so that the system may work optimally, and as expected. For example, the user is made to sign within a small box, in order to limit their signature to a predefined set of dimensions, thus eliminating scaling. Moreover, the angular rotation with respect to the referenced signature that will be inadvertently introduced as human error, hampers performance of biometric signature verification systems. To eliminate this, traditionally, a user is asked to sign exactly on top of a reference line. In this paper, we propose a robust system that optimizes the signature obtained from the user for a large range of variation in Rotation-Scaling-Translation (RST) and resolves these error parameters in the user signature according to the reference signature stored in the database.
Predicting User Actions in Software Processes
Venue: arXiv cs.SE 2011
Year: 2011

This paper describes an approach for user (e.g. SW architect) assisting in software processes. The approach observes the user's action and tries to predict his next step. For this we use approaches in the area of machine learning (sequence learning) and adopt these for the use in software processes. Keywords: Software engineering, Software process description languages, Software processes, Machine learning, Sequence prediction
A Novel Approach for Pass Word Authentication using Brain -State -In -A Box (BSB) Model
Venue: arXiv cs.CR 2011
Year: 2011

Authentication is the act of confirming the truth of an attribute of a datum or entity. This might involve confirming the identity of a person, tracing the origins of an artefact, ensuring that a product is what it's packaging and labelling claims to be, or assuring that a computer program is a trusted one. The authentication of information can pose special problems (especially man-in-the-middle attacks), and is often wrapped up with authenticating identity. Password authentication using Brain-State -In-A Box is presented in this paper. Here in this paper we discuss Brain-State -In-A Box Scheme for Textual and graphical passwords which will be converted in to probabilistic values Password. We observe how to get password authentication Probabilistic values for Text and Graphical image. This study proposes the use of a Brain-State -In-A Box technique for password authentication. In comparison to existing layered neural network techniques, the proposed method provides better accuracy and quicker response time to registration and password changes.
Netrawalm: Network Based Resource Aware Application Layer Multicast for Multiparty Video Conference
Venue: arXiv cs.NI 2011
Year: 2011

IP Multicast is one of the most absolute method for large bandwidth Internet applications such as video conference, IPTV, E-Learning and Telemedicine etc., But due to security and management reason IP Multicast is not enabled in Internet backbone routers. To achieve these challenges, lot of Application Layer Multicast (ALM) has been proposed. All the existing protocols such as NICE, ZIGZAG and OMNI are trying to reduce average delay by forming a Multicast tree. But still that problem has not been addressed fully. We are proposing a new protocol called NetRawALM, which will address the average delay, Reliability between nodes, Scalability of conference, Heterogeneity and resilient data distribution for real time multimedia applications by constructing the Network based Resource aware Multicast tree algorithm. This is very dynamic and decentralised. The proposed architecture is a LAN aware; it is used to reduce Internet Traffic.
Blackwell Approachability and Minimax Theory
Venue: arXiv cs.GT 2011
Year: 2011

This manuscript investigates the relationship between Blackwell Approachability, a stochastic vector-valued repeated game, and minimax theory, a single-play scalar-valued scenario. First, it is established in a general setting --- one not permitting invocation of minimax theory --- that Blackwell's Approachability Theorem and its generalization due to Hou are still valid. Second, minimax structure grants a result in the spirit of Blackwell's weak-approachability conjecture, later resolved by Vieille, that any set is either approachable by one player, or avoidable by the opponent. This analysis also reveals a strategy for the opponent.
On the Coloring of Grid Wireless Sensor Networks: the Vector-Based Coloring Method
Venue: arXiv cs.NI 2011
Year: 2011

Graph coloring is used in wireless networks to optimize network resources: bandwidth and energy. Nodes access the medium according to their color. It is the responsibility of the coloring algorithm to ensure that interfering nodes do not have the same color. In this research report, we focus on wireless sensor networks with grid topologies. How does a coloring algorithm take advantage of the regularity of grid topology to provide an optimal periodic coloring, that is a coloring with the minimum number of colors? We propose the Vector-Based Coloring Method, denoted VCM, a new method that is able to provide an optimal periodic coloring for any radio transmission range and for any h-hop coloring, h>=1. This method consists in determining at which grid nodes a color can be reproduced without creating interferences between these nodes while minimizing the number of colors used. We compare the number of colors provided by VCM with the number of colors obtained by a distributed coloring algorithm with line and column priority assignments. We also provide bounds on the number of colors of optimal general colorings of the infinite grid, and show that periodic colorings (and thus VCM) are asymptotically optimal. Finally, we discuss the applicability of this method to a real wireless network.
Error Detection and Correction for Distributed Group Key Agreement Protocol
Venue: arXiv cs.CR 2011
Year: 2011

Integrating an efficient Error detection and correction scheme with less encoding and decoding complexity to support the distribution of keying material in a secure group communication is an important issue, since the amount of information carried out in the wireless channel is high which produces more errors due to noise available in the communication channel. Moreover, the key must be sent securely to the group members. In this paper, we propose a new efficient group key computation protocol that provides more security and also integrates an encoding method in sender side and decoding method in the receiver side. To achieve security in key computation process, we propose Euler's totient function based Diffie-hellman key distribution protocol. To provide efficient error detection and correction method while distributing the Keying and re-keying information, we introduce tanner graph based encoding stopping set construction algorithm in sender and receiver side of the group communication. Two major operations in this scheme are joining and leaving operations for managing group memberships. The encoding and decoding complexity of this approach is computed in this paper and it is proved that this proposed approach takes less decoding time complexity.
Scalable Grid Resource Discovery through Distributed Search
Venue: arXiv cs.DC 2011
Year: 2011

This paper proposes a simple and scalable web-based model for grid resource discovery for the Internet. The resource discovery model contains the metadata and resource finder web services. The information of resource finder web services is kept in the repositories that are distributed in the application layer of Internet. The resource finder web services will be discovered by sending queries to the repositories in a similar way as the DNS protocol. The underlying technology for implementation of the two architectures of this model is introduced. These architectures are: Direct and Centralized Web-Based Grid Resource Discovery. The resource discovery time is computed after simulating each of these models in GridSim. By performing scalability tests, we found that when increasing the load on the grid with more users and resources, the cost of our model in comparison to the grid resource discovery time is marginal.
On the strong chromatic index and maximum induced matching of tree-cographs and permutation graphs
Venue: arXiv cs.DS 2011
Year: 2011

We show that there exist linear-time algorithms that compute the strong chromatic index and a maximum induced matching of tree-cographs when the decomposition tree is a part of the input. We also show that there exists an efficient algorithm for the strong chromatic index of permutation graphs.
Enhanced Secure Algorithm for Message Communion
Venue: arXiv cs.CR 2011
Year: 2011

This paper puts forward a safe mechanism of data transmission to tackle the security problem of information which is transmitted in Internet. The encryption standards such as DES (Data Encryption Standard), AES (Advanced Encryption Standard) and EES (Escrowed Encryption Standard) are widely used to solve the problem of communication over an insecure channel. With advanced technologies in computer hardware and software, these standards seem not to be as secure and fast as one would like. In this paper we propose a encryption technique which provides security to both the message and the secret key achieving confidentiality and authentication. The Symmetric algorithm used has two advantages over traditional schemes. First, the encryption and decryption procedures are much simpler, and consequently, much faster. Second, the security level is higher due to the inherent poly-alphabetic nature of the substitution mapping method used here, together with the translation and transposition operations performed in the algorithm. Asymmetric algorithm RSA is worldwide known for its high security. In this paper a detailed report of the process is presented and analysis is done comparing our proposed technique with familiar techniques
Advancing Nuclear Physics Through TOPS Solvers and Tools
Venue: arXiv cs.CE 2011
Year: 2011

At the heart of many scientific applications is the solution of algebraic systems, such as linear systems of equations, eigenvalue problems, and optimization problems, to name a few. TOPS, which stands for Towards Optimal Petascale Simulations, is a SciDAC applied math center focused on the development of solvers for tackling these algebraic systems, as well as the deployment of such technologies in large-scale scientific applications of interest to the U.S. Department of Energy. In this paper, we highlight some of the solver technologies we have developed in optimization and matrix computations. We also describe some accomplishments achieved using these technologies in UNEDF, a SciDAC application project on nuclear physics.
CNoA: Challenging Number Approach for uncovering TCP SYN flooding using SYN spoofing attack
Venue: arXiv cs.CR 2011
Year: 2011

The challenging number is used for the detection of Spoofing attack. The IP Spoofing is considered to be one of the potentially brutal attack which acts as a tool for the DDoS attack which is considered to be a major threat among security problems in today's internet. These kinds of attack are extremely severe. They bring down business of company drastically. DDoS attack can easily exhaust the computing and communication resources of its victim within a short period of time. There are attacks exploiting some vulnerability or implementation bug in the software implementation of a service to bring that down and some attacks will use all the available resources at the target machine. This deals on attacks that consume all the bandwidth available to the victim machine. While concentrating on the bandwidth attack the TCP SYN flood is the more prominent attack. TCP/IP protocol suite is the most widely used protocol suite for data communication. The TCP SYN flood works by exhausting the TCP connection queue of the host and thus denying legitimate connection request. There are various methods used to detect and prevent this attack, one of which is to block the packet based on SYN flag count from the same IP address. This kind of prevention methods becomes unsuitable when the attackers use the Spoofed IP address. The SYN spoofing becomes a major tool the TCP SYN flooding. For the prevention of this kind of attacks, the TCP specific probing is used in the proposed scheme where the client is requested challenging number while sending the ACK in the three way hand shake. This is very useful to find the Spoofed IP Packets/TCP SYN flood and preventing them.
Side-payment profitability and interacting eyeball ISPs under convex demand-response modeling congestion-sensitive applications
Venue: arXiv cs.NI 2011
Year: 2011

This paper is concerned with the issue of side payments between content providers (CPs) and Internet service (access bandwidth) providers (ISPs) in an Internet that is potentially not neutral. We herein generalize past results modeling the ISP and CP interaction as a noncooperative game in two directions. We consider different demand response models (price sensitivities) for different provider types in order to explore when side payments are profitable to the ISP. Also, we consider convex (non-linear) demand response to model demand triggered by traffic which is sensitive to access bandwidth congestion, particularly delay-sensitive interactive real-time applications. Finally, we consider a model with two competing "eyeball" ISPs with transit pricing of net traffic at their peering point to study the effects of caching remote content.
A Study of Unsupervised Adaptive Crowdsourcing
Venue: arXiv cs.LG 2011
Year: 2011

We consider unsupervised crowdsourcing performance based on the model wherein the responses of end-users are essentially rated according to how their responses correlate with the majority of other responses to the same subtasks/questions. In one setting, we consider an independent sequence of identically distributed crowdsourcing assignments (meta-tasks), while in the other we consider a single assignment with a large number of component subtasks. Both problems yield intuitive results in which the overall reliability of the crowd is a factor.
Oblivious Storage with Low I/O Overhead
Venue: arXiv cs.CR 2011
Year: 2011

We study oblivious storage (OS), a natural way to model privacy-preserving data outsourcing where a client, Alice, stores sensitive data at an honest-but-curious server, Bob. We show that Alice can hide both the content of her data and the pattern in which she accesses her data, with high probability, using a method that achieves O(1) amortized rounds of communication between her and Bob for each data access. We assume that Alice and Bob exchange small messages, of size $O(N^{1/c})$, for some constant $c\ge2$, in a single round, where $N$ is the size of the data set that Alice is storing with Bob. We also assume that Alice has a private memory of size $2N^{1/c}$. These assumptions model real-world cloud storage scenarios, where trade-offs occur between latency, bandwidth, and the size of the client's private memory.
Prevention of Wormhole Attack in Wireless Sensor Network
Venue: arXiv cs.CR 2011
Year: 2011

Ubiquitous and pervasive applications, where the Wireless Sensor Networks are typically deployed, lead to the susceptibility to many kinds of security attacks. Sensors used for real time response capability also make it difficult to devise the resource intensive security protocols because of their limited battery, power, memory and processing capabilities. One of potent form of Denial of Service attacks is Wormhole attack that affects on the network layer. In this paper, the techniques dealing with wormhole attack are investigated and an approach for wormhole prevention is proposed. Our approach is based on the analysis of the two-hop neighbors forwarding Route Reply packet. To check the validity of the sender, a unique key between the individual sensor node and the base station is required to be generated by suitable scheme.
Large-Margin Learning of Submodular Summarization Methods
Venue: arXiv cs.AI 2011
Year: 2011

In this paper, we present a supervised learning approach to training submodular scoring functions for extractive multi-document summarization. By taking a structured predicition approach, we provide a large-margin method that directly optimizes a convex relaxation of the desired performance measure. The learning method applies to all submodular summarization methods, and we demonstrate its effectiveness for both pairwise as well as coverage-based scoring functions on multiple datasets. Compared to state-of-the-art functions that were tuned manually, our method significantly improves performance and enables high-fidelity models with numbers of parameters well beyond what could reasonbly be tuned by hand.