• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.17-21
• /
• 1989

6-DOE simulator system is designed to real-time processing for motion control, data acquisition, image generation and image processing etc.. In this paper, we introduce hardware and software design technologies for distributed processing, event-trapping, system monitoring and time scheduling procedure in 6-DOF simulator system design.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.10
• /
• pp.1-7
• /
• 1997

This paper proposes a new real-time 2-D convolver filter architecture wihtout using any multiplier. To meet the massive amount of computations for real-time image processing, several commercial 2-D convolver chips have many multipliers occupying large VLSI area. Te proposed architecture using only one shift-and-accumulator can reduce the chip size by more than 70% of commercial 2-D convolver filter chips and can meet the real-time image processing srequirement, i.e., the standard of CCIR601. In addition, the proposed chip can be used for not only 2-D image processing but also 1-D signal processing and has bood scalability for higher speed applications. We have simulated the architecture by using VHDL models and have performed logic synthesis. We used the samsung SOG cell library (KG60K) and verified completely function and timing simulations. The implemented filter chip consists of only 3,893 gates, operates at 125 MHz and can meet the real-time image processing requirement, that is, 720*480 pixels per frame and 30 frames per second (10.4 mpixels/second).

• Management Science and Financial Engineering
• /
• v.21 no.1
• /
• pp.1-9
• /
• 2015

We consider an m-machine flow shop scheduling problem to minimize the latest completion time, where processing times are uncertain. Processing time uncertainty is described through a finite set of processing time vectors. The objective is to minimize maximum deviation from optimality for all scenarios. Since this problem is known to be NP-hard, we consider it with an ordered property. We discuss optimality properties and develop a pseudo-polynomial time approach for the problem with a fixed number of machines and scenarios. Furthermore, we find two special structures for processing time uncertainty that keep the problem NP-hard, even for two machines and two scenarios. Finally, we investigate a special structure for uncertain processing times that makes the problem polynomially solvable.

• ETRI Journal
• /
• v.39 no.1
• /
• pp.41-50
• /
• 2017

In connection-oriented data transport services, data loss can occur when a service experiences a problem in its end-to-end path. To resolve the problem promptly, the data transport systems providing the service must quickly modify their internal configurations, which are distributed among different locations within each system. The configurations are modified through a series of problem (event) handling procedures, which are carried out by multiple control processors in the system. This paper proposes a provisioning-to-signaling method for inter-control-processor messaging to improve the time efficiency of event processing. This method simplifies the sharing of the runtime event, and minimizes the time variability caused by the amount of event data, which results in a decrease in the latency time and an increase in the time determinacy when processing global events. The proposed method was tested for an event that required 4,000 internal path changes, and was found to lessen the latency time of global event processing by about 50% compared with the time required for general methods to do the same; in addition, it reduced the impact of the event data on the event processing time to about 30%.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.737-740
• /
• 1999

This paper deals with a real time optimization algorithm within real time for DRGS(Dynamic Route Guidance System) and evaluate the algorithm. A pre-developed system offers the optimal route in using only static traffic information. In using real-time traffic information, Dynamic route guidance algorithm is needed. The serious problem in implementing it is processing time increase as nodes increase and then the real time processing is impossible. Thus, in this paper we propose the optimal route algorithm with window mechanism for the real-time processing and then evaluate the algorithms.

• Journal of Korean Academy of Oral and Maxillofacial Radiology
• /
• v.22 no.1
• /
• pp.128-136
• /
• 1992

This study was undertakened to investigate the change of image characteristics on dental films according to the process of using time of processing solution in automatic processor. Base + fog density, film density and subject contrast were measured with the digital densitometer, the pH of developing and fixing solution were measured with Digital pH / ION Meter. The following results were obtained: 1. Base + fog density was increased with the process of using time of the processing solution and was over the maximum permissible base + fog density 0.25 from the 3rd day. 2. Film density was increased with the process of using time of the processing solution. 3. Subject contrast was decreased with the process of using time of the processing solution. 4. The pH of the developing solution was decreased with the process of using time, the pH of the fixing solution was increased.

• IE interfaces
• /
• v.17 no.3
• /
• pp.282-293
• /
• 2004

Line Balancing is the problem to assign tasks to stations while satisfying some managerial viewpoints. Most researches about the Mixed-Model Line Balancing problems are focused on the minimizing the total processing time or the number of workstations. Independently, some research reports consider the balance issues of the physical workloads on the assembly line. In this paper, we are presenting a new mathematical model to accomplish the line balance considering both the processing time and the workloads at the same time. To this, end, we propose an zero-one integer program problem, and we use the Chebyshev Goal Programming approach as the solution method. Some computational test runs are performed to compare the pay-offs between the processing time and the workloads. And, the test results show us that the reliable balanced work schedules can be obtained through the proposed model.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.14 no.4
• /
• pp.663-668
• /
• 2011

Although multi-frame super resolution algorithm has many merits but it demands too much calculation time. Researches have shown that image processing time can be reduced using a CUDA(Compute unified device architecture) which is one of GPGPU(General purpose computing on graphics processing unit) models. In this paper, we show that the processing time of multi-frame super resolution algorithm can be reduced by employing the CUDA. It was applied not to the whole parts but to the largest time consuming parts of the program. The simulation result shows that using a CUDA can reduce an operation time dramatically. Therefore it can be possible that multi-frame super resolution algorithm is implemented in real time by using libraries of image processing algorithms which are made by a CUDA.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2000.11a
• /
• pp.165-173
• /
• 2000

Analytic models have been developed to solve integrated production-distribution problems in supply chain management (SCM). As one of major constraints in analytic models, capacity, which is the total operation time in this paper has mostly been known or disregarded assuming infinite capacity. Also, as major factors, machine processing time to fabricate or assemble a part or product at a certain machine center in production system and vehicle processing time to deliver a product to a customer by a certain vehicle in distribution system have been fixed and regarded as a static factor, But in the real systems significant differences exit between capacity and the required time to achieve the production-distribution plan and between processing time and consumed time to process a part or product. In this paper, capacity and processing times in the analytic model are considered as dynamic factors and adjusted by the results from independently developed simulation model, which includes general production-distribution characteristics. Through experiments, we obtain the more realistic solutions reflecting stochastic natures by performing the iterative analytic-simulation procedure.

• International Journal of Aeronautical and Space Sciences
• /
• v.17 no.4
• /
• pp.467-475
• /
• 2016

Ultrasonic propagation imaging (UPI) has shown great potential for detection of impairments in complex structures and can be used in wide range of non-destructive evaluation and structural health monitoring applications. The software implementation of such algorithms showed a tendency in time-consumption with increment in scan area because the processor shares its resources with a number of programs running at the same time. This issue was addressed by using field programmable gate arrays (FPGA) that is a dedicated processing solution and used for high speed signal processing algorithms. For this purpose, we need an independent and flexible block of logic which can be used with continuously evolvable hardware based on FPGA. In this paper, we developed an FPGA-based ultrasonic propagation imaging system, where FPGA functions for both data acquisition system and real-time ultrasonic signal processing. The developed UPI system using FPGA board provides better cost-effectiveness and resolution than digitizers, and much faster signal processing time than CPU which was tested using basic ultrasonic propagation algorithms such as ultrasonic wave propagation imaging and multi-directional adjacent wave subtraction. Finally, a comparison of results for processing time between a CPU-based UPI system and the novel FPGA-based system were presented to justify the objective of this research.