A construction of a spatial graph from a strongly invertible knot was developed by the second author, and a necessary and sufficient condition for the given spatial graph to be hyperbolic was provided as well. The condition is improved in this paper. This enable us to show that certain classes of knots can yield hyperbolic spatial graphs via the construction.

Introduction: Segmentation of brain images especially from magnetic resonance imaging (MRI) is an essential requirement in medical imaging since the tissues, edges, and boundaries between them are ambiguous and difficult to detect, due to the proximity of the brightness levels of the images. Material and Methods: In this paper, the graph-base...

Massively parallel DNA sequencing technologies are revolutionizing genomics research. Billions of short reads generated at low costs can be assembled for reconstructing the whole genomes. Unfortunately, the large memory footprint of the existing de novo assembly algorithms makes it challenging to get the assembly done for higher eukaryotes like mammals. In this work, we investigate the memory i...

We present the first steps towards an implementation of attack graph construction and analysis technique based on inference rules. In our model, XML credentials describe basic attacks to the system, then inference rules allow composition of new attacks. We aim at modifying previously developed algorithm for the analysis of transitive trust models to the analysis of attack graphs. Important pecu...

31 Efficient genomic selection in animals or crops requires the accurate prediction of 32 the agronomic performance of individuals from their high-density molecular marker 33 profiles. Using a training data set that contains the genotypic and phenotypic informa34 tion of a large number of individuals, each marker or marker allele is associated with 35 an estimated effect on the trait under stud...

This paper describes a system for constructing conceptual graph representation of text by using a combination of existing linguistic resources (VerbNet and WordNet). We use a twostep approach, by firstly identifying the semantic roles in a sentence, and then using these roles, together with semi-automatically compiled domain-specific knowledge to construct the conceptual graph representation.

Let X be an m × n matrix of indeterminates, m ≤ n, and T a new indeterminate. Consider the polynomial rings R0 = K[X] and R = R0[T ]. For a given positive integer t ≤ m, consider the ideal It = It(X) generated by the t-minors (i. e. the determinants of the t× t submatrices) of X . Using all these determinantal ideals, we define a new ideal J in R = R0[T ], which we call the generic graph constr...

We address graph visualization from the viewpoint of com piler construction Most data structures in compilers are large dense graphs such as annotated control ow graph syntax trees dependency graphs Our main focus is the animation and interactive exploration of these graphs Fast layout heuristics and powerful browsing methods are needed We give a survey of layout heuristics for general directed...

MOTIVATION New sequencing technologies generate larger amount of short reads data at decreasing cost. De novo sequence assembly is the problem of combining these reads back to the original genome sequence, without relying on a reference genome. This presents algorithmic and computational challenges, especially for long and repetitive genome sequences. Most existing approaches to the assembly pr...

This paper describes a morphological analysis method of continuous spoken Korean to solve the integration problem of speech recognition and natural language processing. The method centers on a Viterbi search-based morphological analysis on top of speech signal processing and MLP-based phone recognition. The main contribution of this paper is to introduce a Viterbi search-based morphological ana...