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

Optimization Problems

Optimization Problems

Optimization problems often involve identifying maximum or minimum values under specific constraints. A well-known example is determining the longest horizontal pipe that can be moved around a right-angled corner, where a 3-meter-wide hallway meets a 2-meter-wide hallway. This scenario, common in architectural design and industrial transport, can be understood conceptually through geometric and trigonometric reasoning.To visualize the problem, consider the pipe as a straight line that touches...

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...

Lagrange Multipliers: Problem Solving

Lagrange Multipliers: Problem Solving

A silo with a cylindrical base, flat bottom, and hemispherical roof is a common design in agricultural and industrial storage due to its structural efficiency and ease of construction. Optimizing its dimensions to maximize storage capacity for a given amount of material—i.e., a fixed surface area—is a classic problem in applied calculus and engineering design. The key parameters are the radius r of the base and the height h of the cylindrical section.The total volume of the silo is obtained by...

Statically Indeterminate Problem Solving

Statically Indeterminate Problem Solving

Statically indeterminate problems are those where statics alone can not determine the internal forces or reactions. Consider a structure comprising two cylindrical rods made of steel and brass. These rods are joined at point B and restrained by rigid supports at points A and C. Now, the reactions at points A and C and the deflection at point B are to be determined. This rod structure is classified as statically indeterminate as the structure has more supports than are necessary for maintaining...

Mathematical Modeling: Problem Solving

Mathematical Modeling: Problem Solving

Mathematical modeling transforms real-world scenarios into mathematical expressions, allowing for structured problem-solving and analysis. This process involves defining the situation, assigning variables to measurable quantities, selecting an appropriate model, and solving the resulting equation. Such models are invaluable in finance, providing precise methods to evaluate investments, loans, and repayment structures.A widely used example is the calculation of fixed monthly payments on a loan,...

Block Diagram Reduction

Block Diagram Reduction

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

You might also read

Related Articles

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

Sort by

Same author

Contour map registration using fourier descriptors of gradient codes.

IEEE transactions on pattern analysis and machine intelligence·2011

Same author

Ministry of Health clinical practice guidelines: Chronic Hepatitis B Infection.

Singapore medical journal·2011

Same author

Minimal hepatic encephalopathy runs a fluctuating course: results from a three-year prospective cohort follow-up study.

Singapore medical journal·2009

Same author

Gaseous emboli detection based on a dual-wavelet transform analysis.

Proceedings of the Institution of Mechanical Engineers. Part H, Journal of engineering in medicine·2007

Same author

Significant non-alcoholic fatty liver disease is found in non-diabetic, pre-obese Chinese in Singapore.

Singapore medical journal·2007

Same author

Equivalence-set genes partitioning using an evolutionary-DP approach.

IEEE transactions on nanobioscience·2006

Search research articles

Related Experiment Videos

Analog and digital FPGA implementation of BRIN for optimization problems.

H S Ng¹, K P Lam

¹Dept. of Syst. Eng. and Eng. Manage., Chinese Univ. of Hong Kong, Shatin, China.

IEEE Transactions on Neural Networks

|February 5, 2008

Summary

This summary is machine-generated.

The binary relation inference network (BRIN) offers a promising, platform-independent solution for optimization problems. This study explores its analog and digital field-programmable gate array (FPGA) implementations, demonstrating efficient network realization.

Related Experiment Videos

Area of Science:

Computer Engineering
Optimization Algorithms
Hardware Implementation

Background:

The binary relation inference network (BRIN) is a promising method for solving optimization problems.
Its practical realization depends on the chosen implementation platform, necessitating investigation into different approaches.

Purpose of the Study:

To explore and compare analog and digital field-programmable gate array (FPGA) implementations of the BRIN.
To investigate the efficiency and suitability of different BRIN circuit designs for specific problems.

Main Methods:

Studied analog implementations of BRIN for directed graph problems, including transitive closure and critical path problems.
Developed and investigated digital implementations of BRIN on FPGA platforms (Xilinx XC4010XL and XCV800 Virtex).
Utilized separated and combined building block circuits for critical path problem solutions.

Main Results:

Analog BRIN circuits were designed and investigated for graph-based optimization problems.
Digital BRIN networks were successfully implemented on FPGAs, achieving synchronous computation in finite steps.
Case studies verified correct results, and resource consumption analysis indicated Virtex devices are more suitable for network expansion.

Conclusions:

Both analog and digital FPGA implementations of BRIN are feasible for optimization problems.
FPGA implementation offers efficient network construction, overcoming bandwidth limitations.
Virtex FPGAs provide a scalable platform for future BRIN network development.