• Title/Summary/Keyword: Repeat time

Search Result 344, Processing Time 0.034 seconds

M/G/1 Preemptive Priority Queues With Finite and Infinite Buffers (유한 및 무한 용량 대기열을 가지는 선점 우선순위 M/G/1 대기행렬)

  • Kim, Kilhwan
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.43 no.4
    • /
    • pp.1-14
    • /
    • 2020
  • Recently, M/G/1 priority queues with a finite buffer for high-priority customers and an infinite buffer for low-priority customers have applied to the analysis of communication systems with two heterogeneous traffics : delay-sensitive traffic and loss-sensitive traffic. However, these studies are limited to M/G/1 priority queues with finite and infinite buffers under a work-conserving priority discipline such as the nonpreemptive or preemptive resume priority discipline. In many situations, if a service is preempted, then the preempted service should be completely repeated when the server is available for it. This study extends the previous studies to M/G/1 priority queues with finite and infinite buffers under the preemptive repeat-different and preemptive repeat-identical priority disciplines. We derive the loss probability of high-priority customers and the waiting time distributions of high- and low-priority customers. In order to do this, we utilize the delay cycle analysis of finite-buffer M/G/1/K queues, which has been recently developed for the analysis of M/G/1 priority queues with finite and infinite buffers, and combine it with the analysis of the service time structure of a low-priority customer for the preemptive-repeat and preemptive-identical priority disciplines. We also present numerical examples to explore the impact of the size of the finite buffer and the arrival rates and service distributions of both classes on the system performance for various preemptive priority disciplines.

A Simple Java Sequence Alignment Editing Tool for Resolving Complex Repeat Regions

  • Ham, Seong-Il;Lee, Kyung-Eun;Park, Hyun-Seok
    • Genomics & Informatics
    • /
    • v.7 no.1
    • /
    • pp.46-48
    • /
    • 2009
  • Finishing is the most time-consuming step in sequencing, and many genome projects are left unfinished due to complex repeat regions. Here, we have developed BACContigEditor, a prototype shotgun sequence finishing tool. It is essentially an editor that visualizes assemblies of shotgun sequence fragment reads as gapped multiple alignments. The program offers some flexibility that is needed to rapidly resolve complex regions within a working session. The sole purpose of the release is to promote collaborative creation of extensible software for fragment assembly editors, foster collaborative development, and reduce barriers to initial tool development effort. We describe our software architecture and identify current challenges. The program is available under an Open Source license.

Application of Rate Compatible Punctured Turbo Coded Hybrid ARQ to MC-CDMA Mobile Radio

  • Garg, Deepshikha;Adachi, Fumiyuki
    • ETRI Journal
    • /
    • v.26 no.5
    • /
    • pp.405-412
    • /
    • 2004
  • MC-CDMA, a multicarrier (MC) modulation scheme based on code division multiple access (CDMA), is the most likely candidate for the next generation of mobile radio communications. The rate compatible punctured turbo (RCPT) coded hybrid automatic repeat request (HARQ) has been found to give improved throughput performance in a direct sequence (DS) CDMA system. However, the extent to which the RCPT HARQ improves the throughput performance of an MC-CDMA system has not been fully understood. In this paper, we apply the RCPT HARQ to MC-CDMA and evaluate by computer simulations its performance in a frequency selective Rayleigh fading channel. We found that the performance of RCPT HARQ MC-CDMA is almost insensitive to channel characteristics. The performance can be drastically improved with receive diversity combined with space-time transmit diversity. In addition, the comparison of RCPT HARQ MC-CDMA, orthogonal frequency division multiplexing, and DS-CDMA shows that under similar conditions the throughput of MC-CDMA is the best in a frequency selective fading channel.

  • PDF

Automatic Vowel Sequence Reproduction for a Talking Robot Based on PARCOR Coefficient Template Matching

  • Vo, Nhu Thanh;Sawada, Hideyuki
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.5 no.3
    • /
    • pp.215-221
    • /
    • 2016
  • This paper describes an automatic vowel sequence reproduction system for a talking robot built to reproduce the human voice based on the working behavior of the human articulatory system. A sound analysis system is developed to record a sentence spoken by a human (mainly vowel sequences in the Japanese language) and to then analyze that sentence to give the correct command packet so the talking robot can repeat it. An algorithm based on a short-time energy method is developed to separate and count sound phonemes. A matching template using partial correlation coefficients (PARCOR) is applied to detect a voice in the talking robot's database similar to the spoken voice. Combining the sound separation and counting the result with the detection of vowels in human speech, the talking robot can reproduce a vowel sequence similar to the one spoken by the human. Two tests to verify the working behavior of the robot are performed. The results of the tests indicate that the robot can repeat a sequence of vowels spoken by a human with an average success rate of more than 60%.

