OpenRaiser/Intern-Atlas huggingface dataset:
Locating a single facility and a high-speed line
Venue: arXiv cs.CG 2012
Year: 2012

In this paper we study a facility location problem in the plane in which a single point (facility) and a rapid transit line (highway) are simultaneously located in order to minimize the total travel time from the clients to the facility, using the $L_1$ or Manhattan metric. The rapid transit line is given by a segment with any length and orientation, and is an alternative transportation line that can be used by the clients to reduce their travel time to the facility. We study the variant of the problem in which clients can enter and exit the highway at any point. We provide an $O(n^3)$-time algorithm that solves this variant, where $n$ is the number of clients. We also present a detailed characterization of the solutions, which depends on the speed given in the highway.
Smart handover based on fuzzy logic trend in IEEE802.11 mobile IPv6 networks
Venue: arXiv cs.NI 2012
Year: 2012

A properly designed handoff algorithm is essential in reducing the connection quality deterioration when a mobile node moves across the cell boundaries. Therefore, to improve communication quality, we identified three goals in our paper. The first goal is to minimize unnecessary handovers and increase communication quality by reducing misrepresentations of RSSI readings due to multipath and shadow effect with the use of additional parameters. The second goal is to control the handover decisions depending on the users' mobility by utilizing location factors as one of the input parameters in a fuzzy logic handover algorithm. The third goal is to minimize false handover alarms caused by sudden fluctuations of parameters by monitoring the trend of fuzzy logic outputs for a period of time before making handover decision. In this paper, we use RSSI, speed and distance as the input decision criteria of a handover trigger algorithm by means of fuzzy logic. The fuzzy logic output trend is monitored for a period of time before handover is triggered. Finally, through simulations, we show the effectiveness of the proposed handover algorithm in achieving better communication quality.
Indexing of Arabic documents automatically based on lexical analysis
Venue: arXiv cs.IR 2012
Year: 2012

The continuous information explosion through the Internet and all information sources makes it necessary to perform all information processing activities automatically in quick and reliable manners. In this paper, we proposed and implemented a method to automatically create and Index for books written in Arabic language. The process depends largely on text summarization and abstraction processes to collect main topics and statements in the book. The process is developed in terms of accuracy and performance and results showed that this process can effectively replace the effort of manually indexing books and document, a process that can be very useful in all information processing and retrieval applications.
A Novel Window Function Yielding Suppressed Mainlobe Width and Minimum Sidelobe Peak
Venue: arXiv cs.OH 2012
Year: 2012

In many applications like FIR filters, FFT, signal processing and measurements, we are required (~45 dB) or less side lobes amplitudes. However, the problem is usual window based FIR filter design lies in its side lobes amplitudes that are higher than the requirement of application. We propose a window function, which has better performance like narrower main lobe width, minimum side lobe peak compared to the several commonly used windows. The proposed window has slightly larger main lobe width of the commonly used Hamming window, while featuring 6.2\ sim 22.62 dB smaller side lobe peak. The proposed window maintains its maximum side lobe peak about -58.4 \sim -52.6 dB compared to -35.8 \sim -38.8 dB of Hamming window for M=10~14, while offering roughly equal main lobe width. Our simulated results also show significant performance upgrading of the proposed window compared to the Kaiser, Gaussian, and Lanczos windows. The proposed window also shows better performance than Dolph-Chebyshev window. Finally, the example of designed low pass FIR filter confirms the efficiency of the proposed window.
Precise positioning systems for Vehicular Ad-Hoc Networks
Venue: arXiv cs.NI 2012
Year: 2012

Vehicular Ad Hoc Networks (VANET) is a very promising research venue that can offers many useful and critical applications including the safety applications. Most of these applications require that each vehicle knows precisely its current position in real time. GPS is the most common positioning technique for VANET. However, it is not accurate. Moreover, the GPS signals cannot be received in the tunnels, undergrounds, or near tall buildings. Thus, no positioning service can be obtained in these locations. Even if the Deferential GPS (DGPS) can provide high accuracy, but still no GPS converge in these locations. In this paper, we provide positioning techniques for VANET that can provide accurate positioning service in the areas where GPS signals are hindered by the obstacles. Experimental results show significant improvement in the accuracy. This allows when combined with DGPS the continuity of a precise positioning service that can be used by most of the VANET applications.
The impact of pharmacybernetic in reducing medication error
Venue: arXiv cs.OH 2012
Year: 2012

