OpenRaiser/Intern-Atlas huggingface dataset:
Outage Analysis of Cooperative Transmission with Energy Harvesting Relay: Time Switching vs Power Splitting
Venue: arXiv cs.IT 2014
Year: 2014

Recently, energy harvesting (EH) has emerged as a promising way to realize green communications. In this paper, we investigate the multiuser transmission network with an EH cooperative relay, where a source transmits independent information to multiple destinations with the help of an energy constrained relay. The relay can harvest energy from the radio frequency (RF) signals transmitted from the source, and it helps the multiuser transmission only by consuming the harvested energy. By adopting the time switching and the power-splitting relay receiver architectures, we firstly propose two protocols, the time-switching cooperative multiuser transmission (TSCMT) protocol and the power-splitting cooperative multiuser transmission (PSCMT) protocol, to enable the simultaneous information processing and EH at the relay for the system. To evaluate the system performance, we theoretically analyze the system outage probability for the two proposed protocols, and then derive explicit expressions for each of them, respectively. Moreover, we also discuss the effects of system configuration parameters, such as the source power and relay location on the system performance. Numerical results are provided to demonstrate the accuracy of our analytical results and reveal that compared with traditional non-cooperative scheme, our proposed protocols are green solutions to offer reliable communication and lower system outage probability without consuming additional energy. In particular, for the same transmit power at the source, the PSCMT protocol is superior to the TSCMT protocol to obtain lower system outage probability.
Maximum Cardinality Neighbourly Sets in Quadrilateral Free Graphs
Venue: arXiv cs.DS 2014
Year: 2014

Neighbourly set of a graph is a subset of edges which either share an end point or are joined by an edge of that graph. The maximum cardinality neighbourly set problem is known to be NP-complete for general graphs. Mahdian (M.Mahdian, On the computational complexity of strong edge coloring, Discrete Applied Mathematics, 118:239-248, 2002) proved that it is in polynomial time for quadrilateral-free graphs and proposed an O(n^{11}) algorithm for the same (along with a note that by a straightforward but lengthy argument it can be proved to be solvable in O(n^5) running time). In this paper we propose an O(n^2) time algorithm for finding a maximum cardinality neighbourly set in a quadrilateral-free graph.
Optimal Platform Design
Venue: arXiv cs.GT 2014
Year: 2014

An auction house cannot generally provide the optimal auction technology to every client. Instead it provides one or several auction technologies, and clients select the most appropriate one. For example, eBay provides ascending auctions and "buy-it-now" pricing. For each client the offered technology may not be optimal, but it would be too costly for clients to create their own. We call these mechanisms, which emphasize generality rather than optimality, platform mechanisms. A platform mechanism will be adopted by a client if its performance exceeds that of the client's outside option, e.g., hiring (at a cost) a consultant to design the optimal mechanism. We ask two related questions. First, for what costs of the outside option will the platform be universally adopted? Second, what is the structure of good platform mechanisms? We answer these questions using a novel prior-free analysis framework in which we seek mechanisms that are approximately optimal for every prior.
Observational Equivalence Using Schedulers for Quantum Processes
Venue: arXiv cs.LO 2014
Year: 2014

In the study of quantum process algebras, researchers have introduced different notions of equivalence between quantum processes like bisimulation or barbed congruence. However, there are intuitively equivalent quantum processes that these notions do not regard as equivalent. In this paper, we introduce a notion of equivalence named observational equivalence into qCCS. Since quantum processes have both probabilistic and nondeterministic transitions, we introduce schedulers that solve nondeterministic choices and obtain probability distribution of quantum processes. By definition, the restrictions of schedulers change observational equivalence. We propose some definitions of schedulers, and investigate the relation between the restrictions of schedulers and observational equivalence.
Multi-packet Hybrid ARQ: Closing gap to the ergodic capacity
Venue: arXiv cs.IT 2014
Year: 2014

In this work we consider incremental redundancy (IR) hybrid automatic repeat request (HARQ), where transmission rounds are carried out over independent block-fading channels. We propose the so-called multi-packet HARQ where the transmitter allows different packets to share the same channel block. In this way the resources (block) are optimally assigned throughout the transmission rounds. This stands in contrast with the conventional HARQ, where each transmission round occupies the entire block. We analyze superposition coding and time-sharing transmission strategies and we optimize the parameters to maximize the throughput. Besides the conventional one-bit feedback (ACK/NACK) we also consider the rich, multi-bit feedback. To solve the optimization problem we formulate it as a Markov decision process (MDP) problem where the decisions are taken using accumulated mutual information (AMI) obtained from the receiver via delayed feedback. When only one-bit feedback is used to inform the transmitter about the decoding success/failure (ACK/NACK), the Partial State Information Markov Decision Process (PSI-MDP) framework is used to obtain the optimal policies. Numerical examples obtained in a Rayleigh-fading channel indicate that, the proposed multi-packet HARQ outperforms the conventional one, by more than 5 dB for high spectral efficiencies.
Color Filtering Localization for Three-Dimensional Underwater Acoustic Sensor Networks
Venue: arXiv cs.NI 2014
Year: 2014

