3757616
Hamilton cycles in 1-tough triangle-free graphs
A graph G is called triangle-free if G has no induced K3 as a subgraph. We set σ3=min{∑i=13d(vi)|{v1,v2,v3} is an independent set of vertices in G}. In this paper, we show that if G is a 1-tough and triangle-free graph of order n with n⩽σ3, then G is hamiltonian.
1667264
Path extendability of claw-free graphs
Let G be a connected, locally connected, claw-free graph of order n and x,y be two vertices of G. In this paper, we prove that if for any 2-cut S of G, S@?{x,y}=@A, then each (x,y)-path of length less than n-1 in G is extendable, that is, for any path P joining x and y of length h(
1145290
Hamilton cycles in regular 3-connected graphs
Abstract We show in this paper that for k ⩾63, every 3-connected, k -regular simple graph on at most 22 7 k vertices is hamiltonian.
20128924
Long path connectivity of regular graphs
Abstract Any pair of vertices in a 4-connected non-bipartite k -regular graph are joined by a Hamilton path or a path of length at least 3 k −6.
4362564
More powerful closure operations on graphs
Abstract Bondy and Chvatal have observed the following result: G =( V , E ) is a simple graph of order n . If uv ∉ E and d ( u )+ d ( v )⩾ n , then G is Hamiltonian iff G + uv is Hamiltonian. Thus, we can obtain a graph C n ( G ), named the n -closure of G , from G by successively joining pairs of non-adjacent vertices whose degree sum is at least n . Therefore, G is Hamiltonian if C n ( G ) is Hamiltonian. Moreover, Bondy and Chvatal [2] generalized this idea to several properties on G . In the paper, we present some more powerful closure operations that extend the idea of Bondy and Chvatal.
27692910
Dominating cycles in regular 3-connected graphs
Abstract Let G be a 3-connected, k -regular graph on at most 4 k vertices. We show that, for k ⩾63, every longest cycle of G is a dominating cycle. We conjecture that G is in fact hamiltonian.
8902892
Dynamic Load Balancing for I/O- and Memory-Intensive Workload in clusters Using a Feedback Control Mechanism
One common assumption of the existing models of load balancing is that the weights of resources and I/O buffer size are statically configured. Though the static configuration of these parameters performs well in a cluster where the workload can be predicted, its performance is poor in dynamic systems where the workload is unknown. In this paper, a new feedback control mechanism is proposed to improve the overall performance of a cluster with I/O-intensive and memory-intensive workload. The mechanism dynamically adjusts the resource weights as well as the I/O buffer size. Results from a trace-driven simulation show that this mechanism is effective in enhancing the performance of a number of existing load-balancing schemes.
16266615
NeuroQL: A Domain-Specific Query Language for Neuroscience Data
In this paper, we propose a domain-specific query language called NeuroQL for the neuroscience domain. NeuroQL is designed primarily for neuroinformatics database users and aims to enable users to directly interact with neuroscience databases in their professional concepts and terms with the help of a conceptual data model. NeuroQL is DBMS independent and can be translated into traditional query language such as SQL, OQL and XQuery. It integrates some object-oriented features, and supports neuron domain-specific data types and query operators, which can dynamically evolve when the underlying database schema evolves.
42202570
Improving ASM Search Using Mixture Models for Grey-Level Profiles
The use of Active Shape Models (ASM) has been shown to be an efficient approach to image interpretation and pattern recognition. In ASM, grey-level profiles at landmarks are modelled as a Gaussian distribution. Mahalanobis distance from a sample profile to the model mean is used to locate the best position of a given landmark during ASM search. We present an improved ASM methodology, in which the profiles are modelled as a mixture of Gaussians, and the probability that a sample is from the distribution is calculated using the probability density function (pdf) of the mixture model. Both improved and original ASM methods were tested on synthetic and real data. The performance comparison demonstrates that the improved ASM method is more generic and robust than the original approach.
41212780
Real-time rendering of 3D medical data sets
Interactive exploration of three dimension (3D) medical data sets is required by many applications, but the huge amount of computational time and storage space needed for rendering do not allow the visualization of large medical data sets by now. In this paper we present a new algorithm for rendering large medical data sets at interactive frame rates on standard PC hardware. The input data is converted into a compressed hierarchical wavelet representation in a preprocessing step. During rendering, the wavelet representation is decompressed on-the-fly and rendered using hardware texture mapping. The level of detail used for rendering is adapted to the local frequency spectrum of the data and its position relative to the viewer. Using a prototype implementation of the algorithm we were able to perform an interactive walkthrough of large medical data sets on a single of-the-shelf PC.
7857681
A 3D User Interface for Visualizing Neuron Location in Invertebrate Ganglia
Invertebrate nervous systems serve as important models for neuroscience research because they are comprised of relatively small numbers of individually identified neurons. There is no universal means of documenting locations of individual neurons that allows variability between specimens and can be generalized to different species. We present a new technique for visualizing and documenting neuron location. First, we describe a 3D user interface that allows neuroscientists to directly mark neuron locations on a 3D deformable model. A new mapping scheme is proposed that specifies the location of a neuron in a common coordinate system that accommodates the individual variability in size and shape of ganglia.