OpenRaiser/Intern-Atlas huggingface dataset:
Handwritten Arabic Numeral Recognition using a Multi Layer Perceptron
Venue: arXiv cs.CV 2010
Year: 2010

Handwritten numeral recognition is in general a benchmark problem of Pattern Recognition and Artificial Intelligence. Compared to the problem of printed numeral recognition, the problem of handwritten numeral recognition is compounded due to variations in shapes and sizes of handwritten characters. Considering all these, the problem of handwritten numeral recognition is addressed under the present work in respect to handwritten Arabic numerals. Arabic is spoken throughout the Arab World and the fifth most popular language in the world slightly before Portuguese and Bengali. For the present work, we have developed a feature set of 88 features is designed to represent samples of handwritten Arabic numerals for this work. It includes 72 shadow and 16 octant features. A Multi Layer Perceptron (MLP) based classifier is used here for recognition handwritten Arabic digits represented with the said feature set. On experimentation with a database of 3000 samples, the technique yields an average recognition rate of 94.93% evaluated after three-fold cross validation of results. It is useful for applications related to OCR of handwritten Arabic Digit and can also be extended to include OCR of handwritten characters of Arabic alphabet.
Supermartingales in Prediction with Expert Advice
Venue: arXiv cs.LG 2010
Year: 2010

We apply the method of defensive forecasting, based on the use of game-theoretic supermartingales, to prediction with expert advice. In the traditional setting of a countable number of experts and a finite number of outcomes, the Defensive Forecasting Algorithm is very close to the well-known Aggregating Algorithm. Not only the performance guarantees but also the predictions are the same for these two methods of fundamentally different nature. We discuss also a new setting where the experts can give advice conditional on the learner's future decision. Both the algorithms can be adapted to the new setting and give the same performance guarantees as in the traditional setting. Finally, we outline an application of defensive forecasting to a setting with several loss functions.
Automated selection of LEDs by luminance and chromaticity coordinate
Venue: arXiv cs.OH 2010
Year: 2010

The increased use of LEDs for lighting purposes has led to the development of numerous applications requiring a pre-selection of LEDs by their luminance and / or their chromaticity coordinate. This paper demonstrates how a manual pre-selection process can be realized using a relatively simple configuration. Since a manual selection service can only be commercially viable as long as only small quantities of LEDs need to be sorted, an automated solution suggests itself. This paper introduces such a solution, which has been developed by Harzoptics in close cooperation with Rundfunk Gernrode. The paper also discusses current challenges in measurement technology as well as market trends.
Spectrum Trading: An Abstracted Bibliography
Venue: arXiv cs.NI 2010
Year: 2010

