A novel layered method was proposed to solve the problem of Web services *** this method,services composition problem was formally transformed into the optimal matching problem of every layer,then optimal matching pro...
详细信息
A novel layered method was proposed to solve the problem of Web services *** this method,services composition problem was formally transformed into the optimal matching problem of every layer,then optimal matching problem was modeled based on the hypergraph theory,and solved by computing the minimal transversals of the ***,two optimization algorithms were designed to discard some useless states at the intermediary steps of the composition *** effectiveness of the composition method was tested by a set of experiments,in addition,an example regarding the travel services composition was also *** experimental results show that this method not only can automatically generate composition tree whose leaf nodes correspond to services composition solutions,but also has better performance on execution time and solution quality by adopting two proposed optimization algorithms.
Traffic flow forecasting is indispensable in modern urban life. Considering the complexity, variability and strong timeliness of traffic flow, traffic flow forecasting is a worth exploring but challenging research fie...
Obstacle avoiding is one of the most complex tasks for autonomous driving systems, which was also ignored by many cutting-edge end-to-end learning-based methods. The difficulties stem from the integrated process of de...
详细信息
In the initialization of the traditional semi-supervised k-means, the mean of some labeled data belonging to one same class was regarded as one initial center and the number of the initial centers is equal to the numb...
详细信息
Advanced information and communication technolo-gies can be used to facilitate traffic incident *** an incident is detected and blocks a road link,in order to reduce the incident-induced traffic congestion,a dynamic s...
详细信息
Advanced information and communication technolo-gies can be used to facilitate traffic incident *** an incident is detected and blocks a road link,in order to reduce the incident-induced traffic congestion,a dynamic strategy to deliver incident information to selected drivers and help them make detours in urban areas is proposed by this ***-dependent shortest path algorithms are used to generate a subnetwork where vehicles should receive such information.A simulation approach based on an extended cell transmission model is used to describe traffic flow in urban networks where path information and traffic flow at downstream road links are well *** results reveal the influences of some major parameters of an incident-induced congestion dissipation process such as the ratio of route-changing vehicles to the total vehicles,operation time interval of the proposed strategy,traffic density in the traffic network,and the scope of the area where traffic incident information is *** results can be used to improve the state of the art in preventing urban road traffic congestion caused by incidents.
Indentification of informative gene subsets responsible for discerning between available samples of gene expression data is an important task in bioinformatics. Reducts, from rough sets theory, corresponding to a mini...
详细信息
Skyline query processing has recently received a lot of attention in database *** a set of multi-dimensional objects,the skyline query finds the objects that are not dominated by *** the best of our knowledge,the exis...
详细信息
Skyline query processing has recently received a lot of attention in database *** a set of multi-dimensional objects,the skyline query finds the objects that are not dominated by *** the best of our knowledge,the existing researches mainly focus on how to efficiently return the whole skyline ***,as the cardinality and dimensionality of input dataset increase,the number of skylines grows exponentially,and hence this "huge" skyline set is completely useless to *** by the above fact,in this paper,we present a novel type of l-SkyDiv query,which only returns l skylines having maximum diversity,to improve the usefulness of skyline ***,we prove that the l-SkyDiv query belongs to the NP-Hard problem theoretically,and propose three efficient heuristic algorithms whose time complexities are polynomial to fast implement the proposed ***,we present detailed theoretical analyses and extensive experiments,demonstrating that our algorithms are both efficient and effective.
With the Internet and mobile communications becoming an indispensable part of people's daily lives, online transactions have become one of the most common payment methods. However, transaction fraud incidents also...
详细信息
There is a large amount of information in the network data that we canexploit. It is difficult for classical community detection algorithms to handle network data with sparse topology. Representation learning of netw...
详细信息
There is a large amount of information in the network data that we canexploit. It is difficult for classical community detection algorithms to handle network data with sparse topology. Representation learning of network data is usually paired with clustering algorithms to solve the community detection ***, there is always an unpredictable distribution of class clusters outputby graph representation learning. Therefore, we propose an improved densitypeak clustering algorithm (ILDPC) for the community detection problem, whichimproves the local density mechanism in the original algorithm and can betteraccommodate class clusters of different shapes. And we study the communitydetection in network data. The algorithm is paired with the benchmark modelGraph sample and aggregate (GraphSAGE) to show the adaptability of ILDPCfor community detection. The plotted decision diagram shows that the ILDPCalgorithm is more discriminative in selecting density peak points compared tothe original algorithm. Finally, the performance of K-means and other clusteringalgorithms on this benchmark model is compared, and the algorithm is proved tobe more suitable for community detection in sparse networks with the benchmarkmodel on the evaluation criterion F1-score. The sensitivity of the parameters ofthe ILDPC algorithm to the low-dimensional vector set output by the benchmarkmodel GraphSAGE is also analyzed.
Reusing existing class libraries can improve the productivity of software development. API usage patterns are useful resources for programmers in reusing class libraries. Existing approaches often exploit API graphs t...
详细信息
暂无评论