Bike-sharing systems are becoming popular and generate a large volume of trajectory data. In a bike-sharing system, users can borrow and return bikes at different stations. In particular, a bike-sharing system will be affected by weather, the time period, and other dynamic factors, which challenges the scheduling of shared bikes. In this article, a new shared-bike demand forecasting model based on dynamic convolutional neural networks, called SDF , is proposed to predict the demand of shared bikes. SDF chooses the most relevant weather features from real weather data by using the Pearson correlation coefficient and transforms them into a two-dimensional dynamic feature matrix, taking into account the states of stations from historical data. The feature information in the matrix is extracted, learned, and trained with a newly proposed dynamic convolutional neural network to predict the demand of shared bikes in a dynamical and intelligent fashion. The phase of parameter update is optimized from three aspects: the loss function, optimization algorithm, and learning rate. Then, an accurate shared-bike demand forecasting model is designed based on the basic idea of minimizing the loss value. By comparing with classical machine learning models, the weight sharing strategy employed by SDF reduces the complexity of the network. It allows a high prediction accuracy to be achieved within a relatively short period of time. Extensive experiments are conducted on real-world bike-sharing datasets to evaluate SDF. The results show that SDF significantly outperforms classical machine learning models in prediction accuracy and efficiency.
With the rapid development of e-business, web applications based on the Web are developed from localization to globalization, from B2C(business-to-customer) to B2B(business-to-business), from centralized fashion to decentralized fashion. Web service is a new application model for decentralized computing, and it is also an effective mechanism for the data and service integration on the web. Thus, web service has become a solution to e-business. It is important and necessary to carry out the research on the new architecture of web services, on the combinations with other good techniques, and on the integration of services. In this paper, a survey presents on various aspects of the research of web services from the basic concepts to the principal research problems and the underlying techniques, including data integration in web services, web service composition, semantic web service, web service discovery, web service security, the solution to web services in the P2P (Peer-to-Peer) computing environment, and the grid service, etc. This paper also presents a summary of the current art of the state of these techniques, a discussion on the future research topics, and the challenges of the web services.
The performance of vector graphics render has always been one of the key elements in mobile devices and the most important step to improve the performance is to enhance the efficiency of polygon fill algorithms. In this paper, we proposed a new and more efficient polygon fill algorithm based on the scan line algorithm and Grid Fill Algorithm (GFA). First, we elaborated the GFA through solid fill. Second, we described the techniques for implementing antialiasing and self-intersection polygon fill with GFA. Then, we discussed the implementation of GFA based on the gradient fill. Generally, compared to other fill algorithms, GFA has better performance and achieves faster fill speed, which is specifically consistent with the inherent characteristics of mobile devices. Experimental results show that better fill effects can be achieved by using GFA.
Energy consumption is one of the most important factors in wireless sensor networks (WSNs). Data transfer of sensor nodes makes great impact on the energy consumption of WSNs. To reduce the energy consumption, some nodes in a WSN form a coalition by transferring data coordinately instead of transferring alone. In this paper, we consider obtaining the method for data transfer strategies that can be specified as the proportion of the data sent by a node and that of the data forwarded by a node. First, we form the WSN coalitions based on Markov-process, and propose the concept of absorption coefficient to measure the coalitional profiles. Then, we use Nash equilibrium to determine the approximate data transfer strategies of the formed coalitions. Preliminary results of our simulation experiments show that the model proposed in this paper is effective to reduce the energy consumption of WSNs.
The Dzyaloshinskii-Moriya interaction (DMI), which is the antisymmetric part of the exchange interaction between neighboring local spins, winds the spin manifold and can stabilize nontrivial topological spin textures. Since topology is a robust information carrier, characterization techniques that can extract the DMI magnitude are important for the discovery and optimization of spintronic materials. Existing experimental techniques for quantitative determination of DMI, such as high-resolution magnetic imaging of spin textures and measurement of magnon or transport properties, are time-consuming and require specialized instrumentation. Here we show that a convolutional neural network can extract the DMI magnitude from minor hysteresis loops, or magnetic ``fingerprints,'' of a material. These hysteresis loops are readily available by conventional magnetometry measurements. This provides a convenient tool to investigate topological spin textures for next-generation information processing.
'/%3e%3cuse xlink:href='%23a' transform='rotate(23.036 .093 25.536)'/%3e%3cuse xlink:href='%23a' transform='rotate(45.87 1.273 16.18)'/%3e%3cuse xlink:href='%23a' transform='rotate(69.945 .996 12.078)'/%3e%3cuse xlink:href='%23a' transform='rotate(20.66 -19.689 31.932)'/%3e%3c/svg%3e)