bluuebunny/crossref_metadata_2025_split huggingface dataset:
Reoptimizing the traveling salesman problem
Authors: Archetti Claudia , Bertazzi Luca , Speranza M. Grazia 
Published: August 2003

AbstractIn this paper, we study the reoptimization problems which arise when a new node is added to an optimal solution of a traveling salesman problem (TSP) instance or when a node is removed. We show that both reoptimization problems are NP‐hard. Moreover, we show that, while the cheapest insertion heuristic has a tight worst‐case ratio equal to 2 when applied to a TSP instance, it guarantees, in linear time, a tight worst‐case ratio equal to 3/2 when used to add the new node and that also the simplest heuristic to remove a node from the optimal tour guarantees a tight ratio equal to 3/2 in constant time. © 2003 Wiley Periodicals, Inc.
A linear algorithm for compact box‐drawings of trees
Authors: Hasan Masud , Rahman Md. Saidur , Nishizeki Takao 
Published: August 2003

AbstractIn a box‐drawing of a rooted tree, each node is drawn by a rectangular box of prescribed size, no two boxes overlap each other, all boxes corresponding to siblings of the tree have the same x‐coordinate at their left sides, and a parent node is drawn at a given distance apart from its first child. A box drawing of a tree is compact if it attains the minimum possible rectangular area enclosing the drawing. We give a linear‐time algorithm for finding a compact box‐drawing of a tree. A known algorithm does not always find a compact box‐drawing and takes time O(n2) if a tree has n nodes. © 2003 Wiley Periodicals, Inc.
The linear arrangement problem on recursively constructed graphs
Authors: Horton S. B. , Easton T. , Parker R. Gary 
Published: August 2003

AbstractThe linear arrangement problem on graphs is a relatively old and quite well‐known problem. Hard in general, it remains open on general recursive graphs (i.e., partial k‐trees, etc.), which is somewhat frustrating since most hard graph problems are easily solved on recursive graphs. In this paper, we examine the linear arrangement problem with respect to these structures. Included are some negative (complexity) results as well as a solvable case. © 2003 Wiley Periodicals, Inc.
On the use of Somigliana's formula and Fourier series for elasticity problems with circular boundaries
Authors: Crouch S. L. , Mogilevskaya S. G. 
Published: August 2003

AbstractThis paper considers the problem of an infinite, isotropic elastic plane containing an arbitrary number of non‐overlapping circular holes and isotropic elastic inclusions. The holes and inclusions are of arbitrary size and the elastic properties of all of the inclusions can, if desired, be different. The analysis is based on the two‐dimensional version of Somigliana's formula, which gives the displacements at a point inside a region V in terms of integrals of the tractions and displacements over the boundary S of this region. We take V to be the infinite plane, and S to be an arbitrary number of circular holes within this plane. Any (or all) of the holes can contain an elastic inclusion, and we assume for simplicity that all inclusions are perfectly bonded to the material matrix. The displacements and tractions on each circular boundary are represented as truncated Fourier series, and all of the integrals involved in Somigliana's formula are evaluated analytically. An iterative solution algorithm is used to solve the resulting system of linear algebraic equations. Several examples are given to demonstrate the accuracy and efficiency of the numerical method. Copyright © 2003 John Wiley & Sons, Ltd.
Optimal stress sampling points of plane triangular elements for patch recovery of nodal stresses
Authors: Rajendran S. , Liew K. M. 
Published: August 2003

AbstractThe existence of optimal stress sampling points in finite elements was first observed by Barlow. Knowledge of optimal stress sampling points is important in stress‐recovery methods such as the superconvergent patch recovery (SPR). Recently, MacNeal observed that Barlow points and Gaussian quadrature points are the same for the linear and quadratic bar elements, and different for the cubic bar element. Prathap proposed the best‐fit approach to predict the optimal sampling points, and showed that the best‐fit points coincide with Gaussian quadrature points not only for the linear and quadratic bar elements but also for the cubic bar element. In this paper, the best‐fit approach for predicting the optimal sampling points is extended to the linear and quadratic plane triangular elements, and the effectiveness of Barlow points, Gaussian points and best‐fit points as candidates of sampling points for the patch recovery of nodal stresses with these triangular elements is investigated for typical problems. The numerical results suggest that Barlow points do not exist for all strain/stress components, and Gaussian quadrature points which are the same as or close to the best‐fit points are better candidates for patch recovery. Copyright © 2003 John Wiley & Sons, Ltd.
Underwater shock‐free surface–structure interaction
Authors: Liu T. G. , Khoo B. C. , Yeo K. S. , Wang C. 
Published: August 2003

