• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2014.06a
• /
• pp.144-145
• /
• 2014

기존 디지털 방송은 제한된 데이터 전송율로 인하여 시청자가 요구하는 다양한 데이터 서비스, 고해상도를 가지는 비디오 서비스와 같은 리치 멀티미디어 서비스를 제공하는 것이 현실적으로 어렵다. 그러나, 최근 들어 유무선 인터넷의 속도가 향상되고 소셜 서비스 등 다양한 인터넷 서비스 모델이 등장함에 따라서 통신망을 활용한 하이브리드 멀티미디어 방송 서비스가 제시되어, 방송 서비스가 가지는 특성을 유지하면서 다양한 시청자의 요구를 만족시키는 것이 가능해 졌다. 본 논문에서는 하이브리드 방송 서비스의 일종인 동적 계획 기반 하이브리드 방송 서비스 모델과 이를 가능하게 하는 송신 시스템 구성을 제안한다. 제안된 시스템은 새롭게 추가된 스케줄링 서버를 포함하고 있으며, 이 스케줄링 서버에 의해서 방송 콘텐츠의 비디오 해상도, 제공 시간, 전송 경로 등을 결정하는 것을 특징으로 한다.

• Architectural research
• /
• v.15 no.1
• /
• pp.1-8
• /
• 2013

Over the past two decades following the 1990s, South Korea's IT industry has developed rapidly. In keeping with this trend, the architectural and urban planning sectors have also converged with IT and achieved advancement in new directions. This evolution includes a variety of conceptual terminologies such as 'home automation', ''home network', 'smart home, and 'ubiquitous-city'. However, smart homes and U-cities simply represent a conceptual extension of home networks, and there is little real difference in the technologies involved. In particular, U-cities remain focused on infrastructure rather than on the development of specific content; consequently, they have failed to demonstrate distinctive features to clearly differentiate themselves from conventional cities. In such a context, this research aims at the proposal of a 'ubiquitous pavilion' as a component of the efforts to develop a range of architectural contents that utilize ubiquitous technologies. By grafting the pavilion, one of the most basic forms in architecture, with cutting-edge ubiquitous technologies, this paper intends to suggest a multi-purpose architectural space readily and simply available not only in newly emerging U-cities, but to conventional cities as well.

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.4
• /
• pp.673-689
• /
• 2009

We analyze $MAP_1,\;MAP_2$/G/1 finite queues with service scheduling function dependent upon queue lengths. The customers are classified into two types. The arrivals of customers are assumed to be the Markovian Arrival Processes (MAPs). The service order of customers in each buffer is determined by a service scheduling function dependent upon queue lengths. Methods of embedded Markov chain and supplementary variable give us information for queue length of two buffers. Finally, the performance measures such as loss probability and mean waiting time are derived. Some numerical examples also are given with applications in telecommunication networks.

• Electronics and Telecommunications Trends
• /
• v.28 no.6
• /
• pp.49-62
• /
• 2013

광-회선-패킷 통합 전달망 장비는 광전송망, 회선 망, 패킷 전달망 계층을 하나로 통합한 장비로써, 패킷-회선 교환 전달, ROADM(Reconfigurable Optical Add/Drop Multiplexer) 광파장 교환 전달, GMPLS(Generalized Multi-Protocol Label Switching) 기반 통합제어 및 관리기능을 수행하면서 네트워크 구조의 단순화, 네트워크 제어의 지능화, 그리고 네트워크 용량의 광대역화를 구현한다. 트래픽 폭증과 전송용량 부족 현상을 해결하고, 트래픽 증가 대비 수익의 탈동조화 현상을 극복하기 위해 네트워크 CAPEX(Capital Expenditures)/OPEX(Operating Expenditures)를 절감함으로써 통신사업자의 투자 여건을 우호적으로 조성하면서 최근 주목 받고 있는 기술이다. 본고에서는 광-회선-패킷 통합 전달망의 기술동향을 기술한 것으로써, 배경, 필요성 및 개념 개발동향 및 경쟁기술에 대해서 살펴보고, 기술발전 로드랩 및 주요 기술 동향과 시장 및 사업화 전망에 대해서 분석한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11b
• /
• pp.1559-1562
• /
• 2002

