Working with polygonal models that contain tens of millions of polygons or more is difficult because such models tend not to fit into the core memory of a typical workstation. Even models of only a few million polygons are too large. A typical workstation has a gigabyte of memory, but these large models require an order of magnitude more. Rendering and other manipulations of polygonal models of...

We present a method for performing model checking of imperative programs by using techniques based on the specialization of constraint logic programs (CLP). We have considered a simple imperative language, called SIMP, extended with a nondeterministic choice operator, and we have introduced a CLP interpreter which defines the operational semantics of SIMP. Our software model checking method whi...

Near neighbor search in very high dimensional spaces is useful in many applications. Existing techniques solve this problem efficiently only for the approximate case. These solutions are designed to solve r-near neighbor queries only for a fixed query range or a set of query ranges with probabilistic guarantees and then, extended for nearest neighbor queries. Solutions supporting a set of query...

Proteins show drastic discrepancies in their contribution to the collection of self-peptides that shape the repertoire of CD8 T cells (MHC I self-immunopeptidome). To decipher why selected proteins are the foremost sources of MHC I-associated self-peptides, we chose to study SIMP/STT3B because this protein generates very high amounts of MHC I-associated peptides in mice and humans. We show that...

These theories introduce basic concepts and proofs about discrete summation: shifts, formal summation, falling factorials and stirling numbers. As proof of concept, a simple summation conversion is provided. 1 Stirling numbers of first and second kind theory Stirling imports Main begin 1.1 Stirling numbers of the second kind fun Stirling :: nat ⇒ nat ⇒ nat where Stirling 0 0 = 1 | Stirling 0 (S...

We examine both the Evolutionary Structural Optimisation (ESO) and Solid Isotropic Microstructure with Penalisation (SIMP) methodologies by investigating a cantilever tie-beam. Initially, both ESO and SIMP produce designs with higher objective function values relative to a previously published ‘intuitive’ design. However, after careful investigation of the numerical parameters such as the initi...

Solid Isotropic Microstructure with Penalization(SIMP) in topology optimization was deeply analyzed, and thus SIMP topology optimization criteria algorithm was deduced. Simulation analysis to the results was also conducted by Ansys, so as the structural lightweight design to machine crossbeams of the HTM series gantry. By verifying, the structure was 3.8% lower than the traditional structure qu...

A simplex of a graph G is a subgraph of G which is a complete graph. The simplex graph Simp(G) of G is the graph whose vertex set is the set of all simplices of G and in which two vertices are adjacent if and only if they have a non-empty intersection. The simplex graph operator is the operator which to every graph G assigns its simplex graph Simp(G). The paper studies graphs which are fixed in...

Illegal, Unreported, and Unregulated (IUU) fishing is a significant challenge to sustainable seafood production which difficult address in traditional governance systems. Recently, the U.S. has implemented Seafood Import Monitoring Program (SIMP) combat IUU fraud by requiring chain-of-custody documentation of 13 species when imported This will exclude from market. If market power due large impo...