ppxscal/embedding_network huggingface dataset:
Designing for user experience: what to expect from mobile 3d tv and video?
Authors: Satu Jumisko-Pyykkö, Mandy Weitzel, Dominik Strohmeier
Venue: Proceeding of the 1st international conference on Designing interactive user experiences for TV and video (2008)

A long process has been undertaken to develop the technology of 3D video for consumer products, but studies to determine the needs and expectations of actual users have been disregarded. The object of this study is to examine users' needs, expectations and requirements for mobile 3D television and video. We conducted three user studies applying triangulation methodology of the extensive survey, focus groups and probe studies to identify the requirements. The results are presented in the form of guidelines which highlight the characteristics of users, the system and service required including what content is interesting and the context in which it will be used. Both academia and industry can benefit from knowledge of these requirements when designing the further studies and development work concerning the user experience of 3D television and video.
Analysis and approximation of optimal co-scheduling on chip multiprocessors
Authors: Yunlian Jiang, Xipeng Shen, Jie Chen, Rahul Tripathi
Venue: Proceedings of the 17th international conference on Parallel architectures and compilation techniques (2008)

Cache sharing among processors is important for Chip Multiprocessors to reduce inter-thread latency, but also brings cache contention, degrading program performance considerably. Recent studies have shown that job co-scheduling can effectively alleviate the contention, but it remains an open question how to efficiently find optimal co-schedules. Solving the question is critical for determining the potential of a co-scheduling system. This paper presents a theoretical analysis of the complexity of co-scheduling, proving its NP-completeness. Furthermore, for a special case when there are two sharers per chip, we propose an algorithm that finds the optimal co-schedules in polynomial time. For more complex cases, we design and evaluate a sequence of approximation algorithms, among which, the hierarchical matching algorithm produces near-optimal schedules and shows good scalability. This study facilitates the evaluation of co-scheduling systems, as well as offers some techniques directly usable in proactive job co-scheduling.
Analog circuit optimization system based on hybrid evolutionary algorithms
Authors: Bo Liu, Yan Wang, Zhiping Yu, Leibo Liu, Miao Li, Zheng Wang, Jing Lu, Francisco V. Fernández
Venue: Integration, the VLSI Journal (2009)

This paper investigates a hybrid evolutionary-based design system for automated sizing of analog integrated circuits (ICs). A new algorithm, called competitive co-evolutionary differential evolution (CODE), is proposed to design analog ICs with practical user-defined specifications. On the basis of the combination of HSPICE and MATLAB, the system links circuit performances, evaluated through electrical simulation, to the optimization system in the MATLAB environment, once a circuit topology is selected. The system has been tested by typical and hard-to-design cases, such as complex analog blocks with stringent design requirements. The results show that the design specifications are closely met, even in highly-constrained situations. Comparisons with available methods like genetic algorithms and differential evolution, which use static penalty functions to handle design constraints, have also been carried out, showing that the proposed algorithm offers important advantages in terms of optimization quality and robustness. Moreover, the algorithm is shown to be efficient.
Boosting collaborative filtering based on statistical prediction errors
Authors: Shengchao Ding, Shiwan Zhao, Quan Yuan, Xiatian Zhang, Rongyao Fu, Lawrence Bergman
Venue: Proceedings of the 2008 ACM conference on Recommender systems (2008)

User-based collaborative filtering methods typically predict a user's item ratings as a weighted average of the ratings given by similar users, where the weight is proportional to the user similarity. Therefore, the accuracy of user similarity is the key to the success of the recommendation, both for selecting neighborhoods and computing predictions. However, the computed similarities between users are somewhat inaccurate due to data sparsity. For a given user, the set of neighbors selected for predicting ratings on different items typically exhibit overlap. Thus, error terms contributing to rating predictions will tend to be shared, leading to correlation of the prediction errors. Through a set of case studies, we discovered that for a given user, the prediction errors on different items are correlated to the similarities of the corresponding items, and to the degree to which they share common neighbors. We propose a framework to improve prediction accuracy based on these statistical prediction errors. Two different strategies to estimate the prediction error on a desired item are proposed. Our experiments show that these approaches improve the prediction accuracy of standard user based methods significantly, and they outperform other state-of-the-art methods.
A Bayesian network and analytic hierarchy process based personalized recommendations for tourist attractions over the Internet
Authors: Yuxia Huang, Ling Bian
Venue: Expert Systems with Applications: An International Journal (2009)

