• Journal of Korean Society of Transportation
• /
• v.19 no.6
• /
• pp.143-160
• /
• 2001

Micro-simulation models have been recognized as an efficient assessment tool in developing traffic signal control technologies. In this paper a prototype of a microscopic simulation model which can be applied to evaluate the performance of traffic-adaptive signal control strategies was developed. In the simulation process, space-based arrays were appled to estimate parameters of car following and lane changing models. Two levels of link types, a micro-type and macro-type links, were also embodied in the simulation process. The proposed model was tested on a test network consists of 9 intersections. The performance of the proposed model was evaluated in link by link comparisons with the results of NETSIM. The results show that the proposed model could appropriately simulate traffic flows of the test network. The model also produces traffic adaptive signal timings, cycle lengths and green times for turning movements, based on the detector data. It implies that the optimization process of the model produces reasonable signal timings for the test network on the cycle basis.

• Journal of the Korean Society for Nondestructive Testing
• /
• v.26 no.4
• /
• pp.246-254
• /
• 2006

A computation program has been developed for automatic data processing in the calibration process of gamma survey meter. The automatic processing program has been developed based on Visual Basic. The program has been coded according to steps of calibration procedure. The OLE(object linking an embedding) Excel automation method fur automatic data processing is used in this program, which is a kind of programming technique for the Excel control. The performance test on the basis of reference data has been carried out by using the developed program. In the results of performance test, the values of calibration factors and uncertainties by the developed program were equal to those obtained from the reference data. In addition, It was revealed that the efficiency and precision of working are significantly increased by using the developed program.

• Journal of Internet Computing and Services
• /
• v.4 no.4
• /
• pp.53-64
• /
• 2003

To perform the certificate validation on the user-side application induces the very considerable overhead on the user-side system because of the complex and time-consuming characteristic of the validation processing. Most of the time spend for performing the validation processing is required for the digital signature verification, since the verification accompanies with the cryptographic calculation over each certificate on the certificate path. In this paper, we propose a new certificate validation scheme using DSVP(Delegated Signature Validation Protocol) which can reduce the overhead for the user-side certificate validation processing. It is achieved by delegating the digital signature verification to CAs of the PKI domain. As the proposed DSVP is the protocol performed between a user and CAs, it is applied to the hierarchical PKI efficiently and used for delegating the digital signature verification reliably and safely, our proposed scheme can not only reduces the overhead for the validation processing by decreasing the cryptographic calculation but also improves the utilization of CAs by employing them to the validation processing.

• Journal of Internet Computing and Services
• /
• v.10 no.6
• /
• pp.229-239
• /
• 2009

To solve user authentication problem, many remote user authentication schemes using password and smart card at the same time have been proposed. Due to the increasing of interest in personal privacy, there were some recent researches to provide user anonymity. In 2004, Das et al. firstly proposed an authentication scheme that guarantees user anonymity using a dynamic ID. In 2005, Chien et al. pointed out that Das et al.'s scheme has a vulnerability for guaranteing user anonymity and proposed an improved scheme. However their authentication scheme was found some weaknesses about insider attack, DoS attack, and restricted replay attack. In this paper, we propose an enhanced scheme which can remove vulnerabilities of Chien et al.'s scheme. The proposed authentication protocol prevented insider attack by using user's Nonce value and removed the restricted replay attack by replacing time stamp with random number. Furthermore, we improved computational efficiency by eliminating the exponentiation operation.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.11
• /
• pp.831-835
• /
• 2009

Volunteer computing is a computing paradigm in which the operations of a large-scale application are processed using idle resources of Internet-connected computers. The redundant-work distribution techniques used in the volunteer computing environment cause some problems like delay of the work completion time or inefficiency of the work execution due to continuous requests of the work redistribution because the techniques do not consider the characteristics of works and dynamic resources. To cope with such problems this paper suggests a P2P based regional matchmaking technique which can redistribute works in consideration of the characteristics of the works and the participant resources. The techniques consist of the profiles for works/resources, the module for monitoring the available resources spaces, the protocols for the matching request/reply, the module for match-ratio calculation, and so on.

• Journal of Advanced Navigation Technology
• /
• v.8 no.2
• /
• pp.190-196
• /
• 2004

The development of a new hardware structure which can implement the viterbi algorithm efficiently is required for applications such as a software radio because the viterbi algorithm, which is an error correction code function for the second and the third generation of mobile communication, needs a lot of arithmetic operations. The length of K in the viterbi algorithm different from each standard, for examples, K=7 in case of IS-95 standard and GSM standard, and K=9 in case of WCDMA and CDMA2000. In this paper, we propose a new hardware structure of an adaptive viterbi decoder which can decode the constraint length in K=3~9 and the data rate in 1/2 ~ 1/3. Prototyping results targeted to Altera Cyclon EPIC20F400C8, shows that the proposed hardware structure needs maximum 19,276 logic elements and power dissipation of 222.6 mW.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.11
• /
• pp.581-591
• /
• 2001

We consider some problems of remote file accesses of multiple clients in mobile computing environments. In this environment, user mobility affects file access latency. Mobile hosts have severe resource constraints in terms of limited size of non-volatile storage. Thus, the burden of computation and communication load raise file access latency. In this paper, we propose a scheme for reducing the file access latency through the file migration. The objective is to minimize of file accesses for all mobile hosts which delivering the file to clients as quickly as possible. We develope an on-demand scheme which determines when the file server should migrate files to another server, or when it should transfer files to mobile hosts. Using simulation, we examine the effects which parameters such as file access frequency, file size, mobility rate have on file system access latency. Through simulation results, we show that our proposed migration scheme is effective in reducing the access latency on the requested file of a mobile host with high access rate and low mobility.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.8
• /
• pp.418-425
• /
• 2005

3D surface reconstruction is to make the original geometry of 3D objects from 2D geometric information. Barequet's algorithm is well known and most widely used in surface reconstruction. It tiles matched regions first, then triangulates clefts using dynamic programming. However it takes considerably long processing time while manipulating complex model. Our method tiles a simple region that does not have branches along minimally distant vertex pairs at once. When there are branches, our method divides contour lines into a simple region and clefts. We propose a fast and simple method that calculates medial axes using a minimum distance in cleft region. Experimental results show that our method can produce accurate models than the previous method within short time.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.2
• /
• pp.75-86
• /
• 2002

The selection of the optimal checkpointing interval has been a very critical issue to implement a checkpointing recovery scheme for the fault tolerant distributed system. This paper presents a new scheme that allows a process to select the proper checkpointing interval dynamically. A process in the system evaluates the cost of checkpointing and possible rollback for each checkpointing interval and selects the proper time interval for the next checkpointing Unlike the other scheme, the overhead incurred by both of the checkpointing and rollback activities are considered for the cost evaluation and current communication pattern is reflected in the selection of the checkpointing interval. Moreover, the proposed scheme requires no extra message communication for the checkpointing interval selection and can easily be incorporated into the existing checkpointing coordination schemes.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.6
• /
• pp.715-721
• /
• 2012

A threat evaluation is the technique which decides order of priority about tracks engaging with enemy by recognizing battlefield situation and making it efficient decision making. That is, in battle situation of multiple target it makes expeditious decision making and then aims at minimizing asset's damage and maximizing attack to targets. Threat value computation used in threat evaluation is calculated by sensor data which generated in battle space. Because Battle situation is unpredictable and there are various possibilities generating potential events, the damage or loss of data can make confuse decision making. Therefore, in this paper we suggest that substantial threat value calculation using learning bayesian network which makes it adapt to the varying battle situation to gain reliable results under given incomplete data and then verify this system's performance.