Development of UV-Protection Roofing Tile from Nitrogen-doped Graphene Quantum Dots (N-GQDs) for Rubber Drying Chambers
Improved methods of processing latex into rubber sheets will improve the incomes of small rubber producers. There are two ways in which latex can be processed into rubber sheets: fumigation and solar incubation. The fumigation method is expensive and produces pollution, but solar incubation can cause dark, sticky rubber sheets due to UV radiation, which reduces their value. A low-cost and environmentally-friendly solution to this problem was investigated here. A UV-protective roofing panel made using Nitrogen-doped Graphene Quantum Dots (NGQDs) was developed and tested. N-GQDs were made using the hydrothermal process for 2 and 4 hours (T2 and T4) and the solvothermal process for 4, 6, and 8 hours (TS4, TS6, and TS8). It was found that all types of N-GQDs absorbed light in the UV range, withT4 showing the greatest absorption. T4 had the greatest Fluorescent Intensity (FL) value, emitting blue light, while for the solvothermal method TS6 had the highest FL value, emitting red light. T4 and TS6 were chosen for further testing, and were applied to a clear roofing tile. After installing the roof on the chamber, the temperature inside was higher than outside. Then we measure the UV protection efficiency of the roof which was 93.27%. The average temperature was 45℃, which is the temperature for drying rubber sheets. Due to the roof’s capability to absorb UV radiation and heat the chamber, our N-GQDs roof has a great ability to produce higher-quality rubber sheets.
糖果傳遞問題之研究與推廣
n個人圍成一圈,面向圓心,且逆時針編號1,2,……,n。一開始每人手中有一個糖果,由1號開始,逆時針分別給右邊的人一個、兩個、一個、兩個……糖果,手上沒有糖果的人必須退出。我們將此傳遞規則定義為T_1,2,同理T_(1,2⋯,p)。這個傳遞遊戲,最終會有兩種情形,第一種是由一人獨得所有糖果(成功狀態),第二種是數人間傳遞糖果且形成循環(循環狀態)。 研究後得知,在傳遞規則T_(1,2⋯,p) (p≥2)下,若p=〖p_1〗^(α_1 ) 〖p_2〗^(α_2 )⋯〖p_i〗^(α_i )⋯〖p_j〗^(α_j ) ( 為p的相異質因數),任意的n值(n≥p+1)均可唯一表示成n=(p)^t×(〖p_1〗^(s_1 ) 〖p_2〗^(s_2 )⋯〖p_i〗^(s_i )⋅m)+q (t,m∈N, p ∤〖p_1〗^(s_1 ) 〖p_2〗^(s_2 )⋯〖p_i〗^(s_i ), (m,p)=1, q=1,2,⋯,p),令S=(p^t (p-q)+(pq-1))/(p-1)+R⋅p^t,則當m=1時,最終為成功狀態,且獨得糖果者的初始編號為S;當m≥2時,最終為循環狀態,且由m人循環傳遞糖果,而此m人的初始編號是S, S+p^t 〖p_1〗^(s_1 ) 〖p_2〗^(s_2 )⋯〖p_i〗^(s_i ), ⋯⋯ , S+(m-1)⋅p^t 〖p_1〗^(s_1 ) 〖p_2〗^(s_2 )⋯〖p_i〗^(s_i )。上述公式中的R值,可透過我們研究出來的「R值迭代法」求得。更進一步,我們也找出達到成功狀態或循環狀態的最小傳遞數。