• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.6
• /
• pp.485-491
• /
• 2013

Recently, with the proliferation of social network services, users and many companies hope that their information spread more faster. In order to study the information diffusion in the social networks, many algorithms such as greedy algorithm and heuristic algorithm have been proposed. However, the greedy algorithm is too complicated to use in real-life social network, and the heuristic algorithms have been studied under the uniform distribution of diffusion probability, which is different from the real social network property. In this paper, we propose an heuristic information diffusion maximization algorithm based on diffusion probability and node degree. For performance evaluation, we use real social network database, and it is verified that our proposed algorithm activates more active nodes than existing algorithms, which enables faster and wider information diffusion.

• Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
• /
• 2004.11a
• /
• pp.62-67
• /
• 2004

Many ships in voyage experience weight and buoyancy distribution change by various reasons such as change of sea water density and waves, weather condition, and consumption of fuel, provisions, etc . The weight and buoyancy distribution change can bring the ships out of allowable trim, heeling angle. In these case, the ships should adjust trim and heeling angle by shifting of liquid cargo or ballasting, deballasting of ballast tanks for recovery of initial state or for a stable voyage. But, if the adjustment is performed incorrectly, ship's safety such as longitudinal strength, intact stability, propeller immersion, wide visibility, minimum forward draft cannot be secured correctly. So it is required that the adjustment of trim and heeling angle should be planned not by human operators but by optimization computer algorithm. To make an optimized plan to adjust trim and heeling angle guaranteeing the ship's safety and quickness of process, Uk! combined mechanical analysis and optimization algorithm. The candidate algorithms for the study were heuristic algorithm, meta-heuristic algorithm and uninformed searching algorithm. These are widely used in various kinds of optimization problems. Among them, heuristic algorithm $A^\ast$ was chosen for its optimality. The $A^\ast$ algorithm is then applied for the study. Three core elements of $A^\ast$ Algorithm consists of node, operator, evaluation function were modified and redefined. And we analyzed the $A^\ast$ algorithm by considering cooperation with loading instrument installed in most ships. Finally, the algorithm has been applied to tanker ship's various conditions such as Normal Ballast Condition, Homo Design Condition, Alternate Loading Condition, Also the test results are compared and discussed to confirm the efficiency and the usefulness of the methodology developed the system.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2470-2476
• /
• 1997

We propose a new real-time search algorithm and provide experimental evaluation and comparison of the new algorithm with mini-min lookahead algorithm. Many other real-time heuristic-search approached often divide the problem space to several sub-problems. In this paper, the proposed algorithm guarantees not only the sub-problem deadline but also total deadline. Several heuristic real-time search algorithms such as $RTA^{\ast}$, SARTS and DYNORA have been proposed. The performance of such algorithms depend on the quality of their heuristic functions, because such algorithms estimate the search time based on the heuristic function. In real-world problem, however, we often fail to get an effective heuristic function beforehand. Therefore, we propose a new real-time algorithm that determines the sub-problem deadline based on the status of search space during sub-problem search process. That uses the cut-off method that is a dynamic stopping-criterion-strategy to search the sub-problem.

• Journal of Korean society of Dental Hygiene
• /
• v.19 no.4
• /
• pp.479-492
• /
• 2019

Objectives: This study aimed to develop the CAMBRA-kids application for the systematic management of dental caries among preschoolers, activate the dental caries management system, and contribute to the dental caries management of preschoolers. Methods: The collected data were analyzed using R studio 1.2.1335 for Windows (RStudio Inc., Boston, MA, USA, 2018). Algorithm evaluation, heuristic evaluation and usability evaluation were analyzed using descriptive statistics. Results: Both expert evaluations of the application's algorithms were calculated as 100%, for proficiency and efficiency. The application worked well with the designed algorithms, the risk group level of participants was categorized appropriately, and the risk management method was guided properly according to the risk group level. Of the five problems presented in the heuristic evaluation, 'the lack of security' and 'the lack of information on oral health care' received 'high severity' scores. The usability evaluation of the application produces an overall score of 3.27. In the subscales (participation, functionality, aesthetics, and information) of the Mobile App Rating Scale (MARS), the 'participation' domain received the lowest score of 2.56 and the 'functional' domain received the highest score of 3.70. Conclusions: The CAMBRA-kids application is expected to be applied and used in the field of preschoolers' oral health care management, and to contribute to the prevention of dental caries of preschoolers by activating the dental caries management system using the application.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.213-216
• /
• 1996