Selecting tourist attractions to visit at a destination is a main stage in planning a trip. Although various online travel recommendation systems have been developed to support users in the task of travel planning during the last decade, few systems focus on recommending specific tourist attractions. In this paper, an intelligent system to provide personalized recommendations of tourist attractions in an unfamiliar city is presented. Through a tourism ontology, the system allows integration of heterogeneous online travel information. Based on Bayesian network technique and the analytic hierarchy process (AHP) method, the system recommends tourist attractions to a user by taking into account the travel behavior both of the user and of other users. Spatial web services technology is embedded in the system to provide GIS functions. In addition, the system provides an interactive geographic interface for displaying the recommendation results as well as obtaining users' feedback. The experiments show that the system can provide personalized recommendations on tourist attractions that satisfy the user.
Distributing Orthogonal Redundancy on Adaptive Disk Arrays
Authors: J. L. Gonzalez, Toni Cortes
Venue: Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part I on On the Move to Meaningful Internet Systems: (2008)

When upgrading storage systems, the key is migrating data from old storage subsystems to the new ones for achieving a data layout able to deliver high performance I/O, increased capacity and strong data availability while preserving the effectiveness of its location method.However, achieving such data layout is not trivial when handling a redundancy scheme because the migration algorithm must guarantee both data and redundancy will not be allocated on the same disk. The Orthogonal redundancy for instance delivers strong data availability for distributed disk arrays but this scheme is basically focused on homogeneous and static environments and a technique that moves overall data layout called re-striping is applied when upgrading it.This paper presents a deterministic placement approach for distributing orthogonal redundancy on distributed heterogeneous disk arrays, which is able to adapt on-line the storage system to the capacity/performance demands by only moving a fraction of data layout.The evaluation reveals that our proposal achieve data layouts delivering an improved performance and increased capacity while keeping the effectiveness of the redundancy scheme even after several migrations. Finally, it keeps the complexity of the data management at an acceptable level.
Constrained locally weighted clustering
Authors: Hao Cheng, Kien A. Hua, Khanh Vu
Venue: Proceedings of the VLDB Endowment (2008)

Data clustering is a difficult problem due to the complex and heterogeneous natures of multidimensional data. To improve clustering accuracy, we propose a scheme to capture the local correlation structures: associate each cluster with an independent weighting vector and embed it in the subspace spanned by an adaptive combination of the dimensions. Our clustering algorithm takes advantage of the known pairwise instance-level constraints. The data points in the constraint set are divided into groups through inference; and each group is assigned to the feasible cluster which minimizes the sum of squared distances between all the points in the group and the corresponding centroid. Our theoretical analysis shows that the probability of points being assigned to the correct clusters is much higher by the new algorithm, compared to the conventional methods. This is confirmed by our experimental results, indicating that our design indeed produces clusters which are closer to the ground truth than clusters created by the current state-of-the-art algorithms.
Tabu search-based metaheuristic algorithm for software system reliability problems
Authors: M. Caserta, A. Márquez Uribe
Venue: Computers and Operations Research (2009)

This paper presents a new metaheuristic-based algorithm for complex reliability problems. The algorithm effectively uses features of the Tabu Search paradigm, with special emphasis on the exploitation of memory-based mechanisms. It balances intensification with diversification via the use of short-term and long-term memory. The algorithm has been thoroughly tested on benchmark problems from the literature as well as on a pool of random generated instances of very large scale software systems. The proposed algorithm proves to be robust with respect to its parameters and it is especially suited for very large scale instances of the reliability problem, when exact approaches are doomed to fail.
Dependable cardinality forecasts for XQuery
Authors: Jens Teubner, Torsten Grust, Sebastian Maneth, Sherif Sakr
Venue: Proceedings of the VLDB Endowment (2008)

Though inevitable for effective cost-based query rewriting, the derivation of meaningful cardinality estimates has remained a notoriously hard problem in the context of XQuery. By basing the estimation on a relational representation of the XQuery syntax, we show how existing cardinality estimation techniques for XPath and proven relational estimation machinery can play together to yield dependable forecasts for arbitrary XQuery (sub)expressions. Our approach benefits from a light-weight form of data flow analysis. Abstract domain identifiers guide our query analyzer through the estimation process and allow for informed decisions even in case of deeply nested XQuery expressions. A variant of projection paths [15] provides a versatile interface into which existing techniques for XPath cardinality estimation can be plugged in seamlessly. We demonstrate an implementation of this interface based on data guides. Experiments show how our approach can equally cope with both, structure-and value-based queries. It is robust with respect to intermediate estimation errors, from which we typically found our implementation to recover gracefully.
Rate-optimal schemes for Peer-to-Peer live streaming
Authors: Laurent Massoulié, Andrew Twigg
Venue: Performance Evaluation (2008)

