• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.529-532
• /
• 2000

This paper addresses how to be connected with end-to-end shortcut using ATM Switched Virtual Connection (SVC) in ATM-based Multi-Protocol Label Switching (MPLS) Networks. Without additionally existing ATM Ships-in-the-Night (SIN) mode, when the stream is continuously transmitted at the same destination with the lapse of determined aging time, the connection is changed with end-to-end shortcut connection using ATM signaling. An ATM direct short circuit is performed an IP and ATM effective integration. An ATM shortcut has a number of advantages, like higher throughput, shorter end-to-end delay, reduced router load, better utilization of L2 Quality of Service (QoS) capabilities, and route optimization. In particular between other MPLS domains, this can be efficiently improved the performance of networks.

• Journal of the Korean Society for Precision Engineering
• /
• v.13 no.12
• /
• pp.22-29
• /
• 1996

In this paper the nodes of the multilayer hidden layers have been modified for modeling the nonlinear systems. The structure of nodes in the hidden layers is built with the feedforward, the cross talk and the recurrent connections. The feedforward links are mapping the nonlinear function and the cross talks and the recurent links memorize the dynamics of the system. The cross talks are connected between the modes in the same hidden layers and the recurrent connection has self feedback, and these two connections receive one time delayed input signals. The simplified steam boiler and the analytic multi input multi output nonlinear system which contains process noise have been modeled using this neural networks.

• Journal of Broadcast Engineering
• /
• v.13 no.6
• /
• pp.930-940
• /
• 2008

This paper proposes a prototype realization of multi-view HD video transport system with synchronized multiplexing over IP networks. The proposed synchronized multiplexing considers the synchronization during video acquisition and the multiplexing for the interactive view-selection during transport. For the synchronized acquisition from multiple HDV camcorders through IEEE 1394 interface, we estimate the timeline differences among MPEG-2 compressed video streams by using global time of network between the cameras and a server and correct timelines of video streams by changing the time stamp of the MPEG-2 system stream. Also, we multiplex a selected number of acquired HD views at the MPEG-2 TS (transport stream) level for the interactive view-selection during transport. Thus, with the proposed synchronized multiplexing scheme, we can display synchronized HD view.

• Journal of Communications and Networks
• /
• v.10 no.1
• /
• pp.79-88
• /
• 2008

In this paper, we propose efficient peer assignment algorithms for low-latency transmission of scalable coded images in peer-to-peer networks, in which peers may dynamically join and leave the networks. The objective of our algorithm is to minimize the transmission time of a requested image that is scalable coded. When an image is scalable coded in different bit rates, the bit stream encoded in a lower bit rate is a prefix subset of the one encoded in a higher bit rate. Therefore, a peer with the same requested image coded in any bit rate, even when it is different from the requested rate, may work as a supplying peer. As a result, when a scalable coded image is requested, more supplying peers can be found in peer-to-peer networks to help with the transfer. However, the set of supplying peers is not static during transmission, as the peers in this set may leave the network or finish their transmission at different times. The proposed peer assignment algorithms have taken into account the above constraints. In this paper, we first prove the existence of an optimal peer assignment solution for a simple identity permutation function, and then formulate peer assignment with this identity permutation as a mixed-integer programming problem. Next, we discuss how to address the problem of dynamic peer departures during image transmission. Finally, we carry out experiments to evaluate the performance of proposed peer assignment algorithms.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.3
• /
• pp.312-317
• /
• 2005

Ubiquitous computing has had an effect to politics, economics, society, culture, education and so forth. For effective management of huge Ubiquitous networks environment, various computers which are connected to networks has to decide automatic optimum with intelligence. Currently in many areas, data mining has been used effectively to construct intelligent systems. We proposed a hybrid support vector machine for Ubiquitous data mining which realized intelligent Ubiquitous computing environment. Many data were collected by sensor networks in Ubiquitous computing environment. There are many noises in these data. The aim of proposed method was to eliminate noises from stream data according to sensor networks. In experiment, we verified the performance of our proposed method by simulation data for Ubiquitous sensor networks.

• Journal of Korea Water Resources Association
• /
• v.32 no.5
• /
• pp.565-577
• /
• 1999

