OpenRaiser/Intern-Atlas huggingface dataset:
Performance Analysis of Multi-Cell Millimeter Wave Massive MIMO Networks with Low-Precision ADCs
Venue: arXiv cs.IT 2018
Year: 2018

In this paper, we investigate a multi-cell millimeter wave (mmWave) massive multiple-input multiple-output (MIMO) network with low-precision analog-to-digital converters (ADCs) at the base station (BS). Each cell serves multiple users and each user is equipped with multiple antennas but driven by a single RF chain. We first introduce a channel estimation strategy for the mmWave massive MIMO network and analyze the achievable rate with imperfect channel state information. Then, we derive an insightful lower bound for the achievable rate, which becomes tight with a growing number of users. The bound clearly demonstrates the impacts of the number of antennas and the ADC precision, especially for a single-cell mmWave network at low signal-to-noise ratio (SNR). It characterizes the tradeoff among various system parameters. Our analytical results are finally confirmed by extensive computer simulations.
Radio Resource Management for Dynamic Channel Borrowing Scheme in Wireless Networks
Venue: arXiv cs.NI 2018
Year: 2018

Provisioning of Quality of Service (QoS) is the key concern for Radio Resource Management now-a-days. In this paper, an efficient dynamic channel borrowing architecture has been proposed that ensures better QoS. The proposed scheme lessens the problem of excessive overall call blocking probability without sacrificing bandwidth utilization. If a channel is borrowed from adjacent cells and causing interference, we also propose architecture that diminishes the interference problem. The numerical results show comparison between the proposed scheme and the conventional scheme before channel borrowing process. The results show a satisfactory performance that are in favor of the proposed scheme, in case of overall call blocking probability, bandwidth utilization and interference management.
Interference Mitigation and Capacity Enhancement based on Dynamic Frequency Reuse for Femtocell Networks
Venue: arXiv cs.NI 2018
Year: 2018

Wireless networks employing small cells like femtocells are considered to be the choice of network deployment for 4G or advanced networks. This hierarchical deployment of cells introduces the necessity of effective frequency planning for mitigation of interference between different layers of network. As the scarce spectrum resources are likely to be reused to increase spectral efficiency, interference free signal reception has to be guaranteed to ensure better quality of service (QoS). In this paper we propose a dynamic frequency reuse scheme for the deployment of femtocells within a macrocell with the femtocells reusing the spectrum of neighbouring macrocells. We also provide a protective scheme for cell edge femtocell users as they are vulnerable to interference signals from neighbouring macrocells. A detailed frequency planning is provided to maximize spectral reuse while providing maximum throughput. We compare our proposed scheme with other frequency allocation schemes already described in literature. Simulation results shows that our scheme provides better throughput and ensures lower outage probability.
Interference Management Based on RT/nRT Traffic Classification for FFR-Aided Small Cell/Macrocell Heterogeneous Networks
Venue: arXiv cs.NI 2018
Year: 2018

Cellular networks are constantly lagging in terms of the bandwidth needed to support the growing high data rate demands. The system needs to efficiently allocate its frequency spectrum such that the spectrum utilization can be maximized while ensuring the quality of service (QoS) level. Owing to the coexistence of different types of traffic (e.g., real-time (RT) and non-real-time (nRT)) and different types of networks (e.g., small cell and macrocell), ensuring the QoS level for different types of users becomes a challenging issue in wireless networks. Fractional frequency reuse (FFR) is an effective approach for increasing spectrum utilization and reducing interference effects in orthogonal frequency division multiple access networks. In this paper, we propose a new FFR scheme in which bandwidth allocation is based on RT/nRT traffic classification. We consider the coexistence of small cells and macrocells. After applying FFR technique in macrocells, the remaining frequency bands are efficiently allocated among the small cells overlaid by a macrocell. In our proposed scheme, total frequency-band allocations for different macrocells are decided on the basis of the traffic intensity. The transmitted power levels for different frequency bands are controlled based on the level of interference from a nearby frequency band. Frequency bands with a lower level of interference are assigned to the RT traffic to ensure a higher QoS level for the RT traffic. RT traffic calls in macrocell networks are also given a higher priority compared with nRT traffic calls to ensure the low call-blocking rate. Performance analyses show significant improvement under the proposed scheme compared with conventional FFR schemes.
On Collaborative Predictive Blacklisting
Venue: arXiv cs.CR 2018
Year: 2018

