• Journal of KIISE:Information Networking
• /
• v.32 no.3
• /
• pp.370-381
• /
• 2005

Mobile IP provides an efficient and scalable mechanism for host mobility within the Internet. Using Mobile If, mobile nodes may change their point of attachment to the Internet without changing their If address. However, it would result in a high signaling cost. To reduce the signaling cost, we factor in the fact that mobile users will not be actively communicating much of the time. In fact, there Is no necessity to send a binding update message to the home agent when an mobile node does not communicates with others while moving. From this point of view, we propose a lazy update strategy for minimizing signaling cost using the forwarding pointer in hierarchical Mobile IPv6. In our proposal, binding updates are sent only when a mobile node is in a busy mode. If an mobile node is in a dormant mode, binding update messages are delayed until busy mode using the forwarding pointer. As a result, our proposal can reduce the total signaling cost by eliminating unnecessary binding update messages when a mobile node Is in a dormant mode. In addition to, our proposal reduces unnecessary location update cost resulting from ping-pong effect under mobile node's dormant mode. Analysis results using the discrete analytic model presented in this paper shows that our proposal can has superior performance than hierarchical Mobile nv6 when the call-to-mobility ratio is low and the length of the forwarding pointer chain K is low.

• Journal of the Korea institute for structural maintenance and inspection
• /
• v.21 no.6
• /
• pp.113-125
• /
• 2017

In spite of bulk literature about the tuning of TMD, the effectiveness of TMD in reducing the seismic response of engineering structures is still in a row. This paper deals with the optimum tuning parameters of a passive TMD and simulated on MATLAB with a ten-story numerical shear building. A weighted multi-objective optimization method based on computer experiment consisting of coupled with central composite design(CCD) central composite design and response surface methodology(RSM) was applied to find out the optimum tuning parameters of TMD. After the optimization, the so-conceived TMD turns out to be optimal with respect to the specific seismic event, hence allowing for an optimum reduction in seismic response. The method was employed on above structure by assuming first the El Centro seismic input as a sort of benchmark excitation, and then additional recent strong-motion earthquakes. It is found that the RSM based weighted multi-objective optimized damper improves frequency responses and root mean square displacements of the structure without TMD by 31.6% and 82.3% under El Centro earthquake, respectively, and has an equal or higher performance than the conventionally designed dampers with respect to frequency responses and root mean square displacements and when applied to earthquakes.

• Journal of Digital Contents Society
• /
• v.16 no.1
• /
• pp.137-144
• /
• 2015

This study tried to anticipate the near future changes of domestic online video, music service and media usage through the status quo. The research group was focused on the twenties, University students because they are the active media contents users. It surveyed the students in Busan, and used the method of descriptive statistics analysis for the understanding of the present state and near future prospect. This study shows that almost half of them use both services, and three people out of ten are the heavy users who use the services for over 3 hours a week. The streaming method is higher proportion than download method in using type. They are getting accustomed to pay contents cost, but it couldn't be said the paying content cost has been established. Preferred contents genre appears to be the RMC(Ready Made Contents) such as existing broadcaster contents and movies. Notable result on media usage was the proportion of the so-called 'Zero-TV'. It was 32%, significantly higher than the proportion of the total population(4.4%). Integrating the analysis results, we can expect that the usage pattern will be changed gradually, thus the advent of various revenue models will emerge.

• Journal of KIISE:Software and Applications
• /
• v.28 no.9
• /
• pp.688-698
• /
• 2001

A homonym could be disambiguated by anther words in the context such as nouns, predicates used with the homonym. This paper proposes a homonym disambiguation system based on statistical semantic information which is extracted from definitions in dictionary. The semantic information consists of nouns and predicates that are used with the homonym in definitions. In order to extract accurate semantic information, definitions are used with the homonym in definitions. In order to extract accurate semantic information, definitions are classified into two types. One has hyponym-hypernym relation between title word and head word (homonym) in definition. The hyponym-hypernym relation is one level semantic hierarchy and can be extended to deeper levels in order to overcome the problem of data sparseness. The other is the case that the homonym is used in the middle of definition. The system considers nouns and predicates simultaneously to disambiguate the homonym. Nine homonyms are examined in order to determine the weight of nouns and predicates which affect accrutacy of homonym disambiguation. From experiments using training corpus(definitions in dictionary), the average accruracy of homonym disamguation is 96.11% when the weight is 0.9 and 0.1 for noun and verb respectively. And another experiment to meaure the generality of the homonym disambiguation system results in the 80.73% average accuracy to 1,796 untraining sentences from Korean Information Base I and ETRI corpus.