Accurate localization for mobile nodes has been an important and fundamental problem in underwater acoustic sensor networks (UASNs). The detection information returned from a mobile node is meaningful only if its location is known. In this paper, we propose two localization algorithms based on color filtering technology called PCFL and ACFL. PCFL and ACFL aim at collaboratively accomplishing accurate localization of underwater mobile nodes with minimum energy expenditure. They both adopt the overlapping signal region of task anchors which can communicate with the mobile node directly as the current sampling area. PCFL employs the projected distances between each of the task projections and the mobile node, while ACFL adopts the direct distance between each of the task anchors and the mobile node. Also the proportion factor of distance is proposed to weight the RGB values. By comparing the nearness degrees of the RGB sequences between the samples and the mobile node, samples can be filtered out. And the normalized nearness degrees are considered as the weighted standards to calculate coordinates of the mobile nodes. The simulation results show that the proposed methods have excellent localization performance and can timely localize the mobile node. The average localization error of PCFL can decline by about 30.4% than the AFLA method.
Jif: Language-based Information-flow Security in Java
Venue: arXiv cs.PL 2014
Year: 2014

In this report, we examine Jif, a Java extension which augments the language with features related to security. Jif adds support for security labels to Java's type system such that the developer can specify confidentiality and integrity policies to the various variables used in their program. We list the main features of Jif and discuss the information flow problem that Jif helps to solve. We see how the information flow problem occurs in real-world systems by looking at two examples: Civitas, a ballot/voting system where voters do not necessarily trust voting agents, and SIF, a web application container implemented using Jif. Finally, we implement a small program that simulates information flow in a booking system containing sensitive data and discuss the usefulness of Jif based on this program.
Percolation Model of Insider Threats to Assess the Optimum Number of Rules
Venue: arXiv cs.CY 2014
Year: 2014

Rules, regulations, and policies are the basis of civilized society and are used to coordinate the activities of individuals who have a variety of goals and purposes. History has taught that over-regulation (too many rules) makes it difficult to compete and under-regulation (too few rules) can lead to crisis. This implies an optimal number of rules that avoids these two extremes. Rules create boundaries that define the latitude an individual has to perform their activities. This paper creates a Toy Model of a work environment and examines it with respect to the latitude provided to a normal individual and the latitude provided to an insider threat. Simulations with the Toy Model illustrate four regimes with respect to an insider threat: under-regulated, possibly optimal, tipping-point, and over-regulated. These regimes depend up the number of rules (N) and the minimum latitude (Lmin) required by a normal individual to carry out their activities. The Toy Model is then mapped onto the standard 1D Percolation Model from theoretical physics and the same behavior is observed. This allows the Toy Model to be generalized to a wide array of more complex models that have been well studied by the theoretical physics community and also show the same behavior. Finally, by estimating N and Lmin it should be possible to determine the regime of any particular environment.
Face recognition using color local binary pattern from mutually independent color channels
Venue: arXiv cs.CV 2014
Year: 2014

In this paper, a high performance face recognition system based on local binary pattern (LBP) using the probability distribution functions (PDF) of pixels in different mutually independent color channels which are robust to frontal homogenous illumination and planer rotation is proposed. The illumination of faces is enhanced by using the state-of-the-art technique which is using discrete wavelet transform (DWT) and singular value decomposition (SVD). After equalization, face images are segmented by use of local Successive Mean Quantization Transform (SMQT) followed by skin color based face detection system. Kullback-Leibler Distance (KLD) between the concatenated PDFs of a given face obtained by LBP and the concatenated PDFs of each face in the database is used as a metric in the recognition process. Various decision fusion techniques have been used in order to improve the recognition rate. The proposed system has been tested on the FERET, HP, and Bosphorus face databases. The proposed system is compared with conventional and thestate-of-the-art techniques. The recognition rates obtained using FVF approach for FERET database is 99.78% compared with 79.60% and 68.80% for conventional gray scale LBP and Principle Component Analysis (PCA) based face recognition techniques respectively.
Automatic Modulation Recognition of PSK Signals Using Nonuniform Compressive Samples Based on High Order Statistics
Venue: arXiv cs.IT 2014
Year: 2014

