OpenRaiser/Intern-Atlas huggingface dataset:
On the Optimum Cyclic Subcode Chains of $\mathcal{RM}(2,m)^*$ for Increasing Message Length
Venue: arXiv cs.IT 2013
Year: 2013

The distance profiles of linear block codes can be employed to design variational coding scheme for encoding message with variational length and getting lower decoding error probability by large minimum Hamming distance. %, e.g. the design of TFCI in CDMA and the researches on the second-order Reed-Muller code $\mathcal{RM}(2,m)$, etc. Considering convenience for encoding, we focus on the distance profiles with respect to cyclic subcode chains (DPCs) of cyclic codes over $GF(q)$ with length $n$ such that $\mbox{gcd}(n,q) = 1$. In this paper the optimum DPCs and the corresponding optimum cyclic subcode chains are investigated on the punctured second-order Reed-Muller code $\mathcal{RM}(2,m)^*$ for increasing message length, where two standards on the optimums are studied according to the rhythm of increase.
The Frequent Items Problem in Online Streaming under Various Performance Measures
Venue: arXiv cs.DS 2013
Year: 2013

In this paper, we strengthen the competitive analysis results obtained for a fundamental online streaming problem, the Frequent Items Problem. Additionally, we contribute with a more detailed analysis of this problem, using alternative performance measures, supplementing the insight gained from competitive analysis. The results also contribute to the general study of performance measures for online algorithms. It has long been known that competitive analysis suffers from drawbacks in certain situations, and many alternative measures have been proposed. However, more systematic comparative studies of performance measures have been initiated recently, and we continue this work, using competitive analysis, relative interval analysis, and relative worst order analysis on the Frequent Items Problem.
Large-signal stability conditions for semi-quasi-Z-source inverters: switched and averaged models
Venue: arXiv cs.SY 2013
Year: 2013

The recently introduced semi-quasi-Z-source in- verter can be interpreted as a DC-DC converter whose input- output voltage gain may take any value between minus infinity and 1 depending on the applied duty cycle. In order to generate a sinusoidal voltage waveform at the output of this converter, a time-varying duty cycle needs to be applied. Application of a time-varying duty cycle that produces large-signal behavior requires careful consideration of stability issues. This paper provides stability results for both the large-signal averaged and the switched models of the semi-quasi-Z-source inverter operating in continuous conduction mode. We show that if the load is linear and purely resistive then the boundedness and ultimate boundedness of the state trajectories is guaranteed provided some reasonable operation conditions are ensured. These conditions amount to keeping the duty cycle away from the extreme values 0 or 1 (averaged and switched models), and limiting the maximum PWM switching period (switched model). The results obtained can be used to give theoretical justification to the inverter operation strategy recently proposed by Cao et al. in [1].
V-BOINC: The Virtualization of BOINC
Venue: arXiv cs.DC 2013
Year: 2013

The Berkeley Open Infrastructure for Network Computing (BOINC) is an open source client-server middleware system created to allow projects with large computational requirements, usually set in the scientific domain, to utilize a technically unlimited number of volunteer machines distributed over large physical distances. However various problems exist deploying applications over these heterogeneous machines using BOINC: applications must be ported to each machine architecture type, the project server must be trusted to supply authentic applications, applications that do not regularly checkpoint may lose execution progress upon volunteer machine termination and applications that have dependencies may find it difficult to run under BOINC. To solve such problems we introduce virtual BOINC, or V-BOINC, where virtual machines are used to run computations on volunteer machines. Application developers can then compile their applications on a single architecture, checkpointing issues are solved through virtualization API's and many security concerns are addressed via the virtual machine's sandbox environment. In this paper we focus on outlining a unique approach on how virtualization can be introduced into BOINC and demonstrate that V-BOINC offers acceptable computational performance when compared to regular BOINC. Finally we show that applications with dependencies can easily run under V-BOINC in turn increasing the computational potential volunteer computing offers to the general public and project developers.
Urban ozone concentration forecasting with artificial neural network in Corsica
Venue: arXiv cs.NE 2013
Year: 2013

