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

Fast Decoupled and DC Powerflow01:24

Fast Decoupled and DC Powerflow

845
The fast decoupled power flow method addresses contingencies in power system operations, such as generator outages or transmission line failures. This method provides quick power flow solutions, essential for real-time system adjustments. Fast decoupled power flow algorithms simplify the Jacobian matrix by neglecting certain elements, leading to two sets of decoupled equations:
845
Maximum Power Flow and Line Loadability01:23

Maximum Power Flow and Line Loadability

710
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.
710
Multimachine Stability01:25

Multimachine Stability

623
Multimachine stability analysis is crucial for understanding the dynamics and stability of power systems with multiple synchronous machines. The objective is to solve the swing equations for a network of M machines connected to an N-bus power system.
In analyzing the system, the nodal equations represent the relationship between bus voltages, machine voltages, and machine currents. The nodal equation is given by:
623
Simplified Synchronous Machine Model01:30

Simplified Synchronous Machine Model

900
The Synchronous Machine Model is a fundamental tool in analyzing and ensuring the transient stability of power systems. This model simplifies the representation of a synchronous machine under balanced three-phase positive-sequence conditions, assuming constant excitation and ignoring losses and saturation. The model is pivotal for understanding the behavior of synchronous generators connected to a power grid, particularly during transient events.
In this model, each generator is connected to a...
900
Distributed Loads: Problem Solving01:21

Distributed Loads: Problem Solving

1.2K
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...
1.2K
Distributed Loads01:19

Distributed Loads

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

You might also read

Related Articles

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

Sort by
Same author

Novel approach to early prediction of alzheimer's disease progression using integrated deep regulatory genetic neural network and optimized deep belief networks.

Scientific reports·2026
Same author

Reforming disease prognosis and treatment prediction for palliative care with hybrid metaheuristic deep neural architectures in IoT healthcare ecosystems.

Scientific reports·2025
Same author

Prone Reduction Technique of Pediatric Gartland Type 2 Extension Supracondylar Fractures of Humerus in an Outpatient Low-Resource Setting.

Journal of orthopaedic case reports·2025
Same author

Chasing the digital high: should hedonic consumption be viewed through the lens of behavioral addiction?

Frontiers in psychiatry·2025
Same author

Chromosome Image Classification Using Edge Fusion Attention Network.

Microscopy research and technique·2025
Same author

Epidemiological Profile of the Victims Involved in Road Traffic Accidents (RTA) and ICD-10 Classification Attending an Emergency Department: A Descriptive Study.

Indian journal of community medicine : official publication of Indian Association of Preventive & Social Medicine·2025

Related Experiment Video

Updated: Mar 30, 2026

Experimental Investigation of the Hierarchical Control in DC Microgrids Using a Real-time Simulator
06:04

Experimental Investigation of the Hierarchical Control in DC Microgrids Using a Real-time Simulator

Published on: February 14, 2025

1.1K

Hybrid Scheduling Model for Independent Grid Tasks.

J Shanthini1, T Kalaikumaran1, S Karthik1

  • 1SNS College of Technology, Coimbatore, Tamilnadu 641035, India.

Thescientificworldjournal
|November 7, 2015
PubMed
Summary

This study introduces a hybrid scheduling algorithm (BG_ATC) to minimize tardiness in grid computing. The new algorithm outperforms existing methods for efficient grid task scheduling.

Area of Science:

  • Computer Science
  • Distributed Systems
  • Operations Research

Background:

  • Grid computing enables resource sharing across distributed administrative domains.
  • Scheduling in heterogeneous distributed environments is complex due to resource diversity.
  • Previous research often focused on makespan reduction, neglecting task due date performance.

Purpose of the Study:

  • To propose a hybrid scheduling algorithm, BG_ATC, for independent grid tasks.
  • To minimize the total weighted tardiness of grid tasks, impacting execution costs.
  • To improve due date performance in grid task scheduling.

Main Methods:

  • Developed a hybrid algorithm combining Best Gap (BG) search and Apparent Tardiness Cost (ATC) indexing.
  • Implemented the BG_ATC algorithm in two distinct phases of the scheduling process.

More Related Videos

Author Spotlight: Enhancing Cryo-Electron Microscopy by Automated Data Collection and Analysis Techniques
07:52

Author Spotlight: Enhancing Cryo-Electron Microscopy by Automated Data Collection and Analysis Techniques

Published on: December 1, 2023

1.6K

Related Experiment Videos

Last Updated: Mar 30, 2026

Experimental Investigation of the Hierarchical Control in DC Microgrids Using a Real-time Simulator
06:04

Experimental Investigation of the Hierarchical Control in DC Microgrids Using a Real-time Simulator

Published on: February 14, 2025

1.1K
Author Spotlight: Enhancing Cryo-Electron Microscopy by Automated Data Collection and Analysis Techniques
07:52

Author Spotlight: Enhancing Cryo-Electron Microscopy by Automated Data Collection and Analysis Techniques

Published on: December 1, 2023

1.6K
  • Compared the BG_ATC algorithm against various benchmark scheduling algorithms.

    • Main Results:

    • The BG_ATC algorithm demonstrated superior performance in reducing total weighted tardiness.
    • Experimental results confirmed that the proposed algorithm outperforms benchmark algorithms.
    • The hybrid approach effectively balances machine utilization and due date adherence.

    Conclusions:

    • The BG_ATC algorithm offers an effective solution for tardiness reduction in grid task scheduling.
    • This approach provides a significant improvement over existing methods for heterogeneous grid environments.
    • Optimizing tardiness is crucial for managing costs and meeting deadlines in grid computing.