OpenRaiser/Intern-Atlas huggingface dataset:
Potential of quantum finite automata with exact acceptance
Venue: arXiv cs.FL 2014
Year: 2014

The potential of the exact quantum information processing is an interesting, important and intriguing issue. For examples, it has been believed that quantum tools can provide significant, that is larger than polynomial, advantages in the case of exact quantum computation only, or mainly, for problems with very special structures. We will show that this is not the case. In this paper the potential of quantum finite automata producing outcomes not only with a (high) probability, but with certainty (so called exactly) is explored in the context of their uses for solving promise problems and with respect to the size of automata. It is shown that for solving particular classes $\{A^n\}_{n=1}^{\infty}$ of promise problems, even those without some very special structure, that succinctness of the exact quantum finite automata under consideration, with respect to the number of (basis) states, can be very small (and constant) though it grows proportional to $n$ in the case deterministic finite automata (DFAs) of the same power are used. This is here demonstrated also for the case that the component languages of the promise problems solvable by DFAs are non-regular. The method used can be applied in finding more exact quantum finite automata or quantum algorithms for other promise problems.
Network Non-Neutrality on the Internet: Content Provision Under a Subscription Revenue Model
Venue: arXiv cs.NI 2014
Year: 2014

The goal of this paper is to provide an insight into the equilibrium of the Internet market, when the current balance of the market is disrupted, and one of the ISPs switches to a non-neutral regime. We consider a content provider with a subscription revenue model and a continuum of end-users. The CP is also non-neutral, in the sense that she can charge users of different ISPs different subscription fees, and use this "leverage" to control the equilibrium outcome. Results reveal that the CP is able to control the non-neutral ISP to some extend. However, switching to a non-neutral regime by an ISP tips the balance of the market in favor of this ISP.
A class of AM-QFT algorithms for power-of-two FFT
Venue: arXiv cs.DS 2014
Year: 2014

