OpenRaiser/Intern-Atlas huggingface dataset:
Bounds on the Maximum Number of Concurrent Links in MIMO Ad Hoc Networks with QoS Constraints
Venue: arXiv cs.NI 2010
Year: 2010

Multiple-Input Multiple-Output (MIMO) based Medium Access Control (MAC) protocols have received a good deal of attention as researchers look to enhance overall performance of Ad Hoc networks by leveraging multi antenna enabled nodes. To date such MAC protocols have been evaluated through comparative simulation based studies that report on the number of concurrent links the protocol can support. However, a bound on the maximum number of concurrent links (MNCL) that a MIMO based MAC protocol should strive to achieve has hitherto been unavailable. In this paper we present a theoretical formulation for calculating the bound on the MNCL in a Mobile Ad Hoc Network (MANET) where the nodes have multiple antenna capability, while guaranteeing a minimum Quality of Service (QoS). In an attempt to make our findings as practical and realistic as possible, the study incorporates models for the following PHY layer and channel dependent elements: (a) path loss and fast fading effects, in order to accurately model adjacent link interference; (b) a Minimum Mean Squared Error (MMSE) based detector in the receiver which provides a balance between completely nulling of neighboring interference and hardware complexity. In calculating the bound on the MNCL our work also delivers the optimal power control solution for the network as well as the optimal link selection. The results are readily applicable to MIMO systems using Receive Diversity, Space Time Block Coding (STBC), and Transmit Beamforming and show that with a 4 element antenna system, as much as 3x improvement in the total number of concurrent links can be achieved relative to a SISO based network. The results also show diminishing improvement as the number of antennas is increased beyond 4, and the maximum allowable transmit power is increased beyond 10 dBm (for the simulated parameters).
The cooperative game theory foundations of network bargaining games
Venue: arXiv cs.GT 2010
Year: 2010

We study bargaining games between suppliers and manufacturers in a network context. Agents wish to enter into contracts in order to generate surplus which then must be divided among the participants. Potential contracts and their surplus are represented by weighted edges in our bipartite network. Each agent in the market is additionally limited by a capacity representing the number of contracts which he or she may undertake. When all agents are limited to just one contract each, prior research applied natural generalizations of the Nash bargaining solution to the networked setting, defined the new solution concepts of stable and balanced, and characterized the resulting bargaining outcomes. We simplify and generalize these results to a setting in which participants in only one side of the market are limited to one contract each. The heart of our results uses a linear-programming formulation to establish a novel connection between well-studied cooperative game theory concepts (such as core and prekernel) and the solution concepts of stable and balanced defined for the bargaining games. This immediately implies one can take advantage of the results and algorithms in cooperative game theory to reproduce results such as those of Azar et al. [1] and Kleinberg and Tardos [29] and also generalize them to our setting. The cooperative-game-theoretic connection also inspires us to refine our solution space using standard solution concepts from that literature such as nucleolus and lexicographic kernel. The nucleolus is particularly attractive as it is unique, always exists, and is supported by experimental data in the network bargaining literature. Guided by algorithms from cooperative game theory, we show how to compute the nucleolus by pruning and iteratively solving a natural linear-programming formulation.
Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract)
Venue: arXiv cs.CC 2010
Year: 2010

