scispace - formally typeset
Search or ask a question
Author

Jie Yang

Bio: Jie Yang is an academic researcher from RMIT University. The author has contributed to research in topics: Medicine & Computer science. The author has an hindex of 78, co-authored 532 publications receiving 20004 citations. Previous affiliations of Jie Yang include Duke University & Federal Reserve System.


Papers
More filters
Journal ArticleDOI
TL;DR: In this article, the nonlinear free vibration of functionally graded nanocomposite beams reinforced by single-walled carbon nanotubes (SWCNTs) based on Timoshenko beam theory and von Karman geometric nonlinearity is investigated.

489 citations

Journal ArticleDOI
TL;DR: In this paper, the free and forced vibration characteristics of functionally graded multilayer graphene nanoplatelet (GPL)/polymer composite plates within the framework of the first-order shear deformation plate theory were investigated.

481 citations

Journal ArticleDOI
TL;DR: In this article, a multilayer beam model with material parameters varying across layers to achieve graded distributions in both porosity and nanofillers was proposed with a particular focus on the effects of weight fraction, distribution pattern, geometry and size of GPL reinforcements on the free vibration and buckling behaviors of the nanocomposite beam with different metal matrixes and porosity coefficients.

414 citations

Journal ArticleDOI
TL;DR: In this article, the buckling and postbuckling behaviors of functionally graded multilayer nanocomposite beams reinforced with a low content of graphene platelets (GPLs) resting on an elastic foundation were investigated.

358 citations

Journal ArticleDOI
TL;DR: In this paper, the nonlinear free vibration of microbeams made of functionally graded materials (FGMs) is investigated based on the modified couple stress theory and von Karman geometric nonlinearity.

354 citations


Cited by
More filters
01 May 1993
TL;DR: Comparing the results to the fastest reported vectorized Cray Y-MP and C90 algorithm shows that the current generation of parallel machines is competitive with conventional vector supercomputers even for small problems.
Abstract: Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of inter-atomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dynamics models which can be difficult to parallelize efficiently—those with short-range forces where the neighbors of each atom change rapidly. They can be implemented on any distributed-memory parallel machine which allows for message-passing of data between independently executing processors. The algorithms are tested on a standard Lennard-Jones benchmark problem for system sizes ranging from 500 to 100,000,000 atoms on several parallel supercomputers--the nCUBE 2, Intel iPSC/860 and Paragon, and Cray T3D. Comparing the results to the fastest reported vectorized Cray Y-MP and C90 algorithm shows that the current generation of parallel machines is competitive with conventional vector supercomputers even for small problems. For large problems, the spatial algorithm achieves parallel efficiencies of 90% and a 1840-node Intel Paragon performs up to 165 faster than a single Cray C9O processor. Trade-offs between the three algorithms and guidelines for adapting them to more complex molecular dynamics simulations are also discussed.

29,323 citations

Book
01 Jan 2009

8,216 citations

Book ChapterDOI
Pavel Berkhin1
01 Jan 2006
TL;DR: This survey concentrates on clustering algorithms from a data mining perspective as a data modeling technique that provides for concise summaries of the data.
Abstract: Clustering is the division of data into groups of similar objects. In clustering, some details are disregarded in exchange for data simplification. Clustering can be viewed as a data modeling technique that provides for concise summaries of the data. Clustering is therefore related to many disciplines and plays an important role in a broad range of applications. The applications of clustering usually deal with large datasets and data with many attributes. Exploration of such data is a subject of data mining. This survey concentrates on clustering algorithms from a data mining perspective.

3,047 citations

Book
01 Jan 1901

2,681 citations