<title>Enriching text with images and colored light</title>
Proceedings of SPIE, Jan 27, 2008
Page 1. Enriching text with images and colored light Dragan Sekulovski a and Gijs Geleijnse a and... more Page 1. Enriching text with images and colored light Dragan Sekulovski a and Gijs Geleijnse a and Bram Kater a and Jan Korst a and Steffen Pauws a and Ramon Clout a a Philips Research Europe, High Tech Campus 34, 5656 AE, Eindhoven, the Netherlands ABSTRACT ...
International Symposium/Conference on Music Information Retrieval, 2006
We present a novel approach in categorizing artists into subjective categories such as genre. We ... more We present a novel approach in categorizing artists into subjective categories such as genre. We base our method on co-occurrences on the web, found with the Google search engine. A direct mapping between artists and categories proved to be unreliable. We use the categories mapped to closely related artists to obtain a more reliable mapping. The method is tested on a genre classification test set with convincing results. Moreover, mood categorization is explored using the same techniques.
International Symposium/Conference on Music Information Retrieval, 2006
We present a novel method to extract lyrics from the Web. The aim is to extract a set of multiple... more We present a novel method to extract lyrics from the Web. The aim is to extract a set of multiple versions of the lyrics to a song. Lyrics can be identified within a text by a regular expression. We use a projection of a document to efficiently identify lyrics within the document by mapping it to a regular expression. We describe a method to cluster the multiple versions of the lyrics by filtering out erroneous texts such as lyrics to other songs. For reasons of efficiency, we do this by comparing fingerprints instead of the texts themselves.
Workshops on Enabling Technologies: Infrastracture for Collaborative Enterprises, Jun 18, 2007
Recent advances in tracking technology have led to the design of digital tables that support inte... more Recent advances in tracking technology have led to the design of digital tables that support interaction using multifinger input and physical objects. However, the tradeoffs between these input modalities are not clear, making it difficult for developers to make informed decisions when choosing input strategies for digital table systems. In this paper, we consider the role that multi-finger input and physical objects play in the design of collaborative tabletop systems. We present the results of an observational study of group work on regular tables, and an experimental study of interaction techniques for supporting group handoff. Our results show that people often perform several explicit communication and coordination activities that involve epistemic and pragmatic movements of physical tools. Further, our experimental results suggest that using physical objects to control digital information improves performance over using finger gestures.
A visualization of family relations inspired by the London metro map
We propose a new visualization of family relations, called family metro map, which is inspired by... more We propose a new visualization of family relations, called family metro map, which is inspired by the famous London Underground Map. A family is represented by a metro line, where the parents are the end nodes and the children the intermediate nodes. We introduce family trees as rooted binary trees and consider the problem of automatically drawing a family metro map for a given family tree without crossing line segments, where the successive nodes of a metro line are placed at equal distances. The inter-node distance may be chosen to depend on the generation of the family, such that metro lines of earlier generations are shown more prominently than metro lines of later generations.
In an in-home digital network several data streams (audio, video) may run simultaneously over a s... more In an in-home digital network several data streams (audio, video) may run simultaneously over a shared communication device, e.g. a bus. The burstiness of a data stream can be reduced by buffering data at the sending and receiving side, thereby allowing a lower bus share allocation for the stream. In this paper we present an algorithm that determines how much of the bus capacity and buffer space should be allocated to each stream, in order to have a feasible transmission schedule for each stream. Furthermore, the algorithm determines a transmission schedule for each stream, indicating how much data is transmitted over time. We model the problem as a linear program and apply a Dantzig-Wolfe decomposition such that the multiplestream problem can be solved by repeatedly solving single-stream problems. For these single-stream problems we briefly describe efficient algorithms to solve them.
We investigate a generalized assignment problem where the resource requirements are either 1 or 2... more We investigate a generalized assignment problem where the resource requirements are either 1 or 2. This problem is motivated by a question that arises when data blocks are to be retrieved from parallel disks as efficiently as possible. The resulting problem is to assign jobs to machines with a given capacity, where each job takes either one or two units of machine capacity, and must satisfy certain assignment restrictions, such that total weight of the assigned jobs is maximized. We derive a ~-approximation result for this problem based on relaxing a formulation of the problem so that the resulting constraint matrix is totally unimodular. Further, we prove that the LP-relaxation of a special case of the problem is half-integral, and we derive a weak persistency property.
DOI to the publisher's website. • The final author version and the galley proof are versions of t... more DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal. If the publication is distributed under the terms of Article 25fa of the Dutch Copyright Act, indicated by the "Taverne" license above, please follow below link for the End User Agreement:
We consider the problem of determining the minimum number Nd of unit disks that is required to bl... more We consider the problem of determining the minimum number Nd of unit disks that is required to block all rays emanating from a point P in the two-dimensional space, where each disk has at least a distance d to point P and to any other disk. We study the asymptotic behavior of Nd, as d tends to infinity. By deriving
Recommender systems typically require feedback from the user to learn the user's taste. This feed... more Recommender systems typically require feedback from the user to learn the user's taste. This feedback can come in two forms: explicit and implicit. Explicit feedback consists of ratings provided by the user for a number of items, while implicit feedback comes from observing user actions on items. These actions have to be interpreted by the recommender system and translated into a rating. In this paper we propose a method to learn how to translate user actions on items to ratings on these items by correlating user actions with explicit feedback. We do this by associating user actions to rated items and subsequently applying naive Bayesian classification to rate new items with which the user has interacted. We apply and evaluate our method on data from a web-based music service and we show its potential as an addition to explicit rating.
Given a set of n data objects and their pairwise dissimilarities, the goal of the minimum quartet... more Given a set of n data objects and their pairwise dissimilarities, the goal of the minimum quartet tree cost (MQTC) problem is to construct an optimal tree from the total number of possible combinations of quartet topologies on n, where optimality means that the sum of the dissimilarities of the embedded (or consistent) quartet topologies is minimal. We provide details and formulation of this novel challenging problem, and the preliminaries of an exact algorithm under current development which may be useful to improve the MQTC heuristics to date into more efficient hybrid approaches.
A visualization of family relations inspired by the London metro map
Proceedings of the 13th International Symposium on Visual Information Communication and Interaction, 2020
We propose a new visualization of family relations, called family metro map, which is inspired by... more We propose a new visualization of family relations, called family metro map, which is inspired by the famous London Underground Map. A family is represented by a metro line, where the parents are the end nodes and the children the intermediate nodes. We introduce family trees as rooted binary trees and consider the problem of automatically drawing a family metro map for a given family tree without crossing line segments, where the successive nodes of a metro line are placed at equal distances. The inter-node distance may be chosen to depend on the generation of the family, such that metro lines of earlier generations are shown more prominently than metro lines of later generations.
Max-Planck-Institute for Computer Science Im Stadtwald, 66123 Saarbr ucken, Germany
Abstract High performance applications involving large data sets require the e cient and exible u... more Abstract High performance applications involving large data sets require the e cient and exible use of multiple disks. In an external memory machine with D parallel, independent disks, only one block can be accessed on each disk in one I/O step. This restriction leads ...
The minimum quartet tree cost (MQTC) problem is a graph combinatorial optimization problem where,... more The minimum quartet tree cost (MQTC) problem is a graph combinatorial optimization problem where, given a set of n ≥ 4 data objects and their pairwise costs (or distances), one wants to construct an optimal tree from the 3 • n 4 quartet topologies on n, where optimality means that the sum of the costs of the embedded (or consistent) quartet topologies is minimal. The MQTC problem is the foundation of the quartet method of hierarchical clustering, a novel hierarchical clustering method for non tree-like (non-phylogeny) data in various domains, or for heterogeneous data across domains. The MQTC problem is NP-complete and some heuristics have been already proposed in the literature. The aim of this paper is to present a first exact solution approach for the MQTC problem. Although the algorithm is able to get exact solutions only for relatively small problem instances, due to the high problem complexity, it can be used as a benchmark for validating the performance of any heuristic proposed for the MQTC problem.
<title>Enriching text with images and colored light</title>
Proceedings of SPIE, Jan 27, 2008
Page 1. Enriching text with images and colored light Dragan Sekulovski a and Gijs Geleijnse a and... more Page 1. Enriching text with images and colored light Dragan Sekulovski a and Gijs Geleijnse a and Bram Kater a and Jan Korst a and Steffen Pauws a and Ramon Clout a a Philips Research Europe, High Tech Campus 34, 5656 AE, Eindhoven, the Netherlands ABSTRACT ...
International Symposium/Conference on Music Information Retrieval, 2006
We present a novel approach in categorizing artists into subjective categories such as genre. We ... more We present a novel approach in categorizing artists into subjective categories such as genre. We base our method on co-occurrences on the web, found with the Google search engine. A direct mapping between artists and categories proved to be unreliable. We use the categories mapped to closely related artists to obtain a more reliable mapping. The method is tested on a genre classification test set with convincing results. Moreover, mood categorization is explored using the same techniques.
International Symposium/Conference on Music Information Retrieval, 2006
We present a novel method to extract lyrics from the Web. The aim is to extract a set of multiple... more We present a novel method to extract lyrics from the Web. The aim is to extract a set of multiple versions of the lyrics to a song. Lyrics can be identified within a text by a regular expression. We use a projection of a document to efficiently identify lyrics within the document by mapping it to a regular expression. We describe a method to cluster the multiple versions of the lyrics by filtering out erroneous texts such as lyrics to other songs. For reasons of efficiency, we do this by comparing fingerprints instead of the texts themselves.
Workshops on Enabling Technologies: Infrastracture for Collaborative Enterprises, Jun 18, 2007
Recent advances in tracking technology have led to the design of digital tables that support inte... more Recent advances in tracking technology have led to the design of digital tables that support interaction using multifinger input and physical objects. However, the tradeoffs between these input modalities are not clear, making it difficult for developers to make informed decisions when choosing input strategies for digital table systems. In this paper, we consider the role that multi-finger input and physical objects play in the design of collaborative tabletop systems. We present the results of an observational study of group work on regular tables, and an experimental study of interaction techniques for supporting group handoff. Our results show that people often perform several explicit communication and coordination activities that involve epistemic and pragmatic movements of physical tools. Further, our experimental results suggest that using physical objects to control digital information improves performance over using finger gestures.
A visualization of family relations inspired by the London metro map
We propose a new visualization of family relations, called family metro map, which is inspired by... more We propose a new visualization of family relations, called family metro map, which is inspired by the famous London Underground Map. A family is represented by a metro line, where the parents are the end nodes and the children the intermediate nodes. We introduce family trees as rooted binary trees and consider the problem of automatically drawing a family metro map for a given family tree without crossing line segments, where the successive nodes of a metro line are placed at equal distances. The inter-node distance may be chosen to depend on the generation of the family, such that metro lines of earlier generations are shown more prominently than metro lines of later generations.
In an in-home digital network several data streams (audio, video) may run simultaneously over a s... more In an in-home digital network several data streams (audio, video) may run simultaneously over a shared communication device, e.g. a bus. The burstiness of a data stream can be reduced by buffering data at the sending and receiving side, thereby allowing a lower bus share allocation for the stream. In this paper we present an algorithm that determines how much of the bus capacity and buffer space should be allocated to each stream, in order to have a feasible transmission schedule for each stream. Furthermore, the algorithm determines a transmission schedule for each stream, indicating how much data is transmitted over time. We model the problem as a linear program and apply a Dantzig-Wolfe decomposition such that the multiplestream problem can be solved by repeatedly solving single-stream problems. For these single-stream problems we briefly describe efficient algorithms to solve them.
We investigate a generalized assignment problem where the resource requirements are either 1 or 2... more We investigate a generalized assignment problem where the resource requirements are either 1 or 2. This problem is motivated by a question that arises when data blocks are to be retrieved from parallel disks as efficiently as possible. The resulting problem is to assign jobs to machines with a given capacity, where each job takes either one or two units of machine capacity, and must satisfy certain assignment restrictions, such that total weight of the assigned jobs is maximized. We derive a ~-approximation result for this problem based on relaxing a formulation of the problem so that the resulting constraint matrix is totally unimodular. Further, we prove that the LP-relaxation of a special case of the problem is half-integral, and we derive a weak persistency property.
DOI to the publisher's website. • The final author version and the galley proof are versions of t... more DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal. If the publication is distributed under the terms of Article 25fa of the Dutch Copyright Act, indicated by the "Taverne" license above, please follow below link for the End User Agreement:
We consider the problem of determining the minimum number Nd of unit disks that is required to bl... more We consider the problem of determining the minimum number Nd of unit disks that is required to block all rays emanating from a point P in the two-dimensional space, where each disk has at least a distance d to point P and to any other disk. We study the asymptotic behavior of Nd, as d tends to infinity. By deriving
Recommender systems typically require feedback from the user to learn the user's taste. This feed... more Recommender systems typically require feedback from the user to learn the user's taste. This feedback can come in two forms: explicit and implicit. Explicit feedback consists of ratings provided by the user for a number of items, while implicit feedback comes from observing user actions on items. These actions have to be interpreted by the recommender system and translated into a rating. In this paper we propose a method to learn how to translate user actions on items to ratings on these items by correlating user actions with explicit feedback. We do this by associating user actions to rated items and subsequently applying naive Bayesian classification to rate new items with which the user has interacted. We apply and evaluate our method on data from a web-based music service and we show its potential as an addition to explicit rating.
Given a set of n data objects and their pairwise dissimilarities, the goal of the minimum quartet... more Given a set of n data objects and their pairwise dissimilarities, the goal of the minimum quartet tree cost (MQTC) problem is to construct an optimal tree from the total number of possible combinations of quartet topologies on n, where optimality means that the sum of the dissimilarities of the embedded (or consistent) quartet topologies is minimal. We provide details and formulation of this novel challenging problem, and the preliminaries of an exact algorithm under current development which may be useful to improve the MQTC heuristics to date into more efficient hybrid approaches.
A visualization of family relations inspired by the London metro map
Proceedings of the 13th International Symposium on Visual Information Communication and Interaction, 2020
We propose a new visualization of family relations, called family metro map, which is inspired by... more We propose a new visualization of family relations, called family metro map, which is inspired by the famous London Underground Map. A family is represented by a metro line, where the parents are the end nodes and the children the intermediate nodes. We introduce family trees as rooted binary trees and consider the problem of automatically drawing a family metro map for a given family tree without crossing line segments, where the successive nodes of a metro line are placed at equal distances. The inter-node distance may be chosen to depend on the generation of the family, such that metro lines of earlier generations are shown more prominently than metro lines of later generations.
Max-Planck-Institute for Computer Science Im Stadtwald, 66123 Saarbr ucken, Germany
Abstract High performance applications involving large data sets require the e cient and exible u... more Abstract High performance applications involving large data sets require the e cient and exible use of multiple disks. In an external memory machine with D parallel, independent disks, only one block can be accessed on each disk in one I/O step. This restriction leads ...
The minimum quartet tree cost (MQTC) problem is a graph combinatorial optimization problem where,... more The minimum quartet tree cost (MQTC) problem is a graph combinatorial optimization problem where, given a set of n ≥ 4 data objects and their pairwise costs (or distances), one wants to construct an optimal tree from the 3 • n 4 quartet topologies on n, where optimality means that the sum of the costs of the embedded (or consistent) quartet topologies is minimal. The MQTC problem is the foundation of the quartet method of hierarchical clustering, a novel hierarchical clustering method for non tree-like (non-phylogeny) data in various domains, or for heterogeneous data across domains. The MQTC problem is NP-complete and some heuristics have been already proposed in the literature. The aim of this paper is to present a first exact solution approach for the MQTC problem. Although the algorithm is able to get exact solutions only for relatively small problem instances, due to the high problem complexity, it can be used as a benchmark for validating the performance of any heuristic proposed for the MQTC problem.
Uploads
Papers by Jan Korst