Private personalized social recommendations in an IPTV system

In our connected world, recommender systems have become widely known for their ability to provide expert and personalize referrals to end-users in different domains. The rapid growth of social networks and new kinds of systems so called “social recommender systems” are rising, where recommender systems can be utilized to find a suitable content according to end-users' personal preferences. However, preserving end-users' privacy in social recommender systems is a very challenging problem that might prevent end-users from releasing their own data, which detains the accuracy of extracted referrals. In order to gain accurate referrals, social recommender systems should have the ability to preserve the privacy of end-users registered in this system. In this paper, we present a middleware that runs on end-users' Set-top boxes to conceal their profile data when released for generating referrals, such that computation of recommendation proceeds over the concealed data. The proposed middleware is equipped with two concealment protocols to give users a complete control on the privacy level of their profiles. We present an IPTV network scenario and perform a number of different experiments to test the efficiency and accuracy of our protocols. As supported by the experiments, our protocols maintain the recommendations accuracy with acceptable privacy level.     

A greedy gradient-simulated annealing selection hyper-heuristic

Educational timetabling problem is a challenging real world problem which has been of interest to many researchers and practitioners. There are many variants of this problem which mainly require scheduling of events and resources under various constraints. In this study, a curriculum based course timetabling problem at Yeditepe University is described and an iterative selection hyper-heuristic is presented as a solution method. A selection hyper-heuristic as a high level methodology operates on the space formed by a fixed set of low level heuristics which operate directly on the space of solutions. The move acceptance and heuristic selection methods are the main components of a selection hyper-heuristic. The proposed hyper-heuristic in this study combines a simulated annealing move acceptance method with a learning heuristic selection method and manages a set of low level constraint oriented heuristics. A key goal in hyper-heuristic research is to build low cost methods which are general and can be reused on unseen problem instances as well as other problem domains desirably with no additional human expert intervention. Hence, the proposed method is additionally applied to a high school timetabling problem, as well as six other problem domains from a hyper-heuristic benchmark to test its level of generality. The empirical results show that our easy-to-implement hyper-heuristic is effective in solving the Yeditepe course timetabling problem. Moreover, being sufficiently general, it delivers a reasonable performance across different problem domains.     

Constructed wetland as a low cost and sustainable solution for wastewater treatment adapted to rural settlements: the Chorfech wastewater treatment pilot plant

The paper presents the detailed design and some preliminary results obtained from a study regarding a wastewater treatment pilot plant (WWTPP), serving as a multistage constructed wetland (CW) located at the rural settlement of 'Chorfech 24' (Tunisia). The WWTPP implemented at Chorfech 24 is mainly designed as a demonstration of sustainable water management solutions (low-cost wastewater treatment), in order to prove the efficiency of these solutions working under real Tunisian conditions and ultimately allow the further spreading of the demonstrated techniques. The pilot activity also aims to help gain experience with the implemented techniques and to improve them when necessary to be recommended for wide application in rural settlements in Tunisia and similar situations worldwide. The selected WWTPP at Chorfech 24 (rural settlement of 50 houses counting 350 inhabitants) consists of one Imhoff tank for pre-treatment, and three stages in series: as first stage a horizontal subsurface flow CW system, as second stage a subsurface vertical flow CW system, and a third horizontal flow CW. The sludge of the Imhoff tank is treated in a sludge composting bed. The performances of the different components as well as the whole treatment system were presented based on 3 months monitoring. The results shown in this paper are related to carbon, nitrogen and phosphorus removal as well as to reduction of micro-organisms. The mean overall removal rates of the Chorfech WWTPP during the monitored period have been, respectively, equal to 97% for total suspended solids and biochemical oxygen demand (BOD5), 95% for chemical oxygen demand, 71% for total nitrogen and 82% for P-PO4. The removal of E. coli by the whole system is 2.5 log units.     

Three-qubit Grover’s algorithm using superconducting quantum interference devices in cavity-QED

We present a scheme for the implementation of three-qubit Grover’s algorithm using four-level superconducting quantum interference devices (SQUIDs) coupled to a superconducting resonator. The scheme is based on resonant, off-resonant interaction of the cavity field with SQUIDs and application of classical microwave pulses. We show that adjustment of SQUID level spacings during the gate operations, adiabatic passage, and second-order detuning are not required that leads to faster implementation. We also show that the marked state can be searched with high fidelity even in the presence of unwanted off-resonant interactions, level decay, and cavity dissipation.     

Amplitudes distribution over two copies of small quantum subsystems

We propose a new formulation of quantum algorithm which allows to distribute amplitudes over two copies of small quantum subsystems. The new method gives a fixed number of copies and applied to the control of multi-qubit system. The analysis for the amount of error due to the distribution process has been presented for a system of 10 qubits with a small quantum subsystems to be copied. The present scheme provides a new way to distribute amplitudes over small quantum subsystems.     

Trust-based authentication scheme with user rating for low-resource devices in smart environments

In smart environments, pervasive computing contributes in improving daily life activities for dependent people by providing personalized services. Nevertheless, those environments do not guarantee a satisfactory level for protecting the user privacy and ensuring the trust between communicating entities. In this study, we propose a trust evaluation model based on user past and present behavior. This model is associated with a lightweight authentication key agreement protocol (Elliptic Curve-based Simple Authentication Key Agreement). The aim is to enable the communicating entities to establish a level of trust and then succeed in a mutual authentication using a scheme suitable for low-resource devices in smart environments. An innovation in our trust model is that it uses an accurate approach to calculate trust in different situations and includes a human-based feature for trust feedback, which is user rating. Finally, we tested and implemented our scheme on Android mobile phones in a smart environment dedicated for handicapped people.     

Agent societies and social networks for ubiquitous computing

In ubiquitous computing environments, providing appropriate services and information to users at the right place in the right way is challenging for many reasons: different user interests, heterogeneous devices and services, dynamic networks, information overload, or differing privacy levels, for example. Agent technology is a paradigm expected to play an increasing role in complex computing environments, and due to the increasing popularity of social networking services, we expect to see the convergence of agent and social web technologies. The goal of this theme issue is to bring together state-of-the-art research contributions that examine the convergence of agent technologies and social networks for ubiquitous computing.     

Optisim: A System Simulation Methodology for Optically Interconnected HPC Systems

Although CAD tools have significantly assisted electronic system simulation, the system-level optoelectronics modeling field has lagged behind due to a lack of simulation methodologies and tools. Optisim, a system-level modeling and simulation methodology of optical interconnects for HPC systems, can provide computer architects, designers, and researchers with a highly optimized, efficient, and accurate discrete-event environment to test various HPC systems.     

A Replicated Survey of IT Software Project Failures

Despite various industry reports about the failure rates of software projects, there's still uncertainty about the actual figures. Researchers performed a global Web survey of IT departments in 2005 and 2007. The results suggest that the software crisis is perhaps exaggerated and that most software projects deliver. However, the overall project failure rate, including cancelled and completed but poorly performing projects, remains arguably high for an applied discipline.     

A Dioid Model for Invariant Resource Sharing Problems

This paper proposes a model for invariant resource sharing problems in dioid algebra. A strong motivation for investigating the issue is the absence of a general systematic technique which can be used to tackle these problems. (min, +) constraints have been developed to handle resource sharing in Discrete-Event Dynamic Systems. In particular, the part that can be modeled by a Timed Event Graph induce (min, +)-linear equations which are constrained by the resource availability. The proposed algebraic model has been proved to describe the actual behavior of the systems dealt with. This paper will show two examples of systems that are modeled and controlled by means of this approach.