in this paper by using concepts of graph theory, forces method and substructure ing method for analysis of structures, some methods have been introduced for optimal analysis of structures in a large scale, using substructuring method. planar rigid frames assuming linear behavior and small deformations, have been optimal analyzed, by using forces method. thus, a fortran power station computation...

We obtained oo-plane stress expression for a planar fault using boundary integral equation (BIE) in 3D innnite elastic medium, which are consistent with those by Tada (199779], 1998810]). Assuming a 2D arbitrary shaped curved fault as a series of small planar fault patches, we discretized the kernels analytically for constant slip velocity within a patch. Taking a limit to the on-plane expressi...

This paper studies the problem of fault detection and isolation (FDI) for multi-agent systems (MAS) via complex Laplacian subject to actuator faults. A planar formation of point agents in the plane using simple and linear interaction rules related to complex Laplacian is achieved. The communication network is a directed, and yet connected graph with a fixed topology. The loss of symmetry in the...

the study area locates between an active fault system of north anatolian in turkey and active alborz and zagros mountain ranges in iran. the total shortening concluded from arabia-eurasia collision with a rate of 22 mm/year across the ne persia is partitioned  into  two  fault  systems,  right-lateral  strike slip  movements  in  the  turkish-iranian  plateau  like  north tabriz fault system an...

Obstacle avoidance is an essential capability of an autonomous robot. This paper presents a method that enables a mobile robot to locate obstacles in its eld of view using two images of its surroundings. The method is based on the assumption that the robot is moving on a locally planar ground. Using a set of point features (corners) that have been matched between the two views using normalized ...

We show that obtaining the lexicographically first four coloring of a planar graph is NP–hard. This shows that planar graph four-coloring is not self-reducible, assuming P 6= NP . One consequence of our result is that the schema of [JVV 86] cannot be used for approximately counting the number of four colorings of a planar graph. These results extend to planar graph k-coloring, for k ≥ 4. Resear...

This paper presents the first fault-containing self-stabilizing algorithm which can 6color any planar graph. Besides the capability to contain the fault in any single-fault situation, the proposed algorithm also has the capability to stabilize faster in single-fault situations. For single-fault situations, the worst-case stabilization time of the proposed algorithm is O(Δ), whereas the worst-ca...

In this paper a sufficient condition is given for minimal routing in n-dimensional (n-D) meshes with faulty nodes contained in a set of disjoint fault regions. It is based on an early work of the author on minimal routing in low-dimensional meshes (such as 2-D meshes with faulty blocks). Unlike many traditional models that assume all the nodes know global fault distribution, our approach is bas...

We use a two-dimensional plane strain dynamic rupture model with strongly rate-weakening friction and off-fault Drucker-Prager plasticity to model damage zones associated with buried second-order thrust faults observed in the SSC reservoir. The modeling of ruptures propagating as self-sustaining pulses is performed in the framework of continuum plasticity where the plasticity formulation includ...