Mathematical model and rule extraction for tool wear monitoring problem using nature inspired techniques

In this paper, pattern classification problem in tool wear monitoring is solved using nature inspired techniques such as Genetic Programming(GP) and Ant-Miner (AM). The main advantage of GP and AM is their ability to learn the underlying data relationships and express them in the form of mathematical equation or simple rules. The extraction of knowledge from the training data set using GP and AM are in the form of Genetic Programming Classifier Expression (GPCE) and rules respectively. The GPCE and AM extracted rules are then applied to set of data in the testing/validation set to obtain the classification accuracy. A major attraction in GP evolved GPCE and AM based classification is the possibility of obtaining an expert system like rules that can be directly applied subsequently by the user in his/her application. The performance of the data classification using GP and AM is as good as the classification accuracy obtained in the earlier study.

A lower bound to the survival probability and an approximate first passage time distribution for Markovian and non-Markovian dynamics in phase space

We derive a very general expression of the survival probability and the first passage time distribution for a particle executing Brownian motion in full phase space with an absorbing boundary condition at a point in the position space, which is valid irrespective of the statistical nature of the dynamics. The expression, together with the Jensen's inequality, naturally leads to a lower bound to the actual survival probability and an approximate first passage time distribution. These are expressed in terms of the position-position, velocity-velocity, and position-velocity variances. Knowledge of these variances enables one to compute a lower bound to the survival probability and consequently the first passage distribution function. As examples, we compute these for a Gaussian Markovian process and, in the case of non-Markovian process, with an exponentially decaying friction kernel and also with a power law friction kernel. Our analysis shows that the survival probability decays exponentially at the long time irrespective of the nature of the dynamics with an exponent equal to the transition state rate constant.

Automatic Road Extraction using High Resolution Satellite Image Based on Texture Progressive Analysis and Normalized Cut Method

In this paper the approach for automatic road extraction for an urban region using structural, spectral and geometric characteristics of roads has been presented. Roads have been extracted based on two levels: Pre-processing and road extraction methods. Initially, the image is pre-processed to improve the tolerance by reducing the clutter (that mostly represents the buildings, parking lots, vegetation regions and other open spaces). The road segments are then extracted using Texture Progressive Analysis (TPA) and Normalized cut algorithm. The TPA technique uses binary segmentation based on three levels of texture statistical evaluation to extract road segments where as, Normalizedcut method for road extraction is a graph based method that generates optimal partition of road segments. The performance evaluation (quality measures) for road extraction using TPA and normalized cut method is compared. Thus the experimental result show that normalized cut method is efficient in extracting road segments in urban region from high resolution satellite image.

Comparison of partial extraction reagents for assessing potential bioavailability of heavy metals in sediments

Assessment of heavy metal bioavailability in sediments is complex because of the number of partial extraction methods available for the assessment and the general lack of certified reference materials. This study evaluates five different extraction methodologies to ascertain the relative strengths and weaknesses of each method. The results are then compared to previously published work to ascertain the most effective partial extraction technique, which was established to be dilute (0.75 – 1 M) nitric acid solutions. These results imply that single reagent; weak acid extractions provide a better assessment of potentially bioavailable metals than the chelating agents used in sequential extraction methods.

Approximate methods for step function response of undamped non-linear spring mass systems with arbitrary hardening type spring characteristic

The possibility of applying two approximate methods for determining the salient features of response of undamped non-linear spring mass systems subjected to a step input, is examined. The results obtained on the basis of these approximate methods are compared with the exact results that are available for some particular types of spring characteristics. The extension of the approximate methods for non-linear systems with general polynomial restoring force characteristics is indicated.

Approximate solutions for the structure of shock waves

Approximate solutions of the B-G-K model equation are obtained for the structure of a plane shock, using various moment methods and a least squares technique. Comparison with available exact solution shows that while none of the methods is uniformly satisfactory, some of them can provide accurate values for the density slope shock thickness delta n . A detailed error analysis provides explanations for this result. An asymptotic analysis of delta n for largeMach numbers shows that it scales with theMaxwell mean free path on the hot side of the shock, and that their ratio is relatively insensitive to the viscosity law for the gas.

Measurement of the Ratio σtt̅ /σZ/γ*→ll and Precise Extraction of the tt̅ Cross Section