R'||'&'||'D project management is a process of decisions concerned with the achievement of goals of objectives. Especially, defense R'||'&'||'D project planning is the key in the successfull management of defense development. The defense project managers are constantly having to perform "what if\ulcorner" exercise, such as what if the project is extended out for an additional cost\ulcorner In this reserch, we developed a schedule-cost analysis model based upon Critical Path Method(CPM) and Venture Evaluation and Review Technique(VERT) for schedule-cost trade off analysis defense R'||'&'||'D projects. In the first step, a deterministic model is developed as a heuristic which deterministic model is developed as a heuristic which determines the schedule extension and reduction cost as a function desired schedule. In the second step, a stochastic network simulation model is developed to analyse the project risk (sucess and failure). The expected time and cost can be determined for desired schedule under the assumptions of stochastic arc data (time and cost) with a various precedence relationships. This model provides the defense R'||'&'||'D managers with an estimated and expected cost for curtailing or extending a project a given amount of time. The effectiveness and efficiency of the proposed methods, a heuristic and stochastic networks simulations, have been demonstrated through examples.

• Journal of Nutrition and Health
• /
• v.34 no.6
• /
• pp.701-714
• /
• 2001

The purpose of this study was to apply a PERT-type system, a combination of the project evaluation and review technique(PERT) and critical path method(CPM) on the employees' work time management of flood preparation, assembly, transportation and cleaning in home-delivered meals program for elderly The resources allotment heuristic program was developed by considering the number of employees and cooking utilities, being limited resources of home- delivered meals program. This program could assign the employees to perform the works included in flood preparation, assembly, transportation ind cleaning. Critical path and activities ware identified by PERT-type system on the basic of work time investigation in five senior centers. Work sheets were invented to perform the work by the shortest path with flexible employees'maximum flow As a result of the work time investigation, the most prevalent activities were ones of preparation in center C and E. Besides, the preparation(over fifty percent) was the most proportion among flood preparation, assembly, transportation and cleaning in center C and E. Critical path and activities of 'C'center were cucumber in sauce preparation path and assembly, wrapping in assembly path and case delivery in transportation path. Critical path and activities of 'E'center were Pan-fried Potato Preparation Path and assembly, case covering, wrapping in assembly Path. The work sheet invented by the heuristic program and PERT-type system reduced the work completion time and man hours in both centers.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.11
• /
• pp.2367-2372
• /
• 2009

Recently, Many studies have been progressing to path-finding adapted dynamic information on the Terminal Based Navigation System(TBNS). The algorithms proposed are based on $A^*$ algorithm. Path-finding algorithms which use heuristic function may occur a problem of the increase of exploring cost. Path-finding with an abstract graph which expresses real road network as a simple graph is proposed for reducing dependency of heuristic and exploring cost. In this paper, two abstract graph that are different method of construction, Homogeneous Node merging($AG^H$) and Connected Node Merging($AG^C$), are implemented. In result of evaluation of performance, $AG^C$ has better performance than $AG^H$ at construction cost and the number of node access but $AG^C$ has worse performance than AGH at exploring cost.

• KIPS Transactions on Software and Data Engineering
• /
• v.7 no.11
• /
• pp.411-418
• /
• 2018

With the proliferation of artificial intelligence technology, it is becoming important to obtain, store, and utilize scientific data in research and science sectors. A number of methods for extracting meaningful objects such as graphs and tables from research articles have been proposed to eventually obtain scientific data. Existing extraction methods using heuristic approaches are hardly applicable to electronic documents having heterogeneous manuscript formats because they are designed to work properly for some targeted manuscripts. This paper proposes a prototype of an object extraction system which exploits a recent deep-learning technology so as to overcome the inflexibility of the heuristic approaches. We implemented our trained model, based on the Faster R-CNN algorithm, using the Google TensorFlow Object Detection API and also composed an annotated data set from 100 research articles for training and evaluation. Finally, a performance evaluation shows that the proposed system outperforms a comparator adopting heuristic approaches by 5.2%.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1996.11a
• /
• pp.588-592
• /
• 1996

In this paper, we have constructed an expert system for semiconductor chip encapsulation which combines a knowledge-based system with CAE software. The knowledge-base module includes heuristic and pre-analysis knowledge for evaluation and redesign. Evaluation of the initial design and generation of redesign recommendations can be developed from the rules as applied to a given chip Package. The CAE programs can be used for simulating the filling and packing stage of encapsulation process. The expert system is a new tool which enables package design or process conditions with high yields and high productivity.

• Journal of Convergence Society for SMB
• /
• v.3 no.2
• /
• pp.19-25
• /
• 2013

Decision procedure was done with the evaluation of multi-criterion analysis. Importance of each criterion was considered through heuristically method, specially it was based on the heuristic least mean square algorithm. To consider coalition evaluation, it was carried out by calculation of Shapley index and Interaction value. The model output is also analyzed with the help of those two indexes, and the procedure was also displayed with details. Finally, the differences between the model output and the desired results are evaluated thoroughly, several problems are raised at the end of the example which require for further studying.