Doctors and Pharmacists play a foremost role in safe, effective use of medication in health care. Still, there is no database available through which Doctor can communicate with all field of pharmacy such as hospital Pharmacy, Clinical Pharmacy, Community Pharmacy, Nutrition Pharmacy and Drug research center so that they would like to cooperate with pharmacists in Medication error prevention, Drug-Disease management, Nutrition management, and pharmacotherapy. The authors examined the comprehensive project of implementing Electronic Drug Information Record (EDIR), introduce the new term Pharmacybernetic and how to reduce the medication error by integrated management system (IMS). This paper presented EDIR conceptual model and the flow sheet of the Pharmacybernetic system, which describes the integration of different Pharmaceutical related aspect in the field of Cybernetic.
Moving Object Trajectories Meta-Model And Spatio-Temporal Queries
Venue: arXiv cs.DB 2012
Year: 2012

In this paper, a general moving object trajectories framework is put forward to allow independent applications processing trajectories data benefit from a high level of interoperability, information sharing as well as an efficient answer for a wide range of complex trajectory queries. Our proposed meta-model is based on ontology and event approach, incorporates existing presentations of trajectory and integrates new patterns like space-time path to describe activities in geographical space-time. We introduce recursive Region of Interest concepts and deal mobile objects trajectories with diverse spatio-temporal sampling protocols and different sensors available that traditional data model alone are incapable for this purpose.
Microcontroller Based Testing of Digital IP-Core
Venue: arXiv cs.AR 2012
Year: 2012

Testing core based System on Chip is a challenge for the test engineers. To test the complete SOC at one time with maximum fault coverage, test engineers prefer to test each IP-core separately. At speed testing using external testers is more expensive because of gigahertz processor. The purpose of this paper is to develop cost efficient and flexible test methodology for testing digital IP-cores . The prominent feature of the approach is to use microcontroller to test IP-core. The novel feature is that there is no need of test pattern generator and output response analyzer as microcontroller performs the function of both. This approach has various advantages such as at speed testing, low cost, less area overhead and greater flexibility since most of the testing process is based on software.
A low power high bandwidth four quadrant analog multiplier in 32 nm CNFET technology
Venue: arXiv cs.ET 2012
Year: 2012

Carbon Nanotube Field Effect Transistor (CNFET) is a promising new technology that overcomes several limitations of traditional silicon integrated circuit technology. In recent years, the potential of CNFET for analog circuit applications has been explored. This paper proposes a novel four quadrant analog multiplier design using CNFETs. The simulation based on 32nm CNFET technology shows that the proposed multiplier has very low harmonic distortion (<0.45%), large input range ({\pm}400mV), large bandwidth (~50GHz) and low power consumption (~247μW), while operating at a supply voltage of {\pm}0.9V.
Distributed Algorithms for Scheduling on Line and Tree Networks
Venue: arXiv cs.DS 2012
Year: 2012

We have a set of processors (or agents) and a set of graph networks defined over some vertex set. Each processor can access a subset of the graph networks. Each processor has a demand specified as a pair of vertices $<u, v>$, along with a profit; the processor wishes to send data between $u$ and $v$. Towards that goal, the processor needs to select a graph network accessible to it and a path connecting $u$ and $v$ within the selected network. The processor requires exclusive access to the chosen path, in order to route the data. Thus, the processors are competing for routes/channels. A feasible solution selects a subset of demands and schedules each selected demand on a graph network accessible to the processor owning the demand; the solution also specifies the paths to use for this purpose. The requirement is that for any two demands scheduled on the same graph network, their chosen paths must be edge disjoint. The goal is to output a solution having the maximum aggregate profit. Prior work has addressed the above problem in a distibuted setting for the special case where all the graph networks are simply paths (i.e, line-networks). Distributed constant factor approximation algorithms are known for this case. The main contributions of this paper are twofold. First we design a distributed constant factor approximation algorithm for the more general case of tree-networks. The core component of our algorithm is a tree-decomposition technique, which may be of independent interest. Secondly, for the case of line-networks, we improve the known approximation guarantees by a factor of 5. Our algorithms can also handle the capacitated scenario, wherein the demands and edges have bandwidth requirements and capacities, respectively.
Dynamic Behavioral Mixed-Membership Model for Large Evolving Networks
Venue: arXiv cs.SI 2012
Year: 2012

The majority of real-world networks are dynamic and extremely large (e.g., Internet Traffic, Twitter, Facebook, ...). To understand the structural behavior of nodes in these large dynamic networks, it may be necessary to model the dynamics of behavioral roles representing the main connectivity patterns over time. In this paper, we propose a dynamic behavioral mixed-membership model (DBMM) that captures the roles of nodes in the graph and how they evolve over time. Unlike other node-centric models, our model is scalable for analyzing large dynamic networks. In addition, DBMM is flexible, parameter-free, has no functional form or parameterization, and is interpretable (identifies explainable patterns). The performance results indicate our approach can be applied to very large networks while the experimental results show that our model uncovers interesting patterns underlying the dynamics of these networks.
High-Performance Solvers for Dense Hermitian Eigenproblems
Venue: arXiv cs.MS 2012
Year: 2012

