• Proceedings of the Acoustical Society of Korea Conference
• /
• spring
• /
• pp.81-84
• /
• 2004

In this paper, we propose a virtual sound localization algorithm which improves the sound localization accuracy and sound color preservation for two channel and multi-channel surround speaker layouts. In conventional CPP laws, the sound direction is different from the panning angle and the sound color is different from real sound source especially when the speakers are spread out widely. To overcome this drawback, we design a virtual sound localization algorithm using directional psychoacoustic criteria (DPC) and sound color compensator (SCC). The analysis results show that in the case of the proposed system, the sound direction is the same as the panning angle in the audible frequency range and the sound color is less deviated from a real sound source than the conventional CPP law. In addition, its performance is verified by means of subjective tests using a real sound source.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.1 s.33
• /
• pp.181-188
• /
• 2005

Chinese Postman Problem (CPP) is a problem that finds a shortest tour traversing all edges or arcs at least once in a given network. The Chinese Postman Problem on Mixed networks (MCPP) is a Practical generalization of the classical CPP and it has many real-world applications. The MCPP has been shown to be NP-complete. In this paper, we transform a mixed network into a symmetric network using virtual arcs that are shortest paths by Floyd's algorithm. With the transformed network, we propose a Genetic Algorithm (GA) that converges to a near optimal solution quickly by a multi-directional search technique. We study the chromosome structure used in the GA and it consists of a path string and an encoding string. An encoding method, a decoding method, and some genetic operators that are needed when the MCPP is solved using the Proposed GA are studied. . In addition, two scaling methods are used in proposed GA. We compare the performance of the GA with an existing Modified MDXED2 algorithm (Pearn et al. , 1995) In the simulation results, the proposed method is better than the existing methods in case the network has many edges, the Power Law scaling method is better than the Logarithmic scaling method.

• Korean Journal of Agricultural Science
• /
• v.45 no.1
• /
• pp.114-119
• /
• 2018

This study analyzed the trends of patents for unmanned technology used in agriculture. The target countries for this survey of patent data were Korea, the USA and Japan as well as the countries in Europe. The indices used in this study to analyze the patents were the CPP (Cites Per Patent), PII (Patent Impact Index), and PFS (Patent Family Size). The total effective patents for unmanned technology used in agriculture were 1,080 cases. The number of patents in the USA, Japan, Europe, and Korea were 541, 326, 128 and 85 cases, respectively. Among the total effective patents, the evaluation scores for selected important patents were calculated by applying commonly used weights to each index, and the top 10 patents were selected as important patents. The results showed that all the top ten patents are owned by the United States and that the United States is an advanced country in the field of unmanned technology used in agriculture. The evaluation score of the important patents using the existing method was biased toward the PII index among the three patent evaluation standards, and the effects of the number of claims and the PFS were relatively small. Therefore, a reliable patent analysis in the field of unmanned technology used in agriculture needs to reflect the overall evaluation factors taking into consideration the scope of the evaluation factors.