OpenRaiser/Intern-Atlas huggingface dataset:
Resource Optimization and Power Allocation in In-band Full Duplex (IBFD)-Enabled Non-Orthogonal Multiple Access Networks
Venue: arXiv cs.IT 2017
Year: 2017

In this paper, the problem of uplink (UL) and downlink (DL) resource optimization, mode selection and power allocation is studied for wireless cellular networks under the assumption of in-band full duplex (IBFD) base stations, non-orthogonal multiple access (NOMA) operation, and queue stability constraints. The problem is formulated as a network utility maximization problem for which a Lyapunov framework is used to decompose it into two disjoint subproblems of auxiliary variable selection and rate maximization. The latter is further decoupled into a user association and mode selection (UAMS) problem and a UL/DL power optimization (UDPO) problem that are solved concurrently. The UAMS problem is modeled as a many-to-one matching problem to associate users to small cell base stations (SBSs) and select transmission mode (half/full-duplex and orthogonal/non-orthogonal multiple access), and an algorithm is proposed to solve the problem converging to a pairwise stable matching. Subsequently, the UDPO problem is formulated as a sequence of convex problems and is solved using the concave-convex procedure. Simulation results demonstrate the effectiveness of the proposed scheme to allocate UL and DL power levels after dynamically selecting the operating mode and the served users, under different traffic intensity conditions, network density, and self-interference cancellation capability. The proposed scheme is shown to achieve up to 63% and 73% of gains in UL and DL packet throughput, and 21% and 17% in UL and DL cell edge throughput, respectively, compared to existing baseline schemes.
Forming Guard Sets using AS Relationships
Venue: arXiv cs.CR 2017
Year: 2017

The mechanism for picking guards in Tor suffers from security problems like guard fingerprinting and from performance issues. To address these issues, Hayes and Danezis proposed the use of guard sets, in which the Tor system groups all guards into sets, and each client picks one of these sets and uses its guards. Unfortunately, guard sets frequently need nodes added or they are broken up due to fluctuations in network bandwidth. In this paper, we first show that these breakups create opportunities for malicious guards to join many guard sets by merely tuning the bandwidth they make available to Tor, and this greatly increases the number of clients exposed to malicious guards. To address this problem, we propose a new method for forming guard sets based on Internet location. We construct a hierarchy that keeps clients and guards together more reliably and prevents guards from easily joining arbitrary guard sets. This approach also has the advantage of confining an attacker with access to limited locations on the Internet to a small number of guard sets. We simulate this guard set design using historical Tor data in the presence of both relay-level adversaries and network-level adversaries, and we find that our approach is good at confining the adversary into few guard sets and thus limiting the impact of attacks.
Sample, computation vs storage tradeoffs for classification using tensor subspace models
Venue: arXiv cs.LG 2017
Year: 2017

In this paper, we exhibit the tradeoffs between the (training) sample, computation and storage complexity for the problem of supervised classification using signal subspace estimation. Our main tool is the use of tensor subspaces, i.e. subspaces with a Kronecker structure, for embedding the data into lower dimensions. Among the subspaces with a Kronecker structure, we show that using subspaces with a hierarchical structure for representing data leads to improved tradeoffs. One of the main reasons for the improvement is that embedding data into these hierarchical Kronecker structured subspaces prevents overfitting at higher latent dimensions.
Dimensionality Reduction using Similarity-induced Embeddings
Venue: arXiv cs.CV 2017
Year: 2017

The vast majority of Dimensionality Reduction (DR) techniques rely on second-order statistics to define their optimization objective. Even though this provides adequate results in most cases, it comes with several shortcomings. The methods require carefully designed regularizers and they are usually prone to outliers. In this work, a new DR framework, that can directly model the target distribution using the notion of similarity instead of distance, is introduced. The proposed framework, called Similarity Embedding Framework, can overcome the aforementioned limitations and provides a conceptually simpler way to express optimization targets similar to existing DR techniques. Deriving a new DR technique using the Similarity Embedding Framework becomes simply a matter of choosing an appropriate target similarity matrix. A variety of classical tasks, such as performing supervised dimensionality reduction and providing out-of-of-sample extensions, as well as, new novel techniques, such as providing fast linear embeddings for complex techniques, are demonstrated in this paper using the proposed framework. Six datasets from a diverse range of domains are used to evaluate the proposed method and it is demonstrated that it can outperform many existing DR techniques.
Using Deep Networks for Drone Detection
Venue: arXiv cs.CV 2017
Year: 2017