We introduce a new collection of solvers - subsequently called EleMRRR - for large-scale dense Hermitian eigenproblems. EleMRRR solves various types of problems: generalized, standard, and tridiagonal eigenproblems. Among these, the last is of particular importance as it is a solver on its own right, as well as the computational kernel for the first two; we present a fast and scalable tridiagonal solver based on the Algorithm of Multiple Relatively Robust Representations - referred to as PMRRR. Like the other EleMRRR solvers, PMRRR is part of the freely available Elemental library, and is designed to fully support both message-passing (MPI) and multithreading parallelism (SMP). As a result, the solvers can equally be used in pure MPI or in hybrid MPI-SMP fashion. We conducted a thorough performance study of EleMRRR and ScaLAPACK's solvers on two supercomputers. Such a study, performed with up to 8,192 cores, provides precise guidelines to assemble the fastest solver within the ScaLAPACK framework; it also indicates that EleMRRR outperforms even the fastest solvers built from ScaLAPACK's components.
Separating the Wheat from the Chaff: Sensing Wireless Microphones in TVWS
Venue: arXiv cs.IT 2012
Year: 2012

This paper summarizes our attempts to establish a systematic approach that overcomes a key difficulty in sensing wireless microphone signals, namely, the inability for most existing detection methods to effectively distinguish between a wireless microphone signal and a sinusoidal continuous wave (CW). Such an inability has led to an excessively high false alarm rate and thus severely limited the utility of sensing-based cognitive transmission in the TV white space (TVWS) spectrum. Having recognized the root of the difficulty, we propose two potential solutions. The first solution focuses on the periodogram as an estimate of the power spectral density (PSD), utilizing the property that a CW has a line spectral component while a wireless microphone signal has a slightly dispersed PSD. In that approach, we formulate the resulting decision model as an one-sided test for Gaussian vectors, based on Kullback-Leibler distance type of decision statistics. The second solution goes beyond the PSD and looks into the spectral correlation function (SCF), proposing an augmented SCF that is capable of revealing more features in the cycle frequency domain compared with the conventional SCF. Thus the augmented SCF exhibits the key difference between CW and wireless microphone signals. Both simulation results and experimental validation results indicate that the two proposed solutions are promising for sensing wireless microphones in TVWS.
A Greedy Double Swap Heuristic for Nurse Scheduling
Venue: arXiv cs.OH 2012
Year: 2012

One of the key challenges of nurse scheduling problem (NSP) is the number of constraints placed on preparing the timetable, both from the regulatory requirements as well as the patients' demand for the appropriate nursing care specialists. In addition, the preferences of the nursing staffs related to their work schedules add another dimension of complexity. Most solutions proposed for solving nurse scheduling involve the use of mathematical programming and generally considers only the hard constraints. However, the psychological needs of the nurses are ignored and this resulted in subsequent interventions by the nursing staffs to remedy any deficiency and often results in last minute changes to the schedule. In this paper, we present a staff preference optimization framework which is solved with a greedy double swap heuristic. The heuristic yields good performance in speed at solving the problem. The heuristic is simple and we will demonstrate its performance by implementing it on open source spreadsheet software.
Performance improvement in OFDM system by PAPR reduction
Venue: arXiv cs.NI 2012
Year: 2012

Orthogonal Frequency Division Multiplexing (OFDM) is an efficient method of data transmission for high speed communication systems. However, the main drawback of OFDM system is the high Peak to Average Power Ratio (PAPR) of the transmitted signals. OFDM consist of large number of independent subcarriers, as a result of which the amplitude of such a signal can have high peak values. Coding, phase rotation and clipping are among many PAPR reduction schemes that have been proposed to overcome this problem. Here two different PAPR reduction methods e.g. partial transmit sequence (PTS) and selective mapping (SLM) are used to reduce PAPR. Significant reduction in PAPR has been achieved using these techniques. The performances of the two methods are then compared.
Diachronic Linked Data: Towards Long-Term Preservation of Structured Interrelated Information
Venue: arXiv cs.DB 2012
Year: 2012

The Linked Data Paradigm is one of the most promising technologies for publishing, sharing, and connecting data on the Web, and offers a new way for data integration and interoperability. However, the proliferation of distributed, inter-connected sources of information and services on the Web poses significant new challenges for managing consistently a huge number of large datasets and their interdependencies. In this paper we focus on the key problem of preserving evolving structured interlinked data. We argue that a number of issues that hinder applications and users are related to the temporal aspect that is intrinsic in linked data. We present a number of real use cases to motivate our approach, we discuss the problems that occur, and propose a direction for a solution.
Orion Routing Protocol for Delay-Tolerant Networks
Venue: arXiv cs.NI 2012
Year: 2012

