• Journal of the Korea Furniture Society
• /
• v.20 no.4
• /
• pp.262-273
• /
• 2009

An investigation was conducted to know a prospect of woody toy in Korea for physical, psychological and intellectual development. It was told that toys that stimulate cognitive development are appropriate for the child's capabilities, responsive to the child's movements, provide feedback when manipulated, and require imagination or fantasy. Toys particularly useful in the development of these abilities include dolls, figures, cuddly toys, puppets, costumes, and construction toys. Therefore, a toy is a wonderful object, indispensable to physical, psychological and intellectual development, both for those who have the capacity to integrate into society and for those who encounter difficulties. If we can replace a plastic toys by a environmental wooden toys, we can contribute to child development that is especially to promote creativity, artistic, problem-solving, language and social skills. In addition, we can support the ability of wood toy manufacturers to market their products in a responsible way and contribute to strengthen the competitiveness of our commodities on international markets.

• Journal of the Korea Furniture Society
• /
• v.21 no.3
• /
• pp.229-236
• /
• 2010

Wood material is positive with the concept of eco-friendly materials. Wood toy preference of foreign brands is also a real problem. Therefore, in this domestic situation on Toys Brand Development, there are many problems yet to be solved. At First, a wood material for toys requires the development of more sophisticated and precision materials. Second, new content, product development and training program development of the toys are needed. Characters and content development time and effort should be invested. In present, Korean brand development of wood toy with educational effects is very important issues as the use of wood to match the low carbon & green growth.

• Journal of applied mathematics & informatics
• /
• v.8 no.1
• /
• pp.181-197
• /
• 2001

A heuristic method TABU-CSP using Tabu Search (TS) is described for solving Constraint Satisfaction Problems (CSPs). The method is started with a complete but inconsistent solution of a binary CSP and obtained in prespecified number of iterations either a consistent solution or a near optimal solution with an acceptable number of conflicts. The repair in the solution at each iterative step is done by using two heuristics alternatively. The first heuristic is a min-conflicts heuristic that chooses a variable with the maximum number of conflicts and reassigns it the value which leads to the minimum number of conflicts. If the acceptable solution is not reached after the search continued for a certain number of iterations, the min-conflict heuristic is changed and the variable selected least number of times is chosen for repair. If an acceptable solution is not reached, the method switches back to the min-conflict heuristic and proceeds further. This allowed the method to explore a different region of search space space for the solution as well as to prevent cycling. The demonstration of the method is shown on a toy problem [9]which has no solution. The method is then tested on various randomly generated CSPs with different starting solutions. The performance of the proposed method in terms of the average number of consistency is checked and the average number of conflicts is conflicts is compared with that of the Branch and Bound(BB) method used to obtain the same solution. In almost all cases, the proposed method moves faster to the acceptable solution than BB.

• Journal of Distribution Science
• /
• v.16 no.2
• /
• pp.19-24
• /
• 2018

Purpose - Drone delivery is expected to revolutionize the supply chain industry. This paper aims to introduce a collaborative parcel delivery problem by truck and drone (hereinafter called "TDRP") and propose a novel heuristic method to solve the problem. Research design, data, and methodology - To show the effectiveness of collaborative delivery by truck and drone, we generate a toy problem composed of 9 customers and the speed of drone is assumed to be two times faster than truck. We compared the delivery completion times by 'truck only' case and 'truck and drone' case by solving the optimization problem respectively. Results - We provide literature reviews for truck and drone routing problem for collaborative delivery and propose a novel and original heuristic method to solve the problem with numerical example. By numerical example, collaborative delivery is expected to reduce delivery completion time by 12~33% than 'truck only' case. Conclusions - In this paper, we introduce the TDRP in order for collaborative delivery to be effective and propose a novel and original heuristic method to solve the problem. The results of research will be help to develop effective heuristic solution and optimize the parcel delivery by using drone.

• Journal of the Korean Academy of Child and Adolescent Psychiatry
• /
• v.6 no.1
• /
• pp.109-115
• /
• 1995

The main purpose of this study was to treat pica in a 2.8 year old child with severe mental retardation along with autistic tendencies. His developmental age ranged from 12 to 15 month on the DDST and he had no means of communication. He was on Tegretol 200mg for seizure control. His pica involved thumb sucking, putting toys into his mouth, and licking furniture wherever he went Besides pica, he had a rumination problem. The treatment strategies for his pica consisted of two phases : In phase 1, The child was taught toy play through a 3-step guided compliance training, while his pica and rumination behaviors were recorded to investigate whether active toy play could effect any change in the untreated pica and rumination behaviors of this child. In phase 2, a facial screening was used as a means to control his pica, while his rumination was recorded to see whether controlling his pica could bring any change in the untreated ruminating behavior. The results showed that the facial screening was very effective in decreasing his pica from an average of 18.6 times per 15 minute in the baseline to 2.3 times post-treatment. Response covariation was observed across pica and rumination while toy play compliance training alone was being conducted, and covariation across rumination was observed while pica alone was being treated with facial screening.

