Issues

Journal & Issues

Volume 13 (2023): Issue 1 (January 2023)

Volume 12 (2022): Issue 4 (October 2022)

Volume 12 (2022): Issue 3 (July 2022)

Volume 12 (2022): Issue 2 (April 2022)

Volume 12 (2022): Issue 1 (January 2022)

Volume 11 (2021): Issue 4 (October 2021)

Volume 11 (2021): Issue 3 (July 2021)

Volume 11 (2021): Issue 2 (April 2021)

Volume 11 (2021): Issue 1 (January 2021)

Volume 10 (2020): Issue 4 (October 2020)

Volume 10 (2020): Issue 3 (July 2020)

Volume 10 (2020): Issue 2 (April 2020)

Volume 10 (2020): Issue 1 (January 2020)

Volume 9 (2019): Issue 4 (October 2019)

Volume 9 (2019): Issue 3 (July 2019)

Volume 9 (2019): Issue 2 (April 2019)

Volume 9 (2019): Issue 1 (January 2019)

Volume 8 (2018): Issue 4 (October 2018)

Volume 8 (2018): Issue 3 (July 2018)

Volume 8 (2018): Issue 2 (April 2018)

Volume 8 (2018): Issue 1 (January 2018)

Volume 7 (2017): Issue 4 (October 2017)

Volume 7 (2017): Issue 3 (July 2017)

Volume 7 (2017): Issue 2 (April 2017)

Volume 7 (2017): Issue 1 (January 2017)

Volume 6 (2016): Issue 4 (October 2016)

Volume 6 (2016): Issue 3 (July 2016)

Volume 6 (2016): Issue 2 (April 2016)

Volume 6 (2016): Issue 1 (January 2016)

Volume 5 (2015): Issue 4 (October 2015)

Volume 5 (2015): Issue 3 (July 2015)

Volume 5 (2015): Issue 2 (April 2015)

Volume 5 (2015): Issue 1 (January 2015)

Volume 4 (2014): Issue 4 (October 2014)

Volume 4 (2014): Issue 3 (July 2014)

Volume 4 (2014): Issue 2 (April 2014)

Volume 4 (2014): Issue 1 (January 2014)

Volume 3 (2013): Issue 4 (October 2013)

Volume 3 (2013): Issue 3 (July 2013)

Volume 3 (2013): Issue 2 (April 2013)

Volume 3 (2013): Issue 1 (January 2013)

Journal Details
Format
Journal
eISSN
2449-6499
First Published
30 Dec 2014
Publication timeframe
4 times per year
Languages
English

Search

Volume 8 (2018): Issue 4 (October 2018)

Journal Details
Format
Journal
eISSN
2449-6499
First Published
30 Dec 2014
Publication timeframe
4 times per year
Languages
English

Search

6 Articles
Open Access

Masthead

Published Online: 17 May 2018
Page range: i - i

Abstract

Open Access

On the Topological Properties of the Certain Neural Networks

Published Online: 17 May 2018
Page range: 257 - 268

Abstract

Abstract

A topological index is a numeric quantity associated with a network or a graph that characterizes its whole structural properties. In [Javaid and Cao, Neural Computing and Applications, DOI 10.1007/s00521-017-2972-1], the various degree-based topological indices for the probabilistic neural networks are studied. We extend this study by considering the calculations of the other topological indices, and derive the analytical closed formulas for these new topological indices of the probabilistic neural network. Moreover, a comparative study using computer-based graphs has been carried out first time to clarify the nature of the computed topological descriptors for the probabilistic neural networks. Our results extend some known conclusions.

Keywords

  • neural network
  • topological indices
  • Graph theory
Open Access

Synchronization Analysis of Inertial Memristive Neural Networks with Time-Varying Delays

Published Online: 17 May 2018
Page range: 269 - 282

Abstract

Abstract

This paper investigates the global exponential synchronization and quasi-synchronization of inertial memristive neural networks with time-varying delays. By using a variable transmission, the original second-order system can be transformed into first-order differential system. Then, two types of drive-response systems of inertial memristive neural networks are studied, one is the system with parameter mismatch, the other is the system with matched parameters. By constructing Lyapunov functional and designing feedback controllers, several sufficient conditions are derived respectively for the synchronization of these two types of drive-response systems. Finally, corresponding simulation results are given to show the effectiveness of the proposed method derived in this paper.

Keywords

  • inertial
  • memristive
  • neural networks
  • synchronization
Open Access

A Continuous-Time Distributed Algorithm for Solving a Class of Decomposable Nonconvex Quadratic Programming

Published Online: 17 May 2018
Page range: 283 - 291

Abstract

Abstract

In this paper, a continuous-time distributed algorithm is presented to solve a class of decomposable quadratic programming problems. In the quadratic programming, even if the objective function is nonconvex, the algorithm can still perform well under an extra condition combining with the objective, constraint and coupling matrices. Inspired by recent advances in distributed optimization, the proposed continuous-time algorithm described by multi-agent network with consensus is designed and analyzed. In the network, each agent only accesses the local information of its own and from its neighbors, then all the agents in a connected network cooperatively find the optimal solution with consensus.

Keywords

  • Decomposable nonconvex quadratic programming
  • multi-agent network
  • consensus
  • Lyapunov method
Open Access

Event-Triggered Cluster Consensus of Leader-Following Linear Multi-Agent Systems

Published Online: 17 May 2018
Page range: 293 - 302

