Transformations in machining. Part 1. enhancement of wavelet transformation neural network (WT-NN) combination with a preprocessor

Properly selected transformation methods obtain the most significant characteristics of metal cutting data efficiently and simplify the classification. Wavelet Transformation (WT) and Neural Networks (NN) combination was used to classify the experimental cutting force data of milling operations previously. Preprocessing (PreP) of the approximation coefficients of the WT is proposed just before the classification by using the Adaptive Resonance Theory (ART2) type NNs. Genetic Algorithm (GA) was used to estimate the weights of each coefficient of the PreP. The WT-PreP-NN (ART2) combination worked at lower vigilances by creating only a few meaningful categories without any errors. The WT-NN (ART2) combination could obtain the same error rate only if very high vigilances are used and many categories are allowed.     

Thermodynamic state of reinforced interpenetrating polymer networks

The free energies of mixing of two networks in the interpenetrating polymer network based on crosslinked polyurethane and poly(ester acrylate) have been determined by the vapour sorption method. It was established that the constituent networks in the IPN are not miscible. The introduction of fillers of different chemical nature increases the compatibility. The thermodynamic affinity of the fillers to the individual networks and IPN was estimated. It was established that when the free energy of interaction of one or both components of the IPN with the filler is negative, reinforcement leads to the formation of a compatible and equilibrium system. For fillers having no affinity to the polymers, compatibilization is observed, which is connected with slowing down of phase separation in the system in the presence of filler.     

浅谈小型局域网的组建与应用

随着计算机应用技术与通讯技术的发展以及在实践中的广泛应用,智能化和网络化成为必然趋势,局域网的应用可以营造一个现代化的高效、快捷、安全的环境,也可以使计算机以及其他硬件的功能得到充分的发挥。     

Evaluate the performance of a stochastic-flow network with cost attribute in terms of minimal cuts

This paper proposes a performance index to measure the quality level of a stochastic-flow network in which each node has a designated capacity, which will have different lower levels due to various partial and complete failures. The performance index is the probability that the maximum flow of the network equals the demand d without exceeding the budget b. A simple algorithm in terms of minimal cuts is first proposed to generate all upper boundary points for (d, b), and then the probability that the maximum flow is less than or equal to d can be calculated in terms of such points. The upper boundary point for (d, b) is a maximal vector representing the capacity of each arc such that the maximum flow of the network under the budget b is d. The performance index can be calculated by repeating the proposed algorithm to obtain all upper boundary point for (d−1, b). A benchmark example is shown to illustrate the solution procedure.     

Development of calibration models for quality control in the production of ethylene/propylene copolymers by FTIR spectroscopy,multivariate statistical tools,and artificial neural networks

Principal component regression (PCR), partial least squares (PLS), StepWise ordinary least squares regression (OLS), and back‐propagation artificial neural network (BP‐ANN) are applied here for the determination of the propylene concentration of a set of 83 production samples of ethylene–propylene copolymers from their infrared spectra. The set of available samples was split into (a) a training set, for models calculation; (b) a test set, for selecting the correct number of latent variables in PCR and PLS and the end point of the training phase of BP‐ANN; (c) a production set, for evaluating the predictive ability of the models. The predictive ability of the models is thus evaluated by genuine predictions. The model obtained by StepWise OLS turned out to be the best one, both in fitting and prediction. The study of the breakdown number of samples to be included in the training set showed that at least 52 experiments are necessary to build a reliable and predictive calibration model. It can be concluded that FTIR spectroscopy and OLS can be properly employed for monitoring the synthesis or the final product of ethylene–propylene copolymers, by predicting the concentration of propylene directly along the process line. © 2008 Wiley Periodicals, Inc. J Appl Polym Sci, 2008     

Influence of polymer modulus on the percolation threshold of latex-based composites

Monodispersed copolymer emulsions with different glass transition temperatures were synthesized to investigate the effect of room temperature polymer matrix modulus on the electrical properties of carbon black (CB) filled segregated network composites. The emulsion with the highest modulus at room temperature produced composites with the lowest percolation threshold. The threshold for a composite made from a copolymer latex containing an equal ratio of butyl acrylate and methyl methacrylate (BA5) is 1.5 vol%, while the percolation threshold for the much lower modulus BA7 (7:3 BA/MMA ratio) is 4.93 vol%. The microstructure of each composite shows significant differences in the level of CB dispersion within the polymer matrix. Higher modulus polymer particles push the CB more efficiently into the interstitial space between them, resulting in a lower percolation threshold. This modulus effect was confirmed by increasing the drying temperature, where the moduli of latexes (BA5, BA5.5, and BA6) were more similar and the percolation thresholds for three composites also become closer to one another.     

邯钢西区煤气管网改造及效果分析

介绍了邯钢为减少煤气放散，节约能源，采用环网供应混合煤气的有效方法。提高了供气可靠性，取得了很好的经济效益。     

Memory of Distributed Computer Systems: Distinctive Features of Their Architectural-Structural Organization and Use

Distinctive features of architectural-structural organization and use of memory networks are considered with the aim of choosing an optimal configuration in designing distributed computer systems.     

Improving Neural Networks for Mechanism Kinematic Chain Isomorphism Identification

Detection of isomorphism among kinematic chains is essential in mechanical design, but difficult and computationally expensive. It has been shown that both traditional methods and previously presented neural networks still have a lot to be desired in aspects such as simplifying procedure of identification and adapting automatic computation. Therefore, a new algorithm based on a competitive Hopfield network is developed for automatic computation in the kinematic chain isomorphism problem. The neural approach provides directly interpretable solutions and does not demand tuning of parameters. We have tested the algorithm by solving problems reported in the recent mechanical literature. Simulation results show the effectiveness of the network that rapidly identifies isomorphic kinematic chains.     

A globally convergent algorithm for transportation continuous network design problem

The continuous network design problem (CNDP) is characterized by a bilevel programming model, in which the upper level problem is generally to minimize the total system cost under limited expenditure, while at the lower level the network users make choices with regard to route conditions following the user equilibrium principle. In this paper, the bilevel programming model for CNDP is transformed into a single level convex programming problem by virtue of an optimal-value function tool and the relationship between System Optimum (SO) and User Equilibrium (UE). By exploring the inherent nature of the CNDP, the optimal-value function for the lower level user equilibrium problem is proved to be continuously differentiable and its derivative in link capacity enhancement can be obtained efficiently by implementing user equilibrium assignment subroutine. However, the reaction (or response) function between the upper and lower level problem is implicit and its gradient is difficult to obtain. Although, here we approximately express the gradient with the difference concept at each iteration, based on the method of successive averages (MSA), we propose a globally convergent algorithm to solve the single level convex programming problem. Comparing with widely used heuristic algorithms, such as sensitivity analysis based (SAB) method, the proposed algorithm needs not strong hypothesis conditions and complex computation for the inverse matrix. Finally, a numerical example is presented to compare the proposed method with some existing algorithms.