A graph-based sliding window multi-join over data stream

Join operation is a critical problem when dealing with sliding window over data streams. There have been many optimization strategies for sliding window join in the literature, but a simple heuristic is always used for selecting the join sequence of many sliding windows, which is ineffectively. The graph-based approach is proposed to process the problem. The sliding window join model is introduced primarily. In this model vertex represent join operator and edge indicated the join relationship among sliding windows. Vertex weight and edge weight represent the cost of join and the reciprocity of join operators respectively. Then good query plan with minimal cost can be found in the model. Thus a complete join algorithm combining setting up model, finding optimal query plan and executing query plan is shown. Experiments show that the graph-based approach is feasible and can work better in above environment.

A novel architecture for cargos location and safety in networked RFID

Using Networked RFID equipped in warehouse or supermarket distribution, Enterprise information system (EIS) can gather and deal with cargos information. Nevertheless, when cargos are in traffic, the Networked RFID can’t monitor the cargos any more as the products tagged aren’t within range of a reader. This paper proposes a solution framework which combines Networked RFID and GPS tracking, and then equip with this system in container to make the cargos monitored even if the cargos are in traffic. This solution can solve the accurate consignments, position tracking and advanced theft happening through drilling holes in container. In addition, customhouse and checkpoint can get an electronic shipment manifest rapidly and safely when a vehicle gets through a checkpoint.

A spatial entropy reflecting distribution of spatial objects

Decision trees are mainly used to classify data and predict data classes. A spatial decision tree has been designed using Euclidean distance between objects for reflecting spatial data characteristic. Even though this method explains the distance of objects in spatial dimension, it fails to represent distributions of spatial data and their relationships. But distributions of spatial data and relationships with their neighborhoods are very important in real world. This paper proposes decision tree based on spatial entropy that represents distributions of spatial data with dispersion and dissimilarity. The rate of dispersion by dissimilarity presents how related distribution of spatial data and non-spatial attributes. The experiment evaluates the accuracy and building time of decision tree as compared to previous methods and it shows that the proposed method makes efficient and scalable classification for spatial decision support.

A cloud-based fuzzy approach for spatial site selection in decision support system

In decision support system for spatial site selection, the fuzzy synthetic evaluation is a useful way. However, the method can’t pay attention to the randomness in factors. To remedy the problem, this paper proposes a clouded-base fuzzy approach which combines advantages of cloud transform and fuzzy synthetic evaluation. The cloud transform considers the randomness in the factors and product the higher concept layer for data mining. At the same time, the check mechanism controls the quality of partitions in factors. Then the fuzzy approach was used to get final evaluation value with randomness and fuzziness. It make the final result is optimization. Finally, performance evaluations show that this approach spent less runtime and got more accuracy than the fuzzy synthetic. The experiments prove that the proposed method is faster and more accuracy than the original method.