We present a novel object localization approach based on the global structure constraint model (GSC) and optimal algorithm. In GSC, Objects are described as constellations of points satisfied with their specific globa...
详细信息
ISBN:
(纸本)9781424431977;9780769531618
We present a novel object localization approach based on the global structure constraint model (GSC) and optimal algorithm. In GSC, Objects are described as constellations of points satisfied with their specific global structure constraints. The spatial relations among all the patches having stable color information and their representative color information around patches are encoded. Then, the searching algorithm, i.e. genetic algorithm, is used to locate target objects in images by finding out the exactly matched position. In the experiment, we tested the approach on a collection of human face images and the results demonstrated the approach is simple, effective and efficient.
Attribute discretization is one of the key issues for the Rough Set theory. First, a method is proposed to compute an initial cut points set. The indistinguishable relation of decision tables did not change, and the n...
详细信息
Attribute discretization is one of the key issues for the Rough Set theory. First, a method is proposed to compute an initial cut points set. The indistinguishable relation of decision tables did not change, and the number of elements in the initial cut points set was reduced. Then, the cut point information entropy was defined to measure the importance of a cut point. Finally, an attribute discretization algorithm based on the Rough Set and information entropy was proposed. The consistence of decision tables did not change, and the mixed decision table was considered, which contains continuous and discrete attributes. The experimental results show that this algorithm is effective and is competent for processing the large-scale datasets.
Aiming at the dynamic policy trigger problem in policy based network management, this thesis first introduces the uncertain information generated by one-point coverage random sets theory and also the unified framework...
详细信息
Aiming at the dynamic policy trigger problem in policy based network management, this thesis first introduces the uncertain information generated by one-point coverage random sets theory and also the unified framework of fuzzy information. On the basis of which, according to the feature of policy based network management, a model used to update the predicted information using present known information, experience, and knowledge is designed. At the same time, this thesis put forward that, take the semblance of policy as constant probability in product space conditional event algebra, so as to execute information fusion of multiple sets of related policy. In the end, compared with the policy based inference system and then analyze the result.
A framework of hiberarchy trusted network basedon the grade division was put forward,and thepartition rules of trusted attributes as well as themethods of grade division were explained in ***,the potential application...
详细信息
A framework of hiberarchy trusted network basedon the grade division was put forward,and thepartition rules of trusted attributes as well as themethods of grade division were explained in ***,the potential applications of this frameworkin trusted network were discussed,and the accessprocedure of terminals in hiberarchy trusted networkwas given based on the existing research *** show that by the proposed framework,notonly the safety and reliability of network can beensured,but also the flexibility of ways to accessnetwork is strengthened,and that the framework canprovide supports for interoperability of differentequipment suppliers.
Internet is a complex network with the characteristic of self-organized criticality. The cascading dynamics of Internet are presented and two reasons are pointed out, which may cause cascading failures. Different from...
详细信息
Internet is a complex network with the characteristic of self-organized criticality. The cascading dynamics of Internet are presented and two reasons are pointed out, which may cause cascading failures. Different from betweenness centrality, a congestion function to represent the extent of congestion is proposed. By introducing the concept of "delay time", the correlation between permanent removing and non-removing is built. And a new evaluation function of network efficiency based on congestion function is given in order to measure the damage of cascading failures. Moreover some effects of network structure and size, delay time on congestion propagation are also investigated, and cascading process composed of three phases and some factors affecting cascade propagation are uncovered.
This paper demonstrates the necessity of the use of PSC-CEA for dynamic policy triggering in the process of mobile IP switching; in the mean time, according to the characteristics of policy based network management, p...
详细信息
This paper demonstrates the necessity of the use of PSC-CEA for dynamic policy triggering in the process of mobile IP switching; in the mean time, according to the characteristics of policy based network management, propose a dynamic policy trigger model, and designs a mechanism which is used to update dynamic policy according to known information, experience and knowledge to satisfy the QoS of mobile services and use current network resource sufficiently.
The flowshop scheduling problem has been widely studied in the literature and many techniques have been applied to it, but few algorithms have been proposed to solve it using particle swarm optimization algorithm (PSO...
The flowshop scheduling problem has been widely studied in the literature and many techniques have been applied to it, but few algorithms have been proposed to solve it using particle swarm optimization algorithm (PSO) based algorithm. In this paper, an improved PSO algorithm (IPSO) based on the ldquoall differentrdquo constraint is proposed to solve the flowshop scheduling problem with the objective of minimizing makespan. It combines the particle swarm optimization algorithm with genetic operators together effectively. When a particle is going to stagnates, the mutation operator is used to search its neighborhood. The proposed algorithm is tested on different scale benchmarks and compared with the recently proposed efficient algorithms. The results show that both the solution quality and the convergent speed of the IPSO algorithm precede the other two recently proposed algorithms. It can be used to solve large scale flowshop scheduling problem effectively.
After analyzing the specific security requirements of the wireless communication network based on IEEE802.16, a series of key issues about security methods and techniques were researched. A new authentication protocol...
详细信息
After analyzing the specific security requirements of the wireless communication network based on IEEE802.16, a series of key issues about security methods and techniques were researched. A new authentication protocol for wireless mobile environment was proposed and designed. Then, its security was analyzed from the angle of technical realization and formal analysis to verify whether the original safety goals were achieved. Especially, formal analysis was mostly done. Finally, system testing was also carried out and the results were analyzed to verify function and performance of the new protocol.
The e-commerce information on the surface Web is supported by the Deep Web, which can not be accessed directly by the search engines or the Web crawlers. The only way to access the backend database is through query in...
详细信息
ISBN:
(纸本)9781424439027
The e-commerce information on the surface Web is supported by the Deep Web, which can not be accessed directly by the search engines or the Web crawlers. The only way to access the backend database is through query interface. Extracting valid attributes from the query forms and automatic translating the source query into a target query is a solvable way for addressing the current limitations in accessing Deep Web data sources. To generate a valid query, we have to reconcile the key attributes and their semantic relation. We present our framework to solve the problem. To enrich the set of attributes contained in the semantic form, we use the WordNet as kinds of ontology technique and we try to find the semantic relation of the attributes in the same query from and different forms. Extensive experiments over real-word domains show the utility of our query translation framework.
暂无评论