Jove
Visualize
Contact Us

Related Concept Videos

Randomized Experiments01:13

Randomized Experiments

7.1K
The randomization process involves assigning study participants randomly to experimental or control groups based on their probability of being equally assigned. Randomization is meant to eliminate selection bias and balance known and unknown confounding factors so that the control group is similar to the treatment group as much as possible. A computer program and a random number generator can be used to assign participants to groups in a way that minimizes bias.
Simple randomization
Simple...
7.1K
Group Design02:01

Group Design

9.0K
The most basic experimental design involves two groups: the experimental group and the control group. The two groups are designed to be the same except for one difference— experimental manipulation. The experimental group gets the experimental manipulation—that is, the treatment or variable being tested—and the control group does not. Since experimental manipulation is the only difference between the experimental and control groups, we can be sure that any differences between...
9.0K
Issues And Trends In Healthcare Delivery System01:29

Issues And Trends In Healthcare Delivery System

5.7K
The issues and trends in healthcare delivery are constantly changing. The COVID-19 pandemic is one recent issue that wreaked havoc on healthcare systems, causing a shortage of healthcare workers, high demand for medicines and supplies, and increased medical expenditure due to a lack of insurance. Other issues include rising healthcare costs and care fragmentation.
Cost Containment
Payment for healthcare services has historically promoted adoption of costly and often unnecessary or inefficient...
5.7K
Bias01:22

Bias

4.3K
Bias refers to any tendency that prevents a question from being considered unprejudiced. In research, bias occurs when one outcome or answer is selected or encouraged over others in sampling or testing. Bias can occur during any research phase, including study design, data collection, analysis, and publication.
In statistics, a sampling bias is created when a sample is collected from a population, and some members of the population are not as likely to be chosen as others (remember, each member...
4.3K
Wald-Wolfowitz Runs Test I01:17

Wald-Wolfowitz Runs Test I

683
The Wald-Wolfowitz test, also known as the runs test, is a nonparametric statistical test used to assess the randomness of a sequence of two different types of elements (e.g., positive/negative values, successes/failures). It examines whether the order of the elements in a sequence is random or if there is a pattern or trend present. This nonparametric test applies to any ordered data despite the population and sample data distribution, even if a higher sample size is available.
The test works...
683
Trial and Error and Algorithm01:12

Trial and Error and Algorithm

153
A problem-solving strategy is a plan of action used to find a solution. Different strategies have distinct action plans. Trial and error involves trying different solutions until one works. For instance, to fix a broken printer, you might check ink levels, ensure the paper tray isn't jammed, and verify the printer's connection to your laptop. This method can be time-consuming but is commonly used. Thomas Edison, for example, used trial and error to find a suitable filament for the light...
153

You might also read

Related Articles

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

Sort by
Same journal

Thymidylate synthase inhibitory drugs induce p53-dependent pathways differently.

PloS one·2026
Same journal

Top-down and bottom-up attention for joint pattern classification and reconstruction.

PloS one·2026
Same journal

Short- and long-term scaling behavior of blood pressure and pulse arrival time during sleep in healthy controls and patients with obstructive sleep apnea.

PloS one·2026
Same journal

Double DQN-based secrecy energy efficiency and fairness performance in IRS-assisted NOMA systems with friendly jamming.

PloS one·2026
Same journal

10 recommendations for strengthening citizen science for improved societal and ecological outcomes: A co-produced analysis of challenges and opportunities in the 21st century.

PloS one·2026
Same journal

Paying in public: Peer effects, impression management, and willingness to pay on digital payment platforms.

PloS one·2026
See all related articles
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 Experiment Video

Updated: Jul 26, 2025

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
05:30

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

607

Novel randomization and iterative based algorithms for the transactions assignment in blockchain problem.

Abdullah Bajahzar1

  • 1Department of Computer Science and Information, College of Science at Zulfi, Majmaah University, Al-Majmaah, Saudi Arabia.

Plos One
|June 21, 2023
PubMed
Summary
This summary is machine-generated.

This study introduces nine algorithms for blockchain transaction load balancing, an NP-hard problem. The best algorithm achieved 93.9% accuracy in 0.003 seconds, significantly improving big data concurrency.

More Related Videos

The Collective Trust Game: An Online Group Adaptation of the Trust Game Based on the HoneyComb Paradigm
06:18

The Collective Trust Game: An Online Group Adaptation of the Trust Game Based on the HoneyComb Paradigm

Published on: October 20, 2022

2.1K
New Variations for Strategy Set-shifting in the Rat
09:45

New Variations for Strategy Set-shifting in the Rat

Published on: January 23, 2017

8.3K

Related Experiment Videos

Last Updated: Jul 26, 2025

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
05:30

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

607
The Collective Trust Game: An Online Group Adaptation of the Trust Game Based on the HoneyComb Paradigm
06:18

The Collective Trust Game: An Online Group Adaptation of the Trust Game Based on the HoneyComb Paradigm

Published on: October 20, 2022

2.1K
New Variations for Strategy Set-shifting in the Rat
09:45

New Variations for Strategy Set-shifting in the Rat

Published on: January 23, 2017

8.3K

Area of Science:

  • Computer Science
  • Distributed Systems
  • Blockchain Technology

Background:

  • Blockchain transaction management presents a significant load balancing challenge.
  • Assigning transactions to blocks efficiently is an NP-hard problem, requiring approximate solutions.
  • Existing methods struggle with the complexity of big data concurrency in blockchains.

Purpose of the Study:

  • To develop and evaluate approximate algorithms for blockchain transaction load balancing.
  • To propose a novel block architecture with a 'Balancer' component for efficient scheduling.
  • To address the challenge of big data concurrency in blockchain systems.

Main Methods:

  • Development of nine algorithms based on dispatching rules, randomization, clustering, and iterative methods.
  • Introduction of a new block architecture featuring a 'Balancer' component for automated algorithm selection.
  • Performance evaluation using metrics like average gap, execution time, and best-reached value percentage.

Main Results:

  • Nine algorithms were proposed, offering approximate solutions in remarkable time.
  • The 'Balancer' component integrates these algorithms for polynomial-time scheduling.
  • The best-performing algorithm, 'best-mi-transactions iterative multi-choice', achieved 93.9% accuracy with an average execution time of 0.003 seconds.

Conclusions:

  • The proposed algorithms and architecture effectively address the NP-hard problem of blockchain load balancing.
  • The novel 'Balancer' component optimizes scheduling by selecting the best algorithm dynamically.
  • This work significantly enhances big data concurrency solutions within blockchain frameworks.