OpenRaiser/Intern-Atlas huggingface dataset:
SABRE: A Tool for Stochastic Analysis of Biochemical Reaction Networks
Venue: arXiv cs.CE 2010
Year: 2010

The importance of stochasticity within biological systems has been shown repeatedly during the last years and has raised the need for efficient stochastic tools. We present SABRE, a tool for stochastic analysis of biochemical reaction networks. SABRE implements fast adaptive uniformization (FAU), a direct numerical approximation algorithm for computing transient solutions of biochemical reaction networks. Biochemical reactions networks represent biological systems studied at a molecular level and these reactions can be modeled as transitions of a Markov chain. SABRE accepts as input the formalism of guarded commands, which it interprets either as continuous-time or as discrete-time Markov chains. Besides operating in a stochastic mode, SABRE may also perform a deterministic analysis by directly computing a mean-field approximation of the system under study. We illustrate the different functionalities of SABRE by means of biological case studies.
Hierarchical and Nonhierarchical Three-Dimensional Underwater Wireless Sensor Networks
Venue: arXiv cs.NI 2010
Year: 2010

In some underwater sensor networks, sensor nodes may be deployed at various depths of an ocean making those networks three-dimensional (3D). While most terrestrial sensor networks can usually be modeled as two dimensional (2D) networks, these underwater sensor networks must be modeled as 3D networks. This leads to new research challenges in the area of network architecture and topology. In this paper, we present two different network architectures for 3D underwater sensor networks. The first one is a hierarchical architecture that uses a relatively small number of robust backbone nodes to create the network where a large number of inexpensive sensors communicate with their nearest backbone nodes, and packets from a backbone node to the sink is routed through other backbone nodes. This hierarchical approach allows creating a network of smaller number of expensive backbone nodes while keeping the mobile sensors simple and inexpensive. Along with network topology, we also study energy efficiency and frequency reuse issues for such 3D networks. The second approach is a nonhierarchical architecture which assumes that all nodes are identical and randomly deployed. It partitions the whole 3D network space into identical cells and keeps one node active in each cell such that sensing coverage and connectivity are maintained while limiting the energy consumed. We also study closeness to optimality of our proposed scheme.
Stimulating Cooperation in Self-Organized Vehicular Networks
Venue: arXiv cs.CR 2010
Year: 2010

A Vehicular Ad-hoc NETwork (VANET) is a special form of Mobile Ad-hoc Network designed to provide communications among nearby vehicles and between vehicles and nearby fixed roadside equipment. Its main goal is to improve safety and comfort for passengers, but it can also be used for commercial applications. In this latter case, it will be necessary to motivate drivers to cooperate and contribute to packet forwarding in Vehicle-to-Vehicle and Vehicle-to-Roadside communications. This paper examines the problem, analyzes the drawbacks of known schemes and proposes a new secure incentive scheme to stimulate cooperation in VANETs, taking into account factors such as time and distance.
Feedback Capacity of the Gaussian Interference Channel to within 2 Bits
Venue: arXiv cs.IT 2010
Year: 2010

We characterize the capacity region to within 2 bits/s/Hz and the symmetric capacity to within 1 bit/s/Hz for the two-user Gaussian interference channel (IC) with feedback. We develop achievable schemes and derive a new outer bound to arrive at this conclusion. One consequence of the result is that feedback provides multiplicative gain, i.e., the gain becomes arbitrarily large for certain channel parameters. It is a surprising result because feedback has been so far known to provide no gain in memoryless point-to-point channels and only bounded additive gain in multiple access channels. The gain comes from using feedback to maximize resource utilization, thereby enabling more efficient resource sharing between the interfering users. The result makes use of a deterministic model to provide insights into the Gaussian channel. This deterministic model is a special case of El Gamal-Costa deterministic model and as a side-generalization, we establish the exact feedback capacity region of this general class of deterministic ICs.
Learning Kernel-Based Halfspaces with the Zero-One Loss
Venue: arXiv cs.LG 2010
Year: 2010