Drone detection is the problem of finding the smallest rectangle that encloses the drone(s) in a video sequence. In this study, we propose a solution using an end-to-end object detection model based on convolutional neural networks. To solve the scarce data problem for training the network, we propose an algorithm for creating an extensive artificial dataset by combining background-subtracted real images. With this approach, we can achieve precision and recall values both of which are high at the same time.
The Effect of Interference in Vehicular Communications on Safety Factors
Venue: arXiv cs.NI 2017
Year: 2017

This paper studies how the interference of vehicular communications affects the safety of vehicles in a vehicular ad hoc network. Different signal propagation models with and without carrier sensing are considered for the dissemination of periodic safety messages. Then, by employing the results for different packet success probability of the vehicles, we compare the expected collision probability of vehicles for different signal fading models. Our results show how the collision probabilities of vehicles in the network vary with respect to different models and designs.
Hey, you, keep away from my device: remotely implanting a virus expeller to defeat Mirai on IoT devices
Venue: arXiv cs.CR 2017
Year: 2017

Mirai is botnet which targets out-of-date Internet-of-Things (IoT) devices. The disruptive Distributed Denial of Service (DDoS) attack last year has hit major Internet companies, causing intermittent service for millions of Internet users. Since the affected devices typically do not support firmware update, it becomes challenging to expel these vulnerable devices in the wild. Both industry and academia have made great efforts in amending the situation. However, none of these efforts is simple to deploy, and at the same time effective in solving the problem. In this work, we design a collaborative defense strategy to tackle Mirai. Our key idea is to take advantage of human involvement in the least aggressive way. In particular, at a negotiated time slot, a customer is required to reboot the compromised device, then a "white" Mirai operated by the manufacturer breaks into the clean-state IoT devices immediately. The "white" Mirai expels other malicious Mirai variants, blocks vulnerable ports, and keeps a heart-beat connection with the server operated by the manufacturer. Once the heart-beat is lost, the server re-implants the "white" Mirai instantly. We have implemented a full prototype of the designed system, and the results show that our system can evade Mirai attacks effectively.
An Entropy-based Pruning Method for CNN Compression
Venue: arXiv cs.CV 2017
Year: 2017

This paper aims to simultaneously accelerate and compress off-the-shelf CNN models via filter pruning strategy. The importance of each filter is evaluated by the proposed entropy-based method first. Then several unimportant filters are discarded to get a smaller CNN model. Finally, fine-tuning is adopted to recover its generalization ability which is damaged during filter pruning. Our method can reduce the size of intermediate activations, which would dominate most memory footprint during model training stage but is less concerned in previous compression methods. Experiments on the ILSVRC-12 benchmark demonstrate the effectiveness of our method. Compared with previous filter importance evaluation criteria, our entropy-based method obtains better performance. We achieve 3.3x speed-up and 16.64x compression on VGG-16, 1.54x acceleration and 1.47x compression on ResNet-50, both with about 1% top-5 accuracy decrease.
Inactivation Decoding of LT and Raptor Codes: Analysis and Code Design
Venue: arXiv cs.IT 2017
Year: 2017

In this paper we analyze LT and Raptor codes under inactivation decoding. A first order analysis is introduced, which provides the expected number of inactivations for an LT code, as a function of the output distribution, the number of input symbols and the decoding overhead. The analysis is then extended to the calculation of the distribution of the number of inactivations. In both cases, random inactivation is assumed. The developed analytical tools are then exploited to design LT and Raptor codes, enabling a tight control on the decoding complexity vs. failure probability trade-off. The accuracy of the approach is confirmed by numerical simulations.
On Optimal Group Claims at Voting in a Stochastic Environment
Venue: arXiv cs.MA 2017
Year: 2017

There is a paradox in the model of social dynamics determined by voting in a stochastic environment (the ViSE model) called "pit of losses." It consists in the fact that a series of democratic decisions may systematically lead the society to the states unacceptable for all the voters. The paper examines how this paradox can be neutralized by the presence in society of a group that votes for its benefit and can regulate the threshold of its claims. We obtain and analyze analytical results characterizing the welfare of the whole society, the group, and the other participants as functions of the said claims threshold.
Conditional Lower Bounds for Space/Time Tradeoffs
Venue: arXiv cs.DS 2017
Year: 2017

