5-Hydroxy-3-oxo-2-methyl-cyclopenten-(1)-carbonsaeure-(1) | 785809-11-2

• 分子结构分类: 有机化合物 - 有机酸及其衍生物 - 羟基酸及其衍生物
• 英文名称: 5-Hydroxy-3-oxo-2-methyl-cyclopenten-(1)-carbonsaeure-(1)
• 英文别名: 5-hydroxy-2-methyl-3-oxo-cyclopent-1-enecarboxylic acid；5-Hydroxy-2-methyl-3-oxo-cyclopent-1-encarbonsaeure；5-Hydroxy-2-methyl-3-oxocyclopentene-1-carboxylic acid；5-hydroxy-2-methyl-3-oxocyclopentene-1-carboxylic acid
• CAS: 785809-11-2
• 化学式: C₇H₈O₄
• 分子量: 156.138
• InChiKey: PCLZFXCQYQOXSZ-UHFFFAOYSA-N

计算性质

• 辛醇/水分配系数(LogP)：
  -0.4
• 重原子数：
  11
• 可旋转键数：
  1
• 环数：
  1.0
• sp3杂化的碳原子比例：
  0.43
• 拓扑面积：
  74.6
• 氢给体数：
  2
• 氢受体数：
  4

反应信息

• 作为反应物：
  描述：

  5-Hydroxy-3-oxo-2-methyl-cyclopenten-(1)-carbonsaeure-(1) 在 氯化亚砜 、 溶剂黄146 、 锌 作用下， 生成 2-甲基-3-氧代-环戊烯-1-羧酸甲酯
  参考文献：
  名称：

  �ber ?1,2-2-Methyl-3-oxo-5-oxy-cyclopenten-1-carbons�ure

  摘要：

  DOI：

  10.1002/hlca.19470300725
• 作为产物：
  描述：

  alkaline earth salt of/the/ methylsulfuric acid 在 barium dihydroxide 、 水 作用下， 生成 5-Hydroxy-3-oxo-2-methyl-cyclopenten-(1)-carbonsaeure-(1)
  参考文献：
  名称：

  oodOPT: A semantics-based concurrency control framework for fully-replicated architecture

  摘要：

  Concurrency control has always been one of the most important issues in the design of synchronous groupware systems with fully-replicated architecture. An ideal strategy should be able to support natural and flexible human-to-computer and human-to-human interactions while maintaining the consistency of the system. This paper summarizes previous researches on this topic and points out the deficiencies of the existing results. A novel semantics-based concurrency control framework, oodOPT, is proposed. The main idea of the framework is to resolve conflicts by utilizing semantics of the operations and the accessed data objects. With this approach, complexities in concurrency control are shifted completely from application developers to the framework. Conflicts among operations on objects with different semantics and the strategies resolving these conflicts are analyzed. After describing the algorithm in full detail, the discussion ends up with a comparison with other related work and some considerations for open problems.

  DOI：

  10.1007/bf02943237