A cross point assignment algorithm is proposed under consideration of very long nets (LCPA).It is to consider not only the cost of connection between cross points and pins and the exclusive cost among cross points on ...A cross point assignment algorithm is proposed under consideration of very long nets (LCPA).It is to consider not only the cost of connection between cross points and pins and the exclusive cost among cross points on the boundary of a global routing cell,but also the cost of displacement among cross points of the same net.The experiment results show that the quality and speed in the following detailed routing are improved obviously,especially for very long nets.展开更多
Deep web data integration needs to do schema matching on web query interfaces and obtain the mapping table.By introducing semantic conflicts into web query interface integration and discussing the origins and categori...Deep web data integration needs to do schema matching on web query interfaces and obtain the mapping table.By introducing semantic conflicts into web query interface integration and discussing the origins and categories of the semantic conflicts,an ontology-based schema matching method is proposed.The process of the method is explained in detail using the example of web query interface integration in house domain.Conflicts can be detected automatically by checking semantic relevance degree,then the categories of the conflicts are identified and messages are sent to the conflict solver,which eliminates the conflicts and obtains the mapping table using conflict solving rules.The proposed method is simple,easy to implement and can be flexibly reused by extending the ontology to different domains.展开更多
The interval graph completion problem of a graph G includes two class problems： the profile problem and the pathwidth problem, denoted as P（G） and PW（G） respectively, where the profile problem is to find an inter...The interval graph completion problem of a graph G includes two class problems： the profile problem and the pathwidth problem, denoted as P（G） and PW（G） respectively, where the profile problem is to find an interval supergraph with the smallest possible number of edges; the pathwidth problem is to find an interval supergraph with the smallest possible cliquesize. These two class problems have important applications to numerical algebra, VLSI- layout and algorithm graph theory respectively; And they are known to be NP-complete for general graphs. Some classes of special graphs have been investigated in the literatures. In this paper the exact solutions of the profile and the pathwidth of the complete multipartite graph Kn1,n2,...nr （r≥ 2） are determined.展开更多
文摘A cross point assignment algorithm is proposed under consideration of very long nets (LCPA).It is to consider not only the cost of connection between cross points and pins and the exclusive cost among cross points on the boundary of a global routing cell,but also the cost of displacement among cross points of the same net.The experiment results show that the quality and speed in the following detailed routing are improved obviously,especially for very long nets.
基金The National Natural Science Foundation of China(No.60673130)the Natural Science Foundation of Shandong Province(No.Y2006G29,Y2007G24,Y2007G38)the Encouragement Fund for Young Scholars of Shandong Province(No.2005BS01002)
文摘Deep web data integration needs to do schema matching on web query interfaces and obtain the mapping table.By introducing semantic conflicts into web query interface integration and discussing the origins and categories of the semantic conflicts,an ontology-based schema matching method is proposed.The process of the method is explained in detail using the example of web query interface integration in house domain.Conflicts can be detected automatically by checking semantic relevance degree,then the categories of the conflicts are identified and messages are sent to the conflict solver,which eliminates the conflicts and obtains the mapping table using conflict solving rules.The proposed method is simple,easy to implement and can be flexibly reused by extending the ontology to different domains.
基金Supported by the Natural Science Foundation of Henan Province（082300460190） Sponsored by Program for Science and Technology Innovation Talents in Universities of Henan Province.
文摘The interval graph completion problem of a graph G includes two class problems： the profile problem and the pathwidth problem, denoted as P（G） and PW（G） respectively, where the profile problem is to find an interval supergraph with the smallest possible number of edges; the pathwidth problem is to find an interval supergraph with the smallest possible cliquesize. These two class problems have important applications to numerical algebra, VLSI- layout and algorithm graph theory respectively; And they are known to be NP-complete for general graphs. Some classes of special graphs have been investigated in the literatures. In this paper the exact solutions of the profile and the pathwidth of the complete multipartite graph Kn1,n2,...nr （r≥ 2） are determined.
