Many anti-collision protocols have been proposed at present. Almost all known protocols exhibit an overall identification efficiency smaller than 50%. And all of them are proposed for general purpose applications and do not consider the distribution characteristic of tag IDs in different radio frequency identification (RFID) systems. In real world, there are many RFID systems, in which the tag IDs are mostly distributed continuously, such as in container terminals, warehouse management, supply chain management, and so on. This paper presents an efficient anti-collision protocol, named improved collision tree protocol (ICT), to identify RFID tags simultaneously. The main novelties of this paper include that the duality and certainty principle is introduced and used in ICT to improve the tag identification efficiency, and the continuous and partially continuous distributions of tag IDs are taken into account in this paper. Both the theoretical and experimental results indicate that ICT improves the tag identification efficiency up to 100% when the tag IDs are distributed continuously, and always above 50% even when the tag IDs are distributed uniformly. For straightforward and efficient, ICT can be used in various RFID tag identification conditions, especially when the tag IDs are distributed continuously or partially continuously. Copyright (c) 2013 John Wiley & Sons, Ltd.
A small wideband microwave high temperature heating apparatus comprising a furnace, a microwave source (4), and a microwave transmission device. The furnace comprises a furnace body (1), a furnace cover (2) on the top of the furnace body (1), an inner chamber (1-2) inside the furnace body (1), a thermocouple (3) inside the inner chamber (1-2), and a helical antenna (1-3) around the inner chamber (1-2). The central line of the helical antenna (1-3) is parallel to the axis of the thermocouple (3). The helical antenna extends out of the furnace body (1) and is connected to a microwave transmitting device. The microwave transmitting device is connected to a microwave source (4). The furnace cover (2) has an intake vent (2-1) and an exhaust vent (2-2). An insulating layer (1-1) is between the inner chamber (1-2) and the furnace body (1). A sealing device (12) is situated between the furnace body (1) and the furnace cover (2) and is located on the inside of a microwave shielding device (13). The sealing device (12) is made from a rubber sealing ring, and the microwave shielding device (13) is made from a copper wire mesh microwave shielding ring. Using the helical antenna (1-3) to radiate inside a cylindrical microwave resonant cavity with a wide working bandwidth can maintain microwave power despite the small size thereof.
A data storage method and system (220). The method comprises: selectively transmitting, by a host computer (210), target data to a first controller (221) or a second controller (222) (510); if the first controller (221) receives the target data, determining, by the first controller (221), according to responsibility information in the target data, whether the first controller (221) is responsible for processing the target data (520); if not, forwarding, by the first controller (221), the target data to the second controller (222); if so, transmitting, by the first controller (221), the target data to a first buffer apparatus (224) or a second buffer apparatus (225) to store the same (530) and obtain first image data; and when it is required to store the data in the buffer apparatuses to a storage device (223), storing, by the first controller (221), data including the target data, processed by the first controller (221) and stored in the first buffer apparatus (224) or the second buffer apparatus (225), to the storage device (223) (560). The method lowers a controller memory requirement, and decreases stress of transmitting image data between controllers.
In recent years, due to the rise of social, biological, and other rich content graphs, several novel community detection methods using structure and node attributes have been proposed. Moreover, nodes in a network are naturally characterized by multiple community memberships and there is growing interest in overlapping community detection algorithms. In this paper, we design a weighted vertex interaction model based on distance dynamics to divide the network, furthermore, we propose a distance Dynamics-based Overlapping Semantic Community detection algorithm(DOSC) for node-attribute networks. The method is divided into three phases: Firstly, we detect local single-attribute subcommunities in each attribute-induced graph based on the weighted vertex interaction model. Then, a hypergraph is constructed by using the subcommunities obtained in the previous step. Finally, the weighted vertex interaction model is used in the hypergraph to get global semantic communities. Experimental results in real-world networks demonstrate that DOSC is a more effective semantic community detection method compared with state-of-the-art methods.
Sun, Heli
Huang, Jianbin
Liu, Ke
Wan, Mengjie
Zhou, Yu
Cao, Chen
Jia, Xiaolin
He, Liang
Team formation, which aims to form a team to complete a given task by covering its required skills, furnishes a natural way to help organizers complete projects effectively. In this work, we propose a new team hiring problem. Given a set of projects [Formula: see text] with required skills, and a pool of experts [Formula: see text], each of which has his own skillset, compensation demand and participation constraint (i.e., the maximum number of projects the expert can participate in simultaneously), we seek to hire a team of participation-constrained experts [Formula: see text] to complete all the projects so that the overall compensation is minimized. We refer to this as the participation constrained team hire problem. To the best of our knowledge, this is the first work to investigate the problem. We also study a special case of the problem, where the number of projects is within the participation constraint of each expert and design an exact algorithm for it. Since participation constrained team hire problem is proven to be NP-hard, we design three novel efficient approximate algorithms as its solution, each of which focuses on a particular perspective of the problem. We perform extensive experimental studies, on both synthetic and real datasets, to evaluate the performance of our algorithms. Experimental results show that our exact algorithm far surpasses the brute-force solutions and works well in practice. Besides, the three algorithms behave differently when distinct facets of the problem are involved.=20
Creat membership
Sweep WeChat yards
