16993770
Service matchmaking with rough sets
With the wide adoption of open grid services architecture (OGSA) and Web services resource framework (WSRF), the grid is emerging as a service-oriented computing infrastructure for engineers and scientists to solve data and computationally intensive problems. It is envisioned that computing resources in a future grid environment will be exposed as services. Service discovery becomes an issue of vital importance for a wider uptake of the grid. This paper presents RSSM, a rough sets based service matchmaking algorithm for service discovery with an aim to tolerate uncertainty in identifying service properties. The evaluation results show that the RSSM algorithm is more effective in service discovery compared with other mechanisms such as UDDI and OWLS.
14066256
Grid Service Discovery with Rough Sets
The computational grid is rapidly evolving into a service-oriented computing infrastructure that facilitates resource sharing and large-scale problem solving over the Internet. Service discovery becomes an issue of vital importance in utilizing grid facilities. This paper presents ROSSE, a Rough sets-based search engine for grid service discovery. Building on the Rough sets theory, ROSSE is novel in its capability to deal with the uncertainty of properties when matching services. In this way, ROSSE can discover the services that are most relevant to a service query from a functional point of view. Since functionally matched services may have distinct nonfunctional properties related to the quality of service (QoS), ROSSE introduces a QoS model to further filter matched services with their QoS values to maximize user satisfaction in service discovery. ROSSE is evaluated from the aspects of accuracy and efficiency in discovery of computing services.
45224109
Service Matchmaking and Discovery with Rough Sets
The past few years have seen the Grid is evolving as a service-oriented computing infrastructure. It is foreseen that various resources in a Grid environment will be exposed as services for use by a wider user community. Service discovery becomes an issue of vital importance for utilising Grid facilities. This paper presents Rosse, a Rough Sets based Search Engine for service discovery that can deal with uncertainty of service properties when matching service advertisements with service requests. The evaluation results show that Rosse is more effective in service discovery compared with other mechanisms such as UDDI keyword matching and OWL-S matchmaking.
37838547
Automatic understanding of symbol-connected diagrams
A symbol-connected diagram is mainly composed of symbols and their connections. All symbols can be categorized into two groups: shape symbols and structure symbols. This paper proposes a system for automatic understanding of symbol-connected diagrams based on a graph, called the consistent attributed graph (CAG), which represents the diagram in a bottom-up fashion. The shape symbol processing is carried out by means of shape processing, followed by shape symbol identification with the use of two symbol windows in the CAG. Some experimental results for understanding logic circuit diagrams are given.
28131114
Utilizing Fuzzy Petri Net for Choreography Based Semantic Web Services Discovery
Semantic Web Services have received great popularity these days for their capability of providing more automatic web services discoveries and compositions. However, the issue of behavior compatibility is still not properly solved. In this paper, we propose a choreography-based formal approach to discover semantic web services that are compatible with their behaviors. The fuzzy petri net is used to perform the modeling, verification, analysis and evaluation for the matchmaking of semantic web services. The requested and provided services are modeled by two fuzzy petri nets combined through a set of combination rules. By analyzing the composite fuzzy petri net, the behavior compatibility can be verified, and the matching degree between requested and provided services can be obtained. With our approach, the success rate and accuracy of the semantic web services discoveries can be improved, and the final services set can be optimized.
20490782
The Dynamics Mechanism Study on Interactive Development of Industry Clusters and Urbanization
Industry clusters with urbanization interactive development is a multi-factor complex system. In this research, we present a system dynamics methodology to construct an industrial clustering and urbanization interactive dynamics model, and further to make its simulation computation and analysis. The simulation results show that the development of industrial clusters stimulates the rise of urbanization level, and the level of urbanization and the growth of industrial clusters promote the development of industrial clusters. Also, a case study for Yiwu City, P.R.China is conducted. It shows that the urbanization of Yiwu City is a fairly advanced virtuous circle.
35252339
Hybrid Control of Hopf Bifurcation for an Internet Congestion Model
In this paper, the problem of Hopf bifurcation control for an Internet congestion model with time delays is considered by using a new hybrid control strategy, in which state feedback and parameter perturbation are used. It is well known that for the system without control, as the positive gain parameter of the system passes a critical point, Hopf bifurcation occurs. To control the Hopf bifurcation, a hybrid control strategy is proposed and the onset of an inherent bifurcation is delayed (advanced) when such bifurcation is undesired (desired). Furthermore, the dynamic behaviors of the controlled system can also be changed by choosing appropriate control parameters. Numerical simulation results confirm that the new control strategy is efficient in controlling Hopf bifurcation.
27633879
A more efficient branch and bound algorithm for feature selection
Abstract An algorithm is presented to be able to select the globally optimal subset of d features from a larger D -feature set. This is a fundamental problem in statistical pattern recognition and combinatorial optimization. Exhaustive enumeration is computationally unfeasible in most applications. This algorithm dynamically searches for the globally optimal solution on a minimum solution tree which is a subtree of the solution tree used in the traditional branch and bound algorithm. The new algorithm is compared theoretically with the branch and bound algorithm. The analysis and the experimental results show that it is more efficient than the traditional algorithm.