OpenRaiser/Intern-Atlas huggingface dataset:
Design of Optimal Topology of Satellite-Based Terrestrial Communication Networks
Venue: arXiv cs.NI 2010
Year: 2010

Topological design of terrestrial networks for communication via satellites is studied in the paper. Quantitative model of the network cost-analysis minimizing the total transmission and switching cost is described. Several algorithms solving combinatorial problem of the optimal topology design based on binary partitioning, a minimax parametric search and dynamic programming are developed by the author and demonstrated with a numeric example. Analysis of average complexity of the minimax parametric search algorithm is also provided.
Performance Comparisions of ICA Algorithms to DS-CDMA Detection
Venue: arXiv cs.NI 2010
Year: 2010

Commercial cellular networks, like the systems based on DS-CDMA, face many types of interferences such as multi-user interference inside each sector in a cell to interoperate interference. Independent Component Analysis (ICA) has been used as an advanced preprocessing tool for blind suppression of interfering signals in DS-CDMA communication systems. The role of ICA is to provide an interference-mitigated signal to the conventional detection. This paper evaluates the performance of some major ICA algorithms like Cardoso's joint approximate diagonalization of eigen matrices (JADE), Hyvarinen's fixed point algorithm and Comon's algorithm to solve the symbol estimation problem of the multi users in a DSCDMA communication system. The main focus is on blind separation of convolved CDMA mixture and the improvement of the downlink symbol estimation. The results of numerical experiment are compared with those obtained by the Single User Detection (SUD) receiver, ICA detector and combined SUD-ICA detector.
FPGA Based Sinusoidal Pulse Width Modulated Waveform Generation for Solar (PV) Rural Home Power Inverter
Venue: arXiv cs.OH 2010
Year: 2010

With the increasing concern about global environmental protection and energy demand due to rapid growth of population in developing countries and the diminishing trend of resources of conventional grid supply, the need to produce freely available pollution free natural energy such as solar/wind energy has been drawing increasing interest in every corner of the world. In an effort to utilize these energies effectively through Power converter, a great deal of research is being carried out by different researchers / scientist and engineers at different places in the world to meet the increasing demand of load. The study presents methodology to integrate solar (PV) energy (which is freely available in every corner of the world) with grid source and supplement the existing grid power in rural houses during its cut off or restricted supply period. In order to get consistency in supply a DG is also added as a standby source in the proposed integration of network. The software using novel Direct PWM modulation strategy and its soft control features extend the flexibility to control converter (inverter) parameters like voltage, frequency, number of samples of PWM pulses constituting sine-wave without changing any hardware configuration in the circuit. The system simulation of PWM Pulse generation has been done on a XILINX based FPGA Spartan 3E board using VHDL code. The test on simulation of PWM generation program after synthesis and compilation were recorded and verified on a prototype sample.
The Role of the XBRL Standard in Optimizing the Financial Reporting
Venue: arXiv cs.OH 2010
Year: 2010

When the financial information is difficult to produce, interpret, compare and analyze, we are put in the situation to face inconvenient consequences with negative repercussions, such as: the investor can give up the investment (with negative consequences on the risk equity market), the banks may not give loans, an auditor may not consider the financial statements as being credible etc. These facts allow the introduction of this paper's main objective, the eXtensible Business Reporting Language (XBRL) which is an open standard, independent and international for the treatments, opportunity, correctness, efficiency and minor costs of the financial and economical information. The XBRL will be analyzed in the second part of the paper, the history of this electronic communication language will be described, as there will also be described the promoting organizations, the base technology (the WEB and XML architecture which will be the next stage of the internet programming), and the role it has within the chain of reporting between the XBRL consortium and the international accounting organizations IASB-CI. This taxonomy serves clearly every accounting and extra- accounting information made by the company. This information which is treated in present by resorting to various formats or structures (most times incompatible between them and the owners) will be standardized with the XBRL.
Handwritten Bangla Basic and Compound character recognition using MLP and SVM classifier
Venue: arXiv cs.CV 2010
Year: 2010

A novel approach for recognition of handwritten compound Bangla characters, along with the Basic characters of Bangla alphabet, is presented here. Compared to English like Roman script, one of the major stumbling blocks in Optical Character Recognition (OCR) of handwritten Bangla script is the large number of complex shaped character classes of Bangla alphabet. In addition to 50 basic character classes, there are nearly 160 complex shaped compound character classes in Bangla alphabet. Dealing with such a large varieties of handwritten characters with a suitably designed feature set is a challenging problem. Uncertainty and imprecision are inherent in handwritten script. Moreover, such a large varieties of complex shaped characters, some of which have close resemblance, makes the problem of OCR of handwritten Bangla characters more difficult. Considering the complexity of the problem, the present approach makes an attempt to identify compound character classes from most frequently to less frequently occurred ones, i.e., in order of importance. This is to develop a frame work for incrementally increasing the number of learned classes of compound characters from more frequently occurred ones to less frequently occurred ones along with Basic characters. On experimentation, the technique is observed produce an average recognition rate of 79.25 after three fold cross validation of data with future scope of improvement and extension.
Supervised Classification Performance of Multispectral Images
Venue: arXiv cs.LG 2010
Year: 2010

