ai-startup-skills
AI 제품을 만드는 스타트업을 위한 7단계 에이전트 스킬: 검증 → 비즈플랜 → 정책 → 로드쇼 → 고객 확보 → 가격 책정 → 등록
아직 감지된 업데이트가 없습니다. GitHub 릴리스가 나오면 여기에 보입니다.
개인 계정의 공개 저장소 소유자는 GitHub로 로그인해 운영자를 확인하고 소개를 직접 관리할 수 있습니다. 관리자 승인은 필요하지 않습니다.
로그인한 뒤 확인 파일을 만들어 이 저장소의 기본 브랜치에 30분 안에 커밋해 주세요. 다른 브랜치나 포크의 파일은 인정하지 않습니다. 파일을 올린 뒤 아래에서 확인하면 관리자 승인 없이 관리할 수 있습니다. 자격을 유지하려면 파일을 남겨 두세요.
로그인이 필요하면 로그인 화면으로 이동합니다. 로그인 후 이곳으로 돌아와 원하는 확인 버튼을 다시 눌러 주세요.
프로젝트 폴더에서 /nomorevibe verify를 실행하면 소유권을 확인하고 소개를 직접 관리할 수 있습니다.
1분 만에 확인하기A web app for ranking computer science departments according to their research output in selective venues, and for finding active faculty across a wide range of areas.
저장소 README에서 가져옴
README 전체를 불러오는 중입니다. 아래는 저장된 발췌입니다.
Computer Science Rankings
=========================
This ranking of top computer science schools is designed to identify institutions and faculty actively engaged in research across a number of areas of computer science. Unlike US News and World Report's approach, which is exclusively based on surveys , this ranking is entirely metrics-based. It measures the number of publications by faculty that have appeared at the most selective conferences in each area of computer science.README 전문 보기 ↗This ranking of top computer science schools is designed to identify institutions and faculty actively engaged in research across a number of areas of computer science. Unlike US News and World Report's approach, which is exclusively based on surveys, this ranking is entirely metrics-based. It measures the number of publications by faculty that have appeared at the most selective conferences in each area of computer science.
This approach is intended to be difficult to game, since publishing in such conferences is generally difficult: contrast this with other approaches like citation-based metrics, which have been repeatedly shown to be easy to manipulate. That said, incorporating citations in some form is a long-term goal.
See the FAQ for more details.
This repository contains all code and data used to build the computer science rankings website, hosted here: https://csrankings.org
Essentially all contributions should be made through the form — no clone, no CSV editing, no worrying about file format. The form validates your entry (DBLP name, homepage, Google Scholar ID, ORCID) and files an issue that is auto-processed into a PR. It supports:
0001).old/, not deleted.)NOTE: Submissions are processed on a quarterly basis, so it may take up to three months for your change to appear.
If your institution isn't yet listed, open a new institution issue first — then submit faculty through the form. Direct edits to csrankings-[a-z].csv via pull request are only for maintainers and unusual cases; see CONTRIBUTING.md. Do not edit csrankings.csv; it is auto-generated.
Because of GitHub size limits, to run this site, you will want to download the DBLP
data by running make update-dblp (note that this will consume
upwards of 19GiB of memory). To then rebuild the databases, just run
make. You can test it by running a local web server (e.g., python3 -m http.server)
and then connecting to http://0.0.0.0:8000.
You will also need to install the following dependencies:
# On Debian/Ubuntu:
apt-get install libxml2-utils npm
# Install Node.js packages:
npm install -g typescript google-closure-compiler
# Install Python packages:
python3 -m pip install -r requirements.txt
Note: Python 3.12+ is recommended. The DBLP filtering uses a streaming lxml parser for efficient memory usage.
Most contributors should use the web-based options above — no clone needed. If you do need a local copy for larger changes, a full clone of the CSrankings repository is around 400MB. To avoid downloading the full git history, you can do a shallow clone. Follow these steps:
git clone --depth 1 https://github.com/yourusername/CSrankings. This will only download
the most recent commit, not the full git history.If you want to make another contribution and some time has passed, perform steps 1-3 again, creating a fresh fork and shallow clone.
This site was developed primarily by and is maintained by Emery Berger. It incorporates extensive feedback from too many folks to mention here, including many contributors who have helped to add and maintain faculty affiliations, home pages, and so on.
This site was initially based on code and data collected by Swarat Chaudhuri (UT-Austin), though it has evolved considerably since its inception. The original faculty affiliation dataset was constructed by Papoutsaki et al.; since then, it has been extensively cleaned and updated by numerous contributors. A previous ranking also used DBLP and Brown's dataset for ranking theoretical computer science.
This site uses information from DBLP.org which is made available under the ODC Attribution License.
CSRankings is covered by the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.