Jove
Visualize
联系我们
JoVE
x logofacebook logolinkedin logoyoutube logo
关于 JoVE
概览领导团队博客JoVE 帮助中心
作者
出版流程编辑委员会范围与政策同行评审常见问题投稿
图书馆员
用户评价订阅访问资源图书馆顾问委员会常见问题
研究
JoVE JournalMethods CollectionsJoVE Encyclopedia of Experiments存档
教育
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab Manual教师资源中心教师网站
使用条款与条件
隐私政策
政策

相关概念视频

Randomized Experiments01:13

Randomized Experiments

6.7K
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...
6.7K
Woodward–Hoffmann Selection Rules and Microscopic Reversibility01:34

Woodward–Hoffmann Selection Rules and Microscopic Reversibility

3.0K
Electrocyclic reactions, cycloadditions, and sigmatropic rearrangements are concerted pericyclic reactions that proceed via a cyclic transition state. These reactions are stereospecific and regioselective. The stereochemistry of the products depends on the symmetry characteristics of the interacting orbitals and the reaction conditions. Accordingly, pericyclic reactions are classified as either symmetry-allowed or symmetry-forbidden. Woodward and Hoffmann presented the selection criteria for...
3.0K
Group Design02:01

Group Design

8.9K
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...
8.9K
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

38
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...
38
McNemar's Test01:23

McNemar's Test

126
McNemar's Test is a nonparametric statistical test used to determine if there is a significant difference in proportions between two related groups when the outcome is binary (e.g., yes/no, success/failure). It is beneficial when we have paired data, such as pre-test/post-test designs, where the same subjects are measured under two different conditions. The test is named after the statistician Quinn McNemar, who introduced it in 1947. It is commonly used in situations where subjects are...
126
Statically Indeterminate Problem Solving01:16

Statically Indeterminate Problem Solving

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

您也可能阅读

相关文章

通过共同作者、期刊和引用图与本文相关的文章。

排序
Same author

VHL, transferrin, and erythropoietin in the regulation of hepcidin.

HemaSphere·2025
Same author

Advances on strictly <math></math> -modular IPs.

Mathematical programming·2025
Same author

Error compensated MOF-based ReRAM array for encrypted logical operations.

Dalton transactions (Cambridge, England : 2003)·2024
Same author

Better-than- <math></math> -approximations for leaf-to-leaf tree and connectivity augmentation.

Mathematical programming·2024
Same author

A technique for obtaining true approximations for <i>k</i>-center with covering constraints.

Mathematical programming·2022
Same author

An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint.

Mathematical programming·2022
Same journal

A better-than-1.6-approximation for prize-collecting TSP.

Mathematical programming·2026
Same journal

A <math><mrow><mfrac><mn>4</mn> <mn>3</mn></mfrac></mrow></math> -approximation for the maximum leaf spanning arborescence problem in DAGs.

Mathematical programming·2026
Same journal

An FPTAS for Connectivity Interdiction.

Mathematical programming·2026
Same journal

A first order method for linear programming parameterized by circuit imbalance.

Mathematical programming·2026
Same journal

Tight lower bounds for block-structured integer programs.

Mathematical programming·2026
Same journal

Accelerated first-order optimization under nonlinear constraints.

Mathematical programming·2026
查看所有相关文章

相关实验视频

Updated: May 24, 2025

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

恒定的竞争力随机分配Matroid秘书没有知道Matroid的.

Richard Santiago1, Ivan Sergeev1, Rico Zenklusen1

  • 1Department of Mathematics, ETH Zurich, Raemistrasse 101, 8092 Zurich, Switzerland.

Mathematical programming
|March 3, 2025
PubMed
概括
此摘要是机器生成的。

我们开发了第一个O(1) 竞争算法,用于随机分配的Matroid秘书问题 (RA-MSP),没有先前的Matroid知识. 这提升了在线优化,消除了事先了解完整的母体结构的需要.

关键词:
一个母亲的母亲.在线算法在线算法秘书问题 秘书问题

更多相关视频

The Attentional Set Shifting Task: A Measure of Cognitive Flexibility in Mice
09:15

The Attentional Set Shifting Task: A Measure of Cognitive Flexibility in Mice

Published on: February 4, 2015

27.2K
Making Record-efficiency SnS Solar Cells by Thermal Evaporation and Atomic Layer Deposition
14:01

Making Record-efficiency SnS Solar Cells by Thermal Evaporation and Atomic Layer Deposition

Published on: May 22, 2015

42.7K

相关实验视频

Last Updated: May 24, 2025

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.1K
The Attentional Set Shifting Task: A Measure of Cognitive Flexibility in Mice
09:15

The Attentional Set Shifting Task: A Measure of Cognitive Flexibility in Mice

Published on: February 4, 2015

27.2K
Making Record-efficiency SnS Solar Cells by Thermal Evaporation and Atomic Layer Deposition
14:01

Making Record-efficiency SnS Solar Cells by Thermal Evaporation and Atomic Layer Deposition

Published on: May 22, 2015

42.7K

科学领域:

  • 在线优化在线优化
  • 组合优化的优化.
  • 算法设计 算法设计

背景情况:

  • 在线优化中的Matroid秘书问题 (MSP) 是一个重要的开放问题.
  • 对于MSP变异的现有O(1) - 竞争性算法通常需要事先充分了解底层的母体结构.
  • 随机分配的母体机密问题 (RA-MSP) 具体解决的是随机分配权重的场景.

研究的目的:

  • 为了确定是否有一个O(1) -竞争性算法存在RA-MSP没有先前对matroid的知识.
  • 为了解决Soto和Oveis Gharan和Vondrák关于RA-MSP算法的开放问题.
  • 开发一种新的算法方法来解决有限信息的在线优化问题.

主要方法:

  • 开发了一种算法,首先近似计算了 matroid 的等级密度曲线.
  • 利用学习的等级密度曲线来指导在线设置中的选择过程.
  • 专注于实现O(1)-竞争力,而无需事先的matroid知识.

主要成果:

  • 成功设计并证明了RA-MSP的O(1) -竞争性算法的存在.
  • 这是第一个不需要事先了解母体结构的RA-MSP算法.
  • 该算法适用于任何 matroid,没有对其类的限制.

结论:

  • 这项研究肯定地回答了关于RA-MSP算法的开放问题,而没有事先的matroid知识.
  • 这项工作确立了RA-MSP作为第一个已知的MSP变体,在这些放松条件下具有O(1) 竞争算法.
  • 学习排名密度曲线的新方法为未来的在线优化研究提供了有希望的方向.