@inbook{6488, author = {{Kremer, H.-Hugo}}, booktitle = {{New Approaches to Vocational Education in Europe}}, editor = {{Mulder, R. H. and Sloane, P. F. E. }}, pages = {{71--81}}, title = {{{Complex teaching-learning arrangements and multimedia}}}, year = {{2004}}, } @inbook{6490, author = {{Kremer, H.-Hugo}}, booktitle = {{New Approaches to Vocational Education in Europe}}, editor = {{Mulder, R. H. and Sloane, P. F. E. }}, pages = {{133--141}}, title = {{{Focus groups as an instrument to implement innovations in VET - concepts and experience}}}, year = {{2004}}, } @inbook{6492, author = {{Kremer, H.-Hugo}}, booktitle = {{Lernortkooperation und Bildungsnetzwerke 13. Hochschultage Berufliche Bildung 2004-BerufsBildung in der globalen NetzWerkGesellschaft}}, editor = {{Pätzold, G. and Stender, J.}}, title = {{{Wissen managen mit virtuellen Foren - eine (neue) Chance für Lernortkooperationen. Erfahrungen aus dem Modellversuch WISLOK}}}, volume = {{21}}, year = {{2004}}, } @inbook{6494, author = {{Kremer, H.-Hugo}}, booktitle = {{Implementation und Verstetigung von Netzwerken in der beruflichen Bildung }}, editor = {{Büchter, K. and Gramlinger, F.}}, pages = {{99--116}}, title = {{{Entwicklung und Implementation von Wissensforen zur Förderung von Netzwerken in der dualen Ausbildung }}}, year = {{2004}}, } @article{6495, author = {{Kremer, H.-Hugo}}, journal = {{Erziehungswissenschaft und Beruf}}, number = {{4}}, pages = {{507--520}}, title = {{{Bildungsmesse als Instrument der Berufswahlvorbereitung - Entwicklung und Implementation einer komplexen Lernumgebung}}}, year = {{2004}}, } @article{673, author = {{Waldmüller, I. and Förstner, Jens and Lee, S.-C. and Knorr, A. and Woerner, M. and Reimann, K. and Kaindl, R. A. and Elsaesser, T. and Hey, R. and Ploog, K. H.}}, issn = {{1098-0121}}, journal = {{Physical Review B}}, number = {{20}}, publisher = {{American Physical Society (APS)}}, title = {{{Optical dephasing of coherent intersubband transitions in a quasi-two-dimensional electron gas}}}, doi = {{10.1103/physrevb.69.205307}}, volume = {{69}}, year = {{2004}}, } @inproceedings{16474, abstract = {{Given n distinct points p1, p2, ... , pn in the plane, the map labeling problem with four squares is to place n axis-parallel equi-sized squares Q1, ... ,Qn of maximum possible size such that pi is a corner of Qi and no two squares overlap. This problem is NP-hard and no algorithm with approximation ratio better than 1/2 exists unless P = NP [10]. In this paper, we consider a scenario where we want to visualize the information gathered by smart dust, i.e. by a large set of simple devices, each consisting of a sensor and a sender that can gather sensor data and send it to a central station. Our task is to label (the positions of) these sensors in a way described by the labeling problem above. Since these devices are not positioned accurately (for example, they might be dropped from an airplane), this gives rise to consider the map labeling problem under the assumption, that the positions of the points are not fixed precisely, but perturbed by random noise. In other words, we consider the smoothed complexity of the map labeling problem. We present an algorithm that, under such an assumption and Gaussian random noise with sufficiently large variance, has linear smoothed complexity.}}, author = {{Bansal, Vikas and Meyer auf der Heide, Friedhelm and Sohler, Christian}}, booktitle = {{12th Annual European Symposium on Algorithms (ESA 2004)}}, isbn = {{9783540230250}}, issn = {{0302-9743}}, title = {{{Labeling Smart Dust}}}, doi = {{10.1007/978-3-540-30140-0_9}}, volume = {{3221}}, year = {{2004}}, } @inproceedings{16475, author = {{Bienkowski, Marcin and Korzeniowski, Miroslaw and Meyer auf der Heide, Friedhelm}}, booktitle = {{Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures - SPAA '04}}, isbn = {{1581138407}}, title = {{{Fighting against two adversaries}}}, doi = {{10.1145/1007912.1007923}}, year = {{2004}}, } @article{16477, author = {{Meyer auf der Heide, Friedhelm and Schindelhauer, Christian and Volbert, Klaus and Grünewald, Matthias}}, issn = {{1432-4350}}, journal = {{Theory of Computing Systems}}, pages = {{343--370}}, title = {{{Congestion, Dilation, and Energy in Radio Networks}}}, doi = {{10.1007/s00224-004-1124-z}}, year = {{2004}}, } @inproceedings{16480, author = {{Leonardi, S. and Marchetti-Spaccamela, A. and Meyer auf der Heide, Friedhelm}}, booktitle = {{SPAA '04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures}}, isbn = {{1581138407}}, title = {{{Scheduling against an adversarial network}}}, doi = {{10.1145/1007912.1007936}}, year = {{2004}}, } @article{16500, author = {{Chaudhuri, I. and Sertl, S. and Hajnal, Z. and Dellnitz, M. and Frauenheim, Th.}}, issn = {{0169-4332}}, journal = {{Applied Surface Science}}, pages = {{108--113}}, title = {{{Global optimization of silicon nanoclusters}}}, doi = {{10.1016/j.apsusc.2003.11.007}}, year = {{2004}}, } @article{16521, author = {{Bezrukov, S. and Elsässer, R. and Monien, B. and Preis, R. and Tillich, J.-P.}}, issn = {{0304-3975}}, journal = {{Theoretical Computer Science}}, pages = {{155--174}}, title = {{{New spectral lower bounds on the bisection width of graphs}}}, doi = {{10.1016/j.tcs.2004.03.059}}, year = {{2004}}, } @article{16527, author = {{Day, S. and Junge, O. and Mischaikow, K.}}, issn = {{1536-0040}}, journal = {{SIAM Journal on Applied Dynamical Systems}}, pages = {{117--160}}, title = {{{A Rigorous Numerical Method for the Global Analysis of Infinite-Dimensional Discrete Dynamical Systems}}}, doi = {{10.1137/030600210}}, year = {{2004}}, } @article{16587, abstract = {{ We discuss nearest neighbor load balancing schemes on processor networks which are represented by a cartesian product of graphs and present a new optimal diffusion scheme for general graphs. In the first part of the paper, we introduce the Alternating-Direction load balancing scheme, which reduces the number of load balance iterations by a factor of 2 for cartesian products of graphs. The resulting flow is theoretically analyzed and can be very high for certain cases. Therefore, we further present the Mixed-Direction scheme which needs the same number of iterations but computes in most cases a much smaller flow. In the second part of the paper, we present a simple optimal diffusion scheme for general graphs, calculating a balancing flow which is minimal in the l2 norm. It is based on the spectra of the graph representing the network and needs only m-1 iterations to balance the load with m being the number of distinct eigenvalues. Known optimal diffusion schemes have the same performance, however the optimal scheme presented in this paper can be implemented in a very simple manner. The number of iterations of optimal diffusion schemes is independent of the load scenario and, thus, they are practical for networks which represent graphs with known spectra. Finally, our experiments exhibit that the new optimal scheme can successfully be combined with the Alternating-Direction and Mixed-Direction schemes for efficient load balancing on product graphs. }}, author = {{Elsässer, Robert and Monien, Burkhard and Preis, Robert and Frommer, Andreas}}, issn = {{0129-6264}}, journal = {{Parallel Processing Letters}}, pages = {{61--73}}, title = {{{Optimal Diffusion Schemes and Load Balancing on Product Graphs}}}, doi = {{10.1142/s0129626404001714}}, year = {{2004}}, } @article{16619, author = {{Junge, Oliver and Osinga, Hinke M.}}, issn = {{1292-8119}}, journal = {{ESAIM: Control, Optimisation and Calculus of Variations}}, pages = {{259--270}}, title = {{{A set oriented approach to global optimal control}}}, doi = {{10.1051/cocv:2004006}}, year = {{2004}}, } @inproceedings{16620, author = {{Junge, O. and Marsden, J.E. and Mezic, I.}}, booktitle = {{2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601)}}, isbn = {{0780386825}}, title = {{{Uncertainty in the dynamics of conservative maps}}}, doi = {{10.1109/cdc.2004.1430379}}, year = {{2004}}, } @inproceedings{16803, author = {{Goetz, Frank and Domik, Gitta}}, booktitle = {{Cooperative Design, Visualization, and Engineering, First International Conference, (CDVE) 2004, Palma de Mallorca, Spain, September 19-22, 2004, Proceedings}}, editor = {{Luo, Yuhua}}, pages = {{38--46}}, publisher = {{Springer}}, title = {{{openVisaar: Enriching Cooperative Visualization by Combining Open Technologies}}}, doi = {{10.1007/978-3-540-30103-5_5}}, volume = {{3190}}, year = {{2004}}, } @inproceedings{16804, author = {{Goetz, Frank and Borau, Ralf and Domik, Gitta}}, booktitle = {{Proceeding of the Ninth International Conference on 3D Web Technology, Web3D 2004, Monterey, California, USA, April 5-8, 2004}}, editor = {{P. Brutzman, Donald and Chittaro, Luca and Puk, Richard}}, pages = {{87--97}}, publisher = {{{ACM}}}, title = {{{An XML-based visual shading language for vertex and fragment shaders}}}, doi = {{10.1145/985040.985054}}, year = {{2004}}, } @article{10742, author = {{Steiger, Christoph and Walder, Herbert and Platzner, Marco}}, journal = {{{IEEE} Transactions on Computers}}, number = {{11}}, pages = {{1393--1407}}, title = {{{Operating systems for reconfigurable embedded platforms: online scheduling of real-time tasks}}}, doi = {{10.1109/tc.2004.99}}, volume = {{53}}, year = {{2004}}, } @article{11732, abstract = {{Satellite positioning systems, such as GPS or the future European system Galileo, employ direct-sequence spread-spectrum signals. The positioning accuracy is strongly affected by the quality of the pseudo range measurements. These measurements necessitate code and carrier synchronization of the received signal with the internally generated reference signals. In this type of systems one major error source is the multipath phenomenon, which results in a sum of delayed and weighted copies of the original signal to be present at the receiver input. This can result in a systematic error of the code tracking loop resulting in range errors in the order of several tens of meters. In this paper we propose an extension of the standard code tracking loop capable of estimating the parameters of the line-of-sight (LOS) signal and separating the LOS from the reflected signal portions. It is based on an analysis of the cross correlation of the received signal with a locally generated code sequence in the vicinity of the tracking point of a Delay-Locked Loop (DLL). For this reason, we call this method Cross Correlation Function (CCF) Analysis. The proposed method achieves considerably more accurate estimates than a DLL. Its performance is comparable to the Multipath Estimating Delay-Locked Loop (MEDLL) which is considered to be the best method for reducing multipath induced errors, so far. However, the computational complexity of the CCF Analysis is by a factor of three smaller compared to the MEDLL. Extensive simulations have been conducted for the proposed method and the MEDLL in order to assess the robustness of the two approaches under various signal constellations.}}, author = {{Bischoff, R. and Haeb-Umbach, Reinhold and Nammi, Sai Ramesh}}, journal = {{AEUe, Int. Journal on Electronics and Communications}}, number = {{1}}, title = {{{Multipath-Resistant Time of Arrival Estimation for Satellite Positioning}}}, volume = {{58}}, year = {{2004}}, }