• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.4 no.4
• /
• pp.63-69
• /
• 1981

As enterprises are getting bigger and bigger and more competecious, an engineering economy for the maximization of profit based on basic theory must be considered. This thesis present dynamic computer model for the decision which controls complicated and various man- machine system optimally. This model occur in general stage can be adaptable to every kind of enterprises. So, any one who has no expert knowledge is able to get the optimal solution. And decision tree used in this paper can be applied in every kinds of academic circles as well as whole the industrial world. This paper studied optimal management of engineering project based upon basic theory of engineering economy. It introduces and functionizes the variables which generalize every possible elements, set up a model in order to find out the variable which maximize the calculated value among many other variables. And the selected values ate used as decision- marking variables for the optimal management of engineering projects. It found out some problem of this model. They are : 1. In some kinds of man-machine system it refers to Probability, but other case, it depends on only experimental probability. 2. Unless decision making process (decision tree) goes on, this model can not be applied. So these cases, this paper says, can be solved by adapting finite decision tree which is analyzed by using the same technic as those in product introduction problem. And this paper set up the computer model in order to control every procedure quickly and optimally, using Fortran IV.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.5
• /
• pp.626-631
• /
• 2005

This paper presents the target object search algorithm under dynamic programming (DP) in the Tree-type maze. We organized an experimental environment with the concatenation Y-shape diverged way, small mobile robot, and a target object. By the principle of optimality, the backbone of DP, an agent recognizes that a given whole problem can be solved if the values of the best solution of certain ancillary problem can be determined according to the principle of optimality. In experiment, we used two different control algorithms: a left-handed method and DP. Finally we verified the efficiency of DP in the practical application using a real robot.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.3
• /
• pp.73-78
• /
• 2006

Conventional caption extraction methods use the difference between frames or color segmentation methods from the whole image. Because these methods depend heavily on heuristics, we should have a priori knowledge of the captions to be extracted. Also they are difficult to implement. In this paper, we propose a method that uses little heuristic and simplified algorithm. We use topographical features of characters to extract the character points and use MST(Minimum Spanning Tree) to extract the candidate regions for captions. Character regions are determined by testing several conditions and verifying those candidate regions. Experimental results show that the candidate region extraction rate is 100%, and the character region extraction rate is 98.2%. And then we can see the results that caption area in complex images is well extracted.

• Journal of Institute of Control, Robotics and Systems
• /
• v.4 no.1
• /
• pp.123-133
• /
• 1998

In this paper, an algorithm of fault detection and diagnosis during operation of induction motors under the condition of various loads and rates is investigated. For this purpose, the spectrum pattern of input currents is used in monitoring the state of induction motors, and by clustering the spectrum pattern of input currents, the newly occurrence of spectrum patterns caused by faults are detected. For the diagnosis of the fault detected, a fuzzy fault tree is designed, and the fuzzy relation equation representing the relation between an induction motor fault and each fault type, is solved. The solution of the fuzzy relation equation shows the possibility of occurence of each fault. The results obtained are summarized as follows : (1) Using clustering algorithm by unsupervised learning, an on-line fault detection method unaffected by the characteristics of loads and rates is implemented, and the degree of dependency for experts during fault detection is reduced. (2) With the fuzzy fault tree, the fault diagnosis process become systematic and expandable to the whole system, and the diagnosis for sub-systems can be made as an object-oriented module.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.5
• /
• pp.1303-1315
• /
• 2012

In the draft of the IEEE 802.11s standard, a tree topology is established by the proactive tree-building mode of the Hybrid Wireless Mesh Protocol (HWMP). It is used for cases in which the root station (e.g., gateway) is an end point of the majority of the data connections. In the tree topology, the root or central stations (e.g., parent stations) are connected to the other stations (e.g., leaves) that are one level lower than the central station. Such mesh stations are likely to suffer heavily from contention in bottleneck links when the network has a high traffic load. Moreover, the dependence of the network on such stations is a point of vulnerability. A failure of the central station (e.g., a crash or simply going into sleep mode to save energy) can cripple the whole network in the tree topology. This causes performance degradation for end-to-end transmissions. In a connected mesh topology where the stations having two or more radio links between them are connected in such a way that if a failure subsists in any of the links, the other link could provide the redundancy to the network. We propose a scheme to utilize this characteristic by organizing the network into concentric tiers around the root mesh station. The tier structure facilitates path recovery and congestion control. The resulting mode is referred to as Tier-based Proactive Path Selection Mode (TPPSM). The performance of TPPSM is compared with the proactive tree mode of HWMP. Simulation results show that TPPSM has better performance.

