• Water for future
• /
• v.25 no.1
• /
• pp.101-110
• /
• 1992

In this paper for simulating spatially and temporally varied moving storm in a watershed a distributed model was developed. The model is conducted by two major flow simulations which overland flow simulation and channel network flow simulation. Two dimensional continuity equation and momentum equation of kinematic approximation are used in the overland flow simulation. On the other hand, in the channel networks simulation two types of governing equations which are one dimensional continuity and momentum equations between two adjacent sections in a channel, and continuity and energy equations at a channel junction are applied. The finite element formulations were used in the overland flow simulation and the implicit finite difference formulations were used in the channel network simulation. The finite element formulations for the overland flow are analyzed by the Gauss elimination method and the finite difference formulations for the channel network flow are analyzed by the double sweep method having advantages of computational speed and reduced computer storages. Several recurrent coefficient equations for channel network simulation are suggested in the paper.

• Journal of Internet Computing and Services
• /
• v.3 no.3
• /
• pp.87-93
• /
• 2002

A complex network and a parallel computer are made up of interconnected switching units. The role of a switching unit is to set up a connection between an input port and an output port, according to the routing information. We proposed our switching network with a remodeled architecture is a newly modified Banyan network with eight input and output ports. We have analysed the maximum throughput of the revised switch. Our analyses have shown that under the uniform random traffic load, the FIFO discipline is limited to 70%, The switching system consists of an input control unit, a switch unit and an output control unit. Therefore the result of the analyses shows that the results of the networking simulation with the new switch are feasible and if we adopt the new architecture of the revised model of the Banyan switch, the hardware complexity can be reduced. The FIFO discipline has increased by about 11% when we compare the switching system with the input buffer system. We have designed and verified the switching system in VHDL using Max＋plusII. We also designed our test environment including micro computers, the base station, and the proposed architecture. We proposed a new architecture of the Banyan switch for BISDN networks and parallel computers.

• Journal of Internet Computing and Services
• /
• v.9 no.6
• /
• pp.117-125
• /
• 2008

With increase of concern about the Ubiquitous application, the necessity of the computer system which is miniaturized is becoming larger. The ARM processor is showing a high share from embedded system market. In this paper, ideal method for RTD-1000 controller construction and development is described using ARM microcontroller. Existing RTD-1000 measures distance of disconnection or defect of sensing casket by measuring receiving reflected wave which was sent via copper wire inside the leaking sensing rod. Using this RTD-1000, leakage and breakage of water and oil pipe can be sensed and it reports damage results to the networks. But, existing RTD-1000 wastes hardware resources much and costs a great deal to installation. Also, it needs a cooling device because the heating problem, and has some problem of the secondary memory unit such as the hard disk. So, long tenn maintenance has some problems in the outside install place. In this paper, for the resolving the problem of RTD-1000, RTD-1000A embedded system based on ARM is proposed and simulated.

• Journal of Korean Society of Transportation
• /
• v.21 no.2
• /
• pp.63-70
• /
• 2003

Real-time information on vehicle queue at intersections is essential for optimal traffic signal control, which is substantial part of Intelligent Transport Systems (ITS). Computer vision is also potentially an important element in the foundation of integrated traffic surveillance and control systems. The objective of this research is to propose a method for detecting an exact queue lengths at signalized intersections using image processing techniques and a neural network model Fuzzy ARTMAP, which is a supervised and self-organizing system and claimed to be more powerful than many expert systems, genetic algorithms. and other neural network models like Backpropagation, is used for recognizing different patterns that come from complicated real scenes of a car park. The experiments have been done with the traffic scene images at intersections and the results show that the method proposed in the paper could be efficient for the noise, shadow, partial occlusion and perspective problems which are inevitable in the real world images.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.4
• /
• pp.1406-1423
• /
• 2014

Multi-mode device which combines multiple access technologies into a device will offer more cost-effective solution than a sole access implementation. Its concurrent multipath transfer (CMT) technology can transmit media flows over multiple end-to-end paths simultaneously, which is essential to select at least two paths from all available paths. At real networks, different paths are likely to overlap each other and even share bottleneck, which can weaken the path diversity gained through CMT. Spurred by this observation, it is necessary to select multiple independent paths as much as possible to avoid underlying shared bottleneck between topologically joint paths. Recent research in this context has shown that different paths with shared bottleneck can weaken the path diversity gained through CMT. In our earlier work, a grouping-based multipath selection (GMS) mechanism is introduced and developed. However, how to estimating the selection is still to be resolved. In this paper, we firstly introduce a Selection Correctness Index (SCI) to evaluate the correctness of selection results in actual CMT experiment. Therefore, this metric is helpful to discuss and validate the accuracy of the output paths. From extensive experiments with a realized prototype, the proposed scheme provides better evaluation tool and criterion in various network conditions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5476-5496
• /
• 2016

