• Title/Summary/Keyword: delay time interval

Search Result 229, Processing Time 0.029 seconds

The impact of waiting time and delayed treatment on the outcomes of patients with hepatocellular carcinoma: A systematic review and meta-analysis

  • Feng Yi Cheo;Celeste Hong Fei Lim;Kai Siang Chan;Vishal Girishchandra Shelat
    • Annals of Hepato-Biliary-Pancreatic Surgery
    • /
    • v.28 no.1
    • /
    • pp.1-13
    • /
    • 2024
  • Hepatocellular carcinoma (HCC) is the sixth most diagnosed cancer worldwide. Healthcare resource constraints may predispose treatment delays. We aim to review existing literature on whether delayed treatment results in worse outcomes in HCC. PubMed, Embase, The Cochrane Library, and Scopus were systematically searched from inception till December 2022. Primary outcomes were overall survival (OS) and disease-free survival (DFS). Secondary outcomes included post-treatment mortality, readmission rates, and complications. Fourteen studies with a total of 135,389 patients (delayed n = 25,516, no delay n = 109,873) were included. Age, incidence of male patients, Child-Pugh B cirrhosis, and Barcelona Clinic Liver Cancer Stage 0/A HCC were comparable between delayed and no delay groups. Tumor size was significantly smaller in delayed versus no delay group (mean difference, -0.70 cm; 95% confidence interval [CI]: -1.14, 0.26; p = 0.002). More patients received radiofrequency ablation in delayed versus no delay group (OR, 1.22; 95% CI: 1.16, 1.27; p < 0.0001). OS was comparable between delayed and no delay in HCC treatment (hazard ratio [HR], 1.13; 95% CI: 0.99, 1.29; p = 0.07). Comparable DFS between delayed and no delay groups (HR, 0.99; 95% CI: 0.75, 1.30; p = 0.95) was observed. Subgroup analysis of studies that defined treatment delay as > 90 days showed comparable OS in the delayed group (HR, 1.04; 95% CI: 0.93, 1.16; p = 0.51). OS and DFS for delayed treatment were non-inferior compared to no delay, but might be due to better tumor biology/smaller tumor size in the delayed group.

Relationship among Degree of Time-delay, Input Variables, and Model Predictability in the Development Process of Non-linear Ecological Model in a River Ecosystem (비선형 시계열 하천생태모형 개발과정 중 시간지연단계와 입력변수, 모형 예측성 간 관계평가)

  • Jeong, Kwang-Seuk;Kim, Dong-Kyun;Yoon, Ju-Duk;La, Geung-Hwan;Kim, Hyun-Woo;Joo, Gea-Jae
    • Korean Journal of Ecology and Environment
    • /
    • v.43 no.1
    • /
    • pp.161-167
    • /
    • 2010
  • In this study, we implemented an experimental approach of ecological model development in order to emphasize the importance of input variable selection with respect to time-delayed arrangement between input and output variables. Time-series modeling requires relevant input variable selection for the prediction of a specific output variable (e.g. density of a species). Inadequate variable utility for input often causes increase of model construction time and low efficiency of developed model when applied to real world representation. Therefore, for future prediction, researchers have to decide number of time-delay (e.g. months, weeks or days; t-n) to predict a certain phenomenon at current time t. We prepared a total of 3,900 equation models produced by Time-Series Optimized Genetic Programming (TSOGP) algorithm, for the prediction of monthly averaged density of a potamic phytoplankton species Stephanodiscus hantzschii, considering future prediction from 0- (no future prediction) to 12-months ahead (interval by 1 month; 300 equations per each month-delay). From the investigation of model structure, input variable selectivity was obviously affected by the time-delay arrangement, and the model predictability was related with the type of input variables. From the results, we can conclude that, although Machine Learning (ML) algorithms which have popularly been used in Ecological Informatics (EI) provide high performance in future prediction of ecological entities, the efficiency of models would be lowered unless relevant input variables are selectively used.

