• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.2
• /
• pp.78-88
• /
• 2009

In many face recognition problems, the number of available images is limited compared to the dimension of the input space which is usually equal to the number of pixels. This problem is called as the 'small sample size' problem and regularization methods are typically used to solve this problem in feature extraction methods such as LDA. By using regularization methods, the modified within class matrix becomes nonsingu1ar and LDA can be performed in its original form. However, in the process of adding a scaled version of the identity matrix to the original within scatter matrix, the scale factor should be set heuristically and the performance of the recognition system depends on highly the value of the scalar factor. By using the proposed resampling method, we can generate a set of images similar to but slightly different from the original image. With the increased number of images, the small sample size problem is alleviated and the classification performance increases. Unlike regularization method, the resampling method does not suffer from the heuristic setting of the parameter producing better performance.

• The KIPS Transactions:PartB
• /
• v.16B no.6
• /
• pp.463-470
• /
• 2009

In this paper, we propose the advanced fire-flame detection algorithm using camera image for better performance than previous sensors-based systems which is limited on small area. Also, previous works using camera image were depend on a lot of heuristic thresholds or required an additional computation time. To solve these problems, we use statistical values and divide image into blocks to reduce the processing time. First, from the captured image, candidate flame regions are detected by a background model and fire colored models of the fire-flame. After the probability models are formed using the change of luminance, wavelet transform and the change of motion on time axis, they are used for membership function of fuzzy logic. Finally, the result function is made by the defuzzification, and the probability value of fire-flame is estimated. The proposed system has shown better performance when it compared to Toreyin's method which perform well among existing algorithms.

• Journal of Digital Contents Society
• /
• v.15 no.5
• /
• pp.651-661
• /
• 2014

The complexity to search a specific content over TV platform is drastically increasing. Based on previous studies from computer data management system, we propose a new method that helps users to search and select content effectively. In general, contents over computers are represented by spatial metaphor, which replicates our physical environment and value systems about space. We suggest 3D lattice structure to construct information space for TV platform. Users can infer relevance between contents via special clue in information space, so as to select content more easily. Also, they can search contents through its temporal property that also represented in space. We make full use of our natural capability that can reduce additional overload to learning new interface. The results of this study can be significant and heuristic contributions, as they can be applied to diverse service areas utilizing video contents.

• Current Optics and Photonics
• /
• v.1 no.5
• /
• pp.456-467
• /
• 2017

The benefits of network coding in all-optical multicast networks have been widely demonstrated. In this paper, we mainly discuss the multicast service efficiently provisioning problem in the network coding enabled elastic optical networks (EONs). Although most research on routing and spectrum allocation (RSA) has been widely studied in the elastic optical networks (EONs), rare research studies RSA for multicast in the network coding enabled EON, especially considering the time delay constraint. We propose an efficient heuristic algorithm, called Network Coding based Multicast Capable-Multipath Routing and Spectrum Allocation (NCMC-MRSA) to solve the multipath RSA for multicast services in the network coding enabled EON. The well-known layered graph approach is utilized for NCMC-MRSA, and two request ordering strategies are utilized for multiple multicast requests. From the simulation results, we observe that the proposed algorithm NCMC-MRSA performs more efficient spectrum utilization compared with the benchmark algorithms. NCMC-MRSA utilizing the spectrum request balancing (SRB) ordering strategy shows the most efficient spectrum utilization performance among other algorithms in most test networks. Note that we also observe that the efficiency of NCMC-MRSA shows more obvious than the benchmark algorithm in large networks. We also conduct the performance comparisons of two request ordering strategies for NCMC-MRSA. Besides, we also evaluate the impact of the number of the linkdisjoint parallel w paths on the spectrum utilization performance of the proposed algorithm NCMC-MRSA. It is interesting to find that the change of the parameter w in a certain range has a significant impact on the performance of NCMC-MRSA. As the parameter w increases to a certain value, the performances of NCMC-MRSA cannot be affected by the change of w any more.

• Journal of Intelligence and Information Systems
• /
• v.13 no.4
• /
• pp.121-135
• /
• 2007

Constraint directed scheduling techniques, representing problem constraints explicitly and constructing schedules by constrained heuristic search, have been successfully applied to real world scheduling problems that require satisfying a wide variety of constraints. However, there has been little basic research on the representation and optimization of the objective value of a schedule in the constraint directed scheduling literature. In particular, the cost objective is very crucial for enterprise decision making to analyze the effects of alternative business plans not only from operational shop floor scheduling but also through strategic resource planning. This paper aims to explicitly represent and optimize the total cost of a schedule including the tardiness and inventory costs while satisfying non-relaxable constraints such as resource capacity and temporal constraints. Within the cost based scheduling framework, a cost propagation algorithm is presented to update cost information throughout temporal constraints within the same job.