We describe and analyze a new algorithm for agnostically learning kernel-based halfspaces with respect to the \emph{zero-one} loss function. Unlike most previous formulations which rely on surrogate convex loss functions (e.g. hinge-loss in SVM and log-loss in logistic regression), we provide finite time/sample guarantees with respect to the more natural zero-one loss function. The proposed algorithm can learn kernel-based halfspaces in worst-case time $\poly(\exp(L\log(L/ε)))$, for $\emph{any}$ distribution, where $L$ is a Lipschitz constant (which can be thought of as the reciprocal of the margin), and the learned classifier is worse than the optimal halfspace by at most $ε$. We also prove a hardness result, showing that under a certain cryptographic assumption, no algorithm can learn kernel-based halfspaces in time polynomial in $L$.
Behavioral Simulations in MapReduce
Venue: arXiv cs.DB 2010
Year: 2010

In many scientific domains, researchers are turning to large-scale behavioral simulations to better understand important real-world phenomena. While there has been a great deal of work on simulation tools from the high-performance computing community, behavioral simulations remain challenging to program and automatically scale in parallel environments. In this paper we present BRACE (Big Red Agent-based Computation Engine), which extends the MapReduce framework to process these simulations efficiently across a cluster. We can leverage spatial locality to treat behavioral simulations as iterated spatial joins and greatly reduce the communication between nodes. In our experiments we achieve nearly linear scale-up on several realistic simulations. Though processing behavioral simulations in parallel as iterated spatial joins can be very efficient, it can be much simpler for the domain scientists to program the behavior of a single agent. Furthermore, many simulations include a considerable amount of complex computation and message passing between agents, which makes it important to optimize the performance of a single node and the communication across nodes. To address both of these challenges, BRACE includes a high-level language called BRASIL (the Big Red Agent SImulation Language). BRASIL has object oriented features for programming simulations, but can be compiled to a data-flow representation for automatic parallelization and optimization. We show that by using various optimization techniques, we can achieve both scalability and single-node performance similar to that of a hand-coded simulation.
Morphonette: a morphological network of French
Venue: arXiv cs.CL 2010
Year: 2010

This paper describes in details the first version of Morphonette, a new French morphological resource and a new radically lexeme-based method of morphological analysis. This research is grounded in a paradigmatic conception of derivational morphology where the morphological structure is a structure of the entire lexicon and not one of the individual words it contains. The discovery of this structure relies on a measure of morphological similarity between words, on formal analogy and on the properties of two morphological paradigms:
A Prioritized Access Point Algorithm for 802.11b Networks in a Lossy Environment
Venue: arXiv cs.NI 2010
Year: 2010

In recent years, WLAN technology has been gaining popularity around the world with its sub standard 802.11b receiving major deployments in many indoor and outdoor environments. In this article we investigate the performance of IEEE 802.11b infrastructure networks in the lossless and lossy environments by means of a simulation study. Also, this study shows how the FIFO discipline of the 802.11b MAC affects on the global performance when at least one channel is under the influence of the bursty errors. Furthermore, this paper proposes a channel aware backoff algorithm for the Access Point (AP) to prioritize its transmissions and to accelerate the transmissions in the poor radio channels to enhance the performance of the real time applications. The final results of this simulation study showed that the proposed algorithm is able to enhance the throughput and the delay in lossy environment by an average of 49% and 83% respectively.
A Soft Computing Model for Physicians' Decision Process
Venue: arXiv cs.AI 2010
Year: 2010

In this paper the author presents a kind of Soft Computing Technique, mainly an application of fuzzy set theory of Prof. Zadeh [16], on a problem of Medical Experts Systems. The choosen problem is on design of a physician's decision model which can take crisp as well as fuzzy data as input, unlike the traditional models. The author presents a mathematical model based on fuzzy set theory for physician aided evaluation of a complete representation of information emanating from the initial interview including patient past history, present symptoms, and signs observed upon physical examination and results of clinical and diagnostic tests.
Scope of cloud computing for SMEs in India
Venue: arXiv cs.CY 2010
Year: 2010

