Book•
Characterisation of Areal Surface Texture
03 Apr 2013-
TL;DR: In this article, the areal field parameters and areal feature parameters were compared to solar cell efficiency and the mechanical bond strength for copper on glass plating applications, using laser-structured cams and conrods.
Abstract: Introduction to surface topography.- The areal field parameters.- The areal feature parameters.- Areal filtering methods.- Areal form removal.- Areal fractal methods.- Choosing the appropriate parameter.- Characterization of individual areal features.- Multi-scale signature of surface topography.- Correlation of areal surface texture parameters to solar cell efficiency.- Characterisation of cylinder liner honing textures for production control.- Characterization of the mechanical bond strength for copper on glass plating applications.- Inspection of laser structured cams and conrods.- Road surfaces.
Citations
More filters
01 Oct 2016-Precision Engineering-journal of The International Societies for Precision Engineering and Nanotechnology
TL;DR: A comprehensive analysis of surface texture metrology for metal additive manufacturing has been performed in this paper, where the results of this analysis are divided into sections that address specific areas of interest: industrial domain; additive manufacturing processes and materials; types of surface investigated; surface measurement technology and surface texture characterisation.
Abstract: A comprehensive analysis of literature pertaining to surface texture metrology for metal additive manufacturing has been performed. This review paper structures the results of this analysis into sections that address specific areas of interest: industrial domain; additive manufacturing processes and materials; types of surface investigated; surface measurement technology and surface texture characterisation. Each section reports on how frequently specific techniques, processes or materials have been utilised and discusses how and why they are employed. Based on these results, possible optimisation of methods and reporting is suggested and the areas that may have significant potential for future research are highlighted.
537 citations
TL;DR: This cross-hatched pattern drawn with an ochre crayon on a ground silcrete flake recovered from approximately 73,000-year-old Middle Stone Age levels at Blombos Cave, South Africa demonstrates the ability of early Homo sapiens in southern Africa to produce graphic designs on various media using different techniques.
Abstract: and depictive representations produced by drawing—known from Europe, Africa and Southeast Asia after 40,000 years ago—are a prime indicator of modern cognition and behaviour1. Here we report a cross-hatched pattern drawn with an ochre crayon on a ground silcrete flake recovered from approximately 73,000-year-old Middle Stone Age levels at Blombos Cave, South Africa. Our microscopic and chemical analyses of the pattern confirm that red ochre pigment was intentionally applied to the flake with an ochre crayon. The object comes from a level associated with stone tools of the Still Bay techno-complex that has previously yielded shell beads, cross-hatched engravings on ochre pieces and a variety of innovative technologies2,3,4,5. This notable discovery pre-dates the earliest previously known abstract and figurative drawings by at least 30,000 years. This drawing demonstrates the ability of early Homo sapiens in southern Africa to produce graphic designs on various media using different techniques.
139 citations
08 Jan 2015
TL;DR: In this article, a new measurement approach by a confocal microscope and three-dimensional surface parameters was proposed to classify different surface orientations and on a special issue in laser sintering: orange peel severity.
Abstract: The surfaces of laser-sintered and laser beam melted parts are characterized by typical surface effects and thus cause difficulties when using the popular tactile profilometry method and conventional two-dimensional surface parameters for analysis. Therefore, this study shows the potential of a new measurement approach by a confocal microscope and three-dimensional surface parameters. Within this study, a special focus is laid on the classification of different surface orientations and on a special issue in laser sintering: orange peel severity.
104 citations
01 May 2021
TL;DR: In this article, a review of the structure of mean flow profiles over rough surfaces, and its correlation with smooth wall mean flow profile is presented, which can contribute to prospective experimental and CFD work, and for characterising rough-wall turbulent flows and heat transfer in different academic and engineering applications.
Abstract: Surface roughness can significantly influence the fluid dynamics and heat transfer in convective flows by inducing perturbations in the velocity profile which affect surface drag, turbulent mixing and heat transfer. While surface roughness can often negatively affect the performance of systems, it can also lead to performance improvements, such as in convective flows where roughness elements have been shown to enhance heat transfer. Turbulent flows over rough surfaces have been studied for about a century leading to significant developments in this field. Direct Numerical Simulation (DNS) has made significant contributions to the knowledge of turbulent flows over rough surfaces as well as evaluation of the developed theories. Moreover, the turbulent closures model has seen wide use for simulation of rough-wall turbulent flows in practical applications where DNS is hindered by its complexity and computational resources. Despite a significant number of experimental and CFD studies and the latest advances in this field, a recent review was not available. Therefore, this review surveys the past and recent experimental and numerical studies to address the fundamentals and theories related to the structure of turbulent flows over rough walls. This study chiefly investigates the structure of mean flow profile over rough surfaces, and its correlation with smooth wall mean flow profile. This review study can contribute to prospective experimental and CFD work, and for characterising rough-wall turbulent flows and heat transfer in different academic and engineering applications such as aerodynamics, hydraulics, meteorology, and manufacturing. The review concludes that despite significant progress, the structure of turbulent flow is still not fully understood. This is mainly due to a lack of systematic studies on the structure of turbulent flow and also due to the variety of roughness which influence the dynamics of the flow in the roughness sublayers. The current roughness scale (sand-grain roughness height) fails to completely characterise roughness in many cases. Therefore, there is a need for a universal roughness scale that can describe every type of roughness and be used in any rough-flow regimes, including fully rough and transitionally rough regimes.
98 citations
TL;DR: The calibration and verification infrastructure to support areal surface texture measurement and characterisation will be reviewed and the concept and current infrastructure for determining the metrological characteristics of instruments will be highlighted.
91 citations
References
More filters
01 Jan 1967
TL;DR: The k-means algorithm as mentioned in this paper partitions an N-dimensional population into k sets on the basis of a sample, which is a generalization of the ordinary sample mean, and it is shown to give partitions which are reasonably efficient in the sense of within-class variance.
Abstract: The main purpose of this paper is to describe a process for partitioning an N-dimensional population into k sets on the basis of a sample. The process, which is called 'k-means,' appears to give partitions which are reasonably efficient in the sense of within-class variance. That is, if p is the probability mass function for the population, S = {S1, S2, * *, Sk} is a partition of EN, and ui, i = 1, 2, * , k, is the conditional mean of p over the set Si, then W2(S) = ff=ISi f z u42 dp(z) tends to be low for the partitions S generated by the method. We say 'tends to be low,' primarily because of intuitive considerations, corroborated to some extent by mathematical analysis and practical computational experience. Also, the k-means procedure is easily programmed and is computationally economical, so that it is feasible to process very large samples on a digital computer. Possible applications include methods for similarity grouping, nonlinear prediction, approximating multivariate distributions, and nonparametric tests for independence among several variables. In addition to suggesting practical classification methods, the study of k-means has proved to be theoretically interesting. The k-means concept represents a generalization of the ordinary sample mean, and one is naturally led to study the pertinent asymptotic behavior, the object being to establish some sort of law of large numbers for the k-means. This problem is sufficiently interesting, in fact, for us to devote a good portion of this paper to it. The k-means are defined in section 2.1, and the main results which have been obtained on the asymptotic behavior are given there. The rest of section 2 is devoted to the proofs of these results. Section 3 describes several specific possible applications, and reports some preliminary results from computer experiments conducted to explore the possibilities inherent in the k-means idea. The extension to general metric spaces is indicated briefly in section 4. The original point of departure for the work described here was a series of problems in optimal classification (MacQueen [9]) which represented special
24,320 citations
"Characterisation of Areal Surface T..." refers background in this paper
...Proc ASPE, Nashville Jiang X, Scott PJ, Whitehouse DJ, Blunt L (2007) Paradigm shifts in surface metrology....
[...]
TL;DR: The purpose of this article is to serve as an introduction to ROC graphs and as a guide for using them in research.
17,017 citations
TL;DR: The chapter discusses two important directions of research to improve learning algorithms: the dynamic node generation, which is used by the cascade correlation algorithm; and designing learning algorithms where the choice of parameters is not an issue.
Abstract: Publisher Summary This chapter provides an account of different neural network architectures for pattern recognition. A neural network consists of several simple processing elements called neurons. Each neuron is connected to some other neurons and possibly to the input nodes. Neural networks provide a simple computing paradigm to perform complex recognition tasks in real time. The chapter categorizes neural networks into three types: single-layer networks, multilayer feedforward networks, and feedback networks. It discusses the gradient descent and the relaxation method as the two underlying mathematical themes for deriving learning algorithms. A lot of research activity is centered on learning algorithms because of their fundamental importance in neural networks. The chapter discusses two important directions of research to improve learning algorithms: the dynamic node generation, which is used by the cascade correlation algorithm; and designing learning algorithms where the choice of parameters is not an issue. It closes with the discussion of performance and implementation issues.
13,033 citations
Book•
01 Nov 19968,608 citations
TL;DR: A comprehensive description of the primal-dual interior-point algorithm with a filter line-search method for nonlinear programming is provided, including the feasibility restoration phase for the filter method, second-order corrections, and inertia correction of the KKT matrix.
Abstract: We present a primal-dual interior-point algorithm with a filter line-search method for nonlinear programming. Local and global convergence properties of this method were analyzed in previous work. Here we provide a comprehensive description of the algorithm, including the feasibility restoration phase for the filter method, second-order corrections, and inertia correction of the KKT matrix. Heuristics are also considered that allow faster performance. This method has been implemented in the IPOPT code, which we demonstrate in a detailed numerical study based on 954 problems from the CUTEr test set. An evaluation is made of several line-search options, and a comparison is provided with two state-of-the-art interior-point codes for nonlinear programming.
7,966 citations