relaxations

英 [ˌriːlækˈseɪʃənz]

美 [ˌrilækˈseɪʃənz]

n.  放松; 休息; 消遣; 用于放松消遣的时间; 休闲活动; 娱乐活动; (对规章制度的)放宽
relaxation的复数

双语例句

• CONCLUSION: ① The relaxations induced by genistein and 17 β-estradiol in isolated coronary rings are not related to prostaglandins and the conventional estrogen receptor as well as the genomic pathways.
  结论：①染料木素和17β-雌二醇对冠状动脉血管的舒张作用与前列腺素类物质的合成和血管壁传统雌激素受体无关，与雌激素经典核内作用途径无关。
• From the theoretical values of relaxation time based on the models, it was found that the multifarious polarization mechanisms contributed mainly to the present dielectric relaxations.
  对弛豫时间的计算结果发现，该弛豫是由多种极化机制参与、界面极化为支配的动力学过程。
• Rather, more mainland money will flow across the border, following relaxations on overseas equity investments and the$ 200bn-plus pot of foreign reserves earmarked for higher-yielding assets.
  相反，由于内地放宽了对海外股票投资的限制，加之逾2000亿美元外汇储备留作了投资更高收益资产的专项资金，更多内地资金将流向香港。
• MKL methods. ( 4) The clustering algorithm with SDP relaxations is studied.
  研究了半定规划松弛的聚类算法。
• He plays the piano for relaxation. It's one of his favorite relaxations.
  他弹钢琴来放松一下，这是他最喜爱的。
• The free and random dielectric relaxations
  自由和随机介电弛豫
• The influence of initial degree relaxations on the responses is analysed with some useful results.
  分析了初始弛度对响应的影响，得到了一些有益的结果。
• The first and second nearest-neighbour relaxations for Al are found to be ( 1.61,-0.32), expressed in percentage of normal distances. The positive sign indicates relaxation toward the vacancy and the negative sign indicates relaxation away from the vacancy.
  首先求得铝中空位的第一和第二最近邻的位移百分率各为1.61和-0.32，这里的正号和负号各表示向空位移进和移出。
• An Optimization Model for Two-echelon Distribution Network Design in Supply Chain Based on Bi-level Programming; 1. A tight semidefinite relaxation of the quadratically constrained quadratic-11 optimization problem is obtained, which improves several previous SDP relaxations in the literature.
  基于双层规划的供应链二级分销网络优化设计模型1.提出了{-1，1}二次约束二次整数规划的强化半定规划松弛模型。
• The upper bounds are computed with the outer approximation method where Lagrangian relaxations are solved with the maximum-flow algorithm.
  用外逼近法求拉格朗日对偶问题得到上界，其中拉格朗日松弛问题通过转化为一个网络最大流问题来求解。