• Korean Journal of Materials Research
• /
• v.11 no.6
• /
• pp.448-452
• /
• 2001

The ZnS:Cu,Cl thick film electroluminescent devices with the stacking type(separated with phosphors and insulator layers) and the composite type (mixed with phosphor and insulator materials) emission layers were fabricated on ITO/glass substrates by the screen printing methods. The opical and electrical properties were investigated as fundations of applied voltages and frequencies. In the stacking type, the luminance was about 58 cd/$\m^2$ at the applied voltage of 400Hz, 200V and increased to 420 cd/$\m^2$ with increasing the frequency to 30Hz. For the composite type devices, the threshold voltage was 45V and the maximum luminance was 670 cd/$\m^2$ at the driving condition of 200V, 30Hz. The value of luminance of the composite type device showed 1.5 times higher than that of stacking type device. The main emission peak was 512 nm of bluish-green color at 1Hz frequency below and shifted to 452 nm in the driving frequency over 5Hz showing the blue omission color. There were no distinct differences of the main emission peaks and color coordinate for both samples.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.13 no.1
• /
• pp.1-8
• /
• 1999

In recent years, concern has been raised about the technique of controlling electrical breakdown by using laser in many fields. Especially, laser has attracted much attention in the Electro-Discharge Machining(EDM) because of its many rrents. 1berefore, this research has been perfonred to obtain fundarrental data for the discharge guide technology by a pulsed Nd:YAG laser which can be awJied to discharge processing machining. 1be experilnnts of laser-guided de discharge have been carried out at low air pressure ranging from 0.2 to 20 torr. The minimum laser-guided de discharge voltage $V_{G.min}$ at the given pressures P and distances d between an anode and a cathode was rreasured It is found that $V_{G.min}$ is much lower than the natural discharge voltage $V_{ND}$, and the values of VGrrin and $V_{ND}$ as a function of P.d has a similar tendency. The laser output energy $E_{out}$ decreases with input pulse duration $t_p$ increasing, and the rrore the value of $t_p$ increases, the higher that of V$V_{G.min}$ is obtained because the number of photons N decreases with $t_p$ increasing. In addition, the laser-guided de discharge range and the discharge guide characteristics as laser outpIt $E_{out}$ was investigated.igated.

• Journal of KIISE:Software and Applications
• /
• v.29 no.5
• /
• pp.326-335
• /
• 2002

Recently there have been a number of researches to provide code mobility to lazy functional language (LFL) programs by translating LFL programs to Java programs. These approaches are basically baled on architectural similarities between abstract machines of LFLs and Java. The abstract machines of LFLs and Java programming language, Spineless Tagless G-Machine(STGM) and Java Virtual Machine(JVM) respectively, share important common features such as built- in garbage collector and stack machine architecture. Thus, we can provide code mobility to LFLs by translating LFLs to Java utilizing these common features. In this paper, we propose a new translation scheme which fully utilizes architectural common features between STGM and JVM. By redefining STGM as an eval-apply evaluation model, we have defined a new translation scheme which utilizes Java Virtual Machine Stack for function evaluation and totally eliminates stack simulation which causes array manipulation overhead in Java. Benchmark program translated to Java programs by our translation scheme run faster on JDK 1.3 than those translated by the previous schemes.

• Journal of KIISE:Information Networking
• /
• v.30 no.1
• /
• pp.126-133
• /
• 2003

The existing active routing Protocols assume that the active network topology is static or pre-configured. However a dynamic mechanism to route an active Packet according to the network condition is required due to the dynamic characteristic of the active network. As active routing protocols, SLRP and TCOM500 PLAN project have been proposed, but since both of them are based on the assumption of the static topology we can not say that they are dynamic routing protocols in their entirety. Therefore, in this paper, we propose a new active network routing protocol, called AOSPF (Active Open Shortest Path First), which is compatible with the existing IP routing protocol. AOSPF is an extension of OSPF by adding a new LSA (Link State Advertisement) to allow the active network routing. The newly introduced LSA is used to specify whether the corresponding router is an active router or not. and one bit in the OPTION field of an LSA packet is used as the active router indication bit. This way of extending OSPF is similar to the scheme used in the extension of OSPF for multicast, i.e., MOSPF. In this paper, we will present the operation of AOSPF and the way how an active packet is forwarded based on the active network topology information constructed by AOSPF.

