Abstract: Vertex Enumeration Algorithms explore the methods and procedures of generating the vertices of general polyhedra formed by system of equations or inequalities. These problems of enumerating the extreme points (vertices) of general polyhedra are shown to be NP-Hard. This lead to exploring how to count the vertices of general polyhedra without listing them. This is also shown to be #P-Complete. Some fully polynomial randomized approximation schemes (fpras) of counting the vertices of some special classes of polyhedra associated with Down-Sets, Independent Sets, 2-Knapsack problems and 2 x n transportation problems are presented together with some discovered open problems.
Abstract: There are real needs to integrate types of Open
Educational Resources (OER) with an intelligent system to extract
information and knowledge in the semantic searching level. The
needs came because most of current learning standard adopted web
based learning and the e-learning systems do not always serve all
educational goals. Semantic Web systems provide educators,
students, and researchers with intelligent queries based on a semantic
knowledge management learning system. An ontology-based learning
system is an advanced system, where ontology plays the core of the
semantic web in a smart learning environment. The objective of this
paper is to discuss the potentials of ontologies and mapping different
kinds of ontologies; heterogeneous or homogenous to manage and
control different types of Open Educational Resources. The important
contribution of this research is that it uses logical rules and
conceptual relations to map between ontologies of different
educational resources. We expect from this methodology to establish
an intelligent educational system supporting student tutoring, self and
lifelong learning system.