OpenRaiser/Intern-Atlas huggingface dataset:
Network Selection Decision Based on Handover History in Heterogeneous Wireless Networks
Venue: arXiv cs.NI 2012
Year: 2012

In recent years, the mobile devices are equipped with several wireless interfaces in heterogeneous environments which integrate a multitude of radio access technologies (RAT's). The evolution of these technologies will allow the users to benefit simultaneously from these RAT's. However, the most important issue is how to choose the most suitable access network for mobile's user which can be used as long as possible for communication. To achieve this issue, this paper proposes a new approach for network selection decision based on Saaty's Fuzzy Analytical Hierarchy Process (FAHP) and the Technique for Order Preference by Similarity to an Ideal Solution (TOPSIS). The FAHP method is used to determine a weight for each criterion, and the TOPSIS method is applied to rank the alternatives. Simulation results are presented to illustrate the effectiveness of our new approach for network selection.
DWDM/OOC and large spectrum sources performance in broadband access network
Venue: arXiv cs.NI 2012
Year: 2012

This work presents a performance evaluation based on elaborated analytical expressions of error probability for broadband access network in the case of a combined technique of dense wavelength division multiplexing (DWDM) and one dimensional optical orthogonal codes (1D-OOC). Optical sources with relatively large spectrum has been considered and simulated. Besides the Multiple Access Interference (MAI) at the receiver due to the access method which is optical code division multiple access (OCDMA), the emitted radiation of these sources in a dense WDM communication link introduces additional interference. Conventional correlation receiver (CCR) and parallel interference cancellation (PIC) receiver limitations are discussed. This paper has investigated the kind of optical sources with large spectrum bandwidth which could be accepted for a targeted bit error rate (BER) and given number of users in broadband access network supporting DWDM with optical orthogonal codes.
An Approach In Optimization Of AD-Hoc Routing Algorithms
Venue: arXiv cs.NI 2012
Year: 2012

In this paper different optimization of Ad-hoc routing algorithm is surveyed and a new method using training based optimization algorithm for reducing the complexity of routing algorithms is suggested. A binary matrix is assigned to each node in the network and gets updated after each data transfer using the protocols. The use of optimization algorithm in routing algorithm can reduce the complexity of routing to the least amount possible.
Softening Fuzzy Knowledge Representation Tool with the Learning of New Words in Natural Language
Venue: arXiv cs.AI 2012
Year: 2012

The approach described here allows using membership function to represent imprecise and uncertain knowledge by learning in Fuzzy Semantic Networks. This representation has a great practical interest due to the possibility to realize on the one hand, the construction of this membership function from a simple value expressing the degree of interpretation of an Object or a Goal as compared to an other and on the other hand, the adjustment of the membership function during the apprenticeship. We show, how to use these membership functions to represent the interpretation of an Object (respectively of a Goal) user as compared to an system Object (respectively to a Goal). We also show the possibility to make decision for each representation of an user Object compared to a system Object. This decision is taken by determining decision coefficient calculates according to the nucleus of the membership function of the user Object.
A novel approach for security issues in VoIP networks in Virtualization with IVR
Venue: arXiv cs.NI 2012
Year: 2012

VoIP (Voice over Internet Protocol) is a growing technology during last decade. It provides the audio, video streaming facility on successful implementation in the network. However, it provides the text transport facility over the network. Due to implementation of it the cost effective solution, it can be developed for the intercommunication among the employees of a prestigious organization. The proposed idea has been implemented on the audio streaming area of the VoIP technology. In the audio streaming, the security vulnerabilities are possible on the VoIP server during communication between two parties. In the proposed model, first the VoIP system has been implemented with IVR (Interactive Voice Response) as a case study and with the implementation of the security parameters provided to the asterisk server which works as a VoIP service provider. The asterisk server has been configured with different security parameters like VPN server, Firewall iptable rules, Intrusion Detection and Intrusion Prevention System. Every parameter will be monitored by the system administrator of the VoIP server along with the MySQL database. The system admin will get every update related to the attacks on the server through Mail server attached to the asterisk server. The main beauty of the proposed system is VoIP server alone is configured as a VoIP server, IVR provider, Mail Server with IDS and IPS, VPN server, connection with database server in a single asterisk server inside virtualization environment. The VoIP system is implemented for a Local Area Network inside the university system
CyberChair: A Web-Based Groupware Application to Facilitate the Paper Reviewing Process
Venue: arXiv cs.DL 2012
Year: 2012

In this paper we describe CyberChair, a web-based groupware application that supports the review process for technical contributions to conferences. CyberChair deals with most administrative tasks that are involved in the review process, such as storing author information, abstracts, (camera-ready) papers and reviews. It generates several overviews based on the reviews which support the Program Committee (PC) in selecting the best papers. CyberChair points out conflicting reviews and offers the reviewers means to easily communicate to solve these conflicts. In his paper Identify the Champion, O. Nierstrasz describes this review process in terms of a pattern language. CyberChair supports PCs by using these patterns in its implementation.
Implementation of EasyTime Formal Semantics using a LISA Compiler Generator
Venue: arXiv cs.PL 2012
Year: 2012

A manual measuring time tool in mass sporting competitions would not be imaginable nowadays, because many modern disciplines, such as IRONMAN, last a long-time and, therefore, demand additional reliability. Moreover, automatic timing-devices based on RFID technology, have become cheaper. However, these devices cannot operate as stand-alone because they need a computer measuring system that is capable of processing incoming events, encoding the results, assigning them to the correct competitor, sorting the results according to the achieved times, and then providing a printout of the results. This article presents the domain-specific language EasyTime, which enables the controlling of an agent by writing the events within a database. It focuses, in particular, on the implementation of EasyTime with a LISA tool that enables the automatic construction of compilers from language specifications, using Attribute Grammars.
Visibility-Monotonic Polygon Deflation
Venue: arXiv cs.CG 2012
Year: 2012

A deflated polygon is a polygon with no visibility crossings. We answer a question posed by Devadoss et al. (2012) by presenting a polygon that cannot be deformed via continuous visibility-decreasing motion into a deflated polygon. We show that the least n for which there exists such an n-gon is seven. In order to demonstrate non-deflatability, we use a new combinatorial structure for polygons, the directed dual, which encodes the visibility properties of deflated polygons. We also show that any two deflated polygons with the same directed dual can be deformed, one into the other, through a visibility-preserving deformation.
Energy-Aware Scheduling using Dynamic Voltage-Frequency Scaling
Venue: arXiv cs.DC 2012
Year: 2012

The energy consumption issue in distributed computing systems has become quite critical due to environmental concerns. In response to this, many energy-aware scheduling algorithms have been developed primarily by using the dynamic voltage-frequency scaling (DVFS) capability incorporated in recent commodity processors. The majority of these algorithms involve two passes: schedule generation and slack reclamation. The latter is typically achieved by lowering processor frequency for tasks with slacks. In this article, we study the latest papers in this area and develop them. This study has been evaluated based on results obtained from experiments with 1,500 randomly generated task graphs.
Comments on "On Approximating Euclidean Metrics by Weighted t-Cost Distances in Arbitrary Dimension"
Venue: arXiv cs.NA 2012
Year: 2012

Mukherjee (Pattern Recognition Letters, vol. 32, pp. 824-831, 2011) recently introduced a class of distance functions called weighted t-cost distances that generalize m-neighbor, octagonal, and t-cost distances. He proved that weighted t-cost distances form a family of metrics and derived an approximation for the Euclidean norm in $\mathbb{Z}^n$. In this note we compare this approximation to two previously proposed Euclidean norm approximations and demonstrate that the empirical average errors given by Mukherjee are significantly optimistic in $\mathbb{R}^n$. We also propose a simple normalization scheme that improves the accuracy of his approximation substantially with respect to both average and maximum relative errors.
RepTFD: Replay Based Transient Fault Detection
Venue: arXiv cs.AR 2012
Year: 2012

The advances in IC process make future chip multiprocessors (CMPs) more and more vulnerable to transient faults. To detect transient faults, previous core-level schemes provide redundancy for each core separately. As a result, they may leave transient faults in the uncore parts, which consume over 50% area of a modern CMP, escaped from detection. This paper proposes RepTFD, the first core-level transient fault detection scheme with 100% coverage. Instead of providing redundancy for each core separately, RepTFD provides redundancy for a group of cores as a whole. To be specific, it replays the execution of the checked group of cores on a redundant group of cores. Through comparing the execution results between the two groups of cores, all malignant transient faults can be caught. Moreover, RepTFD adopts a novel pending period based record-replay approach, which can greatly reduce the number of execution orders that need to be enforced in the replay-run. Hence, RepTFD brings only 4.76% performance overhead in comparison to the normal execution without fault-tolerance according to our experiments on the RTL design of an industrial CMP named Godson-3. In addition, RepTFD only consumes about 0.83% area of Godson-3, while needing only trivial modifications to existing components of Godson-3.
Representations of Genetic Tables, Bimagic Squares, Hamming Distances and Shannon Entropy
Venue: arXiv cs.IT 2012
Year: 2012

In this paper we have established relations of the genetic tables with magic and bimagic squares. Connections with Hamming distances, binomial coefficients are established. The idea of Gray code is applied. Shannon entropy of magic squares of order 4x4, 8x8 and 16x16 are also calculated. Some comparison is also made. Symmetry among restriction enzymes having four letters is also studied.
Irregular Product Codes
Venue: arXiv cs.IT 2012
Year: 2012

We consider irregular product codes.In this class of codes, each codeword is represented by a matrix. The entries in each row (column) of the matrix should come from a component row (column) code. As opposed to (standard) product codes, we do not require that all component row codes nor all component column codes be the same. As we will see, relaxing this requirement can provide some additional attractive features including 1) allowing some regions of the codeword be more error-resilient 2) allowing a more refined spectrum of rates for finite-lengths and improved performance in some of these rates 3) more interaction between row and column codes during decoding. We study these codes over erasure channels. We find that for any $0 < ε< 1$, for many rate distributions on component row codes, there is a matching rate distribution on component column codes such that an irregular product code based on MDS codes with those rate distributions on the component codes has asymptotic rate $1 - ε$ and can decode on erasure channels (of alphabet size equal the alphabet size of the component MDS codes) with erasure probability $< ε$.
Architecture for Automated Tagging and Clustering of Song Files According to Mood
Venue: arXiv cs.IR 2012
Year: 2012

