• Magazine of the Korean Society of Agricultural Engineers
• /
• v.29 no.4
• /
• pp.73-92
• /
• 1987

Formulation of the geometric optimization for truss structures based on the elasticity theory turn out to be the nonlinear programming problem which has to deal with the cross-sectional area of the member and the coordinates of its nodes simultaneously. A few techniques have been proposed and adopted for the analysis of this nonlinear programming problem for the time being. These techniques, however, bear some limitations on truss shapes, loading conditions and design criteria for the practical application to real structures. A generalized algorithm for the geometric optimization of the truss structures, which can eliminate the above mentioned limitations, is developed in this study. The algorithm proposed utilizes the two-levels technique. In the first level which consists of two phases, the cross-sectional area of the truss member is optimized by transforming the nonlinear problem into SUMT, and solving SUMT utilizing the modified Newton Raphson method. In the second level, which also consists of two phases the geometric shape is optimized utillzing the unindirectional search technique of the Powell method which make it possible to minimize only the objective functlon. The algorithm proposed in this study is numerically tested for several truss structures with various shapes, loading conditions and design criteria, and compared with the results of the other algorithms to examine its applicability and stability. The numerical comparisons show that the two- levels algorithm proposed in this study is safely applicable to any design criteria, and the convergency rate is relatively fast and stable compared with other iteration methods for the geometric optimization of truss structures. It was found for the result of the shape optimization in this study to be decreased greatly in the weight of truss structures in comparison with the shape optimization of the truss utilizing the algorithm proposed with the other area optimum method.

• The KIPS Transactions:PartD
• /
• v.19D no.1
• /
• pp.21-28
• /
• 2012

Predication of protein interaction sites for monomer structures can reduce the search space for protein docking and has been regarded as very significant for predicting unknown functions of proteins from their interacting proteins whose functions are known. In the other hand, the prediction of interaction sites has been limited in crystallizing weakly interacting complexes which are transient and do not form the complexes stable enough for obtaining experimental structures by crystallization or even NMR for the most important protein-protein interactions. This work reports the calculation of 3D surface patches of complex structures and their properties and a machine learning approach to build a predictive model for the 3D surface patches in interaction and non-interaction sites using support vector machine. To overcome classification problems for class imbalanced data, we employed an under-sampling technique. 9 properties of the patches were calculated from amino acid compositions and secondary structure elements. With 10 fold cross validation, the predictive model built from SVM achieved an accuracy of 92.7% for classification of 3D patches in interaction and non-interaction sites from 147 complexes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.8A
• /
• pp.581-590
• /
• 2003

This paper proposes the routing path selection mechanism for source routing-based PtMP (Point-to-Multipoint) call in ATM switching system. Especially, it suggests PtMP routing path selection method that can share the maximum resource prior to the optimal path selection, guarantee the reduction of path calculation time and cycle prevention. The searching for the nearest branch point from destination node to make the maximum share of resource is the purpose of this algorithm. Therefore among neighbor nodes from destination node by back-tracking, this algorithm fixes the node crossing first the node on existing path having the same Call ID as branch node, constructs the optimal PtMP routing path. The optimal node to be selected by back-tracking is selected by the use of Dijkstra algorithm. That is to say, PtMP routing path selection performs the step of cross node selection among neighboring nodes by back-tracking and the step of optimal node selection(optimal path calculation) among neighboring nodes by back-tracking. This technique reduces the process of search of routing information table for path selection and path calculation, also solves the cycle prevention easily during path establishment.

• Journal of KIISE:Software and Applications
• /
• v.31 no.7
• /
• pp.939-948
• /
• 2004

In this paper. we Propose a robust and fast image registration technique for motion correction in brain CT-CT angiography obtained from same patient to be taken at different time. First, the feature points of two images are respectively extracted by 3D edge detection technique, and they are converted to locally weighted 3D distance map in reference image. Second, we search the optimal location whore the cross-correlation of two edges is maximized while floating image is transformed rigidly to reference image. This optimal location is determined when the maximum value of cross-correlation does't change any more and iterates over constant number. Finally, two images are registered at optimal location by transforming floating image. In the experiment, we evaluate an accuracy and robustness using artificial image and give a visual inspection using clinical brain CT-CT angiography dataset. Our proposed method shows that two images can be registered at optimal location without converging at local maximum location robustly and rapidly by using locally weighted 3D distance map, even though we use a few number of feature points in those images.

• Journal of the Korea Fashion and Costume Design Association
• /
• v.21 no.3
• /
• pp.37-53
• /
• 2019

