bluuebunny/crossref_metadata_2025_split huggingface dataset:
Patterns of nerve conduction abnormalities in POEMS syndrome
Authors: Sung Jia‐Ying , Kuwabara Satoshi , Ogawara Kazue , Kanai Kazuaki , Hattori Takamichi 
Published: October 2002

AbstractPolyneuropathy, organomegaly, endocrinopathy, M protein, and skin changes (POEMS) syndrome is a rare cause of demyelinating and axonal neuropathy. POEMS syndrome and chronic inflammatory demyelinating polyneuropathy (CIDP) cause peripheral nerve demyelination, and the electrodiagnostic findings may therefore be similar, but the two disorders are distinct. To elucidate the electrodiagnostic features of POEMS syndrome, we reviewed nerve conduction studies of 8 patients, and compared their results with those in 42 patients with CIDP. The patients with POEMS syndrome showed (1) slowing of nerve conduction that was more predominant in the intermediate than distal nerve segments, (2) rare conduction block (6% of the tested nerves), and (3) more severe attenuation of compound muscle action potentials in the lower than upper limbs. Findings in the CIDP patients were characterized by multifocal conduction slowing that was occasionally dominant distally, frequent conduction block (44% of tested nerves), and less discrepancy between upper and lower limb nerves. The pattern of nerve conduction abnormalities differs between these disorders. Recognition of these typical patterns may be helpful for early diagnosis of POEMS syndrome. © 2002 Wiley Periodicals, Inc. Muscle Nerve 26: 189–193, 2002
An improved generalized particle algorithm that includes boundaries and interfaces
Authors: Johnson Gordon R. , Beissel Stephen R. , Stryk Robert A. 
Published: October 2002

AbstractThis paper presents an improved generalized particle algorithm (GPA), as well as new boundary and interface algorithms for particle interaction with finite elements and other particles (of different materials). The improved GPA uses a local co‐ordinate system that is aligned with the boundaries and/or interfaces for the determination of the strain rates and forces. This enables the boundary and interface algorithms to be applied in a straightforward manner. It also provides an invariant solution that is independent of the orientation of the global co‐ordinate system. Several examples are presented to illustrate the effects of the various algorithms. Copyright © 2001 John Wiley & Sons, Ltd.
Three‐dimensional adaptive meshing by subdivision and edge‐collapse in finite‐deformation dynamic–plasticity problems with application to adiabatic shear banding
Authors: Molinari J. F. , Ortiz M. 
Published: October 2002

AbstractThis paper is concerned with the development of a general framework for adaptive mesh refinement and coarsening in three‐dimensional finite‐deformation dynamic–plasticity problems. Mesh adaption is driven bya posterioriglobal error bounds derived on the basis of a variational formulation of the incremental problem. The particular mesh‐refinement strategy adopted is based on Rivara's longest‐edge propagation path (LEPP) bisection algorithm. Our strategy for mesh coarsening, or unrefinement, is based on the elimination of elements by edge‐collapse. The convergence characteristics of the method in the presence of strong elastic singularities are tested numerically. An application to the three‐dimensional simulation of adiabatic shear bands in dynamically loaded tantalum is also presented which demonstrates the robustness and versatility of the method. Copyright © 2001 John Wiley & Sons, Ltd.
Non‐linear version of stabilized conforming nodal integration for Galerkin mesh‐free methods
Authors: Chen Jiun‐Shyan , Yoon Sangpil , Wu Cheng‐Tang 
Published: October 2002

AbstractA stabilized conforming (SC) nodal integration, which meets the integration constraint in the Galerkin mesh‐free approximation, is generalized for non‐linear problems. Using a Lagrangian discretization, the integration constraints for SC nodal integration are imposed in the undeformed configuration. This is accomplished by introducing a Lagrangian strain smoothing to the deformation gradient, and by performing a nodal integration in the undeformed configuration. The proposed method is independent to the path dependency of the materials. An assumed strain method is employed to formulate the discrete equilibrium equations, and the smoothed deformation gradient serves as the stabilization mechanism in the nodally integrated variational equation. Eigenvalue analysis demonstrated that the proposed strain smoothing provides a stabilization to the nodally integrated discrete equations. By employing Lagrangian shape functions, the computation of smoothed gradient matrix for deformation gradient is only necessary in the initial stage, and it can be stored and reused in the subsequent load steps. A significant gain in computational efficiency is achieved, as well as enhanced accuracy, in comparison with the mesh‐free solution using Gauss integration. The performance of the proposed method is shown to be quite robust in dealing with non‐uniform discretization. Copyright © 2002 John Wiley & Sons, Ltd.
An adaptive‐recursive staggering strategy for simulating multifield coupled processes in microheterogeneous solids
Authors: Zohdi T. I. 
Published: October 2002

