OpenRaiser/Intern-Atlas huggingface dataset:
A user profile based access control model and architecture
Venue: arXiv cs.CR 2013
Year: 2013

Personalization and adaptation to the user profile capability are the hottest issues to ensure ambient assisted living and context awareness in nowadays environments. With the growing healthcare and wellbeing context aware applications, modeling security policies becomes an important issue in the design of future access control models. This requires rich semantics using ontology modeling for the management of services provided to dependant people. However, current access control models remain unsuitable due to lack of personalization, adaptability and smartness to the handicap situation. In this paper, we propose a novel adaptable access control model and its related architecture in which the security policy is based on the handicap situation analyzed from the monitoring of userss behavior in order to grant a service using any assistive device within intelligent environment. the design of our model is an ontology-learning and evolving security policy for predicting the future actions of dependent people. This is reached by reasoning about historical data, contextual data and user behavior according to the access rules that are used in the inference engine to provide the right service according to the users needs.
A Fast Learning Algorithm for Image Segmentation with Max-Pooling Convolutional Networks
Venue: arXiv cs.CV 2013
Year: 2013

We present a fast algorithm for training MaxPooling Convolutional Networks to segment images. This type of network yields record-breaking performance in a variety of tasks, but is normally trained on a computationally expensive patch-by-patch basis. Our new method processes each training image in a single pass, which is vastly more efficient. We validate the approach in different scenarios and report a 1500-fold speed-up. In an application to automated steel defect detection and segmentation, we obtain excellent performance with short training times.
Fast Image Scanning with Deep Max-Pooling Convolutional Neural Networks
Venue: arXiv cs.CV 2013
Year: 2013

Deep Neural Networks now excel at image classification, detection and segmentation. When used to scan images by means of a sliding window, however, their high computational complexity can bring even the most powerful hardware to its knees. We show how dynamic programming can speedup the process by orders of magnitude, even when max-pooling layers are present.
Lensless Compressive Sensing Imaging
Venue: arXiv cs.CV 2013
Year: 2013

In this paper, we propose a lensless compressive sensing imaging architecture. The architecture consists of two components, an aperture assembly and a sensor. No lens is used. The aperture assembly consists of a two dimensional array of aperture elements. The transmittance of each aperture element is independently controllable. The sensor is a single detection element, such as a single photo-conductive cell. Each aperture element together with the sensor defines a cone of a bundle of rays, and the cones of the aperture assembly define the pixels of an image. Each pixel value of an image is the integration of the bundle of rays in a cone. The sensor is used for taking compressive measurements. Each measurement is the integration of rays in the cones modulated by the transmittance of the aperture elements. A compressive sensing matrix is implemented by adjusting the transmittance of the individual aperture elements according to the values of the sensing matrix. The proposed architecture is simple and reliable because no lens is used. Furthermore, the sharpness of an image from our device is only limited by the resolution of the aperture assembly, but not affected by blurring due to defocus. The architecture can be used for capturing images of visible lights, and other spectra such as infrared, or millimeter waves. Such devices may be used in surveillance applications for detecting anomalies or extracting features such as speed of moving objects. Multiple sensors may be used with a single aperture assembly to capture multi-view images simultaneously. A prototype was built by using a LCD panel and a photoelectric sensor for capturing images of visible spectrum.
Wideband Spectrum Sensing with Sub-Nyquist Sampling in Cognitive Radios
Venue: arXiv cs.IT 2013
Year: 2013

Multi-rate asynchronous sub-Nyquist sampling (MASS) is proposed for wideband spectrum sensing. Corresponding spectral recovery conditions are derived and the probability of successful recovery is given. Compared to previous approaches, MASS offers lower sampling rate, and is an attractive approach for cognitive radio networks.
Improving Quality of Service and Reducing Power Consumption with WAN accelerator in Cloud Computing Environments
Venue: arXiv cs.NI 2013
Year: 2013

