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...

<p>Given an autohomeomorphism on ordered topological space or its subspace, we show that it is sometimes possible to introduce a new topology-compatible order so the same map monotonic with respect ordering. We note existence of such re-ordering for given equivalent being conjugate (topologically equivalent) some homeomorphic space. observe latter cannot always be chosen order-isomorphic ...

In this paper, the classical economic production quantity (EPQ) model is developed for non-instantaneous deteriorating items by considering a relationship between the holding cost and the ordering cycle length. Two models are developed. First, the proposed model is considered when backorders are not permitted and this condition is waived for the second case. The cost functions associated with t...

Topological methods, including persistent homology, are powerful tools for analysis of high-dimensional data sets but these methods rely almost exclusively on thresholding techniques. In noisy data sets, thresholding does not always allow for the recovery of topological information. We present an easy to implement, computationally efficient pre-processing algorithm to prepare noisy point cloud ...

We present the first practical algorithm for the optimal linear leaf ordering of trees that are generated by hierarchical clustering. Hierarchical clustering has been extensively used to analyze gene expression data, and we show how optimal leaf ordering can reveal biological structure that is not observed with an existing heuristic ordering method. For a tree with n leaves, there are 2(n-1) li...

We describe a new Hybrid Monte Carlo (HMC) algorithm for dynamical overlap fermions, which improves the rate of topological index changes by adding an additional (intensive) term to the action for the molecular dynamics part of the algorithm. The metropolis step still uses the exact action, so that the Monte Carlo algorithm still generates the correct ensemble. By tuning this new term, we hope ...

This paper analyzes the impact of message-ordering, between outgoing messages from a sender to multiple receivers (called multicasts), on the completion time of a program for distributed-memory systems. We study how best to order a set of outgoing messages by taking into account message criticality and architectural issues like multiple injection ports, routing adaptivity, and link contention. ...

The variable ordering of constraint satisfaction problems affect the performance of search algorithms in CSPs. Dynamic Variable Ordering (DVO) has more advantage in improving the performance of search algorithms than static variable ordering. It is a newly developed method recent years that using particle swarm algorithm to solve binary constraint satisfaction problems, which is a global stocha...

Nowadays, many strategies to solve polynomial systems use the computation of a Gröbner basis for the graded reverse lexicographical ordering, followed by a change of ordering algorithm to obtain a Gröbner basis for the lexicographical ordering. The change of ordering algorithm is crucial for these strategies. We study the p-adic stability of the main change of ordering algorithm, FGLM. We show ...