• Journal of Positioning, Navigation, and Timing
• /
• v.12 no.3
• /
• pp.237-244
• /
• 2023

A signal generation simulator is an economical and useful solution in Global Navigation Satellite System (GNSS) receiver design and testing. A software-defined radio approach is widely used both in receivers and simulators, and its flexible structure to adopt to new signals is ideally suited to the testing of a receiver and signal processing algorithm in the signal design phase of a new satellite-based navigation system before the deployment of satellites in space. The generation of highly accurate delayed sampled codes is essential for generating signals in the simulator, where its sampling rate should be chosen to satisfy constraints such as Nyquist criteria and integer and non-commensurate properties in order not to cause any distortion of original signals. A high sampling rate increases the accuracy of code delay, but decreases the computational efficiency as well, and vice versa. Therefore, the selected sampling rate should be as low as possible while maintaining a certain level of code delay accuracy. This paper presents the lower limits of the sampling rate for GNSS signal generation simulators. In the simulation, two distinct code generation methods depending on the sampling position are evaluated in terms of accuracy versus computational efficiency to show the lower limit of the sampling rate for several GNSS signals.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.5 no.4
• /
• pp.45-53
• /
• 2015

In this paper, an approach of temporal certification system that can be easily added on current character-based certification system is newly introduced. This technique enhances the security of the password certification process by exploiting temporal information for each character's stroke timing, and using them as another feature of certification information, on top of character comparison process. There are three different temporal conditions: maximum, minimum and no-option. The maximum condition along with a time number (usually 0.2 second or less) means that the next key input should be punched within the time limit, while the minimum condition means the next key stroke should be typed after the time lapse specified. With no-option condition chosen, user can punch the password without any timing constraints. Prototype was developed and tested with four number password case. In comparison with 104 cases, this new approach increases the cases more than 10 digits, enhancing the security of the certification process. One big advantage of this new approach is that user can update his/her password only with different timing constraints, still keeping the same characters, that will enhance the security system management efficiency in a very simple way. Figures and pictures along with process flow are included for the validity of the idea.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.2
• /
• pp.244-253
• /
• 1994

Computer networks need a variety of services. Some services such as, video, voice and plantcontrol traffic require a real-time communication with explicit timing constraints. In this pater, we introduce a real-time communication technique which use a reservation technique on dualilnk networks. We introduce an enhanced technique that determines priorities of the message based on time constraints when real-time messages are transmitted. A simulation was conducted to compare and to analyze traditional technique. We used the SLAM II language to simulate this technique. Message loss rate were compared and analyzed as a performance criteria in this simulation.

• Journal of Internet Computing and Services
• /
• v.5 no.1
• /
• pp.67-84
• /
• 2004