The widespread use of cloud computing services is expected to deteriorate a Quality of Service and toincrease the power consumption of ICT devices, since the distance to a server becomes longer than before. Migration of virtual machines over a wide area can solve many problems such as load balancing and power saving in cloud computing environments. This paper proposes to dynamically apply WAN accelerator within the network when a virtual machine is moved to a distant center, in order to prevent the degradation in performance after live migration of virtual machines over a wide area. mSCTP-based data transfer using different TCP connections before and after migration is proposed in order to use a currently available WAN accelerator. This paper does not consider the performance degradation of live migration itself. Then, this paper proposes to reduce the power consumption of ICT devices, which consists of installing WAN accelerators as part of cloud resources actively and increasing the packet transfer rate of communication link temporarily. It is demonstrated that the power consumption with WAN accelerator could be reduced to one-tenth of that without WAN accelerator.
Update XML Views
Venue: arXiv cs.DB 2013
Year: 2013

View update is the problem of translating an update to a view to some updates to the source data of the view. In this paper, we show the factors determining XML view update translation, propose a translation procedure, and propose translated updates to the source document for different types of views. We further show that the translated updates are precise. The proposed solution makes it possible for users who do not have access privileges to the source data to update the source data via a view.
On a Catalogue of Metrics for Evaluating Commercial Cloud Services
Venue: arXiv cs.DC 2013
Year: 2013

Given the continually increasing amount of commercial Cloud services in the market, evaluation of different services plays a significant role in cost-benefit analysis or decision making for choosing Cloud Computing. In particular, employing suitable metrics is essential in evaluation implementations. However, to the best of our knowledge, there is not any systematic discussion about metrics for evaluating Cloud services. By using the method of Systematic Literature Review (SLR), we have collected the de facto metrics adopted in the existing Cloud services evaluation work. The collected metrics were arranged following different Cloud service features to be evaluated, which essentially constructed an evaluation metrics catalogue, as shown in this paper. This metrics catalogue can be used to facilitate the future practice and research in the area of Cloud services evaluation. Moreover, considering metrics selection is a prerequisite of benchmark selection in evaluation implementations, this work also supplements the existing research in benchmarking the commercial Cloud services.
Modulus Computational Entropy
Venue: arXiv cs.IT 2013
Year: 2013

The so-called {\em leakage-chain rule} is a very important tool used in many security proofs. It gives an upper bound on the entropy loss of a random variable $X$ in case the adversary who having already learned some random variables $Z_{1},\ldots,Z_{\ell}$ correlated with $X$, obtains some further information $Z_{\ell+1}$ about $X$. Analogously to the information-theoretic case, one might expect that also for the \emph{computational} variants of entropy the loss depends only on the actual leakage, i.e. on $Z_{\ell+1}$. Surprisingly, Krenn et al.\ have shown recently that for the most commonly used definitions of computational entropy this holds only if the computational quality of the entropy deteriorates exponentially in $|(Z_{1},\ldots,Z_{\ell})|$. This means that the current standard definitions of computational entropy do not allow to fully capture leakage that occurred "in the past", which severely limits the applicability of this notion. As a remedy for this problem we propose a slightly stronger definition of the computational entropy, which we call the \emph{modulus computational entropy}, and use it as a technical tool that allows us to prove a desired chain rule that depends only on the actual leakage and not on its history. Moreover, we show that the modulus computational entropy unifies other,sometimes seemingly unrelated, notions already studied in the literature in the context of information leakage and chain rules. Our results indicate that the modulus entropy is, up to now, the weakest restriction that guarantees that the chain rule for the computational entropy works. As an example of application we demonstrate a few interesting cases where our restricted definition is fulfilled and the chain rule holds.
Data Mining of the Concept "End of the World" in Twitter Microblogs
Venue: arXiv cs.SI 2013
Year: 2013

