A STUDY ON THE INTRINSIC TIME RESOLUTION OF THE MRPC USED IN THE STAR-TOF

2007 ◽  
Vol 16 (07n08) ◽  
pp. 2476-2483 ◽  
Author(s):  
◽  
MING SHAO ◽  
LIANG LI

Time-Of-Flight (TOF) based on Multi-gap Resistive Plate Chamber (MRPC) detectors have been successfully operating at the STAR experiment since 2003.2,3 The MRPC time resolution is however found to be significantly worse2 (80-90 ps) than that previously obtained in beam test (60 ps).4 In order to fully understand MRPC working principles and operating requirements, an extensive calibration study is performed using data collected by STAR in 200 GeV Au + Au collisions in 2004. The relation between MRPC timing, signal amplitude, incident angle and momentum are discussed. Contributions from tracking properties of STAR-TPC are also studied by simulation. The intrinsic time resolution of the MRPCs used in STAR-TOF, after taking all factors into consideration, is found to be in good agreement with beam test results.

2014 ◽  
Vol 31 ◽  
pp. 1460298
Author(s):  
Rong-Xing Yang ◽  
Yong-Jie Sun ◽  
Cheng Li

An end-cap Time-of-Flight (E-TOF) system with higher granularity and intrinsic time resolution of better than 50 ps will extend the K/pion separation (2 sigma) pT range to 1.4 GeV/c and enhance the physics capability of Beijing Spectrometer (BESIII). A R&D work was carried out aiming at upgrading the current BESIII E-TOF with the Multi-gap resistive Plate Chamber (MRPC) detector. The latest best test for the prototype MRPC, together with the custom designed Front End Electronics (FEE) and TDC boards, was performed at the BEPC E3 line in July 2012. The test results show that time resolution of less than 50 ps can be achieved with such a system.


2015 ◽  
Vol 1 (4) ◽  
pp. 270
Author(s):  
Muhammad Syukri Mustafa ◽  
I. Wayan Simpen

Penelitian ini dimaksudkan untuk melakukan prediksi terhadap kemungkian mahasiswa baru dapat menyelesaikan studi tepat waktu dengan menggunakan analisis data mining untuk menggali tumpukan histori data dengan menggunakan algoritma K-Nearest Neighbor (KNN). Aplikasi yang dihasilkan pada penelitian ini akan menggunakan berbagai atribut yang klasifikasikan dalam suatu data mining antara lain nilai ujian nasional (UN), asal sekolah/ daerah, jenis kelamin, pekerjaan dan penghasilan orang tua, jumlah bersaudara, dan lain-lain sehingga dengan menerapkan analysis KNN dapat dilakukan suatu prediksi berdasarkan kedekatan histori data yang ada dengan data yang baru, apakah mahasiswa tersebut berpeluang untuk menyelesaikan studi tepat waktu atau tidak. Dari hasil pengujian dengan menerapkan algoritma KNN dan menggunakan data sampel alumni tahun wisuda 2004 s.d. 2010 untuk kasus lama dan data alumni tahun wisuda 2011 untuk kasus baru diperoleh tingkat akurasi sebesar 83,36%.This research is intended to predict the possibility of new students time to complete studies using data mining analysis to explore the history stack data using K-Nearest Neighbor algorithm (KNN). Applications generated in this study will use a variety of attributes in a data mining classified among other Ujian Nasional scores (UN), the origin of the school / area, gender, occupation and income of parents, number of siblings, and others that by applying the analysis KNN can do a prediction based on historical proximity of existing data with new data, whether the student is likely to complete the study on time or not. From the test results by applying the KNN algorithm and uses sample data alumnus graduation year 2004 s.d 2010 for the case of a long and alumni data graduation year 2011 for new cases obtained accuracy rate of 83.36%.


2021 ◽  
Vol 68 (2) ◽  
pp. 173-181
Author(s):  
C. A. Aidala ◽  
S. Altaf ◽  
R. Belmont ◽  
S. Boose ◽  
D. Cacace ◽  
...  

2015 ◽  
Vol 732 ◽  
pp. 85-90
Author(s):  
Lukáš Bek ◽  
Radek Kottner ◽  
Jan Krystek ◽  
Tomáš Kroupa

Different carbon and glass fibre strips were subjected to the double clamp buckle beam test. Furthermore, thin-walled glass fibre box-beams were subjected to the three-point bending test. Results of experiments were compared to different numerical simulations using buckling analysis or static analysis considering large deformations.


Author(s):  
V. Chabaud ◽  
H. Dijkstra ◽  
M. Gröne ◽  
M. Flohr ◽  
R. Horisberger ◽  
...  
Keyword(s):  

2019 ◽  
Vol 3 (5) ◽  
pp. 815-826 ◽  
Author(s):  
James Day ◽  
Preya Patel ◽  
Julie Parkes ◽  
William Rosenberg

Abstract Introduction Noninvasive tests are increasingly used to assess liver fibrosis and determine prognosis but suggested test thresholds vary. We describe the selection of standardized thresholds for the Enhanced Liver Fibrosis (ELF) test for the detection of liver fibrosis and for prognostication in chronic liver disease. Methods A Delphi method was used to identify thresholds for the ELF test to predict histological liver fibrosis stages, including cirrhosis, using data derived from 921 patients in the EUROGOLF cohort. These thresholds were then used to determine the prognostic performance of ELF in a subset of 457 patients followed for a mean of 5 years. Results The Delphi panel selected sensitivity of 85% for the detection of fibrosis and >95% specificity for cirrhosis. The corresponding thresholds were 7.7, 9.8, and 11.3. Eighty-five percent of patients with mild or worse fibrosis had an ELF score ≥7.7. The sensitivity for cirrhosis of ELF ≥9.8 was 76%. ELF ≥11.3 was 97% specific for cirrhosis. ELF scores show a near-linear relationship with Ishak fibrosis stages. Relative to the <7.7 group, the hazard ratios for a liver-related outcome at 5 years were 21.00 (95% CI, 2.68–164.65) and 71.04 (95% CI, 9.4–536.7) in the 9.8 to <11.3 and ≥11.3 subgroups, respectively. Conclusion The selection of standard thresholds for detection and prognosis of liver fibrosis is described and their performance reported. These thresholds should prove useful in both interpreting and explaining test results and when considering the relationship of ELF score to Ishak stage in the context of monitoring.


2018 ◽  
Author(s):  
Irene Zoi ◽  
M. Boscardin ◽  
G.F. Dalla Betta ◽  
M. Dinardo ◽  
G. Giacomini ◽  
...  

2020 ◽  
Vol 10 (1) ◽  
pp. 22-45
Author(s):  
Dhio Saputra

The grouping of Mazaya products at PT. Bougenville Anugrah can still do manuals in calculating purchases, sales and product inventories. Requires time and data. For this reason, a research is needed to optimize the inventory of Mazaya goods by computerization. The method used in this research is K-Means Clustering on sales data of Mazaya products. The data processed is the purchase, sales and remaining inventory of Mazaya products in March to July 2019 totaling 40 pieces. Data is grouped into 3 clusters, namely cluster 0 for non-selling criteria, cluster 1 for best-selling criteria and cluster 2 for very best-selling criteria. The test results obtained are cluster 0 with 13 data, cluster 1 with 25 data and cluster 2 with 2 data. So to optimize inventory is to multiply goods in cluster 2, so as to save costs for management of Mazayaproducts that are not available. K-Means clustering method can be used for data processing using data mining in grouping data according to criteria.


Sign in / Sign up

Export Citation Format

Share Document