OpenRaiser/Intern-Atlas huggingface dataset:
Towards physical laws for software architecture
Venue: arXiv cs.SE 2010
Year: 2010

Starting from the pioneering works on software architecture precious guidelines have emerged to indicate how computer programs should be organized. For example the "separation of concerns" suggests to split a program into modules that overlap in functionality as little as possible. However these recommendations are mainly conceptual and are thus hard to express in a quantitative form. Hence software architecture relies on the individual experience and skill of the designers rather than on quantitative laws. In this article I apply the methods developed for the classification of information on the World-Wide-Web to study the organization of Open Source programs in an attempt to establish the statistical laws governing software architecture.
Web-Based Learning and Training for Virtual Metrology Lab
Venue: arXiv cs.OH 2010
Year: 2010

The use of World Web Wide for distance education has received increasing attention over the past decades. The real challenge of adapting this technology for engineering education and training is to facilitate the laboratory experiments via Internet. In the sciences, measurement plays an important role. The accuracy of the measurement, as well as the units, help scientists to better understand phenomena occurring in nature. This paper introduces Metrology educators to the use and adoption of Java-applets in order to create virtual, online Metrology laboratories for students. These techniques have been used to successfully form a laboratory course which augments the more conventional lectures in concepts of Metrology course at Faculty of Engineering, Albaha University, KSA. Improvements of the package are still undergoing to incorporate Web-based technologies (Internet home page, HTML, Java programming etc...). This Web-based education and training has been successfully class-tested within an undergraduate preliminary year engineering course and students reported a positive experience with its use. The use of these labs should be self-explanatory and their reliable operation has been thoroughly tested.
The Error-Pattern-Correcting Turbo Equalizer
Venue: arXiv cs.IT 2010
Year: 2010

The error-pattern correcting code (EPCC) is incorporated in the design of a turbo equalizer (TE) with aim to correct dominant error events of the inter-symbol interference (ISI) channel at the output of its matching Viterbi detector. By targeting the low Hamming-weight interleaved errors of the outer convolutional code, which are responsible for low Euclidean-weight errors in the Viterbi trellis, the turbo equalizer with an error-pattern correcting code (TE-EPCC) exhibits a much lower bit-error rate (BER) floor compared to the conventional non-precoded TE, especially for high rate applications. A maximum-likelihood upper bound is developed on the BER floor of the TE-EPCC for a generalized two-tap ISI channel, in order to study TE-EPCC's signal-to-noise ratio (SNR) gain for various channel conditions and design parameters. In addition, the SNR gain of the TE-EPCC relative to an existing precoded TE is compared to demonstrate the present TE's superiority for short interleaver lengths and high coding rates.
Recognition of Handwritten Roman Script Using Tesseract Open source OCR Engine
Venue: arXiv cs.CV 2010
Year: 2010

In the present work, we have used Tesseract 2.01 open source Optical Character Recognition (OCR) Engine under Apache License 2.0 for recognition of handwriting samples of lower case Roman script. Handwritten isolated and free-flow text samples were collected from multiple users. Tesseract is trained to recognize user-specific handwriting samples of both the categories of document pages. On a single user model, the system is trained with 1844 isolated handwritten characters and the performance is tested on 1133 characters, taken form the test set. The overall character-level accuracy of the system is observed as 83.5%. The system fails to segment 5.56% characters and erroneously classifies 10.94% characters.
A Triple-Error-Correcting Cyclic Code from the Gold and Kasami-Welch APN Power Functions
Venue: arXiv cs.DM 2010
Year: 2010

Based on a sufficient condition proposed by Hollmann and Xiang for constructing triple-error-correcting codes, the minimum distance of a binary cyclic code $\mathcal{C}_{1,3,13}$ with three zeros $α$, $α^3$, and $α^{13}$ of length $2^m-1$ and the weight divisibility of its dual code are studied, where $m\geq 5$ is odd and $α$ is a primitive element of the finite field $\mathbb{F}_{2^m}$. The code $\mathcal{C}_{1,3,13}$ is proven to have the same weight distribution as the binary triple-error-correcting primitive BCH code $\mathcal{C}_{1,3,5}$ of the same length.
A CF-Based Randomness Measure for Sequences
Venue: arXiv cs.DM 2010
Year: 2010

