The Experts below are selected from a list of 66237 Experts worldwide ranked by ideXlab platform

Willem Jonker - One of the best experts on this subject based on the ideXlab platform.

  • DEXA - Formalizing the XML schema Matching problem as a constraint optimization problem
    Lecture Notes in Computer Science, 2005
    Co-Authors: Marko Smiljanic, Maurice Van Keulen, Willem Jonker
    Abstract:

    The first step in finding an efficient way to solve any difficult problem is making a complete, possibly formal, problem specification. This paper introduces a formal specification for the problem of semantic XML schema Matching. Semantic schema Matching has been extensively researched, and many Matching systems have been developed. However, formal specifications of problems being solved by these systems do not exist, or are partial. In this paper, we analyze the problem of semantic schema Matching, identify its main components and deliver a formal specification based on the constraint optimization problem formalism. Throughout the paper, we consider the schema Matching problem as encountered in the context of a large scale XML schema Matching Application.

  • Formalizing the XML Schema Matching Problem as a Constraint Optimization Problem
    Lecture Notes in Computer Science, 2005
    Co-Authors: Marko Smiljanic, Maurice Van Keulen, Willem Jonker, Kim Viborg Andersen, John Debenham, Roland Wagner
    Abstract:

    The first step in finding an efficient way to solve any difficult problem is making a complete, possibly formal, problem specification. This paper introduces a formal specification for the problem of semantic XML schema Matching. Semantic schema Matching has been extensively researched, and many Matching systems have been developed. However, formal specifications of problems being solved by these systems do not exist, or are partial. In this paper, we analyze the problem of semantic schema Matching, identify its main components and deliver a formal specification based on the constraint optimization problem formalism. Throughout the paper, we consider the schema Matching problem as encountered in the context of a large scale XML schema Matching Application.

Marko Smiljanic - One of the best experts on this subject based on the ideXlab platform.

  • DEXA - Formalizing the XML schema Matching problem as a constraint optimization problem
    Lecture Notes in Computer Science, 2005
    Co-Authors: Marko Smiljanic, Maurice Van Keulen, Willem Jonker
    Abstract:

    The first step in finding an efficient way to solve any difficult problem is making a complete, possibly formal, problem specification. This paper introduces a formal specification for the problem of semantic XML schema Matching. Semantic schema Matching has been extensively researched, and many Matching systems have been developed. However, formal specifications of problems being solved by these systems do not exist, or are partial. In this paper, we analyze the problem of semantic schema Matching, identify its main components and deliver a formal specification based on the constraint optimization problem formalism. Throughout the paper, we consider the schema Matching problem as encountered in the context of a large scale XML schema Matching Application.

  • Formalizing the XML Schema Matching Problem as a Constraint Optimization Problem
    Lecture Notes in Computer Science, 2005
    Co-Authors: Marko Smiljanic, Maurice Van Keulen, Willem Jonker, Kim Viborg Andersen, John Debenham, Roland Wagner
    Abstract:

    The first step in finding an efficient way to solve any difficult problem is making a complete, possibly formal, problem specification. This paper introduces a formal specification for the problem of semantic XML schema Matching. Semantic schema Matching has been extensively researched, and many Matching systems have been developed. However, formal specifications of problems being solved by these systems do not exist, or are partial. In this paper, we analyze the problem of semantic schema Matching, identify its main components and deliver a formal specification based on the constraint optimization problem formalism. Throughout the paper, we consider the schema Matching problem as encountered in the context of a large scale XML schema Matching Application.

Roland Wagner - One of the best experts on this subject based on the ideXlab platform.

  • Formalizing the XML Schema Matching Problem as a Constraint Optimization Problem
    Lecture Notes in Computer Science, 2005
    Co-Authors: Marko Smiljanic, Maurice Van Keulen, Willem Jonker, Kim Viborg Andersen, John Debenham, Roland Wagner
    Abstract:

    The first step in finding an efficient way to solve any difficult problem is making a complete, possibly formal, problem specification. This paper introduces a formal specification for the problem of semantic XML schema Matching. Semantic schema Matching has been extensively researched, and many Matching systems have been developed. However, formal specifications of problems being solved by these systems do not exist, or are partial. In this paper, we analyze the problem of semantic schema Matching, identify its main components and deliver a formal specification based on the constraint optimization problem formalism. Throughout the paper, we consider the schema Matching problem as encountered in the context of a large scale XML schema Matching Application.

Maurice Van Keulen - One of the best experts on this subject based on the ideXlab platform.

  • DEXA - Formalizing the XML schema Matching problem as a constraint optimization problem
    Lecture Notes in Computer Science, 2005
    Co-Authors: Marko Smiljanic, Maurice Van Keulen, Willem Jonker
    Abstract:

    The first step in finding an efficient way to solve any difficult problem is making a complete, possibly formal, problem specification. This paper introduces a formal specification for the problem of semantic XML schema Matching. Semantic schema Matching has been extensively researched, and many Matching systems have been developed. However, formal specifications of problems being solved by these systems do not exist, or are partial. In this paper, we analyze the problem of semantic schema Matching, identify its main components and deliver a formal specification based on the constraint optimization problem formalism. Throughout the paper, we consider the schema Matching problem as encountered in the context of a large scale XML schema Matching Application.

  • Formalizing the XML Schema Matching Problem as a Constraint Optimization Problem
    Lecture Notes in Computer Science, 2005
    Co-Authors: Marko Smiljanic, Maurice Van Keulen, Willem Jonker, Kim Viborg Andersen, John Debenham, Roland Wagner
    Abstract:

    The first step in finding an efficient way to solve any difficult problem is making a complete, possibly formal, problem specification. This paper introduces a formal specification for the problem of semantic XML schema Matching. Semantic schema Matching has been extensively researched, and many Matching systems have been developed. However, formal specifications of problems being solved by these systems do not exist, or are partial. In this paper, we analyze the problem of semantic schema Matching, identify its main components and deliver a formal specification based on the constraint optimization problem formalism. Throughout the paper, we consider the schema Matching problem as encountered in the context of a large scale XML schema Matching Application.

Evangelos P Markatos - One of the best experts on this subject based on the ideXlab platform.

  • scap stream oriented network traffic capture and analysis for high speed networks
    Internet Measurement Conference, 2013
    Co-Authors: Antonis Papadogiannakis, Michalis Polychronakis, Evangelos P Markatos
    Abstract:

    Many network monitoring Applications must analyze traffic beyond the network layer to allow for connection-oriented analysis, and achieve resilience to evasion attempts based on TCP segmentation. However, existing network traffic capture frameworks provide Applications with just raw packets, and leave complex operations like flow tracking and TCP stream reassembly to Application developers. This gap leads to increased Application complexity, longer development time, and most importantly, reduced performance due to excessive data copies between the packet capture subsystem and the stream processing module. This paper presents the Stream capture library (Scap), a network monitoring framework built from the ground up for stream-oriented traffic processing. Based on a kernel module that directly handles flow tracking and TCP stream reassembly, Scap delivers to user-level Applications flow-level statistics and reassembled streams by minimizing data movement operations and discarding uninteresting traffic at early stages, while it inherently supports parallel processing on multi-core architectures, and uses advanced capabilities of modern network cards. Our experimental evaluation shows that Scap can capture all streams for traffic rates two times higher than other stream reassembly libraries, and can process more than five times higher traffic loads when eight cores are used for parallel stream processing in a pattern Matching Application.