In this paper we consider the problem of sending data in real time from information sources to sets of receivers, using peer-to-peer communications. We consider several network models and for each model we identify schemes that achieve successful diffusion of data at optimal rates. For edge-capacitated networks, we show optimality of the so-called ''random-useful'' packet forwarding algorithm. As a byproduct, we obtain a novel proof of a famous theorem of Edmonds, characterising the broadcast capacity of a capacitated graph. For node-capacitated networks, assuming a complete communication graph, we show optimality of the so-called ''most-deprived'' neighbour selection scheme combined with random useful packet selection. We then show that optimality is preserved when each peer can exchange data with a limited number of neighbours, when neighbourhoods are dynamically adapted according to a particular scheme. Finally, we consider the case of multiple information sources, each creating distinct information to be disseminated to a specific set of receivers. In this context, we prove optimality of the so-called ''bundled most-deprived neighbour random useful packet'' selection.
Robust recommender systems
Authors: Robin D. Burke
Venue: Proceedings of the 2008 ACM conference on Recommender systems (2008)

This tutorial will discuss vulnerabilities of collaborative recommendation algorithms: attacks that can be mounted against them and possible defenses that can be used. The tutorial will be of interest to researchers and practitioners in the area of collaborative recommendation.
Modeling the energy cost of applications on portable wireless devices
Authors: Rajesh Palit, Ajit Singh, Kshirasagar Naik
Venue: Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems (2008)

Extending the battery life of portable wireless devices has been in the focus of researchers for close to a decade. Several energy management techniques have been investigated at different levels of system design -- starting from silicon at the bottom to application design at the top, with communication protocols and operating system in between. In this paper, we present a model to estimate the energy cost of an application running on a portable wireless device. To develop the cost model, we partition a wireless device into two components, namely, computation and communication. Each component is modeled by a state-transition diagram. Two attributes are associated with each state: an average power cost and a state residence time. The cost of each state of the state-transition diagrams is validated by actual measurements. For a constant voltage supply, the average power cost of a state is denoted by the average current drawn by the component. The state residence times are estimated from the behavior of applications. The cost model has been validated by performing actual measurement of energy cost. We find that the estimated cost and the actual energy cost are within 5-10% of each other. This study will help us in improving the design of energy efficient software for portable devices. Moreover, the energy consumption breakdown into components will be an essential guide for future research in energy management of hardware and software systems.
A design-centric view of the economy: abstract
Authors: Carliss Y. Baldwin
Venue: Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering (2008)

Designs are the instructions based on knowledge that turn resources into things that people use and value. All goods and services have designs, and a new design lies behind every innovation. Following Herbert Simon, I argue that designs can be studied scientifically and deserve focused attention from scholars in a number of disciplines.
Interactive classification for pre-integrated volume rendering of high-precision volume data
Authors: Heewon Kye, Byeong-Seok Shin, Yeong Gil Shin
Venue: Graphical Models (2008)

The pre-integrated volume rendering technique is widely used for creating high quality images. It produces good images even though the transfer function is nonlinear. Because the size of the pre-integration lookup table is proportional to the square of data precision, the required storage and computation load steeply increase for rendering of high-precision volume data. In this paper, we propose a method that approximates the pre-integration function proportional to the data precision. Using the arithmetic mean instead of the geometric mean and storing opacity instead of extinction density, this technique reduces the size and the update time of the pre-integration lookup table so that it classifies high-precision volume data interactively. We demonstrate performance gains for typical renderings of volume datasets.
How healthy are today's enterprise networks?
Authors: Saikat Guha, Jaideep Chandrashekar, Nina Taft, Konstantina Papagiannaki
Venue: Proceedings of the 8th ACM SIGCOMM conference on Internet measurement (2008)

In this paper we take a look at the health of a typical enterprise network via a new metric based on the fraction of useful flows generated by endhosts. Flows considered non-useful are those that explicitly fail or else do not elicit a response from the intended destination. Examining traces collected from a large number of mobile hosts in an enterprise network, we find that about 34% of the flows are not useful. Through our study that combines data analysis and ongoing interactions with our IT department, we learn that these non-useful flows arise from several causes. Our mobile hosts frequently change environments, by either moving in and out of the corporate environment, or by switching the point and means of attachment to the corporate network. We find that many of the failures occur due to the hosts' lack of environment awareness, which results in attempts to discover services that are not present in all environments. Other causes include misconfiguration, unnecessary broadcast traffic, and excessive connection retries. Understanding this ever present noise in endhost communication is important for a variety of reasons including the fact that it complicates anomaly detection design and wastes resources, the latter of which is particularly crucial for wireless and mobile environments. Finally, we discuss possible means to design applications and services that can significantly improve the health of the network.
An AHP-based decision-making tool for the solution of multiproduct batch plant design problem under imprecise demand
Authors: Alberto A. Aguilar-Lasserre, Marco A. Bautista Bautista, Antonin Ponsich, Magno A. González Huerta
Venue: Computers and Operations Research (2009)