AbstractIn this work an adaptive‐recursive staggering strategy is developed for the solution of partial differential equations arising from descriptions of multifield coupled processes in microheterogeneous solids. In order to illustrate the solution strategy, a multifield model problem is studied which describes the diffusion of a detrimental dilute solute into a solid material. The coupled equations to be solved are (1) a phenomenological diffusion‐reaction equation, (2) a phenomenological damage evolution law, (3) a balance of energy, and (4) a balance of momentum. The finite element method is used for the spatial discretization, and finite differences for the temporal discretization. In order to accurately capture the microstructure of the material, use of very fine finite element meshes is inescapable. Therefore, in order to reduce computation time, one would like to take as large time steps as possible, provided that the associated numerical accuracy can be maintained. Classical staggering approaches solve each field equation in an uncoupled manner, by allowing only the primary field variable to be active, and momentarily freezing all others. After the solution of each field equation, the primary field variable is updated, and the next field equation is treated in a similar manner. In standard approaches, after this process has been applied, only once, to all of the field equations, the time step is immediately incremented. This non‐recursive process is highly sensitive to the order in which the staggered field equations are solved. Furthermore, since the staggering error accumulates with each passing time step, the process may require very small time steps for sufficient accuracy. In the approach developed here, in order to reduce the error within a time step, the staggering methodology is formulated as a recursive fixed‐point iteration, whereby the system is repeatedly re‐solved until fixed‐point type convergence is achieved. A sufficient condition for the convergence of such a fixed‐point scheme is that the spectral radius of the coupled operator, which depends on the time step size, must be less than unity. This observation is used to adaptively maximize the time step sizes, while simultaneously controlling the coupled operator's spectral radius, in order to deliver solutions below an error tolerance within a prespecified number of desired iterations. This recursive staggering error control allows substantial reduction of computational effort by the adaptive use of large time steps. Three‐dimensional numerical examples are given to illustrate the approach. Copyright © 2001 John Wiley & Sons, Ltd.
Singularity treatment and high‐order RWG basis functions for integral equations of electromagnetic scattering
Authors: Cai W. , Yu Yijun , Yuan X. C. 
Published: October 2002

AbstractWe present numerical implementation of high order RWG basis functions for electromagnetic scattering for curved conductor surfaces with a procedure for treating the singularities of dyadic Green's functions in the mixed potential formulation of electromagnetic scattering. Copyright © 2001 John Wiley & Sons, Ltd.
Computation of electromagnetic scattering with a non‐conforming discontinuous spectral element method
Authors: Kopriva David A. , Woodruff Stephen L. , Hussaini M. Y. 
Published: October 2002

AbstractIn this paper we solve electromagnetic scattering problems by approximating Maxwell's equations in the time‐domain with a high‐order quadrilateral discontinuous spectral element method (DSEM). The method is a collocation form of the discontinuous Galerkin method for hyperbolic systems where the solution is approximated by a tensor product Legendre expansion and inner products are replaced with Gauss–Legendre quadratures. To increase flexibility of the method, we use a mortar element method to couple element faces. Mortars provide a means for coupling element faces along which the polynomial orders differ, which allows the flexibility to choose the approximation order within an element by considering only local resolution requirements. Mortars also permit local subdivision of a mesh by connecting element faces that do not share a full side. We present evidence showing that the convergence of the non‐conforming approximations is spectral along with examples of their use. Copyright © 2001 John Wiley & Sons, Ltd.
Reconstructing dynamic events from time‐limited spatially distributed data
Authors: Doyle James F. 
Published: October 2002

