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

Hückel's Rule Diagram of π MOs: Frost Circle01:08

Hückel's Rule Diagram of π MOs: Frost Circle

The Frost circle or the inscribed polygon method is a graphical method for determining the relative energies of π molecular orbitals (MOs) for planar, fully conjugated, and monocyclic compounds. This method was first described by A. A. Frost and Boris Musulin in 1953.
A Frost circle is constructed by drawing a polygon whose number of edges is equal to the number of carbons of the given cyclic system, with one of the vertices pointing down. Then, a circle is drawn enclosing the polygon so that...
Principle of Equivalence01:18

Principle of Equivalence

According to Albert Einstein (1897-1955), free-falling and feeling weightless are intrinsically linked. If a person were in free-fall under gravity, for example, diving towards the Earth from an airplane, they would feel completely weightless. Similarly, a person descending in a lift may feel partially weightless. Broadly speaking, it is assumed that an object in a uniform gravitational field and an object undergoing constant acceleration in the absence of gravity are under the same...
From DNA to Protein03:06

From DNA to Protein

The flow of genetic information in cells from DNA to mRNA to protein is described by the central dogma, which states that genes specify the sequence of mRNAs, which in turn specify the sequence of amino acids making up all proteins. The decoding of one molecule to another is performed by specific proteins and RNAs. Because the information stored in DNA is so central to cellular function, it makes intuitive sense that the cell would make mRNA copies of this information for protein synthesis...
Genetic Lingo01:11

Genetic Lingo

Overview
Singularity Functions for Shear01:26

Singularity Functions for Shear

In structural analysis, singularity functions are crucial in simplifying the representation of shear forces in beams under discontinuous loading. These functions describe discontinuous variations in shear force across a beam with varying loads by using a single mathematical expression, regardless of the complexity of the loading conditions. The singularity functions are derived from creating a free-body diagram of the beam and then making conceptual cuts at specific points to examine the shear...
The Central Dogma01:25

The Central Dogma

Overview

You might also read

Related Articles

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

Sort by
Same author

[Current status, representative devices, and future development trends of wound measurement technologies].

Zhonghua shao shang yu chuang mian xiu fu za zhi·2025
Same author

Establishment of 5-Fluorouracil-resistant canine mammary tumor cell line.

Polish journal of veterinary sciences·2017
Same author

Probabilistic prediction of exposures to arsenic contaminated residential soil.

Environmental geochemistry and health·2013
Same author

Development of a probabilistic blood lead prediction model.

Environmental geochemistry and health·2013
Same author

A low-resistance valve and indicating flowmeter for respiratory measurements.

Science (New York, N.Y.)·2010
Same author

MMPI-2 patterns in electrical injury: a controlled investigation.

The Clinical neuropsychologist·2008
Same journal

Benchmarking the Robustness of Autonomous Driving to Environmental Illusions: A Lane Perception Perspective.

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

Learning Topology-Aware Representations via Test-Time Adaptation for Anomaly Segmentation.

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

TraGraph-GS: Trajectory Graph-based Gaussian Splatting for Arbitrary Large-Scale Scene Rendering.

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

SWIFT: A Small-World Interaction Framework for Flow-Aware Trajectory Prediction in Autonomous Driving.

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

HardFlow: Hard-Constrained Sampling for Flow-Matching Models Via Trajectory Optimization.

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

Industrial Brain: Self-Evolving Neuro-Symbolic Autonomy with Causal Resilience for Cyber-Physical Systems.

IEEE transactions on pattern analysis and machine intelligence·2026
See all related articles

Related Experiment Videos

Symbolic gray code as a multikey hashing function.

H C Du1, R C Lee

  • 1Institute of Applied Mathematics, National Tsing Hua University, Hsinchu, Taiwan; Department of Computer Sciences, University of Washington, Seattle, WA 98105.

IEEE Transactions on Pattern Analysis and Machine Intelligence
|April 14, 2012
PubMed
Summary
This summary is machine-generated.

This study introduces symbolic Gray code as a multikey hashing function. This method clusters similar records, enhancing nearest neighbor searching systems and optimizing data storage without collisions.

Related Experiment Videos

Area of Science:

  • Computer Science
  • Data Structures
  • Algorithms

Background:

  • Traditional binary Gray codes have limitations in handling symbolic data.
  • Efficient nearest neighbor searching requires data structures that group similar records.
  • Existing hashing functions can lead to collisions and wasted memory.

Purpose of the Study:

  • To extend binary Gray code to a symbolic Gray code.
  • To utilize symbolic Gray code as a multikey hashing function for symbolic records.
  • To demonstrate the clustering property of this hashing function for nearest neighbor searching.

Main Methods:

  • Extension of binary Gray code to symbolic Gray code.
  • Application of symbolic Gray code as a multikey hashing function.
  • Analysis of the hashing function's properties, including clustering and address-to-key transformation.

Main Results:

  • Symbolic Gray code effectively functions as a multikey hashing method.
  • The hashing function exhibits a clustering property, grouping nearest neighbor records.
  • The method ensures no data collisions and efficient memory usage (M records, M locations).
  • The resulting file structure resembles a multiple-attribute tree.

Conclusions:

  • Symbolic Gray code is a viable and efficient hashing function for symbolic data.
  • This approach significantly improves nearest neighbor searching systems.
  • The method offers a collision-free and memory-efficient solution for data storage.