• Journal of Korean Institute of Industrial Engineers
• /
• v.36 no.2
• /
• pp.138-145
• /
• 2010

In this paper, we consider the information processing system, which organizes the collected data to meaningful information when the number of data collected from multiple sources reaches to a predetermined number, and performs any action by processing the collected data, or transmits to other devices or systems. We derive an analytical model to calculate the time until it takes to process information after starting to collect data. Therefore, in order to complete the processing data within certain time constraints, we develop some design criteria to control various parameters of the information processing system. Also, we analyze the discrete time model for packet switching networks considering data with no particular arrival nor drop pattern. We analyze the relationship between the number of required packets and average information processing time through numerical examples. By this, we show that the proposed model is able to design the system to be suitable for user's requirements being complementary the quality of information and the information processing time in the system with time constraints.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1998.11a
• /
• pp.194-197
• /
• 1998

Image Processing은 Image Data가 대량이고 내재된 정보가 병렬로 연관성을 가진다는 측면에서 실시간 처리가 용이하지 알다. 본 연구에서는 High Speed Real Time Image Processing을 위한 IPU(Image Processing Unit)와 이를 구동하기 위한 High Speed Real Time image Processing Language인 IPASM(Image Processing Assembly)을 제안한다. 우선 IPU의 기본개념을 설명하고 IPU의 구현을 위한 IPLU(Image Processing Logic Unit)를 설계한다. 그 후 Window98환경에서 구동 가능한 IPASM Interpreter를 실제로 제작하여 IPU의 동작방식을 간접적으로 진단한다.

• 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 Korea Society of Digital Industry and Information Management
• /
• v.11 no.1
• /
• pp.97-109
• /
• 2015

In this paper, we design and implement a two-way automatic communication system using a mobile instant messenger that can provide a customized service through a real-time two-way communication using a mobile instant messaging service. Two-way automatic communication system using a mobile instant messenger can improve the quality and quantity of information in real-time update of the information through the feedback. In addition, since it is communicated by using a mobile Instant Messanger in 1:1 there is no concerns that is recognized as spam, as well as it is possible to provide customized information for each user. Two-way automatic communication system using a mobile instant messanger shows the difference of the speed according to the data input time in typing by hands in result of comparing the time to input a date and the processing speed to search a data. Therefore in category treatment, command processing and natural language processing, Category treatment way is the most excellent in aspect of data processing speed, otherwise in aspect of the total speed to combine the data input time and the processing time, the command processing way is the best method.

• International Journal of Automotive Technology
• /
• v.6 no.2
• /
• pp.171-181
• /
• 2005

The purpose of this paper is two-fold: 1) A novel algorithm in order to extract lane-related information from road images is presented; 2) Design specifications of an image processing onboard unit capable of extracting lane­related information in real-time is also presented. Obtaining precise information from road images requires many features due to the effects of noise that eventually leads to long processing time. By exploiting a FPGA and DSP, we solve the problem of real-time processing. Due to the fact that image processing of road images relies largely on edge features, the FPGA is adopted in the hardware design. The schematic configuration of the FPGA is optimized in order to perform 3 $\times$ 3 Sobel edge extraction. The DSP carries out high-level image processing of recognition, decision, estimation, etc. The proposed algorithm uses edge features to define an Edge Distribution Function (EDF), which is a histogram of edge magnitude with respect to the edge orientation angle. The EDF enables the edge-related information and lane-related to be connected. The performance of the proposed system is verified through the extraction of lane-related information. The experimental results show the robustness of the proposed algorithm and a processing speed of more than 25 frames per second, which is considered quite successful.

• Journal of Information Processing Systems
• /
• v.13 no.4
• /
• pp.941-950
• /
• 2017

The round robin algorithm is regarded as one of the most efficient and effective CPU scheduling techniques in computing. It centres on the processing time required for a CPU to execute available jobs. Although there are other CPU scheduling algorithms based on processing time which use different criteria, the round robin algorithm has gained much popularity due to its optimal time-shared environment. The effectiveness of this algorithm depends strongly on the choice of time quantum. This paper presents a new effective round robin CPU scheduling algorithm. The effectiveness here lies in the fact that the proposed algorithm depends on a dynamically allocated time quantum in each round. Its performance is compared with both traditional and enhanced round robin algorithms, and the findings demonstrate an improved performance in terms of average waiting time, average turnaround time and context switching.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.6
• /
• pp.1635-1656
• /
• 2023

In Bayesian multi-target tracking, the Poisson multi-Bernoulli mixture (PMBM) filter is a state-of-the-art filter based on the methodology of random finite set which is a conjugate prior composed of Poisson point process (PPP) and multi-Bernoulli mixture (MBM). In order to improve the random finite set-based filter utilized in multi-target tracking of sensor scanning, this paper introduces the Poisson multi-Bernoulli mixture filter into time-matching Bayesian filtering framework and derive a tractable and principled method, namely: the time-matching Poisson multi-Bernoulli mixture (TM-PMBM) filter. We also provide the Gaussian mixture implementation of the TM-PMBM filter for linear-Gaussian dynamic and measurement models. Subsequently, we compare the performance of the TM-PMBM filter with other RFS filters based on time-matching method with different birth models under directional continuous scanning and out-of-order discontinuous scanning. The results of simulation demonstrate that the proposed filter not only can effectively reduce the influence of sampling time diversity, but also improve the estimated accuracy of target state along with cardinality.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.6
• /
• pp.825-833
• /
• 2021

In flight tests, aircraft moves in real time, so it is important that data from instrumentation/measurement equipment used to determine aircraft status are processed in necessary form and transmitted to flight control systems in real time. Therefore, through telemetry data processing time reduction and processing cycle improvement in flight test control computer data processing system, in order to provide faster slave-data and safety judgment information to radar/telemetry slave-data processing, flight safety analysis system, emergency destruction transmission system, etc., we developed a PCM processing system that can be operated independently by installing data processing software that can receive and process PCM data in current telemetry data processing system and radar information at the same time. In this paper, we explain classified software functions in detail, starting with overall structure of PCM data processing systems developed by supplementing existing systems. Additionally, PCM data processing system will be supplemented through system stabilization and test operation.

• Journal of Information Processing Systems
• /
• v.5 no.3
• /
• pp.135-144
• /
• 2009

Most of the tasks in wireless sensor networks (WSN) are requested to run in a real-time way. Neither EDF nor FIFO can ensure real-time scheduling in WSN. A real-time scheduling strategy (RTS) is proposed in this paper. All tasks are divided into two layers and endued diverse priorities. RTS utilizes a preemptive way to ensure hard real-time scheduling. The experimental results indicate that RTS has a good performance both in communication throughput and over-load.

• Journal of Information Processing Systems
• /
• v.4 no.1
• /
• pp.9-16
• /
• 2008

This paper describes the design and implementation of a two-tier DBMS for handling massive data and providing faster response time. In the present day, the main requirements of DBMS are figured out using two aspects. The first is handling large amounts of data. And the second is providing fast response time. But in fact, Traditional DBMS cannot fulfill both the requirements. The disk-oriented DBMS can handle massive data but the response time is relatively slower than the memory-resident DBMS. On the other hand, the memory-resident DBMS can provide fast response time but they have original restrictions of database size. In this paper, to meet the requirements of handling large volumes of data and providing fast response time, a two-tier DBMS is proposed. The cold-data which does not require fast response times are managed by disk storage manager, and the hot-data which require fast response time among the large volumes of data are handled by memory storage manager as snapshots. As a result, the proposed system performs significantly better than disk-oriented DBMS with an added advantage to manage massive data at the same time.