[2]naphthoic acid-(3-nitro-phenyl ester)

• 分子结构分类: 有机化合物 - 苯类化合物 - 萘
• 英文名称: [2]naphthoic acid-(3-nitro-phenyl ester)
• 英文别名: [2]Naphthoesaeure-(3-nitro-phenylester)；(3-Nitrophenyl) naphthalene-2-carboxylate
• 化学式: C₁₇H₁₁NO₄
• 分子量: 293.279
• InChiKey: FNZUDZGUSFEFDU-UHFFFAOYSA-N

计算性质

• 辛醇/水分配系数(LogP)：
  4.4
• 重原子数：
  22
• 可旋转键数：
  3
• 环数：
  3.0
• sp3杂化的碳原子比例：
  0.0
• 拓扑面积：
  72.1
• 氢给体数：
  0
• 氢受体数：
  4

反应信息

• 作为反应物：
  描述：

  [2]naphthoic acid-(3-nitro-phenyl ester) 、 溴 、 溶剂黄146 生成 alkaline earth salt of/the/ methylsulfuric acid
  参考文献：
  名称：

  Singularity analysis of geometric constraint systems

  摘要：

  Singularity analysis is an important subject of the geometric constraint satisfaction problem. In this paper, three kinds of singularities are described and corresponding identification methods are presented for both under-constrained systems and over-constrained systems. Another special but common singularity for under-constrained geometric systems, pseudo-singularity, is analyzed. Pseudo-singularity is caused by a variety of constraint matching of under-constrained systems and can be removed by improving constraint distribution. To avoid pseudo-singularity and decide redundant constraints adaptively, a differentiation algorithm is proposed in the paper. Its correctness and efficiency have been validated through its practical applications in a 2D/3D geometric constraint solver CBA.

  DOI：

  10.1007/bf02947309
• 作为产物：
  描述：

  间硝基苯酚 、 2-萘甲酸 在 三氯氧磷 作用下， 生成 [2]naphthoic acid-(3-nitro-phenyl ester)
  参考文献：
  名称：

  A new algorithm for generalized optimal discriminant vectors

  摘要：

  A study has been conducted on the algorithm of solving generalized optimal set of discriminant vectors in this paper. This paper proposes an analytical algorithm of solving generalized optimal set of discriminant vectors theoretically for the first time. A lot of computation time can be saved because all the generalized optimal sets of discriminant vectors can be obtained simultaneously with the proposed algorithm, while it needs no iterative operations. The proposed algorithm can yield a much higher recognition rate. Furthermore, the proposed algorithm overcomes the shortcomings of conventional human face recognition algorithms which were effective for small sample size problems only. These statements are supported by the numerical simulation experiments on facial database of ORL.

  DOI：

  10.1007/bf02947310