AbstractThis paper presents a method of reconstructing dynamic events from limited photographically recorded responses. It is based on a wavelet representation of the unknown applied loading in conjunction with a general finite element program. The incorporation of regularization terms provides a robust solution to these usually ill‐conditioned problems. The method allows for the data collected to be of dissimilar type (e.g. strain and displacement), as well as for the data to be collected remotely. As a demonstration of the method, multiple force reconstructions for an impacted plate with a hole are determined using synthetically generated Moiré displacement data. Copyright © 2002 John Wiley & Sons, Ltd.
Anh‐hierarchical adaptive procedure for the scaled boundary finite‐element method
Authors: Deeks Andrew J. , Wolf John P. 
Published: October 2002

AbstractThe scaled boundary finite‐element method (a novel semi‐analytical method for solving linear partial differential equations) involves the solution of a quadratic eigenproblem, the computational expense of which rises rapidly as the number of degrees of freedom increases. Consequently, it is desirable to use the minimum number of degrees of freedom necessary to achieve the accuracy desired. Stress recovery and error estimation techniques for the method have recently been developed. This paper describes anh‐hierarchical adaptive procedure for the scaled boundary finite‐element method. To allow full advantage to be taken of the ability of the scaled boundary finite‐element method to model stress singularities at the scaling centre, and to avoid discretization of certain adjacent segments of the boundary, a sub‐structuring technique is used. The effectiveness of the procedure is demonstrated through a set of examples. The procedure is compared with a similarh‐hierarchical finite element procedure. Since the error estimators in both cases evaluate the energy norm of the stress error, the computational cost of solutions of similar overall accuracy can be compared directly. The examples include the first reported direct comparison of the computational efficiency of the scaled boundary finite‐element method and the finite element method. The scaled boundary finite‐element method is found to reduce the computational effort considerably. Copyright © 2002 John Wiley & Sons, Ltd.
An improved unsteady, unstructured, artificial compressibility, finite volume scheme for viscous incompressible flows: Part I. Theory and implementation
Authors: Malan A. G. , Lewis R. W. , Nithiarasu P. 
Published: October 2002

AbstractA robust, artificial compressibility scheme has been developed for modelling laminar steady state and transient, incompressible flows over a wide range of Reynolds and Rayleigh numbers. Artificial compressibility is applied in a consistant manner resulting in a system of preconditioned governing equations. A locally generalized preconditioner is introduced, designed to be robust and offer good convergence rates. Free artificial compressibility parameters in the equations are automated to allow ease of use while facilitating improved or comparable convergence rates as compared with the standard artificial compressibility scheme. Memory efficiency is achieved through a multistage, pseudo‐time‐explicit time‐marching solution procedure. A node‐centred dual‐cell edge‐based finite volume discretization technique, suitable for unstructured grids, is used due to its computational efficiency and high‐resolution spatial accuracy. In the interest of computational efficiency and ease of implementation, stabilization is achieved via a scalar‐valued artificial dissipation scheme. Temporal accuracy is facilitated by employing a second‐order accurate, dual‐time‐stepping method. In this part of the paper the theory and implementation details are discussed. In Part II, the scheme will be applied to a number of example problems to solve flows over a wide range of Reynolds and Rayleigh numbers. Copyright © 2002 John Wiley & Sons, Ltd.
Global parameterization of a topological surface defined as a collection of trimmed bi‐parametric patches: Application to automatic mesh construction
Authors: Noël Frédéric 
Published: October 2002

AbstractWe describe a new geometric algorithm to map surfaces into a plane convex area. The mapping transformation is bijective; it redefines the whole surface as a unique bi‐parametric patch. Thus this mapping provides a global parametrization of the surface.The surfaces are issued from industrial CAD software; they are usually described by a large number of patches and there are many shortcomings. Indeed, the decomposition into patches depends on the algorithm of the geometric modelling system used for design and usually has no meaning for any technological application. Moreover, in many cases, the surface definition is not compatible, i.e. patches are not well connected, some patches are self‐intersecting or intersect each other. Many applications are hard to address because of these defects. In this paper we show how patch‐independent meshing techniques may be easily automated using a unique metric in a plane parametric space. Thus we provide an automatic procedure to build valid meshes over free‐form surfaces issued from industrial CAD software (Computer Aided Design: this terminology should refer to a large amount of software. For the scope of this paper we only refer to geometric modelling systems. Indeed geometric modelling systems remain the kernel of many CAD software). Copyright © 2002 John Wiley & Sons, Ltd.
RobustH∞control for uncertain linear neutral delay systems
Authors: Xu Shengyuan , Lam James , Yang Chengwu 
Published: October 2002

