10 research outputs found

    Sensor Signal and Information Processing II

    Get PDF
    In the current age of information explosion, newly invented technological sensors and software are now tightly integrated with our everyday lives. Many sensor processing algorithms have incorporated some forms of computational intelligence as part of their core framework in problem solving. These algorithms have the capacity to generalize and discover knowledge for themselves and learn new information whenever unseen data are captured. The primary aim of sensor processing is to develop techniques to interpret, understand, and act on information contained in the data. The interest of this book is in developing intelligent signal processing in order to pave the way for smart sensors. This involves mathematical advancement of nonlinear signal processing theory and its applications that extend far beyond traditional techniques. It bridges the boundary between theory and application, developing novel theoretically inspired methodologies targeting both longstanding and emergent signal processing applications. The topic ranges from phishing detection to integration of terrestrial laser scanning, and from fault diagnosis to bio-inspiring filtering. The book will appeal to established practitioners, along with researchers and students in the emerging field of smart sensors processing

    Power network and smart grids analysis from a graph theoretic perspective

    Get PDF
    The growing size and complexity of power systems has given raise to the use of complex network theory in their modelling, analysis, and synthesis. Though most of the previous studies in this area have focused on distributed control through well established protocols like synchronization and consensus, recently, a few fundamental concepts from graph theory have also been applied, for example in symmetry-based cluster synchronization. Among the existing notions of graph theory, graph symmetry is the focus of this proposal. However, there are other development around some concepts from complex network theory such as graph clustering in the study. In spite of the widespread applications of symmetry concepts in many real world complex networks, one can rarely find an article exploiting the symmetry in power systems. In addition, no study has been conducted in analysing controllability and robustness for a power network employing graph symmetry. It has been verified that graph symmetry promotes robustness but impedes controllability. A largely absent work, even in other fields outside power systems, is the simultaneous investigation of the symmetry effect on controllability and robustness. The thesis can be divided into two section. The first section, including Chapters 2-3, establishes the major theoretical development around the applications of graph symmetry in power networks. A few important topics in power systems and smart grids such as controllability and robustness are addressed using the symmetry concept. These topics are directed toward solving specific problems in complex power networks. The controllability analysis will lead to new algorithms elaborating current controllability benchmarks such as the maximum matching and the minimum dominant set. The resulting algorithms will optimize the number of required driver nodes indicated as FACTS devices in power networks. The second topic, robustness, will be tackled by the symmetry analysis of the network to investigate three aspects of network robustness: robustness of controllability, disturbance decoupling, and fault tolerance against failure in a network element. In the second section, including Chapters 4-8, in addition to theoretical development, a few novel applications are proposed for the theoretical development proposed in both sections one and two. In Chapter 4, an application for the proposed approaches is introduced and developed. The placement of flexible AC transmission systems (FACTS) is investigated where the cybersecurity of the associated data exchange under the wide area power networks is also considered. A new notion of security, i.e. moderated-k-symmetry, is introduced to leverage on the symmetry characteristics of the network to obscure the network data from the adversary perspective. In chapters 5-8, the use of graph theory, and in particular, graph symmetry and centrality, are adapted for the complex network of charging stations. In Chapter 5, the placement and sizing of charging stations (CSs) of the network of electric vehicles are addressed by proposing a novel complex network model of the charging stations. The problems of placement and sizing are then reformulated in a control framework and the impact of symmetry on the number and locations of charging stations is also investigated. These results are developed in Chapters 6-7 to robust placement and sizing of charging stations for the Tesla network of Sydney where the problem of extending the capacity having a set of pre-existing CSs are addressed. The role of centrality in placement of CSs is investigated in Chapter 8. Finally, concluding remarks and future works are presented in Chapter 9

    A fault-tolerant routing strategy for k-ary n-direct s-indirect topologies based on intermediate nodes

    Full text link
    [EN] Exascale computing systems are being built with thousands of nodes. The high number of components of these systems significantly increases the probability of failure. A key component for them is the interconnection network. If failures occur in the interconnection network, they may isolate a large fraction of the machine. For this reason, an efficient fault-tolerant mechanism is needed to keep the system interconnected, even in the presence of faults. A recently proposed topology for these large systems is the hybrid k-ary n-direct s-indirect family that provides optimal performance and connectivity at a reduced hardware cost. This paper presents a fault-tolerant routing methodology for the k-ary n-direct s-indirect topology that degrades performance gracefully in presence of faults and tolerates a large number of faults without disabling any healthy computing node. In order to tolerate network failures, the methodology uses a simple mechanism. For any source-destination pair, if necessary, packets are forwarded to the destination node through a set of intermediate nodes (without being ejected from the network) with the aim of circumventing faults. The evaluation results shows that the proposed methodology tolerates a large number of faults. For instance, it is able to tolerate more than 99.5% of fault combinations when there are 10 faults in a 3-D network with 1000 nodes using only 1 intermediate node and more than 99.98% if 2 intermediate nodes are used. Furthermore, the methodology offers a gracious performance degradation. As an example, performance degrades only by 1% for a 2-D network with 1024 nodes and 1% faulty links.This work was supported by the Spanish Ministerio de Economía y Competitividad (MINECO), by FEDER funds under Grant TIN2015-66972-C5-1-R, by Programa de Ayudas de Investigación y Desarrollo (PAID) from Universitat Politècnica de alència and by the financial support of the FP7 HiPEAC Network of Excellence under grant agreement 287759Peñaranda Cebrián, R.; Gómez Requena, ME.; López Rodríguez, PJ.; Gran, EG.; Skeie, T. (2017). A fault-tolerant routing strategy for k-ary n-direct s-indirect topologies based on intermediate nodes. Concurrency and Computation Practice and Experience. 29(13):1-11. https://doi.org/10.1002/cpe.4065S111291

    Enhancements to the damage locating vector method for structural health monitoring

    Get PDF
    Ph.DDOCTOR OF PHILOSOPH

    TOK'07 otomatik kontrol ulusal toplantısı: 5-7 Eylül 2007, Sabancı Üniversitesi, Tuzla, İstanbul

    Get PDF

    NETWORK AND DOMAIN AUTOCONFIGURATION: A UNIFIED FRAMEWORK FOR LARGE MOBILE AD HOC NETWORKS

    Get PDF
    Configuration management is critical to correct and efficient operation of large networks. In those cases where the users and networks are dynamic and ad hoc, manual configuration quickly becomes too complex. The combination of the sheer number of nodes with the heterogeneity and dynamics makes it almost impossible for the system administrator to ensure good configuration or even ensure correct operation. To achieve the vision of pervasive computing, nodes must automatically discover their environment and self-configure, then must automatically reconfigure to adapt to changes. Protocols such as DHCP, DDNS and mDNS provide some degree of host autoconfiguration, but network administrators must still configure information such as address pools, routing protocols, or OSPF routing areas. Only limited progress has been made to automate the configuration of routers, servers and network topology. This dissertation proposes the autoconfiguration of most host, router and server information, including the automatic generation and maintenance of hierarchy, under the same architectural, algorithmic and protocol framework. The proposed unified framework consists of modules (DRCP, DCDP, YAP, ACA) responsible for the entity autoconfiguration and from a modified and well adjusted general optimization (Simulated Annealing) based algorithm for the domain autoconfiguration. Due to the generality of the optimization algorithm, the generated hierarchy can improve dynamically selected network performance aspects represented by appropriately designed objective functions and constraints. An indicative set related to the physical characteristics of the domains and node mobility is provided. Even though SA has been adjusted for faster convergence, it may still be unable to capture the dynamics of rapidly changing networks. Thus, a faster but suboptimal distributed hierarchy generation mechanism that follows the design philosophy of SA-based mechanism has also been introduced. Inevitably, due to network dynamics, the quality of the hierarchy will degrade. In such scenarios, the frequent reapplication of the expensive optimization based hierarchy generation is prohibitive. Hence, for extending the domain formation framework, distributed maintenance mechanisms have been proposed for reconstructing the feasibility and quality of the hierarchy by enforcing localized decisions. The proposed framework has been applied to provide solutions on some realistic network problems related to hierarchical routing and topology control

    Geostationary platform systems concepts definition study. Volume 2: Technical, book 2

    Get PDF
    A selected concept for a geostationary platform is defined in sufficient detail to identify requirements for supporting research and technology, space demonstrations, GFE interfaces, costs, and schedules. This system consists of six platforms in geostationary orbit (GEO) over the Western Hemisphere and six over the Atlantic, to satisfy the total payload set associated with the nominal traffic model. Each platform is delivered to low Earth orbit (LEO) in a single shuttle flight, already mated to its LEO to GEO transfer vehicle and ready for deployment and transfer to GEO. An alternative concept is looked at briefly for comparison of configuration and technology requirements. This alternative consists of two large platforms, one over the Western Hemisphere consisting of three docked modules, and one over the Atlantic (two docked modules), to satisfy a high traffic model. The modules are full length orbiter cargo bay payloads, mated at LEO to orbital transfer vehicles (OTVs) delivered in other shuttle flights, for transfer to GEO, rendezvous, and docking. A preliminary feasibility study of an experimental platform is also performed to demonstrate communications and platform technologies required for the operational platforms of the 1990s

    Towards a standardised attack graph visual syntax

    Get PDF
    More research needs to focus on developing effective methods of aiding the understanding and perception of cyber-attacks. Attack modelling techniques (AMTs) - such as attack graphs, attack trees and fault trees, are popular methods of mathematically and visually representing the sequence of events that lead to a successful cyber-attack. Although useful in aiding cyber-attack perception, there is little empirical or comparative research which evaluates the effectiveness of these methods. Furthermore, there is no standardised attack graph visual syntax configuration, currently more than seventy-five self-nominated attack graph and twenty attack tree configurations have been described in the literature - each of which presents attributes such as preconditions and exploits in a different way. This research analyses methods of presenting cyber-attacks and reveals that attack graphs and attack trees are the dominant methods. The research proposes an attack graph visual syntax which is designed using evidence based principles. The proposed attack graph is compared with the fault tree - which is a standard method of representing events such as cyber-attacks. This comparison shows that the proposed attack graph visual syntax is more effective than the fault tree method at aiding cyber-attack perception and that the attack graph can be an effective tool for aiding cyber-attack perception - particularly in educational contexts. Although the proposed attack graph visual syntax is shown to be cognitively effective, this is no indication of practitioner acceptance. The research proceeds to identify a preferred attack graph visual syntax from a range of visual syntaxes - one of which is the proposed attack graph visual syntax. The method used to perform the comparison is conjoint analysis which is innovative for this field. The results of the second study reveal that the proposed attack graph visual syntax is one of the preferred configurations. This attack graph has the following attributes. The flow of events is represented top-down, preconditions are represented as rectangles, and exploits are represented as ellipses. The key contribution of this research is the development of an attack graph visual syntax which is effective in aiding the understanding of cyber-attacks particularly in educational contexts. The proposed method is a significant step towards standardising the attack graph visual syntax

    Safety and Reliability - Safe Societies in a Changing World

    Get PDF
    The contributions cover a wide range of methodologies and application areas for safety and reliability that contribute to safe societies in a changing world. These methodologies and applications include: - foundations of risk and reliability assessment and management - mathematical methods in reliability and safety - risk assessment - risk management - system reliability - uncertainty analysis - digitalization and big data - prognostics and system health management - occupational safety - accident and incident modeling - maintenance modeling and applications - simulation for safety and reliability analysis - dynamic risk and barrier management - organizational factors and safety culture - human factors and human reliability - resilience engineering - structural reliability - natural hazards - security - economic analysis in risk managemen
    corecore