• The Journal of Engineering Research
• /
• v.6 no.2
• /
• pp.11-22
• /
• 2004

A distributed constraint satisfaction problem (distributed CSP) is a constraint satisfaction problem(CSP) in which variables and constraints are distributed among multiple automated agents. ACSP is a problem to find a consistent assignment of values to variables. Even though the definition of a CSP is very simple, a surprisingly wide variety of AI problems can be formalized as CSPs. Similarly, various application problems in DAI (Distributed AI) that are concerned with finding a consistent combination of agent actions can be formalized as distributed CAPs. In recent years, many new backtracking algorithms for solving distributed CSPs have been proposed. But most of all, they have common drawbacks that the algorithm assumes the priority of agents is static. In this thesis, we establish a basic algorithm for solving distributed CSPs called dynamic priority search algorithm that is more efficient than common backtracking algorithms in which the priority order is static. In this algorithm, agents act asynchronously and concurrently based on their local knowledge without any global control, and have a flexible organization, in which the hierarchical order is changed dynamically, while the completeness of the algorithm is guaranteed. And we showed that the dynamic priority search algorithm can solve various problems, such as the distributed 200-queens problem, the distributed graph-coloring problem that common backtracking algorithm fails to solve within a reasonable amount of time. The experimental results on example problems show that this algorithm is by far more efficient than the backtracking algorithm, in which the priority order is static. The priority order represents a hierarchy of agent authority, i.e., the priority of decision-making. Therefore, these results imply that a flexible agent organization, in which the hierarchical order is changed dynamically, actually performs better than an organization in which the hierarchical order is static and rigid. Furthermore, we describe that the agent can be available to hold multiple variables in the searching scheme.

• Journal of KIISE:Software and Applications
• /
• v.32 no.7
• /
• pp.601-611
• /
• 2005

Due to not only proven stability and reliability but a significant investment and years of accumulated -experience and knowledge, legacy systems have supported the core business applications of a number of organizations over many years. While the emergence of Web-based e-business environments requires externalizing core business processes to the Web. This is a competitive advantage in the new economy. Consequently, organizations now need to mine the business value buried in the legacy systems for reuse in new e-business applications. In this paper we suggest a systematic approach to mining components that perform specific business services and that consist of the legacy system's assets to be leveraged on the modem platform. The proposed activities are divided into several tasks. First, use cases that realize the business processes are captured. Secondly, a design model is constructed for each identified use case in order to integrate the use cases with the similar functionalities. Thirdly, we identify component candidates from the design model and then adjust the component candidates by considering common elements among the candidate components. And also business components are divided into three more fine-grained components to deploy them onto J2EE/EJB environments. finally, we define the interfaces of components which provide functionalities of the components as operations.

• The Korean Journal of Applied Statistics
• /
• v.34 no.6
• /
• pp.905-922
• /
• 2021

Cluster analysis is one of unsupervised learning techniques used for discovering clusters when there is no prior knowledge of group membership. K-means, one of the commonly used cluster analysis techniques, may fail when the number of variables becomes large. In such high-dimensional cases, it is common to perform tandem analysis, K-means cluster analysis after reducing the number of variables using dimension reduction methods. However, there is no guarantee that the reduced dimension reveals the cluster structure properly. Principal component analysis may mask the structure of clusters, especially when there are large variances for variables that are not related to cluster structure. To overcome this, techniques that perform dimension reduction and cluster analysis simultaneously have been suggested. This study proposes probabilistic reduced K-means, the transition of reduced K-means (De Soete and Caroll, 1994) into a probabilistic framework. Simulation shows that the proposed method performs better than tandem clustering or clustering without any dimension reduction. When the number of the variables is larger than the number of samples in each cluster, probabilistic reduced K-means show better formation of clusters than non-probabilistic reduced K-means. In the application to a real data set, it revealed similar or better cluster structure compared to other methods.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.6
• /
• pp.86-94
• /
• 2019