The geometric patterns of a stream network in a drainage basin can be viewed as a "fractal" with fractal dimensions. Fractals provide a mathematical framework for treatment of irregular, ostensively complex shapes that show similar patterns or geometric characteristics over a range of scale. GIUH (Geomorphological Instantaneous Unit Hydrograph) is based on the hydrologic response of surface runoff in a catchment basin. This model incorporates geomorphologic parameters of a basin using Horton's order ratios. For an ordered drainage system, the fractal dimensions can be derived from Horton's laws of stream numbers, stream lengths and stream areas. In this paper, a fractal approach, which is leading to representation of a 2-parameter Gamma distribution type GIUH, has been carried out to incorporate the self similarity of the channel networks based on the high correlations between the Horton's order ratios. The shape and scale parameter of the GIUH-Nash model of IUH in terms of Horton's order ratios of a catchment proposed by Rosso(l984J are simplified by applying the fractal dimension of main stream length and channel network of a river basin. basin.

• Journal of Korea Society of Industrial Information Systems
• /
• v.17 no.7
• /
• pp.71-79
• /
• 2012

Propose stream cipher Canon that need in Wireless sensor network construction that can secure confidentiality and integrity. Create Canon 128 bits streams key by 128 bits secret key and 128 bits IV, and makes 128 bits cipher text through whitening processing with produced streams key and 128 bits plaintext together. Canon for easy hardware implementation and software running fast algorithm consists only of simple logic operations. In particular, because it does not use S-boxes for non-linear operations, hardware implementation is very easy. Proposed stream cipher Canon shows fast speed test results performed better than AES, Salsa20, and gate number is small than Trivium. Canon purpose of the physical environment is very limited applications, mobile phones, wireless Internet environment, DRM (Digital Right Management), wireless sensor networks, RFID, and use software and hardware implementation easy 128 bits stream ciphers.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.29 no.1
• /
• pp.22-31
• /
• 2001

The purpose of this study is to compare calculated pollutant loadings using pollutant load unit factors and vector type coverage, and expected mean concentration(EMC) and raster type of digital elevation model(DEM). This study is also focusing on comparison of the advantages and the disadvantages of the two methods, and seeking for a method of calculation of pollutant loadings using DEM. Estimation of pollutant inputs using pollutant load unit factors has limitations in identifying seasonal variations of pollutant loadings. Seasonal changes of runoffs should be considered in the calculation of pollutant loadings from catchments into reservoirs. Evaluation of pollutant inputs using runoff-coefficient and EMC can overcome these drawbacks. Proper EMC and runoff-coefficient values for the Koeup stream catchments of the Koheung estuarine lake were drawn from review of related papers. Arc/Info was employed to establish database of spatial and attribute data of point and non-point pollutant sources and characteristics of the catchments. ArcView was used to calculate point and non-point pollutant loadings. Pollutant loads estimated with either unit factors-coverages, i.e., pollutant load unit factors and vector coverages f point sources and land use, or EMC and digital elevation mode(DEM) were compared with stream monitoring loads. We have found that some differences were shown between monitoring results and estimated loads by Unit Factors-Coverage and EMC-DEM. Monthly variations of pollutant loads evaluated with EMC-DEM were similar to those with monitoring result. The method using EMC-DEM can calculate accumulated flows and pollutant loads and can be utilized to identify stream networks. A future research on correcting the difference between vector type stream using flow direction grid and digitalizing vector type should be conducted in order to obtain more exact calculation of pollutant loadings.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.8
• /
• pp.1998-2004
• /
• 2009

Recently, due to technical developments of various storage devices and networks, the amount of data increases rapidly. The large volume of data streams poses unique space and time constraints on the data mining process. The continuous characteristic of streaming data necessitates the use of algorithms that require only one scan over the stream for knowledge discovery. Most of the researches based on the support are concerned with the frequent itemsets, but ignore the infrequent itemsets even if it is crucial. In this paper, we propose an efficient method WSFI-Mine(Weighted Support Frequent Itemsets Mine) to mine all frequent itemsets by one scan from the data stream. This method can discover the closed frequent itemsets using DCT(Data Stream Closed Pattern Tree). We compare the performance of our algorithm with DSM-FI and THUI-Mine, under different minimum supports. As results show that WSFI-Mine not only run significant faster, but also consume less memory.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.11
• /
• pp.4068-4086
• /
• 2014

Due to the prevalence of powerful mobile terminals and the rapid advancements in wireless communication technologies, the wireless video streaming service has become increasingly more popular. Recent studies show that video streaming services via Transmission Control Protocol (TCP) are becoming more practical. TCP has more advantages than User Diagram Protocol (UDP), including firewall traversal, bandwidth fairness, and reliability. However, each video service shares an equal portion of the limited bandwidth because of the fair sharing characteristics inherent in TCP and this bandwidth fair sharing cannot always guarantee the video quality for each user. To solve this challenging problem, an Adaptive Multiple TCP (AM-TCP) scheme is proposed in this paper to guarantee the video quality for mobile devices in wireless networks. AM-TCP adaptively controls the number of TCP connections according to the video Rate Distortion (RD) characteristics of each stream and network status. The proposed scheme can minimize the total distortion of all participating video streams and maximize the service quality by guaranteeing the quality of each video streaming session. The simulation results show that the proposed scheme can significantly improve the quality of video streaming in wireless networks.