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

Signal Flow Graphs01:18

Signal Flow Graphs

311
Signal-flow graphs offer a streamlined and intuitive approach to representing control systems, providing an alternative to traditional block diagrams. These graphs use branches to symbolize systems and nodes to represent signals, effectively illustrating the relationships and interactions within the system.
In a signal-flow graph, branches denote the system's transfer functions, while nodes represent the signals. The direction of signal flow is indicated by arrows, with the corresponding...
311
Block Diagram Reduction01:22

Block Diagram Reduction

283
The process of deriving the transfer function of a control system often involves reducing its block diagram to a single block. This simplification can be achieved through a series of strategic operations, including relocating branch points and comparators. These operations preserve the overall function of the system while allowing for easier manipulation and combination of blocks.
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
283
SFG Algebra01:16

SFG Algebra

171
In Signal Flow Graph (SFG) algebra, the value a node represents is determined by the sum of all signals entering that node. This summed value is then transmitted through every branch leaving the node, making the SFG a powerful tool for visualizing and analyzing control systems.
Each node in an SFG corresponds to a variable, and the interactions between nodes are represented by branches with associated gains. When multiple branches lead into a node, the value at that node is the sum of the...
171
Network Function of a Circuit01:25

Network Function of a Circuit

372
Frequency response analysis in electrical circuits provides vital insights into a circuit's behavior as the frequency of the input signal changes. The transfer function, a mathematical tool, is instrumental in understanding this behavior. It defines the relationship between phasor output and input and comes in four types: voltage gain, current gain, transfer impedance, and transfer admittance. The critical components of the transfer function are the poles and zeros.
372
Sequence Networks of Rotating Machines01:24

Sequence Networks of Rotating Machines

140
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...
140
Convolution: Math, Graphics, and Discrete Signals01:24

Convolution: Math, Graphics, and Discrete Signals

391
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...
391

You might also read

Related Articles

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

Sort by
Same author

Morphology and Phase Engineering of TaS<sub>2</sub> Nanosheets on Planar Au Substrates Toward Superior Electrocatalytic Property.

Small (Weinheim an der Bergstrasse, Germany)·2026
Same author

Space-Confined Chemical Vapor Deposition of 2D FeS With Crossover Magnetoresistance and Ultra-High Conductivity.

Advanced materials (Deerfield Beach, Fla.)·2026
Same author

Generating knotted polymer and protein structures by machine learning.

Communications chemistry·2026
Same author

Association between compound PM<sub>2.5</sub>-cold events and population-specific mortality: a time-trend ecologic study of damage amplification in Zigong, China.

Archives of public health = Archives belges de sante publique·2026
Same author

High-energy anode-free Li metal batteries with in-built surface-fluorinated Li-rich Mn-based cathodes.

Science advances·2026
Same author

FM-3224: A potent triazolinone-based fungicide with broad-spectrum activity and computational support for putative dual-target binding.

Pest management science·2026

Related Experiment Video

Updated: Sep 7, 2025

Creating Objects and Object Categories for Studying Perception and Perceptual Learning
14:38

Creating Objects and Object Categories for Studying Perception and Perceptual Learning

Published on: November 2, 2012

11.9K

Formulaic language identification model based on GCN fusing associated information.

Fanqi Meng1,2, Yujie Zheng1, Songbin Bao3

  • 1School of Computer Science, Northeast Electric Power University, Jilin City, Jilin, China.

Peerj. Computer Science
|June 20, 2022
PubMed
Summary
This summary is machine-generated.

This study introduces a novel graph convolutional network (GCN) model for identifying formulaic language. The GCN model significantly improves accuracy in detecting these ready-made language structures.

Keywords:
Associated informationDependency syntactic relationFormulaic languageGraph convolutional neural networkMutual information

More Related Videos

Functional Complementation Analysis FCA: A Laboratory Exercise Designed and Implemented to Supplement the Teaching of Biochemical Pathways
09:27

Functional Complementation Analysis FCA: A Laboratory Exercise Designed and Implemented to Supplement the Teaching of Biochemical Pathways

Published on: June 24, 2016

17.7K
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

563

Related Experiment Videos

Last Updated: Sep 7, 2025

Creating Objects and Object Categories for Studying Perception and Perceptual Learning
14:38

Creating Objects and Object Categories for Studying Perception and Perceptual Learning

Published on: November 2, 2012

11.9K
Functional Complementation Analysis FCA: A Laboratory Exercise Designed and Implemented to Supplement the Teaching of Biochemical Pathways
09:27

Functional Complementation Analysis FCA: A Laboratory Exercise Designed and Implemented to Supplement the Teaching of Biochemical Pathways

Published on: June 24, 2016

17.7K
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

563

Area of Science:

  • Computational Linguistics
  • Natural Language Processing
  • Artificial Intelligence

Background:

  • Formulaic language, comprising ready-made linguistic structures, is crucial for coherent writing and communication.
  • Accurate identification of novel formulaic language is an ongoing research challenge.
  • Existing methods may not fully capture the complex relationships within formulaic language.

Purpose of the Study:

  • To propose and evaluate a new model for identifying formulaic language.
  • To leverage graph convolutional networks (GCN) for enhanced feature extraction.
  • To improve the accuracy, recall, and F1-score of formulaic language identification.

Main Methods:

  • Constructing sentences as graphs where nodes represent word features (part-of-speech, semantic) and edges represent mutual information and dependency relations.
  • Applying a graph convolutional neural network (GCN) to extract deep grammatical features from these graph representations.
  • Fusing associated information within the GCN framework.

Main Results:

  • The proposed GCN-based model demonstrates superior performance compared to classical formulaic language identification models.
  • The model achieved higher accuracy, recall, and F1-score in experiments.
  • The approach effectively mines deeper grammatical features by analyzing word associations.

Conclusions:

  • The developed GCN model offers a more accurate method for identifying formulaic language.
  • This research provides a foundation for future advancements in formulaic language identification tasks.
  • The fusion of associated information in a graph structure is key to the model's success.