• Journal of the Korean Society of Costume
• /
• v.63 no.6
• /
• pp.40-55
• /
• 2013

The purpose of this study was to find ways to increase sales and enhance of the competitiveness of the Korean fashion brands expanding into the Chinese market by conducting a survey of the Chinese female students in order to gather data regarding their preferences and features so that clothes that are more suitable for Chinese women can be designed. For this study, a survey was conducted to 305 students attending universities or language schools located in the metropolitan areas near Seoul who had exposure to Korean clothes. The study results can be summed up as follows: According to the analysis, the Chinese students preferred comfortable, practical, and casual styles. And the analysis shows that they prefer achromatic monotonous colors rather than vivid colors or splendid and complex patterns. The students felt that Korean clothes reflected the trends very well, and they also showed very high satisfaction with the design. The most common way of gathering information for their clothing purchase was through Internet search and magazine advertisements. The survey showed that the biggest strength of the Korean fashion brands was their ability to reflect the fast changing fashion trends in their designs, and they were very much satisfied with their diverse designs and colors. Among the domestic fashion brands, they prefer domestic SPA brands such as MIXXO, SPAO, and 8IGHT SECONDS.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.3
• /
• pp.169-180
• /
• 2015

Recently, scheduling problems with position-dependent processing times have received considerable attention in the literature, where the processing times of jobs are dependent on the processing sequences. However, they did not consider cases in which each processed job has different learning or aging ratios. This means that the actual processing time for a job can be determined not only by the processing sequence, but also by the learning/aging ratio, which can reflect the degree of processing difficulties in subsequent jobs. Motivated by these remarks, in this paper, we consider a two-agent single-machine scheduling problem with linear job-dependent position-based learning effects, where two agents compete to use a common single machine and each job has a different learning ratio. Specifically, we take into account two different objective functions for two agents: one agent minimizes the total weighted completion time, and the other restricts the makespan to less than an upper bound. After formally defining the problem by developing a mixed integer non-linear programming formulation, we devise a branch-and-bound (B&B) algorithm to give optimal solutions by developing four dominance properties based on a pairwise interchange comparison and four properties regarding the feasibility of a considered sequence. We suggest a lower bound to speed up the search procedure in the B&B algorithm by fathoming any non-prominent nodes. As this problem is at least NP-hard, we suggest efficient genetic algorithms using different methods to generate the initial population and two crossover operations. Computational results show that the proposed algorithms are efficient to obtain near-optimal solutions.

• The Bulletin of The Korean Astronomical Society
• /
• v.37 no.2
• /
• pp.82.1-82.1
• /
• 2012

GRB100205A is a Gamma Ray Burst (GRB) which is suspected to be at redshift z=11-13 due to its very red H-K color($(H-K)_{vega}=2.1{\pm}0.5$). We observed a field centered at GRB100205A with Wide Field Camera (WFCAM) at United Kingdom Infrared Telescope (UKIRT) in Hawaii, in order to search a quasar that could be located around the GRB. The images were obtained in J, H, and K filters covering a square area of $0.78deg^2$. Our J-, H-, and K-band data reach the depths of 22.5, 22.1, and 21.0 mag (Vega) at $5{\sigma}$, respectively. Also using z-band image observed by CFHT, we find 8 candidates that have colors consistent with a quasar at z=11-13(non-detection in z-, J-band and $(H-K)_{vega}$ > 1.6). However, the shallow depths of J-, H-band are not enough to verify their true nature. Instead, we identify many red objects to be old or dusty galaxies at $z{\geq}3$. The number density of such objects appears about twice or more than that of the field of Cosmological Evolution Survey (COSMOS) and Ultra Deep Survey (UDS) of UKIRT Infrared deep sky survey (UKIDSS). On scales between 0.18' and 15' the correlation function is well described by a power law with an exponent of ${\approx}-0.9$ and this implies that those objects are like galaxies. It is interesting that many red galaxies exist in the region where the GRB was detected.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.2
• /
• pp.105-111
• /
• 2020

In this paper, we propose a scheme that minimizes the energy imbalance problem of solar-powered wireless sensor network (SP-WSN) using both a mobile sink capable of wireless power transfer and an efficient clustering scheme (including cluster head election). The proposed scheme charges the cluster head using wireless power transfer from a mobile sink and mitigates the energy hotspot of the nodes nearby the head. SP-WSNs can continuously harvest energy, alleviating the energy constraints of battery-based WSN. However, if a fixed sink is used, the energy imbalance problem, which is energy consumption rate of nodes located near the sink is relatively increased, cannot be solved. Thus, recent research approaches the energy imbalance problem by using a mobile sink in SP-WSN. Meanwhile, with the development of wireless power transmission technology, a mobile sink may play a role of energy charging through wireless power transmission as well as data gathering in a WSN. Simulation results demonstrate that increase the amount of collected data by the sink using the proposed scheme.

• Korean Journal of Food Science and Technology
• /
• v.21 no.5
• /
• pp.655-661
• /
• 1989

Optimal drying conditions consisting of air temperature and relative humidity were searched by the simulation-optimization technique for minimizing quality changes in red pepper drying. Optimized drying conditions were analysed in the viewpoint of quality change kinetics and effects of control variables on the state variables. Optimal drying conditions were nearly same in both cases for carotenoid maximization and browning minimization. In two staged optimized drying, relative humidity took a lower search limit of about 10%, and air temperature in the first stage was near the lower limit of $50^{\circ}C$ and in second stage increased to a higher temperature varying with total drying time and stage changing time. Response surface analysis of time invariable drying confirmed the location of the optimal point lying on the vertex of lower limit humidity and a lowest drying temperature which ensures to attain target moisture of 0.2g water/g dry solid. Two stage drying can attain the higher objective function of quality by 3-5% than time invariable drying for shorter total drying times.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11A
• /
• pp.862-869
• /
• 2009