This paper describes the analysis of quantitative characteristics of frequent sets and association rules in the posts of Twitter microblogs, related to the discussion of "end of the world", which was allegedly predicted on December 21, 2012 due to the Mayan calendar. Discovered frequent sets and association rules characterize semantic relations between the concepts of analyzed subjects.The support for some fequent sets reaches the global maximum before the expected event with some time delay. Such frequent sets may be considered as predictive markers that characterize the significance of expected events for blogosphere users. It was shown that time dynamics of confidence of some revealed association rules can also have predictive characteristics. Exceeding a certain threshold, it may be a signal for the corresponding reaction in the society during the time interval between the maximum and probable coming of an event.
Information, Estimation, and Lookahead in the Gaussian channel
Venue: arXiv cs.IT 2013
Year: 2013

We consider mean squared estimation with lookahead of a continuous-time signal corrupted by additive white Gaussian noise. We show that the mutual information rate function, i.e., the mutual information rate as function of the signal-to-noise ratio (SNR), does not, in general, determine the minimum mean squared error (MMSE) with fixed finite lookahead, in contrast to the special cases with 0 and infinite lookahead (filtering and smoothing errors), respectively, which were previously established in the literature. We also establish a new expectation identity under a generalized observation model where the Gaussian channel has an SNR jump at $t=0$, capturing the tradeoff between lookahead and SNR. Further, we study the class of continuous-time stationary Gauss-Markov processes (Ornstein-Uhlenbeck processes) as channel inputs, and explicitly characterize the behavior of the minimum mean squared error (MMSE) with finite lookahead and signal-to-noise ratio (SNR). The MMSE with lookahead is shown to converge exponentially rapidly to the non-causal error, with the exponent being the reciprocal of the non-causal error. We extend our results to mixtures of Ornstein-Uhlenbeck processes, and use the insight gained to present lower and upper bounds on the MMSE with lookahead for a class of stationary Gaussian input processes, whose spectrum can be expressed as a mixture of Ornstein-Uhlenbeck spectra.
The Importance of Tie-Breaking in Finite-Blocklength Bounds
Venue: arXiv cs.IT 2013
Year: 2013

We consider upper bounds on the error probability in channel coding. We derive an improved maximum-likelihood union bound, which takes into account events where the likelihood of the correct codeword is tied with that of some competitors. We compare this bound to various previous results, both qualitatively and quantitatively. With respect to maximal error probability of linear codes, we observe that when the channel is additive, the derivation of bounds, as well as the assumptions on the admissible encoder and decoder, simplify considerably.
Linear Precoding and Equalization for Network MIMO with Partial Cooperation
Venue: arXiv cs.IT 2013
Year: 2013

A cellular multiple-input multiple-output (MIMO) downlink system is studied in which each base station (BS) transmits to some of the users, so that each user receives its intended signal from a subset of the BSs. This scenario is referred to as network MIMO with partial cooperation, since only a subset of the BSs are able to coordinate their transmission towards any user. The focus of this paper is on the optimization of linear beamforming strategies at the BSs and at the users for network MIMO with partial cooperation. Individual power constraints at the BSs are enforced, along with constraints on the number of streams per user. It is first shown that the system is equivalent to a MIMO interference channel with generalized linear constraints (MIMO-IFC-GC). The problems of maximizing the sum-rate(SR) and minimizing the weighted sum mean square error (WSMSE) of the data estimates are non-convex, and suboptimal solutions with reasonable complexity need to be devised. Based on this, suboptimal techniques that aim at maximizing the sum-rate for the MIMO-IFC-GC are reviewed from recent literature and extended to the MIMO-IFC-GC where necessary. Novel designs that aim at minimizing the WSMSE are then proposed. Extensive numerical simulations are provided to compare the performance of the considered schemes for realistic cellular systems.
Towards Technology Independent Strategies for SOA Implementations
Venue: arXiv cs.SE 2013
Year: 2013

