Kooperativer Bibliotheksverbund

Berlin Brandenburg

and
and

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Mishkovski, Igor  (11)
Language
Year
  • 1
    Language: English
    In: Physica A: Statistical Mechanics and its Applications, 01 November 2011, Vol.390(23-24), pp.4610-4620
    Description: A new family of networks, called , has recently been proposed in the literature. These networks have optimal properties in terms of synchronization, robustness against errors and attacks, and efficient communication. They are built with an algorithm which uses modified simulated annealing to enhance a well-known measure of networks’ ability to reach synchronization among nodes. In this work, we suggest that a class of networks similar to entangled networks can be produced by changing some of the connections in a given network, or by just adding a few connections. We call this class of networks . Although entangled networks can be considered as a subset of weak-entangled networks, we show that both classes share similar properties, especially with respect to synchronization and robustness, and that they have similar structural properties. ► We present rewiring procedure that produces networks with weak-entangled structure. ► We examine the structural properties, synchronization and robustness of the networks. ► We show that they share similar properties as entangled networks. ► Our procedure improves the synchronizability and robustness of a given network. ► The procedure exploits only the homogenization of the nodes’ degree.
    Keywords: Complex Networks ; Entangled Networks ; Synchronization ; Vulnerability ; Physics
    ISSN: 0378-4371
    E-ISSN: 1873-2119
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Language: English
    In: Energy, 01 August 2013, Vol.57, pp.116-124
    Description: Southeast European power transmission system is modeled by analyzing the system as an evolving grid, which is continually upgrading in order to satisfy the increasing load demand and certain reliability requirements. We adopt a model (known as OPA model) which satisfies two requirements. First, the model is based on probabilistic line outages and overloads, and it models the network using DC load flow and linear programming dispatch of generation. Second, the model includes systematic upgrading of the production and transmission capacities of the electric-power system. The results show the most vulnerable transmission lines of the Southeast European power transmission system that need to be upgraded. Moreover, the results indicate that the electric power system of Southeast Europe is functioning well with 20% excess of electricity generation. In comparison with the actual excess, it can be concluded that merging the electric power systems of the separate countries in the region into a common trade will produce a great economic benefit in investment of new generation capacities.
    Keywords: Southeast European Power Transmission System ; Network Long-Term Evolution Modeling ; Power Transmission Reliability ; OPA Model ; Environmental Sciences ; Economics
    ISSN: 0360-5442
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Language: English
    In: IEEE Transactions on Circuits and Systems I: Regular Papers, February 2014, Vol.61(2), pp.522-529
    Description: We study synchronization and consensus phenomena in state-dependent graphs in which the edges are weighted according to the Hebbian learning rule or its modified version. By exploring the master stability function of the synchronous state, we show that the modified Hebbian function as coupling strength enlarges the stability region of the synchronous state. In terms of consensus, given that the state-dependent weights are always positive, we prove that consensus in a network of multi-agent systems is always reachable. Furthermore, we show that in state-dependent graphs the second smallest eigenvalue of the graph Laplacian matrix has larger values due to the state-dependency, resulting in speed up of the convergence process.
    Keywords: Couplings ; Synchronization ; Oscillators ; Neurons ; Stability Analysis ; Eigenvalues and Eigenfunctions ; Laplace Equations ; Adaptive Coupling ; Consensus ; Hebbian Learning Rule ; Master-Stability Function ; State-Dependent Graphs ; Synchronization ; Engineering
    ISSN: 1549-8328
    E-ISSN: 1558-0806
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Language: English
    In: Communications in Nonlinear Science and Numerical Simulation, 2011, Vol.16(1), pp.341-349
    Description: We consider normalized average edge betweenness of a network as a metric of network vulnerability. We suggest that normalized average edge betweenness together with is relative difference when certain number of nodes and/or edges are removed from the network is a measure of network vulnerability, called vulnerability index. Vulnerability index is calculated for four synthetic networks: Erdős–Rényi (ER) random networks, Barabási–Albert (BA) model of scale-free networks, Watts–Strogatz (WS) model of small-world networks, and geometric random networks. Real-world networks for which vulnerability index is calculated include: two human brain networks, three urban networks, one collaboration network, and two power grid networks. We find that WS model of small-world networks and biological networks (human brain networks) are the most robust networks among all networks studied in the paper.
    Keywords: Complex Networks ; Vulnerability ; Graph Theory ; Centrality Measures ; Network Topologies ; Applied Sciences
    ISSN: 1007-5704
    E-ISSN: 1878-7274
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Language: English
    In: IEEE Transactions on Circuits and Systems I: Regular Papers, October 2017, Vol.64(10), pp.2761-2771
    Description: Real networks in our surrounding are usually complex and composite by nature and they consist of many interwoven layers. The commutation of agents (nodes) across layers in these composite multiplex networks heavily influences the underlying dynamical processes, such as information, idea and disease spreading, synchronization, consensus, etc. In order to understand how the agents' dynamics and the compositeness of multiplex networks influence the spreading dynamics, we develop a susceptible-infected-susceptible-based model on the top of these networks, which is integrated with the transition of agents across layers. Moreover, we analytically obtain a critical infection rate for which an epidemic dies out in a multiplex network, and latter show that this rate can be higher compared with the isolated networks. Finally, using numerical simulations we confirm the epidemic threshold and we show some interesting insights into the epidemic onset and the spreading dynamics in several real and generic multiplex networks.
    Keywords: Multiplexing ; Silicon ; Mathematical Model ; Computer Science ; Social Network Services ; Nonhomogeneous Media ; Markov Processes ; Multiplex Networks ; Epidemic Spreading ; Sis Model ; Engineering ; Computer Science
    ISSN: 1549-8328
    E-ISSN: 1558-0806
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Language: English
    In: Physica A: Statistical Mechanics and its Applications, 2010, Vol.389(23), pp.5538-5549
    Description: We propose a metric for vulnerability of labeled graphs that has the following two properties: (1) when the labeled graph is considered as an unlabeled one, the metric reduces to the corresponding metric for an unlabeled graph; and (2) the metric has the same value for differently labeled fully connected graphs, reflecting the notion that any arbitrarily labeled fully connected topology is equally vulnerable as any other. A vulnerability analysis of two real-world networks, the power grid of the European Union, and an autonomous system network, has been performed. The networks have been treated as graphs with node labels. The analysis consists of calculating characteristic path lengths between labels of nodes and determining largest connected cluster size under two node and edge attack strategies. Results obtained are more informative of the networks’ vulnerability compared to the case when the networks are modeled with unlabeled graphs.
    Keywords: Labeled Networks ; Vulnerability ; Eu Power Grid ; As Network ; Physics
    ISSN: 0378-4371
    E-ISSN: 1873-2119
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Book chapter
    Book chapter
    Berlin, Heidelberg: Springer Berlin Heidelberg
    Language: English
    In: Studies in Computational Intelligence, Chaos-Based Cryptography: Theory,Algorithms and Applications, pp.27-65
    Description: In this chapter we give an overview and the state of the art in the field of Chaos-based cryptography. The public key cryptosystems based on Chebyshev polynomials enjoy some nice chaotic properties, which makes them suitable for use in both encryption and digital signature. The cryptosystem can work either on real or integer numbers. The cryptosystem that works on real numbers is not secure and permits to recover the corresponding plaintext from a given ciphertext. In addition, it also allows forgeries if the cryptosystem is used for signing messages. On the other hand, ElGamal-like and RSA-like algorithms when using Chebyshev polynomials on integer numbers are secure as the aforementioned encryption algorithms. The chaos-based cryptography is discussed from a point of view which we believe is closer to the spirit of both cryptography and chaos theory than the way the subject has been treated recently by many researchers.
    Keywords: Engineering ; Computational Intelligence ; Artificial Intelligence (Incl. Robotics) ; Data Encryption ; Data Structures, Cryptology and Information Theory ; Engineering ; Computer Science
    ISBN: 9783642205415
    ISBN: 3642205410
    Source: SpringerLink Books
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    Language: English
    In: IEEE Transactions on Circuits and Systems-I-Regular Papers, 2017, Vol.64(10), p.2761(11)
    Keywords: Mathematical Models – Usage ; Computer Science – Research ; Markov Processes – Usage
    ISSN: 1549-8328
    Source: Cengage Learning, Inc.
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    Language: English
    In: Advances in Intelligent and Soft Computing, ICT Innovations 2011, pp.85-94
    Description: In this paper we investigate the use of terrains with various level of detail and its impact on the simulation results on the macro level. We argue to which extent this problem has to be taken into account and what is the appropriate level of terrain accurate representation in order to achieve results that are valid and can be used as a simulation projection for a given real life scenario.
    Keywords: Engineering ; Computational Intelligence ; Artificial Intelligence (Incl. Robotics) ; Engineering ; Computer Science
    ISBN: 9783642286636
    ISBN: 3642286631
    Source: SpringerLink Books
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    Book chapter
    Book chapter
    Berlin, Heidelberg: Springer Berlin Heidelberg
    Language: English
    In: Advances in Intelligent and Soft Computing, ICT Innovations 2011, pp.347-356
    Description: One of the biggest problems in heterogeneous computing is how tasks should be mapped in these kinds of environments. Because this problem of mapping tasks has been shown to be NP-complete, it requires heuristic techniques. Therefore, we present new schedulers based on the apportionment methods used in elections. In order to obtain the performances of these schedulers we compare them with other known and used heuristics in many different parameters. The presented heuristics can be used when the tasks are big and when they can be divided in smaller sub-tasks. The comparison in this paper shows that these apportionment methods can cope well with the other methods when the number of tasks in the system is no bigger than a certain level. The new apportionment scheduler, based on Hamilton’s method, copes well with the existing ones and it outperforms the other schedulers when some conditions are met.
    Keywords: Engineering ; Computational Intelligence ; Artificial Intelligence (Incl. Robotics) ; Engineering ; Computer Science
    ISBN: 9783642286636
    ISBN: 3642286631
    Source: SpringerLink Books
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages