• Title/Summary/Keyword: Time Information

Search Result 44,056, Processing Time 0.053 seconds

Evaluating GHG Emissions Reduced by Real-time Traffic Information in Gasoline Vehicle (실시간교통정보 이용에 따른 가솔린차량의 온실가스 저감효과 평가)

  • Kim, Jun-Hyung;Um, Jung-Sup
    • Journal of Korean Society for Atmospheric Environment
    • /
    • v.27 no.4
    • /
    • pp.443-453
    • /
    • 2011
  • Real-time Traffic Information Service could play a key role in reducing incomplete combustion time remarkably since it can provide traffic information in real-time basis. Emission characteristics of test engines were studied in terms of travel distance and speed. The present study focused on a north district in Daegu, 12 km. The driving for the emission test was done at 8AM, 3PM, 7PM which represents various traffic conditions. The reduced emissions of Greenhouse Gases (GHG) have been measured for a travel distance running at different loads (conventional shortest route and Real-time Traffic Information) and GHG ($CO_2$, $CH_4$, $N_2O$) are all inventoried and calculated in terms of existing emission factors. The emission of GHG has been shown to reduce linearly with travel distance: $CO_2$ (9.15%), $CH_4$ (18.43%), $N_2O$(18.62%).

The Dilemma of Parameterizing Propagation Time in Blockchain P2P Network

  • Rahmadika, Sandi;Noh, Siwan;Lee, Kyeongmo;Kweka, Bruno Joachim;Rhee, Kyung-Hyune
    • Journal of Information Processing Systems
    • /
    • v.16 no.3
    • /
    • pp.699-717
    • /
    • 2020
  • Propagation time on permissionless blockchain plays a significant role in terms of stability and performance in the decentralized systems. A large number of activities are disseminated to the whole nodes in the decentralized peer-to-peer network, thus causing propagation delay. The stability of the system is our concern in the first place. The propagation delay opens up opportunities for attackers to apply their protocol. Either by accelerating or decelerating the propagation time directly without proper calculation, it brings numerous negative impacts to the entire blockchain system. In this paper, we thoroughly review and elaborate on several parameters related to the propagation time in such a system. We describe our findings in terms of data communication, transaction propagation, and the possibility of an interference attack that caused an extra propagation time. Furthermore, we present the influence of block size, consensus, and blockchain scalability, including the relation of parameters. In the last session, we remark several points associated with the propagation time and use cases to avoid dilemmas in the light of the experiments and literary works.

Research on The SWIPT System Throughput Based on Interference Signal Energy Collecting

  • Jianxiong Li;Hailong Jiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.8
    • /
    • pp.2170-2187
    • /
    • 2023
  • The general interference is the imperative trouble for simultaneous wireless information and power transfer (SWIPT) system. Although interference has bad influences on the performance of the system, it carries energy simultaneously. In this paper, the energy-constrained relay of the SWIPT system needs to spend much time on energy collecting (EC) in the information transmission (IT) period. Therefore, we propose the scheme of interference signal energy collecting (ISEC) when the interference is strong, and the SWIPT system does not carry out IT. The relay of the system continues to collect energy and stores it until the interference has minimal impact on IT. Then the system performs IT. We divide the collected interference energy equally into several parts, and each IT block receives one part. The proposed scheme is appealing because it can reduce the time of EC in IT period to make the relay spends more time forwarding the received signal in order to improve the performance of the system throughput. Furthermore, we propose a time-switching (TS) protocol based on EC at the relay. And it allows the relay forwarding signal at an appropriate power. Under the protocol, the time of EC can be flexible according to the forwarding power that we give so that the collected energy can be used more efficiently. We give the expressions of the system throughput according to the proposed scheme and protocol. Moreover, the influence of the interference power on the system throughput is also studied.

