• 디자인학연구
• /
• 제16권4호
• /
• pp.375-384
• /
• 2003

Interactive storytelling is a scenario created "on the fly" with digital content through user interaction. Every time interaction occurs between the user and content, a brand new story is created. Interaction intrigues people because it provides different story from same content. Through conventional media, people shared same content and experience. However through interactive media, people encounter unique experience, over same content possibly everytime they use it. People we, by their nature, very interactive being. However, interacting with media is not an activity that people are accustomed to. Hence, designing content has been all migrating experience from existing media to an unfamiliar ground. Unique and adoptive ways of designing content for digital interactive media is being sought out from the need as the result of the evolution of integrated society and emerging information technology. People are already used to some of interactive storytelling through hyper text in CD-ROM and web sites. More complicated and different structured models were born through games that offered graphics, virtual spaces and interactivity. When drawn onto a structural graph, few attributes and similarities seem to occur. This paper will try to outline and discuss structural graphs of interactive storytelling methods and suggest some ways for better storytelling design.

• 한국컴퓨터산업학회논문지
• /
• 제5권9호
• /
• pp.921-928
• /
• 2004

이 논문에서는 웹 기반의 하이퍼미디어 교육시스템에서 이산 확률 분포 함수와 사용자 프로파일 기반의 동적 적응 모델을 제안하였다. 이 모델은 응용 영역을 동적 적응 객체의 가중치 방향성 그래프로 표현하며, 사용자 행위를 이산 확률 함수를 동적으로 구축하는 접관 방식을 이용하여 모델링한다. 제안한 확률적 해석은 웹 미디어 구조에서 사용자의 탐색 행위를 추적하여 사용자 행위에 대한 잠재적 속성을 나타내는데 사용될 수 있다. 이러한 접근 방식은 사용자에게 가장 알맞은 프로파일을 동적으로 할당할 수 있다.

• 한국경영과학회지
• /
• 제32권4호
• /
• pp.51-60
• /
• 2007

In this study, we consider the minimum ADM problem which is the fundamental problem for the cost-effective design of SONET ADM embedded in WDM ring networks. To minimize the number of SONET ADMs, efficient algorithms for the routing and wavelength assignment are needed. We propose a mathematical model based on the graph theory for the problem and propose a branch-and-price approach to solve the suggested model effectively within reasonable time. By exploiting the mathematical structure of ring networks, we developed polynomial time algorithms for column generation subroutine at branch-and-bound tree. In a computer simulation study, the suggested approach can find the optimal solution for sufficient size networks and shows better performance than the greedy heuristic method.

• 한국멀티미디어학회논문지
• /
• 제2권2호
• /
• pp.200-216
• /
• 1999

본 연구에는 멀티미디어 타이틀의 저작과 동기화 문제를 효과적으로 명세하고 분석할 수 있으며, 타이틀의 재생을 직접 제어할 수 있는 통합모형인 BTPN모형과 패러다임들을 제시한다 타이틀내의 객체들간의 모든 관계들을 BTPN구조와 BTPN언어로 명세하는 방법과 잔여시간형 도달성그래프, 타이밍다이어그램 둥을 이용하여 BTPN을 분석하는 방법을 제시하였다. 특히, PERT/CPM방법으로부터 도입한 임계객체경로나 최 장경로 개념은 타이틀 저작 및 재생시의 불확실성을 모형화하며 재생시간의 조정도 가능하게 하고 있다.

• 한국지능정보시스템학회:학술대회논문집
• /
• 한국지능정보시스템학회 2007년도 한국지능정보시스템학회
• /
• pp.123-137
• /
• 2007

The information space of semantic web comprised of various resources, properties, and relationships is more complex than that of WWW comprised of just documents and hyperlinks. Therefore, ranking methods in the semantic web should be modified to reflect the complexity of the information space. In this paper we propose a method of ranking query results from RDF(Resource Description Framework) knowledge bases. The ranking criterion is the importance of a resource computed based on the link structure of the RDF graph. Our method is expected to solve a few problems in the prior research including the Tightly-Knit Community Effect. We illustrate our methods using examples and discuss directions for future research.

• 한국정보처리학회논문지
• /
• 제6권11S호
• /
• pp.3219-3228
• /
• 1999

Currently, car information service systems are lack of providing retrieval service, because most of them aim for buying and selling. Thus, in this paper, we design and implement CISS(Car Information Service System on Internet) to provide efficient retrieval for car information. In CISS, we collect information of cars on Internet and construct the lattice structure for efficient retrieval. And we provide retrieval convenience by implementing of Car Browser that permits gradual refinement of the index term by browsing through lattice graph and that permits keyword-based retrieval.

• 한국정보처리학회논문지
• /
• 제7권7호
• /
• pp.2020-2027
• /
• 2000

The hypertext document is used for information exchange in the Web environments. Its structure is considered as having graph structures with links, which makes nonlinear processing of documents possible. This paper proposes an indexing method for information retrieval system using XML links. We define new attributes that control links of a remote document and assign an unique identifier for the attribute of each link. Each identifier has a different weight according to its occurrence position that is local or remote documents. We index a word not only from a local document but a remote document based on the given weight. Experimental results show that the proposed method outperforms conventional retrieval systems that ignore links.

• 전기전자학회논문지
• /
• 제1권1호
• /
• pp.111-119
• /
• 1997

본 논문에서는 최근의 디지탈논리시스템의 함수구성시에 도입되고 있는 그래프이론에 바탕을 둔 결정도로부터 새로운 형태의 데이터구조 형태인 에지값 결정도를 추출하는 알고리즘의 한가지 방법을 제안하였다. 그리고 이를 기초로 임의의 m치 n변수의 축약된 함수구성을 도출하는 방법에 대해 논의하였다. 제안한 다치논리함수구성방법은 도식적이며 규칙적이고 정규성을 내포하고 있다.

• 호남수학학술지
• /
• 제30권4호
• /
• pp.589-602
• /
• 2008

As a survey-type article, the paper reviews various digital topological utilities from digital covering theory. Digital covering theory has strongly contributed to the calculation of the digital k-fundamental group of both a digital space(a set with k-adjacency or digital k-graph) and a digital product. Furthermore, it has been used in classifying digital spaces, establishing almost Van Kampen theory which is the digital version of van Kampen theorem in algebrate topology, developing the generalized universal covering property, and so forth. Finally, we remark on the digital k-surface structure of a Cartesian product of two simple closed $k_i$-curves in ${\mathbf{Z}}^n$, $i{\in}{1,2}$.

• Asia pacific journal of information systems
• /
• 제12권2호
• /
• pp.99-118
• /
• 2002

In this paper, we propose a visual relational database query language, VRQL, by modifying and extending the recently proposed $VOQL^*$. Like $VOQL^*$, VRQL, based on ven Diagram and graph, naturally reflects the structure of schemas in queries and has recursive formal semantics. However, VRQL has relationally complete expressiveness, while $VOQL^*$ is only a conjunctive query language. In the logical definition part of VRQL, which is the relational version of $VOQL^*$, most features of $VOQL^*$ are retained, and the semantics of queries are based on the tuple relational calculus. In the procedural definition part of VRQL, by introducing the concept of VRQL view and set operations, the expressiveness of VRQL is increased to the level equivalent to that of the relational algebra. Due to the introduction of VRQL views, existing queries or temporary queries used in the process of creating queries can be represented with views, so that complex queries may be represented more conveniently. Set operations, used with VRQL views, enable us to represent various queries, beyond the expressiveness of conjunctive query languages.