• Journal of the Korean Ceramic Society
• /
• v.35 no.11
• /
• pp.1162-1170
• /
• 1998

Applicability of crystallization kinetics on thermal analysis was investigated for PbO-TiO2-B2O3-BaO glass systems together with theoretical background of kinetics and electron microscopic observations on nu-cleation and crystallization. Kissinger equation can be used on DTA under the assumption that the nucleus density is fixed during DTA runs. Crystallization mechanism affected on the activation energy Ek obtained from powder samples which is used for domination of surface crystallization. Avrami parameter n that was obtained from Ozawa equation represented closely the crystallization mechanisms observed by an electron microscope. The modified Kissinger equation takes into account crystallization mechanism thereby pro-ducing the true activation energy of crystallization.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.12 no.1
• /
• pp.12-19
• /
• 1998

This paper deals with ACSR(Aluminum Conductor Steel Reinforced) inner corrosion detection using a detector which automatically runs on an ACSR distribution line and inspects the inner corrosion of the conductor by utilization of the nondestructive eddy current test. According to corrosion appearance and development of ACSR, the impedance change of the eddy current coils is theoretically verified. And then specifications and performances of the detector are described. Experimental procedures and desirable test results are reported. In conclusion, this detector can realize the nondestructive detecting of an ACSR inner corrosion. Upgrading the maintenance efficiency and improving the reliability of distribution line, whether is covered with insulating materials or not, would be expected by this nondestructive test method.method.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.10
• /
• pp.1258-1263
• /
• 1999