In this paper, we address the problem of efficient routing in delay tolerant network. We propose a new routing protocol dubbed as ORION. In ORION, only a single copy of a data packet is kept in the network and transmitted, contact by contact, towards the destination. The aim of the ORION routing protocol is twofold: on one hand, it enhances the delivery ratio in networks where an end-to-end path does not necessarily exist, and on the other hand, it minimizes the routing delay and the network overhead to achieve better performance. In ORION, nodes are aware of their neighborhood by the mean of actual and statistical estimation of new contacts. ORION makes use of autoregressive moving average (ARMA) stochastic processes for best contact prediction and geographical coordinates for optimal greedy data packet forwarding. Simulation results have demonstrated that ORION outperforms other existing DTN routing protocols such as PRoPHET in terms of end-to-end delay, packet delivery ratio, hop count and first packet arrival.
GEAMS: a Greedy Energy-Aware Multipath Stream-based Routing Protocol for WMSNs
Venue: arXiv cs.NI 2012
Year: 2012

Because sensor nodes operate on power limited batteries, sensor functionalities have to be designed carefully. In particular, designing energy-efficient packet forwarding is important to maximize the lifetime of the network and to minimize the power usage at each node. This paper presents a Geographic Energy-Aware Multipath Stream-based (GEAMS) routing protocol for WMSNs. GEAMS routing decisions are made online, at each forwarding node in such a way that there is no need to global topology knowledge and maintenance. GEAMS routing protocol performs load-balancing to minimize energy consumption among nodes using twofold policy: (1) smart greedy forwarding and (2) walking back forwarding. Performances evaluations of GEAMS show that it can maximize the network lifetime and guarantee quality of service for video stream transmission in WMSNs.
Securing Mobile Ad hoc Networks:Key Management and Routing
Venue: arXiv cs.CR 2012
Year: 2012

Secure communication between two nodes in a network depends on reliable key management systems that generate and distribute keys between communicating nodes and a secure routing protocol that establishes a route between them. But due to lack of central server and infrastructure in Mobile Ad hoc Networks (MANETs), this is major problem to manage the keys in the network. Dynamically changes in network's topology causes weak trust relationship among the nodes in the network. In MANETs a mobile node operates as not only end terminal but also as an intermediate router. Therefore, a multi-hop scenario occurs for communication in MANETs; where there may be one or more malicious nodes in between source and destination. A routing protocol is said to be secure that detects the detrimental effects of malicious node(s in the path from source to destination). In this paper, we proposed a key management scheme and a secure routing protocol that secures on demand routing protocol such as DSR and AODV. We assume that MANETs is divided into groups having a group leader in each group. Group leader has responsibility of key management in its group. Proposed key management scheme is a decentralized scheme that does not require any Trusted Third Party (TTP) for key management. In proposed key management system, both a new node and group leader authenticates each other mutually before joining the network. While proposed secure routing protocol allows both communicating parties as well as intermediate nodes to authenticate other nodes and maintains message integrity
Dynamic Dependency Pairs for Algebraic Functional Systems
Venue: arXiv cs.LO 2012
Year: 2012

We extend the higher-order termination method of dynamic dependency pairs to Algebraic Functional Systems (AFSs). In this setting, simply typed lambda-terms with algebraic reduction and separate β-steps are considered. For left-linear AFSs, the method is shown to be complete. For so-called local AFSs we define a variation of usable rules and an extension of argument filterings. All these techniques have been implemented in the higher-order termination tool WANDA.
A Bayesian Framework for Community Detection Integrating Content and Link
Venue: arXiv cs.SI 2012
Year: 2012

This paper addresses the problem of community detection in networked data that combines link and content analysis. Most existing work combines link and content information by a generative model. There are two major shortcomings with the existing approaches. First, they assume that the probability of creating a link between two nodes is determined only by the community memberships of the nodes; however other factors (e.g. popularity) could also affect the link pattern. Second, they use generative models to model the content of individual nodes, whereas these generative models are vulnerable to the content attributes that are irrelevant to communities. We propose a Bayesian framework for combining link and content information for community detection that explicitly addresses these shortcomings. A new link model is presented that introduces a random variable to capture the node popularity when deciding the link between two nodes; a discriminative model is used to determine the community membership of a node by its content. An approximate inference algorithm is presented for efficient Bayesian inference. Our empirical study shows that the proposed framework outperforms several state-of-theart approaches in combining link and content information for community detection.
Probabilistic Structured Predictors
Venue: arXiv cs.LG 2012
Year: 2012

We consider MAP estimators for structured prediction with exponential family models. In particular, we concentrate on the case that efficient algorithms for uniform sampling from the output space exist. We show that under this assumption (i) exact computation of the partition function remains a hard problem, and (ii) the partition function and the gradient of the log partition function can be approximated efficiently. Our main result is an approximation scheme for the partition function based on Markov Chain Monte Carlo theory. We also show that the efficient uniform sampling assumption holds in several application settings that are of importance in machine learning.