OpenRaiser/Intern-Atlas huggingface dataset:
Translation of Bengali Terms in Mobile Phones: a Simplified Approach Based on the Prescriptions of Conventional Accent Understand Ability
Venue: arXiv cs.HC 2012
Year: 2012

Technology is the making, usage and knowledge of tools, techniques, crafts, systems or methods of organization in order to solve a problem or serve some purpose. This is true for humanitarian issues also. Such as the issue of language and its primitive attraction for its native speakers which is visible in the cases of the language spoken at home, outside home, in its choice of newspapers, and TV channels. Everyone finds to accomplish its need by the same way. Example includes the preference of using mobile phones in English. The satisfactory answer to this tendency may be the lack of finding the translations in native language---Bengali terms used in current mobile phones are hard to understand by users. I have investigated various mobile phone models available in Indian market which have lot of problems in Bengali interpretation. I have sort out the root cause of this problem to be the conventional accent understand ability. Depending on this I have created a set of equivalent terms that I hope to be simpler in use. In this paper I have performed experiments to compare the new terms to the available ones. Our findings show that the newly derived terms do better in term of performance than to current ones. It has also been seen that acceptance of Bengali terms in mobile phones might grow if the parameter of simpler and conventional accent understand ability are met while designing.
Hatch-Sens: a Theoretical Bio-Inspired Model to Monitor the Hatching of Plankton Culture in the Vicinity of Wireless Sensor Network
Venue: arXiv cs.NI 2012
Year: 2012

Plankton research has always been an important area of biology. Due to various environmental issues and other research interests, plankton hatching and harnessing has been extremely red-marked zone for bio-aqua scientists recently. To counter this problem, no wireless sensor assisted technique or mechanism has yet not been devised. In this literature, we propose a novel approach to pursue this task by the virtue of a theoretical Bio-inspired model named Hatch-Sens, to automatically monitor different parameters of plankton hatching in laboratory environment. This literature illustrates the concepts and detailed mechanisms to accumulate this given problem. Hatch-Sens is a novel idea which combines the biology with computer in its sensing network to monitor hatching parameters of Artemia salina. This model reduces the manual tiresome monitoring of hatching of plankton culture by wireless sensor network.
The green grid saga - a green initiative to data centers: a review
Venue: arXiv cs.SY 2012
Year: 2012

Information Technology (IT) significantly impacts the environment throughout its life cycle. Most enterprises have not paid enough attention to this until recently. IT's environmental impact can be significantly reduced by behavioral changes, as well as technology changes. Given the relative energy and materials inefficiency of most IT infrastructures today, many green IT initiatives can be easily tackled at no incremental cost. The Green Grid - a non-profit trade organization of IT professionals is such an initiative, formed to initiate the issues of power and cooling in data centers, scattered world-wide. The Green Grid seeks to define best practices for optimizing the efficient consumption of power at IT equipment and facility levels, as well as the manner in which cooling is delivered at these levels hence, providing promising attitude in bringing down the environmental hazards, as well as proceeding to the new era of green computing. In this paper we review the various analytical aspects of The Green Grid upon the data centers and found green facts.
Enumerating Subgraph Instances Using Map-Reduce
Venue: arXiv cs.DC 2012
Year: 2012

The theme of this paper is how to find all instances of a given "sample" graph in a larger "data graph," using a single round of map-reduce. For the simplest sample graph, the triangle, we improve upon the best known such algorithm. We then examine the general case, considering both the communication cost between mappers and reducers and the total computation cost at the reducers. To minimize communication cost, we exploit the techniques of (Afrati and Ullman, TKDE 2011)for computing multiway joins (evaluating conjunctive queries) in a single map-reduce round. Several methods are shown for translating sample graphs into a union of conjunctive queries with as few queries as possible. We also address the matter of optimizing computation cost. Many serial algorithms are shown to be "convertible," in the sense that it is possible to partition the data graph, explore each partition in a separate reducer, and have the total computation cost at the reducers be of the same order as the computation cost of the serial algorithm.
MLLS: Minimum Length Link Scheduling Under Physical Interference Model
Venue: arXiv cs.NI 2012
Year: 2012

We study a fundamental problem called Minimum Length Link Scheduling (MLLS) which is crucial to the efficient operations of wireless networks. Given a set of communication links of arbitrary length spread and assume each link has one unit of traffic demand in wireless networks, the problem MLLS seeks a schedule for all links (to satisfy all demands) of minimum number of time-slots such that the links assigned to the same time-slot do not conflict with each other under the physical interference model. In this paper, we will explore this problem under three important transmission power control settings: linear power control, uniform power control and arbitrary power control. We design a suite of new and novel scheduling algorithms and conduct explicit complexity analysis to demonstrate their efficiency. Our algorithms can account for the presence of background noises in wireless networks. We also investigate the fractional case of the problem MLLS where each link has a fractional demand. We propose an efficient greedy algorithm of the approximation ratio at most $(K+1)^{2}ω$.
Biff (Bloom Filter) Codes : Fast Error Correction for Large Data Sets
Venue: arXiv cs.DS 2012
Year: 2012

