Automation in map production has created the need for modeling composition process. Generalization is most critical process composition, with considerable impact on quality of features portrayed maps. Modeling generalization been an area research several years international cartographic community. Constraint-based prevailed, and it evolving to agent model or other optimization models. The prese...

The macroscopic behaviour of stationary micromagnetic phenomena can be modelled by a relaxed version of the Landau-Lifshitz minimization problem. In the limit of large and soft magnets Ω, it is reasonable to exclude the exchange energy and convexify the remaining energy densities. The numerical analysis of the resulting minimization problem min E 0 (m) amongst m : Ω → R with |m(x)| ≤ 1 for a.e....

In an earlier work, Sun and Bayen built a Large-Capacity Cell Transmission Model for air traffic flowmanagement. They formulated an integer programming problem of minimizing the total travel time of flights in the National Airspace System of the United States subject to sector capacity constraints. The integer program was relaxed to a linear program for computational efficiency. In this paper t...

We discuss the O(4) invariant perturbation modes of cosmological instantons. These modes are spatially homogeneous in Lorentzian spacetime and thus not relevant to density perturbations. But their properties are important in establishing the meaning of the Euclidean path integral. If negative modes are present, the Euclidean path integral is not well defined, but may nevertheless be useful in a...

We study the integer maximum flow problem on wireless sensor networks with energy constraint. In this problem, sensor nodes gather data and then relay them to a base station, before they run out of battery power. Packets are considered as integral units and not splittable. The problem is to find the maximum data flow in the sensor network subject to the energy constraint of the sensors. We show...

In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...

This short note provides an improvement on a recent result of Vecchio on a norm bound for the inverse of a lower triangular Toeplitz matrix with nonnegative entries. A sharper asymptotic bound is obtained as well as a version for matrices of finite order. The results are shown to be nearly best possible under the given constraints. 1. Introduction. This paper provides an improvement on a recent...

In shortest path routing, traffic is routed along shortest paths defined by link weights. However, not all path systems are feasible in that they can be realized in this way. This is something which needs to be taken into account when searching for a set of paths that minimize capacity consumption. In this paper, we discuss a new necessary condition that can be used during search to prune infea...

A complete design framework for a fuzzy constraint-based controller based on fuzzy constraint processing and its semantics and relationship to fuzzy logic is presented. Although, to date, many fuzzy logic control systems have been implemented in rule-based languages, we expect that eventually these languages will be supplanted by constraint-based languages. Despite the successes which have owed...