Abstract
Multi-object adaptive optics (MOAO) systems are still in their infancy: their complex optical designs for tomographic, wide-field wavefront sensing, coupled with open-loop (OL) correction, make their calibration a challenge. The correction of a discrete number of specific directions in the field allows for streamlined application of a general class of spatio-angular algorithms, initially proposed in Whiteley et al. [J. Opt. Soc. Am. A 15, 2097 (1998)], which is compatible with partial on-line calibration. The recent Learn & Apply algorithm from Vidal et al. [ J. Opt. Soc. Am. A 27, A253 (2010)] can then be reinterpreted in a broader framework of tomographic algorithms and is shown to be a special case that exploits the particulars of OL and aperture-plane phase conjugation. An extension to embed a temporal prediction step to tackle sky-coverage limitations is discussed. The trade-off between lengthening the camera integration period, therefore increasing system lag error, and the resulting improvement in SNR can be shifted to higher guide-star magnitudes by introducing temporal prediction. The derivation of the optimal predictor and a comparison to suboptimal autoregressive models is provided using temporal structure functions. It is shown using end-to-end simulations of Raven, the MOAO science, and technology demonstrator for the 8 m Subaru telescope that prediction allows by itself the use of 1-magnitude-fainter guide stars. (C) 2013 Optical Society of America

Abstract
We consider a wiretap multiple-input multiple-output multiple-eavesdropper (MIMOME) channel, where agent Alice aims at transmitting a secret message to agent Bob, while leaking no information on it to an eavesdropper agent Eve. We assume that Alice has more antennas than both Bob and Eve, and that she has only statistical knowledge of the channel towards Eve. We focus on the low-noise regime, and assess the secrecy rates that are achievable when the secret message determines the distribution of a multivariate Gaussian mixture model (GMM) from which a realization is generated and transmitted over the channel. In particular, we show that if Eve has fewer antennas than Bob, secret transmission is always possible at low-noise. Moreover, we show that in the low-noise limit the secrecy capacity of our scheme coincides with its unconstrained capacity, by providing a class of covariance matrices that allow to attain such limit without the need of wiretap coding.

Abstract
Due to the large number of optimizations provided in modern compilers and to compiler optimization specific opportunities, a Design Space Exploration (DSE) is necessary to search for the best sequence of compiler optimizations for a given code fragment (e. g., function). As this exploration is a complex and time consuming task, in this paper we present DSE strategies to select optimization sequences to both improve the performance of each function and reduce the exploration time. The DSE is based on a clustering approach which groups functions with similarities and then explore the reduced search space provided by the optimizations previously suggested for the functions in each group. The identification of similarities between functions uses a data mining method which is applied to a symbolic code representation of the source code. The DSE process uses the reduced set identified by clustering in two ways: as the design space or as the initial configuration. In both ways, the adoption of a pre-selection based on clustering allows the use of simple and fast DSE algorithms. Our experiments for evaluating the effectiveness of the proposed approach address the exploration of compiler optimization sequences considering 49 compilation passes and targeting a Xilinx MicroBlaze processor, and were performed aiming performance improvements for 41 functions. Experimental results reveal that the use of our new clustering-based DSE approach achieved a significant reduction on the total exploration time of the search space (18 x over a Genetic Algorithm approach for DSE) at the same time that important performance speedups (43% over the baseline) were obtained by the optimized codes.

Abstract
This paper presents an approach accounting for the classification of the main knowledge resources related to the new Science of Service. The main knowledge categories are defined as concepts integrated in an extended Service Science ontology. The ontology derived from several sources was captured using UML and Protege, and then, through a RDF/OWL transformation, a semantically annotated wiki has been directly implemented offering an execution of the ontology together with implemented use cases. Further, a dedicated application was developed - the Service Science Knowledge Environment (SSKE) in order to grant user access to different knowledge categories created along with the proposed ontology. The SSKE is a cloud based collaborative software service, aiming at providing co-created knowledge resources shared by academia, industry and government organizations. This application can be accessed through the Web (http://sske.cloud.upb.ro/) and it can be used for managing service related knowledge.

Abstract

Abstract
Developments in autonomic network management offer many promises, but its economic benefits are hard to assess. This paper proposes a method to calculate the OPEX gains of a typical network on the basis of a scenario, for which a management framework and autonomous mechanisms have been developed. It makes use of a novel approach, a Toy model, taking into account expert opinions as well as simulation results. The new approach allows assessment of the OPEX impact of both individual mechanisms as well as the overall impact, which, in the present scenario results in an expected OPEX saving of 11 to 13 per cent. © 2014 IEEE.