Search

A novel dual band open loop antenna refers to a slot and an inverted-L ground (Inverted-L) between the main resonant radiating elements connected to two radiating metal elements. short-line), and is directly printed on a FR4 PCB board substrate, so that the antenna can obtain dual frequency operating frequency. It contains a parallel bent main resonant radiating element connected to the feeding end, which can be adjusted to the size of the radiating element by changing the quarter-wavelength based on A high-frequency operating frequency band and an inverted-L short-line radiating element. One end of a rectangular metal element is connected to the main common-amplitude radiation metal element, and the other end is provided with a parallel slot and Inverted-L short-line radiating elements are coupled to obtain a low-frequency operating frequency band; and the gap of this parallel slot is exactly 0.01λ wavelength of the operating frequency, and the coupling part radiation pattern. The surface current generated by the loop is used to increase the antenna operating bandwidth (Bandwidth), so that the antenna can obtain dual-band operating bandwidth and good antenna gain.

Software-Defined Networking (SDN) enables flexible network resource allocations for traffic engineering, but at the same time the scalability problem becomes more serious since traffic is more difficult to be aggregated. Those crucial issues in SDN have been studied for unicast but have not been explored for multicast traffic, and addressing those issues for multicast is more challenging since the identities and the number of members in a multicast group can be arbitrary. In this paper, therefore, we propose a new multicast tree for SDN, named Branch-aware Steiner Tree (BST). The BST problem is difficult since it needs to jointly minimize the numbers of the edges and the branch nodes in a tree, and we prove that it is NP-Hard and inapproximable within k, which denotes the number of group members. We further design an approximation algorithm, called Branch Aware Edge Reduction Algorithm (BAERA), to solve the problem. Simulation results demonstrate that the trees obtained by BAERA are more bandwidth-efficient and scalable than the shortest-path trees and traditional Steiner trees. Most importantly, BAERA is computation-efficient to be deployed in SDN since it can generate a tree on massive networks in small time.

This paper presents low cost and high specific anesthetic biosensors with functionally imprinted nanocavities on polymer films. Propofol (2,6-di-isopropylphenol) is an intravenous anesthetic, widely used in induction of anesthesia, total intravenous anesthesia and sedation of intensive care unit patients. Although the propofol concentration in blood can be detected by high-performance liquid chromatography and/or gas chromatography, these methods are time-consuming and not ease of access. In this work, we control the morphology of imprinted nanocavities on molecularly imprinted biosensors by adjusting polymer composition. Our developed biosensors have been compared with a conventional spectrophotometer to investigate surface morphology and performance of the anesthetic biosensors. The performance of the anesthetic biosensors can be enhanced by adjusting morphology of imprinted nanocavities. The newly developed biosensors have been characterized using our developed optofluidic microsystem.

Automatic motion generation for digital character under the real-time user control is a challenging problem for computer graphic research and virtual environment applications such as on-line games. The present study introduces a methodology to generate a glove puppet animation which is controlled by a new input device, called the Smart Glove, capturing the hand motion. An animation system is proposed to generate the puppet animation based on the procedural animation and motion capture data from Smart Glove. As the control of the puppet character in the animation takes into account the design of Smart Glove and the operation of the puppet in reality, the physical hand motion can either activate the designed procedural animation through motion recognition or tune the parameters of the procedural animation to build the new puppet motion, which allows the direct user control on the animation. The potential application and improvement of the current animation system are also discussed.

Due to the power is limited on each node of wireless sensor networks (WSNs), a data compression mechanism is required to achieve the purpose of power saving. In this paper, an efficient data compression method is proposed to reduce the size of transmission data under the given error bound. We first apply the observed transmission data to construct a static Huffman codebook which is related to the data correlation of the monitoring environment. Given an error bound, the proposed method determines whether the new sensed data should be sent or not by comparing it with the reference data such as the previous sensed data (for temporal correlation), the neighboring sensed data (for spatial correlation) and the codebook encoded data (for data correlation). Thus, the total size of transmission data can be minimized for power saving. Simulation results show that the proposed method can make WSNs more efficient in energy consumption. Even the error bound is set as a small value (under 0.009), the proposed method can reduce a lot of the transmission data (over 65%) to cut down the total energy consumption. Comparing to DF-TS, our improvement is nearly 70% in the total energy consumed

In RFID systems, the reader identifies tags through communication over a shared wireless channel. When multiple tags transmit their IDs simultaneously, their signals collide, increasing the identification delay. Therefore, many previous anti-collision protocols, including an adaptive query splitting protocol (AQS) and an adaptive binary splitting protocol (ABS), focused on solving this problem. This paper proposes one blocking protocol, blocking ABS protocol (BA), based on ABS. BA not only inherits the essence of ABS which uses the information of recognized tags obtained from the last process of tag identification, but also adopts a blocking technique which prevents recognized tags from being collided by unrecognized tags. Finally, the simulation results show that BA outperforms ABS.

This paper addresses how to provide the proportional delay differentiation (PDD) in a wireless LAN (WLAN) and proposes a cross-layer fine-tuning scheduling (CFS) scheme with the goal to maintain PDD among all wireless stations while improving performance in a WLAN. CFS additionally considers the time-varying channel capacity to schedule packets, finely tunes the contention window, and properly arbitrates the backoff time. Also, it operates in a fully distributed manner among all stations and in a cross- layer approach in each station. The simulation results demonstrate that the CFS scheme can provide more satisfactory PDD and higher performance in a WLAN, compared with 802.11e.