Atmospheric pollutants concentration forecasting is an important issue in air quality monitoring. Qualitair Corse, the organization responsible for monitoring air quality in Corsica (France) region, needs to develop a short-term prediction model to lead its mission of information towards the public. Various deterministic models exist for meso-scale or local forecasting, but need powerful large variable sets, a good knowledge of atmospheric processes, and can be inaccurate because of local climatical or geographical particularities, as observed in Corsica, a mountainous island located in a Mediterranean Sea. As a result, we focus in this study on statistical models, and particularly Artificial Neural Networks (ANN) that have shown good results in the prediction of ozone concentration at horizon h+1 with data measured locally. The purpose of this study is to build a predictor to realize predictions of ozone and PM10 at horizon d+1 in Corsica in order to be able to anticipate pollution peak formation and to take appropriated prevention measures. Specific meteorological conditions are known to lead to particular pollution event in Corsica (e.g. Saharan dust event). Therefore, several ANN models will be used, for meteorological conditions clustering and for operational forecasting.
Secrecy Wireless Information and Power Transfer with MISO Beamforming
Venue: arXiv cs.IT 2013
Year: 2013

The dual use of radio signals for simultaneous wireless information and power transfer (SWIPT) has recently drawn significant attention. To meet the practical requirement that energy receivers (ERs) operate with much higher received power than information receivers (IRs), ERs need to be deployed closer to the transmitter than IRs. However, due to the broadcast nature of wireless channels, one critical issue is that the messages sent to IRs cannot be eavesdropped by ERs, which possess better channels from the transmitter. In this paper, we address this new secrecy communication problem in a multiuser multiple-input single-output (MISO) SWIPT system where a multi-antenna transmitter sends information and energy simultaneously to one IR and multiple ERs, each with a single antenna. By optimizing transmit beamforming vectors and their power allocation, we maximize the weighted sum-energy transferred to ERs subject to a secrecy rate constraint for the information sent to the IR. We solve this non-convex problem optimally by reformulating it into a two-stage problem. First, we fix the signal-to-interference-plus-noise ratio (SINR) at the IR and obtain the optimal beamforming solution by applying the technique of semidefinite relaxation (SDR). Then the original problem is solved by a one-dimension search over the optimal SINR value for the IR. Furthermore, two suboptimal low-complexity beamforming schemes are proposed, and their achievable (secrecy) rate-energy (R-E) regions are compared against that by the optimal scheme.
Preventive Care Resource Allocation in Developing Countries: Can Rational Planning Techniques Help in Allocating Vaccinators in Dera Ismail Khan District of Pakistan?
Venue: arXiv cs.CY 2013
Year: 2013

Preventive care service delivery faces immense challenges when it comes to the level of coverage. Within this context, the case of child immunization is presented by applying operations management tools. This paper explores the application of integer programming techniques to support the Expanded Programme of Immunization (EPI) service in the Dera Ismail Khan District of Pakistan. The main concern here is equitable service delivery to decentralized localities based on two criteria: (1) achieving the highest possible level of vaccination among the target population; and 2) ensuring equality among geographically scattered populations, especially in rural dwellings. For this purpose two integer programming models have been applied on the basis of (1) sub-dividing health district into localities and allocating vaccinators to visit and vaccinate children within their administrative boundaries, and (2) within the localized planning system allowing vaccinators to visit and vaccinate children across the administrative boundaries subject to savings in travel time. Both models show interesting results in terms of need satisfaction and travel-time savings with a minimum level of deviation from equity. The solutions provide a trade-off between alternative organizational tactics, and the argument is made that rational planning methods applied interactively can contribute to the delivery of an immunization service that is equitable and cost effective.
Control Strategies for Mobile Robot With Obstacle Avoidance
Venue: arXiv cs.RO 2013
Year: 2013