AbstractA recently developed numerical method has been employed to evaluate the influence of free surface on shock loading in a cylindrical underwater explosion carried out near to both a free surface and a cylindrical rigid structure. In the usual simulation of underwater shock–structure interaction, the shock loading tends to accelerate/move the (rigid) structure only in the resultant force direction. The presence of a free surface and explosion bubble suggests the existence of a reverse loading and provides an additional torque (rotational moment) on the loaded structure. The numerical results also demonstrate the possible existence of a cavitation zone/region in the immediate vicinity of the free surface due to the near‐surface underwater explosion. Copyright © 2003 John Wiley & Sons, Ltd.
A parametric study on the fractal finite element method for two‐dimensional crack problems
Authors: Xie J. F. , Fok S. L. , Leung A. Y. T. 
Published: August 2003

AbstractThe Fractal Finite Element Method for calculating 2D stress intensity factors is modified by making the similarity ratio in the construction of the fractal mesh a variable. A parametric study is then carried out to examine the effects of the similarity ratio, the number of transformation terms, reduced integration and the initial crack opening angle on the quality of the numerical solutions. It is concluded that a large similarity ratio should be used to create the fractal mesh, and that reduced integration and a small initial crack opening angle may be used without producing significant errors in the solutions. Copyright © 2003 John Wiley & Sons, Ltd.
Knowledge‐based algorithms in fixed‐grid GA shape optimization
Authors: Woon Soon Yu , Tong Liyong , Querin Osvaldo M. , Steven Grant P. 
Published: August 2003

AbstractShape optimization through a genetic algorithm (GA) using discrete boundary steps and the fixed‐grid (FG) finite‐element analysis (FEA) concept was recently introduced by the authors. In this paper, algorithms based on knowledge specific to the FG method with the GA‐based shape optimization (FGGA) method are introduced that greatly increase its computational efficiency. These knowledge‐based algorithms exploit the information inherent in the system at any given instance in the evolution such as string structure and fitness gradient to self‐adapt the string length, population size and step magnitude. Other non‐adaptive algorithms such as string grouping and deterministic local searches are also introduced to reduce the number of FEA calls. These algorithms were applied to two examples and their effects quantified. The examples show that these algorithms are highly effective in reducing the number of FEA calls required hence significantly improving the computational efficiency of the FGGA shape optimization method. Copyright © 2003 John Wiley & Sons, Ltd.
A compromise programming method using multibounds formulation and dual approach for multicriteria structural optimization
Authors: Zhang W. H. 
Published: August 2003

AbstractTo enhance the reliability and efficiency of the multicriteria optimization procedure, a compromise programming method using multibounds formulation (MBF) is proposed in this paper. This method can be used either to obtain the Pareto optimum set or to find the ‘best’ Pareto optimum solution in the sense of having the minimum distance to the utopia point. By introducing a set of artificial design variables, it is shown that a simplified and easy‐to‐use formulation can be established for practical applications. Particularly, this formulation is well adapted to the efficient dual solution approach due to the convexity of objective function. Theoretically, based on the Kuhn–Tucker optimality conditions, demonstrations show that the new formulation is equivalent to its original form and thus retains the basic properties of the latter. Numerical examples will be solved to show the capacity of this method. Copyright © 2003 John Wiley & Sons, Ltd.
Sustainability and corporate evolution: Integrating vision and tools at Norm Thompson Outfitters
Authors: Smith Derek , Brown Michael S. 
Published: August 2003