Nowadays government and private agencies use remote sensing imagery for a wide range of applications from military applications to farm development. The images may be a panchromatic, multispectral, hyperspectral or even ultraspectral of terra bytes. Remote sensing image classification is one amongst the most significant application worlds for remote sensing. A few number of image classification algorithms have proved good precision in classifying remote sensing data. But, of late, due to the increasing spatiotemporal dimensions of the remote sensing data, traditional classification algorithms have exposed weaknesses necessitating further research in the field of remote sensing image classification. So an efficient classifier is needed to classify the remote sensing images to extract information. We are experimenting with both supervised and unsupervised classification. Here we compare the different classification methods and their performances. It is found that Mahalanobis classifier performed the best in our classification.
Optimization Digital Image Watermarking Technique for Patent Protection
Venue: arXiv cs.MM 2010
Year: 2010

The rapid development of multimedia and internet allows for wide distribution of digital media data. It becomes much easier to edit, modify and duplicate digital information besides that, digital documents are also easy to copy and distribute, therefore it will be faced by many threats. It is a big security and privacy issue. Another problem with digital document and video is that undetectable modifications can be made with very simple and widely available equipment, which put the digital material for evidential purposes under question With the large flood of information and the development of the digital format, it become necessary to find appropriate protection because of the significance, accuracy and sensitivity of the information, therefore multimedia technology and popularity of internet communications they have great interest in using digital watermarks for the purpose of copy protection and content authentication. Digital watermarking is a technique used to embed a known piece of digital data within another piece of digital data .A digital data may represent a digital signature or digital watermark that is embedded in the host media. The signature or watermark is hidden such that it's perceptually and statistically undetectable. Then this signature or watermark can be extracted from the host media and used to identify the owner of the media.
Modelling and Analysis of Biochemical Signalling Pathway Cross-talk
Venue: arXiv cs.CE 2010
Year: 2010

Signalling pathways are abstractions that help life scientists structure the coordination of cellular activity. Cross-talk between pathways accounts for many of the complex behaviours exhibited by signalling pathways and is often critical in producing the correct signal-response relationship. Formal models of signalling pathways and cross-talk in particular can aid understanding and drive experimentation. We define an approach to modelling based on the concept that a pathway is the (synchronising) parallel composition of instances of generic modules (with internal and external labels). Pathways are then composed by (synchronising) parallel composition and renaming; different types of cross-talk result from different combinations of synchronisation and renaming. We define a number of generic modules in PRISM and five types of cross-talk: signal flow, substrate availability, receptor function, gene expression and intracellular communication. We show that Continuous Stochastic Logic properties can both detect and distinguish the types of cross-talk. The approach is illustrated with small examples and an analysis of the cross-talk between the TGF-b/BMP, WNT and MAPK pathways.
A Taxonomy of Causality-Based Biological Properties
Venue: arXiv cs.CE 2010
Year: 2010

We formally characterize a set of causality-based properties of metabolic networks. This set of properties aims at making precise several notions on the production of metabolites, which are familiar in the biologists' terminology. From a theoretical point of view, biochemical reactions are abstractly represented as causal implications and the produced metabolites as causal consequences of the implication representing the corresponding reaction. The fact that a reactant is produced is represented by means of the chain of reactions that have made it exist. Such representation abstracts away from quantities, stoichiometric and thermodynamic parameters and constitutes the basis for the characterization of our properties. Moreover, we propose an effective method for verifying our properties based on an abstract model of system dynamics. This consists of a new abstract semantics for the system seen as a concurrent network and expressed using the Chemical Ground Form calculus. We illustrate an application of this framework to a portion of a real metabolic pathway.
Lowering the Error Floor of LDPC Codes Using Cyclic Liftings
Venue: arXiv cs.IT 2010
Year: 2010

Cyclic liftings are proposed to lower the error floor of low-density parity-check (LDPC) codes. The liftings are designed to eliminate dominant trapping sets of the base code by removing the short cycles which form the trapping sets. We derive a necessary and sufficient condition for the cyclic permutations assigned to the edges of a cycle $c$ of length $\ell(c)$ in the base graph such that the inverse image of $c$ in the lifted graph consists of only cycles of length strictly larger than $\ell(c)$. The proposed method is universal in the sense that it can be applied to any LDPC code over any channel and for any iterative decoding algorithm. It also preserves important properties of the base code such as degree distributions, encoder and decoder structure, and in some cases, the code rate. The proposed method is applied to both structured and random codes over the binary symmetric channel (BSC). The error floor improves consistently by increasing the lifting degree, and the results show significant improvements in the error floor compared to the base code, a random code of the same degree distribution and block length, and a random lifting of the same degree. Similar improvements are also observed when the codes designed for the BSC are applied to the additive white Gaussian noise (AWGN) channel.
Mining Statistically Significant Substrings Based on the Chi-Square Measure
Venue: arXiv cs.DB 2010
Year: 2010

