• The KIPS Transactions:PartB
• /
• v.11B no.2
• /
• pp.227-232
• /
• 2004

When we extract a representative term from text for information retrieval system or a special information for information retrieval and text milling system, we often need to solve the anaphora resolution problem. The antecedent decision problem of a pronoun is one of the major issues for anaphora resolution. In this paper, we are suggesting a method of deciding an antecedent of the third personal pronouns, such as “he/she/they” to analyze the contents of documents precisely. Generally, the antecedent of the third personal Pronouns seem to be the subject of the current statement or previous statement, and also it occasionally happens more than twice. Based on these characteristics, we have found rules for deciding an antecedent, by investigating a case of being an antecedent from the personal pronouns, which appears in the current statement and the previous statements. Since the heuristic rule differs on the case of the third personal pronouns, we described it as subjective case, objective case, and possessive case based on the case of the pronouns. We collected 300 sentences that include a pronoun from the newspaper articles on political issues. The result of our experiment shows that the recall and precision ratio on deciding the antecedent of the third personal pronouns are 79.0% and 86.8%, respectively.

• Journal of Intelligence and Information Systems
• /
• v.14 no.1
• /
• pp.117-129
• /
• 2008

The cost-based scheduling work has been done in both the Operations Research (OR) and Artificial Intelligence (AI) literature. To deal with more realistic problems, AI-based heuristic scheduling approach with non-regular performance measures has been studied. However, there has been little research effort to develop a full inter-job cost propagation algorithm (CPA) for different jobs having multiple downstream and upstream activities. Without such a CPA, decision-making in scheduling heuristics relies upon local, incomplete cost information, resulting in poor schedule performance from the overall cost minimizing objective. For such a purpose, we need two types of CPAs : intra-job CPA and inter-job CPA. Whenever there is a change in cost information of an activity in a job in the process of scheduling, the intra-job CPA updates cost curves of other activities connected through temporal constraints within the same job. The inter-job CPA extends cost propagation into other jobs connected through precedence relationships. By utilizing the cost information provided by CPAs, we propose cost-based scheduling heuristics that attempt to minimize the total schedule cost. This paper develops inter-job CPAs that create and update cost curves of each activity in each search state, and propagate cost information throughout a whole network of temporal constraints. Also we propose various cost-based scheduling heuristics that attempt to minimize the total schedule cost by utilizing the cost propagation algorithm.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.5
• /
• pp.305-315
• /
• 2016

Due to the change from small volume production to small quantity batch production systems, individual companies have been attempting to produce a wide range of operating strategies, maximize their productivity, and minimize their WIP level by operating with the proper cycle time to defend their market share. In particular, using a complex workflow and process sequence in the manufacturing line has some drawbacks when it comes to designing the production strategy by applying analytical models, such as mathematical models and queueing theory. For this purpose, this paper uses three heuristic algorithms to solve the job release problem at the bottleneck workstation, product mix problem in multi-purpose machine(s), and batch size and sequence in batch machine(s). To verify the effectiveness of the proposed methods, a simulation analysis was performed. The experimental results demonstrated that the combined application of the proposed methods showed positive effects on the reduction of the cycle time and WIP level, and improvement of the throughput.

• Journal of Korean Society of Steel Construction
• /
• v.18 no.2
• /
• pp.213-223
• /
• 2006

Conventional truss optimization approaches, while often sophisticated and computationally intensive, have been applied to simple, minimum weight-cost models. These approaches do not perform well when applied to real-world trusses, which have costmodels that are complex and which often involve multiple objectives. Thus, this paper describes the optimization strategies that a clustering technique, which identifies members that are likely to have the same product type, uses for the optimal design of truss structures with real- world cost functions that consider the costs on the weight of the truss, the number of products in the design, the number of joints in the structures, and the costs required in the site.At first, the clustering technique is applied to identify the members and to generate a proper initial solution. A simple taboo search technique is then used, which attempts to generate the optimal solution by starting with the solution from the previous technique. For example, the proposed approach is a plied to a typical problem and to a problem similar to relative performances. The results show that this algorithm generates not only better-quality solutions but also more efficient ones

• Korea journal of population studies
• /
• v.31 no.3
• /
• pp.27-55
• /
• 2008

This paper tries to introduce most recent trends of Korean family policies during Roh, Moo Hyun Government of March 2003-February 2008. Focusing on the gender perspectives, discussions are, for heuristic purposes, centered around three major family issues in S. Korea, one of the most dynamically changing societies in the world: 1) the abolishment of male-centered traditional Family Registry System('the hoju') and the launching of brand-new Family Record Book of five different versions for individual from January 2008; 2) the application of Framework Act On Healthy Homes, a first formal measure to step in various forms of family break-ups these days; and 3) the emergence of Multi-Cultural Family Protection Act, thanks to a massive volume of international marriage migrants from overseas. It can be said that all these family policies are the result of rapidly changing socio-demographic trends into an aging society since 1990s. These trends include late/no marriage with low birth rates, high divorce(and thus remarriage) rates, breakdown of male-breadwinner family model and increase of dual-income family, and a sudden increment of international marriage particularly in rural areas. All in all, overall trends of Korean family life these days that have been taking place so far would provide an excellent exemplary how to deal with an unprecedented societal challenges with the brand-new family policies.

• Journal of Korea Multimedia Society
• /
• v.14 no.5
• /
• pp.658-668
• /
• 2011

