• Journal of the Korean Association of Geographic Information Studies
• /
• v.8 no.3
• /
• pp.84-95
• /
• 2005

This paper presents solution heuristics to solving optimal multiple-viewpoint location problems that are based on topographic features. The visibility problem is to maximise the viewshed area for a set of viewpoints on digital elevation models (DEM). For this analysis, five areas are selected, and fundamental topographic features (peak, pass, and pit) are extracted from the DEMs of the study areas. To solve the visibility problem, at first, solution approaches based on the characteristics of the topographic features are explored, and then, a benchmark test is undertaken that solution performances of the solution methods, such as computing times, and visible area sizes, are compared with the performances of traditional spatial heuristics. The feasibility of the solution methods, then, are discussed with the benchmark test results. From the analysis, this paper can conclude that fundamental topographic features based solution methods suggest a new sight of visibility analysis approach which did not discuss in traditional algorithmic approaches. Finally, further research avenues are suggested such as exploring more sophisticated selection process of topographic features related to visibility analysis, exploiting systematic methods to extract topographic features, and robust spatial analytical techniques and optimization techniques that enable to use the topographic features effectively.

• KIISE Transactions on Computing Practices
• /
• v.24 no.1
• /
• pp.40-45
• /
• 2018

With the advent of big data and social networks, large-scale graph processing becomes popular research topic. Recently, an optimization technique called Gorder has been proposed to improve the performance of in-memory graph processing. This technique improves performance by optimizing the graph layout on memory to have better cache locality. However, since it is designed for in-memory graph processing systems, the technique is not suitable for disk-based graph engines; also the cost for applying the technique is significantly high. To solve the problem, we propose a new graph ordering called I/O Order. I/O Order considers the characteristics of I/O accesses for SSDs and HDDs to improve the performance of disk-based graph engine. In addition, the algorithmic complexity of I/O Order is simple compared to Gorder, hence it is cheaper to apply I/O Ordering. I/O order reduces the cost of pre-processing up to 9.6 times compared to that of Gorder's, still its performance is 2 times higher compared to the Random in low-locality graph algorithms.

• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.733-738
• /
• 2008

Serial Music, introduced by A. Sch nberg, is a one of the important composition techniques. This music style has features of pantonality and atonality, so it generates unique atmosphere of modern music. In this paper, we introduce an method of generating serial music using mathematical algorithm. This method generates music that satisfy the requirement that the number of pitches belonged to each pitch class are exactly same, though the requirement is less strict than Sch nberg's definition. To do this, our method uses space-filling curves traversing the twelve tone matrix, which is constructed by the serial series, its inversion and its transpose. Using these curves, we can generate a music that has all notes in the matrix exactly once and adequate repeatness because of the curve's locality. Result music, therefore, can be more suitable for people that are not familiar with modern music, while maintaining the features of pantonality and atonality. This paper also introduces a method of generating extended serial music that uses serialism of duration and dynamic of notes, using multi-dimensional space-filling curves.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.12
• /
• pp.1079-1085
• /
• 2013

Due to the limited power supply resources, it is essential that the minimization of algorithmic operation and the reduction of the hardware logical-resources in the design of the satellite transponder. It is also required that the transponder process the signals of various bandwidth efficiently, that is suitble for the SDR-based implementation. This paper proposes a variable rate down sampler which can provide variable bandwidth and data rate for carrier, ranging and sub-band command signals respectively. The proposed down sampler can provide multiple $2^M$ decimated outputs from a single half band filter with recursive arithmetic architecture, which can minimize the hardware resources as well as the arithmetic operations. The algorithm for hardware implementation as well as the analysis for the passband flatness and aliasing is presented and varified by the FPGA implementation.

• The KIPS Transactions:PartA
• /
• v.12A no.3 s.93
• /
• pp.243-252
• /
• 2005

This paper introduces a noble modeling technique to build data communication prediction models in multiprocessors, using Least-Squares and Robust Estimation methods. A set of sample communication rates are collected by using a few small input data sets into workload programs. By applying estimation methods to these samples, we can build analytic models that precisely estimate communication rates for huge input data sets. The primary advantage is that, since the models depend only on data set size not on the specifications of target systems or workloads, they can be utilized to various systems and applications. In addition, the fact that the algorithmic behavioral characteristics of workloads are reflected into the models entitles them to model diverse other performance metrics. In this paper, we built models for cache miss rates which are the main causes of data communication in shared memory multiprocessor systems. The results present excellent prediction error rates; below $1\%$ for five cases out of 12, and about $3\%$ for the rest cases.

• School Mathematics
• /
• v.15 no.1
• /
• pp.37-59
• /
• 2013

