Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Vector Algebra: Graphical Method01:10

Vector Algebra: Graphical Method

16.4K
Vectors can be multiplied by scalars, added to other vectors, or subtracted from other vectors. The vector sum of two (or more) vectors is called the resultant vector or, for short, the resultant.
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
16.4K
State Space Representation01:27

State Space Representation

441
The frequency-domain technique, commonly used in analyzing and designing feedback control systems, is effective for linear, time-invariant systems. However, it falls short when dealing with nonlinear, time-varying, and multiple-input multiple-output systems. The time-domain or state-space approach addresses these limitations by utilizing state variables to construct simultaneous, first-order differential equations, known as state equations, for an nth-order system.
Consider an RLC circuit, a...
441
State Space to Transfer Function01:21

State Space to Transfer Function

471
The conversion of state-space representation to a transfer function is a fundamental process in system analysis. It provides a method for transitioning from a time-domain description to a frequency-domain representation, which is crucial for simplifying the analysis and design of control systems.
The transformation process begins with the state-space representation, characterized by the state equation and the output equation. These equations are typically represented as:
471
Sequence Networks of Rotating Machines01:24

Sequence Networks of Rotating Machines

415
A Y-connected synchronous generator, grounded through a neutral impedance, is designed to produce balanced internal phase voltages with only positive-sequence components. The generator's sequence networks include a source voltage that is exclusively in the positive-sequence network. The sequence components of line-to-ground voltages at the generator terminals illustrate this configuration.
Zero-sequence current induces a voltage drop across the generator's neutral impedance and other...
415
Region of Convergence of Laplace Tarnsform01:20

Region of Convergence of Laplace Tarnsform

959
The Region of Convergence (ROC) is a fundamental concept in signal processing and system analysis, particularly associated with the Laplace transform. The ROC represents an area in the complex plane where the Laplace transform of a given signal converges, determining the transform's applicability and utility.
Consider a decaying exponential signal that begins at a specific time. When deriving its Laplace transform, the time-domain variable is replaced with a complex variable. This...
959
Convolution: Math, Graphics, and Discrete Signals01:24

Convolution: Math, Graphics, and Discrete Signals

725
In any LTI (Linear Time-Invariant) system, the convolution of two signals is denoted using a convolution operator, assuming all initial conditions are zero. The convolution integral can be divided into two parts: the zero-input or natural response and the zero-state or forced response, with t0 indicating the initial time.
To simplify the convolution integral, it is assumed that both the input signal and impulse response are zero for negative time values. The graphical convolution process...
725

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Design and Control of a 1-DOF MRI Compatible Pneumatically Actuated Robot with Long Transmission Lines.

IEEE/ASME transactions on mechatronics : a joint publication of the IEEE Industrial Electronics Society and the ASME Dynamic Systems and Control Division·2011
Same author

Effect of oxidized low-density lipoprotein concentration polarization on human smooth muscle cells' proliferation, cycle, apoptosis and oxidized low-density lipoprotein uptake.

Journal of the Royal Society, Interface·2011
Same author

Acrolein hydrogenation on Pt(211) and Au(211) surfaces: a density functional theory study.

Physical chemistry chemical physics : PCCP·2011
Same author

Anhydrous proton-conducting membrane based on poly-2-vinylpyridinium dihydrogenphosphate for electrochemical applications.

The journal of physical chemistry. B·2011
Same author

Pharmacophore identification, virtual screening and biological evaluation of prenylated flavonoids derivatives as PKB/Akt1 inhibitors.

European journal of medicinal chemistry·2011
Same author

Metabolomic study of insomnia and intervention effects of Suanzaoren decoction using ultra-performance liquid-chromatography/electrospray-ionization synapt high-definition mass spectrometry.

Journal of pharmaceutical and biomedical analysis·2011

Related Experiment Video

Updated: Dec 14, 2025

Evidence-based Knowledge Synthesis and Hypothesis Validation: Navigating Biomedical Knowledge Bases via Explainable AI and Agentic Systems
05:47

Evidence-based Knowledge Synthesis and Hypothesis Validation: Navigating Biomedical Knowledge Bases via Explainable AI and Agentic Systems

Published on: June 13, 2025

1.1K

Probabilistic Graph Convolutional Network via Topology-Constrained Latent Space Model.

Liang Yang, Yuanfang Guo, Junhua Gu

    IEEE Transactions on Cybernetics
    |July 22, 2020
    PubMed
    Summary
    This summary is machine-generated.

    This study introduces a probabilistic graph convolutional network (PGCN) for semisupervised node classification, offering a unified probabilistic framework that integrates network topology and node content while denoising uncertainties.

    Related Experiment Videos

    Last Updated: Dec 14, 2025

    Evidence-based Knowledge Synthesis and Hypothesis Validation: Navigating Biomedical Knowledge Bases via Explainable AI and Agentic Systems
    05:47

    Evidence-based Knowledge Synthesis and Hypothesis Validation: Navigating Biomedical Knowledge Bases via Explainable AI and Agentic Systems

    Published on: June 13, 2025

    1.1K

    Area of Science:

    • Machine Learning
    • Graph Neural Networks
    • Probabilistic Modeling

    Background:

    • Existing graph convolutional neural networks (GCNNs) lack a general theoretical basis and struggle to model uncertainties from noisy network topology and node content.
    • Current GCNNs often fail to effectively integrate network topology and node content due to their limitations in handling noise and uncertainty.

    Purpose of the Study:

    • To propose a unified probabilistic framework for semisupervised node classification by modeling the problem as a topology-constrained probabilistic latent space model.
    • To develop a novel probabilistic graph convolutional network (PGCN) that seamlessly integrates node content and network topology while addressing noise and uncertainty.

    Main Methods:

    • Modeled semisupervised node classification as a topology-constrained probabilistic latent space model, termed Probabilistic Graph Convolutional Network (PGCN).
    • Introduced PGCN with Gaussian distribution representation (PGCN-G) for transductive node classification.
    • Improved PGCN-G to PGCN-G+ by imposing identical singular vectors on covariance matrices to mitigate overfitting and reduce computational complexity.
    • Utilized an expectation-maximization algorithm for optimization, enabling iterative denoising of network topology and node content.

    Main Results:

    • The proposed PGCN framework effectively integrates node content and network topology by representing nodes in an efficient distribution form.
    • PGCN-G and PGCN-G+ demonstrate effectiveness in semisupervised node classification tasks.
    • The expectation-maximization optimization iteratively denoises network topology and node content, enhancing model robustness.
    • Extensive experiments validated the effectiveness of the top-down PGCN framework.

    Conclusions:

    • The proposed PGCN framework provides a probabilistic perspective to GCNNs, offering a unified approach to semisupervised node classification.
    • PGCN can be deduced to encompass existing methods like GCN, GAT, and GMM, elucidating their characteristics and relationships.
    • The method effectively handles uncertainties and noise in graph data, leading to improved performance in node classification tasks.