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

Ogive Graph01:07

Ogive Graph

7.2K
An ogive graph is sometimes called a cumulative frequency polygon. It is one type of frequency polygon that shows cumulative frequency. In other words, the cumulative percentages are added to the graph from left to right. An ogive graph plots cumulative frequency on the vertical y-axis and class boundaries along the horizontal x-axis. It’s very similar to a histogram; only instead of rectangles, an ogive displays a single point where the top right of the rectangle would be. Creating this...
7.2K
Parseval's Theorem01:18

Parseval's Theorem

1.4K
Parseval's theorem is a fundamental concept in signal processing and harmonic analysis. It asserts that for a periodic function, the average power of the signal over one period equals the sum of the squared magnitudes of all its complex Fourier coefficients. This theorem, named after Marc-Antoine Parseval, provides a powerful tool for analyzing the energy distribution in signals.
Interestingly, Parseval's theorem also holds for the trigonometric form of the Fourier series, which expresses a...
1.4K
Components of Language01:24

Components of Language

918
Language, whether spoken, signed, or written, consists of specific components: lexicon and grammar. The lexicon is the vocabulary of a language, comprising its words. Grammar is the set of rules used to convey meaning through the lexicon. For example, English grammar adds “-ed” to most verbs to indicate past tense. Words are formed by combining phonemes, which are the basic sound units of a language. Different languages have different sets of phonemes (e.g., “ah” vs.
918
[3,3] Sigmatropic Rearrangement of 1,5-Dienes: Cope Rearrangement01:21

[3,3] Sigmatropic Rearrangement of 1,5-Dienes: Cope Rearrangement

3.6K
The Cope rearrangement is classified as a [3,3] sigmatropic shift in 1,5-dienes, leading to a more stable, isomeric 1,5-diene. The reaction involves a concerted movement of six electrons, four from two π bonds and two from a σ bond, via an energetically favorable chair-like transition state.
3.6K
Automatic Processing and Automatic Social Behavior01:28

Automatic Processing and Automatic Social Behavior

352
Automatic processing refers to the cognitive operations that occur without conscious intent or awareness, playing a fundamental role in shaping social cognition and behavior. These processes enable individuals to navigate complex social environments efficiently by relying on mental shortcuts and pre-existing knowledge structures known as schemas. One of the most influential mechanisms underlying automatic processing is priming, which subtly activates mental representations through exposure to...
352
Woodward–Hoffmann Selection Rules and Microscopic Reversibility01:34

Woodward–Hoffmann Selection Rules and Microscopic Reversibility

4.2K
Electrocyclic reactions, cycloadditions, and sigmatropic rearrangements are concerted pericyclic reactions that proceed via a cyclic transition state. These reactions are stereospecific and regioselective. The stereochemistry of the products depends on the symmetry characteristics of the interacting orbitals and the reaction conditions. Accordingly, pericyclic reactions are classified as either symmetry-allowed or symmetry-forbidden. Woodward and Hoffmann presented the selection criteria for...
4.2K

You might also read

Related Articles

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

Sort by
Same author

Polygonatum sibiricum polysaccharide ameliorates intestinal barrier dysfunction in aging mice via gut microbiota-metabolite modulation and TLR4/NF-κB pathway inhibition.

Phytomedicine : international journal of phytotherapy and phytopharmacology·2026
Same author

The Association Between Childhood Maltreatment and Adult Intestinal Disorders: A Three-Level Meta-Analysis.

Trauma, violence & abuse·2026
Same author

Advanced yolk-shell microstructure for high-efficiency electromagnetic wave absorption: a critical review of composition-structure synergy.

Nanoscale·2026
Same author

A missense variant in Exon 9 of the <i>ASNS</i> gene causes splicing abnormality in an Infant with asparagine synthetase deficiency.

Frontiers in genetics·2026
Same author

Person-in-WiFi 3D: Unified Model for 3D WiFi Perception.

IEEE transactions on pattern analysis and machine intelligence·2026
Same author

Knowledge embedded wind tunnel typical pressure vessel design optimization method research.

PloS one·2026

Related Experiment Video

Updated: Mar 29, 2026

Examining Online Syntactic Processing of Spoken Complex Sentences in Chinese Using Dual-Modal Interference Tasks
08:32

Examining Online Syntactic Processing of Spoken Complex Sentences in Chinese Using Dual-Modal Interference Tasks

Published on: September 5, 2019

6.0K

Research on the Top-Down Parsing Method for Context-Sensitive Graph Grammars.

Yi Wang1,2, XiaoQin Zeng1, Han Ding2

  • 1Institute of Intelligence Science and Technology, Hohai University, Nanjing, P.R. China.

Plos One
|December 1, 2015
PubMed
Summary

This study introduces a top-down parsing method for graph grammars, significantly reducing time-complexity. This approach avoids complex subgraph isomorphism judgments, making graph grammar parsing more efficient and applicable.

More Related Videos

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.8K
Using the Visual World Paradigm to Study Sentence Comprehension in Mandarin-Speaking Children with Autism
06:15

Using the Visual World Paradigm to Study Sentence Comprehension in Mandarin-Speaking Children with Autism

Published on: October 3, 2018

8.3K

Related Experiment Videos

Last Updated: Mar 29, 2026

Examining Online Syntactic Processing of Spoken Complex Sentences in Chinese Using Dual-Modal Interference Tasks
08:32

Examining Online Syntactic Processing of Spoken Complex Sentences in Chinese Using Dual-Modal Interference Tasks

Published on: September 5, 2019

6.0K
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.8K
Using the Visual World Paradigm to Study Sentence Comprehension in Mandarin-Speaking Children with Autism
06:15

Using the Visual World Paradigm to Study Sentence Comprehension in Mandarin-Speaking Children with Autism

Published on: October 3, 2018

8.3K

Area of Science:

  • Computer Science
  • Graph Theory
  • Formal Languages

Background:

  • Graph grammars are crucial in computer science for modeling complex systems.
  • Traditional parsing algorithms for graph grammars often employ a bottom-up approach.
  • The bottom-up method suffers from high time-complexity and practical application challenges.

Purpose of the Study:

  • To address the computational challenges in graph grammar parsing.
  • To develop a more efficient parsing algorithm for graph grammars.
  • To reduce the time-complexity associated with graph grammar parsing.

Main Methods:

  • The study proposes and implements a top-down parsing method for graph grammars.
  • This method specifically selects productions to guide the parsing process.
  • The algorithm is designed to avoid computationally expensive subgraph isomorphism judgments.

Main Results:

  • The top-down parsing method significantly reduces the time-complexity compared to traditional bottom-up methods.
  • The avoidance of subgraph isomorphism judgment streamlines the parsing process.
  • The proposed method enhances the practical applicability of graph grammar parsing.

Conclusions:

  • The top-down parsing strategy offers a more efficient solution for graph grammar parsing.
  • This approach overcomes key limitations of existing methods, particularly regarding computational cost.
  • The findings suggest a more viable path for utilizing graph grammars in various computational domains.