The purposes of this study were to investigate Chinese female consumers' shopping orientation and clothing shopping behaviors on the internet and to find the differences in internet shopping behaviors of consumer groups segmented by clothing shopping orientation. The subjects were 417 women in their 20s and 30s from the Gillim Province, China. The research method was a survey, and the questionnaire consisted of a clothing shopping orientation subscale, clothing, their shopping behaviors via the internet, and the subjects' demographic characteristics. For data analysis, a frequency analysis, a cross-tab analysis, a factor analysis, a cluster analysis, ANOVA, and Duncan's multiple range test were performed. The results of this study were as follows. The clothing shopping orientation was derived using five factors (trend pursuit, pleasure pursuit, brand pursuit, economic pursuit, and convenience pursuit). Chinese female consumers were classified into three groups (hedonic group, ambivalent group, and practical group) by clothing shopping orientation. These three groups showed many significant differences in their clothing shopping behaviors on the internet. The hedonic group preferred the specialty and cross-border shopping malls, and considered product quality and trend as their main purchase motives. The ambivalent group considered the convenience of the purchase and trend as important motives as compared to the other groups, and they use more various product selection criteria. The practical group considered low price and convenience and the search simplicity of various products as major purchase motives. In addition, the hedonic and ambivalent groups had a higher purchase satisfaction and purchase intention from internet shopping than the practical group. This study suggested that clothing shopping orientation is one of the useful segmentation variables and fashion marketers needed to establish differentiated marketing strategies for each consumer group that is segmented by clothing shopping orientation.

• Journal of the Korea Convergence Society
• /
• v.13 no.4
• /
• pp.521-530
• /
• 2022

This study investigates the last twenty two years of research trends in the burnout of psychiatric ward nurses and suggests guidance for future studies. Five domestic databases were used in the literature search, and fourteen articles that met the inclusion criteria were reviewed. thirteen articles were descriptive, cross-sectional studies and one study was qulitative study. Among the quantitative study, the most used instrument to measure burnout of nurses working in psychiatric wards was the Maslach Burnout Inventory (MBI). The individual factors related to burnout in nurses in psychiatric wards were age, marital status, years of clinical experience psychiatric mental health nurse license status. monthly income, religious status and education related to psychiatry. The most related situational factor that affect burnout in psychiatric ward nurses was experience of violence. In future research, large-scale cross-sectional and longitudinal studies should be conducted, and based on this, intervention studies should be conducted on reducing the burnout of psychiatric ward nurses.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.7
• /
• pp.996-1003
• /
• 2022

In this paper, we present a new method for determining the scan line and range for vision-based 1-D barcode recognition. This is a study on how to detect valid barcode representative points and directions by applying the DBSCAN clustering method based on block HOG (histogram of gradient) and determine scan lines and barcode crosslines based on this. In this paper, the minimum and maximum search techniques were applied to determine the cross-line range of barcodes based on the obtained scan lines. This can be applied regardless of the barcode size. This technique enables barcode recognition even by detecting only a partial area of the barcode, and does not require rotation to read the code after detecting the barcode area. In addition, it is possible to detect barcodes of various sizes. Various experimental results are presented to evaluate the performance of the proposed technique in this paper.

• Steel and Composite Structures
• /
• v.51 no.4
• /
• pp.441-456
• /
• 2024

This paper aims to develop Machine Learning (ML) algorithms to predict the buckling resistance of cold-formed steel (CFS) channels with restrained flanges, widely used in typical CFS sheathed wall panels, and provide practical design tools for engineers. The effects of cross-sectional restraints were first evaluated on the elastic buckling behaviour of CFS channels subjected to pure axial compressive load or bending moment. Feedforward multi-layer Artificial Neural Networks (ANNs) were then trained on different datasets comprising CFS channels with various dimensions and properties, plate thicknesses, and restraining conditions on one or two flanges, while the elastic distortional buckling resistance of the elements were determined according to the Finite Strip Method (FSM). To develop less biased networks and ensure that every observation from the original dataset has the chance of appearing in the training and test set, a K-fold cross-validation technique was implemented. In addition, the hyperparameters of the ANNs were tuned using a grid search technique to provide ANNs with optimum performances. The results demonstrated that the trained ANNs were able to predict the elastic distortional buckling resistance of CFS flange-restrained elements with an average accuracy of 99% in terms of coefficient of determination. The developed models were then used to propose a simple ANN-based design formula for the prediction of the elastic distortional buckling stress of CFS flange-restrained elements. Finally, the proposed formula was further evaluated on a separate set of unseen data to ensure its accuracy for practical applications.