This note examines the question of randomness in a sequence based on the continued fraction (CF) representation of its corresponding representation as a number, or as D sequence. We propose a randomness measure that is directly equal to the number of components of the CF representation. This provides a means of quantifying the randomness of the popular PN sequences as well. A comparison is made of representation as a fraction and as a continued fraction.
High-Performance Physics Simulations Using Multi-Core CPUs and GPGPUs in a Volunteer Computing Context
Venue: arXiv cs.DC 2010
Year: 2010

This paper presents two conceptually simple methods for parallelizing a Parallel Tempering Monte Carlo simulation in a distributed volunteer computing context, where computers belonging to the general public are used. The first method uses conventional multi-threading. The second method uses CUDA, a graphics card computing system. Parallel Tempering is described, and challenges such as parallel random number generation and mapping of Monte Carlo chains to different threads are explained. While conventional multi-threading on CPUs is well-established, GPGPU programming techniques and technologies are still developing and present several challenges, such as the effective use of a relatively large number of threads. Having multiple chains in Parallel Tempering allows parallelization in a manner that is similar to the serial algorithm. Volunteer computing introduces important constraints to high performance computing, and we show that both versions of the application are able to adapt themselves to the varying and unpredictable computing resources of volunteers' computers, while leaving the machines responsive enough to use. We present experiments to show the scalable performance of these two approaches, and indicate that the efficiency of the methods increases with bigger problem sizes.
Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity
Venue: arXiv cs.CC 2010
Year: 2010

A Direct Sum Theorem holds in a model of computation, when solving some k input instances together is k times as expensive as solving one. We show that Direct Sum Theorems hold in the models of deterministic and randomized decision trees for all relations. We also note that a near optimal Direct Sum Theorem holds for quantum decision trees for boolean functions.
Embedding Secret Data in HTML Web Page
Venue: arXiv cs.CR 2010
Year: 2010

In this paper, we suggest a novel data hiding technique in an HTML Web page. HTML Tags are case insensitive and hence an alphabet in lowercase and one in uppercase present inside an HTML tag are interpreted in the same manner by the browser,i.e., change in case in an web page is imperceptible to the browser. We basically exploit this redundancy and use it to embed secret data inside an web page, with no changes visible to the user of the web page, so that he can not even suspect about the data hiding. The embedded data can be recovered by viewing the source of the HTML page. This technique can easily be extended to embed secret message inside any piece of source-code where the standard interpreter of that language is case-insensitive.
A new representation of Chaitin Ωnumber based on compressible strings
Venue: arXiv cs.IT 2010
Year: 2010

In 1975 Chaitin introduced his Ωnumber as a concrete example of random real. The real Ωis defined based on the set of all halting inputs for an optimal prefix-free machine U, which is a universal decoding algorithm used to define the notion of program-size complexity. Chaitin showed Ωto be random by discovering the property that the first n bits of the base-two expansion of Ωsolve the halting problem of U for all binary inputs of length at most n. In this paper, we introduce a new representation Θof Chaitin Ωnumber. The real Θis defined based on the set of all compressible strings. We investigate the properties of Θand show that Θis random. In addition, we generalize Θto two directions Θ(T) and \barΘ(T) with a real T>0. We then study their properties. In particular, we show that the computability of the real Θ(T) gives a sufficient condition for a real T in (0,1) to be a fixed point on partial randomness, i.e., to satisfy the condition that the compression rate of T equals to T.
Cryptanalysis of a more efficient and secure dynamic id-based remote user authentication scheme
Venue: arXiv cs.CR 2010
Year: 2010