Obstacle avoidance is an important task in the field of robotics, since the goal of autonomous robot is to reach the destination without collision. Several algorithms have been proposed for obstacle avoidance, having drawbacks and benefits. In this survey paper, we mainly discussed different algorithms for robot navigation with obstacle avoidance. We also compared all provided algorithms and mentioned their characteristics; advantages and disadvantages, so that we can select final efficient algorithm by fusing discussed algorithms. Comparison table is provided for justifying the area of interest
Advanced LEACH: A Static Clustering-based Heteroneous Routing Protocol for WSNs
Venue: arXiv cs.NI 2013
Year: 2013

Wireless Sensors Networks (WSNs) have a big application in heterogeneous networks. In this paper, we propose and evaluate Advanced Low-Energy Adaptive Clustering Hierarchy (Ad-LEACH) which is static clustering based heterogeneous routing protocol. The complete network field is first divided into static clusters and then in each cluster separate Ad-LEACH protocol is applied. Our proposed protocol is inherited from LEACH with a cluster head selection criteria of Distributed Energy-Efficient Clustering (DEEC). This enables Ad-LEACH to cope with the heterogeneous nature of nodes. Due to small static clusters, each node reduces its broadcast message power because it only has to cover a small area. We perform simulations in MATLAB to check the efficiency of Ad-LEACH. The Simulation results show that Ad-LEACH outperforms LEACH and DEEC in energy efficiency as well as throughput.
Electromagnetic Lens-focusing Antenna Enabled Massive MIMO
Venue: arXiv cs.IT 2013
Year: 2013

Massive multiple-input multiple-output (MIMO) techniques have been recently advanced to tremendously improve the performance of wireless networks. However, the use of very large antenna arrays brings new issues, such as the significantly increased hardware cost and signal processing cost and complexity. In order to reap the enormous gain of massive MIMO and yet reduce its cost to an affordable level, this paper proposes a novel system design by integrating an electromagnetic (EM) lens with the large antenna array, termed \emph{electromagnetic lens antenna} (ELA). An ELA has the capability of focusing the power of any incident plane wave passing through the EM lens to a small subset of the antenna array, while the location of focal area is dependent on the angle of arrival (AoA) of the wave. As compared to conventional antenna arrays without the EM lens, the proposed system can substantially reduce the number of required radio frequency (RF) chains at the receiver and hence, the implementation costs. In this paper, we investigate the proposed system under a simplified single-user uplink transmission setup, by characterizing the power distribution of the ELA as well as the resulting channel model. Furthermore, by assuming antenna selection used at the receiver, we show the throughput gains of the proposed system over conventional antenna arrays given the same number of selected antennas.
Verdict Accuracy of Quick Reduct Algorithm using Clustering and Classification Techniques for Gene Expression Data
Venue: arXiv cs.LG 2013
Year: 2013

In most gene expression data, the number of training samples is very small compared to the large number of genes involved in the experiments. However, among the large amount of genes, only a small fraction is effective for performing a certain task. Furthermore, a small subset of genes is desirable in developing gene expression based diagnostic tools for delivering reliable and understandable results. With the gene selection results, the cost of biological experiment and decision can be greatly reduced by analyzing only the marker genes. An important application of gene expression data in functional genomics is to classify samples according to their gene expression profiles. Feature selection (FS) is a process which attempts to select more informative features. It is one of the important steps in knowledge discovery. Conventional supervised FS methods evaluate various feature subsets using an evaluation function or metric to select only those features which are related to the decision classes of the data under consideration. This paper studies a feature selection method based on rough set theory. Further K-Means, Fuzzy C-Means (FCM) algorithm have implemented for the reduced feature set without considering class labels. Then the obtained results are compared with the original class labels. Back Propagation Network (BPN) has also been used for classification. Then the performance of K-Means, FCM, and BPN are analyzed through the confusion matrix. It is found that the BPN is performing well comparatively.
An efficient group authentication for group communications
Venue: arXiv cs.CR 2013
Year: 2013