Benefiting from the technology based strategies, Service-Oriented Architecture (SOA) has been able to achieve the general goals such as agility, flexibility, reusability and efficiency. Nevertheless, technical conditions alone cannot guarantee successful SOA implementations. As a valuable and necessary supplement, the space of technology independent strategies should also be explored. Through treating SOA system as an instance of organization and identifying the common ground on the similar process of SOA implementation and organization design, this paper uses existing work in organization theory area to inspire the research into technology independent strategies of SOA implementation. As a result, four preliminary strategies that can be applied to organizational area we identify to support SOA implementations. Furthermore, the novel methodology of investigating technology independent strategies for implementing SOA is revealed, which encourages interdisciplinary research across service-oriented computing and organization theory.
Effort-Oriented Classification Matrix of Web Service Composition
Venue: arXiv cs.SE 2013
Year: 2013

Within the service-oriented computing domain, Web service composition is an effective realization to satisfy the rapidly changing requirements of business. Therefore, the research into Web service composition has unfolded broadly. Since examining all of the related work in this area becomes a mission next to impossible, the classification of composition approaches can be used to facilitate multiple research tasks. However, the current attempts to classify Web service composition do not have clear objectives. Furthermore, the contexts and technologies of composition approaches are confused in the existing classifications. This paper proposes an effort-oriented classification matrix for Web service composition, which distinguishes between the context and technology dimension. The context dimension is aimed at analyzing the environment influence on the effort of Web service composition, while the technology dimension focuses on the technique influence on the effort. Consequently, besides the traditional classification benefits, this matrix can be used to build the basis of cost estimation for Web service composition in future research.
Introducing Speculation in Self-Stabilization - An Application to Mutual Exclusion
Venue: arXiv cs.DC 2013
Year: 2013

Self-stabilization ensures that, after any transient fault, the system recovers in a finite time and eventually exhibits. Speculation consists in guaranteeing that the system satisfies its requirements for any execution but exhibits significantly better performances for a subset of executions that are more probable. A speculative protocol is in this sense supposed to be both robust and efficient in practice. We introduce the notion of speculative stabilization which we illustrate through the mutual exclusion problem. We then present a novel speculatively stabilizing mutual exclusion protocol. Our protocol is self-stabilizing for any asynchronous execution. We prove that its stabilization time for synchronous executions is diam(g)/2 steps (where diam(g) denotes the diameter of the system). This complexity result is of independent interest. The celebrated mutual exclusion protocol of Dijkstra stabilizes in n steps (where n is the number of processes) in synchronous executions and the question whether the stabilization time could be strictly smaller than the diameter has been open since then (almost 40 years). We show that this is indeed possible for any underlying topology. We also provide a lower bound proof that shows that our new stabilization time of diam(g)/2 steps is optimal for synchronous executions, even if asynchronous stabilization is not required.
What can be decided locally without identifiers?
Venue: arXiv cs.DC 2013
Year: 2013

Do unique node identifiers help in deciding whether a network $G$ has a prescribed property $P$? We study this question in the context of distributed local decision, where the objective is to decide whether $G \in P$ by having each node run a constant-time distributed decision algorithm. If $G \in P$, all the nodes should output yes; if $G \notin P$, at least one node should output no. A recent work (Fraigniaud et al., OPODIS 2012) studied the role of identifiers in local decision and gave several conditions under which identifiers are not needed. In this article, we answer their original question. More than that, we do so under all combinations of the following two critical variations on the underlying model of distributed computing: ($B$): the size of the identifiers is bounded by a function of the size of the input network; as opposed to ($\neg B$): the identifiers are unbounded. ($C$): the nodes run a computable algorithm; as opposed to ($\neg C$): the nodes can compute any, possibly uncomputable function. While it is easy to see that under ($\neg B, \neg C$) identifiers are not needed, we show that under all other combinations there are properties that can be decided locally if and only if identifiers are present. Our constructions use ideas from classical computability theory.
A Study on Spectral Efficiency of Physical Layer over Cognitive Radio
Venue: arXiv cs.ET 2013
Year: 2013

