玻纤对二灰碎石基层的力学性能影响试验

玻璃纤维掺入到二灰碎石基层中，对其强度和刚度进行试验。结果表明，掺量一定时，玻纤可提高二灰碎石半刚性基层的强度，随着玻纤掺量的增加．其刚度则有所降低。另外，玻璃纤维还可有效改善二灰碎石基层的韧性。     

Theoretical method for estimation of mean pressure on contact area between rolling tools and workpiece in cross wedge rolling processes

The paper gives a new method no determine the mean unit contact pressures on a material—tool contact surface in cross wedge rolling processes (CWR). The dependencies worked out on the basis of the energy and the upper bound methods permits rolling forces to be determined which are comparable to experimentally measured ones. The analysis provides equations which relate the mean contact pressure q_m to the basic process parameters, namely the forming angle α, the spreading angle β, the relative reduction of a portion δ and the shear friction factors m and m_k.     

Upper Bound Analysis of Turning Using Sharp Corner Tools

A generalized upper bound model of turning operations using flat-faced sharp corner tools with both the side and end cutting edges engaged in cutting is described. The projection of the uncut chip area on the rake face plane is divided into a few regions separated by lines parallel to the chip flow direction at transition points. The area of each of these regions is transformed to the area of the corresponding regions of the shear surface using the ratio of the shear speed to the chip speed. Summing up the area of these regions, the total shear surface area is obtained. The tool-chip contact length at vertices is obtained from the length along the shear surface using the similarity between orthogonal and oblique cutting in the “equivalent” plane (the plane formed by the cutting velocity and chip velocity). Knowing the tool-chip contact length, the friction area is calculated. The chip flow angle and chip speed are obtained by minimizing the cutting power with respect to both these variables. Comparison of the chip flow angle predicted by the current model with the chip flow angle measured by direct high speed photography of the chip motion over the tool rake face shows good correlation between the two for various tool geometries and cutting conditions. The shape of the shear surface and the chip cross section predicted by the model are also presented.     

A fast branch,bound and remember algorithm for disassembly line balancing problem

In recent years, the interests of disassembly line have increased owing to economic reasons and the increase of environmental awareness. Effective line can provide many advantages in terms of economic aspect and it facilitates competition the companies with others. This study contributes to the relevant literature by a branch, bound and remember algorithm for disassembly line balancing problem with AND/OR precedence. The proposed exact solution method employs the memory-based dominance rule to eliminate the reduplicated sub-problems by storing all the searched sub-problems and to utilise cyclic best-first search strategy to obtain high-quality complete solutions fast. In this paper, minimising the number of stations is taken as the performance measure. The proposed methodology is tested on a set of 260 instances and compared with the mathematical model using CPLEX solver and five well-known metaheuristics. Computational results show that the proposed method is capable of obtaining the optimal solutions for all the tested instances with less than 0.1?seconds on average. Additionally, comparative study demonstrates that the proposed method is the state-of-the-art algorithm and outperforms the CPLEX solver and metaheuristics in terms of both solution quality and search speed aspects.     

Comparison of biochemical properties and thermal inactivation of membrane‐bound polyphenol oxidase from three apple cultivars (Malus domestica Borkh)

A comparative study of the properties of membrane‐bound polyphenol oxidase (mPPO) from three apple cultivars, namely Red Fuji (FJ), Granny Smith (GS) and Golden Delicious (GD), was carried out for the first time. Data indicate that mPPOs from three cultivars exhibit significantly different properties. GS mPPO had the strongest affinity to catechol, but FJ mPPO had the highest maximum velocity. Red Fuji (FJ) mPPO had the significantly higher activity than those of GD and GS mPPOs. Red Fuji (FJ) mPPO had the highest activity at pH 8.00, while GD and GS mPPOs at 4.50 and 7.50–8.00, respectively. Red Fuji (FJ) mPPO was more stable than GD and GS mPPOs over the pH range of 5.0–8.5. The optimal temperature for GS mPPO was within 70–75 °C, which is higher than those for mPPOs from FJ and GD. Thermal inactivation of the three mPPOs followed a first‐order kinetic model with different inactivation kinetic parameters.     

Capacity allocation problem in flexible manufacturing systems: branch and bound based approaches

This study considers an operation assignment and capacity allocation problem that arises in flexible manufacturing systems. The machines have limited time and tool magazine capacities and the available tools are limited. Our objective is to maximise total weight of assigned operations. We develop a branch and bound algorithm that finds the optimal solutions and a beam search algorithm that finds high quality solutions in polynomial time.     

Half supervised coefficient regularization for regression learning with unbounded sampling

In this study, we investigate the consistency of half supervised coefficient regularization learning with indefinite kernels. In our setting, the hypothesis space and learning algorithms are based on two different groups of input data which are drawn i.i.d. according to an unknown probability measure ρ _X . The only conditions imposed on the kernel function are the continuity and boundedness instead of a Mercer kernel and the output data are not asked to be bounded uniformly. By a mild assumption of unbounded output data and a refined integral operator technique, the generalization error is decomposed into hypothesis error, sample error and approximation error. By estimating these three parts, we deduce satisfactory learning rates with proper choice of the regularization parameter.     

A second-order Mehrotra-type predictor-corrector algorithm with a new wide neighbourhood for semi-definite programming

In this paper, we present a new second-order Mehrotra-type predictor–corrector algorithm for semi-definite programming (SDP). The proposed algorithm is based on a new wide neighbourhood. We are particularly concerned with an important inequality. Based on the inequality, the convergence is shown for a specific class of search directions. In particular, the complexity bound is O(√nlog?^?1) for the Nesterov–Todd search direction and O(n log?^?1) for the Helmberg-Kojima-Monteiro search direction. The derived complexity bounds coincide with the currently best known theoretical complexity bounds obtained so far for SDP. We provide some preliminary numerical results as well.     

Displacement bound of beam‐column with time‐dependent boundary constraints

Abstract

A simplified explicit formula for the displacement bounds of the beam‐column subjected to time‐dependent boundary constraints is proposed. The formula is derived by means of removing time dependence from the boundary conditions. The proposed bounds provide a quick estimation of the displacements for problems with complex loading conditions.