Improving the Performance of Cellular Network by Controlling SIP Retransmission Time Interval and Implementing Home Network (셀룰러 망에서 SIP 재전송 간격조절에 의한 성능 개선과 이를 이용한 홈 네트워크 구현)

  • Kwon, Kyung-Hee;Kim, Jin-Hee;Go, Yun-Mi
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.2
    • /
    • pp.67-73
    • /
    • 2008
  • Recently, due to the rapid advances of mobile communication, multimedia service can be provided by mobile devices. Cellular network tends to uses SIP as a call setup protocol in order to provide various multimedia service to consumers. Cellular network holds the characteristic of higher BER(Bit Error Rate), narrower bandwidth than the wired network. The value of SIP RTI(Retransmission Time interval) based on the wired network decreases a network efficiency and increases a call setup delay over cellular network. By using NS-2 simulator, we show new SIP RTI value adequate over cellular network. We design and implement home network by using the modified SIP that is suitable for cellular network.

A Neural Network Aided Kalman Filtering Approach for SINS/RDSS Integrated Navigation

  • Xiao-Feng, He;Xiao-Ping, Hu;Liang-Qing, Lu;Kang-Hua, Tang
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • v.1
    • /
    • pp.491-494
    • /
    • 2006
  • Kalman filtering (KF) is hard to be applied to the SINS (Strap-down Inertial Navigation System)/RDSS (Radio Determination Satellite Service) integrated navigation system directly because the time delay of RDSS positioning in active mode is random. BP (Back-Propagation) Neuron computing as a powerful technology of Artificial Neural Network (ANN), is appropriate to solve nonlinear problems such as the random time delay of RDSS without prior knowledge about the mathematical process involved. The new algorithm betakes a BP neural network (BPNN) and velocity feedback to aid KF in order to overcome the time delay of RDSS positioning. Once the BP neural network was trained and converged, the new approach will work well for SINS/RDSS integrated navigation. Dynamic vehicle experiments were performed to evaluate the performance of the system. The experiment results demonstrate that the horizontal positioning accuracy of the new approach is 40.62 m (1 ${\sigma}$), which is better than velocity-feedback-based KF. The experimental results also show that the horizontal positioning error of the navigation system is almost linear to the positioning interval of RDSS within 5 minutes. The approach and its anti-jamming analysis will be helpful to the applications of SINS/RDSS integrated systems.

  • PDF

A Novel extended Horizon Self-tuning Control Using Incremental Estimator (증분형 추정기를 사용한 새로운 장구간 예측 자기동조 제어)

  • 박정일;최계근
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.25 no.6
    • /
    • pp.614-628
    • /
    • 1988
  • In the original incremental Extended Horizon Control, the control inputs are computed recursively each step in the prediction horizon. But in this paper, we propose another incremental Extended Horizon Self-tuning Control version in which control inputs can be computed directly in any time interval. The effectiveness of this algorithm in a variable time delay or load disturbances environment is demonstrated by computer simulation. The controlled plant is a nonminimum phase system.

  • PDF

An investigation on ignition ability of the repetitive sparks (반복점화방식의 점화능력에 관한 연구)

  • 조경국;정인석
    • Journal of the korean Society of Automotive Engineers
    • /
    • v.10 no.3
    • /
    • pp.60-65
    • /
    • 1988
  • The ignition characteristics of repetitive electric sparks into a quiescent acetylene-air premixture and LPG-argon-air premixture was investigated by using a home-made Repetitive-Spark-Generator(RSG) to elucidate the effect of fuel burning velocity to ignition ability of RSG. Results show that the optimum spark delay time interval is strongly related with fuel burning velocity, or implicitly with characteristic reaction time scale of each fuel.

  • PDF