This paper proposes a class of power-of-two FFT (Fast Fourier Transform) algorithms, called AM-QFT algorithms, that contains the improved QFT (Quick Fourier Transform), an algorithm recently published, as a special case. The main idea is to apply the Amplitude Modulation Double Sideband - Suppressed Carrier (AM DSB-SC) to convert odd-indices signals into even-indices signals, and to insert this elaboration into the improved QFT algorithm, substituting the multiplication by secant function. The 8 variants of this class are obtained by re-elaboration of the AM DSB-SC idea, and by means of duality. As a result the 8 variants have both the same computational cost and the same memory requirements than improved QFT. Differently, comparing this class of 8 variants of AM-QFT algorithm with the split-radix 3add/3mul (one of the most performing FFT approach appeared in the literature), we obtain the same number of additions and multiplications, but employing half of the trigonometric constants. This makes the proposed FFT algorithms interesting and useful for fixed-point implementations. Some of these variants show advantages versus the improved QFT. In fact one of this variant slightly enhances the numerical accuracy of improved QFT, while other four variants use trigonometric constants that are faster to compute in `on the fly' implementations.
Determining the Consistency factor of Autopilot using Rough Set Theory
Venue: arXiv cs.AI 2014
Year: 2014

Autopilot is a system designed to guide a vehicle without aid. Due to increase in flight hours and complexity of modern day flight it has become imperative to equip the aircrafts with autopilot. Thus reliability and consistency of an Autopilot system becomes a crucial role in a flight. But the increased complexity and demand for better accuracy has made the process of evaluating the autopilot for consistency a difficult process .A vast amount of imprecise data has been involved. Rough sets can be a potent tool for such kind of Applications containing vague data. This paper proposes an approach towards Consistency factor determination using Rough Set Theory. The seventeen basic factors, that are crucial in determining the consistency of an Autopilot system, are grouped into five Payloads based on their functionality. Consistency Factor is evaluated through these payloads, using Rough Set Theory. Consistency Factor determines the consistency and reliability of an autopilot system and the conditions under which manual override becomes imperative. Using Rough set Theory the most and the least influential factors towards Autopilot system are also determined.
Establishing Global Policies over Decentralized Online Social Networks
Venue: arXiv cs.SI 2014
Year: 2014

Conventional online social networks (OSNs) are implemented in a centralized manner. Although centralization is a convenient way for implementing OSNs, it has several well known drawbacks. Chief among them are the risks they pose to the security and privacy of the information maintained by the OSN; and the loss of control over the information contributed by individual members. These concerns prompted several attempts to create decentralized OSNs, or DOSNs. The basic idea underlying these attempts, is that each member of a social network keeps its data under its own control, instead of surrendering it to a central host; providing access to it to other members of the OSN according to its own access-control policy. Unfortunately all existing DOSN projects have a very serious limitation. Namely, they are unable to subject the membership of a DOSN, and the interaction between its members, to any global policy. We adopt the decentralization idea underlying DOSNs, complementing it with a means for specifying and enforcing a wide range of policies over the membership of a social community, and over the interaction between its disparate distributed members. And we do so in a scalable fashion.
DenseNet: Implementing Efficient ConvNet Descriptor Pyramids
Venue: arXiv cs.CV 2014
Year: 2014

Convolutional Neural Networks (CNNs) can provide accurate object classification. They can be extended to perform object detection by iterating over dense or selected proposed object regions. However, the runtime of such detectors scales as the total number and/or area of regions to examine per image, and training such detectors may be prohibitively slow. However, for some CNN classifier topologies, it is possible to share significant work among overlapping regions to be classified. This paper presents DenseNet, an open source system that computes dense, multiscale features from the convolutional layers of a CNN based object classifier. Future work will involve training efficient object detectors with DenseNet feature descriptors.
Intégration des données d'un lexique syntaxique dans un analyseur syntaxique probabiliste
Venue: arXiv cs.CL 2014
Year: 2014

This article reports the evaluation of the integration of data from a syntactic-semantic lexicon, the Lexicon-Grammar of French, into a syntactic parser. We show that by changing the set of labels for verbs and predicational nouns, we can improve the performance on French of a non-lexicalized probabilistic parser.
On the power of homogeneous depth 4 arithmetic circuits
Venue: arXiv cs.CC 2014
Year: 2014

We prove exponential lower bounds on the size of homogeneous depth 4 arithmetic circuits computing an explicit polynomial in $VP$. Our results hold for the {\it Iterated Matrix Multiplication} polynomial - in particular we show that any homogeneous depth 4 circuit computing the $(1,1)$ entry in the product of $n$ generic matrices of dimension $n^{O(1)}$ must have size $n^{Ω(\sqrt{n})}$. Our results strengthen previous works in two significant ways. Our lower bounds hold for a polynomial in $VP$. Prior to our work, Kayal et al [KLSS14] proved an exponential lower bound for homogeneous depth 4 circuits (over fields of characteristic zero) computing a poly in $VNP$. The best known lower bounds for a depth 4 homogeneous circuit computing a poly in $VP$ was the bound of $n^{Ω(\log n)}$ by [LSS, KLSS14].Our exponential lower bounds also give the first exponential separation between general arithmetic circuits and homogeneous depth 4 arithmetic circuits. In particular they imply that the depth reduction results of Koiran [Koi12] and Tavenas [Tav13] are tight even for reductions to general homogeneous depth 4 circuits (without the restriction of bounded bottom fanin). Our lower bound holds over all fields. The lower bound of [KLSS14] worked only over fields of characteristic zero. Prior to our work, the best lower bound for homogeneous depth 4 circuits over fields of positive characteristic was $n^{Ω(\log n)}$ [LSS, KLSS14].
Scalable and Anonymous Modeling of Large Populations of Flexible Appliances
Venue: arXiv cs.SY 2014
Year: 2014

To respond to volatility and congestion in the power grid, demand response (DR) mechanisms allow for shaping the load compared to a base load profile. When tapping on a large population of heterogeneous appliances as a DR resource, the challenge is in modeling the dimensions available for control. Such models need to strike the right balance between accuracy of the model and tractability. The goal of this paper is to provide a medium-grained stochastic hybrid model to represent a population of appliances that belong to two classes: deferrable or thermostatically controlled loads. We preserve quantized information regarding individual load constraints, while discarding information about the identity of appliance owners. The advantages of our proposed population model are 1) it allows us to model and control load in a scalable fashion, useful for ex-ante planning by an aggregator or for real-time load control; 2) it allows for the preservation of the privacy of end-use customers that own submetered or directly controlled appliances.
Channel assignment for throughput maximization in cognitive radio networks
Venue: arXiv cs.NI 2014
Year: 2014

In this paper, we consider the channel allocation problem for throughput maximization in cognitive radio networks with hardware-constrained secondary users. Specifically, we assume that secondary users exploit spectrum holes on a set of channels where each secondary user can use at most one available channel for communication. We develop two channel assignment algorithms that can efficiently utilize spectrum opportunities on these channels. In the first algorithm, secondary users are assigned distinct sets of channels. We show that this algorithm achieves the maximum throughput limit if the number of channels is sufficiently large. In addition, we propose an overlapping channel assignment algorithm, that can improve the throughput performance compared to the non-overlapping channel assignment algorithm. In addition, we design a distributed MAC protocol for access contention resolution and integrate the derived MAC protocol overhead into the second channel assignment algorithm. Finally, numerical results are presented to validate the theoretical results and illustrate the performance gain due to the overlapping channel assignment algorithm.
A Light Discussion and Derivation of Entropy
Venue: arXiv cs.IT 2014
Year: 2014

The expression for entropy sometimes appears mysterious - as it often is asserted without justification. This short manuscript contains a discussion of the underlying assumptions behind entropy as well as simple derivation of this ubiquitous quantity.
Simultaneous Diagonalization: On the DoF Region of the K-user MIMO Multi-way Relay Channel
Venue: arXiv cs.IT 2014
Year: 2014

The K-user MIMO Y-channel consisting of K users which want to exchange messages among each other via a common relay node is studied in this paper. A transmission strategy based on channel diagonalization using zero-forcing beam-forming is proposed. This strategy is then combined with signal-space alignment for network-coding, and the achievable degrees-of-freedom region is derived. A new degrees-of-freedom outer bound is also derived and it is shown that the proposed strategy achieves this outer bound if the users have more antennas than the relay.
Apple IOS Devices for Network Administrators
Venue: arXiv cs.OH 2014
Year: 2014

As tablet devices continue to gain market share at the expense of the traditional PC, they become a more integral part of the corporate landscape. Tablets are no longer being utilized only by sales executives for presentation purposes, or as addition to the traditional laptop. Users are attempting to perform significant amounts of their daily work on tablet devices, some even abandoning the ubiquitous laptop or desktop entirely. Operating exclusively from a tablet device, specifically Apple IOS tablet devices creates unique challenges in a corporate environment traditionally dominated by Microsoft Windows operating systems. Interactions with file shares, presentation media, VPN, and remote access present barriers that users and helpdesk support are unfamiliar with in a relation to an iPad or iPhone. Many solutions are being offered to these challenges some of which are analyzed by this manuscript.
SAP HANA and its performance benefits
Venue: arXiv cs.DB 2014
Year: 2014

In-memory computing has changed the landscape of database technology. Within the database and technology field, advancements occur over the course of time that has had the capacity to transform some fundamental tenants of the technology and how it is applied. The concept of Database Management Systems (DBMS) was realized in industry during the 1960s, allowing users and developers to use a navigational model to access the data stored by the computers of that day as they grew in speed and capability. This manuscript is specifically examines the SAPHigh Performance Analytics Appliance(HANA) approach, which is one of the commonly used technologies today. Additionally, this manuscript provides the analysis of the first two of the four common main usecases to utilize SAP HANA's in-memory computing database technology. The performance benefits are important factors for DB calculations.Some of the benefits are quantified and the demonstrated by the defined sets of data.
The NNN Formalization: Review and Development of Guideline Specification in the Care Domain
Venue: arXiv cs.AI 2014
Year: 2014

Due to an ageing society, it can be expected that less nursing personnel will be responsible for an increasing number of patients in the future. One way to address this challenge is to provide system-based support for nursing personnel in creating, executing, and adapting patient care processes. In care practice, these processes are following the general care process definition and individually specified according to patient-specific data as well as diagnoses and guidelines from the NANDA, NIC, and NOC (NNN) standards. In addition, adaptations to running patient processes become necessary frequently and are to be conducted by nursing personnel including NNN knowledge. In order to provide semi-automatic support for design and adaption of care processes, a formalization of NNN knowledge is indispensable. This technical report presents the NNN formalization that is developed targeting at goals such as completeness, flexibility, and later exploitation for creating and adapting patient care processes. The formalization also takes into consideration an extensive evaluation of existing formalization standards for clinical guidelines. The NNN formalization as well as its usage are evaluated based on case study FATIGUE.
The Role of Client Isolation in Protecting Wi-Fi Users from ARP Spoofing Attacks
Venue: arXiv cs.NI 2014
Year: 2014

This study investigates the role of the client isolation technology Public Secure Packet Forwarding (PSPF) in defending 802.11 wireless (Wi-Fi) clients, connected to a public wireless access point, from Address Resolution Protocol (ARP)cache poisoning attacks, or ARP spoofing. Exploitation of wireless attack vectors such as these have been on the rise and some have made national and international news. Although client isolation technologies are common place in most wireless access points, they are rarely enabled by default. Since an average user generally has a limited understanding of IP networking concepts, it is rarely enabled during access point configurations. Isolating wireless clients from one another on unencrypted wireless networks is a simple and potentially effective way of protection. The purpose of this research is to determine if a commonly available and easily implementable wireless client isolation security technology, such as PSPF, is an effective method for defending wireless clients against attacks.
Sum-rate maximization of OFDMA femtocell networks that incorporates the QoS of macro mobile stations
Venue: arXiv cs.NI 2014
Year: 2014

This paper proposes a power allocation scheme with co-channel allocation for a femto base station (BS) that maximizes the sum-rate of its own femto mobile stations (MSs) with a constraint that limits the degradation of quality of service (QoS) of macro MSs. We have found a closed-form solution for the upper limit on the transmission power of each sub-channel that satisfies the constraint in a probabilistic sense. The proposed scheme is practical since it uses only the information easily obtained by the femto BS. Moreover, our scheme meets the constraint with minimal degradation compared to the optimal sum-rate of the femto MSs achieved without the constraint.
Steganography -- coding and intercepting the information from encoded pictures in the absence of any initial information
Venue: arXiv cs.MM 2014
Year: 2014

The work includes implementation and extraction algorithms capabilities test, without any additional data (starting position, the number of bits used, gap between the amount of data encoded) information from encoded files (mostly images). The software is written using OpenMP standard [1], which allowed them to run on parallel computers. Performance tests were carried out on computers, Blue Gene/P [2], Blue Gene/Q [3] and the system consisting of four AMD Opteron 6272 [4]. Source code is available under GNU GPL v3 license and are available in a repository OLib [5].
Performance Analysis on The Basis of a Comparative Study Between Multipath Rayleigh Fading And AWGN Channel in The Presence of Various Interference
Venue: arXiv cs.IT 2014
Year: 2014

Interference is the most important issue for present wireless communication. There are various kinds of channel used in wireless communication. Here I want to show a performance analysis on the basis of two different channels - AWGN and Multipath Rayleigh fading channel. This is the comparative analysis with different kinds of modulation techniques. Here I have also measured the Bit Error Rate with respect to different modulation techniques and compare the rate in different channels. My objective is to compare the different characteristics of the transmitter and receiver for different types of channels and modulators.
Disaster Recovery Using Virtual Machines
Venue: arXiv cs.DC 2014
Year: 2014

Today, the importance of having 100% uptime for businesses and industries is clear: financial reasons and often strict government regulations for certain industries require 100% business continuity. The concept of business continuity (BC), as Microsoft defines it: the ability of an organization to continue to function even after a disastrous event, accomplished through the deployment of redundant hardware and software, the use of fault tolerant systems, as well as a solid backup and recovery strategy, directly relates to an organization s ability to quickly restore and deploy IT backups and business operations in a short period of time.
Low Rate Wireless Personal Area Networks (LR-WPAN 802.15.4 standard)
Venue: arXiv cs.NI 2014
Year: 2014

This manuscript will provide a brief overview on Low Rate Wireless Personal Area Networks (LR-WPAN) for 802.15.4 protocol standard which was approved by IEEE Computer Society in May 2003. 802.15.4 standard presents some advantages for structuring sensor networks and other types of applications that require low rate communications. Some security considerations will also be presented.
FlexAuc: Serving Dynamic Demands in a Spectrum Trading Market with Flexible Auction
Venue: arXiv cs.NI 2014
Year: 2014

In secondary spectrum trading markets, auctions are widely used by spectrum holders (SHs) to redistribute their unused channels to secondary wireless service providers (WSPs). As sellers, the SHs design proper auction schemes to stimulate more participants and maximize the revenue from the auction. As buyers, the WSPs determine the bidding strategies in the auction to better serve their end users. In this paper, we consider a three-layered spectrum trading market consisting of the SH, the WSPs and the end users. We jointly study the strategies of the three parties. The SH determines the auction scheme and spectrum supplies to optimize its revenue. The WSPs have flexible bidding strategies in terms of both demands and valuations considering the strategies of the end users. We design FlexAuc, a novel auction mechanism for this market to enable dynamic supplies and demands in the auction. We prove theoretically that FlexAuc not only maximizes the social welfare but also preserves other nice properties such as truthfulness and computational tractability.
On The Evolution of PON-Based FTTH Solutions
Venue: arXiv cs.NI 2014
Year: 2014

Passive Optical Network (PON)-based Fiber-To-The-Home (FTTH) are promising solutions that can break through the economic barrier of traditional point-to-point solutions. Once fibers are deployed with PON-based FTTH solutions, it becomes critical how to migrate to Wavelength Division Multiplexing (WDM)-PON because Time Division Multiplexing (TDM) used in current PON solutions cannot exploit the huge bandwidth of the optical fibers and therefore will not be able to meet ever-increasing demands for higher bandwidth by future network applications. In this paper we review and compare the current PON-based FTTH solutions, ATM-PON (APON) and Ethernet PON (EPON), and provide a possible evolution scenario to future WDM-PON.
Aggregated journal-journal citation relations in Scopus and Web-of-Science matched and compared in terms of networks, maps, and interactive overlays
Venue: arXiv cs.DL 2014
Year: 2014

We compare the network of aggregated journal-journal citation relations provided by the Journal Citation Reports (JCR) 2012 of the Science and Social Science Citation Indexes (SCI and SSCI) with similar data based on Scopus 2012. First, global maps were developed for the two sets separately; sets of documents can then be compared using overlays to both maps. Using fuzzy-string matching and ISSN numbers, we were able to match 10,524 journal names between the two sets; that is, 96.4% of the 10,936 journals contained in JCR or 51.2% of the 20,554 journals covered by Scopus. Network analysis was then pursued on the set of journals shared between the two databases and the two sets of unique journals. Citations among the shared journals are more comprehensively covered in JCR than Scopus, so the network in JCR is denser and more connected than in Scopus. The ranking of shared journals in terms of indegree (that is, numbers of citing journals) or total citations is similar in both databases overall (Spearman's \r{ho} > 0.97), but some individual journals rank very differently. Journals that are unique to Scopus seem to be less important--they are citing shared journals rather than being cited by them--but the humanities are covered better in Scopus than in JCR.