Music is one of the basic human needs for recreation and entertainment. As song files are digitalized now a days, and digital libraries are expanding continuously, which makes it difficult to recall a song. Thus need of a new classification system other than genre is very obvious and mood based classification system serves the purpose very well. In this paper we will present a well-defined architecture to classify songs into different mood-based categories, using audio content analysis, affective value of song lyrics to map a song onto a psychological-based emotion space and information from online sources. In audio content analysis we will use music features such as intensity, timbre and rhythm including their subfeatures to map music in a 2-Dimensional emotional space. In lyric based classification 1-Dimensional emotional space is used. Both the results are merged onto a 2-Dimensional emotional space, which will classify song into a particular mood category. Finally clusters of mood based song files are formed and arranged according to data acquired from various Internet sources.
Education in Conflict Zones: a Web and Mobility Approach
Venue: arXiv cs.CY 2012
Year: 2012

We propose a new framework for education in conflict zones, considering the explosive growth of social media, web services, and mobile Internet over the past decade. Moreover, we focus on one conflict zone, Afghanistan, as a case study, because of its alarmingly high illiteracy rate, lack of qualified teachers, rough terrain, and relatively high mobile penetration of over 50%. In several of Afghanistan's provinces, it is hard to currently sustain the traditional bricks-and-mortar school model, due to numerous incidents of schools, teachers, and students being attacked because of the ongoing insurgency and political instability. Our model improves the virtual school model, by addressing most of its disadvantages, to provide students in Afghanistan with an opportunity to achieve standardised education, even when the security situation does not allow them to attend traditional schools. One of the biggest advantages of this model is that it is sufficiently robust to deal with gender discrimination, imposed by culture or politics of the region.
Information Security Awareness Within Business Environment: An IT Review
Venue: arXiv cs.OH 2012
Year: 2012