Group communication implies a many-to-many communication and it goes beyond both one-to-one communication (i.e., unicast) and one-to-many communication (i.e., multicast). Unlike most user authentication protocols that authenticate a single user each time, we propose a new type of authentication, called group authentication, that authenticates all users in a group at once. The group authentication protocol is specially designed to support group communications. There is a group manager who is responsible to manage the group communication. During registration, each user of a group obtains an unique token from the group manager. Users present their tokens to determine whether they all belong to the same group or not. The group authentication protocol allows users to reuse their tokens without compromising the security of tokens. In addition, the group authentication can protect the identity of each user.
Statistical Denoising for single molecule fluorescence microscopic images
Venue: arXiv cs.CV 2013
Year: 2013

Single molecule fluorescence microscopy is a powerful technique for uncovering detailed information about biological systems, both in vitro and in vivo. In such experiments, the inherently low signal to noise ratios mean that accurate algorithms to separate true signal and background noise are essential to generate meaningful results. To this end, we have developed a new and robust method to reduce noise in single molecule fluorescence images by using a Gaussian Markov Random Field (GMRF) prior in a Bayesian framework. Two different strategies are proposed to build the prior - an intrinsic GMRF, with a stationary relationship between pixels and a heterogeneous intrinsic GMRF, with a differently weighted relationship between pixels classified as molecules and background. Testing with synthetic and real experimental fluorescence images demonstrates that the heterogeneous intrinsic GMRF is superior to other conventional de-noising approaches.
Accurate Indoor Localization Using Acoustic Direction Finding via Smart Phones
Venue: arXiv cs.NI 2013
Year: 2013

We propose and implement a novel indoor localization scheme, Swadloon, built upon an accurate acoustic direction finding. Swadloon leverages sensors of the smartphone without the requirement of any specialized devices. The scheme Swadloon does not rely on any fingerprints and is very easy to use: a user only needs to shake the phone for a short duration before walking and localization. Our Swadloon design exploits a key observation: the relative shift and velocity of the phone-shaking movement corresponds to the subtle phase and frequency shift of the Doppler effects experienced in the received acoustic signal by the phone. A novel method is designed to derive the direction from the phone to the acoustic source by combining the velocity calculated from the subtle Doppler shift with the one from the inertial sensors of the phone. Then a real-time precise localization and tracking is enabled by using a few anchor speakers with known locations. Major challenges in implementing Swadloon are to measure the frequency shift precisely and to estimate the shaking velocity accurately when the speed of phone-shaking is low and changes arbitrarily. We propose rigorous methods to address these challenges, then design and deploy Swadloon in several floors of an indoor building each with area about 2000m^2. Our extensive experiments show that the mean error of direction finding is around 2.1 degree when the acoustic source is within the range of 32m. For indoor localization, the 90-percentile errors are under 0.92m, while the maximum error is 1.73m and the mean is about 0.5m. For real-time tracking, the errors are within 0.4m for walks of 51m.
Results on independent sets in categorical products of graphs, the ultimate categorical independence ratio and the ultimate categorical independent domination ratio
Venue: arXiv cs.DM 2013
Year: 2013

We show that there are polynomial-time algorithms to compute maximum independent sets in the categorical products of two cographs and two splitgraphs. The ultimate categorical independence ratio of a graph G is defined as lim_{k --> infty} α(G^k)/n^k. The ultimate categorical independence ratio is polynomial for cographs, permutation graphs, interval graphs, graphs of bounded treewidth and splitgraphs. When G is a planar graph of maximal degree three then alpha(G \times K_4) is NP-complete. We present a PTAS for the ultimate categorical independence ratio of planar graphs. We present an O^*(n^{n/3}) exact, exponential algorithm for general graphs. We prove that the ultimate categorical independent domination ratio for complete multipartite graphs is zero, except when the graph is complete bipartite with color classes of equal size (in which case it is 1/2).
Receiver Concepts and Resource Allocation for OSC Downlink Transmission
Venue: arXiv cs.IT 2013
Year: 2013

