2005년 대한 생화학·분자생물학회 하계학술대회를 다녀와서

A super-peer is a node in a peer-to-peer network that operates both as a server to a set of clients, and as an equal in a network of super-peers. Super-peer networks strike a balance between the efficiency of centralized search, and the autonomy, load balancing and robustness to attacks provided by distributed search. Furthermore, they take advantage of the heterogeneity of capabilities (e.g., bandwidth, processing power) across peers, which recent studies have shown to be enormous. Hence, new and old P2P systems like KaZaA and Gnutella are adopting super-peers in their design. Despite their growing popularity, the behavior of super-peer networks is not well understood. For example, what are the potential drawbacks of super-peer networks? How can super-peers be made more reliable? How many clients should a super-peer take on to maximize efficiency? we examine super-peer networks in detail, gaming an understanding of their fundamental characteristics and performance tradeoffs. We also present practical guidelines and a general procedure for the design of an efficient super-peer network.

Designing an Super-Peer Network

Business Process Management (BPM) research resulted in a plethora of methods, techniques, and tools to support the design, enactment, management, and analysis of operational business processes. This survey aims to structure these results and provide an overview of the state-of-the-art in BPM. In BPM the concept of a process model is fundamental. Process models may be used to configure information systems, but may also be used to analyze, understand, and improve the processes they describe. Hence, the introduction of BPM technology has both managerial and technical ramifications and may enable significant productivity improvements, cost savings, and flow-time reductions. The practical relevance of BPM and rapid developments over the last decade justify a comprehensive survey.

/pdf/business-process-management-a-comprehensive-survey-bjvwpsge7u.pdf

Business Process Management: A Comprehensive Survey

The discovery of functional dependencies from relations is an important database analysis technique. We present TANE, an efficient algorithm for finding functional dependencies from large databases. TANE is based on partitioning the set of rows with respect to their attribute values, which makes testing the validity of functional dependencies fast even for a large number of tuples. The use of partitions also makes the discovery of approximate functional dependencies easy and efficient and the erroneous or exceptional rows can be identified easily. Experiments show that T ANE is fast in practice. For benchmark databases the running times are improved by several orders of magnitude over previously published results. The algorithm is also applicable to much larger datasets than the previous methods.

/pdf/tane-an-efficient-algorithm-for-discovering-functional-and-1wqk08f9c8.pdf

Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies

A roadmap for security challenges in the Internet of Things

In the area of Web services and service-oriented architectures, business protocols are rapidly gaining importance and mindshare as a necessary part of Web service descriptions. Their immediate benefit is that they provide developers with information on how to write clients that can correctly interact with a given service or with a set of services. In addition, once protocols become an accepted practice and service descriptions become endowed with protocol information, the middleware can be significantly extended to better support service development, binding, and execution in a number of ways, considerably simplifying the whole service life-cycle. This paper discusses the different ways in which the middleware can leverage protocol descriptions, and focuses in particular on the notions of protocol compatibility, equivalence, and replaceability. They characterize whether two services can interact based on their protocol definition, whether a service can replace another in general or when interacting with specific clients, and which are the set of possible interactions among two services.

Representing, analysing and managing web service protocols

Web services are emerging as a promising technology for the effective automation of inter-organizational interactions. However, despite the growing interest, several issues still need to be addressed to provide Web services with benefits similar to what traditional middleware brings to intra-organizational application integration. In this paper, we present a framework that supports the model-driven development of Web services. Specifically, we show how, starting from the external specifications of a Web service (e.g., interface and protocol specifications), we can support the generation of extensible service implementation templates as well as of complete (executable) service specifications, thereby considerably simplifying the service development work.

/pdf/model-driven-web-service-development-4snp4gkhsd.pdf

Model-Driven Web Service Development

A proposed conceptual framework for analyzing Web services interoperability issues provides a context for studying existing standards and specifications and for identifying new opportunities to provide automated support, for this technology. Web services are becoming the technology of choice for realizing service-oriented architectures (SOAs). Web services simplify interoperability and, therefore, application integration. They provide a means for wrapping existing applications so developers can access them through standard languages and protocols.

Web services interoperability specifications

One of the challenging problems that Web service technology faces is the ability to effectively discover services based on their capabilities. We present an approach to tackle this problem in the context of DAML-S ontologies of services. The proposed approach enables to select the combinations of Web services that best match a given request Q and effectively computes the extra information with respect to Q (e.g., the information required by a service request but not provided by any existing service). We study the reasoning problem associated with such a matching process and propose an algorithm derived from hypergraphs theory.

/pdf/request-rewriting-based-web-service-discovery-1tivjrzs9x.pdf

Request rewriting-based web service discovery

This paper describes a technique that supports Extended Entity-Relationship (EER) schema extraction from an operating relational database. In this reverse engineering context, the two major decisions that have to be taken are the assumptions on the initial schema and where data semantic is extracted from. Original aspects of our method are manifold. First, it is based on realistic assumptions, e.g., there is no constraints on the uniqueness of the attribute names. Second, the dependencies between the attributes are not supposed to be known a priori. The method starts from the database schema as stored in the DBMS dictionary, i.e., the relation names, the attribute names and their basic characteristics (uniqueness of value, not null values). Finally, semantics extraction is supported by available queries analysis. It is shown how specific kinds of query can help to build an EER schema including is-a relationships and aggregates.

Using Queries to Improve Database Reverse Engineering

Handle everyday research tasks with reliable, citation-backed results

Your personal Research Agent to handle research tasks with citation-backed results

Popular Tasks used by Researchers

How can I help with your research?

Meet SciSpace

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

Farouk Toumani

Author Tools

Chat about Author