Collaborative predictive blacklisting (CPB) allows to forecast future attack sources based on logs and alerts contributed by multiple organizations. Unfortunately, however, research on CPB has only focused on increasing the number of predicted attacks but has not considered the impact on false positives and false negatives. Moreover, sharing alerts is often hindered by confidentiality, trust, and liability issues, which motivates the need for privacy-preserving approaches to the problem. In this paper, we present a measurement study of state-of-the-art CPB techniques, aiming to shed light on the actual impact of collaboration. To this end, we reproduce and measure two systems: a non privacy-friendly one that uses a trusted coordinating party with access to all alerts (Soldo et al., 2010) and a peer-to-peer one using privacy-preserving data sharing (Freudiger et al., 2015). We show that, while collaboration boosts the number of predicted attacks, it also yields high false positives, ultimately leading to poor accuracy. This motivates us to present a hybrid approach, using a semi-trusted central entity, aiming to increase utility from collaboration while, at the same time, limiting information disclosure and false positives. This leads to a better trade-off of true and false positive rates, while at the same time addressing privacy concerns.
Modeling overland flow from local inflows in almost no-time, using Self Organizing Maps
Venue: arXiv cs.CY 2018
Year: 2018

Physically-based overland flow models are computationally demanding, hindering their use for real-time applications. Therefore, the development of fast (and reasonably accurate) overland flow models is needed if they are to be used to support flood mitigation decision making. In this study, we investigate the potential of Self-Organizing Maps to rapidly generate water depth and flood extent results. To conduct the study, we developed a flood-simulation specific SOM, using cellular automata flood model results and a synthetic DEM and inflow hydrograph. The preliminary results showed that water depth and flood extent results produced by the SOM are reasonably accurate and obtained in a very short period of time. Based on this, it seems that SOMs have the potential to provide critical flood information to support real-time flood mitigation decisions. The findings presented would however require further investigations to obtain general conclusions; these further investigations may include the consideration of real terrain representations, real water supply networks and realistic inflows from pipe bursts.
Memetic Viability Evolution for Constrained Optimization
Venue: arXiv cs.NE 2018
Year: 2018

The performance of evolutionary algorithms can be heavily undermined when constraints limit the feasible areas of the search space. For instance, while Covariance Matrix Adaptation Evolution Strategy is one of the most efficient algorithms for unconstrained optimization problems, it cannot be readily applied to constrained ones. Here, we used concepts from Memetic Computing, i.e. the harmonious combination of multiple units of algorithmic information, and Viability Evolution, an alternative abstraction of artificial evolution, to devise a novel approach for solving optimization problems with inequality constraints. Viability Evolution emphasizes elimination of solutions not satisfying viability criteria, defined as boundaries on objectives and constraints. These boundaries are adapted during the search to drive a population of local search units, based on Covariance Matrix Adaptation Evolution Strategy, towards feasible regions. These units can be recombined by means of Differential Evolution operators. Of crucial importance for the performance of our method, an adaptive scheduler toggles between exploitation and exploration by selecting to advance one of the local search units and/or recombine them. The proposed algorithm can outperform several state-of-the-art methods on a diverse set of benchmark and engineering problems, both for quality of solutions and computational resources needed.
Approximate Leave-One-Out for High-Dimensional Non-Differentiable Learning Problems
Venue: arXiv cs.LG 2018
Year: 2018