AbstractIt's not easy to run a successful mail‐order business – and Norm Thompson Outfitters has
voluntarily made it even more difficult. The company is determined to be not only profitable, but as
environmentally responsible as possible. This latter goal has meant steep learning curves – in how to
design and construct the company headquarters building, in how to make catalogs from recycled paper, and, most
ambitiously, in how to work with suppliers toward products that have the least adverse environmental impact. And
they are sharing that hard‐won learning as they go, with whoever is willing to follow a path that
minimizes environmental damage. © 2003 Wiley Periodicals, Inc.
What businesses need now is better managerial performance
Authors: Rieley James B. 
Published: August 2003

AbstractIt's not just failures of governance at the highest levels that is threatening many companies, but
rather the more hands‐on leadership gaps along the management chain that are easier to identify –
and remedy. One way of identifying them is to look at leaders' priorities, ability to communicate
appropriately, motivation of employees, and management of key relationships. © 2003 Wiley
Periodicals, Inc.
Quality is not free for U.S. homebuilders
Authors: Dubey‐Villinger Niti , Dubey Krish K. 
Published: August 2003

AbstractThe unique nature of homebuilding gives rise to some quality control problems that cannot be solved by
industrial methods. According to the authors' research, quality in this industry can be ensured only by
more labor‐intensive training and oversight.
© 2003 Wiley Periodicals, Inc.
At Raytheon Six Sigma works, too, to improve HR management processes
Authors: Lanyon Sally 
Published: August 2003

AbstractRaytheon has employed Six Sigma, traditionally used for improving manufacturing processes, as a broad tool
for creating customer value and changing culture. The HR function has also successfully applied Six Sigma to
make the company's people management processes more efficient, cost‐effective, and
user‐friendly, with the added benefit of enhancing HR's role as a full business partner with the
line organization. © 2003 Wiley Periodicals, Inc.
Retention interventions at Mutual of Omaha bring wide‐ranging changes
Authors: Hula Paul , Weinberg Raymond B. 
Published: August 2003

AbstractIn the current economy, more attention is being paid to the tight job market than to unwanted employee
turnover. But companies that look ahead to keeping their best employees when the job market loosens up might
consider deliberate retention strategies like the successful ones undertaken at Mutual of Omaha the last time
jobs were plentiful and good employees scarce. © 2003 Wiley Periodicals, Inc.
Hewlett‐Packard takes the waste out of leadership
Authors: Connolly Mickey , Burnett Susan 
Published: August 2003

AbstractAs Hewlett‐Packard faced formidable economic and industry challenges, along with the largest
high‐tech merger in history, it needed to quickly develop a new style of leadership aligned with the
company's new strategic direction. Recognizing that both the style and content of managers'
conversations affect the achievement of business goals, the company implemented a system that has trained HP
managers to increase the value of leadership conversations and decrease the conversational waste that
demotivates and decelerates valuable action. © 2003 Wiley Periodicals, Inc.
Managing human capabilities
Authors: Brache Alan P. 
Published: August 2003

AbstractHuman capabilities are people's unique sets of skills, knowledge, and personal values and beliefs. It is
useful for an organization to determine what human capabilities it needs—by examining its strategic,
business process, departmental, and job level requirements—and then identify what human capabilities it
currently possesses and the steps it can take to close any gaps. © 2002 Kepner‐Tregoe,
Inc.
A convergent three‐level finite difference scheme for solving a dual‐phase‐lagging heat transport equation in spherical coordinates
Authors: Dai Weizhong , Shen Lixin , Nassar Raja 
Published: August 2003

AbstractHeat transport at the microscale is of vital importance in microtechnology applications. The heat transport equation is different from the traditional heat diffusion equation since a second‐order derivative of temperature with respect to time and a third‐order mixed derivative of temperature with respect to space and time are introduced. In this study, we consider the heat transport equation in spherical coordinates and develop a three‐level finite difference scheme for solving the heat transport equation in a microsphere. It is shown that the scheme is convergent, which implies that the scheme is unconditionally stable. Results show that the numerical solution converges to the exact solution. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 20: 60–71, 2004.
A high‐order finite difference discretization strategy based on extrapolation for convection diffusion equations
Authors: Sun Haiwei , Zhang Jun 
Published: August 2003

