• 정보기술과데이타베이스저널
• /
• 제6권1호
• /
• pp.103-114
• /
• 1999

Marketing decision support systems rely on an underlying enterprise information infrastructure. In traditional business situations, a limited number of product lines and markets divided into large chunks were adequately served by existing management information systems. With the advent of an increasingly segmented focus on niche markets and individual customers, the demand for market information has grown exponentially. The practical solutions offered by such data warehousing tools as OLAP and data mining directly address this need, allowing organizations to discover new niches. Marketing decision support systems built on these foundations provide organizations with new avenues for creating specifically targeted marketing strategies and promotional campaigns. The contribution of this article lies in introducing a graphical framework for data warehousing applications. Based on prior research, the framework links data warehousing and database marketing. To illustrate the effectiveness of this approach, three case examples of successful database marketing conclude the paper.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2006년도 춘계학술발표대회
• /
• pp.1147-1150
• /
• 2006

Stream Control Transmission Protocol (SCTP) uses the 32-bit checksum in the common header, by which a corrupted SCTP packet will be regarded as a lost packet and then discarded. This may result in degradation of SCTP's throughput performance over wireless networks. This paper proposes a new chunk checksum scheme for SCTP, in which each data chunk contains its own checksum field and SACK chunk carry corresponding Transmission Sequence Number (TSN) with timestamp for every corruption event. The proposed chunk checksum scheme is introduced with the following three purposes: 1) to distinguish the chunk corruptions from the chunk losses; 2) to avoid the unnecessary halving of the congestion window (cwnd) in the case of chunk corruption; 3) to avoid the unwanted timeouts which can be induced in conventional SCTP in the case that the retransmitted data chunks are corrupted again in wireless networks. Simulation results show that the proposed chunk checksum scheme could improve the SCTP throughput in the wireless environments with a high bit error rate.

• 인지과학
• /
• 제4권2호
• /
• pp.263-278
• /
• 1994

본 논문에서는 영어의 은유적효현을 분석하여 한국어로 번역하는 과정을 제안한다.기존의 영어 분석기나 번역기들은 주어진 범위나 상황내에서의 분석,번역을 시도하였고,은우적 표현에 대한 시도는 기피해 왔다. 제안된 과정은 복합어나 숙어를 처리하는 과정과는 다르게 다루어진다.(Lee(1985)[5],Yoon & Kim(1993)[8]참조). 숙어나 복합어는 그 구(phrase)전체를 하나의 단위(unit)로 처리하는 반면에,은유적표현의 처리과정은 주어진 술어나 논항의 기존범의를 확장(extension of smantic property)시켜 '은유사전'(metaphor dictionary)에서 별개로 처리된다.은유적 표현으로 사용된 어휘는 은유사전에'M'로 표시된다.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1995년도 추계학술대회발표논문집; 서울대학교, 서울; 30 Sep. 1995
• /
• pp.300-324
• /
• 1995

This research investigates the automatic identification of typical embedded structures in the Integer Programming(IP) models and automatic transformation of the problem to an adequate Lagrangian problem which can provide tight bounds within the acceptable run time. For this purpose, the structural distinctiveness of variables, constants, blocks of terms, and constraint chunks is identified to describe the structure of the IP model. To assist the identification of the structural distinctiveness, the representation by the knowledge based IP model formulator UNIK-IP is adopted. For the reasoning for the structural identification, the bottom-up, top-down, and case-based approaches are proposed. A prototype system UNIK-RELAX is developed to implement the approaches proposed in this research.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2006년 학술대회 논문집 정보 및 제어부문
• /
• pp.515-517
• /
• 2006

Recently, there is a rapidly growing demand for efficient real-tine playback and transmission of large amounts of multimedia data. But most users' connections are not fast enough to download large chunks of multimedia data. Therefore a streaming technology is needed in which users enable the real-time playback of multimedia date without having to download the whole of the multimedia date. In this paper, we propose a personalized IP streaming system. The proposed IP streaming system enables users to got an intelligent recommendation of multimedia contents based on the user preference information stored on the streaming server or the home media server. Moreover, users are assured of seamless access of streamed content event if they switch to another client device by implementing streaming system based on user identification and device information. We evaluate our approach with simulation results.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.106.1-106
• /
• 2001