This paper addresses the problem of the optimal design of batch plants with imprecise demands in product amounts. The design of such plants necessarily involves the way that equipment may be utilized, which means that plant scheduling and production must form an integral part of the design problem. This work relies on a previous study, which proposed an alternative treatment of the imprecision (demands) by introducing fuzzy concepts, embedded in a multi-objective Genetic Algorithm (GA) that takes into account simultaneously maximization of the net present value (NPV) and two other performance criteria, i.e. the production delay/advance and a flexibility criterion. The results showed that an additional interpretation step might be necessary to help the managers choosing among the non-dominated solutions provided by the GA. The analytic hierarchy process (AHP) is a strategy commonly used in Operations Research for the solution of this kind of multicriteria decision problems, allowing the apprehension of manager subjective judgments. The major aim of this study is thus to propose a software integrating the AHP theory for the analysis of the GA Pareto-optimal solutions, as an alternative decision-support tool for the batch plant design problem solution.
State-of-the-art on spatio-temporal information-based video retrieval
Authors: W. Ren, S. Singh, M. Singh, Y. S. Zhu
Venue: Pattern Recognition (2009)

Video retrieval is increasingly based on image content. A number of studies on video retrieval have used low-level pixel content related to statistical moments, shape, colour and texture. However, it is well recognised that such information is not enough for uniquely discriminating across different multimedia content. The use of semantic information, especially which derived from spatio-temporal analysis is of great value in multimedia annotation, archiving and retrieval. In this review paper, we detail how the use of spatiotemporal semantic knowledge is changing the way in which modern research the conducted. In this paper we review a number of studies and concepts related to such analysis, and draw important conclusions on where future research is headed.
Toward Quantum Matchmaker Agents
Authors: Matthias Klusch
Venue: Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 02 (2008)

Intelligent agents in the Quantum Internet are supposed to operate on networked hybrid quantum computers to individually or jointly accomplish their goals by means of both classical and quantum computation, and communication. We present initial quantum-based solutions to the classical coordination problem of service matchmaking which can be performed under certain conditions more efficient and secure than in the classical case.
Comments on ‘On correcting the overestimation of the permutation-based false discovery rate estimator’
Authors: Yang Xie
Venue: Bioinformatics (2008)

Contact: Yang.xie@utsouthwestern.edu
Databases, data tombs and dust in the wind
Authors: Jonathan D. Wren, Alex Bateman
Venue: Bioinformatics (2008)

Contact: jdwren@gmail.com As biomedical data accumulates, the need to store, share and organize it grows. Consequently, the number of Internet-accessible databases has been rapidly growing on an annual basis. Bioinformatics regularly publishes descriptions of biomedically relevant databases, Nucleic Acids Research has published an annual database issue since 1996 and now a new open-access journal, Database: The Journal of Biological Databases and Curation, will soon be launched by Oxford University Press in 2009 ( http://www.oxfordjournals.org/our_journals/databa/). Since databases can be made publicly available on the Internet without publication, it is worth considering what factors prioritize publication of database descriptions in a peer-reviewed journal. In general, publication of a database description in a journal advertises it as a valuable resource for scientific research. Implicitly, it is assumed that this resource is publicly available (most likely for free) and will be maintained. However, therein lies the problem: Database papers are simply not of the same nature as regular research articles. Over time, some databases simply become inaccessible, some are created but not maintained or updated, and some databases are never used (Galperin, 2006). Thus, for database creators, reviewers and journal editors, there are several additional considerations to judge, prior to publication, how potentially valuable these new databases may be.
A time-predictable system initialization design for huge-capacity flash-memory storage systems
Authors: Chin-Hsien Wu
Venue: Proceedings of the 6th IEEE/ACM/IFIP international conference on Hardware/Software codesign and system synthesis (2008)

The capacity of flash-memory storage systems grows at a speed similar to many other storage systems. In order to properly manage the product cost, vendors face serious challenges in system designs. How to provide an expected system initialization time for huge-capacity flash-memory storage systems has become an important research topic. In this paper, a time-predictable system initialization design is proposed for huge-capacity flash-memory storage systems. The objective of the design is to provide an expected system initialization time based on a coarse-grained flash translation layer. The time-predictable analysis of the design is provided to discuss the relation between the size of main memory and the system initialization time. The system initialization time can be also estimated and predicted by the time-predictable analysis.