Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Short-distance Transport of Resources

Short-distance Transport of Resources

Short-distance transport refers to transport that occurs over a distance of just 2-3 cells, crossing the plasma membrane in the process. Small uncharged molecules, such as oxygen, carbon dioxide, and water, can diffuse across the plasma membrane on their own. In contrast, ions and larger molecules require the assistance of transport proteins due to their charge or size. Transport across membranes also occurs within individual cells, playing a variety of essential roles for the plant as a whole.

Optimal Foraging

Optimal Foraging

How animals obtain and eat their food is called foraging behavior. Foraging can include searching for plants and hunting for prey and depends on the species and environment.

Distributed Loads: Problem Solving

Distributed Loads: Problem Solving

Beams are structural elements commonly employed in engineering applications requiring different load-carrying capacities. The first step in analyzing a beam under a distributed load is to simplify the problem by dividing the load into smaller regions, which allows one to consider each region separately and calculate the magnitude of the equivalent resultant load acting on each portion of the beam. The magnitude of the equivalent resultant load for each region can be determined by calculating...

Distributed Loads

Distributed Loads

Distributed loads are a common type of load that engineers and scientists encounter in various practical situations. Distributed loads often refer to a type of load spread over a surface or a structure and can be modeled as continuous force per unit area.
For example, consider a bookshelf filled with books stacked vertically adjacent to each other. The weight of the books is evenly distributed over the length of the shelf. As a result, the pressure at different locations on the surface of the...

Lagrange Multipliers: Two Constraints

Lagrange Multipliers: Two Constraints

The method of Lagrange multipliers with two constraints is used to optimize a function subject to two independent constraints. In many applications, the objective function represents a quantity to be maximized or minimized, such as cost, area, distance, or energy. The two constraints represent requirements that the solution must satisfy, such as fixed volume, limited resources, or prescribed dimensions.For a function of three variables, each constraint forms a surface in three-dimensional space.

Maximum Power Flow and Line Loadability

Maximum Power Flow and Line Loadability

The maximum power flow for lossy transmission lines is derived using ABCD parameters in phasor form. These parameters create a matrix relationship between the sending-end and receiving-end voltages and currents, allowing the determination of the receiving-end current. This relationship facilitates calculating the complex power delivered to the receiving end, from which real and reactive power components are derived.

You might also read

Related Articles

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

Sort by

Same author

Parallel Branch-and-Bound Formulations for AND/OR Tree Search.

IEEE transactions on pattern analysis and machine intelligence·2012

Same author

Problem-solving models and search strategies for pattern recognition.

IEEE transactions on pattern analysis and machine intelligence·2011

Same author

Problem reduction representation for the linguistic analysis of waveforms.

IEEE transactions on pattern analysis and machine intelligence·2011

See all related articles

Search research articles

Related Experiment Videos

Knapsack packing networks.

B J Hellstrom¹, L N Kanal

¹Westinghouse Electr. Corp., Baltimore, MD.

IEEE Transactions on Neural Networks

|January 1, 1992

Summary

A novel neural network for knapsack packing problems was developed. Simulations show it performs comparably to existing fast algorithms for small problem sizes.

Area of Science:

Computational neuroscience
Artificial intelligence
Operations research

Background:

The knapsack problem is a classic combinatorial optimization challenge.
Neural networks offer a potential approach to solving complex optimization problems.
Existing algorithms for the knapsack problem have limitations in speed and scalability.

Purpose of the Study:

To introduce a new neural network model for solving the knapsack packing problem.
To evaluate the performance of this neural network against established algorithms.
To explore the network's behavior with varying problem sizes.

Main Methods:

Derivation of a knapsack packing neural network with specific synaptic properties from a non-Hamiltonian energy function.
Implementation of parallel simulations for randomly generated knapsack problems.

Related Experiment Videos

Comparison of the neural network's solutions against those from greedy fast parallel enumerative algorithms.

Main Results:

The neural network achieved comparable solutions to greedy algorithms for problem sizes of n=5, 10, and 20.
Performance analysis indicated the network's viability for certain knapsack problem instances.
The study provides a foundation for further development of neural network approaches to optimization.

Conclusions:

The developed knapsack packing neural network demonstrates potential as an alternative optimization method.
Further research is warranted to scale the network for larger and more complex problems.
This work contributes to the intersection of neural computation and combinatorial optimization.