• The KIPS Transactions:PartA
• /
• v.18A no.4
• /
• pp.123-128
• /
• 2011

As the global grid has grown in size, large-scale distributed data analysis schemes have gained momentum. Over the last few years, a number of methods have been introduced for allocating data intensive tasks across distributed and heterogeneous computing platforms. However, these approaches have a limited potential for scaling up computing nodes so that they can serve more tasks simultaneously. This paper tackles the scalability and communication delay for computing nodes. We propose a distributed data node for storing and allocating the data. This paper also provides data provisioning method based on the steady states for minimizing the communication delay between the data source and the computing nodes. The experimental results show that scalability and communication delay can be achieved in our system.

• Publications of The Korean Astronomical Society
• /
• v.19 no.1
• /
• pp.77-81
• /
• 2004

A high performance computing cluster for astronomical computations has been built at Korea Astronomy Observatory. The 64 node cluster interconnected with Gigabit Ethernet is composed of 128 Intel Xeon processors, 160 GB memory, 6 TB global storage space, and an LTO (Linear Tape-Open) tape library. The cluster was installed and has been managed with the Open Source Cluster Application Resource (OSCAR) framework. Its performance for parallel computations was measured with a three-dimensional hydrodynamic code and showed quite a good scalability as the number of computational cells increases. The cluster has already been utilized for several computational research projects, some of which resulted in a few publications, even though its full operation time is less than one year. As a major resource of the $K^*Grid$ testbed, the cluster has been used for Grid computations, too.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5212-5230
• /
• 2016

How to determine the right number of small base stations to activate in multi-cell uplinks to match traffic from a fixed quantity of K users is an open question. This paper analyses the uplink cooperative that jointly receives base stations activation to explore this question. This paper is different from existing works only consider transmitting power as optimization objective function. The global objective function is formulated as a summation of two terms: transmitting power for data and coordinated overhead for control. Then, the joint base stations activation and beamforming problem is formulated as a mixed integer second order cone optimization. To solve this problem, we develop two polynomial-time distributed methods. Method one is a two-stage solution which activates no more than K small base stations (SBSs). Method two is a heuristic algorithm by dual decomposition to MI-SOCP that activates more SBSs to obtain multiple-antennae diversity gains. Thanks to the parallel computation for each node, our methods are more computationally efficient. The strengths and weaknesses of these two proposed two algorithms are also compared using numerical results.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2001.05a
• /
• pp.65-68
• /
• 2001

RBFN has some problem that because the basis function isnt orthogonal to each others the number of used basis function goes to big. In this reason, the Wavelet Neural Network which uses the orthogonal basis function in the hidden node appears. In this paper, we propose the composition method of the actual function in hidden layer with the scaling function which can represent the region by which the several wavelet can be represented. In this method, we can decrease the size of the network with the pure several wavelet function. In addition to, when we determine the parameters of the scaling function we can process rough approximation and then the network becomes more stable. The other wavelets can be determined by the global solutions which is suitable for the suggested problem using the genetic algorithm and also, we use the back-propagation algorithm in the learning of the weights. In this step, we approximate the target function with fine tuning level. The complex neural network suggested in this paper is a new structure and important simultaneously in the point of handling the determination problem in the wavelet initialization.

• Structural Engineering and Mechanics
• /
• v.12 no.5
• /
• pp.507-526
• /
• 2001