이동 망 및 인터넷의 폭발적인 확장과 망 통합의 가속화에 따라 다양한 서비스 기능 및 데이터의 결합이 필수적인 서비스가 요구되고 있으나, 기존의 지능 망 기반 구조로는 이러한 서비스에 대한 대처하기가 현실적으로 불가능하다 이에 대한 해결책으로써 국제 표준화 포럼인 Parlay 를 중심으로 개방형 기술 기반의 서비스 API(Application Programming interface)를 개발해 오고 있다. 본 논문에서는 개방형 서비스 API 의 표준 규격인 Parlay/OSA API 구조에 대해서 살펴본다. IP 기반의 통합 망에서의 본 API 적용을 위한 망 구조를 제시하고, 실제 서비스 예를 대상으로 망 내각 노드 간의 처리 흐름 및 Parlay/OSA API와 망 내 신호 방식간 연동방법 등을 제안하였다.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.12
• /
• pp.61-69
• /
• 1997

This paper proposes a new method for improving the performances of the neural network for optimization using a hyubrid of gradient descent method and dynamic tunneling system. The update rule of gradient descent method, which has the fast convergence characteristic, is applied for high-speed optimization. The update rule of dynamic tunneling system, which is the deterministic method with a tunneling phenomenon, is applied for global optimization. Having converged to the for escaping the local minima by applying the dynamic tunneling system. The proposed method has been applied to the travelling salesman problems and the optimal task partition problems to evaluate to that of hopfield model using the update rule of gradient descent method.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.88.5-88
• /
• 2001

We propose a neural network solver for an inverse problem. The problem is that input data with complete teaching include defects and predict the defect value. The solver is constructed of a three layer neural network whose learning method is combined from BP and reconstruction learning. The input data for the defects are unknown; therefore, the circulation of an arithmetic progression replaces them; rightly, the learning procedure is not converged for the circulation data vut for the normal data. The learning is quitted after such a learning status id kept. Then, we search a minimum of the differences between teaching data and output of the circulation. Then, we search a minimum of the ...

• Journal of the Korean Society for Precision Engineering
• /
• v.10 no.4
• /
• pp.170-179
• /
• 1993

In this study, self-organized neural network is used to solve the vorrespondence problem of the axial stereo image. Edge points are extracted from a pair of stereo images and then the edge points of rear image are assined to the output nodes of neural network. In the matching process, the two input nodes of neural networks are supplied with the coordi- nates of the edge point selected randomly from the front image. This input data activate optimal output node and its neighbor nodes whose coordinates are thought to be correspondence point for the present input data, and then their weights are allowed to updated. After several iterations of updating, the weights whose coordinates represent rear edge point are converged to the coordinates of the correspondence points in the front image. Because of the feature map properties of self-organized neural network, noise-free and smoothed depth data can be achieved.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.6
• /
• pp.175-181
• /
• 2014

With rapid growth of the wireless mobile computing network technologies, various mobile ad hoc network applications converged with other related technologies are rapidly disseminated nowadays. Vehicular Ad Hoc Networks are self-organizing mobile ad hoc networks that typically have moving vehicle nodes with high speeds and maintaining its topology very short with unstable communication links. Therefore, VANETs are very vulnerable for the malicious noise of sensors and anomalies of the nodes in the network system. In this paper, we propose an anomaly detection method by using big data techniques that efficiently identify malicious behaviors or noises of sensors and anomalies of vehicle node activities in these VANETs, and the performance of the proposed scheme is evaluated by a simulation study in terms of anomaly detection rate and false alarm rate for the threshold ${\epsilon}$.

• Journal of KIISE:Information Networking
• /
• v.32 no.6
• /
• pp.705-715
• /
• 2005

A peer-to-peer web caching has been studied recently as it can reduce the traffic converged on the server side and can support the traditional web caching model. Although the peer-to-peer web caching has the merit of having additional cache space from the local caches of peers without additional infrastructure, several constraints such as dynamic participation and local caching strategy caused by the autonomy of peers in peer-to-peer networks nay limit the performance of the peer-to-peer web caching. To overcome these limitations, we propose an efficient directory-based peer-to-peer web caching system under dynamic participation of peers. In the proposed caching system, we present new peer selection and replica management schemes by introducing the concept of the object lifetime in P2P networks. We evaluate the effectiveness of the proposed system through trace-driven simulations with a web log dataset. Simulation results show that the proposed system has higher accuracy and fewer redirection failures than the conventional directory-based P2P web caching system in feasible peer-to-peer networks.