Verification of ERP Standard Time Using TOC Technique and Improvement of MES Routing Point (TOC 기법을 적용한 ERP 표준시간 검증 및 MES 공정실적개선)

  • Kim, Sung-Min;Ahn, Jaekyoung
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.41 no.4
    • /
    • pp.22-33
    • /
    • 2018
  • Recently domestic manufacturing companies have been experiencing worsening profitability and stunted growth due to the long-term economic recession and the rapid rise of developing countries such as China and Southeast Asia. These difficulties force many companies to concentrate their core competencies on new value creation and innovation in order to gain momentum for new growth. Enterprise Resource Planning (ERP) has been considered as one of viable solutions. Among the various modules in ERP, shop floor control function in the production management module is rather limited. In order to overcome this problem, Manufacturing Execution System (MES) has been used as a subsystem which has a strong information gathering power and flexibility. Both systems interact closely with each other. In particular, ERP requires fast, accurate shop floor information at MES. This paper describes how to synchronize relevant information between ERP and MES with theory of constraints (TOC). The processing time information transmitted from the MES workplace is received at the ERP workplace. In the process, the received processing time is causing information distortion in ERP, when the information gathering standard of MES is different from the ERP information interpretation standard. The Drum-Buffer-Rope theory of TOC was applied to resolve this problem, therefore, information synchronization between both systems was made. As a precondition, the standard time of the upper ERP system was rearranged according to the capacity constraints resource. As a result, standard time restructuring has affected changes in labor costs. Standard labor costs have come close to actual ones, and information synchronization of MES transmission data has improved the reliability of standard product costs, such that it enabled various company-wide restructuring actions to be much more effective.

Improvement of Information Connection System among Traffic Information Centers (교통정보센터 간 정보 연계체계 개선방안)

  • Lim, Sung Han
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.13 no.2
    • /
    • pp.34-41
    • /
    • 2014
  • The purpose of this study is to present the improvement of connection system between traffic information centers for reliable traffic information service. We recognized traffic information error caused by too much time in conjunction between traffic information centers, lack of reliability of traffic information caused by absence of generation time and generation institution of traffic information. We presented minimization methods of connection time, improvement methods of reliability of traffic information and development methods of connection state management system.

Time Synchronization Error and Calibration in Integrated GPS/INS Systems

  • Ding, Weidong;Wang, Jinling;Li, Yong;Mumford, Peter;Rizos, Chris
    • ETRI Journal
    • /
    • v.30 no.1
    • /
    • pp.59-67
    • /
    • 2008
  • The necessity for the precise time synchronization of measurement data from multiple sensors is widely recognized in the field of global positioning system/inertial navigation system (GPS/INS) integration. Having precise time synchronization is critical for achieving high data fusion performance. The limitations and advantages of various time synchronization scenarios and existing solutions are investigated in this paper. A criterion for evaluating synchronization accuracy requirements is derived on the basis of a comparison of the Kalman filter innovation series and the platform dynamics. An innovative time synchronization solution using a counter and two latching registers is proposed. The proposed solution has been implemented with off-the-shelf components and tested. The resolution and accuracy analysis shows that the proposed solution can achieve a time synchronization accuracy of 0.1 ms if INS can provide a hard-wired timing signal. A synchronization accuracy of 2 ms was achieved when the test system was used to synchronize a low-grade micro-electromechanical inertial measurement unit (IMU), which has only an RS-232 data output interface.

  • PDF

Real-time line control system for automated robotic assembly line for multi-PCB models

  • Park, Jong-Oh;Hyun, Kwang-Ik;Um, Doo-Gan;Kim, Byoung-Doo;Cho, Sung-Jong;Park, In-Gyu;Kim, Young-Sik
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1991.10b
    • /
    • pp.1915-1919
    • /
    • 1991
  • The efficiency of automated assembly line is increased by realizing the automation of each assembly cell, monitoring the line information and developing the real-time line control system it. which production flow is controllable. In this paper, the several modules which are important factors when constructing automated real-time control system, such as, line control S/W module, real-time model change module, error handling module and line production management S/W module, are developed. For developing these important programming modules, real-time control and multi-tasking techniques are integrated. In this paper, operating method of real-time line control in PCB automated assembly line is proposed and for effective control of production line by using multi-tasking technique, proper operating method for relating real-time line control with multi-tasking is proposed by defining the levels of signals and tasks. CIM-Oriented modular programming method considering expandability and flexibility will be added for further research in the future.

  • PDF

