In this report, the student presents her study on a multivariate visualization task. Specifically, the student would like to learn the use of Locally Linear Embedding (LLE) for visualization. While the experiment is using Wisconsin Breast Cancer dataset, the method is more generally applicable to other high-dimensional data as well. Three experiments were run to visualize the dataset. The three...

assessing seismic hazards involves specifying the likelihood, magnitude and location of earthquakes in a region. predicting the seismic hazards is the first step in reducing the impact of the damage caused by an earthquake.  in this study, to fully utilize all the known parameters which may possibly affect the occurrence of earthquakes (mb ≥ 4.5); a data-driven rule-extraction method called the...

We prove that Keimel and Lawson's K-completion Kc of the simple valuation monad Vs defines a Kc∘Vs on each -category K. also characterise Eilenberg-Moore algebras as weakly locally convex K-cones, its algebra morphisms continuous linear maps. In addition, we explicitly describe distributive law over Kc, which allows us to show any (resp., convex, linear) topological cone is K-cone. give an exam...

GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satisfiability and constraint satisfaction problems. We present an improvement to GSAT that is sensitive to the problem’s structure. When the problem has a tree structure the algorithm is guaranteed to find a solution in linear time. For non-tree networks, the algorithm designates a subset of nodes,...

Linear rank-width is a graph width parameter, which is a variation of rank-width by restricting its tree to a caterpillar. As a corollary of known theorems, for each k, there is a finite obstruction set Ok of graphs such that a graph G has linear rank-width at most k if and only if no vertex-minor of G is isomorphic to a graph in Ok. However, no attempts have been made to bound the number of gr...

The problem considered here is that of determining whether a given spanning tree is a minimal spanning tree. In 1984, Komll os presented an algorithm which required only a linear number of comparisons, but nonlinear overhead to determine which comparisons to make. We simplify his algorithm and give a linear time procedure for its implementation in the unit cost RAM model. The procedure uses tab...

This paper describes the notion of locally governed trees as a model of structurally restricted dependency structures of sentences. An abstract machine and its supporting software for the building of locally governed trees is introduced. The rest of the paper discusses how unambiguous, well-formed locally governed trees can be parsed in linear: time when certain structural constraints are in fo...

We consider homogeneous factor models on uniformly sparse graph sequences converging locally to a (unimodular) random tree T , and study the existence of the free energy density φ, the limit of the log-partition function divided by the number of vertices n as n tends to infinity. We provide a new interpolation scheme and use it to prove existence of, and to explicitly compute, the quantity φ su...

This paper proposes a method to extract the airway tree from CT images by continually extending the tree with locally optimal paths. This is in contrast to commonly used region growing based approaches that only search the space of the immediate neighbors. The result is a much more robust method for tree extraction that can overcome local occlusions. The cost function for obtaining the optimal ...