We report a measurement of the ratio of the tt̅ to Z/γ* production cross sections in √s=1.96  TeV pp̅ collisions using data corresponding to an integrated luminosity of up to 4.6  fb-1, collected by the CDF II detector. The tt̅ cross section ratio is measured using two complementary methods, a b-jet tagging measurement and a topological approach. By multiplying the ratios by the well-known theoretical Z/γ*→ll cross section predicted by the standard model, the extracted tt̅ cross sections are effectively insensitive to the uncertainty on luminosity. A best linear unbiased estimate is used to combine both measurements with the result σtt̅ =7.70±0.52  pb, for a top-quark mass of 172.5  GeV/c2.

Physicochemical studies on the gelation of hen's egg yolk: Delipidation of yolk plasma by treatment with phospholipase-C and extraction with solvents

A method for the delipidation of egg yolk plasma using phospholipase-C, n-heptane, and 1-butanol has been described. An aggregating protein fraction and a soluble protein fraction were separated by the action of phospholipase-C. The aggregating protein fraction freed of most of the lipids by treatment with n-heptane and 1-butanol was shown to be the apolipoproteins of yolk plasma, whereas the soluble proteins were identified as the livetins. Carbohydrate and the N-terminal amino acid analysis of these protein fractions are reported. A comparison of these protein fractions with the corresponding fractions obtained by formic acid delipidation of yolk plasma has been made. The gelation of yolk plasma by the action of phospholipase-C has been interpreted as an aggregation of lipoproteins caused by ionic interactions. The role of lecithin in maintaining the structural integrity of lipoproteins has been discussed.

Measurement of the Ratio σtt̅ /σZ/γ*→ll and Precise Extraction of the tt̅ Cross Section

We report a measurement of the ratio of the tt̅ to Z/γ* production cross sections in √s=1.96  TeV pp̅ collisions using data corresponding to an integrated luminosity of up to 4.6  fb-1, collected by the CDF II detector. The tt̅ cross section ratio is measured using two complementary methods, a b-jet tagging measurement and a topological approach. By multiplying the ratios by the well-known theoretical Z/γ*→ll cross section predicted by the standard model, the extracted tt̅ cross sections are effectively insensitive to the uncertainty on luminosity. A best linear unbiased estimate is used to combine both measurements with the result σtt̅ =7.70±0.52  pb, for a top-quark mass of 172.5  GeV/c2.

Measurement of the Ratio σtt̅ /σZ/γ*→ll and Precise Extraction of the tt̅ Cross Section

We report a measurement of the ratio of the top-antitop to Z/gamma* production cross sections in sqrt(s) = 1.96 TeV proton-antiproton collisions using data corresponding to an integrated luminosity of up to 4.6 fb-1, collected by the CDF II detector. The top-antitop cross section ratio is measured using two complementary methods, a b-jet tagging measurement and a topological approach. By multiplying the ratios by the well-known theoretical Z/gamma*->ll cross section, the extracted top-antitop cross sections are effectively insensitive to the uncertainty on luminosity. A best linear unbiased estimate is used to combine both measurements with the result sigma_(top-antitop) = 7.70 +/- 0.52 pb, for a top-quark mass of 172.5 GeV/c^2.

An approximate analysis of non-linear non-conservative systems subjected to step function excitation

This paper deals with the approximate analysis of the step response of non-linear nonconservative systems by the application of ultraspherical polynomials. From the differential equations for amplitude and phase, set up by the method of variation of parameters, the approximate solutions are obtained by a generalized averaging technique based on ultraspherical polynomial expansions. The Krylov-Bogoliubov results are given by a particular set of these polynomials. The method has been applied to study the step response of a cubic spring mass system in presence of viscous, material, quadratic, and mixed types of damping. The approximate results are compared with the digital and analogue computer solutions and a close agreement has been found between the analytical and the exact results.

An approximate algorithm for the minimal vertex nested polygon problem

Given two simple polygons, the Minimal Vertex Nested Polygon Problem is one of finding a polygon nested between the given polygons having the minimum number of vertices. In this paper, we suggest efficient approximate algorithms for interesting special cases of the above using the shortest-path finding graph algorithms.