Over the past decade, the improvement of communications technologies and the rapid spread of www (World Wide Web) have brought on the exponential growth of users using Internet and real time multimedia multicast services like video conferencing, tele-immersive virtual reality, and Internet games. The dense-wavelength division multiplexing (DWDM) networks have been widely accepted as a promising approach to meet the ever-increasing bandwidth demands of Internet users, especially in next generation Internet backbone networks for nation-wide or global coverage. A major challenge in the next generation Internet backbone networks based on DWDM technologies is the resolution of the multicasting RWA (Routing and Wavelength Assignment) problem; given a set of wavelengths in the DWDM network, we set up light-paths by routing and assigning a wavelength for each connection so that the multicast connections are set-upped as many as possible. Finding such optimal multicast connections has been proven to be Non-deterministic Polynomial-time-complete. In this paper, we suggest a new heuristic multicast routing and wavelength assignment method for multicast sessions called DVS-PMIPMR (Differentiated Virtual Source-based Priority Minimum Interference Path Multicast Routing algorithm). We measured the performance of the proposed algorithm in terms of number of wavelength and wavelength channel. The simulation results demonstrate that DVS-PMIPMR algorithm is superior to previous multicast routing algorithms.

• The KIPS Transactions:PartB
• /
• v.17B no.3
• /
• pp.255-262
• /
• 2010

When a system is developed, requirements document is generated by requirement analysts and then translated to formal specifications by specifiers. If a formal specification can be generated automatically from a natural language requirements document, system development cost and system fault from experts' misunderstanding will be decreased. A pronoun can be classified in personal and demonstrative pronoun. In the characteristics of requirements document, the personal pronouns are almost not occurred, so we focused on the decision of antecedent for a demonstrative pronoun. For the higher accuracy in analysis of requirements document automatically, finding antecedent of demonstrative pronoun is very important for elicitation of formal requirements automatically from natural language requirements document via natural language processing. The final goal of this research is to automatically generate formal specifications from natural language requirements document. For this, this paper, based on previous research [3], proposes an anaphora resolution system to decide antecedent of pronoun using natural language processing from natural language requirements document in Korean. This paper proposes heuristic rules for the system implementation. By experiments, we got 92.45%, 69.98% as recall and precision respectively with ten requirements documents.

• The KIPS Transactions:PartD
• /
• v.16D no.1
• /
• pp.113-122
• /
• 2009

Since the traditional pattern mining methods only probe unspecified moving patterns that seem to satisfy users' requests among diverse patterns within the limited scopes of time and space, they are not applicable to problems involving the mining of optimal moving patterns, which contain complex time and space constraints, such as 1) searching the optimal path between two specific points, and 2) scheduling a path within the specified time. Therefore, in this paper, we illustrate some problems on mining the optimal moving patterns with complex time and space constraints from a vast set of historical data of numerous moving objects, and suggest a new moving pattern mining method that can be used to search patterns of an optimal moving path as a location-based service. The proposed method, which determines the optimal path(most frequently used path) using pattern frequency retrieved from historical data of moving objects between two specific points, can efficiently carry out pattern mining tasks using by space generalization at the minimum level on the moving object's location attribute in consideration of topological relationship between the object's location and spatial scope. Testing the efficiency of this algorithm was done by comparing the operation processing time with Dijkstra algorithm and $A^*$ algorithm which are generally used for searching the optimal path. As a result, although there were some differences according to heuristic weight on $A^*$ algorithm, it showed that the proposed method is more efficient than the other methods mentioned.

• Journal of Internet Computing and Services
• /
• v.22 no.1
• /
• pp.31-39
• /
• 2021

Obtaining delivery addresses from calls is one of the most important processes in TV home shopping business. By automating this process, the operational efficiency of TV home shopping can be increased. In this paper, a method of recognizing and validating road name address, which is the address system of South Korea, from speech oriented text is proposed. The speech oriented text has three challenges. The first is that the numbers are represented in the form of pronunciation. The second is that the recorded address has noises that are made from repeated pronunciation of the same address, or unordered address. The third is that the readability of the resulted address. For resolving these problems, the proposed method enhances the existing address databases provided by the Korea Post and Ministry of the Interior and Safety. Various types of pronouncing address are added, and heuristic rules for dividing ambiguous pronunciations are employed. And the processed address is validated by checking the existence in the official address database. Even though, this proposed method is for the STT result of the address pronunciation, this also can be used for any 3^rd party services that need to validate road name address. The proposed method works robustly on noises such as positions change or omission of elements.

• Korea Science and Art Forum
• /
• v.37 no.2
• /
• pp.35-46
• /
• 2019

The purpose of this study was to develop a hybrid model forecasting the optimal number of employees for the hotel MICE and investigate indicators' reliability and validity empirically. The dominant approach of manpower planning has long been conducted based on heuristic experience in the field of Hotel and MICE. There is little research on the manpower planning and forecasting in the hotel and MICE studies. However, it is significantly important to ensure how many the optimal number of employees are calculated to meet the goals of the company as well as the expectation of their customers. A focus group interview was used to collect data through a series of surveys. A total of 289 samples were collected to test validity of finalized indicators for forecasting the optimal number of employees for the Hotel MICE. The study developed 15 quantitative indicators and 19 qualitative indicators to forecasting the optimal number of employees for the Hotel MICE, based on three types of groups such as 'service-oriented', 'stability-oriented', and 'profitability-oriented' hotel company The study revealed the econometrics formula for the practical application for this field.