首页 > 最新文献

Informs Journal on Computing最新文献

英文 中文
Exact and Approximation Algorithms for Sparse Principal Component Analysis 稀疏主成分分析的精确算法和近似算法
IF 2.1 4区 计算机科学 Q3 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-07-01 DOI: 10.1287/ijoc.2022.0372
Yongchun Li, Weijun Xie
INFORMS Journal on Computing, Ahead of Print.
INFORMS 计算期刊》,印刷版。
{"title":"Exact and Approximation Algorithms for Sparse Principal Component Analysis","authors":"Yongchun Li, Weijun Xie","doi":"10.1287/ijoc.2022.0372","DOIUrl":"https://doi.org/10.1287/ijoc.2022.0372","url":null,"abstract":"INFORMS Journal on Computing, Ahead of Print. <br/>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"68 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141507688","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Efficient Project Scheduling with Autonomous Learning Opportunities 利用自主学习机会进行高效项目调度
IF 2.1 4区 计算机科学 Q3 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-06-27 DOI: 10.1287/ijoc.2023.0107
Alessandro Hill, Thomas W. M. Vossen
INFORMS Journal on Computing, Ahead of Print.
INFORMS 计算期刊》,印刷版。
{"title":"Efficient Project Scheduling with Autonomous Learning Opportunities","authors":"Alessandro Hill, Thomas W. M. Vossen","doi":"10.1287/ijoc.2023.0107","DOIUrl":"https://doi.org/10.1287/ijoc.2023.0107","url":null,"abstract":"INFORMS Journal on Computing, Ahead of Print. <br/>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"88 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141507684","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Satisficing Approach to On-Demand Ride Matching 按需配车的满意度方法
IF 2.1 4区 计算机科学 Q3 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-06-25 DOI: 10.1287/ijoc.2021.0210
Dongling Rong, Xinyu Sun, Meilin Zhang, Shuangchi He
INFORMS Journal on Computing, Ahead of Print.
INFORMS 计算期刊》,印刷版。
{"title":"Satisficing Approach to On-Demand Ride Matching","authors":"Dongling Rong, Xinyu Sun, Meilin Zhang, Shuangchi He","doi":"10.1287/ijoc.2021.0210","DOIUrl":"https://doi.org/10.1287/ijoc.2021.0210","url":null,"abstract":"INFORMS Journal on Computing, Ahead of Print. <br/>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"164 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141507685","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An Efficient Scenario Reduction Method for Problems with Higher Moment Coherent Risk Measures 针对高矩阵相干风险度量问题的高效情景还原法
IF 2.1 4区 计算机科学 Q3 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-06-18 DOI: 10.1287/ijoc.2022.0375
Xiaolei He, Weiguo Zhang
INFORMS Journal on Computing, Ahead of Print.
INFORMS 计算期刊》,印刷版。
{"title":"An Efficient Scenario Reduction Method for Problems with Higher Moment Coherent Risk Measures","authors":"Xiaolei He, Weiguo Zhang","doi":"10.1287/ijoc.2022.0375","DOIUrl":"https://doi.org/10.1287/ijoc.2022.0375","url":null,"abstract":"INFORMS Journal on Computing, Ahead of Print. <br/>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"157 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141507686","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Fusion Pretrained Approach for Identifying the Cause of Sarcasm Remarks 用于识别讽刺话语原因的融合预训练方法
IF 2.1 4区 计算机科学 Q3 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-06-13 DOI: 10.1287/ijoc.2022.0285
Qiudan Li, David Jingjun Xu, Haoda Qian, Linzi Wang, Minjie Yuan, Daniel Dajun Zeng
INFORMS Journal on Computing, Ahead of Print.
INFORMS 计算期刊》,印刷版。
{"title":"A Fusion Pretrained Approach for Identifying the Cause of Sarcasm Remarks","authors":"Qiudan Li, David Jingjun Xu, Haoda Qian, Linzi Wang, Minjie Yuan, Daniel Dajun Zeng","doi":"10.1287/ijoc.2022.0285","DOIUrl":"https://doi.org/10.1287/ijoc.2022.0285","url":null,"abstract":"INFORMS Journal on Computing, Ahead of Print. <br/>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"72 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141507687","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Efficient Nested Simulation Experiment Design via the Likelihood Ratio Method 通过似然比法进行高效嵌套模拟实验设计
IF 2.1 4区 计算机科学 Q3 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-06-12 DOI: 10.1287/ijoc.2022.0392
Ben Mingbin Feng, Eunhye Song

In the nested simulation literature, a common assumption is that the experimenter can choose the number of outer scenarios to sample. This paper considers the case when the experimenter is given a fixed set of outer scenarios from an external entity. We propose a nested simulation experiment design that pools inner replications from one scenario to estimate another scenario’s conditional mean via the likelihood ratio method. Given the outer scenarios, we decide how many inner replications to run at each outer scenario as well as how to pool the inner replications by solving a bilevel optimization problem that minimizes the total simulation effort. We provide asymptotic analyses on the convergence rates of the performance measure estimators computed from the optimized experiment design. Under some assumptions, the optimized design achieves O(Γ1) mean squared error of the estimators given simulation budget Γ. Numerical experiments demonstrate that our design outperforms a state-of-the-art design that pools replications via regression.

History: Accepted by Bruno Tuffin, Area Editor for Simulation.

Funding: This work was supported by the National Science Foundation [Grant CMMI-2045400] and the Natural Sciences and Engineering Research Council of Canada [Grant RGPIN-2018-03755].

Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0392) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2022.0392). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/.

在嵌套模拟文献中,一个常见的假设是实验者可以选择要采样的外部情景的数量。本文考虑的情况是,实验者从外部实体获得一组固定的外部情景。我们提出了一种嵌套模拟实验设计,即通过似然比方法,从一种情景中汇集内部复制来估计另一种情景的条件平均值。在给定外部情景的情况下,我们通过解决一个双级优化问题来决定在每个外部情景下运行多少个内部复制,以及如何汇集内部复制,从而最大限度地减少总的模拟工作量。我们对根据优化实验设计计算出的性能指标估计值的收敛率进行了渐近分析。在某些假设条件下,在仿真预算为 Γ 的情况下,优化设计可使估计值的均方误差达到 O(Γ-1)。数值实验证明,我们的设计优于通过回归汇集复制的最先进设计:由模拟领域编辑 Bruno Tuffin 接受:本研究得到了美国国家科学基金会 [CMMI-2045400] 和加拿大自然科学与工程研究理事会 [RGPIN-2018-03755] 的资助:支持本研究结果的软件可从论文及其补充信息 (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0392) 以及 IJOC GitHub 软件库 (https://github.com/INFORMSJoC/2022.0392) 中获取。完整的 IJOC 软件和数据资源库可从 https://informsjoc.github.io/ 获取。
{"title":"Efficient Nested Simulation Experiment Design via the Likelihood Ratio Method","authors":"Ben Mingbin Feng, Eunhye Song","doi":"10.1287/ijoc.2022.0392","DOIUrl":"https://doi.org/10.1287/ijoc.2022.0392","url":null,"abstract":"<p>In the nested simulation literature, a common assumption is that the experimenter can choose the number of outer scenarios to sample. This paper considers the case when the experimenter is given a fixed set of outer scenarios from an external entity. We propose a nested simulation experiment design that pools inner replications from one scenario to estimate another scenario’s conditional mean via the likelihood ratio method. Given the outer scenarios, we decide how many inner replications to run at each outer scenario as well as how to pool the inner replications by solving a bilevel optimization problem that minimizes the total simulation effort. We provide asymptotic analyses on the convergence rates of the performance measure estimators computed from the optimized experiment design. Under some assumptions, the optimized design achieves <span><math altimg=\"eq-00001.gif\" display=\"inline\"><mrow><mi mathvariant=\"script\">O</mi><mo stretchy=\"false\">(</mo><msup><mrow><mi mathvariant=\"normal\">Γ</mi></mrow><mrow><mo>−</mo><mn>1</mn></mrow></msup><mo stretchy=\"false\">)</mo></mrow></math></span><span></span> mean squared error of the estimators given simulation budget <span><math altimg=\"eq-00002.gif\" display=\"inline\"><mi mathvariant=\"normal\">Γ</mi></math></span><span></span>. Numerical experiments demonstrate that our design outperforms a state-of-the-art design that pools replications via regression.</p><p><b>History:</b> Accepted by Bruno Tuffin, Area Editor for Simulation.</p><p><b>Funding:</b> This work was supported by the National Science Foundation [Grant CMMI-2045400] and the Natural Sciences and Engineering Research Council of Canada [Grant RGPIN-2018-03755].</p><p><b>Supplemental Material:</b> The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0392) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2022.0392). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/.</p>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"184 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141507643","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Stochastic First-Order Algorithms for Constrained Distributionally Robust Optimization 约束分布式鲁棒优化的随机一阶算法
IF 2.1 4区 计算机科学 Q3 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-06-10 DOI: 10.1287/ijoc.2023.0167
Hyungki Im, Paul Grigas
INFORMS Journal on Computing, Ahead of Print.
INFORMS 计算期刊》,印刷版。
{"title":"Stochastic First-Order Algorithms for Constrained Distributionally Robust Optimization","authors":"Hyungki Im, Paul Grigas","doi":"10.1287/ijoc.2023.0167","DOIUrl":"https://doi.org/10.1287/ijoc.2023.0167","url":null,"abstract":"INFORMS Journal on Computing, Ahead of Print. <br/>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"21 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141532126","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Comparisons of Two-Stage Models for Flood Mitigation of Electrical Substations 变电站防洪两阶段模型比较
IF 2.1 4区 计算机科学 Q3 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-06-05 DOI: 10.1287/ijoc.2023.0125
Brent Austgen, Erhan Kutanoglu, John J. Hasenbein, Surya Santoso
INFORMS Journal on Computing, Ahead of Print.
INFORMS 计算期刊》,印刷版。
{"title":"Comparisons of Two-Stage Models for Flood Mitigation of Electrical Substations","authors":"Brent Austgen, Erhan Kutanoglu, John J. Hasenbein, Surya Santoso","doi":"10.1287/ijoc.2023.0125","DOIUrl":"https://doi.org/10.1287/ijoc.2023.0125","url":null,"abstract":"INFORMS Journal on Computing, Ahead of Print. <br/>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"13 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141526693","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Coordinating Charging Request Allocation Between Self-Interested Navigation Service Platforms 协调自利导航服务平台之间的收费请求分配
IF 2.1 4区 计算机科学 Q3 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-06-04 DOI: 10.1287/ijoc.2022.0269
Marianne Guillet, Maximilian Schiffer
INFORMS Journal on Computing, Ahead of Print.
INFORMS 计算期刊》,印刷版。
{"title":"Coordinating Charging Request Allocation Between Self-Interested Navigation Service Platforms","authors":"Marianne Guillet, Maximilian Schiffer","doi":"10.1287/ijoc.2022.0269","DOIUrl":"https://doi.org/10.1287/ijoc.2022.0269","url":null,"abstract":"INFORMS Journal on Computing, Ahead of Print. <br/>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"33 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141253533","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An Enhanced Alternating Direction Method of Multipliers-Based Interior Point Method for Linear and Conic Optimization 基于增强型交替方向乘法的线性和圆锥优化内部点法
IF 2.1 4区 计算机科学 Q3 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-05-31 DOI: 10.1287/ijoc.2023.0017
Qi Deng, Qing Feng, Wenzhi Gao, Dongdong Ge, Bo Jiang, Yuntian Jiang, Jingsong Liu, Tianhao Liu, Chenyu Xue, Yinyu Ye, Chuwen Zhang
INFORMS Journal on Computing, Ahead of Print.
INFORMS 计算期刊》,印刷版。
{"title":"An Enhanced Alternating Direction Method of Multipliers-Based Interior Point Method for Linear and Conic Optimization","authors":"Qi Deng, Qing Feng, Wenzhi Gao, Dongdong Ge, Bo Jiang, Yuntian Jiang, Jingsong Liu, Tianhao Liu, Chenyu Xue, Yinyu Ye, Chuwen Zhang","doi":"10.1287/ijoc.2023.0017","DOIUrl":"https://doi.org/10.1287/ijoc.2023.0017","url":null,"abstract":"INFORMS Journal on Computing, Ahead of Print. <br/>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"75 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141188218","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Informs Journal on Computing
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1