OpenRaiser/Intern-Atlas huggingface dataset:
Do not trust me: Using malicious IdPs for analyzing and attacking Single Sign-On
Venue: arXiv cs.CR 2014
Year: 2014

Single Sign-On (SSO) systems simplify login procedures by using an an Identity Provider (IdP) to issue authentication tokens which can be consumed by Service Providers (SPs). Traditionally, IdPs are modeled as trusted third parties. This is reasonable for SSO systems like Kerberos, MS Passport and SAML, where each SP explicitely specifies which IdP he trusts. However, in open systems like OpenID and OpenID Connect, each user may set up his own IdP, and a discovery phase is added to the protocol flow. Thus it is easy for an attacker to set up its own IdP. In this paper we use a novel approach for analyzing SSO authentication schemes by introducing a malicious IdP. With this approach we evaluate one of the most popular and widely deployed SSO protocols - OpenID. We found four novel attack classes on OpenID, which were not covered by previous research, and show their applicability to real-life implementations. As a result, we were able to compromise 11 out of 16 existing OpenID implementations like Sourceforge, Drupal and ownCloud. We automated discovery of these attacks in a open source tool OpenID Attacker, which additionally allows fine-granular testing of all parameters in OpenID implementations. Our research helps to better understand the message flow in the OpenID protocol, trust assumptions in the different components of the system, and implementation issues in OpenID components. It is applicable to other SSO systems like OpenID Connect and SAML. All OpenID implementations have been informed about their vulnerabilities and we supported them in fixing the issues.
Fisher Kernel for Deep Neural Activations
Venue: arXiv cs.CV 2014
Year: 2014

Compared to image representation based on low-level local descriptors, deep neural activations of Convolutional Neural Networks (CNNs) are richer in mid-level representation, but poorer in geometric invariance properties. In this paper, we present a straightforward framework for better image representation by combining the two approaches. To take advantages of both representations, we propose an efficient method to extract a fair amount of multi-scale dense local activations from a pre-trained CNN. We then aggregate the activations by Fisher kernel framework, which has been modified with a simple scale-wise normalization essential to make it suitable for CNN activations. Replacing the direct use of a single activation vector with our representation demonstrates significant performance improvements: +17.76 (Acc.) on MIT Indoor 67 and +7.18 (mAP) on PASCAL VOC 2007. The results suggest that our proposal can be used as a primary image representation for better performances in visual recognition tasks.
Efficiency Analysis of Decoupled Downlink and Uplink Access in Heterogeneous Networks
Venue: arXiv cs.IT 2014
Year: 2014

This paper analyzes two-tier heterogeneous cellular network with decoupled downlink and uplink access. The basic performance benefits of uplink/downlink decoupling have been recently introduced. Here we provide a more elaborate treatment of the decoupling mechanism by analyzing spectral and energy efficiency of the system, as the joint improvement of these two features is crucial for the upcoming 5G systems. Contrary to the common assumption of a homogeneous user domain, we analyze two-tier user domain, whose transmit powers depend purely on the association process. The derived joint association probabilities and the distributions of the distance to the serving base station give deeper insight into the fundamentals of a system with decoupled access. The rigorous theoretical analysis shows that decoupling of downlink and uplink with two-level uplink power adaptation improves both, spectral and energy efficiency of the system.
Convolutional Neural Networks at Constrained Time Cost
Venue: arXiv cs.CV 2014
Year: 2014

Though recent advanced convolutional neural networks (CNNs) have been improving the image recognition accuracy, the models are getting more complex and time-consuming. For real-world applications in industrial and commercial scenarios, engineers and developers are often faced with the requirement of constrained time budget. In this paper, we investigate the accuracy of CNNs under constrained time cost. Under this constraint, the designs of the network architectures should exhibit as trade-offs among the factors like depth, numbers of filters, filter sizes, etc. With a series of controlled comparisons, we progressively modify a baseline model while preserving its time complexity. This is also helpful for understanding the importance of the factors in network designs. We present an architecture that achieves very competitive accuracy in the ImageNet dataset (11.8% top-5 error, 10-view test), yet is 20% faster than "AlexNet" (16.0% top-5 error, 10-view test).
Simplified Erasure/List Decoding
Venue: arXiv cs.IT 2014
Year: 2014