Cloud computing is a set of services that provide infrastructure resources using internet media and data storage on a third party server. SMEs are said to be the lifeblood of any vibrant economy. They are known to be the silent drivers of a nation's economy. SMEs of India are one of the most aggressive adopters of ERP Packages. Most of the Indian SMEs have adopted the traditional ERP Systems and have incurred a heavy cost while implementing these systems. This paper presents the cost savings and reduction in the level of difficulty in adopting a cloud computing Service (CCS) enabled ERP system. For the study, IT people from 30 North Indian SMEs were interviewed. In the cloud computing environment the SMEs will not have to own the infrastructure so they can abstain from any capital expenditure and instead they can utilize the resources as a service and pay as per their usage. We consider the results of the paper to be supportive to our proposed research concept.
Reduction of Feature Vectors Using Rough Set Theory for Human Face Recognition
Venue: arXiv cs.CV 2010
Year: 2010

In this paper we describe a procedure to reduce the size of the input feature vector. A complex pattern recognition problem like face recognition involves huge dimension of input feature vector. To reduce that dimension here we have used eigenspace projection (also called as Principal Component Analysis), which is basically transformation of space. To reduce further we have applied feature selection method to select indispensable features, which will remain in the final feature vectors. Features those are not selected are removed from the final feature vector considering them as redundant or superfluous. For selection of features we have used the concept of reduct and core from rough set theory. This method has shown very good performance. It is worth to mention that in some cases the recognition rate increases with the decrease in the feature vector dimension.
An Optimal-Time Construction of Euclidean Sparse Spanners with Tiny Diameter
Venue: arXiv cs.CG 2010
Year: 2010

In STOC'95 \cite{ADMSS95} Arya et al.\ showed that for any set of $n$ points in $\mathbb R^d$, a $(1+ε)$-spanner with diameter at most 2 (respectively, 3) and $O(n \log n)$ edges (resp., $O(n \log \log n)$ edges) can be built in $O(n \log n)$ time. Moreover, it was shown in \cite{ADMSS95,NS07} that for any $k \ge 4$, one can build in $O(n (\log n) 2^k α_k(n))$ time a $(1+ε)$-spanner with diameter at most $2k$ and $O(n 2^k α_k(n))$ edges. The function $α_k$ is the inverse of a certain function at the $\lfloor k/2 \rfloor$th level of the primitive recursive hierarchy, where $α_0(n) = \lceil n/2 \rceil, α_1(n) = \left\lceil \sqrt{n} \right\rceil, α_2(n) = \lceil \log{n} \rceil, α_3(n) = \lceil \log\log{n} \rceil, α_4(n) = \log^* n$, \ldots, etc. It is also known \cite{NS07} that if one allows quadratic time then these bounds can be improved. Specifically, for any $k \ge 4$, a $(1+ε)$-spanner with diameter at most $k$ and $O(n k α_k(n))$ edges can be constructed in $O(n^2)$ time \cite{NS07}. A major open problem in this area is whether one can construct within time $O(n \log n + n k α_k(n))$ a $(1+ε)$-spanner with diameter at most $k$ and $O(n k α_k(n))$ edges. In this paper we answer this question in the affirmative. Moreover, in fact, we provide a stronger result. Specifically, we show that for any $k \ge 4$, a $(1+ε)$-spanner with diameter at most $k$ and $O(n α_k(n))$ edges can be built in optimal time $O(n \log n)$. The tradeoff between the diameter and number of edges of our spanners is tight up to constant factors in the entire range of parameters.
E-Speed Governors For Public Transport Vehicles
Venue: arXiv cs.OH 2010
Year: 2010

An accident is unexpected, unusual, unintended and identifiable external event which occurs at any place and at any time. The major concern faced by the government and traffic officials is over speeding at limited speed zones like hospitals, schools or residential places leading to causalities and more deaths on the roads. Hence the speed of the vehicles is to be regulated and confined to the limits as prescribed by the traffic regulations. In this paper we propose a solution in the form of providing E-speed governor fitted with a wireless communication system consisting of a Rx which receives the information regarding the speed regulation for their zones. The TX will be made highly intelligent and decide when receiver should be made active to regulate the speed and unwarranted honking from the vehicles which can be deactivated in the silent zones.
A model for semantic integration of business components
Venue: arXiv cs.SE 2010
Year: 2010