• Journal of KIISE:Software and Applications
• /
• v.31 no.3
• /
• pp.361-368
• /
• 2004

The purpose of this study is to propose a new on-line nonlinear PCA(OL-NPCA) method for a nonlinear feature extraction from the incremental data. Kernel PCA(KPCA) is widely used for nonlinear feature extraction, however, it has been pointed out that KPCA has the following problems. First, applying KPCA to N patterns requires storing and finding the eigenvectors of a N${\times}$N kernel matrix, which is infeasible for a large number of data N. Second problem is that in order to update the eigenvectors with an another data, the whole eigenspace should be recomputed. OL-NPCA overcomes these problems by incremental eigenspace update method with a feature mapping function. According to the experimental results, which comes from applying OL-NPCA to a toy and a large data problem, OL-NPCA shows following advantages. First, OL-NPCA is more efficient in memory requirement than KPCA. Second advantage is that OL-NPCA is comparable in performance to KPCA. Furthermore, performance of OL-NPCA can be easily improved by re-learning the data.

• Journal of Korean Society of Transportation
• /
• v.20 no.6
• /
• pp.99-113
• /
• 2002

The multi-class traffic assignment problem is the most typical one of the multi-solution traffic assignment problems and, recently formulation of the models and the solution algorithm have been received a great deal of attention. The useful solution algorithm, however, has not been proposed while formulation of the multi-class traffic assignment could be performed by adopting the variational inequality problem or the fixed point problem. In this research, we developed a hybrid solution algorithm which combines GA algorithm, diagonal algorithm and clustering algorithm for the multi-class traffic assignment formulated as a variational inequality Problem. GA algorithm and clustering algorithm are introduced for the wide area and small cost. We also performed an experiment with toy network(2 link) and tested the characteristics of the suggested algorithm.

• Journal of Engineering Education Research
• /
• v.11 no.1
• /
• pp.64-75
• /
• 2008

A new product development and product realization process (PRP) is a circulating and feedback process by generating ideas through creative problem solving process. The early stages of PRP correspond to conceptual design and product development, in which a large portion of product life cycle cost can be saved. The optimal design method for this stage is a robust design suggested by Taguchi. Quality must be 'engineered in' since it can not be 'inspected out.' A robust design is an engineering methodology to improve the quality of a product by minimizing the efforts of variations without eliminating the causes. The objective of this study is to propose a scheme and a case study of robust design for exploring design parameters, and introduce a creative problem solving process. Major research subjects include a creative problem solving process, robust design procedure and their implementation. For the experiment of Taguchi method, a toy catapult is adopted. For the creativity development, a short project is assigned to devise a similar tool with the toy catapult. A reference model is suggested to compare and evaluate their ideas.

• Journal of Korean Society of Transportation
• /
• v.26 no.3
• /
• pp.223-232
• /
• 2008

It can be expected, recently, that the traffic congestion grows worse because the 48% of passenger cars are concentrated in the metropolitan area. However, there is an enforcement regulation that must limit onsite parking lot establishment in some downtown, so it is forecasted that parking lot supply is insufficient. Therefore, this study concentrate upon the subject that solves the problem which drivers are difficult to find parking lots because of increasing demand for parking. This study includes the concept about walking distance because the choice of parking lots is happened within walking distance. The algorithm of this study applies to toy-network, and then this study analyze the result of toy-network. It is proper to consider user's preference because the patterns of choice are different. Moreover, this study suggests the vision that will can offer drivers more correct information by real time information sharing in course of ubiquitous age.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.22 no.1
• /
• pp.265-275
• /
• 2023

The purpose of this paper is to devise an optimal route allocation algorithm for automated vehicle(AV) in monitoring quality of road infrastructure to support the road safety. The tasks of an AV in this paper include visiting node-links at least once during its operation and checking status of road infrastructure, and coming back to its depot.. In selecting optimal route, its priority goal is visiting the node-links with higher risks while reducing costs caused by operation. To deal with the problem, authors devised reward maximizing algorithm for AVs. To check its validity, the authors developed simple toy network that mimic node-link networks and assigned costs and rewards for each node-link. With the toy network, the reward maximizing algorithm worked well as it visited the node-link with higher risks earlier then chinese postman route algorithm (Eiselt, Gendreau, Laporte, 1995). For further research, the reward maximizing algorithm should be tested its validity in a more complex network that mimic the real-life.