In standard finite element algorithms, the local stability conditions are not accounted for in the formulation of the tangent stiffness matrix. As a result, the loss of the local stability is not adequately related to the onset of the global instability. The phenomenon typically arises with material-type localizations, such as shear bands and plastic hinges. This paper addresses the problem in the context of the planar, finite-strain, rate-independent, materially non-linear beam theory, although the proposed technology is in principle not limited to beam structures. A weak formulation of Reissner's finite-strain beam theory is first presented, where the pseudocurvature of the deformed axis is the only unknown function. We further derive the local stability conditions for the large deformation case, and suggest various possible combinations of the interpolation and numerical integration schemes that trigger the simultaneous loss of the local and global instabilities of a statically determined beam. For practical applications, we advice on a procedure that uses a special numerical integration rule, where interpolation nodes and integration points are equal in number, but not in locations, except for the point of the local instability, where the interpolation node and the integration point coalesce. Provided that the point of instability is an end-point of the beam-a condition often met in engineering practice-the procedure simplifies substantially; one of such algorithms uses the combination of the Lagrangian interpolation and Lobatto's integration. The present paper uses the Galerkin finite element discretization, but a conceptually similar technology could be extended to other discretization methods.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.502-512
• /
• 2002

Most of previous replication schemes assume lazy schemes, which asynchronously propagate replica updates to other nodes after the updating transaction commits. While lazy schemes are novel in the sense that they can resolve high deadlock frequencies of eager schemes, they suffer from the fact that users should be responsible for the data consistency. Recently replication schemes based on the messaging order of group communication have been studied. They can reduce the deadlock frequencies using the messaging order, but they have another problem of increasing execution overhead of aborted transactions at high degree of concurrency. This is because the sender node validates global serializability after multicasting replica update messages to other nodes. In this paper, we propose an efficient eager replication scheme for reducing the number of messaging and overhead of aborted transactions significantly. The proposed scheme validates any conflicts before multicasting and does not multicast when there is any conflict; hence, it can exploit performance improvement by alleviating the message traffic for replica update or by reducing the number of disk accesses and locking delay due to aborted transactions.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.500-500
• /
• 2002

Most of previous replication schemes assume lazy schemes, which asynchronously propagate replica updates to other nodes after the updating transaction commits. While lazy schemes are novel in the sense that they can resolve high deadlock frequencies of eager schemes, they suffer from the fact that users should be responsible for the data consistency. Recently replication schemes based on the messaging order of group communication have been studied. They can reduce the deadlock frequencies using the messaging order, but they have another problem of increasing execution overhead of aborted transactions at high degree of concurrency. This is because the sender node validates global serializability after multicasting replica update messages to other nodes. In this paper, we propose an efficient eager replication scheme for reducing the number of messaging and overhead of aborted transactions significantly. The proposed scheme validates any conflicts before multicasting and does not multicast when there is any conflict; hence, it can exploit performance improvement by alleviating the message traffic for replica update or by reducing the number of disk accesses and locking delay due to aborted transactions.

• Proceedings of the Korean Society of Crop Science Conference
• /
• 2017.06a
• /
• pp.267-267
• /
• 2017

In Korea, the average air temperature has been elevated twice faster than the average global warming. And the climate warming is characterized by the smaller rise of air temperature in summer and the greater rise of air temperature in spring and winter. Therefore, the number of frost-free days to determine the cultivation ability of crops has increased by more than 15 days in 10 years according to climate warming. This climate warming trend has extended and is projected to extend not only the sweet potato growing season but also the sweet potato early cultivating area to higher altitude and latitude region. This study was carried out to evaluate the possibility of sweet potato double cropping in the southern island area of Korea by assessing the growth and yield performance of sweet potato cultivated at extremely-early and -late time. We had performed at Yokji Island Yokji Island($E128^{\circ}$ 18' $N34^{\circ}$ 36'), a representative specified complex area of sweet potato cultivation in southern Korea. As the test varieties, the major cultivars of the this region, Shinyulmi and early hypertrophic cultivars, Dahomi were used. The prior cropping were planted with PE film mulching on March 30 and April 10, and harvested after 110 days. So the succeeding cropping were planted without PE film mulching on July 25 and August 5 according to the harvesting time of the prior sweet potato and harvested after 120 days. As a control, it was harvested on September 15, 120 days after planted on May 15. Each experimental plot had an area of 12 square meters consisting of 4 beds, and was planted one at a time at intervals of 25cm. We had investigated growth characteristics - main vine length, node number, branch number, total vine yield, and tuberous root characteristics - tuberous root number, average weight, starch value, and etc. After harvesting, we analyzed the economic effects by examining the postharvest quantity, the input labor, the management cost, and the income. The total yield of marketable products in prior and succeeding cropping was 46~70% higher than that of control. The average unit price of sweet potato was 36% higher than the conventional culture, and the gross income increased by 98%, but the operating cost increased by 83%, and the farm income increased by 103%. There are considerations such as the difficulty of enlargement of cultivation area due to lack of labor in limited space and the need for watering measures due to spring drought. However, if the area of application for sweet potatoes double system is increased by 10%, it can be used as a new cropping system.