Abstract

Abstract

This paper is concerned with cluster consensus of linear multi-agent systems via a distributed event-triggered control scheme. Assume that agents can be split into several clusters and a leader is associated with each cluster. Sufficient conditions are derived to guarantee the realization of cluster consensus by a feasible event-triggered controller if the network topology of each cluster has a directed spanning tree and the couplings within each cluster are sufficiently strong. Further, positive inner-event time intervals are ensured for the proposed event-triggered strategy to avoid Zeno behaviors. Finally, a numerical example is given to illustrate the effectiveness of the theoretical results.

Keywords

  • cluster consensus
  • event-triggered scheme
  • leader-following consensus
  • multiagent systems
Open Access

The Least Eigenvalue of the Graphs Whose Complements Are Connected and Have Pendent Paths

Published Online: 17 May 2018
Page range: 303 - 308

Abstract

Abstract

The adjacency matrix of a graph is a matrix which represents adjacent relation between the vertices of the graph. Its minimum eigenvalue is defined as the least eigenvalue of the graph. Let Gn be the set of the graphs of order n, whose complements are connected and have pendent paths. This paper investigates the least eigenvalue of the graphs and characterizes the unique graph which has the minimum least eigenvalue in Gn.

Keywords

  • graph
  • complement
  • pendent path
  • adjacency matrix
  • the least eigenvalue
6 Articles
Open Access

Masthead

Published Online: 17 May 2018
Page range: i - i

Abstract

Open Access

On the Topological Properties of the Certain Neural Networks

Published Online: 17 May 2018
Page range: 257 - 268

Abstract

Abstract

A topological index is a numeric quantity associated with a network or a graph that characterizes its whole structural properties. In [Javaid and Cao, Neural Computing and Applications, DOI 10.1007/s00521-017-2972-1], the various degree-based topological indices for the probabilistic neural networks are studied. We extend this study by considering the calculations of the other topological indices, and derive the analytical closed formulas for these new topological indices of the probabilistic neural network. Moreover, a comparative study using computer-based graphs has been carried out first time to clarify the nature of the computed topological descriptors for the probabilistic neural networks. Our results extend some known conclusions.

Keywords

  • neural network
  • topological indices
  • Graph theory
Open Access

Synchronization Analysis of Inertial Memristive Neural Networks with Time-Varying Delays

Published Online: 17 May 2018
Page range: 269 - 282

Abstract

Abstract

This paper investigates the global exponential synchronization and quasi-synchronization of inertial memristive neural networks with time-varying delays. By using a variable transmission, the original second-order system can be transformed into first-order differential system. Then, two types of drive-response systems of inertial memristive neural networks are studied, one is the system with parameter mismatch, the other is the system with matched parameters. By constructing Lyapunov functional and designing feedback controllers, several sufficient conditions are derived respectively for the synchronization of these two types of drive-response systems. Finally, corresponding simulation results are given to show the effectiveness of the proposed method derived in this paper.

Keywords

  • inertial
  • memristive
  • neural networks
  • synchronization
Open Access

A Continuous-Time Distributed Algorithm for Solving a Class of Decomposable Nonconvex Quadratic Programming

Published Online: 17 May 2018
Page range: 283 - 291

Abstract

Abstract

In this paper, a continuous-time distributed algorithm is presented to solve a class of decomposable quadratic programming problems. In the quadratic programming, even if the objective function is nonconvex, the algorithm can still perform well under an extra condition combining with the objective, constraint and coupling matrices. Inspired by recent advances in distributed optimization, the proposed continuous-time algorithm described by multi-agent network with consensus is designed and analyzed. In the network, each agent only accesses the local information of its own and from its neighbors, then all the agents in a connected network cooperatively find the optimal solution with consensus.

Keywords

  • Decomposable nonconvex quadratic programming
  • multi-agent network
  • consensus
  • Lyapunov method
Open Access

Event-Triggered Cluster Consensus of Leader-Following Linear Multi-Agent Systems

Published Online: 17 May 2018
Page range: 293 - 302

Abstract

Abstract

This paper is concerned with cluster consensus of linear multi-agent systems via a distributed event-triggered control scheme. Assume that agents can be split into several clusters and a leader is associated with each cluster. Sufficient conditions are derived to guarantee the realization of cluster consensus by a feasible event-triggered controller if the network topology of each cluster has a directed spanning tree and the couplings within each cluster are sufficiently strong. Further, positive inner-event time intervals are ensured for the proposed event-triggered strategy to avoid Zeno behaviors. Finally, a numerical example is given to illustrate the effectiveness of the theoretical results.

Keywords

  • cluster consensus
  • event-triggered scheme
  • leader-following consensus
  • multiagent systems
Open Access

The Least Eigenvalue of the Graphs Whose Complements Are Connected and Have Pendent Paths

Published Online: 17 May 2018
Page range: 303 - 308

Abstract

Abstract

The adjacency matrix of a graph is a matrix which represents adjacent relation between the vertices of the graph. Its minimum eigenvalue is defined as the least eigenvalue of the graph. Let Gn be the set of the graphs of order n, whose complements are connected and have pendent paths. This paper investigates the least eigenvalue of the graphs and characterizes the unique graph which has the minimum least eigenvalue in Gn.

Keywords

  • graph
  • complement
  • pendent path
  • adjacency matrix
  • the least eigenvalue

Plan your remote conference with Sciendo