Despite the conclusive potential of cognitive radio for provisioning the dynamic and flexible spectrum/channel allocation, the research community should study the performance gain of physical layer over such a radio with cognition capabilities. To this end, several mechanisms of physical layers such as adaptive modulation, multiple-input multiple output antennas; channel coding and/or combination of them should be studied. These studies should be accomplished in terms of spectral efficiency. Therefore, the gain of cognitive radio in wireless networks available into the market will be identified practically. Another issue under consideration should be the performance evaluation of cognitive radio assuming a cross-layer combination between the cognitive physical and the upper layers. To this direction, this paper presents a study on spectral efficiency at the physical layer with cognitive capabilities. In sequel, we study a cross-layer combination of physical layer with upper layers in the same cognitive context. The performance gain of cognitive radio in such a physical layer is realized practically as well as a few cross-layer design issues have been raised.
A new bio-inspired method for remote sensing imagery classification
Venue: arXiv cs.NE 2013
Year: 2013

The problem of supervised classification of the satellite image is considered to be the task of grouping pixels into a number of homogeneous regions in space intensity. This paper proposes a novel approach that combines a radial basic function clustering network with a growing neural gas include utility factor classifier to yield improved solutions, obtained with previous networks. The double objective technique is first used to the development of a method to perform the satellite images classification, and finally, the implementation to address the issue of the number of nodes in the hidden layer of the classic Radial Basis functions network. Results demonstrating the effectiveness of the proposed technique are provided for numeric remote sensing imagery. Moreover, the remotely sensed image of Oran city in Algeria has been classified using the proposed technique to establish its utility.
Voice over IP in the WiFi Network business models: Will voice be a killer application for WiFi Public Networks?
Venue: arXiv cs.NI 2013
Year: 2013

The stunning growth of WiFi networks, together with the spreading of mobile telephony and the increasing use of Voice over IP (VoIP) on top of Internet, pose relevant questions on the application of WiFi networks to support VoIP services that could be used as a complement and/or competition to the 2G/3G cellular networks. The paper explores the state of the art on the capability of WiFi networks to support voice services in a user itinerant context, identifying actual and future strengths, weakness, opportunities and threats. First of all, the paper reviews the key aspects on the changing structure of the voice market, dominated by a clear evolution to mobility, itinerancy and increased use of VoIP-based services. The evolution of business models, coverage for WiFi networks (hotspots, municipal networks, cooperative networks and) and user voice service use patterns are also analysed in order to asses the potentialities for complementing or -in some scenarios- substitute the cellular networks.
Polar-Coded Modulaton
Venue: arXiv cs.IT 2013
Year: 2013

A framework is proposed that allows for a joint description and optimization of both binary polar coding and $2^m$-ary digital pulse-amplitude modulation (PAM) schemes such as multilevel coding (MLC) and bit-interleaved coded modulation (BICM). The conceptual equivalence of polar coding and multilevel coding is pointed out in detail. Based on a novel characterization of the channel polarization phenomenon, rules for the optimal choice of the labeling in coded modulation schemes employing polar codes are developed. Simulation results regarding the error performance of the proposed schemes on the AWGN channel are included.
Output Filter Aware Optimization of the Noise Shaping Properties of ΔΣ Modulators via Semi-Definite Programming
Venue: arXiv cs.IT 2013
Year: 2013

The Noise Transfer Function (NTF) of ΔΣ modulators is typically designed after the features of the input signal. We suggest that in many applications, and notably those involving D/D and D/A conversion or actuation, the NTF should instead be shaped after the properties of the output/reconstruction filter. To this aim, we propose a framework for optimal design based on the Kalman-Yakubovich-Popov (KYP) lemma and semi-definite programming. Some examples illustrate how in practical cases the proposed strategy can outperform more standard approaches.