其制备方法是以氯化铵为催化剂，原甲酸三乙酯为解水剂，由无水乙醇和环己酮缩合合成。
Cyclohexanone diethyl acetal was prepared from cyclohexanone with anhydrous ethanol as reactant, ammonium chloride as catalyst, triethyl orthoformate as water scavenger.
这种格式既能保证原解的大梯度变化的性质，又能节省计算时间，因而具有一定的理论与应用价值。
The scheme can keep the large gradient variation of the original solution and can also save computation time. So, it has some value in theory and application.
原问题的有效解和核心有效解的关系可以用粗糙近似来刻画。
The relationship between efficient solution and core efficient solution is described by rough approximation.
在无功优化计算中，由于严格的节点电压限制、网络拓扑的变化或无功电源的不足等多种原因可能会导致原问题不存在最优解。
In reactive power optimization, the solution infeasibility may arise due to a variety of reasons such as restrictive voltage limits, change in network topology, and shortage of reactive power sources.
本文以克氏原螯虾头为原料，利用剥除虾壳的虾头酶解制成调味料的基础原料，同时利用虾壳提取虾青素，以达到废弃物的最大化利用。
The Crayfish head has been made to basic material for condiment by hydrolyzing, and Crayfish shell has been used for the extraction of astaxanthin, which maximizes the utilization of waste.
并研究了原问题的最优解和对偶问题的最优影子价格的关系，当原问题有最优极方向时，它的最优解不一定是对偶问题的最优影子价格。
The optimal solution of the original problem was not certainly the optimal shadow price of its dual problem when the optimal extreme directions of the original problem were in existence.
此公式具有渐进强对偶的特性并且可以保证找到原问题的最优解。
This formulation possesses an asymptotic strong duality property and guarantees a success for identifying an optimum solution.
从而获得了原不可解泛函方程的解析递推表达式和一个易于实施的控制律的解析解。
Thus, the explicit recursive expression of the original unsolvable functional equation and a control law with easy implementation are obtained.
分析系统从滤波出的目标航路中向后找到弹丸击中目标时的目标位置，向后周期数为原火控系统解算出的弹飞时间除以数据周期的商。
The analytic method found the hitting target position from filtered target fairway by looking up backwards some cycles whose count was the quotient of pill flying time divided by data cycle.
然后依据对偶问题的解，以启发式方法构作原问题的可行解。
A heuristic method is then proposed to construct a feasible solution of the original problem.
利用光滑子对方程组进行正则化，从而得到原方程组的逼近解。
We will regularize the equations by the standard mollifier to get the approximate solutions.
文中着重介绍了当对偶规划问题数学模型出现重复方程时，可通过重构原规划问题的方法，求得问题的最优解。
Emphasis is given to that when repeated equations appear in the mathematical model of the duality programming problem, global optimized solution can be obtained by reconstructing the original program.
本文研究了具有边界摄动的抛物型方程。利用可解性的讨论，得到了原问题的摄动解。
In this paper, the parabolic equation with boundary perturbation is considered. Using discussion of the solvability, the perturbed solution of original problem is obtained.
然后通过调节同伦参数，对每个不同的参数用复制子等式进行求解，从而得到原二次规划模型近似解。
The approximation of the primal quadratic optimization model can be obtained by solving the regularized one and adjusting the homotopy parameter.
用该近似函数形成结构优化原问题的序列近似问题，再用约束变尺度法解近似问题。
The improved approximate expressions are proposed to create the sequential approximation problems which are solved with the constrained variable metric method.
利用一种新的模糊数排序准则，将约束条件中含有梯形模糊数的模糊线性规划转化为经典的线性规划，进而求得了原模糊线性规划的最优解。
Fuzzy linear programming with trapezoid fuzzy Numbers in restricted condition is transformed into classical linear programming by using a new ranking criterion, and an optimal solution is obtained.
在经过有限次迭代之后，可以求得原问题的最优解。
After a limited number of iterations, we can get the optimal solution of the primal problem.
利用牛顿方向和中心路径方向，获得了求解单调线性互补问题的一种内点算法，并证明该算法经过多项式次迭代之后收敛到原问题的一个最优解。
By using Newton direction and centering direction, we establish a feasible interior point algorithm for monotone linear complementarity problem and show that this method is polynomial in complexity.
采用椭球剖分策略剖分可行域为小的椭球，用投影次梯度算法解松弛二次规划问题的拉格朗日对偶问题，从而获得原问题的一个下界。
A projection subgradient algorithm for the Lagrangian dual problem of the relaxed quadratic problem is employed to general lower bounds of the optimal value for the original problem.
象轻酶解肌球蛋白一样，原肌球蛋白含有两个肽链，其构型为盘旋螺旋。
Like light meromyosin, tropomyosin contains two peptide chains in a coiled coil conformation.
提出了一种求解微分代数混合方程组的统一算法，证明了统一算法所求出的懈与原方程组的解具有等价性。
This article present an unification arithmetic for a kind of mixture equations made up of some differential and algebra equations.
INA法的基本思想是通过选择预补偿器使原系统的逆前向传递函数矩阵成为对角优势阵，从而实现各输入输出变量之间的基本解耦。
The INA's basic idea is that, through selecting pro-(compensator, ) inverse pro-transitive function matrix of previous system can be changed into diagonal preponderance matrix.
理论分析和实例研究证明，该方法能保证网络收敛于原规划的非劣解。
Theoretical analysis and case study show this method can guarantee the network to converge to non inferior solution of the multiobjective linear programming.
当介质的导热系数是温度的函数时，热传导方程是非线性偏微分方程，作者采用基尔霍夫变换把它变成拉普拉斯方程，于是可以找到原问题的近似解析解。
The nonlinear equation of heat conduction is transformed into a Laplace's equation by applying the Kirchhoff transformation, and an analytic approximate solution of the equation is derived.
因此可先在粗尺度上迭代反演，得到一个较好的参数估计，再将这个估计作为较精细尺度的初值进行反演，直至原问题的全局最优解。
So firstly to get a better estimation of parameter using iterate inversion on wide scale, then using this estimation as initial value on mini scale till to get global optimum of original problem.
以这些空间点为初始值，利用无约束优化，得到在一定值范围内的原方程组的全部精确实数解。
By taking these spatial points as initial guess, all exact real solutions within a certain range of variables are found using unrestraint optimization.
研究了复合迭代函数方程所代表的一类不变曲线的解析解，通过构造辅助方程的幂级数解，从而获得原方程的解析解。
This paper is concerned with an analytic invariant curves on a planar mapping of the iterative functional equation.
只需怨国和法国启始对于去自夜原的食品减弱抽样查抄，没有过他们道，正在失入检测解因之先，没有会限定夜原食品的入口。
Germany and France have started screening food samples. They say there will be no restrictions on Japanese food imports, however, until the test results are back.
科德还发现，有些葡萄(如赤霞珠解百纳)有助于酿造富含原花青素的葡萄酒。
Corder also found that some grapes, such as cabernet sauvignon, helped make wines that are rich in procyanidins.
最后，将原问题的减缩解映射回原空间，在保证了效率和精度的前提下得到了原系统的近似解。
After the Galerkin projection of matrices into the reduced basis space, a reduced system was obtained and can be solved efficiently. The reduced solution was obtained.
应用推荐