Consider the following class of learning schemes: \begin{equation} \label{eq:main-problem1} \hat{\boldsymbolβ} := \underset{\boldsymbolβ \in \mathcal{C}}{\arg\min} \;\sum_{j=1}^n \ell(\boldsymbol{x}_j^\top\boldsymbolβ; y_j) + λR(\boldsymbolβ), \qquad \qquad \qquad (1) \end{equation} where $\boldsymbol{x}_i \in \mathbb{R}^p$ and $y_i \in \mathbb{R}$ denote the $i^{\rm th}$ feature and response variable respectively. Let $\ell$ and $R$ be the convex loss function and regularizer, $\boldsymbolβ$ denote the unknown weights, and $λ$ be a regularization parameter. $\mathcal{C} \subset \mathbb{R}^{p}$ is a closed convex set. Finding the optimal choice of $λ$ is a challenging problem in high-dimensional regimes where both $n$ and $p$ are large. We propose three frameworks to obtain a computationally efficient approximation of the leave-one-out cross validation (LOOCV) risk for nonsmooth losses and regularizers. Our three frameworks are based on the primal, dual, and proximal formulations of (1). Each framework shows its strength in certain types of problems. We prove the equivalence of the three approaches under smoothness conditions. This equivalence enables us to justify the accuracy of the three methods under such conditions. We use our approaches to obtain a risk estimate for several standard problems, including generalized LASSO, nuclear norm regularization, and support vector machines. We empirically demonstrate the effectiveness of our results for non-differentiable cases.
Clust-LDA: Joint Model for Text Mining and Author Group Inference
Venue: arXiv cs.IR 2018
Year: 2018

Social media corpora pose unique challenges and opportunities, including typically short document lengths and rich meta-data such as author characteristics and relationships. This creates great potential for systematic analysis of the enormous body of the users and thus provides implications for industrial strategies such as targeted marketing. Here we propose a novel and statistically principled method, clust-LDA, which incorporates authorship structure into the topical modeling, thus accomplishing the task of the topical inferences across documents on the basis of authorship and, simultaneously, the identification of groupings between authors. We develop an inference procedure for clust-LDA and demonstrate its performance on simulated data, showing that clust-LDA out-performs the "vanilla" LDA on the topic identification task where authors exhibit distinctive topical preference. We also showcase the empirical performance of clust-LDA based on a real-world social media dataset from Reddit.
Coalition and Group Announcement Logic
Venue: arXiv cs.LO 2018
Year: 2018

Dynamic epistemic logics which model abilities of agents to make various announcements and influence each other's knowledge have been studied extensively in recent years. Two notable examples of such logics are Group Announcement Logic and Coalition Announcement Logic. They allow us to reason about what groups of agents can achieve through joint announcements in non-competitive and competitive environments. In this paper, we consider a combination of these logics -- Coalition and Relativised Group Announcement Logic and provide its complete axiomatisation. Moreover, we partially answer the question of how group and coalition announcement operators interact, and settle some other open problems.
A Relaxation-based Network Decomposition Algorithm for Parallel Transient Stability Simulation with Improved Convergence
Venue: arXiv cs.DC 2018
Year: 2018

Transient stability simulation of a large-scale and interconnected electric power system involves solving a large set of differential algebraic equations (DAEs) at every simulation time-step. With the ever-growing size and complexity of power grids, dynamic simulation becomes more time-consuming and computationally difficult using conventional sequential simulation techniques. To cope with this challenge, this paper aims to develop a fully distributed approach intended for implementation on High Performance Computer (HPC) clusters. A novel, relaxation-based domain decomposition algorithm known as Parallel-General-Norton with Multiple-port Equivalent (PGNME) is proposed as the core technique of a two-stage decomposition approach to divide the overall dynamic simulation problem into a set of subproblems that can be solved concurrently to exploit parallelism and scalability. While the convergence property has traditionally been a concern for relaxation-based decomposition, an estimation mechanism based on multiple-port network equivalent is adopted as the preconditioner to enhance the convergence of the proposed algorithm. The proposed algorithm is illustrated using rigorous mathematics and validated both in terms of speed-up and capability. Moreover, a complexity analysis is performed to support the observation that PGNME scales well when the size of the subproblems are sufficiently large.
POIReviewQA: A Semantically Enriched POI Retrieval and Question Answering Dataset
Venue: arXiv cs.AI 2018
Year: 2018

