• Journal of Broadcast Engineering
• /
• v.27 no.4
• /
• pp.561-568
• /
• 2022

Most deep learning-based video object segmentation methods perform the segmentation with past prediction information stored in external memory. In general, the more past information is stored in the memory, the better results can be obtained by accumulating evidence for various changes in the objects of interest. However, all information cannot be stored in the memory due to hardware limitations, resulting in performance degradation. In this paper, we propose a method of storing new information in the external memory without additional memory allocation. Specifically, after calculating the attention score between the existing memory and the information to be newly stored, new information is added to the corresponding memory according to each score. In this way, the method works robustly because the attention mechanism reflects the object changes well without using additional memory. In addition, the update rate is adaptively determined according to the accumulated number of matches in the memory so that the frequently updated samples store more information to maintain reliable information.

• The KIPS Transactions:PartC
• /
• v.16C no.6
• /
• pp.773-782
• /
• 2009

A DHT(Distributed Hash Table) based P2P is a method to overcome disadvantages of the existing unstructured P2P method. If a DHT algorithm is used, it can do a fast data search and maintain search efficiency independent of the number of peer. The peers in the DHT method send messages periodically to keep the routing table updated. In a mobile environment, the peers in the DHT method should send messages more frequently to keep the routing table updated and reduce the failure of a request. Therefore, this results in increase of network traffic. In our previous research, we proposed a method to reduce the update load of the routing table in the existing Chord by updating it in a reactive way, but the reactive method had a disadvantage to generate more traffic than the existing Chord if the number of requests per second becomes large. In this paper, we propose an adaptive method of routing table update to reduce the network traffic. In the proposed method, we apply different routing table update method according to the number of request message per second. If the number of request message per second is smaller than some threshold, we apply the reactive method. Otherwsie, we apply the existing Chord method. We perform experiments using Chord simulator (I3) made by UC Berkeley. The experimental results show the performance improvement of the proposed method compared to the existing methods.

• The KIPS Transactions:PartC
• /
• v.16C no.6
• /
• pp.761-772
• /
• 2009

A DHT(Distributed Hash Table) based P2P is a method to overcome disadvantages of the existing unstructured P2P method. If a DHT algorithm is used, it can do a fast data search and maintain search efficiency independent of the number of peer. The peers in the DHT method send messages periodically to keep the routing table updated. In a mobile environment, the peers in the DHT method should send messages more frequently to keep the routing table updated and reduce the failure of a request. Therefore, this results in increase of network traffic. In our previous research, we proposed a method to reduce the update load of the routing table in the existing Chord by updating it in a reactive way, but the reactive method had a disadvantage to generate more traffic than the existing Chord if the number of requests per second becomes large. In this paper, we propose an adaptive method of routing table update to reduce the network traffic. In the proposed method, we apply different routing table update method according to the number of request message per second. If the number of request message per second is smaller than some threshold, we apply the reactive method. Otherwsie, we apply the existing Chord method. We perform experiments using Chord simulator (I3) made by UC Berkeley. The experimental results show the performance improvement of the proposed method compared to the existing methods.

• CDE review
• /
• v.14 no.1
• /
• pp.38-40
• /
• 2008

• 프린팅코리아
• /
• v.12 no.4
• /
• pp.90-91
• /
• 2013

한국어도비시스템즈(대표 지준영, www.Adobe.com/kr)는 지난 3월 11일 기자간담회를 열고, 어도비 크리에이티브 클라우드의 한국 출시를 발표했다. 어도비 크리에이티브 클라우드는 클라우드 서비스 형태로 어도비가 제공하는 모든 솔루션과 애플리케이션을 제공하는 것으로, 개인 멤버십을 기반으로 데스크톱 툴과 함께 출판 및 파일 공유를 위한 온라인 서비스, 즉각적인 기능 업데이트 및 업그레이드 서비스 등을 제공한다.

• Digital Contents
• /
• no.2 s.93
• /
• pp.34-39
• /
• 2001

웹캐스팅 비즈니스에 있어서 콘텐츠의 중요성은 굳이 언급하지 않아도 될 정도로 크다. 쥬피터 커뮤니케이션즈의 조사에 근거하면, 미디어 사업에서의 콘텐츠의 중요성이 사업성을 좌우하는 절대적인 기준으로서 콘텐츠 기획 제작 보급이 70%정도 차지한다고 할 정도이다. 특히 웹캐스팅 비즈니스는 웹미디어 비즈니스이기 이전에 콘텐츠 비즈니스이므로 콘텐츠의 중요성은 더욱 크다. 콘텐츠 기획과 제작능력이 웹캐스팅 비즈니스의 최대의 관건이자 최고의 경쟁력임을 명심해야 한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06a
• /
• pp.244-245
• /
• 2007

• Digital Contents
• /
• no.7 s.86
• /
• pp.18-29
• /
• 2000

하루가 다르게 새로운 바이러스가 발견되고 컴퓨터 사용자들은 늘 바이러스에 노출된 상태다. 새로운 바이러스가 발견될 때마다 백신프로그램도 계속 업데이트 되어야 한다. 기 발견된 바이러스를 토대로 바이러스 캘린더를 소개함으로써 안전한 PC이용에 도움이 되었으면 한다. 컴퓨터 바이러스는 월별로 활동하는 것과 특정일에 활동하는 것 등 다양하다. 또한 개인과 기업의 바이러스 예장 수칙을 소개한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4A
• /
• pp.388-398
• /
• 2011

In this paper, we introduce an EMSP(Efficient Mobility Support Protocol) for mobile sensor network with mobility-aware. We propose virtual cluster and node split scheme considering movements of mobile nodes. The existing M-LEACH protocol suffers from communication cost spent on JOIN request information during invitation phase. To address this issue, the large boundary of the cluster in LUR-tree can reduce superfluous update cost. In addition to the expansion of the cluster, the proposed approach exploits node split algorithms used in R-tree in order to uniformly form a cluster. The simulated results show that energy-consumption has less up to about 40% than LEACH-C and 8% than M-LEACH protocol. Finally, we show that the proposed scheme outperforms those of other in terms of lifetime of sensor fields and scalability in wireless sensor network.

• 한국경영정보학회:학술대회논문집
• /
• 2008.06a
• /
• pp.383-393
• /
• 2008

Online games are the popular topic due to the increased total online game market volume nowadays. And many studies on online games are released. But most studies used the questionnaire method that reveals only section of the situation like a snapshot. For this reason, previous studies have a little limitation that does not show dynamical changing issues like a product life cycle and changes in customer's mind Because of this, we studied on online games with the system dynamic model which can show dynamic simulations to analysis time series data. We chose MMORPG (Massively Multi-play Online) RPG (Role Playing Game) in sort of online games because it has many absorbing factors and enthusiastic users. We designed the simulation model which analyzes the influences of update and CRM strategy on users. We put the game developer who is ready for updated version game and released that periodically and focused on dormant users who used to be enthusiastic about MMORPG. The simulation results showed that the update has positive influences on new users gathering and hold established users. And CRM strategies help to prevent dormant users from transferring to rivals by offering them re-absorbing factors. Through this study, we confirmed the importance of update on online games and the necessity of introducing CRM strategy in the online game market.