Search

To solve the privacy disclosing problem during the data processing phase of wireless sensor networks,a dis-tributed mechanism was proposed.Privacy-preserving vector (vector for short) was constructed.Moreover,lightweight method for vector generation and novel method for using the vector were also presented.Thus,the methods were able to solve the privacy-preserving problem for various data processing funtions such as max/min and data compression effi-ciently.An algorithm based on data hiding and slice was given and then the vector was able to be generated securely and dynamically.Extensive analyses and experiments show that the mechanism is more robust to node compromise attack and thus can preserve privacy more efficiently.Moreover,the mechanism consumes less power.

A hierarchical bipartite graph based model and a mining algorithm were presented to obtain the potential spatio-temporal periodic behavior,meanwhile avoided the subset omitting problem in previous schemes.Then the location analysis algorithm was designed to achieve the nearly inimum location dominating subset,it could monitor the small portion of the locations as early as possible.Finally experiments results show that the algorithms can find out the periodic location set as well as obtain nearly minimum location dominating subset,so as to cover the major portion of objectives using those popular locations.

A privacy preserving conditional aggregation protocol was proposed that enabled storage nodes to aggregate the data items satisfied sink issued queries correctly while prevented them from revealing both sensor collected data and Sink issued queries.To protect privacy for sensor col data and sink issued queries,an encoding method based on prefix membership verification and bloom filters was proposed to encode both sensor collected data and sink issued queries,which allowed storage nodes process queries correctly without knowing their actually value.Homomorphism encryption method was adopted to encrypt sensor collected data,which enabled storage nodes to process aggregation on encrypted data items.To reduce corresponding energy consumption between sensors and storage nodes,a code table method was proposed to represent and transmit data items.Analysis and experime validate the efficacy and efficiency of the proposed protocol.

A distributed mechanism was proposed to protect the data privacy during the data aggregation phase.The contributions of this mechanism are:1) Privacy-preserving element taking advantage of the algebraic properties of congruence was defined.In privacy-preserving elements,privacy data could be preserved without the extra data exchange,and the aggregation result could be recovered from the perturbed data in the cluster head.2)A flexible method for generating the privacy-preserving element was given.Thus,nodes could generate their privacy-preserving element without the extra data exchange,and the method was adapted to the dynamic reporting nodes.Extensive analysis showed that:compared with the centralized mechanism,the proposed mechanism has a better resistance to data loss,can avoid the single point problem and also consumes less communication overhead; compared with the other distributed mechanisms,the proposed mechanism is able to preserve privacy more efficiently while consuming less communication overhead.

Copyright of Tzu Chi Nursing Journal is the property of Buddhist Tzu Chi General Hospital and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Waiting is an inevitable phenomenon in service sectors. Consumers considered that the queuing is wasting time, so managers in service sectors should reduce consumer feeling in a queue and increase their satisfaction to services. However, previous researches focused on forming queuing model based on the number of servers, the arrival rate of customers, and service time, waiting time through adjusting the shape of a queue or the queuing size. The real customer perceptions to queue should be discuss, especially for the small but famous stall keepers, because the mathematical model and customer willingness to queue is easy to change in such real cases. A customer will leave/join a queue because of their perceptions to the queue itself, include the shape of queue and the number of waiting customers. In this study, a stall keeper selling the most well-known cuisine, red-bean cake, in Huwei is included as the example. The stall keeper always has the problem on queue. Most people choose to leave while witnessing the queue. In this study, all participants for the survey have the experiences on the waiting in front of the stall of red-bean cake. The shape of queue and the number of waiting customers are discussed. Additionally, customer perception to queue, customer curiosity to queue, desire to purchase red-bean cake, environment of the stall, and service quality are also discussed in this study. The analytical results show that the number of waiting customers and the shape of queue affect customer willingness to queue. Customer perception to queue, environment, and service quality affect customer decision to join a line. [ABSTRACT FROM AUTHOR]