[
{
"path": ".github/workflows/ci.yml",
"content": "name: ci\non:\n push:\n branches:\n - master\n pull_request:\n - master\npermissions:\n contents: write\njobs:\n deploy:\n runs-on: ubuntu-latest\n steps:\n - uses: actions/checkout@v4\n with:\n fetch-depth: 0\n - uses: actions/setup-python@v3\n with:\n python-version: 3.x\n - uses: actions/cache@v4\n with:\n key: ${{ github.ref }}\n path: .cache\n - run: pip install mkdocs-material\n - run: pip install mkdocs-glightbox\n - run: pip install mkdocs-git-revision-date-localized-plugin\n - run: pip install pillow cairosvg\n - run: python ./script.py\n - run: mkdocs gh-deploy --force\n"
},
{
"path": "CONTRIBUTING.md",
"content": "# 如何贡献\n\n本文档是开源协同创作的，欢迎用户贡献内容\n\n## Pull Request（推荐）\n\nPR (Pull Request) 是基于 Git 的协同创作方式，允许用户方便地进行贡献内容，允许维护者进行审核。\n\n下面演示通过 GitHub 网站进行无代码 PR 的最佳实践\n\n1. 点击想要更改的页面右上角的编辑图标（铅笔形状），注意编辑选校梯度直接点击`选校梯度`页面编辑按钮\n\n \n\n \n\n2. 初次提交点击`Fork this repository`将仓库 fork 到自己的账户下\n\n \n\n3. 在窗口内使用 Markdown 语法直接进行更改，点击`Propose changes`完成更改\n\n \n\n4. 点击`Create pull request`向`Open-CS-Application.github.io:master`分支发起 Pull Request\n\n \n\n5. 点击`Create pull request`确认创建 Pull Request\n\n \n\n6. 等待 Pull Request 审核通过后，内容会被自动编译并部署到网页，不需要用户进行额外操作。再次提交更新重复步骤 1 即可，第二次提交可以省略步骤 2\n\n \n\n## 通过[QQ 群](https://jq.qq.com/?_wv=1027&k=Ikr0DObs)手动更新\n\n1. 点击想要更改的页面右上角的编辑图标（铅笔形状）\n\n2. 复制文档内容到本地进行更改\n\n3. 群中@群主和管理员提供你更改后的文档\n\n## 评论区\n\n欢迎在评论区讨论，维护者会精选信息编入 pages\n"
},
{
"path": "LICENSE",
"content": "Attribution-NonCommercial-ShareAlike 4.0 International\n\n=======================================================================\n\nCreative Commons Corporation (\"Creative Commons\") is not a law firm and\ndoes not provide legal services or legal advice. Distribution of\nCreative Commons public licenses does not create a lawyer-client or\nother relationship. Creative Commons makes its licenses and related\ninformation available on an \"as-is\" basis. Creative Commons gives no\nwarranties regarding its licenses, any material licensed under their\nterms and conditions, or any related information. Creative Commons\ndisclaims all liability for damages resulting from their use to the\nfullest extent possible.\n\nUsing Creative Commons Public Licenses\n\nCreative Commons public licenses provide a standard set of terms and\nconditions that creators and other rights holders may use to share\noriginal works of authorship and other material subject to copyright\nand certain other rights specified in the public license below. The\nfollowing considerations are for informational purposes only, are not\nexhaustive, and do not form part of our licenses.\n\n Considerations for licensors: Our public licenses are\n intended for use by those authorized to give the public\n permission to use material in ways otherwise restricted by\n copyright and certain other rights. Our licenses are\n irrevocable. Licensors should read and understand the terms\n and conditions of the license they choose before applying it.\n Licensors should also secure all rights necessary before\n applying our licenses so that the public can reuse the\n material as expected. Licensors should clearly mark any\n material not subject to the license. This includes other CC-\n licensed material, or material used under an exception or\n limitation to copyright. More considerations for licensors:\n wiki.creativecommons.org/Considerations_for_licensors\n\n Considerations for the public: By using one of our public\n licenses, a licensor grants the public permission to use the\n licensed material under specified terms and conditions. If\n the licensor's permission is not necessary for any reason--for\n example, because of any applicable exception or limitation to\n copyright--then that use is not regulated by the license. Our\n licenses grant only permissions under copyright and certain\n other rights that a licensor has authority to grant. Use of\n the licensed material may still be restricted for other\n reasons, including because others have copyright or other\n rights in the material. A licensor may make special requests,\n such as asking that all changes be marked or described.\n Although not required by our licenses, you are encouraged to\n respect those requests where reasonable. More considerations\n for the public:\n wiki.creativecommons.org/Considerations_for_licensees\n\n=======================================================================\n\nCreative Commons Attribution-NonCommercial-ShareAlike 4.0 International\nPublic License\n\nBy exercising the Licensed Rights (defined below), You accept and agree\nto be bound by the terms and conditions of this Creative Commons\nAttribution-NonCommercial-ShareAlike 4.0 International Public License\n(\"Public License\"). To the extent this Public License may be\ninterpreted as a contract, You are granted the Licensed Rights in\nconsideration of Your acceptance of these terms and conditions, and the\nLicensor grants You such rights in consideration of benefits the\nLicensor receives from making the Licensed Material available under\nthese terms and conditions.\n\n\nSection 1 -- Definitions.\n\n a. Adapted Material means material subject to Copyright and Similar\n Rights that is derived from or based upon the Licensed Material\n and in which the Licensed Material is translated, altered,\n arranged, transformed, or otherwise modified in a manner requiring\n permission under the Copyright and Similar Rights held by the\n Licensor. For purposes of this Public License, where the Licensed\n Material is a musical work, performance, or sound recording,\n Adapted Material is always produced where the Licensed Material is\n synched in timed relation with a moving image.\n\n b. Adapter's License means the license You apply to Your Copyright\n and Similar Rights in Your contributions to Adapted Material in\n accordance with the terms and conditions of this Public License.\n\n c. BY-NC-SA Compatible License means a license listed at\n creativecommons.org/compatiblelicenses, approved by Creative\n Commons as essentially the equivalent of this Public License.\n\n d. Copyright and Similar Rights means copyright and/or similar rights\n closely related to copyright including, without limitation,\n performance, broadcast, sound recording, and Sui Generis Database\n Rights, without regard to how the rights are labeled or\n categorized. For purposes of this Public License, the rights\n specified in Section 2(b)(1)-(2) are not Copyright and Similar\n Rights.\n\n e. Effective Technological Measures means those measures that, in the\n absence of proper authority, may not be circumvented under laws\n fulfilling obligations under Article 11 of the WIPO Copyright\n Treaty adopted on December 20, 1996, and/or similar international\n agreements.\n\n f. Exceptions and Limitations means fair use, fair dealing, and/or\n any other exception or limitation to Copyright and Similar Rights\n that applies to Your use of the Licensed Material.\n\n g. License Elements means the license attributes listed in the name\n of a Creative Commons Public License. The License Elements of this\n Public License are Attribution, NonCommercial, and ShareAlike.\n\n h. Licensed Material means the artistic or literary work, database,\n or other material to which the Licensor applied this Public\n License.\n\n i. Licensed Rights means the rights granted to You subject to the\n terms and conditions of this Public License, which are limited to\n all Copyright and Similar Rights that apply to Your use of the\n Licensed Material and that the Licensor has authority to license.\n\n j. Licensor means the individual(s) or entity(ies) granting rights\n under this Public License.\n\n k. NonCommercial means not primarily intended for or directed towards\n commercial advantage or monetary compensation. For purposes of\n this Public License, the exchange of the Licensed Material for\n other material subject to Copyright and Similar Rights by digital\n file-sharing or similar means is NonCommercial provided there is\n no payment of monetary compensation in connection with the\n exchange.\n\n l. Share means to provide material to the public by any means or\n process that requires permission under the Licensed Rights, such\n as reproduction, public display, public performance, distribution,\n dissemination, communication, or importation, and to make material\n available to the public including in ways that members of the\n public may access the material from a place and at a time\n individually chosen by them.\n\n m. Sui Generis Database Rights means rights other than copyright\n resulting from Directive 96/9/EC of the European Parliament and of\n the Council of 11 March 1996 on the legal protection of databases,\n as amended and/or succeeded, as well as other essentially\n equivalent rights anywhere in the world.\n\n n. You means the individual or entity exercising the Licensed Rights\n under this Public License. Your has a corresponding meaning.\n\n\nSection 2 -- Scope.\n\n a. License grant.\n\n 1. Subject to the terms and conditions of this Public License,\n the Licensor hereby grants You a worldwide, royalty-free,\n non-sublicensable, non-exclusive, irrevocable license to\n exercise the Licensed Rights in the Licensed Material to:\n\n a. reproduce and Share the Licensed Material, in whole or\n in part, for NonCommercial purposes only; and\n\n b. produce, reproduce, and Share Adapted Material for\n NonCommercial purposes only.\n\n 2. Exceptions and Limitations. For the avoidance of doubt, where\n Exceptions and Limitations apply to Your use, this Public\n License does not apply, and You do not need to comply with\n its terms and conditions.\n\n 3. Term. The term of this Public License is specified in Section\n 6(a).\n\n 4. Media and formats; technical modifications allowed. The\n Licensor authorizes You to exercise the Licensed Rights in\n all media and formats whether now known or hereafter created,\n and to make technical modifications necessary to do so. The\n Licensor waives and/or agrees not to assert any right or\n authority to forbid You from making technical modifications\n necessary to exercise the Licensed Rights, including\n technical modifications necessary to circumvent Effective\n Technological Measures. For purposes of this Public License,\n simply making modifications authorized by this Section 2(a)\n (4) never produces Adapted Material.\n\n 5. Downstream recipients.\n\n a. Offer from the Licensor -- Licensed Material. Every\n recipient of the Licensed Material automatically\n receives an offer from the Licensor to exercise the\n Licensed Rights under the terms and conditions of this\n Public License.\n\n b. Additional offer from the Licensor -- Adapted Material.\n Every recipient of Adapted Material from You\n automatically receives an offer from the Licensor to\n exercise the Licensed Rights in the Adapted Material\n under the conditions of the Adapter's License You apply.\n\n c. No downstream restrictions. You may not offer or impose\n any additional or different terms or conditions on, or\n apply any Effective Technological Measures to, the\n Licensed Material if doing so restricts exercise of the\n Licensed Rights by any recipient of the Licensed\n Material.\n\n 6. No endorsement. Nothing in this Public License constitutes or\n may be construed as permission to assert or imply that You\n are, or that Your use of the Licensed Material is, connected\n with, or sponsored, endorsed, or granted official status by,\n the Licensor or others designated to receive attribution as\n provided in Section 3(a)(1)(A)(i).\n\n b. Other rights.\n\n 1. Moral rights, such as the right of integrity, are not\n licensed under this Public License, nor are publicity,\n privacy, and/or other similar personality rights; however, to\n the extent possible, the Licensor waives and/or agrees not to\n assert any such rights held by the Licensor to the limited\n extent necessary to allow You to exercise the Licensed\n Rights, but not otherwise.\n\n 2. Patent and trademark rights are not licensed under this\n Public License.\n\n 3. To the extent possible, the Licensor waives any right to\n collect royalties from You for the exercise of the Licensed\n Rights, whether directly or through a collecting society\n under any voluntary or waivable statutory or compulsory\n licensing scheme. In all other cases the Licensor expressly\n reserves any right to collect such royalties, including when\n the Licensed Material is used other than for NonCommercial\n purposes.\n\n\nSection 3 -- License Conditions.\n\nYour exercise of the Licensed Rights is expressly made subject to the\nfollowing conditions.\n\n a. Attribution.\n\n 1. If You Share the Licensed Material (including in modified\n form), You must:\n\n a. retain the following if it is supplied by the Licensor\n with the Licensed Material:\n\n i. identification of the creator(s) of the Licensed\n Material and any others designated to receive\n attribution, in any reasonable manner requested by\n the Licensor (including by pseudonym if\n designated);\n\n ii. a copyright notice;\n\n iii. a notice that refers to this Public License;\n\n iv. a notice that refers to the disclaimer of\n warranties;\n\n v. a URI or hyperlink to the Licensed Material to the\n extent reasonably practicable;\n\n b. indicate if You modified the Licensed Material and\n retain an indication of any previous modifications; and\n\n c. indicate the Licensed Material is licensed under this\n Public License, and include the text of, or the URI or\n hyperlink to, this Public License.\n\n 2. You may satisfy the conditions in Section 3(a)(1) in any\n reasonable manner based on the medium, means, and context in\n which You Share the Licensed Material. For example, it may be\n reasonable to satisfy the conditions by providing a URI or\n hyperlink to a resource that includes the required\n information.\n 3. If requested by the Licensor, You must remove any of the\n information required by Section 3(a)(1)(A) to the extent\n reasonably practicable.\n\n b. ShareAlike.\n\n In addition to the conditions in Section 3(a), if You Share\n Adapted Material You produce, the following conditions also apply.\n\n 1. The Adapter's License You apply must be a Creative Commons\n license with the same License Elements, this version or\n later, or a BY-NC-SA Compatible License.\n\n 2. You must include the text of, or the URI or hyperlink to, the\n Adapter's License You apply. You may satisfy this condition\n in any reasonable manner based on the medium, means, and\n context in which You Share Adapted Material.\n\n 3. You may not offer or impose any additional or different terms\n or conditions on, or apply any Effective Technological\n Measures to, Adapted Material that restrict exercise of the\n rights granted under the Adapter's License You apply.\n\n\nSection 4 -- Sui Generis Database Rights.\n\nWhere the Licensed Rights include Sui Generis Database Rights that\napply to Your use of the Licensed Material:\n\n a. for the avoidance of doubt, Section 2(a)(1) grants You the right\n to extract, reuse, reproduce, and Share all or a substantial\n portion of the contents of the database for NonCommercial purposes\n only;\n\n b. if You include all or a substantial portion of the database\n contents in a database in which You have Sui Generis Database\n Rights, then the database in which You have Sui Generis Database\n Rights (but not its individual contents) is Adapted Material,\n including for purposes of Section 3(b); and\n\n c. You must comply with the conditions in Section 3(a) if You Share\n all or a substantial portion of the contents of the database.\n\nFor the avoidance of doubt, this Section 4 supplements and does not\nreplace Your obligations under this Public License where the Licensed\nRights include other Copyright and Similar Rights.\n\n\nSection 5 -- Disclaimer of Warranties and Limitation of Liability.\n\n a. UNLESS OTHERWISE SEPARATELY UNDERTAKEN BY THE LICENSOR, TO THE\n EXTENT POSSIBLE, THE LICENSOR OFFERS THE LICENSED MATERIAL AS-IS\n AND AS-AVAILABLE, AND MAKES NO REPRESENTATIONS OR WARRANTIES OF\n ANY KIND CONCERNING THE LICENSED MATERIAL, WHETHER EXPRESS,\n IMPLIED, STATUTORY, OR OTHER. THIS INCLUDES, WITHOUT LIMITATION,\n WARRANTIES OF TITLE, MERCHANTABILITY, FITNESS FOR A PARTICULAR\n PURPOSE, NON-INFRINGEMENT, ABSENCE OF LATENT OR OTHER DEFECTS,\n ACCURACY, OR THE PRESENCE OR ABSENCE OF ERRORS, WHETHER OR NOT\n KNOWN OR DISCOVERABLE. WHERE DISCLAIMERS OF WARRANTIES ARE NOT\n ALLOWED IN FULL OR IN PART, THIS DISCLAIMER MAY NOT APPLY TO YOU.\n\n b. TO THE EXTENT POSSIBLE, IN NO EVENT WILL THE LICENSOR BE LIABLE\n TO YOU ON ANY LEGAL THEORY (INCLUDING, WITHOUT LIMITATION,\n NEGLIGENCE) OR OTHERWISE FOR ANY DIRECT, SPECIAL, INDIRECT,\n INCIDENTAL, CONSEQUENTIAL, PUNITIVE, EXEMPLARY, OR OTHER LOSSES,\n COSTS, EXPENSES, OR DAMAGES ARISING OUT OF THIS PUBLIC LICENSE OR\n USE OF THE LICENSED MATERIAL, EVEN IF THE LICENSOR HAS BEEN\n ADVISED OF THE POSSIBILITY OF SUCH LOSSES, COSTS, EXPENSES, OR\n DAMAGES. WHERE A LIMITATION OF LIABILITY IS NOT ALLOWED IN FULL OR\n IN PART, THIS LIMITATION MAY NOT APPLY TO YOU.\n\n c. The disclaimer of warranties and limitation of liability provided\n above shall be interpreted in a manner that, to the extent\n possible, most closely approximates an absolute disclaimer and\n waiver of all liability.\n\n\nSection 6 -- Term and Termination.\n\n a. This Public License applies for the term of the Copyright and\n Similar Rights licensed here. However, if You fail to comply with\n this Public License, then Your rights under this Public License\n terminate automatically.\n\n b. Where Your right to use the Licensed Material has terminated under\n Section 6(a), it reinstates:\n\n 1. automatically as of the date the violation is cured, provided\n it is cured within 30 days of Your discovery of the\n violation; or\n\n 2. upon express reinstatement by the Licensor.\n\n For the avoidance of doubt, this Section 6(b) does not affect any\n right the Licensor may have to seek remedies for Your violations\n of this Public License.\n\n c. For the avoidance of doubt, the Licensor may also offer the\n Licensed Material under separate terms or conditions or stop\n distributing the Licensed Material at any time; however, doing so\n will not terminate this Public License.\n\n d. Sections 1, 5, 6, 7, and 8 survive termination of this Public\n License.\n\n\nSection 7 -- Other Terms and Conditions.\n\n a. The Licensor shall not be bound by any additional or different\n terms or conditions communicated by You unless expressly agreed.\n\n b. Any arrangements, understandings, or agreements regarding the\n Licensed Material not stated herein are separate from and\n independent of the terms and conditions of this Public License.\n\n\nSection 8 -- Interpretation.\n\n a. For the avoidance of doubt, this Public License does not, and\n shall not be interpreted to, reduce, limit, restrict, or impose\n conditions on any use of the Licensed Material that could lawfully\n be made without permission under this Public License.\n\n b. To the extent possible, if any provision of this Public License is\n deemed unenforceable, it shall be automatically reformed to the\n minimum extent necessary to make it enforceable. If the provision\n cannot be reformed, it shall be severed from this Public License\n without affecting the enforceability of the remaining terms and\n conditions.\n\n c. No term or condition of this Public License will be waived and no\n failure to comply consented to unless expressly agreed to by the\n Licensor.\n\n d. Nothing in this Public License constitutes or may be interpreted\n as a limitation upon, or waiver of, any privileges and immunities\n that apply to the Licensor or You, including from the legal\n processes of any jurisdiction or authority.\n\n=======================================================================\n\nCreative Commons is not a party to its public\nlicenses. Notwithstanding, Creative Commons may elect to apply one of\nits public licenses to material it publishes and in those instances\nwill be considered the “Licensor.” The text of the Creative Commons\npublic licenses is dedicated to the public domain under the CC0 Public\nDomain Dedication. Except for the limited purpose of indicating that\nmaterial is shared under a Creative Commons public license or as\notherwise permitted by the Creative Commons policies published at\ncreativecommons.org/policies, Creative Commons does not authorize the\nuse of the trademark \"Creative Commons\" or any other trademark or logo\nof Creative Commons without its prior written consent including,\nwithout limitation, in connection with any unauthorized modifications\nto any of its public licenses or any other arrangements,\nunderstandings, or agreements concerning use of licensed material. For\nthe avoidance of doubt, this paragraph does not form part of the\npublic licenses.\n\nCreative Commons may be contacted at creativecommons.org.\n"
},
{
"path": "README.md",
"content": "# 欢迎来到 Open CS Application\n\n[![CC BY-NC-SA 4.0][cc-by-nc-sa-shield]][cc-by-nc-sa] \n[](https://github.com/opencsapp/opencsapp.github.io/subscription)\n[](https://github.com/opencsapp/opencsapp.github.io/fork)\n[](https://github.com/opencsapp/opencsapp.github.io)\n[](https://github.com/xichenpan)\n\n### [opencs.app](https://opencs.app/) | [csmsapp.org](https://csmsapp.org/) | [opencsapp.github.io](https://opencsapp.github.io/)\n\n本站内容开源协同创作，期待你[贡献内容](https://opencs.app/contribute/)。如果你喜欢这个网站，请点亮 :star:Star 支持我们！\n\n欢迎加入社区讨论：\n- [QQ 26Fall 群：195142580](https://qm.qq.com/q/tvYpfwqnOU)\n- [QQ 25Fall 群：336579136（**已满**）](https://qm.qq.com/q/58AfqUcs1W)\n- [QQ 25Fall ②群：676446749](https://qm.qq.com/q/b293aAoC2c)\n- [CCF-A 顶会顶刊投稿交流群 1039880110](https://qm.qq.com/q/aF7f6WwC3K)\n- [~~QQ① 群：466094878~~（**已满**）](http://qm.qq.com/cgi-bin/qm/qr?_wv=1027&k=jyDQE5i1T_Obns8xWxMzab51NqGXm3Sm&authKey=RNkbnwhB01W3L%2BLHPCjza6J7Vl%2FvGV11g80uIPvJtT8SCmCU8DjAEZROCkScCNIE&noverify=0&group_code=466094878)\n- [~~QQ② 群：544855574~~（**已满**）](http://qm.qq.com/cgi-bin/qm/qr?_wv=1027&k=Lw6khzD63SpyFjfzd3xRNJar24Ltsq_k&authKey=Eo%2F5Rfsk7VDsWDTMe6TV61D1otmc4%2BoE%2FfoANBgOZcwklZwBzYz2N1ao13gxoYmi&noverify=0&group_code=544855574)\n- [Discord：https://discord.gg/HeB9QXZdFR](https://discord.gg/HeB9QXZdFR)\n\n[](https://star-history.com/#opencsapp/opencsapp.github.io&Date)\n\n[](https://github.com/opencsapp/opencsapp.github.io/stargazers)\n\n[](https://github.com/opencsapp/opencsapp.github.io/network/members)\n\n### Contributed By\n\n ![](\"https://contrib.rocks/image?repo=opencsapp/opencsapp.github.io\")
\n\n\nOpenCSApp follows [Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License][cc-by-nc-sa]\n\n[![CC BY-NC-SA 4.0][cc-by-nc-sa-image]][cc-by-nc-sa]\n\n[cc-by-nc-sa]: http://creativecommons.org/licenses/by-nc-sa/4.0/\n[cc-by-nc-sa-image]: https://licensebuttons.net/l/by-nc-sa/4.0/88x31.png\n[cc-by-nc-sa-shield]: https://img.shields.io/badge/License-CC%20BY--NC--SA%204.0-lightgrey.svg\n"
},
{
"path": "blogs_list.yml",
"content": "- 22fall申请季总结 by Flash\n- 2023fall CS PhD 美国申请总结 by Flash\n- 北美CS PhD申请回忆 by denghilbert\n- CS PhD&Master F1签证\n- 加拿大study permit安调情况 by Flash\n- 2025fall游戏开发美硕申请总结 by skx\n"
},
{
"path": "docs/2023fall CS PhD 美国申请总结 by Flash.md",
"content": "---\nhide:\n - navigation\n---\n# 2023fall CS PhD 美国申请总结 by Flash\n\nComing Soon, test image upload\n\n\n\n[回到列表 :fontawesome-solid-house:](blog.md){ .md-button }\n"
},
{
"path": "docs/2025fall游戏开发美硕申请总结 by skx.md",
"content": "---\nhide:\n - navigation\n---\n\n## 为什么是游戏开发\n\n在这篇blog将分享我的25fall 游戏设计项目的申请，我的主要申请方向是**游戏开发**。在我的申请过程中，opencs.app这个平台给了我许多帮助，但是我发现站内大多数的文章和评论都是关于更加严格意义上的cs项目，例如AI，算法，而与游戏开发美硕的相关内容比较少，但是我又发现想要去美国做游戏的同学却不在少数，在我完成申请后，找我咨询的学弟学妹真挺不少，于是萌生了写一个blog分享一下我在这个申请过程中的各种磕磕绊绊。\n\n首先，在我看来很多人可能会混淆游戏设计与游戏开发，需要明确的是，**游戏设计**侧重于游戏的规则、玩法及用户体验构思，更偏向创意和艺术；而**游戏开发**则是通过编程和技术将这些设计转化为实际可玩的游戏，它本质上属于计算机科学（CS）领域。我的申请项目正是游戏开发方向的硕士课程，这明确是CS的一个分支。考虑到opencs.app是一个专注于CS美硕申请的分享平台，在这里分享我的游戏开发申请经历，正是基于它作为CS专业一部分的定位，我相信这些经验对关注相关领域的申请者会非常有帮助。\n\n## 我的背景\n\n我的背景其实有点特殊性，首先我本科一个中外合办高校cs。但是申请美硕，中外合办并没有明显优势，按照我和同校同学的经验，我们大概是被当作普通211的学生去看的。其次我并不是个好学生，我的三维并不高，绩点只有3.65，托福99，GRE315（没有提交）。我大多数时间都花在了做各种项目上，一是HCI实验室里担任了三年的RA，做了几个XR严肃游戏，4篇二三作论文发表，2篇在投；二是有两段实习，在初创做过全栈，在外企做过前端。这些项目虽说都不是特别硬核的，但也确实够我填满两面的CV了。\n\n于是我的的申请思路就是，重点突出我的项目经验，突出我的团队合作能力和跨学科能力，弱化我成绩上的劣势。当然这个策略有利有弊。\n\n## 选校List\n\n我会推荐鸡蛋不要放在一个篮子里，因此除了这些游戏开发的项目，我还申请了不少其他cs的项目，但是为了不偏离这个Blog主题，我这里只讨论游戏开发的选校。\n\n| USC 南加大 | MS Game Development | https://www.cs.usc.edu/academic-programs/masters/game-development/ | 录取 | 南加大游戏相关的项目十分丰富，总共多达六个，因此仔细甄别这些项目的特点，找到那个适合你的就十分重要。这个项目是开设在cs学院下的，更加的注重编程，而且可以选到一些传统cs课，可以有机会沉淀代码能力。实习就业机会拉满，毕竟在洛圣都。 |\n| -------------- | ----------------------------------------------------------- | ------------------------------------------------------------ | ----------- | ------------------------------------------------------------ |\n| Duke 杜克 | Game Design, Development & Innovation Master of Engineering | https://masters.pratt.duke.edu/gddi/ | 录取 | Duke新开的游戏项目，放在工学院下，但是技术涉及的不是很深，例如必修的游戏编程这么课涉及面实在太广，有点走马观花。更像是经历一下整个游戏工业的流程。由于Epic 在Duke边上，因此有丰富的实习机会，据说这个项目会直接送游戏大厂的实习，但目前这个就业状况，这个饼实现起来并不容易。 |\n| Upenn 宾大 | MSE in Computer Graphics and Game Technology | https://www.cis.upenn.edu/graduate/program-offerings/mse-in-computer-graphics-and-game-technology/ | 拒绝 | 很老牌的游戏技术项目，但与其说是游戏项目，不如说是个图形学项目。课程很硬，workload极大，官网上说是一年项目，但是几乎没人能在一年内上满这八门课。即使是小白，在这个项目熬出完，也能成为一个合格的图程。 |\n| CMU 卡耐基梅隆 | ETC Master of Entertainment Technology | https://www.etc.cmu.edu/learn/curriculum/ | 录取接offer | 不是工学位也不是理学位，而是全球独一份的master of entertainment technology，很神奇吧。游戏御三家之一，成员组成很多元，有搞技术的也有做美术做策划的。很特殊的是，这个项目不是course-based而是project-based，每个学期一个项目。出来以后你的作品集会很好看。很和我胃口，也是我最后去的项目。再者做项目的同时，可选三门课，我准备全选cmu cs院的，沉淀一下技术。据说这个项目从学生到老师都很会玩，很多样性。 |\n| Utah 犹他 | Master of Entertainment Arts and Engineering | https://games.utah.edu/prospective-students/master-of-entertainment-arts-and-engineering/ | 录取 | 犹他大学的game是名声挺好的，但是听闻就读体验并不是很好。就是比较的boring，因为要阅读大量的游戏研究的论文，并写大量的report。至少作为一个游戏专业，play并不是很多，而是大量的学术。但是听闻游戏业界的前辈说，犹他的毕业生作品集都很扎实，完成度很高。 |\n\n## 关于中介和作品集\n\n中介和作品集是游戏申请中始终绕不开的一件事，因为几乎所有的游戏相关的硕士项目，都要求上交作品集。中介们当然不会浪费这个除了文书，又一个获利机会。刚开始申请的我，也很慌张，作为一个没有一点平面设计的天赋的家伙，我的首选也是找作品集中介。但是在高强度与各种中介对线后，确实感觉到了这个价格有点难以接受。这些作品集中介的服务一般分为两种，一种是作品集全包，从头带你做项目；一种是帮你把你已有的项目重新排版，做成作品集。作品集全包，一般包含老师带着做的四个项目，总费用在8w-10w左右，当然更过分的也有。我一开始刚咨询第一家中介，差点就下决心签全包作品集，幸好被一个做游戏的前辈给劝住了，才多了解了几家。但最后我并没有选择这种全包服务，因为货比三家后，发现这些中介话术其实有点类似了，多多少少带点pua，会说你之前的项目不行，需要提升，然后就会开始给你规划，但是多了解几家以后，你会发现，这些中介的作品集组成大差不差，很公式化，有关卡设计的作品，有偏esg公益性质的严肃有序。根据后面跟游戏前辈们聊天，我们申请偏cs方向的开发，其实并不需要多么fancy的作品集，实际上多参加几个game jam，就可以作为作品集了。因此我后面选择了第二个方式，就是让中介帮我将已有项目重新排版，一个项目3k，现在想来还是蛮贵的，或许自己多花点心思用ppt排版，也能达成类似的效果。\n\n关于文书呢，那是完全不推荐全部交给中介。文书一定一定要自己把控，跟着项目官网一条一条看，每个项目最好都改一遍文书，没有哪个项目的要求是相同的，也不会有一个适合所有项目的文书。\n\n## 最后\n\nAnyway，兜兜转转最后也拿到心仪的offer。也希望大家在后面的申请中，保持信心，走出一个自己的路。\n\n\n\n[回到列表 :fontawesome-solid-house:](blog.md){ .md-button }\n"
},
{
"path": "docs/22fall申请季总结 by Flash.md",
"content": "---\nhide:\n - navigation\n---\n# 22fall申请季总结 by Flash\n\n此贴原发于一亩三分地，后来Flash加签被check 10个月未果，23fall重新申请PhD，记录在[此贴](2023fall CS PhD 美国申请总结 by Flash.md)\n\n## 先说自己\n\n美加混申，主申找工硕士，少量研究型彩票；最终去向Waterloo CS PhD\n\n### 三维\n\nCS@SJTU\n\nGPA 88.26 大三91.03（部分加拿大学校要）\n\nTOEFL 109 (30+28+22+29)\n\nGRE 152+169+3.5\n\n### 软背景\n\n大二一段UF暑研，华人IEEE fellow。做的比较水，没敢去找老板要推荐信，申请季中途被老板反套PhD了（当然这是后话了\n\n两段SJTU校内科研\n\n一段水PRP（SJTU科研参与项目）\n\n一段比较solid，产出一篇一作AAAI borderline转投ACL（2月中稿，中间review结果和acceptance都有和各个项目update，这篇基本是自己一个人搞的），一篇一作follow up在做（这篇是自己一个人搞的，申请时候有SOTA结果，今年打算emnlp投掉）。老板是交大新ap，三巨头组出身大几千引，给了超强推。\n\n一段国内某AI startup intern从21年4月一直做到现在。mentor本科Lecun大组出身百引，给了2页航空母舰推\n\n### 个人规划\n\n核心规划是润，好拿身份为主，搞钱买房为辅。同时希望可以父母团聚移民（父母00年代也一直想通过技术移民/投资移民润，最后没成功\n\n读研规划是要么先美三年opt然后润加；要么直接润加\n\n## 关于选校\n\n选校策略（方法论）\n\n### Motivation\n\n每年选校一般最终会出现几种不满意的情况：\n1. 想去的彩票冲刺一所没中，中的一堆主申保底都不想去\n2. 全聚德\n3. 选校时盲目申请，最后择校发现拒的项目完全送钱，录的项目不适合自己\n\n### 倒三角选校\n\n为了避免以上这些情况，倒三角选校法是非常好用的应对办法。\n\n**TLDR：选校数量彩票>冲刺>保底>=主申，保底留足，彩票多抽，去掉不适合自己的和明显送钱的**\n\n倒三角选校能够成立的意义是因为**难度是波函数**，这里借用一下量子力学的概念（哈哈哈仅用作说明，很可能物理上并不准确）\n\n\n\n每个项目的申请难度就像电子云一样（不过会更高维），我们无法观测到固定的难度，只能观测到一个个的dp。作为一个申请者你的所有申请feature，包括申请年份，软硬背景，文书这些因素联合在一起，能够确定你在空间中的位置（每个feature都是一个维度）。图中各个点就像往年录取的不同的申请人一样，有的部分稠密，可能是这部分申请人的GPA 90+，有的部分稀疏，可能是因为这部分申请人的TOEFL没过百。而径向分布曲线也是这样，单看某一个维度如GPA，录取结果经常是长尾的，录取的大部分人都是中高GPA，尾巴上低GPA也会有少量录取，可能是因为他们的其他背景足够精彩。而且不同项目的申请难度电子云的分布都不同，因为会有不同的申请者和不同的录取偏好。\n\n而我们一般判断自己能不能录取一个项目是根据自己位置来进行的，比如根据dp在各个维度上取一定置信度的bar，然后这些维度的bar可以围成一个bounding box，自己的位置在这个bounding box内，几乎是非常稳的；离这个bounding box偏移不远，录取的概率就不小（因为各个维度的加权方式是不可知的）。\n\n我相信这个模型是选校录取dp非常好的可视化。引入这个模型是为了说明\n\n1. **申请结果的决定因素是多元的**\n\n2. **申请的难度无法用公式确定，我们对申请难度的判断是从dp而来的**\n\n3. **不同项目的申请结果分布是独立的**\n\n这使得我们申请时可以通过多申请彩票和冲刺来提高中奖概率，最简单来说申请年份这一维度就和选校时的dp不同，例如22fall的UIUC MCS比往年扩招不少，身边有很多人后悔没有申请。但这并不是鼓励大家无脑去海投，因为很多学校自己的位置离bounding box太远，甚至每一个维度都弱于录取的bar，完全没有理由被录取，海投会浪费宝贵的精力、推荐信和钱。\n\n落地到自己选校的时候，针对几种不满意的情况我们可以针对性地采取措施\n\n1.想去的彩票冲刺一所没中，中的一堆主申保底都不想去\n\n 倒三角选校，彩票冲刺多于主申保底。每个项目选择之前都要问问自己到底想不想去，做到可以说出自己去的理由。不想去宁愿不申，实际上保底不必是学校，有时候如果保底校都不想去，可以选择gap保底或者工作保底。\n \n2.全聚德\n\n 保底校一定要留足数量，并且确定足够保底。\n \n3.选校时盲目申请，最后择校发现拒的项目完全送钱，录的项目不适合自己\n\n 根据自己的规划去选校，选校之前就要对项目的录取和特点有初步了解。比如GRE不到328去申yale，零实习去申一年项目，找工向去申research master\n\n### 我的选校\n\n结合我的背景和个人规划，我的选校follow了倒三角选校法，最后的结果是主申保底4中4，幸运地中了几个彩票。感觉上是一些top项目反而会关注软背景，一些top大众情人项目申请人太多非常看GPA可能我就无了。体感大多数无target school的MS申请还是**GPA绝对值>本科学校≈软背景**，当然不同项目考虑不同，需要多多了解录取偏好。\n\n#### 选校+Results\n\n彩票：Waterloo CS PhD(offer); Austin ECE-SES(ad); UIUC MCS(ad); UToronto MScAc(ad); Berkeley EECS Meng(rej); CMU MIIS(rej)/MSAII(rej); GaTech MSCS(rej); UPenn CIS(rej); Yale MSCS(rej)\n\n冲刺：Brown MSCS(ad); GaTech CSE(CoC)(rej); CMU ECE/SESV(rej); CMU MSIN(rej); UMich CSE(rej); UCSD CS75(rej); McGill MSc(rej)\n\n主申：UCLA Meng(ad); UCSD EC79(ad)\n\n保底：NEU Seattle MSCS(ad); Tandon MSCS(ad)\n\n## 申请季的故事\n\n申请季的最开始是2021-5-20凌晨跑完实验在床上刷知乎，看到Waterloo POI招生广告，一看这也太match了，马上下床写邮件，四点多发出去了。约着10月份聊一聊。之后几个月继续实习，并投了第一篇AAAI，几乎是一个人做的，非常累，老板和mentor期间给了非常多的支持。AAAI 9月初截稿之后，马上做了一篇follow up的paper，打算投10月的ICASSP。最后performance不是太好，最后等着申请季结束再投了。\n\n10月结束回上海考GT，10月3回的学校，摆烂到10.7，10.10的GRE背了三天单词就上了，居然幸运的321压线过了，作文没看也有3.5。确实运气太好。之后和POI聊了非常满意，后边10.23/10.30/11.6连考了三周TOEFL，详细地写在了这篇帖子 https://www.1point3acres.com/bbs/thread-819063-1-1.html 里，基本就是焦虑四天，复习3天的节奏。所幸最后方法找的不错，在申请季前夕过了。\n\n之后11月就是准备文书和推荐信，老师们都很支持，感谢老板和mentor，还有课程推的老师！这波也prototype出了选校列表。中途把AAAI改投了ACL，保持在投状态hh\n\n12.1申了UofT MScAc Tandon和LA的Meng。然后又赶着改文书做video essay申CMU和12.15一批学校。12.10 MScAc就给了面，特别高兴，因为知道这个项目12月给面基本就稳了，第一个就来加国top授课硕，心想最后只有这个也不亏了。果然面完12.21就给下了offer。之后又加了几所美国top校，删了一堆保底主申。之后又赶了1.15和2.1的ddl。邻近1月末的时候Waterloo POI给了面试，面完觉得还不错，2月中旬等来了unofficial offer。特别开心，当时还没fully prepared for PhD，后边一周和学长、老板还有很多一起申请的朋友聊了，考虑的Waterloo的非常面向工业界的政策，以及POI人nice，工业界connection和个人能力都很强，觉得确实是很合适的选择，一周之后就口头和老板说接了。\n\n之后陆陆续续来了一些offer和n多拒信。3月末的时候Waterloo发了official offer，和POI最终聊了一次在系统上接了。到今天为止结果也出的七七八八，没出的项目基本都是已经有过一波ad，大概率默拒了。SJTU CS系很多背景都不错的小伙伴也都是冲刺彩票拒了不少，然后零星中了几个大彩票，最后都有很好的去处，所以说一个人的命运啊，不仅要靠个人努力，更要靠花钱random。\n\n现在楼主正在享受本科最后的时光，却赶上了上海封城。所幸加签不用面签，已经交了网申买了机票，等待早日解封指纹体检，然后八月出发了。回想申请季还是很魔幻，快整一年前的邮件，中间的chat，面试，offer，没想到最后真的去了水卢。\n\n希望未来五年PhD科研顺利，PR顺利！\n\n## 经验\n\n**早做准备**\n\n**多找信息**\n\n**降低预期**\n\n## 一些致谢\n\n感谢本科老板mentor和帮忙写推荐信的老师！感谢POI捞我\n\n感谢22fall一起申请的小伙伴们\n\n关于申请过程中的信息素养，21fallSJTU的学长有一篇很好的帖子，大家可以去参考https://www.1point3acres.com/bbs/thread-761193-1-1.html\n\nPhD会做Multimodal & knowledge，欢迎同道多多交流！！\n\n[回到列表 :fontawesome-solid-house:](blog.md){ .md-button }\n"
},
{
"path": "docs/BCS@UBC.md",
"content": "## 录取偏好\n\n注意这个是本科第二学位，不是硕士学位。同时录取加拿大本地生和国际生，要求你已经有一个本科学位。\n列出这个项目是因为这是一个比较好的转码项目，教学节奏和教学质量完全等同于在 UBC 本科学习 CS。\n与其他 accelerated 的项目相比学习的 CS 知识更扎实。适合有加拿大 PR 并且想转码的人。也有\n一些国际生选择这个项目并且成功转码上岸之后通过 EE 拿到 PR。\n\n## 代表性 dp\n\n## 网申备注\n\n可以上 https://www.cs.ubc.ca/students/undergrad/degree-programs/bcs-program-second-degree \n查找具体信息\n\n## 项目特点\n\n- 由于这个是本科第二学位不是硕士学位，所以没有BCPNP\n- 毕业之后有三年的开放工签\n- 和其他 UBC 的本科生一起上 CS 课\n- 可以在项目中途申请 co-op 实习\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/Big Data@SFU.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n985 80+ 可以尝试\n\n## 网申备注\n\n- 不允许使用 Interfolio Dossier 提交推荐信。\n- 推荐信发送系统可能有点问题，有时候老师邮箱收不到。可能得删除推荐人重发。\n- 托福/雅思/GRE无需提前送分，申请时仅需上传pdf语言成绩单，拿到con offer后再送分。\n\n## 项目特点\n\n- 西海岸 top2，带 Co-op，比较 mle 向， 允许defer\n- BCPNP\n- 23Fall开始项目分裂成三个子项目（针对不同 track）了，~~且没看出3个track bar的区别~~ **(24fall bcpnp 3.19新政前bar略高于另外两个track)**，都申请的话需要分别交申请费（23fall、24fall存在调剂优惠，会发问卷调查），分别为：\n - Master of Big Data\n - [Master of Cybersecurity](./Cybersecurity%40SFU.md)\n - [Master of Visual Computing](./VC%40SFU.md)\n- Co-op可以4个月（16个月毕业）或8个月（20个月毕业）。根据学校提供的2024年三月底的Co-op数据：_\"Current Co-op placement in BD programs (Cohort 2023) is 35%\"_。Co-op如果summer没找到fall可以接着找。\n- \n\n## 申请季实时信息\n- 24fall bcpnp新政出来前bar明显高于另外两个track\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/CAS MEng@McMaster.md",
"content": "## 录取偏好\n需要套磁老师，比较看运气和眼缘，但只要能套磁到老师就能被录。\n\n## 代表性 dp\n\n## 网申备注\n需要两篇学术推荐信.\n\n## 项目特点\noinp +8分。coop可以分段做很自由，麦马有自己的Coop平台。虽然是MEng但是最好套磁（offer上会有导师名字），毕业需要跟导师做project。\n\n可以defer两个term。\n\n导师入学后允许更换\n\n## 申请季实时信息\n24fall bar不算太高。\n## 介绍帖\n[加拿大McMaster CAS MEng 22fall就读体验](https://zhuanlan.zhihu.com/p/614940405) \n[McMaster研究生新生手册](https://mactest1.readthedocs.io/en/latest/)\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }"
},
{
"path": "docs/CE MEng@TAMU.md",
"content": "## 录取偏好\n\n国际生比例和主流学校比较低\n\n## 代表性 dp\n\n【23fall】 华五 gpa3.41 两段实习 无GRE ad\n\n## 网申备注\n\n## 项目特点\n\nCSE系下和MCS对标的项目，课程方面除了多两门ECE的课其他与MCS基本无异。\n时长自由，可延毕（i20默认给三年）。带coop（支持学期内实习）。\nCSE下项目互转较为自由，Meng项目可以随意转MCS/MSCE/MSCS，和MCS一样性价比极高的项目。\n由于是大公立学校，学生非常多，TA语言要求高，不易申请\nTAMU想找到科研机会很容易。但是如果想做System方向，TAMU相关教授较少（截止至2024春季）\n\n\n## 申请季实时信息\n\n一般三月中旬以后开奖\n\n23fall目前bar不算太高\n\n## 介绍帖\n\nhttps://engineering.tamu.edu/cse/academics/degrees/graduate/meng.html\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/CE@NYU Tandon.md",
"content": "## 录取偏好\n\nEE 背景友好 / 转码友好\n\n985相当友好，3.0以上基本都收\n\n## 代表性 dp\n\nhttps://cdn.lukerr.com/nyu/tandon.html 2020Fall Tandon 录取报告包括（CS/CE/EE），非常详细\n\n## 网申备注\n\n美本以外需要GRE, 两封推荐信即可\n\n## 项目特点\n\n1. 选课可以全部选软课，不用选硬件\n2. 有奖学金\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/CGGT@UPenn.md",
"content": "## 录取偏好\n\n有 graphics 背景是加分项不是必需\n\n## 代表性 dp\n\n【22fall】SCUT 89+/100 前 3% 有图形学背景 一段实习，三段科研\n\n## 网申备注\n\n## 项目特点\n\ncggt workload 非常非常大，往年基本都是 1.5-2 年毕业；upenn dual 很容易，dual 的话通常是 3 年毕业\n\n21fall 找工结果还可以：去 Santa Monica studio、Nvidia、Apple、Waymo、R star 的都有\n\n## 申请季实时信息\n\n22fall offer holder 群聚集很多喜欢图形学的人 :)\n\n占位费 300 刀\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/CM@Cornell Tech.md",
"content": "## 录取偏好\n\n比较喜欢录取有创业想法的同学，文书与面试尽量往 enterpreneurship 上面靠\n\n转码较友好\n\n## 代表性 dp\n\n## 网申备注\n\n支持 Interfolio\n\n## 项目特点\n选 Cornell Tech 的 CS 课很自由，且选满一定量的 CS 课后会发一个 CS 的 [Certificate](https://cornell.qualtrics.com/jfe/form/SV_3aSQZFFOqZa0D2d)\n\n两年的项目\n\n从 24 Spring 开始，由于招来了新的 Professor，Cornell Tech 也开始开设 System 相关课程了 （e.g., Networked and Distributed Systems），不再像以前一样只有 ML 的课程了\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/CNAME",
"content": "opencs.app\n"
},
{
"path": "docs/CS Align@NEU.md",
"content": "## 录取偏好\n\n零基础转码，录取人的背景很多元；\n\n看重文书，3 篇 essays 要好好写。\n\n## 代表性 dp\n\n很多二硕。\n\n## 网申备注\n\n不需要申请费；rolling 录取，申请材料按照提交时间分成多个批次进行审核。申请提交的时间越早越好。据观察，第一轮录取率最高，第二轮录取率最低。\n\n## 项目特点\n\n有 Co-op，可以找两次暑期实习，上岸的容错率非常高。\n\n## 申请季实时信息\n\n已经是几乎人人都申的项目了，所以并不建议拿 NEU 作为保底，很容易不幸地被随机拒掉。尽早提交（比如项目一开放申请就提交）可以提高自己的材料被审核的概率。\n\n今年 (22Fall)CS Align 可以说是杀疯了，报的人特别多，拒的也特别多。达到 qualify 之后的录取非常随机，背景更好不会带来更高的录取率\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/CS General@NEU.md",
"content": "## 录取偏好\n\n十分玄学，薛定谔的 oq。原因是申请人数太多\n\n## 代表性 dp\n\n## 网申备注\n\n23fall开始不需要GRE，语言划线TOEFL：100、雅思：7.5、Duolingo：125\n\n网申系统bug很多，出现问题记得及时找小蜜修复，要不然容易被rolling到后面\n\n## 项目特点\n\n有 coop，找工数据非常华丽。最火的三个校区是 Seattle SV 和 Boston，Boston 课程质量最好，本地工作机会略少；Seattle 校园非常小，和 Amazon 在同一层楼，得益于 Seattle 当地 UW 没有 MSCS，找工情况非常好；SV 和 Seattle 优劣势类似，但当地学校更多，公司也更多。campus 之间可以转，此外还有 Portland（缅因州）/Vancouver 校区，其中波特兰校区一般带奖，温哥华校区带bcpnp，移民好选择。\n\n允许defer，2023年有一大批录了这个项目的人defer。\n\n## 申请季实时信息\n\n22fall 诸神黄昏，非常 random，想去尽量早交（11 月）\n\nPortland Campus 22fall 有 tuition 减免\n\n21fall 在 11 月末起左右提交就会被发配 Vancouver 了。\n\n23fall开设Oakland（加州）校区，有校园且奖学金机会较多。\n\n23fall玄学加剧，bg方差极大，抽就完事了。\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/CS Meng@Cornell Tech.md",
"content": "## 录取偏好\n\n陆本不友好，录取数量少，详情参见评论区高赞。\n\n## 代表性 dp\n\n## 网申备注\n\n需要交 WES 或其它成绩认证，与本校不同的是不卡口语。 \n和所有的CT Program一样有一个大概二十分钟左右的机面，网上可以搜到题库。\n\n## 项目特点\n\n优点：\n1. 地理位置位于纽约罗岛，交通便利。 \n2. 宿舍价格在纽约属于便宜的一档，1B，2B，3B，STUDIO,都有，价格在1.5k-2.5k一个月左右。 \n3. 课程内容整体比较新颖，class size 小。 \n\n缺点：\n1. 一年的项目，不可延期，找工压力很大，而且今年（2023）学校的应聘会其实帮助很小，第一是体量小，第二是整体来的公司很多也是偏商业或者金融那一块，综合资源不如本部的好。\n2. 对住校外的学生地理条件不是很友好，学校停车难，贵，今年开始纽约翻修F地铁，应该从24年春开始就会投入运营，推荐坐地铁。\n3. 贵，很多课程可能还在实践和调整，导致评分和教学效果有时候会和预期的不太一样。\n\n补充：\n1. 伊萨卡 cs meng 可以延期，康泰克 CM 2 年可以实习。 \n2. 学校宿舍便宜但是需要提前安排时间抢。 \n\n备注：Meng CS两个学期都有Studio，第一学期的Studio是选课题然后系统分配，第二学期的Studio是自己找人组队。实际上Studio对个人无论学术还是职业的帮助都相对比较有限。\n\n## 申请季实时信息\n\n## 介绍帖\n[Cornell CS MEng(Tech) 入学找工体验](https://www.1point3acres.com/bbs/thread-953015-1-1.html)\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/CS Meng@Cornell.md",
"content": "## 录取偏好\n\n陆本录取极少，比较黑洞\n\n## 代表性 dp\n\n【22fall】SJTU 密院 dd 两篇顶会二作在投 两段实习 录取\n\n## 网申备注\n\n支持 Interfolio\n\n## 项目特点\n\nclass size 小，一年项目，可以延期\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/CS Meng@VT.md",
"content": "## 录取偏好\nNCR（DC华盛顿）校区录取率较高，适合保底\n## 代表性 dp\n【23fall】 华五 gpa3.3 无GRE ad\n## 网申备注\n只要一封推荐信\n## 项目特点\n找工项目，30学分，带coop\n## 申请季实时信息\n3.1前rolling录取\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/CS PhD&Master F1签证.md",
"content": "---\r\nhide:\r\n - navigation\r\n---\r\n# CS PhD&Master F1签证\r\n\r\n*2023-3-25*\r\n\r\n\r\n\r\n| [](https://denghilbert.github.io/blog/images/issue.png) | [](https://denghilbert.github.io/blog/images/yonghe.jpg) |\r\n| :----------------------------------------------------------: | :----------------------------------------------------------: |\r\n| 水过5年F1 | 拍摄于雍和宫 |\r\n\r\n\r\n\r\n## Overview\r\n\r\n本攻略为一套整合资料，CS专业check概率极高，本人应该是运气爆棚。由于我是23Fall最早一批面签的选手，在这里只是希望把签证所有步骤整合，方便23Fall的小伙伴以及学弟学妹快速准备签证。\r\n\r\n今年行情比较奇怪，首先美国官方的面签提前时间从提前120天变长到365天，然后又遇上自己大陆CS PhD面签秒过这种几乎从未出现的case。\r\n\r\n结论：有可能今年水过可能性比较大？我后续会持续关注周围PhD同学面签情况，然后过来update。 \r\n\r\n别上来直接问我咋5年呜呜呜，我也不知道，问就是运气，能做到的就是好好准备材料，以及一些面签策略。\r\n\r\n\r\n\r\n1. Apply：获取I20并支付SEVIS费用\r\n2. Complete Form：完成DS160\r\n3. Schedule：预约面签\r\n4. Show Intent：阐述非移民倾向\r\n5. Gather Docs：准备面签材料\r\n6. Go to Interview：面签\r\n7. Review Visa：Get！！！\r\n\r\n**一些可能有帮助的Tips**：\r\n\r\n1. [查询最早美签](https://tuixue.online/visa/)，网站还是有一丢丢延迟，但拿来参考预约时间很有帮助。\r\n2. 面签之前去雍和宫拜一下，有一丢丢灵（doge\r\n3. 沈阳不行，整体上应该是北京≈上海>广州\r\n4. 我用于面签的[CV](https://github.com/denghilbert/denghilbert.github.io/blob/main/blog/images/qian/resume.md)和[Research Proposal/Study Plan](https://github.com/denghilbert/denghilbert.github.io/blob/main/blog/images/qian/Research%20Proposal%20.md)结构（~~还没挂出来，让我mask一些个人信息。。。~~）\r\n5. 参考一下[官方给的要求](https://www.ustraveldocs.com/cn/cn-niv-typefandm.asp)以及模板[CV](https://www.ustraveldocs.com/Resume%CC%81%20LCW%20Edits-1.pdf)和[Research Proposal/Study Plan](https://www.ustraveldocs.com/cn/Research%20or%20Study%20Plan-1.pdf)\r\n6. 接上一条，自己的材料一定不要出现[Technology Alert List](https://www.bu.edu/isso/files/pdf/tal.pdf)上面的东西，老板的简历Master尽量避免\r\n7. PhD，面签的时候记得强调，拿的是全奖\r\n8. 归国计划和原因可以参考：归国创业，独生子女，国内房产，海归找教职\r\n9. 面签的材料，可以多打印一份，一方面防止弄丢了，另一方面面签时直接一摞放桌子上显得准备充分（doge\r\n10. 不用穿很正式，我面签那天里面还是睡衣。。。\r\n11. 不要提任何在北美实习的潜在机会（e.g., Why School的时候说这个学校和工业界联系紧密）\r\n12. 记得把scholar和主页关了\r\n13. 想到再加\r\n\r\n\r\n\r\n\r\n\r\n## I20获取\r\n\r\n每个学校在你accept offer之后一般会要求提交：\r\n\r\n1. 护照照片页的扫描件。\r\n2. 财产证明（PhD如果带家属的话也是需要提交的）。\r\n3. $8 visa document processing fee（我不知道其他学校是不是这个价格）\r\n\r\n然后就是等I20了，大家可以发邮件催一下学校。I20处理我见过效率到12h搞定，也有拖到4月初才弄的，我提交完上述资料后约一周收到。\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n## SEVIS缴费\r\n\r\nSEVIS费一定要保证签证面签前三个工作日缴纳。\r\n\r\n 流程：\r\n\r\n1. 登陆[官网](https://www.fmjfee.com/)\r\n\r\n2. 点 “PAY I 901 FEE”\r\n\r\n3. 填好个人信息\r\n\r\n \r\n\r\n4. “Form Type Form“ 选I20\r\n\r\n \r\n\r\n5. 各种信息。。。\r\n\r\n \r\n\r\n \r\n\r\n \r\n\r\n6. 学校代码去找I20上面那个214F\r\n\r\n \r\n\r\n \r\n\r\n \r\n\r\n7. 支付并打印缴费确认\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n## DS160填写\r\n\r\n如实填写！实时保存，动不动就超时出去。。。 \r\n\r\n流程：\r\n\r\n1. 登陆[官网](https://ceac.state.gov/GenNIV/Default.aspx)\r\n\r\n2. 注册一波\r\n\r\n \r\n\r\n3. 记住生成的application ID，后面retrieve的时候会用到，AA开头\r\n\r\n \r\n\r\n4. Personal 1，其中[名字电码](http://code.mcdvisa.com/)上网查询即可\r\n\r\n \r\n\r\n \r\n\r\n \r\n\r\n5. Personal 2\r\n\r\n \r\n\r\n6. Travel\r\n\r\n \r\n\r\n \r\n\r\n \r\n\r\n \r\n\r\n \r\n\r\n7. Travel Companions\r\n\r\n \r\n\r\n8. Previous U . Travel，如实填写即可。如果5年内又美国出入境记录。这个记录可以查看自己的签证页，也可以查询自己的[I94](https://i94.cbp.dhs.gov/I94/#/history-search)\r\n\r\n \r\n\r\n \r\n\r\n \r\n\r\n \r\n\r\n \r\n\r\n9. Address and Phone，后面social media填一个僵尸账号，经常使用/发表各种言论的media就别写上去了\r\n\r\n \r\n\r\n \r\n\r\n \r\n\r\n \r\n\r\n \r\n\r\n10. Passport\r\n\r\n \r\n\r\n \r\n\r\n \r\n\r\n11. U.S. Contact，其中“ School Official to Contact ”在I20上可以找到\r\n\r\n \r\n\r\n \r\n\r\n \r\n\r\n \r\n\r\n \r\n\r\n12. Family，如果有immediate relatives或者其他relatives就还是选yes，别隐藏信息万一查出来永久拒签很麻烦，面签的时候问到这一点就直接说和他们不是非常亲，很久没有联系了即可。\r\n\r\n \r\n\r\n \r\n\r\n \r\n\r\n13. Work/Education/Training Present，准备签证的时候，不管是否毕业就在“primary occupation”直接选student然后写清楚当前“Student”即可，Explain部分，在读就说正在学CS专业，毕业了就说获得CS学位。如果是gap了就选“not employed”。\r\n\r\n \r\n\r\n14. Work/Education/Training Previous，只用写个高中就行，course of study写个academic。\r\n\r\n \r\n\r\n15. Work/Education/Training Additional，如实填写过去5年旅游，后面几个安全问题全no就行。\r\n\r\n \r\n\r\n \r\n\r\n \r\n\r\n16. Security and Background，全部选NO！！！\r\n\r\n17. Student/Exchange Visa Additional Contact，找俩国内非亲属关系的朋友填下\r\n\r\n \r\n\r\n18. Student/Exchange Visa SEVIS，按照I20上填就行，“Course of Study”那里填I20上的major\r\n\r\n19. 上传照片，51x51mm，白底，不能带眼镜\r\n\r\n \r\n\r\n20. 最后把生成的确认页打印出来，顺便选个“Email Confirmation”备份\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n## F1面签预约\r\n\r\n流程\r\n\r\n1. 登陆[官网](https://atlas.my.salesforce-sites.com/?language=Chinese (Simplified)&country=China)\r\n\r\n2. 注册新账户进入页面\r\n\r\n \r\n\r\n3. 点“新的签证时间 安排面谈时间”，依次填写即可\r\n\r\n \r\n\r\n \r\n\r\n \r\n\r\n \r\n\r\n \r\n\r\n4. 准确填写个人信息，不添加同行\r\n\r\n \r\n\r\n \r\n\r\n \r\n\r\n5. 各种信息。。。\r\n\r\n6. 最后选择寄送地址，据说中信取件更快，可以选离家近的中信\r\n\r\n7. 缴费完成预约面签，这里用下别人的图，因为要缴费才能进去。。。\r\n\r\n \r\n\r\n8. 打印确认页即可\r\n\r\n \r\n\r\n**刷更靠前的面签时间**\r\n\r\n1. 后期可能有人需要刷下这个东西，但是需要注意，千万不要连续多次进入预约面签的日历（进入日历才计数），可能一天5 6次就会被封号2 3天，特别麻烦。。。\r\n\r\n2. 因此可以开个小号（随便填个信息），再重新上面预约面签的步骤，如下图，左边会出现最早时间，如果看到更早的再换大号约就行。\r\n\r\n \r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n## 非移民倾向\r\n\r\n几个点帮助阐述非移民倾向：\r\n\r\n1. 准备几句话来解释：program结束后你会回来。比如教职很好找给的多，你是独生子要履行义responsibility，等等大家自由发挥。\r\n2. 房产证带着，证明国内财产。\r\n3. 带好银行存款证明（虽说PhD不需要财产证明，但依然可以带着用于convince VO）\r\n4. 如果有employer（周围拥有私企的亲戚或朋友，虽说估计也挺难遇到能这样做的小伙伴。。。）证明在你毕业后雇佣你，写一个纸条/offer/证明带着。\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n## 面签材料\r\n\r\n这里列一个清单，大家可以参考：\r\n\r\n**几乎一定会用到**\r\n\r\n1. 入境后半年依然有效的护照原件\r\n2. I20\r\n3. DS160确认页\r\n4. SEVIS缴费单，I901\r\n5. 面签预约确认单\r\n6. 身份证，北京进场是需要这个的，不清楚其他地方要不要\r\n7. Research Proposal/Study Plan\r\n8. 简历\r\n\r\n**可能会看。。。**\r\n\r\n1. 托福GRE成绩单\r\n2. 学校课程List，一般官网能查到\r\n3. 学校的offer\r\n4. 项目介绍，一般直接搜XXX university PhD/Master program点进去有about之类的，这一页打出来\r\n5. 老板的简历，Master没老板就去department的faculty里面找一个不敏感的（AAAI/CVPR/ICLR/IROS满页都是的那种就不要选了），PhD如果rotation，也是去找个不敏感的写上去\r\n6. 发表过的论文（能在网上检索到）\r\n\r\n面签之前，把上面材料归类放好，熟悉一下位置，面签的时候能快速找到。\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n## 面签\r\n\r\n我预约的是8点半的面签，7点10分就排在门口了，大概排了一个半小时轮到我到窗口面签，每一个环节都会有人引导不用担心走错。 \r\n\r\n由于我面签比较早，周围没有很多出国留学的学生，大都是办理旅游签证。估计VO听那么多人讲中文也烦了，突然面到一位能用英文流利交流的选手hhh。\r\n\r\n\r\n\r\n\r\n\r\n## Get！！！\r\n\r\n过签之后当场给你一个蓝色的条子，然后可以去[官网](https://ceac.state.gov/CEACStatTracker/Status.aspx)查看状态，会得到Approve，第二天一看就变成Issued了，还是非常高效迅速。\r\n\r\n如果查到refused，不用担心这个就是check，把材料补完了等待后就会转Ap，最终Issued。\r\n\r\n\r\n\r\n## 希望大家都遇到善良VO，顺利拿下！\r\n\r\n[回到列表 :fontawesome-solid-house:](blog.md){ .md-button }\r\n"
},
{
"path": "docs/CS-PMP@Wisc.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n学费极其便宜，大概一年学费只要 3 万出头（大概 18 个学分的钱），如果 ta 或者 ra 的话更加便宜\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/CS28@USC.md",
"content": "## 录取偏好\n\n建议科班申请，只看 GPA(按学校分组, 把不同学校申请者按GPA排序, 然后从高往低发offer)\n\n## 代表性 dp\n\n## 网申备注\n\n推荐信 optional，不会看，不交不影响录取。SoP optional 但还是要写\n\n## 项目特点\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/CS37@USC.md",
"content": "## 录取偏好\n\nGPA 狂魔，建议 3.7+申请，高 gpa t90+就够了\n\n喜欢理工科背景，文商转码不友好。\n\n## 代表性 dp\n\n## 网申备注\n\n提前批有一个项目可以免费，科班可以同时申一下，防止意外\n\n## 项目特点\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/CS75@UCSD.md",
"content": "## 录取偏好\n\n录取非常非常玄学，似乎不看 research。录取难度和 track 关系不大，不同track选课无限制，提交毕业申请时候选择track。\n\n【吹风机理论】：ucsd有着数量可观的dp表示录取并不是跟申请人的三维、实习、科研录取有关系，有很多三维很好的大佬最后直接被rej。（推测是没看材料直接拒了）\n\n## 代表性 dp\n\n【24fall】BJTU(中外合办) CS major WES GPA 3.91/4.00 GRE 322 TOEFL 103 两段英国院校科研 一篇水Journal 一段大厂实习\n\n【22fall】SJTU CS 系录了系第一，以及 88-89 的两人，信安系录了 85 分和 86 分两位软背景正常的同学。\n\n【22fall】SCUT 89+/100 前 3% 一段实习，三段国内科研\n\n【21fall】双非 GPA 94.68/100，3.98/4.0，G323 T103，无 Pub，一段实习两段科研，普通课程推 录取\n\n\n## 网申备注\n\n不能 update 材料\n\n喜欢在西海岸时间凌晨定时（北京时间下午四点）发送申请结果通知\n\n【portal变化信息含义】：\n\n1. 出现要求交wes：录取，北京时间下午四点（加州0点准时portal update通知录取）\n2. checklist 上方小字消失，但是checklist没有消失：也是好消息，24fall来看基本会在下一周录取\n3. checklist 上方小字没有消失：还没有review到，继续等待\n\n有的人会收不到邮件通知 update，需要自己去 portal 查看\n\n支持 Interfolio\n\n## 项目特点\n\nsize 不算小，官网给的数据是 23Fall 578 admits, 266 New Students。地理位置好，气候佳，大众情人校，因此申请非常卷。\n\nCS76 和 CS75 的选课方案不一样，申请难度相对较低，但实际上进校之后很好转 CS75。如果第一学期 GPA 较高的话，第二学期就可以转，反之亦然。硬件背景更好的可以申 CS76 曲线救国。\n\n[官方Admission/Enrollment/Placement统计](https://ir.ucsd.edu/stats/grad/admissions.html)\n\n不允许defer，defer还需要重新提交下一年申请，且不保证录取。\n\n收到offer，过几天application界面出现pid(学号)就可以排学生公寓了，甚至不用接offer就可以排！Waitlist是先到先得，房型志愿可以之后任意编辑调整，建议尽早占位:-)\n\n[查看公寓预计排期](https://its-netweb.ucsd.edu/hdh-gfh-community-statistics/statistics.aspx#3)\n\n## 申请季实时信息\n\n24fall CS75录取了一堆ucsd本校ds/math-cs专业的学生；本校bg够的话可以当作保底。\n\n23fall CS76 似乎几乎没录陆本，慎选\n\nreddit 有人提到 22fall MS CSE 有 6k+申请者且缩招，历史上最多申请和最少坑位\n\n22fall 每周一个 batch 发 offer，发到四月多\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/CSDA@Dartmouth.md",
"content": "## 录取偏好\n\n喜欢有 art 背景的学生，\"look for both a strong CS background and a portfolio of your work\" \"We are looking to see how you are able to combine the two and understand how that might lead to the work you would do here at Dartmouth.\"\n\n## 代表性 dp\n\n【22fall】SCUT 89+/100 前 3% 一段实习，三段科研，wl 转 ad 25% 奖\n\n【22fall】双非 4.1/5 强推，有科研和大厂实习，图形学经历丰富，ad 75% 奖\n\n## 网申备注\n\nportfolio 重中之重，一定要认真准备\n\nCode Sample 要求：\"Something that shows your graphics coding skills, or some code related to visual computing, is ideal, but if you don't have that, good clean, well commented code, not from a class, but from a research or other development project is best.\"\n\n## 项目特点\n\n以下为项目负责人邮件回复的原文\n\n\"The MS in CS with a concentration in Digital Arts (we call it the MSDA) and the regular MS program are both 2 year programs (six terms). Every student in the MSDA do a research project (3 terms of courses and 3 terms of research) that can range from something like what a PhD student might work on (research in graphics, physical computing, rendering, ML, robotics, HCI) or it could look more like an art project that incorporates new technologies (AR/VR, interactive art). All students in the MSDA program take a reading course in their first winter term in which they learn how to read a research paper, do some prior work research, and learn about the areas of study of faculty in field related to the MSDA program. Most of the MS students who work with graphics faculty are in the MSDA program, but it is possible for students in the regular MS program to also do research and work in graphics. In other words, it would be possible to do much the same work in either program, but the MSDA would require you to do research where the MSCS would allow you to either do all courses or courses plus research.\"\n\n## 申请季实时信息\n\n开奖通常分两拨，一次是 1 月 1 开始算的第 8 周通知，一次是极少名额的 wl 转正 (被 wl 的人很少，转正概率较大)\n\na very competitive program, with a 10-15% acceptance rate\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/CSE@GaTech.md",
"content": "## 录取偏好\n\nhome unit 录取难度：CoC > ISyE > CEE 等其他 units\n\n转码友好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n核心课偏数学/计算，workload 大；每个学期强制上四门课\n\n非 CoC home unit 可以在春季学期申请转到 CoC unit. 不过 unit 也就选课有一些区别，转不转区别不大，最后毕业证是一样的\n\n各个home unit选课要求和项目信息参考https://cse.gatech.edu/sites/cse.gatech.edu/files/handbook-2022-12-06.pdf\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/CSE@Harvard.md",
"content": "## 录取偏好\n\n和 DS 项目同属在一个 institue 下，只能选择一个申请。录取率略高于 DS，近六年 8%，10%，8%，7%，9%，6%。非常偏好海本，但一直有陆本录取。在读phd说，海本只要gpa高基本就很有戏。大陆24fall基本rej了所有申请者\n\n## 代表性 dp\n\n【22fall】SJTU 密院 dd 两篇顶会二作在投 两篇一作非常普通不知名发表 录取\n\n## 网申备注\n\n不允许通过 Interfolio 提交推荐信\n\n## 项目特点\n\n一句话概括：非常难，特别难。想冲的话建议做科研，并且有connection，已知不偏好强实习选手。24fall疑似一个陆本ad都没有。海本可冲。\n\nCSE 不是计算机科学与工程，而是计算科学与工程（和应用数学接近）。必选 2 门 CS 课和 3 门应数/数值计算的课上，剩下的选修非常自由。自选 1 年/1.5 年/2 年，是否完成 thesis research。\n可以去 MIT 上课，每学期最多一半的学分能在 MIT 上。\n\n## 申请季实时信息\n\n24fall UCSD F1女生录取\n\n24fall 男生 985 (3.94,t 109) 3*大厂实习rej\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/CSE@MIT.md",
"content": "## 录取偏好\n\n比较看重背景是否 match，并不传统搞 CS 的，喜欢录取 computational+X 的背景\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/Cybersecurity@GaTech",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n陆本录取极少\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/Cybersecurity@SFU.md",
"content": "## 录取偏好\n\n申请者最好有修过信息安全类课程，或者有CTF等安全竞赛经历。\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n- Co-op可以4个月（16个月毕业）或8个月（20个月毕业）。\n- 根据学校提供的2024年三月底的Co-op数据：_\"Current Co-op placement in CY programs (Cohort 2023) is 47%\"_。Co-op如果summer没找到fall可以接着找。\n- 据22年入学同学表示华人学生仅三人未找到Co-op.\n## 申请季实时信息\n\n## 介绍帖\n\n- 地里帖子：[就读+找工+生活体验](https://www.1point3acres.com/bbs/thread-965723-1-1.html)\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/DS75@UCSD.md",
"content": "## 录取偏好\n\n## 代表性dp\n\n## 网申备注\n\n## 项目特点\n\nHDSI从18年开始筹备资金，21年挖了很多其他top15的senior和四大phd毕业的ap，faculty水平非常顶\n\n课开得很好，ds课程覆盖全面，且加了应用领域的课，非常适合ai+x，本院课优先级够高，不用担心选不上，cs的课也可以选\n\n## 申请季实时信息\n\n22fall疑似点击就送\n24fall录取很偏向统计/数学背景\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/DS@Columbia.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n## 申请季实时信息\n\n23fall 陆本录取较往年变少\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/DS@Harvard.md",
"content": "## 录取偏好\n\n偏好海本，陆本难度较大。21fall 有几个陆本录取。对本科背景几乎没什么限制，1/5 计算机，1/3 数学或统计，1/5 经济，余下基本是其他理工科 (所以挺适合转码的)。\n2018-2023 几年的录取率分别是，5%，8%，6.5%，6%，6%，6%。\n\n## 代表性 dp\n\n21fall 光华第一（后来去了普林 MFin）\n22fall TUM CS top1%, minor CL，一篇顶会在投（低分），一封大牛推\n\n## 网申备注\n\n## 项目特点\n\n项目非常自由，除了必修课是几门数据科学 (ml+dl+stat) 的课之外，其他的课可以随便选。（可以在哈佛全校+MIT 全校随便选）甚至有之前连必修课都 waive 了的先例。\n可以选择写毕设，也可以选择不写毕设只上课。并且可以选择用 research 替换学分。可以在 MIT 找教授做毕设，甚至也有往届在 MIT 一直做 ra 的先例。\n从自由程度上来看，适合各种背景、目标的人，包括但不限于转码，找 cs，ds 工，去投行，或者以后继续读 cs、math、stat、经济 PhD。\n\n## 申请季实时信息\n\n22fall 无陆本录取。\n\n24fall UCSD 🈚️绿卡两人（一男一女）录取。（两人还是一对）\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/DS@NYU.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/DS@UMich.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n找工向，但实际上因为四院合办，所以多少沾点血缘关系，老师都比较愿意带research，但是转博的话title要变，需要重新申请，不像GT那样提供研二转博二的通道，没有单独开设DS PhD\n\n打算读phd进lab的学生也是因为这个原因去了很多不同学院的组，没什么统一的去向，主要是看哪里缺人以及个人兴趣，至于找得到与否就比较看造化了\n\n实际上因为umich ms选课的原因转码范围极其受限，转sde必须的本科课基本选不上，而做ds或者转phd用的ml课也是在mds学生选课之前就已经排了大几百waitlist，很绝望，感觉这是项目最大的雷点，选课优先级的下降真的是件很值得认真考虑的事情\n\n## 申请季实时信息\n\n24fall 申请难度显著增加，考虑升档\n\n## 介绍帖\n\n[UMich MDS就读体验](https://www.1point3acres.com/bbs/thread-1034803-1-1.html)\n\n[Umich MSDS 项目体验](https://www.1point3acres.com/bbs/thread-968074-1-1.html)\n\n[UMich MSDS 21Fall 就读&转码&ask me anything](https://www.1point3acres.com/bbs/thread-926265-1-1.html)\n\n[2021Fall UMich MS in DataScience 就读体验](https://www.1point3acres.com/bbs/thread-865137-1-1.html)\n\n[UMich MDS就读体验](https://www.1point3acres.com/bbs/thread-1034803-1-1.html)\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/DS@UPenn.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n选课较自由，可以 dual 一个 CIS 但花费较高\n\n## 申请季实时信息\n\n24fall first round UCSD被录取一男一女两人\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/EC79@UCSD.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\nUCSD ECE 下最好的转码项目，每年有不少科班选手申请，项目名称为 Computer Engineering，可以选的 cs 课也最多。槽点可能是唯一的 core VLSI 对于非 ECE 出身的人不友好;\\\n\n[官方Admission/Enrollment/Placement统计](https://ir.ucsd.edu/grad/index.html)\n\n## 申请季实时信息\n\n## 介绍帖\n[UCSD ECE(EC79 80 82 93)：项目介绍与课程横评](https://www.1point3acres.com/bbs/thread-981628-1-1.html)\n\n[【21 Spring】UCSD EC79 深度评价求米](https://www.1point3acres.com/bbs/thread-872283-1-1.html)\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/EC82@UCSD.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n[官方Admission/Enrollment/Placement统计](https://ir.ucsd.edu/grad/index.html)\n\n## 申请季实时信息\n\n## 介绍帖\n[UCSD ECE(EC79 80 82 93)：项目介绍与课程横评](https://www.1point3acres.com/bbs/thread-981628-1-1.html)\n\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/EC93@UCSD.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n【22fall】 SCU SE 87/100, GPA 3.65/4.0, G322 T102\n\n## 网申备注\n\n## 项目特点\n\nUCSD ECE MLDS 项目，不可转入。\n\n[官方Admission/Enrollment/Placement统计](https://ir.ucsd.edu/grad/index.html)\n\n## 申请季实时信息\n\n## 介绍帖\n[UCSD ECE(EC79 80 82 93)：项目介绍与课程横评](https://www.1point3acres.com/bbs/thread-981628-1-1.html)\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/ECE MEng@Cornell.md",
"content": "## 录取偏好\n\nScott 大人喜欢 EE 背景根正苗红的靓仔，文书中不要流露出转码的想法！另外根据观察，本科 CS 背景的同学似乎不被待见，看到一些 90+cs 科班被拒案例。\n录取随机性比较大，85+就可以尝试申请，经常看到 85 录 88 拒 90+录......心态放平\n\n## 代表性 dp\n\n## 网申备注\n\n只需要两封推荐信\n\n## 项目特点\n\n确定可延期至一年半，可选软课\ncoop 对于 22fall 来说已经不存在了，但是延期没有一点问题\n两学期毕业的话要修 4 门 ece 课，其中一门可以替换为 cs 的；三学期要修 6 门 ece 课，其中一门可以替换为 cs 的\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/ECE MEng@Western.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n- 纯ECE MEng是一年制的，毕业只能拿一年工签\n - 可以申请 ECE MEng + 2学期的GDip，似乎能拿3年工签（但是不能确定）\n- 有SDE track，软课多且比较水\n- 带CO-OP，需要开学时单独申请\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/ECE MEng@uAlberta.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n【23fall】双非 均分85 雅思7 AD无奖录取\n\n## 网申备注\n\n## 项目特点\n\n- 课非常硬，几乎找不到软课\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/ECE MEng@uOttawa.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n【23Fall】双非 均分93/100(Top2%) 雅思7 G325 录取\n\n## 网申备注\n\n## 项目特点\n\n- Bar非常玄学，根据地里和寄托的数据，陆本均分在82-90+之间反复横跳，完全不清楚它偏好什么申请者。\n- 有Co-op，但是需要按成绩划分比例（约前10%），并不是100%有机会申请到Co-op，这点需要注意。\n- 位置在GTA以外，OINP graduate stream位置打分+8，对拿卡友好，且渥太华找工也OK。\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/ECE Meng(coop)@Waterloo.md",
"content": "## 录取偏好\n陆本友好，录取存在一定玄学，有高gpa被拒，根据不完全观察，偏好已经有全职工作经验的和早提交的同学。\n## 代表性 dp\n【23fall】陆本 985 均分92 1篇sci一作 1段海外暑研\n## 网申备注\n23Fall疑似早提交有优势，申请付款后提交cv，ps。基本offer在12月就发放了，之后几乎没有再发放offer。\n## 项目特点\n\n23Fall新开项目(22FALL有部分人被选中)，可与ece meng同时申请。考虑到MMath Coursework停止招生，可能loo是想开设ECE Meng (Co-op)作为替代\n\n项目时长5-6 terms (20-24 months) 可选1或2term做co-op，如果没有找到co-op则会转为普通ece meng毕业。\n\nco-op使用全校共用的系统，要考虑到竞争性。\n\n## 申请季实时信息\n22Fall报道12人，23Fall发的offer目测远多于此。\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/ECE Meng@UBC.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n【22fall】陆本 bar 大概在中游 985 GPA90\n\n## 网申备注\n\n支持 Interfolio\n\n- 语言要求（截自 2022.12）：\n\nTOEFL requirements: Total of 100 on the IBT with minimum component scores of 22 (reading, listening) and 21 (writing, speaking);\nAcademic IELTS requirements: Total of 7/9 with a minimum score of 6.0 in each component. The General IELTS test is not acceptable.\n\n**如果成绩不符合语言要求，申请不会被考虑**，欢迎提交 GRE（不是强制要求）\n\n## 项目特点\n\n- 关于枫叶卡：毕业即可走 bcpnp 申请枫叶卡，移民之选\n- 关于 Co-op: 有 coop 机会（**注意：该机会需要入学之后进行面试之后才有可能获得**）。选课比较自由；最多可做三期 coop，除第一学期都可以申请\n- 时长灵活，最多五年读完\n- 关于学费：学费相对便宜（截自 2022.12 官网一年$23,913.63 加币）和多大/滑铁卢类似项目相比，但请注意考虑温哥华的生活成本。\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/ECE Meng@UIUC.md",
"content": "## 录取偏好\n本校3.5保研；对美本bar不算高\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n找工项目，博士需重新申请\n允许自由defer一年\n\n## 申请季实时信息\n\n## 介绍帖\n[【22Fall】UIUC ECE MENG就读体验](https://www.1point3acres.com/bbs/thread-934690-1-1.html)\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/ECE Meng@UofT.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n无 coop，无 scheduled break，没法实习\n\n## 申请季实时信息\n\n## 介绍帖\n[[院系评价] 多伦多大学(UofT) ECE MEng 就读体验和选课经验](https://www.1point3acres.com/bbs/thread-897699-1-1.html)\n[[院系评价] 多伦多大学ECE MEng院系介绍，选课介绍，项目diy等](https://www.1point3acres.com/bbs/thread-1064403-1-1.html)\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/ECE Meng@Waterloo.md",
"content": "## 录取偏好\n\n985 85+可冲\n\n## 代表性 dp\n\n## 网申备注\n\n- **从 22fall 开始新增 ECE Meng Co-op 项目**,这是另外一个项目，需要另外的申请费。\n- 文书需要交申请费，进入内部系统之后，才能看见所需要回答的题目（参考官网申请流程）\n- 春季秋季都可以申请\n\n## 项目特点\n\n- ECE Meng 项目本身无 coop，无 scheduled break\n- 加拿大修改了不能工作 20 小时以上的限制，现在不确定是否可以自己找实习。\n\n## 申请季实时信息\n- 24fall: \n 一直发到六月初\n- 23fall：\n 2022 年 12 月 10 号开始已经有人拿到 ECE Meng 的 offer，所以早申请的话 offer 下的还是比较快\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/ECE@CMU.md",
"content": "## 录取偏好\n\n有给 fall 申请人发 spring offer 的传统。\n\n关注文书，非绩点控。\n\n建议early ddl申请\n\nApplied track 2023 Fall不再招生\n\n## 代表性 dp\n\n【23Spring】top30 3.8+102+325，无 pub 有大厂实习\n\n【22fall】海本 ce 3.88\n\n【22fall】中外合办 3.9+100\n\n【20spring】BJUT 3.86+106+325，无牛推\n\n## 网申备注\n\n## 项目特点\n\n选课灵活，一些 15 的 system 课都有 crosslist 到 ece 的课号。需要关注 21fall 课改，之后选 SCS 课优先级较低\n\n出路详细参考[官方 dashboard](https://www.cmu.edu/career/outcomes/post-grad-dashboard.html)\n\n可以defer半年，从Fall到Spring。但是不能从Spring到Fall。\n\n## 申请季实时信息\n\n22fall 坑位较少，大量 defer 到 23spring。\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/ECE@Duke-Kunshan.md",
"content": "## 录取偏好\n\n比较喜欢 985 和中外合作办学，高均分的选手，不卡专业出身。\n\n## 代表性 dp\n\n## 网申备注\n\n申请分为 early-round，priority-round 和正常批。提前批会在一个月内反馈，如果没录取会进入下一批（priority 这批），接受拼分，可以直接用 best score。可以与小蜜邮件沟通也可以与小蜜微信沟通，同时公众号有较多宣讲会。\n\n## 项目特点\n\n和 duke 一样的毕业证是比较突出的特点，目前在过度校区，无宿舍。\n有 opt 无 cpt，第一年 career fair 很不错，人均国内大厂实习。第一年国内学费标准，第二年美国学费标准\n\n## 申请季实时信息\n\n## 介绍帖\n\n22fall 的提前批喜欢收高均分选手，985/中外合办 3.7/3.8 基本是提前批的 bar。\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/ECE@Duke.md",
"content": "## 录取偏好\n\nMeng 和 MS 的 bar 差不多\n\n## 代表性 dp\n\n## 网申备注\n\n支持 Interfolio\n\n## 项目特点\n\nMEng 比 MS 多两门管理课，可互转，可以全软课毕业，上岸率比较高，ECE 中最适合转码的一批\n2025 Fall update: Meng和MS能互转存疑，track之间互转可能都不允许\n\n2023年允许defer\n\n## 申请季实时信息\n2025 Fall 陆本基本有面邀，面试内容很日常，主要看看会不会说英语，面试官很和蔼，Admission Team效率很高，申请体验极佳\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/ECE@GaTech-Shenzhen.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n有 opt 无 cpt，经济适用之选\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/ECE@GaTech.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n可以在春季或者秋季选 Coop 抵学分，每年下学期有转 CSE 的机会，但是比较玄学。可以选 thesis 或者 non-thesis，同时也有一个 special problem 可以进组做 research。转 ece 博有内部流程可以随时转，但需要找到老师要你。偏向 CS 的方向在 ECE 有 CV，Speech，HCI 和偏理论的 ML 方向，缺点是可选的方向不是特别多。\n\n课很硬，GT 每个学期要求四门课，workload 很大，第一个学期结束之后可以申请转到 cse\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/ECE@UT Austin.md",
"content": "## 录取偏好\n\nSES track 对 CS 背景友好。DICE 陆本招的少。\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\nSES track 可以当做 CS 来上。class size 很小，tech reputation 好，2 年项目可 coop。有 ta/ra 机会，学费非常良心，转博友好\n\n## 申请季实时信息\n\n22fall SES track 陆本录取 10+，DICE track 地里未见录取\n\n22fall offer 发的很晚，接近 4.15\n\n## 介绍帖\n[【22spring】UT-Austin ECE-SES入学一年半感受](https://www.1point3acres.com/bbs/thread-992137-1-1.html)\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/EE-PMP@UW.md",
"content": "## 录取偏好\n\n比较喜欢文书找工的\n\n23fall bar 逐渐升高，预计 24fall 继续升高\n\n## 代表性 dp\n\nSDU 3.78 5 家大厂 8 段实习(软麻 BAT), 首批录取\n\n中外合办 3.78 (绩点换算水)，4 实习（包含字节，微软)，2 篇 ATC 在投（一一作，一三作），录取\n中外合办 3.78 1 实习（包含百度），1 篇 3 作，录取\n\n985，软工，均分86，录取\n\n## 网申备注\n\n## 项目特点\n\n可以做两段 coop, extend 到两年毕业，全选（水 or 软）课\n\n由于系名是 ECE, 找工时 CV 和 LinkedIn 上可以直接写 MS in ECE\n\n系已经改名为 ECE, 项目可以简历上写[ECE Professional Master’s Program (PMP)](https://www.ece.uw.edu/academics/pmp/)， 但目前仍然是 Master of Science in Electrical Engineering (MSEE) degree，发 MSEE 的学位证，且短期内没有改名打算。\n\n## 申请季实时信息\n\n## 介绍帖\n\n[【2018 Fall】后疫情时代 UW MSEE-PMP 介绍](https://www.1point3acres.com/bbs/thread-979569-1-1.html)\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/EE@Stanford.md",
"content": "## 录取偏好\n\n根据近两年的录取dp，总结出来的画像：女生，高gpa(非绝对，90+就算可以)，AI方向科研（有A会pub最佳，一般录取的都有sci/ A会Pub），海外connection（optional，不绝对）\n\n## 代表性 dp\n\n【22fall】ZJU 90 分 一篇二作，一篇二作在投录取\n\n## 网申备注\n\n## 项目特点\n\n不允许主动申请defer（地里有defer成功的是2020、2021年疫情时期）\n北京时间二月倒数第二个星期六凌晨到上午放榜，就发一波，其他全拒。\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/EECS Meng@Berkeley.md",
"content": "## 录取偏好\n\n传闻喜欢录取有 Berkeley 交换经历的学生\n\n## 代表性 dp\n\n【22fall】SJTU 88+ UCSD 暑研 一篇 CVPR 二作在投 苏州微软实习录取\n\n【22fall】ZJU 90 分 一篇二作，一篇二作在投录取\n\n【22fall】HUST 86+(3.82 绩点换算水) 一篇一作一篇二作在投录取 国一国二\\*1 BerkeleySummerSession\n\n【22fall】SEU 90.7(5%) 三段科研无论文\n\n## 网申备注\n\n支持 Interfolio\n\n## 项目特点\n\n录取的同学说 Berkeley 给面试率很高，上岸情况不错。而且面试了给 offer 的几率也不低。\n\n## 申请季实时信息\n\n22fall 入学听说比较难延期到 1.5 年，需要有 academic purpose\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/ICME@Stanford.md",
"content": "## 录取偏好\n\n看重学生的数学背景。\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\nclass size 小\n\n## 申请季实时信息\n\n22fall 看起来陆本录取的甚至比 MSCS 多（考虑到 class size 比 MSCS 小不少）\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/IS@NEU.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/IS@Pitt.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/ISB@NEU.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MACS@Dalhousie.md",
"content": "## 录取偏好\n\n## 代表性 dp\n【23fall】211 均分84 雅思7 AD无奖录取\n## 网申备注\n需要面试，往期题目可以在[这里](https://docs.google.com/document/d/1f02mQTcQ7OVSi93vDUM9P65qulp_eQXixoTTYFqqKiY/edit?usp=sharing)找到\n## 项目特点\ncoop机会，进实验室机会，比较实用的课程设计\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MCDS@CMU.md",
"content": "## 录取偏好\n\n海本+清北复交人，24fall陆本非清北复交人录取mcds极少\n\n## 代表性 dp\n\n【22fall】SJTU CS 年级第一，GPA 94/100，无 Pub，三段数据库硬核实习，GitHub 3k followers，多个高 star 项目录取\n\n【22fall】SJTU 3.78/4.3 2 篇 infocom 3 作录取\n\n【22fall】ZJU 90 分 一篇二作，一篇二作在投录取\n\n【22fall】SJTU 密院 dd 两篇顶会二作在投 两篇一作非常普通不知名发表 录取\n\n【22fall】THU 信院非 cs，3.84/4.00，G323 T103，MSRA 8 个月实习，一篇 ML 顶会二作在投 第二波录取\n\n## 网申备注\n\n不需要 video essay，虽然挂靠在 LTI 但是 MCDS admission committee 并不会看 video essay\n\n## 项目特点\n\nSCS 就业旗舰项目，仅次于mscs，毕业后大部分大厂 SDE，出路详细参考[官方 dashboard](https://www.cmu.edu/career/outcomes/post-grad-dashboard.html)\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MCIS@UPenn.md",
"content": "## 录取偏好\n\n几乎是陆本黑洞，陆本申请性价比较低。非常喜欢海本高绩点选手\n\n## 代表性 dp\n\n【22fall】SJTU 密院 dd GRE334+4.5 TOEFL114 两篇顶会二作在投 两段实习 录取\n\n## 网申备注\n\n## 项目特点\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MCIT@UPenn.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MCS@NCSU.md",
"content": "## 录取偏好\n\n转专业比较友好（需要先修课）\n\n## 代表性 dp\n\n海本：https://www.1point3acres.com/bbs/thread-872526-1-1.html\n\n陆本被刷小分：https://www.1point3acres.com/bbs/thread-858000-1-1.html\n\n陆本高 GPA：https://www.1point3acres.com/bbs/thread-846065-1-1.html\n\n## 网申备注\n\nhttps://www.csc.ncsu.edu/academics/graduate/procedure.php\n\nInternational MCS 申请者需要 GRE，其他情况不需要。\n\n## 项目特点\n\n上岸率参照：https://leslierp.wordpress.ncsu.edu/accepting/\n\n印度人多，华人偏少。\n\n找工项目，课程很适配sde，RTP的local小厂不少\n\n21 Fall 申请 22 Summer 实习情况：https://drive.google.com/file/d/1-e1vbeC4stv9Z3DNFpL2T58EfwAnKgDz/view\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MCS@Rice.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n支持 Interfolio，不交GRE疑似会全部rej(22 fall信息）\n\n## 项目特点\n\nclass size 小，不内卷。据说有休斯顿当地小厂托底，找工情况比较好\n\n## 申请季实时信息\n\n2022fall 缩招\n\n2023fall转码录取人数极少\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MCS@TAMU.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n【22fall】末流 985 89 纯课程推 + 学校实习推\n\n## 网申备注\n\n## 项目特点\n\n**2024 update，假的，假的，都过时了，现在学费涨价+汇率奇高+无半奖，项目总的 tuition+fee 就不止 30w rmb，大约需要 4.5w 🔪，生活费一个月约 1000 🔪**\n\n找工好：这里主要是针对德州，因为德州学校里面非 cs 和 cs 差距比较大，而且招生比较少，TAMU 作为旗舰学校肯定能在德州找到好工作（TAMU 好像还有亚马逊校招，每年 cs 毕业人数不多，基本能全带走，奥斯汀分部算亚马逊很大一个分部了）\n**2024 update，这个基本也过时，行情好的时候 TAMU title 还是够用的，行情不好的时候 TAMU 完全不如排名高的学校，如果金币足够的话建议慎重考虑！**\n\n可以延期：适合第一年找工找不到；可以适当延期\n**2024 update 倒是确实可以延期，但是延期的话学费会很昂贵，假设你上5学期，每学期学费 1.5w 🔪，学费总价 7.5w 🔪。不过如果你找到 fall / spring coop 的话，确实可以考虑延期的，否则完全不值好吧**\n\n2024春信息更新：\n- “第二个学期开始绩点 4.0 还有自动半奖，好像就和本州学生花费一样”，是错误信息，这个政策在几年前已经取消了。奖学金需要教师题名，因此需要找教师做RA才行。\n- 关于找工，在2024年这个环境下，TAMU这类本科排名不算特别高的大公立，找工很不占优势。德州的本地公司大都不sponsor CPT/OPT/H1B，FAANG则很少会给TAMU的学生发面试。\n- 关于价格，TAMU涨价严重，且取消了大规模发奖学金，因此学费已经和OSU等大公立价格相当了。除了大农村生活会比较便宜，其他方面TAMU并不便宜。大学城生活极其单调，生活便宜的代价是很无聊。\n\n\n## 申请季实时信息\n\n## 介绍帖\n\n**TAMU有一个大坑，seminar课，所有人都要上这个课，但教授古特雷斯喜欢故意刁难学生，包括但不限于，使用软件判断有没有用GPT，让你提交GPS记录证明你的attendance。如果他认为有违规行为会被举报，直接F*处理并且威胁开除。另外他经常无理由给0分，目的是让所有人卷起来，学生之间养蛊一样竞争。TAMU其他任何课教授都还不错，但seminar会让所有CSCE学生经历一次大逃杀。\n古特雷斯的其他劣迹包括但不限于，让学生自费购买设备不报销，上课辱骂学生，不批准MSCS学生的毕业答辩，卡Phd学生毕业，seminar上和嘉宾吵架。\n具体可参考一亩三分地帖子 https://www.1point3acres.com/bbs/thread-690612-1-1.html**\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MCS@UCI.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n## 申请季实时信息\n\n## 介绍帖\n[【22Fall】UCIMCSFall22就读体验](https://www.1point3acres.com/bbs/thread-985740-1-1.html)\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MCS@UIUC.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n【22fall】SJTU CS 88 以上基本全部录取\n\n## 网申备注\n\n## 项目特点\n\n和 UIUC MSCS 仅是不做 thesis 的区别，上课完全相同。价格便宜，课程质量不错，学校 reputation 好。\n\n2023Fall开始可以coop，第三学期去做加上summer intern可以两段实习。\n\n不能defer，只能在之后的申请季免申请费。\n\n24年芝加哥校区开始招国际生，bar比主校区低，写字楼授课，学位证一样。\n\n## 申请季实时信息\n\n2021/2022fall 连续扩招（2021fall 发了 200+offer，2022fall 300+），难度降低了不少，但仍然是好项目。\n\n2023fall 难度上升明显\n2024fall 已经演变为歧视陆本，偏好美本的程度（中9 90/100 T112 G330 2*一作paper也被rej；但美本有3.5无科研产出录取以及本校3.3录取的dp）\n\n## 介绍帖\n[【23Fall】新政策: UIUC CS硕可以第三学期Coop+四学期毕业](https://www.1point3acres.com/bbs/thread-988120-1-1.html)\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MCS@UVa.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n中国学生申请较少，地里比较冷门。\n\nGoogle target school\n\n## 申请季实时信息\n24fall免申请费导致bar猛增\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MCS@uOttawa.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n【23Fall】Top30本 GPA3.9/4.0 雅思7.5 2年SDE Rej（Course-based）\n\n【23Fall】C9 CS本 GPA3.74 T107 G325 国内大厂累计1年实习 录取（thesis-based MCS-AI）\n\n## 网申备注\n\n## 项目特点\n\n- 新开了3+1+1项目（仅限合作学校，可咨询本校国际合作处），涉及多个专业，会有9折学费减免，但只能选course-based\n- 有course-based 和 thesis-based 两种track可选\n - 其中 thesis-based 有多个方向可选，**建议**先套磁\n - 只需要两封推荐信，但听说比较prefer学术推\n- 有Co-op，但是需要按成绩划分比例（约前10%），不能确保能拿到Co-op\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MDSAI@Waterloo.md",
"content": "## 录取偏好\n\n录取者几乎全部来自海本，陆本有但是不多，20fall 有一个 fdu 的，21fall 有一个 sysu 的。\n有 Top2 同学获得 offer，但并未最终就读。23fall该项目有扩招趋势，有来自buaa和hit的同学获得offer。\n\n## 代表性 dp\n\nwaterloo 本科+GPA3.9+2 年实习经验\n\n## 网申备注\n\n## 项目特点\n\n3 学期课 +4 个月 Co-op，可延长至 8 个月 Co-op（**项目详细介绍参考介绍帖中就读体验**）\n\n## 申请季实时信息\n\n## 介绍帖\n\n[UWaterloo MDSAI 就读体验](https://www.1point3acres.com/bbs/thread-950890-1-1.html)\n\n---\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MEng Soft@uCalgary.md",
"content": "## 录取偏好\n\n注意：至少需要有一年的全职SDE经验\n\n## 代表性 dp\n\n## 网申备注\n\n- 似乎不需要推荐信\n\n## 项目特点\n\n- **一年制**项目，拿不了3年工签\n- 非常看重SDE相关的工作经历，适合工作党申请\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MEng@UCLA.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n网申要求中英文 official transcript，缺中文后面会要求单独补\n\n支持 Interfolio\n\n## 项目特点\n\n很多 track 和 CS 比较相关，适合机械/医学/生物等背景转码申请，目前申请最多的是 DS track。track 可以随便转，工学院的课都能选，可延期 1 个 quarter 暑期实习\n\n**注意**：至 2022 年为止，该项目截止日期均为 12 月 1 日，早于很多项目，如果感兴趣，请及时申请，以免错过申请截止日期。\n\n## 申请季实时信息\n\n21fall 开始的新项目，目前 bar 比较低，未来预估 bar 会上涨\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MI@UofT.md",
"content": "## 录取偏好\n严卡语言要求，以TOEFL为例，总分107 & S24 & W27 严卡\n从语言 && 录取偏好来讲，陆本不友好，中外合办 & 海本可 Waive 语言的可以尝试\n海本 dp bar 很低\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n20个月项目，可做 8个月 Co-op, 课非常水且不Tech\n毕业生去向因 Pathway 而异, 其中最 SDE 的是 ISD(Information System Design) 的 Pathway\n\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MIIS@CMU.md",
"content": "## 录取偏好\n\nNLP 项目，录取看 pub。录取非常 diverse，甚至有数量可观的文转码录取样本。同时 CMU SCS 除 MSR/MLT/MCDS 之外的项目录取非常非常 random，不同学校录取 dp 之间方差极大，根据 SJTU 22fall 情况怀疑这些项目是一个学校只录一个，211 以上陆本都有机会，尤其是同校没有人申的情况下，推荐抽抽彩票\n\n已知 MIIS 录取并不看 priority\n\n## 代表性 dp\n\n【23fall】SCU 91 分 水会一作 顶会在投 video essay高强度被浏览 录 （强烈怀疑是按本科学校groupby后取top1）\n\n【22fall】SJTU 89 分 ACL findings+EMNLP 两篇共一发表，1 篇 ACL 一作在投，1 篇 ICLR 一作在投录\n\n【22fall】SJTU 88 分 1 篇 ACL 一作 video essay 没被看脆拒\n\n【22fall】中外合办 3.6 一篇水会一作录\n\n【21fall】SJTU 信安 86 分无 pub 录\n\n## 网申备注\n\n## 项目特点\n\nLTI 下的 Professional NLP 项目，MLE 率还不错，转博率低，但有 direct study 保留了转博可能。有一定空间选非 AI 的 CS 课，SDE 也是主要出路之一。详细参考[官方 dashboard](https://www.cmu.edu/career/outcomes/post-grad-dashboard.html)\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MISM@CMU.md",
"content": "## 录取偏好\n\n喜欢带 tech 背景，很多实习的同学。\n\n## 代表性 dp\n\n## 网申备注\n\nHeinz 是接受拼分的，四次还是五次以内。不用提交每次的成绩，直接填最高的单项即可，有面试。\n被录取之前有玄学出现：application portal 的 checklist 会出现两门先修课的要求，分别是 oop 和 java，如果出现就代表被录了，没出现也不代表一定没被录，可能你满足了要求。录了之后会给一个认可的 list，本校补不上的同学可以选择认可的网课。\n\n## 项目特点\n\n不算特别科班的项目，转码的同学基本也会申请。分 12-month，16-month（genral），bida and global（一年阿德莱德一年 Pittsburg）。要求 wes，而 wes 需要做大概一个月左右，所以申这个项目的同学需要提早安排一点时间。\n\n就业数据在官网可以查到，即使是无 cpt 的 global path 好像也是不错的。\n出路详细参考[官方 dashboard](https://www.cmu.edu/career/outcomes/post-grad-dashboard.html)\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MITS@CMU.md",
"content": "## 录取偏好\n会相对看中一些实习经历，对专业背景卡的不严。托福小分要求全部25以上，25以下一定面试，25及其以上有可能面试(可能是看video essay决定进不进行面试的)，面试和录取并没有直接关联，可能面试然后rej,也有可能不面试ad\n\nbar并不低，学费较贵，大概要8.5w刀。可能并不是很喜欢想当SDE的candidate，已知24fall两位acm金牌选手+大厂实习被rej\n\n（24fall补充：身边人统计学来看bar比msin确实略低，可选一共7到10门课+必选毕业项目，对于cs方向的同学来说应该是cmu这个档次的项目里选课自由最高的项目了，必选一门文科水课和一门信息安全(可水可硬)，剩下的课相当于都是任选，感兴趣的课就算不在concentration list里只要相关都可以选。\n\n## 代表性 dp\n【2023fall】Umich本，GPA 3.916, 三段科研, 一篇IEEE会议一作, AD\n\n【22fall】华科 CS, GPA 3.88/4.0, AD\n\n【23fall】XJTU 管院BA, GPA 3.76/4.0, 四段大厂实习（微软SDE）, AD\n\n【24fall】211CS, GPA 3.92/4.0，三段海外科研+一段小厂实习，带小奖AD（主观感觉比较看文书）\n\n## 网申备注\n要求提供一段自我介绍的视频\n\n## 项目特点\nMITS是CMU工程学院、计算机科学学院(SCS)和政治与战略研究所(IPS)合开的项目，算是SCS的私生子。由于归IPS管所以bar相比其他SCS项目会低一些，也相对适合转码的同学（**存疑：可能无法适应这个强度**）。\n\nMITS项目最大的优势是可以选几乎所有你想上的SCS的课程，选课优先级和自由度相当之高，想选的课基本都能选到。同时，作为名义上的SCS院下项目可以蹭SCS的就业指导和相关资源。\n\n项目的director Kelly特别负责，邮件几乎秒回，对于实习信息也很上心，对于刚到美国难以适应环境的同学会很有帮助。\n\n项目班型特别小，一届只有20-30人，优点是能够专业内联系更紧密一些，但是可能使得申请难度随行情出现较大波动。\n\nMITS项目经过Director Kelly和学长学姐们的共同努力，之前的存在的最核心缺点已经得到修改：比如在2022Fall后存在16个月的Applied track，暑假可以提供CPT找实习，之前项目最大的痛点已经解决。\n\n但是还是有一些缺陷，比如需要在选一门Politics & Strategy Core Course(大水课)，可以当作生活的调剂也可认为是浪费时间和金钱。\n\n项目最后一学期有一个Capstone Project，对于想要纯上课或者急着找实习的同学可能会占用时间和精力。\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MLT@CMU.md",
"content": "## 录取偏好\n\n可以当做 PhD 申请\n\n## 代表性 dp\n\n【22fall】SJTU 89 分 ACL findings+EMNLP 两篇共一发表，1 篇 ACL 一作在投，1 篇 ICLR 一作在投录\n\n## 网申备注\n\n## 项目特点\n\n2 年带 thesis 科研型硕士，转博率不错，详细参考[官方 dashboard](https://www.cmu.edu/career/outcomes/post-grad-dashboard.html)\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MMath@Waterloo.md",
"content": "## 录取偏好\n\n23Fall 开始Course-based 取消。Thesis-based研究向全奖Master(TA+RA)，强Prof，可套磁。\n\n找工 Course-based co-op 可以关注 School of Engineering ECE Meng (co-op) 或者 School of Math MDSAI (co-op)。\n\n## 代表性 dp\n\n19fall 本科 UBC 无加拿大 PR，average 90%，三封中等偏上推荐信，一段科研无 publication，无套磁，无面试直接录取，4月2号才下的 offer 算比较晚的了\n\n## 网申备注\n\n不会严卡 S26+W26，不够的需要选英语课，S 和 W 分别对应一门。注意不能太低，已知 PhD 有 S19 但其他都接近满分的同学被要求考到 26 再 enroll，或者第一学期专门上英语课，过了再 enroll。\n\n## 项目特点\n\nThesis-based研究向全奖Master. 可以 co-op 但要和research相关。\n\n## 申请季实时信息\n\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MPCS@UChicago.md",
"content": "## 录取偏好\n\nbar 并不低，适合高 GPA 文转码，科班低 GPA 有实习可以尝试。\n\n有一种说法是，喜欢录取有大厂实习的candidate，看重院校的title。\n\n看重GRE数学，168以上。\n\n## 代表性 dp\n\n【21fall】SCU CS GPA 3.84/4, G331 T103, 大厂实习三个月\n\n## 网申备注\npre-doc和9/12 courses在同一轮中不可以同时申请，9/12 courses有两轮DDL，pre-doc只有一轮。\n\npre-doc有无面录取的dp（23fall)；奖学金只有pre-doc可能会有，24fall有top2本拿到了50%奖。\n\n## 项目特点\n\n人少，夜校，课程很基础，追求课程质量的建议别来; 教授多业界背景，学费8万刀，新生群统计总花费大概100w+\n\n课程可以选本科至博士level，9/12 courses的具体track可以入学再次选择.\n\n9/12 courses可以更改到12/9 courses, 可以同时找full time和intern\n\n有入学placement exam, 没有通过需要在入学前的summer/第一个autumn quarter take immersion classes\n\n12 courses在summer quarter要做degree required internship，可以通过和prof做项目满足要求。\n\n12 courses (4 quarters) 可延期至18months (5 quarters)，通过第一个autumn quarter上immersion classes或者最后一个quarter选课不满足毕业要求的方式。\n\n## 申请季实时信息\n\n## 介绍帖\n[【21Fall】UChicago MPCS就读体验](https://www.1point3acres.com/bbs/thread-862019-1-1.html)\n\n[【21Fall】UChicago MPCS 院系介绍：找工神项目的利弊取舍](https://www.1point3acres.com/bbs/thread-843060-1-1.html)\n\n[【21Fall】UChicago MPCS 2021fall 就读体验：录取学生背景、找实习情况和课程设置](https://www.1point3acres.com/bbs/thread-805194-1-1.html)\n\n[【22Fall】Uchicago MPCS 项目体验汇总](https://www.1point3acres.com/bbs/thread-858692-1-1.html)\n\n\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MPS-IS@Cornell.md",
"content": "## 录取偏好\n\nCS 背景和其它专业五五开，偏好有 HCI 经历/对 HCI 感兴趣的\n\n## 代表性 dp\n\n## 网申备注\n\n需要 WES 或其它成绩认证，托福口语严卡 25\n\n## 项目特点\n\n优点：选课优先级仅次于同院下的 CS，几乎可以当作 CS 上，HCI 方向也很不错\n\n缺点：无法 defer，一年项目无法实习（但不出意外可以申请延一学期）\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MPhil-CSE@HKUST.md",
"content": "## 录取偏好\n\n- CS 科班 (偏好海本和头部 985, 港校很了解陆本排名, 看重科研/成绩/排名/国奖)\n- 科研型 (偏好有科研经历的同学: 参与科研, 做实验, 发论文等)\n- 高绩点 (一般至少 90+ and 高排名, 否则靠科研成果弥补)\n\n## 代表性 dp\n\n## 网申备注\n\n- 该研究型项目由教授全权决定录取, 只要教授愿意录取就有 offer, 所以要积极套瓷/面试.\n- 有提前批, 注意关注[项目官网](https://prog-crs.hkust.edu.hk/pgprog/2023-24/mphil-phd-cse)信息, 大约在九月就会有提前批面试, 随后发提前批录取.\n- 提前批没录取也可以参加正式批, 在[网申系统](https://fytgs.hkust.edu.hk/admissions/Admission-to-Hong-Kong-Campus/submitting-an-application/online-application)里提交材料.\n- 注意发 offer 后两周内就要决定 accept/decline, 接了之后有 HK$5,000 的 deposit.\n- 申请 PhD 的同学可以关注港府奖学金: 看重学校/国奖/成绩/排名/科研\n\n## 项目特点\n\n- 科研型, 培养模式和录取难度与 PhD 相当 (由于招得少, 可能更难些). 两年学制, 完成修课任务以及通过毕业论文 Thesis 答辩则毕业.\n- [津贴](https://www.cs.ubc.ca/students/grad/prospective/funding/financial)以 TA/RA 形式发放. MPhil 每月津贴约 HK$18,000, 足够 cover 学费 (每年约 HK$42,000) and 食宿 (MPhil 必有学生宿舍, 月租约 HK$4,000).\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MS&E@Stanford.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n大 S 的项目选课都较为自由，可以选成很 tech 的课表\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSAII@CMU.md",
"content": "## 录取偏好\n\n传闻只要第一志愿，所以 bar 看起来非常高，有意申请可以放在第一志愿\n\n传闻prefer每个学校的第一名（但是也不绝对，也有低gpa有pub被录取）\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n出路详细参考[官方 dashboard](https://www.cmu.edu/career/outcomes/post-grad-dashboard.html)\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS&SE@UWB.md",
"content": "## 录取偏好\n转码不友好（对先修课要求），cs科班好一些\n\n## 代表性 dp\n\n## 网申备注\n\n小作文好好写，低GPA可逆袭\n\n## 项目特点\n\n地理位置很好，Bothell在Greater Seattle且距市区二十多公里，校园对面就是亚麻\n两年项目，可extend到两年半，或者缩短到1.5年毕业，鼓励做capstone（cover 3个 quarter）\n稳定可1coop（选了实习课就可以去full time cpt），summer intern 1-2个（2.5年可以做2个）\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@BC.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@BU.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@Berkeley.md",
"content": "## 录取偏好\n\n不招收外校学生\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n本校本科生的 5th-year master's program\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@Brandeis.md",
"content": "## 录取偏好\n\n文转码友好\n\n## 代表性 dp\n\n【22fall】理工科转码，高绩点（>3.8），成绩单有一门 C++/计算机网络/计算原理 和 2 门 ds 相关课程，无实习；录 9courses+2.5w 奖\n\n## 网申备注\n\n## 项目特点\n\n人均小奖，每学期 1w/1.25w，共两学期，可延长一学期。虽然生活消费水平不低，作为私校学费不便宜，但是算上奖学金后，总开销并不大。\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@CMU.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n【22fall】SJTU CS 年级第一，GPA 94/100，无 Pub，三段数据库硬核实习，GitHub 3k followers，多个高 star 项目录取\n\n【22fall】SJTU 传媒文科硕士，GPA 3.8/4，计算机音乐方向，1 领域内顶会，CMU&NYU1-2 年 CS 科研，三封强推（包括 CMU 大牛）\n\n## 网申备注\n\n## 项目特点\n\ngeneral CS 项目\n\n出路详细参考[官方 dashboard](https://www.cmu.edu/career/outcomes/post-grad-dashboard.html)\n\n允许defer，23Fall有人发邮件询问。\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@Columbia.md",
"content": "## 录取偏好\n\n录取的陆本很多是绩点高排名高，但也不绝对\n感觉不是很看video essay，不少人讲的时候因为紧张导致录得稀烂也被录取了。\n\n转专业友好\n\n## 代表性 dp\n\n【22fall】SCUT 89+/100 前 3% 一段实习，三段国内科研（T101 G321）\n\n## 网申备注\n\n收到录取后，需要在两周之内交 4 千刀占位费，占位费可以申请延期（通常能延后一到两周）（24fall申请延期了一个月但是只给了两周）\n\n【24fall】此项目分多batch录取，考虑到高额留位费，可以通过先提交申请，之后延迟提交video essay的方式来延缓审批进度，防止需要过早做决策。\n\n【24fall】通过注册online info session（需要用和申请的账号同一个邮箱注册）可以waive掉申请费（$85）\n\n## 项目特点\n\n东海岸大众情人项目，专排综排都很强，NYC location，class size 大\n\ninternational student 前两学期必须full time，至少修4门课，一般4+4+2毕业，也可以5+5一年毕业，或者5+4+1这样。\n\n## 申请季实时信息\n\n21fall 以来劝退贴不少，主要控诉 class size 太大以及 career support 不好。哥大老校长 22 年辞职，在任期间搞哥大教育产业化，导致综排很高，硕士 class size 太大，reputation 不好。未来可能会缩招（存疑）\n\n22fall 缩招\n\n24fall 招了一大堆ucsd的人，bg都很diverse，感觉只看gpa。offer holder group内bg调查结果：https://docs.google.com/presentation/d/1AML5hko22h42KR6bLO38fYklMqvLCtIH/edit?usp=sharing&ouid=116730452879259903552&rtpof=true&sd=true\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@Cornell.md",
"content": "## 录取偏好\n不只是陆本黑洞。\nCornell CS MS几乎只收Cornell本(康本)。没见过非康本华人甚至华裔录取，整个项目也60%～90%是康本。\n\n## 代表性 dp\n\n## 网申备注\n项目很小(8~20)，创立的原意是是为了保留好的TA，所以口语要求超级高。康本申请无需托福成绩。\n\n**非康本不建议申请MS**，但是从CS MEng转过来是有可能的。\n> 校外申请录取率其实远远低于PhD录取率\n\n## 项目特点\n- Fully funded 所以对于导师来说省事\n- 所有学期必须TA，Funding不能被替代。\n- 不是很能coop或者shorten/extend。\n - 但是如果是MEng转过来的话可能有一定灵活性\n- 做的好+导师愿意的话，直接转PhD。甚至有人MEng转来MS转去PhD(但也有失败的)。\n- 只适合不确定自己要不要读博，或者还需积累一点Research Exp的康本同学。\n\n## 申请季实时信息\n康本同学直接问在读的朋友们吧\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@Dartmouth.md",
"content": "## 录取偏好\n\n藤校，非常看 SoP 和代码 sample。\n\n## 代表性 dp\n\n## 网申备注\n\n申请费用只要 40 刀，非常非常的实惠\n\n## 项目特点\n\n可能给大额奖（50%-75%），甚至全额，但学费很贵，近$2w per term, 整个项目 7 个 terms. 非全奖学费仍然不低\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@Duke.md",
"content": "## 录取偏好\n\n招生规模小\n\n## 代表性 dp\n\n## 网申备注\n\n支持 Interfolio\n\n## 项目特点\n\nDuke 的 MSCS 比较 theory，class size 很小。找工可以选择 ECE\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@Emory.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@GWU.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@GaTech.md",
"content": "## 录取偏好\n\n不介意转专业。\n\n## 代表性 dp\n\n【22fall】SCUT 89+/100 前 3% 一段实习，三段国内科研\n\n## 网申备注\n\n## 项目特点\n\nGT 因为开设线上课程有大量 TA 机会，经济适用之选；有 coop，毕业出路参考[官方 dashboard](https://academiceffectiveness.gatech.edu/surveys/reports/georgia-tech-career-survey-salary-report-ay-2019-2020)\n\n## 申请季实时信息\n\n每年开奖都晚，并且没明确给 decision ddl\n\n拿到 offer 后，不需要交 deposit（占位费）\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@NWU.md",
"content": "## 录取偏好\n\n非常看 SoP，偏向海本。陆本建议申请第二轮，第一轮难度极大\n\n## 代表性 dp\n\n【22fall】有华 5 gpa3.6+被录的 dp \n【24fall】美本Top 35 本科CS+INF gpa3.8+ 3段research round2 AD \n【24fall】美本Top 35 本科CS gpa3.8+ 2段实习 round2 WL \n【24fall】陆本Top 15 本科SWE gpa3.85+ 2段实习 1段research 2区独立一作pub x1 round2 REJ\n\n## 网申备注\n\n一共三轮申请，注意时间：\n第一轮DDL：11月30日 (1月10日左右出结果)，\n第二轮DDL：12月31日 (2月10日左右出结果)，\n第三轮DDL：2月28日 (4月30日左右出结果)，时间详见[官网](https://www.mccormick.northwestern.edu/computer-science/academics/graduate/admissions/)\n\n出结果非常快，23年12月31日提交申请（24年1月18日交齐最后一封推荐信）2月2日一早就出结果了。西北是自己的系统，如果成绩单有加密需要去掉加密才能上传。\n\n## 项目特点\n\n比较 research 向的项目，class size 偏小：60 ~ 90左右，详细历年录取比例以及入学比例见[官网](https://tableau.northwestern.edu/t/TGS/views/OnlineDataMasters/OnlineData?iframeSizedToWindow=true&%3Aembed=y&%3AshowAppBanner=false&%3Adisplay_count=no&%3AshowVizHome=no&%3Amobile=true)。\n\n转博基本不可能，平均每年少于 1 人，需要教授答应提供 funding（Such a transfer request is only seriously considered if there is a CS faculty member who advocates the transfer and commits to financially supporting the student）。项目为 quarter 制，可通过project、thesis 分别延 1、2 quarter（可以同时 CPT），因此该项目最长可延至两年。\n\n## 申请季实时信息\n\n【23fall】在第一轮录取中, 根据地里的消息, 陆本全被拒。在第二轮录取中，地里有个位数的陆本被录取的dp, 非常不喜欢陆本, 近似认为陆本黑洞\n\n【24fall】第一轮UCSD最少8人被录取\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@NYU Courant.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n【22fall】SCUT 89+/100 前 3% 一段实习，三段国内科研，courant ad(4.15 之后通知的), tandon cs4 月初就没位置通知劝转 ce\n\n## 网申备注\n\n## 项目特点\n\n## 申请季实时信息\n\n申请的不多，但 tandon 申请的很多，这两年 tandon bar 涨的飞快\n\n## 介绍帖\n\n[【19Fall】NYU Courant MSIS/MSCS 一年总结 + 选课指南](https://www.1point3acres.com/bbs/thread-638807-1-1.html)\n\n[【22Fall】NYUCourantMSCS/MSIS一年感受](https://www.1point3acres.com/bbs/thread-989574-1-1.html)\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@NYU Tandon.md",
"content": "## 录取偏好\n\n倾向 CS 科班出身，高绩点选手。\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n## 申请季实时信息\n\ntandon 在 20fall 以前的 bar 应该是没有 courant 高的，在 20-21fall 左右持平甚至比 courant 还高。\n\n24Fall几乎只接收3.6 < GPA < 3.9选手，高于或低于区间都会被劝转CE或rej。\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@Purdue.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@Rutgers.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n先修满足的情况下转专业比较友好，适合中低 GPA 主申或者保底（3.2-3.7）\n\n## 网申备注\n\n## 项目特点\n\n公立校里学费比较贵了\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@SBU.md",
"content": "## 录取偏好\n申请时需要填四个方向（程序语言、算法、计组、OS）的专业课成绩\n## 代表性 dp\n【23fall】 华五 gpa3.41 两段实习 rej\n## 网申备注\nInternational申请者需要GRE\n## 项目特点\n偏学术和理论向，专排不错\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@SCU.md",
"content": "## 录取偏好\n\n可以转码，但是 prefer 满足大部分先修课的人，一共 7 门\n\n## 代表性 dp\n\n## 网申备注\n\n不用推荐信，不用 PS，7 天下 offer\n\n## 项目特点\n\n1.离硅谷近 2.带 co-op 3.项目 2 年，可以延长时间，刷实习，最多做三个（2 个 summer+1 个 co-op）4.分 Fall/Winter/Spring 三个 Quarter 开学 5.小班教育，class size 较小 6.嫂子班\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@SIT.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@SMU.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@Stanford.md",
"content": "## 录取偏好\n\n陆本每年抽奖者众多，录取极少\n\n## 代表性 dp\n\n【22fall】一个 18 级 HKUST 的大佬 (计算机 + 数学)，GPA 大概 4/4.3，有交换经历，做云计算的，科研有一篇二作一篇三作（20 年以来 citations：140+），实习有阿里云、腾讯优图、goldman sachs，ACM 区域赛金牌和银牌，录取\n\n## 网申备注\n\n## 项目特点\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@Syracuse.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@TAMU.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n与MCS项目基本相同，是论文的研究型硕士，转博情况待补充。\n据说MCS可以与MSCS互转，bar相差不大。\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@Tufts.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@UBC.md",
"content": "## 录取偏好\n\n- CS 科班 (偏好海本, 对陆本基本一视同仁, 主要看科研和成绩)\n- 科研型 (偏好有科研经历的同学: 参与科研, 做实验, 发论文等)\n- 高绩点 (一般至少 90+ and 高排名, 否则靠科研成果弥补)\n\n## 代表性 dp\n\n## 网申备注\n\n- 一般 15 Sep 开启网申系统, 15 Dec 截止递交申请.\n- 第二年二月到四月是主要面试/出 offer 的时间.\n- 该研究型项目基本是靠教授拍板招人, 所以要积极套瓷/面试.申请之前最好打听一下你感兴趣的方向有几个教授在招生.\n- 对于想申 CS PhD 的同学, 如果不是在美加取得硕士学位, 则基本上都不会直接录为 PhD, 而是先录为 PhD-Track MSCS, 然后一年后转博 (也可以选择不转, 两年硕士毕业).\n - 在申请 MSc in CS 项目的网申系统里有个选项, 可选择是否申请 PhD Track, 如果录取了则为 PhD-Track MSCS.\n- 往年录取比例见[官网](https://www.grad.ubc.ca/prospective-students/graduate-degree-programs/master-of-science-computer-science). 项目的华人占比约为 1/4 ~ 1/3.\n\n| 年份 | 2023 | 2022 | 2021 | 2020 | 2019 | 2018 | 2017 |\n|--------|------|------|------|------|------|------|-------|\n| 申请人数 | 1727 | 2025 | 2491 | 1799 | 1829 | 1319 | 1011 |\n| 录取人数 | 53 | 65 | 92 | 124 | 91 | 87 | 111 |\n| 录取比例 | 3.1% | 3.2% | 3.7% | 6.9% | 5.0% | 6.6% | 11.0% |\n| 注册入学人数 | 35 | 34 | 49 | 53 | 40 | 36 | 55 |\n| 总在读人数 | 112 | 123 | 123 | 109 | 115 | 110 | 101 |\n\n- 其它注意事项:\n - 注意[英语分数要求](https://www.cs.ubc.ca/students/grad/admissions/application-components-required-documents/english-proficiency-requirement).\n - 在注册完网申系统之后, 就可以开始排队[学校宿舍](https://vancouver.housing.ubc.ca/residences-rooms/residences/)了.\n - 宿舍分为 Winter Session 和 Year Round 两种, 在递交入学申请的同时就已经可以开始申请宿舍了 (YR 单人间一般要排队1-2年才排到).\n - 如果之后录取了, 有宿舍住会省一大笔开销 (学校宿舍单人间月租大约 1300-1500 加元; 在外面住月租通常 1500-2500 加元.)\n - 签证申请存在被安调的风险, 陆本 all in CA 需谨慎; 海本尽量在海外递交学签申请.\n\n## 项目特点\n\n- 科研型, 以 TA/RA 形式发放[津贴](https://www.cs.ubc.ca/students/grad/prospective/funding/financial). MSc 两年 CA$57,000+, PhD 每年 CA$30,000+, 基本可以 cover 学费 (每年 CA$9,500) and 食宿 (尤其住学校宿舍的话).\n- 奖学金方面: 新入学可能有 CS 系的新生奖学金; 其它奖学金可关注[官网](https://www.cs.ubc.ca/students/undergrad/advising-resources/awards-scholarships)发布的消息, 种类很多, 仔细阅读条件申请, 按时间主动提出申请.\n- 可选择的项目完成方式很多, 详见[项目官网](https://www.cs.ubc.ca/students/grad/graduate-programs)\n - [12 Credit MSc Thesis](https://www.cs.ubc.ca/students/grad/policies/grad-handbook/msc-program-toc/msc-program/12-credit-msc-thesis-thesis-masters): 两年制, 要找导师, 第一年修够学分, 第二年写毕业论文 Thesis, 答辩通过则毕业.\n - [6 Credit MSc Thesis](https://www.cs.ubc.ca/students/grad/policies/grad-handbook/msc-program-toc/msc-program/6-credit-msc-thesis): 形式类似 12 Credit MSc Thesis, 要修更多学分的课程, 但毕业论文 Thesis 要求弱一些.\n - [Master's Essay](https://www.cs.ubc.ca/students/grad/policies/grad-handbook/msc-program-toc/msc-program/masters-essay): 形式类似 12 Credit MSc Thesis, 修的课程有 Comprehensive 要求, 毕业论文 Essay, 与 Thesis 有区别.\n - [PhD Track within the MSc Program](https://www.cs.ubc.ca/students/grad/prospective-grads/grad-programs/phd-track-msc-program): 该项目提供转 PhD 的快速通道, 第一年修够课程、满足[RPE](https://www.cs.ubc.ca/students/grad/prospective-grads/grad-programs/doctoral-program)之后就可以在第二年转博; 也可以选择不转, 两年硕士毕业, 按 12 Credit MSc Thesis 项目.\n- 一些 UBC CS 的优势:\n - 学校专业: UBC 国际排名前五十, 加拿大前三, CS 也是 UBC 优势学科之一, 在北美声誉好.\n - 地理环境: Vancouver 环境优美、气候宜人, 沿海、靠南、临近美国西雅图. UBC 校园也绝美.\n - 人文环境: 温哥华繁华且包容, 吸引全球各国人士居住, 也是北美最大的华人聚居地之一 (其它: 多伦多, 纽约, 洛杉矶/旧金山).\n - 实习就业: IT 类工作数量虽不及 Toronto 更不及美国, 但也有很多机会, 一些知名公司比如 Microsoft/Meta/Amazon/TikTok/Huawei.\n - 获得身份: [BCPNP-IPG](https://www.welcomebc.ca/Immigrate-to-B-C/Skills-Immigration#IPG): 在[列表](https://www.welcomebc.ca/Immigrate-to-B-C/documents/BC-PNP-IPG-EEBC-IPG-Eligible-Programs-of-Study.aspx)中的硕士毕业后 拿到BC省的工作Offer并提供语言成绩 即可申请; 除 JD 和 MD 以外的所有博士取得 PhD Candidacy 后, 提供语言成绩 即可申请。\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@UCD.md",
"content": "## 录取偏好\n\n对先修专业课要求较高\n\n## 代表性 dp\n\n## 网申备注\n\n不要GRE（ECE是required）\n\n需要写phs\n\n## 项目特点\n\n偏学术向，课程方向以理论、AI为主，转博友好\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@UCLA.md",
"content": "## 录取偏好\n\n倾向于海本，海本 + 陆本占总项目约 40%\n\n难度高有部分原因因为 UCLA 的转 PhD 政策不错\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n本科生课 workload 偏大，研究生课偏 research。3quater 制，项目稍赶。做 research 的话方向比较分散，有些在 ece 有些在 math，需要自己联系。\n\n## 申请季实时信息\n\n24fall rolling decision时间跨度很大。\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@UCSB.md",
"content": "## 录取偏好\n\n非常关注和 prof 的 match 程度，sop 认真写真的会有 prof 认真看\n\n网传偏好海本但是陆本依然有希望，喜欢的话可以试试\n\n24fall 国际生录取比例为5%, 50/991, 申请性价比偏低。\n\n## 代表性 dp\n\n【22fall】SCUT 89+/100 前 3% 有方向很 match 的 Prof. 一段实习，三段国内科研\n\n## 网申备注\n\n## 项目特点\n\nTA 机会很多\n\n## 申请季实时信息\n\n## 介绍帖\n[【22Fall】UCSB计算机硕士项目就读体验](https://www.1point3acres.com/bbs/thread-954851-1-1.html)\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@UF.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@UIUC.md",
"content": "## 录取偏好\n\n可以当做 PhD/PhD 保底项目申请，非常看重推荐信\n推荐信 > connection >= pub > 三维\n录取上 POI 自主权很大，向 committee 提名即可大大提升录取几率；在有老师愿意当你的thesis advisor情况下；若三维达标，录取八九不离十\n\n## 代表性 dp\n\n【22Fall】上海 top2 89 分 T98(S24) remote 美国暑研，无 pub，有牛推，有多篇在投\n\n## 网申备注\n\n可能有面试，推荐提交申请前陶瓷POI\n\n## 项目特点\n\n研究型硕士，带 thesis，老师点头就可以转博。运气好老师可以给 RA-funding，托福口语达到 24 可以拿 TA funding 保底，可以看成 PhD 待遇\n所有学生均拿到全奖\n\n## 申请季实时信息\n\n2022fall 有申请 MSCS 被邀请录取 PhD 的 dp\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@UMD.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n研究型项目，录取人数少，class size小。但是近几年扩招趋势明显。\n\n~~UMD本科生很多，有机会找到TA，可以免学费+发工资。~~\n\n自2024年起，MS学生不再能获得teaching assistantship。即虽然仍可能找到TA工作，但是是hourly paid，不能免除学费。\n\n## 申请季实时信息\n根据orientation提供的信息，当年入读学生从2023年的40余人增加到了2025年的90余人。\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@UMN.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@UMass.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@UT-Austin.md",
"content": "## 录取偏好\n\ncommittee决定录取，录取数量极少\n\n## 代表性 dp\n\n## 网申备注\n网申需根据德州大学系统[`ApplyTexas`](https://www.applytexas.org/)先行进行注册和缴费，等待后续邮件通知后再在Austin CS网站提交个人信息。\n\n## 项目特点\n\n课程有些 theory，价格便宜，class size 很小，转博友好\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@UTD.md",
"content": "## 录取偏好\n\n转码友好。\n\n## 代表性 dp\n\n## 网申备注\n\n不交齐推荐信，不交申请费，材料也能被审核并且收到 offer。（**并不推荐大家为了省钱有意这么做**\n\n## 项目特点\n\n## 申请季实时信息\n\n永远奋斗在一线挽救失学儿童。\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@UVa.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n中国学生申请较少，地里比较冷门。\n\nGoogle target school\n\n可以做TA/RA，需要完成thesis，有读PhD机会，\n\n## 申请季实时信息\n24fall免申请费导致bar猛增\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@Vanderbilt.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@Virginia Tech.md",
"content": "## 录取偏好\n强prof导向，看重软背景，因为招生人数不算多，实际录取难度可能比较玄学。\n\n## 代表性 dp\n\n## 网申备注\n可能有面试，如果有意向导师建议陶瓷。\n\n## 项目特点\n两年制研究型硕士项目，毕业要求包括thesis。\n\n可以当pre-doc念，目前每年MS招生人数少于PhD。\n\n系里会提供TA funding，待遇与PhD一致。\n\n目前CS在持续招教授，尤其HCI方向的同学可以特别关注一下。\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@WUSTL.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n## 申请季实时信息\n\n2022 年开始玄学起来了\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@Western.md",
"content": "## 录取偏好\n\n西安大略的MSCS对于陆本的录取非常玄学\n\n## 代表性 dp\n\n【23fall】985/211 软件工程本 均分87（20%）雅思7.5 AD无奖\n\n## 网申备注\n\n- 3个track：Course-based, project-based, thesis-based\n - Course-based 不需要supervisor\n - Course-based 不需要SoP\n\n## 项目特点\n\n- 4 Terms (Full-time study)，毕业可拿3年PGWP工签\n- 位置在小伦敦，GTA以外，OINP+8分，拿卡友好\n- **不带CO-OP！**\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@Wisc.md",
"content": "## 录取偏好\n\nCS Under Major@US University\n\n## 代表性 dp\n\nAT Least GPA 3.8+\n\n## 网申备注\n\n## 项目特点\n\n非常难。要么是pub大佬（已知dp 6*pub ad），要么是美本3.8+\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@uAlberta.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n- Thesis-based项目需要3封推荐信，且需要指定supervisor\n\n## 项目特点\n\n- 全名是 Master of Science in **Computing** Science Program\n- 研究型看有没有导师捞，套磁很重要\n - 有单独的研究型SML分支：Statistical Machine Learning\n- 有个授课型分支叫：MSc with a specialization in Multimedia (CS-Multimedia)\n - 申请者最好有multimedia-related professional certificates/diplomas\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCS@uCalgary.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n- 只需要两封推荐信\n\n## 项目特点\n\n- 纯研究型，有Software Engineering方向\n - The Software Engineering specialization is offered jointly through the Department of Computer Science and the Department of Electrical and Software Engineering.\n- 要先**套磁**\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCSE@OSU.md",
"content": "## 录取偏好\n难度不大。\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\nOSU的计算机系这几年人事变动比较大，教授来来去去。\n因为是俄亥俄最好的大学，所以学校和当地的提供的资源，无论是就业还是学术其实都很多。\n整体学的内容还是偏向传统，前沿或者最新的科技比较少。\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCSE@PSU.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\nMS项目两年时间，很学术向，地方很村\n\n找工向有个MEng一年项目\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCSE@UCSC.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\nloc 很好，离 SV 非常近。学校在森林里 \n录取较为玄学，有转码有科班。class size小，印度学生录取数量远大于华人学生\nsanta cruz租房很难，要去的话建议尽早准备。\n## 申请季实时信息\n一般四月初出结果\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCSE@UMich.md",
"content": "## 录取偏好\n\nSJTU非JI学生不会受到特殊prefer\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n之前传闻找工氛围不好，近两年改观较大\n\n## 申请季实时信息\n\ndp 比较少，22fall 没见到几个录取\n\n23fall 地里没有见到陆本实名dp\n\n\n\n直接原因是就业形势不好，MSCS和SUGS(UM 4+1)共用名额，SUGS把MSCS名额几乎全用完了，导致MSCS压根没招什么人\n\n\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCSS@UWT.md",
"content": "## 录取偏好\n转码相对友好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n毕业证会写明Tacoma授予，与Seattle不同\n爽做两个coop, 村，生活成本低\n\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSCV@CMU.md",
"content": "## 录取偏好\n\n喜欢录取有 CV 顶会的；\n24fall更新：录取基本上需要paper，没有cv顶会需要强三维（90+110+330）+pub（一定要有科研产出）\n\n## 代表性 dp\n【24fall】WHU 90 分 2*CCF-B一作 T112(s28) G330+4 录取\n\n【23fall】WHU 91.5 分 一篇ECCV一作，一篇CVPR一作在投录取，中一篇这个项目非常稳\n\n【22fall】ZJU 90 分 一篇二作，一篇二作在投录取\n\n【20fall】华师大 86 分 一篇 AAAI 一作录取\n\n## 网申备注\n\n## 项目特点\n\nRI 下的 Professional CV 项目，MLE 率还不错，转博率低，SDE 也是主要出路之一。详细参考[官方 dashboard](https://www.cmu.edu/career/outcomes/post-grad-dashboard.html)\n\nRI单独把这个项目拎出来，[入口](https://admissions.scs.cmu.edu/account/login?r=https%3a%2f%2fadmissions.scs.cmu.edu%2fapply%2ffrm%3f857f530c-fb7d-4f58-8ed4-8ef6c01b0d4b)\n\n## 申请季实时信息\n### 24fall waitlist信息：\nMSCV这两年会在2月14号左右出第一批录取结果，答复时间是3月下旬；同时会把很多dp放入waitlist中。wl中的dp方差较大，很难说不是在养鱼；最后转正个位数的申请，会在第一轮答复ddl一周之内发offer。\n转正条件：找第一批录取了但是不准备去的申请人refer**没有用！！！**。能否转正只跟本身的bg和在waitlist大池子中的排序程度有关（这个排序也是按照三维+pub来的）。如果被放入wailist了不要找人refer，写一下love letter等结果就行。\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSD@Utah.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSE-SS@CMU.md",
"content": "## 录取偏好\n\n喜欢有领导力+实习经历丰富的人，23fall在读，项目里的人都是至少一段实习经历，很多本科生是多段实习，加起来有一两年那种，而且沟通合作都很舒服\n\n## 代表性 dp\n\n## 网申备注\n\n注意按照官网建议的要求写sop，回答对应的问题\n\n## 项目特点\n\n项目也着重培养软件方面的manager（晋升速度比CMU SCS average要快很多）。课程非常应用，涵盖方方面面（api design, quality assurance, DevOps, design pattern, software architecture, agile methods....），还有选修课可以任选两节12 units。\n\n暑假有强制的实习semester（要自己找，但是尽管市场多不景气，所有人都可以自己找到，上一届也是100%），然后第二年秋季（最后一个学期）是capstone project，和企业对接（项目给找）然后每周各种meeting完成项目的全流程开发（从用户故事这钟开始）。\n\n非常好的项目，很适合想要读个研直接就业的人，项目有自己的space、学习空间，厨房，研讨间等等，项目老师的support也超级好！\n\n去年申请从这个github repo收获了很多，现在回来contribute一下:)!!祝大家申请一切好运！\n\n出路详细参考[官方 dashboard](https://www.cmu.edu/career/outcomes/post-grad-dashboard.html)\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSECE@UIUC.md",
"content": "## 录取偏好\nUIUC本校ECE学生和ZJUI学生，前三年GPA达到3.9即可保证录取(provisional admission)；第一年带ta/raship全奖\n需要提交poi和三封推荐信\n本校学生不乏gpa3.6-3.7录取的案例；也有3.85软背景不过被拒的\n外校学生申请难度大，需自己套prof，有面试；和phd流程类似\n\n## 代表性 dp\n\n## 网申备注\n在Graduate College提交申请后，不要忘了去My.ECE提交兴趣领域表\n\n## 项目特点\n研究型硕士，带论文，可第二年转博，硕士学分可以算进博士毕业要求；一般也都有奖的\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSECS@JHU.md",
"content": "## 录取偏好\n\n理工科转专业友好。\n\n## 代表性 dp\n\n有 top2 gpa3.3+BATTMD 实习被录的\n\n## 网申备注\n24Fall fee waiver, 工院需要提交GRE，但CS不纳入考虑.\n\n## 项目特点\n\nworkload 较大；class size较小，两位数，diversity有优势；找工情况不错；有转PhD的dp\n\n巴尔的摩治安不好，但 JHU 校警很给力，校内安全有保障，出校有校车接驳。\n\n允许defer，可以defer半年或者一年; 无需deposit。\n\nresearch-oriented, phd manual 里说 \"If you transfer into the Ph.D. program from our master's program, then to align with the timetable you can approximately assume you are starting out as a second-year PhD student – the 1.5 - 2 years of an M.S.E. roughly approximates one year of a PhD.”\n\n## 申请季实时信息\n\n23fall难度仍然较低，但JHU MSECS在目前找工环境下较为flexible，也是research牛校，无论找工还是读PhD都出路不错，属于宝藏项目，预期24fall申请人数会迎来上涨。\n\n24fall fee waiver, 申请人数上涨.\n\n## 介绍帖\n[【19Fall】JHU MSE CS 长文介绍](https://www.1point3acres.com/bbs/thread-613474-1-1.html)\n\n[【21Fall】JHU CS 21Fall 入读体验](https://www.1point3acres.com/bbs/thread-817937-1-1.html)\n\n[【22Fall】JHU MSE CS 一个月就读体验](https://www.1point3acres.com/bbs/thread-932977-1-1.html)\n\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSECS@Princeton.md",
"content": "## 录取偏好\n\n项目要求很特殊，bar 主要高在卡口语 28，看中 TA 经历，对科研实习要求一般。“就是招人去给本科生当 TA 的。”\n\n很注重diversity，如果有被录取的学长学姐，千万别写同一个导师。\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSIM@UIUC.md",
"content": "## 录取偏好\n\n专业背景不限，转码友好\n\n## 代表性 dp\n\n## 网申备注\n\n语言不严卡104（24），不要GRE\n\n## 项目特点\n\nUIUC\n\nUniversity of Illinois Urbana-Champaign ×\n\nUniversity of Indian and Chinese √\n\n两年项目，23fall新加可一段coop（align with ECE MEng@UIUC）\n\n课程偏文商科，主要方向为DS和信息情报管理，不太适合基础差的\n\n## 申请季实时信息\n\n2022fall bar 有所上涨，平均 GPA3.57，申请者总数 1369，录取数 265（17%），93% 都是国际生，多数转码。\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSIN@CMU.md",
"content": "## 录取偏好\n\n录取非常玄学，看文书 match 程度\n\n## 代表性 dp\n\n【22fall】SJTU CS 系无 ad，两人 WL\n\n【21fall】SJTU 环境 90 分转专业录取 有 CS 二专和近乎完整的先修课\n\n【21fall】ECNU CS 系 3.8+，一科研一 BAT 实习 + 一外企实习\n\n## 网申备注\n\n## 项目特点\n\n出路详细参考[官方 dashboard](https://www.cmu.edu/career/outcomes/post-grad-dashboard.html)\n\n实习统计参考[官方报告](https://www.cmu.edu/ini/student-services/career_services/internship.html)\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSIS@NYU Courant.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n一半的学分在Courant修，另一半的学分可以在Stern修，而且选课优先级仅次于Stern MBA学生。可转MSCS\n\n## 申请季实时信息\n\n## 介绍帖\n[【19Fall】NYU Courant MSIS/MSCS 一年总结 + 选课指南](https://www.1point3acres.com/bbs/thread-638807-1-1.html)\n\n[【22Fall】NYUCourantMSCS/MSIS一年感受](https://www.1point3acres.com/bbs/thread-989574-1-1.html)\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSIS@UNC.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n【21fall】SCU 生信本科，GPA 3.35/4, T 98\n\n## 网申备注\n\n## 项目特点\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSIS@UT Austin",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\nUT支持一份申请费申请多个项目，除了非常热门的UT ECE可以再试一试这个项目，详见[官网](https://ischool.utexas.edu/programs/msis)\n## 项目特点\n偏文的交叉项目，涉及UX， DS以及HCI等等；\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSMITE@CMU.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n前身是 MSIT-MOB，就业非常华丽。第一年在 Pitts，第二年在 SV，INI 课改后需要关注硬件课增多。\n\n出路详细参考[官方 dashboard](https://www.cmu.edu/career/outcomes/post-grad-dashboard.html)\n\n实习统计参考[官方报告](https://www.cmu.edu/ini/student-services/career_services/internship.html) \n\n2024.9 新生入学更新\n\n目前感受到的优点：\n对SDE方向，特别是对嵌入式有兴趣的同学来说性价比极高。课程质量高，选择多，如果暑期上513，三个学期的standard track也可以轻松一学期一门，两门System课保底，在SV校区也有少量精品课可以选择，比如Embedded System，Cloud Computing，再加上CSAPP，神课能上四门。INI自己开的必修课，和其他一些没那么热门的选修课，质量虽然比不上CS，但是比有些项目课程软件还是硬件都无法自主要强了太多，顶多是SDE方向被迫学学Security，Embedded，Networks这种程度。总体来说，课程质量是同申请难度项目中一流的。\n同时INI找工氛围浓郁，大家目标一致，更容易认识志同道合的同学。第一年选课跟MSIN基本一样，同学水平都很高。\n到24Fall为止，奖学金申请即得，最低5000刀（总共）。\n\n缺点：\n必须折腾换地方，做质量未知的Practicum。\n必修 安全，网络，嵌入式三门课，可能会有些耽误时间。同时选CS学院开设课程的优先级肯定没有CS自己人高，但是比如如果一学期想在三门热门课中挑两门上，还是很容易选到的。\nWorkload大，不利于刷题。\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSML@CMU.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n【22fall】ZJU 90 分 一篇二作，一篇二作在投录取\n\n【22fall】SJTU 密院 dd 两篇顶会二作在投 两篇一作非常普通不知名发表 录取\n\n## 网申备注\n\n## 项目特点\n\nML 系下的 Professional ML 项目，出路详细参考[官方 dashboard](https://www.cmu.edu/career/outcomes/post-grad-dashboard.html)\n\n## 申请季实时信息\n\n22fall 感觉 bar 有所降低，并不卡 pub。但项目每年人数大概<=40，所以 bar 在这一档的学校里是偏高的。\n\n23fall 难度变高，不少top30 甚至 top10 PhD录取同学被拒\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSR@CMU.md",
"content": "## 录取偏好\n\n可以当做 PhD 申请\n\n## 代表性 dp\n\n【22fall】SJTU 密院 dd RISS 暑研 两篇顶会二作在投 录取\n【22fall】UCLA CS 本 GPA4.0 一段 robo 相关 research 录取\n\n## 网申备注\n\n非常看中Pub，非常看重推荐信（但是也比较玄学，好友6pub也rej了）\n\n## 项目特点\n\nRI 下的 2 年带 thesis 科研型硕士，转博率不错，出路详细参考[官方 dashboard](https://www.cmu.edu/career/outcomes/post-grad-dashboard.html)\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSSI@JHU",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n## 申请季实时信息\n\n## 介绍帖\nM.S. program in Security Informatics\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSWE@UCI.md",
"content": "## 录取偏好\n\n有一定先修课转码友好项目\n\n会拒掉OQ的人，BG较好的不建议将其作为保底\n## 代表性 dp\n\n【21fall】海本 数据科学 3.5+ 有 os/db/stats/Java/C++/Python 课\n\n【21fall】清北 测绘 3.65+110\n\n【21fall】 top30 ece 3.54+100+326\n\n## 网申备注\n\n## 项目特点\n\n适合非科班申请，24fall绝大部分录取均为非科班。\n\n## 申请季实时信息\n\nbar 一年比一年高，22fall 左右很少看到 3.5 一下的被录取，也可能是没报。\n\n## 介绍帖\n[【22Fall】UCI MSWE 文转码最新就读体验](https://www.1point3acres.com/bbs/thread-974811-1-1.html)\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MSc@UofT.md",
"content": "## 录取偏好\n\n此项目因为国际生 tuition 比较高，是全奖研究型硕士，所以录取国际生就读 MSc 并不如录取 PR 或加籍学生划算。国际生可以申请 PhD\n\n## 代表性 dp\n\n22fall UBC 大三大四所有课90+，有一段科研，无publication，三封推荐信都来自 UBC 本校的教授。无套磁，无面试直接录取，2月初下的 offer\n\n## 网申备注\n\nUofT 的 direct-entry PhD 中途是不给 master degree 的。建议 domestic 学生申请 MSc 不用申请 direct-entry PhD 这样中途可以多拿一个学位。\n\n## 项目特点\n\n整个项目时长 17 个月。总共需要上 4 节课并且完成一篇 Thesis。想转博的同学可以在导师手下直接转（ 第一年9月入学的话，第二年12月可以转 PhD ）\n\n## 申请季实时信息\n\n22fall 有同学误申了 MSc 之后申请转申 MScAc，面试后录取\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/MScAc@UofT.md",
"content": "## 录取偏好\n\nUofT 录取看大三 GPA，对陆本非常友好（指对北美校没有额外优惠）\n\n## 代表性 dp\n\n【22fall】SJTU CS 88+ ACL 一作 1 年 MLE 实习，第一轮面试和录取\n\n【22fall】THU 信院非 cs，3.84/4.00，G323 T103，MSRA 8 个月实习，一篇 ML 顶会二作在投，给了第一波面试和录取\n\n## 网申备注\n\n截止挺早的，有面试，每个月出一轮结果，最早一轮 22fall 12.21 就放了\n\n录取是rolling admission，最早发offer的是学校觉得所有申请人中最好的，之后依次递减\n\n每年总申请人数差不多在1500-2500之间，总共录取150人左右\n\n需要另外写文书，针对几个问题\n\n网申只填大三 GPA\n\n## 项目特点\n\n8 个月上课（workload 很低）+ 8 个月 applied research 实习，实习工资 65k，tuition 45k。\n\n实习是保证上岸的，实习公司和项目可以看 ARIA (applied research in action) 历年的情况，有 return offer 机会\n\n项目整体偏 MLE，实习自己找 SDE 需要学校同意，听说操作不难。\n\n由于学校在多伦多市区，毕业申请 PR 的 OINP 省提名加分不如 Waterloo 等一些远离多伦多市区的学校。\n\n## 申请季实时信息\n\n## 介绍帖\n[【22Fall】多大MScACSDE方向项目介绍&找工](https://www.1point3acres.com/bbs/thread-987256-1-1.html)\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/NetSys@UCI.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n- 选 cs 课自由，项目时长灵活，可当 TA/RA\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/One-Year MSCS@Yale.md",
"content": "## 录取偏好\n\n~~GRE 严卡 328~~，浙大友好。23 fall有录取不少GRE<328的同学\n\n转专业可抽一波彩票，重三维\n\n## 代表性 dp\n\n【22fall】ZJU 90+ GRE325 被拒\n\n【22fall】 SCUT 3.9+ GRE329 ad\n\n【20fall】 top30 CS 3.8+ ad\n\n## 网申备注\n\n支持 Interfolio，但提醒说 Interfolio 不会填写 Evaluation form。\n\n## 项目特点\n\n一年制的项目。一届 30 人左右基本都是国人，海本陆本对半开，中游左右 985 各收一个左右。过去就要开始准备面试所以比较仓促。workload 看选课，有水有硬但是但是 class size 普遍很小，和本科生一起上。因为人均资源多也有人联系教授进组做 research。位置相对比较村，离 nyc 也有一定车程。找工情况好像不错，总体上岸率还是很高的。\n\n## 申请季实时信息\n\n22fall 疫情年 GRE 要求仍然没有放松\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/PCP@Wisc.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/SES@NEU.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/SESV@CMU.md",
"content": "## 录取偏好\n\n比较看重 SoP，有大段实习经历，出身好，低 GPA 可以逆袭\n\n建议early ddl申请\n\nApplied track 2023 Fall之后不再招生\n\n会发很多defer到春季的录取\n## 代表性 dp\n\n## 网申备注\n\n网申中要求 software engineering 的 essay\n\n## 项目特点\n\n出路详细参考[官方 dashboard](https://www.cmu.edu/career/outcomes/post-grad-dashboard.html)\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/ScM CS@Brown.md",
"content": "## 录取偏好\n\n~~申请者的专业名不是 CS 就别送钱了~~ 近两年或许情况有变，现在有陆本非CS的dp了\n\nMS 严卡托福 105\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n一直以来的小 class size\n\n学校 support 非常好，有研究生工位\n\n## 申请季实时信息\n\n22fall 扩招中，需要关注 class size 相较之前变大\n\n24fall 官方预计入读总人数为130+，微信offer holder group内bg调查结果：https://docs.google.com/presentation/d/11ruKcNZc-_Y7Uu4o1E9Vw-oBi05lb4Gy/edit?usp=sharing&ouid=108807744109224173527&rtpof=true&sd=true\n\n## 介绍帖\n[【22Fall】Brown CS 一学期就读体验，推荐追求wlb以及找工的同学选择](https://www.1point3acres.com/bbs/thread-953121-1-1.html)\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/Two-Year MSCS@Yale.md",
"content": "## 录取偏好\n托福口语严卡26分，因为需要学期内做TA\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n2023fall新开项目，研究型\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/Visual Computing@SFU.md",
"content": "## 录取偏好\n\n## 代表性 dp\n\n【23Fall】ZJU GPA3.3/4 录取\n\n【23Fall】985/211 均分87.5 T107 G321 录取\n\n## 网申备注\n\n## 项目特点\n\n- Master of Visual Computing 比较偏ml和cv\n- Co-op可以4个月（16个月毕业）或8个月（20个月毕业）。\n- 根据学校提供的2024年三月底的Co-op数据：_\"Current Co-op placement in VC programs (Cohort 2023) is 42%\"_。Co-op如果summer没找到fall可以接着找。\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n"
},
{
"path": "docs/alumni.md",
"content": "# OpenCSApp Alumni\n\n??? note \"Code of OpenCSApp Alumni\"\n OpenCSApp希望帮助connect校友找组织\n\n## 2023 Fall\n\n### Flash {align=left style=\"height:8em; border-radius:50%\"}\n\n**From** BS CS @ SJTU\n\n**To** CS PhD @ NYU Courant\n\n**Contact**: [Homepage](https://xichenpan.com/) [Email](mailto:xcpan.mail@gmail.com)\n\n## 2022 Fall\n"
},
{
"path": "docs/blog.md",
"content": "# Blog\n\n!!! note \"提交指南\"\n Blog内容和格式不限，以经验分享为主，建议包括个人基本情况和录取结果。首先拷贝以下模板，并点击[Blog列表](https://github.com/opencsapp/opencsapp.github.io/edit/master/blogs_list.yml)添加新Blog标题。然后[点击此处](https://github.com/opencsapp/opencsapp.github.io/new/master/docs)创建新文件，保持文件命名与[Blog列表](https://github.com/opencsapp/opencsapp.github.io/edit/master/blogs_list.yml)中标题一致，进行内容填写后PR即可。Tips: 插入图片直接拖入GitHub编辑器即可，图片将会被上传到GitHub官方图床。\n \n``` markdown title=\"Blog模板\"\n---\nhide:\n - navigation\n---\n\n***Write in Here***\n\n[回到列表 :fontawesome-solid-house:](blog.md){ .md-button }\n\n```\n\n$blogs_list\n"
},
{
"path": "docs/contribute.md",
"content": "# 内容征集 | Call for Contribution\n\n欢迎来到 Open CS Application，本站内容开源协同创作，欢迎用户贡献内容！由于现存内容多来自于几个核心 contributor，难免存在 bias，如果你在浏览过程中发现无论是项目信息有误，还是选校梯度值得商榷，我们都诚挚邀请你顺手 PR 一下帮助我们修正与改进。同时目前仍有大量项目信息不全，如果你了解该项目，我们也诚邀你通过 PR 留下你了解到的信息，帮助我们继续完善。所有贡献过内容的同学都将被记录在[贡献者](contributor.md)名单中，以感谢对我们的支持。\n\n## 如何提交DataPoints\n\n请按照[DataPoints©提交](submit.md)中的指引进行操作\n\n## 如何贡献内容\n\n### Pull Request（推荐）\n\nPR (Pull Request) 是基于 Git 的协同创作方式，允许用户方便地进行贡献内容，允许维护者进行审核。\n\n下面演示通过 GitHub 网站进行无代码 PR 的最佳实践\n\n点击想要更改的页面右上角的编辑图标（铅笔形状），注意编辑选校梯度直接点击[选校梯度](grade.md)页面编辑按钮\n\n \n\n \n\n初次提交点击`Fork this repository`将仓库 fork 到自己的账户下\n\n \n\n在窗口内使用 Markdown 语法直接进行更改，点击`Propose changes`完成更改\n\n \n\n点击`Create pull request`向`Open-CS-Application.github.io:master`分支发起 Pull Request\n\n \n\n点击`Create pull request`确认创建 Pull Request\n\n \n\n等待 Pull Request 审核通过后，内容会被自动编译并部署到网页，不需要用户进行额外操作。\n\n \n\n### 通过QQ 群手动更新\n\n1. 点击想要更改的页面右上角的编辑图标（铅笔形状）\n\n2. 复制文档内容到本地进行更改\n\n3. 群中@群主和管理员提供你更改后的文档\n\n### 评论区\n\n欢迎在评论区讨论，维护者会精选信息编入 pages\n\n## 如何更新梯度\n\n请直接点击更新[选校梯度](https://github.com/opencsapp/opencsapp.github.io/edit/master/programs_list.yml)，并进行PR\n\n## 如何添加新项目\n\n首先点击[选校梯度](https://github.com/opencsapp/opencsapp.github.io/edit/master/programs_list.yml)添加新项目（顺序随意即可，脚本会自动调整）。然后拷贝以下项目模板，并[点击此处](https://github.com/opencsapp/opencsapp.github.io/new/master/docs)创建新文件，保持命名与[选校梯度](https://github.com/opencsapp/opencsapp.github.io/edit/master/programs_list.yml)中一致，完成内容填写后PR即可。\n\n``` markdown title=\"项目模板\"\n## 录取偏好\n\n## 代表性 dp\n\n## 网申备注\n\n## 项目特点\n\n## 申请季实时信息\n\n## 介绍帖\n\n[回到列表 :fontawesome-solid-house:](grade.md){ .md-button }\n\n```\n\n## 如何添加Blog\n\nBlog内容和格式不限，以经验分享为主，建议包括个人基本情况和录取结果。首先点击[Blog列表](https://github.com/opencsapp/opencsapp.github.io/edit/master/blogs_list.yml)添加新Blog。然后拷贝以下Blog模板，并[点击此处](https://github.com/opencsapp/opencsapp.github.io/new/master/docs)创建新文件，保持命名与[Blog列表](https://github.com/opencsapp/opencsapp.github.io/edit/master/blogs_list.yml)中一致，进行内容填写后PR即可。\n\n``` markdown title=\"Blog模板\"\n\n***Write in Here***\n\n[回到列表 :fontawesome-solid-house:](blog.md){ .md-button }\n\n```\n"
},
{
"path": "docs/contributor.md",
"content": "# 感谢所有[贡献者](https://github.com/CS-Masters-Application/CS-Masters-Application.github.io/graphs/contributors)们\r\n\r\n:heart_eyes: YOUR WORK IS APPRECIATED\r\n\r\n:key: INFORMATION MATTERS\r\n\r\n\r\n \r\n\r\n"
},
{
"path": "docs/datapoints.md",
"content": "---\nhide:\n - navigation\n - toc\n---\n\n# Open CS Application DataPoints©\n\n??? note \"请先阅读使用指南\"\n 1. DataPoints©是host在SeaTable上的数据库，支持方便的过滤，排序，和分组，上手难度低。支持Python SDK，SQL Query等高阶操作，有需要的用户可通过[用户手册](https://seatable.cn/help/)和[Bilibili教程](https://space.bilibili.com/1305719772?spm_id_from=333.337.search-card.all.click)学习。\n 2. 该数据库共分为四个子表，分别为DataPoints, Progress，申请者信息，项目列表。申请者信息表每条记录对应一个SeaTable Account，记录了申请者的详细背景；项目列表每条记录对应一个项目；DataPoints每条记录链接到一个申请者和一个项目，使得用户可以方便地按照用户或项目浏览或检索；Progress与Datapoints类似，用于汇总各校进展（Tips：双击申请者和项目字段单元格可以打开链接内容；鼠标悬浮在行号上可以点击查看该条记录）\n 3. 该数据库遵循[Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License](http://creativecommons.org/licenses/by-nc-sa/4.0/)， 公益开源，期待用户根据[DataPoints©提交](submit.md)中的指引提交你的申请结果，帮助到更多的申请者！（Tips：希望匿名的用户可以提交前先到[SeaTable Profile](https://cloud.seatable.cn/profile/)修改头像和昵称）\n 4. 可以通过视图对数据进行分析查看，点击左上角下拉菜单，可以选择预设视图。用户也可以自行添加视图进行数据浏览。\n 5. 鼠标悬浮在列头上的i符号，可以查看该字段的详细说明\n 6. 点击右上角插件，可以体验高级统计统计，时间线，高级查询功能。其中高级统计功能预设了几组可视化图表\n\n\n\n[:fontawesome-solid-square-poll-horizontal: 提交新 DataPoints](submit.md){ .md-button .md-button--primary } [:fontawesome-solid-pen-to-square: 在 SeaTable 中浏览](https://cloud.seatable.cn/dtable/external-links/ff48695db50e48358d5b/){ .md-button}\n"
},
{
"path": "docs/faq.md",
"content": "# Frequently Asked Question (FAQ)\n\n欢迎评论区提问，管理员会回答后编入本文档\n\n## 常用词缩写 (Random Order)\n\ndp: datapoints\n\nAD: Admission\n\nRej: Rejection\n\nPoI: Professor of Interest\n\nLoR: Letter of Recommendation\n\nPub: Publication\n\nap: assistant professor\n\nao: admission officer\n\nvo: visa officer\n\ncom/comm: committee\n\nIRCC: Immigration, Refugees and Citizenship Canada\n\nSTEM: Science, Technology, Engineering, and Math\n\nSDE: Software Development Engineer\n\nMLE: Machine Learning Engineer\n\nRS: Research Scientist\n\nDS: Data Science\n\nMS/MSc: Master of Science\n\nMASc: Master of Applied Science\n\nMEng: Master of Engineering\n\nScM: Science Master\n\nMPhil: Master of Philosophy\n\nDPhil: Doctor of Philosophy\n\ndecline/accept: 拒绝/接受offer\n\ndeposit: 入学前的押金\n\nCong: Congratulations\n\nI20: 接offer之后学校签发的文件，用于办签证\n\nbar: 准入门槛，指录取难度\n\nco-op: Cooperative education，学期内官方带薪实习。\n\n## 背景\n\n### 我目前大二，想要考 TOEFL，在申请的时候有效吗？\n\n有很多学校要求 TOEFL 成绩在入学的时候没有超过两年，所以以 24fall 为例，为了保证你的成绩有效，你应该在 2022 年 9 月 1 日之后进行 TOEFL 考试。\n\n### 托福成绩够 100 分了，但是口语不到 20 分，需要再刷吗？\n\n需要，根据往年 Datapoints 来看，口语低于 20 对申请有一定影响（扣分），且有一些学校硬卡口语小分，建议有时间再刷一刷。\n\n### 我想申请PhD，但是背景还不够好，先去读MS合适吗？\n\n不推荐，除非你的ms是research msc，或者已经和POI说好了去了就进组research（可以提高你return offer的机会）。其他情况下你不确定你是否有match的POI，是否有足够的研究机会，课程压力是否太大，费用是否太高等等。更推荐直接去做RA，最好是能去和想申学校在同一个学术圈中的老板那里RA，这种一般是self-funded，门槛较低，好处是全职RA，不用上课，而且不合适随时可以quit换人，非常灵活。并且没有master学位，在申请时候仍然是本科直博，会比有master学位的要求低。\n\n### 如何选择RA老板？\n\n建议选择影响力高，hands-on，intern数量少的，这样可以最大化你推荐信的牛度以及强度。相反，学校title，老板是否为tenure影响都相对较小\n\n### 我是ECE/DS/SE/IS/IM等项目的研究生，会不会影响我找CS系老师做RA？\n\n大部分情况不会，但部分学校如CMU据观察SCS的老师比较少招其他院的RA。\n\n## 选校\n\n### 为什么加拿大授课项目大都是 ECE Meng？\n\n因为加拿大的 ECE/CS Master of (Applied) Science 都是全奖研究型项目，不是为了上课招工设计的。这里不用 care CS title 的问题。\n\n### 美国有研究型硕士吗？\n\n有，但是很少，比如 UIUC MSCS/CMU MLT/CMU MSR 等，是少数的研究型硕士项目，一般可以争取到 TA/RA 奖。\n\n### 有哪些好转PhD的项目？\n\n首先，美国绝大部分项目都没有Internal Transfer到PhD的途径（加拿大全奖研究型硕士一般可以很方便地转PhD，只要老板同意即可，还可以免除Thesis），都需要重新走申请流程。所以该问题其实是问有哪些项目对申PhD帮助更大，以及哪些学校会prefer招本校master student。第一个问题建议选workload低，有match PoI（最好已经答应进组），项目时间长的，可以参考[这里](https://opencs.app/faq/#phdms)。对于第二个问题，可以看系里各个教授的Lab Members，有没有相当一部分是本校的MS。\n\n## 网申\n\n### 如果项目主页只给了 Institute Code，没有给 Department Code，送分的时候应该如何选择？\n\n这种项目是送分统一送到学校的办公室，各个项目都可以 access 到送到学校的分数，只需要选择 Institute Code 即可，Department Code 没有影响，任意填写即可，一般可以选择 99\n\n### IELTS/TOEFL/GRE 需要提前多久送分？\n\n目前都是电子送分，根据很多项目 FAQ 的描述，ETS 每周两次将分数送到学校，送分之后网申界面没有显示 Verified 是因为小秘没有帮你 match 分数。所以在 ddl 前送分即可。\n\n另外，对于申请**加拿大**的大多数项目，似乎不需要提前送分（具体可查看官网要求或者咨询小蜜），申请时一般只需要在网申页面上传IELTS/TOEFL/GRE的PDF成绩单即可，仅当被正式录取后才需要安排送分。\n\n### 我是半年前/一年前考的 TOEFL，当时送了分，现在还需要再送一次吗？\n\n一年内的送分不需要重新送，部分学校会将超过一年的送分记录删掉，所以可以问一下小米自己的送分是否在在档 (on file)\n\n### 申请越早提交越好吗？\n\n看情况，**大部分项目**都是在申请 DDL 之后整理材料进行 review，所以早交没有好处，不如继续打磨材料，丰富背景，到了 DDL 之前再提交；但是对于某些rolling（滚动录取）的项目，比如CSG@NEU，ECE@uOttawa，ECE@Waterloo等，早提交的确有助于早点拿到录取结果。需要注意，有部分学校的申请系统有部分操作是由小秘手工完成的，如 Waterloo，Austin 等，需要交完申请费后等待他们发给你账号，所以建议至少提前 5 天注册一下申请系统，了解申请流程。\n\n### 我的申请没有提交，推荐信链接会发送给推荐人吗？\n\n会的，一般分为两种申请系统。大部分为第一种，在网申系统内有 send 的操作，可以手动发送链接给推荐人，或者是填写完推荐人信息之后自动发送；第二种是先填写基本材料交申请费之后，学校会发送推荐信链接，比如 Waterloo，但是在交完申请费之后 SoP 和 CV 等是到另一个网站提交的，所以不用担心过早提交自己的材料还没准备好。\n\n### 我的推荐信 DDL 前没有到怎么办？\n\n大部分学校都有长达数周甚至一个月以上的 tolerance period，大部分推荐人都是很忙的，很可能会造成 delay。并且以 12.15 结束的项目为例，申请 ddl 之后一段时间 volunteer 会整理材料，之后才会正式的开始审材料，中间又有圣诞节（一般行政人员在 12.23-1.3 放假），所以很多时候都是到了圣诞假结束才会正式开始 review，不需要太着急。\n\n### 我的推荐信 DDL 前没有到，且项目明确注明了推荐信 ddl 应该怎么办？\n\n有一些项目存在这种情况，但是这个时间也不是完全卡死的，如果你的信没有到，可以发邮件和小秘说明情况，要求额外的时间，大多数情况都会获得积极回复。\n\n### DDL 只给了天数，一般具体是什么时候啊？\n\n一般是当地时间的 23:59 pm，可以使用[time.is](https://time.is/)网站进行查询。注意有些项目会明确注明截止时间，如 CMU SCS。\n\n### 推荐信中需要推荐人针对每一个项目进行更改吗？\n\n不需要，直接使用“your program”的表述即可。\n\n### SoP 需要针对每一个项目进行重构吗？\n\n如果是你非常重视的项目，且非常 match 你也觉得有话可说，可以这么做，大部分情况下只需要简单修改 why school 和 future goal 部分即可。\n\n### SoP 中的 Why School/Program 部分应该怎么写？\n\n建议浏览一下项目主页，很多项目都会介绍自己的优势，比如 msin 重点介绍了他们的 placement 很好，career support 很好，Pittsburgh 的 location 很好，校友网络很好，reputation 很好，就可以根据这些角度来写。\n\n### 我的 SoP 中出现的一些 typo，会影响录取吗？\n\n是不会影响的，因为审材料的时间非常有限，尤其是对于 MS 申请而言，这些 typo 极大可能不会被发现，只要别是写错了项目名称和学校名称这种错误，都不会造成影响\n\n### SoP 字数超了，有影响吗？\n\n如果仅仅超出一点，一般不会看出来，如果超的太多有负面影响。这个问题涉及到程序正义，是西方人比较 care 的一个点，如果因为你的 SoP 在规定字数外通过更多的 detail convince 了 AO，对于其他申请者是不公平的。\n\n### Video Essay 主要考察什么？\n\n是考察口语水平，可以参考这个[Quora 回答](https://qr.ae/prYfVB)\n\n### 双盲的在投论文可以写进CV里吗？\n\n可以参考Author Guideline，大部分AI Conference都只要求不主动宣传即可，作为申请材料是完全OK的，如果有Arxiv preprint也可以把链接放进CV。其他领域可能会严格一些，可以使用伪标题，写明Under Review，authorship写成1st author publication这种即可。\n\n### 提交后如何更新实习/科研/论文？\n\nPhD申请随时可以和POI update，对于MS，大部分学校是不支持update的，有一些学校可以通过portal update，比如Yale，CMU SCS（仅限论文）。没有写明的可以和小秘发邮件，问一下是否可以帮忙update CV即可。\n\n## 录取\n\n### 某些学校有几轮申请，有什么区别，我应该申哪一轮？\n\n这种情况主要分为三类，一些项目如 NWU 是每轮一个 pool，可能造成不同轮次之间难度不同，这个需要根据往年 datapoints 进行 tradeoff；另外也有像 CMU MSIN 这种项目，设置一个 priority ddl，但是两轮材料是一起 review 的，priority round 只是省了申请费，并不能帮助你更快地获得申请结果，也不能和后一轮的同学分开录取，学校这样做的目的是分流申请提交时间，给 volunteer 留下更多的时间进行材料的整理；还有一种情况类似于 NEU CS 的录取，其中隐形地分出了一些轮次，同时是 rolling base 的录取，交的太晚会导致没有 available position，所以建议这种还是尽早提交。\n\n## PhD 申请\n\n### 哪些老师有招生资格？\n\n一般来讲 tenure-track 的老师都可以招生，同时如果你申请了某学校的 CS PhD 项目，可以关注其 CS 系的附属教师（共同任命），这些老师可能是 ECE/Cognitive Science 等等系的 faculty，但是也可以在 CS 系招生。\n\n### 如何筛选 POI？\n\n推荐几个方法，首先可以通过 CSRankings 进行初筛，非常快速方便，但是一个弊端是这种筛选只关注了论文数量，可能没有发现一些数量少质量高的 POI；还有一种方式是从官方的 faculty list 中遍历，这种方式的好处是不会遗漏任何一个老师（除了少数刚来的 AP），但是弊端是工作量非常大，很多学校的 faculty list 过于冗长又没有老师的研究兴趣，比如 GaTech CoC。在以上两种方式的基础上，可以通过另外两个辅助方式进行查漏补缺。分别是可以在 Computer Science Professors/Twitter 上查找新入职的 AP；另外一个是可以使用 Google 搜索 学校如 CMU + 你的研究兴趣如 Natural Language Processing + site:github.io，这种方式可以很方便的搜到各个 PhD 学生的主页，看他们的研究兴趣就可以顺藤摸瓜找到他们的老板。上述这些网站都可以在[外部链接](link.md)中找到。\n\n## 签证\n\n### 美国F1签证拒签风险大吗？\n\n非10043基本没有被拒签的，大部分是check1-3个月。\n\n### 美国F1签证CS专业有可能水过吗？\n\n有可能的，但是属于个例，大部分还是会被check。\n\n### 被check一定是一年签吗？\n\n被check有小概率拿到五年签；水过一定是五年签\n\n### 存在哪个领馆比较容易水过吗？\n\n一段时间内存在，因为水过和分配的VO强相关，但VO不会固定呆在一个使领馆，所以长期来看各个使领馆签证都差不多。\n\n### 加拿大签证安调风险？\n\n参考[加拿大study permit安调情况 by Flash](https://opencs.app/%E5%8A%A0%E6%8B%BF%E5%A4%A7study%20permit%E5%AE%89%E8%B0%83%E6%83%85%E5%86%B5%20by%20Flash/)\n"
},
{
"path": "docs/grade.md",
"content": "!!! note \"用法\"\n 1. 请先阅读[使用指南](guide.md)\n 2. **黑体代表CS title项目**，*斜体代表非CS title项目*\n 3. 点击项目名即可进入项目详情页\n 4. [:book: 选校梯度历史记录](https://githistory.xyz/opencsapp/opencsapp.github.io/blob/master/programs_list.yml)\n 5. 点击下方[ :fontawesome-solid-pen-to-square: 编辑此页面](https://github.com/opencsapp/opencsapp.github.io/edit/master/programs_list.yml)按钮修改选校梯度\n 6. 添加新项目请阅读[此处指南](https://opencs.app/contribute/#_4)，陆本黑洞指完全无陆本录取的项目，梯度不确定的可归入待分类\n\n[:fontawesome-solid-pen-to-square: 编辑此页面](https://github.com/opencsapp/opencsapp.github.io/edit/master/programs_list.yml){ .md-button .md-button--primary }\n\n$programs_list\n"
},
{
"path": "docs/guide.md",
"content": "## OpenCSApp 的创作初衷\n\n1. 快速建立对项目申请难度的认知，轻松地根据背景进行项目初选\n2. 快速了解有哪些同档项目可以选择，避免遗漏项目\n3. 了解项目特点和录取特点，根据背景扬长避短，合理选校\n\n## 创作声明\n\n1. 选校梯度以针对陆本的**录取难度**作为排序标准，产生方法是 22 fall 申请季中贡献者们对项目难度的群体认知\n2. 选校梯度表和项目详情页的内容可能会非常主观，与客观现实存在偏差\n3. 项目的 general 录取难度高并不代表项目好，更确切地说并不代表项目能 match 申请人的读研目的\n4. 项目对申请人来讲是否是好项目，主要看项目的特点和申请人目的是否匹配。考虑因素可能包括地理位置，气候情况，治安状况，项目花销，带奖机会，生活成本，梦校情结，国外名气，回国名气，是否考公目标校，回国落户，项目口碑，项目长度，实习情况，Co-op，scheduled break，就业支持，科研机会，科研口碑，faculty 规模，转博机会，往届出路，校友资源，CS title，课程质量，选课难度，workload，class size，peer pressure，项目氛围，国人占比，移民政策，家庭因素。多数申请人在申请初期会非常热衷于选择有梦校情结，国内外名气高的项目，但事实上这只是需要考虑因素的一小部分。在如此多的考虑因素中，申请人更应当根据自己读研的目的，或者说初心，来根据自己重视的因素，加权出对于自己最好的项目\n5. 很多项目因为样本过少 (尤其 B-/C+/C 的项目)，选校梯度很可能并不准确\n6. 申请人不应完全依赖本文档信息，应当参考文档信息自主决策\n7. 可以参考 [CS 选校之禅](zen.md) 中的选校思想\n\n## 错误选校思维纠正\n\n请申请者注意一定要避免以下错误选校思维：\n\n1. ~~“不求最好但求最贵”~~：不考虑项目特点；认为难度高的项目就是好的项目，就是适合自己的项目。事实上很多项目只是对于陆本难度高，很多项目的难度和质量也并不匹配，更重要的是这些项目并不一定能最好地支持你的读研目的和未来规划\n2. ~~别人看法重于自身体验~~：不考虑自身就读体验如何，是否能通过项目达到自己的读研目的；认为应当选择别人认为好的项目。事实上很多人判断项目的好坏是从他们自身的读研目的和未来规划出发的，更有很多人认为好的项目就是难的项目，所以给出的评价往往是不符合你自身情况的\n\n## 建议使用方法\n\n### 初识申请\n\n建议申请者通过 [一亩三分地定位选校版](https://www.1point3acres.com/bbs/forum-79-1.html) 和 [一亩三分地 offer 多多](https://offer.1point3acres.com/) 定位自己的背景的彩票/冲刺/主申/保底校应该落在哪一档。结合本文档建立项目申请难度认知，根据本文档快速完成初选。\n\n### 选校\n\n点击列表中各个项目进入详情页，查看可能的录取偏好和项目特点（详情页各条目说明见下）。根据自己软硬背景，读研目的，未来规划（留美找工/回国就业/移民海外/零基础转码等）综合进行考虑，选择对于自己最 match 的项目。\n\n### 补申\n\n如遇补申阶段，可以快速在自己保底档及难度更低的档位进行再一轮选校。\n\n## 项目详情各条目说明\n\n录取偏好：该项目整体录取倾向\n\n代表性 dp：部分典型 offer 或 rej 的基本 background\n\n网申备注：收集该项目网申系统里容易被忽视或者踩坑的点，关于基本的网申要求（GRE、托福/雅思、推荐信和申请 ddl 等）请至 Homepage 表格或项目官网查询\n\n项目特点：包括该项目科研/就业导向、课程设置、workload、class size、项目时长等信息\n\n申请季实时信息：收集 short term（今年/当前申请季）的实时信息，例如今年该项目是否扩招或缩招\n\n介绍帖：征集该项目地里或者其他渠道的优质介绍帖子链接\n"
},
{
"path": "docs/index.md",
"content": "---\nhide:\n - toc\n---\n\n# 欢迎来到 Open CS Application\n\n[![CC BY-NC-SA 4.0][cc-by-nc-sa-shield]][cc-by-nc-sa] \n[](https://github.com/opencsapp/opencsapp.github.io/subscription)\n[](https://github.com/opencsapp/opencsapp.github.io/fork)\n[](https://github.com/opencsapp/opencsapp.github.io)\n[](https://github.com/xichenpan)\n\n**本站内容开源协同创作，期待你[贡献内容](contribute.md)。如果你喜欢这个网站，请点亮 :star:Star 支持我们！**\n\n[opencs.app](https://opencs.app/) | [csmsapp.org](https://csmsapp.org/) | [opencsapp.github.io](https://opencsapp.github.io/)\n\n[:fontawesome-brands-qq: QQ 26Fall 195142580](https://qm.qq.com/q/tvYpfwqnOU){ .md-button}\n[~~:fontawesome-brands-qq: QQ 25Fall 336579136~~（**已满**）](https://qm.qq.com/q/58AfqUcs1W){ .md-button}\n[:fontawesome-brands-qq: QQ 25Fall ②群: 676446749](https://qm.qq.com/q/b293aAoC2c){ .md-button}\n[:fontawesome-brands-qq: CCF-A 顶会顶刊投稿交流群: 1039880110](https://qm.qq.com/q/aF7f6WwC3K){ .md-button}\n[~~:fontawesome-brands-qq: Join QQ① 466094878~~（**已满**）](http://qm.qq.com/cgi-bin/qm/qr?_wv=1027&k=jyDQE5i1T_Obns8xWxMzab51NqGXm3Sm&authKey=RNkbnwhB01W3L%2BLHPCjza6J7Vl%2FvGV11g80uIPvJtT8SCmCU8DjAEZROCkScCNIE&noverify=0&group_code=466094878){ .md-button}\n[~~:fontawesome-brands-qq: Join QQ② 544855574~~（**已满**）](http://qm.qq.com/cgi-bin/qm/qr?_wv=1027&k=Lw6khzD63SpyFjfzd3xRNJar24Ltsq_k&authKey=Eo%2F5Rfsk7VDsWDTMe6TV61D1otmc4%2BoE%2FfoANBgOZcwklZwBzYz2N1ao13gxoYmi&noverify=0&group_code=544855574){ .md-button}\n[:fontawesome-brands-telegram: Join Telegram](https://t.me/+7N7X2BGrBlE4OTYx){ .md-button} [:fontawesome-brands-discord: Join Discord](https://discord.gg/HeB9QXZdFR){ .md-button}\n\n## Insights\n\n很高兴介绍我们的[Blog](blog.md)版块，欢迎投稿！\n\n[OpenCSAPP](https://opencs.app/) X [GradHub](https://gradhubs.com/) 强强联合提供最新的申请信息和最快的问题解答！\n\n[DataPoints©](datapoints.md)提供了录取结果实时播报，快来尝试吧！期待大家[提交 DataPoints](submit.md)\n\n[申请 FAQ](faq.md)栏目中收录了常见问题及解答。\n\n[外部链接](link.md)中收录了很多实用的工具网站。\n\n[](https://star-history.com/#opencsapp/opencsapp.github.io&Date)\n\n[](https://github.com/opencsapp/opencsapp.github.io/stargazers)\n\n[](https://github.com/opencsapp/opencsapp.github.io/network/members)\n\n## Contributed By\n\n \n\n\nOpenCSApp follows [Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License][cc-by-nc-sa]\n\n[![CC BY-NC-SA 4.0][cc-by-nc-sa-image]][cc-by-nc-sa]\n\n[cc-by-nc-sa]: http://creativecommons.org/licenses/by-nc-sa/4.0/\n[cc-by-nc-sa-image]: https://licensebuttons.net/l/by-nc-sa/4.0/88x31.png\n[cc-by-nc-sa-shield]: https://img.shields.io/badge/License-CC%20BY--NC--SA%204.0-lightgrey.svg\n"
},
{
"path": "docs/link.md",
"content": "# 外部链接 | External Links\n\n本页面提供了很多有帮助的外部链接，欢迎修改此页面补充\n\n## 申请服务类网站\n\n### [GradHub](https://gradhubs.com/)\n\nGradHub 由MIT, Stanford, UCB, CMU, UW, ETH, 牛津, 清北等世界名校的硕士生和博士生共同创立。 其中多数 Mentor 将从往年OpenCSAPP 申请者中择优选择。\n\n## 工具网站\n\n### GoGrads (微信小程序)\n\n简单易用、零门槛的MS/PhD申请结果/咨询交流平台 - 一个由Stanford、NEU等世界名校的硕士生和博士生开发的公益项目\n\n### [CSRankings](https://csrankings.org/)\n\nCSRankings 根据 dblp 中收录顶会论文数量进行排名\n\n### [Computer Science Open Data](https://jeffhuang.com/computer-science-open-data/)\n\n各校教授，排名，最佳论文，津贴信息\n\n### [Map of TOP 200 US University](https://www.google.com/maps/d/u/0/edit?mid=1ejHyjTJx0D7FoI_xaUDileyIFoDkjK4&usp=sharing)\n\n2025年USNEWS全美最佳200所大学分布地图\n\n### [CS Open Rankings](https://drafty.cs.brown.edu/csopenrankings/)\n\nCS Open Rankings 是结合了 U.S. News, csrankings.org, placement rank, best paper awards 进行的综合排名\n\n### [Computer Science Professors](https://drafty.cs.brown.edu/csprofessors?src=csopendata)\n\nComputer Science Professors 收录了各校各年度新晋 faculty 名录和研究兴趣，方便进行 POI 选择\n\n### [ChatGPT](https://chat.openai.com/)\n\n使用 Instruction Tuning 微调过的语言模型，可以高效高质量的支持文书润色。prompt 举例 polish this:\n\n### [levels.fyi](https://www.levels.fyi/)\n\n比较和查看各个tech company salary & 职级的网站\n\n### [The GradCafe](https://www.thegradcafe.com/)\n\n实时录取结果更新，PhD dp比较多\n\n### [TransferWiki](https://transferwiki.com/)\n\nTransferWiki 详细介绍了 transfer 相关信息。transfer 到海本可以极大方便找工/移民/硕博申请，推荐本科低年级同学了解。\n\n### [:fontawesome-brands-github: awesome-phd-advice](https://github.com/pliang279/awesome-phd-advice)\n\n为未来和当前的博士生收集的建议\n\n### [:fontawesome-brands-github: awesome-cs-phd-application-advice](https://github.com/jedyang97/awesome-cs-phd-application-advice)\n\n为 CS PhD 申请者提供的建议精选列表，由互联网上的博客组成，略微偏重于 AI/ML 和 NLP 领域。\n\n### [北美CS PhD申请建议合集](https://post.bin-hu.com/collection-of-advice-for-phd-application/)\n\n带中文导读的PhD申请攻略合集，除了博客文章以外还包括一些论坛帖子和实用网站\n\n### [美国签证预约时间](https://tuixue.online/visa/)\n\n北京/上海/广州/沈阳美签最早预约时间查询\n\n## 飞跃手册\n\n飞跃手册是各大高校自主编写的留学指导书以及本校案例库，本校 data point 对选校指导意义很大\n\n### [上海交通大学飞跃手册](https://survivesjtu.github.io/SJTU-Application/#/)\n\n### [华中科技大学光电飞跃手册](https://hust-feiyue.github.io/)\n\n### [四川大学飞跃手册](http://scu-flying.com/)\n\n### [山东大学飞跃手册](https://sdu-application.github.io/sduapplication.github.io/#/)\n\n### [清华大学飞跃手册](https://feiyue.online/)\n\n## 生存手册\n\n### [上海交通大学生存手册](https://survivesjtu.gitbook.io/survivesjtumanual/)\n\n### [华科生存手册](https://1037survival.gitbook.io/)\n\n### [四川大学计软网生存手册](https://scu-cs-runner.github.io/SurviveSCUManual/)\n\n## 相关项目\n\n### [Global CS](https://global-cs-application.github.io/)\n\n针对欧洲港新澳洲地区计算机硕士相关项目的介绍网站\n"
},
{
"path": "docs/newapplicant.md",
"content": "---\nhide:\n - toc\n---\n\n# 申请者信息收集表\n\n\n\n[:fontawesome-solid-square-poll-horizontal: DataPoints 收集表](newdatapoints.md){ .md-button } [:fontawesome-solid-square-poll-horizontal: Progress 收集表](newprogress.md){ .md-button } [:fontawesome-solid-square-poll-horizontal: Visa 收集表](newvisa.md){ .md-button } [:fontawesome-solid-square-poll-horizontal: 申请者信息收集表](newapplicant.md){ .md-button .md-button--primary } [:fontawesome-solid-square-poll-horizontal: 添加新项目](newprogram.md){ .md-button }\n\n[:fontawesome-solid-pen-to-square: 在 SeaTable 中填写](https://cloud.seatable.cn/dtable/forms/0b7d2ec7-d29f-4e06-bd65-3cfa01fc737e/){ .md-button .md-button--primary }\n"
},
{
"path": "docs/newdatapoints.md",
"content": "---\nhide:\n - toc\n---\n\n# DataPoints 收集表\n\n\n\n[:fontawesome-solid-square-poll-horizontal: DataPoints 收集表](newdatapoints.md){ .md-button .md-button--primary } [:fontawesome-solid-square-poll-horizontal: Progress 收集表](newprogress.md){ .md-button } [:fontawesome-solid-square-poll-horizontal: Visa 收集表](newvisa.md){ .md-button } [:fontawesome-solid-square-poll-horizontal: 申请者信息收集表](newapplicant.md){ .md-button } [:fontawesome-solid-square-poll-horizontal: 添加新项目](newprogram.md){ .md-button }\n\n[:fontawesome-solid-pen-to-square: 在 SeaTable 中填写](https://cloud.seatable.cn/dtable/collection-tables/9e6bf2a9-c4a1-4c54-8b21-c5fa14e5fa80/){ .md-button .md-button--primary }\n"
},
{
"path": "docs/newprogram.md",
"content": "---\nhide:\n - toc\n---\n\n# 添加新项目\n\n\n\n[:fontawesome-solid-square-poll-horizontal: DataPoints 收集表](newdatapoints.md){ .md-button } [:fontawesome-solid-square-poll-horizontal: Progress 收集表](newprogress.md){ .md-button } [:fontawesome-solid-square-poll-horizontal: Visa 收集表](newvisa.md){ .md-button } [:fontawesome-solid-square-poll-horizontal: 申请者信息收集表](newapplicant.md){ .md-button } [:fontawesome-solid-square-poll-horizontal: 添加新项目](newprogram.md){ .md-button .md-button--primary }\n\n[:fontawesome-solid-pen-to-square: 在 SeaTable 中填写](https://cloud.seatable.cn/dtable/forms/8e2f99c4-6d02-476b-bf83-dd6b8b1477b5/){ .md-button .md-button--primary }\n"
},
{
"path": "docs/newprogress.md",
"content": "---\nhide:\n - toc\n---\n\n# Progress 收集表\n\n\n\n[:fontawesome-solid-square-poll-horizontal: DataPoints 收集表](newdatapoints.md){ .md-button } [:fontawesome-solid-square-poll-horizontal: Progress 收集表](newprogress.md){ .md-button .md-button--primary } [:fontawesome-solid-square-poll-horizontal: Visa 收集表](newvisa.md){ .md-button } [:fontawesome-solid-square-poll-horizontal: 申请者信息收集表](newapplicant.md){ .md-button } [:fontawesome-solid-square-poll-horizontal: 添加新项目](newprogram.md){ .md-button }\n\n[:fontawesome-solid-pen-to-square: 在 SeaTable 中填写](https://cloud.seatable.cn/dtable/collection-tables/0d5ae881-02d2-4cc8-8c33-a7b958d751e5/){ .md-button .md-button--primary }\n"
},
{
"path": "docs/newvisa.md",
"content": "---\nhide:\n - toc\n---\n\n# Visa 收集表\n\n\n\n[:fontawesome-solid-square-poll-horizontal: DataPoints 收集表](newdatapoints.md){ .md-button } [:fontawesome-solid-square-poll-horizontal: Progress 收集表](newprogress.md){ .md-button } [:fontawesome-solid-square-poll-horizontal: Visa 收集表](newvisa.md){ .md-button .md-button--primary} [:fontawesome-solid-square-poll-horizontal: 申请者信息收集表](newapplicant.md){ .md-button } [:fontawesome-solid-square-poll-horizontal: 添加新项目](newprogram.md){ .md-button }\n\n[:fontawesome-solid-pen-to-square: 在 SeaTable 中填写](https://cloud.seatable.cn/dtable/collection-tables/74ca6576-233f-41a5-85e0-5176fd6d9e24){ .md-button .md-button--primary }\n"
},
{
"path": "docs/phdinfo.md",
"content": "# PhD申请信息\n\n## Massachusetts Institute of Technology (MIT)\n### EECS PhD\n强Committee，每年只有一个batch，一般在一月末\n\n## University of Illinois Urbana-Champaign (UIUC)\n### CS PhD\nProf可以和同事一起提名到committee录取，timeline看老板\n\n## Cornell University\n### CS PhD\n强committee，但是代表committee面试的是poi，timeline看老板，一般整个1月都有可能\n\n## Georgia Institute of Technology (GaTech)\n### CoC PhD\nCoC下面好几个School，分别独立申请，强Prof，timeline看老板\n\n## Duke University\n### CS PhD\ncommittee中有两位老师同意就能发offer，所有人前**两年**的funding由学院出，可以rotation\n\n## University of Southern California (USC)\n### CS PhD\n强Prof, committee决定有无fellowship，带fellowship的offer2月初发，剩下的timeline看老板\n\n## New York University (NYU)\n### Courant CS PhD\n偏强Prof，老板有话语权，无rotation。每年2月初有一个batch，后边少量wl递补录取\n### Center for Data Science (CDS) PhD\n强committee，面试很多轮，funding多\n\n## Northwestern University (NWU)\n### CS PhD\n基本强Prof, 一般一年两批左右，timeline看老板，第一年全员fellowship\n\n## University of Waterloo\n### CS PhD\n强Prof，timeline看老板\n\n## University of California, Santa Barbara (UCSB)\n### CS PhD\n强Prof, timeline看老板\n\n## University of California, San Diego (UCSD)\n### CS PhD\n强Prof, timeline看老板，跨度很大，从1月初到2月中旬都有\n\n## EPFL\n### EDIC PhD\n第一轮强committee，第二轮强Prof, timeline看老板，一般1月中旬前完成面试\n\n## Rice University\n### CS PhD\n强Prof，面试当天就能发offer；第一年名义上rotation, 发fellowship, timeline看老板\n\n## Northeastern University\n### ECE PhD\n强Prof，但committee可以决定一个5k USD/year的持续3年的fellowship的归属，占admitted students的10%，timeline看老板\n\n## University of Michigan (UMich)\n### School of Information (SI) PhD\n强Prof\n\n## University of Toronto (UofT)\n### CS PhD\n强committee，所有申请先由高年级的PhD做triaging，把申请大体分为 top 10%，10-30%，rest 70% 三档。每份申请至少由两个高年级相关方向的PhD triager加上committee chair看过一遍。然后top 10%和10-30%会给具体的申请方向的教授再看。rest 70%的申请基本上就不会再有人看了。\n"
},
{
"path": "docs/program_info.md",
"content": "---\nhide:\n - navigation\n - toc\n---\n\n# Open CS Application 项目信息表\n\n\n\n[:fontawesome-solid-pen-to-square: 在 SeaTable 中查看和编辑](https://cloud.seatable.cn/dtable/links/e144437476754c23b4f5){ .md-button .md-button--primary }\n"
},
{
"path": "docs/sponsor.md",
"content": "# 赞赏计划\n\n## 赞赏计划一期\n\n用于 qq① 群扩容至 2000 人，目标金额 240 元，实际金额 452 元，转移支付 212 元至赞赏计划二期。\n\n### 赞赏者名录\n\n人工更新存在延迟，感谢老板们慷慨解囊~\n\nbs6 ￥ 20\n\n健 ￥ 1\n\n林奈 ￥ 20\n\n安尼维 ￥ 20\n\nxx ￥ 20\n\ntmyymt ￥ 5\n\n少冰走甜 ￥ 10\n\nDelluC ￥ 5\n\n匿名大大 ￥ 100\n\n匿名大大 ￥ 10\n\nDeng_Hilbert ￥ 10\n\n匿名大大 ￥ 5\n\n增肥 ￥ 150\n\nBoboge ￥ 10\n\nEclipse ￥ 20\n\n木槿你好 ￥ 5\n\n陈小宝 ￥ 20\n\nRicardo Lzecson ￥ 1\n\n## 赞赏计划二期\n\n用于购买域名[csmsapp.org](https://csmsapp.org)三年使用权限，目标金额$33.62，实际金额 212 元，flash 赞助差价。\n"
},
{
"path": "docs/stylesheets/extra.css",
"content": "/* .md-grid {\n max-width: 75%; \n}\n */\n"
},
{
"path": "docs/submit.md",
"content": "---\nhide:\n - toc\n---\n\n# DataPoints©提交\n\n[:fontawesome-solid-square-poll-horizontal: DataPoints 收集表](newdatapoints.md){ .md-button } [:fontawesome-solid-square-poll-horizontal: Progress 收集表](newprogress.md){ .md-button } [:fontawesome-solid-square-poll-horizontal: Visa 收集表](newvisa.md){ .md-button } [:fontawesome-solid-square-poll-horizontal: 申请者信息收集表](newapplicant.md){ .md-button } [:fontawesome-solid-square-poll-horizontal: 添加新项目](newprogram.md){ .md-button }\n\n[:fontawesome-solid-database: 访问 DataPoints©数据库](datapoints.md){ .md-button .md-button--primary }\n\n# 如何提交\n\n1. [DataPoints©数据库](datapoints.md)是一个只读的数据表，对应的 DataPoints，Progress，Visa, 申请者信息，项目列表五个子表的更改请通过[DataPoints 收集表](newdatapoints.md)，[Progress 收集表](newprogress.md)，[Visa 收集表](newvisa.md), [申请者信息收集表](newapplicant.md)，[添加新项目](newprogram.md)进行。\n2. 首先在[申请者信息收集表](newapplicant.md)中提交自己的个人信息（仅需一次，不可更改）\n3. 然后在[DataPoints 收集表](newdatapoints.md)中提交录取 DataPoints，填写过程中可以通过申请者字段链接到自己的账户，并关联以上填写的个人信息。DataPoints 支持无限次更改\n4. 进展的提交可以在[Progress 收集表](newprogress.md)中进行，操作与 DataPoints 相同\n5. Visa的提交可以在[Visa 收集表](newvisa.md)中进行，操作与 DataPoints 相同，可以多次更新签证状态\n6. 对于没有在数据库中录入的项目，通过[添加新项目](newprogram.md)进行添加后，即可在项目字段中找到。\n\n# FAQ\n\n### 如何保证我提交的datapoints会开源而非被owner用于收费访问获利？\n\n[DataPoints©数据库](datapoints.md)是完全开源的，任何用户均可点击右上角导出全部数据，这保证DataPoints©中的信息不会被私人垄断。我们欢迎任何个人或团体在[Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License](http://creativecommons.org/licenses/by-nc-sa/4.0/)条款下分享或构建材料，只需遵守条款的Attribution, NonCommercial, ShareAlike规则即可。\n\n### [DataPoints©数据库](datapoints.md)中储存的信息安全吗，是否会因为误操作丢失或因为恶意添加记录而崩溃？\n\n[DataPoints©数据库](datapoints.md)会自动保存历史镜像确保信息安全\n\n### 我通过申请者信息收集表提交了个人信息，现在想要更改其中某些信息，应当如何操作\n\n请提交一个新的[申请者信息收集表](newapplicant.md)，并在[DataPoints 收集表](newdatapoints.md)中将之前的 DataPoints 链接到新的个人信息。我们会定期删除这些冗余的用户信息。\n\n### 为什么我无法通过微信扫码登录\n\n这是因为浏览器限制了重定向，请在地址栏右侧允许重定向之后再次尝试。或者也可以先[登录 SeaTable](https://cloud.seatable.cn/)之后刷新该页面。\n\n### 403 Forbidden. CSRF verification failed. Request aborted.\n\n这是因为 CSRF cookie 设置问题，请直接在表格下方找到 在 SeaTable 中填写 按钮，点击进入填写。\n\n### 每条记录太长了，左右滑动很麻烦\n\n在该行最左侧序号处悬浮，可以找到缩放按钮，点击即可在标签页中浏览该条记录\n\n### 为什么我在[DataPoints 收集表](newdatapoints.md)中填写完成之后，没有找到提交按钮\n\n[DataPoints 收集表](newdatapoints.md)自动保存，无需提交\n\n### 为什么我在[DataPoints 收集表](newdatapoints.md)中填写完成之后，没有看到其他用户的记录\n\n您的信息已经实时汇总到了[DataPoints©数据库](datapoints.md)\n\n### 为什么我在[DataPoints©数据库](datapoints.md)中看到的账户都是乱码\n\n因为没有登录，登录后刷新即可看到昵称\n\n### 为什么三个子表中的 ID 都不连续，中间的记录是被隐藏了吗\n\n中间的记录因为各种原因被删除了，包括但不限于测试使用/隐私原因删除\n\n### 单选提供的选项没有符合我背景的描述\n\n请打开一个[Issue](https://github.com/opencsapp/opencsapp.github.io/issues)提供你的需求，管理员会帮你处理。\n\n### 我对字段有新的建议，应该如何反馈\n\n请打开一个[Issue](https://github.com/opencsapp/opencsapp.github.io/issues)提供你的反馈，管理员会帮你处理。\n\n### 我因为隐私问题想撤回我的 DataPoints。\n\n请在[DataPoints 收集表](newdatapoints.md)中将之前的 DataPoints 删除即可。\n\n### 我因为隐私问题想撤回我的个人信息。\n\n请打开一个[Issue](https://github.com/opencsapp/opencsapp.github.io/issues)提供你的用户名，管理员会帮你处理。\n"
},
{
"path": "docs/zen.md",
"content": "# CS 选校之禅 | Zen of Open CS Application\n\n多方参考胜过相信权威\n\n难度一直变化；经验总会失效\n\n难度讲总体；结果讲个例\n\n申请是多元函数；录取与否难预知\n\n申请到再多；只能去一个\n\n适合自己胜过难度更高\n\n读研只是方法；读研并非目的\n\nby [Flash](https://github.com/xichenpan)\n"
},
{
"path": "docs/加拿大study permit安调情况 by Flash.md",
"content": "---\nhide:\n - navigation\n---\n# 加拿大study permit安调情况 by Flash\n\n## 什么是安调\n\n根据IRCC (Immigration, Refugees and Citizenship Canada) 即加拿大移民局的描述，安调 (Security Scanning) 包括以下三个部门的联合审查\n\n> Three federal bodies work together to do immigration and citizenship screenings:\n> \n> * Immigration, Refugees and Citizenship Canada (IRCC)\n> * Canada Border Services Agency (CBSA)\n> * Canadian Security Intelligence Service (CSIS)\n\n通俗来说安调就是IRCC因为国家安全原因对学签 (study permit) 申请者进行的审查，其中IRCC的审查一般较快结束，申请者通常无感，不会影响到下签速度。CBSA的审查也较快，调查申请人的出入境情况，通常在半个月左右结束，CSIS的审查较慢，时间上不封顶。如果申请者的材料被送到CSIS进行审查，一般我们称之为安调，下签时间会受到极大延误，通常最短半年，上不封顶。\n\n22fall之前学签被安调的几率极小，安调主要出现在PR申请时。在2022俄乌冲突之后，学签安调规模大幅上升，重灾区为理工科研究型学位。之前PR申请时的安调通常耗时很久，多为1-2年，但因为PR申请者在境内，所以对申请者工作生活影响不大；而学签申请者如果遭遇安调，则会极大影响学习生活工作规划，所以在选择加拿大留学或移民时需要纳入考虑。\n\n## 影响安调的因素\n\n以下因素会增加安调风险\n\n**大量增加风险**\n\n* STEM PhD / Postdoc\n* 参与敏感研究，如国防安全等研究项目\n* 敏感研究方向，如AI，可参考[美国alert list](https://www.bu.edu/isso/files/pdf/tal.pdf)\n* 敏感企业实习或全职工作经历，如华为等\n\n**少量增加风险**\n\n* STEM 研究型硕士\n* 中国国籍\n* 在中国大陆递签，尤其被北京office审理的case\n* 10043学校 / 实体清单学校\n\n以下因素会降低安调风险\n\n* 有美国签证，包括B签，F签等\n\n以下因素对降低安调风险几乎没有帮助\n\n* 其他发达国家签证，如同属五眼联盟的英国学签和旅游签等\n\n## 如何了解到自己是否被安调\n\n通常在3个月以上没有下签的case都是被安调了，可以通过调档 (ATIP) 查看情况，调档IRCC, CBSA, CSIS都能看到是否被安调。\n\n> Under the Privacy Act, you have the right to access personal information about yourself held by government institutions. You may request records from CSIS relating to your immigration or citizenship security screening by making an Access to Information and Privacy (ATIP) request.\n\n## 递签前应该怎么做来降低被安调的概率\n\n* 脱敏：对互联网个人信息和申请材料进行脱敏，避免敏感词。\n* 其他方式：如第三国递签，先申请美国旅签等，但目前这些方法datapoints较少，不清楚有效性如何\n\n## 确认被安调了如何加速\n\n唯一方式是强制令，通过起诉IRCC寻求庭外和解\n\n以下方式均没有帮助，不必花时间尝试：\n\n* 一签被安调过程中二次递签\n* 一签被安调了，撤签后重递\n* 普签被安调了，递SDS\n* SDS被安调了，递普签\n* 各种联名信\n* 通过学校和议员向IRCC施压\n\n## 如何应对安调\n\n对于OpenCSApp用户群体而言，由于基本都是中国国籍 + 中国递签，所以如果是CS PhD，那么被安调是大概率事件；如果是Research Master，安调的概率也相当可观，不过时间都相对较快，6-12个月内安调结束的case也基本都是master；如果是授课硕，安调的可能性存在，但不大。建议对于PhD和Research Master申请者，在选校时将安调情况纳入考虑，如果确定要接加拿大的offer，那么越早提交签证申请越好，以便留出充足时间。同时建议准备plan B，以应对安调一年以上的情况。以常见的四五月份递签为例，如果安调一年以上，会错过12月份的第二年申请，最坏可能需要第二年重申，导致gap两年。\n\n## Fun Fact\n\n* IRCC似乎在使用AI系统来决定是否对申请者进行安调，所以可以尝试脱敏来降低安调风险\n* 加拿大很多学校的research master和PhD都是可以直接互转的，可以考虑拿master入学后再转PhD\n* 已经就读加本加硕的同学仍可能被安调！所以尽量在拿到签证前不要出境\n* 加拿大的安调时间长并不是因为审查严格，而是因为其处理速度慢。而五眼联盟之间有info sharing，这解释了为什么有美签会极大降低加签安调风险，因为这表示美国已完成了对申请人的审查。\n* Portal递签似乎比GCKey递签被安调的概率更低，可能是玄学。\n* 进入安调通常是在发体检信或者eligible的当天，这时申请者已经符合获得学签的标准了，安调是最后一步。\n* 被加拿大安调后撤签不会影响其他国家签证，目前已验证美国、英国、爱尔兰等国家\n\n[回到列表 :fontawesome-solid-house:](blog.md){ .md-button }\n"
},
{
"path": "docs/北美CS PhD申请回忆 by denghilbert.md",
"content": "---\nhide:\n - navigation\n---\n# 北美CS PhD申请回忆 by denghilbert\n\n[原文链接](https://denghilbert.github.io/blog/PhD%E7%94%B3%E8%AF%B7%E5%9B%9E%E5%BF%86.html)\n\n\n\n写的不一定很完整，后面想起来了再补，最近旅游休息休息。\n\nPhD项目的录取基本结束，自己狗屎运也撞上了俩，最终决定去Cornell。闲着突然心血来潮想记录下申请，加上flash居然在opencsapp开通了[blog模块](blog.md)，那就过来挂一下分享。想一起交流申请，或者Ithaca租房能带带我的小伙伴，欢迎过来加个好友哇，联系方式留在了[主页](http://denghilbert.github.io/)里面。\n\nbg写在前面，其中对申请比较有帮助的文章和推荐信，都是从大二结束的暑假开始一点点做出来的。如果学校层级或者准备申请时间节点类似，可以把我经验拿来参考参考。\n\n背景：美西大佬强推，一篇ECCV一作，一篇CVPR一作在投，WHU本，非CS专业，三维（91.5/108/320）。\n\n方向：3DV，graphics。\n\nOffer：Cornell，UCSD。\n\n想记录下自己申请，如果同时能对学弟学妹申请有一丢丢帮助那便是最好的。\n\n## 决定出国\n\n自己最开始的规划想着就卷卷绩点，然后保研去中科院呆着，出来可能进个厂子赚点钱。但大一的暑假有幸认识麻学长，虽说忘记具体如何忽悠，但好歹记住了一个Berkeley Meng，据他说转码的也申的上+出来随便找工（good old days。。。）。当时自己出国的motivation其实没很强烈，就感觉趁年轻的时候出去（本人从未出国）转转挺好。反正我早晚都会为自己认知局限性和做出的决定买单，于是决定去国外深造。\n\n## Why PhD？\n\n最开始的想法真就是不搞开发，整个大二时期对开发挺有热情，但自己代码写的是真折磨，轻易的放弃了这条路（现在想想自己在这上面是真没毅力。。。）。大二结束的暑假决定尝试着做点科研，好像还真能做出点东西，并且感觉科研好像对我来说不太枯燥。后来暑研的时候被mentor们水平震撼到了，考虑到自己读完PhD出来说不定也能有mentor一半厉害（想了想还蛮激动的），更加坚定读博的想法。但整个申请过程填了3 4个master项目也是怕全聚德。\n\n其实Why PhD真的是一个很难回答的问题，我自己也很庆幸面试教授没有问这个问题。。。对我个人而言PhD意味着正统的科研训练，而我渴望成为一个independent researcher，感觉上来说读博对我未来会更有帮助一些。而从更现实的角度来看，虽说家里都让我不要担心经济上的问题，但个人感觉读一个master对家庭经济负担还是太大，不想再麻烦父母。\n\n计划读PhD的建议看看[Philip Guo](https://pg.ucsd.edu/)写的[The PhD Grind](https://cacm.acm.org/blogs/blog-cacm/154473-the-phd-grind-main-grinds-and-side-grinds/fulltext)，这本书写的还是挺好的，看下大佬的博士学习。\n\n**读博一定慎重，PhD投入很大！不要让“别人说XXX”左右你自己。**而且从申请来看，master和PhD也是两个不一样的track，准备的策略差异很大。\n\n## 参考的一些经验帖\n\n一开始也是到处问前辈的经验，加各种群，潜水看前辈们激烈讨论（长时间的修行让我也成为水群怪），各种[术语](faq.md)也是听不懂。。。后来转悠转悠发现好多前辈写了点经验分享，于是阅读了一些让自己对申请有了点sense。下面是我收集的一精品帖子或博客：\n\nhttps://zhuanlan.zhihu.com/p/350439006\n\nhttps://zhuanlan.zhihu.com/p/542182599\n\nhttps://trinkle23897.github.io/posts/application\n\nhttps://zhuanlan.zhihu.com/p/466600430\n\nhttps://zhuanlan.zhihu.com/p/475751340\n\n前辈们写的都还是蛮好的，申请初期入门还是非常有帮助的，当然其中的timeline也让我在等结果时，过早知道自己凉凉放弃幻想。。。\n\nPhD申请重要性：**Letter（被验证过无数次的真理，其实当时我也不相信）** >>> Pub（AI相关的话有一篇，后面边际效用递减，系统无文章有经历也OK，系统or理论不是很懂，还是咨询专业人士吧。当然能搞出来10多篇或者best之类的估计也会挺有用吧。。。）> 三维 （没人看，~~除非太离谱直接desk reject？~~ 我现在甚至怀疑会不会因为三维desk reject，事实证明2.几都能过Cornell的委员会，有没有人科普下我也很好奇）\n\n## 三维\n\n高考反正学校也定了，当然你转学出去到UIUC Umich这些地方也行，我知道这个操作的时候很晚也就算了，没必要多上1 2年学多花几十万。\n\n本人Top15非CS专业，按照CS培养方案上补了一些课。均分91.5，考前好好突击一下应该分数不会太难看。\n\nTOEFL，考试的很早，一共考了三次，96 （25|25|23|23），106（28|28|24|26），108（30|28|24|26），后面发现前两次两年有效期过了，早考语言是好的，但注意下保证语言成绩在入学往前两年内（有的学校是申请ddl前两年）有效。\n\nGRE，当时为了申ETH学了三天裸了一个320（AW3.0），也是菜的真实，但整体看下来申PhD没人关心GRE，不清楚现在放开后会不会强制线下，ets为了恰钱大概不会取消线上，大家也最好有个心理准备。\n\n## 中介\n\n一坨屎，那种大的机构估计都一个样。。。如果一定想要个中介，可以去找学长学姐搞的那种工作室，申请季帮你改改文书，陪你聊天缓解下压力，个人感觉还算比较靠谱。我也被中介骗了几万很难受。\n\n## 科研\n\n当时本来想着去读个Berkeley meng然后找工当个SDE躺着（麻学长就这样成功了，羡慕.jpg，但现在各大厂子裁人突然感觉读PhD也算一个明智决定？），于是大二搞了点开发，还记得当时我调侃朋友：~~傻逼才做research~~，一年过去了发现自己没啥能力而且完成需求也没啥意思，于是大三就开始进组搞点研究（真香），起步比较晚整体上来说搞了两段。\n\n### 国内\n\n当时上Image Processing这门课的时候，老师展示了一位本科生（好像是交大）发表顶会的图片，于是自己心里也痒痒的就进组了，没想到进组才发现大家全是搞remote sensing的，但还好老板开明同意让我自己摸索点cv的东西，配了不知道多久的环境，看了些文章，做着做着发现好像能刷出来一个weak sota，于是真动笔把文章写出来了。投CVPR前夕和tlt大佬去熬夜吃海底捞（后来养成了晚上11点吃海底捞的习惯），改完往CVPR一丢，被喷傻了。。。不出意料的拒稿后，补充一堆实验加上老板发力认真帮我改了一遍写作，继续投ECCV。第二次投ECCV运气也是真够差的，刚好审稿人看过之前CVPR中稿的一篇文章，high level idea和我的一毛一样，说我limited novelty。幸运的是我比他们早3天（真就这么巧）挂到arXiv上面，在rebuttal的时候我也是写了句“Unfortunately, our work was released earlier than XXX”，最终惊险中稿，有了第一篇顶会一作的文章。\n\n### 暑研\n\n当时忘了和谁（应该是成功的qls）聊天来着，问我为啥不做暑研，于是一拍脑袋就说找一个。其实我找暑研非常晚都4月了才定下来，建议还是2月就开始套。\n\n陶瓷的一些trick：\n\n1. 受到tlt大佬的启发，以及我的消融实验，最终得出标题党的重要性，把你最屌的经历写在邮件title里面。\n2. 邮件落地时间尽量早上8 9点。\n3. 别海套，看得出来的。。。\n4. 对着大佬套就完事了！实在不行再去找缺人的AP。\n5. 浏览下过往学生去向，大概能估摸出自己最后的高度。\n6. **一定要选择和自己能力匹配的暑研！！！！！这一点极其重要！！！**\n7. 紧接着上一条，打听清楚，**避免某些养蛊组**，当然如果对自己能力非常自信当我这条放屁吧。\n8. 我当时陶瓷并没有深入研究，仅仅对着引用量几万的Fellow套磁，套中了3 4个。。。自己也没太研究每个教授的connection还有intern学生的去处，就决定去引用量最高的那位。\n\n老板人也是相当nice，第一次meeting直接给我列了10多个potential mentors，于是选了两位nvidia research scientists。由于我选择remote intern，导致整体效率相对低下：自由选题（选了个我根本没做过的），放飞自我（浪一周开会前1个小时整ppt报告）。搞了点rendering相关的东西中间还被Scooped了，老板安慰我的时候说：这就是英雄所见略同。想了几秒他又补充了一句：当然也可能你idea太trivial，md。。。虽然我也觉得自己的idea trivial。最后还给我发了封邮件配了几张图：\n\n最后还是赶上了CVPR把文章投出去了，加了篇一作在投，后来还被AK转推播放量几千次也算宣传了下。Update：审稿意见回来了，442，那个2的reviewer我给你磕头了。。。\n\n赶AI会的时候找ddl可以看看这个[网站](https://aideadlin.es/?sub=DM)，看着倒计时还挺有动力的。\n\n## 推荐信\n\n本校老板，暑研大老板，nvidia的大mentor，小mentor被我叫去改文书想了下就不再麻烦写推荐信，强度都还行。\n\n信的强度本身就是玄学，卷度极大的组10多个intern卷1 2封强推，老白男组的intern又很难找。不管你最后去哪里intern，至少保证你用的不是平推or黑推。\n\n个人观点：Top10的学校最靠谱的还是直接拿return，或者卷王本尊在卷组拿最强的推。\n\n老板们交信都很墨迹，但也不用催，反正那么早过去吃灰，我的项目大部分都是ddl后圣诞节结束前交齐的。\n\n另外，老板有可能手滑交错信打错分，强推反手变黑推。。。\n\n## 选校选导\n\n其实也没咋选，原则上来说一个合格的PhD申请者在平时工作的时候心中已经有一个list了。我的申请总结起来就是只申Top校，后来和挺多人聊发现大家都这么莽哈哈哈，但我的profile相比于其他莽夫确实弱很多，最后能上岸也挺感激的。\n\n最终决定的List：\n\n1. 四大。没凑齐这几封拒信申请不完整。\n2. UW，Cornell，UIUC，UCSD，UC Merced，GT，UMD，Max Planck Institute，EPFL，ETH。\n3. brown，umich，CMU MSCV/MSCS。还加了几个master，其实看了下brown的visual computing那个track还蛮喜欢的\n\n不太有用的Connection和一些Fact，**有啥错误也请指出我改下**：\n\n1. ~~UMD和UIUC有connection~~，但最后事实证明屁用没有，我还是太菜了。UIUC的申请系统简洁明了，个人体验是最好的。\n2. 真不该抽四大，当时脑子一热全申了。。。\n3. MIT真良心，花钱就送新年祝福和马丁路德金日科普，外加上世纪申请系统（最烂的，没有one of）填表体验，感兴趣快申！\n4. Stanford语言是看Best Scores。\n5. UW的录取机制和会议文章审稿机制感觉一模一样，挺科学，我猜其他很多学校也应该是类似。\n6. Cornell和UCSD（可以同时申请多个项目，cse和ece不冲突的。）很晚快2月给的面试，但聊着还挺轻松愉快的，今年面试的时候教授都提到super competitive，我感觉也是，哎。\n7. UIUC的MSCS和PhD一个Pool，区别好像是3个教授推荐和2个推荐，感觉像是一群教授组成委员会。\n8. GT只能提交三个推荐人，而且看了下官网GRE Avg的统计，感觉GT在吹牛。\n9. UMD有个和MPI合作的PhD项目，感觉挺好的，可以同时申请下。\n10. MPI好像不是很难，但是最骚的是过了第一轮审核，才会要求你的推荐人交信，但又不通知你本人，所以推荐人没收到或者忘了就寄，我是除夕给老板发了一句新年快乐人家突然想起来。。。\n11. EPFL PhD第一轮审进面试是需要看成绩的，GPA 91 92 maybe，面完最后还是把我拒了，哎。\n12. ETH当时看了一眼master的要求是一页SoP，自己又不想改，一看PhD不限制就申了。申请硕士那个esop可以战略性放弃，申不上还浪费时间写proposal。\n13. 我感觉CMU MSCV的bar就是一篇顶会一作，于是拿这个保个底。\n14. brown过了105就申，不是强制CS专业！！！我认识非CS照样拿，尽管申就好了。\n15. UC系155刀是真的离谱。\n16. CMU申请有购物车那种感觉，批量缴费。\n17. Umich的系统没有填写语言成绩的地方，离谱。\n18. CMU RI下面的master从今年开始变成一个[单独的系统](https://admissions.scs.cmu.edu/account/login?r=https%3a%2f%2fadmissions.scs.cmu.edu%2fapply%2ffrm%3f857f530c-fb7d-4f58-8ed4-8ef6c01b0d4b)了，想申还是注意下。\n\n可以对着[csranking](https://csrankings.org/#/index?none&us)或者[acemap](https://www.acemap.info/ranking)按照自己的方向筛老板，或者试试看平时读文章比较喜欢的老板，此外打听老板人品也是一个重要环节。\n\n肯定ap会招更多的人，大家可以在这里找找看自己方向的，统计还是相对比较全：https://drafty.cs.brown.edu/csprofessors?src=csopendata ，如果ap是校友那就更好了。\n\n推特科研法，研究老板的社交圈，老板的好朋友就是你的好朋友（自我欺骗.gif）。\n\n一个有意思的网站[mathgenealogy](https://www.mathgenealogy.org/index.php)，去看看老板的高贵的学术血统（doge）。\n\n## 文书\n\n个人感觉fiverr这种一般，看了几个朋友改后的感觉不太好。\n\n### resume/CV\n\n把pub放到靠前的位置，research intern的老板写出来也就差不多了，模板就去overleaf上面找一个即可，我用的是[这个](https://www.overleaf.com/latex/templates/modular-resume/kyghjmzkfzwb)，还挺好看的。\n\n### Statement of Purpose（SoP）\n\n花了3天就给写出来了，还是靠我小mentor帮我改了一轮，加上[tianwei](https://tianweiy.github.io/)又给我改了两轮（真的没全聚德！！！到时候开车去波士顿请学长吃饭），后来又找[Jiayi](https://trinkle23897.github.io/cv/)大佬看了下说：感觉写的还行估计改了几轮（那就不改了）。最后实在闲着蛋疼又给俩PhD在读的国际友人发了邮件问了下建议，大家也可以试试看哈哈哈。\n\n大家可以参考下[这个网站](https://cs-sop.org/) ，过拟合一篇SoP然后找人消除下bias，感觉就差不多了\n\n教授估计不看，我面试的时候明显感觉他们没看过，但还是好好写下，防止真有人认真读。\n\n### History Statement / Diversity\n\n无，不挣扎。\n\n### 个人主页\n\n既然jon写：Feel free to steal this website's [source code](https://github.com/jonbarron/jonbarron_website)，那我不客气了\n\n## GAP的准备\n\n如果计划gap还是提前找到去处，无非就是研究院（msra或者Tencent这些地方）或者飞到北美欧洲的lab那里onsite呆一年。\n\n因为提交完申请极度害怕，于是在面epfl edic的时候试探性的问了一句能不能暑假去intern，结果真同意了，刚好第二天是Summer@EFPL官方老板决定的ddl，直接把我加进去，这下工资也有了。组里做的是极度传统的rendering（当时面试说了一句neural network就被怼。。。），本人还是蛮感兴趣的。说不定有机会和EPFL的老板成为师兄弟。\n\n现在看起来就当成一个旅游+学习的机会了，感受一下欧洲的环境。\n\n## Miscellaneous\n\njia-bin给了点申请完之后焦虑期建议：https://twitter.com/jbhuang0604/status/1472410988322377732\n\n申请master的朋友，来看看flash the great创建的：[flash ranking （opencsapp）](https://opencs.app/)\n\n找教职以及PhD工资的统计，可以看看：https://jeffhuang.com/computer-science-open-data/#verified-computer-science-phd-stipends\n\n## 最后\n\n最近想了想感觉自己能力还是很局限，无知的羞愧感推动我不断在摆烂与卷之间徘徊，不太清楚自己最后能走到哪，希望能借PhD这个机会挖掘下自己的极限吧。感谢一路帮助我的导师，mentors，前辈们。不管是读博或硕，还是即将申请的学弟学妹，祝大家今后也一切顺利！\n\n[回到列表 :fontawesome-solid-house:](blog.md){ .md-button }\n"
},
{
"path": "mkdocs.yml",
"content": "site_name: Open CS Application\nsite_author: 'OpenCSApp'\ncopyright: '© 2022-2023 OpenCSApp'\ntheme:\n name: material\n custom_dir: overrides\n palette:\n - scheme: default\n primary: blue\n accent: amber\n features:\n - content.action.edit\n - content.code.copy\n - navigation.tabs\n - navigation.top\n - navigation.footer\n - navigation.instant\n - toc.follow\n - search.highlight\n - announce.dismiss\n favicon: images/logo.png\n icon:\n logo: material/school\n repo: fontawesome/brands/github\n\nmarkdown_extensions:\n - meta\n - attr_list\n - md_in_html\n - admonition\n - tables\n - pymdownx.caret\n - pymdownx.mark\n - pymdownx.tilde\n - pymdownx.details\n - pymdownx.inlinehilite\n - pymdownx.snippets\n - pymdownx.superfences\n - pymdownx.highlight:\n anchor_linenums: true\n - pymdownx.emoji:\n emoji_index: !!python/name:material.extensions.emoji.twemoji\n emoji_generator: !!python/name:material.extensions.emoji.to_svg\n\nplugins:\n - search\n - social\n - glightbox:\n loop: true\n zoomable: true\n - git-revision-date-localized:\n enable_creation_date: true\n type: timeago\n\nnav:\n - Open CS Application:\n - Home: index.md\n - 内容征集: contribute.md\n - 使用指南: guide.md\n - 选校梯度: grade.md\n$programs_list\n - Blog: blog.md\n - PhD申请: phdinfo.md\n - FAQ: faq.md\n - 外部链接: link.md\n - CS选校之禅: zen.md\n - 赞赏计划: sponsor.md\n - 项目信息表: program_info.md\n - DataPoints©: datapoints.md\n - DataPoints©提交:\n - Home: submit.md\n - DataPoints收集表: newdatapoints.md\n - Progress收集表: newprogress.md\n - Visa收集表: newvisa.md\n - 申请者信息收集表: newapplicant.md\n - 添加新项目: newprogram.md\nextra:\n homepage: /grade/\n social:\n - icon: fontawesome/brands/qq\n link: https://jq.qq.com/?_wv=1027&k=yAmXwWYl\n - icon: fontawesome/brands/discord\n link: https://discord.gg/HeB9QXZdFR\n analytics:\n provider: google\n property: G-MWWFQ6MJG4\n consent:\n title: Cookie consent\n description: >- \n We use cookies to recognize your repeated visits and preferences, as well\n as to measure the effectiveness of our documentation and whether users\n find what they're searching for. With your consent, you're helping us to\n make our documentation better.\n actions:\n - accept\n - manage \nrepo_url: https://github.com/opencsapp/opencsapp.github.io\nrepo_name: opencsapp\nedit_uri: edit/master/docs/\nextra_css:\n - stylesheets/extra.css\n"
},
{
"path": "overrides/main.html",
"content": "{% extends \"base.html\" %}\n\n{% block content %}\n {{ super() }}\n\n \n \n \n \n \n{% endblock %}\n"
},
{
"path": "programs_list.yml",
"content": "- SSS:\n CS:\n - MSECS@Princeton\n - MSCS@Stanford\n NONCS:\n - CSE@MIT\n- SS:\n CS:\n - MLT@CMU\n - MSCS@CMU\n - MSML@CMU\n - MSR@CMU\n - MCIS@UPenn\n - MSE in Robotics@UPenn\n - MSCS@UT-Austin\n - Two-Year MSCS@Yale\n NONCS:\n - CSE@Harvard\n - DS@Harvard\n - ICME@Stanford\n- S:\n CS:\n - MCDS@CMU\n - MIIS@CMU\n - MSAII@CMU\n - MSCV@CMU \n - MSCS@UCLA\n - MSCS@UIUC\n - CS Meng@Cornell\n - MSCS@Wisc\n - MSCSE@UMich\n NONCS:\n - EE@Stanford\n - MS&E@Stanford\n - DS@UPenn\n- A+:\n CS:\n - One-Year MSCS@Yale\n - EECS Meng@Berkeley\n - CS Meng@Cornell Tech\n - MSIN@CMU\n - MSCS@Duke\n - MSCS@GaTech\n - MSCS@NWU\n - MCS@UIUC\n - MSCS@UBC\n - MMath@Waterloo\n - MPhil-CSE@HKUST\n - MSCS@UMD\n NONCS:\n - ECE Meng(coop)@Waterloo\n - ECE@UT Austin\n- A:\n CS:\n - SESV@CMU\n - CS75@UCSD\n - CM@Cornell Tech\n NONCS:\n - MDSAI@Waterloo\n - MScAc@UofT\n - ECE@CMU\n - ECE Meng@UBC\n - MITS@CMU\n - DS@NYU\n - DS@UMich\n- A-:\n CS:\n - MSECS@JHU\n - ScM CS@Brown\n - MSCS@Columbia\n - MSCS@Dartmouth\n - MSCS@UCSB\n - MCS@Rice\n - MPCS@UChicago\n - MCS@UCI\n - CSE@GaTech\n NONCS:\n - EC79@UCSD\n - MSMITE@CMU\n - DS@Columbia\n - CSDA@Dartmouth\n - ECE@Duke\n - ECE@GaTech\n - CGGT@UPenn\n - MEng@UCLA\n- B+:\n CS:\n - MSE-SS@CMU\n - MSCS@NYU Courant\n - MSCS@NYU Tandon\n - MCS@TAMU\n - MSCS@TAMU\n - MSWE@UCI\n - CS28@USC\n - MSCS@uAlberta\n - MSCS@uCalgary\n NONCS:\n - DS75@UCSD\n - MISM@CMU\n - ECE MEng@Cornell\n - ECE Meng@UIUC\n - MPS-IS@Cornell\n - EC82@UCSD\n - EC93@UCSD\n - Visual Computing@SFU\n - Cybersecurity@SFU\n - Big Data@SFU\n- B:\n CS:\n - CS General@NEU\n - MSCSE@UCSC\n - MSCS&SE@UWB\n - NetSys@UCI\n - MCS@uOttawa\n - MSCS@Western\n - CE MEng@TAMU\n - MCS@UVa\n - MSCS@UVa\n - MSCS@Virginia Tech\n - CAS MEng@McMaster\n NONCS:\n - ECE Meng@UofT\n - ECE Meng@Waterloo\n - MEng Soft@uCalgary\n - MSIM@UIUC\n - MI@UofT\n- B-:\n CS:\n - MSCSE@OSU\n - MSCSE@PSU\n - MSCS@UCD\n - MSCS@SBU\n - MSCS@UF\n - MSCS@UMass\n - MSCS@UMN\n - MSCS@Rutgers\n - MSCS@WUSTL\n - MCS@NCSU\n - EE-PMP@UW\n - MSCSS@UWT\n - MACS@Dalhousie\n NONCS:\n - ECE@Duke-Kunshan\n - ECE@GaTech-Shenzhen\n - ECE MEng@uOttawa\n - ECE MEng@Western\n - ECE MEng@uAlberta\n - CE@NYU Tandon\n - MSIS@NYU Courant\n- C+:\n CS:\n - MSCS@BU\n - MSCS@Emory\n - MSCS@Tufts\n - MSCS@UTD\n - MSCS@Vanderbilt\n - CS Meng@VT\n NONCS:\n - IS@NEU\n - SES@NEU\n- C:\n CS:\n - MSCS@BC\n - MSCS@GWU\n - MSCS@SIT\n NONCS:\n - IS@Pitt\n- 待分类:\n CS:\n - PCP@Wisc\n - CS-PMP@Wisc\n - MSCS@SMU\n - MCS@Utah\n - MSCS@SCU\n - MSCS@Syracuse\n NONCS:\n - MSECE@UIUC\n - Cybersecurity@GaTech\n - MSSI@JHU\n- 陆本黑洞:\n CS:\n - MSCS@Berkeley\n - MSCS@Cornell\n - MSCS@Purdue\n - MSc@UofT\n NONCS:\n- 转码:\n CS:\n - MSCS@Brandeis\n - CS Align@NEU\n - MSCS@SCU\n - MSCS@Syracuse\n - MPCS@UChicago\n - MCIT@UPenn\n - CS37@USC\n - MSWE@UCI\n - PCP@Wisc\n - MSCS@SMU\n - MSCS@Utah\n - BCS@UBC\n NONCS:\n - MSIM@UIUC\n - ISB@NEU\n - MSIS@UNC\n - MSIS@NYU Courant\n - MSIS@UT Austin\n"
},
{
"path": "script.py",
"content": "import yaml\n\nif __name__ == \"__main__\":\n with open('./programs_list.yml', 'r', encoding='utf-8') as f:\n content = yaml.safe_load(f)\n mkdocs_content = list()\n docs_content = list()\n for cata in content:\n (level, programs_dict), = cata.items()\n cs_programs = programs_dict['CS']\n noncs_programs = programs_dict['NONCS']\n if cs_programs is not None:\n cs_programs = sorted(cs_programs, key=lambda x: x.split('@')[-1] + x.split('@')[0])\n else:\n cs_programs = []\n if noncs_programs is not None:\n noncs_programs = sorted(noncs_programs, key=lambda x: x.split('@')[-1] + x.split('@')[0])\n else:\n noncs_programs = []\n programs = cs_programs + noncs_programs\n\n mkdocs_programs = programs.copy()\n for i, program in enumerate(mkdocs_programs):\n mkdocs_programs[i] = '{0}: {0}.md'.format(program)\n mkdocs_content.append({level: mkdocs_programs})\n\n docs_programs = programs.copy()\n for i, program in enumerate(docs_programs):\n docs_programs[i] = '[*{0}*]({0}.md)\\n\\n'.format(program) if program in noncs_programs else '[**{0}**]({0}.md)\\n\\n'.format(program)\n docs_content.append('### {0}\\n\\n'.format(level))\n docs_content += docs_programs\n\n mkdocs_content = yaml.dump(mkdocs_content, sort_keys=False, default_flow_style=False, allow_unicode=True).replace('\\'', '')\n with open('mkdocs.yml', 'r', encoding=\"utf-8\") as f:\n mkdocs_origin = f.read()\n with open('mkdocs.yml', 'w', encoding=\"utf-8\") as f:\n f.write(mkdocs_origin.replace('$programs_list', mkdocs_content.replace('- ', ' - ')))\n with open('./docs/grade.md', 'r', encoding=\"utf-8\") as f:\n docs_origin = f.read()\n with open('./docs/grade.md', 'w', encoding=\"utf-8\") as f:\n f.write(docs_origin.replace('$programs_list', ''.join(docs_content)))\n\n with open('./blogs_list.yml', 'r', encoding='utf-8') as f:\n content = yaml.safe_load(f)\n docs_content = list()\n for blog in content:\n docs_content.append('[{0}]({0}.md)\\n\\n'.format(blog))\n with open('./docs/blog.md', 'r', encoding=\"utf-8\") as f:\n docs_origin = f.read()\n with open('./docs/blog.md', 'w', encoding=\"utf-8\") as f:\n f.write(docs_origin.replace('$blogs_list', ''.join(docs_content)))\n"
},
{
"path": "site/assets/javascripts/lunr/tinyseg.js",
"content": "/**\n * export the module via AMD, CommonJS or as a browser global\n * Export code from https://github.com/umdjs/umd/blob/master/returnExports.js\n */\n;(function (root, factory) {\n if (typeof define === 'function' && define.amd) {\n // AMD. Register as an anonymous module.\n define(factory)\n } else if (typeof exports === 'object') {\n /**\n * Node. Does not work with strict CommonJS, but\n * only CommonJS-like environments that support module.exports,\n * like Node.\n */\n module.exports = factory()\n } else {\n // Browser globals (root is window)\n factory()(root.lunr);\n }\n}(this, function () {\n /**\n * Just return a value to define the module export.\n * This example returns an object, but the module\n * can return a function as the exported value.\n */\n\n return function(lunr) {\n // TinySegmenter 0.1 -- Super compact Japanese tokenizer in Javascript\n // (c) 2008 Taku Kudo \n // TinySegmenter is freely distributable under the terms of a new BSD licence.\n // For details, see http://chasen.org/~taku/software/TinySegmenter/LICENCE.txt\n\n function TinySegmenter() {\n var patterns = {\n \"[一二三四五六七八九十百千万億兆]\":\"M\",\n \"[一-龠々〆ヵヶ]\":\"H\",\n \"[ぁ-ん]\":\"I\",\n \"[ァ-ヴーｱ-ﾝﾞｰ]\":\"K\",\n \"[a-zA-Zａ-ｚＡ-Ｚ]\":\"A\",\n \"[0-9０-９]\":\"N\"\n }\n this.chartype_ = [];\n for (var i in patterns) {\n var regexp = new RegExp(i);\n this.chartype_.push([regexp, patterns[i]]);\n }\n\n this.BIAS__ = -332\n this.BC1__ = {\"HH\":6,\"II\":2461,\"KH\":406,\"OH\":-1378};\n this.BC2__ = {\"AA\":-3267,\"AI\":2744,\"AN\":-878,\"HH\":-4070,\"HM\":-1711,\"HN\":4012,\"HO\":3761,\"IA\":1327,\"IH\":-1184,\"II\":-1332,\"IK\":1721,\"IO\":5492,\"KI\":3831,\"KK\":-8741,\"MH\":-3132,\"MK\":3334,\"OO\":-2920};\n this.BC3__ = {\"HH\":996,\"HI\":626,\"HK\":-721,\"HN\":-1307,\"HO\":-836,\"IH\":-301,\"KK\":2762,\"MK\":1079,\"MM\":4034,\"OA\":-1652,\"OH\":266};\n this.BP1__ = {\"BB\":295,\"OB\":304,\"OO\":-125,\"UB\":352};\n this.BP2__ = {\"BO\":60,\"OO\":-1762};\n this.BQ1__ = {\"BHH\":1150,\"BHM\":1521,\"BII\":-1158,\"BIM\":886,\"BMH\":1208,\"BNH\":449,\"BOH\":-91,\"BOO\":-2597,\"OHI\":451,\"OIH\":-296,\"OKA\":1851,\"OKH\":-1020,\"OKK\":904,\"OOO\":2965};\n this.BQ2__ = {\"BHH\":118,\"BHI\":-1159,\"BHM\":466,\"BIH\":-919,\"BKK\":-1720,\"BKO\":864,\"OHH\":-1139,\"OHM\":-181,\"OIH\":153,\"UHI\":-1146};\n this.BQ3__ = {\"BHH\":-792,\"BHI\":2664,\"BII\":-299,\"BKI\":419,\"BMH\":937,\"BMM\":8335,\"BNN\":998,\"BOH\":775,\"OHH\":2174,\"OHM\":439,\"OII\":280,\"OKH\":1798,\"OKI\":-793,\"OKO\":-2242,\"OMH\":-2402,\"OOO\":11699};\n this.BQ4__ = {\"BHH\":-3895,\"BIH\":3761,\"BII\":-4654,\"BIK\":1348,\"BKK\":-1806,\"BMI\":-3385,\"BOO\":-12396,\"OAH\":926,\"OHH\":266,\"OHK\":-2036,\"ONN\":-973};\n this.BW1__ = {\",と\":660,\",同\":727,\"B1あ\":1404,\"B1同\":542,\"、と\":660,\"、同\":727,\"」と\":1682,\"あっ\":1505,\"いう\":1743,\"いっ\":-2055,\"いる\":672,\"うし\":-4817,\"うん\":665,\"から\":3472,\"がら\":600,\"こう\":-790,\"こと\":2083,\"こん\":-1262,\"さら\":-4143,\"さん\":4573,\"した\":2641,\"して\":1104,\"すで\":-3399,\"そこ\":1977,\"それ\":-871,\"たち\":1122,\"ため\":601,\"った\":3463,\"つい\":-802,\"てい\":805,\"てき\":1249,\"でき\":1127,\"です\":3445,\"では\":844,\"とい\":-4915,\"とみ\":1922,\"どこ\":3887,\"ない\":5713,\"なっ\":3015,\"など\":7379,\"なん\":-1113,\"にし\":2468,\"には\":1498,\"にも\":1671,\"に対\":-912,\"の一\":-501,\"の中\":741,\"ませ\":2448,\"まで\":1711,\"まま\":2600,\"まる\":-2155,\"やむ\":-1947,\"よっ\":-2565,\"れた\":2369,\"れで\":-913,\"をし\":1860,\"を見\":731,\"亡く\":-1886,\"京都\":2558,\"取り\":-2784,\"大き\":-2604,\"大阪\":1497,\"平方\":-2314,\"引き\":-1336,\"日本\":-195,\"本当\":-2423,\"毎日\":-2113,\"目指\":-724,\"Ｂ１あ\":1404,\"Ｂ１同\":542,\"｣と\":1682};\n this.BW2__ = {\"..\":-11822,\"11\":-669,\"――\":-5730,\"−−\":-13175,\"いう\":-1609,\"うか\":2490,\"かし\":-1350,\"かも\":-602,\"から\":-7194,\"かれ\":4612,\"がい\":853,\"がら\":-3198,\"きた\":1941,\"くな\":-1597,\"こと\":-8392,\"この\":-4193,\"させ\":4533,\"され\":13168,\"さん\":-3977,\"しい\":-1819,\"しか\":-545,\"した\":5078,\"して\":972,\"しな\":939,\"その\":-3744,\"たい\":-1253,\"たた\":-662,\"ただ\":-3857,\"たち\":-786,\"たと\":1224,\"たは\":-939,\"った\":4589,\"って\":1647,\"っと\":-2094,\"てい\":6144,\"てき\":3640,\"てく\":2551,\"ては\":-3110,\"ても\":-3065,\"でい\":2666,\"でき\":-1528,\"でし\":-3828,\"です\":-4761,\"でも\":-4203,\"とい\":1890,\"とこ\":-1746,\"とと\":-2279,\"との\":720,\"とみ\":5168,\"とも\":-3941,\"ない\":-2488,\"なが\":-1313,\"など\":-6509,\"なの\":2614,\"なん\":3099,\"にお\":-1615,\"にし\":2748,\"にな\":2454,\"によ\":-7236,\"に対\":-14943,\"に従\":-4688,\"に関\":-11388,\"のか\":2093,\"ので\":-7059,\"のに\":-6041,\"のの\":-6125,\"はい\":1073,\"はが\":-1033,\"はず\":-2532,\"ばれ\":1813,\"まし\":-1316,\"まで\":-6621,\"まれ\":5409,\"めて\":-3153,\"もい\":2230,\"もの\":-10713,\"らか\":-944,\"らし\":-1611,\"らに\":-1897,\"りし\":651,\"りま\":1620,\"れた\":4270,\"れて\":849,\"れば\":4114,\"ろう\":6067,\"われ\":7901,\"を通\":-11877,\"んだ\":728,\"んな\":-4115,\"一人\":602,\"一方\":-1375,\"一日\":970,\"一部\":-1051,\"上が\":-4479,\"会社\":-1116,\"出て\":2163,\"分の\":-7758,\"同党\":970,\"同日\":-913,\"大阪\":-2471,\"委員\":-1250,\"少な\":-1050,\"年度\":-8669,\"年間\":-1626,\"府県\":-2363,\"手権\":-1982,\"新聞\":-4066,\"日新\":-722,\"日本\":-7068,\"日米\":3372,\"曜日\":-601,\"朝鮮\":-2355,\"本人\":-2697,\"東京\":-1543,\"然と\":-1384,\"社会\":-1276,\"立て\":-990,\"第に\":-1612,\"米国\":-4268,\"１１\":-669};\n this.BW3__ = {\"あた\":-2194,\"あり\":719,\"ある\":3846,\"い.\":-1185,\"い。\":-1185,\"いい\":5308,\"いえ\":2079,\"いく\":3029,\"いた\":2056,\"いっ\":1883,\"いる\":5600,\"いわ\":1527,\"うち\":1117,\"うと\":4798,\"えと\":1454,\"か.\":2857,\"か。\":2857,\"かけ\":-743,\"かっ\":-4098,\"かに\":-669,\"から\":6520,\"かり\":-2670,\"が,\":1816,\"が、\":1816,\"がき\":-4855,\"がけ\":-1127,\"がっ\":-913,\"がら\":-4977,\"がり\":-2064,\"きた\":1645,\"けど\":1374,\"こと\":7397,\"この\":1542,\"ころ\":-2757,\"さい\":-714,\"さを\":976,\"し,\":1557,\"し、\":1557,\"しい\":-3714,\"した\":3562,\"して\":1449,\"しな\":2608,\"しま\":1200,\"す.\":-1310,\"す。\":-1310,\"する\":6521,\"ず,\":3426,\"ず、\":3426,\"ずに\":841,\"そう\":428,\"た.\":8875,\"た。\":8875,\"たい\":-594,\"たの\":812,\"たり\":-1183,\"たる\":-853,\"だ.\":4098,\"だ。\":4098,\"だっ\":1004,\"った\":-4748,\"って\":300,\"てい\":6240,\"てお\":855,\"ても\":302,\"です\":1437,\"でに\":-1482,\"では\":2295,\"とう\":-1387,\"とし\":2266,\"との\":541,\"とも\":-3543,\"どう\":4664,\"ない\":1796,\"なく\":-903,\"など\":2135,\"に,\":-1021,\"に、\":-1021,\"にし\":1771,\"にな\":1906,\"には\":2644,\"の,\":-724,\"の、\":-724,\"の子\":-1000,\"は,\":1337,\"は、\":1337,\"べき\":2181,\"まし\":1113,\"ます\":6943,\"まっ\":-1549,\"まで\":6154,\"まれ\":-793,\"らし\":1479,\"られ\":6820,\"るる\":3818,\"れ,\":854,\"れ、\":854,\"れた\":1850,\"れて\":1375,\"れば\":-3246,\"れる\":1091,\"われ\":-605,\"んだ\":606,\"んで\":798,\"カ月\":990,\"会議\":860,\"入り\":1232,\"大会\":2217,\"始め\":1681,\"市\":965,\"新聞\":-5055,\"日,\":974,\"日、\":974,\"社会\":2024,\"ｶ月\":990};\n this.TC1__ = {\"AAA\":1093,\"HHH\":1029,\"HHM\":580,\"HII\":998,\"HOH\":-390,\"HOM\":-331,\"IHI\":1169,\"IOH\":-142,\"IOI\":-1015,\"IOM\":467,\"MMH\":187,\"OOI\":-1832};\n this.TC2__ = {\"HHO\":2088,\"HII\":-1023,\"HMM\":-1154,\"IHI\":-1965,\"KKH\":703,\"OII\":-2649};\n this.TC3__ = {\"AAA\":-294,\"HHH\":346,\"HHI\":-341,\"HII\":-1088,\"HIK\":731,\"HOH\":-1486,\"IHH\":128,\"IHI\":-3041,\"IHO\":-1935,\"IIH\":-825,\"IIM\":-1035,\"IOI\":-542,\"KHH\":-1216,\"KKA\":491,\"KKH\":-1217,\"KOK\":-1009,\"MHH\":-2694,\"MHM\":-457,\"MHO\":123,\"MMH\":-471,\"NNH\":-1689,\"NNO\":662,\"OHO\":-3393};\n this.TC4__ = {\"HHH\":-203,\"HHI\":1344,\"HHK\":365,\"HHM\":-122,\"HHN\":182,\"HHO\":669,\"HIH\":804,\"HII\":679,\"HOH\":446,\"IHH\":695,\"IHO\":-2324,\"IIH\":321,\"III\":1497,\"IIO\":656,\"IOO\":54,\"KAK\":4845,\"KKA\":3386,\"KKK\":3065,\"MHH\":-405,\"MHI\":201,\"MMH\":-241,\"MMM\":661,\"MOM\":841};\n this.TQ1__ = {\"BHHH\":-227,\"BHHI\":316,\"BHIH\":-132,\"BIHH\":60,\"BIII\":1595,\"BNHH\":-744,\"BOHH\":225,\"BOOO\":-908,\"OAKK\":482,\"OHHH\":281,\"OHIH\":249,\"OIHI\":200,\"OIIH\":-68};\n this.TQ2__ = {\"BIHH\":-1401,\"BIII\":-1033,\"BKAK\":-543,\"BOOO\":-5591};\n this.TQ3__ = {\"BHHH\":478,\"BHHM\":-1073,\"BHIH\":222,\"BHII\":-504,\"BIIH\":-116,\"BIII\":-105,\"BMHI\":-863,\"BMHM\":-464,\"BOMH\":620,\"OHHH\":346,\"OHHI\":1729,\"OHII\":997,\"OHMH\":481,\"OIHH\":623,\"OIIH\":1344,\"OKAK\":2792,\"OKHH\":587,\"OKKA\":679,\"OOHH\":110,\"OOII\":-685};\n this.TQ4__ = {\"BHHH\":-721,\"BHHM\":-3604,\"BHII\":-966,\"BIIH\":-607,\"BIII\":-2181,\"OAAA\":-2763,\"OAKK\":180,\"OHHH\":-294,\"OHHI\":2446,\"OHHO\":480,\"OHIH\":-1573,\"OIHH\":1935,\"OIHI\":-493,\"OIIH\":626,\"OIII\":-4007,\"OKAK\":-8156};\n this.TW1__ = {\"につい\":-4681,\"東京都\":2026};\n this.TW2__ = {\"ある程\":-2049,\"いった\":-1256,\"ころが\":-2434,\"しょう\":3873,\"その後\":-4430,\"だって\":-1049,\"ていた\":1833,\"として\":-4657,\"ともに\":-4517,\"もので\":1882,\"一気に\":-792,\"初めて\":-1512,\"同時に\":-8097,\"大きな\":-1255,\"対して\":-2721,\"社会党\":-3216};\n this.TW3__ = {\"いただ\":-1734,\"してい\":1314,\"として\":-4314,\"につい\":-5483,\"にとっ\":-5989,\"に当た\":-6247,\"ので,\":-727,\"ので、\":-727,\"のもの\":-600,\"れから\":-3752,\"十二月\":-2287};\n this.TW4__ = {\"いう.\":8576,\"いう。\":8576,\"からな\":-2348,\"してい\":2958,\"たが,\":1516,\"たが、\":1516,\"ている\":1538,\"という\":1349,\"ました\":5543,\"ません\":1097,\"ようと\":-4258,\"よると\":5865};\n this.UC1__ = {\"A\":484,\"K\":93,\"M\":645,\"O\":-505};\n this.UC2__ = {\"A\":819,\"H\":1059,\"I\":409,\"M\":3987,\"N\":5775,\"O\":646};\n this.UC3__ = {\"A\":-1370,\"I\":2311};\n this.UC4__ = {\"A\":-2643,\"H\":1809,\"I\":-1032,\"K\":-3450,\"M\":3565,\"N\":3876,\"O\":6646};\n this.UC5__ = {\"H\":313,\"I\":-1238,\"K\":-799,\"M\":539,\"O\":-831};\n this.UC6__ = {\"H\":-506,\"I\":-253,\"K\":87,\"M\":247,\"O\":-387};\n this.UP1__ = {\"O\":-214};\n this.UP2__ = {\"B\":69,\"O\":935};\n this.UP3__ = {\"B\":189};\n this.UQ1__ = {\"BH\":21,\"BI\":-12,\"BK\":-99,\"BN\":142,\"BO\":-56,\"OH\":-95,\"OI\":477,\"OK\":410,\"OO\":-2422};\n this.UQ2__ = {\"BH\":216,\"BI\":113,\"OK\":1759};\n this.UQ3__ = {\"BA\":-479,\"BH\":42,\"BI\":1913,\"BK\":-7198,\"BM\":3160,\"BN\":6427,\"BO\":14761,\"OI\":-827,\"ON\":-3212};\n this.UW1__ = {\",\":156,\"、\":156,\"「\":-463,\"あ\":-941,\"う\":-127,\"が\":-553,\"き\":121,\"こ\":505,\"で\":-201,\"と\":-547,\"ど\":-123,\"に\":-789,\"の\":-185,\"は\":-847,\"も\":-466,\"や\":-470,\"よ\":182,\"ら\":-292,\"り\":208,\"れ\":169,\"を\":-446,\"ん\":-137,\"・\":-135,\"主\":-402,\"京\":-268,\"区\":-912,\"午\":871,\"国\":-460,\"大\":561,\"委\":729,\"市\":-411,\"日\":-141,\"理\":361,\"生\":-408,\"県\":-386,\"都\":-718,\"｢\":-463,\"･\":-135};\n this.UW2__ = {\",\":-829,\"、\":-829,\"〇\":892,\"「\":-645,\"」\":3145,\"あ\":-538,\"い\":505,\"う\":134,\"お\":-502,\"か\":1454,\"が\":-856,\"く\":-412,\"こ\":1141,\"さ\":878,\"ざ\":540,\"し\":1529,\"す\":-675,\"せ\":300,\"そ\":-1011,\"た\":188,\"だ\":1837,\"つ\":-949,\"て\":-291,\"で\":-268,\"と\":-981,\"ど\":1273,\"な\":1063,\"に\":-1764,\"の\":130,\"は\":-409,\"ひ\":-1273,\"べ\":1261,\"ま\":600,\"も\":-1263,\"や\":-402,\"よ\":1639,\"り\":-579,\"る\":-694,\"れ\":571,\"を\":-2516,\"ん\":2095,\"ア\":-587,\"カ\":306,\"キ\":568,\"ッ\":831,\"三\":-758,\"不\":-2150,\"世\":-302,\"中\":-968,\"主\":-861,\"事\":492,\"人\":-123,\"会\":978,\"保\":362,\"入\":548,\"初\":-3025,\"副\":-1566,\"北\":-3414,\"区\":-422,\"大\":-1769,\"天\":-865,\"太\":-483,\"子\":-1519,\"学\":760,\"実\":1023,\"小\":-2009,\"市\":-813,\"年\":-1060,\"強\":1067,\"手\":-1519,\"揺\":-1033,\"政\":1522,\"文\":-1355,\"新\":-1682,\"日\":-1815,\"明\":-1462,\"最\":-630,\"朝\":-1843,\"本\":-1650,\"東\":-931,\"果\":-665,\"次\":-2378,\"民\":-180,\"気\":-1740,\"理\":752,\"発\":529,\"目\":-1584,\"相\":-242,\"県\":-1165,\"立\":-763,\"第\":810,\"米\":509,\"自\":-1353,\"行\":838,\"西\":-744,\"見\":-3874,\"調\":1010,\"議\":1198,\"込\":3041,\"開\":1758,\"間\":-1257,\"｢\":-645,\"｣\":3145,\"ｯ\":831,\"ｱ\":-587,\"ｶ\":306,\"ｷ\":568};\n this.UW3__ = {\",\":4889,\"1\":-800,\"−\":-1723,\"、\":4889,\"々\":-2311,\"〇\":5827,\"」\":2670,\"〓\":-3573,\"あ\":-2696,\"い\":1006,\"う\":2342,\"え\":1983,\"お\":-4864,\"か\":-1163,\"が\":3271,\"く\":1004,\"け\":388,\"げ\":401,\"こ\":-3552,\"ご\":-3116,\"さ\":-1058,\"し\":-395,\"す\":584,\"せ\":3685,\"そ\":-5228,\"た\":842,\"ち\":-521,\"っ\":-1444,\"つ\":-1081,\"て\":6167,\"で\":2318,\"と\":1691,\"ど\":-899,\"な\":-2788,\"に\":2745,\"の\":4056,\"は\":4555,\"ひ\":-2171,\"ふ\":-1798,\"へ\":1199,\"ほ\":-5516,\"ま\":-4384,\"み\":-120,\"め\":1205,\"も\":2323,\"や\":-788,\"よ\":-202,\"ら\":727,\"り\":649,\"る\":5905,\"れ\":2773,\"わ\":-1207,\"を\":6620,\"ん\":-518,\"ア\":551,\"グ\":1319,\"ス\":874,\"ッ\":-1350,\"ト\":521,\"ム\":1109,\"ル\":1591,\"ロ\":2201,\"ン\":278,\"・\":-3794,\"一\":-1619,\"下\":-1759,\"世\":-2087,\"両\":3815,\"中\":653,\"主\":-758,\"予\":-1193,\"二\":974,\"人\":2742,\"今\":792,\"他\":1889,\"以\":-1368,\"低\":811,\"何\":4265,\"作\":-361,\"保\":-2439,\"元\":4858,\"党\":3593,\"全\":1574,\"公\":-3030,\"六\":755,\"共\":-1880,\"円\":5807,\"再\":3095,\"分\":457,\"初\":2475,\"別\":1129,\"前\":2286,\"副\":4437,\"力\":365,\"動\":-949,\"務\":-1872,\"化\":1327,\"北\":-1038,\"区\":4646,\"千\":-2309,\"午\":-783,\"協\":-1006,\"口\":483,\"右\":1233,\"各\":3588,\"合\":-241,\"同\":3906,\"和\":-837,\"員\":4513,\"国\":642,\"型\":1389,\"場\":1219,\"外\":-241,\"妻\":2016,\"学\":-1356,\"安\":-423,\"実\":-1008,\"家\":1078,\"小\":-513,\"少\":-3102,\"州\":1155,\"市\":3197,\"平\":-1804,\"年\":2416,\"広\":-1030,\"府\":1605,\"度\":1452,\"建\":-2352,\"当\":-3885,\"得\":1905,\"思\":-1291,\"性\":1822,\"戸\":-488,\"指\":-3973,\"政\":-2013,\"教\":-1479,\"数\":3222,\"文\":-1489,\"新\":1764,\"日\":2099,\"旧\":5792,\"昨\":-661,\"時\":-1248,\"曜\":-951,\"最\":-937,\"月\":4125,\"期\":360,\"李\":3094,\"村\":364,\"東\":-805,\"核\":5156,\"森\":2438,\"業\":484,\"氏\":2613,\"民\":-1694,\"決\":-1073,\"法\":1868,\"海\":-495,\"無\":979,\"物\":461,\"特\":-3850,\"生\":-273,\"用\":914,\"町\":1215,\"的\":7313,\"直\":-1835,\"省\":792,\"県\":6293,\"知\":-1528,\"私\":4231,\"税\":401,\"立\":-960,\"第\":1201,\"米\":7767,\"系\":3066,\"約\":3663,\"級\":1384,\"統\":-4229,\"総\":1163,\"線\":1255,\"者\":6457,\"能\":725,\"自\":-2869,\"英\":785,\"見\":1044,\"調\":-562,\"財\":-733,\"費\":1777,\"車\":1835,\"軍\":1375,\"込\":-1504,\"通\":-1136,\"選\":-681,\"郎\":1026,\"郡\":4404,\"部\":1200,\"金\":2163,\"長\":421,\"開\":-1432,\"間\":1302,\"関\":-1282,\"雨\":2009,\"電\":-1045,\"非\":2066,\"駅\":1620,\"１\":-800,\"｣\":2670,\"･\":-3794,\"ｯ\":-1350,\"ｱ\":551,\"ｸﾞ\":1319,\"ｽ\":874,\"ﾄ\":521,\"ﾑ\":1109,\"ﾙ\":1591,\"ﾛ\":2201,\"ﾝ\":278};\n this.UW4__ = {\",\":3930,\".\":3508,\"―\":-4841,\"、\":3930,\"。\":3508,\"〇\":4999,\"「\":1895,\"」\":3798,\"〓\":-5156,\"あ\":4752,\"い\":-3435,\"う\":-640,\"え\":-2514,\"お\":2405,\"か\":530,\"が\":6006,\"き\":-4482,\"ぎ\":-3821,\"く\":-3788,\"け\":-4376,\"げ\":-4734,\"こ\":2255,\"ご\":1979,\"さ\":2864,\"し\":-843,\"じ\":-2506,\"す\":-731,\"ず\":1251,\"せ\":181,\"そ\":4091,\"た\":5034,\"だ\":5408,\"ち\":-3654,\"っ\":-5882,\"つ\":-1659,\"て\":3994,\"で\":7410,\"と\":4547,\"な\":5433,\"に\":6499,\"ぬ\":1853,\"ね\":1413,\"の\":7396,\"は\":8578,\"ば\":1940,\"ひ\":4249,\"び\":-4134,\"ふ\":1345,\"へ\":6665,\"べ\":-744,\"ほ\":1464,\"ま\":1051,\"み\":-2082,\"む\":-882,\"め\":-5046,\"も\":4169,\"ゃ\":-2666,\"や\":2795,\"ょ\":-1544,\"よ\":3351,\"ら\":-2922,\"り\":-9726,\"る\":-14896,\"れ\":-2613,\"ろ\":-4570,\"わ\":-1783,\"を\":13150,\"ん\":-2352,\"カ\":2145,\"コ\":1789,\"セ\":1287,\"ッ\":-724,\"ト\":-403,\"メ\":-1635,\"ラ\":-881,\"リ\":-541,\"ル\":-856,\"ン\":-3637,\"・\":-4371,\"ー\":-11870,\"一\":-2069,\"中\":2210,\"予\":782,\"事\":-190,\"井\":-1768,\"人\":1036,\"以\":544,\"会\":950,\"体\":-1286,\"作\":530,\"側\":4292,\"先\":601,\"党\":-2006,\"共\":-1212,\"内\":584,\"円\":788,\"初\":1347,\"前\":1623,\"副\":3879,\"力\":-302,\"動\":-740,\"務\":-2715,\"化\":776,\"区\":4517,\"協\":1013,\"参\":1555,\"合\":-1834,\"和\":-681,\"員\":-910,\"器\":-851,\"回\":1500,\"国\":-619,\"園\":-1200,\"地\":866,\"場\":-1410,\"塁\":-2094,\"士\":-1413,\"多\":1067,\"大\":571,\"子\":-4802,\"学\":-1397,\"定\":-1057,\"寺\":-809,\"小\":1910,\"屋\":-1328,\"山\":-1500,\"島\":-2056,\"川\":-2667,\"市\":2771,\"年\":374,\"庁\":-4556,\"後\":456,\"性\":553,\"感\":916,\"所\":-1566,\"支\":856,\"改\":787,\"政\":2182,\"教\":704,\"文\":522,\"方\":-856,\"日\":1798,\"時\":1829,\"最\":845,\"月\":-9066,\"木\":-485,\"来\":-442,\"校\":-360,\"業\":-1043,\"氏\":5388,\"民\":-2716,\"気\":-910,\"沢\":-939,\"済\":-543,\"物\":-735,\"率\":672,\"球\":-1267,\"生\":-1286,\"産\":-1101,\"田\":-2900,\"町\":1826,\"的\":2586,\"目\":922,\"省\":-3485,\"県\":2997,\"空\":-867,\"立\":-2112,\"第\":788,\"米\":2937,\"系\":786,\"約\":2171,\"経\":1146,\"統\":-1169,\"総\":940,\"線\":-994,\"署\":749,\"者\":2145,\"能\":-730,\"般\":-852,\"行\":-792,\"規\":792,\"警\":-1184,\"議\":-244,\"谷\":-1000,\"賞\":730,\"車\":-1481,\"軍\":1158,\"輪\":-1433,\"込\":-3370,\"近\":929,\"道\":-1291,\"選\":2596,\"郎\":-4866,\"都\":1192,\"野\":-1100,\"銀\":-2213,\"長\":357,\"間\":-2344,\"院\":-2297,\"際\":-2604,\"電\":-878,\"領\":-1659,\"題\":-792,\"館\":-1984,\"首\":1749,\"高\":2120,\"｢\":1895,\"｣\":3798,\"･\":-4371,\"ｯ\":-724,\"ｰ\":-11870,\"ｶ\":2145,\"ｺ\":1789,\"ｾ\":1287,\"ﾄ\":-403,\"ﾒ\":-1635,\"ﾗ\":-881,\"ﾘ\":-541,\"ﾙ\":-856,\"ﾝ\":-3637};\n this.UW5__ = {\",\":465,\".\":-299,\"1\":-514,\"E2\":-32768,\"]\":-2762,\"、\":465,\"。\":-299,\"「\":363,\"あ\":1655,\"い\":331,\"う\":-503,\"え\":1199,\"お\":527,\"か\":647,\"が\":-421,\"き\":1624,\"ぎ\":1971,\"く\":312,\"げ\":-983,\"さ\":-1537,\"し\":-1371,\"す\":-852,\"だ\":-1186,\"ち\":1093,\"っ\":52,\"つ\":921,\"て\":-18,\"で\":-850,\"と\":-127,\"ど\":1682,\"な\":-787,\"に\":-1224,\"の\":-635,\"は\":-578,\"べ\":1001,\"み\":502,\"め\":865,\"ゃ\":3350,\"ょ\":854,\"り\":-208,\"る\":429,\"れ\":504,\"わ\":419,\"を\":-1264,\"ん\":327,\"イ\":241,\"ル\":451,\"ン\":-343,\"中\":-871,\"京\":722,\"会\":-1153,\"党\":-654,\"務\":3519,\"区\":-901,\"告\":848,\"員\":2104,\"大\":-1296,\"学\":-548,\"定\":1785,\"嵐\":-1304,\"市\":-2991,\"席\":921,\"年\":1763,\"思\":872,\"所\":-814,\"挙\":1618,\"新\":-1682,\"日\":218,\"月\":-4353,\"査\":932,\"格\":1356,\"機\":-1508,\"氏\":-1347,\"田\":240,\"町\":-3912,\"的\":-3149,\"相\":1319,\"省\":-1052,\"県\":-4003,\"研\":-997,\"社\":-278,\"空\":-813,\"統\":1955,\"者\":-2233,\"表\":663,\"語\":-1073,\"議\":1219,\"選\":-1018,\"郎\":-368,\"長\":786,\"間\":1191,\"題\":2368,\"館\":-689,\"１\":-514,\"Ｅ２\":-32768,\"｢\":363,\"ｲ\":241,\"ﾙ\":451,\"ﾝ\":-343};\n this.UW6__ = {\",\":227,\".\":808,\"1\":-270,\"E1\":306,\"、\":227,\"。\":808,\"あ\":-307,\"う\":189,\"か\":241,\"が\":-73,\"く\":-121,\"こ\":-200,\"じ\":1782,\"す\":383,\"た\":-428,\"っ\":573,\"て\":-1014,\"で\":101,\"と\":-105,\"な\":-253,\"に\":-149,\"の\":-417,\"は\":-236,\"も\":-206,\"り\":187,\"る\":-135,\"を\":195,\"ル\":-673,\"ン\":-496,\"一\":-277,\"中\":201,\"件\":-800,\"会\":624,\"前\":302,\"区\":1792,\"員\":-1212,\"委\":798,\"学\":-960,\"市\":887,\"広\":-695,\"後\":535,\"業\":-697,\"相\":753,\"社\":-507,\"福\":974,\"空\":-822,\"者\":1811,\"連\":463,\"郎\":1082,\"１\":-270,\"Ｅ１\":306,\"ﾙ\":-673,\"ﾝ\":-496};\n \n return this;\n }\n TinySegmenter.prototype.ctype_ = function(str) {\n for (var i in this.chartype_) {\n if (str.match(this.chartype_[i][0])) {\n return this.chartype_[i][1];\n }\n }\n return \"O\";\n }\n\n TinySegmenter.prototype.ts_ = function(v) {\n if (v) { return v; }\n return 0;\n }\n\n TinySegmenter.prototype.segment = function(input) {\n if (input == null || input == undefined || input == \"\") {\n return [];\n }\n var result = [];\n var seg = [\"B3\",\"B2\",\"B1\"];\n var ctype = [\"O\",\"O\",\"O\"];\n var o = input.split(\"\");\n for (i = 0; i < o.length; ++i) {\n seg.push(o[i]);\n ctype.push(this.ctype_(o[i]))\n }\n seg.push(\"E1\");\n seg.push(\"E2\");\n seg.push(\"E3\");\n ctype.push(\"O\");\n ctype.push(\"O\");\n ctype.push(\"O\");\n var word = seg[3];\n var p1 = \"U\";\n var p2 = \"U\";\n var p3 = \"U\";\n for (var i = 4; i < seg.length - 3; ++i) {\n var score = this.BIAS__;\n var w1 = seg[i-3];\n var w2 = seg[i-2];\n var w3 = seg[i-1];\n var w4 = seg[i];\n var w5 = seg[i+1];\n var w6 = seg[i+2];\n var c1 = ctype[i-3];\n var c2 = ctype[i-2];\n var c3 = ctype[i-1];\n var c4 = ctype[i];\n var c5 = ctype[i+1];\n var c6 = ctype[i+2];\n score += this.ts_(this.UP1__[p1]);\n score += this.ts_(this.UP2__[p2]);\n score += this.ts_(this.UP3__[p3]);\n score += this.ts_(this.BP1__[p1 + p2]);\n score += this.ts_(this.BP2__[p2 + p3]);\n score += this.ts_(this.UW1__[w1]);\n score += this.ts_(this.UW2__[w2]);\n score += this.ts_(this.UW3__[w3]);\n score += this.ts_(this.UW4__[w4]);\n score += this.ts_(this.UW5__[w5]);\n score += this.ts_(this.UW6__[w6]);\n score += this.ts_(this.BW1__[w2 + w3]);\n score += this.ts_(this.BW2__[w3 + w4]);\n score += this.ts_(this.BW3__[w4 + w5]);\n score += this.ts_(this.TW1__[w1 + w2 + w3]);\n score += this.ts_(this.TW2__[w2 + w3 + w4]);\n score += this.ts_(this.TW3__[w3 + w4 + w5]);\n score += this.ts_(this.TW4__[w4 + w5 + w6]);\n score += this.ts_(this.UC1__[c1]);\n score += this.ts_(this.UC2__[c2]);\n score += this.ts_(this.UC3__[c3]);\n score += this.ts_(this.UC4__[c4]);\n score += this.ts_(this.UC5__[c5]);\n score += this.ts_(this.UC6__[c6]);\n score += this.ts_(this.BC1__[c2 + c3]);\n score += this.ts_(this.BC2__[c3 + c4]);\n score += this.ts_(this.BC3__[c4 + c5]);\n score += this.ts_(this.TC1__[c1 + c2 + c3]);\n score += this.ts_(this.TC2__[c2 + c3 + c4]);\n score += this.ts_(this.TC3__[c3 + c4 + c5]);\n score += this.ts_(this.TC4__[c4 + c5 + c6]);\n // score += this.ts_(this.TC5__[c4 + c5 + c6]); \n score += this.ts_(this.UQ1__[p1 + c1]);\n score += this.ts_(this.UQ2__[p2 + c2]);\n score += this.ts_(this.UQ3__[p3 + c3]);\n score += this.ts_(this.BQ1__[p2 + c2 + c3]);\n score += this.ts_(this.BQ2__[p2 + c3 + c4]);\n score += this.ts_(this.BQ3__[p3 + c2 + c3]);\n score += this.ts_(this.BQ4__[p3 + c3 + c4]);\n score += this.ts_(this.TQ1__[p2 + c1 + c2 + c3]);\n score += this.ts_(this.TQ2__[p2 + c2 + c3 + c4]);\n score += this.ts_(this.TQ3__[p3 + c1 + c2 + c3]);\n score += this.ts_(this.TQ4__[p3 + c2 + c3 + c4]);\n var p = \"O\";\n if (score > 0) {\n result.push(word);\n word = \"\";\n p = \"B\";\n }\n p1 = p2;\n p2 = p3;\n p3 = p;\n word += seg[i];\n }\n result.push(word);\n\n return result;\n }\n\n lunr.TinySegmenter = TinySegmenter;\n };\n\n}));"
},
{
"path": "site/assets/javascripts/lunr/wordcut.js",
"content": "(function(f){if(typeof exports===\"object\"&&typeof module!==\"undefined\"){module.exports=f()}else if(typeof define===\"function\"&&define.amd){define([],f)}else{var g;if(typeof window!==\"undefined\"){g=window}else if(typeof global!==\"undefined\"){g=global}else if(typeof self!==\"undefined\"){g=self}else{g=this}(g.lunr || (g.lunr = {})).wordcut = f()}})(function(){var define,module,exports;return (function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require==\"function\"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error(\"Cannot find module '\"+o+\"'\");throw f.code=\"MODULE_NOT_FOUND\",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require==\"function\"&&require;for(var o=0;o 1;\n })\n this.addWords(words, false)\n }\n if(finalize){\n this.finalizeDict();\n }\n },\n\n dictSeek: function (l, r, ch, strOffset, pos) {\n var ans = null;\n while (l <= r) {\n var m = Math.floor((l + r) / 2),\n dict_item = this.dict[m],\n len = dict_item.length;\n if (len <= strOffset) {\n l = m + 1;\n } else {\n var ch_ = dict_item[strOffset];\n if (ch_ < ch) {\n l = m + 1;\n } else if (ch_ > ch) {\n r = m - 1;\n } else {\n ans = m;\n if (pos == LEFT) {\n r = m - 1;\n } else {\n l = m + 1;\n }\n }\n }\n }\n return ans;\n },\n\n isFinal: function (acceptor) {\n return this.dict[acceptor.l].length == acceptor.strOffset;\n },\n\n createAcceptor: function () {\n return {\n l: 0,\n r: this.dict.length - 1,\n strOffset: 0,\n isFinal: false,\n dict: this,\n transit: function (ch) {\n return this.dict.transit(this, ch);\n },\n isError: false,\n tag: \"DICT\",\n w: 1,\n type: \"DICT\"\n };\n },\n\n transit: function (acceptor, ch) {\n var l = this.dictSeek(acceptor.l,\n acceptor.r,\n ch,\n acceptor.strOffset,\n LEFT);\n if (l !== null) {\n var r = this.dictSeek(l,\n acceptor.r,\n ch,\n acceptor.strOffset,\n RIGHT);\n acceptor.l = l;\n acceptor.r = r;\n acceptor.strOffset++;\n acceptor.isFinal = this.isFinal(acceptor);\n } else {\n acceptor.isError = true;\n }\n return acceptor;\n },\n\n sortuniq: function(a){\n return a.sort().filter(function(item, pos, arr){\n return !pos || item != arr[pos - 1];\n })\n },\n\n flatten: function(a){\n //[[1,2],[3]] -> [1,2,3]\n return [].concat.apply([], a);\n }\n};\nmodule.exports = WordcutDict;\n\n}).call(this,\"/dist/tmp\")\n},{\"glob\":16,\"path\":22}],3:[function(require,module,exports){\nvar WordRule = {\n createAcceptor: function(tag) {\n if (tag[\"WORD_RULE\"])\n return null;\n\n return {strOffset: 0,\n isFinal: false,\n transit: function(ch) {\n var lch = ch.toLowerCase();\n if (lch >= \"a\" && lch <= \"z\") {\n this.isFinal = true;\n this.strOffset++;\n } else {\n this.isError = true;\n }\n return this;\n },\n isError: false,\n tag: \"WORD_RULE\",\n type: \"WORD_RULE\",\n w: 1};\n }\n};\n\nvar NumberRule = {\n createAcceptor: function(tag) {\n if (tag[\"NUMBER_RULE\"])\n return null;\n\n return {strOffset: 0,\n isFinal: false,\n transit: function(ch) {\n if (ch >= \"0\" && ch <= \"9\") {\n this.isFinal = true;\n this.strOffset++;\n } else {\n this.isError = true;\n }\n return this;\n },\n isError: false,\n tag: \"NUMBER_RULE\",\n type: \"NUMBER_RULE\",\n w: 1};\n }\n};\n\nvar SpaceRule = {\n tag: \"SPACE_RULE\",\n createAcceptor: function(tag) {\n\n if (tag[\"SPACE_RULE\"])\n return null;\n\n return {strOffset: 0,\n isFinal: false,\n transit: function(ch) {\n if (ch == \" \" || ch == \"\\t\" || ch == \"\\r\" || ch == \"\\n\" ||\n ch == \"\\u00A0\" || ch==\"\\u2003\"//nbsp and emsp\n ) {\n this.isFinal = true;\n this.strOffset++;\n } else {\n this.isError = true;\n }\n return this;\n },\n isError: false,\n tag: SpaceRule.tag,\n w: 1,\n type: \"SPACE_RULE\"};\n }\n}\n\nvar SingleSymbolRule = {\n tag: \"SINSYM\",\n createAcceptor: function(tag) {\n return {strOffset: 0,\n isFinal: false,\n transit: function(ch) {\n if (this.strOffset == 0 && ch.match(/^[\\@\\(\\)\\/\\,\\-\\.\"`]$/)) {\n this.isFinal = true;\n this.strOffset++;\n } else {\n this.isError = true;\n }\n return this;\n },\n isError: false,\n tag: \"SINSYM\",\n w: 1,\n type: \"SINSYM\"};\n }\n}\n\n\nvar LatinRules = [WordRule, SpaceRule, SingleSymbolRule, NumberRule];\n\nmodule.exports = LatinRules;\n\n},{}],4:[function(require,module,exports){\nvar _ = require(\"underscore\")\n , WordcutCore = require(\"./wordcut_core\");\nvar PathInfoBuilder = {\n\n /*\n buildByPartAcceptors: function(path, acceptors, i) {\n var \n var genInfos = partAcceptors.reduce(function(genInfos, acceptor) {\n \n }, []);\n \n return genInfos;\n } \n */\n\n buildByAcceptors: function(path, finalAcceptors, i) {\n var self = this;\n var infos = finalAcceptors.map(function(acceptor) {\n var p = i - acceptor.strOffset + 1\n , _info = path[p]; \n \n var info = {p: p, \n mw: _info.mw + (acceptor.mw === undefined ? 0 : acceptor.mw),\n w: acceptor.w + _info.w,\n unk: (acceptor.unk ? acceptor.unk : 0) + _info.unk, \n type: acceptor.type};\n\n if (acceptor.type == \"PART\") {\n for(var j = p + 1; j <= i; j++) {\n path[j].merge = p;\n }\n info.merge = p;\n }\n\n return info;\n });\n return infos.filter(function(info) { return info; });\n },\n \n fallback: function(path, leftBoundary, text, i) {\n var _info = path[leftBoundary];\n if (text[i].match(/[\\u0E48-\\u0E4E]/)) {\n if (leftBoundary != 0) \n leftBoundary = path[leftBoundary].p;\n return {p: leftBoundary,\n mw: 0,\n w: 1 + _info.w,\n unk: 1 + _info.unk,\n type: \"UNK\"}; \n/* } else if(leftBoundary > 0 && path[leftBoundary].type !== \"UNK\") {\n leftBoundary = path[leftBoundary].p;\n return {p: leftBoundary,\n w: 1 + _info.w,\n unk: 1 + _info.unk,\n type: \"UNK\"}; */\n } else { \n return {p: leftBoundary,\n mw: _info.mw,\n w: 1 + _info.w,\n unk: 1 + _info.unk,\n type: \"UNK\"};\n }\n },\n \n build: function(path, finalAcceptors, i, leftBoundary, text) {\n var basicPathInfos = this.buildByAcceptors(path, finalAcceptors, i);\n if (basicPathInfos.length > 0) {\n return basicPathInfos;\n } else {\n return [this.fallback(path, leftBoundary, text, i)];\n }\n }\n};\n\nmodule.exports = function() {\n return _.clone(PathInfoBuilder);\n}\n\n},{\"./wordcut_core\":8,\"underscore\":25}],5:[function(require,module,exports){\nvar _ = require(\"underscore\");\n\n\nvar PathSelector = {\n selectPath: function(paths) {\n var path = paths.reduce(function(selectedPath, path) {\n if (selectedPath == null) { \n return path;\n } else {\n if (path.unk < selectedPath.unk) \n return path; \n if (path.unk == selectedPath.unk) {\n if (path.mw < selectedPath.mw)\n return path\n if (path.mw == selectedPath.mw) {\n if (path.w < selectedPath.w) \n return path;\n }\n }\n return selectedPath;\n }\n }, null);\n return path;\n },\n \n createPath: function() {\n return [{p:null, w:0, unk:0, type: \"INIT\", mw:0}];\n }\n};\n\nmodule.exports = function() {\n return _.clone(PathSelector);\n};\n\n},{\"underscore\":25}],6:[function(require,module,exports){\nfunction isMatch(pat, offset, ch) {\n if (pat.length <= offset)\n return false;\n var _ch = pat[offset];\n return _ch == ch ||\n (_ch.match(/[กข]/) && ch.match(/[ก-ฮ]/)) ||\n (_ch.match(/[มบ]/) && ch.match(/[ก-ฮ]/)) ||\n (_ch.match(/\\u0E49/) && ch.match(/[\\u0E48-\\u0E4B]/));\n}\n\nvar Rule0 = {\n pat: \"เหก็ม\",\n createAcceptor: function(tag) {\n return {strOffset: 0,\n isFinal: false,\n transit: function(ch) {\n if (isMatch(Rule0.pat, this.strOffset,ch)) { \n this.isFinal = (this.strOffset + 1 == Rule0.pat.length); \n this.strOffset++;\n } else { \n this.isError = true; \n }\n return this;\n },\n isError: false,\n tag: \"THAI_RULE\",\n type: \"THAI_RULE\", \n w: 1}; \n }\n};\n\nvar PartRule = {\n createAcceptor: function(tag) {\n return {strOffset: 0,\n patterns: [\n \"แก\", \"เก\", \"ก้\", \"กก์\", \"กา\", \"กี\", \"กิ\", \"กืก\" \n ],\n isFinal: false,\n transit: function(ch) {\n var offset = this.strOffset;\n this.patterns = this.patterns.filter(function(pat) {\n return isMatch(pat, offset, ch);\n });\n \n if (this.patterns.length > 0) {\n var len = 1 + offset;\n this.isFinal = this.patterns.some(function(pat) {\n return pat.length == len; \n });\n this.strOffset++;\n } else { \n this.isError = true; \n }\n return this;\n },\n isError: false,\n tag: \"PART\",\n type: \"PART\", \n unk: 1,\n w: 1}; \n }\n};\n\nvar ThaiRules = [Rule0, PartRule];\n\nmodule.exports = ThaiRules;\n\n},{}],7:[function(require,module,exports){\nvar sys = require(\"sys\")\n , WordcutDict = require(\"./dict\")\n , WordcutCore = require(\"./wordcut_core\")\n , PathInfoBuilder = require(\"./path_info_builder\")\n , PathSelector = require(\"./path_selector\")\n , Acceptors = require(\"./acceptors\")\n , latinRules = require(\"./latin_rules\")\n , thaiRules = require(\"./thai_rules\")\n , _ = require(\"underscore\");\n\n\nvar Wordcut = Object.create(WordcutCore);\nWordcut.defaultPathInfoBuilder = PathInfoBuilder;\nWordcut.defaultPathSelector = PathSelector;\nWordcut.defaultAcceptors = Acceptors;\nWordcut.defaultLatinRules = latinRules;\nWordcut.defaultThaiRules = thaiRules;\nWordcut.defaultDict = WordcutDict;\n\n\nWordcut.initNoDict = function(dict_path) {\n var self = this;\n self.pathInfoBuilder = new self.defaultPathInfoBuilder;\n self.pathSelector = new self.defaultPathSelector;\n self.acceptors = new self.defaultAcceptors;\n self.defaultLatinRules.forEach(function(rule) {\n self.acceptors.creators.push(rule);\n });\n self.defaultThaiRules.forEach(function(rule) {\n self.acceptors.creators.push(rule);\n });\n};\n\nWordcut.init = function(dict_path, withDefault, additionalWords) {\n withDefault = withDefault || false;\n this.initNoDict();\n var dict = _.clone(this.defaultDict);\n dict.init(dict_path, withDefault, additionalWords);\n this.acceptors.creators.push(dict);\n};\n\nmodule.exports = Wordcut;\n\n},{\"./acceptors\":1,\"./dict\":2,\"./latin_rules\":3,\"./path_info_builder\":4,\"./path_selector\":5,\"./thai_rules\":6,\"./wordcut_core\":8,\"sys\":28,\"underscore\":25}],8:[function(require,module,exports){\nvar WordcutCore = {\n\n buildPath: function(text) {\n var self = this\n , path = self.pathSelector.createPath()\n , leftBoundary = 0;\n self.acceptors.reset();\n for (var i = 0; i < text.length; i++) {\n var ch = text[i];\n self.acceptors.transit(ch);\n\n var possiblePathInfos = self\n .pathInfoBuilder\n .build(path,\n self.acceptors.getFinalAcceptors(),\n i,\n leftBoundary,\n text);\n var selectedPath = self.pathSelector.selectPath(possiblePathInfos)\n\n path.push(selectedPath);\n if (selectedPath.type !== \"UNK\") {\n leftBoundary = i;\n }\n }\n return path;\n },\n\n pathToRanges: function(path) {\n var e = path.length - 1\n , ranges = [];\n\n while (e > 0) {\n var info = path[e]\n , s = info.p;\n\n if (info.merge !== undefined && ranges.length > 0) {\n var r = ranges[ranges.length - 1];\n r.s = info.merge;\n s = r.s;\n } else {\n ranges.push({s:s, e:e});\n }\n e = s;\n }\n return ranges.reverse();\n },\n\n rangesToText: function(text, ranges, delimiter) {\n return ranges.map(function(r) {\n return text.substring(r.s, r.e);\n }).join(delimiter);\n },\n\n cut: function(text, delimiter) {\n var path = this.buildPath(text)\n , ranges = this.pathToRanges(path);\n return this\n .rangesToText(text, ranges,\n (delimiter === undefined ? \"|\" : delimiter));\n },\n\n cutIntoRanges: function(text, noText) {\n var path = this.buildPath(text)\n , ranges = this.pathToRanges(path);\n\n if (!noText) {\n ranges.forEach(function(r) {\n r.text = text.substring(r.s, r.e);\n });\n }\n return ranges;\n },\n\n cutIntoArray: function(text) {\n var path = this.buildPath(text)\n , ranges = this.pathToRanges(path);\n \n return ranges.map(function(r) {\n return text.substring(r.s, r.e)\n });\n }\n};\n\nmodule.exports = WordcutCore;\n\n},{}],9:[function(require,module,exports){\n// http://wiki.commonjs.org/wiki/Unit_Testing/1.0\n//\n// THIS IS NOT TESTED NOR LIKELY TO WORK OUTSIDE V8!\n//\n// Originally from narwhal.js (http://narwhaljs.org)\n// Copyright (c) 2009 Thomas Robinson <280north.com>\n//\n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the 'Software'), to\n// deal in the Software without restriction, including without limitation the\n// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n// sell copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n//\n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN\n// ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION\n// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n// when used in node, this will actually load the util module we depend on\n// versus loading the builtin util module as happens otherwise\n// this is a bug in node module loading as far as I am concerned\nvar util = require('util/');\n\nvar pSlice = Array.prototype.slice;\nvar hasOwn = Object.prototype.hasOwnProperty;\n\n// 1. The assert module provides functions that throw\n// AssertionError's when particular conditions are not met. The\n// assert module must conform to the following interface.\n\nvar assert = module.exports = ok;\n\n// 2. The AssertionError is defined in assert.\n// new assert.AssertionError({ message: message,\n// actual: actual,\n// expected: expected })\n\nassert.AssertionError = function AssertionError(options) {\n this.name = 'AssertionError';\n this.actual = options.actual;\n this.expected = options.expected;\n this.operator = options.operator;\n if (options.message) {\n this.message = options.message;\n this.generatedMessage = false;\n } else {\n this.message = getMessage(this);\n this.generatedMessage = true;\n }\n var stackStartFunction = options.stackStartFunction || fail;\n\n if (Error.captureStackTrace) {\n Error.captureStackTrace(this, stackStartFunction);\n }\n else {\n // non v8 browsers so we can have a stacktrace\n var err = new Error();\n if (err.stack) {\n var out = err.stack;\n\n // try to strip useless frames\n var fn_name = stackStartFunction.name;\n var idx = out.indexOf('\\n' + fn_name);\n if (idx >= 0) {\n // once we have located the function frame\n // we need to strip out everything before it (and its line)\n var next_line = out.indexOf('\\n', idx + 1);\n out = out.substring(next_line + 1);\n }\n\n this.stack = out;\n }\n }\n};\n\n// assert.AssertionError instanceof Error\nutil.inherits(assert.AssertionError, Error);\n\nfunction replacer(key, value) {\n if (util.isUndefined(value)) {\n return '' + value;\n }\n if (util.isNumber(value) && !isFinite(value)) {\n return value.toString();\n }\n if (util.isFunction(value) || util.isRegExp(value)) {\n return value.toString();\n }\n return value;\n}\n\nfunction truncate(s, n) {\n if (util.isString(s)) {\n return s.length < n ? s : s.slice(0, n);\n } else {\n return s;\n }\n}\n\nfunction getMessage(self) {\n return truncate(JSON.stringify(self.actual, replacer), 128) + ' ' +\n self.operator + ' ' +\n truncate(JSON.stringify(self.expected, replacer), 128);\n}\n\n// At present only the three keys mentioned above are used and\n// understood by the spec. Implementations or sub modules can pass\n// other keys to the AssertionError's constructor - they will be\n// ignored.\n\n// 3. All of the following functions must throw an AssertionError\n// when a corresponding condition is not met, with a message that\n// may be undefined if not provided. All assertion methods provide\n// both the actual and expected values to the assertion error for\n// display purposes.\n\nfunction fail(actual, expected, message, operator, stackStartFunction) {\n throw new assert.AssertionError({\n message: message,\n actual: actual,\n expected: expected,\n operator: operator,\n stackStartFunction: stackStartFunction\n });\n}\n\n// EXTENSION! allows for well behaved errors defined elsewhere.\nassert.fail = fail;\n\n// 4. Pure assertion tests whether a value is truthy, as determined\n// by !!guard.\n// assert.ok(guard, message_opt);\n// This statement is equivalent to assert.equal(true, !!guard,\n// message_opt);. To test strictly for the value true, use\n// assert.strictEqual(true, guard, message_opt);.\n\nfunction ok(value, message) {\n if (!value) fail(value, true, message, '==', assert.ok);\n}\nassert.ok = ok;\n\n// 5. The equality assertion tests shallow, coercive equality with\n// ==.\n// assert.equal(actual, expected, message_opt);\n\nassert.equal = function equal(actual, expected, message) {\n if (actual != expected) fail(actual, expected, message, '==', assert.equal);\n};\n\n// 6. The non-equality assertion tests for whether two objects are not equal\n// with != assert.notEqual(actual, expected, message_opt);\n\nassert.notEqual = function notEqual(actual, expected, message) {\n if (actual == expected) {\n fail(actual, expected, message, '!=', assert.notEqual);\n }\n};\n\n// 7. The equivalence assertion tests a deep equality relation.\n// assert.deepEqual(actual, expected, message_opt);\n\nassert.deepEqual = function deepEqual(actual, expected, message) {\n if (!_deepEqual(actual, expected)) {\n fail(actual, expected, message, 'deepEqual', assert.deepEqual);\n }\n};\n\nfunction _deepEqual(actual, expected) {\n // 7.1. All identical values are equivalent, as determined by ===.\n if (actual === expected) {\n return true;\n\n } else if (util.isBuffer(actual) && util.isBuffer(expected)) {\n if (actual.length != expected.length) return false;\n\n for (var i = 0; i < actual.length; i++) {\n if (actual[i] !== expected[i]) return false;\n }\n\n return true;\n\n // 7.2. If the expected value is a Date object, the actual value is\n // equivalent if it is also a Date object that refers to the same time.\n } else if (util.isDate(actual) && util.isDate(expected)) {\n return actual.getTime() === expected.getTime();\n\n // 7.3 If the expected value is a RegExp object, the actual value is\n // equivalent if it is also a RegExp object with the same source and\n // properties (`global`, `multiline`, `lastIndex`, `ignoreCase`).\n } else if (util.isRegExp(actual) && util.isRegExp(expected)) {\n return actual.source === expected.source &&\n actual.global === expected.global &&\n actual.multiline === expected.multiline &&\n actual.lastIndex === expected.lastIndex &&\n actual.ignoreCase === expected.ignoreCase;\n\n // 7.4. Other pairs that do not both pass typeof value == 'object',\n // equivalence is determined by ==.\n } else if (!util.isObject(actual) && !util.isObject(expected)) {\n return actual == expected;\n\n // 7.5 For all other Object pairs, including Array objects, equivalence is\n // determined by having the same number of owned properties (as verified\n // with Object.prototype.hasOwnProperty.call), the same set of keys\n // (although not necessarily the same order), equivalent values for every\n // corresponding key, and an identical 'prototype' property. Note: this\n // accounts for both named and indexed properties on Arrays.\n } else {\n return objEquiv(actual, expected);\n }\n}\n\nfunction isArguments(object) {\n return Object.prototype.toString.call(object) == '[object Arguments]';\n}\n\nfunction objEquiv(a, b) {\n if (util.isNullOrUndefined(a) || util.isNullOrUndefined(b))\n return false;\n // an identical 'prototype' property.\n if (a.prototype !== b.prototype) return false;\n // if one is a primitive, the other must be same\n if (util.isPrimitive(a) || util.isPrimitive(b)) {\n return a === b;\n }\n var aIsArgs = isArguments(a),\n bIsArgs = isArguments(b);\n if ((aIsArgs && !bIsArgs) || (!aIsArgs && bIsArgs))\n return false;\n if (aIsArgs) {\n a = pSlice.call(a);\n b = pSlice.call(b);\n return _deepEqual(a, b);\n }\n var ka = objectKeys(a),\n kb = objectKeys(b),\n key, i;\n // having the same number of owned properties (keys incorporates\n // hasOwnProperty)\n if (ka.length != kb.length)\n return false;\n //the same set of keys (although not necessarily the same order),\n ka.sort();\n kb.sort();\n //~~~cheap key test\n for (i = ka.length - 1; i >= 0; i--) {\n if (ka[i] != kb[i])\n return false;\n }\n //equivalent values for every corresponding key, and\n //~~~possibly expensive deep test\n for (i = ka.length - 1; i >= 0; i--) {\n key = ka[i];\n if (!_deepEqual(a[key], b[key])) return false;\n }\n return true;\n}\n\n// 8. The non-equivalence assertion tests for any deep inequality.\n// assert.notDeepEqual(actual, expected, message_opt);\n\nassert.notDeepEqual = function notDeepEqual(actual, expected, message) {\n if (_deepEqual(actual, expected)) {\n fail(actual, expected, message, 'notDeepEqual', assert.notDeepEqual);\n }\n};\n\n// 9. The strict equality assertion tests strict equality, as determined by ===.\n// assert.strictEqual(actual, expected, message_opt);\n\nassert.strictEqual = function strictEqual(actual, expected, message) {\n if (actual !== expected) {\n fail(actual, expected, message, '===', assert.strictEqual);\n }\n};\n\n// 10. The strict non-equality assertion tests for strict inequality, as\n// determined by !==. assert.notStrictEqual(actual, expected, message_opt);\n\nassert.notStrictEqual = function notStrictEqual(actual, expected, message) {\n if (actual === expected) {\n fail(actual, expected, message, '!==', assert.notStrictEqual);\n }\n};\n\nfunction expectedException(actual, expected) {\n if (!actual || !expected) {\n return false;\n }\n\n if (Object.prototype.toString.call(expected) == '[object RegExp]') {\n return expected.test(actual);\n } else if (actual instanceof expected) {\n return true;\n } else if (expected.call({}, actual) === true) {\n return true;\n }\n\n return false;\n}\n\nfunction _throws(shouldThrow, block, expected, message) {\n var actual;\n\n if (util.isString(expected)) {\n message = expected;\n expected = null;\n }\n\n try {\n block();\n } catch (e) {\n actual = e;\n }\n\n message = (expected && expected.name ? ' (' + expected.name + ').' : '.') +\n (message ? ' ' + message : '.');\n\n if (shouldThrow && !actual) {\n fail(actual, expected, 'Missing expected exception' + message);\n }\n\n if (!shouldThrow && expectedException(actual, expected)) {\n fail(actual, expected, 'Got unwanted exception' + message);\n }\n\n if ((shouldThrow && actual && expected &&\n !expectedException(actual, expected)) || (!shouldThrow && actual)) {\n throw actual;\n }\n}\n\n// 11. Expected to throw an error:\n// assert.throws(block, Error_opt, message_opt);\n\nassert.throws = function(block, /*optional*/error, /*optional*/message) {\n _throws.apply(this, [true].concat(pSlice.call(arguments)));\n};\n\n// EXTENSION! This is annoying to write outside this module.\nassert.doesNotThrow = function(block, /*optional*/message) {\n _throws.apply(this, [false].concat(pSlice.call(arguments)));\n};\n\nassert.ifError = function(err) { if (err) {throw err;}};\n\nvar objectKeys = Object.keys || function (obj) {\n var keys = [];\n for (var key in obj) {\n if (hasOwn.call(obj, key)) keys.push(key);\n }\n return keys;\n};\n\n},{\"util/\":28}],10:[function(require,module,exports){\n'use strict';\nmodule.exports = balanced;\nfunction balanced(a, b, str) {\n if (a instanceof RegExp) a = maybeMatch(a, str);\n if (b instanceof RegExp) b = maybeMatch(b, str);\n\n var r = range(a, b, str);\n\n return r && {\n start: r[0],\n end: r[1],\n pre: str.slice(0, r[0]),\n body: str.slice(r[0] + a.length, r[1]),\n post: str.slice(r[1] + b.length)\n };\n}\n\nfunction maybeMatch(reg, str) {\n var m = str.match(reg);\n return m ? m[0] : null;\n}\n\nbalanced.range = range;\nfunction range(a, b, str) {\n var begs, beg, left, right, result;\n var ai = str.indexOf(a);\n var bi = str.indexOf(b, ai + 1);\n var i = ai;\n\n if (ai >= 0 && bi > 0) {\n begs = [];\n left = str.length;\n\n while (i >= 0 && !result) {\n if (i == ai) {\n begs.push(i);\n ai = str.indexOf(a, i + 1);\n } else if (begs.length == 1) {\n result = [ begs.pop(), bi ];\n } else {\n beg = begs.pop();\n if (beg < left) {\n left = beg;\n right = bi;\n }\n\n bi = str.indexOf(b, i + 1);\n }\n\n i = ai < bi && ai >= 0 ? ai : bi;\n }\n\n if (begs.length) {\n result = [ left, right ];\n }\n }\n\n return result;\n}\n\n},{}],11:[function(require,module,exports){\nvar concatMap = require('concat-map');\nvar balanced = require('balanced-match');\n\nmodule.exports = expandTop;\n\nvar escSlash = '\\0SLASH'+Math.random()+'\\0';\nvar escOpen = '\\0OPEN'+Math.random()+'\\0';\nvar escClose = '\\0CLOSE'+Math.random()+'\\0';\nvar escComma = '\\0COMMA'+Math.random()+'\\0';\nvar escPeriod = '\\0PERIOD'+Math.random()+'\\0';\n\nfunction numeric(str) {\n return parseInt(str, 10) == str\n ? parseInt(str, 10)\n : str.charCodeAt(0);\n}\n\nfunction escapeBraces(str) {\n return str.split('\\\\\\\\').join(escSlash)\n .split('\\\\{').join(escOpen)\n .split('\\\\}').join(escClose)\n .split('\\\\,').join(escComma)\n .split('\\\\.').join(escPeriod);\n}\n\nfunction unescapeBraces(str) {\n return str.split(escSlash).join('\\\\')\n .split(escOpen).join('{')\n .split(escClose).join('}')\n .split(escComma).join(',')\n .split(escPeriod).join('.');\n}\n\n\n// Basically just str.split(\",\"), but handling cases\n// where we have nested braced sections, which should be\n// treated as individual members, like {a,{b,c},d}\nfunction parseCommaParts(str) {\n if (!str)\n return [''];\n\n var parts = [];\n var m = balanced('{', '}', str);\n\n if (!m)\n return str.split(',');\n\n var pre = m.pre;\n var body = m.body;\n var post = m.post;\n var p = pre.split(',');\n\n p[p.length-1] += '{' + body + '}';\n var postParts = parseCommaParts(post);\n if (post.length) {\n p[p.length-1] += postParts.shift();\n p.push.apply(p, postParts);\n }\n\n parts.push.apply(parts, p);\n\n return parts;\n}\n\nfunction expandTop(str) {\n if (!str)\n return [];\n\n // I don't know why Bash 4.3 does this, but it does.\n // Anything starting with {} will have the first two bytes preserved\n // but *only* at the top level, so {},a}b will not expand to anything,\n // but a{},b}c will be expanded to [a}c,abc].\n // One could argue that this is a bug in Bash, but since the goal of\n // this module is to match Bash's rules, we escape a leading {}\n if (str.substr(0, 2) === '{}') {\n str = '\\\\{\\\\}' + str.substr(2);\n }\n\n return expand(escapeBraces(str), true).map(unescapeBraces);\n}\n\nfunction identity(e) {\n return e;\n}\n\nfunction embrace(str) {\n return '{' + str + '}';\n}\nfunction isPadded(el) {\n return /^-?0\\d/.test(el);\n}\n\nfunction lte(i, y) {\n return i <= y;\n}\nfunction gte(i, y) {\n return i >= y;\n}\n\nfunction expand(str, isTop) {\n var expansions = [];\n\n var m = balanced('{', '}', str);\n if (!m || /\\$$/.test(m.pre)) return [str];\n\n var isNumericSequence = /^-?\\d+\\.\\.-?\\d+(?:\\.\\.-?\\d+)?$/.test(m.body);\n var isAlphaSequence = /^[a-zA-Z]\\.\\.[a-zA-Z](?:\\.\\.-?\\d+)?$/.test(m.body);\n var isSequence = isNumericSequence || isAlphaSequence;\n var isOptions = m.body.indexOf(',') >= 0;\n if (!isSequence && !isOptions) {\n // {a},b}\n if (m.post.match(/,.*\\}/)) {\n str = m.pre + '{' + m.body + escClose + m.post;\n return expand(str);\n }\n return [str];\n }\n\n var n;\n if (isSequence) {\n n = m.body.split(/\\.\\./);\n } else {\n n = parseCommaParts(m.body);\n if (n.length === 1) {\n // x{{a,b}}y ==> x{a}y x{b}y\n n = expand(n[0], false).map(embrace);\n if (n.length === 1) {\n var post = m.post.length\n ? expand(m.post, false)\n : [''];\n return post.map(function(p) {\n return m.pre + n[0] + p;\n });\n }\n }\n }\n\n // at this point, n is the parts, and we know it's not a comma set\n // with a single entry.\n\n // no need to expand pre, since it is guaranteed to be free of brace-sets\n var pre = m.pre;\n var post = m.post.length\n ? expand(m.post, false)\n : [''];\n\n var N;\n\n if (isSequence) {\n var x = numeric(n[0]);\n var y = numeric(n[1]);\n var width = Math.max(n[0].length, n[1].length)\n var incr = n.length == 3\n ? Math.abs(numeric(n[2]))\n : 1;\n var test = lte;\n var reverse = y < x;\n if (reverse) {\n incr *= -1;\n test = gte;\n }\n var pad = n.some(isPadded);\n\n N = [];\n\n for (var i = x; test(i, y); i += incr) {\n var c;\n if (isAlphaSequence) {\n c = String.fromCharCode(i);\n if (c === '\\\\')\n c = '';\n } else {\n c = String(i);\n if (pad) {\n var need = width - c.length;\n if (need > 0) {\n var z = new Array(need + 1).join('0');\n if (i < 0)\n c = '-' + z + c.slice(1);\n else\n c = z + c;\n }\n }\n }\n N.push(c);\n }\n } else {\n N = concatMap(n, function(el) { return expand(el, false) });\n }\n\n for (var j = 0; j < N.length; j++) {\n for (var k = 0; k < post.length; k++) {\n var expansion = pre + N[j] + post[k];\n if (!isTop || isSequence || expansion)\n expansions.push(expansion);\n }\n }\n\n return expansions;\n}\n\n\n},{\"balanced-match\":10,\"concat-map\":13}],12:[function(require,module,exports){\n\n},{}],13:[function(require,module,exports){\nmodule.exports = function (xs, fn) {\n var res = [];\n for (var i = 0; i < xs.length; i++) {\n var x = fn(xs[i], i);\n if (isArray(x)) res.push.apply(res, x);\n else res.push(x);\n }\n return res;\n};\n\nvar isArray = Array.isArray || function (xs) {\n return Object.prototype.toString.call(xs) === '[object Array]';\n};\n\n},{}],14:[function(require,module,exports){\n// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\nfunction EventEmitter() {\n this._events = this._events || {};\n this._maxListeners = this._maxListeners || undefined;\n}\nmodule.exports = EventEmitter;\n\n// Backwards-compat with node 0.10.x\nEventEmitter.EventEmitter = EventEmitter;\n\nEventEmitter.prototype._events = undefined;\nEventEmitter.prototype._maxListeners = undefined;\n\n// By default EventEmitters will print a warning if more than 10 listeners are\n// added to it. This is a useful default which helps finding memory leaks.\nEventEmitter.defaultMaxListeners = 10;\n\n// Obviously not all Emitters should be limited to 10. This function allows\n// that to be increased. Set to zero for unlimited.\nEventEmitter.prototype.setMaxListeners = function(n) {\n if (!isNumber(n) || n < 0 || isNaN(n))\n throw TypeError('n must be a positive number');\n this._maxListeners = n;\n return this;\n};\n\nEventEmitter.prototype.emit = function(type) {\n var er, handler, len, args, i, listeners;\n\n if (!this._events)\n this._events = {};\n\n // If there is no 'error' event listener then throw.\n if (type === 'error') {\n if (!this._events.error ||\n (isObject(this._events.error) && !this._events.error.length)) {\n er = arguments[1];\n if (er instanceof Error) {\n throw er; // Unhandled 'error' event\n }\n throw TypeError('Uncaught, unspecified \"error\" event.');\n }\n }\n\n handler = this._events[type];\n\n if (isUndefined(handler))\n return false;\n\n if (isFunction(handler)) {\n switch (arguments.length) {\n // fast cases\n case 1:\n handler.call(this);\n break;\n case 2:\n handler.call(this, arguments[1]);\n break;\n case 3:\n handler.call(this, arguments[1], arguments[2]);\n break;\n // slower\n default:\n len = arguments.length;\n args = new Array(len - 1);\n for (i = 1; i < len; i++)\n args[i - 1] = arguments[i];\n handler.apply(this, args);\n }\n } else if (isObject(handler)) {\n len = arguments.length;\n args = new Array(len - 1);\n for (i = 1; i < len; i++)\n args[i - 1] = arguments[i];\n\n listeners = handler.slice();\n len = listeners.length;\n for (i = 0; i < len; i++)\n listeners[i].apply(this, args);\n }\n\n return true;\n};\n\nEventEmitter.prototype.addListener = function(type, listener) {\n var m;\n\n if (!isFunction(listener))\n throw TypeError('listener must be a function');\n\n if (!this._events)\n this._events = {};\n\n // To avoid recursion in the case that type === \"newListener\"! Before\n // adding it to the listeners, first emit \"newListener\".\n if (this._events.newListener)\n this.emit('newListener', type,\n isFunction(listener.listener) ?\n listener.listener : listener);\n\n if (!this._events[type])\n // Optimize the case of one listener. Don't need the extra array object.\n this._events[type] = listener;\n else if (isObject(this._events[type]))\n // If we've already got an array, just append.\n this._events[type].push(listener);\n else\n // Adding the second element, need to change to array.\n this._events[type] = [this._events[type], listener];\n\n // Check for listener leak\n if (isObject(this._events[type]) && !this._events[type].warned) {\n var m;\n if (!isUndefined(this._maxListeners)) {\n m = this._maxListeners;\n } else {\n m = EventEmitter.defaultMaxListeners;\n }\n\n if (m && m > 0 && this._events[type].length > m) {\n this._events[type].warned = true;\n console.error('(node) warning: possible EventEmitter memory ' +\n 'leak detected. %d listeners added. ' +\n 'Use emitter.setMaxListeners() to increase limit.',\n this._events[type].length);\n if (typeof console.trace === 'function') {\n // not supported in IE 10\n console.trace();\n }\n }\n }\n\n return this;\n};\n\nEventEmitter.prototype.on = EventEmitter.prototype.addListener;\n\nEventEmitter.prototype.once = function(type, listener) {\n if (!isFunction(listener))\n throw TypeError('listener must be a function');\n\n var fired = false;\n\n function g() {\n this.removeListener(type, g);\n\n if (!fired) {\n fired = true;\n listener.apply(this, arguments);\n }\n }\n\n g.listener = listener;\n this.on(type, g);\n\n return this;\n};\n\n// emits a 'removeListener' event iff the listener was removed\nEventEmitter.prototype.removeListener = function(type, listener) {\n var list, position, length, i;\n\n if (!isFunction(listener))\n throw TypeError('listener must be a function');\n\n if (!this._events || !this._events[type])\n return this;\n\n list = this._events[type];\n length = list.length;\n position = -1;\n\n if (list === listener ||\n (isFunction(list.listener) && list.listener === listener)) {\n delete this._events[type];\n if (this._events.removeListener)\n this.emit('removeListener', type, listener);\n\n } else if (isObject(list)) {\n for (i = length; i-- > 0;) {\n if (list[i] === listener ||\n (list[i].listener && list[i].listener === listener)) {\n position = i;\n break;\n }\n }\n\n if (position < 0)\n return this;\n\n if (list.length === 1) {\n list.length = 0;\n delete this._events[type];\n } else {\n list.splice(position, 1);\n }\n\n if (this._events.removeListener)\n this.emit('removeListener', type, listener);\n }\n\n return this;\n};\n\nEventEmitter.prototype.removeAllListeners = function(type) {\n var key, listeners;\n\n if (!this._events)\n return this;\n\n // not listening for removeListener, no need to emit\n if (!this._events.removeListener) {\n if (arguments.length === 0)\n this._events = {};\n else if (this._events[type])\n delete this._events[type];\n return this;\n }\n\n // emit removeListener for all listeners on all events\n if (arguments.length === 0) {\n for (key in this._events) {\n if (key === 'removeListener') continue;\n this.removeAllListeners(key);\n }\n this.removeAllListeners('removeListener');\n this._events = {};\n return this;\n }\n\n listeners = this._events[type];\n\n if (isFunction(listeners)) {\n this.removeListener(type, listeners);\n } else {\n // LIFO order\n while (listeners.length)\n this.removeListener(type, listeners[listeners.length - 1]);\n }\n delete this._events[type];\n\n return this;\n};\n\nEventEmitter.prototype.listeners = function(type) {\n var ret;\n if (!this._events || !this._events[type])\n ret = [];\n else if (isFunction(this._events[type]))\n ret = [this._events[type]];\n else\n ret = this._events[type].slice();\n return ret;\n};\n\nEventEmitter.listenerCount = function(emitter, type) {\n var ret;\n if (!emitter._events || !emitter._events[type])\n ret = 0;\n else if (isFunction(emitter._events[type]))\n ret = 1;\n else\n ret = emitter._events[type].length;\n return ret;\n};\n\nfunction isFunction(arg) {\n return typeof arg === 'function';\n}\n\nfunction isNumber(arg) {\n return typeof arg === 'number';\n}\n\nfunction isObject(arg) {\n return typeof arg === 'object' && arg !== null;\n}\n\nfunction isUndefined(arg) {\n return arg === void 0;\n}\n\n},{}],15:[function(require,module,exports){\n(function (process){\nexports.alphasort = alphasort\nexports.alphasorti = alphasorti\nexports.setopts = setopts\nexports.ownProp = ownProp\nexports.makeAbs = makeAbs\nexports.finish = finish\nexports.mark = mark\nexports.isIgnored = isIgnored\nexports.childrenIgnored = childrenIgnored\n\nfunction ownProp (obj, field) {\n return Object.prototype.hasOwnProperty.call(obj, field)\n}\n\nvar path = require(\"path\")\nvar minimatch = require(\"minimatch\")\nvar isAbsolute = require(\"path-is-absolute\")\nvar Minimatch = minimatch.Minimatch\n\nfunction alphasorti (a, b) {\n return a.toLowerCase().localeCompare(b.toLowerCase())\n}\n\nfunction alphasort (a, b) {\n return a.localeCompare(b)\n}\n\nfunction setupIgnores (self, options) {\n self.ignore = options.ignore || []\n\n if (!Array.isArray(self.ignore))\n self.ignore = [self.ignore]\n\n if (self.ignore.length) {\n self.ignore = self.ignore.map(ignoreMap)\n }\n}\n\nfunction ignoreMap (pattern) {\n var gmatcher = null\n if (pattern.slice(-3) === '/**') {\n var gpattern = pattern.replace(/(\\/\\*\\*)+$/, '')\n gmatcher = new Minimatch(gpattern)\n }\n\n return {\n matcher: new Minimatch(pattern),\n gmatcher: gmatcher\n }\n}\n\nfunction setopts (self, pattern, options) {\n if (!options)\n options = {}\n\n // base-matching: just use globstar for that.\n if (options.matchBase && -1 === pattern.indexOf(\"/\")) {\n if (options.noglobstar) {\n throw new Error(\"base matching requires globstar\")\n }\n pattern = \"**/\" + pattern\n }\n\n self.silent = !!options.silent\n self.pattern = pattern\n self.strict = options.strict !== false\n self.realpath = !!options.realpath\n self.realpathCache = options.realpathCache || Object.create(null)\n self.follow = !!options.follow\n self.dot = !!options.dot\n self.mark = !!options.mark\n self.nodir = !!options.nodir\n if (self.nodir)\n self.mark = true\n self.sync = !!options.sync\n self.nounique = !!options.nounique\n self.nonull = !!options.nonull\n self.nosort = !!options.nosort\n self.nocase = !!options.nocase\n self.stat = !!options.stat\n self.noprocess = !!options.noprocess\n\n self.maxLength = options.maxLength || Infinity\n self.cache = options.cache || Object.create(null)\n self.statCache = options.statCache || Object.create(null)\n self.symlinks = options.symlinks || Object.create(null)\n\n setupIgnores(self, options)\n\n self.changedCwd = false\n var cwd = process.cwd()\n if (!ownProp(options, \"cwd\"))\n self.cwd = cwd\n else {\n self.cwd = options.cwd\n self.changedCwd = path.resolve(options.cwd) !== cwd\n }\n\n self.root = options.root || path.resolve(self.cwd, \"/\")\n self.root = path.resolve(self.root)\n if (process.platform === \"win32\")\n self.root = self.root.replace(/\\\\/g, \"/\")\n\n self.nomount = !!options.nomount\n\n // disable comments and negation unless the user explicitly\n // passes in false as the option.\n options.nonegate = options.nonegate === false ? false : true\n options.nocomment = options.nocomment === false ? false : true\n deprecationWarning(options)\n\n self.minimatch = new Minimatch(pattern, options)\n self.options = self.minimatch.options\n}\n\n// TODO(isaacs): remove entirely in v6\n// exported to reset in tests\nexports.deprecationWarned\nfunction deprecationWarning(options) {\n if (!options.nonegate || !options.nocomment) {\n if (process.noDeprecation !== true && !exports.deprecationWarned) {\n var msg = 'glob WARNING: comments and negation will be disabled in v6'\n if (process.throwDeprecation)\n throw new Error(msg)\n else if (process.traceDeprecation)\n console.trace(msg)\n else\n console.error(msg)\n\n exports.deprecationWarned = true\n }\n }\n}\n\nfunction finish (self) {\n var nou = self.nounique\n var all = nou ? [] : Object.create(null)\n\n for (var i = 0, l = self.matches.length; i < l; i ++) {\n var matches = self.matches[i]\n if (!matches || Object.keys(matches).length === 0) {\n if (self.nonull) {\n // do like the shell, and spit out the literal glob\n var literal = self.minimatch.globSet[i]\n if (nou)\n all.push(literal)\n else\n all[literal] = true\n }\n } else {\n // had matches\n var m = Object.keys(matches)\n if (nou)\n all.push.apply(all, m)\n else\n m.forEach(function (m) {\n all[m] = true\n })\n }\n }\n\n if (!nou)\n all = Object.keys(all)\n\n if (!self.nosort)\n all = all.sort(self.nocase ? alphasorti : alphasort)\n\n // at *some* point we statted all of these\n if (self.mark) {\n for (var i = 0; i < all.length; i++) {\n all[i] = self._mark(all[i])\n }\n if (self.nodir) {\n all = all.filter(function (e) {\n return !(/\\/$/.test(e))\n })\n }\n }\n\n if (self.ignore.length)\n all = all.filter(function(m) {\n return !isIgnored(self, m)\n })\n\n self.found = all\n}\n\nfunction mark (self, p) {\n var abs = makeAbs(self, p)\n var c = self.cache[abs]\n var m = p\n if (c) {\n var isDir = c === 'DIR' || Array.isArray(c)\n var slash = p.slice(-1) === '/'\n\n if (isDir && !slash)\n m += '/'\n else if (!isDir && slash)\n m = m.slice(0, -1)\n\n if (m !== p) {\n var mabs = makeAbs(self, m)\n self.statCache[mabs] = self.statCache[abs]\n self.cache[mabs] = self.cache[abs]\n }\n }\n\n return m\n}\n\n// lotta situps...\nfunction makeAbs (self, f) {\n var abs = f\n if (f.charAt(0) === '/') {\n abs = path.join(self.root, f)\n } else if (isAbsolute(f) || f === '') {\n abs = f\n } else if (self.changedCwd) {\n abs = path.resolve(self.cwd, f)\n } else {\n abs = path.resolve(f)\n }\n return abs\n}\n\n\n// Return true, if pattern ends with globstar '**', for the accompanying parent directory.\n// Ex:- If node_modules/** is the pattern, add 'node_modules' to ignore list along with it's contents\nfunction isIgnored (self, path) {\n if (!self.ignore.length)\n return false\n\n return self.ignore.some(function(item) {\n return item.matcher.match(path) || !!(item.gmatcher && item.gmatcher.match(path))\n })\n}\n\nfunction childrenIgnored (self, path) {\n if (!self.ignore.length)\n return false\n\n return self.ignore.some(function(item) {\n return !!(item.gmatcher && item.gmatcher.match(path))\n })\n}\n\n}).call(this,require('_process'))\n},{\"_process\":24,\"minimatch\":20,\"path\":22,\"path-is-absolute\":23}],16:[function(require,module,exports){\n(function (process){\n// Approach:\n//\n// 1. Get the minimatch set\n// 2. For each pattern in the set, PROCESS(pattern, false)\n// 3. Store matches per-set, then uniq them\n//\n// PROCESS(pattern, inGlobStar)\n// Get the first [n] items from pattern that are all strings\n// Join these together. This is PREFIX.\n// If there is no more remaining, then stat(PREFIX) and\n// add to matches if it succeeds. END.\n//\n// If inGlobStar and PREFIX is symlink and points to dir\n// set ENTRIES = []\n// else readdir(PREFIX) as ENTRIES\n// If fail, END\n//\n// with ENTRIES\n// If pattern[n] is GLOBSTAR\n// // handle the case where the globstar match is empty\n// // by pruning it out, and testing the resulting pattern\n// PROCESS(pattern[0..n] + pattern[n+1 .. $], false)\n// // handle other cases.\n// for ENTRY in ENTRIES (not dotfiles)\n// // attach globstar + tail onto the entry\n// // Mark that this entry is a globstar match\n// PROCESS(pattern[0..n] + ENTRY + pattern[n .. $], true)\n//\n// else // not globstar\n// for ENTRY in ENTRIES (not dotfiles, unless pattern[n] is dot)\n// Test ENTRY against pattern[n]\n// If fails, continue\n// If passes, PROCESS(pattern[0..n] + item + pattern[n+1 .. $])\n//\n// Caveat:\n// Cache all stats and readdirs results to minimize syscall. Since all\n// we ever care about is existence and directory-ness, we can just keep\n// `true` for files, and [children,...] for directories, or `false` for\n// things that don't exist.\n\nmodule.exports = glob\n\nvar fs = require('fs')\nvar minimatch = require('minimatch')\nvar Minimatch = minimatch.Minimatch\nvar inherits = require('inherits')\nvar EE = require('events').EventEmitter\nvar path = require('path')\nvar assert = require('assert')\nvar isAbsolute = require('path-is-absolute')\nvar globSync = require('./sync.js')\nvar common = require('./common.js')\nvar alphasort = common.alphasort\nvar alphasorti = common.alphasorti\nvar setopts = common.setopts\nvar ownProp = common.ownProp\nvar inflight = require('inflight')\nvar util = require('util')\nvar childrenIgnored = common.childrenIgnored\nvar isIgnored = common.isIgnored\n\nvar once = require('once')\n\nfunction glob (pattern, options, cb) {\n if (typeof options === 'function') cb = options, options = {}\n if (!options) options = {}\n\n if (options.sync) {\n if (cb)\n throw new TypeError('callback provided to sync glob')\n return globSync(pattern, options)\n }\n\n return new Glob(pattern, options, cb)\n}\n\nglob.sync = globSync\nvar GlobSync = glob.GlobSync = globSync.GlobSync\n\n// old api surface\nglob.glob = glob\n\nglob.hasMagic = function (pattern, options_) {\n var options = util._extend({}, options_)\n options.noprocess = true\n\n var g = new Glob(pattern, options)\n var set = g.minimatch.set\n if (set.length > 1)\n return true\n\n for (var j = 0; j < set[0].length; j++) {\n if (typeof set[0][j] !== 'string')\n return true\n }\n\n return false\n}\n\nglob.Glob = Glob\ninherits(Glob, EE)\nfunction Glob (pattern, options, cb) {\n if (typeof options === 'function') {\n cb = options\n options = null\n }\n\n if (options && options.sync) {\n if (cb)\n throw new TypeError('callback provided to sync glob')\n return new GlobSync(pattern, options)\n }\n\n if (!(this instanceof Glob))\n return new Glob(pattern, options, cb)\n\n setopts(this, pattern, options)\n this._didRealPath = false\n\n // process each pattern in the minimatch set\n var n = this.minimatch.set.length\n\n // The matches are stored as {: true,...} so that\n // duplicates are automagically pruned.\n // Later, we do an Object.keys() on these.\n // Keep them as a list so we can fill in when nonull is set.\n this.matches = new Array(n)\n\n if (typeof cb === 'function') {\n cb = once(cb)\n this.on('error', cb)\n this.on('end', function (matches) {\n cb(null, matches)\n })\n }\n\n var self = this\n var n = this.minimatch.set.length\n this._processing = 0\n this.matches = new Array(n)\n\n this._emitQueue = []\n this._processQueue = []\n this.paused = false\n\n if (this.noprocess)\n return this\n\n if (n === 0)\n return done()\n\n for (var i = 0; i < n; i ++) {\n this._process(this.minimatch.set[i], i, false, done)\n }\n\n function done () {\n --self._processing\n if (self._processing <= 0)\n self._finish()\n }\n}\n\nGlob.prototype._finish = function () {\n assert(this instanceof Glob)\n if (this.aborted)\n return\n\n if (this.realpath && !this._didRealpath)\n return this._realpath()\n\n common.finish(this)\n this.emit('end', this.found)\n}\n\nGlob.prototype._realpath = function () {\n if (this._didRealpath)\n return\n\n this._didRealpath = true\n\n var n = this.matches.length\n if (n === 0)\n return this._finish()\n\n var self = this\n for (var i = 0; i < this.matches.length; i++)\n this._realpathSet(i, next)\n\n function next () {\n if (--n === 0)\n self._finish()\n }\n}\n\nGlob.prototype._realpathSet = function (index, cb) {\n var matchset = this.matches[index]\n if (!matchset)\n return cb()\n\n var found = Object.keys(matchset)\n var self = this\n var n = found.length\n\n if (n === 0)\n return cb()\n\n var set = this.matches[index] = Object.create(null)\n found.forEach(function (p, i) {\n // If there's a problem with the stat, then it means that\n // one or more of the links in the realpath couldn't be\n // resolved. just return the abs value in that case.\n p = self._makeAbs(p)\n fs.realpath(p, self.realpathCache, function (er, real) {\n if (!er)\n set[real] = true\n else if (er.syscall === 'stat')\n set[p] = true\n else\n self.emit('error', er) // srsly wtf right here\n\n if (--n === 0) {\n self.matches[index] = set\n cb()\n }\n })\n })\n}\n\nGlob.prototype._mark = function (p) {\n return common.mark(this, p)\n}\n\nGlob.prototype._makeAbs = function (f) {\n return common.makeAbs(this, f)\n}\n\nGlob.prototype.abort = function () {\n this.aborted = true\n this.emit('abort')\n}\n\nGlob.prototype.pause = function () {\n if (!this.paused) {\n this.paused = true\n this.emit('pause')\n }\n}\n\nGlob.prototype.resume = function () {\n if (this.paused) {\n this.emit('resume')\n this.paused = false\n if (this._emitQueue.length) {\n var eq = this._emitQueue.slice(0)\n this._emitQueue.length = 0\n for (var i = 0; i < eq.length; i ++) {\n var e = eq[i]\n this._emitMatch(e[0], e[1])\n }\n }\n if (this._processQueue.length) {\n var pq = this._processQueue.slice(0)\n this._processQueue.length = 0\n for (var i = 0; i < pq.length; i ++) {\n var p = pq[i]\n this._processing--\n this._process(p[0], p[1], p[2], p[3])\n }\n }\n }\n}\n\nGlob.prototype._process = function (pattern, index, inGlobStar, cb) {\n assert(this instanceof Glob)\n assert(typeof cb === 'function')\n\n if (this.aborted)\n return\n\n this._processing++\n if (this.paused) {\n this._processQueue.push([pattern, index, inGlobStar, cb])\n return\n }\n\n //console.error('PROCESS %d', this._processing, pattern)\n\n // Get the first [n] parts of pattern that are all strings.\n var n = 0\n while (typeof pattern[n] === 'string') {\n n ++\n }\n // now n is the index of the first one that is *not* a string.\n\n // see if there's anything else\n var prefix\n switch (n) {\n // if not, then this is rather simple\n case pattern.length:\n this._processSimple(pattern.join('/'), index, cb)\n return\n\n case 0:\n // pattern *starts* with some non-trivial item.\n // going to readdir(cwd), but not include the prefix in matches.\n prefix = null\n break\n\n default:\n // pattern has some string bits in the front.\n // whatever it starts with, whether that's 'absolute' like /foo/bar,\n // or 'relative' like '../baz'\n prefix = pattern.slice(0, n).join('/')\n break\n }\n\n var remain = pattern.slice(n)\n\n // get the list of entries.\n var read\n if (prefix === null)\n read = '.'\n else if (isAbsolute(prefix) || isAbsolute(pattern.join('/'))) {\n if (!prefix || !isAbsolute(prefix))\n prefix = '/' + prefix\n read = prefix\n } else\n read = prefix\n\n var abs = this._makeAbs(read)\n\n //if ignored, skip _processing\n if (childrenIgnored(this, read))\n return cb()\n\n var isGlobStar = remain[0] === minimatch.GLOBSTAR\n if (isGlobStar)\n this._processGlobStar(prefix, read, abs, remain, index, inGlobStar, cb)\n else\n this._processReaddir(prefix, read, abs, remain, index, inGlobStar, cb)\n}\n\nGlob.prototype._processReaddir = function (prefix, read, abs, remain, index, inGlobStar, cb) {\n var self = this\n this._readdir(abs, inGlobStar, function (er, entries) {\n return self._processReaddir2(prefix, read, abs, remain, index, inGlobStar, entries, cb)\n })\n}\n\nGlob.prototype._processReaddir2 = function (prefix, read, abs, remain, index, inGlobStar, entries, cb) {\n\n // if the abs isn't a dir, then nothing can match!\n if (!entries)\n return cb()\n\n // It will only match dot entries if it starts with a dot, or if\n // dot is set. Stuff like @(.foo|.bar) isn't allowed.\n var pn = remain[0]\n var negate = !!this.minimatch.negate\n var rawGlob = pn._glob\n var dotOk = this.dot || rawGlob.charAt(0) === '.'\n\n var matchedEntries = []\n for (var i = 0; i < entries.length; i++) {\n var e = entries[i]\n if (e.charAt(0) !== '.' || dotOk) {\n var m\n if (negate && !prefix) {\n m = !e.match(pn)\n } else {\n m = e.match(pn)\n }\n if (m)\n matchedEntries.push(e)\n }\n }\n\n //console.error('prd2', prefix, entries, remain[0]._glob, matchedEntries)\n\n var len = matchedEntries.length\n // If there are no matched entries, then nothing matches.\n if (len === 0)\n return cb()\n\n // if this is the last remaining pattern bit, then no need for\n // an additional stat *unless* the user has specified mark or\n // stat explicitly. We know they exist, since readdir returned\n // them.\n\n if (remain.length === 1 && !this.mark && !this.stat) {\n if (!this.matches[index])\n this.matches[index] = Object.create(null)\n\n for (var i = 0; i < len; i ++) {\n var e = matchedEntries[i]\n if (prefix) {\n if (prefix !== '/')\n e = prefix + '/' + e\n else\n e = prefix + e\n }\n\n if (e.charAt(0) === '/' && !this.nomount) {\n e = path.join(this.root, e)\n }\n this._emitMatch(index, e)\n }\n // This was the last one, and no stats were needed\n return cb()\n }\n\n // now test all matched entries as stand-ins for that part\n // of the pattern.\n remain.shift()\n for (var i = 0; i < len; i ++) {\n var e = matchedEntries[i]\n var newPattern\n if (prefix) {\n if (prefix !== '/')\n e = prefix + '/' + e\n else\n e = prefix + e\n }\n this._process([e].concat(remain), index, inGlobStar, cb)\n }\n cb()\n}\n\nGlob.prototype._emitMatch = function (index, e) {\n if (this.aborted)\n return\n\n if (this.matches[index][e])\n return\n\n if (isIgnored(this, e))\n return\n\n if (this.paused) {\n this._emitQueue.push([index, e])\n return\n }\n\n var abs = this._makeAbs(e)\n\n if (this.nodir) {\n var c = this.cache[abs]\n if (c === 'DIR' || Array.isArray(c))\n return\n }\n\n if (this.mark)\n e = this._mark(e)\n\n this.matches[index][e] = true\n\n var st = this.statCache[abs]\n if (st)\n this.emit('stat', e, st)\n\n this.emit('match', e)\n}\n\nGlob.prototype._readdirInGlobStar = function (abs, cb) {\n if (this.aborted)\n return\n\n // follow all symlinked directories forever\n // just proceed as if this is a non-globstar situation\n if (this.follow)\n return this._readdir(abs, false, cb)\n\n var lstatkey = 'lstat\\0' + abs\n var self = this\n var lstatcb = inflight(lstatkey, lstatcb_)\n\n if (lstatcb)\n fs.lstat(abs, lstatcb)\n\n function lstatcb_ (er, lstat) {\n if (er)\n return cb()\n\n var isSym = lstat.isSymbolicLink()\n self.symlinks[abs] = isSym\n\n // If it's not a symlink or a dir, then it's definitely a regular file.\n // don't bother doing a readdir in that case.\n if (!isSym && !lstat.isDirectory()) {\n self.cache[abs] = 'FILE'\n cb()\n } else\n self._readdir(abs, false, cb)\n }\n}\n\nGlob.prototype._readdir = function (abs, inGlobStar, cb) {\n if (this.aborted)\n return\n\n cb = inflight('readdir\\0'+abs+'\\0'+inGlobStar, cb)\n if (!cb)\n return\n\n //console.error('RD %j %j', +inGlobStar, abs)\n if (inGlobStar && !ownProp(this.symlinks, abs))\n return this._readdirInGlobStar(abs, cb)\n\n if (ownProp(this.cache, abs)) {\n var c = this.cache[abs]\n if (!c || c === 'FILE')\n return cb()\n\n if (Array.isArray(c))\n return cb(null, c)\n }\n\n var self = this\n fs.readdir(abs, readdirCb(this, abs, cb))\n}\n\nfunction readdirCb (self, abs, cb) {\n return function (er, entries) {\n if (er)\n self._readdirError(abs, er, cb)\n else\n self._readdirEntries(abs, entries, cb)\n }\n}\n\nGlob.prototype._readdirEntries = function (abs, entries, cb) {\n if (this.aborted)\n return\n\n // if we haven't asked to stat everything, then just\n // assume that everything in there exists, so we can avoid\n // having to stat it a second time.\n if (!this.mark && !this.stat) {\n for (var i = 0; i < entries.length; i ++) {\n var e = entries[i]\n if (abs === '/')\n e = abs + e\n else\n e = abs + '/' + e\n this.cache[e] = true\n }\n }\n\n this.cache[abs] = entries\n return cb(null, entries)\n}\n\nGlob.prototype._readdirError = function (f, er, cb) {\n if (this.aborted)\n return\n\n // handle errors, and cache the information\n switch (er.code) {\n case 'ENOTSUP': // https://github.com/isaacs/node-glob/issues/205\n case 'ENOTDIR': // totally normal. means it *does* exist.\n this.cache[this._makeAbs(f)] = 'FILE'\n break\n\n case 'ENOENT': // not terribly unusual\n case 'ELOOP':\n case 'ENAMETOOLONG':\n case 'UNKNOWN':\n this.cache[this._makeAbs(f)] = false\n break\n\n default: // some unusual error. Treat as failure.\n this.cache[this._makeAbs(f)] = false\n if (this.strict) {\n this.emit('error', er)\n // If the error is handled, then we abort\n // if not, we threw out of here\n this.abort()\n }\n if (!this.silent)\n console.error('glob error', er)\n break\n }\n\n return cb()\n}\n\nGlob.prototype._processGlobStar = function (prefix, read, abs, remain, index, inGlobStar, cb) {\n var self = this\n this._readdir(abs, inGlobStar, function (er, entries) {\n self._processGlobStar2(prefix, read, abs, remain, index, inGlobStar, entries, cb)\n })\n}\n\n\nGlob.prototype._processGlobStar2 = function (prefix, read, abs, remain, index, inGlobStar, entries, cb) {\n //console.error('pgs2', prefix, remain[0], entries)\n\n // no entries means not a dir, so it can never have matches\n // foo.txt/** doesn't match foo.txt\n if (!entries)\n return cb()\n\n // test without the globstar, and with every child both below\n // and replacing the globstar.\n var remainWithoutGlobStar = remain.slice(1)\n var gspref = prefix ? [ prefix ] : []\n var noGlobStar = gspref.concat(remainWithoutGlobStar)\n\n // the noGlobStar pattern exits the inGlobStar state\n this._process(noGlobStar, index, false, cb)\n\n var isSym = this.symlinks[abs]\n var len = entries.length\n\n // If it's a symlink, and we're in a globstar, then stop\n if (isSym && inGlobStar)\n return cb()\n\n for (var i = 0; i < len; i++) {\n var e = entries[i]\n if (e.charAt(0) === '.' && !this.dot)\n continue\n\n // these two cases enter the inGlobStar state\n var instead = gspref.concat(entries[i], remainWithoutGlobStar)\n this._process(instead, index, true, cb)\n\n var below = gspref.concat(entries[i], remain)\n this._process(below, index, true, cb)\n }\n\n cb()\n}\n\nGlob.prototype._processSimple = function (prefix, index, cb) {\n // XXX review this. Shouldn't it be doing the mounting etc\n // before doing stat? kinda weird?\n var self = this\n this._stat(prefix, function (er, exists) {\n self._processSimple2(prefix, index, er, exists, cb)\n })\n}\nGlob.prototype._processSimple2 = function (prefix, index, er, exists, cb) {\n\n //console.error('ps2', prefix, exists)\n\n if (!this.matches[index])\n this.matches[index] = Object.create(null)\n\n // If it doesn't exist, then just mark the lack of results\n if (!exists)\n return cb()\n\n if (prefix && isAbsolute(prefix) && !this.nomount) {\n var trail = /[\\/\\\\]$/.test(prefix)\n if (prefix.charAt(0) === '/') {\n prefix = path.join(this.root, prefix)\n } else {\n prefix = path.resolve(this.root, prefix)\n if (trail)\n prefix += '/'\n }\n }\n\n if (process.platform === 'win32')\n prefix = prefix.replace(/\\\\/g, '/')\n\n // Mark this as a match\n this._emitMatch(index, prefix)\n cb()\n}\n\n// Returns either 'DIR', 'FILE', or false\nGlob.prototype._stat = function (f, cb) {\n var abs = this._makeAbs(f)\n var needDir = f.slice(-1) === '/'\n\n if (f.length > this.maxLength)\n return cb()\n\n if (!this.stat && ownProp(this.cache, abs)) {\n var c = this.cache[abs]\n\n if (Array.isArray(c))\n c = 'DIR'\n\n // It exists, but maybe not how we need it\n if (!needDir || c === 'DIR')\n return cb(null, c)\n\n if (needDir && c === 'FILE')\n return cb()\n\n // otherwise we have to stat, because maybe c=true\n // if we know it exists, but not what it is.\n }\n\n var exists\n var stat = this.statCache[abs]\n if (stat !== undefined) {\n if (stat === false)\n return cb(null, stat)\n else {\n var type = stat.isDirectory() ? 'DIR' : 'FILE'\n if (needDir && type === 'FILE')\n return cb()\n else\n return cb(null, type, stat)\n }\n }\n\n var self = this\n var statcb = inflight('stat\\0' + abs, lstatcb_)\n if (statcb)\n fs.lstat(abs, statcb)\n\n function lstatcb_ (er, lstat) {\n if (lstat && lstat.isSymbolicLink()) {\n // If it's a symlink, then treat it as the target, unless\n // the target does not exist, then treat it as a file.\n return fs.stat(abs, function (er, stat) {\n if (er)\n self._stat2(f, abs, null, lstat, cb)\n else\n self._stat2(f, abs, er, stat, cb)\n })\n } else {\n self._stat2(f, abs, er, lstat, cb)\n }\n }\n}\n\nGlob.prototype._stat2 = function (f, abs, er, stat, cb) {\n if (er) {\n this.statCache[abs] = false\n return cb()\n }\n\n var needDir = f.slice(-1) === '/'\n this.statCache[abs] = stat\n\n if (abs.slice(-1) === '/' && !stat.isDirectory())\n return cb(null, false, stat)\n\n var c = stat.isDirectory() ? 'DIR' : 'FILE'\n this.cache[abs] = this.cache[abs] || c\n\n if (needDir && c !== 'DIR')\n return cb()\n\n return cb(null, c, stat)\n}\n\n}).call(this,require('_process'))\n},{\"./common.js\":15,\"./sync.js\":17,\"_process\":24,\"assert\":9,\"events\":14,\"fs\":12,\"inflight\":18,\"inherits\":19,\"minimatch\":20,\"once\":21,\"path\":22,\"path-is-absolute\":23,\"util\":28}],17:[function(require,module,exports){\n(function (process){\nmodule.exports = globSync\nglobSync.GlobSync = GlobSync\n\nvar fs = require('fs')\nvar minimatch = require('minimatch')\nvar Minimatch = minimatch.Minimatch\nvar Glob = require('./glob.js').Glob\nvar util = require('util')\nvar path = require('path')\nvar assert = require('assert')\nvar isAbsolute = require('path-is-absolute')\nvar common = require('./common.js')\nvar alphasort = common.alphasort\nvar alphasorti = common.alphasorti\nvar setopts = common.setopts\nvar ownProp = common.ownProp\nvar childrenIgnored = common.childrenIgnored\n\nfunction globSync (pattern, options) {\n if (typeof options === 'function' || arguments.length === 3)\n throw new TypeError('callback provided to sync glob\\n'+\n 'See: https://github.com/isaacs/node-glob/issues/167')\n\n return new GlobSync(pattern, options).found\n}\n\nfunction GlobSync (pattern, options) {\n if (!pattern)\n throw new Error('must provide pattern')\n\n if (typeof options === 'function' || arguments.length === 3)\n throw new TypeError('callback provided to sync glob\\n'+\n 'See: https://github.com/isaacs/node-glob/issues/167')\n\n if (!(this instanceof GlobSync))\n return new GlobSync(pattern, options)\n\n setopts(this, pattern, options)\n\n if (this.noprocess)\n return this\n\n var n = this.minimatch.set.length\n this.matches = new Array(n)\n for (var i = 0; i < n; i ++) {\n this._process(this.minimatch.set[i], i, false)\n }\n this._finish()\n}\n\nGlobSync.prototype._finish = function () {\n assert(this instanceof GlobSync)\n if (this.realpath) {\n var self = this\n this.matches.forEach(function (matchset, index) {\n var set = self.matches[index] = Object.create(null)\n for (var p in matchset) {\n try {\n p = self._makeAbs(p)\n var real = fs.realpathSync(p, self.realpathCache)\n set[real] = true\n } catch (er) {\n if (er.syscall === 'stat')\n set[self._makeAbs(p)] = true\n else\n throw er\n }\n }\n })\n }\n common.finish(this)\n}\n\n\nGlobSync.prototype._process = function (pattern, index, inGlobStar) {\n assert(this instanceof GlobSync)\n\n // Get the first [n] parts of pattern that are all strings.\n var n = 0\n while (typeof pattern[n] === 'string') {\n n ++\n }\n // now n is the index of the first one that is *not* a string.\n\n // See if there's anything else\n var prefix\n switch (n) {\n // if not, then this is rather simple\n case pattern.length:\n this._processSimple(pattern.join('/'), index)\n return\n\n case 0:\n // pattern *starts* with some non-trivial item.\n // going to readdir(cwd), but not include the prefix in matches.\n prefix = null\n break\n\n default:\n // pattern has some string bits in the front.\n // whatever it starts with, whether that's 'absolute' like /foo/bar,\n // or 'relative' like '../baz'\n prefix = pattern.slice(0, n).join('/')\n break\n }\n\n var remain = pattern.slice(n)\n\n // get the list of entries.\n var read\n if (prefix === null)\n read = '.'\n else if (isAbsolute(prefix) || isAbsolute(pattern.join('/'))) {\n if (!prefix || !isAbsolute(prefix))\n prefix = '/' + prefix\n read = prefix\n } else\n read = prefix\n\n var abs = this._makeAbs(read)\n\n //if ignored, skip processing\n if (childrenIgnored(this, read))\n return\n\n var isGlobStar = remain[0] === minimatch.GLOBSTAR\n if (isGlobStar)\n this._processGlobStar(prefix, read, abs, remain, index, inGlobStar)\n else\n this._processReaddir(prefix, read, abs, remain, index, inGlobStar)\n}\n\n\nGlobSync.prototype._processReaddir = function (prefix, read, abs, remain, index, inGlobStar) {\n var entries = this._readdir(abs, inGlobStar)\n\n // if the abs isn't a dir, then nothing can match!\n if (!entries)\n return\n\n // It will only match dot entries if it starts with a dot, or if\n // dot is set. Stuff like @(.foo|.bar) isn't allowed.\n var pn = remain[0]\n var negate = !!this.minimatch.negate\n var rawGlob = pn._glob\n var dotOk = this.dot || rawGlob.charAt(0) === '.'\n\n var matchedEntries = []\n for (var i = 0; i < entries.length; i++) {\n var e = entries[i]\n if (e.charAt(0) !== '.' || dotOk) {\n var m\n if (negate && !prefix) {\n m = !e.match(pn)\n } else {\n m = e.match(pn)\n }\n if (m)\n matchedEntries.push(e)\n }\n }\n\n var len = matchedEntries.length\n // If there are no matched entries, then nothing matches.\n if (len === 0)\n return\n\n // if this is the last remaining pattern bit, then no need for\n // an additional stat *unless* the user has specified mark or\n // stat explicitly. We know they exist, since readdir returned\n // them.\n\n if (remain.length === 1 && !this.mark && !this.stat) {\n if (!this.matches[index])\n this.matches[index] = Object.create(null)\n\n for (var i = 0; i < len; i ++) {\n var e = matchedEntries[i]\n if (prefix) {\n if (prefix.slice(-1) !== '/')\n e = prefix + '/' + e\n else\n e = prefix + e\n }\n\n if (e.charAt(0) === '/' && !this.nomount) {\n e = path.join(this.root, e)\n }\n this.matches[index][e] = true\n }\n // This was the last one, and no stats were needed\n return\n }\n\n // now test all matched entries as stand-ins for that part\n // of the pattern.\n remain.shift()\n for (var i = 0; i < len; i ++) {\n var e = matchedEntries[i]\n var newPattern\n if (prefix)\n newPattern = [prefix, e]\n else\n newPattern = [e]\n this._process(newPattern.concat(remain), index, inGlobStar)\n }\n}\n\n\nGlobSync.prototype._emitMatch = function (index, e) {\n var abs = this._makeAbs(e)\n if (this.mark)\n e = this._mark(e)\n\n if (this.matches[index][e])\n return\n\n if (this.nodir) {\n var c = this.cache[this._makeAbs(e)]\n if (c === 'DIR' || Array.isArray(c))\n return\n }\n\n this.matches[index][e] = true\n if (this.stat)\n this._stat(e)\n}\n\n\nGlobSync.prototype._readdirInGlobStar = function (abs) {\n // follow all symlinked directories forever\n // just proceed as if this is a non-globstar situation\n if (this.follow)\n return this._readdir(abs, false)\n\n var entries\n var lstat\n var stat\n try {\n lstat = fs.lstatSync(abs)\n } catch (er) {\n // lstat failed, doesn't exist\n return null\n }\n\n var isSym = lstat.isSymbolicLink()\n this.symlinks[abs] = isSym\n\n // If it's not a symlink or a dir, then it's definitely a regular file.\n // don't bother doing a readdir in that case.\n if (!isSym && !lstat.isDirectory())\n this.cache[abs] = 'FILE'\n else\n entries = this._readdir(abs, false)\n\n return entries\n}\n\nGlobSync.prototype._readdir = function (abs, inGlobStar) {\n var entries\n\n if (inGlobStar && !ownProp(this.symlinks, abs))\n return this._readdirInGlobStar(abs)\n\n if (ownProp(this.cache, abs)) {\n var c = this.cache[abs]\n if (!c || c === 'FILE')\n return null\n\n if (Array.isArray(c))\n return c\n }\n\n try {\n return this._readdirEntries(abs, fs.readdirSync(abs))\n } catch (er) {\n this._readdirError(abs, er)\n return null\n }\n}\n\nGlobSync.prototype._readdirEntries = function (abs, entries) {\n // if we haven't asked to stat everything, then just\n // assume that everything in there exists, so we can avoid\n // having to stat it a second time.\n if (!this.mark && !this.stat) {\n for (var i = 0; i < entries.length; i ++) {\n var e = entries[i]\n if (abs === '/')\n e = abs + e\n else\n e = abs + '/' + e\n this.cache[e] = true\n }\n }\n\n this.cache[abs] = entries\n\n // mark and cache dir-ness\n return entries\n}\n\nGlobSync.prototype._readdirError = function (f, er) {\n // handle errors, and cache the information\n switch (er.code) {\n case 'ENOTSUP': // https://github.com/isaacs/node-glob/issues/205\n case 'ENOTDIR': // totally normal. means it *does* exist.\n this.cache[this._makeAbs(f)] = 'FILE'\n break\n\n case 'ENOENT': // not terribly unusual\n case 'ELOOP':\n case 'ENAMETOOLONG':\n case 'UNKNOWN':\n this.cache[this._makeAbs(f)] = false\n break\n\n default: // some unusual error. Treat as failure.\n this.cache[this._makeAbs(f)] = false\n if (this.strict)\n throw er\n if (!this.silent)\n console.error('glob error', er)\n break\n }\n}\n\nGlobSync.prototype._processGlobStar = function (prefix, read, abs, remain, index, inGlobStar) {\n\n var entries = this._readdir(abs, inGlobStar)\n\n // no entries means not a dir, so it can never have matches\n // foo.txt/** doesn't match foo.txt\n if (!entries)\n return\n\n // test without the globstar, and with every child both below\n // and replacing the globstar.\n var remainWithoutGlobStar = remain.slice(1)\n var gspref = prefix ? [ prefix ] : []\n var noGlobStar = gspref.concat(remainWithoutGlobStar)\n\n // the noGlobStar pattern exits the inGlobStar state\n this._process(noGlobStar, index, false)\n\n var len = entries.length\n var isSym = this.symlinks[abs]\n\n // If it's a symlink, and we're in a globstar, then stop\n if (isSym && inGlobStar)\n return\n\n for (var i = 0; i < len; i++) {\n var e = entries[i]\n if (e.charAt(0) === '.' && !this.dot)\n continue\n\n // these two cases enter the inGlobStar state\n var instead = gspref.concat(entries[i], remainWithoutGlobStar)\n this._process(instead, index, true)\n\n var below = gspref.concat(entries[i], remain)\n this._process(below, index, true)\n }\n}\n\nGlobSync.prototype._processSimple = function (prefix, index) {\n // XXX review this. Shouldn't it be doing the mounting etc\n // before doing stat? kinda weird?\n var exists = this._stat(prefix)\n\n if (!this.matches[index])\n this.matches[index] = Object.create(null)\n\n // If it doesn't exist, then just mark the lack of results\n if (!exists)\n return\n\n if (prefix && isAbsolute(prefix) && !this.nomount) {\n var trail = /[\\/\\\\]$/.test(prefix)\n if (prefix.charAt(0) === '/') {\n prefix = path.join(this.root, prefix)\n } else {\n prefix = path.resolve(this.root, prefix)\n if (trail)\n prefix += '/'\n }\n }\n\n if (process.platform === 'win32')\n prefix = prefix.replace(/\\\\/g, '/')\n\n // Mark this as a match\n this.matches[index][prefix] = true\n}\n\n// Returns either 'DIR', 'FILE', or false\nGlobSync.prototype._stat = function (f) {\n var abs = this._makeAbs(f)\n var needDir = f.slice(-1) === '/'\n\n if (f.length > this.maxLength)\n return false\n\n if (!this.stat && ownProp(this.cache, abs)) {\n var c = this.cache[abs]\n\n if (Array.isArray(c))\n c = 'DIR'\n\n // It exists, but maybe not how we need it\n if (!needDir || c === 'DIR')\n return c\n\n if (needDir && c === 'FILE')\n return false\n\n // otherwise we have to stat, because maybe c=true\n // if we know it exists, but not what it is.\n }\n\n var exists\n var stat = this.statCache[abs]\n if (!stat) {\n var lstat\n try {\n lstat = fs.lstatSync(abs)\n } catch (er) {\n return false\n }\n\n if (lstat.isSymbolicLink()) {\n try {\n stat = fs.statSync(abs)\n } catch (er) {\n stat = lstat\n }\n } else {\n stat = lstat\n }\n }\n\n this.statCache[abs] = stat\n\n var c = stat.isDirectory() ? 'DIR' : 'FILE'\n this.cache[abs] = this.cache[abs] || c\n\n if (needDir && c !== 'DIR')\n return false\n\n return c\n}\n\nGlobSync.prototype._mark = function (p) {\n return common.mark(this, p)\n}\n\nGlobSync.prototype._makeAbs = function (f) {\n return common.makeAbs(this, f)\n}\n\n}).call(this,require('_process'))\n},{\"./common.js\":15,\"./glob.js\":16,\"_process\":24,\"assert\":9,\"fs\":12,\"minimatch\":20,\"path\":22,\"path-is-absolute\":23,\"util\":28}],18:[function(require,module,exports){\n(function (process){\nvar wrappy = require('wrappy')\nvar reqs = Object.create(null)\nvar once = require('once')\n\nmodule.exports = wrappy(inflight)\n\nfunction inflight (key, cb) {\n if (reqs[key]) {\n reqs[key].push(cb)\n return null\n } else {\n reqs[key] = [cb]\n return makeres(key)\n }\n}\n\nfunction makeres (key) {\n return once(function RES () {\n var cbs = reqs[key]\n var len = cbs.length\n var args = slice(arguments)\n\n // XXX It's somewhat ambiguous whether a new callback added in this\n // pass should be queued for later execution if something in the\n // list of callbacks throws, or if it should just be discarded.\n // However, it's such an edge case that it hardly matters, and either\n // choice is likely as surprising as the other.\n // As it happens, we do go ahead and schedule it for later execution.\n try {\n for (var i = 0; i < len; i++) {\n cbs[i].apply(null, args)\n }\n } finally {\n if (cbs.length > len) {\n // added more in the interim.\n // de-zalgo, just in case, but don't call again.\n cbs.splice(0, len)\n process.nextTick(function () {\n RES.apply(null, args)\n })\n } else {\n delete reqs[key]\n }\n }\n })\n}\n\nfunction slice (args) {\n var length = args.length\n var array = []\n\n for (var i = 0; i < length; i++) array[i] = args[i]\n return array\n}\n\n}).call(this,require('_process'))\n},{\"_process\":24,\"once\":21,\"wrappy\":29}],19:[function(require,module,exports){\nif (typeof Object.create === 'function') {\n // implementation from standard node.js 'util' module\n module.exports = function inherits(ctor, superCtor) {\n ctor.super_ = superCtor\n ctor.prototype = Object.create(superCtor.prototype, {\n constructor: {\n value: ctor,\n enumerable: false,\n writable: true,\n configurable: true\n }\n });\n };\n} else {\n // old school shim for old browsers\n module.exports = function inherits(ctor, superCtor) {\n ctor.super_ = superCtor\n var TempCtor = function () {}\n TempCtor.prototype = superCtor.prototype\n ctor.prototype = new TempCtor()\n ctor.prototype.constructor = ctor\n }\n}\n\n},{}],20:[function(require,module,exports){\nmodule.exports = minimatch\nminimatch.Minimatch = Minimatch\n\nvar path = { sep: '/' }\ntry {\n path = require('path')\n} catch (er) {}\n\nvar GLOBSTAR = minimatch.GLOBSTAR = Minimatch.GLOBSTAR = {}\nvar expand = require('brace-expansion')\n\nvar plTypes = {\n '!': { open: '(?:(?!(?:', close: '))[^/]*?)'},\n '?': { open: '(?:', close: ')?' },\n '+': { open: '(?:', close: ')+' },\n '*': { open: '(?:', close: ')*' },\n '@': { open: '(?:', close: ')' }\n}\n\n// any single thing other than /\n// don't need to escape / when using new RegExp()\nvar qmark = '[^/]'\n\n// * => any number of characters\nvar star = qmark + '*?'\n\n// ** when dots are allowed. Anything goes, except .. and .\n// not (^ or / followed by one or two dots followed by $ or /),\n// followed by anything, any number of times.\nvar twoStarDot = '(?:(?!(?:\\\\\\/|^)(?:\\\\.{1,2})($|\\\\\\/)).)*?'\n\n// not a ^ or / followed by a dot,\n// followed by anything, any number of times.\nvar twoStarNoDot = '(?:(?!(?:\\\\\\/|^)\\\\.).)*?'\n\n// characters that need to be escaped in RegExp.\nvar reSpecials = charSet('().*{}+?[]^$\\\\!')\n\n// \"abc\" -> { a:true, b:true, c:true }\nfunction charSet (s) {\n return s.split('').reduce(function (set, c) {\n set[c] = true\n return set\n }, {})\n}\n\n// normalizes slashes.\nvar slashSplit = /\\/+/\n\nminimatch.filter = filter\nfunction filter (pattern, options) {\n options = options || {}\n return function (p, i, list) {\n return minimatch(p, pattern, options)\n }\n}\n\nfunction ext (a, b) {\n a = a || {}\n b = b || {}\n var t = {}\n Object.keys(b).forEach(function (k) {\n t[k] = b[k]\n })\n Object.keys(a).forEach(function (k) {\n t[k] = a[k]\n })\n return t\n}\n\nminimatch.defaults = function (def) {\n if (!def || !Object.keys(def).length) return minimatch\n\n var orig = minimatch\n\n var m = function minimatch (p, pattern, options) {\n return orig.minimatch(p, pattern, ext(def, options))\n }\n\n m.Minimatch = function Minimatch (pattern, options) {\n return new orig.Minimatch(pattern, ext(def, options))\n }\n\n return m\n}\n\nMinimatch.defaults = function (def) {\n if (!def || !Object.keys(def).length) return Minimatch\n return minimatch.defaults(def).Minimatch\n}\n\nfunction minimatch (p, pattern, options) {\n if (typeof pattern !== 'string') {\n throw new TypeError('glob pattern string required')\n }\n\n if (!options) options = {}\n\n // shortcut: comments match nothing.\n if (!options.nocomment && pattern.charAt(0) === '#') {\n return false\n }\n\n // \"\" only matches \"\"\n if (pattern.trim() === '') return p === ''\n\n return new Minimatch(pattern, options).match(p)\n}\n\nfunction Minimatch (pattern, options) {\n if (!(this instanceof Minimatch)) {\n return new Minimatch(pattern, options)\n }\n\n if (typeof pattern !== 'string') {\n throw new TypeError('glob pattern string required')\n }\n\n if (!options) options = {}\n pattern = pattern.trim()\n\n // windows support: need to use /, not \\\n if (path.sep !== '/') {\n pattern = pattern.split(path.sep).join('/')\n }\n\n this.options = options\n this.set = []\n this.pattern = pattern\n this.regexp = null\n this.negate = false\n this.comment = false\n this.empty = false\n\n // make the set of regexps etc.\n this.make()\n}\n\nMinimatch.prototype.debug = function () {}\n\nMinimatch.prototype.make = make\nfunction make () {\n // don't do it more than once.\n if (this._made) return\n\n var pattern = this.pattern\n var options = this.options\n\n // empty patterns and comments match nothing.\n if (!options.nocomment && pattern.charAt(0) === '#') {\n this.comment = true\n return\n }\n if (!pattern) {\n this.empty = true\n return\n }\n\n // step 1: figure out negation, etc.\n this.parseNegate()\n\n // step 2: expand braces\n var set = this.globSet = this.braceExpand()\n\n if (options.debug) this.debug = console.error\n\n this.debug(this.pattern, set)\n\n // step 3: now we have a set, so turn each one into a series of path-portion\n // matching patterns.\n // These will be regexps, except in the case of \"**\", which is\n // set to the GLOBSTAR object for globstar behavior,\n // and will not contain any / characters\n set = this.globParts = set.map(function (s) {\n return s.split(slashSplit)\n })\n\n this.debug(this.pattern, set)\n\n // glob --> regexps\n set = set.map(function (s, si, set) {\n return s.map(this.parse, this)\n }, this)\n\n this.debug(this.pattern, set)\n\n // filter out everything that didn't compile properly.\n set = set.filter(function (s) {\n return s.indexOf(false) === -1\n })\n\n this.debug(this.pattern, set)\n\n this.set = set\n}\n\nMinimatch.prototype.parseNegate = parseNegate\nfunction parseNegate () {\n var pattern = this.pattern\n var negate = false\n var options = this.options\n var negateOffset = 0\n\n if (options.nonegate) return\n\n for (var i = 0, l = pattern.length\n ; i < l && pattern.charAt(i) === '!'\n ; i++) {\n negate = !negate\n negateOffset++\n }\n\n if (negateOffset) this.pattern = pattern.substr(negateOffset)\n this.negate = negate\n}\n\n// Brace expansion:\n// a{b,c}d -> abd acd\n// a{b,}c -> abc ac\n// a{0..3}d -> a0d a1d a2d a3d\n// a{b,c{d,e}f}g -> abg acdfg acefg\n// a{b,c}d{e,f}g -> abdeg acdeg abdeg abdfg\n//\n// Invalid sets are not expanded.\n// a{2..}b -> a{2..}b\n// a{b}c -> a{b}c\nminimatch.braceExpand = function (pattern, options) {\n return braceExpand(pattern, options)\n}\n\nMinimatch.prototype.braceExpand = braceExpand\n\nfunction braceExpand (pattern, options) {\n if (!options) {\n if (this instanceof Minimatch) {\n options = this.options\n } else {\n options = {}\n }\n }\n\n pattern = typeof pattern === 'undefined'\n ? this.pattern : pattern\n\n if (typeof pattern === 'undefined') {\n throw new TypeError('undefined pattern')\n }\n\n if (options.nobrace ||\n !pattern.match(/\\{.*\\}/)) {\n // shortcut. no need to expand.\n return [pattern]\n }\n\n return expand(pattern)\n}\n\n// parse a component of the expanded set.\n// At this point, no pattern may contain \"/\" in it\n// so we're going to return a 2d array, where each entry is the full\n// pattern, split on '/', and then turned into a regular expression.\n// A regexp is made at the end which joins each array with an\n// escaped /, and another full one which joins each regexp with |.\n//\n// Following the lead of Bash 4.1, note that \"**\" only has special meaning\n// when it is the *only* thing in a path portion. Otherwise, any series\n// of * is equivalent to a single *. Globstar behavior is enabled by\n// default, and can be disabled by setting options.noglobstar.\nMinimatch.prototype.parse = parse\nvar SUBPARSE = {}\nfunction parse (pattern, isSub) {\n if (pattern.length > 1024 * 64) {\n throw new TypeError('pattern is too long')\n }\n\n var options = this.options\n\n // shortcuts\n if (!options.noglobstar && pattern === '**') return GLOBSTAR\n if (pattern === '') return ''\n\n var re = ''\n var hasMagic = !!options.nocase\n var escaping = false\n // ? => one single character\n var patternListStack = []\n var negativeLists = []\n var stateChar\n var inClass = false\n var reClassStart = -1\n var classStart = -1\n // . and .. never match anything that doesn't start with .,\n // even when options.dot is set.\n var patternStart = pattern.charAt(0) === '.' ? '' // anything\n // not (start or / followed by . or .. followed by / or end)\n : options.dot ? '(?!(?:^|\\\\\\/)\\\\.{1,2}(?:$|\\\\\\/))'\n : '(?!\\\\.)'\n var self = this\n\n function clearStateChar () {\n if (stateChar) {\n // we had some state-tracking character\n // that wasn't consumed by this pass.\n switch (stateChar) {\n case '*':\n re += star\n hasMagic = true\n break\n case '?':\n re += qmark\n hasMagic = true\n break\n default:\n re += '\\\\' + stateChar\n break\n }\n self.debug('clearStateChar %j %j', stateChar, re)\n stateChar = false\n }\n }\n\n for (var i = 0, len = pattern.length, c\n ; (i < len) && (c = pattern.charAt(i))\n ; i++) {\n this.debug('%s\\t%s %s %j', pattern, i, re, c)\n\n // skip over any that are escaped.\n if (escaping && reSpecials[c]) {\n re += '\\\\' + c\n escaping = false\n continue\n }\n\n switch (c) {\n case '/':\n // completely not allowed, even escaped.\n // Should already be path-split by now.\n return false\n\n case '\\\\':\n clearStateChar()\n escaping = true\n continue\n\n // the various stateChar values\n // for the \"extglob\" stuff.\n case '?':\n case '*':\n case '+':\n case '@':\n case '!':\n this.debug('%s\\t%s %s %j <-- stateChar', pattern, i, re, c)\n\n // all of those are literals inside a class, except that\n // the glob [!a] means [^a] in regexp\n if (inClass) {\n this.debug(' in class')\n if (c === '!' && i === classStart + 1) c = '^'\n re += c\n continue\n }\n\n // if we already have a stateChar, then it means\n // that there was something like ** or +? in there.\n // Handle the stateChar, then proceed with this one.\n self.debug('call clearStateChar %j', stateChar)\n clearStateChar()\n stateChar = c\n // if extglob is disabled, then +(asdf|foo) isn't a thing.\n // just clear the statechar *now*, rather than even diving into\n // the patternList stuff.\n if (options.noext) clearStateChar()\n continue\n\n case '(':\n if (inClass) {\n re += '('\n continue\n }\n\n if (!stateChar) {\n re += '\\\\('\n continue\n }\n\n patternListStack.push({\n type: stateChar,\n start: i - 1,\n reStart: re.length,\n open: plTypes[stateChar].open,\n close: plTypes[stateChar].close\n })\n // negation is (?:(?!js)[^/]*)\n re += stateChar === '!' ? '(?:(?!(?:' : '(?:'\n this.debug('plType %j %j', stateChar, re)\n stateChar = false\n continue\n\n case ')':\n if (inClass || !patternListStack.length) {\n re += '\\\\)'\n continue\n }\n\n clearStateChar()\n hasMagic = true\n var pl = patternListStack.pop()\n // negation is (?:(?!js)[^/]*)\n // The others are (?:)\n re += pl.close\n if (pl.type === '!') {\n negativeLists.push(pl)\n }\n pl.reEnd = re.length\n continue\n\n case '|':\n if (inClass || !patternListStack.length || escaping) {\n re += '\\\\|'\n escaping = false\n continue\n }\n\n clearStateChar()\n re += '|'\n continue\n\n // these are mostly the same in regexp and glob\n case '[':\n // swallow any state-tracking char before the [\n clearStateChar()\n\n if (inClass) {\n re += '\\\\' + c\n continue\n }\n\n inClass = true\n classStart = i\n reClassStart = re.length\n re += c\n continue\n\n case ']':\n // a right bracket shall lose its special\n // meaning and represent itself in\n // a bracket expression if it occurs\n // first in the list. -- POSIX.2 2.8.3.2\n if (i === classStart + 1 || !inClass) {\n re += '\\\\' + c\n escaping = false\n continue\n }\n\n // handle the case where we left a class open.\n // \"[z-a]\" is valid, equivalent to \"\\[z-a\\]\"\n if (inClass) {\n // split where the last [ was, make sure we don't have\n // an invalid re. if so, re-walk the contents of the\n // would-be class to re-translate any characters that\n // were passed through as-is\n // TODO: It would probably be faster to determine this\n // without a try/catch and a new RegExp, but it's tricky\n // to do safely. For now, this is safe and works.\n var cs = pattern.substring(classStart + 1, i)\n try {\n RegExp('[' + cs + ']')\n } catch (er) {\n // not a valid class!\n var sp = this.parse(cs, SUBPARSE)\n re = re.substr(0, reClassStart) + '\\\\[' + sp[0] + '\\\\]'\n hasMagic = hasMagic || sp[1]\n inClass = false\n continue\n }\n }\n\n // finish up the class.\n hasMagic = true\n inClass = false\n re += c\n continue\n\n default:\n // swallow any state char that wasn't consumed\n clearStateChar()\n\n if (escaping) {\n // no need\n escaping = false\n } else if (reSpecials[c]\n && !(c === '^' && inClass)) {\n re += '\\\\'\n }\n\n re += c\n\n } // switch\n } // for\n\n // handle the case where we left a class open.\n // \"[abc\" is valid, equivalent to \"\\[abc\"\n if (inClass) {\n // split where the last [ was, and escape it\n // this is a huge pita. We now have to re-walk\n // the contents of the would-be class to re-translate\n // any characters that were passed through as-is\n cs = pattern.substr(classStart + 1)\n sp = this.parse(cs, SUBPARSE)\n re = re.substr(0, reClassStart) + '\\\\[' + sp[0]\n hasMagic = hasMagic || sp[1]\n }\n\n // handle the case where we had a +( thing at the *end*\n // of the pattern.\n // each pattern list stack adds 3 chars, and we need to go through\n // and escape any | chars that were passed through as-is for the regexp.\n // Go through and escape them, taking care not to double-escape any\n // | chars that were already escaped.\n for (pl = patternListStack.pop(); pl; pl = patternListStack.pop()) {\n var tail = re.slice(pl.reStart + pl.open.length)\n this.debug('setting tail', re, pl)\n // maybe some even number of \\, then maybe 1 \\, followed by a |\n tail = tail.replace(/((?:\\\\{2}){0,64})(\\\\?)\\|/g, function (_, $1, $2) {\n if (!$2) {\n // the | isn't already escaped, so escape it.\n $2 = '\\\\'\n }\n\n // need to escape all those slashes *again*, without escaping the\n // one that we need for escaping the | character. As it works out,\n // escaping an even number of slashes can be done by simply repeating\n // it exactly after itself. That's why this trick works.\n //\n // I am sorry that you have to see this.\n return $1 + $1 + $2 + '|'\n })\n\n this.debug('tail=%j\\n %s', tail, tail, pl, re)\n var t = pl.type === '*' ? star\n : pl.type === '?' ? qmark\n : '\\\\' + pl.type\n\n hasMagic = true\n re = re.slice(0, pl.reStart) + t + '\\\\(' + tail\n }\n\n // handle trailing things that only matter at the very end.\n clearStateChar()\n if (escaping) {\n // trailing \\\\\n re += '\\\\\\\\'\n }\n\n // only need to apply the nodot start if the re starts with\n // something that could conceivably capture a dot\n var addPatternStart = false\n switch (re.charAt(0)) {\n case '.':\n case '[':\n case '(': addPatternStart = true\n }\n\n // Hack to work around lack of negative lookbehind in JS\n // A pattern like: *.!(x).!(y|z) needs to ensure that a name\n // like 'a.xyz.yz' doesn't match. So, the first negative\n // lookahead, has to look ALL the way ahead, to the end of\n // the pattern.\n for (var n = negativeLists.length - 1; n > -1; n--) {\n var nl = negativeLists[n]\n\n var nlBefore = re.slice(0, nl.reStart)\n var nlFirst = re.slice(nl.reStart, nl.reEnd - 8)\n var nlLast = re.slice(nl.reEnd - 8, nl.reEnd)\n var nlAfter = re.slice(nl.reEnd)\n\n nlLast += nlAfter\n\n // Handle nested stuff like *(*.js|!(*.json)), where open parens\n // mean that we should *not* include the ) in the bit that is considered\n // \"after\" the negated section.\n var openParensBefore = nlBefore.split('(').length - 1\n var cleanAfter = nlAfter\n for (i = 0; i < openParensBefore; i++) {\n cleanAfter = cleanAfter.replace(/\\)[+*?]?/, '')\n }\n nlAfter = cleanAfter\n\n var dollar = ''\n if (nlAfter === '' && isSub !== SUBPARSE) {\n dollar = '$'\n }\n var newRe = nlBefore + nlFirst + nlAfter + dollar + nlLast\n re = newRe\n }\n\n // if the re is not \"\" at this point, then we need to make sure\n // it doesn't match against an empty path part.\n // Otherwise a/* will match a/, which it should not.\n if (re !== '' && hasMagic) {\n re = '(?=.)' + re\n }\n\n if (addPatternStart) {\n re = patternStart + re\n }\n\n // parsing just a piece of a larger pattern.\n if (isSub === SUBPARSE) {\n return [re, hasMagic]\n }\n\n // skip the regexp for non-magical patterns\n // unescape anything in it, though, so that it'll be\n // an exact match against a file etc.\n if (!hasMagic) {\n return globUnescape(pattern)\n }\n\n var flags = options.nocase ? 'i' : ''\n try {\n var regExp = new RegExp('^' + re + '$', flags)\n } catch (er) {\n // If it was an invalid regular expression, then it can't match\n // anything. This trick looks for a character after the end of\n // the string, which is of course impossible, except in multi-line\n // mode, but it's not a /m regex.\n return new RegExp('$.')\n }\n\n regExp._glob = pattern\n regExp._src = re\n\n return regExp\n}\n\nminimatch.makeRe = function (pattern, options) {\n return new Minimatch(pattern, options || {}).makeRe()\n}\n\nMinimatch.prototype.makeRe = makeRe\nfunction makeRe () {\n if (this.regexp || this.regexp === false) return this.regexp\n\n // at this point, this.set is a 2d array of partial\n // pattern strings, or \"**\".\n //\n // It's better to use .match(). This function shouldn't\n // be used, really, but it's pretty convenient sometimes,\n // when you just want to work with a regex.\n var set = this.set\n\n if (!set.length) {\n this.regexp = false\n return this.regexp\n }\n var options = this.options\n\n var twoStar = options.noglobstar ? star\n : options.dot ? twoStarDot\n : twoStarNoDot\n var flags = options.nocase ? 'i' : ''\n\n var re = set.map(function (pattern) {\n return pattern.map(function (p) {\n return (p === GLOBSTAR) ? twoStar\n : (typeof p === 'string') ? regExpEscape(p)\n : p._src\n }).join('\\\\\\/')\n }).join('|')\n\n // must match entire pattern\n // ending in a * or ** will make it less strict.\n re = '^(?:' + re + ')$'\n\n // can match anything, as long as it's not this.\n if (this.negate) re = '^(?!' + re + ').*$'\n\n try {\n this.regexp = new RegExp(re, flags)\n } catch (ex) {\n this.regexp = false\n }\n return this.regexp\n}\n\nminimatch.match = function (list, pattern, options) {\n options = options || {}\n var mm = new Minimatch(pattern, options)\n list = list.filter(function (f) {\n return mm.match(f)\n })\n if (mm.options.nonull && !list.length) {\n list.push(pattern)\n }\n return list\n}\n\nMinimatch.prototype.match = match\nfunction match (f, partial) {\n this.debug('match', f, this.pattern)\n // short-circuit in the case of busted things.\n // comments, etc.\n if (this.comment) return false\n if (this.empty) return f === ''\n\n if (f === '/' && partial) return true\n\n var options = this.options\n\n // windows: need to use /, not \\\n if (path.sep !== '/') {\n f = f.split(path.sep).join('/')\n }\n\n // treat the test path as a set of pathparts.\n f = f.split(slashSplit)\n this.debug(this.pattern, 'split', f)\n\n // just ONE of the pattern sets in this.set needs to match\n // in order for it to be valid. If negating, then just one\n // match means that we have failed.\n // Either way, return on the first hit.\n\n var set = this.set\n this.debug(this.pattern, 'set', set)\n\n // Find the basename of the path by looking for the last non-empty segment\n var filename\n var i\n for (i = f.length - 1; i >= 0; i--) {\n filename = f[i]\n if (filename) break\n }\n\n for (i = 0; i < set.length; i++) {\n var pattern = set[i]\n var file = f\n if (options.matchBase && pattern.length === 1) {\n file = [filename]\n }\n var hit = this.matchOne(file, pattern, partial)\n if (hit) {\n if (options.flipNegate) return true\n return !this.negate\n }\n }\n\n // didn't get any hits. this is success if it's a negative\n // pattern, failure otherwise.\n if (options.flipNegate) return false\n return this.negate\n}\n\n// set partial to true to test if, for example,\n// \"/a/b\" matches the start of \"/*/b/*/d\"\n// Partial means, if you run out of file before you run\n// out of pattern, then that's fine, as long as all\n// the parts match.\nMinimatch.prototype.matchOne = function (file, pattern, partial) {\n var options = this.options\n\n this.debug('matchOne',\n { 'this': this, file: file, pattern: pattern })\n\n this.debug('matchOne', file.length, pattern.length)\n\n for (var fi = 0,\n pi = 0,\n fl = file.length,\n pl = pattern.length\n ; (fi < fl) && (pi < pl)\n ; fi++, pi++) {\n this.debug('matchOne loop')\n var p = pattern[pi]\n var f = file[fi]\n\n this.debug(pattern, p, f)\n\n // should be impossible.\n // some invalid regexp stuff in the set.\n if (p === false) return false\n\n if (p === GLOBSTAR) {\n this.debug('GLOBSTAR', [pattern, p, f])\n\n // \"**\"\n // a/**/b/**/c would match the following:\n // a/b/x/y/z/c\n // a/x/y/z/b/c\n // a/b/x/b/x/c\n // a/b/c\n // To do this, take the rest of the pattern after\n // the **, and see if it would match the file remainder.\n // If so, return success.\n // If not, the ** \"swallows\" a segment, and try again.\n // This is recursively awful.\n //\n // a/**/b/**/c matching a/b/x/y/z/c\n // - a matches a\n // - doublestar\n // - matchOne(b/x/y/z/c, b/**/c)\n // - b matches b\n // - doublestar\n // - matchOne(x/y/z/c, c) -> no\n // - matchOne(y/z/c, c) -> no\n // - matchOne(z/c, c) -> no\n // - matchOne(c, c) yes, hit\n var fr = fi\n var pr = pi + 1\n if (pr === pl) {\n this.debug('** at the end')\n // a ** at the end will just swallow the rest.\n // We have found a match.\n // however, it will not swallow /.x, unless\n // options.dot is set.\n // . and .. are *never* matched by **, for explosively\n // exponential reasons.\n for (; fi < fl; fi++) {\n if (file[fi] === '.' || file[fi] === '..' ||\n (!options.dot && file[fi].charAt(0) === '.')) return false\n }\n return true\n }\n\n // ok, let's see if we can swallow whatever we can.\n while (fr < fl) {\n var swallowee = file[fr]\n\n this.debug('\\nglobstar while', file, fr, pattern, pr, swallowee)\n\n // XXX remove this slice. Just pass the start index.\n if (this.matchOne(file.slice(fr), pattern.slice(pr), partial)) {\n this.debug('globstar found match!', fr, fl, swallowee)\n // found a match.\n return true\n } else {\n // can't swallow \".\" or \"..\" ever.\n // can only swallow \".foo\" when explicitly asked.\n if (swallowee === '.' || swallowee === '..' ||\n (!options.dot && swallowee.charAt(0) === '.')) {\n this.debug('dot detected!', file, fr, pattern, pr)\n break\n }\n\n // ** swallows a segment, and continue.\n this.debug('globstar swallow a segment, and continue')\n fr++\n }\n }\n\n // no match was found.\n // However, in partial mode, we can't say this is necessarily over.\n // If there's more *pattern* left, then\n if (partial) {\n // ran out of file\n this.debug('\\n>>> no match, partial?', file, fr, pattern, pr)\n if (fr === fl) return true\n }\n return false\n }\n\n // something other than **\n // non-magic patterns just have to match exactly\n // patterns with magic have been turned into regexps.\n var hit\n if (typeof p === 'string') {\n if (options.nocase) {\n hit = f.toLowerCase() === p.toLowerCase()\n } else {\n hit = f === p\n }\n this.debug('string match', p, f, hit)\n } else {\n hit = f.match(p)\n this.debug('pattern match', p, f, hit)\n }\n\n if (!hit) return false\n }\n\n // Note: ending in / means that we'll get a final \"\"\n // at the end of the pattern. This can only match a\n // corresponding \"\" at the end of the file.\n // If the file ends in /, then it can only match a\n // a pattern that ends in /, unless the pattern just\n // doesn't have any more for it. But, a/b/ should *not*\n // match \"a/b/*\", even though \"\" matches against the\n // [^/]*? pattern, except in partial mode, where it might\n // simply not be reached yet.\n // However, a/b/ should still satisfy a/*\n\n // now either we fell off the end of the pattern, or we're done.\n if (fi === fl && pi === pl) {\n // ran out of pattern and filename at the same time.\n // an exact hit!\n return true\n } else if (fi === fl) {\n // ran out of file, but still had pattern left.\n // this is ok if we're doing the match as part of\n // a glob fs traversal.\n return partial\n } else if (pi === pl) {\n // ran out of pattern, still have file left.\n // this is only acceptable if we're on the very last\n // empty segment of a file with a trailing slash.\n // a/* should match a/b/\n var emptyFileEnd = (fi === fl - 1) && (file[fi] === '')\n return emptyFileEnd\n }\n\n // should be unreachable.\n throw new Error('wtf?')\n}\n\n// replace stuff like \\* with *\nfunction globUnescape (s) {\n return s.replace(/\\\\(.)/g, '$1')\n}\n\nfunction regExpEscape (s) {\n return s.replace(/[-[\\]{}()*+?.,\\\\^$|#\\s]/g, '\\\\$&')\n}\n\n},{\"brace-expansion\":11,\"path\":22}],21:[function(require,module,exports){\nvar wrappy = require('wrappy')\nmodule.exports = wrappy(once)\nmodule.exports.strict = wrappy(onceStrict)\n\nonce.proto = once(function () {\n Object.defineProperty(Function.prototype, 'once', {\n value: function () {\n return once(this)\n },\n configurable: true\n })\n\n Object.defineProperty(Function.prototype, 'onceStrict', {\n value: function () {\n return onceStrict(this)\n },\n configurable: true\n })\n})\n\nfunction once (fn) {\n var f = function () {\n if (f.called) return f.value\n f.called = true\n return f.value = fn.apply(this, arguments)\n }\n f.called = false\n return f\n}\n\nfunction onceStrict (fn) {\n var f = function () {\n if (f.called)\n throw new Error(f.onceError)\n f.called = true\n return f.value = fn.apply(this, arguments)\n }\n var name = fn.name || 'Function wrapped with `once`'\n f.onceError = name + \" shouldn't be called more than once\"\n f.called = false\n return f\n}\n\n},{\"wrappy\":29}],22:[function(require,module,exports){\n(function (process){\n// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n// resolves . and .. elements in a path array with directory names there\n// must be no slashes, empty elements, or device names (c:\\) in the array\n// (so also no leading and trailing slashes - it does not distinguish\n// relative and absolute paths)\nfunction normalizeArray(parts, allowAboveRoot) {\n // if the path tries to go above the root, `up` ends up > 0\n var up = 0;\n for (var i = parts.length - 1; i >= 0; i--) {\n var last = parts[i];\n if (last === '.') {\n parts.splice(i, 1);\n } else if (last === '..') {\n parts.splice(i, 1);\n up++;\n } else if (up) {\n parts.splice(i, 1);\n up--;\n }\n }\n\n // if the path is allowed to go above the root, restore leading ..s\n if (allowAboveRoot) {\n for (; up--; up) {\n parts.unshift('..');\n }\n }\n\n return parts;\n}\n\n// Split a filename into [root, dir, basename, ext], unix version\n// 'root' is just a slash, or nothing.\nvar splitPathRe =\n /^(\\/?|)([\\s\\S]*?)((?:\\.{1,2}|[^\\/]+?|)(\\.[^.\\/]*|))(?:[\\/]*)$/;\nvar splitPath = function(filename) {\n return splitPathRe.exec(filename).slice(1);\n};\n\n// path.resolve([from ...], to)\n// posix version\nexports.resolve = function() {\n var resolvedPath = '',\n resolvedAbsolute = false;\n\n for (var i = arguments.length - 1; i >= -1 && !resolvedAbsolute; i--) {\n var path = (i >= 0) ? arguments[i] : process.cwd();\n\n // Skip empty and invalid entries\n if (typeof path !== 'string') {\n throw new TypeError('Arguments to path.resolve must be strings');\n } else if (!path) {\n continue;\n }\n\n resolvedPath = path + '/' + resolvedPath;\n resolvedAbsolute = path.charAt(0) === '/';\n }\n\n // At this point the path should be resolved to a full absolute path, but\n // handle relative paths to be safe (might happen when process.cwd() fails)\n\n // Normalize the path\n resolvedPath = normalizeArray(filter(resolvedPath.split('/'), function(p) {\n return !!p;\n }), !resolvedAbsolute).join('/');\n\n return ((resolvedAbsolute ? '/' : '') + resolvedPath) || '.';\n};\n\n// path.normalize(path)\n// posix version\nexports.normalize = function(path) {\n var isAbsolute = exports.isAbsolute(path),\n trailingSlash = substr(path, -1) === '/';\n\n // Normalize the path\n path = normalizeArray(filter(path.split('/'), function(p) {\n return !!p;\n }), !isAbsolute).join('/');\n\n if (!path && !isAbsolute) {\n path = '.';\n }\n if (path && trailingSlash) {\n path += '/';\n }\n\n return (isAbsolute ? '/' : '') + path;\n};\n\n// posix version\nexports.isAbsolute = function(path) {\n return path.charAt(0) === '/';\n};\n\n// posix version\nexports.join = function() {\n var paths = Array.prototype.slice.call(arguments, 0);\n return exports.normalize(filter(paths, function(p, index) {\n if (typeof p !== 'string') {\n throw new TypeError('Arguments to path.join must be strings');\n }\n return p;\n }).join('/'));\n};\n\n\n// path.relative(from, to)\n// posix version\nexports.relative = function(from, to) {\n from = exports.resolve(from).substr(1);\n to = exports.resolve(to).substr(1);\n\n function trim(arr) {\n var start = 0;\n for (; start < arr.length; start++) {\n if (arr[start] !== '') break;\n }\n\n var end = arr.length - 1;\n for (; end >= 0; end--) {\n if (arr[end] !== '') break;\n }\n\n if (start > end) return [];\n return arr.slice(start, end - start + 1);\n }\n\n var fromParts = trim(from.split('/'));\n var toParts = trim(to.split('/'));\n\n var length = Math.min(fromParts.length, toParts.length);\n var samePartsLength = length;\n for (var i = 0; i < length; i++) {\n if (fromParts[i] !== toParts[i]) {\n samePartsLength = i;\n break;\n }\n }\n\n var outputParts = [];\n for (var i = samePartsLength; i < fromParts.length; i++) {\n outputParts.push('..');\n }\n\n outputParts = outputParts.concat(toParts.slice(samePartsLength));\n\n return outputParts.join('/');\n};\n\nexports.sep = '/';\nexports.delimiter = ':';\n\nexports.dirname = function(path) {\n var result = splitPath(path),\n root = result[0],\n dir = result[1];\n\n if (!root && !dir) {\n // No dirname whatsoever\n return '.';\n }\n\n if (dir) {\n // It has a dirname, strip trailing slash\n dir = dir.substr(0, dir.length - 1);\n }\n\n return root + dir;\n};\n\n\nexports.basename = function(path, ext) {\n var f = splitPath(path)[2];\n // TODO: make this comparison case-insensitive on windows?\n if (ext && f.substr(-1 * ext.length) === ext) {\n f = f.substr(0, f.length - ext.length);\n }\n return f;\n};\n\n\nexports.extname = function(path) {\n return splitPath(path)[3];\n};\n\nfunction filter (xs, f) {\n if (xs.filter) return xs.filter(f);\n var res = [];\n for (var i = 0; i < xs.length; i++) {\n if (f(xs[i], i, xs)) res.push(xs[i]);\n }\n return res;\n}\n\n// String.prototype.substr - negative index don't work in IE8\nvar substr = 'ab'.substr(-1) === 'b'\n ? function (str, start, len) { return str.substr(start, len) }\n : function (str, start, len) {\n if (start < 0) start = str.length + start;\n return str.substr(start, len);\n }\n;\n\n}).call(this,require('_process'))\n},{\"_process\":24}],23:[function(require,module,exports){\n(function (process){\n'use strict';\n\nfunction posix(path) {\n\treturn path.charAt(0) === '/';\n}\n\nfunction win32(path) {\n\t// https://github.com/nodejs/node/blob/b3fcc245fb25539909ef1d5eaa01dbf92e168633/lib/path.js#L56\n\tvar splitDeviceRe = /^([a-zA-Z]:|[\\\\\\/]{2}[^\\\\\\/]+[\\\\\\/]+[^\\\\\\/]+)?([\\\\\\/])?([\\s\\S]*?)$/;\n\tvar result = splitDeviceRe.exec(path);\n\tvar device = result[1] || '';\n\tvar isUnc = Boolean(device && device.charAt(1) !== ':');\n\n\t// UNC paths are always absolute\n\treturn Boolean(result[2] || isUnc);\n}\n\nmodule.exports = process.platform === 'win32' ? win32 : posix;\nmodule.exports.posix = posix;\nmodule.exports.win32 = win32;\n\n}).call(this,require('_process'))\n},{\"_process\":24}],24:[function(require,module,exports){\n// shim for using process in browser\nvar process = module.exports = {};\n\n// cached from whatever global is present so that test runners that stub it\n// don't break things. But we need to wrap it in a try catch in case it is\n// wrapped in strict mode code which doesn't define any globals. It's inside a\n// function because try/catches deoptimize in certain engines.\n\nvar cachedSetTimeout;\nvar cachedClearTimeout;\n\nfunction defaultSetTimout() {\n throw new Error('setTimeout has not been defined');\n}\nfunction defaultClearTimeout () {\n throw new Error('clearTimeout has not been defined');\n}\n(function () {\n try {\n if (typeof setTimeout === 'function') {\n cachedSetTimeout = setTimeout;\n } else {\n cachedSetTimeout = defaultSetTimout;\n }\n } catch (e) {\n cachedSetTimeout = defaultSetTimout;\n }\n try {\n if (typeof clearTimeout === 'function') {\n cachedClearTimeout = clearTimeout;\n } else {\n cachedClearTimeout = defaultClearTimeout;\n }\n } catch (e) {\n cachedClearTimeout = defaultClearTimeout;\n }\n} ())\nfunction runTimeout(fun) {\n if (cachedSetTimeout === setTimeout) {\n //normal enviroments in sane situations\n return setTimeout(fun, 0);\n }\n // if setTimeout wasn't available but was latter defined\n if ((cachedSetTimeout === defaultSetTimout || !cachedSetTimeout) && setTimeout) {\n cachedSetTimeout = setTimeout;\n return setTimeout(fun, 0);\n }\n try {\n // when when somebody has screwed with setTimeout but no I.E. maddness\n return cachedSetTimeout(fun, 0);\n } catch(e){\n try {\n // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally\n return cachedSetTimeout.call(null, fun, 0);\n } catch(e){\n // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error\n return cachedSetTimeout.call(this, fun, 0);\n }\n }\n\n\n}\nfunction runClearTimeout(marker) {\n if (cachedClearTimeout === clearTimeout) {\n //normal enviroments in sane situations\n return clearTimeout(marker);\n }\n // if clearTimeout wasn't available but was latter defined\n if ((cachedClearTimeout === defaultClearTimeout || !cachedClearTimeout) && clearTimeout) {\n cachedClearTimeout = clearTimeout;\n return clearTimeout(marker);\n }\n try {\n // when when somebody has screwed with setTimeout but no I.E. maddness\n return cachedClearTimeout(marker);\n } catch (e){\n try {\n // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally\n return cachedClearTimeout.call(null, marker);\n } catch (e){\n // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error.\n // Some versions of I.E. have different rules for clearTimeout vs setTimeout\n return cachedClearTimeout.call(this, marker);\n }\n }\n\n\n\n}\nvar queue = [];\nvar draining = false;\nvar currentQueue;\nvar queueIndex = -1;\n\nfunction cleanUpNextTick() {\n if (!draining || !currentQueue) {\n return;\n }\n draining = false;\n if (currentQueue.length) {\n queue = currentQueue.concat(queue);\n } else {\n queueIndex = -1;\n }\n if (queue.length) {\n drainQueue();\n }\n}\n\nfunction drainQueue() {\n if (draining) {\n return;\n }\n var timeout = runTimeout(cleanUpNextTick);\n draining = true;\n\n var len = queue.length;\n while(len) {\n currentQueue = queue;\n queue = [];\n while (++queueIndex < len) {\n if (currentQueue) {\n currentQueue[queueIndex].run();\n }\n }\n queueIndex = -1;\n len = queue.length;\n }\n currentQueue = null;\n draining = false;\n runClearTimeout(timeout);\n}\n\nprocess.nextTick = function (fun) {\n var args = new Array(arguments.length - 1);\n if (arguments.length > 1) {\n for (var i = 1; i < arguments.length; i++) {\n args[i - 1] = arguments[i];\n }\n }\n queue.push(new Item(fun, args));\n if (queue.length === 1 && !draining) {\n runTimeout(drainQueue);\n }\n};\n\n// v8 likes predictible objects\nfunction Item(fun, array) {\n this.fun = fun;\n this.array = array;\n}\nItem.prototype.run = function () {\n this.fun.apply(null, this.array);\n};\nprocess.title = 'browser';\nprocess.browser = true;\nprocess.env = {};\nprocess.argv = [];\nprocess.version = ''; // empty string to avoid regexp issues\nprocess.versions = {};\n\nfunction noop() {}\n\nprocess.on = noop;\nprocess.addListener = noop;\nprocess.once = noop;\nprocess.off = noop;\nprocess.removeListener = noop;\nprocess.removeAllListeners = noop;\nprocess.emit = noop;\nprocess.prependListener = noop;\nprocess.prependOnceListener = noop;\n\nprocess.listeners = function (name) { return [] }\n\nprocess.binding = function (name) {\n throw new Error('process.binding is not supported');\n};\n\nprocess.cwd = function () { return '/' };\nprocess.chdir = function (dir) {\n throw new Error('process.chdir is not supported');\n};\nprocess.umask = function() { return 0; };\n\n},{}],25:[function(require,module,exports){\n// Underscore.js 1.8.3\n// http://underscorejs.org\n// (c) 2009-2015 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n// Underscore may be freely distributed under the MIT license.\n\n(function() {\n\n // Baseline setup\n // --------------\n\n // Establish the root object, `window` in the browser, or `exports` on the server.\n var root = this;\n\n // Save the previous value of the `_` variable.\n var previousUnderscore = root._;\n\n // Save bytes in the minified (but not gzipped) version:\n var ArrayProto = Array.prototype, ObjProto = Object.prototype, FuncProto = Function.prototype;\n\n // Create quick reference variables for speed access to core prototypes.\n var\n push = ArrayProto.push,\n slice = ArrayProto.slice,\n toString = ObjProto.toString,\n hasOwnProperty = ObjProto.hasOwnProperty;\n\n // All **ECMAScript 5** native function implementations that we hope to use\n // are declared here.\n var\n nativeIsArray = Array.isArray,\n nativeKeys = Object.keys,\n nativeBind = FuncProto.bind,\n nativeCreate = Object.create;\n\n // Naked function reference for surrogate-prototype-swapping.\n var Ctor = function(){};\n\n // Create a safe reference to the Underscore object for use below.\n var _ = function(obj) {\n if (obj instanceof _) return obj;\n if (!(this instanceof _)) return new _(obj);\n this._wrapped = obj;\n };\n\n // Export the Underscore object for **Node.js**, with\n // backwards-compatibility for the old `require()` API. If we're in\n // the browser, add `_` as a global object.\n if (typeof exports !== 'undefined') {\n if (typeof module !== 'undefined' && module.exports) {\n exports = module.exports = _;\n }\n exports._ = _;\n } else {\n root._ = _;\n }\n\n // Current version.\n _.VERSION = '1.8.3';\n\n // Internal function that returns an efficient (for current engines) version\n // of the passed-in callback, to be repeatedly applied in other Underscore\n // functions.\n var optimizeCb = function(func, context, argCount) {\n if (context === void 0) return func;\n switch (argCount == null ? 3 : argCount) {\n case 1: return function(value) {\n return func.call(context, value);\n };\n case 2: return function(value, other) {\n return func.call(context, value, other);\n };\n case 3: return function(value, index, collection) {\n return func.call(context, value, index, collection);\n };\n case 4: return function(accumulator, value, index, collection) {\n return func.call(context, accumulator, value, index, collection);\n };\n }\n return function() {\n return func.apply(context, arguments);\n };\n };\n\n // A mostly-internal function to generate callbacks that can be applied\n // to each element in a collection, returning the desired result — either\n // identity, an arbitrary callback, a property matcher, or a property accessor.\n var cb = function(value, context, argCount) {\n if (value == null) return _.identity;\n if (_.isFunction(value)) return optimizeCb(value, context, argCount);\n if (_.isObject(value)) return _.matcher(value);\n return _.property(value);\n };\n _.iteratee = function(value, context) {\n return cb(value, context, Infinity);\n };\n\n // An internal function for creating assigner functions.\n var createAssigner = function(keysFunc, undefinedOnly) {\n return function(obj) {\n var length = arguments.length;\n if (length < 2 || obj == null) return obj;\n for (var index = 1; index < length; index++) {\n var source = arguments[index],\n keys = keysFunc(source),\n l = keys.length;\n for (var i = 0; i < l; i++) {\n var key = keys[i];\n if (!undefinedOnly || obj[key] === void 0) obj[key] = source[key];\n }\n }\n return obj;\n };\n };\n\n // An internal function for creating a new object that inherits from another.\n var baseCreate = function(prototype) {\n if (!_.isObject(prototype)) return {};\n if (nativeCreate) return nativeCreate(prototype);\n Ctor.prototype = prototype;\n var result = new Ctor;\n Ctor.prototype = null;\n return result;\n };\n\n var property = function(key) {\n return function(obj) {\n return obj == null ? void 0 : obj[key];\n };\n };\n\n // Helper for collection methods to determine whether a collection\n // should be iterated as an array or as an object\n // Related: http://people.mozilla.org/~jorendorff/es6-draft.html#sec-tolength\n // Avoids a very nasty iOS 8 JIT bug on ARM-64. #2094\n var MAX_ARRAY_INDEX = Math.pow(2, 53) - 1;\n var getLength = property('length');\n var isArrayLike = function(collection) {\n var length = getLength(collection);\n return typeof length == 'number' && length >= 0 && length <= MAX_ARRAY_INDEX;\n };\n\n // Collection Functions\n // --------------------\n\n // The cornerstone, an `each` implementation, aka `forEach`.\n // Handles raw objects in addition to array-likes. Treats all\n // sparse array-likes as if they were dense.\n _.each = _.forEach = function(obj, iteratee, context) {\n iteratee = optimizeCb(iteratee, context);\n var i, length;\n if (isArrayLike(obj)) {\n for (i = 0, length = obj.length; i < length; i++) {\n iteratee(obj[i], i, obj);\n }\n } else {\n var keys = _.keys(obj);\n for (i = 0, length = keys.length; i < length; i++) {\n iteratee(obj[keys[i]], keys[i], obj);\n }\n }\n return obj;\n };\n\n // Return the results of applying the iteratee to each element.\n _.map = _.collect = function(obj, iteratee, context) {\n iteratee = cb(iteratee, context);\n var keys = !isArrayLike(obj) && _.keys(obj),\n length = (keys || obj).length,\n results = Array(length);\n for (var index = 0; index < length; index++) {\n var currentKey = keys ? keys[index] : index;\n results[index] = iteratee(obj[currentKey], currentKey, obj);\n }\n return results;\n };\n\n // Create a reducing function iterating left or right.\n function createReduce(dir) {\n // Optimized iterator function as using arguments.length\n // in the main function will deoptimize the, see #1991.\n function iterator(obj, iteratee, memo, keys, index, length) {\n for (; index >= 0 && index < length; index += dir) {\n var currentKey = keys ? keys[index] : index;\n memo = iteratee(memo, obj[currentKey], currentKey, obj);\n }\n return memo;\n }\n\n return function(obj, iteratee, memo, context) {\n iteratee = optimizeCb(iteratee, context, 4);\n var keys = !isArrayLike(obj) && _.keys(obj),\n length = (keys || obj).length,\n index = dir > 0 ? 0 : length - 1;\n // Determine the initial value if none is provided.\n if (arguments.length < 3) {\n memo = obj[keys ? keys[index] : index];\n index += dir;\n }\n return iterator(obj, iteratee, memo, keys, index, length);\n };\n }\n\n // **Reduce** builds up a single result from a list of values, aka `inject`,\n // or `foldl`.\n _.reduce = _.foldl = _.inject = createReduce(1);\n\n // The right-associative version of reduce, also known as `foldr`.\n _.reduceRight = _.foldr = createReduce(-1);\n\n // Return the first value which passes a truth test. Aliased as `detect`.\n _.find = _.detect = function(obj, predicate, context) {\n var key;\n if (isArrayLike(obj)) {\n key = _.findIndex(obj, predicate, context);\n } else {\n key = _.findKey(obj, predicate, context);\n }\n if (key !== void 0 && key !== -1) return obj[key];\n };\n\n // Return all the elements that pass a truth test.\n // Aliased as `select`.\n _.filter = _.select = function(obj, predicate, context) {\n var results = [];\n predicate = cb(predicate, context);\n _.each(obj, function(value, index, list) {\n if (predicate(value, index, list)) results.push(value);\n });\n return results;\n };\n\n // Return all the elements for which a truth test fails.\n _.reject = function(obj, predicate, context) {\n return _.filter(obj, _.negate(cb(predicate)), context);\n };\n\n // Determine whether all of the elements match a truth test.\n // Aliased as `all`.\n _.every = _.all = function(obj, predicate, context) {\n predicate = cb(predicate, context);\n var keys = !isArrayLike(obj) && _.keys(obj),\n length = (keys || obj).length;\n for (var index = 0; index < length; index++) {\n var currentKey = keys ? keys[index] : index;\n if (!predicate(obj[currentKey], currentKey, obj)) return false;\n }\n return true;\n };\n\n // Determine if at least one element in the object matches a truth test.\n // Aliased as `any`.\n _.some = _.any = function(obj, predicate, context) {\n predicate = cb(predicate, context);\n var keys = !isArrayLike(obj) && _.keys(obj),\n length = (keys || obj).length;\n for (var index = 0; index < length; index++) {\n var currentKey = keys ? keys[index] : index;\n if (predicate(obj[currentKey], currentKey, obj)) return true;\n }\n return false;\n };\n\n // Determine if the array or object contains a given item (using `===`).\n // Aliased as `includes` and `include`.\n _.contains = _.includes = _.include = function(obj, item, fromIndex, guard) {\n if (!isArrayLike(obj)) obj = _.values(obj);\n if (typeof fromIndex != 'number' || guard) fromIndex = 0;\n return _.indexOf(obj, item, fromIndex) >= 0;\n };\n\n // Invoke a method (with arguments) on every item in a collection.\n _.invoke = function(obj, method) {\n var args = slice.call(arguments, 2);\n var isFunc = _.isFunction(method);\n return _.map(obj, function(value) {\n var func = isFunc ? method : value[method];\n return func == null ? func : func.apply(value, args);\n });\n };\n\n // Convenience version of a common use case of `map`: fetching a property.\n _.pluck = function(obj, key) {\n return _.map(obj, _.property(key));\n };\n\n // Convenience version of a common use case of `filter`: selecting only objects\n // containing specific `key:value` pairs.\n _.where = function(obj, attrs) {\n return _.filter(obj, _.matcher(attrs));\n };\n\n // Convenience version of a common use case of `find`: getting the first object\n // containing specific `key:value` pairs.\n _.findWhere = function(obj, attrs) {\n return _.find(obj, _.matcher(attrs));\n };\n\n // Return the maximum element (or element-based computation).\n _.max = function(obj, iteratee, context) {\n var result = -Infinity, lastComputed = -Infinity,\n value, computed;\n if (iteratee == null && obj != null) {\n obj = isArrayLike(obj) ? obj : _.values(obj);\n for (var i = 0, length = obj.length; i < length; i++) {\n value = obj[i];\n if (value > result) {\n result = value;\n }\n }\n } else {\n iteratee = cb(iteratee, context);\n _.each(obj, function(value, index, list) {\n computed = iteratee(value, index, list);\n if (computed > lastComputed || computed === -Infinity && result === -Infinity) {\n result = value;\n lastComputed = computed;\n }\n });\n }\n return result;\n };\n\n // Return the minimum element (or element-based computation).\n _.min = function(obj, iteratee, context) {\n var result = Infinity, lastComputed = Infinity,\n value, computed;\n if (iteratee == null && obj != null) {\n obj = isArrayLike(obj) ? obj : _.values(obj);\n for (var i = 0, length = obj.length; i < length; i++) {\n value = obj[i];\n if (value < result) {\n result = value;\n }\n }\n } else {\n iteratee = cb(iteratee, context);\n _.each(obj, function(value, index, list) {\n computed = iteratee(value, index, list);\n if (computed < lastComputed || computed === Infinity && result === Infinity) {\n result = value;\n lastComputed = computed;\n }\n });\n }\n return result;\n };\n\n // Shuffle a collection, using the modern version of the\n // [Fisher-Yates shuffle](http://en.wikipedia.org/wiki/Fisher–Yates_shuffle).\n _.shuffle = function(obj) {\n var set = isArrayLike(obj) ? obj : _.values(obj);\n var length = set.length;\n var shuffled = Array(length);\n for (var index = 0, rand; index < length; index++) {\n rand = _.random(0, index);\n if (rand !== index) shuffled[index] = shuffled[rand];\n shuffled[rand] = set[index];\n }\n return shuffled;\n };\n\n // Sample **n** random values from a collection.\n // If **n** is not specified, returns a single random element.\n // The internal `guard` argument allows it to work with `map`.\n _.sample = function(obj, n, guard) {\n if (n == null || guard) {\n if (!isArrayLike(obj)) obj = _.values(obj);\n return obj[_.random(obj.length - 1)];\n }\n return _.shuffle(obj).slice(0, Math.max(0, n));\n };\n\n // Sort the object's values by a criterion produced by an iteratee.\n _.sortBy = function(obj, iteratee, context) {\n iteratee = cb(iteratee, context);\n return _.pluck(_.map(obj, function(value, index, list) {\n return {\n value: value,\n index: index,\n criteria: iteratee(value, index, list)\n };\n }).sort(function(left, right) {\n var a = left.criteria;\n var b = right.criteria;\n if (a !== b) {\n if (a > b || a === void 0) return 1;\n if (a < b || b === void 0) return -1;\n }\n return left.index - right.index;\n }), 'value');\n };\n\n // An internal function used for aggregate \"group by\" operations.\n var group = function(behavior) {\n return function(obj, iteratee, context) {\n var result = {};\n iteratee = cb(iteratee, context);\n _.each(obj, function(value, index) {\n var key = iteratee(value, index, obj);\n behavior(result, value, key);\n });\n return result;\n };\n };\n\n // Groups the object's values by a criterion. Pass either a string attribute\n // to group by, or a function that returns the criterion.\n _.groupBy = group(function(result, value, key) {\n if (_.has(result, key)) result[key].push(value); else result[key] = [value];\n });\n\n // Indexes the object's values by a criterion, similar to `groupBy`, but for\n // when you know that your index values will be unique.\n _.indexBy = group(function(result, value, key) {\n result[key] = value;\n });\n\n // Counts instances of an object that group by a certain criterion. Pass\n // either a string attribute to count by, or a function that returns the\n // criterion.\n _.countBy = group(function(result, value, key) {\n if (_.has(result, key)) result[key]++; else result[key] = 1;\n });\n\n // Safely create a real, live array from anything iterable.\n _.toArray = function(obj) {\n if (!obj) return [];\n if (_.isArray(obj)) return slice.call(obj);\n if (isArrayLike(obj)) return _.map(obj, _.identity);\n return _.values(obj);\n };\n\n // Return the number of elements in an object.\n _.size = function(obj) {\n if (obj == null) return 0;\n return isArrayLike(obj) ? obj.length : _.keys(obj).length;\n };\n\n // Split a collection into two arrays: one whose elements all satisfy the given\n // predicate, and one whose elements all do not satisfy the predicate.\n _.partition = function(obj, predicate, context) {\n predicate = cb(predicate, context);\n var pass = [], fail = [];\n _.each(obj, function(value, key, obj) {\n (predicate(value, key, obj) ? pass : fail).push(value);\n });\n return [pass, fail];\n };\n\n // Array Functions\n // ---------------\n\n // Get the first element of an array. Passing **n** will return the first N\n // values in the array. Aliased as `head` and `take`. The **guard** check\n // allows it to work with `_.map`.\n _.first = _.head = _.take = function(array, n, guard) {\n if (array == null) return void 0;\n if (n == null || guard) return array[0];\n return _.initial(array, array.length - n);\n };\n\n // Returns everything but the last entry of the array. Especially useful on\n // the arguments object. Passing **n** will return all the values in\n // the array, excluding the last N.\n _.initial = function(array, n, guard) {\n return slice.call(array, 0, Math.max(0, array.length - (n == null || guard ? 1 : n)));\n };\n\n // Get the last element of an array. Passing **n** will return the last N\n // values in the array.\n _.last = function(array, n, guard) {\n if (array == null) return void 0;\n if (n == null || guard) return array[array.length - 1];\n return _.rest(array, Math.max(0, array.length - n));\n };\n\n // Returns everything but the first entry of the array. Aliased as `tail` and `drop`.\n // Especially useful on the arguments object. Passing an **n** will return\n // the rest N values in the array.\n _.rest = _.tail = _.drop = function(array, n, guard) {\n return slice.call(array, n == null || guard ? 1 : n);\n };\n\n // Trim out all falsy values from an array.\n _.compact = function(array) {\n return _.filter(array, _.identity);\n };\n\n // Internal implementation of a recursive `flatten` function.\n var flatten = function(input, shallow, strict, startIndex) {\n var output = [], idx = 0;\n for (var i = startIndex || 0, length = getLength(input); i < length; i++) {\n var value = input[i];\n if (isArrayLike(value) && (_.isArray(value) || _.isArguments(value))) {\n //flatten current level of array or arguments object\n if (!shallow) value = flatten(value, shallow, strict);\n var j = 0, len = value.length;\n output.length += len;\n while (j < len) {\n output[idx++] = value[j++];\n }\n } else if (!strict) {\n output[idx++] = value;\n }\n }\n return output;\n };\n\n // Flatten out an array, either recursively (by default), or just one level.\n _.flatten = function(array, shallow) {\n return flatten(array, shallow, false);\n };\n\n // Return a version of the array that does not contain the specified value(s).\n _.without = function(array) {\n return _.difference(array, slice.call(arguments, 1));\n };\n\n // Produce a duplicate-free version of the array. If the array has already\n // been sorted, you have the option of using a faster algorithm.\n // Aliased as `unique`.\n _.uniq = _.unique = function(array, isSorted, iteratee, context) {\n if (!_.isBoolean(isSorted)) {\n context = iteratee;\n iteratee = isSorted;\n isSorted = false;\n }\n if (iteratee != null) iteratee = cb(iteratee, context);\n var result = [];\n var seen = [];\n for (var i = 0, length = getLength(array); i < length; i++) {\n var value = array[i],\n computed = iteratee ? iteratee(value, i, array) : value;\n if (isSorted) {\n if (!i || seen !== computed) result.push(value);\n seen = computed;\n } else if (iteratee) {\n if (!_.contains(seen, computed)) {\n seen.push(computed);\n result.push(value);\n }\n } else if (!_.contains(result, value)) {\n result.push(value);\n }\n }\n return result;\n };\n\n // Produce an array that contains the union: each distinct element from all of\n // the passed-in arrays.\n _.union = function() {\n return _.uniq(flatten(arguments, true, true));\n };\n\n // Produce an array that contains every item shared between all the\n // passed-in arrays.\n _.intersection = function(array) {\n var result = [];\n var argsLength = arguments.length;\n for (var i = 0, length = getLength(array); i < length; i++) {\n var item = array[i];\n if (_.contains(result, item)) continue;\n for (var j = 1; j < argsLength; j++) {\n if (!_.contains(arguments[j], item)) break;\n }\n if (j === argsLength) result.push(item);\n }\n return result;\n };\n\n // Take the difference between one array and a number of other arrays.\n // Only the elements present in just the first array will remain.\n _.difference = function(array) {\n var rest = flatten(arguments, true, true, 1);\n return _.filter(array, function(value){\n return !_.contains(rest, value);\n });\n };\n\n // Zip together multiple lists into a single array -- elements that share\n // an index go together.\n _.zip = function() {\n return _.unzip(arguments);\n };\n\n // Complement of _.zip. Unzip accepts an array of arrays and groups\n // each array's elements on shared indices\n _.unzip = function(array) {\n var length = array && _.max(array, getLength).length || 0;\n var result = Array(length);\n\n for (var index = 0; index < length; index++) {\n result[index] = _.pluck(array, index);\n }\n return result;\n };\n\n // Converts lists into objects. Pass either a single array of `[key, value]`\n // pairs, or two parallel arrays of the same length -- one of keys, and one of\n // the corresponding values.\n _.object = function(list, values) {\n var result = {};\n for (var i = 0, length = getLength(list); i < length; i++) {\n if (values) {\n result[list[i]] = values[i];\n } else {\n result[list[i][0]] = list[i][1];\n }\n }\n return result;\n };\n\n // Generator function to create the findIndex and findLastIndex functions\n function createPredicateIndexFinder(dir) {\n return function(array, predicate, context) {\n predicate = cb(predicate, context);\n var length = getLength(array);\n var index = dir > 0 ? 0 : length - 1;\n for (; index >= 0 && index < length; index += dir) {\n if (predicate(array[index], index, array)) return index;\n }\n return -1;\n };\n }\n\n // Returns the first index on an array-like that passes a predicate test\n _.findIndex = createPredicateIndexFinder(1);\n _.findLastIndex = createPredicateIndexFinder(-1);\n\n // Use a comparator function to figure out the smallest index at which\n // an object should be inserted so as to maintain order. Uses binary search.\n _.sortedIndex = function(array, obj, iteratee, context) {\n iteratee = cb(iteratee, context, 1);\n var value = iteratee(obj);\n var low = 0, high = getLength(array);\n while (low < high) {\n var mid = Math.floor((low + high) / 2);\n if (iteratee(array[mid]) < value) low = mid + 1; else high = mid;\n }\n return low;\n };\n\n // Generator function to create the indexOf and lastIndexOf functions\n function createIndexFinder(dir, predicateFind, sortedIndex) {\n return function(array, item, idx) {\n var i = 0, length = getLength(array);\n if (typeof idx == 'number') {\n if (dir > 0) {\n i = idx >= 0 ? idx : Math.max(idx + length, i);\n } else {\n length = idx >= 0 ? Math.min(idx + 1, length) : idx + length + 1;\n }\n } else if (sortedIndex && idx && length) {\n idx = sortedIndex(array, item);\n return array[idx] === item ? idx : -1;\n }\n if (item !== item) {\n idx = predicateFind(slice.call(array, i, length), _.isNaN);\n return idx >= 0 ? idx + i : -1;\n }\n for (idx = dir > 0 ? i : length - 1; idx >= 0 && idx < length; idx += dir) {\n if (array[idx] === item) return idx;\n }\n return -1;\n };\n }\n\n // Return the position of the first occurrence of an item in an array,\n // or -1 if the item is not included in the array.\n // If the array is large and already in sort order, pass `true`\n // for **isSorted** to use binary search.\n _.indexOf = createIndexFinder(1, _.findIndex, _.sortedIndex);\n _.lastIndexOf = createIndexFinder(-1, _.findLastIndex);\n\n // Generate an integer Array containing an arithmetic progression. A port of\n // the native Python `range()` function. See\n // [the Python documentation](http://docs.python.org/library/functions.html#range).\n _.range = function(start, stop, step) {\n if (stop == null) {\n stop = start || 0;\n start = 0;\n }\n step = step || 1;\n\n var length = Math.max(Math.ceil((stop - start) / step), 0);\n var range = Array(length);\n\n for (var idx = 0; idx < length; idx++, start += step) {\n range[idx] = start;\n }\n\n return range;\n };\n\n // Function (ahem) Functions\n // ------------------\n\n // Determines whether to execute a function as a constructor\n // or a normal function with the provided arguments\n var executeBound = function(sourceFunc, boundFunc, context, callingContext, args) {\n if (!(callingContext instanceof boundFunc)) return sourceFunc.apply(context, args);\n var self = baseCreate(sourceFunc.prototype);\n var result = sourceFunc.apply(self, args);\n if (_.isObject(result)) return result;\n return self;\n };\n\n // Create a function bound to a given object (assigning `this`, and arguments,\n // optionally). Delegates to **ECMAScript 5**'s native `Function.bind` if\n // available.\n _.bind = function(func, context) {\n if (nativeBind && func.bind === nativeBind) return nativeBind.apply(func, slice.call(arguments, 1));\n if (!_.isFunction(func)) throw new TypeError('Bind must be called on a function');\n var args = slice.call(arguments, 2);\n var bound = function() {\n return executeBound(func, bound, context, this, args.concat(slice.call(arguments)));\n };\n return bound;\n };\n\n // Partially apply a function by creating a version that has had some of its\n // arguments pre-filled, without changing its dynamic `this` context. _ acts\n // as a placeholder, allowing any combination of arguments to be pre-filled.\n _.partial = function(func) {\n var boundArgs = slice.call(arguments, 1);\n var bound = function() {\n var position = 0, length = boundArgs.length;\n var args = Array(length);\n for (var i = 0; i < length; i++) {\n args[i] = boundArgs[i] === _ ? arguments[position++] : boundArgs[i];\n }\n while (position < arguments.length) args.push(arguments[position++]);\n return executeBound(func, bound, this, this, args);\n };\n return bound;\n };\n\n // Bind a number of an object's methods to that object. Remaining arguments\n // are the method names to be bound. Useful for ensuring that all callbacks\n // defined on an object belong to it.\n _.bindAll = function(obj) {\n var i, length = arguments.length, key;\n if (length <= 1) throw new Error('bindAll must be passed function names');\n for (i = 1; i < length; i++) {\n key = arguments[i];\n obj[key] = _.bind(obj[key], obj);\n }\n return obj;\n };\n\n // Memoize an expensive function by storing its results.\n _.memoize = function(func, hasher) {\n var memoize = function(key) {\n var cache = memoize.cache;\n var address = '' + (hasher ? hasher.apply(this, arguments) : key);\n if (!_.has(cache, address)) cache[address] = func.apply(this, arguments);\n return cache[address];\n };\n memoize.cache = {};\n return memoize;\n };\n\n // Delays a function for the given number of milliseconds, and then calls\n // it with the arguments supplied.\n _.delay = function(func, wait) {\n var args = slice.call(arguments, 2);\n return setTimeout(function(){\n return func.apply(null, args);\n }, wait);\n };\n\n // Defers a function, scheduling it to run after the current call stack has\n // cleared.\n _.defer = _.partial(_.delay, _, 1);\n\n // Returns a function, that, when invoked, will only be triggered at most once\n // during a given window of time. Normally, the throttled function will run\n // as much as it can, without ever going more than once per `wait` duration;\n // but if you'd like to disable the execution on the leading edge, pass\n // `{leading: false}`. To disable execution on the trailing edge, ditto.\n _.throttle = function(func, wait, options) {\n var context, args, result;\n var timeout = null;\n var previous = 0;\n if (!options) options = {};\n var later = function() {\n previous = options.leading === false ? 0 : _.now();\n timeout = null;\n result = func.apply(context, args);\n if (!timeout) context = args = null;\n };\n return function() {\n var now = _.now();\n if (!previous && options.leading === false) previous = now;\n var remaining = wait - (now - previous);\n context = this;\n args = arguments;\n if (remaining <= 0 || remaining > wait) {\n if (timeout) {\n clearTimeout(timeout);\n timeout = null;\n }\n previous = now;\n result = func.apply(context, args);\n if (!timeout) context = args = null;\n } else if (!timeout && options.trailing !== false) {\n timeout = setTimeout(later, remaining);\n }\n return result;\n };\n };\n\n // Returns a function, that, as long as it continues to be invoked, will not\n // be triggered. The function will be called after it stops being called for\n // N milliseconds. If `immediate` is passed, trigger the function on the\n // leading edge, instead of the trailing.\n _.debounce = function(func, wait, immediate) {\n var timeout, args, context, timestamp, result;\n\n var later = function() {\n var last = _.now() - timestamp;\n\n if (last < wait && last >= 0) {\n timeout = setTimeout(later, wait - last);\n } else {\n timeout = null;\n if (!immediate) {\n result = func.apply(context, args);\n if (!timeout) context = args = null;\n }\n }\n };\n\n return function() {\n context = this;\n args = arguments;\n timestamp = _.now();\n var callNow = immediate && !timeout;\n if (!timeout) timeout = setTimeout(later, wait);\n if (callNow) {\n result = func.apply(context, args);\n context = args = null;\n }\n\n return result;\n };\n };\n\n // Returns the first function passed as an argument to the second,\n // allowing you to adjust arguments, run code before and after, and\n // conditionally execute the original function.\n _.wrap = function(func, wrapper) {\n return _.partial(wrapper, func);\n };\n\n // Returns a negated version of the passed-in predicate.\n _.negate = function(predicate) {\n return function() {\n return !predicate.apply(this, arguments);\n };\n };\n\n // Returns a function that is the composition of a list of functions, each\n // consuming the return value of the function that follows.\n _.compose = function() {\n var args = arguments;\n var start = args.length - 1;\n return function() {\n var i = start;\n var result = args[start].apply(this, arguments);\n while (i--) result = args[i].call(this, result);\n return result;\n };\n };\n\n // Returns a function that will only be executed on and after the Nth call.\n _.after = function(times, func) {\n return function() {\n if (--times < 1) {\n return func.apply(this, arguments);\n }\n };\n };\n\n // Returns a function that will only be executed up to (but not including) the Nth call.\n _.before = function(times, func) {\n var memo;\n return function() {\n if (--times > 0) {\n memo = func.apply(this, arguments);\n }\n if (times <= 1) func = null;\n return memo;\n };\n };\n\n // Returns a function that will be executed at most one time, no matter how\n // often you call it. Useful for lazy initialization.\n _.once = _.partial(_.before, 2);\n\n // Object Functions\n // ----------------\n\n // Keys in IE < 9 that won't be iterated by `for key in ...` and thus missed.\n var hasEnumBug = !{toString: null}.propertyIsEnumerable('toString');\n var nonEnumerableProps = ['valueOf', 'isPrototypeOf', 'toString',\n 'propertyIsEnumerable', 'hasOwnProperty', 'toLocaleString'];\n\n function collectNonEnumProps(obj, keys) {\n var nonEnumIdx = nonEnumerableProps.length;\n var constructor = obj.constructor;\n var proto = (_.isFunction(constructor) && constructor.prototype) || ObjProto;\n\n // Constructor is a special case.\n var prop = 'constructor';\n if (_.has(obj, prop) && !_.contains(keys, prop)) keys.push(prop);\n\n while (nonEnumIdx--) {\n prop = nonEnumerableProps[nonEnumIdx];\n if (prop in obj && obj[prop] !== proto[prop] && !_.contains(keys, prop)) {\n keys.push(prop);\n }\n }\n }\n\n // Retrieve the names of an object's own properties.\n // Delegates to **ECMAScript 5**'s native `Object.keys`\n _.keys = function(obj) {\n if (!_.isObject(obj)) return [];\n if (nativeKeys) return nativeKeys(obj);\n var keys = [];\n for (var key in obj) if (_.has(obj, key)) keys.push(key);\n // Ahem, IE < 9.\n if (hasEnumBug) collectNonEnumProps(obj, keys);\n return keys;\n };\n\n // Retrieve all the property names of an object.\n _.allKeys = function(obj) {\n if (!_.isObject(obj)) return [];\n var keys = [];\n for (var key in obj) keys.push(key);\n // Ahem, IE < 9.\n if (hasEnumBug) collectNonEnumProps(obj, keys);\n return keys;\n };\n\n // Retrieve the values of an object's properties.\n _.values = function(obj) {\n var keys = _.keys(obj);\n var length = keys.length;\n var values = Array(length);\n for (var i = 0; i < length; i++) {\n values[i] = obj[keys[i]];\n }\n return values;\n };\n\n // Returns the results of applying the iteratee to each element of the object\n // In contrast to _.map it returns an object\n _.mapObject = function(obj, iteratee, context) {\n iteratee = cb(iteratee, context);\n var keys = _.keys(obj),\n length = keys.length,\n results = {},\n currentKey;\n for (var index = 0; index < length; index++) {\n currentKey = keys[index];\n results[currentKey] = iteratee(obj[currentKey], currentKey, obj);\n }\n return results;\n };\n\n // Convert an object into a list of `[key, value]` pairs.\n _.pairs = function(obj) {\n var keys = _.keys(obj);\n var length = keys.length;\n var pairs = Array(length);\n for (var i = 0; i < length; i++) {\n pairs[i] = [keys[i], obj[keys[i]]];\n }\n return pairs;\n };\n\n // Invert the keys and values of an object. The values must be serializable.\n _.invert = function(obj) {\n var result = {};\n var keys = _.keys(obj);\n for (var i = 0, length = keys.length; i < length; i++) {\n result[obj[keys[i]]] = keys[i];\n }\n return result;\n };\n\n // Return a sorted list of the function names available on the object.\n // Aliased as `methods`\n _.functions = _.methods = function(obj) {\n var names = [];\n for (var key in obj) {\n if (_.isFunction(obj[key])) names.push(key);\n }\n return names.sort();\n };\n\n // Extend a given object with all the properties in passed-in object(s).\n _.extend = createAssigner(_.allKeys);\n\n // Assigns a given object with all the own properties in the passed-in object(s)\n // (https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Object/assign)\n _.extendOwn = _.assign = createAssigner(_.keys);\n\n // Returns the first key on an object that passes a predicate test\n _.findKey = function(obj, predicate, context) {\n predicate = cb(predicate, context);\n var keys = _.keys(obj), key;\n for (var i = 0, length = keys.length; i < length; i++) {\n key = keys[i];\n if (predicate(obj[key], key, obj)) return key;\n }\n };\n\n // Return a copy of the object only containing the whitelisted properties.\n _.pick = function(object, oiteratee, context) {\n var result = {}, obj = object, iteratee, keys;\n if (obj == null) return result;\n if (_.isFunction(oiteratee)) {\n keys = _.allKeys(obj);\n iteratee = optimizeCb(oiteratee, context);\n } else {\n keys = flatten(arguments, false, false, 1);\n iteratee = function(value, key, obj) { return key in obj; };\n obj = Object(obj);\n }\n for (var i = 0, length = keys.length; i < length; i++) {\n var key = keys[i];\n var value = obj[key];\n if (iteratee(value, key, obj)) result[key] = value;\n }\n return result;\n };\n\n // Return a copy of the object without the blacklisted properties.\n _.omit = function(obj, iteratee, context) {\n if (_.isFunction(iteratee)) {\n iteratee = _.negate(iteratee);\n } else {\n var keys = _.map(flatten(arguments, false, false, 1), String);\n iteratee = function(value, key) {\n return !_.contains(keys, key);\n };\n }\n return _.pick(obj, iteratee, context);\n };\n\n // Fill in a given object with default properties.\n _.defaults = createAssigner(_.allKeys, true);\n\n // Creates an object that inherits from the given prototype object.\n // If additional properties are provided then they will be added to the\n // created object.\n _.create = function(prototype, props) {\n var result = baseCreate(prototype);\n if (props) _.extendOwn(result, props);\n return result;\n };\n\n // Create a (shallow-cloned) duplicate of an object.\n _.clone = function(obj) {\n if (!_.isObject(obj)) return obj;\n return _.isArray(obj) ? obj.slice() : _.extend({}, obj);\n };\n\n // Invokes interceptor with the obj, and then returns obj.\n // The primary purpose of this method is to \"tap into\" a method chain, in\n // order to perform operations on intermediate results within the chain.\n _.tap = function(obj, interceptor) {\n interceptor(obj);\n return obj;\n };\n\n // Returns whether an object has a given set of `key:value` pairs.\n _.isMatch = function(object, attrs) {\n var keys = _.keys(attrs), length = keys.length;\n if (object == null) return !length;\n var obj = Object(object);\n for (var i = 0; i < length; i++) {\n var key = keys[i];\n if (attrs[key] !== obj[key] || !(key in obj)) return false;\n }\n return true;\n };\n\n\n // Internal recursive comparison function for `isEqual`.\n var eq = function(a, b, aStack, bStack) {\n // Identical objects are equal. `0 === -0`, but they aren't identical.\n // See the [Harmony `egal` proposal](http://wiki.ecmascript.org/doku.php?id=harmony:egal).\n if (a === b) return a !== 0 || 1 / a === 1 / b;\n // A strict comparison is necessary because `null == undefined`.\n if (a == null || b == null) return a === b;\n // Unwrap any wrapped objects.\n if (a instanceof _) a = a._wrapped;\n if (b instanceof _) b = b._wrapped;\n // Compare `[[Class]]` names.\n var className = toString.call(a);\n if (className !== toString.call(b)) return false;\n switch (className) {\n // Strings, numbers, regular expressions, dates, and booleans are compared by value.\n case '[object RegExp]':\n // RegExps are coerced to strings for comparison (Note: '' + /a/i === '/a/i')\n case '[object String]':\n // Primitives and their corresponding object wrappers are equivalent; thus, `\"5\"` is\n // equivalent to `new String(\"5\")`.\n return '' + a === '' + b;\n case '[object Number]':\n // `NaN`s are equivalent, but non-reflexive.\n // Object(NaN) is equivalent to NaN\n if (+a !== +a) return +b !== +b;\n // An `egal` comparison is performed for other numeric values.\n return +a === 0 ? 1 / +a === 1 / b : +a === +b;\n case '[object Date]':\n case '[object Boolean]':\n // Coerce dates and booleans to numeric primitive values. Dates are compared by their\n // millisecond representations. Note that invalid dates with millisecond representations\n // of `NaN` are not equivalent.\n return +a === +b;\n }\n\n var areArrays = className === '[object Array]';\n if (!areArrays) {\n if (typeof a != 'object' || typeof b != 'object') return false;\n\n // Objects with different constructors are not equivalent, but `Object`s or `Array`s\n // from different frames are.\n var aCtor = a.constructor, bCtor = b.constructor;\n if (aCtor !== bCtor && !(_.isFunction(aCtor) && aCtor instanceof aCtor &&\n _.isFunction(bCtor) && bCtor instanceof bCtor)\n && ('constructor' in a && 'constructor' in b)) {\n return false;\n }\n }\n // Assume equality for cyclic structures. The algorithm for detecting cyclic\n // structures is adapted from ES 5.1 section 15.12.3, abstract operation `JO`.\n\n // Initializing stack of traversed objects.\n // It's done here since we only need them for objects and arrays comparison.\n aStack = aStack || [];\n bStack = bStack || [];\n var length = aStack.length;\n while (length--) {\n // Linear search. Performance is inversely proportional to the number of\n // unique nested structures.\n if (aStack[length] === a) return bStack[length] === b;\n }\n\n // Add the first object to the stack of traversed objects.\n aStack.push(a);\n bStack.push(b);\n\n // Recursively compare objects and arrays.\n if (areArrays) {\n // Compare array lengths to determine if a deep comparison is necessary.\n length = a.length;\n if (length !== b.length) return false;\n // Deep compare the contents, ignoring non-numeric properties.\n while (length--) {\n if (!eq(a[length], b[length], aStack, bStack)) return false;\n }\n } else {\n // Deep compare objects.\n var keys = _.keys(a), key;\n length = keys.length;\n // Ensure that both objects contain the same number of properties before comparing deep equality.\n if (_.keys(b).length !== length) return false;\n while (length--) {\n // Deep compare each member\n key = keys[length];\n if (!(_.has(b, key) && eq(a[key], b[key], aStack, bStack))) return false;\n }\n }\n // Remove the first object from the stack of traversed objects.\n aStack.pop();\n bStack.pop();\n return true;\n };\n\n // Perform a deep comparison to check if two objects are equal.\n _.isEqual = function(a, b) {\n return eq(a, b);\n };\n\n // Is a given array, string, or object empty?\n // An \"empty\" object has no enumerable own-properties.\n _.isEmpty = function(obj) {\n if (obj == null) return true;\n if (isArrayLike(obj) && (_.isArray(obj) || _.isString(obj) || _.isArguments(obj))) return obj.length === 0;\n return _.keys(obj).length === 0;\n };\n\n // Is a given value a DOM element?\n _.isElement = function(obj) {\n return !!(obj && obj.nodeType === 1);\n };\n\n // Is a given value an array?\n // Delegates to ECMA5's native Array.isArray\n _.isArray = nativeIsArray || function(obj) {\n return toString.call(obj) === '[object Array]';\n };\n\n // Is a given variable an object?\n _.isObject = function(obj) {\n var type = typeof obj;\n return type === 'function' || type === 'object' && !!obj;\n };\n\n // Add some isType methods: isArguments, isFunction, isString, isNumber, isDate, isRegExp, isError.\n _.each(['Arguments', 'Function', 'String', 'Number', 'Date', 'RegExp', 'Error'], function(name) {\n _['is' + name] = function(obj) {\n return toString.call(obj) === '[object ' + name + ']';\n };\n });\n\n // Define a fallback version of the method in browsers (ahem, IE < 9), where\n // there isn't any inspectable \"Arguments\" type.\n if (!_.isArguments(arguments)) {\n _.isArguments = function(obj) {\n return _.has(obj, 'callee');\n };\n }\n\n // Optimize `isFunction` if appropriate. Work around some typeof bugs in old v8,\n // IE 11 (#1621), and in Safari 8 (#1929).\n if (typeof /./ != 'function' && typeof Int8Array != 'object') {\n _.isFunction = function(obj) {\n return typeof obj == 'function' || false;\n };\n }\n\n // Is a given object a finite number?\n _.isFinite = function(obj) {\n return isFinite(obj) && !isNaN(parseFloat(obj));\n };\n\n // Is the given value `NaN`? (NaN is the only number which does not equal itself).\n _.isNaN = function(obj) {\n return _.isNumber(obj) && obj !== +obj;\n };\n\n // Is a given value a boolean?\n _.isBoolean = function(obj) {\n return obj === true || obj === false || toString.call(obj) === '[object Boolean]';\n };\n\n // Is a given value equal to null?\n _.isNull = function(obj) {\n return obj === null;\n };\n\n // Is a given variable undefined?\n _.isUndefined = function(obj) {\n return obj === void 0;\n };\n\n // Shortcut function for checking if an object has a given property directly\n // on itself (in other words, not on a prototype).\n _.has = function(obj, key) {\n return obj != null && hasOwnProperty.call(obj, key);\n };\n\n // Utility Functions\n // -----------------\n\n // Run Underscore.js in *noConflict* mode, returning the `_` variable to its\n // previous owner. Returns a reference to the Underscore object.\n _.noConflict = function() {\n root._ = previousUnderscore;\n return this;\n };\n\n // Keep the identity function around for default iteratees.\n _.identity = function(value) {\n return value;\n };\n\n // Predicate-generating functions. Often useful outside of Underscore.\n _.constant = function(value) {\n return function() {\n return value;\n };\n };\n\n _.noop = function(){};\n\n _.property = property;\n\n // Generates a function for a given object that returns a given property.\n _.propertyOf = function(obj) {\n return obj == null ? function(){} : function(key) {\n return obj[key];\n };\n };\n\n // Returns a predicate for checking whether an object has a given set of\n // `key:value` pairs.\n _.matcher = _.matches = function(attrs) {\n attrs = _.extendOwn({}, attrs);\n return function(obj) {\n return _.isMatch(obj, attrs);\n };\n };\n\n // Run a function **n** times.\n _.times = function(n, iteratee, context) {\n var accum = Array(Math.max(0, n));\n iteratee = optimizeCb(iteratee, context, 1);\n for (var i = 0; i < n; i++) accum[i] = iteratee(i);\n return accum;\n };\n\n // Return a random integer between min and max (inclusive).\n _.random = function(min, max) {\n if (max == null) {\n max = min;\n min = 0;\n }\n return min + Math.floor(Math.random() * (max - min + 1));\n };\n\n // A (possibly faster) way to get the current timestamp as an integer.\n _.now = Date.now || function() {\n return new Date().getTime();\n };\n\n // List of HTML entities for escaping.\n var escapeMap = {\n '&': '&',\n '<': '<',\n '>': '>',\n '\"': '"',\n \"'\": ''',\n '`': '`'\n };\n var unescapeMap = _.invert(escapeMap);\n\n // Functions for escaping and unescaping strings to/from HTML interpolation.\n var createEscaper = function(map) {\n var escaper = function(match) {\n return map[match];\n };\n // Regexes for identifying a key that needs to be escaped\n var source = '(?:' + _.keys(map).join('|') + ')';\n var testRegexp = RegExp(source);\n var replaceRegexp = RegExp(source, 'g');\n return function(string) {\n string = string == null ? '' : '' + string;\n return testRegexp.test(string) ? string.replace(replaceRegexp, escaper) : string;\n };\n };\n _.escape = createEscaper(escapeMap);\n _.unescape = createEscaper(unescapeMap);\n\n // If the value of the named `property` is a function then invoke it with the\n // `object` as context; otherwise, return it.\n _.result = function(object, property, fallback) {\n var value = object == null ? void 0 : object[property];\n if (value === void 0) {\n value = fallback;\n }\n return _.isFunction(value) ? value.call(object) : value;\n };\n\n // Generate a unique integer id (unique within the entire client session).\n // Useful for temporary DOM ids.\n var idCounter = 0;\n _.uniqueId = function(prefix) {\n var id = ++idCounter + '';\n return prefix ? prefix + id : id;\n };\n\n // By default, Underscore uses ERB-style template delimiters, change the\n // following template settings to use alternative delimiters.\n _.templateSettings = {\n evaluate : /<%([\\s\\S]+?)%>/g,\n interpolate : /<%=([\\s\\S]+?)%>/g,\n escape : /<%-([\\s\\S]+?)%>/g\n };\n\n // When customizing `templateSettings`, if you don't want to define an\n // interpolation, evaluation or escaping regex, we need one that is\n // guaranteed not to match.\n var noMatch = /(.)^/;\n\n // Certain characters need to be escaped so that they can be put into a\n // string literal.\n var escapes = {\n \"'\": \"'\",\n '\\\\': '\\\\',\n '\\r': 'r',\n '\\n': 'n',\n '\\u2028': 'u2028',\n '\\u2029': 'u2029'\n };\n\n var escaper = /\\\\|'|\\r|\\n|\\u2028|\\u2029/g;\n\n var escapeChar = function(match) {\n return '\\\\' + escapes[match];\n };\n\n // JavaScript micro-templating, similar to John Resig's implementation.\n // Underscore templating handles arbitrary delimiters, preserves whitespace,\n // and correctly escapes quotes within interpolated code.\n // NB: `oldSettings` only exists for backwards compatibility.\n _.template = function(text, settings, oldSettings) {\n if (!settings && oldSettings) settings = oldSettings;\n settings = _.defaults({}, settings, _.templateSettings);\n\n // Combine delimiters into one regular expression via alternation.\n var matcher = RegExp([\n (settings.escape || noMatch).source,\n (settings.interpolate || noMatch).source,\n (settings.evaluate || noMatch).source\n ].join('|') + '|$', 'g');\n\n // Compile the template source, escaping string literals appropriately.\n var index = 0;\n var source = \"__p+='\";\n text.replace(matcher, function(match, escape, interpolate, evaluate, offset) {\n source += text.slice(index, offset).replace(escaper, escapeChar);\n index = offset + match.length;\n\n if (escape) {\n source += \"'+\\n((__t=(\" + escape + \"))==null?'':_.escape(__t))+\\n'\";\n } else if (interpolate) {\n source += \"'+\\n((__t=(\" + interpolate + \"))==null?'':__t)+\\n'\";\n } else if (evaluate) {\n source += \"';\\n\" + evaluate + \"\\n__p+='\";\n }\n\n // Adobe VMs need the match returned to produce the correct offest.\n return match;\n });\n source += \"';\\n\";\n\n // If a variable is not specified, place data values in local scope.\n if (!settings.variable) source = 'with(obj||{}){\\n' + source + '}\\n';\n\n source = \"var __t,__p='',__j=Array.prototype.join,\" +\n \"print=function(){__p+=__j.call(arguments,'');};\\n\" +\n source + 'return __p;\\n';\n\n try {\n var render = new Function(settings.variable || 'obj', '_', source);\n } catch (e) {\n e.source = source;\n throw e;\n }\n\n var template = function(data) {\n return render.call(this, data, _);\n };\n\n // Provide the compiled source as a convenience for precompilation.\n var argument = settings.variable || 'obj';\n template.source = 'function(' + argument + '){\\n' + source + '}';\n\n return template;\n };\n\n // Add a \"chain\" function. Start chaining a wrapped Underscore object.\n _.chain = function(obj) {\n var instance = _(obj);\n instance._chain = true;\n return instance;\n };\n\n // OOP\n // ---------------\n // If Underscore is called as a function, it returns a wrapped object that\n // can be used OO-style. This wrapper holds altered versions of all the\n // underscore functions. Wrapped objects may be chained.\n\n // Helper function to continue chaining intermediate results.\n var result = function(instance, obj) {\n return instance._chain ? _(obj).chain() : obj;\n };\n\n // Add your own custom functions to the Underscore object.\n _.mixin = function(obj) {\n _.each(_.functions(obj), function(name) {\n var func = _[name] = obj[name];\n _.prototype[name] = function() {\n var args = [this._wrapped];\n push.apply(args, arguments);\n return result(this, func.apply(_, args));\n };\n });\n };\n\n // Add all of the Underscore functions to the wrapper object.\n _.mixin(_);\n\n // Add all mutator Array functions to the wrapper.\n _.each(['pop', 'push', 'reverse', 'shift', 'sort', 'splice', 'unshift'], function(name) {\n var method = ArrayProto[name];\n _.prototype[name] = function() {\n var obj = this._wrapped;\n method.apply(obj, arguments);\n if ((name === 'shift' || name === 'splice') && obj.length === 0) delete obj[0];\n return result(this, obj);\n };\n });\n\n // Add all accessor Array functions to the wrapper.\n _.each(['concat', 'join', 'slice'], function(name) {\n var method = ArrayProto[name];\n _.prototype[name] = function() {\n return result(this, method.apply(this._wrapped, arguments));\n };\n });\n\n // Extracts the result from a wrapped and chained object.\n _.prototype.value = function() {\n return this._wrapped;\n };\n\n // Provide unwrapping proxy for some methods used in engine operations\n // such as arithmetic and JSON stringification.\n _.prototype.valueOf = _.prototype.toJSON = _.prototype.value;\n\n _.prototype.toString = function() {\n return '' + this._wrapped;\n };\n\n // AMD registration happens at the end for compatibility with AMD loaders\n // that may not enforce next-turn semantics on modules. Even though general\n // practice for AMD registration is to be anonymous, underscore registers\n // as a named module because, like jQuery, it is a base library that is\n // popular enough to be bundled in a third party lib, but not be part of\n // an AMD load request. Those cases could generate an error when an\n // anonymous define() is called outside of a loader request.\n if (typeof define === 'function' && define.amd) {\n define('underscore', [], function() {\n return _;\n });\n }\n}.call(this));\n\n},{}],26:[function(require,module,exports){\narguments[4][19][0].apply(exports,arguments)\n},{\"dup\":19}],27:[function(require,module,exports){\nmodule.exports = function isBuffer(arg) {\n return arg && typeof arg === 'object'\n && typeof arg.copy === 'function'\n && typeof arg.fill === 'function'\n && typeof arg.readUInt8 === 'function';\n}\n},{}],28:[function(require,module,exports){\n(function (process,global){\n// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\nvar formatRegExp = /%[sdj%]/g;\nexports.format = function(f) {\n if (!isString(f)) {\n var objects = [];\n for (var i = 0; i < arguments.length; i++) {\n objects.push(inspect(arguments[i]));\n }\n return objects.join(' ');\n }\n\n var i = 1;\n var args = arguments;\n var len = args.length;\n var str = String(f).replace(formatRegExp, function(x) {\n if (x === '%%') return '%';\n if (i >= len) return x;\n switch (x) {\n case '%s': return String(args[i++]);\n case '%d': return Number(args[i++]);\n case '%j':\n try {\n return JSON.stringify(args[i++]);\n } catch (_) {\n return '[Circular]';\n }\n default:\n return x;\n }\n });\n for (var x = args[i]; i < len; x = args[++i]) {\n if (isNull(x) || !isObject(x)) {\n str += ' ' + x;\n } else {\n str += ' ' + inspect(x);\n }\n }\n return str;\n};\n\n\n// Mark that a method should not be used.\n// Returns a modified function which warns once by default.\n// If --no-deprecation is set, then it is a no-op.\nexports.deprecate = function(fn, msg) {\n // Allow for deprecating things in the process of starting up.\n if (isUndefined(global.process)) {\n return function() {\n return exports.deprecate(fn, msg).apply(this, arguments);\n };\n }\n\n if (process.noDeprecation === true) {\n return fn;\n }\n\n var warned = false;\n function deprecated() {\n if (!warned) {\n if (process.throwDeprecation) {\n throw new Error(msg);\n } else if (process.traceDeprecation) {\n console.trace(msg);\n } else {\n console.error(msg);\n }\n warned = true;\n }\n return fn.apply(this, arguments);\n }\n\n return deprecated;\n};\n\n\nvar debugs = {};\nvar debugEnviron;\nexports.debuglog = function(set) {\n if (isUndefined(debugEnviron))\n debugEnviron = process.env.NODE_DEBUG || '';\n set = set.toUpperCase();\n if (!debugs[set]) {\n if (new RegExp('\\\\b' + set + '\\\\b', 'i').test(debugEnviron)) {\n var pid = process.pid;\n debugs[set] = function() {\n var msg = exports.format.apply(exports, arguments);\n console.error('%s %d: %s', set, pid, msg);\n };\n } else {\n debugs[set] = function() {};\n }\n }\n return debugs[set];\n};\n\n\n/**\n * Echos the value of a value. Trys to print the value out\n * in the best way possible given the different types.\n *\n * @param {Object} obj The object to print out.\n * @param {Object} opts Optional options object that alters the output.\n */\n/* legacy: obj, showHidden, depth, colors*/\nfunction inspect(obj, opts) {\n // default options\n var ctx = {\n seen: [],\n stylize: stylizeNoColor\n };\n // legacy...\n if (arguments.length >= 3) ctx.depth = arguments[2];\n if (arguments.length >= 4) ctx.colors = arguments[3];\n if (isBoolean(opts)) {\n // legacy...\n ctx.showHidden = opts;\n } else if (opts) {\n // got an \"options\" object\n exports._extend(ctx, opts);\n }\n // set default options\n if (isUndefined(ctx.showHidden)) ctx.showHidden = false;\n if (isUndefined(ctx.depth)) ctx.depth = 2;\n if (isUndefined(ctx.colors)) ctx.colors = false;\n if (isUndefined(ctx.customInspect)) ctx.customInspect = true;\n if (ctx.colors) ctx.stylize = stylizeWithColor;\n return formatValue(ctx, obj, ctx.depth);\n}\nexports.inspect = inspect;\n\n\n// http://en.wikipedia.org/wiki/ANSI_escape_code#graphics\ninspect.colors = {\n 'bold' : [1, 22],\n 'italic' : [3, 23],\n 'underline' : [4, 24],\n 'inverse' : [7, 27],\n 'white' : [37, 39],\n 'grey' : [90, 39],\n 'black' : [30, 39],\n 'blue' : [34, 39],\n 'cyan' : [36, 39],\n 'green' : [32, 39],\n 'magenta' : [35, 39],\n 'red' : [31, 39],\n 'yellow' : [33, 39]\n};\n\n// Don't use 'blue' not visible on cmd.exe\ninspect.styles = {\n 'special': 'cyan',\n 'number': 'yellow',\n 'boolean': 'yellow',\n 'undefined': 'grey',\n 'null': 'bold',\n 'string': 'green',\n 'date': 'magenta',\n // \"name\": intentionally not styling\n 'regexp': 'red'\n};\n\n\nfunction stylizeWithColor(str, styleType) {\n var style = inspect.styles[styleType];\n\n if (style) {\n return '\\u001b[' + inspect.colors[style][0] + 'm' + str +\n '\\u001b[' + inspect.colors[style][1] + 'm';\n } else {\n return str;\n }\n}\n\n\nfunction stylizeNoColor(str, styleType) {\n return str;\n}\n\n\nfunction arrayToHash(array) {\n var hash = {};\n\n array.forEach(function(val, idx) {\n hash[val] = true;\n });\n\n return hash;\n}\n\n\nfunction formatValue(ctx, value, recurseTimes) {\n // Provide a hook for user-specified inspect functions.\n // Check that value is an object with an inspect function on it\n if (ctx.customInspect &&\n value &&\n isFunction(value.inspect) &&\n // Filter out the util module, it's inspect function is special\n value.inspect !== exports.inspect &&\n // Also filter out any prototype objects using the circular check.\n !(value.constructor && value.constructor.prototype === value)) {\n var ret = value.inspect(recurseTimes, ctx);\n if (!isString(ret)) {\n ret = formatValue(ctx, ret, recurseTimes);\n }\n return ret;\n }\n\n // Primitive types cannot have properties\n var primitive = formatPrimitive(ctx, value);\n if (primitive) {\n return primitive;\n }\n\n // Look up the keys of the object.\n var keys = Object.keys(value);\n var visibleKeys = arrayToHash(keys);\n\n if (ctx.showHidden) {\n keys = Object.getOwnPropertyNames(value);\n }\n\n // IE doesn't make error fields non-enumerable\n // http://msdn.microsoft.com/en-us/library/ie/dww52sbt(v=vs.94).aspx\n if (isError(value)\n && (keys.indexOf('message') >= 0 || keys.indexOf('description') >= 0)) {\n return formatError(value);\n }\n\n // Some type of object without properties can be shortcutted.\n if (keys.length === 0) {\n if (isFunction(value)) {\n var name = value.name ? ': ' + value.name : '';\n return ctx.stylize('[Function' + name + ']', 'special');\n }\n if (isRegExp(value)) {\n return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');\n }\n if (isDate(value)) {\n return ctx.stylize(Date.prototype.toString.call(value), 'date');\n }\n if (isError(value)) {\n return formatError(value);\n }\n }\n\n var base = '', array = false, braces = ['{', '}'];\n\n // Make Array say that they are Array\n if (isArray(value)) {\n array = true;\n braces = ['[', ']'];\n }\n\n // Make functions say that they are functions\n if (isFunction(value)) {\n var n = value.name ? ': ' + value.name : '';\n base = ' [Function' + n + ']';\n }\n\n // Make RegExps say that they are RegExps\n if (isRegExp(value)) {\n base = ' ' + RegExp.prototype.toString.call(value);\n }\n\n // Make dates with properties first say the date\n if (isDate(value)) {\n base = ' ' + Date.prototype.toUTCString.call(value);\n }\n\n // Make error with message first say the error\n if (isError(value)) {\n base = ' ' + formatError(value);\n }\n\n if (keys.length === 0 && (!array || value.length == 0)) {\n return braces[0] + base + braces[1];\n }\n\n if (recurseTimes < 0) {\n if (isRegExp(value)) {\n return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');\n } else {\n return ctx.stylize('[Object]', 'special');\n }\n }\n\n ctx.seen.push(value);\n\n var output;\n if (array) {\n output = formatArray(ctx, value, recurseTimes, visibleKeys, keys);\n } else {\n output = keys.map(function(key) {\n return formatProperty(ctx, value, recurseTimes, visibleKeys, key, array);\n });\n }\n\n ctx.seen.pop();\n\n return reduceToSingleString(output, base, braces);\n}\n\n\nfunction formatPrimitive(ctx, value) {\n if (isUndefined(value))\n return ctx.stylize('undefined', 'undefined');\n if (isString(value)) {\n var simple = '\\'' + JSON.stringify(value).replace(/^\"|\"$/g, '')\n .replace(/'/g, \"\\\\'\")\n .replace(/\\\\\"/g, '\"') + '\\'';\n return ctx.stylize(simple, 'string');\n }\n if (isNumber(value))\n return ctx.stylize('' + value, 'number');\n if (isBoolean(value))\n return ctx.stylize('' + value, 'boolean');\n // For some reason typeof null is \"object\", so special case here.\n if (isNull(value))\n return ctx.stylize('null', 'null');\n}\n\n\nfunction formatError(value) {\n return '[' + Error.prototype.toString.call(value) + ']';\n}\n\n\nfunction formatArray(ctx, value, recurseTimes, visibleKeys, keys) {\n var output = [];\n for (var i = 0, l = value.length; i < l; ++i) {\n if (hasOwnProperty(value, String(i))) {\n output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,\n String(i), true));\n } else {\n output.push('');\n }\n }\n keys.forEach(function(key) {\n if (!key.match(/^\\d+$/)) {\n output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,\n key, true));\n }\n });\n return output;\n}\n\n\nfunction formatProperty(ctx, value, recurseTimes, visibleKeys, key, array) {\n var name, str, desc;\n desc = Object.getOwnPropertyDescriptor(value, key) || { value: value[key] };\n if (desc.get) {\n if (desc.set) {\n str = ctx.stylize('[Getter/Setter]', 'special');\n } else {\n str = ctx.stylize('[Getter]', 'special');\n }\n } else {\n if (desc.set) {\n str = ctx.stylize('[Setter]', 'special');\n }\n }\n if (!hasOwnProperty(visibleKeys, key)) {\n name = '[' + key + ']';\n }\n if (!str) {\n if (ctx.seen.indexOf(desc.value) < 0) {\n if (isNull(recurseTimes)) {\n str = formatValue(ctx, desc.value, null);\n } else {\n str = formatValue(ctx, desc.value, recurseTimes - 1);\n }\n if (str.indexOf('\\n') > -1) {\n if (array) {\n str = str.split('\\n').map(function(line) {\n return ' ' + line;\n }).join('\\n').substr(2);\n } else {\n str = '\\n' + str.split('\\n').map(function(line) {\n return ' ' + line;\n }).join('\\n');\n }\n }\n } else {\n str = ctx.stylize('[Circular]', 'special');\n }\n }\n if (isUndefined(name)) {\n if (array && key.match(/^\\d+$/)) {\n return str;\n }\n name = JSON.stringify('' + key);\n if (name.match(/^\"([a-zA-Z_][a-zA-Z_0-9]*)\"$/)) {\n name = name.substr(1, name.length - 2);\n name = ctx.stylize(name, 'name');\n } else {\n name = name.replace(/'/g, \"\\\\'\")\n .replace(/\\\\\"/g, '\"')\n .replace(/(^\"|\"$)/g, \"'\");\n name = ctx.stylize(name, 'string');\n }\n }\n\n return name + ': ' + str;\n}\n\n\nfunction reduceToSingleString(output, base, braces) {\n var numLinesEst = 0;\n var length = output.reduce(function(prev, cur) {\n numLinesEst++;\n if (cur.indexOf('\\n') >= 0) numLinesEst++;\n return prev + cur.replace(/\\u001b\\[\\d\\d?m/g, '').length + 1;\n }, 0);\n\n if (length > 60) {\n return braces[0] +\n (base === '' ? '' : base + '\\n ') +\n ' ' +\n output.join(',\\n ') +\n ' ' +\n braces[1];\n }\n\n return braces[0] + base + ' ' + output.join(', ') + ' ' + braces[1];\n}\n\n\n// NOTE: These type checking functions intentionally don't use `instanceof`\n// because it is fragile and can be easily faked with `Object.create()`.\nfunction isArray(ar) {\n return Array.isArray(ar);\n}\nexports.isArray = isArray;\n\nfunction isBoolean(arg) {\n return typeof arg === 'boolean';\n}\nexports.isBoolean = isBoolean;\n\nfunction isNull(arg) {\n return arg === null;\n}\nexports.isNull = isNull;\n\nfunction isNullOrUndefined(arg) {\n return arg == null;\n}\nexports.isNullOrUndefined = isNullOrUndefined;\n\nfunction isNumber(arg) {\n return typeof arg === 'number';\n}\nexports.isNumber = isNumber;\n\nfunction isString(arg) {\n return typeof arg === 'string';\n}\nexports.isString = isString;\n\nfunction isSymbol(arg) {\n return typeof arg === 'symbol';\n}\nexports.isSymbol = isSymbol;\n\nfunction isUndefined(arg) {\n return arg === void 0;\n}\nexports.isUndefined = isUndefined;\n\nfunction isRegExp(re) {\n return isObject(re) && objectToString(re) === '[object RegExp]';\n}\nexports.isRegExp = isRegExp;\n\nfunction isObject(arg) {\n return typeof arg === 'object' && arg !== null;\n}\nexports.isObject = isObject;\n\nfunction isDate(d) {\n return isObject(d) && objectToString(d) === '[object Date]';\n}\nexports.isDate = isDate;\n\nfunction isError(e) {\n return isObject(e) &&\n (objectToString(e) === '[object Error]' || e instanceof Error);\n}\nexports.isError = isError;\n\nfunction isFunction(arg) {\n return typeof arg === 'function';\n}\nexports.isFunction = isFunction;\n\nfunction isPrimitive(arg) {\n return arg === null ||\n typeof arg === 'boolean' ||\n typeof arg === 'number' ||\n typeof arg === 'string' ||\n typeof arg === 'symbol' || // ES6 symbol\n typeof arg === 'undefined';\n}\nexports.isPrimitive = isPrimitive;\n\nexports.isBuffer = require('./support/isBuffer');\n\nfunction objectToString(o) {\n return Object.prototype.toString.call(o);\n}\n\n\nfunction pad(n) {\n return n < 10 ? '0' + n.toString(10) : n.toString(10);\n}\n\n\nvar months = ['Jan', 'Feb', 'Mar', 'Apr', 'May', 'Jun', 'Jul', 'Aug', 'Sep',\n 'Oct', 'Nov', 'Dec'];\n\n// 26 Feb 16:19:34\nfunction timestamp() {\n var d = new Date();\n var time = [pad(d.getHours()),\n pad(d.getMinutes()),\n pad(d.getSeconds())].join(':');\n return [d.getDate(), months[d.getMonth()], time].join(' ');\n}\n\n\n// log is just a thin wrapper to console.log that prepends a timestamp\nexports.log = function() {\n console.log('%s - %s', timestamp(), exports.format.apply(exports, arguments));\n};\n\n\n/**\n * Inherit the prototype methods from one constructor into another.\n *\n * The Function.prototype.inherits from lang.js rewritten as a standalone\n * function (not on Function.prototype). NOTE: If this file is to be loaded\n * during bootstrapping this function needs to be rewritten using some native\n * functions as prototype setup using normal JavaScript does not work as\n * expected during bootstrapping (see mirror.js in r114903).\n *\n * @param {function} ctor Constructor function which needs to inherit the\n * prototype.\n * @param {function} superCtor Constructor function to inherit prototype from.\n */\nexports.inherits = require('inherits');\n\nexports._extend = function(origin, add) {\n // Don't do anything if add isn't an object\n if (!add || !isObject(add)) return origin;\n\n var keys = Object.keys(add);\n var i = keys.length;\n while (i--) {\n origin[keys[i]] = add[keys[i]];\n }\n return origin;\n};\n\nfunction hasOwnProperty(obj, prop) {\n return Object.prototype.hasOwnProperty.call(obj, prop);\n}\n\n}).call(this,require('_process'),typeof global !== \"undefined\" ? global : typeof self !== \"undefined\" ? self : typeof window !== \"undefined\" ? window : {})\n},{\"./support/isBuffer\":27,\"_process\":24,\"inherits\":26}],29:[function(require,module,exports){\n// Returns a wrapper function that returns a wrapped callback\n// The wrapper function should do some stuff, and return a\n// presumably different callback function.\n// This makes sure that own properties are retained, so that\n// decorations and such are not lost along the way.\nmodule.exports = wrappy\nfunction wrappy (fn, cb) {\n if (fn && cb) return wrappy(fn)(cb)\n\n if (typeof fn !== 'function')\n throw new TypeError('need wrapper function')\n\n Object.keys(fn).forEach(function (k) {\n wrapper[k] = fn[k]\n })\n\n return wrapper\n\n function wrapper() {\n var args = new Array(arguments.length)\n for (var i = 0; i < args.length; i++) {\n args[i] = arguments[i]\n }\n var ret = fn.apply(this, args)\n var cb = args[args.length-1]\n if (typeof ret === 'function' && ret !== cb) {\n Object.keys(cb).forEach(function (k) {\n ret[k] = cb[k]\n })\n }\n return ret\n }\n}\n\n},{}]},{},[7])(7)\n});"
}
]