• Proceedings of the Korea Contents Association Conference
• /
• 2006.11a
• /
• pp.163-167
• /
• 2006

The previous media has the function that was information of the contents was delivered by only content providers, but the current media makes the interactive function between content providers and general receivers. For this reason, the role of receivers are also expanded in the realm of multimedia and receivers have the roles of the sending and getting information for content user, not more receiver. The constituent members relative to content are content providers, users and user-created content. This paper introduces "the wonderland" the animation process management system for high-level user group. Also, most of images which are made of the animation process are publicly accessible, providing the public or the average user group for making resources easily by using "the wonderland." Although, the general user can get an environment to reedit their own new movie with making the most of provided movie sources are scene and cut units, according to one's taste and one's idea. The materialization of process management system can expand dramatically enough contents, and save the time to edit digital animation or movie, control numerous sources, made an animation processing, and the result output. Such "the wonderland" will significantly help to create future content.

• Journal of Intelligence and Information Systems
• /
• v.19 no.3
• /
• pp.57-71
• /
• 2013

Over a billion people in the world generate new news minute by minute. People forecasts some news but most news are from unexpected events such as natural disasters, accidents, crimes. People spend much time to watch a huge amount of news delivered from many media because they want to understand what is happening now, to predict what might happen in the near future, and to share and discuss on the news. People make better daily decisions through watching and obtaining useful information from news they saw. However, it is difficult that people choose news suitable to them and obtain useful information from the news because there are so many news media such as portal sites, broadcasters, and most news articles consist of gossipy news and breaking news. User interest changes over time and many people have no interest in outdated news. From this fact, applying users' recent interest to personalized news service is also required in news service. It means that personalized news service should dynamically manage user profiles. In this paper, a content-based news recommendation system is proposed to provide the personalized news service. For a personalized service, user's personal information is requisitely required. Social network service is used to extract user information for personalization service. The proposed system constructs dynamic user profile based on recent user information of Facebook, which is one of social network services. User information contains personal information, recent articles, and Facebook Page information. Facebook Pages are used for businesses, organizations and brands to share their contents and connect with people. Facebook users can add Facebook Page to specify their interest in the Page. The proposed system uses this Page information to create user profile, and to match user preferences to news topics. However, some Pages are not directly matched to news topic because Page deals with individual objects and do not provide topic information suitable to news. Freebase, which is a large collaborative database of well-known people, places, things, is used to match Page to news topic by using hierarchy information of its objects. By using recent Page information and articles of Facebook users, the proposed systems can own dynamic user profile. The generated user profile is used to measure user preferences on news. To generate news profile, news category predefined by news media is used and keywords of news articles are extracted after analysis of news contents including title, category, and scripts. TF-IDF technique, which reflects how important a word is to a document in a corpus, is used to identify keywords of each news article. For user profile and news profile, same format is used to efficiently measure similarity between user preferences and news. The proposed system calculates all similarity values between user profiles and news profiles. Existing methods of similarity calculation in vector space model do not cover synonym, hypernym and hyponym because they only handle given words in vector space model. The proposed system applies WordNet to similarity calculation to overcome the limitation. Top-N news articles, which have high similarity value for a target user, are recommended to the user. To evaluate the proposed news recommendation system, user profiles are generated using Facebook account with participants consent, and we implement a Web crawler to extract news information from PBS, which is non-profit public broadcasting television network in the United States, and construct news profiles. We compare the performance of the proposed method with that of benchmark algorithms. One is a traditional method based on TF-IDF. Another is 6Sub-Vectors method that divides the points to get keywords into six parts. Experimental results demonstrate that the proposed system provide useful news to users by applying user's social network information and WordNet functions, in terms of prediction error of recommended news.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2009.05a
• /
• pp.996-1000
• /
• 2009