AbstractThis paper deals with the problem of robustH∞control for uncertain linear neutral delay systems. The parameter uncertainty under consideration is assumed to be norm‐bounded time‐invariant and appears in all the matrices of the state‐space model. The problem we address is the design of memoryless state feedback controllers such that the closed‐loop system is asymptotically stable and theH∞norm of the closed‐loop transfer function from disturbance to the controlled output is strictly less than a prescribed positive scalar for all admissible uncertainties. In terms of a linear matrix inequality (LMI), a sufficient condition for the solvability of the above problem is proposed. When this matrix inequality is feasible, an explicit expression for the desired state feedback controller is given. Furthermore, a numerical example is provided to demonstrate the effectiveness of the proposed approach. Copyright © 2002 John Wiley & Sons, Ltd.
BCL10 in malignant lymphomas – an evaluation using fluorescence in situ hybridization
Authors: Achuthan R. , Bell S. M. , Carr I. M. , Leek J. P. , Roberts P. , Horgan K. , Markham A. F. , Selby P. J. , MacLennan K. A. 
Published: October 2002

AbstractBCL10 is a tumour suppressor gene originally cloned from a t(1;14)(p22;q32) breakpoint in a case of mucosa‐associated lymphoid tissue (MALT) lymphoma. Translocations involving this gene, though uncommon, are sometimes encountered in MALT lymphomas. This gene is thought to play an important role in the development of malignant lymphomas. Fluorescence in situ hybridization (FISH) was therefore undertaken on 22 cases of malignant lymphoma of varying histology to establish the incidence of rearrangements involving the BCL10 gene. Initially, one case with a novel t(1;2)(p22;p12) translocation involving the BCL10 gene was identified, in a marginal zone lymphoma of the MALT type, and was reported elsewhere. Seven other cases were subsequently identified with abnormalities in the 1p region, including a translocation with a breakpoint in the 1p22 region in a case of lymphoblastic lymphoma. However, none of these involved the BCL10 gene. Mutation analysis of BCL10 was then performed on 57 cases of malignant lymphoma, including 17 MALT lymphomas, by single‐strand conformational polymorphism (SSCP) analysis of tumour DNA. Tissue was obtained for mutation analysis for 12 of the 22 cases analysed by FISH. Selected cases with SSCP band shifts were further studied by direct sequencing. Polymorphisms were identified in eight cases, but no mutations of pathogenic significance were identified. Further RT‐PCR and mutation analysis was performed on cDNAs from 12 cases (four MALT, seven diffuse large B‐cell lymphoma, one Hodgkin's disease) in which DNA analysis had already been completed. This included the MALT lymphoma with the t(1;2)(p22;p12) rearrangement. Again, no mutations were identified in the coding sequence. This study confirms that rearrangements of the BCL10 gene are uncommon in lymphoma (1/22) and may be limited tothe MALT subtype of non‐Hodgkin's lymphomas. It was also found that breakpoints or rearrangements in the 1p22 region do not necessarily involve the BCL10 gene. Moreover, the absence of mutations at both the DNA (0/60) and the mRNA (0/12) level indicates that this gene is not frequently inactivated by mutation, in those tumours in which it is not involved in translocations. Our findings suggest that the BCL10 gene is unlikely to have a frequent or key role in general lymphomagenesis. Copyright © 2001 John Wiley & Sons, Ltd.
The Ki‐67 protein interacts with members of the heterochromatin protein 1 (HP1) family: a potential role in the regulation of higher‐order chromatin structure
Authors: Scholzen Thomas , Endl Elmar , Wohlenberg Claudia , van der Sar Sjaak , Cowell Ian G. , Gerdes Johannes , Singh Prim B. 
Published: October 2002

AbstractThe expression of the nuclear protein Ki‐67 (pKi‐67) is strictly correlated with cell proliferation. Because of this, anti‐Ki‐67 antibodies can be used as operational markers to estimate the growth fraction of human neoplasia in situ. For a variety of tumours, the assessment of pKi‐67 expression has repeatedly been proven to be of prognostic value for survival and tumour recurrence, but no cellular function has yet been ascribed to the Ki‐67 protein. This study shows that a C‐terminal domain of pKi‐67 (Kon21) is able to bind to all three members of the mammalian heterochromatin protein 1 (HP1) family in vitro and in vivo. This interaction can be manipulated in living cells, as evidenced by ectopic expression of GFP‐tagged HP1 proteins in HeLa cells, which results in a dramatic relocalization of endogenous pKi‐67. Taken together, the data presented in this study suggest a role for pKi‐67 in the control of higher‐order chromatin structure. Copyright © 2001 John Wiley & Sons, Ltd.
Specific activation of the non‐classical class I histocompatibility HLA‐G antigen and expression of the ILT2 inhibitory receptor in human breast cancer
Authors: Lefebvre Sophie , Antoine Martine , Uzan Serge , McMaster Michael , Dausset Jean , Carosella Edgardo D. , Paul Pascale 
Published: October 2002

AbstractThe HLA‐G molecule is a non‐classical HLA class I antigen selectively expressed by trophoblastic cells that invade the maternal decidua during human pregnancy. HLA‐G is believed to contribute to tolerance of the semi‐allogeneic fetus by inhibiting maternal immune responses. Similarly, HLA‐G expression in tumour cells may favour their escape from host immune surveillance. This study investigated HLA‐G expression in human mammary tumours. Immunohistochemical analysis of cryo‐preserved and paraffin‐embedded breast tissue biopsies, using two HLA‐G‐specific antibodies, revealed that unlike non‐cancerous breast tissue in the vicinity of the tumour, 14 out of 36 breast cancer lesions selectively expressed HLA‐G. HLA‐G expression was significantly more frequent in lesions that were highly infiltrated by host immune cells, thus correlating HLA‐G activation with inflammation. Further histological and double‐staining immunofluorescence analysis attributed HLA‐G expression mainly to tumour epithelial cells and to subsets of infiltrating CD68+ and CD8+ cells. RT‐PCR analysis suggested that HLA‐G was activated at the transcriptional level in breast tumours. The presence of ILT2 (Ig‐like transcript 2) killing inhibitory receptors known to interact with HLA‐G was also demonstrated in host immune cells that infiltrate breast cancer lesions. These results indicate that HLA‐G is up‐regulated at high frequencies in human breast cancer, where it may impair efficient anti‐tumour immunity. Copyright © 2001 John Wiley & Sons, Ltd.
MYCN expression in human rhabdomyosarcoma cell lines and tumour samples
Authors: Toffolatti Luisa , Frascella Emanuela , Ninfo Vito , Gambini Claudio , Forni Marco , Carli Modesto , Rosolen Angelo 
Published: October 2002

AbstractThe MYCN oncogene encodes a phosphoprotein that acts as a transcription factor and is involved in the regulation of cell proliferation and differentiation in normal as well as in cancer cells.MYCN amplification and expression have been reported in various tumours, including neuroblastoma and lung cancer, but little is known about its expression in human rhabdomyosarcoma. MYCN expression and amplification were studied in five alveolar and five embryonal rhabdomyosarcoma cell lines and in 19 tumour biopsies. All the cell lines studied expressed MYCN RNA, as demonstrated by northern blot analysis and RT‐PCR, but the oncogene was amplified in only one. Similarly, MYCN protein was detected in all cell lines by western blot analysis, with higher levels of expression in alveolar than in embryonal rhabdomyosarcoma cells. RT‐PCR analysis of tumour samples demonstrated 18/19 cases positive for MYCN RNA. Although MYCN expression was higher in alveolar than in embryonal rhabdomyosarcoma cell lines, no clear relationship between histology and level of MYCN expression could be established in this tumour series. These data suggest that MYCN expression is a common feature of rhabdomyosarcoma, independent of gene amplification and without a clear relationship with specific histological and clinical features. Copyright © 2002 John Wiley & Sons, Ltd.