Institution
Eindhoven University of Technology
Education•Eindhoven, Noord-Brabant, Netherlands•
About: Eindhoven University of Technology is a education organization based out in Eindhoven, Noord-Brabant, Netherlands. It is known for research contribution in the topics: Catalysis & Computer science. The organization has 22309 authors who have published 52936 publications receiving 1584164 citations. The organization is also known as: Technische Hogeschool Eindhoven & TU/e.
Papers published on a yearly basis
Papers
More filters
••
01 Aug 2014TL;DR: Work on learning analytics that aims to support learners and teachers through dashboard applications, ranging from small mobile applications to learnscapes on large public displays, is presented, identifying HCI issues for this exciting research area.
Abstract: In this paper, we present work on learning analytics that aims to support learners and teachers through dashboard applications, ranging from small mobile applications to learnscapes on large public displays. Dashboards typically capture and visualize traces of learning activities, in order to promote awareness, reflection, and sense-making, and to enable learners to define goals and track progress toward these goals. Based on an analysis of our own work and a broad range of similar learning dashboards, we identify HCI issues for this exciting research area.
383 citations
••
TL;DR: An algorithm for estimating the translation vector and the rotation matrix of a moving body from noisy measurements on the spatial co-ordinates of at least three non-collinear markers is described.
382 citations
01 Jan 1988
TL;DR: The mathematical formulation of the simulated annealing algorithm is extended to continuous optimization problems, and it is proved asymptotic convergence to the set of global optima.
Abstract: In this paper we are concerned with global optimization, which can be defined as the problem of finding points on a bounded subset of Rn in which some real valued functionf assumes its optimal (i.e. maximal or minimal) value. We present a stochastic approach which is based on the simulated annealing algorithm. The approach closely follows the formulation of the simulated annealing algorithm as originally given for discrete optimization problems. The mathematic formulation is extended to continuous optimization problems and we prove asymptotic convergence to the set of global optima. Furthermore, we discuss an implementation of the algorithm and compare its performance with other well known algorithms. The performance evaluation is carried out for a standard set of test functions from the literature. Keywords: global optimization, continuous variables, simulated annealing.
382 citations
••
TL;DR: The authors examined how consumers assess the claims of Trappist and Abbey beer brands and identified three forms of authenticity: pure (literal) authenticity, approximate authenticity, and moral authenticity.
Abstract: Authenticity is a cornerstone of contemporary marketing. Yet how do firms develop brand positions based on authenticity when marketing, and in particular, advertising, is believed to be antithetical to such positioning? We examine how consumers assess the claims of Trappist and Abbey beer brands. We identify three forms of authenticity: pure (literal) authenticity, approximate authenticity, and moral authenticity. In each case, consumers draw on either indexical or iconic cues to form judgments of authenticity, although the type of cue and degree of abstraction differ across the three types. We also find that the informants are duped by careful advertisements, and explain this by proposing that the relationships between indexical and iconic cues are closer than previously thought.
381 citations
••
TL;DR: In this article, the performance at the flow level in a dynamic setting with random finite-size service demands is evaluated by means of a multiclass Processor-Sharing model where the total service rate varies with the total number of users and the model provides explicit formulas for the distribution of the number of active users of the various classes, the mean response times, the blocking probabilities, and the throughput.
Abstract: Channel-aware scheduling strategies, such as the Proportional Fair algorithm for the CDMA 1xEV-DO system, provide an effective mechanism for improving throughput performance in wireless data networks by exploiting channel fluctuations. The performance of channel-aware scheduling algorithms has mostly been explored at the packet level for a static user population, often assuming infinite backlogs. In the present paper, we focus on the performance at the flow level in a dynamic setting with random finite-size service demands. We show that in certain cases the user-level performance may be evaluated by means of a multiclass Processor-Sharing model where the total service rate varies with the total number of users. The latter model provides explicit formulas for the distribution of the number of active users of the various classes, the mean response times, the blocking probabilities, and the throughput. In addition we show that, in the presence of channel variations, greedy, myopic strategies which maximize throughput in a static scenario, may result in sub-optimal throughput performance for a dynamic user configuration and cause potential instability effects.
381 citations
Authors
Showing all 22539 results
Name | H-index | Papers | Citations |
---|---|---|---|
Hans Clevers | 199 | 793 | 169673 |
Richard H. Friend | 169 | 1182 | 140032 |
J. Fraser Stoddart | 147 | 1239 | 96083 |
Jean-Luc Brédas | 134 | 1026 | 85803 |
Ulrich S. Schubert | 122 | 2229 | 85604 |
Christoph J. Brabec | 120 | 896 | 68188 |
Daniel I. Sessler | 119 | 973 | 60318 |
Can Li | 116 | 1049 | 60617 |
Vikram Deshpande | 111 | 732 | 44038 |
D. Grahame Hardie | 109 | 276 | 53856 |
Wil M. P. van der Aalst | 108 | 725 | 42429 |
Jacob A. Moulijn | 108 | 754 | 47505 |
Vincent M. Rotello | 108 | 766 | 52473 |
Silvia Bordiga | 107 | 498 | 41413 |
David N. Reinhoudt | 107 | 1082 | 48814 |