An efficient parallel algorithm for ocean circulation numerical model based on irregular rectangle decomposition scheme

A parallel algorithm of circulation numerical model based on message passing interface（MPI） is developed using serialization and an irregular rectangle decomposition scheme. Neighboring point exchange strategy（NPES） is adopted to further enhance the computational efficiency. Two experiments are conducted on HP C7000 Blade System, the numerical results show that the parallel version with NPES（PVN） produces higher efficiency than the original parallel version（PV）. The PVN achieves parallel efficiency in excess of 0.9 in the second experiment when the number of processors increases to 100, while the efficiency of PV decreases to 0.39 rapidly. The PVN of ocean circulation model is used in a fine-resolution regional simulation, which produces better results. The capability of universal implementation of this algorithm makes it applicable in many other ocean models potentially.

High-end equipment development task decomposition and scheme selection method

Decomposition of tasks and selection of optimal schemes are key procedures in high-end equipment development processes.However,such procedures are highly innovative,technology intensive,interdisciplinary,and multi-party engineering projects,making the decomposition and scheme selection more difficult and complicated than that in the development of ordinary equipment.In this study,we consider three factors,namely,functional structure,task granularity,and task feasibility in task decomposition of high-end equipment development.Based on the principles of systems engineering,a method of task decomposition is proposed.As for decomposition scheme selection,a method based on the superiority and inferiority ranking(SIR)method mixed information and multiple attribute decision making is proposed by considering attributes of scheme feasibility,uncertainty risk and task integration complexity.To verify the proposed method,development of a military electric vehicle is used as an example to demonstrate the calculation process.

EDCMS:A Content Management System for Engineering Documents

Engineers often need to look for the right pieces of information by sifting through long engineering documents, It is a very tiring and time-consuming job. To address this issue, researchers are increasingly devoting their attention to new ways to help information users, including engineers, to access and retrieve document content. The research reported in this paper explores how to use the key technologies of document decomposition （study of document structure）, document mark-up （with EXtensible Mark- up Language （XML）, HyperText Mark-up Language （HTML）, and Scalable Vector Graphics （SVG））, and a facetted classification mechanism. Document content extraction is implemented via computer programming （with Java）. An Engineering Document Content Management System （EDCMS） developed in this research demonstrates that as information providers we can make document content in a more accessible manner for information users including engineers.The main features of the EDCMS system are： 1） EDCMS is a system that enables users, especially engineers, to access and retrieve information at content rather than document level. In other words, it provides the right pieces of information that answer specific questions so that engineers don＇t need to waste time sifting through the whole document to obtain the required piece of information. 2） Users can use the EDCMS via both the data and metadata of a document to access engineering document content. 3） Users can use the EDCMS to access and retrieve content objects, i.e. text, images and graphics （including engineering drawings） via multiple views and at different granularities based on decomposition schemes. Experiments with the EDCMS have been conducted on semi-structured documents, a textbook of CADCAM, and a set of project posters in the Engineering Design domain. Experimental results show that the system provides information users with a powerful solution to access document content.

An iterative algorithm for solving ill-conditioned linear least squares problems

Linear Least Squares（LLS） problems are particularly difficult to solve because they are frequently ill-conditioned, and involve large quantities of data. Ill-conditioned LLS problems are commonly seen in mathematics and geosciences, where regularization algorithms are employed to seek optimal solutions. For many problems, even with the use of regularization algorithms it may be impossible to obtain an accurate solution. Riley and Golub suggested an iterative scheme for solving LLS problems. For the early iteration algorithm, it is difficult to improve the well-conditioned perturbed matrix and accelerate the convergence at the same time. Aiming at this problem, self-adaptive iteration algorithm（SAIA） is proposed in this paper for solving severe ill-conditioned LLS problems. The algorithm is different from other popular algorithms proposed in recent references. It avoids matrix inverse by using Cholesky decomposition, and tunes the perturbation parameter according to the rate of residual error decline in the iterative process. Example shows that the algorithm can greatly reduce iteration times, accelerate the convergence,and also greatly enhance the computation accuracy.