• The KIPS Transactions:PartA
• /
• v.17A no.5
• /
• pp.229-236
• /
• 2010

With an increasing number of documents in the Internet or enterprises, it becomes crucial to efficiently support users' queries on those documents. In that situation, the full-text search technique is accepted in general, because it can answer uncontrolled ad-hoc queries by automatically indexing all the keywords found in the documents. The size of index files made for full-text searches grows with the increasing number of indexed documents, and thus the disk cost may be too large to process multi-keyword queries against those enlarged index files. To solve the problem, we propose both of the index file structure and its management scheme suitable to the processing of multi-keyword queries against a large volume of index files. For this, we adopt the structure of inverted-files, which are widely used in the multi-keyword searches, as a basic index structure and modify it to a hierarchical structure for join operations and ranking operations performed during the query processing. In order to save disk costs based on that index structure, we dynamically store in the main memory the results of join operations between two keywords, if they are highly expected to be entered in users' queries. We also do performance comparisons using a cost model of the disk to show the performance advantage of the proposed scheme.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.16 no.1
• /
• pp.21-29
• /
• 2010

The concept of carrying capacity for bivalve culture of an area can be classified into four hierarchical categories, according to their level of complexity and scope, such as physical, production, ecological and social carrying capacity. Most scientific efforts to date have been directed towards modelling production carrying capacity and some of the resultant models have been used successfully. But, the modelling of ecological carrying capacity is still in its infancy, because it should consider the whole ecosystem and all culture activities. A more holistic approach is needed to determine the influence of bivalve aquaculture on the environment and ecological carrying capacity. As an alternative, we can use a set of ecological indicators which can show the environmental performance of bivalve farms and assess ecological carrying capacity. Clearance efficiency and filtration pressure indicators show the value of 0.331 and 0.203, respectively, and these indicators suggest that the present level of culture in GeojeHansan Bay is above the ecological carrying capacity of 0.05. Consequently, these indicators can provide a guidance on the present level of culture in regard to production and ecological carrying capacity in GeojeHansan Bay.

• The KIPS Transactions:PartC
• /
• v.13C no.7 s.110
• /
• pp.803-812
• /
• 2006

This paper analytically evaluates the FEC(Forward Error Correction) symbol size's effect on the performance and energy consumption of 802.11 protocol with the block FEC algorithm over WSN(Wireless Sensor Network). Since the basic recovery unit of block FEC algorithms is symbols not bits, the FEC symbol size affects the packet correction rate even with the same amount of FEC check bits over a given WSN channel. Precisely, when the same amount of FEC check bits are allocated, the small-size symbols are effective over channels with frequent short bursts of propagation errors while the large ones are good at remedying the long rare bursts. To estimate the effect of the FEC symbol site, the paper at first models the WSN channel with Gilbert model based on real packet traces collected over TIP50CM sensor nodes and measures the energy consumed for encoding and decoding the RS (Reed-Solomon) code with various symbol sizes. Based on the WSN channel model and each RS code's energy expenditure, it analytically calculates the transmission efficiency and power consumption of 802.11 equipped with RS code. The computational analysis combined with real experimental data shows that the RS symbol size makes a difference of up to 4.2% in the transmission efficiency and 35% in energy consumption even with the same amount of FEC check bits.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.479-488
• /
• 2001

As the SoC designs complexity constantly increases, the simulation that uses their software models simply takes too much time. To solve this problem, FPGA-based logic emulators have been developed and commonly used in the industry. However, FPGA-based logic emulators are facing with the problems of which not only very low FPGA resource usage rate due to the very limited number of pins in FPGAs, but also the emulation speed getting slow drastically as the complexity of designs increases. In this paper, we proposed a new innovative emulation architecture and its software that has high FPGA resource usage rate and makes the emulation extremely fast. The proposed emulation system has merits to overcome the FPGA pin limitation by pipelined ring which transfers multiple logic signal through a single physical pin, and it also makes possible to use a high speed system clock through the intelligent ring topology. In this topology, not only all signal transfer channels among EPGAs are totally separated from user logic so that a high speed system clock can be used, but also the depth of combinational paths is kept swallow as much as possible. Both of these are contributed to achieve high speed emulation. For pipelined singnals transfer among FPGAs we adopt a few heuristic scheduling having low computation complexity. Experimental result with a 12 bit microcontroller has shown that high speed emulation possible even with these simple heuristic scheduling algorithms.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2000.11a
• /
• pp.247-256
• /
• 2000

