Numerical solution of the three‐dimensional parabolic equation with an integral condition

Developement of numerical methods for obtaining approximate solutions to the three dimensional diffusion equation with an integral condition will be carried out. The numerical techniques discussed are based on the fully explicit (1,7) finite difference technique and the fully implicit (7,1) finite difference method and the (7,7) Crank‐Nicolson type finite difference formula. The new developed methods are tested on a problem. Truncation error analysis and numerical examples are used to illustrate the accuracy of the new algorithms. The results of numerical testing show that the numerical methods based on the finite difference techniques discussed in the present article produce good results. © 2002 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 18: 193–202, 2002; DOI 10.1002/num.1040     

碳纳米管阵列、捆束的三步升温工艺制备及其形貌与结构

使用结构简单的单温炉设备，通过三步升温热解二茂铁、三聚氰氨混合物方法，在二氧化硅、多晶陶瓷基底上分别合成了碳纳米管阵列、碳纳米管捆束.使用扫描电子显微镜、透射电子显微镜、电子能量损失谱和x射线光电子能谱对合成样品进行了结构和成分分析.结果显示：两种基底上合成的纳米管均为多壁纯碳管；生长于光滑二氧化硅表面的碳纳米管具有高度取向性和一致的外径，长度为10—40μm.碳纳米管采取催化剂顶端生长模式并展示出类杯状形貌；生长于粗糙多晶陶瓷表面的碳纳米管捆束随机取向，碳纳米管直径为15—80nm，长度在几百微米，展示 关键词： 碳纳米管 热解法 三步升温工艺     

Some Aspects of the Implementation of Scaling Quantum Mechanical Molecular Force Fields

Some features of software implementation of the Pulay scaling procedure are considered. The advantages of the single value decomposition method for maintaining well-conditionality of the scale factor determination problem are demonstrated. The necessity of using a rational number of scale factors is shown. The possibility of obtaining transferable scale factors with the Pulay method and thus predict the vibrational spectra of related compounds is emphasized.     

逼近严格伪压缩映象不动点的Ishikawa迭代程序

Let(X,‖·‖ ) be a Banach space.Let K be a nonempty closed,convex subset of Xand T∶K→K.Assume that T is Lipschitzian,i.e.there exists L>0 such that‖ T(x) -T(y)‖≤ L‖ x -y‖for all x,y∈K.Withoutloss of generality,assume that L≥ 1 .Assume also that T is strictly pseudocontractive.According to[1 ] this may be statedas:there exists k∈ (0 ,1 ) such that‖ x -y‖≤‖ x -y + r[(I -T -k I) x -(I -T -k I) y]‖for all r>0 and all x,y∈ K.Throughout,let N denote the set of positive in…     

A perturbation-based heuristic for the capacitated multisource Weber problem

This paper proposes a perturbation-based heuristic for the capacitated multisource Weber problem. This procedure is based on an effective use of borderline customers. Several implementations are considered and the two most appropriate are then computationally enhanced by using a reduced neighbourhood when solving the transportation problem. Computational results are presented using data sets from the literature, originally used for the uncapacitated case, with encouraging results.     

Improved modeling and solution methods for the multi-resource routing problem

This paper presents modeling and solution method improvements for the Multi-Resource Routing Problem (MRRP) with flexible tasks. The MRRP with flexible tasks is used to model routing and scheduling problems for intermodal drayage operations in which two resources (tractors and trailers) perform tasks to transport loaded and empty equipment. Tasks may be either well defined, in which both the origin and the destination of a movement are given, or flexible, in which the origin or the destination is chosen by the model. This paper proposes methods to effectively manage the number of options considered for flexible tasks (either feasible origins for a known destination or feasible destinations for a known origin). This modeling change generates sufficient options to allow for low-cost solutions while maintaining reasonable computational effort. We also propose a new solution method that uses randomized route generation. Computational results from test cases show that these changes improve the quality of solutions by at least 5% in the test cases as compared to methods from previous studies.     

Validation of an optimization procedure to improve low frequency characteristics of rooms

A set of experiments was carried out to validate an optimization procedure based on finite element method (FEM). The idea of the procedure, fully presented in previous edition of this journal [Zhu X, Zhu Z, Cheng J. Using optimized surface modifications to improve low frequency response in a room. Appl Acoust 2004;65:841-60], is to produce an optimal geometry modification on the wall for improving low frequency sound uniformity in small rooms. Four experimental models were set up with a scale of 1:5. One was modified according to the optimized result and the others were treated with no optimization consideration. Measured frequency responses of four rooms were compared with numerical results calculated by FEM models. The transient responses in these rooms were also measured and analyzed. The agreements between calculation and measurement are satisfactory though the discrepancies due to the uncertainty of acoustic behavior of the room boundaries remain. The optimization procedure has been supported by the results that the optimized room produces the flattest frequency response and also the most smooth energy decay within the frequency range studied. The reductions of response fluctuation have reached 4.3 dB for prediction and 2.6 dB for measurement, respectively.     

The course scheduling problem at Lufthansa Technical Training

Lufthansa Technical Training GmbH (LTT) performs training courses for Lufthansa Technik AG as well as for several other international airlines. Courses of about 670 different types are offered of which several hundred take place each year. The course scheduling problem faced by LTT is to construct a yearly schedule which maximizes the profit margin incurred while meeting a variety of complex precedence, temporal, and resource-related constraints. A “good” operational schedule should also meet a number of additional subordinate objectives. We formalize the problem and develop a heuristic scheme along with several priority rules, as well as a local search algorithm to determine well-suited weights for weighted composite rules. The operational planning situation of 1996 served as our major test instance; additional test instances were constructed by modifying this data. Several computational experiments were carried out to evaluate the performance of the algorithms. It turned out that the best so-found schedule is substantially better in terms of the profit margin incurred than the solution manually constructed by LTT.     

The k-means range algorithm for personalized data clustering in e-commerce

This paper describes the k-means range algorithm, a combination of the partitional k-means clustering algorithm with a well known spatial data structure, namely the range tree, which allows fast range searches. It offers a real-time solution for the development of distributed interactive decision aids in e-commerce since it allows the consumer to model his preferences along multiple dimensions, search for product information, and then produce the data clusters of the products retrieved to enhance his purchase decisions. This paper also discusses the implications and advantages of this approach in the development of on-line shopping environments and consumer decision aids in traditional and mobile e-commerce applications.