The purpose of this study was to examine and analyze the mathematical tasks in the high school textbooks. In particular, it aimed to reveal the overall picture of the level of cognitive demand of the mathematical tasks in the textbooks. We adopted the framework for mathematical task analysis suggested by Smith & Stein (1998) and analyzed the mathematical tasks accordingly. The findings from the analysis showed that 95 percent of the mathematical tasks were at low level and the rest at high level in terms of cognitive demand. Most of the mathematical tasks in the textbooks were algorithmic and focused on producing correct answers by using procedures.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.5
• /
• pp.833-842
• /
• 2017

In this study, the design methodology of radial basis function neural networks based on incremental K-means clustering is introduced for learning and processing the big data. If there is a lot of dataset to be trained, general clustering may not learn dataset due to the lack of memory capacity. However, the on-line processing of big data could be effectively realized through the parameters operation of recursive least square estimation as well as the sequential operation of incremental clustering algorithm. Radial basis function neural networks consist of condition part, conclusion part and aggregation part. In the condition part, incremental K-means clustering algorithms is used tweights of the conclusion part are given as linear function and parameters are calculated using recursive least squareo get the center points of data and find the fitness using gaussian function as the activation function. Connection s estimation. In the aggregation part, a final output is obtained by center of gravity method. Using machine learning data, performance index are shown and compared with other models. Also, the performance of the incremental K-means clustering based-RBFNNs is carried out by using PSO. This study demonstrates that the proposed model shows the superiority of algorithmic design from the viewpoint of on-line processing for big data.

• Fisheries and Aquatic Sciences
• /
• v.19 no.4
• /
• pp.21.1-21.11
• /
• 2016

Background: The evaluation of suitable reference genes as normalization controls is a prerequisite requirement for launching quantitative reverse transcription-PCR (RT-qPCR)-based expression study. In order to select the stable reference genes in abalone Haliotis discus hannai tissues (gill and hepatopancreas) under heavy metal exposure conditions (Cu, Zn, and Cd), 12 potential candidate housekeeping genes were subjected to expression stability based on the comprehensive ranking while integrating four different statistical algorithms (geNorm, NormFinder, BestKeeper, and ${\Delta}CT$ method). Results: Expression stability in the gill subset was determined as RPL7 > RPL8 > ACTB > RPL3 > PPIB > RPL7A > EF1A > RPL4 > GAPDH > RPL5 > UBE2 > B-TU. On the other hand, the ranking in the subset for hepatopancreas was RPL7 > RPL3 > RPL8 > ACTB > RPL4 > EF1A > RPL5 > RPL7A > B-TU > UBE2 > PPIB > GAPDH. The pairwise variation assessed by the geNorm program indicates that two reference genes could be sufficient for accurate normalization in both gill and hepatopancreas subsets. Overall, both gill and hepatopancreas subsets recommended ribosomal protein genes (particularly RPL7) as stable references, whereas traditional housekeepers such as ${\beta}-tubulin$ (B-TU) and glyceraldehyde-3-phosphate dehydrogenase (GAPDH) genes were ranked as unstable genes. The validation of reference gene selection was confirmed with the quantitative assay of MT transcripts. Conclusions: The present analysis showed the importance of validating reference genes with multiple algorithmic approaches to select genes that are truly stable. Our results indicate that expression stability of a given reference gene could not always have consensus across tissue types. The data from this study could be a good guide for the future design of RT-qPCR studies with respect to metal regulation/detoxification and other related physiologies in this abalone species.

• Proceedings of the Korea Contents Association Conference
• /
• 2007.11a
• /
• pp.903-907
• /
• 2007

The aim of this paper is to help learners develop algorithmic thinking skill to solve a problem using LAMS and to draw their interest in learning through various learning activities to solve it. LAMS has the advantages of easy teaching contents' design and implementation and of an offer of sequential learning under various learning environments. The designed contents were applied to elementary school students' learning and a questionnaire survey was conducted. They showed positive responses, on the one hand, they hoped that various kinds of learning would be provided including not only data sorting but also technical contents related to computer. For further study, it is necessary to revise and supplement conceptual principals or contents of computer education in elementary and junior high schools.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.4 s.334
• /
• pp.7-14
• /
• 2005

Earlier researches have typically concentrated on discovering IP network topology, which implies that the connectivity of all Ethernet devices is ignored. But automatic discovery of Physical topology Plays a crucial role in enhancing the manageability of modem Metro Ethernet mesh networks due to the benefits of Ethernet services, including: Ease of use, Cost Effectiveness and flexibility. Because of proprietary solutions targeting specific product families and related algorithm which depends on Layer 2 forwarding table information it is impossible to discover physical topology in the Ethernet mesh networks. To cope with these shortcomings, in this paper we propose a novel and practical algorithmic solution that can discover accurate physical topology in the Ethernet mesh networks. Our algorithm divides the Ethernet mesh networks into bridged networks and host networks and those bridges located in boundary are named edge bridges. Our algorithm uses the standard spanning tree protocol MIB information for the bridged networks and uses the standard Layer 2 forwarding table MIB information for the host networks. As using the standard MIB information to discover physical topology we can offer interoperability guarantee in the Ethernet mesh networks composed of the various vendors' products.