Today, reusable components are available in several repositories. These last are certainly conceived for the reusing However, this re-use is not immediate; it requires, in the fact, to pass through some essential conceptual operations, among them in particular, research, integration, adaptation, and composition. We are interested in the present work to the problem of semantic integration of heterogeneous Business Components. This problem is often put in syntactical terms, while the real stake is of semantic order. Our contribution concerns a model proposal for Business components integration as well as resolution method of semantic naming conflicts, met during the integration of Business Components.
A Proof Theoretic Analysis of Intruder Theories
Venue: arXiv cs.LO 2010
Year: 2010

We consider the problem of intruder deduction in security protocol analysis: that is, deciding whether a given message M can be deduced from a set of messages Gamma under the theory of blind signatures and arbitrary convergent equational theories modulo associativity and commutativity (AC) of certain binary operators. The traditional formulations of intruder deduction are usually given in natural-deduction-like systems and proving decidability requires significant effort in showing that the rules are "local" in some sense. By using the well-known translation between natural deduction and sequent calculus, we recast the intruder deduction problem as proof search in sequent calculus, in which locality is immediate. Using standard proof theoretic methods, such as permutability of rules and cut elimination, we show that the intruder deduction problem can be reduced, in polynomial time, to the elementary deduction problem, which amounts to solving certain equations in the underlying individual equational theories. We show that this result extends to combinations of disjoint AC-convergent theories whereby the decidability of intruder deduction under the combined theory reduces to the decidability of elementary deduction in each constituent theory. To further demonstrate the utility of the sequent-based approach, we show that, for Dolev-Yao intruders, our sequent-based techniques can be used to solve the more difficult problem of solving deducibility constraints, where the sequents to be deduced may contain gaps (or variables) representing possible messages the intruder may produce.
Effective Query Retrieval System In Mobile Business Environment
Venue: arXiv cs.OH 2010
Year: 2010

Web Based Query Management System (WBQMS) is a methodology to design and to implement Mobile Business, in which a server is the gateway to connect databases with clients which sends requests and receives responses in a distributive manner. The gateway, which communicates with mobile phone via GSM Modem, receives the coded queries from users and sends packed results back. The software which communicates with the gateway system via SHORT MESSAGE, packs users' requests, IDs and codes, and sends the package to the gateway; then interprets the packed data for the users to read on a page of GUI. Whenever and wherever they are, the customer can query the information by sending messages through the client device which may be mobile phone or PC. The mobile clients can get the appropriate services through the mobile business architecture in distributed environment. The messages are secured through the client side encoding mechanism to avoid the intruders. The gateway system is programmed by Java, while the software at clients by J2ME and the database is created by Oracle for reliable and interoperable services.
Succinct Representations of Dynamic Strings
Venue: arXiv cs.DS 2010
Year: 2010

The rank and select operations over a string of length n from an alphabet of size $σ$ have been used widely in the design of succinct data structures. In many applications, the string itself need be maintained dynamically, allowing characters of the string to be inserted and deleted. Under the word RAM model with word size $w=Ω(\lg n)$, we design a succinct representation of dynamic strings using $nH_0 + o(n)\lgσ+ O(w)$ bits to support rank, select, insert and delete in $O(\frac{\lg n}{\lg\lg n}(\frac{\lg σ}{\lg\lg n}+1))$ time. When the alphabet size is small, i.e. when $σ= O(\polylog (n))$, including the case in which the string is a bit vector, these operations are supported in $O(\frac{\lg n}{\lg\lg n})$ time. Our data structures are more efficient than previous results on the same problem, and we have applied them to improve results on the design and construction of space-efficient text indexes.
Providing Scalable Data Services in Ubiquitous Networks
Venue: arXiv cs.DB 2010
Year: 2010