Synthesis of Pipeline Structures with Variable Data Initiation Intervals (가변 데이터 입력 간격을 지원하는 파이프라인 구조의 합성)

  • 전홍신;황선영
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.31A no.6
    • /
    • pp.149-158
    • /
    • 1994
  • Through high level synthesis, designers can obtain the precious information on the area and speed trade-offs as well as synthesized datapaths from behavioral design descriptions. While previous researches were concentrated on the synthesis of pipelined, datapaths with fixed DII (Data Initiation Interval) by inserting delay elements where needed, we propose a novel methodology of synthesizing pipeline structures with variable DIIs. Determining the time-overlapping of pipeline stages with variable DIIs, the proosed algorithm performs scheduling and module allocation using the time-overlapping information. Experimental results show that significant improvement can be achieved both in speed and in area.

  • PDF

OFDM/OQAM-IOTA System (OFDM/OQAM-IOTA 시스템)

  • Zhou, Xiao;Heo, Joo;Chang, KyungHi
    • Journal of Advanced Navigation Technology
    • /
    • v.8 no.2
    • /
    • pp.120-128
    • /
    • 2004
  • Although conventional OFDM/QAM modulation scheme using guard interval is robust to channel induced ISI (Inter-Symbol Interference) in time-domain, it is very sensitive to ICI (Inter-Carrier Interference) due to doppler effect in frequency domain. OFDM/OQAM-IOTA modulation scheme utilizes IOTA (Isotropic Orthogonal Transform Algorithm) filter that has orthogonality in time and frequency domain so that it is robust to delay spread and doppler effect. OFDM/OQAM-IOTA system can increase bandwidth effeciency since it does not use guard interval. In this paper, we show the structure of OFDM/OQAM-IOTA and perfect channel estimation scheme for OFDM/OQAM-IOTA system. We also compare OFDM/OQAM-IOTA system and OFDM/QAM system in AWGN and 1-path Rayleigh fading channel. Simulation results show that OFDM/OQAM system outperforms OFDM/QAM system.

  • PDF

Performance of MIMO-OFDM System with Linear Pre-Equalization over Fading Channel (페이딩 환경에서 선형 사전 등화를 이용한 MIMO-OFDM 시스템의 성능)

  • Bae, Jung-Nam;Park, Woo-Chul;Kim, Jin-Young
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.21 no.11
    • /
    • pp.1269-1274
    • /
    • 2010
  • Wireless communication channels with the most severe multipath fading phenomenon that appears each time a different delay is caused by the frequency selective fading. At this time, ISI due to the performance degradation of wireless communication channels and data transfer speed gives the constraints. OFDM technique can remove ISI inserting longer guard interval than channel delay spread of channel between symbol. However, the multi-path delay of the channel to be serious with the guard interval can not eliminate ISI. In this case, using the equalizer must compensate. Especially, use of equalizer is need absolutely as data rate becomes high speed. In this paper, we analyze the BER performance with pre-equalization for MIMO-OFDM over fading channel. The results of this paper can be applied to MIMO-OFDM system with equalization.

Low Cost and Acceptable Delay Unicast Routing Algorithm Based on Interval Estimation (구간 추정 기반의 지연시간을 고려한 저비용 유니캐스트 라우팅 방식)

  • Kim, Moon-Seong;Bang, Young-Cheol;Choo, Hyun-Seung
    • The KIPS Transactions:PartC
    • /
    • v.11C no.2
    • /
    • pp.263-268
    • /
    • 2004
  • The end-to-end characteristic Is an important factor for QoS support. Since network users and required bandwidths for applications increase, the efficient usage of networks has been intensively investigated for the better utilization of network resources. The distributed adaptive routing is the typical routing algorithm that is used in the current Internet. The DCLC(Delay Constrained 1.east Cost) path problem has been shown to be NP-hard problem. The path cost of LD path is relatively more expensive than that of LC path, and the path delay of LC path is relatively higher than that of LD path in DCLC problem. In this paper, we investigate the performance of heuristic algorithm for the DCLC problem with new factor which is probabilistic combination of cost and delay. Recently Dr. Salama proposed a polynomial time algorithm called DCUR. The algorithm always computes a path, where the cost of the path is always within 10% from the optimal CBF. Our evaluation showed that heuristic we propose is more than 38% better than DCUR with cost when number of nodes is more than 200. The new factor takes in account both cost and delay at the same time.