• Cross-Cultural Studies
• /
• v.31
• /
• pp.95-118
• /
• 2013

Robert Frost's poetry has generally been considered fairly readable partly because of the simplicity or down-to-earth-ness of the messages that go along with the poet's projected public image and the 'traditional' forms he used. Against the grain of such general perception, this study reads some of the early poems of Robert Frost to re-characterize the beginning of the poet's career as a modernist attempt to challenge the dominant poetic conventions of the time: the genteel conventions. In reading the poems, this study focuses on frost's strategic method of using the speaker or persona regarding the delivery of meanings. Those readers who would like to find the immediate presence of Frost's voice in the poems, fail to distinguish the speaker and the poet, readily accepting the face value of what the speaker tries to convey: those messages which are in line with liberal individualism, like self-reliance, autonomous self, work ethics, etc. Frost's speakers, however, are rarely the mouthpiece of the poet himself. Rather, they are fictional characters who, while on the surface of the text appear to be hammering out a stable theme out of their everyday experience, under a heuristic scrutiny of the textual structure, turn out to be undermining the logic or the rationality of the theme, which can be identified as a modernist textual strategy that challenges the traditional conventions regarding the stability of meaning in a poetic text.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.4
• /
• pp.27-33
• /
• 2019

The min-cut problem that decides the maximum flow in a complex network flows from source(s) to sink(t) is known as a hard problem. The augmenting path algorithm divides into single path and decides the bottleneck point(edge), but the min-cut section to be decide additionally. This paper suggests O(n) time complexity heuristic greedy algorithm for the number of vertices n that applies free agent system in a pro-sports field. The free agent method assumes $N_G(S),N_G(T)$vertices among $v{\in}V{\backslash}\{s,t\}$to free agent players, and this players transfer into the team that suggest more annual income. As a result of various networks, this algorithm can be finds all of min-cut sections and min-cut value for whole cases.

• Journal of the Korea Society for Simulation
• /
• v.19 no.1
• /
• pp.73-82
• /
• 2010

Productivity improvement is considered as one of hot potato topics in international shipyards by the increasing amount of orders. In order to improve productivity of lines, shipbuilders have been researching and developing new work method, process automation, advanced planning and scheduling and so on. An optimization approach was accomplished on short-term scheduling of subassembly lines in this research. The problem of subassembly line scheduling turned out to be a non-deterministic polynomial time problem with regard to SKID pattern’s sequence and worker assignment to each station. The problem was applied by simulated annealing algorithm, one of meta-heuristic methods. The algorithm was aimed to avoid local minimum value by changing results with probability function. The optimization result was compared with discrete-event simulation's to propose what pros and cons were. This paper will help planners work on scheduling and decision-making to complete their task by evaluation.

• Journal of the Korean Society of Physical Medicine
• /
• v.18 no.3
• /
• pp.121-133
• /
• 2023

PURPOSE: Computerization using ICF as a protocol can enhance the assessment, communication, and decision-making of various disciplines and cultures, individual functions, disabilities and health to promote communication and understanding among various professionals, organizations, and countries. The empirical foundation for these propositions was provided by delineating of six distinct computerization components. METHODS: This study analyzed 14 papers that combined the medical field and information technology to activate the ICF through computerization. From each of these papers, distinctive advantages were extracted to propose six computerization elements. The validity of these computerization elements was examined. These papers encompass various computerization elements, among which core elements were identified. In particular, six common core elements were extracted from these papers and assumed to be strategic computerization components for ICF activation. A heuristic methodology was employed to validate these components, representing IT technology maturity using four determining indices, which were then presented graphically for validation attempts. RESULTS: Four quantified indices were defined: reliability, cost-effectiveness, support and updates, and collaboration. Using these indices, this study identified elements that leverage existing IT technologies and require new development. The possibility of increasing utility was identified by applying computerization to ICF. CONCLUSION: This study examined the strategic elements of utilizing ICF by computerizing it using a protocol concept and discussed its potential for utilization. The potential to enhance the value of information in social, physical, and cultural contexts was presented by integrating various domains and data within the ICF framework.

• Journal of Creative Information Culture
• /
• v.5 no.3
• /
• pp.329-343
• /
• 2019

This study designed, developed and evaluated an application to improve the social skills of students with Autism Spectrum Disorders(ASD) based on the stage of the ADDIE model. The design stage aimed to factor in the characteristics and needs of students with ASD, and created guide maps and story boards accordingly. In the development stage, the application was made through a total of fourteen processes and four official tests. In the evaluation stage, heuristic usability evaluation was conducted on 10 teachers based on the their experience of using the application in the implementation stage. The results of the evaluation were all close to 'very good' in the areas of educational value, content implementation technology, content information and convenience. Finally, the application was fully developed after reflecting the corrections in accordance with the result of the usability evaluation. It is expected that this study have a role in invigorating the development of special educational software content.