%0 
%0 Journal Article
%A Eckert, Michael & Bry, Fran\cc,ois
%D 2009
%T Aktuelles Schlagwort: Complex Event Processing (CEP)
%E 
%B Informatik Spektrum
%C 
%I 
%V 32
%6
%N 2
%P 163--167
%& 
%Y 
%S 
%7
%8 
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 LMU, Informatik, PMS, Publikationen
%3 article
%4 
%# 
%$ 
%F eckert2009complex
%K cep, complex, event, network, processing, sensor, venus
%X Ereignisgesteuerte Informationssysteme benötigen eine systematische und automatische Verarbeitung von Ereignissen. Complex Event Processing (CEP) ist ein Sammelbegriff für Methoden, Techniken und Werkzeuge, um Ereignisse zu verarbeiten während sie passieren, also kontinuierlich und zeitnah. CEP leitet aus Ereignissen höheres, wertvolles Wissen in Form von sog. komplexen Ereignissen, d.h. Situationen die sich nur als Kombination mehrerer Ereignisse erkennen lassen, ab. 
%Z 
%U http://www.pms.ifi.lmu.de/publikationen/#PMS-FB-2009-5
%+
%^

%0 
%0 Report
%A Eckert, Michael & Bry, Fran\cc,ois
%D 2009
%T Complex Event Processing (CEP)
%E 
%B 
%C 
%I Institute for Informatics, University of Munich
%V 
%6
%N 
%P 
%& 
%Y 
%S 
%7
%8 
%9 {research report, PMS-FB-2009-6}
%? 
%! 
%Z 
%@ PMS-FB-2009-6
%(
%)
%*
%L
%M
%1 
%2 LMU, Informatik, PMS, Publikationen
%3 techreport
%4 
%# 
%$ 
%F eckert2009complex
%K cep, complex, event, network, processing, sensor, venus
%X Event-driven information systems demand a systematic and automatic processing of events. Complex Event Processing (CEP) encompasses methods, techniques, and tools for processing events while they occur, i.e., in a continuous and timely fashion. CEP derives valuable higher-level knowledge from lower-level events; this knowledge takes the form of so called complex events, that is, situations that can only be recognized as a combination of several events.
%Z 
%U http://www.pms.ifi.lmu.de/publikationen/#PMS-FB-2009-6
%+
%^

%0 
%0 Journal Article
%A Luther, Marko; Fukazawa, Yusuke; Wagner, Matthias & Kurakake, Shoji
%D 2008
%T Situational reasoning for task-oriented mobile service recommendation
%E 
%B The Knowledge Engineering Review
%C 
%I 
%V 23
%6
%N Special Issue 01
%P 7--19
%& 
%Y 
%S 
%7
%8 February
%9
%? 
%! 
%Z 
%@ 1469-8005
%(
%)
%*
%L
%M
%1 
%2 
%3 article
%4 
%# 
%$ 
%F luther2008situational
%K complex, knowledge, mobile, recommender, service, situation, task
%X We study the case of integrating situational reasoning into a mobile service recommendation system. Since mobile Internet services are rapidly proliferating, finding and using appropriate services require profound service descriptions. As a consequence, for average mobile users it is nowadays virtually impossible to find the most appropriate service among the many offered. To overcome these difficulties, task navigation systems have been proposed to guide users towards best-fitting services. Our goal is to improve the user experience of such task navigation systems making them context-aware (i.e. to optimize service navigation by taking the user's situation into account). We propose the integration of a situational reasoning engine that applies classification-based inference to qualitative context elements, gathered from multiple sources and represented using ontologies. The extended task navigator enables the delivery of situation-aware recommendations in a proactive way. Initial experiments with the extended system indicate a considerable improvement of the navigator's usability. 
%Z 
%U http://dx.doi.org/10.1017/S0269888907001300
%+
%^

%0 
%0 Journal Article
%A Duch, J. & Arenas, A.
%D 2005
%T Community detection in complex networks using Extremal Optimization
%E 
%B Physical Review E
%C 
%I 
%V 72
%6
%N 
%P 027104
%& 
%Y 
%S 
%7
%8 
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 Citebase - Community detection in complex networks using Extremal Optimization
%3 article
%4 
%# 
%$ 
%F duch-2005-72
%K community, complex, detection, network
%X We propose a novel method to find the community structure in complex networks based on an extremal optimization of the value of modularity. The method outperforms the optimal modularity found by the existing algorithms in the literature. We present the results of the algorithm for computer simulated and real networks and compare them with other approaches. The efficiency and accuracy of the method make it feasible to be used for the accurate identification of community structure in large complex networks.
%Z 
%U http://www.citebase.org/abstract?id=oai:arXiv.org:cond-mat/0501368
%+
%^

%0 
%0 Journal Article
%A Barrat, A.; Barthélemy, M.; Pastor-Satorras, R. & Vespignani, A.
%D 2004
%T The architecture of complex weighted networks
%E 
%B Proceedings of the National Academy of Sciences of the United States of America
%C 
%I 
%V 101
%6
%N 11
%P 3747--3752
%& 
%Y 
%S 
%7
%8 
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 
%3 article
%4 
%# 
%$ 
%F barrat2004architecture
%K complex, sna, analysis, network, social
%X Networked structures arise in a wide array of different contexts such as technological and transportation infrastructures, social phenomena, and biological systems. These highly interconnected systems have recently been the focus of a great deal of attention that has uncovered and characterized their topological complexity. Along with a complex topological structure, real networks display a large heterogeneity in the capacity and intensity of the connections. These features, however, have mainly not been considered in past studies where links are usually represented as binary states, i.e., either present or absent. Here, we study the scientific collaboration network and the world-wide air-transportation network, which are representative examples of social and large infrastructure systems, respectively. In both cases it is possible to assign to each edge of the graph a weight proportional to the intensity or capacity of the connections among the various elements of the network. We define appropriate metrics combining weighted and topological observables that enable us to characterize the complex statistical properties and heterogeneity of the actual strength of edges and vertices. This information allows us to investigate the correlations among weighted quantities and the underlying topological structure of the network. These results provide a better description of the hierarchies and organizational principles at the basis of the architecture of weighted networks.
%Z 
%U http://www.pnas.org/content/101/11/3747.abstract
%+
%^

%0 
%0 Conference Proceedings
%A Shipman, III,, Frank M.; Marshall, Catherine C. & LeMere, Mark
%D 1999
%T Beyond location: hypertext workspaces and non-linear views
%E 
%B Proceedings of the tenth ACM Conference on Hypertext and hypermedia : returning to our diverse roots: returning to our diverse roots
%C New York, NY, USA
%I ACM
%V 
%6
%N 
%P 121--130
%& 
%Y 
%S 
%7
%8 
%9
%? 
%! 
%Z 
%@ 1-58113-064-3
%(
%)
%*
%L
%M
%1 
%2 
%3 inproceedings
%4 
%# 
%$ 
%F shipman1999beyond
%K analysis, complex, hypertext, search, web
%X 
%Z 
%U http://doi.acm.org/10.1145/294469.294498
%+
%^