Real-time database systems (RTDBS) are database systems whose transactions are associated with timing constraints such as deadlines. Therefore transaction needs to be completed by a certain deadline. Besides meeting timing constraints, a RTDBS needs to observe data consistency constraints as well. That is to say, unlike a conventional database system, whose main objective is to provide fast average response time, RTDBS may be evaluated based on how often transactions miss their deadline, the average lateness or tardiness of late transactions, the cost incurred in transactions missing their deadlines. Therefore, in RTDBS, transactions should be scheduled according to their criticalness and tightness of their deadlines, even If this means sacrificing fairness and system throughput, And It always must guarantee preceding process of the transaction with the higher priority. In this paper, we propose an efficient real-time scheduling algorithm (Multi-level EFDF) that alleviates problems of the existing real-time scheduling algorithms, a real-time concurrency control algorithm(2PL-FT) for firm and soft real-time transactions. And we compare the proposed 2PL F[ with AVCC in terms of the restarting ratio and the deadline missing ratio of transactions. We show through experiments that our algorithms achieve good performance over the other existing methods proposed earlier.

• International Journal of Computer Science & Network Security
• /
• v.21 no.12
• /
• pp.137-142
• /
• 2021

Distance learning universities provide online course content. The main methods of providing class contents are on-demand and live-streaming. This means that students are not restricted by time or space. The advantage is that students can take the course anytime and anywhere. Therefore, unlike commuting students, there is no commuting time to the campus, and there is no natural process required to take classes. However, despite this convenient situation, the attendance rate and graduation rate of distance learning universities tend to be lower than that of commuting universities. Although the course environment is not the only factor, students cannot obtain a bachelor's degree unless they fulfill the graduation requirements. In both commuter and distance learning universities, taking classes is an important factor in earning credits. There are fewer time and space constraints for distance learning students than for commuting students. It is also easy for distance learning students to take classes at their own timing. There should be more ease of learning than for students who commute to school with restrictions. However, it is easier to take a course at a commuter university that conducts face-to-face classes. I thought that the reason for this was that commuting to school was a part of the process of taking classes for commuting students. Commuting to school was thought to increase the willingness and motivation to take classes. Therefore, I thought that the inconvenient constraints might encourage students to take the course. In this research, I focused on the act of commuting to school by students. These situations are also applied to the distance learning environment. The students have physical time constraints. To achieve this goal, I will implement a course restriction method that aims to promote the willingness and attitude of students. Therefore, in this paper, I have implemented a virtual school system called "virtual go to school (VG2S)" that reflects the actual route to school.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.6
• /
• pp.433-440
• /
• 2000

To flexibly evaluate performance and reliability of a real-time system which is intrinsically characterized by stringent timing constraints to generate correct responses, we propose fuzzyrandom variables and build a discrete event model embedded with fuzzy-random variables. Also, we adapt fuzzy-variables to a path-space approach, which derives the upper and lower bounds of reliability by using a semi-Markov model that explicitly contains the deadline information. Consequently, we propose certain formulas of state automata properly transformed by fuzzy-random variables, and present numerical examples applying the formulas to RTP(Rapid Thermal Process) to show that a complex system can be properly evaluated based on this model by computer simulation.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06a
• /
• pp.166-169
• /
• 2011

안전성이 중요한 실시간 내장형 시스템인 유도조종장치에서 시간 제약성을 만족하는 것은 매우 중요한 문제이다. 기존 유도조종장치 소프트웨어 개발에서는 주로 테스트 단계에서 시간 제약성 만족을 확인한다. 하지만 이 방법은 늦은 오류의 발견으로 인해 전체 소프트웨어 개발 비용이 커질 가능성이 있다. 이러한 단점을 극복하기위해 본 논문에서는 설계 단계에 정형 기법을 적용하여 유도조총장치 소프트웨어의 시간 제약성을 검증하고자 한다. 이를 위해서 실시간 시스템에 대한 모델링과 검증을 지원하는 TIMES 도구를 유도조종장치 소프트웨어 설계에 적용하는 사례 연구를 수혈하고 그 결과를 분석 및 평가하였다.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.49 no.7
• /
• pp.363-369
• /
• 2000

To flexibly evaluate performance and reliability of an electric power system in the aspect of the real-time system which is intrinsically characterized by stringent timing constraints fails catastrophically if its control input is not updated by its digital controller computer within a certain time limit called the hard deadline, we propose fuzzy-random variables and build a discrete event model embedded with fuzzy-random variables. Also, we adapt fuzzy-variables to a path-space approach, which derives the upper and lower bounds of reliability by using a semi-Markov model that explicitly contains the deadline information. Consequently, we propose certain formulas of state automata properly transformed by fuzzy-random variables, and present numerical examples applying the formulas as well.

• Proceedings of the KIEE Conference
• /
• 1999.11c
• /
• pp.509-511
• /
• 1999

실시간 제어시스템은 데드라인(deadline)이라는 시간 제약성을 가지며. 데드라인 이내의 작업수행 여부에 따라서 시스템의 안정성 및 신뢰성 보장을 평가할 수 있다. 본 연구에서는 실시간 시스템 제어기의 시간 지연에 의한 시스템의 영향과 이에 따른 시간 제약성에 대한 연구가 수행된다. 정상상태의 제어기의 시간 지연은 그 효과가 미약하여 일반적으로 고려하지 않는다. 그러나, 시스템의 고장상태 즉, 비정상적인 상태의 시간지연은 비록 랜덤하게 발생되나 발생시에는 전체시스템에 미치는 영향이 매우 크므로 이를 반드시 고려하고, 이에 대한 분석이 필요하다. 먼저, 단일작업을 수행하는 선형시불변 및 비선형시스템에 대한 데드라인 유도하고, Path-space approach 기법에 의해 신뢰도 상위 및 하위 경계값을 유도한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06d
• /
• pp.476-479
• /
• 2008

Wireless Sensor Network typically incorporates various real time applications that must meet timing constraints under severe resource limitations. Due to the high data rate and burst traffic for that type of applications, occurrence of congestion is very common. Ensuring the end-to-end deadline under congested scenario is quite challenging. In this paper we propose a hop-by-hop rate control algorithm which avoids the congestion as well as ensures that the real time traffic will meet the end-to-end deadline by guaranteeing the meeting of local deadline at intermediate hop. Finally, simulation has demonstrated the effectiveness of our approach.