2-(1-hydroxy-pentyl)-cyclohexane-carboxylic acid-(1) | 5133-37-9

• 分子结构分类: 有机化合物 - 脂质和类脂质分子 - 脂肪酰基
• 英文名称: 2-(1-hydroxy-pentyl)-cyclohexane-carboxylic acid-(1)
• 英文别名: 2-(1-Hydroxy-pentyl)-cyclohexan-carbonsaeure-(1)；2-(α-Oxy-n-amyl)-cyclohexan-carbonsaeure-(1)；2-(1-Hydroxy-pentyl)-cyclohexancarbonsaeure；2-(Pentylol-(2¹))-cyclohexan-carbonsaeure-(1)；2-(α-Oxy-n-amyl)-hexahydrobenzoesaeure；Dihydrosedanolsaeure；2-(1-Hydroxypentyl)cyclohexane-1-carboxylic acid
• CAS: 5133-37-9
• 化学式: C₁₂H₂₂O₃
• 分子量: 214.305
• InChiKey: ZCKCXVLMFOCXIY-UHFFFAOYSA-N

计算性质

• 辛醇/水分配系数(LogP)：
  2.8
• 重原子数：
  15
• 可旋转键数：
  5
• 环数：
  1.0
• sp3杂化的碳原子比例：
  0.92
• 拓扑面积：
  57.5
• 氢给体数：
  2
• 氢受体数：
  3

反应信息

• 作为反应物：
  描述：

  2-(1-hydroxy-pentyl)-cyclohexane-carboxylic acid-(1) 在 乙酰氯 作用下， 生成 Butylphthalide
  参考文献：
  名称：

  Ciamician; Silber, Chemische Berichte, 1897, vol. 30, p. 1428,1429

  摘要：

  DOI：
• 作为产物：
  描述：

  alkaline earth salt of/the/ methylsulfuric acid 生成 2-(1-hydroxy-pentyl)-cyclohexane-carboxylic acid-(1)
  参考文献：
  名称：

  Murayama, Yakugaku Zasshi, 1921, # 477

  摘要：

  DOI：

文献信息

• Berlingozzi; Lupo, Gazzetta Chimica Italiana, 1927, vol. 57, p. 260
  作者：Berlingozzi、Lupo

  DOI：——

  日期：——
• The Traveling Agent Problem
  作者：Katsuhiro Moizumi、George Cybenko

  DOI：10.1007/pl00009883

  日期：2001.8

  This paper considers a sequencing problem which arises naturally in the scheduling of software agents. We are given n sites at which a certain task might be successfully performed. The probability of success is p(1) at the ith site and these probabilities are independent. Visiting site i and trying the task there requires time (or some other cost metric) t(1) whether successful or not. Latencies between sites (i) and (j) are l(ij), that is, the travel time between those two sites. Should the task be successfully completed at a site then any remaining sites do not need to be visited, The Traveling Agent Problem is to find the sequence which minimizes the expected time to complete the task. The general formulation of this problem is NP-Complete. However, if the latencies are constant we show that the problem can be solved in polynomial time by sorting the ratios t(1)/p(1) according to increasing value and visiting the sites in that order. This result then leads to an efficient algorithm when groups of sites form subnets in which latencies within a subnet are constant but can vary across subnets. We also study the case when there are deadlines for solving the problem in which case the goal is to maximize probability of success subject to satisfying the deadlines. Applications to mobile and intelligent agents are described.