We propose a new adaptive K-best Sphere Decoding (SD) algorithm for Multiple Input Multiple Output (MIMO) systems where the number of survivor paths, K is changed based on the characteristics of path metrics which contain the instantaneous channel condition. In order to overcome a major drawback of Maximum Likelihood Detection (MLD) which exponentially increases the computational complexity with the number of transmit antennas, the conventional adaptive K-best SD algorithms which achieve near to MLD performance have been proposed. However, they still have redundant computation complexity since they only employ the channel fading gain as a channel condition indicator without instantaneous Signal to Noise Ratio (SNR) information. hi order to complement this drawback, the proposed algorithm use the characteristics of path metrics as a simple channel indicator. It is found that the ratio of the minimum path metric to the other path metrics reflects SNR information as well as channel fading gain. By adaptively changing K based on this ratio, the proposed algorithm more effectively reduce the computation complexity compared to the conventional K-best algorithms which achieve same performance.

• Journal of KIISE:Software and Applications
• /
• v.29 no.1_2
• /
• pp.1-9
• /
• 2002

Evolutionary artificial neural networks (EANNs) are towards the near optimal ANN using the global search of evolutionary instead of trial-and-error process. However, many real-world problems are too hard to be solved by only one ANN. Recently there has been plenty of interest on combining ANNs in the last generation to improve the performance and reliability. This paper proposes a new approach of constructing multiple ANNs which complement each other by speciation. Also, we develop a multiple ANN to combine the results in abstract, rank, and measurement levels. The experimental results on Australian credit approval data from UCI benchmark data set have shown that combining of the speciated EANNs have better recognition ability than EANNs which are not speciated, and the average error rate of 0.105 proves the superiority of the proposed EANNs.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.941-944
• /
• 2009

In this paper, we present a improved algorithm for thinning vein pattern. The vein image scanned using near infra-red is sliced in the horizontality or verticality direction, and then average value is gained from each slice image. Using curvature value changed from average value, search candidate part and extract vein pattern through re-searched candidate part in overlapping area. For the extracted vein pattern connecting, we proposed a DAL method that verify distance, angle and luminosity on pattern before tracking pattern extracted. The proposed improved thinning method is helpful for accurate connecting of vein pattern more than method used distance material in candidate part.

• ALGAE
• /
• v.36 no.3
• /
• pp.165-174
• /
• 2021

Radicilingua Papenfuss and Calonitophyllum Aregood are two small genera of the family Delesseriaceae that consist of only three and one taxonomically accepted species, respectively. The type species of these genera, Radicilingua thysanorhizans from England and Calonitophyllum medium from the Americas, are morphologically very similar, with the only recognized differences being vein size and procarp development. To date, only other two species were recognized inside the genus Radicilingua: R. adriatica and R. reptans. In this study, we analysed specimens of Radicilingua collected in the Adriatic and Ionian Sea (Mediterranean), including a syntype locality of R. adriatica (Trieste, northern Adriatic Sea), alongside material from near the type locality of R. thysanorhizans (Torpoint, Cornwall, UK). The sequences of the rbcL-5P gene fragment here produced represent the first molecular data available for the genus Radicilingua. Phylogenetic reconstruction showed that the specimens from the Adriatic and Ionian Seas were genetically distinct from the Atlantic R. thysanorhizans, even if morphologically overlapping with this species. A detailed morphological description of the Mediterranean specimens, together with an accurate literature search, suggested that they were distinct also from R. adriatica and R. reptans. For these reasons, a new species was here described to encompass the Mediterranean specimens investigated in this study: R. mediterranea Wolf, Sciuto & Sfriso. Moreover, in the rbcL-5P tree, sequences of the genera Radicilingua and Calonitophyllum grouped in a well-supported clade, distinct from the other genera of the subfamily Nitophylloideae, leading us to propose that Calonitophyllum medium should be transferred to Radicilingua.

• Journal of Astronomy and Space Sciences
• /
• v.38 no.4
• /
• pp.217-227
• /
• 2021

In this study, we describe an analytical process for designing a low Earth orbit constellation for discontinuous regional coverage, to be used for a surveillance and reconnaissance space mission. The objective of this study was to configure a satellite constellation that targeted multiple areas near the Korean Peninsula. The constellation design forms part of a discontinuous regional coverage problem with a minimum revisit time. We first introduced an optimal inclination search algorithm to calculate the orbital inclination that maximizes the geometrical coverage of single or multiple ground targets. The common ground track (CGT) constellation pattern with a repeating period of one nodal day was then used to construct the rest of the orbital elements of the constellation. Combining these results, we present an analytical design process that users can directly apply to their own situation. For Seoul, for example, 39.0° was determined as the optimal orbital inclination, and the maximum and average revisit times were 58.1 min and 27.9 min for a 20-satellite constellation, and 42.5 min and 19.7 min for a 30-satellite CGT constellation, respectively. This study also compares the revisit times of the proposed method with those of a traditional Walker-Delta constellation under three inclination conditions: optimal inclination, restricted inclination by launch trajectories from the Korean Peninsula, and inclination for the sun-synchronous orbit. A comparison showed that the CGT constellation had the shortest revisit times with a non-optimal inclination condition. The results of this analysis can serve as a reference for determining the appropriate constellation pattern for a given inclination condition.