feat(route): add informs #8873

Fatpandac · 2022-01-13T05:43:38Z

该 PR 相关 Issue / Involved issue

完整路由地址 / Example for the proposed route(s)

/informs/mnsc
/informs/orsc

新RSS检查列表 / New RSS Script Checklist

说明 / Note

vercel · 2022-01-13T05:43:43Z

This pull request is being automatically deployed with Vercel (learn more).
To see the status of your deployment, click below or on the icon next to each commit.

🔍 Inspect: https://vercel.com/diy/rsshub/8Tn6JppVNXL5uLvWsRKEBc8yCA85
✅ Preview: https://rsshub-git-fork-fatpandac-feature-informs-diy.vercel.app

github-actions · 2022-01-13T05:45:39Z

Successfully generated as following:

https://rsshub-8hhog83c9-diy.vercel.app/informs/mnsc - Success

    <?xml version="1.0" encoding="UTF-8"?>
<rss  xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"

>
    <channel>
        <title><![CDATA[INFORMS - mnsc]]></title>
        <link>https://pubsonline.informs.org/toc/mnsc/0/0</link>
        <atom:link href="https://rsshub-8hhog83c9-diy.vercel.app/informs/mnsc" rel="self" type="application/rss+xml" />
        <description><![CDATA[INFORMS - mnsc - Made with love by RSSHub(https://github.com/DIYgod/RSSHub)]]></description>
        <generator>RSSHub</generator>
        <webMaster>i@diygod.me (DIYgod)</webMaster>
        
        
        
        <language>zh-cn</language>
        
        <lastBuildDate>Thu, 13 Jan 2022 05:45:36 GMT</lastBuildDate>
        <ttl>5</ttl>
        
        <item>
            <title><![CDATA[Online Learning and Optimization for Revenue Management Problems with Add-on Discounts]]></title>
            <description><![CDATA[<strong> David Simchi-Levi , Rui Sun , Huanan Zhang  </strong><br> <a name="abstract" class="scroll-offset"></a><div class="sectionInfo abstractSectionHeading"><h2 class="
                article-section__title section__title
            " id="d31730e1">Abstract</h2></div><div class="abstractSection abstractInFull"><p>We study in this paper a revenue-management problem with add-on discounts. The problem is motivated by the practice in the video game industry by which a retailer offers discounts on selected <i>supportive</i> products (e.g., video games) to customers who have also purchased the <i>core</i> products (e.g., video game consoles). We formulate this problem as an optimization problem to determine the prices of different products and the selection of products for add-on discounts. In the base model, we focus on an independent demand structure. To overcome the computational challenge of this optimization problem, we propose an efficient fully polynomial-time approximation scheme (FPTAS) algorithm that solves the problem approximately to any desired accuracy. Moreover, we consider the problem in the setting in which the retailer has no prior knowledge of the demand functions of different products. To solve this joint learning and optimization problem, we propose an upper confidence bound–based learning algorithm that uses the FPTAS optimization algorithm as a subroutine. We show that our learning algorithm can converge to the optimal algorithm that has access to the true demand functions, and the convergence rate is tight up to a certain logarithmic term. We further show that these results for the independent demand model can be extended to multinomial logit choice models. In addition, we conduct numerical experiments with the real-world transaction data we collect from a popular video gaming brand’s online store on Tmall.com. The experiment results illustrate our learning algorithm’s robust performance and fast convergence in various scenarios. We also compare our algorithm with the optimal policy that does not use any add-on discount. The comparison results show the advantages of using the add-on discount strategy in practice.</p><p><i>This paper was accepted by J. George Shanthikumar, big data analytics.</i></p></div>]]></description>
            <pubDate>Wed, 12 Jan 2022 00:00:00 GMT</pubDate>
            <guid isPermaLink="false">https://pubsonline.informs.org/doi/abs/10.1287/mnsc.2021.4222</guid>
            <link>https://pubsonline.informs.org/doi/abs/10.1287/mnsc.2021.4222</link>

https://rsshub-8hhog83c9-diy.vercel.app/informs/orsc - Success

    <?xml version="1.0" encoding="UTF-8"?>
<rss  xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"

>
    <channel>
        <title><![CDATA[INFORMS - orsc]]></title>
        <link>https://pubsonline.informs.org/toc/orsc/0/0</link>
        <atom:link href="https://rsshub-8hhog83c9-diy.vercel.app/informs/orsc" rel="self" type="application/rss+xml" />
        <description><![CDATA[INFORMS - orsc - Made with love by RSSHub(https://github.com/DIYgod/RSSHub)]]></description>
        <generator>RSSHub</generator>
        <webMaster>i@diygod.me (DIYgod)</webMaster>
        
        
        
        <language>zh-cn</language>
        
        <lastBuildDate>Thu, 13 Jan 2022 05:45:38 GMT</lastBuildDate>
        <ttl>5</ttl>
        
        <item>
            <title><![CDATA[To Engage or Not to Engage with AI for Critical Judgments: How Professionals Deal with Opacity When Using AI for Medical Diagnosis]]></title>
            <description><![CDATA[<strong> Sarah Lebovitz , Hila Lifshitz-Assaf , Natalia Levina </strong><br> <a name="abstract" class="scroll-offset"></a><div class="sectionInfo abstractSectionHeading"><h2 class="
                article-section__title section__title
            " id="d1781e1">Abstract</h2></div><div class="abstractSection abstractInFull"><p>Artificial intelligence (AI) technologies promise to transform how professionals conduct knowledge work by augmenting their capabilities for making professional judgments. We know little, however, about how human-AI augmentation takes place in practice. Yet, gaining this understanding is particularly important when professionals use AI tools to form judgments on critical decisions. We conducted an in-depth field study in a major U.S. hospital where AI tools were used in three departments by diagnostic radiologists making breast cancer, lung cancer, and bone age determinations. The study illustrates the hindering effects of opacity that professionals experienced when using AI tools and explores how these professionals grappled with it in practice. In all three departments, this opacity resulted in professionals experiencing increased uncertainty because AI tool results often diverged from their initial judgment without providing underlying reasoning. Only in one department (of the three) did professionals consistently incorporate AI results into their final judgments, achieving what we call <i>engaged augmentation</i>. These professionals invested in <i>AI interrogation practices</i>—practices enacted by human experts to relate their own knowledge claims to AI knowledge claims. Professionals in the other two departments did not enact such practices and did not incorporate AI inputs into their final decisions, which we call <i>unengaged</i> “<i>augmentation</i>.” Our study unpacks the challenges involved in augmenting professional judgment with powerful, yet opaque, technologies and contributes to literature on AI adoption in knowledge work.</p></div>]]></description>
            <pubDate>Mon, 10 Jan 2022 00:00:00 GMT</pubDate>
            <guid isPermaLink="false">https://pubsonline.informs.org/doi/abs/10.1287/orsc.2021.1549</guid>
            <link>https://pubsonline.informs.org/doi/abs/10.1287/orsc.2021.1549</link>

docs/en/new-media.md

docs/new-media.md

github-actions · 2022-01-13T06:39:57Z

Successfully generated as following:

https://rsshub-emhph9zpm-diy.vercel.app/informs/mnsc - Success

    <?xml version="1.0" encoding="UTF-8"?>
<rss  xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"

>
    <channel>
        <title><![CDATA[INFORMS - mnsc]]></title>
        <link>https://pubsonline.informs.org/toc/mnsc/0/0</link>
        <atom:link href="https://rsshub-emhph9zpm-diy.vercel.app/informs/mnsc" rel="self" type="application/rss+xml" />
        <description><![CDATA[INFORMS - mnsc - Made with love by RSSHub(https://github.com/DIYgod/RSSHub)]]></description>
        <generator>RSSHub</generator>
        <webMaster>i@diygod.me (DIYgod)</webMaster>
        
        
        
        <language>zh-cn</language>
        
        <lastBuildDate>Thu, 13 Jan 2022 06:39:54 GMT</lastBuildDate>
        <ttl>5</ttl>
        
        <item>
            <title><![CDATA[Online Learning and Optimization for Revenue Management Problems with Add-on Discounts]]></title>
            <description><![CDATA[<strong> David Simchi-Levi , Rui Sun , Huanan Zhang  </strong><br> <a name="abstract" class="scroll-offset"></a><div class="sectionInfo abstractSectionHeading"><h2 class="
                article-section__title section__title
            " id="d31730e1">Abstract</h2></div><div class="abstractSection abstractInFull"><p>We study in this paper a revenue-management problem with add-on discounts. The problem is motivated by the practice in the video game industry by which a retailer offers discounts on selected <i>supportive</i> products (e.g., video games) to customers who have also purchased the <i>core</i> products (e.g., video game consoles). We formulate this problem as an optimization problem to determine the prices of different products and the selection of products for add-on discounts. In the base model, we focus on an independent demand structure. To overcome the computational challenge of this optimization problem, we propose an efficient fully polynomial-time approximation scheme (FPTAS) algorithm that solves the problem approximately to any desired accuracy. Moreover, we consider the problem in the setting in which the retailer has no prior knowledge of the demand functions of different products. To solve this joint learning and optimization problem, we propose an upper confidence bound–based learning algorithm that uses the FPTAS optimization algorithm as a subroutine. We show that our learning algorithm can converge to the optimal algorithm that has access to the true demand functions, and the convergence rate is tight up to a certain logarithmic term. We further show that these results for the independent demand model can be extended to multinomial logit choice models. In addition, we conduct numerical experiments with the real-world transaction data we collect from a popular video gaming brand’s online store on Tmall.com. The experiment results illustrate our learning algorithm’s robust performance and fast convergence in various scenarios. We also compare our algorithm with the optimal policy that does not use any add-on discount. The comparison results show the advantages of using the add-on discount strategy in practice.</p><p><i>This paper was accepted by J. George Shanthikumar, big data analytics.</i></p></div>]]></description>
            <pubDate>Wed, 12 Jan 2022 00:00:00 GMT</pubDate>
            <guid isPermaLink="false">https://pubsonline.informs.org/doi/abs/10.1287/mnsc.2021.4222</guid>
            <link>https://pubsonline.informs.org/doi/abs/10.1287/mnsc.2021.4222</link>

https://rsshub-emhph9zpm-diy.vercel.app/informs/orsc - Success

    <?xml version="1.0" encoding="UTF-8"?>
<rss  xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"

>
    <channel>
        <title><![CDATA[INFORMS - orsc]]></title>
        <link>https://pubsonline.informs.org/toc/orsc/0/0</link>
        <atom:link href="https://rsshub-emhph9zpm-diy.vercel.app/informs/orsc" rel="self" type="application/rss+xml" />
        <description><![CDATA[INFORMS - orsc - Made with love by RSSHub(https://github.com/DIYgod/RSSHub)]]></description>
        <generator>RSSHub</generator>
        <webMaster>i@diygod.me (DIYgod)</webMaster>
        
        
        
        <language>zh-cn</language>
        
        <lastBuildDate>Thu, 13 Jan 2022 06:39:57 GMT</lastBuildDate>
        <ttl>5</ttl>
        
        <item>
            <title><![CDATA[To Engage or Not to Engage with AI for Critical Judgments: How Professionals Deal with Opacity When Using AI for Medical Diagnosis]]></title>
            <description><![CDATA[<strong> Sarah Lebovitz , Hila Lifshitz-Assaf , Natalia Levina </strong><br> <a name="abstract" class="scroll-offset"></a><div class="sectionInfo abstractSectionHeading"><h2 class="
                article-section__title section__title
            " id="d1781e1">Abstract</h2></div><div class="abstractSection abstractInFull"><p>Artificial intelligence (AI) technologies promise to transform how professionals conduct knowledge work by augmenting their capabilities for making professional judgments. We know little, however, about how human-AI augmentation takes place in practice. Yet, gaining this understanding is particularly important when professionals use AI tools to form judgments on critical decisions. We conducted an in-depth field study in a major U.S. hospital where AI tools were used in three departments by diagnostic radiologists making breast cancer, lung cancer, and bone age determinations. The study illustrates the hindering effects of opacity that professionals experienced when using AI tools and explores how these professionals grappled with it in practice. In all three departments, this opacity resulted in professionals experiencing increased uncertainty because AI tool results often diverged from their initial judgment without providing underlying reasoning. Only in one department (of the three) did professionals consistently incorporate AI results into their final judgments, achieving what we call <i>engaged augmentation</i>. These professionals invested in <i>AI interrogation practices</i>—practices enacted by human experts to relate their own knowledge claims to AI knowledge claims. Professionals in the other two departments did not enact such practices and did not incorporate AI inputs into their final decisions, which we call <i>unengaged</i> “<i>augmentation</i>.” Our study unpacks the challenges involved in augmenting professional judgment with powerful, yet opaque, technologies and contributes to literature on AI adoption in knowledge work.</p></div>]]></description>
            <pubDate>Mon, 10 Jan 2022 00:00:00 GMT</pubDate>
            <guid isPermaLink="false">https://pubsonline.informs.org/doi/abs/10.1287/orsc.2021.1549</guid>
            <link>https://pubsonline.informs.org/doi/abs/10.1287/orsc.2021.1549</link>

fredericky123 · 2022-01-13T11:03:45Z

感谢！
不过在Inoreader中的显示是不是有些不够清晰，abstract那里是不是可以优化一下？再次谢谢！

Fatpandac · 2022-01-13T11:08:15Z

感谢！

不过在Inoreader中的显示是不是有些不够清晰，abstract那里是不是可以优化一下？再次谢谢！

我待会儿看看

fredericky123 · 2022-01-13T11:12:19Z

感谢！
不过在Inoreader中的显示是不是有些不够清晰，abstract那里是不是可以优化一下？再次谢谢！

我待会儿看看

提前感谢！

github-actions · 2022-01-13T14:41:25Z

Successfully generated as following:

https://rsshub-h13evl87m-diy.vercel.app/informs/mnsc - Success

    <?xml version="1.0" encoding="UTF-8"?>
<rss  xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"

>
    <channel>
        <title><![CDATA[INFORMS - mnsc]]></title>
        <link>https://pubsonline.informs.org/toc/mnsc/0/0</link>
        <atom:link href="https://rsshub-h13evl87m-diy.vercel.app/informs/mnsc" rel="self" type="application/rss+xml" />
        <description><![CDATA[INFORMS - mnsc - Made with love by RSSHub(https://github.com/DIYgod/RSSHub)]]></description>
        <generator>RSSHub</generator>
        <webMaster>i@diygod.me (DIYgod)</webMaster>
        
        
        
        <language>zh-cn</language>
        
        <lastBuildDate>Thu, 13 Jan 2022 14:41:15 GMT</lastBuildDate>
        <ttl>5</ttl>
        
        <item>
            <title><![CDATA[Online Learning and Optimization for Revenue Management Problems with Add-on Discounts]]></title>
            <description><![CDATA[<strong> David Simchi-Levi , Rui Sun , Huanan Zhang  </strong><br> <a name="abstract" class="scroll-offset"></a><div class="sectionInfo abstractSectionHeading"><h2 class="
                article-section__title section__title
            " id="d42991e1">Abstract</h2></div><br><div class="abstractSection abstractInFull"><p>We study in this paper a revenue-management problem with add-on discounts. The problem is motivated by the practice in the video game industry by which a retailer offers discounts on selected <i>supportive</i> products (e.g., video games) to customers who have also purchased the <i>core</i> products (e.g., video game consoles). We formulate this problem as an optimization problem to determine the prices of different products and the selection of products for add-on discounts. In the base model, we focus on an independent demand structure. To overcome the computational challenge of this optimization problem, we propose an efficient fully polynomial-time approximation scheme (FPTAS) algorithm that solves the problem approximately to any desired accuracy. Moreover, we consider the problem in the setting in which the retailer has no prior knowledge of the demand functions of different products. To solve this joint learning and optimization problem, we propose an upper confidence bound–based learning algorithm that uses the FPTAS optimization algorithm as a subroutine. We show that our learning algorithm can converge to the optimal algorithm that has access to the true demand functions, and the convergence rate is tight up to a certain logarithmic term. We further show that these results for the independent demand model can be extended to multinomial logit choice models. In addition, we conduct numerical experiments with the real-world transaction data we collect from a popular video gaming brand’s online store on Tmall.com. The experiment results illustrate our learning algorithm’s robust performance and fast convergence in various scenarios. We also compare our algorithm with the optimal policy that does not use any add-on discount. The comparison results show the advantages of using the add-on discount strategy in practice.</p><p><i>This paper was accepted by J. George Shanthikumar, big data analytics.</i></p></div>]]></description>
            <pubDate>Wed, 12 Jan 2022 00:00:00 GMT</pubDate>
            <guid isPermaLink="false">https://pubsonline.informs.org/doi/abs/10.1287/mnsc.2021.4222</guid>
            <link>https://pubsonline.informs.org/doi/abs/10.1287/mnsc.2021.4222</link>

https://rsshub-h13evl87m-diy.vercel.app/informs/orsc - **Failed**

    HttpError: Unknown error: {"error":{"code":"504","message":"An error occurred with your deployment"}}

Fatpandac · 2022-01-13T14:46:22Z

@fredericky123 这个似乎是 Inoreader 显示的问题，他会把内容的所有文字不按格式显示出来。
或则你有相关的例子麻烦提供给我参考一下

fredericky123 · 2022-01-13T15:11:27Z

@fredericky123 这个似乎是 Inoreader 显示的问题，他会把内容的所有文字不按格式显示出来。或则你有相关的例子麻烦提供给我参考一下

相关的例子我还真不好找唉这样也能将就看要不只解决 Abstract后面没有空格的那个问题呢？在Abstract后直接加个空格就行

github-actions · 2022-01-13T17:06:28Z

Successfully generated as following:

https://rsshub-ggqw4b3an-diy.vercel.app/informs/mnsc - Success

    <?xml version="1.0" encoding="UTF-8"?>
<rss  xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"

>
    <channel>
        <title><![CDATA[INFORMS - mnsc]]></title>
        <link>https://pubsonline.informs.org/toc/mnsc/0/0</link>
        <atom:link href="https://rsshub-ggqw4b3an-diy.vercel.app/informs/mnsc" rel="self" type="application/rss+xml" />
        <description><![CDATA[INFORMS - mnsc - Made with love by RSSHub(https://github.com/DIYgod/RSSHub)]]></description>
        <generator>RSSHub</generator>
        <webMaster>i@diygod.me (DIYgod)</webMaster>
        
        
        
        <language>zh-cn</language>
        
        <lastBuildDate>Thu, 13 Jan 2022 17:06:24 GMT</lastBuildDate>
        <ttl>5</ttl>
        
        <item>
            <title><![CDATA[Online Learning and Optimization for Revenue Management Problems with Add-on Discounts]]></title>
            <description><![CDATA[<strong> David Simchi-Levi , Rui Sun , Huanan Zhang  </strong><br> <a name="abstract" class="scroll-offset"></a><div class="sectionInfo abstractSectionHeading"><h2>Abstract </h2></div><div class="abstractSection abstractInFull"><p>We study in this paper a revenue-management problem with add-on discounts. The problem is motivated by the practice in the video game industry by which a retailer offers discounts on selected <i>supportive</i> products (e.g., video games) to customers who have also purchased the <i>core</i> products (e.g., video game consoles). We formulate this problem as an optimization problem to determine the prices of different products and the selection of products for add-on discounts. In the base model, we focus on an independent demand structure. To overcome the computational challenge of this optimization problem, we propose an efficient fully polynomial-time approximation scheme (FPTAS) algorithm that solves the problem approximately to any desired accuracy. Moreover, we consider the problem in the setting in which the retailer has no prior knowledge of the demand functions of different products. To solve this joint learning and optimization problem, we propose an upper confidence bound–based learning algorithm that uses the FPTAS optimization algorithm as a subroutine. We show that our learning algorithm can converge to the optimal algorithm that has access to the true demand functions, and the convergence rate is tight up to a certain logarithmic term. We further show that these results for the independent demand model can be extended to multinomial logit choice models. In addition, we conduct numerical experiments with the real-world transaction data we collect from a popular video gaming brand’s online store on Tmall.com. The experiment results illustrate our learning algorithm’s robust performance and fast convergence in various scenarios. We also compare our algorithm with the optimal policy that does not use any add-on discount. The comparison results show the advantages of using the add-on discount strategy in practice.</p><p><i>This paper was accepted by J. George Shanthikumar, big data analytics.</i></p></div>]]></description>
            <pubDate>Wed, 12 Jan 2022 00:00:00 GMT</pubDate>
            <guid isPermaLink="false">https://pubsonline.informs.org/doi/abs/10.1287/mnsc.2021.4222</guid>
            <link>https://pubsonline.informs.org/doi/abs/10.1287/mnsc.2021.4222</link>

https://rsshub-ggqw4b3an-diy.vercel.app/informs/orsc - Success

    <?xml version="1.0" encoding="UTF-8"?>
<rss  xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"

>
    <channel>
        <title><![CDATA[INFORMS - orsc]]></title>
        <link>https://pubsonline.informs.org/toc/orsc/0/0</link>
        <atom:link href="https://rsshub-ggqw4b3an-diy.vercel.app/informs/orsc" rel="self" type="application/rss+xml" />
        <description><![CDATA[INFORMS - orsc - Made with love by RSSHub(https://github.com/DIYgod/RSSHub)]]></description>
        <generator>RSSHub</generator>
        <webMaster>i@diygod.me (DIYgod)</webMaster>
        
        
        
        <language>zh-cn</language>
        
        <lastBuildDate>Thu, 13 Jan 2022 17:06:28 GMT</lastBuildDate>
        <ttl>5</ttl>
        
        <item>
            <title><![CDATA[To Engage or Not to Engage with AI for Critical Judgments: How Professionals Deal with Opacity When Using AI for Medical Diagnosis]]></title>
            <description><![CDATA[<strong> Sarah Lebovitz , Hila Lifshitz-Assaf , Natalia Levina </strong><br> <a name="abstract" class="scroll-offset"></a><div class="sectionInfo abstractSectionHeading"><h2>Abstract </h2></div><div class="abstractSection abstractInFull"><p>Artificial intelligence (AI) technologies promise to transform how professionals conduct knowledge work by augmenting their capabilities for making professional judgments. We know little, however, about how human-AI augmentation takes place in practice. Yet, gaining this understanding is particularly important when professionals use AI tools to form judgments on critical decisions. We conducted an in-depth field study in a major U.S. hospital where AI tools were used in three departments by diagnostic radiologists making breast cancer, lung cancer, and bone age determinations. The study illustrates the hindering effects of opacity that professionals experienced when using AI tools and explores how these professionals grappled with it in practice. In all three departments, this opacity resulted in professionals experiencing increased uncertainty because AI tool results often diverged from their initial judgment without providing underlying reasoning. Only in one department (of the three) did professionals consistently incorporate AI results into their final judgments, achieving what we call <i>engaged augmentation</i>. These professionals invested in <i>AI interrogation practices</i>—practices enacted by human experts to relate their own knowledge claims to AI knowledge claims. Professionals in the other two departments did not enact such practices and did not incorporate AI inputs into their final decisions, which we call <i>unengaged</i> “<i>augmentation</i>.” Our study unpacks the challenges involved in augmenting professional judgment with powerful, yet opaque, technologies and contributes to literature on AI adoption in knowledge work.</p></div>]]></description>
            <pubDate>Mon, 10 Jan 2022 00:00:00 GMT</pubDate>
            <guid isPermaLink="false">https://pubsonline.informs.org/doi/abs/10.1287/orsc.2021.1549</guid>
            <link>https://pubsonline.informs.org/doi/abs/10.1287/orsc.2021.1549</link>

Fatpandac · 2022-01-13T17:08:13Z

@fredericky123 这个似乎是 Inoreader 显示的问题，他会把内容的所有文字不按格式显示出来。或则你有相关的例子麻烦提供给我参考一下

相关的例子我还真不好找唉这样也能将就看要不只解决 Abstract后面没有空格的那个问题呢？在Abstract后直接加个空格就行

Done

fredericky123 · 2022-01-13T17:10:41Z

https://rsshub-ggqw4b3an-diy.vercel.app/informs/mnsc

感谢！

Fatpandac · 2022-01-13T17:13:27Z

https://rsshub-ggqw4b3an-diy.vercel.app/informs/mnsc

感谢！

甭客气

* https://github.com/DIYgod/RSSHub: (123 commits) docs: add mirror en style: auto format docs: fix title Add rss feed for mirror (fix bugs in previous PR for this site) (DIYgod#8742) feat: add 华东理工继续教育学院新闻公告; (DIYgod#8843) docs: fix title style: auto format Add(route): add informs (DIYgod#8873) fix(route): Odaily星球日报 (DIYgod#8707) feat(route): add 管理世界杂志社网络首发 (DIYgod#8880) fix(route): hex-rays news pubDate and author (DIYgod#8202) fix(route): zaker wrong link (DIYgod#8776) fix(route): 人民网 (DIYgod#8649) fix: 修复路由xijiayi图片显示 (DIYgod#8808) feat(route): add LogoNews (DIYgod#8810) feat(route): add TOPYS (DIYgod#8812) feat(route): add agirls (DIYgod#8782) style: auto format docs: fix title Add(route): add 蘋果新聞網 (DIYgod#8821) ...

fredericky123 · 2022-02-15T09:56:37Z

这里的显示有些问题，会出现代码

Fatpandac · 2022-02-15T10:30:01Z

这里的显示有些问题，会出现代码

收到，我提交新 PR 修复

fredericky123 · 2022-02-15T11:31:36Z

收到，我提交新 PR 修复

感谢！

Add(route): add informs

8b83709

vercel bot deployed to Preview January 13, 2022 05:43 View deployment

github-actions bot added the Auto: Route Test Complete Auto route test has finished on given PR label Jan 13, 2022

TonyRL requested changes Jan 13, 2022

View reviewed changes

docs/en/new-media.md Outdated Show resolved Hide resolved

docs/new-media.md Outdated Show resolved Hide resolved

Fix(route): move to journal.md

2a21408

vercel bot deployed to Preview January 13, 2022 06:38 View deployment

vercel bot deployed to Preview January 13, 2022 14:39 View deployment

Fix(route): beautify desc

4bd69ab

Fatpandac force-pushed the feature/informs branch from 72b1000 to 4bd69ab Compare January 13, 2022 17:04

vercel bot deployed to Preview January 13, 2022 17:04 View deployment

DIYgod merged commit b373c24 into DIYgod:master Jan 22, 2022

gadflysu pushed a commit to gadflysu/RSSHub that referenced this pull request Jan 29, 2022

Add(route): add informs (DIYgod#8873)

30433c6

Fatpandac mentioned this pull request Feb 15, 2022

fix(route): informs html code in the description not rendering #9103

Merged

14 tasks

TonyRL changed the title ~~Add(route): add informs~~ feat(route): add informs Feb 15, 2022

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

feat(route): add informs #8873

feat(route): add informs #8873

Fatpandac commented Jan 13, 2022

vercel bot commented Jan 13, 2022 •

edited

github-actions bot commented Jan 13, 2022

github-actions bot commented Jan 13, 2022

fredericky123 commented Jan 13, 2022

Fatpandac commented Jan 13, 2022

fredericky123 commented Jan 13, 2022

github-actions bot commented Jan 13, 2022

Fatpandac commented Jan 13, 2022

fredericky123 commented Jan 13, 2022

github-actions bot commented Jan 13, 2022

Fatpandac commented Jan 13, 2022

fredericky123 commented Jan 13, 2022

Fatpandac commented Jan 13, 2022

fredericky123 commented Feb 15, 2022

Fatpandac commented Feb 15, 2022

fredericky123 commented Feb 15, 2022

feat(route): add informs #8873

feat(route): add informs #8873

Conversation

Fatpandac commented Jan 13, 2022

该 PR 相关 Issue / Involved issue

完整路由地址 / Example for the proposed route(s)

新RSS检查列表 / New RSS Script Checklist

说明 / Note

vercel bot commented Jan 13, 2022 • edited

github-actions bot commented Jan 13, 2022

github-actions bot commented Jan 13, 2022

fredericky123 commented Jan 13, 2022

Fatpandac commented Jan 13, 2022

fredericky123 commented Jan 13, 2022

github-actions bot commented Jan 13, 2022

Fatpandac commented Jan 13, 2022

fredericky123 commented Jan 13, 2022

github-actions bot commented Jan 13, 2022

Fatpandac commented Jan 13, 2022

fredericky123 commented Jan 13, 2022

Fatpandac commented Jan 13, 2022

fredericky123 commented Feb 15, 2022

Fatpandac commented Feb 15, 2022

fredericky123 commented Feb 15, 2022

vercel bot commented Jan 13, 2022 •

edited