We consider the problem of erasure/list decoding using certain classes of simplified decoders. Specifically, we assume a class of erasure/list decoders, such that a codeword is in the list if its likelihood is larger than a threshold. This class of decoders both approximates the optimal decoder of Forney, and also includes the following simplified subclasses of decoding rules: The first is a function of the output vector only, but not the codebook (which is most suitable for high rates), and the second is a scaled version of the maximum likelihood decoder (which is most suitable for low rates). We provide single-letter expressions for the exact random coding exponents of any decoder in these classes, operating over a discrete memoryless channel. For each class of decoders, we find the optimal decoder within the class, in the sense that it maximizes the erasure/list exponent, under a given constraint on the error exponent. We establish the optimality of the simplified decoders of the first and second kind for low and high rates, respectively.
Relations among Some Low Rank Subspace Recovery Models
Venue: arXiv cs.LG 2014
Year: 2014

Recovering intrinsic low dimensional subspaces from data distributed on them is a key preprocessing step to many applications. In recent years, there has been a lot of work that models subspace recovery as low rank minimization problems. We find that some representative models, such as Robust Principal Component Analysis (R-PCA), Robust Low Rank Representation (R-LRR), and Robust Latent Low Rank Representation (R-LatLRR), are actually deeply connected. More specifically, we discover that once a solution to one of the models is obtained, we can obtain the solutions to other models in closed-form formulations. Since R-PCA is the simplest, our discovery makes it the center of low rank subspace recovery models. Our work has two important implications. First, R-PCA has a solid theoretical foundation. Under certain conditions, we could find better solutions to these low rank models at overwhelming probabilities, although these models are non-convex. Second, we can obtain significantly faster algorithms for these models by solving R-PCA first. The computation cost can be further cut by applying low complexity randomized algorithms, e.g., our novel $\ell_{2,1}$ filtering algorithm, to R-PCA. Experiments verify the advantages of our algorithms over other state-of-the-art ones that are based on the alternating direction method.
Resource control and intersection types: an intrinsic connection
Venue: arXiv cs.LO 2014
Year: 2014

In this paper we investigate the $λ$ -calculus, a $λ$-calculus enriched with resource control. Explicit control of resources is enabled by the presence of erasure and duplication operators, which correspond to thinning and con-traction rules in the type assignment system. We introduce directly the class of $λ$ -terms and we provide a new treatment of substitution by its decompo-sition into atomic steps. We propose an intersection type assignment system for $λ$ -calculus which makes a clear correspondence between three roles of variables and three kinds of intersection types. Finally, we provide the characterisation of strong normalisation in $λ$ -calculus by means of an in-tersection type assignment system. This process uses typeability of normal forms, redex subject expansion and reducibility method.
An Adaptive Load Balancing to Provide Quality of Service
Venue: arXiv cs.NI 2014
Year: 2014

In order to utilize network resources and provide a more reliable delivery of information, multipath routing algorithms are used with a higher priority than single path routing. But providing the quality of service (QoS) requirements while load balancing is done among multiple paths is still a challenge. In this paper a new load balancing algorithm is proposed by using an explicit endpoint admission control (EEAC) to achieve a dynamic load balancing algorithm, with the ability to guarantee the end-to-end QoS for a variety of service classes. The simulation results for non deterministic network conditions show that the proposed algorithm increases the utilization of network resources and also decreases the end-to-end delay.
Knowing Your Population: Privacy-Sensitive Mining of Massive Data
Venue: arXiv cs.CY 2014
Year: 2014

Location and mobility patterns of individuals are important to environmental planning, societal resilience, public health, and a host of commercial applications. Mining telecommunication traffic and transactions data for such purposes is controversial, in particular raising issues of privacy. However, our hypothesis is that privacy-sensitive uses are possible and often beneficial enough to warrant considerable research and development efforts. Our work contends that peoples behavior can yield patterns of both significant commercial, and research, value. For such purposes, methods and algorithms for mining telecommunication data to extract commonly used routes and locations, articulated through time-geographical constructs, are described in a case study within the area of transportation planning and analysis. From the outset, these were designed to balance the privacy of subscribers and the added value of mobility patterns derived from their mobile communication traffic and transactions data. Our work directly contrasts the current, commonly held notion that value can only be added to services by directly monitoring the behavior of individuals, such as in current attempts at location-based services. We position our work within relevant legal frameworks for privacy and data protection, and show that our methods comply with such requirements and also follow best-practices
Tuning the average path length of complex networks and its influence to the emergent dynamics of the majority-rule model
Venue: arXiv cs.SI 2014
Year: 2014

We show how appropriate rewiring with the aid of Metropolis Monte Carlo computational experiments can be exploited to create network topologies possessing prescribed values of the average path length (APL) while keeping the same connectivity degree and clustering coefficient distributions. Using the proposed rewiring rules we illustrate how the emergent dynamics of the celebrated majority-rule model are shaped by the distinct impact of the APL attesting the need for developing efficient algorithms for tuning such network characteristics.
On the Behavioural Formalization of the Cognitive Middleware AWDRAT
Venue: arXiv cs.AI 2014
Year: 2014