This document contains a bibliographic list of major papers on spectrum trading and their abstracts. The aim of the list is to offer researchers entering this field a fast panorama of the current literature. The list is continually updated on the webpage \url{http://www.disp.uniroma2.it/users/naldi/Ricspt.html}. Omissions and papers suggested for inclusion may be pointed out to the authors through e-mail (\textit{naldi@disp.uniroma2.it}).
Forming the COUNCIL Based Clusters in Securing Wireless Ad Hoc Networks
Venue: arXiv cs.CR 2010
Year: 2010

In cluster-based routing protocol (CBRP), two-level hierarchical structure is successfully used to reduce over-flooding in wireless Ad Hoc networks. As it is vulnerable to a single point of failure, we propose a new adaptive distributed threshold scheme to replace the cluster head by a group of cluster heads within each cluster, called COUNCIL, and distribute the service of single cluster head to multiple cluster heads using (k,n) threshold secret sharing scheme. An Ad Hoc network formed by COUNCIL based clusters can work correctly when the number of compromised cluster heads is smaller than k. To implement this adaptive threshold scheme in wireless Ad Hoc Networks, membership of the clusters should be defined in an adaptive way. In this paper, we mainly discuss our algorithm for forming COUNCIL based clusters using the concept of dominating set from graph theory.
Table manipulation in simplicial databases
Venue: arXiv cs.DB 2010
Year: 2010

In \cite{Spi}, we developed a category of databases in which the schema of a database is represented as a simplicial set. Each simplex corresponds to a table in the database. There, our main concern was to find a categorical formulation of databases; the simplicial nature of the schemas was to some degree unexpected and unexploited. In the present note, we show how to use this geometric formulation effectively on a computer. If we think of each simplex as a polygonal tile, we can imagine assembling custom databases by mixing and matching tiles. Queries on this database can be performed by drawing paths through the resulting tile formations, selecting records at the start-point of this path and retrieving corresponding records at its end-point.
The role of semantics in mining frequent patterns from knowledge bases in description logics with rules
Venue: arXiv cs.LO 2010
Year: 2010

We propose a new method for mining frequent patterns in a language that combines both Semantic Web ontologies and rules. In particular we consider the setting of using a language that combines description logics with DL-safe rules. This setting is important for the practical application of data mining to the Semantic Web. We focus on the relation of the semantics of the representation formalism to the task of frequent pattern discovery, and for the core of our method, we propose an algorithm that exploits the semantics of the combined knowledge base. We have developed a proof-of-concept data mining implementation of this. Using this we have empirically shown that using the combined knowledge base to perform semantic tests can make data mining faster by pruning useless candidate patterns before their evaluation. We have also shown that the quality of the set of patterns produced may be improved: the patterns are more compact, and there are fewer patterns. We conclude that exploiting the semantics of a chosen representation formalism is key to the design and application of (onto-)relational frequent pattern discovery methods. Note: To appear in Theory and Practice of Logic Programming (TPLP)
Security Games with Decision and Observation Errors
Venue: arXiv cs.GT 2010
Year: 2010

We study two-player security games which can be viewed as sequences of nonzero-sum matrix games played by an Attacker and a Defender. The evolution of the game is based on a stochastic fictitious play process. Players do not have access to each other's payoff matrix. Each has to observe the other's actions up to present and plays the action generated based on the best response to these observations. However, when the game is played over a communication network, there are several practical issues that need to be taken into account: First, the players may make random decision errors from time to time. Second, the players' observations of each other's previous actions may be incorrect. The players will try to compensate for these errors based on the information they have. We examine convergence property of the game in such scenarios, and establish convergence to the equilibrium point under some mild assumptions when both players are restricted to two actions.
Reduced ML-Decoding Complexity, Full-Rate STBCs for $2^a$ Transmit Antenna Systems
Venue: arXiv cs.IT 2010
Year: 2010

For an $n_t$ transmit, $n_r$ receive antenna system ($n_t \times n_r$ system), a {\it{full-rate}} space time block code (STBC) transmits $n_{min} = min(n_t,n_r)$ complex symbols per channel use and in general, has an ML-decoding complexity of the order of $M^{n_tn_{min}}$ (considering square designs), where $M$ is the constellation size. In this paper, a scheme to obtain a full-rate STBC for $2^a$ transmit antennas and any $n_r$, with reduced ML-decoding complexity of the order of $M^{n_t(n_{min}-3/4)}$, is presented. The weight matrices of the proposed STBC are obtained from the unitary matrix representations of a Clifford Algebra. For any value of $n_r$, the proposed design offers a reduction from the full ML-decoding complexity by a factor of $M^{3n_t/4}}$. The well known Silver code for 2 transmit antennas is a special case of the proposed scheme. Further, it is shown that the codes constructed using the scheme have higher ergodic capacity than the well known punctured Perfect codes for $n_r < n_t$. Simulation results of the symbol error rates are shown for $8 \times 2$ systems, where the comparison of the proposed code is with the punctured Perfect code for 8 transmit antennas. The proposed code matches the punctured perfect code in error performance, while having reduced ML-decoding complexity and higher ergodic capacity.
Regularized sampling of multiband signals
Venue: arXiv cs.IT 2010
Year: 2010

