• Title/Summary/Keyword: Time Buffers

Search Result 167, Processing Time 0.029 seconds

Establishment of Elution and Concentration Procedure for Rapid and Sensitive Detection of Norovirus in Foods of Diverse Matrices (다양한 매트릭스가 혼합된 식품을 대상으로 노로바이러스 신속검출을 위한 탈리 및 농축방법 확립)

  • Ahn, Jaehyun;Kwon, Youngwoo;Lee, Jeong-Su;Choi, Weon Sang
    • Journal of Food Hygiene and Safety
    • /
    • v.30 no.2
    • /
    • pp.150-158
    • /
    • 2015
  • This article reports the development of an effective test procedure for detection of norovirus (NoV) in foods of diverse matrices. In this study, target foods included fermented milk, soybean paste, powders made from uncooked grains and vegetables, sesame leaves preserved in soy sauce, pickled mooli, and mooli. Viral recovery varied depending on the food matrices or elution buffers tested. Buffers were compared to determine effective elution buffers from artificially virus-contaminated foods. The conventional test procedure for concentrating viruses from food (elution-polyethylene glycol(PEG) precipitation-chloroform-PEG precipitation) was modified to save time by eliminating one PEG precipitation step. The modified procedure (elution-chloroform-PEG precipitation) was able to concentrate viruses more effectively than the conventional procedure. It also removed RT-PCR inhibitors effectively. The modified procedure was applied to target food for genogroup II NoV detection. NoV RNA was detected at the initial inoculum levels 3.125-12.5 RT-PCR units per 10-25 g tested food. The use of this newly established procedure should facilitate detection of low levels of norovirus in diverse foods.

Optimization of SELDI-TOF MS for Peptide Profiling of Sorghum Seed (수수종자의 펩타이드 분석을 위한 SELDI-TOF MS 최적화 연구)

  • Park, Sei Joon;Park, June Young;Lee, Yong Ho;Hwang, Su Min;Kim, A Ram;Ko, Jee-Yeon;Kim, Tae Wan
    • KOREAN JOURNAL OF CROP SCIENCE
    • /
    • v.58 no.1
    • /
    • pp.50-56
    • /
    • 2013
  • For accurate analysis of low molecular peptides using SELDI-TOF MS (surface enhanced laser desorption/ionization time of flight mass spectrometry), the optimized analytical conditions should be established for a specific biological sample. This study was conducted to optimize SELDI-TOF MS analytical conditions for profiling low molecular peptide below 10 kDa presented in sorghum seeds. Analytical conditions were as follows; (1) protein chips: CM10 (weak cation exchanger) and Q10 (strong anion exchanger), (2) dilution factors of binding buffer: 1/2, 1/5, 1/10, 1/20, 1/50, 1/100, and 1/200, (3) the stringency of Q10 binding buffer: 10 mM and 100 mM, and (4) protein extraction buffers: sodium borate, sodium borate + acetone, phenol, and TCA buffers. Optimum dilution factors were selected as 1/20 and 1/50 in both protein chips, CM10 and Q10. Low stringency of Q10 binding buffer (10mM) detected more peptide peaks than high stringency (100 mM). Selected protein extraction buffers of sorghum seed for SELDI-TOF MS analysis was the sodium borate buffer in the range of 2~10 kDa, while the phenol buffer was more suitable in the range of 10~20 kDa.

A Study on the Performance Analysis of a High-Speed ATM Router (고속 ATM 라우터의 성능 분석에 관한 연구)

  • 조성국
    • Journal of the Korea Society of Computer and Information
    • /
    • v.6 no.1
    • /
    • pp.74-81
    • /
    • 2001
  • In this paper. the architecture of a high-speed ATM router using ATM switch is studied and the performance of the high-speed ATM router is analyzed through simulation. The high-speed ATM router using ATM switch is able to reduce the load of router and the processing time of a packet in the router. The size of router buffers has been studied through simulation processes for the analysis of performance capacity in due course of making changes in routing time(RT), which is the performance capacity parameters of high-speed ATM routers, flow table size(FS), flow live time(FT) and input circuit efficiencies. The result of this study can be used as the source material for analyzing the suitability of equipment in upgrading networks and applying high-speed ATM routers by using ATM switches.

  • PDF