We present our ongoing work and initial results towards the (behavioral) correctness analysis of the cognitive middleware AWDRAT. Since, the (provable) behavioral correctness of a software system is a fundamental pre-requisite of the system's security. Therefore, the goal of the work is to first formalize the behavioral semantics of the middleware as a pre-requisite for our proof of the behavioral correctness. However, in this paper, we focus only on the core and critical component of the middleware, i.e. Execution Monitor which is a part of the module "Architectural Differencer" of AWDRAT. The role of the execution monitor is to identify inconsistencies between runtime observations of the target system and predictions of the specification System Architectural Model of the system. As a starting point we have defined the formal (denotational) semantics of the observations (runtime events) and predictions (executable specifications as of System Architectural Model); then based on the aforementioned formal semantices, we have formalized the behavior of the "Execution Monitor" of the middleware.
Bayesian Image Restoration for Poisson Corrupted Image using a Latent Variational Method with Gaussian MRF
Venue: arXiv cs.CV 2014
Year: 2014

We treat an image restoration problem with a Poisson noise chan- nel using a Bayesian framework. The Poisson randomness might be appeared in observation of low contrast object in the field of imaging. The noise observation is often hard to treat in a theo- retical analysis. In our formulation, we interpret the observation through the Poisson noise channel as a likelihood, and evaluate the bound of it with a Gaussian function using a latent variable method. We then introduce a Gaussian Markov random field (GMRF) as the prior for the Bayesian approach, and derive the posterior as a Gaussian distribution. The latent parameters in the likelihood and the hyperparameter in the GMRF prior could be treated as hid- den parameters, so that, we propose an algorithm to infer them in the expectation maximization (EM) framework using loopy belief propagation(LBP). We confirm the ability of our algorithm in the computer simulation, and compare it with the results of other im- age restoration frameworks.
Learning Word Representations from Relational Graphs
Venue: arXiv cs.CL 2014
Year: 2014

Attributes of words and relations between two words are central to numerous tasks in Artificial Intelligence such as knowledge representation, similarity measurement, and analogy detection. Often when two words share one or more attributes in common, they are connected by some semantic relations. On the other hand, if there are numerous semantic relations between two words, we can expect some of the attributes of one of the words to be inherited by the other. Motivated by this close connection between attributes and relations, given a relational graph in which words are inter- connected via numerous semantic relations, we propose a method to learn a latent representation for the individual words. The proposed method considers not only the co-occurrences of words as done by existing approaches for word representation learning, but also the semantic relations in which two words co-occur. To evaluate the accuracy of the word representations learnt using the proposed method, we use the learnt word representations to solve semantic word analogy problems. Our experimental results show that it is possible to learn better word representations by using semantic semantics between words.
Knowledge Discovery in the SCADA Databases Used for the Municipal Power Supply System
Venue: arXiv cs.DC 2014
Year: 2014

This scientific paper delves into the problems related to the develop-ment of intellectual data analysis system that could support decision making to manage municipal power supply services. The management problems of mu-nicipal power supply system have been specified taking into consideration modern tendencies shown by new technologies that allow for an increase in the energy efficiency. The analysis findings of the system problems related to the integrated computer-aided control of the power supply for the city have been given. The consideration was given to the hierarchy-level management decom-position model. The objective task targeted at an increase in the energy effi-ciency to minimize expenditures and energy losses during the generation and transportation of energy carriers to the Consumer, the optimization of power consumption at the prescribed level of the reliability of pipelines and networks and the satisfaction of Consumers has been defined. To optimize the support of the decision making a new approach to the monitoring of engineering systems and technological processes related to the energy consumption and transporta-tion using the technologies of geospatial analysis and Knowledge Discovery in databases (KDD) has been proposed. The data acquisition for analytical prob-lems is realized in the wireless heterogeneous medium, which includes soft-touch VPN segments of ZigBee technology realizing the 6LoWPAN standard over the IEEE 802.15.4 standard and also the segments of the networks of cellu-lar communications. JBoss Application Server is used as a server-based plat-form for the operation of the tools used for the retrieval of data collected from sensor nodes, PLC and energy consumption record devices. The KDD tools are developed using Java Enterprise Edition platform and Spring and ORM Hiber-nate technologies.
An Approach for Reducing Outliers of Non Local Means Image Denoising Filter
Venue: arXiv cs.CV 2014
Year: 2014

