fill-in

英 [fɪl ɪn]

美 [fɪl ɪn]

n.  临时填补空缺的人，代替者，补充物
adj.  临时填补性的

复数：fill-ins　

英英释义

noun

• someone who takes the place of another (as when things get dangerous or difficult)
  1. the star had a stand-in for dangerous scenes
  2. we need extra employees for summer fill-ins
  Synonym:stand-insubstitutereliefrelieverbackupbackup man

双语例句

• The algorithm consists of two parts: a heuristic enclosed contour searching algorithm and a rule based depth fill-in algorithm.
  该算法由启发式封闭轮廓搜索算法和基于规则的深度填充算法两部分组成。
• The Minium Fill-in of The Join of Two Graphs
  两个图的联的最小填充数
• It shows every step of elimination of symmetric and unsymmetric construct matrix with undirected and directed graphes, and indicates the reason of processing of fill-in and long operation, The numerical relation between them is given, also.
  用无向图和有向图表示在消元过程中结构对称的和不对称的稀疏矩阵的变化，形象地说明产生填入和进行长运算的原因，并给出它们之间的定量关系。
• Reimbursement of power generation enterprise needs to change the traditional reimbursement model, around financial audit process, complete the network process management of loan application, reimbursement fill-in, leadership approval, budget control, financial approval, bank payment, automatic generation of accounting documents.
  发电企业费用报销需要变革传统财务报销模式，围绕财务审核流程，完成借款填写、报销填写、领导审批、预算控制、财务审批、银行支付、自动生成记账凭证的网络化流程管理。
• I'm only here as a fill-in while Robert's away.
  我只是在罗伯特不在时来这里临时顶替一会儿。
• The change in urban land utilization in Wuhan follows the four basic patterns and rules of leap-forward development, axial progress, circular fill-in and loop expansion with different character-istics for different periods of development.
  武汉市城市用地变迁基本上遵循了跳跃式发展、轴线推进、环状填充、圈层扩展等4种基本方式和规律，在不同阶段表现出不同的特点。
• Reductions in the Fill-in Problem for Graphs
  图的填充问题的约化
• Decomposition Theorems in Minimum Fill-in Problem for Graphs
  图的最小填充的分解定理
• In this case I used a technique called fill-in flash to lighten the face, literally filling in the shadows with light.
  在这种情况下，我使用内藏闪光灯来增加面部亮度，也就是说在阴影处填充光线。
• The minimum fill-in problem for graphs, raised from numerical analysis, is to study the optimum elimination ordering in spare matrix computations.
  在计算机教学领域，稀疏矩阵的最小填充问题由于其重要的实际意义而受重视。