Accurate traffic flow prediction is becoming increasingly important for transportation planning, control, management, and information services of successful. Numerous existing models focus on short-term traffic forecasts, but effective long-term forecasting of traffic flows have become a challenging issue in recent years. To solve this problem, this paper proposes a deep learning architecture which consisting of two parts: the long short-term memory encoder-decoder structure at the bottom and the calibration layer at the top. In the encoder-decoder model, we propose an hard attention mechanism based on learning similar patterns to enhance neuronal memory and reduce the accumulation of error propagation. To correct some of the missing details, we design a control gate in the calibration layer to learn the predicted data in groups according to different forms. The proposed method is evaluated on real-world datasets and compared with other state-of-the-art methods. It is verified that our model can accurately learn local feature and long-term dependence, and has better accuracy and stability in long-term sequence prediction.

Multi-agent technologies have been widely applied to many applications, such as in e-markets, cloud computing, service-oriented environments, etc. In real applications, service-oriented environments are open and dynamic, where loosely coupled agents interact to consume and provide services. How to accurately evaluate the potential performance (i.e., QoS) of service providers on the service requested by a service consumer in such open and dynamic environments is a challenging issue in both theory and practice. In this paper, an innovative approach is proposed to evaluate the QoS of service providers in service-oriented environments. The proposed approach first borrows the reference report mechanism from the certified reputation model, so as to efficiently collect reference reports (i.e., historical performance) of service providers in open and dynamic environments. Then, a tensor-based QoS model is proposed to construct multi-dimensional relationships between QoS evaluation factors and the QoS values of service providers based on the collected reference reports. The QoS evaluation factors include the type of services, the performance of service providers, the subjectivity of service consumers, the time slot of reference reports. Finally, a CANDECOMP/PARAFAC decomposition and gradient descent-based mechanism is used to evaluate the QoS values of service providers through completing the missing entry values in the constructed tensor. The uniform random simulation experiments indicate that the proposed approach can achieve efficient and accurate QoS evaluation in service-oriented environments with only limited collected reference reports, especially when some service providers do not have reference reports.

Nowadays, wireless sensor networks have played an important role in many applications. In these applications, a large number of wireless sensors are deployed in an environment to collect information and form network to transmit collected information to the base station or sink. Because wireless sensors have to work for a long period of time without maintenance, the energy consumption of wireless sensors has a great impact on the lifetime of wireless sensor network. To reduce and balance the energy consumption of wireless sensors, many information transmission routing approaches have been proposed. However, most of them do not consider all energy consumption factors of wireless sensors. To this end, an innovative information transmission routing approach based on Q-learning is proposed in this paper, which enables wireless sensors to adaptively select suitable neighboring sensors to achieve energy efficient information transmission in a decentralized manner. Based on the proposed approach, a wireless sensor first collects state and action information of its neighboring sensors, which includes information transmission direction and distance, the remaining energy, the energy consumption for information transmission and information transmission action. Then, all this information is used to update the Q-values of neighboring sensors, so as to enable the wireless sensor to select suitable neighboring sensor to transmit information according to Q-values. From simulation experiments, it can be seen that the proposed approach enables wireless sensors to reduce and balance the energy consumption of wireless sensors and extend the lifetime of the entire wireless sensor network.

Modern processors employ data prefetchers to alleviate the impact of long memory access latency. However, current prefetchers are designed for specific memory access patterns, which perform poorly on mixed applications with multiple memory access patterns. To address these issues, RL-CoPref, a reinforcement learning (RL)-based coordinated prefetching controller for multiple prefetchers, is proposed in this paper. RL-CoPref takes diverse program context information as the input, learns to maximize cumulative rewards, and evaluates prefetch quality based on prefetch hits/misses and memory bandwidth utilization. It can dynamically adjust the prefetch activation and prefetch degree, enabling multiple prefetchers to complement each other on mixed applications. Our extensive evaluation, utilizing the ChampSim simulator, demonstrates that RL-CoPref can effectively adapt to various workloads and system configurations, optimizing prefetch control. On average, RL-CoPref achieves 76.15% prefetch coverage, having 35.50% IPC improvement, outperforming state-of-the-art individual prefetchers by 5.91–16.54% and outperforming SBP, a state-of-the-art (non-RL) prefetch controller, by 4.64%.

With the development of society and economy, the urban rail transit has become one of the important components of urban transportation system, while the construction of the urban rail greatly improves the public transportation environments. Currently, there are many research focus on the passenger flow predictions according to their corresponding historical data, however, it is hard to assist transport models vary such volumes for a new station planning or being constructed. In view of this limitation, we provide a novel method for urban rail station characteristics analysis in intelligent transportation considering city land usages. Initially, point of interest (POIs) are divided by the proposed RC-tree (Colored R-tree)-based algorithm into the bounded areas for each station. Second, the Diversity and Proportion approaches are proposed to extract the top-k POIs from bounded areas based on their semantic and spatial characteristics. Then, classify the stations based on the similarity of the extracted top-k POIs. Moreover, we made a case study on real dataset, including a large volume of Automatic Fare Collection system (AFC) records for the experimental evaluations, and the results show that the proposed method can verify the rationality of land use and provide support for the application of transportation model technology.