Super-allocation and Cluster-based Cooperative Spectrum Sensing in Cognitive Radio Networks

  • Miah, Md. Sipon;Yu, Heejung;Rahman, Md. Mahbubur
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.10
    • /
    • pp.3302-3320
    • /
    • 2014
  • An allocation of sensing and reporting times is proposed to improve the sensing performance by scheduling them in an efficient way for cognitive radio networks with cluster-based cooperative spectrum sensing. In the conventional cooperative sensing scheme, all secondary users (SUs) detect the primary user (PU) signal to check the availability of the spectrum during a fixed sensing time slot. The sensing results from the SUs are reported to cluster heads (CHs) during the reporting time slots of the SUs and the CHs forward them to a fusion center (FC) during the reporting time slots of the CHs through the common control channels for the global decision, respectively. However, the delivery of the local decision from SUs and CHs to a CH and FC requires a time which does not contribute to the performance of spectrum sensing and system throughput. In this paper, a super-allocation technique, which merges reporting time slots of SUs and CHs to sensing time slots of SUs by re-scheduling the reporting time slots, has been proposed to sense the spectrum more accurately. In this regard, SUs in each cluster can obtain a longer sensing duration depending on their reporting order and their clusters except for the first SU belonged to the first cluster. The proposed scheme, therefore, can achieve better sensing performance under -28 dB to -10 dB environments and will thus reduce reporting overhead.

A Real-Time Data Mining for Stream Data Sets (연속발생 데이터를 위한 실시간 데이터 마이닝 기법)

  • Kim Jinhwa;Min Jin Young
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.29 no.4
    • /
    • pp.41-60
    • /
    • 2004
  • A stream data is a data set that is accumulated to the data storage from a data source over time continuously. The size of this data set, in many cases. becomes increasingly large over time. To mine information from this massive data. it takes much resource such as storage, memory and time. These unique characteristics of the stream data make it difficult and expensive to use this large size data accumulated over time. Otherwise. if we use only recent or part of a whole data to mine information or pattern. there can be loss of information. which may be useful. To avoid this problem. we suggest a method that efficiently accumulates information. in the form of rule sets. over time. It takes much smaller storage compared to traditional mining methods. These accumulated rule sets are used as prediction models in the future. Based on theories of ensemble approaches. combination of many prediction models. in the form of systematically merged rule sets in this study. is better than one prediction model in performance. This study uses a customer data set that predicts buying power of customers based on their information. This study tests the performance of the suggested method with the data set alone with general prediction methods and compares performances of them.

Time-Delay Estimation in the Multi-Path Channel based on Maximum Likelihood Criterion

  • Xie, Shengdong;Hu, Aiqun;Huang, Yi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.4
    • /
    • pp.1063-1075
    • /
    • 2012
  • To locate an object accurately in the wireless sensor networks, the distance measure based on time-delay plays an important role. In this paper, we propose a maximum likelihood (ML) time-delay estimation algorithm in multi-path wireless propagation channel. We get the joint probability density function after sampling the frequency domain response of the multi-path channel, which could be obtained by the vector network analyzer. Based on the ML criterion, the time-delay values of different paths are estimated. Considering the ML function is non-linear with respect to the multi-path time-delays, we first obtain the coarse values of different paths using the subspace fitting algorithm, then take them as an initial point, and finally get the ML time-delay estimation values with the pattern searching optimization method. The simulation results show that although the ML estimation variance could not reach the Cramer-Rao lower bounds (CRLB), its performance is superior to that of subspace fitting algorithm, and could be seen as a fine algorithm.