Analysis and Development of the Generic Maintenance Management Process Modeling for the Preservation of Heritage School Buildings

Preservation of heritage school buildings requires special maintenance management practices. A thorough understanding of the maintenance management process is essential in ensuring effective maintenance practices can be instituted. The aim of this paper was to develop a generic process model that will promote the understanding of an effective management of maintenance process for heritage school buildings. A process model for the Maintenance Management of Heritage School Buildings (MMHSB) was developed using the Integration Definition for Function Modeling (IDEF0) system through an iterative process. The initial MMHSB process model was submitted to a team of management experts from the Malaysian Ministry of Arts and Heritage and the Ministry of Education Malaysia for verifications. Based on their feedbacks the initial model was refined and a proposed model was developed. From the second verification, the feed back received formed the basis for the final model. The final model elucidates the items for the input, mechanism, control and output elements that are critical in the maintenance management of heritage school buildings. The model also redefines the existing scope of responsibilities of the Headmasters’ and Senior Assistants’ in the management of maintenance. The perceived effectiveness of the model by potential users was surveyed using a selected number of administrators from potentially recognized heritage schools. The results indicated that the process model is perceived as being helpful in clarifying the maintenance management process of heritage school buildings and is useful in changing the current reactive management practices to that of a more proactive practice. In conclusion, it is believed that the MMHSB Process Model is helpful in promoting the understanding of the maintenance management process which would lead to improve preservation practices of heritage school buildings

On Contra SS-Continuous Functions

In this paper, we apply the notion of -open set in topological spaces to introduce and investigate the concept of contra -continuous which is a subclass of the class of contra semi continuous functions. Keywords: -closed, contra -continuous, contra SS –closed and strongly contra SS –closed

Proving Termination Starting from the End

We present a novel technique for proving program termination which introduces a new dimension of modularity. Existing techniques use the program to incrementally construct a termination proof. While the proof keeps changing, the program remains the same. Our technique goes a step further. We show how to use the current partial proof to partition the transition relation into those behaviors known to be terminating from the current proof, and those whose status (terminating or not) is not known yet. This partition enables a new and unexplored dimension of incremental reasoning on the program side. In addition, we show that our approach naturally applies to conditional termination which searches for a precondition ensuring termination. We further report on a prototype implementation that advances the state-of-the-art on the grounds of termination and conditional termination.Comment: 16 page

On Multiphase-Linear Ranking Functions

Multiphase ranking functions ($\mathit{M{\Phi}RFs}$) were proposed as a means to prove the termination of a loop in which the computation progresses through a number of "phases", and the progress of each phase is described by a different linear ranking function. Our work provides new insights regarding such functions for loops described by a conjunction of linear constraints (single-path loops). We provide a complete polynomial-time solution to the problem of existence and of synthesis of $\mathit{M{\Phi}RF}$ of bounded depth (number of phases), when variables range over rational or real numbers; a complete solution for the (harder) case that variables are integer, with a matching lower-bound proof, showing that the problem is coNP-complete; and a new theorem which bounds the number of iterations for loops with $\mathit{M{\Phi}RFs}$. Surprisingly, the bound is linear, even when the variables involved change in non-linear way. We also consider a type of lexicographic ranking functions, $\mathit{LLRFs}$, more expressive than types of lexicographic functions for which complete solutions have been given so far. We prove that for the above type of loops, lexicographic functions can be reduced to $\mathit{M{\Phi}RFs}$, and thus the questions of complexity of detection and synthesis, and of resulting iteration bounds, are also answered for this class.Comment: typos correcte

Complexity of Bradley-Manna-Sipma Lexicographic Ranking Functions

In this paper we turn the spotlight on a class of lexicographic ranking functions introduced by Bradley, Manna and Sipma in a seminal CAV 2005 paper, and establish for the first time the complexity of some problems involving the inference of such functions for linear-constraint loops (without precondition). We show that finding such a function, if one exists, can be done in polynomial time in a way which is sound and complete when the variables range over the rationals (or reals). We show that when variables range over the integers, the problem is harder -- deciding the existence of a ranking function is coNP-complete. Next, we study the problem of minimizing the number of components in the ranking function (a.k.a. the dimension). This number is interesting in contexts like computing iteration bounds and loop parallelization. Surprisingly, and unlike the situation for some other classes of lexicographic ranking functions, we find that even deciding whether a two-component ranking function exists is harder than the unrestricted problem: NP-complete over the rationals and $\Sigma^P_2$-complete over the integers.Comment: Technical report for a corresponding CAV'15 pape

Ranking Templates for Linear Loops

We present a new method for the constraint-based synthesis of termination arguments for linear loop programs based on linear ranking templates. Linear ranking templates are parametrized, well-founded relations such that an assignment to the parameters gives rise to a ranking function. This approach generalizes existing methods and enables us to use templates for many different ranking functions with affine-linear components. We discuss templates for multiphase, piecewise, and lexicographic ranking functions. Because these ranking templates require both strict and non-strict inequalities, we use Motzkin's Transposition Theorem instead of Farkas Lemma to transform the generated $\exists\forall$-constraint into an $\exists$-constraint.Comment: TACAS 201

Space-times which are asymptotic to certain Friedman-Robertson-Walker space-times at timelike infinity

We define space-times which are asymptotic to radiation dominant Friedman-Robertson-Walker space-times at timelike infinity and study the asymptotic structure. We discuss the local asymptotic symmetry and give a definition of the total energy from the electric part of the Weyl tensor.Comment: 8 pages, Revte

Willmore Surfaces of Constant Moebius Curvature

We study Willmore surfaces of constant Moebius curvature $K$ in $S^4$. It is proved that such a surface in $S^3$ must be part of a minimal surface in $R^3$ or the Clifford torus. Another result in this paper is that an isotropic surface (hence also Willmore) in $S^4$ of constant $K$ could only be part of a complex curve in $C^2\cong R^4$ or the Veronese 2-sphere in $S^4$. It is conjectured that they are the only examples possible. The main ingredients of the proofs are over-determined systems and isoparametric functions.Comment: 16 pages. Mistakes occured in the proof to the main theorem (Thm 3.6) has been correcte