This paper presents a regularized sampling method for multiband signals, that makes it possible to approach the Landau limit, while keeping the sensitivity to noise at a low level. The method is based on band-limited windowing, followed by trigonometric approximation in consecutive time intervals. The key point is that the trigonometric approximation "inherits" the multiband property, that is, its coefficients are formed by bursts of non-zero elements corresponding to the multiband components. It is shown that this method can be well combined with the recently proposed synchronous multi-rate sampling (SMRS) scheme, given that the resulting linear system is sparse and formed by ones and zeroes. The proposed method allows one to trade sampling efficiency for noise sensitivity, and is specially well suited for bounded signals with unbounded energy like those in communications, navigation, audio systems, etc. Besides, it is also applicable to finite energy signals and periodic band-limited signals (trigonometric polynomials). The paper includes a subspace method for blindly estimating the support of the multiband signal as well as its components, and the results are validated through several numerical examples.
Non-oblivious Strategy Improvement
Venue: arXiv cs.GT 2010
Year: 2010

We study strategy improvement algorithms for mean-payoff and parity games. We describe a structural property of these games, and we show that these structures can affect the behaviour of strategy improvement. We show how awareness of these structures can be used to accelerate strategy improvement algorithms. We call our algorithms non-oblivious because they remember properties of the game that they have discovered in previous iterations. We show that non-oblivious strategy improvement algorithms perform well on examples that are known to be hard for oblivious strategy improvement. Hence, we argue that previous strategy improvement algorithms fail because they ignore the structural properties of the game that they are solving.
On Generalizations of Network Design Problems with Degree Bounds
Venue: arXiv cs.DS 2010
Year: 2010