Voice services over Adaptive Multi-user channels on One Slot (VAMOS) has been standardized as an extension to the Global System for Mobile Communications (GSM). The aim of VAMOS is to increase the capacity of GSM, while maintaining backward compatibility with the legacy system. To this end, the Orthogonal Sub-channels (OSC) concept is employed, where two Gaussian minimum-shift keying (GMSK) signals are transmitted in the same time slot and with the same carrier frequency. To fully exploit the possible capacity gain of OSC, new receiver concepts are necessary. In contrast to the base station, where multiple antennas can be employed, the mobile station is typically equipped with only one receive antenna. Therefore, the downlink receiver design is a very challenging task. Different concepts for channel estimation, user separation, and equalization at the receiver of an OSC downlink transmission are introduced in this paper. Furthermore, the system capacity must be improved by suitable downlink power and resource allocation algorithms. Making realistic assumptions on the information available at the base station, an algorithm for joint power and radio resource allocation is proposed. Simulation results show the excellent performance of the proposed channel estimation algorithms, equalization schemes, and joint radio resource and power allocation algorithms in realistic VAMOS environments.
CCS for Trees
Venue: arXiv cs.LO 2013
Year: 2013

CCS can be considered as a most natural extension of finite state automata in which interaction is made possible thanks to parallel composition. We propose here a similar extension for top-down tree automata. We introduce a parallel composition which is parameterized by a graph at the vertices of which subprocesses are located. Communication is allowed only between subprocesses related by an edge in this graph. We define an observational equivalence based on barbs as well as weak bisimilarity equivalence and prove an adequacy theorem relating these two notions.
Querying over Federated SPARQL Endpoints ---A State of the Art Survey
Venue: arXiv cs.DB 2013
Year: 2013

The increasing amount of Linked Data and its inherent distributed nature have attracted significant attention throughout the research community and amongst practitioners to search data, in the past years. Inspired by research results from traditional distributed databases, different approaches for managing federation over SPARQL Endpoints have been introduced. SPARQL is the standardised query language for RDF, the default data model used in Linked Data deployments and SPARQL Endpoints are a popular access mechanism provided by many Linked Open Data (LOD) repositories. In this paper, we initially give an overview of the federation framework infrastructure and then proceed with a comparison of existing SPARQL federation frameworks. Finally, we highlight shortcomings in existing frameworks, which we hope helps spawning new research directions.
HTTPI Based Web Service Security over SOAP
Venue: arXiv cs.CR 2013
Year: 2013

Now a days, a new family of web applications open applications, are emerging (e.g., Social Networking, News and Blogging). Generally, these open applications are non-confidential. The security needs of these applications are only client/server authentication and data integrity. For securing these open applications, effectively and efficiently, HTTPI, a new transport protocol is proposed, which ensures the entire security requirements of open applications. Benefit of using the HTTPI is that it is economical in use, well-suited for cache proxies, like HTTP is, and provides security against many Internet attacks (Server Impersonation and Message Modification) like HTTPS does. In terms of performance HTTPI is very close to the HTTP, but much better than HTTPS. A Web service is a method of communication between two ends over the Internet. These web services are developed over XML and HTTP. Today, most of the open applications use web services for most of their operations. For securing these web services, security design based on HTTPI is proposed. Our work involves securing the web services over SOAP, based on the HTTPI. This secure web service might be applicable for open applications, where authentication and integrity is needed, but no confidentiality required. In our paper, we introduce a web service security model based on HTTPI protocol over SOAP and develop a preliminary implementation of this model. We also analyze the performance of our approach through an experiment and show that our proposed approach provides higher throughput, lower average response time and lower response size than HTTPS based web service security approach.