The beauty of Information Technology (IT) is with its multifunction nature; it is a support system, a networking system, a storage system, as well as an information facilitator. Aided with their broad line of services, an IT system aims to support or even drive organizations towards desired paths. Trends of IT and information security awareness (ISA) in society today, particularly within the business environment is quite interesting phenomenon. The overviews of the role of IT in the modern world as well as the perception towards ISA are initially introduced. A series of scope are outlined, and also further examination on matter of IT and ISA in the business environment-emphasis on revolution of business with ISA, security threats such as identity thefts, hacking and web harassment, and the different mode of protections that are applied in different business environments. Unfortunately, the advancement of IT is not followed by the awareness of its security issues properly, especially in the context of the business settings and functions. This research and review is expected to influence the awareness of information security issues in business processes.
Collaborative High Accuracy Localization in Mobile Multipath Environments
Venue: arXiv cs.NI 2012
Year: 2012

We study the problem of high accuracy localization of mobile nodes in a multipath-rich environment where sub-meter accuracies are required. We employ a peer-to-peer framework where the vehicles/nodes can get pairwise multipath-degraded ranging estimates in local neighborhoods together with a fixed number of anchor nodes. The challenge is to overcome the multipath-barrier with redundancy in order to provide the desired accuracies especially under severe multipath conditions when the fraction of received signals corrupted by multipath is dominating. We invoke a analytical graphical model framework based on particle filtering and reveal its high accuracy localization promise through simulations. We also address design questions such as "How many anchors and what fraction of line-of-sight (LOS) measurements are needed to achieve a specified target accuracy?", by analytically characterizing the performance improvement in localization accuracy as a function of the number of nodes in the network and the fraction of LOS measurements. In particular, for a static node placement, we show that the Cramer-Rao Lower Bound (CRLB), a fundamental lower bound on the localization accuracy, can be expressed as a product of two factors - a scalar function that depends only on the parameters of the noise distribution and a matrix that depends only on the geometry of node locations and the underlying connectivity graph. Further, a simplified expression is obtained for the CRLB that helps deduce the scaling behavior of the estimation error as a function of the number of agents and anchors in the network. The bound suggests that even a small fraction of LOS measurements can provide significant improvements. Conversely, a small fraction of NLOS measurements can significantly degrade the performance. The analysis is extended to the mobile setting and the performance is compared with the derived CRLB.
Round-Robin Streaming with Generations
Venue: arXiv cs.IT 2012
Year: 2012