Many services that perform information retrieval for Points of Interest (POI) utilize a Lucene-based setup with spatial filtering. While this type of system is easy to implement it does not make use of semantics but relies on direct word matches between a query and reviews leading to a loss in both precision and recall. To study the challenging task of semantically enriching POIs from unstructured data in order to support open-domain search and question answering (QA), we introduce a new dataset POIReviewQA. It consists of 20k questions (e.g."is this restaurant dog friendly?") for 1022 Yelp business types. For each question we sampled 10 reviews, and annotated each sentence in the reviews whether it answers the question and what the corresponding answer is. To test a system's ability to understand the text we adopt an information retrieval evaluation by ranking all the review sentences for a question based on the likelihood that they answer this question. We build a Lucene-based baseline model, which achieves 77.0% AUC and 48.8% MAP. A sentence embedding-based model achieves 79.2% AUC and 41.8% MAP, indicating that the dataset presents a challenging problem for future research by the GIR community. The result technology can help exploit the thematic content of web documents and social media for characterisation of locations.
A General Sensitivity Analysis Approach for Demand Response Optimizations
Venue: arXiv cs.CE 2018
Year: 2018

It is well-known that demand response can improve the system efficiency as well as lower consumers' (prosumers') electricity bills. However, it is not clear how we can either qualitatively identify the prosumer with the most impact potential or quantitatively estimate each prosumer's contribution to the total social welfare improvement when additional resource capacity/flexibility is introduced to the system with demand response, such as allowing net-selling behavior. In this work, we build upon existing literature on the electricity market, which consists of price-taking prosumers each with various appliances, an electric utility company and a social welfare optimizing distribution system operator, to design a general sensitivity analysis approach (GSAA) that can estimate the potential of each consumer's contribution to the social welfare when given more resource capacity. GSAA is based on existence of an efficient competitive equilibrium, which we establish in the paper. When prosumers' utility functions are quadratic, GSAA can give closed forms characterization on social welfare improvement based on duality analysis. Furthermore, we extend GSAA to a general convex settings, i.e., utility functions with strong convexity and Lipschitz continuous gradient. Even without knowing the specific forms the utility functions, we can derive upper and lower bounds of the social welfare improvement potential of each prosumer, when extra resource is introduced. For both settings, several applications and numerical examples are provided: including extending AC comfort zone, ability of EV to discharge and net selling. The estimation results show that GSAA can be used to decide how to allocate potentially limited market resources in the most impactful way.
Finding Crash-Consistency Bugs with Bounded Black-Box Crash Testing
Venue: arXiv cs.OS 2018
Year: 2018

We present a new approach to testing file-system crash consistency: bounded black-box crash testing (B3). B3 tests the file system in a black-box manner using workloads of file-system operations. Since the space of possible workloads is infinite, B3 bounds this space based on parameters such as the number of file-system operations or which operations to include, and exhaustively generates workloads within this bounded space. Each workload is tested on the target file system by simulating power-loss crashes while the workload is being executed, and checking if the file system recovers to a correct state after each crash. B3 builds upon insights derived from our study of crash-consistency bugs reported in Linux file systems in the last five years. We observed that most reported bugs can be reproduced using small workloads of three or fewer file-system operations on a newly-created file system, and that all reported bugs result from crashes after fsync() related system calls. We build two tools, CrashMonkey and ACE, to demonstrate the effectiveness of this approach. Our tools are able to find 24 out of the 26 crash-consistency bugs reported in the last five years. Our tools also revealed 10 new crash-consistency bugs in widely-used, mature Linux file systems, seven of which existed in the kernel since 2014. Our tools also found a crash-consistency bug in a verified file system, FSCQ. The new bugs result in severe consequences like broken rename atomicity and loss of persisted files.
Indirect Mechanism Design for Efficient and Stable Renewable Energy Aggregation
Venue: arXiv cs.GT 2018
Year: 2018