Phase modulation is a commonly used modulation mode in digital communication, which usually brings phase sparsity to digital signals. It is naturally to connect the sparsity with the newly emerged theory of compressed sensing (CS), which enables sub-Nyquist sampling of high-bandwidth to sparse signals. For the present, applications of CS theory in communication field mainly focus on spectrum sensing, sparse channel estimation etc. Few of current researches take the phase sparse character into consideration. In this paper, we establish the novel model of phase modulation signals based on phase sparsity, and introduce CS theory to the phase domain. According to CS theory, rather than the bandwidth, the sampling rate required here is scaling with the symbol rate, which is usually much lower than the Nyquist rate. In this paper, we provide analytical support for the model, and simulations verify its validity.
ACCAMS: Additive Co-Clustering to Approximate Matrices Succinctly
Venue: arXiv cs.LG 2014
Year: 2014

Matrix completion and approximation are popular tools to capture a user's preferences for recommendation and to approximate missing data. Instead of using low-rank factorization we take a drastically different approach, based on the simple insight that an additive model of co-clusterings allows one to approximate matrices efficiently. This allows us to build a concise model that, per bit of model learned, significantly beats all factorization approaches to matrix approximation. Even more surprisingly, we find that summing over small co-clusterings is more effective in modeling matrices than classic co-clustering, which uses just one large partitioning of the matrix. Following Occam's razor principle suggests that the simple structure induced by our model better captures the latent preferences and decision making processes present in the real world than classic co-clustering or matrix factorization. We provide an iterative minimization algorithm, a collapsed Gibbs sampler, theoretical guarantees for matrix approximation, and excellent empirical evidence for the efficacy of our approach. We achieve state-of-the-art results on the Netflix problem with a fraction of the model complexity.
Anonymously Analyzing Clinical Datasets
Venue: arXiv cs.SE 2014
Year: 2014

This paper takes on the problem of automatically identifying clinically-relevant patterns in medical datasets without compromising patient privacy. To achieve this goal, we treat datasets as a black box for both internal and external users of data that lets us handle clinical data queries directly and far more efficiently. The novelty of the approach lies in avoiding the data de-identification process often used as a means of preserving patient privacy. The implemented toolkit combines software engineering technologies such as Java EE and RESTful web services, to allow exchanging medical data in an unidentifiable XML format as well as restricting users to the need-to-know principle. Our technique also inhibits retrospective processing of data, such as attacks by an adversary on a medical dataset using advanced computational methods to reveal Protected Health Information (PHI). The approach is validated on an endoscopic reporting application based on openEHR and MST standards. From the usability perspective, the approach can be used to query datasets by clinical researchers, governmental or non-governmental organizations in monitoring health care services to improve quality of care.
Degrees of Freedom and Secrecy in Wireless Relay Networks
Venue: arXiv cs.IT 2014
Year: 2014

We translate the problem of designing a secure communications protocol for several users communicating through a relay in a wireless network into understanding certain subvarieties of products of Grassmannians. We calculate the dimension of these subvarieties and provide various results concerning their defning equations. When the relay and all of the users have the same number of antennas, this approach places fundamental limits on the amount of data that can be passed through such a network.
Real-Time System of Hand Detection And Gesture Recognition In Cyber Presence Interactive System For E-Learning
Venue: arXiv cs.CV 2014
Year: 2014

The development of technologies of multimedia, linked to that of Internet and democratization of high outflow, has made henceforth E-learning possible for learners being in virtual classes and geographically distributed. The quality and quantity of asynchronous and synchronous communications are the key elements for E-learning success. It is important to have a propitious supervision to reduce the feeling of isolation in E-learning. This feeling of isolation is among the main causes of loss and high rates of stalling in E-learning. The researches to be conducted in this domain aim to bring solutions of convergence coming from real time image for the capture and recognition of hand gestures. These gestures will be analyzed by the system and transformed as indicator of participation. This latter is displayed in the table of performance of the tutor as a curve according to the time. In case of isolation of learner, the indicator of participation will become red and the tutor will be informed of learners with difficulties to participate during learning session.
Service-Oriented Architectures and Web Services: Course Tutorial and Lab Notes
Venue: arXiv cs.DC 2015
Year: 2015