We consider three types of application layer coding for streaming over lossy links: random linear coding, systematic random linear coding, and structured coding. The file being streamed is divided into sub-blocks (generations). Code symbols are formed by combining data belonging to the same generation, and transmitted in a round-robin fashion. We compare the schemes based on delivery packet count, net throughput, and energy consumption for a range of generation sizes. We determine these performance measures both analytically and in an experimental configuration. We find our analytical predictions to match the experimental results. We show that coding at the application layer brings about a significant increase in net data throughput, and thereby reduction in energy consumption due to reduced communication time. On the other hand, on devices with constrained computing resources, heavy coding operations cause packet drops in higher layers and negatively affect the net throughput. We find from our experimental results that low-rate MDS codes are best for small generation sizes, whereas systematic random linear coding has the best net throughput and lowest energy consumption for larger generation sizes due to its low decoding complexity.
On the Covering Radius of Some Modular Codes
Venue: arXiv cs.IT 2012
Year: 2012

This paper gives lower and upper bounds on the covering radius of codes over $\Z_{2^s}$ with respect to homogenous distance. We also determine the covering radius of various Repetition codes, Simplex codes (Type $α$ and Type $β$) and their dual and give bounds on the covering radii for MacDonald codes of both types over $\Z_4$.
Automated Analysis of Scenario-based Specifications of Distributed Access Control Policies with Non-Mechanizable Activities (Extended Version)
Venue: arXiv cs.LO 2012
Year: 2012

The advance of web services technologies promises to have far-reaching effects on the Internet and enterprise networks allowing for greater accessibility of data. The security challenges presented by the web services approach are formidable. In particular, access control solutions should be revised to address new challenges, such as the need of using certificates for the identification of users and their attributes, human intervention in the creation or selection of the certificates, and (chains of) certificates for trust management. With all these features, it is not surprising that analyzing policies to guarantee that a sensitive resource can be accessed only by authorized users becomes very difficult. In this paper, we present an automated technique to analyze scenario-based specifications of access control policies in open and distributed systems. We illustrate our ideas on a case study arising in the e-government area.
Adaptive Inference on General Graphical Models
Venue: arXiv cs.DS 2012
Year: 2012

Many algorithms and applications involve repeatedly solving variations of the same inference problem; for example we may want to introduce new evidence to the model or perform updates to conditional dependencies. The goal of adaptive inference is to take advantage of what is preserved in the model and perform inference more rapidly than from scratch. In this paper, we describe techniques for adaptive inference on general graphs that support marginal computation and updates to the conditional probabilities and dependencies in logarithmic time. We give experimental results for an implementation of our algorithm, and demonstrate its potential performance benefit in the study of protein structure.
Clique Matrices for Statistical Graph Decomposition and Parameterising Restricted Positive Definite Matrices
Venue: arXiv cs.DM 2012
Year: 2012

We introduce Clique Matrices as an alternative representation of undirected graphs, being a generalisation of the incidence matrix representation. Here we use clique matrices to decompose a graph into a set of possibly overlapping clusters, de ned as well-connected subsets of vertices. The decomposition is based on a statistical description which encourages clusters to be well connected and few in number. Inference is carried out using a variational approximation. Clique matrices also play a natural role in parameterising positive de nite matrices under zero constraints on elements of the matrix. We show that clique matrices can parameterise all positive de nite matrices restricted according to a decomposable graph and form a structured Factor Analysis approximation in the non-decomposable case.
Approximating the Partition Function by Deleting and then Correcting for Model Edges
Venue: arXiv cs.LG 2012
Year: 2012

We propose an approach for approximating the partition function which is based on two steps: (1) computing the partition function of a simplified model which is obtained by deleting model edges, and (2) rectifying the result by applying an edge-by-edge correction. The approach leads to an intuitive framework in which one can trade-off the quality of an approximation with the complexity of computing it. It also includes the Bethe free energy approximation as a degenerate case. We develop the approach theoretically in this paper and provide a number of empirical results that reveal its practical utility.