The SSAPRE algorithm for performing partial redundancy elimination based entirely on SSA form is presented. The algorithm is formulated based on a new conceptual framework, the fac-tored redundancy graph, for analyzing redundancy, and represents the rst sparse approach to the classical problem of partial redundancy elimination. At the same time, it provides new perspectives on the problem and o...

Abstract In manufacturing industry, Computer Numerical Control (CNC) machines are often preferred over Industrial Serial Robots (ISR) for machining tasks. Indeed, CNC offer high positioning accuracy, which leads to slight dimensional deviation on the final product. However, these have a restricted workspace generating limitations in work. Conversely, ISR typically characterized by larger worksp...

Ontologies may contain redundancy in terms of axioms that logically follow from other axioms and that could be removed for the sake of consolidation and conciseness without changing the overall meaning. In this paper, we investigate methods for removing such redundancy from ontologies. We define notions around redundancy and discuss typical cases of redundancy and their relation to ontology eng...

Abstract In general redundancy allocation problems the redundancy strategy for each subsystem is predetermined. Tavakkoli- Moghaddam presented a series-parallel redundancy allocation problem with mixing components (RAPMC) in which the redundancy strategy can be chosen for individual subsystems. In this paper, we present a bi-objective redundancy allocation when the redundancy strategies for...

Three optimization models are proposed to select the best subset of stations from a large groundwater monitoring network: ~1! one that maximizes spatial accuracy; ~2! one that minimizes temporal redundancy; and ~3! a model that both maximizes spatial accuracy and minimizes temporal redundancy. The proposed optimization models are solved with simulated annealing, along with an algorithm parametr...