Given the vast reservoirs of data stored worldwide, efficient mining of data from a large information store has emerged as a great challenge. Many databases like that of intrusion detection systems, web-click records, player statistics, texts, proteins etc., store strings or sequences. Searching for an unusual pattern within such long strings of data has emerged as a requirement for diverse applications. Given a string, the problem then is to identify the substrings that differs the most from the expected or normal behavior, i.e., the substrings that are statistically significant. In other words, these substrings are less likely to occur due to chance alone and may point to some interesting information or phenomenon that warrants further exploration. To this end, we use the chi-square measure. We propose two heuristics for retrieving the top-k substrings with the largest chi-square measure. We show that the algorithms outperform other competing algorithms in the runtime, while maintaining a high approximation ratio of more than 0.96.
CLD-shaped Brushstrokes in Non-Photorealistic Rendering
Venue: arXiv cs.CV 2010
Year: 2010

Rendering techniques based on a random grid can be improved by adapting brushstrokes to the shape of different areas of the original picture. In this paper, the concept of Coherence Length Diagram is applied to determine the adaptive brushstrokes, in order to simulate an impressionist painting. Some examples are provided to instance the proposed algorithm.
Extended gcd of quadratic integers
Venue: arXiv cs.DM 2010
Year: 2010

Computation of the extended gcd of two quadratic integers. The ring of integers considered is principal but could be euclidean or not euclidean ring. This method rely on principal ideal ring and reduction of binary quadratic forms.
A Novel Scheme for Secured Data Transfer Over Computer Networks
Venue: arXiv cs.CR 2010
Year: 2010

This paper presents a novel encryption-less algorithm to enhance security in transmission of data in networks. The algorithm uses an intuitively simple idea of a "jigsaw puzzle" to break the transformed data into multiple parts where these parts form the pieces of the puzzle. Then these parts are packaged into packets and sent to the receiver. A secure and efficient mechanism is provided to convey the information that is necessary for obtaining the original data at the receiver-end from its parts in the packets, that is, for solving the "jigsaw puzzle". The algorithm is designed to provide information-theoretic (that is, unconditional) security by the use of a one-time pad like scheme so that no intermediate or unintended node can obtain the entire data. A parallelizable design has been adopted for the implementation. An authentication code is also used to ensure authenticity of every packet.
Interference Alignment for the Multi-Antenna Compound Wiretap Channel
Venue: arXiv cs.IT 2010
Year: 2010

We study a wiretap channel model where the sender has $M$ transmit antennas and there are two groups consisting of $J_1$ and $J_2$ receivers respectively. Each receiver has a single antenna. We consider two scenarios. First we consider the compound wiretap model -- group 1 constitutes the set of legitimate receivers, all interested in a common message, whereas group 2 is the set of eavesdroppers. We establish new lower and upper bounds on the secure degrees of freedom. Our lower bound is based on the recently proposed \emph{real interference alignment} scheme. The upper bound provides the first known example which illustrates that the \emph{pairwise upper bound} used in earlier works is not tight. The second scenario we study is the compound private broadcast channel. Each group is interested in a message that must be protected from the other group. Upper and lower bounds on the degrees of freedom are developed by extending the results on the compound wiretap channel.
Atomicity Improvement for Elliptic Curve Scalar Multiplication
Venue: arXiv cs.CR 2010
Year: 2010

In this paper we address the problem of protecting elliptic curve scalar multiplication implementations against side-channel analysis by using the atomicity principle. First of all we reexamine classical assumptions made by scalar multiplication designers and we point out that some of them are not relevant in the context of embedded devices. We then describe the state-of-the-art of atomic scalar multiplication and propose an atomic pattern improvement method. Compared to the most efficient atomic scalar multiplication published so far, our technique shows an average improvement of up to 10.6%.
Low-complexity Fusion Filtering for Continuous-Discrete Systems
Venue: arXiv cs.OH 2010
Year: 2010

In this paper, low-complexity distributed fusion filtering algorithm for mixed continuous-discrete multisensory dynamic systems is proposed. To implement the algorithm a new recursive equations for local cross-covariances are derived. To achieve an effective fusion filtering the covariance intersection (CI) algorithm is used. The CI algorithm is useful due to its low-computational complexity for calculation of a big number of cross-covariances between local estimates and matrix weights. Theoretical and numerical examples demonstrate the effectiveness of the covariance intersection algorithm in distributed fusion filtering.
On the order bounds for one-point AG codes
Venue: arXiv cs.IT 2010
Year: 2010