In recent years much effort has been concentrated towards achieving polynomial time lower bounds on algorithms for solving various well-known problems. A useful technique for showing such lower bounds is to prove them conditionally based on well-studied hardness assumptions such as 3SUM, APSP, SETH, etc. This line of research helps to obtain a better understanding of the complexity inside P. A related question asks to prove conditional space lower bounds on data structures that are constructed to solve certain algorithmic tasks after an initial preprocessing stage. This question received little attention in previous research even though it has potential strong impact. In this paper we address this question and show that surprisingly many of the well-studied hard problems that are known to have conditional polynomial time lower bounds are also hard when concerning space. This hardness is shown as a tradeoff between the space consumed by the data structure and the time needed to answer queries. The tradeoff may be either smooth or admit one or more singularity points. We reveal interesting connections between different space hardness conjectures and present matching upper bounds. We also apply these hardness conjectures to both static and dynamic problems and prove their conditional space hardness. We believe that this novel framework of polynomial space conjectures can play an important role in expressing polynomial space lower bounds of many important algorithmic problems. Moreover, it seems that it can also help in achieving a better understanding of the hardness of their corresponding problems in terms of time.
Transmission line parameter identification using PMU measurements
Venue: arXiv cs.SY 2017
Year: 2017

Accurate knowledge of transmission line (TL) impedance parameters helps to improve accuracy in relay settings and power flow modeling. To improve TL parameter estimates, various algorithms have been proposed in the past to identify TL parameters based on measurements from Phasor Measurement Units (PMUs). These methods are based on the positive sequence TL models and can generate accurate positive sequence impedance parameters for a fully-transposed TL when measurement noise is absent; however these methods may generate erroneous parameters when the TLs are not fully transposed or when measurement noise is present. PMU field-measure data are often corrupted with noise and this noise is problematic for all parameter identification algorithms, particularly so when applied to short transmission lines. This paper analyzes the limitations of the positive sequence TL model when used for parameter estimation of TLs that are untransposed and proposes a novel method using linear estimation theory to identify TL parameters more reliably. This method can be used for the most general case: short or long lines that are fully transposed or untransposed and have balanced or unbalance loads. Besides the positive or negative sequence impedance parameters, the proposed method can also be used to estimate the zero sequence parameters and the mutual impedances between different sequences. This paper also examines the influence of noise in the PMU data on the calculation of TL parameters. Several case studies are conducted based on simulated data from ATP to validate the effectiveness of the new method. Through comparison of the results generated by this novel method and several other methods, the effectiveness of the proposed approach is demonstrated.
Ranking to Learn and Learning to Rank: On the Role of Ranking in Pattern Recognition Applications
Venue: arXiv cs.CV 2017
Year: 2017

The last decade has seen a revolution in the theory and application of machine learning and pattern recognition. Through these advancements, variable ranking has emerged as an active and growing research area and it is now beginning to be applied to many new problems. The rationale behind this fact is that many pattern recognition problems are by nature ranking problems. The main objective of a ranking algorithm is to sort objects according to some criteria, so that, the most relevant items will appear early in the produced result list. Ranking methods can be analyzed from two different methodological perspectives: ranking to learn and learning to rank. The former aims at studying methods and techniques to sort objects for improving the accuracy of a machine learning model. Enhancing a model performance can be challenging at times. For example, in pattern classification tasks, different data representations can complicate and hide the different explanatory factors of variation behind the data. In particular, hand-crafted features contain many cues that are either redundant or irrelevant, which turn out to reduce the overall accuracy of the classifier. In such a case feature selection is used, that, by producing ranked lists of features, helps to filter out the unwanted information. Moreover, in real-time systems (e.g., visual trackers) ranking approaches are used as optimization procedures which improve the robustness of the system that deals with the high variability of the image streams that change over time. The other way around, learning to rank is necessary in the construction of ranking models for information retrieval, biometric authentication, re-identification, and recommender systems. In this context, the ranking model's purpose is to sort objects according to their degrees of relevance, importance, or preference as defined in the specific application.
Kernelization of Constraint Satisfaction Problems: A Study through Universal Algebra
Venue: arXiv cs.CC 2017
Year: 2017

A kernelization algorithm for a computational problem is a procedure which compresses an instance into an equivalent instance whose size is bounded with respect to a complexity parameter. For the Boolean satisfiability problem (SAT), and the constraint satisfaction problem (CSP), there exist many results concerning upper and lower bounds for kernelizability of specific problems, but it is safe to say that we lack general methods to determine whether a given SAT problem admits a kernel of a particular size. This could be contrasted to the currently flourishing research program of determining the classical complexity of finite-domain CSP problems, where almost all non-trivial tractable classes have been identified with the help of algebraic properties. In this paper, we take an algebraic approach to the problem of characterizing the kernelization limits of NP-hard SAT and CSP problems, parameterized by the number of variables. Our main focus is on problems admitting linear kernels, as has, somewhat surprisingly, previously been shown to exist. We show that a CSP problem has a kernel with O(n) constraints if it can be embedded (via a domain extension) into a CSP problem which is preserved by a Maltsev operation. We also study extensions of this towards SAT and CSP problems with kernels with O(n^c) constraints, c>1, based on embeddings into CSP problems preserved by a k-edge operation, k > c. These results follow via a variant of the celebrated few subpowers algorithm. In the complementary direction, we give indication that the Maltsev condition might be a complete characterization of SAT problems with linear kernels, by showing that an algebraic condition that is shared by all problems with a Maltsev embedding is also necessary for the existence of a linear kernel unless NP is included in co-NP/poly.
Sequent systems for negative modalities
Venue: arXiv cs.LO 2017
Year: 2017