American options no doubt is invariably more popular than European options, due to the fact that it gives the owner the option to exercise a contract before and up to the expiration date, unlike an European option, which only allows the owner to exercise a contract on the date of expiration. Owing to its popularity, many methods like the binomial numerical method and the pseudo American method have been devised for computing of the value of the American options. The aim of this research is to develop an effective 3-dimensional visualization for American option portfolio based on the Geske-Roll-Whaley model. It is obvious that it is extremely tedious and unadvisable for researchers to interprte chunks of data by looking at graphs or pie charts, which are simple but not effective for analyzing important dta. Hence, the generation of the Geske-Roll-Whaley ...

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2002년도 정기총회 및 학술대회
• /
• pp.173-176
• /
• 2002

This paper proposes a new approach for digital watermarking and secure copyright protection of video. the principal aim being to discourage illicit copying and distribution of copyrighted material. The method presented here is based on the three dimensional discrete wavelet transform of video scene. The watermark is a copyright information encoded in the form of a spread spectrum signal to ensure the system security and is embedded in the 3D DWT magnitude of video chunks. The performance of the presented technique is evaluated experimentally.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권9호
• /
• pp.2268-2283
• /
• 2013

Scalable video coding can handle peer heterogeneity of P2P streaming applications, but there is still a lack of comprehensive studies on how to use it to improve video playback quality. In this paper we propose a capacity aware scalable video coding mechanism for P2P on demand streaming system. The proposed mechanism includes capacity based neighbor selection, adaptive data scheduling and streaming layer adjustment, and can enable each peer to select appropriate streaming layers and acquire streaming chunks with proper sequence, along with choosing specific peers to provide them. Simulation results show that the presented mechanism can decrease the system's startup and playback delay, and increase the video playback quality as well as playback continuity, and thus it provides a better quality of experience for users.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권9호
• /
• pp.2246-2267
• /
• 2013

BitTorrent is one of the most important applications in the current Internet. Despite of its interest, we still have little knowledge regarding the connectivity properties of real BitTorrent swarms. In this paper we leverage a dataset including the connectivity information of 250 real torrents and more than 150k peers to carefully study the connectivity properties of peers. The main topology parameters of the studied swarms suggest that they are significantly less resilient than random graphs. The analysis of the peer level connectivity properties reveals that peers continuously change more than half of their neighbours. Furthermore, we also find that a leecher typically keeps stable connections with a handful of neighbours with which it exchanges most of its traffic whereas seeders do not establish long-term connections with any peer so that they can homogeneously distribute chunks among leechers. Finally, we have discovered that a significant portion of the studied peers (45%) have an important locality-biased neighbourhood composition.

• 한국정보과학회 언어공학연구회:학술대회논문집(한글 및 한국어 정보처리)
• /
• 한국정보과학회언어공학연구회 1999년도 제11회 한글 및 한국어 정보처리 학술대회
• /
• pp.242-248
• /
• 1999

이 논문은 지역적 동사구 분할에 바탕을 두고 서술어가 문말에 위치하는 언어에 특성에서 기인하는 속성을 반영하는 부분적 그러나 빠른 구문분석에 관해 논한다. 즉 완벽성 보다는 신속함 그리고 신뢰에 바탕을 둔 새로운 한국어 구문분석에 대해 논의한다. 기존의 문법이론 대신 한국어의 형태적 통사적 특성에 기인한, 성분들의 분할(partitions)에 의한 단위 (chunks) 분석방법을 제안한다. 근간은 동사구 장벽(VP-barrier) 알고리즘이며, 이 알고리즘은 한 문장안에서의 다양한 동사의 파생접사에 의해 형성되는 관형화, 명사화, 부사화 등의 파생구조와 내포된 동사구(인용문, 종속문 등)에 의해 형성되는 지역적 동사구내에서 그 성분들의 논리적인 분할을 구성하고 다시 그 다음 요소와 체계적으로 결합하는 관계로 확장하여 가능한 구조들을 생성한다. 다시 언어의존적인 발견적 규칙(heuristics)들을 점수화하여 가장 높은 점수의 단위구조를 적격한 구조로 선택한다. 이 방법은 하위범주화 및 의미정보를 사용하지 않는, 빠른 구문분석이 요구되는 시스템을 위해 고안되었으며, 집단적인 노력이 아닌 개인적인 노력 및 최소의 자원으로도 최대의 효과를 얻을 수 있다는데 그 의의가 있다.