In 2004, Das, Saxena and Gulati proposed a dynamic ID-based remote user authentication scheme which has many advantage such as no verifier table, user freedom to choose and change password and so on. However the subsequent papers have shown that this scheme is completely insecure and vulnerable to many attacks. Since then many schemes with improvements to Das et al's scheme has been proposed but each has its pros and cons. Recently Yan-yan Wang et al. have proposed a scheme to overcome security weaknesses of Das et al.'s scheme. However this scheme too is vulnerable to various security attacks such as password guessing attack, masquerading attack, denial of service attack.
A Separation of NP and coNP in Multiparty Communication Complexity
Venue: arXiv cs.CC 2010
Year: 2010

We prove that NP differs from coNP and coNP is not a subset of MA in the number-on-forehead model of multiparty communication complexity for up to k = (1-ε)log(n) players, where ε>0 is any constant. Specifically, we construct a function F with co-nondeterministic complexity O(log(n)) and Merlin-Arthur complexity n^{Ω(1)}. The problem was open for k > 2.
On building minimal automaton for subset matching queries
Venue: arXiv cs.FL 2010
Year: 2010

We address the problem of building an index for a set $D$ of $n$ strings, where each string location is a subset of some finite integer alphabet of size $σ$, so that we can answer efficiently if a given simple query string (where each string location is a single symbol) $p$ occurs in the set. That is, we need to efficiently find a string $d \in D$ such that $p[i] \in d[i]$ for every $i$. We show how to build such index in $O(n^{\log_{σ/Δ}(σ)}\log(n))$ average time, where $Δ$ is the average size of the subsets. Our methods have applications e.g.\ in computational biology (haplotype inference) and music information retrieval.
Bounded Reachability for Temporal Logic over Constraint Systems
Venue: arXiv cs.LO 2010
Year: 2010

We present CLTLB(D), an extension of PLTLB (PLTL with both past and future operators) augmented with atomic formulae built over a constraint system D. Even for decidable constraint systems, satisfiability and Model Checking problem of such logic can be undecidable. We introduce suitable restrictions and assumptions that are shown to make the satisfiability problem for the extended logic decidable. Moreover for a large class of constraint systems we propose an encoding that realize an effective decision procedure for the Bounded Reachability problem.
Optimal sequential transmission over broadcast channel with nested feedback
Venue: arXiv cs.IT 2010
Year: 2010

We consider the optimal design of sequential transmission over broadcast channel with nested feedback. Nested feedback means that the channel output of the outer channel is also available at the decoder of the inner channel. We model the communication system as a decentralized team with three decision makers---the encoder and the two decoders. Structure of encoding and decoding strategies that minimize a total distortion measure over a finite horizon are determined. The results are applicable for real-time communication as well as for the information theoretic setup.
Structured LDPC Codes from Permutation Matrices Free of Small Trapping Sets
Venue: arXiv cs.IT 2010
Year: 2010

This paper introduces a class of structured lowdensity parity-check (LDPC) codes whose parity check matrices are arrays of permutation matrices. The permutation matrices are obtained from Latin squares and form a finite field under some matrix operations. They are chosen so that the Tanner graphs do not contain subgraphs harmful to iterative decoding algorithms. The construction of column-weight-three codes is presented. Although the codes are optimized for the Gallager A/B algorithm over the binary symmetric channel (BSC), their error performance is very good on the additive white Gaussian noise channel (AWGNC) as well.
Design and Implementation of an Intelligent Educational Model Based on Personality and Learner's Emotion
Venue: arXiv cs.CY 2010
Year: 2010