물순환계를 종합적으로 관리하기 위해서는 물순환계의 모니터링과 해석모형의 구축이 필요하다. 실측자료만으로는 복잡 다양한 물순환계 구조 및 인과관계를 규명할 수 없기 때문에 시간적 공간적으로 변화하는 다양한 수문현상을 일관된 하나의 시스템으로 이해하기 위해 물순환 해석모델을 구축하여 검토할 필요가 있다. CAT(Catchment hydrologic cycle Analysis Tool)은 수문학적으로 균일하게 판단되는 범위를 소유역으로 분할하여 지형학적 요인에 의한 유출 특성을 객관적으로 반영할 수 있게 하며, 토양층에 따라 침투, 증발, 지하수 흐름 등의 모의가 가능하도록 하는 Link-Node 모형으로, 증발산은 기준 증발산을 외부에서 직접 입력하거나, Penman-Monteith 방법을 선택할 수 있으며, 침투는 토양의 수리전도도에 따른 연직방향 침투 및 사면방향 복귀류를 고려할 수 있다. 노드의 지하수 유거를 고려하여 기존 노드-링크 방식 모형의 장기 유출 해석시 제한점을 보완하였으며, Muskingum, Muskingum-Cunge, Kinematic wave 방법을 이용하여 하도추적을 모의할 수 있다. 또한 GUI를 통해 사용자가 손쉽게 모형을 적용하고 관리 할 수 있도록 하고, 여러 시나리오를 적용함에 있어서 편리하도록 개발 중인 모형이다. 본 연구에서는 개발중인 CAT 모형을 평가 하기위해 시험 유역으로 운영 중인 설마천 유역에 적용하여 소유역 분할(노드수), 계산 시간 간격(일/시단위) 등에 따른 적용성을 평가하였다. 관측 자료를 통해 구축 가능한 물리적 매개변수를 통해 해당 유역을 단일 노드 및 다중 노드로 간단히 모형화할 수 있었으며, 모의 결과, 관측 유량과 적절히 일치하는 결과를 얻을 수 있었다. 1시간 단위에 대한 모의에서도 유출을 적절히 모의할 수 있었으며, 소규모 유역에 대한 정밀한 물순환 해석이 가능할 것으로 평가되었다.

• The Journal of Society for e-Business Studies
• /
• v.16 no.1
• /
• pp.71-100
• /
• 2011

There are expectations about future internet technology with IT development by end-users. Cloud computing is attracted to satisfy those demands. However, adoption of cloud computing is not active that much. Therefore, this study verified how cloud computing environment affects performance of team project. We conducted empirical study on performance of team project with cloud computing as technology tool focusing on Task-Technology Fit Model. We collected samples that were undergraduate and graduate school students and had experience on initial cloud computing such as Google-Docs and Webhard when they conducted team project for assignment. We focused on accessibility and reliability as task-technology fit and those variables treated as first order factor. Result showed that cloud computing is suitable technology tool for team project. This study suggests positive effects of cloud computing for collaboration by proving perceived fit and performance in initial cloud computing.

• The KIPS Transactions:PartD
• /
• v.14D no.1 s.111
• /
• pp.35-44
• /
• 2007

Recently, an increasing in quantity of multimedia data have brought a new problem that expected data should be retrieved fast and exactly. The adequate representation for the multimedia data is the key element for efficient retrieval. For this reason, MPEG-7 standard was established for description of multimedia data. In this paper, we propose a new approach to metadata production. The user can decompose a given content into units and easily annotate each unit by adding basic Information such as time, place, etc. as well as classification information such as event, relationship, etc. according to the MPEG-7 standard. The objective is to build automatically a pure semantic description; the nodes are the events and the links are the graphs which describe the relationships among the events. Finally, we have implemented an annotation tool(SMAT) for semantic description based on proposed technique and assess some of the experiment results. In conclusion, we ran say that the proposod annotation tool is characterized by two important proprieties : reusability and extendibility.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.7
• /
• pp.752-765
• /
• 1999

대부분 병렬처리 시스템에서 성능 파라미터는 복잡하고 프로그램의 수행 시 예견할 수 없게 변하기 때문에 컴파일러가 프로그램 수행에 대한 최적의 성능 파라미터들을 컴파일 시에 결정하기가 힘들다. 본 논문은 병렬 처리 시스템의 프로그램 수행 시, 변화하는 시스템 성능 상태에 따라 전체 성능이 최적화로 적응하는 적응 수행 방식을 제안한다. 본 논문에서는 이 적응 수행 방식 중에 적응 프로그램 수행을 위한 이론적인 방법론 및 구현 방법에 대해 제안하고 적응 제어 수행을 위해 프로그램의 데이타 공유 단위에 대한 적응방식(적응 입도 방식)을 사용한다. 적응 프로그램 수행 방식은 프로그램 수행 시 하드웨어와 컴파일러의 도움으로 프로그램 자신이 최적의 성능을 얻을 수 있도록 적응하는 방식이다. 적응 제어 수행을 위해 수행 시에 병렬 분산 공유 메모리 시스템에서 프로세서 간 공유될 수 있은 데이타의 공유 상태에 따라 공유 데이타의 크기를 변화시키는 적응 입도 방식을 적용했다. 적응 입도 방식은 기존의 공유 메모리 시스템의 공유 데이타 단위의 통신 방식에 대단위 데이타의 전송 방식을 사용자의 입장에 투명하게 통합한 방식이다. 시뮬레이션 결과에 의하면 적응 입도 방식에 의해서 하드웨어 분산 공유 메모리 시스템보다 43%까지 성능이 개선되었다. Abstract On parallel machines, in which performance parameters change dynamically in complex and unpredictable ways, it is difficult for compilers to predict the optimal values of the parameters at compile time. Furthermore, these optimal values may change as the program executes. This paper addresses this problem by proposing adaptive execution that makes the program or control execution adapt in response to changes in machine conditions. Adaptive program execution makes it possible for programs to adapt themselves through the collaboration of the hardware and the compiler. For adaptive control execution, we applied the adaptive scheme to the granularity of sharing adaptive granularity. Adaptive granularity is a communication scheme that effectively and transparently integrates bulk transfer into the shared memory paradigm, with a varying granularity depending on the sharing behavior. Simulation results show that adaptive granularity improves performance up to 43% over the hardware implementation of distributed shared memory systems.