This document presents a number of quick-step instructions to get started on writing mini-service-oriented web services-based applications using OpenESB 2.31, Tomcat 6, GlassFish 2.x/3.0.1 with BPEL support, and Java 1.6+ primarily in Scientific Linux 6.6 with user quota restrictions. While the tutorial notes are oriented towards the students taking the SOEN487 on service-oriented architectures (SOA) at Computer Science and Software Engineering (CSE) Department, Faculty of Engineering and Computer Science (ENCS), other may find some of it useful as well outside of CSE or Concordia. The notes are compiled mostly based on the students' needs and feedback.
Inconsistency Robustness in Foundations: Mathematics self proves its own Consistency and Other Matters
Venue: arXiv cs.PL 2015
Year: 2015

Inconsistency Robustness is performance of information systems with pervasively inconsistent information. Inconsistency Robustness of the community of professional mathematicians is their performance repeatedly repairing contradictions over the centuries. In the Inconsistency Robustness paradigm, deriving contradictions have been a progressive development and not "game stoppers." Contradictions can be helpful instead of being something to be "swept under the rug" by denying their existence, which has been repeatedly attempted by Establishment Philosophers (beginning with some Pythagoreans). Such denial has delayed mathematical development. This article reports how considerations of Inconsistency Robustness have recently influenced the foundations of mathematics for Computer Science continuing a tradition developing the sociological basis for foundations. The current common understanding is that Gödel proved "Mathematics cannot prove its own consistency, if it is consistent." However, the consistency of mathematics is proved by a simple argument in this article. Consequently, the current common understanding that Gödel proved "Mathematics cannot prove its own consistency, if it is consistent" is inaccurate. Wittgenstein long ago showed that contradiction in mathematics results from the kind of "self-referential" sentence that Gödel used in his argument that mathematics cannot prove its own consistency. However, using a typed grammar for mathematical sentences, it can be proved that the kind "self-referential" sentence that Gödel used in his argument cannot be constructed because required the fixed point that Gödel used to the construct the "self-referential" sentence does not exist. In this way, consistency of mathematics is preserved without giving up power.
Fractional differentiation based image processing
Venue: arXiv cs.CV 2015
Year: 2015

There are many resources useful for processing images, most of them freely available and quite friendly to use. In spite of this abundance of tools, a study of the processing methods is still worthy of efforts. Here, we want to discuss the possibilities arising from the use of fractional differential calculus. This calculus evolved in the research field of pure mathematics until 1920, when applied science started to use it. Only recently, fractional calculus was involved in image processing methods. As we shall see, the fractional calculation is able to enhance the quality of images, with interesting possibilities in edge detection and image restoration. We suggest also the fractional differentiation as a tool to reveal faint objects in astronomical images.
Undecidability of performance equivalence of Petri nets
Venue: arXiv cs.CC 2015
Year: 2015

We investigate bisimulation equivalence on Petri nets under durational semantics. Our motivation was to verify the conjecture that in durational setting, the bisimulation equivalence checking problem becomes more tractable than in ordinary setting (which is the case, e.g., over communication-free nets). We disprove this conjecture in three of four proposed variants of durational semantics. The fourth variant remains an intriguing open problem.
Ptolemaic Indexing
Venue: arXiv cs.DS 2015
Year: 2015

This paper discusses a new family of bounds for use in similarity search, related to those used in metric indexing, but based on Ptolemy's inequality, rather than the metric axioms. Ptolemy's inequality holds for the well-known Euclidean distance, but is also shown here to hold for quadratic form metrics in general, with Mahalanobis distance as an important special case. The inequality is examined empirically on both synthetic and real-world data sets and is also found to hold approximately, with a very low degree of error, for important distances such as the angular pseudometric and several Lp norms. Indexing experiments demonstrate a highly increased filtering power compared to existing, triangular methods. It is also shown that combining the Ptolemaic and triangular filtering can lead to better results than using either approach on its own.
A novel scheme for binarization of vehicle images using hierarchical histogram equalization technique
Venue: arXiv cs.CV 2015
Year: 2015

Automatic License Plate Recognition system is a challenging area of research now-a-days and binarization is an integral and most important part of it. In case of a real life scenario, most of existing methods fail to properly binarize the image of a vehicle in a congested road, captured through a CCD camera. In the current work we have applied histogram equalization technique over the complete image and also over different hierarchy of image partitioning. A novel scheme is formulated for giving the membership value to each pixel for each hierarchy of histogram equalization. Then the image is binarized depending on the net membership value of each pixel. The technique is exhaustively evaluated on the vehicle image dataset as well as the license plate dataset, giving satisfactory performances.