Iterative rounding and relaxation have arguably become the method of choice in dealing with unconstrained and constrained network design problems. In this paper we extend the scope of the iterative relaxation method in two directions: (1) by handling more complex degree constraints in the minimum spanning tree problem (namely, laminar crossing spanning tree), and (2) by incorporating `degree bounds' in other combinatorial optimization problems such as matroid intersection and lattice polyhedra. We give new or improved approximation algorithms, hardness results, and integrality gaps for these problems.
A Computational Approach to the Graceful Tree Conjecture
Venue: arXiv cs.DM 2010
Year: 2010

Graceful tree conjecture is a well-known open problem in graph theory. Here we present a computational approach to this conjecture. An algorithm for finding graceful labelling for trees is proposed. With this algorithm, we show that every tree with at most 35 vertices allows a graceful labelling, hence we verify that the graceful tree conjecture is correct for trees with at most 35 vertices.
Spatial multiplexing with MMSE receivers: Single-stream optimality in ad hoc networks
Venue: arXiv cs.IT 2010
Year: 2010

The performance of spatial multiplexing systems with linear minimum-mean-squared-error receivers is investigated in ad hoc networks. It is shown that single-stream transmission is preferable over multi-stream transmission, due to the weaker interference powers from the strongest interferers remaining after interference-cancelation. This result is obtained by new exact closed-form expressions we derive for the outage probability and transmission capacity.
An Algorithm for Index Multimedia Data (Video) using the Movement Oriented Method for Real-time Online Services
Venue: arXiv cs.MM 2010
Year: 2010

Multimedia data is a form of data that can represent all types of data (images, sound and text). The use of multimedia data for the online application requires a more comprehensive database in the use of storage media, Sorting / indexing, search and system / data searching. This is necessary in order to help providers and users to access multimedia data online. Systems that use of the index image as a reference requires storage media so that the rules and require special expertise to obtain the desired file. Changes in multimedia data into a series of stories / storyboard in the form of a text will help reduce the consumption of media storage, system index / sorting and search applications. Oriented Movement is one method that is being developed to change the form of multimedia data into a storyboard.
Node Isolation Probability of Wireless Adhoc Networks in Nagakami Fading Channel
Venue: arXiv cs.NI 2010
Year: 2010

This paper investigates the issue of connectivity of a wireless adhoc network in the presence of channel impairments. We derive analytical expressions for the node isolation probability in an adhoc network in the presence of Nakagami-m fading with superimposed lognormal shadowing. The node isolation probability is the probability that a randomly chosen node is not able to communicate with none of the other nodes in the network. An extensive investigation into the impact of path loss exponent, lognormal shadowing, Nakagami fading severity index, node density, and diversity order on the node isolation probability is conducted. The presented results are beneficial for the practical design of ad hoc networks.
New designing of E-Learning systems with using network learning
Venue: arXiv cs.CY 2010
Year: 2010

One of the most applied learning in virtual spaces is using E-Learning systems. Some E-Learning methodologies has been introduced, but the main subject is the most positive feedback from E-Learning systems. In this paper, we introduce a new methodology of E-Learning systems entitle "Network Learning" with review of another aspects of E-Learning systems. Also, we present benefits and advantages of using these systems in educating and fast learning programs. Network Learning can be programmable for every education system and it is flexible with too positive results.
Strategic Cooperation in Cost Sharing Games
Venue: arXiv cs.GT 2010
Year: 2010

In this paper we consider strategic cost sharing games with so-called arbitrary sharing based on various combinatorial optimization problems, such as vertex and set cover, facility location, and network design problems. We concentrate on the existence and computational complexity of strong equilibria, in which no coalition can improve the cost of each of its members. Our main result reveals a connection between strong equilibrium in strategic games and the core in traditional coalitional cost sharing games studied in economics. For set cover and facility location games this results in a tight characterization of the existence of strong equilibrium using the integrality gap of suitable linear programming formulations. Furthermore, it allows to derive all existing results for strong equilibria in network design cost sharing games with arbitrary sharing via a unified approach. In addition, we are able to show that in general the strong price of anarchy is always 1. This should be contrasted with the price of anarchy of Θ(n) for Nash equilibria. Finally, we indicate that the LP-approach can also be used to compute near-optimal and near-stable approximate strong equilibria.
Towards trusted volunteer grid environments
Venue: arXiv cs.DC 2010
Year: 2010

Intensive experiences show and confirm that grid environments can be considered as the most promising way to solve several kinds of problems relating either to cooperative work especially where involved collaborators are dispersed geographically or to some very greedy applications which require enough power of computing or/and storage. Such environments can be classified into two categories; first, dedicated grids where the federated computers are solely devoted to a specific work through its end. Second, Volunteer grids where federated computers are not completely devoted to a specific work but instead they can be randomly and intermittently used, at the same time, for any other purpose or they can be connected or disconnected at will by their owners without any prior notification. Each category of grids includes surely several advantages and disadvantages; nevertheless, we think that volunteer grids are very promising and more convenient especially to build a general multipurpose distributed scalable environment. Unfortunately, the big challenge of such environments is, however, security and trust. Indeed, owing to the fact that every federated computer in such an environment can randomly be used at the same time by several users or can be disconnected suddenly, several security problems will automatically arise. In this paper, we propose a novel solution based on identity federation, agent technology and the dynamic enforcement of access control policies that lead to the design and implementation of trusted volunteer grid environments.
A Powerful Optimization Approach for the Multi Channel Dissemination Networks
Venue: arXiv cs.NI 2010
Year: 2010

In the wireless environment, dissemination techniques may improve data access for the users. In this paper, we show a description of dissemination architecture that fits the overall telecommunication network. This architecture is designed to provide efficient data access and power saving for the mobile units. A concurrency control approach, MCD, is suggested for data consistency and conflict checking. A performance study shows that the power consumption, space overhead, and response time associated with MCD is far less than other previous techniques.
Monomial-like codes
Venue: arXiv cs.IT 2010
Year: 2010

As a generalization of cyclic codes of length p^s over F_{p^a}, we study n-dimensional cyclic codes of length p^{s_1} X ... X p^{s_n} over F_{p^a} generated by a single "monomial". Namely, we study multi-variable cyclic codes of the form <(x_1 - 1)^{i_1} ... (x_n - 1)^{i_n}> in F_{p^a}[x_1...x_n] / < x_1^{p^{s_1}}-1, ..., x_n^{p^{s_n}}-1 >. We call such codes monomial-like codes. We show that these codes arise from the product of certain single variable codes and we determine their minimum Hamming distance. We determine the dual of monomial-like codes yielding a parity check matrix. We also present an alternative way of constructing a parity check matrix using the Hasse derivative. We study the weight hierarchy of certain monomial like codes. We simplify an expression that gives us the weight hierarchy of these codes.
On the Degrees of Freedom Regions of Two-User MIMO Z and Full Interference Channels with Reconfigurable Antennas
Venue: arXiv cs.IT 2010
Year: 2010

We study the degrees of freedom (DoF) regions of two-user multiple-input multiple-output (MIMO) Z and full interference channels in this paper. We assume that the receivers always have perfect channel state information. We derive the DoF region of Z interference channel with channel state information at transmitter (CSIT). For full interference channel without CSIT, the DoF region has been obtained in previous work except for a special case M1< N1<min(M2,N2), where M_i and N_i are the number of transmit and receive antennas of user i, respectively. We show that for this case the DoF regions of the Z and full interference channels are the same. We establish the achievability based on the assumption of transmitter antenna mode switching. A systematic way of constructing the DoF-achieving nulling and beamforming matrices is presented in this paper.
Performance Analysis of Ultra Wideband Receivers for High Data Rate Wireless Personal Area Network System
Venue: arXiv cs.NI 2010
Year: 2010

For high data rate ultra wideband communication system, performance comparison of Rake, MMSE and Rake-MMSE receivers is attempted in this paper. Further a detail study on Rake-MMSE time domain equalizers is carried out taking into account all the important parameters such as the effect of the number of Rake fingers and equalizer taps on the error rate performance. This receiver combats inter-symbol interference by taking advantages of both the Rake and equalizer structure. The bit error rate performances are investigated using MATLAB simulation on IEEE 802.15.3a defined UWB channel models. Simulation results show that the bit error rate probability of Rake-MMSE receiver is much better than Rake receiver and MMSE equalizer. Study on non-line of sight indoor channel models illustrates that bit error rate performance of Rake-MMSE (both LE and DFE) improves for CM3 model with smaller spread compared to CM4 channel model. It is indicated that for a MMSE equalizer operating at low to medium SNR values, the number of Rake fingers is the dominant factor to improve system performance, while at high SNR values the number of equalizer taps plays a more significant role in reducing the error rate.
Secure Key Exchange and Encryption Mechanism for Group Communication in Wireless Ad Hoc Networks
Venue: arXiv cs.NI 2010
Year: 2010

Secured communication in ad hoc wireless networks is primarily important, because the communication signals are openly available as they propagate through air and are more susceptible to attacks ranging from passive eavesdropping to active interfering. The lack of any central coordination and shared wireless medium makes them more vulnerable to attacks than wired networks. Nodes act both as hosts and routers and are interconnected by Multi- hop communication path for forwarding and receiving packets to/from other nodes. The objective of this paper is to propose a key exchange and encryption mechanism that aims to use the MAC address as an additional parameter as the message specific key[to encrypt]and forward data among the nodes. The nodes are organized in spanning tree fashion, as they avoid forming cycles and exchange of key occurs only with authenticated neighbors in ad hoc networks, where nodes join or leave the network dynamically.
On a variant of Monotone NAE-3SAT and the Triangle-Free Cut problem
Venue: arXiv cs.CC 2010
Year: 2010

In this paper we define a restricted version of Monotone NAE-3SAT and show that it remains NP-Complete even under that restriction. We expect this result would be useful in proving NP-Completeness results for problems on $k$-colourable graphs ($k \ge 5$). We also prove the NP-Completeness of the Triangle-Free Cut problem.