The Personality and emotions are effective parameters in learning process. Thus, virtual learning environments should pay attention to these parameters. In this paper, a new e-learning model is designed and implemented according to these parameters. The Virtual learning environment that is presented here uses two agents: Virtual Tutor Agent (VTA), and Virtual Classmate Agent (VCA). During the learning process and depending on events happening in the environment, learner's emotions are changed. In this situation, learning style should be revised according to the personality traits as well as the learner's current emotions. VTA selects suitable learning style for the learners based on their personality traits. To improve the learning process, the system uses VCA in some of the learning steps. VCA is an intelligent agent and has its own personality. It is designed so that it can present an attractive and real learning environment in interaction with the learner. To recognize the learner's personality, this system uses MBTI test and to obtain emotion values uses OCC model. Finally, the results of system tested in real environments show that considering the human features in interaction with the learner increases learning quality and satisfies the learner.
Signature Recognition using Multi Scale Fourier Descriptor And Wavelet Transform
Venue: arXiv cs.CV 2010
Year: 2010

This paper present a novel off-line signature recognition method based on multi scale Fourier Descriptor and wavelet transform . The main steps of constructing a signature recognition system are discussed and experiments on real data sets show that the average error rate can reach 1%. Finally we compare 8 distance measures between feature vectors with respect to the recognition performance. Key words: signature recognition; Fourier Descriptor; Wavelet transform; personal verification
Botnet Detection by Monitoring Similar Communication Patterns
Venue: arXiv cs.CR 2010
Year: 2010

Botnet is most widespread and occurs commonly in today's cyber attacks, resulting in serious threats to our network assets and organization's properties. Botnets are collections of compromised computers (Bots) which are remotely controlled by its originator (BotMaster) under a common Command-and-Control (C&C) infrastructure. They are used to distribute commands to the Bots for malicious activities such as distributed denial-of-service (DDoS) attacks, spam and phishing. Most of the existing Botnet detection approaches concentrate only on particular Botnet command and control (C&C) protocols (e.g., IRC,HTTP) and structures (e.g., centralized), and can become ineffective as Botnets change their structure and C&C techniques. In this paper at first we provide taxonomy of Botnets C&C channels and evaluate well-known protocols which are being used in each of them. Then we proposed a new general detection framework which currently focuses on P2P based and IRC based Botnets. This proposed framework is based on definition of Botnets. Botnet has been defined as a group of bots that perform similar communication and malicious activity patterns within the same Botnet. The point that distinguishes our proposed detection framework from many other similar works is that there is no need for prior knowledge of Botnets such as Botnet signature.
Analysis of Empirical Software Effort Estimation Models
Venue: arXiv cs.SE 2010
Year: 2010

Reliable effort estimation remains an ongoing challenge to software engineers. Accurate effort estimation is the state of art of software engineering, effort estimation of software is the preliminary phase between the client and the business enterprise. The relationship between the client and the business enterprise begins with the estimation of the software. The credibility of the client to the business enterprise increases with the accurate estimation. Effort estimation often requires generalizing from a small number of historical projects. Generalization from such limited experience is an inherently under constrained problem. Accurate estimation is a complex process because it can be visualized as software effort prediction, as the term indicates prediction never becomes an actual. This work follows the basics of the empirical software effort estimation models. The goal of this paper is to study the empirical software effort estimation. The primary conclusion is that no single technique is best for all situations, and that a careful comparison of the results of several approaches is most likely to produce realistic estimates.
Security Policy Enforcement Through Refinement Process
Venue: arXiv cs.CR 2010
Year: 2010

In the area of networks, a common method to enforce a security policy expressed in a high-level language is based on an ad-hoc and manual rewriting process. We argue that it is possible to build a formal link between concrete and abstract terms, which can be dynamically computed from the environment data. In order to progressively introduce configuration data and then simplify the proof obligations, we use the B refinement process. We present a case study modeling a network monitor. This program, described by refinement following the layers of the TCP/IP suite protocol, has to warn for all observed events which do not respect the security policy. To design this model, we use the event-B method because it is suitable for modeling network concepts. This work has been done within the framework of the POTESTAT project, based on the research of network testing methods from a high-level security policy.
Importance of Sources using the Repeated Fusion Method and the Proportional Conflict Redistribution Rules #5 and #6
Venue: arXiv cs.AI 2010
Year: 2010