Non-classical negations may fail to be contradictory-forming operators in more than one way, and they often fail also to respect fundamental meta-logical properties such as the replacement property. Such drawbacks are witnessed by intricate semantics and proof systems, whose philosophical interpretations and computational properties are found wanting. In this paper we investigate congruential non-classical negations that live inside very natural systems of normal modal logics over complete distributive lattices; these logics are further enriched by adjustment connectives that may be used for handling reasoning under uncertainty caused by inconsistency or undeterminedness. Using such straightforward semantics, we study the classes of frames characterized by seriality, reflexivity, functionality, symmetry, transitivity, and some combinations thereof, and discuss what they reveal about sub-classical properties of negation. To the logics thereby characterized we apply a general mechanism that allows one to endow them with analytic ordinary sequent systems, most of which are even cut-free. We also investigate the exact circumstances that allow for classical negation to be explicitly defined inside our logics.
Software-based Microarchitectural Attacks
Venue: arXiv cs.CR 2017
Year: 2017

Modern processors are highly optimized systems where every single cycle of computation time matters. Many optimizations depend on the data that is being processed. Software-based microarchitectural attacks exploit effects of these optimizations. Microarchitectural side-channel attacks leak secrets from cryptographic computations, from general purpose computations, or from the kernel. This leakage even persists across all common isolation boundaries, such as processes, containers, and virtual machines. Microarchitectural fault attacks exploit the physical imperfections of modern computer systems. Shrinking process technology introduces effects between isolated hardware elements that can be exploited by attackers to take control of the entire system. These attacks are especially interesting in scenarios where the attacker is unprivileged or even sandboxed. In this thesis, we focus on microarchitectural attacks and defenses on commodity systems. We investigate known and new side channels and show that microarchitectural attacks can be fully automated. Furthermore, we show that these attacks can be mounted in highly restricted environments such as sandboxed JavaScript code in websites. We show that microarchitectural attacks exist on any modern computer system, including mobile devices (e.g., smartphones), personal computers, and commercial cloud systems. This thesis consists of two parts. In the first part, we provide background on modern processor architectures and discuss state-of-the-art attacks and defenses in the area of microarchitectural side-channel attacks and microarchitectural fault attacks. In the second part, a selection of our papers are provided without modification from their original publications. I have co-authored these papers, which have subsequently been anonymously peer-reviewed, accepted, and presented at renowned international conferences.
Integration of Satellites in 5G through LEO Constellations
Venue: arXiv cs.NI 2017
Year: 2017

The standardization of 5G systems is entering in its critical phase, with 3GPP that will publish the PHY standard by June 2017. In order to meet the demanding 5G requirements both in terms of large throughput and global connectivity, Satellite Communications provide a valuable resource to extend and complement terrestrial networks. In this context, we consider a heterogeneous architecture in which a LEO mega-constellation satellite system provides backhaul connectivity to terrestrial 5G Relay Nodes, which create an on-ground 5G network. Since large delays and Doppler shifts related to satellite channels pose severe challenges to terrestrial-based systems, in this paper we assess their impact on the future 5G PHY and MAC layer procedures. In addition, solutions are proposed for Random Access, waveform numerology, and HARQ procedures.
Zonotope-based Set-membership Parameter Identification of Linear Systems with Additive and Multiplicative Uncertainties and Its Application to Engine Condition Monitoring
Venue: arXiv cs.SY 2017
Year: 2017

In this paper, we develop two zonotope-based set-membership estimation algorithms for identification of time-varying parameters in linear models, where both additive and multiplicative uncertainties are treated explicitly. The two recursive algorithms can be differentiated by their ways of processing the data and required computations. The first algorithm, which is referred to as Cone And Zonotope Intersection (CAZI), requires solving linear programming problems at each iteration. The second algorithm, referred to as the Polyhedron And Zonotope Intersection (PAZI), involves linear programming as well as an optimization subject to linear matrix inequalities (LMIs). Both algorithms are capable of providing tight overbounds of the feasible solution set (FSS) in our numerical case studies. Furthermore, PAZI provides an additional opportunity of further analyzing the relation between the estimation results at different iterations. An application to health monitoring of marine engines is considered to demonstrate the utility and effectiveness of the algorithms.