Topology construction and topology maintenance are significant sub-problems of topology control. Spanning tree based algorithms for topology control are basically transmission range based type construction algorithms. The construction of an effective backbone, however, is indirectly related to the placement of nodes. Also, the dependence of network reliability on the communication path undertak...

Functional programming is well suited for equational reasoning on programs. In this paper, we are trying to use this capability for program comprehension purposes. Specifically, in a program understanding process, higher-order operators can work like abstract schemes in which we can fit formal specifications calculated from the source code. Such specifications are calculated by a transformation...

Interested in formalizing the generation of fast running code for linear algebra applications, the authors show how an index-free, calculational approach to matrix algebra can be developed by regarding matrices as morphisms of a category with biproducts. This shifts the traditional view of matrices as indexed structures to a type-level perspective analogous to that of the pointfree algebra of p...

This paper addresses the foundations of data-model transformation. A catalog of data mappings is presented which includes abstraction and representation relations and associated constraints. These are justified in an algebraic style via the pointfree-transform, a technique whereby predicates are lifted to binary relation terms (of the algebra of programming) in a two-level style encompassing bo...

The prevalent strategy in the topology optimization phase is to select a subset of members existing in an excessively connected truss, called Ground Structure, such that the overall weight or cost is minimized. Although finding a good topology significantly reduces the overall cost, excessive growth of the size of topology space combined with existence of varied types of design variables challe...

motivated by the recent study on categorical properties of latticevalued topology, the paper considers a generalization of the notion of topological system introduced by s. vickers, providing an algebraic and a coalgebraic category of the new structures. as a result, the nature of the category   topsys   of s. vickers gets clari ed, and a metatheorem is stated, claiming that (latticevalu...

in this paper, we generalize fuzzy banach contraction theorem establishedby v. gregori and a. sapena [fuzzy sets and systems 125 (2002) 245-252]using notion of altering distance which was initiated by khan et al. [bull. austral.math. soc., 30(1984), 1-9] in metric spaces.

For reliability-based topology optimization (RBTO) of double layer grids, a two-stage optimization method is presented by applying “Solid Isotropic Material with Penalization” and “Ant Colony Optimization” (SIMP-ACO method). To achieve this aim, first, the structural stiffness is maximized using SIMP. Then, the characteristics of the obtained topology are used to enhance ACO through six modific...