The order bound for the minimum distance of algebraic geometry codes was originally defined for the duals of one-point codes and later generalized for arbitrary algebraic geometry codes. Another bound of order type for the minimum distance of general linear codes, and for codes from order domains in particular, was given in [H. Andersen and O. Geil, Evaluation codes from order domain theory, Finite Fields and their Applications 14 (2008), pp. 92-123]. Here we investigate in detail the application of that bound to one-point algebraic geometry codes, obtaining a bound $d^*$ for the minimum distance of these codes. We establish a connection between $d^*$ and the order bound and its generalizations. We also study the improved code constructions based on $d^*$. Finally we extend $d^*$ to all generalized Hamming weights.
Triangular Decomposition of Semi-algebraic Systems
Venue: arXiv cs.SC 2010
Year: 2010

Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations of these tools focusing on solutions of the real analogue: semi-algebraic systems. We show that any such system can be decomposed into finitely many {\em regular semi-algebraic systems}. We propose two specifications of such a decomposition and present corresponding algorithms. Under some assumptions, one type of decomposition can be computed in singly exponential time w.r.t.\ the number of variables. We implement our algorithms and the experimental results illustrate their effectiveness.
A Concrete Representation of Observational Equivalence for PCF
Venue: arXiv cs.LO 2010
Year: 2010

The full abstraction result for PCF using game semantics requires one to identify all innocent strategies that are innocently indistinguishable. This involves a quantification over all innocent tests, cf. quantification over all innocent contexts. Here we present a representation of innocent strategies that equates innocently indistinguishable ones, yielding a representation of PCF terms that equates precisely those terms that are observational equivalent.
Outage Probability of General Ad Hoc Networks in the High-Reliability Regime
Venue: arXiv cs.IT 2010
Year: 2010

Outage probabilities in wireless networks depend on various factors: the node distribution, the MAC scheme, and the models for path loss, fading and transmission success. In prior work on outage characterization for networks with randomly placed nodes, most of the emphasis was put on networks whose nodes are Poisson distributed and where ALOHA is used as the MAC protocol. In this paper we provide a general framework for the analysis of outage probabilities in the high-reliability regime. The outage probability characterization is based on two parameters: the intrinsic spatial contention $γ$ of the network, introduced in [1], and the coordination level achieved by the MAC as measured by the interference scaling exponent $κ$ introduced in this paper. We study outage probabilities under the signal-to-interference ratio (SIR) model, Rayleigh fading, and power-law path loss, and explain how the two parameters depend on the network model. The main result is that the outage probability approaches $γη^κ$ as the density of interferers $η$ goes to zero, and that $κ$ assumes values in the range $1\leq κ\leq α/2$ for all practical MAC protocols, where $α$ is the path loss exponent. This asymptotic expression is valid for all motion-invariant point processes. We suggest a novel and complete taxonomy of MAC protocols based mainly on the value of $κ$. Finally, our findings suggest a conjecture that tightly bounds the outage probability for all interferer densities.
libtissue - implementing innate immunity
Venue: arXiv cs.AI 2010
Year: 2010

In a previous paper the authors argued the case for incorporating ideas from innate immunity into articficial immune systems (AISs) and presented an outline for a conceptual framework for such systems. A number of key general properties observed in the biological innate and adaptive immune systems were hughlighted, and how such properties might be instantiated in artificial systems was discussed in detail. The next logical step is to take these ideas and build a software system with which AISs with these properties can be implemented and experimentally evaluated. This paper reports on the results of that step - the libtissue system.
Exploration Of The Dendritic Cell Algorithm Using The Duration Calculus
Venue: arXiv cs.AI 2010
Year: 2010

As one of the newest members in Artificial Immune Systems (AIS), the Dendritic Cell Algorithm (DCA) has been applied to a range of problems. These applications mainly belong to the field of anomaly detection. However, real-time detection, a new challenge to anomaly detection, requires improvement on the real-time capability of the DCA. To assess such capability, formal methods in the research of rea-time systems can be employed. The findings of the assessment can provide guideline for the future development of the algorithm. Therefore, in this paper we use an interval logic based method, named the Duration Calculus (DC), to specify a simplified single-cell model of the DCA. Based on the DC specifications with further induction, we find that each individual cell in the DCA can perform its function as a detector in real-time. Since the DCA can be seen as many such cells operating in parallel, it is potentially capable of performing real-time detection. However, the analysis process of the standard DCA constricts its real-time capability. As a result, we conclude that the analysis process of the standard DCA should be replaced by a real-time analysis component, which can perform periodic analysis for the purpose of real-time detection.