• Journal of the Korean Society of Clothing and Textiles
• /
• v.43 no.3
• /
• pp.440-458
• /
• 2019

Based on a 3D body data and pattern comparison analysis, this study developed a formal jacket pattern for men in their late 30s. In order to select the representative type of men in their late 30s, factor analysis and cluster analysis were conducted on data form 319 men, 35 to 39 years old using the anthropometric data from The 7th Size Korea (2015) as the representative body type. The surface of the body surface was developed using a 3D human shape of a male in his 30s in The 6th Size Korea (2010). Then the shape was changed to a flat pattern that confirmed the necessary elements for setting the shape and dimension. Cluster analysis revealed type B as the representative type because it showed the best shape characteristics for men in the late 30s. The drafting method of the final research pattern is as follows. Jacket length: stature/2.5cm, back length: stature/5+8.5cm (constant)], armhole depth: [stature/ 7-1.5cm (constant)], back width: [C/9+9.5cm (constant)]+1cm (ease), front width: [C/9+8.5cm (constant)]+1cm (ease), armscye depth: C/8, front waist darts: 1cm, front closure amount: 2cm.

• Bulletin of the Korean Chemical Society
• /
• v.33 no.3
• /
• pp.869-880
• /
• 2012

Identification of the selective chemical features for Aurora-B inhibitors gained much attraction in drug discovery for the treatment of cancer. Hence to identify the Aurora-B critical features various techniques were utilized such as pharmacophore generation, virtual screening, homology modeling, molecular dynamics, and docking. Top ten hypotheses were generated for Aurora-B and Aurora-A. Among ten hypotheses, HypoB1 and HypoA1 were selected as a best hypothesis for Aurora-B and Aurora-A based on cluster analysis and ranking score, respectively. Test set result revealed that ring aromatic (RA) group in HypoB1 plays an essential role in differentiates Aurora-B from Aurora-A inhibitors. Hence, HypoB1 used as 3D query in virtual screening of databases and the hits were sorted out by applying drug-like properties and molecular docking. The molecular docking result revealed that 15 hits have shown strong hydrogen bond interactions with Ala157, Glu155, and Lys106. Hence, we proposed that HypoB1 might be a reasonable hypothesis to retrieve the structurally diverse and selective leads from various databases to inhibit Aurora-B.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.6B
• /
• pp.1113-1122
• /
• 1999

In this paper, we propose MSS(Multicast Synchronization Server) and QCS(QoS Conversion Server) models that can support IP multicast and QoS(Quality of Service) over the ATM network more efficiently. In the MSS model, it is possible to establish shortcut VCs(Virtual Circuits) among all hosts in the ATM network and to transfer multicast data at high speed. Also the MSS model is more scalable, because the number of inter-cluster VCs needed in the MSS model is less than that of EARTH. In the QCS model, ATM switch is modified to support one QoS service and best effort service through the one point-to-multipoint VC at the same time so required network resources are reduced, and dedicated server is used for QoS conversion to accept heterogeneous receivers more efficiently. In this Paper, the proposed MSS model and QCS model have solved both efficiency problem and scalability problem. It is proved through the comparison of the VCs required in each model.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.1
• /
• pp.204-226
• /
• 2018

Big data processing applications have been migrated into cloud gradually, due to the advantages of cloud computing. Hadoop Distributed File System (HDFS) is one of the fundamental support systems for big data processing on MapReduce-like frameworks, such as Hadoop and Spark. Since HDFS is not aware of the co-location of virtual machines in the cloud, the default scheme of block allocation in HDFS does not fit well in the cloud environments behaving in two aspects: data reliability loss and performance degradation. In this paper, we present a novel location-aware data block allocation strategy (LDBAS). LDBAS jointly optimizes data reliability and performance for upper-layer applications by allocating data blocks according to the locations and different processing capacities of virtual nodes in the cloud. We apply LDBAS to two stages of data allocation of HDFS in the cloud (the initial data allocation and data recovery), and design the corresponding algorithms. Finally, we implement LDBAS into an actual Hadoop cluster and evaluate the performance with the benchmark suite BigDataBench. The experimental results show that LDBAS can guarantee the designed data reliability while reducing the job execution time of the I/O-intensive applications in Hadoop by 8.9% on average and up to 11.2% compared with the original Hadoop in the cloud.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.7
• /
• pp.1524-1531
• /
• 2004

This study analyzes a load balancing technique using Round Robin Algorithm. The study uses two software packages (Packet Capture and Round Robin Test Package) to check packet volume from Virtual Network structure (data generator, virtual server, Server1,2,3), and finds out traffic distribution toward Server1,2 and 3. The functions of implemented Round Robin Load Balancing Monitoring System include round robin testing, system monitoring, and graphical indication of data transmission and packet volume. As the result of the study shows, Round Robin Algorithm allows servers to ensure definite traffic distribution, unless incoming data loads differ much. Although error levels are high in some cases, they were eventually alleviated by repeated tests for a long period of time.