Large data sets are increasingly common in cloud and virtualized environments. For example, transfers of multiple gigabytes are commonplace, as are replicated blocks of such sizes. There is a need for fast error-correction or data reconciliation in such settings even when the expected number of errors is small. Motivated by such cloud reconciliation problems, we consider error-correction schemes designed for large data, after explaining why previous approaches appear unsuitable. We introduce Biff codes, which are based on Bloom filters and are designed for large data. For Biff codes with a message of length $L$ and $E$ errors, the encoding time is $O(L)$, decoding time is $O(L + E)$ and the space overhead is $O(E)$. Biff codes are low-density parity-check codes; they are similar to Tornado codes, but are designed for errors instead of erasures. Further, Biff codes are designed to be very simple, removing any explicit graph structures and based entirely on hash tables. We derive Biff codes by a simple reduction from a set reconciliation algorithm for a recently developed data structure, invertible Bloom lookup tables. While the underlying theory is extremely simple, what makes this code especially attractive is the ease with which it can be implemented and the speed of decoding. We present results from a prototype implementation that decodes messages of 1 million words with thousands of errors in well under a second.
Establishing Virtual R&D Teams: Obliged Policy
Venue: arXiv cs.OH 2012
Year: 2012

In a global and technology oriented world the requirements that products and services have to fulfill are increasing and are getting more complicated. Research and development (R&D) is becoming increasingly important in creating the knowledge that makes research and business more competitive. Companies are obliged to produce more rapidly, more effectively and more efficiently. In order to meet these requirements and to secure the viability of business processes, services and products R&D teams need to access and retrieve information from as many sources as possible. From the other perspective virtual teams are important mechanisms for organizations seeking to leverage scarce resources across geographic and other boundaries moreover; virtual collaboration has become vital for most organizations. This is particularly true in the context of designing new product and service innovation. Such collaboration often involves a network of partners located around the world. However at the R&D project level, dealing with such distributed teams challenges both managers and specialists. In new product development, it is necessary to put together the growing different capabilities and services with the goal, through cooperation between suppliers and customers, service providers and scientific institutions to achieve innovations of high quality. In this paper based on comprehensive literature review of recent articles, at the first step provides an primary definition and characterization of virtual R&D team; next, the potential value created by virtual R&D teams for new product development is explored and lastly along with a guide line for future study, it is argued that the establishing of virtual R&D teams should be given consideration in the management of R&D projects.
DoS and DDoS in Named-Data Networking
Venue: arXiv cs.NI 2012
Year: 2012

With the growing realization that current Internet protocols are reaching the limits of their senescence, a number of on-going research efforts aim to design potential next-generation Internet architectures. Although they vary in maturity and scope, in order to avoid past pitfalls, these efforts seek to treat security and privacy as fundamental requirements. Resilience to Denial-of-Service (DoS) attacks that plague today's Internet is a major issue for any new architecture and deserves full attention. In this paper, we focus on DoS in a specific candidate next-generation Internet architecture called Named-Data Networking (NDN) -- an instantiation of Information-Centric Networking approach. By stressing content dissemination, NDN appears to be attractive and viable approach to many types of current and emerging communication models. It also incorporates some basic security features that mitigate certain attacks. However, NDN's resilience to DoS attacks has not been analyzed to-date. This paper represents the first step towards assessment and possible mitigation of DoS in NDN. After identifying and analyzing several new types of attacks, it investigates their variations, effects and counter-measures. This paper also sheds some light on the long-standing debate about relative virtues of self-certifying, as opposed to human-readable, names.
Uncertainty-dependent data collection in vehicular sensor networks
Venue: arXiv cs.NI 2012
Year: 2012

Vehicular sensor networks (VSNs) are built on top of vehicular ad-hoc networks (VANETs) by equipping vehicles with sensing devices. These new technologies create a huge opportunity to extend the sensing capabilities of the existing road traffic control systems and improve their performance. Efficient utilisation of wireless communication channel is one of the basic issues in the vehicular networks development. This paper presents and evaluates data collection algorithms that use uncertainty estimates to reduce data transmission in a VSN-based road traffic control system.
Seamless Handover for IMS over Mobile-IPv6 Using Context Transfer
Venue: arXiv cs.NI 2012
Year: 2012