THREE-DIMENSIONAL ROUND-ROBIN SCHEDULER FOR ADVANCED INPUT QUEUING SWITCHES (고속 입력큐 스위치 패브릭을 위한 3차원 라운드로빈 스케줄러)

  • Jeong, Gab-Joong;Lee, Bhum-Cheol
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2003.10a
    • /
    • pp.373-376
    • /
    • 2003
  • This paper presents a new, three-dimensional round-robin scheduler that provides high throughput and fair across in an advanced input-queued packet switch using shared input buffers. We consider an architecture in which each input port group shares a common buffer and maintains a separate queue for each output, which is ratted the distributed common input buffer switch. In an NxN switch, our scheduler determines which queue in the total MxN input queues is served during each time slot where M is the number of common buffers. We suppose that each common buffer has K input ports and K output ports, and manages N output queues. The 3DRR scheduler determines MxK queues in every K(M) cycle when $K\geq$M (K$\leq$M), and provides massively parallel processing for the applications of high-speed switches with a large number of ports. The 3-DRR scheduler can be implemented using duplicated simple logic components allowing very high-speed implementation.

  • PDF

A Cost-Based Buffer Replacement Algorithm in Object-Oriented Database Systems (객체지향 데이타베이스에서의 비용기반 버퍼 교체 알고리즘)

  • Park, Chong-Mok;Han, Wook-Shin;Whang, Kyu-Young
    • Journal of KIISE:Databases
    • /
    • v.27 no.1
    • /
    • pp.1-12
    • /
    • 2000
  • Many object oriented database systems manage object buffers to provide fast access to objects. Traditional buffer replacement algorithms based on fixed length pages simply assume that the cost incurred by operating a buffer is propertional to the number of buffer faults. However, this assumption no longer holds in an objects buffer where objects are of variable length and the cost of replacing an object varies for each object. In this paper, we propose a cost based replacement algorithm for object buffers. The proposed algorithm replaces the have minimum costs per unit time and unit space. The cost model extends the previous page based one to include the replacement costs and the sizes of objects. The performance tests show that proposed algorithm is almost always superior to the LRU-2 algorithm and in some cases is more than twice as fast. The idea of cost based replacement can be applied to any buffer management architectures that adopt earlier algorithms. It is especially useful in object oriented database systems where there is significant variation in replacement costs.

  • PDF

Validation of analysis of urinary fluoride by ion selective electrode method (이온선택전극법에 의한 소변 중 불소 이온 분석법 검증)

  • Lee, Mi-Young;Yoo, Kye-Mook
    • Analytical Science and Technology
    • /
    • v.27 no.6
    • /
    • pp.333-338
    • /
    • 2014
  • A simple and sensitive analytical method for fluoride in urine by ion selective electrode (ISE) method was presented. Traditional buffer for fluoride determination using ISE is acetate-based one. Researchers have pointed out some drawbacks of the buffer for fluoride ISE analysis, and some other buffers including citrate-ammonium buffer and MES buffer have been studied for accurate determination of fluoride in urine here. These buffers provided promising results in environmental field, and this author focused on overcoming the interference of co-existing aluminium. The results show that MES-CyDTA buffer gave the best recovery with accuracy of 95-97.5% and precision of 1.9-7.9% for reference sample of 1.8-7.8 mg/L fluoride in urine, with smaller amount of samples and shorter analysis time compared with the traditional method which used acetate buffer. The method was applied to field samples, and which showed urinary of $0.98{\pm}0.38mg/g$ creatinine for workers in electric cable manufacturing factory (n=15) and $0.59{\pm}0.30mg/g$ creatinine for non-exposed workers (n=12).

Stationary Waiting Times in Simple Fork-and-Join Queues with Finite Buffers and Communication Blocking (통신차단규칙을 따르는 유한버퍼 단순 조립형 대기행렬 망에서의 안정대기시간)

  • Seo, Dong-Won;Lee, Seung-Man
    • Journal of the Korea Society for Simulation
    • /
    • v.19 no.3
    • /
    • pp.109-117
    • /
    • 2010
  • In this study, we consider stationary waiting times in a simple fork-and-join type queue which consists of three single-server machines, Machine 1, Machine 2, and Assembly Machine. We assume that the queue has a renewal arrival process and that independent service times at each node are either deterministic or non-overlapping. We also assume that the Machines 1 and 2 have an infinite buffer capacity whereas the Assembly Machine has two finite buffers, one for each machine. Services at each machine are given by FIFO service discipline and a communication blocking policy. We derive the explicit expressions for stationary waiting times at all nodes as a function of finite buffer capacities by using (max,+)-algebra. Various characteristics of stationary waiting times such as mean, higher moments, and tail probability can be computed from these expressions.

