A Crowdsourcing Mode of Tourism Customization Based on Sharing Economy

China’s latest innovations of Internet Economy are partly reflected in video living broadcast, shared bicycles etc. In recent years, tourism industry in China obtains rapid development by utilizing Internet. However, it is still difficult to meet the growing tourist demands. In order to solve this problem, in this paper, we put forward a Tourism Crowdsourcing Model (TCM), which utilizes the public creativity to meet the increasing demands for personalized tourism. Firstly, the main problems of the tourism industry are analyzed. Secondly, the pattern of TCM is elaborated, and a matching algorithm between the tourist requirements and the workers’ abilities is well designed to find the qualified service providers efficiently and accurately. Finally, an example is given to verify the feasibility and effectiveness of the TCM based on shared economy. The results shows that TCM has some significant advantages to satisfy the tourism personalized needs by motivating the public to participate in the tourism industry initiatively

Ability Discovery and Weak Centralized Based Crowdsourcing Service Release System in Social Network

Crowdsourcing developed rapidly for its inspiring public abilities. But how to effectively find qualified participants and how to find and prevent malicious workers may be the main difficulties to ensure the crowdsourcing quality. In this paper, the related theories of social network were used in crowdsourcing services, the task publisher (Seeker) was regarded as the network center, his Abilities Set (AS) would be quantified and his Friends Abilities Matrix (FAM) would be generated according to the communication between them, thus his social network was re-constructed. Subsequently, some friends that conformed to the ability requirements of the task would be chosen to be the task receivers (Solvers). The natural trust relationship in the social network was fully used to build a crowdsourcing service release system on weak centralization. By using the social network, even the privacy information needn’t to be shared with others, the system could help the seeker find solvers accurately in the seeker’s own social network according to task demands, and then help to reduce fraud and invalid data. The simulation experiments showed that the release system could help the seeker discover his own abilities, construct the FAM, and select the appropriate solvers precisely and automatically

Multi-Recipient Signcryption for Secure Wireless Group Communication

Secure group communication is significant for wireless and mobile computing. Overheads can be reduced efficiently when a sender sends multiple messages to multiple recipients using multi-recipient signcryption schemes. In this paper, we proposed the formal definition and security model of multi-recipient signcryption, presented the definition of reproducible signcryption and proposed security theorems for randomness reusing based multi-recipient signcryption schemes. We found that a secure reproducible signcryption scheme can be used to construct an efficient multi-recipient signcryption scheme which has the same security level as the underlying base signcryption scheme. We constructed a multi-recipient scheme which is provable secure in random oracle model assuming that the GDH problem is hard, based on a new BLS-type signcryption scheme. Overheads of the new scheme are only (n+1)/2n times of traditional ways when a sender sends different messages to n distinct recipients. It is more efficient than other known schemes. It creates a possibility for the practice of the public key cryptosystem in ubiquitous computing

State transition algorithm for traveling salesman problem

Discrete version of state transition algorithm is proposed in order to solve the traveling salesman problem. Three special operators for discrete optimization problem named swap, shift and symmetry transformations are presented. Convergence analysis and time complexity of the algorithm are also considered. To make the algorithm simple and efficient, no parameter adjusting is suggested in current version. Experiments are carried out to test the performance of the strategy, and comparisons with simulated annealing and ant colony optimization have demonstrated the effectiveness of the proposed algorithm. The results also show that the discrete state transition algorithm consumes much less time and has better search ability than its counterparts, which indicates that state transition algorithm is with strong adaptability. © 2012 Chinese Assoc of Automati

A Security-Awareness Virtual Machine Management Scheme Based on Chinese Wall Policy in Cloud Computing

Cloud computing gets increasing attention for its capacity to leverage developers from infrastructure management tasks. However, recent works reveal that side channel attacks can lead to privacy leakage in the cloud. Enhancing isolation between users is an effective solution to eliminate the attack. In this paper, to eliminate side channel attacks, we investigate the isolation enhancement scheme from the aspect of virtual machine (VM) management. The security-awareness VMs management scheme (SVMS), a VMs isolation enhancement scheme to defend against side channel attacks, is proposed. First, we use the aggressive conflict of interest relation (ACIR) and aggressive in ally with relation (AIAR) to describe user constraint relations. Second, based on the Chinese wall policy, we put forward four isolation rules. Third, the VMs placement and migration algorithms are designed to enforce VMs isolation between the conflict users. Finally, based on the normal distribution, we conduct a series of experiments to evaluate SVMS. The experimental results show that SVMS is efficient in guaranteeing isolation between VMs owned by conflict users, while the resource utilization rate decreases but not by much

