A generalization of the 0-1 knapsack problem that is hard-to-solve both theoretically (NP-hard) and in practice multi-demand multidimensional (MDMKP). Solving an MDMKP can be difficult because its conflicting demand constraints. Approximate solution approaches provide no guarantees on quality. Recently, with use classification trees, MDMKPs were partitioned into three general categories based t...

Background and Purpose—Clinical studies currently in progress are using subjective methods to characterize plaque morphology from ultrasound images. However, there are few studies on the intraobserver and interobserver variability of these classifications. This study was designed to assess these variables. Methods—Grading of plaque morphology from ultrasound images, stored both digitally and to...

Lecture notes from M275 at SJSU, a graduate-level course at SJSU in Algebraic Topology taught by Professor Richard Kulbelka. These notes were taken using Vim and/or GVim equipped with L A T E X-Suite, which sped up typesetting significantly; latexmk with the flag-pvc was useful for compiling these notes in real-time. 1.1 The Question Question. Given two topological spaces, can we determine if t...

Stereo correspondence is hard because di erent image features can look alike. We propose a measure for the ambiguity of image points that allows matching distinctive points rst and breaks down the matching task into smaller and separate subproblems. Experiments with a branch-and-bound algorithm based on this measure demonstrate the ensuing e ciency and low likelihood of incorrect matches. Categ...

‎This paper develops a basic theory of $H$-groups‎. ‎We‎ ‎introduce a special quotient of $H$-groups and‎ ‎extend some algebraic constructions of topological groups to the category‎ ‎of H-groups and H-maps and then present a functor from this category to the category of quasitopological groups‎.

This paper presents the literature survey review of Travelling Salesman Problem (TSP). TSP belongs to the category of NP-hard problems. A various number of methods have been designed to solve this problem. Genetic Algorithm is one of the best methods which is used to solve various NP-hard problem such as TSP. The natural evolution process is always used by genetic Algorithm to solve the problem...

We prove a complexity classification theorem that classifies all counting constraint satisfaction problems (#CSP) over Boolean variables into exactly three categories: (1) Polynomial-time tractable; (2) #P-hard for general instances, but solvable in polynomial-time over planar graphs; and (3) #P-hard over planar graphs. The classification applies to all sets of local, not necessarily symmetric,...

in addition to exploring constructions and properties of limits and colimits in categories of topologicalalgebras, we study special subcategories of topological algebras and their properties. in particular, undercertain conditions, reflective subcategories when paired with topological structures give rise to reflectivesubcategories and epireflective subcategories give rise to epireflective subc...