Segmenting point-sampled surfaces

Extracting features from point-based representations of geometric surface models is becoming increasingly important for purposes such as model classification, matching, and exploration. In an earlier paper, we proposed a multiphase segmentation process to identify elongated features in point-sampled surface models without the explicit construction of a mesh or other surface representation. The preliminary results demonstrated the strength and potential of the segmentation process, but the resulting segmentations were still of low quality, and the segmentation process could be slow. In this paper, we describe several algorithmic improvements to overcome the shortcomings of the segmentation process. To demonstrate the improved quality of the segmentation and the superior time efficiency of the new segmentation process, we present segmentation results obtained for various point-sampled surface models. We also discuss an application of our segmentation process to extract ridge-separated features in point-sampled surfaces of CAD models.

Turbulent flow computations on a hybrid cartesian point distribution using meshless solver LSFD-U

This paper may be considered as a sequel to one of our earlier works pertaining to the development of an upwind algorithm for meshless solvers. While the earlier work dealt with the development of an inviscid solution procedure, the present work focuses on its extension to viscous flows. A robust viscous discretization strategy is chosen based on positivity of a discrete Laplacian. This work projects meshless solver as a viable cartesian grid methodology. The point distribution required for the meshless solver is obtained from a hybrid cartesian gridding strategy. Particularly considering the importance of an hybrid cartesian mesh for RANS computations, the difficulties encountered in a conventional least squares based discretization strategy are highlighted. In this context, importance of discretization strategies which exploit the local structure in the grid is presented, along with a suitable point sorting strategy. Of particular interest is the proposed discretization strategies (both inviscid and viscous) within the structured grid block; a rotated update for the inviscid part and a Green-Gauss procedure based positive update for the viscous part. Both these procedures conveniently avoid the ill-conditioning associated with a conventional least squares procedure in the critical region of structured grid block. The robustness and accuracy of such a strategy is demonstrated on a number of standard test cases including a case of a multi-element airfoil. The computational efficiency of the proposed meshless solver is also demonstrated. (C) 2010 Elsevier Ltd. All rights reserved.

Continuous ordering below the tricritical point: A critical test for the kinetic pathway in Fe-12at.% Si alloy

A critical test has been presented to establish the nature of the kinetic pathways for the decomposition of Fe-12 at.% Si alloy below the metastable tricritical point. The results, based on the measurements of saturation magnetization, establish that a congruent ordering from B2 --> D0(3) precedes the development of a B2 + D0(3) two-phase field, consistent with the predictions in 1976 of Allen and Cahn.

Analysis of the Ce 3d-4d4d Auger spectrum with the use of synchrotron radiation

We report 3d-4d4d Auger spectra of Ce metal with the use of synchrotron radiation to excite the initial core hole. By sweeping the excitation energy through the 3d-->4f threshold, it has been possible to excite different initial states selectively, enabling us to analyze the complex spectrum in terms of different contributions arising from various deca channels.

Behaviour of the curve of critical exponents near and away from a double critical point

To investigate the nature of the curve of critical exponents (as a function of the distance from a double critical point), we have combined our measurements of the osmotic compressibility with all published data for quasibinary liquid mixtures. This curve has a parabolic shape. An explanation of this result is advanced in terms of the geometry of the coexistence dome, which is contained in a triangular prism.

The Reproducing Kernel DMS-FEM: 3D Shape Functions and Applications to Linear Solid Mechanics

We propose a family of 3D versions of a smooth finite element method (Sunilkumar and Roy 2010), wherein the globally smooth shape functions are derivable through the condition of polynomial reproduction with the tetrahedral B-splines (DMS-splines) or tensor-product forms of triangular B-splines and ID NURBS bases acting as the kernel functions. While the domain decomposition is accomplished through tetrahedral or triangular prism elements, an additional requirement here is an appropriate generation of knotclouds around the element vertices or corners. The possibility of sensitive dependence of numerical solutions to the placements of knotclouds is largely arrested by enforcing the condition of polynomial reproduction whilst deriving the shape functions. Nevertheless, given the higher complexity in forming the knotclouds for tetrahedral elements especially when higher demand is placed on the order of continuity of the shape functions across inter-element boundaries, we presently emphasize an exploration of the triangular prism based formulation in the context of several benchmark problems of interest in linear solid mechanics. In the absence of a more rigorous study on the convergence analyses, the numerical exercise, reported herein, helps establish the method as one of remarkable accuracy and robust performance against numerical ill-conditioning (such as locking of different kinds) vis-a-vis the conventional FEM.

Theory of the non-Fermi-liquid transition point in the two-impurity Kondo model

We present an explicit solution of the problem of two coupled spin-1/2 impurities, interacting with a band of conduction electrons. We obtain an exact effective bosonized Hamiltonian, which is then treated by two different methods (low-energy theory and mean-field approach). Scale invariance is explicitly shown at the quantum critical point. The staggered susceptibility behaves like ln(T(K)/T) at low T, whereas the magnetic susceptibility and [S1.S2] are well behaved at the transition. The divergence of C(T)/T when approaching the transition point is also studied. The non-Fermi-liquid (actually marginal-Fermi-liquid) critical point is shown to arise because of the existence of anomalous correlations, which lead to degeneracies between bosonic and fermionic states of the system. The methods developed in this paper are of interest for studying more physically relevant models, for instance, for high-T(c) cuprates.