Factors Affecting Patient Satisfaction of Dental Services Organizations (치과의료서비스에 대한 환자만족 영향원인 -경남 일부 지역 치과의원을 중심으로-)

  • Lee, Eun-Sook;Park, Jeong-Ran;Choi, Mi-Sook
    • Journal of Korean society of Dental Hygiene
    • /
    • v.5 no.2
    • /
    • pp.247-261
    • /
    • 2005
  • The main objective of this study is to investigate the factors affecting patient satisfaction, repeat-use intention, and inducement intention for providing the suggestion for patient-oriented management of dental services organizations. For this study, the patient satisfaction model including 14 facets of satisfaction factors such as distance(time/location), human services(dentist-hygienist), treatment results, and facilities(convenient facilities/parking lot) was examined. Data were collected from 196 patients who visiting the same dental services organization more than two times of ten dental clinics at Kyeongsangnam-do area using self-administered questionnaire. Major results of the empirical analysis are as follows: First, patient satisfaction, repeat-use intention, and inducement intention were significantly correlated with gender, age, economic conditions among patients of dental clinics. Second, kindness of hygienist, treatment results, kindness of receptionist, waiting time, emergency medical services, and right-fee for services were found to have significant influence on dental services organizations. These research findings suggest that improvement of service quality in dental care and advancement in treatment ability of dentist and hygienist are very important to improve patient satisfaction and patient-oriented service system in dental services organizations.

  • PDF

Real-time PCR assay for the Detection of Toxoplasma gondii in Retail Meats: Proof-of-concept Study (유통식육에서의 톡소포자충 검출을 위한 유전자검사법 개발)

  • Yun, Han Seong;Suh, Soo Hwan;Kwak, Hyo-Sun;Joo, In-Sun
    • Journal of Food Hygiene and Safety
    • /
    • v.32 no.3
    • /
    • pp.199-205
    • /
    • 2017
  • Although many PCR-based assays have been developed, the majority of rapid detection of Toxoplasma gondii in animal and their meat product has been dependent on immunogenic assays. Thus, there is still a need for more reliable PCR based detection method for T. gondii in retail meats. Recently, a 529-bp repeat element that exists in 200-300 copies per genome of T. gondii genome had been spotlighted for its usefulness as potential detection targers. In this study, the 529-bp repeat element was selected for real-time PCR to detect three types of T. gondii (type I, II and III). A primer pair targeting 82-bp of the 529-bp element detected all three types of T. gondii and showed high level of specificity against 14 different food-borne pathogens as well as 3 protozoan parasites such as Giardia lamblia, Cryptosporidium parvum and Entamoeba histolytica. Application of the new real-time PCR assay in meat samples showed improved detection sensitivity compared to the B1-gene targeted method suggesting potential new target for Toxoplasma gondii screening in retail meats.

Threshold-dependent Occupancy Control Schemes for 3GPP's ARQ (3GPP의 ARQ를 위한 threshold에 의존하는 점유량 조절 방식)

  • Shin, Woo-Cheol;Park, Jin-Kyung;Ha, Jun;Choi, Cheon-Won
    • Journal of IKEEE
    • /
    • v.9 no.2 s.17
    • /
    • pp.123-135
    • /
    • 2005
  • 3GPP RLC protocol specification adopted a window-controlled selective-repeat ARQ scheme for provisioning reliable data transmission. Inevitably, the re-ordering issue arises in the 3GPP's ARQ since it belongs to the selective-repeat ARQ clan. A long re-ordering time results in the degradation of throughput and delay performance, and may invoke the overflow of the re-ordering buffer. Also, the re-ordering time must be regulated to meet the requirements of some services which are both loss-sensitive and delay-sensitive. In the 3GPP's ARQ, we may deflate the occupancy of the re-ordering buffer by reducing the window size and/or length of the status report period. Such a decrease, however, deteriorates the throughput and delay performance and encroaches the resource of the reverse channel. Aiming at reducing the occupancy at the re-ordering buffer while suppressing the degradation of throughput and delay performance, we propose threshold-dependent occupancy control schemes, identified as post-threshold and pre-threshold schemes, as supplements to the 3GPP's ARQ. For judging the effectiveness of the proposed schemes, we investigate peak occupancy, maximum throughput and average delay in the practical environment involving fading channels. From the simulation results, we observe that the proposed schemes invoke the performance trade-off between occupancy and throughput in general. Also, we reveal that the post-threshold scheme is able to improve the throughput and delay performance of the ordinary 3GPP's ARQ without inflating the occupancy of the re-ordering buffer.

  • PDF