Mobility support for the next generation IPv6 networks has been one of the recent research issues due to the growing demand for wireless services over internet. In the other hand, 3GPP has introduced IP Multimedia Subsystem as the next generation IP based infrastructure for wireless and wired multimedia services. In this paper we present two context transfer mechanisms based on predictive and reactive schemes, to support seamless handover in IMS over Mobile IPv6. Those schemes reduce handover latency by transferring appropriate session information between the old and the new access networks. Moreover, we present two methods for QoS parameters negotiations to preserve service quality along the mobile user movement path. The performances of the proposed mechanisms are evaluated by simulations.
Spectra of random graphs with arbitrary expected degrees
Venue: arXiv cs.SI 2012
Year: 2012

We study random graphs with arbitrary distributions of expected degree and derive expressions for the spectra of their adjacency and modularity matrices. We give a complete prescription for calculating the spectra that is exact in the limit of large network size and large vertex degrees. We also study the effect on the spectra of hubs in the network, vertices of unusually high degree, and show that these produce isolated eigenvalues outside the main spectral band, akin to impurity states in condensed matter systems, with accompanying eigenvectors that are strongly localized around the hubs. We also give numerical results that confirm our analytic expressions.
Algorithm for searching bridges of specified types in the protection graph for Take-Grant protection model
Venue: arXiv cs.CR 2012
Year: 2012

The article contains the algorithm for searching a certain kind of bridges in the protection graph of Take-Grant model. The proposed algorithm is based on a classical breadth-first search algorithm.
Guess Who Rated This Movie: Identifying Users Through Subspace Clustering
Venue: arXiv cs.LG 2012
Year: 2012

It is often the case that, within an online recommender system, multiple users share a common account. Can such shared accounts be identified solely on the basis of the user- provided ratings? Once a shared account is identified, can the different users sharing it be identified as well? Whenever such user identification is feasible, it opens the way to possible improvements in personalized recommendations, but also raises privacy concerns. We develop a model for composite accounts based on unions of linear subspaces, and use subspace clustering for carrying out the identification task. We show that a significant fraction of such accounts is identifiable in a reliable manner, and illustrate potential uses for personalized recommendation.
Recording Completion for Finding and Certifying Proofs in Equational Logic
Venue: arXiv cs.LO 2012
Year: 2012

When we want to answer/certify whether a given equation is entailed by an equational system we face the following problems: (1) It is hard to find a conversion (but easy to certify a given one). (2) Under the assumption that Knuth-Bendix completion is successful, it is easy to decide the existence of a conversion but hard to certify this decision. In this paper we introduce recording completion, which overcomes both problems.
Towards the Certification of Complexity Proofs
Venue: arXiv cs.LO 2012
Year: 2012

We report on our formalization of matrix-interpretation in Isabelle/HOL. Matrices are required to certify termination proofs and we wish to utilize them for complexity proofs, too. For the latter aim, only basic methods have already been integrated, and we discuss some upcoming problems which arise when formalizing more complicated results on matrix-interpretations, which are based on Cayley-Hamilton's theorem or joint-spectral radius theory.
On the Relation between Centrality Measures and Consensus Algorithms
Venue: arXiv cs.SY 2012
Year: 2012

This paper introduces some tools from graph theory and distributed consensus algorithms to construct an optimal, yet robust, hierarchical information sharing structure for large-scale decision making and control problems. The proposed method is motivated by the robustness and optimality of leaf-venation patterns. We introduce a new class of centrality measures which are built based on the degree distribution of nodes within network graph. Furthermore, the proposed measure is used to select the appropriate weight of the corresponding consensus algorithm. To this end, an implicit hierarchical structure is derived that control the flow of information in different situations. In addition, the performance analysis of the proposed measure with respect to other standard measures is performed to investigate the convergence and asymptotic behavior of the measure. Gas Transmission Network is served as our test-bed to demonstrate the applicability and the efficiently of the method.
Transformations of normal form games by preplay offers for payments among players
Venue: arXiv cs.GT 2012
Year: 2012

We consider transformations of normal form games by binding preplay offers of players for payments of utility to other players conditional on them playing designated in the offers strategies. The game-theoretic effect of such preplay offers is transformation of the payoff matrix of the game by transferring payoffs between players. Here we analyze and completely characterize the possible transformations of the payoff matrix of a normal form game by sets of preplay offers.
Worst-Case Source for Distributed Compression with Quadratic Distortion
Venue: arXiv cs.IT 2012
Year: 2012

We consider the k-encoder source coding problem with a quadratic distortion measure. We show that among all source distributions with a given covariance matrix K, the jointly Gaussian source requires the highest rates in order to meet a given set of distortion constraints.
Self-Organizing Time Map: An Abstraction of Temporal Multivariate Patterns
Venue: arXiv cs.LG 2012
Year: 2012

