205481363
A new sufficient condition for Hamiltonicity of graphs
Rahman and Kaykobad proved the following theorem on Hamiltonian paths in graphs. Let G be a connected graph with n vertices. If d(u)+d(v)+δ(u, v) ≥ n+1 for each pair of distinct non-adjacent vertices u and v in G, where δ(u, v) is the length of a shortest path between u and v in G, then G has a Hamiltonian path. It is shown that except for two families of graphs a graph is Hamiltonian if it satisfies the condition in Rahman and Kaykobad's theorem. The result obtained in this note is also an answer for a question posed by Rahman and Kaykobad.
30689406
Some hamiltonian properties of L1-graphs
Abstract A graph G is called an L 1 -graph if, for each triple of vertices u, v, and w with d ( u , v )=2 and w ∈ N ( u )∩ N ( v ), d ( u )+ d ( v )⩾| N ( u )∪ N ( v )∪ N ( w )|−1. Let G be a 2-connected L 1 -graph of order n. If δ ( G )⩾( n −2)/3 or σ 3 ( G )⩾ n , then G is hamiltonian or G∈ K , where σ 3 (G)= min {d(u)+d(v)+d(w) : {u,v,w} is an independent set in G }, K ={G : K p,p+1 ⊆G⊆K p +(p+1)K 1 for some p ⩾2}. Some results on the traceability of L 1 -graphs are also obtained.
6775901
Hamiltonicity of 3-connected quasi-claw-free graphs
A graph G is called quasi-claw-free if it satisfies the property: d(x,y)[email protected]? there exists [email protected]?N(x)@?N(y) such that N[u]@?N[x]@?N[y]. Let G be a 3-connected quasi-claw-free graph of order n. If @d(G)>=(n+5)/5, then G is hamiltonian.
27953110
Every 3-connected distance claw-free graph is Hamilton-connected
A graph G is said to be distance claw-free (in DC) if for each vertex v in V(G) the independence number of the subgraph of G induced by the set of vertices at distance i from v is at most 2 for each i>=0. It is shown that every 3-connected graph in DC is hamilton-connected, answering affirmatively a question of Shepherd.
41530847
A Note on Hamiltonian Cycles in K(1, r)-Free Graphs
38366889
Hamiltonicity of 2-connected quasi-claw-free graphs
A graph G is called quasi-claw-free if it satisfies the property: d(x,y)=2 ⇒ there exists u∈N(x)∩N(y) such that N[u]⊆N[x]∪N[y]. Let G be a 2-connected quasi-claw-free graph of order n. If δ(G)⩾n/4, then G is hamiltonian or G∈F, where F is a family of nonhamiltonian graphs of connectivity 2.
9157971
Service Publishing and Discovering Model in a Web Services Oriented Peer-to-Peer System
To enhance the reliability and scalability of the service oriented architecture, this paper introduces a Web Services Oriented Peer-to-peer (WSOP) architecture with a combination of centralized and decentralized characteristics, and gives a framework of service publishing and discovery model based on WSOP architecture.
27287493
Integration of multidimensional geospatial information for coastal management and decision-making
Coastal management and decision-making requires timely and accurate multidimensional geospatial data that often reside in government agencies, organizations, and institutions on various levels. Integration of such data involves research on the spatial and temporal characteristics of coastal geospatial information, interoperability of spatial databases and tools, and distributed and mobile technologies. This demonstration will present a system we have developed in last four years, which aims at integrating multidimensional coastal spatial data and information technology to enhance the operational capabilities of federal, state, and local agencies responsible for coastal management and decision making.
7219842
Accurate Curvilinear Modeling for Precise Measurements of Tubular Structures
Accurate curvilinear models of tubular structures are essential for the precise measurements and description of those structures. Two major obstacles to obtaining an accurate curvilinear model from a three-dimensional (3D) image are tortuosity of the tubular structure and interferences from such sources as foreign entities in the neighborhood, pathological deformation and artifacts. Using existing algorithms, the tortuosity and interferences can give rise to models that tend to significantly distort subsequent length and angle measurements. In this paper, we describe a novel approach that overcomes those obstacles by combining a knowledge-embedding model with a front propagation method. We then demonstrate the effectiveness of our method through its potential applications in path planning and measurement for minimally invasive diagnosis and treatment purposes.
2080269
Testing multivariate uniformity and its applications
Some new statistics are proposed to test the uniformity of random samples in the multidimensional unit cube [0, 1] d (d ≥ 2). These statistics are derived from number-theoretic or quasi-Monte Carlo methods for measuring the discrepancy of points in [0,1] d Under the null hypothesis that the samples are independent and identically distributed with a uniform distribution in [0,1] d , we captain some asymptotic properties of the new statistics. By Monte Carlo simulation, it is found that the finite-sample distributions of the new statistics are well approximated by the standard normal distribution, N(0,1), or the chi-squared distribution, X 2 (2). A power study is performed, and possible applications of the new statistics to testing general multivariate goodness-of-fit problems are discussed.
11775748
Schema Mapping for Interoperability in XML-based multidatabase
The main aim of a multidatabase system (MDBS) is to achieve data integration and interoperability among distributed and heterogeneous database systems. But data model heterogeneity and schema make this a challenging task. Multidatabase users can only view the global schemas whose real data come from local database systems. Thus, mappings from global schemas to local schemas should be established. At the same time, the recent emergence of XML has shown great intractability as a new standard for data representation and exchange on the Web. A data model based on XML becomes more suitable for integrating different types of systems. This paper firstly introduces a multidatabase common data model based on XML, named XML-based Integration Model (XIDM). Then, an approach of schema mappings based on XIDM in MDBSs has been presented. Finally, the illustration and implementation of schema mappings in a multidatabase prototype - Panorama are also discussed.