AbstractWe propose a new high‐order finite difference discretization strategy, which is based on the Richardson extrapolation technique and an operator interpolation scheme, to solve convection diffusion equations. For a particular implementation, we solve a fine grid equation and a coarse grid equation by using a fourth‐order compact difference scheme. Then we combine the two approximate solutions and use the Richardson extrapolation to compute a sixth‐order accuracy coarse grid solution. A sixth‐order accuracy fine grid solution is obtained by interpolating the sixth‐order coarse grid solution using an operator interpolation scheme. Numerical results are presented to demonstrate the accuracy and efficacy of the proposed finite difference discretization strategy, compared to the sixth‐order combined compact difference (CCD) scheme, and the standard fourth‐order compact difference (FOC) scheme. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 20: 18–32, 2004.
On a mixed finite element formulation of a second‐order quasilinear problem in the plane
Authors: Meddahi Salim 
Published: August 2003

AbstractWe analyze a mixed finite element discretization of a second‐order quasilinear problem based on the Raviart‐Thomas space. We prove that the discrete problem is solvable and provide a local uniqueness result for the solution. We also obtain optimal order L2‐error estimates for both the scalar variable and the associated flux. The main feature of our method is that it is free from the boundness conditions required in previous works on the coefficients of the quasilinear operator. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 20: 90–103, 2004.
Lagrange interpolation and finite element superconvergence
Authors: Li Bo 
Published: August 2003

AbstractWe consider the finite element approximation of the Laplacian operator with the homogeneous Dirichlet boundary condition, and study the corresponding Lagrange interpolation in the context of finite element superconvergence. For d‐dimensional Qk‐type elements with d ≥ 1 and k ≥ 1, we prove that the interpolation points must be the Lobatto points if the Lagrange interpolation and the finite element solution are superclose in H1 norm. For d‐dimensional Pk‐type elements, we consider the standard Lagrange interpolation—the Lagrange interpolation with interpolation points being the principle lattice points of simplicial elements. We prove for d ≥ 2 and k ≥ d + 1 that such interpolation and the finite element solution are not superclose in both H1 and L2 norms and that not all such interpolation points are superconvergence points for the finite element approximation. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 20: 33–59, 2004.
Local defect correction with slanting grids
Authors: Graziadei M. , Mattheij R. M. M. , ten Thije Boonkkamp J. H. M. 
Published: August 2003

AbstractThe local defect correction (LDC) method is used to solve a convection‐diffusion‐reaction problem that contains a high‐activity region in a relatively small part of the domain. The improvement of the solution on a coarse grid is obtained by introducing a correction term computed from a local fine‐grid solution. This article studies problems where the high‐activity region is covered with a rectangular fine grid not aligned with the axes of the global domain. This study shows that the resulting method is less expensive than both a uniform refinement and tensor product grid method. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 20: 1–17, 2004.
Fast direct solver for Poisson equation in a 2D elliptical domain
Authors: Lai Ming‐Chih 
Published: August 2003

AbstractIn this article, we extend our previous work M.‐C. Lai and W.‐C. Wang, Numer Methods Partial Differential Eq 18:56–68, 2002 for developing some fast Poisson solvers on 2D polar and spherical geometries to an elliptical domain. Instead of solving the equation in an irregular Cartesian geometry, we formulate the equation in elliptical coordinates. The solver relies on representing the solution as a truncated Fourier series, then solving the differential equations of Fourier coefficients by finite difference discretizations. Using a grid by shifting half mesh away from the pole and incorporating the derived numerical boundary value, the difficulty of coordinate singularity can be elevated easily. Unlike the case of 2D disk domain, the present difference equation for each Fourier mode is coupled with its conjugate mode through the numerical boundary value near the pole; thus, those two modes are solved simultaneously. Both second‐ and fourth‐order accurate schemes for Dirichlet and Neumann problems are presented. In particular, the fourth‐order accuracy can be achieved by a three‐point compact stencil which is in contrast to a five‐point long stencil for the disk case. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 20: 72–81, 2004
A variational method of optimal control problems for nonlinear Schrödinger equations
Authors: Subaşi Murat 
Published: August 2003