본 논문에서는 CRCW(Concurrent Read Concurrent Write)와 CREW(Concurrent Read Exclusive Write) PRAM(Parallel Random Access Machine) 모델에서 무방향성 그래프 G=(V, E)의 극대 매칭을 구하기 위해 간결한 랜덤 병렬 알고리즘을 제안한다. CRCW PRAM 모델에서 m개의 선을 가진 그래프에 대해, 제안된 매칭 알고리즘은 m개의 프로세서 상에서 {{{{ OMICRON (log m)의 기대 수행 시간을 가진다. 또한 CRCW 알고리즘을 CREW PRAM 모델에서 구현한 CREW 알고리즘은 OMICRON (log^2 m)의 기대 수행 시간을 가지지만,OMICRON (m/logm) 개의 프로세서만을 가지고 수행될 수 있다.Abstract This paper presents simple randomized parallel algorithms for finding a maximal matching in an undirected graph G=(V, E) for the CRCW and CREW PRAM models. The algorithm for the CRCW model has {{{{ OMICRON (log m) expected running time using m processors, where m is the number of edges in G We also show that the CRCW algorithm can be implemented on a CREW PRAM. The CREW algorithm runs in {{{{ OMICRON (log^2 m) expected time, but it requires only OMICRON (m / log m) processors.

• Journal of Korean Society of Transportation
• /
• v.28 no.6
• /
• pp.109-120
• /
• 2010

This study aims to develop mathematical models for estimating saturation flow rates at the stop line of signalized intersection due to Workzones in the vicinity, since the saturation flow rate is the most critical parameter in capacity analysis for signalized intersections. It was found by reference review that saturation flow rates are sensitively influenced by the location of Workzone, the number of lanes, cycle length and effective green time. Extensive microscopic simulation runs were also performed and compared to the those of mathematical models for model verification. Mathematical models were developed based on traffic flow theory and dualizing them by the location of workzones. And then each result produced by changing important parameter values was carefully examined and analyzed. Small but consistent differences in saturation flow rate values between mathematical models and simulations exist. However, the pattern of changes in saturation flow rates depending on each variable was similar.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.7
• /
• pp.267-275
• /
• 2007

Message races should be detected for debugging message-passing parallel programs because they can cause non-deterministic executions. Specially, it is important to detect the first race in each process because the first race can cause the occurrence of the other races in the same process. The previous techniques for detecting the first races require more than two monitored runs of a program or analyze a trace file which size is proportional to the number of messages. In this paper we introduce an on-the-fly technique to detect the first race in each process without generating any trace file. In the experiment we test the accuracy of our technique with some benchmark programs and it shows that our technique detects the first race in each process in all benchmark programs.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.5
• /
• pp.137-144
• /
• 1989

A new algorithm is presented which efficiently reports minimum width/space violation in a geometric mask pattern. The proposed algorithm solves a sequence of range search problems by employing a plane sweep method. The algorithm runs in O(n log n) time, where n is the number of edges in a mask pattern. Since a lower bound in time conplexity for reporting all minimum width/space violations is ${\Omega}$ (n log n), this algorithm is theoretically optimal within a constant multiplicaive factor. It requires O($n^{0.5}$) space which is very efficient in practice. Moreover, this algorithm, we believe, is easy to implement and practically fast (116.7 seconds for a rectilinear region with 250000 vertices ar VAX 8650.)

• The Journal of the Korea Contents Association
• /
• v.16 no.7
• /
• pp.221-230
• /
• 2016

The public mostly get the information regarding real estate policy not from the press release of the government but from news articles. This type of information, though, might be delivered in a different frame depending on inclination of media or press. The media runs the articles within its own frame, so that it often conveys either expectation or concern depending on its inclination. This study analyzed the articles regarding 'Agreement to revise three major real estate regulations to perk up property market' and examined how the real estate policy imprinted in them depending on the disposition of the press. The results showed that the conservative press ran articles within a positive frame expressing favorable expectation. On the other hand, progressive press mostly kept neutral or unfavorable tone on the same regulations within the negative frame. Therefore, it was confirmed that there exist different frames within articles depending on their disposition.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.2
• /
• pp.369-374
• /
• 2010

The shortest path between two points inside a simple polygon P is a minimum-length path among all paths connecting them which don't pass by the exterior of P. A linear time algorithm for computing the shortest path in a general simple polygon requires triangulating a polygon as preprocessing. The linear time triangulating is known to very complex to understand and implement it. It is also inefficient in case that the input without very large size is given because its time complexity has a big constant factor. In this paper, we present the customized shortest path algorithm for a segment-visible polygon which is a simple polygon weakly visible from an internal line segment. Our algorithm doesn't require triangulating as preprocessing and consists of simple procedures such as construction of convex hulls, so it is easy to implement and runs very fast in linear time.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.8
• /
• pp.421-431
• /
• 2004

This paper presents adaptive execution techniques that determine whether parallelized loops are executed in parallel or sequentially in order to maximize performance. The adaptation and performance estimation algorithms are implemented in a compiler preprocessor. The preprocessor inserts code that automatically determines at compile-time or at run-time the way the parallelized loops are executed. Using a set of standard numerical applications written in Fortran77 and running them with our techniques on a distributed shared memory multiprocessor machine (SGI Origin2000), we obtain the performance of our techniques, on average, 26%, 20%, 16%, and 10% faster than the original parallel program on 32, 16, 8, and 4 processors, respectively. One of the applications runs even more than twice faster than its original parallel version on 32 processors.

• The KIPS Transactions:PartC
• /
• v.9C no.2
• /
• pp.149-156
• /
• 2002

Current vaccine program which scans virus code patterns has a difficult to detect the encrypted viruses or polymorphic viruses. The decryption part of polymorphic virus appears to be different every time it replicates. We must monitor the behavior of the decryption code which decrypts the body of the virus in order to detect these kinds of viruses. Specialty, it is not easy for the existing methods to detect the virus if the virus writer has modified the loop count of execution intentionally. In this paper, we propose an advanced emulator using a new algorithm so as to detect various kinds of polymorphic viruses. As a result of experiment using advanced emulator, we found that our proposed method has improved the virus detecting rate about 2%. In addition, our proposed system has a merit that it runs on not only MS-Windows but also Linux, and Unix-like Platform.