This paper adopts and adapts Kohonen's standard Self-Organizing Map (SOM) for exploratory temporal structure analysis. The Self-Organizing Time Map (SOTM) implements SOM-type learning to one-dimensional arrays for individual time units, preserves the orientation with short-term memory and arranges the arrays in an ascending order of time. The two-dimensional representation of the SOTM attempts thus twofold topology preservation, where the horizontal direction preserves time topology and the vertical direction data topology. This enables discovering the occurrence and exploring the properties of temporal structural changes in data. For representing qualities and properties of SOTMs, we adapt measures and visualizations from the standard SOM paradigm, as well as introduce a measure of temporal structural changes. The functioning of the SOTM, and its visualizations and quality and property measures, are illustrated on artificial toy data. The usefulness of the SOTM in a real-world setting is shown on poverty, welfare and development indicators.
Message Embedded cipher using 2-D chaotic map
Venue: arXiv cs.CR 2012
Year: 2012

This paper constructs two encryption methods using 2-D chaotic maps, Duffings and Arnold's cat maps respectively. Both of the methods are designed using message embedded scheme and are analyzed for their validity, for plaintext sensitivity, key sensitivity, known plaintext and brute-force attacks. Due to the less key space generally many chaotic cryptosystem developed are found to be weak against Brute force attack which is an essential issue to be solved. For this issue, concept of identifiability proved to be a necessary condition to be fulfilled by the designed chaotic cipher to resist brute force attack, which is a basic attack. As 2-D chaotic maps provide more key space than 1-D maps thus they are considered to be more suitable. This work is accompanied with analysis results obtained from these developed cipher. Moreover, identifiable keys are searched for different input texts at various key values. The methods are found to have good key sensitivity and possess identifiable keys thus concluding that they can resist linear attacks and brute-force attacks.
Role of Ranking Algorithms for Information Retrieval
Venue: arXiv cs.IR 2012
Year: 2012

As the use of web is increasing more day by day, the web users get easily lost in the web's rich hyper structure. The main aim of the owner of the website is to give the relevant information according their needs to the users. We explained the Web mining is used to categorize users and pages by analyzing user's behavior, the content of pages and then describe Web Structure mining. This paper includes different Page Ranking algorithms and compares those algorithms used for Information Retrieval. Different Page Rank based algorithms like Page Rank (PR), WPR (Weighted Page Rank), HITS (Hyperlink Induced Topic Selection), Distance Rank and EigenRumor algorithms are discussed and compared. Simulation Interface has been designed for PageRank algorithm and Weighted PageRank algorithm but PageRank is the only ranking algorithm on which Google search engine works.
Experiments with Game Tree Search in Real-Time Strategy Games
Venue: arXiv cs.AI 2012
Year: 2012

Game tree search algorithms such as minimax have been used with enormous success in turn-based adversarial games such as Chess or Checkers. However, such algorithms cannot be directly applied to real-time strategy (RTS) games because a number of reasons. For example, minimax assumes a turn-taking game mechanics, not present in RTS games. In this paper we present RTMM, a real-time variant of the standard minimax algorithm, and discuss its applicability in the context of RTS games. We discuss its strengths and weaknesses, and evaluate it in two real-time games.
MIDI-LAB, a Powerful Visual Basic Program for Creating MIDI Music
Venue: arXiv cs.SE 2012
Year: 2012

Creating MIDI music can be a practical challenge. In the past, working with it was difficult and frustrating to all but the most accomplished and determined. Now, however, we are offering a powerful Visual Basic program called MIDI-LAB, that is easy to learn, and instantly rewarding to even the newest users. MIDI-LAB has been developed to give users the ability to quickly create music with a limitless variety of tunes, tempos, speeds, volumes, instruments, rhythms and major scales. This program has a simple, intuitive, and user-friendly interface, which provides a straightforward way to enter musical data with Numbered Musical Notation (NMN) and immediately create MIDI music. The key feature of this program is the digitalization of music input. It vastly simplifies creating, editing, and saving MIDI music. MIDI-LAB can be used virtually anywhere to write music for entertainment, teaching, computer games, and mobile phone ringtones.
An Internet Approach for Engineering Student Exercises
Venue: arXiv cs.CY 2012
Year: 2012

An approach for engineering student exercises using the Internet is described. In this approach, for a given exercise, each student receives the same problem, but with different data. The exercise content can be static or dynamic, and the dynamic form can be timeless or real-time. The implementation provides immediate feedback to the students, letting them know if their submitted answers are correct. Student results for each exercise are recorded in log files which are available to the instructor. Example exercises from engineering computer security and cryptography courses are presented.