Topology is a fundamental part of a network that governs connectivity between nodes, the amount of data flow and the efficiency of data flow between nodes. In traditional networks, due to physical limitations, topology remains static for the course of the network operation. Ubiquitous data networks (UDNs), alternatively, are more adaptive and can be configured for changes in their topology. This flexibility in controlling their topology makes them very appealing and an attractive medium for supporting "anywhere, any place" communication. However, it raises the problem of designing a dynamic topology. The dynamic topology design problem is of particular interest to application service providers who need to provide cost-effective data services on a ubiquitous network. In this paper we describe algorithms that decide when and how the topology should be reconfigured in response to a change in the data communication requirements of the network. In particular, we describe and compare a greedy algorithm, which is often used for topology reconfiguration, with a non-greedy algorithm based on metrical task systems. Experiments show the algorithm based on metrical task system has comparable performance to the greedy algorithm at a much lower reconfiguration cost.
The Lambek-Grishin calculus is NP-complete
Venue: arXiv cs.CL 2010
Year: 2010

The Lambek-Grishin calculus LG is the symmetric extension of the non-associative Lambek calculus NL. In this paper we prove that the derivability problem for LG is NP-complete.
Automatic Modular Abstractions for Template Numerical Constraints
Venue: arXiv cs.LO 2010
Year: 2010

We propose a method for automatically generating abstract transformers for static analysis by abstract interpretation. The method focuses on linear constraints on programs operating on rational, real or floating-point variables and containing linear assignments and tests. Given the specification of an abstract domain, and a program block, our method automatically outputs an implementation of the corresponding abstract transformer. It is thus a form of program transformation. In addition to loop-free code, the same method also applies for obtaining least fixed points as functions of the precondition, which permits the analysis of loops and recursive functions. The motivation of our work is data-flow synchronous programming languages, used for building control-command embedded systems, but it also applies to imperative and functional programming. Our algorithms are based on quantifier elimination and symbolic manipulation techniques over linear arithmetic formulas. We also give less general results for nonlinear constraints and nonlinear program constructs.
Analog Matching of Colored Sources to Colored Channels
Venue: arXiv cs.IT 2010
Year: 2010

Analog (uncoded) transmission provides a simple and robust scheme for communicating a Gaussian source over a Gaussian channel under the mean squared error (MSE) distortion measure. Unfortunately, its performance is usually inferior to the all-digital, separation-based source-channel coding solution, which requires exact knowledge of the channel at the encoder. The loss comes from the fact that except for very special cases, e.g. white source and channel of matching bandwidth (BW), it is impossible to achieve perfect matching of source to channel and channel to source by linear means. We show that by combining prediction and modulo-lattice operations, it is possible to match any colored Gaussian source to any colored Gaussian noise channel (of possibly different BW), hence achieve Shannon's optimum attainable performance $R(D)=C$. Furthermore, when the source and channel BWs are equal (but otherwise their spectra are arbitrary), this scheme is asymptotically robust in the sense that for high signal-to-noise ratio a single encoder (independent of the noise variance) achieves the optimum performance. The derivation is based upon a recent modulo-lattice modulation scheme for transmitting a Wyner-Ziv source over a dirty-paper channel.
The Source-Normalized Impact per Paper (SNIP) is a valid and sophisticated indicator of journal citation impact
Venue: arXiv cs.DL 2010
Year: 2010

This paper is a reply to the article "Scopus's Source Normalized Impact per Paper (SNIP) versus a Journal Impact Factor based on Fractional Counting of Citations", published by Loet Leydesdorff and Tobias Opthof (arXiv:1004.3580v2 [cs.DL]). It clarifies the relationship between SNIP and Elsevier's Scopus. Since Leydesdorff and Opthof's description of SNIP is not complete, it indicates four key differences between SNIP and the indicator proposed by the two authors, and argues why the former is more valid than the latter. Nevertheless, the idea of fractional citation counting deserves further exploration. The paper discusses difficulties that arise if one attempts to apply this principle at the level of individual (citing) papers.