Based on a Web search engine (AltaVista), the system makes use of additional software modules coded in Visual C + + to construct a query-specific neighborhood graph and store the graph nodes and edges in a database for hyperlink analysis.

PISOMAP(Pruned-ISOMAP). P-ISOMAP can prune effectively shortcut edges existed possibly in the neighborhood graph according to their costs over the SOMST,and thus is much less sensitive to the neighborhood size than ISOMAP.

Based on the fact that “short circuit” edges pass the area with the relatively lower local densities, this paper presents a new variant of ISOMAP, i.e. P-ISOMAP (pruned-ISOMAP), which can prune effectively “short circuit” edges existed possibly in the neighborhood graph and thus is much less sensitive to the neighborhood size and more topologically stable than ISOMAP.

(2) DRNG (Directed Relative Neighborhood Graph) is a localized topology control algorithm for heterogeneous wireless sensor networks with non-uniform transmission range.

In addition to its simplicity, it preserves some key features of complex systems, such as dynamic behaviors, local interactions and changing neighborhood graph.

In this paper, a new algorithm for constructing the relative neighborhood graph(RNG) of ann points set in Euclideank-dimensional space is presented, for fixedk≥3.

We prove that, for broadcasting, the relative neighborhood graph (RNG), which is the previously best-known sparse structure that can be constructed locally, could use energy O(n) times the total energy used by our structure LRNG.

In the Z2 case, this leads to an extension of the neighborhood graph of the even self-dual lattices in 24 dimensions to conformal field theories, and we demonstrate that the graph becomes disconnected.

Conjectured Z2-Orbifold Constructions of Self-Dual Conformal Field Theories at Central Charge 24 - the Neighborhood Graph

AnO(n logn) divide-and-conquer algorithm for finding the relative neighborhood graph RNG(V) of a set V ofn points in Euclidean space is presented.

This paper presents an effective method and a practical system for the construction of neighborhood graphs for topic distillation algorithms, such as HITS. Based on a Web search engine (AltaVista), the system makes use of additional software modules coded in Visual C + + to construct a query-specific neighborhood graph and store the graph nodes and edges in a database for hyperlink analysis.Experiments in the context of the Web indicate that the method is feasible,and the system is reliable....

This paper presents an effective method and a practical system for the construction of neighborhood graphs for topic distillation algorithms, such as HITS. Based on a Web search engine (AltaVista), the system makes use of additional software modules coded in Visual C + + to construct a query-specific neighborhood graph and store the graph nodes and edges in a database for hyperlink analysis.Experiments in the context of the Web indicate that the method is feasible,and the system is reliable.

It is necessary to access non-formatted information such as image and to process a mass of data fusion in the Remote Sensing Interpretation System. So we build a database system for remote sensing application to manage data effectively and to access data friendly, and this system provides data for Remote Sensing Interpretation System. When we present RSID, Remote Sensing Image Database, we consider the safeness, integrity, reliability and SQL function of RDBMS and the effective management formatted data, and...

It is necessary to access non-formatted information such as image and to process a mass of data fusion in the Remote Sensing Interpretation System. So we build a database system for remote sensing application to manage data effectively and to access data friendly, and this system provides data for Remote Sensing Interpretation System. When we present RSID, Remote Sensing Image Database, we consider the safeness, integrity, reliability and SQL function of RDBMS and the effective management formatted data, and combine the simulation and operations of a great deal of non-formatted and complex object of the OO language in Remote Sensing application, and integrate the merit of RDBMS and OO language, and uniformly manage remote sensing data, circumstance information and subject attribute information. At last we point out the limitation of kNN retrieval model in CBIR, then introduce the relative neighborhood graph retrieval model to satisfy better remote sensing image retrieval. In order to provide the access to database and to improve the safeness of data, we build remote sensing interfaces. Our RSID provides the support of database for image interpretation.

The success of ISOMAP depends greatly on choosing a suitable neighborhood size,however,it is still an open problem how to do this effectively.Based on characteristics of the SOMST(Second-Order Minimal Spanning Tree) in which shortcut edges can be avoided,this paper presented a variant of ISOMAP,i.e.PISOMAP(Pruned-ISOMAP).P-ISOMAP can prune effectively shortcut edges existed possibly in the neighborhood graph according to their costs over the SOMST,and thus is much less sensitive to the neighborhood...

The success of ISOMAP depends greatly on choosing a suitable neighborhood size,however,it is still an open problem how to do this effectively.Based on characteristics of the SOMST(Second-Order Minimal Spanning Tree) in which shortcut edges can be avoided,this paper presented a variant of ISOMAP,i.e.PISOMAP(Pruned-ISOMAP).P-ISOMAP can prune effectively shortcut edges existed possibly in the neighborhood graph according to their costs over the SOMST,and thus is much less sensitive to the neighborhood size than ISOMAP.Consequently,PISOMAP can be applied to data visualization more easily than ISOMAP for the open problem described above can be avoided to a certain extent;in addition,P-ISOMAP can also be more topologically stable and robust than ISOMAP.Finally,the feasibility and effectivity of P-ISOMAP can be verified by experimental results very well.