Energy efficiency of resource-constrained wireless sensor networks is critical in applications such as real-time monitoring/surveillance. To improve the energy efficiency and reduce the energy consumption, the time series data can be compressed before transmission. However, most of the compression algorithms for time series data were developed only for single variate scenarios, while in practice there are often multiple sensor nodes in one application and the collected data is actually multivariate time series. In this paper, we propose to compress the time series data by the Lasso (least absolute shrinkage and selection operator) approximation. We show that, our approach can be naturally extended for compressing the multivariate time series data. Our extension is novel since it constructs an optimal projection of the original multivariates where the best energy efficiency can be realized. The two algorithms are named by ULasso (Univariate Lasso) and MLasso (Multivariate Lasso), for which we also provide practical guidance for parameter selection. Finally, empirically evaluation is implemented with several publicly available real-world data sets from different application domains. We quantify the algorithm performance by measuring the approximation error, compression ratio, and computation complexity. The results show that ULasso and MLasso are superior to or at least equivalent to compression performance of LTC and PLAMlis. Particularly, MLasso can significantly reduce the smooth multivariate time series data, without breaking the major trends and important changes of the sensor network system.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.10
• /
• pp.499-506
• /
• 2005

The growth of networks increase the importance of electronic commerces. Since the fair exchange protocol is an important part of electronic commerces, a number of researches have been done in relation to the fair exchange protocol. As the contract signing protocol is a part of fair exchange protocol, many protocols have been proposed, but most of them were focused on two-party protocol. Only a few were on the multi-party contract signing protocol. So far the optimistic multi-party contract signing protocol presented by Baum-Waidner has the least number of rounds in asynchronous network[4]. But, the lower bound on the number of rounds required by any optimistic multi-party contract signing protocol has been not known. In this paper, we present a tight lower bound on the number of rounds for optimistic multi-party contract signing protocol.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.11
• /
• pp.2411-2417
• /
• 2012

Globally, the emergence of smart phones vitalized the ecosystem of mobile data service industry. Consequentially, mobile data traffic has been explosively growing and the speed of growth will be more steep. New spectrum will be required in order to properly accommodate the explosively growing mobile data traffic. However, it will be difficult to acquire a sufficient guard band between different frequency bands because the range of frequency which is suitable for wireless communications is limited. Thus, the performance degradation caused by inter-band interference will be one of challenging problems in the next generation mobile communication systems. In this paper, we analyze the performance degradation caused by inter-band interference by computer simulations in various environments. Our results show that the impact of the inter-band interference is more critical when own signal is poor or its own interference from neighboring cells is low.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2286-2309
• /
• 2016

Overlay networks have been widely deployed upon the Internet by Service Providers (SPs) to provide improved network services. However, the interaction between each overlay and traffic engineering (TE) as well as the interaction among co-existing overlays may occur. In this paper, we adopt both non-cooperative and cooperative game theory to analyze these interactions, which are collectively called hybrid interaction. Firstly, we model a situation of the hybrid interaction as an n+1-player non-cooperative game, in which overlays and TE are of equal status, and prove the existence of Nash equilibrium (NE) for this game. Secondly, we model another situation of the hybrid interaction as a 1-leader-n-follower Stackelberg-Nash game, in which TE is the leader and co-existing overlays are followers, and prove that the cost at Stackelberg-Nash equilibrium (SNE) is at least as good as that at NE for TE. Thirdly, we propose a cooperative coalition mechanism based on Shapley value to overcome the inherent inefficiency of NE and SNE, in which players can improve their performance and form stable coalitions. Finally, we apply distinct genetic algorithms (GA) to calculate the values for NE, SNE and the assigned cost for each player in each coalition, respectively. Analytical results are confirmed by the simulation on complex network topologies.

• Journal of Digital Convergence
• /
• v.14 no.4
• /
• pp.425-435
• /
• 2016

This paper has the aim to track down the viewers' cognitive emotion of how they are interacting with the story of Shakespeare in Love. Human minds have cognitive and emotional flows while plots, characters, and action-ideas are intertwined in the story of the film. This paper especially focused on the analysis of characters' networks with four statistical data pictures in order to schematize the storytelling architecture on how and why Shakespeare has strongly motivated to write a great star-crossed love play, Romeo and Juliet in his very young age. This paper examines that Shakespeare's subject of desire is to accomplish both a true love and a sincere play which can make the nature of love true. The desire of subject is always slipped aside into scattering with "object a." In the film of Shakespeare in Love, the "object a" is a writing process and has a product of Romeo and Juliet as well.