6 resultados para Packet Network

em Universitätsbibliothek Kassel, Universität Kassel, Germany


Relevância:

20.00% 20.00%

Publicador:

Resumo:

The dynamics of molecular multiphoton ionization and fragmentation of a diatomic molecule (Na_2) have been studied in molecular beam experiments. Femtosecond laser pulses from an amplified colliding-pulse mode-locked (CPM) ring dye laser are employed to induce and probe the molecular transitions. The final continuum states are analyzed by photoelectron spectroscopy, by ion mass spectrometry and by measuring the kinetic energy of the formed ionic fragments. Pump-probe spectra employing 70-fs laser pulses have been measured to study the time dependence of molecular multiphoton ionization and fragmentation. The oscillatory structure of the transient spectra showing the dynamics on the femtosecond time scale can best be understood in terms of the motion of wave packets in bound molecular potentials. The transient Na_2^+ ionization and the transient Na^+ fragmentation spectra show that contributions from direct photoionization of a singly excited electronic state and from excitation and autoionization of a bound doubly excited molecular state determine the time evolution of molecular multiphoton ionization.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The motion of a vibrational wave packet in the bound A(^1 \summe^+_u) electronic state of the sodium dimer is detected in a femtosecond pump/probe molecular beam experiment. For short times harmonic motion is seen in the total ion yield of Na^+_2 as a function of delay time between the two laser pulses. The spreading of the wave packet results in the loss of the periodic variation of the ion signal. For longer delay times (47 ps) the wave packet regains its initial form which is reflected in the revival structure of the Na^+_2 signal. Time-dependent quantum calculations reproduce the measured effects.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Social resource sharing systems like YouTube and del.icio.us have acquired a large number of users within the last few years. They provide rich resources for data analysis, information retrieval, and knowledge discovery applications. A first step towards this end is to gain better insights into content and structure of these systems. In this paper, we will analyse the main network characteristics of two of the systems. We consider their underlying data structures – socalled folksonomies – as tri-partite hypergraphs, and adapt classical network measures like characteristic path length and clustering coefficient to them. Subsequently, we introduce a network of tag co-occurrence and investigate some of its statistical properties, focusing on correlations in node connectivity and pointing out features that reflect emergent semantics within the folksonomy. We show that simple statistical indicators unambiguously spot non-social behavior such as spam.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Social resource sharing systems like YouTube and del.icio.us have acquired a large number of users within the last few years. They provide rich resources for data analysis, information retrieval, and knowledge discovery applications. A first step towards this end is to gain better insights into content and structure of these systems. In this paper, we will analyse the main network characteristics of two of these systems. We consider their underlying data structures – so-called folksonomies – as tri-partite hypergraphs, and adapt classical network measures like characteristic path length and clustering coefficient to them. Subsequently, we introduce a network of tag cooccurrence and investigate some of its statistical properties, focusing on correlations in node connectivity and pointing out features that reflect emergent semantics within the folksonomy. We show that simple statistical indicators unambiguously spot non-social behavior such as spam.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A key argument for modeling knowledge in ontologies is the easy re-use and re-engineering of the knowledge. However, beside consistency checking, current ontology engineering tools provide only basic functionalities for analyzing ontologies. Since ontologies can be considered as (labeled, directed) graphs, graph analysis techniques are a suitable answer for this need. Graph analysis has been performed by sociologists for over 60 years, and resulted in the vivid research area of Social Network Analysis (SNA). While social network structures in general currently receive high attention in the Semantic Web community, there are only very few SNA applications up to now, and virtually none for analyzing the structure of ontologies. We illustrate in this paper the benefits of applying SNA to ontologies and the Semantic Web, and discuss which research topics arise on the edge between the two areas. In particular, we discuss how different notions of centrality describe the core content and structure of an ontology. From the rather simple notion of degree centrality over betweenness centrality to the more complex eigenvector centrality based on Hermitian matrices, we illustrate the insights these measures provide on two ontologies, which are different in purpose, scope, and size.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Definition und technische Beschreibung der Deep Packet Inspection-Technologie, Motive für ihren Einsatz bei Internetprovidern und die rechtliche Würdigung dieses Einsatzes anhand des geltenden deutschen Straf-, Daten- und Urheberrechts