A general procedure for modified crack closure integral in 3D problems with cracks

In linear elastic fracture mechanics (LEFM), Irwin's crack closure integral (CCI) is one of the signficant concepts for the estimation of strain energy release rates (SERR) G, in individual as well as mixed-mode configurations. For effective utilization of this concept in conjunction with the finite element method (FEM), Rybicki and Kanninen [Engng Fracture Mech. 9, 931 938 (1977)] have proposed simple and direct estimations of the CCI in terms of nodal forces and displacements in the elements forming the crack tip from a single finite element analysis instead of the conventional two configuration analyses. These modified CCI (MCCI) expressions are basically element dependent. A systematic derivation of these expressions using element stress and displacement distributions is required. In the present work, a general procedure is given for the derivation of MCCI expressions in 3D problems with cracks. Further, a concept of sub-area integration is proposed which facilitates evaluation of SERR at a large number of points along the crack front without refining the finite element mesh. Numerical data are presented for two standard problems, a thick centre-cracked tension specimen and a semi-elliptical surface crack in a thick slab. Estimates for the stress intensity factor based on MCCI expressions corresponding to eight-noded brick elements are obtained and compared with available results in the literature.

Modification of the sugar specificity of a plant lectin: structural studies on a point mutant of Erythrina corallodendron lectin

A mutant of Erythrina corallodendron lectin was generated with the aim of enhancing its affinity for N-acetylgalactosamine. A tyrosine residue close to the binding site of the lectin was mutated to a glycine in order to facilitate stronger interactions between the acetamido group of the sugar and the lectin which were prevented by the side chain of the tyrosine in the wild-type lectin. The crystal structures of this Y106G mutant lectin in complex with galactose and N-acetylgalactosamine have been determined. A structural rationale has been provided for the differences in the relative binding affinities of the wild-type and mutant lectins towards the two sugars based on the structures. A hydrogen bond between the O6 atom of the sugars and the variable loop of the carbohydrate-binding site of the lectin is lost in the mutant complexes owing to a conformational change in the loop. This loss is compensated by an additional hydrogen bond that is formed between the acetamido group of the sugar and the mutant lectin in the complex with N-acetylgalactosamine, resulting in a higher affinity of the mutant lectin for N-acetylgalactosamine compared with that for galactose, in contrast to the almost equal affinity of the wild-type lectin for the two sugars. The structure of a complex of the mutant with a citrate ion bound at the carbohydrate-binding site that was obtained while attempting to crystallize the complexes with sugars is also presented.

A survey of indian logic from the point of view of computer science

Indian logic has a long history. It somewhat covers the domains of two of the six schools (darsanas) of Indian philosophy, namely, Nyaya and Vaisesika. The generally accepted definition of Indian logic over the ages is the science which ascertains valid knowledge either by means of six senses or by means of the five members of the syllogism. In other words, perception and inference constitute the subject matter of logic. The science of logic evolved in India through three ages: the ancient, the medieval and the modern, spanning almost thirty centuries. Advances in Computer Science, in particular, in Artificial Intelligence have got researchers in these areas interested in the basic problems of language, logic and cognition in the past three decades. In the 1980s, Artificial Intelligence has evolved into knowledge-based and intelligent system design, and the knowledge base and inference engine have become standard subsystems of an intelligent system. One of the important issues in the design of such systems is knowledge acquisition from humans who are experts in a branch of learning (such as medicine or law) and transferring that knowledge to a computing system. The second important issue in such systems is the validation of the knowledge base of the system i.e. ensuring that the knowledge is complete and consistent. It is in this context that comparative study of Indian logic with recent theories of logic, language and knowledge engineering will help the computer scientist understand the deeper implications of the terms and concepts he is currently using and attempting to develop.

Novel gray coded pattern for unwrapping phase in fringe projection based 3D profiling

A method to reliably extract object profiles even with height discontinuities (that leads to 2n pi phase jumps) is proposed. This method uses Fourier transform profilometry to extract wrapped phase, and an additional image formed by illuminating the object of interest by a novel gray coded pattern for phase unwrapping. Simulation results suggest that the proposed approach not only retains the advantages of the original method, but also contributes significantly in the enhancement of its performance. Fundamental advantage of this method stems from the fact that both extraction of wrapped phase and unwrapping the same were done by gray scale images. Hence, unlike the methods that use colors, proposed method doesn't demand a color CCD camera and is ideal for profiling objects with multiple colors.

Explicit and Optimal Exact-Regenerating Codes for the Minimum-Bandwidth Point in Distributed Storage

In the distributed storage setting that we consider, data is stored across n nodes in the network such that the data can be recovered by connecting to any subset of k nodes. Additionally, one can repair a failed node by connecting to any d nodes while downloading beta units of data from each. Dimakis et al. show that the repair bandwidth d beta can be considerably reduced if each node stores slightly more than the minimum required and characterize the tradeoff between the amount of storage per node and the repair bandwidth. In the exact regeneration variation, unlike the functional regeneration, the replacement for a failed node is required to store data identical to that in the failed node. This greatly reduces the complexity of system maintenance. The main result of this paper is an explicit construction of codes for all values of the system parameters at one of the two most important and extreme points of the tradeoff - the Minimum Bandwidth Regenerating point, which performs optimal exact regeneration of any failed node. A second result is a non-existence proof showing that with one possible exception, no other point on the tradeoff can be achieved for exact regeneration.