On the efficient transmission of video stream using characteristic information (특성 정보를 이용한 비디오 스트림의 효율적 전송)

  • 강수용;염헌영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.9
    • /
    • pp.2328-2340
    • /
    • 1996
  • Until now, the transmission of data for VOD(Video on Demenad) was based on a real time modelling of video data. Markow Modulated Fluid Sources(MMFS) and Markow Modulated Poisson Sources(MMPS) are the most widely used modelling methods. But the charactersitics of the VBR(Variable Bit Rate) signal prevents modelling from actually being "real-time". Also these methods call for the use of large buffers for the abolishment of cell loss. These modelling methods are, of course, useful i case of teleconferences where a real time modelling of video traffic is inevitable, but they are insufficient in cases where the characteristic infomation of video traffic can be obtained beforehand-cases such as VOD. Video data is speial in that if one file is preprocessed all other products can simply be copied from that onepreprocessed file. This characteristic helps reduce the overhead arising from the job of drawing out characteristic information to almost zero. But still, compared to the existing real time modelling method data transmission using characteristic information succeeds in raising the efficiency of data transmission. In tis paper we will outline a method of dta transmission which use the characteristic information of each video stream, and evaluate this method through some experiments.periments.

  • PDF

A Semi-Soft Handoff Mechanism with Zero Frame Loss in Wireless LAM Networks (무선 LAN 환경에서 프레임 손실 없는 Semi-Soft 핸드오프 방안)

  • 김병호;민상원
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.12B
    • /
    • pp.1135-1144
    • /
    • 2003
  • In this paper, we proposed a semi-soft handoff mechanism to provide link mobility in IEEE 802.11 wireless LAN environment. Buffers and routing tables in APs and portals are provided in order to reroute frames, which have not been received during handoff time and have been buffered in an old AP, to a new AP after handoff is performed. For the re -routing operation, the MAC routing table should be updated by exchanging information of a mobile terminal between neighbor APs. With our proposed scheme. a wireless LAN node can perform semi soft handoff while changing its attached AP and provide mobile IP and/or real time service like voice over IP. Also, we have done simulation for evaluation of the performance of the proposed scheme. We show that our semi soft handoff mechanism can be applied for real-time service with no frame loss in mobile environment.

Optimized Hardware Design using Sobel and Median Filters for Lane Detection

  • Lee, Chang-Yong;Kim, Young-Hyung;Lee, Yong-Hwan
    • Journal of Advanced Information Technology and Convergence
    • /
    • v.9 no.1
    • /
    • pp.115-125
    • /
    • 2019
  • In this paper, the image is received from the camera and the lane is sensed. There are various ways to detect lanes. Generally, the method of detecting edges uses a lot of the Sobel edge detection and the Canny edge detection. The minimum use of multiplication and division is used when designing for the hardware configuration. The images are tested using a black box image mounted on the vehicle. Because the top of the image of the used the black box is mostly background, the calculation process is excluded. Also, to speed up, YCbCr is calculated from the image and only the data for the desired color, white and yellow lane, is obtained to detect the lane. The median filter is used to remove noise from images. Intermediate filters excel at noise rejection, but they generally take a long time to compare all values. In this paper, by using addition, the time can be shortened by obtaining and using the result value of the median filter. In case of the Sobel edge detection, the speed is faster and noise sensitive compared to the Canny edge detection. These shortcomings are constructed using complementary algorithms. It also organizes and processes data into parallel processing pipelines. To reduce the size of memory, the system does not use memory to store all data at each step, but stores it using four line buffers. Three line buffers perform mask operations, and one line buffer stores new data at the same time as the operation. Through this work, memory can use six times faster the processing speed and about 33% greater quantity than other methods presented in this paper. The target operating frequency is designed so that the system operates at 50MHz. It is possible to use 2157fps for the images of 640by360 size based on the target operating frequency, 540fps for the HD images and 240fps for the Full HD images, which can be used for most images with 30fps as well as 60fps for the images with 60fps. The maximum operating frequency can be used for larger amounts of the frame processing.