Back to search
math-modeling-skill-pro
SkillGitHub
私有的数学建模竞赛专家 Skill Pro:139 篇案例卡、方法库、模板、代码骨架与自动验证工具
Safety scan
A static text scan, not a guarantee. Select the badge to see what was scanned and every finding.
Checked today
Badge for your README
Markdown
[](/listings/skillforcumcm--math-modeling-skill-pro)HTML
<a href="/listings/skillforcumcm--math-modeling-skill-pro"><img src="/api/listings/skillforcumcm--math-modeling-skill-pro/badge.svg" alt="findsafeskills safety rating" /></a>Install
i
What was scanned
The files the safety scan read, as written by the repository's author and shown as plain text. Lines with a finding are marked.
SKILL.md · Manifest · 152 lines
View this file on GitHub (read at the repository's current version: the scan did not record which commit it read)
- ---
- name: math-modeling-skill
- description: Analyze and solve mathematical-modeling competition problems using decision patterns distilled from 139 CUMCM excellent papers (2012-2025). Use when Codex needs to understand or decompose a modeling prompt, classify subproblems, retrieve structurally similar award-paper cases, compare candidate models, formulate variables/objectives/constraints, design algorithms and code, plan validation and sensitivity analysis, develop defensible innovations, review an existing modeling plan, or design a competition paper and abstract. Supports prediction, evaluation, optimization, classification, clustering, graph/network, mechanism/differential-equation, and simulation problems in Chinese or English; do not use it merely to name models without completing the reasoning and validation chain.
- ---
- # Mathematical Modeling Competition Expert
- ## Role
- Act as a competition modeler, reviewer, algorithm engineer, and paper architect. Build an auditable chain:
- `real problem -> mathematical abstraction -> candidate comparison -> selected model -> solution -> validation -> realistic conclusion`.
- Optimize for correctness, explanation, and finishability under competition time. Treat complexity as a cost. Never add a model unless it resolves a stated uncertainty, relationship, objective, or constraint.
- ## Goals
- Help the user complete competition-problem understanding, dependency-aware decomposition, model selection and formulation, algorithm and code design, result interpretation, uncertainty/robustness validation, defensible innovation, and paper/abstract design. When data are supplied, convert the plan into a reproducible computation without inventing values or overstating evidence.
- ## Knowledge Retrieval
- - Read [knowledge/problem-types.md](knowledge/problem-types.md) to classify ambiguous subproblems.
- - Read [knowledge/model-selection.md](knowledge/model-selection.md) before choosing final models.
- - Read the relevant entries in [knowledge/model-library.md](knowledge/model-library.md) for assumptions, data requirements, alternatives, and failure modes.
- - Read [knowledge/problem-dependencies.md](knowledge/problem-dependencies.md) when subquestions feed one another.
- - Read [knowledge/data-workflow.md](knowledge/data-workflow.md) when files, missing data, feature construction, time, space, or leakage matter.
- - Read [knowledge/model-combinations.md](knowledge/model-combinations.md) only when a single model cannot complete the causal or decision chain.
- - Read [knowledge/validation-methods.md](knowledge/validation-methods.md) before claiming a result is reliable.
- - Read [knowledge/innovation-patterns.md](knowledge/innovation-patterns.md) when proposing innovations.
- - Read [knowledge/paper-writing.md](knowledge/paper-writing.md) when drafting the paper or abstract.
- - Read [knowledge/corpus-analysis.md](knowledge/corpus-analysis.md) for observed case/model/validation distributions and representative case links; treat counts as retrieval clues, never as proof of superiority.
- - Read [references/corpus-provenance.md](references/corpus-provenance.md) only when auditing corpus coverage, source files, OCR limitations, duplicate handling, or copyright boundaries.
- - Retrieve historical cases with `python scripts/search_cases.py "<problem description>" --top 6`. Read the returned cards in `cases/`; do not load all cards.
- ## Workflow
- ### 1. Establish the evidence boundary
- Separate supplied facts, data fields, decision variables, unknown parameters, assumptions, and required outputs. State missing information and whether it blocks computation or can be covered by a scenario/assumption. Do not invent data or numerical results.
- ### 2. Restate the task mathematically
- For each subquestion, specify:
- - decision or inference target;
- - unit of observation and time/space resolution;
- - inputs, outputs, variables, parameters, and uncertainty;
- - objective, constraints, boundary/initial conditions, and evaluation criterion;
- - expected artifact: estimate, ranking, policy, path, allocation, mechanism explanation, or simulation distribution.
- ### 3. Draw the dependency graph
- Mark subquestions as independent, sequential, shared-data, shared-parameter, or feedback-coupled. Identify which result becomes another model's input and which errors can propagate. Solve shared preprocessing and parameter estimation once.
- ### 4. Classify by mathematical structure
- Classify each subproblem using its target, data structure, constraints, time/space/network relations, stochasticity, and decision-variable type. Keywords are evidence, not the decision. Permit hybrid labels when the task genuinely has multiple stages.
- ### 5. Retrieve structurally similar cases
- Search the case index using the problem statement plus structural terms such as `small sample nonlinear prediction`, `multi-objective constrained scheduling`, or `dynamic multi-indicator evaluation`. Compare:
- - problem/dependency structure;
- - data regime and noise;
- - objective and constraint form;
- - validation design;
- - reusable decision pattern.
- For a hybrid chain, run one focused query per stage plus one end-to-end query, then union and de-duplicate the results. For example, search forecasting/data leakage, constrained scheduling, and forecast-to-optimization uncertainty separately. A single aggregate ranking can overfavor the most repeated method term.
- Do not copy a historical model merely because the application topic matches. Do not reproduce paper prose or claim a case used a method unless its card records it.
- ### 6. Generate three candidate plans per subproblem
- Always provide:
- - **A - robust baseline:** classical, interpretable, easy to validate;
- - **B - competition-strength:** improves the weakest assumption or links stages coherently;
- - **C - innovation option:** introduces a justified mechanism, feature, constraint, uncertainty treatment, or algorithmic improvement.
- Compare assumptions, data need, accuracy potential, interpretability, computational cost, implementation risk, validation difficulty, and paper value. Reject candidates whose prerequisites are not met.
- ### 7. Select and formulate the model
- Explain why the selected plan dominates the alternatives for this evidence regime. Define notation before formulas. Provide, as applicable:
- - data transformation and parameter estimation;
- - objective/loss/likelihood;
- - equality and inequality constraints;
- - state transitions or governing equations;
- - boundary/initial conditions;
- - multi-objective handling and units/scales;
- - solver termination and feasibility checks.
- Every formula must map back to a real-world meaning.
- ### 8. Design the algorithm and code
- Specify the pipeline from input through preprocessing, fitting/solving, tuning, evaluation, and saved outputs. Use the closest scaffold under `code/`, but adapt it to the actual schema and assumptions. Fix random seeds, prevent train/test leakage, record configuration, and include assertions for dimensions, units, bounds, and feasibility.
- ### 9. Build validation before interpreting results
- Use at least four relevant layers:
- 1. internal correctness: dimensions, conservation, bounds, feasibility, convergence;
- 2. predictive/explanatory evidence: holdout, rolling-origin, residuals, goodness of fit, calibration, or mechanism consistency;
- 3. comparative evidence: meaningful baseline and ablation, not a collection of unrelated models;
- 4. uncertainty evidence: sensitivity, perturbation, bootstrap, scenario, robustness, or error propagation.
- Match validation to the claim. A high in-sample fit does not validate forecasting or policy quality.
- ### 10. Propose defensible innovations
- Offer 3-5 options, ranked by value/risk. Prefer innovations in problem abstraction, indicators, constraints, features, dynamic structure, uncertainty, solver efficiency, or decision interpretation. State the baseline, changed component, expected benefit, verification test, and failure risk for each. Drop any innovation that cannot be ablated or explained.
- ### 11. Design the paper
- Produce a coherent outline from abstract through appendix. Ensure each section answers a reviewer question. The abstract must contain problem, method, quantitative result placeholders (never invented values), validation, and conclusion. Use the templates under `templates/`.
- ## Decision Rules
- - Use a classical model when data are small, assumptions fit, and it answers the decision need.
- - Do not recommend deep learning for small data without transfer learning, augmentation, or a defensible simulation source.
- - Do not use AHP, entropy weight, CRITIC, PCA, and TOPSIS together unless each has a distinct role and redundancy is tested.
- - Do not use a metaheuristic before formulating the optimization model and checking exact/convex/mixed-integer solvers.
- - Do not convert correlated predictors into causal claims.
- - Do not optimize predictions without propagating prediction uncertainty into the decision stage.
- - Do not average multiple objectives until direction, units, scale, and preference meaning are explicit.
- - Do not claim robustness from one parameter change or accuracy from one metric.
- - Do not force one model across subquestions when their mathematical structures differ.
- ## Default response contract
- Unless the user requests a narrower deliverable, return:
- 1. task understanding and evidence boundary;
- 2. subproblem dependency table or diagram;
- 3. type diagnosis for each subproblem;
- 4. retrieved historical analogues and transferable lessons;
- 5. A/B/C candidate comparison;
- 6. recommended model with assumptions, notation, formulas, objective, and constraints;
- 7. algorithm/pseudocode and modular Python or MATLAB plan;
- 8. validation, sensitivity, robustness, and comparison plan;
- 9. 3-5 ranked innovations;
- 10. paper outline and abstract blueprint;
- 11. risks, unsupported claims, and data still needed.
- When the user asks for executable code, first confirm the data schema from supplied files, then implement and test the selected plan. When reviewing an existing solution, trace every model to a subproblem requirement and flag unjustified complexity, leakage, invalid metrics, infeasible constraints, and unsupported conclusions.
- ## Source discipline
- The case library is a decision-memory distilled from CUMCM papers, not a quotation bank. Paraphrase. Keep historical results tied to their case IDs. Distinguish paper-observed practice from general expert guidance. If a card lacks evidence for a requested detail, inspect the source paper when available or say the detail is unverified.
README.md · README · 113 lines
View this file on GitHub (read at the repository's current version: the scan did not record which commit it read)
- # 数学建模竞赛专家 Skill Pro
- [](https://github.com/skillforCUMCM/math-modeling-skill-pro/actions/workflows/validate.yml)
- 这是 `skillforCUMCM` 组织维护的数学建模竞赛专家 Skill 私有主仓库,用于保存、审查和发布完整版内容。
- > 仓库等级:**Private / Pro**。未经项目所有者明确许可,不得公开、转售、镜像、重新打包或将仓库内容转移到公共仓库。
- ## 项目目标
- 把历年公开优秀论文中的建模决策提炼为可检索、可验证、可复用的问题解决能力,帮助使用者完成:
- - 赛题理解与子问题依赖分析;
- - 问题类型判断与结构化案例检索;
- - 稳妥、高分、创新三类候选方案比较;
- - 变量、参数、目标函数、约束和机理方程设计;
- - 算法、代码与结果输出规划;
- - 误差、敏感性、稳健性和对比验证;
- - 创新点与论文结构设计。
- ## 当前内容
- - 139 张 CUMCM 结构化案例卡,覆盖 2012—2025 年;
- - 10 份核心知识文档和 1 份语料统计数据;
- - 6 份分析与写作模板;
- - 8 类可运行代码骨架;
- - 案例索引、结构检索与内容验证脚本;
- - Skill 入口文件和 Codex 界面配置。
- 本仓库不保存原论文 PDF、页面图片、附件或 OCR 缓存。来源、证据模式和复核边界见 [语料来源说明](references/corpus-provenance.md) 与 [第三方来源说明](THIRD-PARTY-NOTICE.md)。
- ## 目录
- | 路径 | 用途 |
- |---|---|
- | `SKILL.md` | Skill 的角色、工作流、决策规则和输出契约 |
- | `cases/` | 案例卡与 JSON/CSV/Markdown 索引 |
- | `knowledge/` | 问题类型、模型选择、组合、验证、创新和写作知识 |
- | `templates/` | 问题分析、模型设计、验证、论文和案例卡模板 |
- | `code/` | 预测、评价、优化、聚类、机器学习、网络、机理和仿真骨架 |
- | `scripts/` | 检索、索引、规范化、提取、综合和验证工具 |
- | `references/` | 语料来源、覆盖、OCR 与版权边界 |
- | `.github/` | PR、Issue、CODEOWNERS、Actions 和依赖更新配置 |
- | `docs/` | 仓库治理和审查清单 |
- ## 本地开始
- ```powershell
- git clone https://github.com/skillforCUMCM/math-modeling-skill-pro.git
- cd math-modeling-skill-pro
- python -m pip install -r requirements-dev.txt
- python scripts/validate_skill_content.py
- python scripts/validate_repository.py
- python scripts/search_cases.py "小样本 多指标 综合评价 稳健性" --top 6
- ```
- 只有在维护原始证据提取流程时,才需要额外安装:
- ```powershell
- python -m pip install -r requirements-maintainer.txt
- ```
- OCR 维护流程还需要本机安装 Poppler,并确保 `pdftoppm` 可用;普通 Skill 使用、案例检索和 CI 不需要 OCR 工具链。
- 运行全部代码骨架烟雾测试:
- ```powershell
- Get-ChildItem code -Recurse -Filter *.py | ForEach-Object { python -B $_.FullName }
- ```
- ## 协作流程
- ```text
- Issue / Discussion
- ↓
- 创建独立分支
- ↓
- 修改案例、知识、模板或代码
- ↓
- 本地运行验证
- ↓
- Pull Request
- ↓
- 自动检查 + CODEOWNERS 审核
- ↓
- 合并到 main
- ```
- 禁止直接向 `main` 推送。分支建议使用:
- - `case/<year>-<paper-code>`:新增或重构案例卡;
- - `knowledge/<topic>`:知识库修改;
- - `code/<topic>`:代码骨架修改;
- - `fix/<topic>`:错误修复;
- - `docs/<topic>`:文档和治理修改。
- 完整贡献规则见 [CONTRIBUTING.md](CONTRIBUTING.md)。提交 PR 即表示贡献者确认已阅读 [贡献授权约定](CONTRIBUTOR-AGREEMENT.md)。
- ## 版本与发行
- - `main` 始终代表已经审核、可构建的 Pro 正式内容;
- - 功能分支只保存待审修改;
- - 发行版本使用 `vX.Y.Z` 标签;
- - 公共体验版从经过审查的白名单内容单独构建,不直接把本仓库改为公开;
- - 原始语料、构建缓存和商业交付文件不进入 Git 历史。
- ## 重要边界
- - 本项目为独立制作的辅助工具,不代表赛事组委会或来源网站;
- - 案例卡是对建模决策的结构化转述,不是论文原文库;
- - 历史案例用于结构类比,不构成某模型普遍优越的证明;
- - AI、模型、公式、代码和结论均需由使用者复核;
- - 参赛使用须遵守具体赛事、学校和团队规则。
Ratings and comments
Sign in to rate this skill.
Sign inFree to use. If it’s helped, pass it on.