• Fashion & Textile Research Journal
• /
• v.23 no.5
• /
• pp.667-673
• /
• 2021

The purpose of this study was to obtain drape information and objective texture of fabrics easily and quickly by using a constructed fabric database. For the construction of the fabric database, 287 woven fabrics were examined by using the CLO fabric kit, KES-FB system, and drape test system. The k-means cluster analysis method was used to classify the fabrics into 7 grades. After correlation analysis of the fabric properties for each experiment, similar properties of the CLO fabric kit and KES-FB system were chosen, which were then designed to extract similar fabrics from the database. It was confirmed that inferring the drape information and objective hand feeling of fabrics was to some extent possible by extracting similar fabrics from the database. In this study, the primary hand and total hand value(THV) of KES-FB system, which was constructed by Kawabata and other experiments, were used to quantify the objective hand feeling, because they are the most widely used. However, these standards can be changed over time; in order to be applied within the clothing industry, these standards may have to be changed to some extent. Moreover, it is notable that although objective hand feeling cannot be expressed in the 3D virtual costume program, it can be easily derived from the constructed database. Additionally, it is expected that the existing 3D virtual costume program will express the costumes more realistically by improving these results.

• The Journal of Korean Institute of Next Generation Computing
• /
• v.14 no.5
• /
• pp.60-70
• /
• 2018

A software defined storage (SDS) is being deployed in cloud environment to allow multiple users to virtualize physical servers, but a solution for optimizing space efficiency with limited physical resources is needed. In the conventional data deduplication system, it is difficult to deduplicate redundant data uploaded to distributed storages. In this paper, we propose a distributed deduplication method using similarity-based clustering and multi-layer bloom filter. Rabin hash is applied to determine the degree of similarity between virtual machine servers and cluster similar virtual machines. Therefore, it improves the performance compared to deduplication efficiency for individual storage nodes. In addition, a multi-layer bloom filter incorporated into the deduplication process to shorten processing time by reducing the number of the false positives. Experimental results show that the proposed method improves the deduplication ratio by 9% compared to deduplication method using IP address based clusters without any difference in processing time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.4
• /
• pp.741-762
• /
• 2011

Recently, multicast routing protocols become increasingly important aspect in Mobile Ad hoc Networks (MANETs), as they effectively manage group communications. Meanwhile, multimedia and real-time applications are becoming essential need for users of MANET. Thus it is necessary to design efficient and effective Quality of Service (QoS) multicast routing strategies. In this paper, we address the scalability problem of multicast routing protocols to support QoS over MANETs. In particular, we introduce a Position-Based QoS Multicast Routing Protocol (PBQMRP). Basically, the protocol based on dividing the network area into virtual hexagonal cells. Then, the location information is exploited to perform efficient and scalable route discovery. In comparison with other existing QoS multicast routing protocols, PBQMRP incurs less control packets by eliminating network flooding behavior. Through simulation, the efficiency and scalability of PBQMRP are evaluated and compared with the well-known On-Demand Multicast Routing Protocol (ODMRP). Simulation results justify that our protocol has better performance, less control overhead and higher scalability.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.35 no.1
• /
• pp.101-106
• /
• 2012

Ship handling simulator is a virtual ship navigating system with three dimensional screen system and simulation programs. FTS simulation can produce theoretically infinite experiment tests without time constraint, but which results in collecting determinstic observations. RTS simulation can collect statistical observations but has disadvantage of spending at least 30 minutes for a single experiment. The previous studies suggested that the number of experiment conditions to be tested could be reduced to obtain random data with RTS simulation by focusing on highly difficult experiment condition for ship handling. It has the limitation of not estimating the distribution of ship handling difficulty for the route. In this paper, similarity and clustering analysis are suggested for reduction methodology of experiment conditions. Similarity of experiment conditions are measured as follows: euclidean distance of ship handling difficulty index and correlation matrix of distance differences from the designed route. Clustering analysis and multi-dimensional scaling are applied to classify experiment conditions with measured similarity into reducing the number of RTS simulation conditions. An empirical result on Dangin harbor is shown and discussed.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.6
• /
• pp.1052-1059
• /
• 2016

Video-on-Demand(VoD) is one of the most popular media streaming which attracted many researchers' attention. VMesh is one of the most cited works in the field of the VoD system. VMesh is proposed to solve the problem of random seeking functionality. However, a large number of the DHT(Distributed Hash Table) searches in VMesh is sill the main problem which needs to be solved. In order to reduce the number of the DHT searches, the clustered segment index(CSI) scheme is proposed. In this scheme, the video segments are divided into clusters. The segment information of the video segments, which are clustered into the same cluster, are stored in the same clustered segment index that can be searched by using the hash key. Each peer also can request the required segments by using this clustered segment index. The experiment results show that the number of the DHT searches in the proposed scheme is less than that of VMesh even in case of peers leave and join the network or peers perform the fast forward/backward operations.