AbstractCalculating the control function that is in the coefficients of the nonlinear Schrodinger equation and minimizes the objective functional consisting of two integrals is main aim of this article. After proving the existence and uniqueness of the solution, we have constituted an algorithm using the method of gradient of projection. Results are tested on a quantum‐mechanical problem. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 20: 82–89, 2004.
A corrected smooth particle hydrodynamics method for the simulation of debris flows
Authors: Rodriguez‐Paz M. X. , Bonet J. 
Published: August 2003

AbstractThis article presents the development and application of a corrected smooth particle hydrodynamics (CSPH) code to the simulation of debris flow and avalanches. The advantages of a mesh‐free method over other traditional numerical methods such as the finite element method are discussed. A new frictional approach for the boundary conditions and modified constitutive equations are introduced in the SPH method. The resulting technique is then applied for the simulation of debris flows, comparing the results with those obtained from experiments reported by other researchers. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 20: 140–163, 2004.
Conservative flux recovery from the Q1 conforming finite element method on quadrilateral grids
Authors: Chou So‐Hsiang , He Songnian , Lin Wen‐Wei 
Published: August 2003

AbstractCompared with standard Galerkin finite element methods, mixed methods for second‐order elliptic problems give readily available flux approximation, but in general at the expense of having to deal with a more complicated discrete system. This is especially true when conforming elements are involved. Hence it is advantageous to consider a direct method when finding fluxes is just a small part of the overall modeling processes. The purpose of this article is to introduce a direct method combining the standard Galerkin Q1 conforming method with a cheap local flux recovery formula. The approximate flux resides in the lowest order Raviart‐Thomas space and retains local conservation property at the cluster level. A cluster is made up of at most four quadrilaterals. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 20: 104–127, 2004
Least‐squares spectral collocation method for the Stokes equations
Authors: Kim Sang Dong , Lee Hyung‐Chun , Shin Byeong Chun 
Published: August 2003

AbstractFirst‐order system least‐squares spectral collocation methods are presented for the Stokes equations by adopting the first‐order system and modifying the least‐squares functionals in 2. Then homogeneous Legendre and Chebyshev (continuous and discrete) functionals are shown to be elliptic and continuous with respect to appropriate product weighted norms. The spectral convergence is analyzed for the proposed methods with some numerical experiments. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 20: 128–139, 2004
Analysis of gial acidic fibrillary protein in the human entorhinal cortex during aging and in Alzheimer's disease
Authors: Porchet Raymonde , Probst Alphonse , Bouras Constantin , Dráberová Eduarda , Dráber Pavel , Riederer Beat M. 
Published: August 2003

AbstractGlial fibrillary acidic protein, GFAP, is a major intermediate filament protein of glial cells and major cytoskeletal structure in astrocytes. The entorhinal cortex has a key role in memory function and is one of the first brain areas to reveal hallmark structures of Alzheimer's disease and therefore provides an ideal tissue to investigate incipient neurodegenerative changes. Here we have analyzed age‐ and disease‐related occurrence and composition of GFAP in the human entorhinal cortex by using one‐ and two‐dimensional electrophoresis, Western blots and immunocytochemistry combined with confocal microscopy. A novel monoclonal antibody, GF‐02, was characterized that mainly reacted with intact GFAP molecules and indicated that more acidic and soluble GFAP forms were also more susceptible to degradation. GFAP and vimentin increased with aging and in Alzheimer's disease (AD). Two‐dimensional electrophoresis and Western blots revealed a complex GFAP pattern, both in aging and AD with different modification and degradation forms. Immunohistochemistry indicated that reactive astrocytes mainly accumulated in relation to neurofibrillary tangles and senile plaques in deeper entorhinal cortex layers. GFAP may be used as an additional but not exclusive diagnostic tool in the evaluation of neurodegenerative diseases because its levels change with age and respond to senile plaque and tangle formation.