오늘날의 기업은 상품을 판매하는 것 뿐만 아니라 기업의 신용과 이미지를 위해 그 상품에 대한 사후처리(After Service) 업무에 많은 투자를 하고 있다. 이러한 양질의 사후서비스를 고객에게 공급하기 위해서는 많은 인력을 합리적으로 관리해야 하고 요청되는 고장수리 서비스 업무를 빠르게 해결하기 위해서는 업무를 인력들에게 합리적으로 배정을 하고 회사의 비용을 최소화하면서 정해진 시간에 요청된 작업을 처리하기 위해서는 인력들에게 작업을 배정하고 스케줄링하는 문제가 발생된다. 본 논문에서는 이러한 문제를 해결하기 위해 화학계기의 A/S 작업을 인력에게 합리적으로 배정하는 스케줄링 시스템에 관한 연구이다. 먼저 스케줄링 모델을 HP 사의 화학분석 및 시스템을 판매, 유지보수 해 주는 "영진과학(주)"회사의 작업 스케줄을 분석하여 필요한 도메인과 고객서비스전략과 인력관리전략에서 제약조건을 추출하였고 여기에 스케줄링 문제를 해결하기 위한 방법으로 제약만족문제(CSP) 해결기법인 도메인 여과기법을 적용하였다. 도메인 여과기법은 제약조건에 의해 변수가 갖는 도메인의 불필요한 부분을 여과하는 것으로 제약조건과 관련되어 있는 변수의 도메인이 축소되는 것이다. 또한, 스케줄링을 하는데에 있어서 비용적인 측면에서의 스케줄링방법과 고객 만족도에서의 스케줄링 방법을 비교하여 가장 이상적인 해를 찾는데 트래이드오프(Trade-off)를 이용하여 최적의 해를 구했으며 실험을 통해 인력에게 더욱 효율적으로 작업들을 배정 할 수 있었고 또한, 정해진 시간에 많은 작업을 처리 할 수 있었으며 작업을 처리하는데 있어 소요되는 비용을 감소하는 결과를 얻을 수 있었다. 검증하였다.를, 지지도(support), 신뢰도(confidence), 리프트(lift), 컨빅션(conviction)등의 관계를 통해 다양한 방법으로 모색해본다. 이 연구에서 제안하는 이러한 개념계층상의 흥미로운 부분의 탐색은, 전자 상거래에서의 CRM(Customer Relationship Management)나 틈새시장(niche market) 마케팅 등에 적용가능하리라 여겨진다.선의 효과가 나타났다. 표본기업들을 훈련과 시험용으로 구분하여 분석한 결과는 전체적으로 재무/비재무적 지표를 고려한 인공신경망기법의 예측적중률이 높은 것으로 나타났다. 즉, 로지스틱회귀 분석의 재무적 지표모형은 훈련, 시험용이 84.45%, 85.10%인 반면, 재무/비재무적 지표모형은 84.45%, 85.08%로서 거의 동일한 예측적중률을 가졌으나 인공신경망기법 분석에서는 재무적 지표모형이 92.23%, 85.10%인 반면, 재무/비재무적 지표모형에서는 91.12%, 88.06%로서 향상된 예측적중률을 나타내었다.ting LMS according to increasing the step-size parameter $\mu$ in the experimentally computed. learning curve. Also we find that convergence speed of proposed algorithm is increased by (B+1) time proportional to B which B is the number of recycled data buffer without complexity

• Journal of Korean Society of Transportation
• /
• v.19 no.6
• /
• pp.183-194
• /
• 2001

The centralized traffic information system is to gather and analyze real-time traffic information, to receive traffic information request from user, and to send user processed traffic information such as a path finding. Position information, result of destination search, and other information. In the centralized traffic information system, a server received path-finding requests from many clients and must process clients requests in time. The algorithm of multiple path-finding is needed for a server to process clients request, effectively in time. For this reason, this paper presents a heuristic algorithm that decreases time to compute path-finding requests. This heuristic algorithm uses results of the neighbor nodes shortest path-finding that are computed periodically. Path-finding results of this multiple path finding algorithm to use results of neighbor nodes shortest path-finding are the same as a real optimal path in many cases, and are a little different from results of a real optimal path in non-optimal path. This algorithm is efficiently applied to the general topology and the hierarchical topology such as traffic network. The computation time of a path-finding request that uses results of a neighbor nodes shortest path-finding is 50 times faster than other algorithms such as one-to-one label-setting and label-correcting algorithms. Especially in non-optimal path, the average error rate is under 0.1 percent.