We propose an adaptive approach for non local means (NLM) image filtering termed as non local adaptive clipped means (NLACM), which reduces the effect of outliers and improves the denoising quality as compared to traditional NLM. Common method to neglect outliers from a data population is computation of mean in a range defined by mean and standard deviation. In NLACM we perform the median within the defined range based on statistical estimation of the neighbourhood region of a pixel to be denoised. As parameters of the range are independent of any additional input and is based on local intensity values, hence the approach is adaptive. Experimental results for NLACM show better estimation of true intensity from noisy neighbourhood observation as compared to NLM at high noise levels. We have verified the technique for speckle noise reduction and we have tested it on ultrasound (US) image of lumbar spine. These ultrasound images act as guidance for injection therapy for treatment of lumbar radiculopathy. We believe that the proposed approach for image denoising is first of its kind and its efficiency can be well justified as it shows better performance in image restoration.
RTChoke: Efficient Real-Time Traffic Chokepoint Detection and Monitoring
Venue: arXiv cs.NI 2014
Year: 2014

We present a novel efficient adaptive sensing and monitoring solution for a system of mobile sensing devices that support traffic monitoring applications. We make a key observation that much of the variance in commute times arises at a few congestion hotspots, and a reliable estimate of congestion can be obtained by selectively monitoring congestion just at these hotspots. We design a smartphone application and a backend system that automatically identifies and monitors congestion hotspots. The solution has low resource footprint in terms of both battery usage on the sensing devices and the network bytes used for uploading data. When a user is not inside any hotspot zone, adaptive sampling conserves battery power and reduces network usage, while ensuring that any new hotspots can be effectively identified. Our results show that our application consumes 40- 80% less energy than a periodic sampling system for different routes in our experiments, with similar accuracy of congestion information. The system can be used for a variety of applications such as automatic congestion alerts to users approaching hotspots, reliable end-to-end commute time estimates and effective alternate route suggestions.
Location Verification Systems for VANETs in Rician Fading Channels
Venue: arXiv cs.NI 2014
Year: 2014

In this work we propose and examine Location Verification Systems (LVSs) for Vehicular Ad Hoc Networks (VANETs) in the realistic setting of Rician fading channels. In our LVSs, a single authorized Base Station (BS) equipped with multiple antennas aims to detect a malicious vehicle that is spoofing its claimed location. We first determine the optimal attack strategy of the malicious vehicle, which in turn allows us to analyze the optimal LVS performance as a function of the Rician $K$-factor of the channel between the BS and a legitimate vehicle. Our analysis also allows us to formally prove that the LVS performance limit is independent of the properties of the channel between the BS and the malicious vehicle, provided the malicious vehicle's antenna number is above a specified value. We also investigate how tracking information on a vehicle quantitatively improves the detection performance of an LVS, showing how optimal performance is obtained under the assumption of the tracking length being randomly selected. The work presented here can be readily extended to multiple BS scenarios, and therefore forms the foundation for all optimal location authentication schemes within the context of Rician fading channels. Our study closes important gaps in the current understanding of LVS performance within the context of VANETs, and will be of practical value to certificate revocation schemes within IEEE 1609.2.
Enhancing the SysLab System Model with State
Venue: arXiv cs.SE 2014
Year: 2014

In this report, the SYSLAB model is complemented in different ways: State-box models are provided through timed port automata, for which an operational and a corresponding denotational semantics are given. Composition is defined for components modeled in the state-box view as well as for components modeled in the black-box view. This composition is well-defined for networks of infinitely many components. To show the applicability of the model, several examples are given.
Super-Resolution Compressed Sensing: A Generalized Iterative Reweighted L2 Approach
Venue: arXiv cs.IT 2014
Year: 2014

Conventional compressed sensing theory assumes signals have sparse representations in a known, finite dictionary. Nevertheless, in many practical applications such as direction-of-arrival (DOA) estimation and line spectral estimation, the sparsifying dictionary is usually characterized by a set of unknown parameters in a continuous domain. To apply the conventional compressed sensing technique to such applications, the continuous parameter space has to be discretized to a finite set of grid points, based on which a "presumed dictionary" is constructed for sparse signal recovery. Discretization, however, inevitably incurs errors since the true parameters do not necessarily lie on the discretized grid. This error, also referred to as grid mismatch, may lead to deteriorated recovery performance or even recovery failure. To address this issue, in this paper, we propose a generalized iterative reweighted L2 method which jointly estimates the sparse signals and the unknown parameters associated with the true dictionary. The proposed algorithm is developed by iteratively decreasing a surrogate function majorizing a given objective function, resulting in a gradual and interweaved iterative process to refine the unknown parameters and the sparse signal. A simple yet effective scheme is developed for adaptively updating the regularization parameter that controls the tradeoff between the sparsity of the solution and the data fitting error. Extension of the proposed algorithm to the multiple measurement vector scenario is also considered. Numerical results show that the proposed algorithm achieves a super-resolution accuracy and presents superiority over other existing methods.