There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality.

Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

I and i

Matrix Factorization Techniques for Recommender Systems

/pdf/a-break-in-the-clouds-towards-a-cloud-definition-svovsw1r5a.pdf

A Break in the Clouds: Towards a Cloud Definition

Network virtualization is recognized as an enabling technology for the future Internet. It aims to overcome the resistance of the current Internet to architectural change. Application of this technology relies on algorithms that can instantiate virtualized networks on a substrate infrastructure, optimizing the layout for service-relevant metrics. This class of algorithms is commonly known as "Virtual Network Embedding (VNE)" algorithms. This paper presents a survey of current research in the VNE area. Based upon a novel classification scheme for VNE algorithms a taxonomy of current approaches to the VNE problem is provided and opportunities for further research are discussed.

Virtual Network Embedding: A Survey

In the past five years there has been a dramatic increase in work on Search-Based Software Engineering (SBSE), an approach to Software Engineering (SE) in which Search-Based Optimization (SBO) algorithms are used to address problems in SE. SBSE has been applied to problems throughout the SE lifecycle, from requirements and project planning to maintenance and reengineering. The approach is attractive because it offers a suite of adaptive automated and semiautomated solutions in situations typified by large complex problem spaces with multiple competing and conflicting objectives.This article1 provides a review and classification of literature on SBSE. The work identifies research trends and relationships between the techniques applied and the applications to which they have been applied and highlights gaps in the literature and avenues for further research.

/pdf/search-based-software-engineering-trends-techniques-and-3b0bwaagfi.pdf

Search-based software engineering: Trends, techniques and applications

Recently, reconciling social networks receives significant attention. Most of the existing studies have

limitations in the following three aspects: multiplicity, comprehensiveness and robustness. To address

these three limitations, we rethink this problem and propose the MASTER framework, i.e., across Multiple social networks, integrate Attribute and STructure Embedding for Reconciliation. In this framework, we first design a novel Constrained Dual Embedding model by simultaneously embedding and reconciling multiple social networks to formulate our problem into a unified optimization. To address this optimization, we then design an effective algorithm called NS-Alternating. We also prove that this algorithm converges to KKT points. Through extensive experiments on real-world datasets, we demonstrate that MASTER outperforms the state-of-the-art approaches.

/pdf/master-across-multiple-social-networks-integrate-attribute-5eszfdzphp.pdf

MASTER: across Multiple social networks, integrate Attribute and STructure Embedding for Reconciliation.

Frequent itemset mining (FIM) is one of the most fundamental problems in data mining. It has practical importance in a wide range of application areas such as decision support, Web usage mining, bioinformatics, etc. Given a database, where each transaction contains a set of items, FIM tries to find itemsets that occur in transactions more frequently than a given threshold. Despite valuable insights the discovery of frequent itemsets can potentially provide, if the data is sensitive (e.g., web browsing history and medical records), releasing the discovered frequent itemsets might pose considerable threats to individual privacy.

Differentially private frequent itemset mining via transaction splitting

How to achieve energy efficiency to run a cloud data center is a major challenge in the era of rising electricity cost and environmental protection. Various techniques have been devised to help reduce energy consumption for cloud data centers that consist of a large number of identical servers, including dynamic allocation of active servers, consolidating diverse applications to run on them, and adjusting the CPU speed of an active server. Leveraging these techniques, we use an Online Coloring Bin Packing problem to model the consolidation problem and devise an effective application-aware approximation algorithm to find a near-optimal solution. We show a 1.7 asymptotic approximation ratio. We then apply a Predictive Bayesian Network model to identify daily workload patterns and adjust resource provisioning accordingly. We evaluate our approaches using traces collected from a real data center and demonstrate that (1) our prediction algorithm is effective in estimating future demands, (2) our coordinated approaches can provide significant savings of energy and operational costs close to the near-optimal offline solution, and (3) our approaches incur little reliability costs in term of wear-and-tear of server components.

Reducing Operational Costs through Consolidation with Resource Prediction in the Cloud

In service oriented architecture (SOA), service composition is a promising way to create new services. However, some technical challenges are hindering the application of service composition. One of the greatest challenges for composite service provider is to select a set of services to instantiate composite service with end-to-end quality of service (QoS) assurance across different autonomous networks and business regions. This paper presents an iterative service selection algorithm for quality driven service composition. The algorithm runs on a peer-to-peer (P2P) service execution environment — distributed intelligent service execution (DISE), which provides scalable QoS registry, dynamic service selection and service execution services. The most significant feature of our iterative service selection algorithm is that it can work on a centralized QoS registry as well as cross decentralized ones. Network status is an optional factor in our QoS model and selection algorithm. The algorithm iteratively selects services following service execution order, so it can be applied either before service execution or at service run-time without any modification. We test our algorithm with a series of experiments on DISE. Experimental results illustrated its excellent selection and outstanding performance.

Sen Su

Papers

MASTER: across Multiple social networks, integrate Attribute and STructure Embedding for Reconciliation.

Differentially private frequent itemset mining via transaction splitting

Reducing Operational Costs through Consolidation with Resource Prediction in the Cloud

Iterative selection algorithm for service composition in distributed environments

Adaptive multi-objective artificial immune system based virtual network embedding