• Journal of Intelligence and Information Systems
• /
• v.21 no.1
• /
• pp.1-13
• /
• 2015

As opinion mining in big data applications has been highlighted, a lot of research on unstructured data has made. Lots of social media on the Internet generate unstructured or semi-structured data every second and they are often made by natural or human languages we use in daily life. Many words in human languages have multiple meanings or senses. In this result, it is very difficult for computers to extract useful information from these datasets. Traditional web search engines are usually based on keyword search, resulting in incorrect search results which are far from users' intentions. Even though a lot of progress in enhancing the performance of search engines has made over the last years in order to provide users with appropriate results, there is still so much to improve it. Word sense disambiguation can play a very important role in dealing with natural language processing and is considered as one of the most difficult problems in this area. Major approaches to word sense disambiguation can be classified as knowledge-base, supervised corpus-based, and unsupervised corpus-based approaches. This paper presents a method which automatically generates a corpus for word sense disambiguation by taking advantage of examples in existing dictionaries and avoids expensive sense tagging processes. It experiments the effectiveness of the method based on Naïve Bayes Model, which is one of supervised learning algorithms, by using Korean standard unabridged dictionary and Sejong Corpus. Korean standard unabridged dictionary has approximately 57,000 sentences. Sejong Corpus has about 790,000 sentences tagged with part-of-speech and senses all together. For the experiment of this study, Korean standard unabridged dictionary and Sejong Corpus were experimented as a combination and separate entities using cross validation. Only nouns, target subjects in word sense disambiguation, were selected. 93,522 word senses among 265,655 nouns and 56,914 sentences from related proverbs and examples were additionally combined in the corpus. Sejong Corpus was easily merged with Korean standard unabridged dictionary because Sejong Corpus was tagged based on sense indices defined by Korean standard unabridged dictionary. Sense vectors were formed after the merged corpus was created. Terms used in creating sense vectors were added in the named entity dictionary of Korean morphological analyzer. By using the extended named entity dictionary, term vectors were extracted from the input sentences and then term vectors for the sentences were created. Given the extracted term vector and the sense vector model made during the pre-processing stage, the sense-tagged terms were determined by the vector space model based word sense disambiguation. In addition, this study shows the effectiveness of merged corpus from examples in Korean standard unabridged dictionary and Sejong Corpus. The experiment shows the better results in precision and recall are found with the merged corpus. This study suggests it can practically enhance the performance of internet search engines and help us to understand more accurate meaning of a sentence in natural language processing pertinent to search engines, opinion mining, and text mining. Naïve Bayes classifier used in this study represents a supervised learning algorithm and uses Bayes theorem. Naïve Bayes classifier has an assumption that all senses are independent. Even though the assumption of Naïve Bayes classifier is not realistic and ignores the correlation between attributes, Naïve Bayes classifier is widely used because of its simplicity and in practice it is known to be very effective in many applications such as text classification and medical diagnosis. However, further research need to be carried out to consider all possible combinations and/or partial combinations of all senses in a sentence. Also, the effectiveness of word sense disambiguation may be improved if rhetorical structures or morphological dependencies between words are analyzed through syntactic analysis.

• Journal of Physiology & Pathology in Korean Medicine
• /
• v.25 no.6
• /
• pp.1061-1068
• /
• 2011

Moxibustion is a treatment method for cold and pain in Korean medicine. But the systematic study of moxibustion were very few. This study was aimed to survey and evaluate moxibustion study in Korean medicine. We search the moxibustion study in journals related Korean medicine and http://oasis.kiom.re.kr. The period of the study from first issue to August, 2010. The search word were moxibustion, moxa in keyword and moxibustion treatment in title. We totally search 334 articles. But 175 articles were excluded because this study were not exactly moxibustion study, so we included and analyzed 159 articles. The study of moxibustion were 159 articles. Literature review were 35 articles, systematic review 8, heat experiment 10, in vivo or vitro 28 and survey investigation 3. Clinical articles of moxibustion related to Korean medical journals were 76. Before and after study were 31 articles, case report 20, cohort study 7, cross-sectional study 2, nonrandomized study 6, quasi randomized study 1, randomized clinical trials 9. This results showed that moxibustion study were smaller than acupuncture or herb and concentrated to pain and cold syndrome. We need further larger and diverse study of moxibustion.