• Progress in Medical Physics
• /
• v.21 no.1
• /
• pp.99-112
• /
• 2010

In Republic of Korea, there are many Quality Assurance protocol for general radiation treatment machine such as linac. However, Quality Assurance protocol for radiosurgery treatment system is not ready perfectly. One of the radiation treatment machine for radiosurgery, novalis system needs to suitable Quality Assurance protocol for using it right way during radiation treatment and maintaining suitable accuracy for daily, weekly, monthly and annually periods. Therefore, in this article, we develop Quality Assurance protocol for novalis system. We collected and analysed domestic and foreign novalis Quality Assurance protocol. After that, we selected essential QA items and each tolerance range for developing proper QA protocol, and we made anatomical phantom for execution of selected QA items and evaluation of overall state of QA, and then, we use this measured value as a reference. Quality Assurance items are consisted of Mechanical accuracy QA part and Radiation delivery QA part. Mechanical accuracy QA part is comprised of radiation generation machine part, assistive devices part and multi-leaf collimator part. Radiation delivery QA part is divided into radiation isocenter accuracy and dosimetric evaluation. After that, developed novalis QA tables are made by using these QA items. These novalis QA tables would be used to good standard in order to maintain apt accuracy for radiosurgery in daily, weekly, monthly and annually periods.

• Journal of Korean Society for Quality Management
• /
• v.18 no.2
• /
• pp.93-99
• /
• 1990

This paper considers the selection of process plans for a flexible manufacturing machine. Most of the planning models for the automated manufacturing systems are based on the assumption that for each part there is only one process plan available. This paper considers that for each part a number of different process plans are available, each of which may require specific types of tools. If the requisite tools are not on the machine, one or more tool switches must occur before the process plan can be processed. This paper develops an optimal algorithm of branch and bound method for the selection of process plans to minimize the number of tool switches.

• Journal of Mechanical Science and Technology
• /
• v.18 no.8
• /
• pp.1358-1367
• /
• 2004

As a part II of theis research, new local inspection planning strategy is proposed in this paper based on the proposed inspection feature extraction method. In the local inspection planning stage, each feature is decomposed into its constituent geometric elements for more effective inspection planning. The local inspection planning for the decomposed features are performed to determine: (1) the suitable number of measuring points, (2) their locations, and (3) the optimum probing paths to minimize measuring errors and times. The fuzzy set theory, the Hammersley's algorithm and the TSP method are applied for the local inspection planning. Also, a new collision checking algorithm is proposed for the probe and/or probe holder based on the Z-map concept. Finally, the results are simulated and analyzed to verify the effectiveness of the proposed methods.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.12 no.3
• /
• pp.45-51
• /
• 2003

Milling process has beer used in aircraft, auto-component and mold industries widely. They need more accurate and precise parts to improve the performance and quality of their products. So, the geometrical form accuracy of the workpiece surface generated by this process is getting more and more important. Generally, the form accuracy is affected by machine conditions, cutting conditions, tool geometry, tool deflection by cutting force and tool path md so on. Even though they are controlled as perfect conditions, it is easily found that there is a line along the axis of a cylindrically milled part. It is presumed that the tool approaching causes this error on milled surface. Thus, the study for investigating the effect of the tool approaching path on the cylindrical surface geometry of the end-milled part is carried out.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.12 no.1
• /
• pp.84-91
• /
• 2003

The equipment of textiles let off is a part of inspection machine which inspects finished textiles and it checks up textiles through that. This study suggests a method to select the capacity and initial gas pressure of accumulator to control surge rising pressure occurring when suddenly braking action to a desired degree. An accumulator in hydraulic systems is by hydraulic machinery which stores kinetic energy of inertia body during braking. A series of computer simulations were done for the brake action The results of the simulation work were compared with those of experiments.

• Proceedings of the Safety Management and Science Conference
• /
• 2001.05a
• /
• pp.195-198
• /
• 2001

This paper addresses the problem of placing tools in a tool magazine with random-select capability on a flexible machine. The tool placement problem could be a significant portion of the total processing time. It is assumed that the total number of tools required to process a set of parts exceeds the available magazine capacity, and so tool switches may occur between two adjacent parts in a given part sequence. Two heuristics are presented so as to minimize the total travel distance of the tool magazine before the completion of all parts.

• IE interfaces
• /
• v.15 no.4
• /
• pp.338-348
• /
• 2002

In this paper, we present a restricted tabu search(RTS) algorithm that schedules jobs on identical parallel machines in order to minimize the maximum lateness of jobs. Jobs have release times and due dates. Also, sequence-dependent setup times exist between jobs. The RTS algorithm consists of two main parts. The first part is the MATCS(Modified Apparent Tardiness Cost with Setups) rule that provides an efficient initial schedule for the RTS. The second part is a search heuristic that employs a restricted neighborhood generation scheme with the elimination of non-efficient job moves in finding the best neighborhood schedule. The search heuristic reduces the tabu search effort greatly while obtaining the final schedules of good quality. The experimental results show that the proposed algorithm gives better solutions quickly than the existing heuristic algorithms such as the RHP(Rolling Horizon Procedure) heuristic, the basic tabu search, and simulated annealing.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.10a
• /
• pp.716-719
• /
• 1995

Although design process is a creative work, it includes a lot of iterations. Statistics show that about 15 to 40 percent of the total design activity is spent on time-consuming retrieval of technical informations such as standard part, handbook, engineering equation,previous design and so on. On the other hand, product structure and parts specifications change with the design process, which also need to be traced accordingly. The BOM, design history, and all the relecant technical informations can be managed can be efficiently within a unified framework called configuration. This paper presents a prototype of a configuration manager which is a part of the engineering data management system for machine tools.

• Korean Management Science Review
• /
• v.12 no.2
• /
• pp.105-127
• /
• 1995

This paper solves different machine-part group formation (MPGF) problems using genetic algorithms to demonstrate that it can be a new robust alternative to the conventional heuristic approaches for optimization problems. We first give an overview of genetic algorithms: Its principle, various considerations required for its implementation, and the method for setting up parameter values are explained. Then, we describe the MPGF problem which are critical to the successful operation of cellular manufacturing or flexible manufacturing systems. We concentrate on three models of the MPGF problems whose forms of the objective function and/or constraints are quite different from each other. Finally, numerical examples of each of the models descibed above are solved by using genetic algorithms. The result shows that the solutions derived by genetic algorithms are comparable to those obtained through problem-specific heuristic methods.

• Korean Journal of Cognitive Science
• /
• v.1 no.2
• /
• pp.255-257
• /
• 1989

This paper proposes a method for extracting the imformation of aspect and modality from the predicative part which is consisted of main verbal and auxiiary verbals.Data which are expressed by the compound predicate with many consecutive verbals are collected and analyzed to thirty-six structual forms of the predicative part.Inthe final analysis, an extracting function of conceptual information is derived to find the connoted aspect and modality in each structure.The informations which are obtained by this function decrease the individual ambiguity of an auxiliary verbal and offer a detailed meaning inthe syntactic and semantic analysis of machine translation system or inference machine.