• Journal of KIISE:Databases
• /
• v.34 no.3
• /
• pp.217-231
• /
• 2007

Frequent disconnection is connected directly to client's cache consistency problem in Mobile Computing environment. For solving cache consistency problem, research about Invalidation Report is studied. But, existent invalidation report structure comes with increase of size of invalidation report structure and decline of cache efficiency if quantity of data become much, or quantity of updated data increases. Also, while existent method confirms whole cache, invalidation report doesn't support selective listening. This paper proposes TTCI(Timestamp Tree-based Cache Invalidation scheme) as invalidation report structure that solve problem of these existing schemes and improve efficiency. We can make TTCI using timestamp of updated data, composing timestamp tree and list ID of data in updated order. If we utilize this, each client can confirm correct information in point that become own disconnecting and increase cache utilization ratio. Also, we can pare down client's resources consumption by selective listening using tree structure. We experimented in comparison with DRCI(Dual-Report Cache Invalidation) that is existent techniques to verify such efficiency of TTCI scheme.

• Journal of the Korean Society for Railway
• /
• v.9 no.3 s.34
• /
• pp.264-270
• /
• 2006

In this paper we present a safety plan to be applied to the development of the TCS(Train Control System). The safety plan that can be applied to the life cycle of a system, from the conceptual design to the dismantlement, shows the whole process of the paper work in detail through the establishment of a goal, analysis and assessment, the verification. In this paper we study about the making a plan, the preliminary hazard analysis, the hazard identification and analysis to guarantee the safety of the TCS. The process far the verification of the system safety is divided into several steps based on the target system and the approaching method. The guarantee of the system safety and the improvement of the system reliability is fellowed by the recommendation of the international standards.

• The Korean Journal of Quaternary Research
• /
• v.6 no.1
• /
• pp.21-32
• /
• 1992

The paleoclimate of the Chungbu Mountainous Region, Mts. Seorak and Sobaek, was estimated by means of dendroclimatic methodology, The annual growth value of tree-rings is deeply interrelated with the mean temperature of April-May and July-August. The mean temperature of April-May of the reconstruction period(1635-1911), observation period(1912-1989), and the whole period(1635-1989) is 13.58$^{\circ}C$, 13.69$^{\circ}C$, and 13.6$0^{\circ}C$, respectively. That of July-August is $24.50^{\circ}C$, $24.62^{\circ}C$, and $24.58^{\circ}C$ respectively. The reconstructed mean temperature data for April-May and for July-August reveal 13.2 and 12.9 year cycles.

• The Korean Journal of Ecology
• /
• v.19 no.3
• /
• pp.223-230
• /
• 1996

Five measurements of species diversity (richness index, diversity index, evenness index, dominance index and species sequences-importance curve) and their relationships with sltitude, tree age and community type were studied in $T\v{o}gyusan$ National Park, Korea. Altitude and tree age were the major variables explaining the differences of species diversity in the whole forest. Species richness index, diversity index and evenness index of Quercus mongolica and Pinus densiflora communities were lower than those of Carpinus laxiflora, Q. serrata, Fraxinus mandshurica, Q. mongolica - P. densiflora communities than that in the other communities. The species sequence-importance curve of the forest communities in $T\v{o}gyusan$ coincided with the ideal curve calculated by the lognormal-distribution theory.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.906-909
• /
• 2000

Conventional caption extraction methods use the difference between frames or color segmentation methods from the whole image. Because these methods depend heavily on heuristics, we should have a priori knowledge of the captions to be extracted. Also they are difficult to implement. In this paper, we propose a method that uses little heuristics and simplified algorithm. We use topographical features of characters to extract the character points and use KMST(Kruskal minimum spanning tree) to extract the candidate regions for captions. Character regions are determined by testing several conditions and verifying those candidate regions. Experimental results show that the candidate region extraction rate is 100%, and the character region extraction rate is 98.2%. And then we can see the results that caption area in complex images is well extracted.