No abstract uploaded!

The concept of a selfdual connection on a fourdimensional Riemannian manifold is generalized to the 4ndimensional case of any quaternionic Khler manifold. The generalized selfdual connections are minima of a modified YangMills functional. It is shown that our definitions give a correct framework for a mapping theory of quaternionic Khler manifolds. The mapping theory is closely related to the construction of YangMills fields on such manifolds. Some monopolelike equations are discussed.

We consider the coupled EinsteinDiracMaxwell equations for a static, spherically symmetric system of two fermions in a singlet spinor state. Soliton-like solutions are constructed numerically. The stability and the properties of the ground state solutions are discussed for different values of the electromagnetic coupling constant. We find solutions even when the electromagnetic coupling is so strong that the total interaction is repulsive in the Newtonian limit. Our solutions are regular and well-behaved; this shows that the combined electromagnetic and gravitational self-interaction of the Dirac particles is finite.

In this paper, we formulate a problem of simultaneous redundant via insertion and line end extension for via yield optimization. Our problem is more general than previous works in the sense that more than one type of line end extension is considered and the objective function to be optimized directly accounts for via yield. We present a zero-one integer linear program based approach, that is equipped with two speedup techniques, to solve the addressed problem optimally. In addition, we describe how to modify our approach to exactly solve a previous work. Extensive experimental results are shown to demonstrate the effectiveness and efficiency of our approaches.

Alexandrov proved that any simplicial complex homeomorphic to a sphere with strictly non-negative Gaussian curvature at each vertex can be isometrically embedded uniquely in {{\mathbb {R}}}^{3} as a convex polyhedron. Due to the nonconstructive nature of his proof, there have yet to be any algorithms, that we know of, that realizes the Alexandrov embedding in polynomial time. Following his proof, we developed the adiabatic isometric mapping (AIM) algorithm. AIM uses a guided adiabatic pull-back procedure on a given polyhedral metric to produce an embedding that approximates the unique Alexandrov polyhedron. Tests of AIM applied to two different polyhedral metrics suggests that its run time is sub cubic with respect to the number of vertices. Although Alexandrov's theorem specifically addresses the embedding of convex polyhedral metrics, we tested AIM on a broader class of polyhedral metrics that included regions of