CRF07_BC Strain Dominates the HIV-1 Epidemic in Injection Drug Users in Liangshan Prefecture of Sichuan, China

The Liangshan prefecture in Sichuan province is an area in China severely affected by the HIV epidemic, with intravenous drug use (IDU) as the main risk factor. No reports on HIV subtypes prevalent in IDUs in Liangshan prefecture could be found. In this study, we have characterized the genotypes of HIV-1 in the IDU population in Liangshan prefecture and further determined the phylogenetic relationship of the CRF07_BC strains to HIV-1 sequences from the other regions of China, including Xinjiang and Yunnan provinces, to explore the pattern and possible diffusion pathway of HIV-1 in these regions. HIV-1-seropositive drug-naive IDUs identified in Liangshan prefecture, Sichuan province were enrolled in 2009. Full-length gag and pol genes were amplified by reverse transcription and nested PCR and then sequenced. All of the sequences were subtyped. Phylogenetic trees were constructed using the neighbor-joining and maximum likelihood methods. Divergence times were estimated using a Bayesian molecular clock approach. CRF07_BC was found to be the predominant strain in IDUs in Liangshan prefecture (95.5%). The CRF07_BC strains from Liangshan prefecture were found to be intermixed with those from Yunnan province in phylogenetic trees. The CRF07_BC sequences from Xinjiang province can be grouped into several clusters, suggesting that the expansion of the CRF07_BC epidemic in Xinjiang province was the result of a local epidemic driven by multiple independent introductions in the late 1990s. Only low-level drug-resistant viruses were found in the IDU population. CRF07_BC strains from Liangshan prefecture were more similar to those from Yunnan province than those from Xinjiang province. This finding will contribute to our understanding of the distribution, the evolution, and the potential source of CRF07_BC founder strains, and will also provide useful information for the development of strategies to prevent transmission

A numerical study on fracture-plugging behaviour of granular lost circulation materials

A distinct element approach has been introduced for simulating the plugging performance of granular lost circulation materials (LCM) in a fracture. This approach solves the fully coupled fracture walls, fluid and particles system in an interactive environment. The effects of the particle shape, size distribution and concentration on the fracture-plugging performance of the granular LCM have been investigated using the three-dimensional particle flow code (PFC3D). The simulated results showed that the irregular granular LCM could plug a fracture width larger than the sieving granulation by single-particle bridging type. The particle size distribution (PSD) of LCM dominates the plugging depth and efficiency in a fracture and there exists an optimum concentration for maximum effect of LCM additives

An Order-Preserving Encryption Scheme Based on Weighted Random Interval Division for Ciphertext Comparison in Wearable Systems

With the rapid development of wearable devices with various sensors, massive sensing data for health management have been generated. This causes a potential revolution in medical treatments, diagnosis, and prediction. However, due to the privacy risks of health data aggregation, data comparative analysis under privacy protection faces challenges. Order-preserving encryption is an effective scheme to achieve private data retrieval and comparison, but the existing order-preserving encryption algorithms are mainly aimed at either integer data or single characters. It is urgent to build a lightweight order-preserving encryption scheme that supports multiple types of data such as integer, floating number, and string. In view of the above problems, this paper proposes an order-preserving encryption scheme (WRID-OPES) based on weighted random interval division (WRID). WRID-OPES converts all kinds of data into hexadecimal number strings and calculates the frequency and weight of each hexadecimal number. The plaintext digital string is blocked and recombined, and each block is encrypted using WRID algorithm according to the weight of each hexadecimal digit. Our schemes can realize the order-preserving encryption of multiple types of data and achieve indistinguishability under ordered selection plaintext attack (IND-OCPA) security in static data sets. Security analysis and experiments show that our scheme can resist attacks using exhaustive methods and statistical methods and has linear encryption time and small ciphertext expansion rate