• Journal of Korean Society for Atmospheric Environment
• /
• v.15 no.1
• /
• pp.13-22
• /
• 1999

This study is carried out to investigate the chemical composition of atmospheric deposition in Cheju Island, Korea. For this purpose, dustfall matter samples are collected by dust jar from August, 1995 to July, 1996 at five sampling sites and total suspended particulate matters (TSP) and rain are also collected at one site from October, 1995 to July, 1996. All the samples collected are analyzed, and then the information of the 19 chemical species and deposition amount of each species is obtained. These data are used to determine the regional trends in dustfall chemistry and deposition, and compare the characteristics of chemical compositions between dustfall, TSP and rainwater.

• Journal of the military operations research society of Korea
• /
• v.17 no.1
• /
• pp.146-158
• /
• 1991

In this paper, we deal with the TSP (Traveling Salesperson Problem) which is well-known as NP-complete optimization problem. the TSP is applicable to network routing. task allocation or scheduling. and VLSI wiring. Well known numerical methods such as Newton's Metheod. Gradient Method, Simplex Method can not be applicable to find Global Solution but the just give Local Minimum. Exhaustive search over all cyclic paths requires 1/2 (n-1) ! paths, so there is no computer to solve more than 15-cities. Heuristic algorithm. Simulated Annealing, Artificial Neural Net method can be used to get reasonable near-optimum with polynomial execution time on problem size. Therefore, we are able to select the fittest one according to the environment of problem domain. Three methods are simulated about symmetric TSP with 30 and 50-city samples and are compared by means of the quality of solution and the running time.

• IEIE Transactions on Smart Processing and Computing
• /
• v.3 no.4
• /
• pp.246-250
• /
• 2014

Large mutual capacitance touch screen panels (TSP) are susceptible to display and ambient noise. This paper presents a multi-touch detection algorithm using an efficient noise compensation technique for large mutual capacitance TSPs. The sources of noise are presented and analyzed. The algorithm includes the steps to overcome each source of noise. The algorithm begins with a calibration technique to overcome the TSP mutual capacitance variation. The algorithm also overcomes the shadow effect of a hand close to TSP and mutual capacitance variation by dynamic threshold calculations. Time and space filters are also used to filter out ambient noise. The experimental results were used to determine the system parameters to achieve the best performance.

• Korean Journal of Poultry Science
• /
• v.20 no.1
• /
• pp.11-15
• /
• 1993

Environmental measurements were made in 10 broiler confinement houses in order to characterize dust contaminants. Particles were collected by filters on nine stages Anderson Air Sampler, The obtained results were summarized as follows ; 1. The concentrations of the total suspended particles(TSP) were 7.584 mg/$m_3$~11.589mg/$m_3$ in 10 day old broiler houses and 15.836 mg/$m_3$~22.471 mg/$m_3$ in 30 day old broiler houses. 2. The concentrations of the coarse particles were 4.974 mg/$m_3$~18.981 mg/$m_3$ in 10 broiler confinement houses. Therefore, it was found that the coarse particles contributed to TSP between 65.6% and 85.0%. 3. The dust levels were higher in 30 day old broiler houses with TSP averaging about 19.341 mg/$m_3$ than 9.491 mg/$m_3$ in 10 day old broiler houses. In view of the above results , It was concluded that domestic broiler houses need artificial ventilation system.

• Nuclear Engineering and Technology
• /
• v.44 no.7
• /
• pp.799-806
• /
• 2012

In recent years, a new algorithm has been introduced to perform the regional overpower protection (ROP) detector layout optimization for $CANDU^{(R)}$ reactors. This algorithm is called DETPLASA. This algorithm has been shown to successfully come up with a detector layout which meets the target trip set point (TSP) value. Knowing that these ROP detectors are placed in a number of safety channels, one expects that there is an optimal placement of the candidate detectors into these channels. The objective of the present paper is to show that a slight improvement to the TSP value can be realized by optimizing the channelization of these ROP detectors. Depending on the size of the ROP system, based on numerical experiments performed in this study, the range of additional TSP improvement is from 0.16%FP (full power) to 0.56%FP.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.8
• /
• pp.64-70
• /
• 1993

This paper presents an efficient SOFM(self-organizing feature map) algorithm for the solution of the large scale TSPs(traveling salesman problems). Because no additional winner neuron for each city is created in the next competition, the proposed algorithm requires just only the N output neurons and 2N connections, which are fixed during the whole process, for N-city TSP, and it does not requires any extra algorithm of creation of deletion of the neurons. And due to direct exploitation of the output potential in adaptively controlling the neighborhood, the proposed algorithm can obtain higher convergence rate to the suboptimal solutions. Simulation results show about 30% faster convergence and better solution than the conventional algorithm for solving the 30-city TSP and even for the large scale of 1000-city TSPs.

• Korean Management Science Review
• /
• v.13 no.3
• /
• pp.187-198
• /
• 1996

The traveling salesman problem has been studied for many years since the model can be used for various applications such as vehicle routing, job sequencing, clustering a data array, and so on. In this paper one of the typical exact algorithms for TSP, Minty's, will be modified to improve the performance of the algorithm on the applications without losing simplicity. The Little's algorithm gives good results, however, the simple and plain Minty's algorithm for solving shortest-route problems has the most intuitive appeal. The suggested Minty's modification is based on the creation of penalty-values on the matrix of a TSP. Computer experiments are made to verify the effectiveness of the modification.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.11a
• /
• pp.489-492
• /
• 2005

TSP(Traveling Salesman Problem)는 N개의 주어진 도시를 한번씩만 방문하여 다시 출발지로 돌아오는 여러 경로들 중 가장 짧은 거리를 구하는 문제로 유전자 알고리즘이 대표적으로 이용된다. NP-Hard문제로 분류되어 보다 우수한 결과를 얻기 위해 현재까지 다양한 연산자들이 개발되고 연구되어왔다. 본 논문에서는 이러한 연산자들을 적용하여 보다 나은 해를 얻기 위해 새로운 집단초기화 방법과 순차변환 방법을 제안하여 기존의 방법들과 비교를 통해 성능 향상을 입증 하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06c
• /
• pp.429-434
• /
• 2008

원하는 정보를 보다 빠르게 찾기 위해서 활용하는 방법 중에 하나가 군집화이다. 군집화를 보다 효과적으로 할 수 있다면, 군집화내에서 원하는 정보를 보다 쉽게 얻을 수가 있다. 따라서, 본 논문에서는 군집화하기 위한 여러 가지 방법 중에서 TSP(Traveling Salesman Problem)을 이용해서 문서를 보다 정교하게 군집화하는 알고리즘을 제안하고, 제한된 알고리즘을 온톨로지 기반으로 실험하여 그 효율성을 입증하였다.

• Journal of Korean Society for Atmospheric Environment
• /
• v.17 no.E4
• /
• pp.145-155
• /
• 2001

Simple mass balance method was developed to estimate the contribution of two major fugitive dust sources in the Port of Incheon to a nearby residential area in this study. Using the relatively small number of TSP data as well as the data on mass fraction of Fe and organic materials in the sampled dust, our simplified method demonstrated its ability to estimate the contribution of each fugitive source to a specific location including the residential area with relatively reasonable accuracy. It is clear from this simple method can be applied to the situation where two major fugitive dust sources are responsible for the high TSP concentration around the source area and there are clear marker chemicals representing the characteristics of the fugitive dust sources.