This paper describes the development of unmanned vehicle remote control system which is configured with steering and accelerating/braking hardware to improve the sense of reality and safety of control. Generally, in these case of the remote control system, a joystick-type device is used for steering and accelerating/braking control of unmanned vehicle in most cases. Other systems have been developing using simple steering wheel, but there is no function of that feedback the feeling of driving situation to users and it mostly doesn't include the accelerating/braking control hardware. The technology of feedback means that a reproducing the feeling of current driving situation through steering and accelerating/braking hardware when driving a vehicle in person. In addition to studying feedback technologies that reduce unfamiliarity in remote control of unmanned vehicles, it is necessary to develop the remote control system with hardware that can improve sense of reality. Therefore, in this study, the reliable remote control system is developed and required system specification is defined for applying force-feedback haptic control technology developed through previous research. The system consists of a steering-wheel module similar to a normal vehicle and an accelerating/braking pedal module with actuators to operate by feedback commands. In addition, the software environment configured by CAN communication to send feedback commands to each modules. To verify the reliability of the remote control system, the force-feedback haptic control algorithms developed through previous research were applied, to assess the behavior of the algorithms in each situation.

• Journal of the Institute of Convergence Signal Processing
• /
• v.19 no.4
• /
• pp.153-161
• /
• 2018

This paper describes the performance improvement of Software (SW) digital filter using GPU (Graphical Processing Unit). The previous developed SW digital filter has a problem that it operates on a CPU (Central Processing Unit) basis and has a slow speed. The GPU was introduced to filter the data of the EAVN (East Asian VLBI Network) observation to improve the operation speed and to process data with other stations through filtering, respectively. In order to enhance the computational speed of the SW digital filter, NVIDIA Titan V GPU board with built-in Tensor Core is used. The processing speed of about 0.78 (1Gbps, 16MHz BW, 16-IF) and 1.1 (2Gbps, 32MHz BW, 16-IF) times for the observing time was achieved by filtering the 95 second observation data of 2 Gbps (512 MHz BW, 1-IF), respectively. In addition, 2Gbps data is digitally filtered for the 1 and 2Gbps simultaneously observed with KVN (Korean VLBI Network), and compared with the 1Gbps, we obtained similar values such as cross power spectrum, phase, and SNR (Signal to Noise Ratio). As a result, the effectiveness of developed SW digital filter using GPU in this research was confirmed for utilizing the data processing and analysis. In the future, it is expected that the observation data will be able to be filtered in real time when the distributed processing optimization of source code for using multiple GPU boards.

• KIPS Transactions on Software and Data Engineering
• /
• v.11 no.1
• /
• pp.51-58
• /
• 2022

Drivable area detection, one of the main functions of advanced driver assistance systems, means detecting an area where a vehicle can safely drive. The drivable area detection is closely related to the safety of the driver and it requires high accuracy with real-time operation. To satisfy these conditions, V-disparity-based method is widely used to detect a drivable area by calculating the road disparity value in each row of an image. However, the V-disparity-based method can falsely detect a non-road area as a road when the disparity value is not accurate or the disparity value of the object is equal to the disparity value of the road. In a road environment including vegetation, such as a highway and a country road, the vegetation area may be falsely detected as the drivable area because the disparity characteristics of the vegetation are similar to those of the road. Therefore, this paper proposes a drivable area detection method and hardware architecture with a high accuracy in road environments including vegetation areas by reducing the number of false detections caused by V-disparity characteristic. When 289 images provided by KITTI road dataset are used to evaluate the road detection performance of the proposed method, it shows an accuracy of 90.12% and a recall of 97.96%. In addition, when the proposed hardware architecture is implemented on the FPGA platform, it uses 8925 slice registers and 7066 slice LUTs.