• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.11 no.4
• /
• pp.143-150
• /
• 1991

This paper presents an overview of a system of computer programs for the solution of a large geodetic network of about 2,000 stations. The system arranges the matrices in systematic sparse form which is applied to observation equations of RR(C)U (Row-wise Representation Complete Unordered) type and to normal equations of RR(U)U (Row-wise Representation Upper Unordered) type. The solution is done by a Modified Cholesky's algorithm in view of large networks. The implementation program are tested in PC-386 by korean new secondary networks, the results show that the sparse techniques are highly useful to geodetic networks in core-storage management and processing time.

• IE interfaces
• /
• v.16 no.2
• /
• pp.229-239
• /
• 2003

The On-Line Analytical Processing (OLAP) tools access data from the data warehouse for complex data analysis, such as multidimensional data analysis, and decision support activities. Current research has lead to new developments in all aspects of data warehousing, however, there are still a number of problems that need to be solved for making data warehousing effective. View maintenance, one of them, is to maintain view in response to updates in source data. Keeping the view consistent with updates to the base relations, however, can be expensive, since it may involve querying external sources where the base relations reside. In order to reduce maintenance costs, it is possible to maintain the views using information that is strictly local to the data warehouse. This process is usually referred to as "self-maintenance of views". A number of algorithm have been proposed for self maintenance of views where they keep some additional information in data warehouse in the form of auxiliary views. But those algorithms did not consider a consistency of materialized views using view self-maintenance. The purpose of this paper is to research consistency problem when self-maintenance of views is implemented. The proposed "conveyor algorithm" will resolved a complete consistency of materialized view using self-maintenance with considering network delay. The rationale for conveyor algorithm and performance characteristics are described in detail.

• Journal of Internet Computing and Services
• /
• v.5 no.5
• /
• pp.129-138
• /
• 2004

In the telecommunications network, multicasting is widely used recently. Multicast tree problem is modeled as the NP-complete Steiner problem in the networks. In this paper, we study algorithms for finding efficient multicast trees with hop and node degree constraints. Multimedia service is an application of multicasting and it is required to transfer a large volume of multimedia data with QoS(Quality of Service). Though heuristics for solving the multicast tree problems with one constraint have been studied. however, there is no optimum algorithm that finds an optimum multicast tree with hop and node degree constraints up to now. In this paper, an approach for finding an efficient multicast tree that satisfies hop and node degree constraints is presented and the experimental results explain how the hop and node degree constraints affect to the total cost of a multicast tree.

• Journal of KIISE:Information Networking
• /
• v.28 no.4
• /
• pp.657-664
• /
• 2001

In our predecessor paper(Part I)[13], we introduced a graph that represents the crosstalk relationship among multicast connections in the photonic Banyan-type switching network, and found the upper bound on the degree of it. In this paper(Part II), we consider the number of routing rounds(i.e., scheduling length) required for SE(switching element)-disjoint multicasting in photonic Banyan-type switching networks. Unfortunately, the problem to find an optimal scheduling length is NP-complete thus, we propose an approximation algorithm that gives its scheduling length is always within double of the upper bound on the optimal length. We also study the scheduling length on the Iink-disjoint(i.e., nonblocking) multicasting. Various nonblocking Banyan-type multicasting networks are found under the scheduling lengths.

• Journal of Communications and Networks
• /
• v.9 no.2
• /
• pp.198-209
• /
• 2007

This paper provides a thorough study on shared segment protection (SSP) for mesh communication networks in the complete routing information scenario, where the integer linear program (ILP) in [1] is extended such that the following two constraints are well addressed: (a) The restoration time constraint for each connection request, and (b) the switching/merging capacity constraint at each node. A novel approach, called SSP algorithm, is developed to reduce the extremely high computation complexity in solving the ILP formulation. Basically, our approach is to derive a good approximation on the parameters in the ILP by referring to the result of solving the corresponding shared path protection (SPP) problem. Thus, the design space can be significantly reduced by eliminating some edges in the graphs. We will show in the simulation that with our approach, the optimality can be achieved in most of the cases. To verify the proposed formulation and investigate the performance impairment in terms of average cost and success rate by the additional two constraints, extensive simulation work has been conducted on three network topologies, in which SPP and shared link protection (SLP) are implemented for comparison. We will demonstrate that the proposed SSP algorithm can effectively and efficiently solve the survivable routing problem with constraints on restoration time and switching/merging capability of each node. The comparison among the three protection types further verifies that SSP can yield significant advantages over SPP and SLP without taking much computation time.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.6
• /
• pp.409-416
• /
• 2005

