• Horticultural Science & Technology
• /
• v.29 no.4
• /
• pp.317-325
• /
• 2011

This study was conducted to examine the effect of supplemental lighting on the growth and yield of hydroponically grown sweet pepper (Capsicum annuum L. cv. sprit) under low levels of natural light in winter. The plants were treated with natural light only (control), 3-hour supplemental lighting before sunrise, after sunrise and after sunset with high pressure sodium (HPS, 400W). As the result of these three treatments, the supplemental lighting promoted photosynthesis in the low light intensity condition and particularly photosynthesis was more active right after sun rise in the morning, 1.5-$3.0{\mu}molCO_2{\cdot}m^{-2}{\cdot}s^{-1}$ comparing to those of supplemental lighting after sunset, 0.5-$1.5{\mu}molCO_2{\cdot}m^{-2}{\cdot}s^{-1}$. Transpiration rate and stomatal conductance sharply increased with supplemental lighting after sunrise then they decreased again after turning the lights off. Stomatal size was observed $32.2{\mu}m^2$ after supplemental lighting, whereas the size of the natural light was almost closed at $7.7{\mu}m^2$. The average plant height of sweet papper cv. spirit was 185 cm before sunrise, 188 cm after sunrise and 208 cm after sunset with supplemental lighting for 3hours while the control was 171 cm. With supplemental lighting a better number of fruit set per plant was measured 4.3 before and after sunrise, 3.7 after sunset but 2.6 in the control. Interestingly, there were no significant differences in the sugar content ($^{\circ}Brix$) degree between treatment of supplemental lighting, whereas slight differences between seasons were seen. The marketable fruit yield of sweet pepper (cv. spirit) was $116.0kg{\cdot}ha$ with supplemental lighting, whereas the control (natural light only) was $75.8kg{\cdot}ha$. Despite of spending electricity and depreciation cost, the economic analysis showed net income with supplemental lighting after sunrise was 51% higher than control treatment in cv. spirit.

• Journal of Internet Computing and Services
• /
• v.14 no.5
• /
• pp.1-10
• /
• 2013

RFID(Radio Frequency Identification) system is non-contact identification technology. A basic RFID system consists of a reader, and a set of tags. RFID tags can be divided into active and passive tags. Active tags with power source allows their own operation execution and passive tags are small and low-cost. So passive tags are more suitable for distribution industry than active tags. A reader processes the information receiving from tags. RFID system achieves a fast identification of multiple tags using radio frequency. RFID systems has been applied into a variety of fields such as distribution, logistics, transportation, inventory management, access control, finance and etc. To encourage the introduction of RFID systems, several problems (price, size, power consumption, security) should be resolved. In this paper, we proposed an algorithm to significantly alleviate the collision problem caused by simultaneous responses of multiple tags. In the RFID systems, in anti-collision schemes, there are three methods: probabilistic, deterministic, and hybrid. In this paper, we introduce ALOHA-based protocol as a probabilistic method, and Tree-based protocol as a deterministic one. In Aloha-based protocols, time is divided into multiple slots. Tags randomly select their own IDs and transmit it. But Aloha-based protocol cannot guarantee that all tags are identified because they are probabilistic methods. In contrast, Tree-based protocols guarantee that a reader identifies all tags within the transmission range of the reader. In Tree-based protocols, a reader sends a query, and tags respond it with their own IDs. When a reader sends a query and two or more tags respond, a collision occurs. Then the reader makes and sends a new query. Frequent collisions make the identification performance degrade. Therefore, to identify tags quickly, it is necessary to reduce collisions efficiently. Each RFID tag has an ID of 96bit EPC(Electronic Product Code). The tags in a company or manufacturer have similar tag IDs with the same prefix. Unnecessary collisions occur while identifying multiple tags using Query Tree protocol. It results in growth of query-responses and idle time, which the identification time significantly increases. To solve this problem, Collision Tree protocol and M-ary Query Tree protocol have been proposed. However, in Collision Tree protocol and Query Tree protocol, only one bit is identified during one query-response. And, when similar tag IDs exist, M-ary Query Tree Protocol generates unnecessary query-responses. In this paper, we propose Adaptive M-ary Query Tree protocol that improves the identification performance using m-bit recognition, collision information of tag IDs, and prediction technique. We compare our proposed scheme with other Tree-based protocols under the same conditions. We show that our proposed scheme outperforms others in terms of identification time and identification efficiency.