We present in this paper some examples of how to compute by hand the PCR5 fusion rule for three sources, so the reader will better understand its mechanism. We also take into consideration the importance of sources, which is different from the classical discounting of sources.
The Networked Common Goods Game
Venue: arXiv cs.GT 2010
Year: 2010

We introduce a new class of games called the networked common goods game (NCGG), which generalizes the well-known common goods game. We focus on a fairly general subclass of the game where each agent's utility functions are the same across all goods the agent is entitled to and satisfy certain natural properties (diminishing return and smoothness). We give a comprehensive set of technical results listed as follows. * We show the optimization problem faced by a single agent can be solved efficiently in this subclass. The discrete version of the problem is however NP-hard but admits an fully polynomial time approximation scheme (FPTAS). * We show uniqueness results of pure strategy Nash equilibrium of NCGG, and that the equilibrium is fully characterized by the structure of the network and independent of the choices and combinations of agent utility functions. * We show NCGG is a potential game, and give an implementation of best/better response Nash dynamics that lead to fast convergence to an $ε$-approximate pure strategy Nash equilibrium. * Lastly, we show the price of anarchy of NCGG can be as large as $Ω(n^{1-ε})$ (for any $ε>0$), which means selfish behavior in NCGG can lead to extremely inefficient social outcomes.
Towards a new crown indicator: An empirical analysis
Venue: arXiv cs.DL 2010
Year: 2010

We present an empirical comparison between two normalization mechanisms for citation-based indicators of research performance. These mechanisms aim to normalize citation counts for the field and the year in which a publication was published. One mechanism is applied in the current so-called crown indicator of our institute. The other mechanism is applied in the new crown indicator that our institute is planning to adopt. We find that at high aggregation levels, such as at the level of large research institutions or at the level of countries, the differences between the two mechanisms are very small. At lower aggregation levels, such as at the level of research groups or at the level of journals, the differences between the two mechanisms are somewhat larger. We pay special attention to the way in which recent publications are handled. These publications typically have very low citation counts and should therefore be handled with special care.
Processor Based Active Queue Management for providing QoS in Multimedia Application
Venue: arXiv cs.NI 2010
Year: 2010

The objective of this paper is to implement the Active Network based Active Queue Management Technique for providing Quality of Service (QoS) using Network Processor(NP) based router to enhance multimedia applications. The performance is evaluated using Intel IXP2400 NP Simulator. The results demonstrate that, Active Network based Active Queue Management has better performance than RED algorithm in case of congestion and is well suited to achieve high speed packet classification to support multimedia applications with minimum delay and Queue loss. Using simulation, we show that the proposed system can provide assurance for prioritized flows with improved network utilization where bandwidth is shared among the flows according to the levels of priority. We first analyze the feasibility and optimality of the load distribution schemes and then present separate solutions for non-delay sensitive streams and delay-sensitive streams. Rigorous simulations and experiments have been carried out to evaluate the performance.
SAR Image Segmentation using Vector Quantization Technique on Entropy Images
Venue: arXiv cs.MM 2010
Year: 2010

The development and application of various remote sensing platforms result in the production of huge amounts of satellite image data. Therefore, there is an increasing need for effective querying and browsing in these image databases. In order to take advantage and make good use of satellite images data, we must be able to extract meaningful information from the imagery. Hence we proposed a new algorithm for SAR image segmentation. In this paper we propose segmentation using vector quantization technique on entropy image. Initially, we obtain entropy image and in second step we use Kekre's Fast Codebook Generation (KFCG) algorithm for segmentation of the entropy image. Thereafter, a codebook of size 128 was generated for the Entropy image. These code vectors were further clustered in 8 clusters using same KFCG algorithm and converted into 8 images. These 8 images were displayed as a result. This approach does not lead to over segmentation or under segmentation. We compared these results with well known Gray Level Co-occurrence Matrix. The proposed algorithm gives better segmentation with less complexity.