For broadband high-data-rate power line communication with the allocated frequency bandwidth from 2 to 30 MHz on medium voltage (MV) distribution power lines, a signal coupling unit is developed. The coupling unit is composed of a coupling capacitor for coupling communication signal, a drain coil, and an impedance matching part. The coupling capacitor made of ceramic capacitor is designed for transmission property of better than 1 dB in the frequency range. The drain coil is used for preventing low frequency high voltage from junction of medium voltage power line in case that a coupling capacitor is not working properly any more. Also, using ferrite core, a novel broadband impedance matching transformer is developed. A complete coupling unit with a coupling capacitor, a drain coil, and a matching transformer is housed by polymer for good isolation and distinguishing from high voltage electric facilities. Each is fabricated and its frequency behavior is tested. Finally, complete signal couplers are equipped in a MV PLC test bed and their performance are measured. The measurement shows that the coupling capacitor works excellently.

• The KIPS Transactions:PartA
• /
• v.13A no.2 s.99
• /
• pp.163-170
• /
• 2006

Most scheduling problems including DAG(Directed Acyclic Graph)-based are known to be NP-complete, so many heuristic-based scheduling algorithms have been researched. HEFT and CPOP are such algorithms which have been devised to be effective in heterogeneous environment. We proposed, in the previous research, three scheduling algorithms which are effective in realistic global heterogeneous environment: CPOC, eCPOPC and eCPOP. In this paper, the heuristics which are used in the above five algorithms will be systematically analyzed. Those algorithms will be also studied experimentally using various benchmarks. Experimental results show that the eCPOC generates better schedules than any other algorithms and the heuristics which are used in the proposed algorithms are effective in the global heterogeneous environment.

• Journal of Information Processing Systems
• /
• v.15 no.3
• /
• pp.632-644
• /
• 2019

The remote monitoring and warning system for dangerous chemicals is designed with the concept of the Cyber-Physical System (CPS) in this paper. The real-time perception, dynamic control, and information service of major hazards chemicals are realized in this CPS system. The CPS system architecture, the physical layer and the applacation layer, are designed in this paper. The terminal node is mainly composed of the field collectors which complete the data acquisition of sensors and video in the physical layers, and the use of application layer makes CPS system safer and more reliable to monitor the hazardous chemicals. The cloud application layer completes the risk identification and the prediction of the major hazard sources. The early intelligent warning of the major dangerous chemicals is realized and the security risk images are given in the cloud application layer. With the CPS technology, the remote network of hazardous chemicals has been completed, and a major hazard monitoring and accident warning online system is formed. Through the experiment of the terminal node, it can be proved that the terminal node can complete the mass data collection and classify. With this experiment it can be obtained the CPS system is safe and effective. In order to verify feasible, the multi-risk warning based on CPS is simulated, and results show that the system solves the problem of hazardous chemicals enterprises safety management.

• The Journal of the Acoustical Society of Korea
• /
• v.39 no.6
• /
• pp.622-628
• /
• 2020

This paper proposes a music generation technique that automatically generates trot music using a Generative Adversarial Network (GAN) model composed of a Recurrent Neural Network (RNN). The proposed method uses a method of creating a chord as a skeleton of the music, creating a melody and bass in stages based on the chord progression made, and attaching it to the corresponding chord to complete the structured piece. Also, a new chorus chord progression is created from the verse chord progression by applying the characteristics of a trot song that repeats the structure divided into an individual section, such as intro, verse, and chorus. And it extends the length of the created trot. The quality of the generated music was specified using subjective evaluation and objective evaluation methods. It was confirmed that the generated music has similar characteristics to the existing trot.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.5
• /
• pp.1146-1165
• /
• 2013

Collaborative awareness between persons with various smart multimedia devices is a new trend in the Internet of Things (IoT). Because of the mobility, randomness, and complexity of persons, it is difficult to achieve complete data awareness and data transmission in IoT. Therefore, research must be conducted on mobile-aware service models. In this work, we first discuss and quantify the social relationships of mobile nodes from multiple perspectives based on a summary of social characteristics. We then define various decision factors (DFs). Next, we construct a directed and weighted community by analyzing the activity patterns of mobile nodes. Finally, a mobile-aware service routing algorithm (MSRA) is proposed to determine appropriate service nodes through a trusted chain and optimal path tree. The simulation results indicate that the model has superior dynamic adaptability and service discovery efficiency compared to the existing models. The mobile-aware service model could be used to improve date acquisition techniques and the quality of mobile-aware service in the IoT.