基于基元操作分解的装配作业工时计算

为解决装配线基础工时数据缺乏以及工时制定复杂的问题,提出了基于基元操作分解的装配作业工时计算研究。根据装配线加工特性提出了符合装配生产实际的工时定额计算模型,针对其主要分量人工作业时间难以快速、准确地确定的问题,提出了基于基元操作分解的方法,给出了基元操作的概念和基元操作分解的原则,定义和分析了汽车部件装配线中常用的基元操作。对一组装配作业进行了分析,通过与原有定额的对比验证了方法的有效性。该方法简化了装配作业工时定额制定过程,为快速、准确制定基础工时定额提供了良好的理论模型。

Design Energy Efficient Water Utilization Systems Allowing Operation Split

This article deals with the design of energy efficient water utilization systems allowing operation split. Practical features such as operating flexibility and capital cost have made the number of sub operations an important parameter of the problem. By treating the direct and indirect heat transfers separately, target freshwater and energy consumption as well as the operation split conditions are first obtained. Subsequently, a mixed integer non-linear programming （MINLP） model is established for the design of water network and the heat exchanger network （HEN）. The proposed systematic approach is limited to a single contaminant. Example from literature is used to illustrate the applicability of the approach.

国有企业产权的审视与对策思考

从产权涵义分析出发 ,对国有企业制度的弊端进行简要分析 ,提出了国有产权有益分解与有机统一的看法及思路 ,并对实现产权分解操作制度进行了有益的探讨 ,如构建双重委托、代理关系 。

Integral Operator Solving Process of the Boundary Value Problem of Abstract Kinetic Equation with the First Kind of Critical Parameter and Generalized Periodic Boundary Conditions

In this paper the concepts of the boundary value problem of abstract kinetic equation with the first kind of critical parameter γ 0 and generalized periodic boundary conditions are introduced in a Lebesgue space which consists of functions with vector valued in a general Banach space, and then describe the solution of these abstract boundary value problem by the abstract linear integral operator of Volterra type. We call this process the integral operator solving process.

A novel two-stage Lagrangian decomposition approach for refinery production scheduling with operational transitions in mode switching

To address large scale industrial processes,a novel Lagrangian scheme is proposed to decompose a refinery scheduling problem with operational transitions in mode switching into a production subproblem and a blending and delivery subproblem.To accelerate the convergence of Lagrange multipliers,some auxiliary constraints are added in the blending and delivery subproblem.A speed-up scheme is presented to increase the efficiency for solving the production subproblem.An initialization scheme of Lagrange multipliers and a heuristic algorithm to find feasible solutions are designed.Computational results on three cases with different lengths of time horizons and different numbers of orders show that the proposed Lagrangian scheme is effective and efficient.

Optimization of Grease Properties to Prolong the Life of Lubricating Greases

Grease life refers to the time it takes for the grease to lose its ability to keep the lubrication due to grease degradation. As grease life is generally shorter than fatigue life of bearing, the service life of grease-lubricated rolling bearings is often dominated by grease life. When designing a bearing systemolecular weightith grease lubrication, it is necessary to define the operating conditions limits of the bearing, for which grease life becomes a determining factor. Prolongation of grease life becomes an especially important challenge when the bearing is to be operated trader high-speed, high-temperature, and other severe conditions. Selecting a number of commercially sold greases composed of varying base oils, the author evaluated their properties and analyzed how each property affected the grease life by performing a multiple regression analysis. The optimum grease composition to best exploit each property was also examined. The results revealed among others that one would need to first determine the base oil type and then maximize ultimate bleeding while minimizing the evaporation rate.

Design and Implementation of Image Encryption Method by Using Chaotic Mapping Based on Multi-layer Parameter Disturbance

Bit-plane decomposition makes images obtain a number of layers. According to the amount of data information, images are encrypted, and the paper proposes image encryption method with Chaotic Mapping based on multi-layer parameter disturbance. The advantage of multi-layer parameter disturbance is that it not only scrambles pixel location of images, but also changes pixel values of images. Bit-plane decomposition can increase the space of key. And using chaotic sequence generated by chaotic system with different complexities to encrypt layers with different information content can save operation time. The simulation experiments show that using chaotic mapping in image encryption method based on multi-layer parameter disturbance can cover plaintext effectively and safely, which makes it achieve ideal encryption effect.

Multiple multicontrol unitary operations: Implementation and applications

The efficient implementation of computational tasks is critical to quantum computations. In quantum circuits, multicontrol unitary operations are important components. Here, we present an extremely efficient and direct approach to multiple multicontrol unitary operations without decomposition to CNOT and single-photon gates. With the proposed approach, the necessary twophoton operations could be reduced from O(n^3) with the traditional decomposition approach to O(n), which will greatly relax the requirements and make large-scale quantum computation feasible. Moreover, we propose the potential application to the(n-k)-uniform hypergraph state.

On the Numerical Solution to a Nonlinear Wave Equation Associated with the First Painlev Equation:an Operator-Splitting Approach

The main goal of this article is to discuss the numerical solution to a nonlinear wave equation associated with the first of the celebrated Painlevd transcendent ordinary differential equations. In order to solve numerically the above equation, whose solutions blow up in finite time, the authors advocate a numerical methodology based on the Strang＇s symmetrized operator-splitting scheme. With this approach, one can decouple nonlinearity and differential operators, leading to the alternate solution at every time step of the equation as follows： （i） The first Painlevd ordinary differential equation, （ii） a linear wave equation with a constant coefficient. Assuming that the space dimension is two, the authors consider a fully discrete variant of the above scheme, where the space-time discretization of the linear wave equation sub-steps is achieved via a Galerkin/finite element space approximation combined with a second order accurate centered time discretization scheme. To handle the nonlinear sub-steps, a second order accurate centered explicit time discretization scheme with adaptively variable time step is used, in order to follow accurately the fast dynamic of the solution before it blows up. The results of numerical experiments are presented for different coefficients and boundary conditions. They show that the above methodology is robust and describes fairly accurately the evolution of a rather ＂violent＂ phenomenon.

QCD factorization semi-inclusive deep inelastic scattering diffractive deep inelastic scattering

The operator level proof of factorization theorem exhibited in [ar Xiv：hep-ph/1307.4194] is extended to the semi-inclusive deep inelastic scattering process（SIDIS）. Factorization theorem can be proved at operator level if there are not detected soft hadrons. The key point is that the initial one-nucleon state is the eigenstate of QCD.

Polynomial solutions of quasi-homogeneous partial differential equations

By means of a method of analytic number theory the following theorem is proved. Letp be a quasi-homogeneous linear partial differential operator with degreem,m > 0, w.r.t a dilation $\left\{ {\delta _\tau } \right\}{\text{ }}_{\tau< 0} $ given by ( a1, …, an). Assume that either a1, …, an are positive rational numbers or $m{\text{ = }}\sum\limits_{j = 1}^n {\alpha _j \alpha _j } $ for some $\alpha {\text{ = }}\left( {\alpha _1 ,{\text{ }} \ldots {\text{ }},\alpha _n } \right) \in l _ + ^n $ Then the dimension of the space of polynomial solutions of the equationp[u] = 0 on ?n must be infinite