Electronics and Telecommunications Research Institute

Hoo Young Ahn

Cheol Sig Pyo

Young Min Kim

Hyun Jae Kim

Yeon Hee Lee

Hyun Joong Kang

Hoon Ki Lee

Tae Hwan Kim

Nae Soo Kim

Dae Won Kim

Jung Tae Kim

Jong-Hoon Lee

Ho Sung Lee

Ho Sub Lee

Woong Shik You

Soon Hyun Kwon

Young Ho Park

Euihyun Paik

Sun Jin Kim

Tae Wan You

Wan Seon Lim

Provided is an engine container configured by a workflow engine framework for a cross-domain extension, including a plurality of operators configured to interwork with a plurality of representational state transfer (REST) application programming interfaces (APIs), respectively, a runner configured to sequentially call the plurality of operators according to a request from a client, and a controller configured to control an operation of the plurality of operators and the runner, wherein each operator operates in a pipeline manner to call a corresponding REST API using uniform resource locator (URL) information transferred from the runner and to transfer a processing result obtained by processing data provided through the corresponding called REST API to a next operator.

Workflow engine framework for cross-domain extension

A workflow engine framework for creating a single-domain adaptive and a cross-domain adaptive workflow performing platform is disclosed. The workflow engine framework includes: a resource management unit configured to manage resources including engine components and workflow property specification components; a system configuration unit configured to create an engine by assembling the property specification components; and a system control unit configured to drive and execute one or more engines. Further the workflow engine framework is allocated to each of two or more different signal domains and forms a cross-domain adaptive workflow engine framework.

Workflow engine framework

A method for indexing a suffix tree in a social network includes: scanning an input string and dividing the string into partitions each having a common prefix; performing no-merge suffix tree indexing on the divided partitions; storing information on the partitions on which no-merge suffix tree indexing is performed; storing suffix nodes of the no-merge suffix tree; and establishing a prefix tree. The performing no-merge suffix tree indexing includes: generating a set of suffixes having the common prefix in the input string; generating a suffix set from the set of suffixes and storing the suffix set; and building the suffix set as a sub-tree.

Method and apparatus for indexing suffix tree in social network

Growing community of inventors

Daejeon, South Korea

Hoo Young Ahn