Mechanism design is studied for aggregating renewable power producers (RPPs) in a two-settlement power market. Employing an indirect mechanism design framework, a payoff allocation mechanism (PAM) is derived from the competitive equilibrium (CE) of a specially formulated market with transferrable payoff. Given the designed mechanism, the strategic behaviors of the participating RPPs entail a non-cooperative game: It is proven that a unique pure Nash equilibrium (NE) exists among the RPPs, for which a closed-form expression is found. Moreover, it is proven that the designed mechanism achieves a number of key desirable properties at the NE: these include efficiency (i.e., an ideal "Price of Anarchy" of one), stability (i.e., "in the core" from a coalitional game theoretic perspective), and no collusion. In addition, it is shown that a set of desirable "ex-post" properties are also achieved by the designed mechanism. Extensive simulations are conducted and corroborate the theoretical results.
Practical Aspects of LTE Network Design and Deployment
Venue: arXiv cs.NI 2018
Year: 2018

This paper covers the practical aspects of commercial long term evolution (LTE) network design and deployment. The end-to-end architecture of the LTE network and different deployment scenarios are presented. Moreover, the LTE coverage and link budget aspects are discussed in details. Theoretical and practical throughputs of LTE system are analyzed. In addition, capacity dimensioning of LTE system is explained in details and compared with the evolved high-speed packet access (HSPA+) system. Additionally, the quality of service (QoS) of the LTE system and the end-to-end implementation scenarios along with testing results are presented. Finally, the latency of the LTE system is analyzed and compared with the HSPA+ system. This paper can be used as a reference for best practices in LTE network design and deployment.
Dissecting Apple's Meta-CDN during an iOS Update
Venue: arXiv cs.NI 2018
Year: 2018

Content delivery networks (CDN) contribute more than 50% of today's Internet traffic. Meta-CDNs, an evolution of centrally controlled CDNs, promise increased flexibility by multihoming content. So far, efforts to understand the characteristics of Meta-CDNs focus mainly on third-party Meta-CDN services. A common, but unexplored, use case for Meta-CDNs is to use the CDNs mapping infrastructure to form self-operated Meta-CDNs integrating third-party CDNs. These CDNs assist in the build-up phase of a CDN's infrastructure or mitigate capacity shortages by offloading traffic. This paper investigates the Apple CDN as a prominent example of self-operated Meta-CDNs. We describe the involved CDNs, the request-mapping mechanism, and show the cache locations of the Apple CDN using measurements of more than 800 RIPE Atlas probes worldwide. We further measure its load-sharing behavior by observing a major iOS update in Sep. 2017, a significant event potentially reaching up to an estimated 1 billion iOS devices. Furthermore, by analyzing data from a European Eyeball ISP, we quantify third-party traffic offloading effects and find third-party CDNs increase their traffic by 438% while saturating seemingly unrelated links.
Camera Model Identification Using Convolutional Neural Networks
Venue: arXiv cs.CV 2018
Year: 2018

Source camera identification is the process of determining which camera or model has been used to capture an image. In the recent years, there has been a rapid growth of research interest in the domain of forensics. In the current work, we describe our Deep Learning approach to the camera detection task of 10 cameras as a part of the Camera Model Identification Challenge hosted by Kaggle.com where our team finished 2nd out of 582 teams with the accuracy on the unseen data of 98%. We used aggressive data augmentations that allowed a model to stay robust against transformations. A number of experiments are carried out on datasets collected by organizers and scraped from the web.