We consider a model of algorithmic self-assembly of geometric shapes out of square Wang tiles studied in SODA 2010, in which there are two types of tiles (e.g., constructed out of DNA and RNA material) and one operation that destroys all tiles of a particular type (e.g., an RNAse enzyme destroys all RNA tiles). We show that a single use of this destruction operation enables much more efficient construction of arbitrary shapes. In particular, an arbitrary shape can be constructed using an asymptotically optimal number of distinct tile types (related to the shape's Kolmogorov complexity), after scaling the shape by only a logarithmic factor. By contrast, without the destruction operation, the best such result has a scale factor at least linear in the size of the shape, and is connected only by a spanning tree of the scaled tiles. We also characterize a large collection of shapes that can be constructed efficiently without any scaling.
Deblured Gaussian Blurred Images
Venue: arXiv cs.CV 2010
Year: 2010

This paper attempts to undertake the study of Restored Gaussian Blurred Images. by using four types of techniques of deblurring image as Wiener filter, Regularized filter, Lucy Richardson deconvlutin algorithm and Blind deconvlution algorithm with an information of the Point Spread Function (PSF) corrupted blurred image with Different values of Size and Alfa and then corrupted by Gaussian noise. The same is applied to the remote sensing image and they are compared with one another, So as to choose the base technique for restored or deblurring image.This paper also attempts to undertake the study of restored Gaussian blurred image with no any information about the Point Spread Function (PSF) by using same four techniques after execute the guess of the PSF, the number of iterations and the weight threshold of it. To choose the base guesses for restored or deblurring image of this techniques.
BiLingual Information Retrieval System for English and Tamil
Venue: arXiv cs.IR 2010
Year: 2010

This paper addresses the design and implementation of BiLingual Information Retrieval system on the domain, Festivals. A generic platform is built for BiLingual Information retrieval which can be extended to any foreign or Indian language working with the same efficiency. Search for the solution of the query is not done in a specific predefined set of standard languages but is chosen dynamically on processing the user's query. This paper deals with Indian language Tamil apart from English. The task is to retrieve the solution for the user given query in the same language as that of the query. In this process, a Ontological tree is built for the domain in such a way that there are entries in the above listed two languages in every node of the tree. A Part-Of-Speech (POS) Tagger is used to determine the keywords from the given query. Based on the context, the keywords are translated to appropriate languages using the Ontological tree. A search is performed and documents are retrieved based on the keywords. With the use of the Ontological tree, Information Extraction is done. Finally, the solution for the query is translated back to the query language (if necessary) and produced to the user.
Mobile Zigbee Sensor Networks
Venue: arXiv cs.NI 2010
Year: 2010

OPNET Modeler accelerates network R&D and improves product quality through high-fidelity modeling and scalable simulation. It provides a virtual environment for designing protocols and devices, and for testing and demonstrating designs in realistic scenarios prior to production. OPNET Modeler supports 802.15.4 standard and has been used to make a model of PAN. Iterations have been performed by changing the Power of the transmitter and the throughput will has been analyzed to arrive at optimal values.An energy-efficient wireless home network based on IEEE 802.15.4, a novel architecture has been proposed. In this architecture, all nodes are classified into stationary nodes and mobile nodes according to the functionality of each node. Mobile nodes are usually battery-powered, and therefore need low-power operation. In order to improve power consumption of mobile nodes, effective handover sequence based on MAC broadcast and transmission power control based on LQ (link quality) are employed. Experimental results demonstrate that by using the proposed architecture, communication time and power consumption of mobile nodes can be reduced by 1.2 seconds and 42.8%, respectively.
Mobile Commerce and Applications: An Exploratory Study and Review
Venue: arXiv cs.CY 2010
Year: 2010

Mobile commerce is enabling the development of additional revenue streams for organizations through the delivery of chargeable mobile services. According to the European Information Technology Observatory, the total amount of revenue generated by mobile commerce was reported to be less than £9 million in the United Kingdom in 2001. By 2005 this had, at least, doubled and more recent industry forecasts project significant global growth in this area. Mobile commerce creates a range of business opportunities and new revenue streams for businesses across industry sectors via the deployment of innovative services, applications and associated information content. This paper presents a review of mobile commerce business models and their importance for the creation of mobile commerce solutions.
Intelligent System for Speaker Identification using Lip features with PCA and ICA
Venue: arXiv cs.SD 2010
Year: 2010

Biometric authentication techniques are more consistent and efficient than conventional authentication techniques and can be used in monitoring, transaction authentication, information retrieval, access control, forensics, etc. In this paper, we have presented a detailed comparative analysis between Principle Component Analysis (PCA) and Independent Component Analysis (ICA) which are used for feature extraction on the basis of different Artificial Neural Network (ANN) such as Back Propagation (BP), Radial Basis Function (RBF) and Learning Vector Quantization (LVQ). In this paper, we have chosen "TULIPS1 database, (Movellan, 1995)" which is a small audiovisual database of 12 subjects saying the first 4 digits in English for the incorporation of above methods. The six geometric lip features i.e. height of the outer corners of the mouth, width of the outer corners of the mouth, height of the inner corners of the mouth, width of the inner corners of the mouth, height of the upper lip, and height of the lower lip which extracts the identity relevant information are considered for the research work. After the comprehensive analysis and evaluation a maximum of 91.07% accuracy in speaker recognition is achieved using PCA and RBF and 87.36% accuracy is achieved using ICA and RBF. Speaker identification has a wide scope of applications such as access control, monitoring, transaction authentication, information retrieval, forensics, etc.
Prediction of Retained Capacity and EODV of Li-ion Batteries in LEO Spacecraft Batteries
Venue: arXiv cs.OH 2010
Year: 2010

In resent years ANN is widely reported for modeling in different areas of science including electro chemistry. This includes modeling of different technological batteries such as lead acid battery, Nickel cadmium batteries etc. Lithium ion batteries are advance battery technology which satisfy most of the space mission requirements. Low earth orbit (LEO)space craft batteries undergo large number of charge discharge cycles (about 25000 cycles)compared to other ground level or space applications. This study is indented to develop ANN model for about 25000 cycles, cycled under various temperature, Depth Of Discharge (DOD) settings with constant charge voltage limit to predict the retained capacity and End of Discharge Voltage (EODV). To extract firm conclusion and distinguish the capability of ANN method, the predicted values are compared with experimental result by statistical method and Bland Altman plot.
A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs
Venue: arXiv cs.DM 2010
Year: 2010

Given a graph $G$, the longest path problem asks to compute a simple path of $G$ with the largest number of vertices. This problem is the most natural optimization version of the well known and well studied Hamiltonian path problem, and thus it is NP-hard on general graphs. However, in contrast to the Hamiltonian path problem, there are only few restricted graph families such as trees and some small graph classes where polynomial algorithms for the longest path problem have been found. Recently it has been shown that this problem can be solved in polynomial time on interval graphs by applying dynamic programming to a characterizing ordering of the vertices of the given graph \cite{longest-int-algo}, thus answering an open question. In the present paper, we provide the first polynomial algorithm for the longest path problem on a much greater class, namely on cocomparability graphs. Our algorithm uses a similar - but essentially simpler - dynamic programming approach, which is applied to a Lexicographic Depth First Search (LDFS) characterizing ordering of the vertices of a cocomparability graph. Therefore, our results provide evidence that this general dynamic programming approach can be used in a more general setting, leading to efficient algorithms for the longest path problem on greater classes of graphs. LDFS has recently been introduced in \cite{Corneil-LDFS08}. Since then, a similar phenomenon of extending an existing interval graph algorithm to cocomparability graphs by using an LDFS preprocessing step has also been observed for the minimum path cover problem \cite{Corneil-MPC}. Therefore, more interestingly, our results also provide evidence that cocomparability graphs present an interval graph structure when they are considered using an LDFS ordering of their vertices, which may lead to other new and more efficient combinatorial algorithms.
In Quest of the Better Mobile Broadband Solution for South Asia Taking WiMAX and LTE into Consideration
Venue: arXiv cs.CY 2010
Year: 2010

Internet generation is growing accustomed to having broadband access wherever they go and not just at home or in the office, which turns mobile broadband into a reality. This paper aims to look for a suitable mobile broadband solution in the South Asian region through comparative analysis in various perspectives. Both WiMAX and LTE are 4G technologies designed to move data rather than voice having IP networks based on OFDM technology. Proving competency in various significant aspects WiMAX and LTE already have made a strong position in telecommunication industry. Again, because of certain similarities in technology; they aren't like technological rivals as of GSM and CDMA. But still they are treated as opponents and viewed as a major threat in case of the flourishing of each other. Such view point is surely not conducive for getting the best out of them. In this paper various aspects and applications of WiMAX and LTE for deployment have been analyzed. South Asia being the residence of an enormous number of people presents an exciting opportunity for mobile operators, developers and internet service providers. So, every consideration that has been made here also correlates successfully with south Asia i.e. how mass people of this region may be benefited from it. As a result, it might be regarded as a good source in case of making major BWA deployment decisions in this region. Besides these, it also opens the path for further research and thinking in this issue.
Video shot boundary detection using motion activity descriptor
Venue: arXiv cs.OH 2010
Year: 2010

This paper focus on the study of the motion activity descriptor for shot boundary detection in video sequences. We interest in the validation of this descriptor in the aim of its real time implementation with reasonable high performances in shot boundary detection. The motion activity information is extracted in uncompressed domain based on adaptive rood pattern search (ARPS) algorithm. In this context, the motion activity descriptor was applied for different video sequence.
Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete
Venue: arXiv cs.CC 2010
Year: 2010

In answer to Ko's question raised in 1983, we show that an initial value problem given by a polynomial-time computable, Lipschitz continuous function can have a polynomial-space complete solution. The key insight is simple: the Lipschitz condition means that the feedback in the differential equation is weak. We define a class of polynomial-space computation tableaux with equally weak feedback, and show that they are still polynomial-space complete. The same technique also settles Ko's two later questions on Volterra integral equations.
Simulating Parallel Algorithms in the MapReduce Framework with Applications to Parallel Computational Geometry
Venue: arXiv cs.DS 2010
Year: 2010

In this paper, we describe efficient MapReduce simulations of parallel algorithms specified in the BSP and PRAM models. We also provide some applications of these simulation results to problems in parallel computational geometry for the MapReduce framework, which result in efficient MapReduce algorithms for sorting, 1-dimensional all nearest-neighbors, 2-dimensional convex hulls, 3-dimensional convex hulls, and fixed-dimensional linear programming. For the case when reducers can have a buffer size of $B=O(n^ε)$, for a small constant $ε>0$, all of our MapReduce algorithms for these applications run in a constant number of rounds and have a linear-sized message complexity, with high probability, while guaranteeing with high probability that all reducer lists are of size $O(B)$.
On the Complexity of the $k$-Anonymization Problem
Venue: arXiv cs.CC 2010
Year: 2010

We study the problem of anonymizing tables containing personal information before releasing them for public use. One of the formulations considered in this context is the $k$-anonymization problem: given a table, suppress a minimum number of cells so that in the transformed table, each row is identical to atleast $k-1$ other rows. The problem is known to be NP-hard and MAXSNP-hard; but in the known reductions, the number of columns in the constructed tables is arbitrarily large. However, in practical settings the number of columns is much smaller. So, we study the complexity of the practical setting in which the number of columns $m$ is small. We show that the problem is NP-hard, even when the number of columns $m$ is a constant ($m=3$). We also prove MAXSNP-hardness for this restricted version and derive that the problem cannot be approximated within a factor of (6238/6237). Our reduction uses alphabets $Σ$ of arbitrarily large size. A natural question is whether the problem remains NP-hard when both $m$ and $|Σ|$ are small. We prove that the $k$-anonymization problem is in $P$ when both $m$ and $|Σ|$ are constants.
When G^2 is a Konig-Egervary graph?
Venue: arXiv cs.DM 2010
Year: 2010

The square of a graph G is the graph G^2 with the same vertex set as in G, and an edge of G^2 is joining two distinct vertices, whenever the distance between them in G is at most 2. G is a square-stable graph if it enjoys the property alpha(G)=alpha(G^2), where alpha(G) is the size of a maximum stable set in G. In this paper we show that G^2 is a Konig-Egervary graph if and only if G is a square-stable Konig-Egervary graph.
Impact of Channel Asymmetry on Base Station Cooperative Transmission with Limited Feedback
Venue: arXiv cs.IT 2010
Year: 2010

Base station (BS) cooperative transmission, also known as coordinated multi-point transmission (CoMP), is an effective way to avoid inter-cell interference in universal frequency reuse cellular systems. To gain the promised benefit, however, huge feedback overhead is in demand to gather the channel information. In this paper, we analyze the impact of channel asymmetry, which is inherent in CoMP systems, on downlink BS cooperative transmission with limited feedback. We analyze the per-user rate loss of a multi-user CoMP system led by quantization. Per-cell quantization of multicell channels is considered, which quantizes the local channel and cross channel separately and is more feasible in practice. From both the analytical and simulation results, we provide a whole picture on various critical factors that lead to the performance loss. Specifically, we show that the per user rate loss led by limited feedback depends on the location of its paired users, except for relying on its own signal to noise ratio and the quantization errors as in single cell multi-user multiple antenna systems. This implies that the quantization accuracy required for local and cross channel of each user depends on the locations of its own as well as its paired users.
Performance Evaluation of SCM-WDM System Using Different Linecoding
Venue: arXiv cs.OH 2010
Year: 2010

This paper investigates the theoretical performance analysis for a subcarrier multiplexed (SCM) wavelength division multiplexing (WDM) optical transmission system in presence of optical beat interference (OBI) which occurs during the photo detection process. We have presented a comparison for improving the performance of SCM-WDM system in presence of OBI. Non-return-to zero (NRZ), Manchester and Miller code (MC) line coding are used for performance investigation of SCM-WDM system. A suitable signal bandwidth is selected and 200 KHz is considered as channel bandwidth. Power spectrum of signal and cross component for those line coding are analyzed. Comparison results are evaluated in terms of signal to OBI ratio for the three linecoding schemes which is called signal to interference ratio (SIR). It is found that there is a significant increase in the SIR by employing Miller code compared to NRZ and Manchester for the same data rate. For example, for a number of subcarriers of 10, the achievable SIR is about -24 dB for Miller coded system compared to -46 dB for NRZ coded system and -49 dB for Manchester coded system. The results are found to be satisfactorily agreed with the expected results.
On the Achievable Rate Regions for a Class of Cognitive Radio Channels: Interference Channel with Degraded Message Sets with Unidirectional Destination Cooperation
Venue: arXiv cs.IT 2010
Year: 2010

This paper considers the capacity gains due to unidirectional destination cooperation in cognitive radio channels. We propose a novel channel, interference channel with degraded message sets with unidirectional destination cooperation (IC-DMS-UDC), to allow the receiver of cognitive radio (secondary user) to participate in relaying the information for primary system (legitimate user). Our main result is the development of an achievable rate region which combines Gel'fand-Pinkser coding with partial-decode-and-forward strategy employed in the relay channel. A numerical evaluation of the region in the Gaussian case is also provided to demonstrate the improvements.
Computing in Coq with Infinite Algebraic Data Structures
Venue: arXiv cs.LO 2010
Year: 2010

Computational content encoded into constructive type theory proofs can be used to make computing experiments over concrete data structures. In this paper, we explore this possibility when working in Coq with chain complexes of infinite type (that is to say, generated by infinite sets) as a part of the formalization of a hierarchy of homological algebra structures.