Assessment of ERTS-1 imagery as a tool for regional geological analysis in New York State

The author has identified the following significant results. Linear anomalies dominate the new geological information derived from ERTS-1 imagery, total lengths now exceeding 26,500 km. Maxima on rose diagrams for ERTS-1 anomalies correspond well with those for mapped faults and topographic lineaments. Multi-scale analysis of linears shows that single topographic linears at 1:2,500,000 may become dashed linears at 1:1,000,000 aligned zones of shorter parallel, en echelon, or conjugate linears at 1:5000,000, and shorter linears lacking any conspicuous zonal alignment at 1:250,000. Field work in the Catskills suggests that the prominent new NNE lineaments may be surface manifestations of dip slip faulting in the basement, and that it may become possible to map major joint sets over extensive plateau regions directly on the imagery. Most circular features found were explained away by U-2 airfoto analysis but several remain as anomalies. Visible glacial features include individual drumlins, drumlinoids, eskers, ice-marginal drainage channels, glacial lake shorelines, sand plains, and end moraines

Design and implementation of a routing algorithm to maximize test coverage of permanent faults in FPGAs

Nowadays electronic devices are used in a huge number of applications, from entertainment market to military equipment, from mobile phones to satellites. Each application has its own requirements and constraints depending on its purpose. One particular kind of applications is the one called mission critical that is characterized by a large amount of money that could be lost if something goes wrong. As an example this is the case of satellites that cannot be repaired or returned for maintenance if some parts stop working. When electronic device, and in particular FPGAs, are used in mission critical applications their reliability requires a special attention, therefore a key aspect of them is the capability to tolerate faults. When FPGAs operate in harsh environment, like in space, both temporary and permanent faults can occur due to radiation. The on-line testing technique involves a testing circuit that is capable to test its own used resources. In this work a design and implementation of a routing algorithm to maximize fault coverage of permanent faults is presented

Analysis of Structural Properties of Complex and Networked Systems

Over the past decades, science and society have been experiencing systems that tend to be increasingly sophisticated and interconnected. Although it would be challenging to understand and control complex systems fully, the analysis and control of such systems can be partially realized only after applying some reasonable simplifications. In particular, for the analysis of certain control properties, such as controllability, a complex system can be simplified to a linear structured system capturing an essential part of the structural information in that system, such as the existence or absence of relations between components of the system. This thesis has studied the effect of the interconnection structure of complex systems on their control properties following a structural analysis approach. More explicitly, we have analyzed strong structural properties of complex systems. The main contributions have been split into two parts:1. We have introduced a new framework for linear structured systems in which the relations between the components of the systems are allowed to be unknown. This kind of systems has been formalized in terms of pattern matrices whose entries are either fixed zero, arbitrary nonzero, or arbitrary. We have dealt with strong structural controllability and the solvability of the FDI problem of this kind of linear structured systems.2. We have introduced a novel framework for linear structured systems in which a priori given entries in the system matrices are restricted to take arbitrary but identical values. Several sufficient algebraic and graph theoretic conditions were established under which these systems are strongly structurally controllable.Finally, in the outlook subsection, we have suggested some future research problems concerning the analysis of strong structural properties of complex systems

High Performance Software Reconfiguration in the Context of Distributed Systems and Interconnection Networks.

Designed algorithms that are useful for developing protocols and supporting tools for fault tolerance, dynamic load balancing, and distributing monitoring in loosely coupled multi-processor systems. Four efficient algorithms are developed to learn network topology and reconfigure distributed application programs in execution using the available tools for replication and process migration. The first algorithm provides techniques for transparent software reconfiguration based on process migration in the context of quadtree embeddings in Hypercubes. Our novel approach provides efficient reconfiguration for some classes of faults that may be identified easily. We provide a theoretical characterization to use graph matching, quadratic assignment, and a variety of branch and bound techniques to recover from general faults at run-time and maintain load balance. The second algorithm provides distributed recognition of articulation points, biconnected components, and bridges. Since the removal of an articulation point disconnects the network, knowledge about it may be used for selective replication. We have obtained the most efficient distributed algorithms with linear message complexity for the recognition of these properties. The third algorithm is an optimal linear message complexity distributed solution for recognizing graph planarity which is one of the most celebrated problems in graph theory and algorithm design. Recently, efficient shortest path algorithms are developed for planar graphs whose efficient recognition itself was left open. Our algorithm also leads to designing efficient distributed algorithm to recognize outer-planar graphs with applications in Hamiltonian path, shortest path routing and graph coloring. It is shown that efficient routing of information and distributing the stack needed for for planarity testing permit local computations leading to an efficient distributed algorithm. The fourth algorithm provides software redundancy techniques to provide fault tolerance to program structures. We consider the problem of mapping replicated program structures to provide efficient communication between modules in multiple replicas. We have obtained an optimal mapping of 2-replicated binary trees into hypercubes. For replication numbers greater than two, we provide efficient heuristic simulation results to provide efficient support for both \u27N-version programming\u27 and \u27Recovery block\u27 approaches for software replication

A Holistic Approach to Functional Safety for Networked Cyber-Physical Systems

Functional safety is a significant concern in today's networked cyber-physical systems such as connected machines, autonomous vehicles, and intelligent environments. Simulation is a well-known methodology for the assessment of functional safety. Simulation models of networked cyber-physical systems are very heterogeneous relying on digital hardware, analog hardware, and network domains. Current functional safety assessment is mainly focused on digital hardware failures while minor attention is devoted to analog hardware and not at all to the interconnecting network. In this work we believe that in networked cyber-physical systems, the dependability must be verified not only for the nodes in isolation but also by taking into account their interaction through the communication channel. For this reason, this work proposes a holistic methodology for simulation-based safety assessment in which safety mechanisms are tested in a simulation environment reproducing the high-level behavior of digital hardware, analog hardware, and network communication. The methodology relies on three main automatic processes: 1) abstraction of analog models to transform them into system-level descriptions, 2) synthesis of network infrastructures to combine multiple cyber-physical systems, and 3) multi-domain fault injection in digital, analog, and network. Ultimately, the flow produces a homogeneous optimized description written in C++ for fast and reliable simulation which can have many applications. The focus of this thesis is performing extensive fault simulation and evaluating different functional safety metrics, \eg, fault and diagnostic coverage of all the safety mechanisms