• The KIPS Transactions:PartD
• /
• v.11D no.1
• /
• pp.83-94
• /
• 2004

Recent researches which purport to Integrate distributed information have been concentrated on developing efficient mediator systems that not only provide a high degree of autonomy for local users but also support the flexible integration of required functions for global users. However, there has been little attention on how to evaluate a global query in a mediator. A global query is transformed into a set of its sub-queries and each sub-query is the unit of evaluation in a remote server. Therefore, it is possible to speed up the execution of a global query if the previous results of frequently evaluated sub-queries are materialized in a mediator. Since the Integration schema of a mediator can be incrementally modified and the evaluation frequency of a global query can also be continuously varied, query usage should be carefully monitored to determine the optimized set of materialized sub-queries. Furthermore, as the number of sub-queries increases, the optimization process itself may take too long, so that the optimized set Identified by a long optimization process nay become obsolete due to the recent change of query usage. This paper proposes the adaptive selection of materialized sub-queries such that available storage in a mediator can be highly utilized at any time. In order to differentiate the recent usage of a query from the past, the accumulated usage frequency of a query decays as time goes by.

• Journal of Korean Society of Transportation
• /
• v.20 no.3
• /
• pp.129-147
• /
• 2002

This paper presents a variational equality formulation by Providing new dynamic route choice condition for a link-based dynamic traffic assignment model. The concepts of used paths, used links, used departure times are employed to derive a new link-based dynamic route choice condition. The route choice condition is formulated as a time-dependent variational equality problem and necessity and sufficiency conditions are provided to prove equivalence of the variational equality model. A solution algorithm is proposed based on physical network approach and diagonalization technique. An asymmetric network computational study shows that ideal dynamic-user optimal route condition is satisfied when the length of each time interval is shortened. The I-394 corridor study shows that more than 93% of computational speed improved compared to conventional variational inequality approach, and furthermore as the larger network size, the more computational performance can be expected. This paper concludes that the variational equality could be a promising approach for real-time application of a dynamic traffic assignment model based on fast computational performance.

• Journal of Korea Society of Industrial Information Systems
• /
• v.4 no.4
• /
• pp.32-39
• /
• 1999

Video-On-Demand servers have to provide timely processing guarantees and reduce the storage and reduce the storage and bandwidth requirements for continuous media However, compression techniques used in Video-On-Demand servers make the bit rates of compressed video data significantly variable from frame to frame Consequently, most pervious Video-On-Demand servers which use constant bit rate retrieval to guarantee deterministic service under-utilize the system resources and restrict the number of clients. In this paper, I propose a buffer management scheme called CAP(Caching And Prefetching) for Video-On-Demand server using variable bit rate continuous media. By caching and prefetching the data CAP reduces the variation of the compressed data and increases the number of clients simultaneously served and maximizes the utilization of system resources. Results of trace-driven simulations show the effectiveness of the scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.4
• /
• pp.848-854
• /
• 2015

There are a lot of encryption methods to secure database proposed recently. Those encryption methods can protect the sensitive data of users effectively, but it deteriorates the search performance of database query. In this paper, we proposed the selective element encryption method in order to complement those drawbacks. In addition, we compared the performance of the proposed method with that of tuple level encryption method using the various queries. As a result, we found that the proposed method, which use the selective element encryption with bloom filter as a index, has better performance than the other encryption method.