• Proceedings of the Korean Society of Crop Science Conference
• /
• 2017.06a
• /
• pp.280-280
• /
• 2017

In Korea, the average air temperature has been elevated twice faster than the average global warming. And the climate warming is characterized by the smaller rise of air temperature in summer and the greater rise of air temperature in spring and winter. Therefore, the number of frost-free days to determine the cultivation ability of crops has increased by more than 15 days in 10 years according to climate warming. This climate warming trend has extended and is projected to extend not only the sweet potato growing season but also the sweet potato early cultivating area to higher altitude and latitude region. This study was carried out to evaluate the possibility of sweet potato double cropping in the southern island area of Korea by assessing the growth and yield performance of sweet potato cultivated at extremely-early and -late time. We had performed at Yokji Island Yokji Island($E128^{\circ}$ 18' $N34^{\circ}$ 36'), a representative specified complex area of sweet potato cultivation in southern Korea. As the test varieties, the major cultivars of the this region, Shinyulmi and early hypertrophic cultivars, Dahomi were used. The prior cropping were planted with PE film mulching on March 30 and April 10, and harvested after 110 days. So the succeeding cropping were planted without PE film mulching on July 25 and August 5 according to the harvesting time of the prior sweet potato and harvested after 120 days. As a control, it was harvested on September 15, 120 days after planted on May 15. Each experimental plot had an area of 12 square meters consisting of 4 beds, and was planted one at a time at intervals of 25cm. We had investigated growth characteristics - main vine length, node number, branch number, total vine yield, and tuberous root characteristics - tuberous root number, average weight, starch value, and etc. After harvesting, we analyzed the economic effects by examining the postharvest quantity, the input labor, the management cost, and the income. The total yield of marketable products in prior and succeeding cropping was 46~70% higher than that of control. The average unit price of sweet potato was 36% higher than the conventional culture, and the gross income increased by 98%, but the operating cost increased by 83%, and the farm income increased by 103%. There are considerations such as the difficulty of enlargement of cultivation area due to lack of labor in limited space and the need for watering measures due to spring drought. However, if the area of application for sweet potatoes double system is increased by 10%, it can be used as a new cropping system.

• Information Systems Review
• /
• v.24 no.1
• /
• pp.1-19
• /
• 2022

Social media-based communication has become crucial part of our personal and official lives. Therefore, it is no surprise that social media sentiment analysis has emerged an important way of detecting potential customers' sentiment trends for all kinds of companies. However, social media sentiment analysis suffers from huge number of sentiment features obtained in the process of conducting the sentiment analysis. In this sense, this study proposes a novel method by using Bayesian Network. In this model MBFS (Markov Blanket-based Feature Selection) is used to reduce the number of sentiment features. To show the validity of our proposed model, we utilized online review data from Yelp, a famous social media about restaurant, bars, beauty salons evaluation and recommendation. We used a number of benchmarking feature selection methods like correlation-based feature selection, information gain, and gain ratio. A number of machine learning classifiers were also used for our validation tasks, like TAN, NBN, Sons & Spouses BN (Bayesian Network), Augmented Markov Blanket. Furthermore, we conducted Bayesian Network-based what-if analysis to see how the knowledge map between target node and related explanatory nodes could yield meaningful glimpse into what is going on in sentiments underlying the target dataset.