Browsing by Title
Now showing 1 - 20 of 4986
Results Per Page
Sort Options
- Some of the metrics are blocked by yourconsent settings
Publication 08031 -- Software Engineering for Self-Adaptive Systems: A Research Road Map(Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, 2008) ;Cheng, Betty H.C. ;Giese, Holger ;Inverardi, Paola ;Magee, Jeff ;de Lemos, Rogerio ;Andersson, Jesper ;Becker, Basil ;Bencomo, Nelly ;Brun, Yuriy ;Cukic, Bojan ;Serugendo, Giovanna Di Marzo ;Dustdar, Schahram ;Finkelstein, Anthony ;Gacek, Cristina ;Geihs, Kurt ;Grassi, Vincenzo ;Karsai, Gabor ;Kienle, Holger ;Kramer, Jeff ;Litoiu, Marin ;Malek, Sam ;Mirandola, Raffaela ;Muller, Hausi ;Park, Sooyong ;Shaw, Mary ;Tichy, Matthias ;Tivoli, Massimo ;Weyns, Danny ;Whittle, Jon ;Cheng, Betty H.C. ;de Lemos, Rogerio ;Giese, Holger ;Inverardi, PaolaMagee, Jeff - Some of the metrics are blocked by yourconsent settings
Publication \( (1 + \varepsilon)\)-Approximate \(f\)-Sensitive Distance Oracles(2017) ;Chechik, Shiri ;Cohen, Sarel ;Fiat, AmosKaplan, HaimAn \(f\)-Sensitive Distance Oracle with stretch a preprocesses a graph \( G(V, E) \) and produces a small data structure that is used to answer subsequent queries. A query is a triple consisting of a set \( F \subset E \) of at most \(f\) edges, and vertices \(s\) and \(t\). The oracle answers a query \( (F,s.,t) \) by returning a value \(d\) which is equal to the length of some path between \(s\) and \(t\) in the graph \(G \setminus F\) (the graph obtained from \(G\) by discarding all edges in \(F\)). Moreover, d is at most a times the length of the shortest path between \(s\) and \(t\) in \(G \setminus F\). The oracle can also construct a path between \(s\) and \(t\) in \(G \setminus F\) of length \(d\). To the best of our knowledge we give the first nontrivial f-sensitive distance oracle with fast query time and small stretch capable of handling multiple edge failures. Specifically, for any \( \mathcalO(\frac\log n\log \log n ) \) and a fixed \( \varepsilon > 0 \) our oracle answers queries \( (F,s,t) \) in time \( \mathcalO(l) \) with \( (1 + \varepsilon) \) stretch using a data structure of size \( n^2+ \mathcalO(1) \) For comparison, the naive alternative requires \( m^f n^2 \) space for sublinear query time. - Some of the metrics are blocked by yourconsent settings
Publication (1+1) EA on Generalized Dynamic OneMax(ACM, 2015) ;Kötzing, Timo ;Lissovoi, AndreiWitt, CarstenEvolutionary algorithms (EAs) perform well in settings involving uncertainty, including settings with stochastic or dynamic fitness functions. In this paper, we analyze the (1+1) EA on dynamically changing OneMax, as introduced by Droste (2003). We re-prove the known results on first hitting times using the modern tool of drift analysis. We extend these results to search spaces which allow for more than two values per dimension. Furthermore, we make an anytime analysis as suggested by Jansen and Zarges (2014), analyzing how closely the (1+1) EA can track the dynamically moving optimum over time. We get tight bounds both for the case of bit strings, as well as for the case of more than two values per position. Surprisingly, in the latter setting, the expected quality of the search point maintained by the (1+1) EA does not depend on the number of values per dimension. - Some of the metrics are blocked by yourconsent settings
Publication 10492 Executive Summary - Information-Centric Networking(2010) ;Kutscher, Dirk ;Ahlgren, Bengt ;Karl, Holger ;Ohlman, Borje ;Oueslati, SaraSolis, Ignacio - Some of the metrics are blocked by yourconsent settings
Publication 12th IFIP Wireless and Mobile Networking Conference, WMNC 2019, Paris, France, September 11-13, 2019(IEEE, 2019) ;Debbah, M\'erouane ;Pujolle, Guy ;Mammeri, Zoubir ;Curado, Marilia ;Nguyen, Thi Mai TrangBoumerdassi, Selma - Some of the metrics are blocked by yourconsent settings
Publication 13th international workshop on the web and databases: WebDB 2010(2010) ;Dong, Xin LunaNaumann, Felix - Some of the metrics are blocked by yourconsent settings
Publication 14th International Conference on Network and Service Management, CNSM 2018, Rome, Italy, November 5-9, 2018(IEEE Computer Society, 2018) ;Salsano, Stefano ;Riggio, Roberto ;Ahmed, Toufik ;Samak, Taghriddos Santos, Carlos Raniery Paula - Some of the metrics are blocked by yourconsent settings
Publication 2.5D Clip-Surfaces for Technical Visualization(Union Agency, 2013) ;Trapp, Matthias ;D\"ollner, J\"urgenSkala, VáclavThe concept of clipping planes is well known in computer graphics and can be used to create cut-away views. But clipping against just analytical defined planes is not always suitable for communicating every aspect of such visualization. For example, in hand-drawn technical illustrations, artists tend to communicate the difference between a cut and a model feature by using non-regular, sketchy cut lines instead of straight ones. To enable this functionality in computer graphics, this paper presents a technique for applying 2.5D clip-surfaces in real-time. Therefore, the clip plane equation is extended with an additional offset map, which can be represented by a texture map that contains height values. Clipping is then performed by varying the clip plane equation with respect to such an offset map. Further, a capping technique is proposed that enables the rendering of caps onto the clipped area to convey the impression of solid material. It avoids a re-meshing of a solid polygonal mesh after clipping is performed. Our approach is pixel precise, applicable in real-time, and takes fully advantage of graphics accelerators. - Some of the metrics are blocked by yourconsent settings
Publication 2.5D Dust & Magnet Visualization for Large Multivariate Data(2020) ;Vollmer, Jan OleDöllner, JürgenIn this paper, we present a 2.5D visualization technique based on the dust & magnet metaphor, which generally allows for interactively exploring and analyzing large multivariate data sets. In addition to position and color, we introduce height as additional visual variable for particles to encode extra data attributes in the 2.5D visualization, thus increasing the potential for identifying correlations between attributes. Further, we have developed a real-time collision detection algorithm as part of the particle simulation that ensures overlap-free particle positioning, thereby enabling the continuous perception of patterns, clusters, and outliers. These extensions facilitate on-the-fly validation of hypotheses through the highly dynamic configuration of magnets and visual attribute encoding, which also allows for a better integration of the user’s domain knowledge. We demonstrate the application of our visualization technique using various real-world data sets from different domains, e.g., finance and software analytics. - Some of the metrics are blocked by yourconsent settings
Publication 2011 ACM SIGCOMM Workshop on Information-Centric Networking, ICN 2011, Toronto, ON, Canada, August 19, 2011(ACM, 2011) ;Kutscher, Dirk ;Morabito, Giacomo ;Solis, Ignacio ;Ohlman, Borje ;Polyzos, George C.Zhang, Lixia - Some of the metrics are blocked by yourconsent settings
Publication 2013 9th International Wireless Communications and Mobile Computing Conference, IWCMC 2013, Sardinia, Italy, July 1-5, 2013(IEEE, 2013) ;Saracco, Roberto ;Letaief, Khaled Ben ;Gerla, Mario ;Palazzo, SergioAtzori, Luigi - Some of the metrics are blocked by yourconsent settings
Publication 22nd International Conference on Software, Telecommunications and Computer Networks, SoftCOM 2014, Split, Croatia, September 17-19, 2014(IEEE, 2014) ;Rozic, NikolaBegusic, Dinko - Some of the metrics are blocked by yourconsent settings
Publication 2D and 3D Presentation of Spatial Data: A Systematic Review(2014) ;Dübel, Steve ;Röhlig, Martin ;Schumann, HeidrunTrapp, MatthiasThe question whether to use 2D or 3D for data visualization is generally difficult to decide. Two-dimensional and three-dimensional visualization techniques exhibit different advantages and disadvantages related to various perceptual and technical aspects such as occlusion, clutter, distortion, or scalability. To facilitate problem understanding and comparison of existing visualization techniques with regard to these aspects, this report introduces a systematization based on presentation characteristics. It enables a categorization with respect to combinations of static 2D and 3D presentations of attributes and their spatial reference. Further, it complements ex-isting systematizations of data in an effort to formalize a common terminology and theoretical framework for this problem domain. We demonstrate our approach by reviewing different visualization techniques of spatial data according to the presented systematization. - Some of the metrics are blocked by yourconsent settings
Publication 2nd International Conference on Energy-Efficient Computing and Networking 2011, e-Energy '11, New York, NY, USA -- May 31 -- June 01, 2011(ACM, 2011) ;de Meer, HermannHutchison, David - Some of the metrics are blocked by yourconsent settings
Publication 3D Cache Hierarchy Optimization(IEEE 3DIC, 2013) ;Leonid Yavits, Amir MoradGinosar, Ran3D integration has the potential to improve the scalability and performance of Chip Multiprocessors (CMP). A closed form analytical solution for optimizing 3D CMP cache hierarchy is developed. It allows optimal partitioning of the cache hierarchy levels into 3D silicon layers and optimal allocation of area among cache hierarchy levels under constrained area and power budgets. The optimization framework is extended by incorporating the impact of multithreaded data sharing on the private cache miss rate. An analytical model for cache access time as a function of cache size and a number of 3D partitions is proposed and verified using CACTI simulation - Some of the metrics are blocked by yourconsent settings
Publication 3D City Model Visualization with Cartography-Oriented Design(CORP – Competence Center of Urban and Regional Planning, 2008) ;Jobst, Markus ;Döllner, Jürgen ;Schrenk, Manfred ;Popovich, Vasily V. ;Engelke, DirkElisei, PietroThis paper investigates and discusses concepts and techniques to enhance spatial knowledge transmission of 3D city model representations based on cartography-oriented design. 3D city models have evolved to important tools for urban decision processes and information systems, especially in planning, simulation, networks, and navigation. For example, planning tools analyze visibility characteristics of inner urban areas and allow planers to estimate whether a minimum amount of light is needed in intensely covered areas to avoid “Gotham city effect“, i.e., when these areas become too dark due to shadowing. For radio network planning, 3D city models are required to configure wireless network services, i.e., to calculate and analyze network coverage and connectivity features. 3D city model visualization often lacks effectiveness and expressiveness. For example, if we analyze common 3D views, large areas of the graphical presentations contain useless or even “misused” pixels with respect to information content and transfer (e.g., pixels that represent several hundreds of buildings at once or pixels that show sky). Typical avatar perspectives frequently show too many details at once and do not distinguish between areas in focus and surrounding areas. In this case the perceptual and cognitive quality of visualized virtual 3D city model could be enhanced by cartographic models and semiotic adaptations. For example, we can integrate strongly perceivable landmarks as referencing marks to the real world, which establish more effective presentations and improve efficient interaction. The referencing aspect in depictions of 3D city models is essential: Only correctly perceived elements can fulfill referencing tasks. With misleading perception, the same elements may cause false understanding. This circumstance leads to media-dependent semiotic models that aim at supporting effective transmission of spatial contents. This contribution compares different dynamic 3D visualization approaches for virtual 3D city models and demonstrates applied cartographic techniques to enhance information transfer. The underlying concept is based on a model for 3D semiotics, includes a number of pragmatic components, and presents examples of visualizations of adapted 3D city model visualizations. - Some of the metrics are blocked by yourconsent settings
Publication 3D Feature Surface Properties and Their Application in Geovisualization(Elsevier, 2010) ;Lorenz, HaikDöllner, JürgenNew acquisition methods have increased the availability of surface property data that capture location-dependent data on feature surfaces. However, these data are not supported as fully in the geovisualization of the Digital City as established data categories such as feature attributes, 2D rasters, or geometry. Consequently, 3D surface properties are largely excluded from the information extraction and knowledge creation process of geovisualization despite their potential for being an effective tool in many such tasks. To overcome this situation, this paper examines the benefits of a better integration into geovisualization systems in terms of two examples and discusses technological foundations for surface property support. The main contribution is the identification of computer graphics techniques as a suitable basis for such support. This way, the processing of surface property data fits well into existing visualization systems. This finding is demonstrated through an interactive prototypic visualization system that extends an existing system with surface property support. While this prototype concentrates on technology and neglects user-related and task-related aspects, the paper includes a discussion on challenges for making surface properties accessible to a wider audience. - Some of the metrics are blocked by yourconsent settings
Publication 3D Generalization Lenses for Interactive Focus + Context Visualization of Virtual City Models(IEEE Computer Society Press, 2008) ;Trapp, Matthias ;Glander, Tassilo ;Buchholz, HenrikDöllner, JürgenFocus + context visualization facilitates the exploration of complex information spaces. This paper proposes 3D generalization lenses, a new visualization technique for virtual 3D city models that combines different levels of structural abstraction. In an automatic preprocessing step, we derive a generalized representation of a given city model. At runtime, this representation is combined with a full-detail representation within a single view based on one or more 3D lenses of arbitrary shape. Focus areas within lens volumes are shown in full detail while excluding less important details of the surrounding area. Our technique supports simultaneous use of multiple lenses associated with different abstraction levels, can handle overlapping and nested lenses, and provides interactive lens modification. - Some of the metrics are blocked by yourconsent settings
Publication 3D geovisualization services for efficient distribution of 3D geodata(Universitätsverlag Potsdam, 2013)Klimke, J.Design, implementation, and operation of services for interactive 3D geovisualization are faced with a large number of challenges including (a) processing and integration of massive amounts of heterogeneous and distributed 2D and 3D geodata such as terrain models, buildings models, and thematic georeferenced data, (b) assembling, styling, and rendering 3D map contents according to application requirements and design principles, and (c) interactive provisioning of created 3D maps on mobile devices and thin clients as well as their integration as third-party components into domainspecific web and information systems. This report presents a concept and implementation of a service-oriented platform that addresses these major requirements of 3D web mapping systems. It is based on a separation of concerns for data management, 3D rendering, application logic, and user interaction. The main idea is to divide 3D rendering process into two stages. In the first stage, at the server side, an imagebased representation of the 3D scene is created by means of multi-layered virtual 3D panoramas; in the second stage, at the client side, the 3D scene is interactively reconstructed based on these panoramas. Beside the interactive client introduced earlier, scalable variant for provisioning of virtual 3D city models is described, that utilizes the capabilities of our rendering service for data preparation. - Some of the metrics are blocked by yourconsent settings
Publication 3D Isocontours – Real-time Generation and Visualization of 3D Stepped Terrain Models(The Eurographics Association, 2010) ;Glander, Tassilo ;Trapp, Matthias ;Döllner, Jürgen ;Seipel, StefanLensch, HendrikIsocontours (also isopleths, isolines, level sets) are commonly used to visualize real-valued data defined over a 2D plane according to a set of given isovalues. To support the 3D landscape metaphor for information visualization, a 3D stepped terrain can be derived by lifting and extruding isolines to their particular isovalue, but typically requires triangulation of the resulting surface representation in a preprocessing step. We present a concept and rendering technique for triangle-based terrain models that provide interactive, adaptive generation and visualization of such stepped terrains without preprocessing. Our fully hardware-accelerated rendering technique creates additional step geometry for each triangle intersecting an iso-plane on-the-fly. Further, an additional interpolation schema facilitates smooth transition between established 3D terrain visualization and its stepped variant.