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.
31 October 2022 in IEEE Transactions on Network and Service Management
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.
1 August 2013 in International Journal of Systematic and Evolutionary Microbiology
Two Gram-negative, non-motile, rod-shaped strains, BQ4-1T and NHI3-2, isolated respectively from the healthy and diseased part of Populus ×euramericana canker bark, were characterized using a polyphasic approach. Chemotaxonomic characterization supported the inclusion of the two strains in the genus Acinetobacter , with genomic DNA G+C contents (42.5–43 mol%) within the range observed for this genus (38–47 mol%) and 9-octadecenoic acid (C18 : 1ω9c, 39.87 %), hexadecanoic acid (C16 : 0, 11.26 %) and summed feature 3 (comprising C16 : 1ω7c/C16 : 1ω6c, 18.90 %) as major fatty acids. Phylogenetic analysis based on 16S rRNA, rpoB and gyrB gene sequences revealed that strains BQ4-1T and NHI3 did not cluster with any species with validly published names, and formed a distinct cluster with 99–100 % bootstrap support on three phylogenetic trees within the genus Acinetobacter . Acid was not produced from d-glucose, and haemolysis was not observed on agar media supplemented with sheep erythrocytes. On the basis of phenotypic, genotypic and phylogenetic characteristics, the two strains are considered to represent a novel species of the genus Acinetobacter , for which the name Acinetobacterpuyangensis sp. nov. is proposed. The type strain is BQ4-1T ( = CFCC 10780T = JCM 18011T).
21 March 2018 in Journal of Systems Science and Systems Engineering
Emergency path planning technology is one of the research hotspots of intelligent transportation systems. Due to the complexity of urban road networks and congested road conditions, emergency path planning is very difficult. Road congestion caused by urban emergencies directly affects the original road network structure. In this way, the static weight of the original road network is no longer suitable as the basis for path recommendation. To handle the dynamic situational road network, an equidistant grid emergency path planning framework will be designed. A novel situation grid road network model, based on situation information, is proposed and applied to an equidistant grid emergency path planning framework. A situational grid heuristic search will be proposed methodology based on this model, which can be used to detect the vehicles passing around the congestion area grid and the road to the destination in the shortest time. In the path planning methodology, a grid inspired search strategy based on quaternion function is included, which can make the algorithm converge to the target grid quickly. Three graph acceleration algorithms are proposed to improve the search efficiency of path planning algorithm. Finally, this paper will set up three experiments to verify our proposed method.
When an emergency occurs in the city, a large area of road congestion usually occurs. Therefore, it is particularly important to provide an effective emergency path planning strategy for vehicles. However, existing emergency path planning methods do not take into account the connectivity characteristics of the road network and commuting capacity. For this purpose, a Grid Map Emergency Path Planning (GMEPP) framework based on a novel model Grid Road Network (GRN) is designed in this paper. First, the road network data is divided into grids under equal spacing bands, and the roads data divided into different grids and use the commuting capacity of each road as the weight of each edge in the grid. Then a Grid PageRank (GPR) algorithm will be introduced, the output value of this methodology is calculated based on the capacity and number of connected edges of all vertices pointed by the external grid in each grid. The higher value of the grid will be recommended to users first when the path is planning. According to the GRN model, an improved Bidirectional Dijkstra will be applied to query the shortest path between two points, which is called Gird Bidirectional Dijkstra (GBD). At last, GMEPP uses Reverse Contraction Hierarchies (RCH) and Multiple Reverse Contraction Hierarchies (MRCH) originality methodologies based on intersection type to speed up the query algorithm GBD. To compare the efficiency of the proposed method, this paper conducted extensive experiments to verify. The results of the test showed that the Gird Bidirectional Dijkstra Multiple Reverse Contraction Hierarchies (GBD-MRCH) is better than other methods in different grid distributions.