Snowball Scheme: An Alternative Admission Control Scheme for 3GPP ARQ (Snowball 방식: 3GPP ARQ를 위한 대체 수락 제어 방식)

  • Shin, Woo-Cheol;Park, Jin-Kyung;Ha, Jun;Choi, Cheon-Won
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.8
    • /
    • pp.51-61
    • /
    • 2007
  • For provisioning reliable data transmission, the 3GPP RLC specification adopted a selective-repeat ARQ scheme assisted by a window-based admission control scheme. In the 3GPP ARQ, which is a member of the selective-repeat ARQ clan, inheres the reordering problem A long and irregular reordering time results in the degradation of throughput and delay performance, and may incur the overflow of the reordering buffer. Furthermore, the reordering time must be regulated to meet the requirements of some services which are loss-sensitive and delay-sensitive as well. Perceiving the reordering hazard, we propose an alternative, identified as snowball scheme, to the original admission control scheme of the 3GPP ARQ with aiming at deflating the occupancy of the reordering buffer. A unique feature of the snowball scheme is to reject a new DATA PDU if it is non-adjacent to any DATA PDU sojourning at the reordering buffer. Such an intentional rejection apparently reduces the occupancy of the reordering buffer while it may deteriorate the throughput and delay performance. Developing an analytical approximation method, we investigate the effect of snowball scheme on the saturated occupancy and throughput. Also, we, using a simulation method, evaluate the peak occupancy, normalized throughput and average delay in the practical environment. From the simulation results, we reveal that the snowball scheme is able to enhance occupancy performance as well as throughput performance compared with the original admission control scheme of the 3GPP ARQ.

Endowment of Duplicated Serial Number for Window-controlled Selective-repeat ARQ (Window-controlled Selective-repeat ARQ에서 중복된 순차 번호의 부여)

  • Park, Jin-Kyung;Shin, Woo-Cheol;Ha, Jun;Choi, Cheon-Won
    • Journal of IKEEE
    • /
    • v.7 no.2 s.13
    • /
    • pp.288-298
    • /
    • 2003
  • We consider a window-controlled selective-repeat ARQ scheme for error control between two adjacent nodes lying on a communication path. In this scheme, each packet to be transmitted is endowed with a serial number in a cyclic and sequential fashion. In turn, the transmitting node is not allowed to transmit a packet belonging to a window before every packet in the previous window is positively acknowledged. Such postponement of packet transmission incurs a degradation in throughput and delay performance. In this paper, aiming at improving packet delay performance, we employs a supplement scheme in which a serial number is duplicated within a frame. Classifying duplication rules into fixed, random and adaptive categories, we present candidate rules in each category and evaluate the packet delay performance induced by each duplication rule. From numerical examples, we observe that duplicating serial numbers, especially ADR-T2 effectively reduces mean packet delay for the forward channel characterized by a low packet error rate. We also reveal that such delay enhancement is achieved by a high probability of hitting local optimal window size.

  • PDF

Pilot Hopping Scheme for Massive Antenna Systems in Cellular Networks (극다중 안테나 셀룰러 시스템을 위한 파일럿 도약 기법)

  • Kim, Seong Hwan;Ban, Tae-Won;Lee, Wongsup;Ryu, Jong Yeol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.4
    • /
    • pp.718-723
    • /
    • 2017
  • We propose a pilot hopping scheme that improves the limited system capacity due to pilot contamination in multi-cell environment with large-scale antenna arrays at a base station, assuming the infinite number of antennas. In the conventional fixed pilot scheme, each user obtains the same signal-to-interference ratio (SIR) over a long period of time. Therefore, a user with strong interference has continuously low SIR which degrades its service quality. In the proposed pilot hopping scheme, different pilot signals are used for each time slot, and different amounts of interference are received every time. When such a pilot hopping technique is applied, the SIR fluctuates at every time slot. When the Hybrid Automatic Repeat & reQuest (HARQ) technique is applied in such a channel, the outage probability and transmission rate are improved. We show that there is the performance gain of the proposed scheme over the conventional scheme through computer simulations.