Vehicular ad hoc networks (VANETs) have become an important part of the intelligent transportation system that aims to promote communication among vehicles to ensure vehicular safety and improve the driving experience. In VANETs, signed messages need to be authenticated by roadside units in a very short time. Certificateless aggregate signature (CLAS) scheme has been considered as one of the promising solutions to solve the problem of limited network bandwidth and computing power in VANETs environment. In this article, we propose an efficient pairing-free CLAS, named eCLAS, which is suitable for communication between vehicle to infrastructure. The aggregated signature allows individual signature on different messages from different vehicles to be aggregated into one short signature. In the random oracle model, the security of the scheme is proved by the adaptive selection message attack and the difficulty of computation of discrete logarithm problem on the elliptic curve. Additionally, the security analysis shows that the proposed scheme can meet security requirements in VANETs. Compared with existing schemes, the result demonstrates that our scheme has obvious advantages in signature verification, thereby granting it better applicability.

Artificial intelligence is a branch of computer science that attempts to understand the essence of intelligence and produce a new intelligent machine capable of responding in a manner similar to human intelligence. Research in this area includes robotics, language recognition, image identification, natural language processing, and expert systems. In recent years, the availability of large datasets, the development of effective algorithms, and access to powerful computers have led to unprecedented success in artificial intelligence. This powerful tool has been used in numerous scientific and engineering fields including mineral identification. This paper summarizes the methods and techniques of artificial intelligence applied to intelligent mineral identification based on research, classifying the methods and techniques as artificial neural networks, machine learning, and deep learning. On this basis, visualization analysis is conducted for mineral identification of artificial intelligence from field development paths, research hot spots, and keywords detection, respectively. In the end, based on trend analysis and keyword analysis, we propose possible future research directions for intelligent mineral identification.

With the development of cloud computing, service computing, IoT(Internet of Things) and mobile Internet, the diversity and sociality of services are increasingly apparent. With the increasing complexity of collaborative relationships between services, service ecosystems are beginning to emerge with the characteristics of natural ecosystems, economic systems and complex networks. Under this context, how to realize systematic evaluation of service ecosystem is of great significance to promote its sound development. Based on this, this paper proposes a value entropy model that links the operating state of the system with the efficiency of value creation, which helps to clarify the performance of the service ecosystem from the perspective of multi-dimensional integration. In addition, a computational experiment system is established to verify the effectiveness of value entropy model, which stimulates the competitive evolution process of two service ecosystems with different strategies. The result shows that our model can provide new ideas for the analysis of service ecosystem evolution, and can also provide decision support for the optimization of operation strategy.

The Internet of Things (IoT) networks have become the infrastructure to enable the detection and reaction of anomalies in various domains, where an efficient sensory data gathering mechanism is fundamental since IoT nodes are typically constrained in their energy and computational capacities. Besides, anomalies may occur occasionally in most applications, while the majority of time durations may reflect a healthy situation. In this setting, the range, rather than an accurate value of sensory data, should be more interesting to domain applications, and the range is represented in terms of the category of sensory data. To decrease the energy consumption of IoT networks, this paper proposes an energy-efficient sensory data gathering mechanism, where the category of sensory data is processed by adopting the compressed sensing algorithm. The sensory data are forecasted through a data prediction model in the cloud, and sensory data of an IoT node is necessary to be routed to the cloud for the synchronization purpose, only when the category provided by this IoT node is different from the category of the forecasted one in the cloud. Experiments are conducted and evaluation results demonstrate that our approach performs better than state-of-the-art techniques, in terms of the network traffic and energy consumption.

In service-oriented computing, a user usually needs to locate a desired service for: (i) fulfilling her requirements or (ii) replacing a service, which disappears or is unavailable for some reasons, to perform an interaction. With the increasing number of services available within an enterprise and over the Internet, locating a service online may not be appropriate from the performance perspective, especially in large Internet-based service repositories. Instead, services usually need to be clustered according to their similarity. Thereafter, services in one or several clusters are necessary to be examined online during dynamic service discovery. In this paper, we propose to cluster data providing (DP) services using a refined fuzzy C-means algorithm. We consider the composite relation between DP service elements (i.e., input, output, and semantic relation between them) when representing DP services in terms of vectors. A DP service vector is assigned to one or multiple clusters with certain degrees. In addition, we introduce some operations for managing service clusters, when new services emerge or existing services disappear or become unavailable. When grouping similar services into one cluster, while partitioning different services into different clusters, the capability of service search engine is improved significantly. We have prototyped our approach and the source code is freely available on the web. We have evaluated our clustering approach in different settings and the results are very promising.