scaling up cosine interesting pattern discovery a depth first method this paper presents an efficient algorithm called cosminer t for interesting pattern discovery the widely used cosine similarity found to possess the null invariance property and the anti cross support pattern property is adopted as the interestingness measure in cosminer t cosminer t is generally an fp growth like depth first traversal algorithm that rests on an important property of the cosine similarity the conditional anti monotone property camp the combined use of camp and the depth first support ascending traversal strategy enables the pre pruning of uninteresting patterns during the mining process of cosminer t extensive experiments demonstrate the high efficiency of cosminer t in interesting pattern discovery in comparison to the breath first strategy and the post evaluation strategy in particular cosminer t shows its capability in suppressing the generation of cross support patterns and discovering rare but truly interesting patterns finally an interesting case of landmark recognition is presented to illustrate the value of cosine interesting patterns found by cosminer t in real world applications

a new cloud based hp finite element method a hybrid computational method for solving boundary value problems is introduced which combines features of the meshless hp cloud methods with features of conventional finite elements the method admits straightforward nonuniform hp type approximations easy implementation of essential boundary conditions is robust under severe distortions of the mesh and can deliver exponential rates of convergence results of numerical experiments are presented

composite grid method for hybrid systems abstract a composite grid method is developed for solving symmetric indefinite linear systems arising from the three field hybrid variational principle which weakly enforces compatability and traction continuity conditions between independently modeled substructures the new solution approach decomposes the hybrid system into a hierarchical global local problem consisting of a positive definite global problem and an indefinite local system that are derived using minimization on the subspace and the stationarity principle respectively an innovative transformation of the indefinite local problem into an equivalent symmetric positive definite system makes the solution of the local problem possible either by a direct solver without pivoting or by a preconditioned iterative method alternative semi iterative solution procedures for the case when auxiliary coarse grid is not available are also developed this includes a multigrid like scheme that uses a mathematical model based on the collocation formulation as the auxiliary grid numerical performance studies for two dimensional plane stress and shell problems are carried out to test the usefulness of the proposed procedures

bayesian graph edit distance this paper describes a novel framework for comparing and matching corrupted relational graphs the paper develops the idea of edit distance originally introduced for graph matching by sanfeliu and fu 1983 we show how the levenshtein distance 1966 can be used to model the probability distribution for structural errors in the graph matching problem this probability distribution is used to locate matches using map label updates we compare the resulting graph matching algorithm with that recently reported by wilson and hancock the use of edit distance offers an elegant alternative to the exhaustive compilation of label dictionaries moreover the method is polynomial rather than exponential in its worst case complexity we support our approach with an experimental study on synthetic data and illustrate its effectiveness on an uncalibrated stereo correspondence problem this demonstrates experimentally that the gain in efficiency is not at the expense of quality of match

division theorem combined with the riccati equation for solving some nonlinear schrodinger like equations abstract in this paper division theorem is employed for obtaining the first integral with polynomial coefficients of two dimensional autonomous planar system which can construct the periodic and solitary wave solutions of nonlinear partial differential equations by using the solutions of the riccati equation the power of this manageable method is presented by applying it to some nonlinear schrodinger like equations this approach can also be applied to other nonlinear differential equations

the earth mover s distance as a metric for image retrieval we investigate the properties of a metric between two distributions the earth mover s distance emd for content based image retrieval the emd is based on the minimal cost that must be paid to transform one distribution into the other in a precise sense and was first proposed for certain vision problems by peleg werman and rom for image retrieval we combine this idea with a representation scheme for distributions that is based on vector quantization this combination leads to an image comparison framework that often accounts for perceptual similarity better than other previously proposed methods the emd is based on a solution to the transportation problem from linear optimization for which efficient algorithms are available and also allows naturally for partial matching it is more robust than histogram matching techniques in that it can operate on variable length representations of the distributions that avoid quantization and other binning problems typical of histograms when used to compare distributions with the same overall mass the emd is a true metric in this paper we focus on applications to color and texture and we compare the retrieval performance of the emd with that of other distances

an eigenspace projection clustering method for inexact graph matching in this paper we show how inexact graph matching that is the correspondence between sets of vertices of pairs of graphs can be solved using the renormalization of projections of the vertices as defined in this case by their connectivities into the joint eigenspace of a pair of graphs and a form of relational clustering an important feature of this eigenspace renormalization projection clustering epc method is its ability to match graphs with different number of vertices shock graph based shape matching is used to illustrate the model and a more objective method for evaluating the approach using random graphs is explored with encouraging results

error correcting graph matching on the influence of the underlying cost function investigates the influence of the cost function on the optimal match between two graphs it is shown that for a given cost function there are an infinite number of other cost functions that lead for any given pair of graphs to the same optimal error correcting matching furthermore it is shown that well known concepts from graph theory such as graph isomorphism subgraph isomorphism and maximum common subgraph are special cases of optimal error correcting graph matching under particular cost functions

susan a new approach to low level image processing this paper describes a new approach to low level image processing in particular edge and corner detection and structure preserving noise reduction non linear filtering is used to define which parts of the image are closely related to each individual pixel each pixel has associated with it a local image region which is of similar brightness to that pixel the new feature detectors are based on the minimization of this local image region and the noise reduction method uses this region as the smoothing neighbourhood the resulting methods are accurate noise resistant and fast details of the new feature detectors and of the new noise reduction method are described along with test results

structural matching by discrete relaxation this paper describes a bayesian framework for performing relational graph matching by discrete relaxation our basic aim is to draw on this framework to provide a comparative evaluation of a number of contrasting approaches to relational matching broadly speaking there are two main aspects to this study firstly we focus on the issue of how relational inexactness may be quantified we illustrate that several popular relational distance measures can be recovered as specific limiting cases of the bayesian consistency measure the second aspect of our comparison concerns the way in which structural inexactness is controlled we investigate three different realizations of the matching process which draw on contrasting control models the main conclusion of our study is that the active process of graph editing outperforms the alternatives in terms of its ability to effectively control a large population of contaminating clutter

a coarse to fine framework to efficiently thwart plagiarism this paper presents a systematic framework using multilevel matching approach for plagiarism detection pd a multilevel structure i e document paragraph sentence is used to represent each document in document and paragraph level we use traditional dimensionality reduction technique to project high dimensional histograms into latent semantic space the earth mover s distance emd instead of exhaustive matching is employed to retrieve relevant documents which enables us to markedly shrink the searching domain two pd algorithms are designed and implemented to efficiently flag the suspected plagiarized document sources we conduct extensive experimental verifications including document retrieval pd the study of the effects of parameters and the empirical study of the system response the results corroborate that the proposed approach is accurate and computationally efficient for performing pd

the extended tanh method for abundant solitary wave solutions of nonlinear wave equations the extended tanh method is used to establish abundant solitary wave solutions of nonlinear wave equations the obtained solutions include solitons kinks and plane periodic solutions the study is an extension to the remarkable development by malfliet 1 the extended tanh method presents a wider applicability for handling nonlinear wave equations

singular full field stresses in composite laminates with open holes a method of the superposition of a hybrid and displacement approximation was developed to provide the accurate stress fields in a multilayered composite laminate including the singular neighborhood of the ply interface and the hole edge asymptotic analysis was used to derive the hybrid stress functions the displacement approximation is based on the polynomial b spline functions the method provides the determination of the coefficient of the singular term along with convergent stress components including the singular regions reissner s variational principle was employed simple 45 45 s and quasi isotropic im7 5250 45 90 45 0 s laminates were analyzed uniaxial loading and residual stress calculation quasi isotropic laminate were considered a convergence study showed that accurate values of the coefficient of the singular term of the asymptotic stress expansion could be obtained with coarse out of plane and in plane subdivisions the interaction between the singular terms on the neighboring interfaces was found to be important for the convergence with coarse subdivisions converged transverse interlaminar stress components as a function of the distance from the hole edge were shown for all examples

spline variational three dimensional stress analysis of laminated composite plates with open holes abstract independent polynomial spline approximation of displacement and interlaminar tractions is proposed for stress analysis in laminates with open holes spline approximation eliminates the inter element compatibility problems leading to unsatisfactory finite element results in the presence of field singularities spline approximation offers continuity of displacement strain and stress fields within homogeneous domains preserving at the same time the advantages of local approximation such as sparsity of the resulting system of equations three dimensional full field solution is obtained converged stresses and consistent boundary conditions such as interlaminar traction continuity are displayed a closed form asymptotic solution valid in the vicinity of the hole edge at the interface of two orthotropic plies of arbitrary thickness has been developed to verify the spline approximation based full field solution excellent agreement has been observed for interlaminar stresses in a 45 45 s as4 3501 6 laminate under uniaxial tension the polynomial spline approximation ideally suited for problems concerned with the singular solution behavior has been applied to three dimensional stress analysis in practical composites containing tens of plies

an eigendecomposition approach to weighted graph matching problems an approximate solution to the weighted graph matching problem is discussed for both undirected and directed graphs the weighted graph matching problem is that of finding the optimum matching between two weighted graphs which are graphs with weights at each arc the proposed method uses an analytic instead of a combinatorial or iterative approach to the optimum matching problem using the eigendecompositions of the adjacency matrices in the case of the undirected graph matching problem or hermitian matrices derived from the adjacency matrices in the case of the directed graph matching problem a matching close to the optimum can be found efficiently when the graphs are sufficiently close to each other simulation results are given to evaluate the performance of the proposed method

a new algorithm for error tolerant subgraph isomorphism detection we propose a new algorithm for error correcting subgraph isomorphism detection from a set of model graphs to an unknown input graph the algorithm is based on a compact representation of the model graphs this representation is derived from the set of model graphs in an off line preprocessing step the main advantage of the proposed representation is that common subgraphs of different model graphs are represented only once therefore at run time given an unknown input graph the computational effort of matching the common subgraphs for each model graph onto the input graph is done only once consequently the new algorithm is only sublinearly dependent on the number of model graphs furthermore the new algorithm can be combined with a future cost estimation method that greatly improves its run time performance

the tanh coth method for solitons and kink solutions for nonlinear parabolic equations abstract the tanh coth method is used to derive solitons and kink solutions for some of the well known nonlinear parabolic partial differential equations the equations include the fisher equation newell whithead equation allen cahn equation fitzhugh nagumo equation fisher s equation and the burgers fisher equation the new tanh coth approach provides abundant solitons and kink solutions in addition to the existing ones the power of this manageable method is confirmed

the effect of perturbed advection on a class of solutions of a non linear reaction diffusion equation in this work the traveling wave solutions of a one dimensional reaction diffusion equation with advection are studied the traveling wave solutions are obtained using the g g expansion method the shock thickness and spectral stability have been discussed for the obtained solution in the parameter interval the essential spectra of the perturbed and linearized differential operator about the traveling antikink and kink solutions at the equilibrium states are obtained the point spectrum is calculated using evans function with lie midpoint method and magnus method it is shown that for a symmetric potential well the traveling kink and antikink solutions which connect the stable equilibrium states of the system are stable it is observed that the perturbation on the advection exhibits contrasting effect on the solution properties shock thickness and the eigenvalue of kink and antikink solutions variation of the reaction coefficient leads to instability of the solutions unlike the diffusion coefficient which enhances the stability on the other hand the variation of reaction and diffusion coefficients show the monotonic effect on the shock thickness of the traveling kink and antikink solutions this study is expected to be useful in analyzing the slow or fast invasion and stability of the population movement in different steady states

travelling wave solutions of the cahn allen equation by using first integral method abstract in this paper we established travelling wave solutions of the nonlinear equation the first integral method was used to construct travelling wave solutions of the cahn allen equation the obtained results include periodic and solitary wave solutions the power of this manageable method is confirmed

new approach for exact solutions of time fractional cahn allen equation and time fractional phi 4 equation abstract in this article new exact analytical solutions of some nonlinear evolution equations nlees arising in science engineering and mathematical physics namely time fractional cahn allen equation and time fractional phi 4 equation are developed using tanh method by means of fractional complex transform the obtained results are demonstrated by graphs for the new solutions

time fractional cahn allen and time fractional klein gordon equations lie symmetry analysis explicit solutions and convergence analysis abstract this research analyzes the symmetry analysis explicit solutions and convergence analysis to the time fractional cahn allen ca and time fractional klein gordon kg equations with riemann liouville rl derivative the time fractional ca and time fractional kg are reduced to respective nonlinear ordinary differential equation of fractional order we solve the reduced fractional odes using an explicit power series method the convergence analysis for the obtained explicit solutions are investigated some figures for the obtained explicit solutions are also presented

relative sensitivity of a family of closet point graphs in computer vision applications abstract various graph theoretic definitions of neighborhood have been used in the past in computer vision and clustering applications in this paper we study the properties of a set of four related closest point graphs using monte carlo methods i the delaunay triangulation dt and its dual voronoi tessellation ii the gabriel graph gg iii the relative neighborhood graph rng and iv the minimum spanning tree mst we examine the suitability of these graphs in the detection of structure in noisy images using the hough transform we also explore each graph s structural stability under random positional noise delaunay triangulation is shown to be the least sensitive to such noisy conditions

transfer latent variable model based on divergence analysis latent variable models are powerful dimensionality reduction approaches in machine learning and pattern recognition however this kind of methods only works well under a necessary and strict assumption that the training samples and testing samples are independent and identically distributed when the samples come from different domains the distribution of the testing dataset will not be identical with the training dataset therefore the performance of latent variable models will be degraded for the reason that the parameters of the training model do not suit for the testing dataset this case limits the generalization and application of the traditional latent variable models to handle this issue a transfer learning framework for latent variable model is proposed which can utilize the distance or divergence of the two datasets to modify the parameters of the obtained latent variable model so we do not need to rebuild the model and only adjust the parameters according to the divergence which will adopt different datasets experimental results on several real datasets demonstrate the advantages of the proposed framework

image retrieval based on shape similarity by edge orientation autocorrelogram abstract this paper introduces a new feature vector for shape based image indexing and retrieval this feature classifies image edges based on two factors their orientations and correlation between neighboring edges hence it includes information of continuous edges and lines of images and describes major shape properties of images this scheme is effective and robustly tolerates translation scaling color illumination and viewing position variations experimental results show superiority of proposed scheme over several other indexing methods averages of precision and recall rates of this new indexing scheme for retrieval as compared with traditional color histogram are 1 99 and 1 59 times respectively these ratios are 1 26 and 1 04 compared to edge direction histogram

the hyperbolic allen cahn equation exact solutions using the first integral method a general set of analytical solutions is obtained for the hyperbolic allen cahn equation the solutions are presented by i the class of continual solutions described by profiles for traveling waves of the order parameter and ii the class of singular solutions which exhibit unbounded discontinuity in the profile of the order parameter at the origin of the coordinate system it is shown that the solutions include the previous analytical results for the parabolic allen cahn equation as a limited class of functions in which the inertial effects are omitted

graph edit distance from spectral seriation this paper is concerned with computing graph edit distance one of the criticisms that can be leveled at existing methods for computing graph edit distance is that they lack some of the formality and rigor of the computation of string edit distance hence our aim is to convert graphs to string sequences so that string matching techniques can be used to do this we use a graph spectral seriation method to convert the adjacency matrix into a string or sequence order we show how the serial ordering can be established using the leading eigenvector of the graph adjacency matrix we pose the problem of graph matching as a maximum a posteriori probability map alignment of the seriation sequences for pairs of graphs this treatment leads to an expression in which the edit cost is the negative logarithm of the a posteriori sequence alignment probability we compute the edit distance by finding the sequence of string edit operations which minimizes the cost of the path traversing the edit lattice the edit costs are determined by the components of the leading eigenvectors of the adjacency matrix and by the edge densities of the graphs being matched we demonstrate the utility of the edit distance on a number of graph clustering problems

the first integral method for the time fractional kaup boussinesq system with time dependent coefficient the first integral method fim is applied to reach the different type solutions of the time fractional kaup boussinesq fkb system with time dependent coefficient it is obtained the envelope bell shaped triangular and kink soliton solutions of this equation the method is an effective one to reach the different types of solutions of fractional nonlinear partial differential equations fnpde

inexact graph matching using genetic search this paper describes a framework for performing relational graph matching using genetic search there are three novel ingredients to the work firstly we cast the optimisation process into a bayesian framework by exploiting the recently reported global consistency measure of wilson and hancock as a fitness measure the second novel idea is to realise the crossover process at the level of subgraphs rather than employing string based or random crossover finally we accelerate convergence by employing a deterministic hill climbing process prior to selection since we adopt the bayesian consistency measure as a fitness function the basic measure of relational distance underpinning the technique is hamming distance our standpoint is that genetic search provides a more attractive means of performing stochastic discrete optimisation on the global consistency measure than alternatives such as simulated annealing moreover the action of the optimisation process is easily understood in terms of its action in the hamming distance domain we demonstrate empirically not only that the method possesses polynomial convergence time but also that the convergence rate is more rapid than simulated annealing we provide some experimental evaluation of the method in the matching of aerial stereograms and evaluate its sensitivity on synthetically generated graphs

simple fast algorithms for the editing distance between trees and related problems ordered labeled trees are trees in which the left to right order among siblings is significant the distance between two ordered trees is considered to be the weighted number of edit operations insert delete and modify to transform one tree to another the problem of approximate tree matching is also considered specifically algorithms are designed to answer the following kinds of questions 1 what is the distance between two trees 2 what is the minimum distance between t 1 and t 2 when zero or more subtrees can be removed from t 2 3 let the pruning of a tree at node n mean removing all the descendants of node n the analogous question for prunings as for subtrees is answered a dynamic programming algorithm is presented to solve the three questions in sequential time o t 1 times t 2 times min textit depth t 1 textit leaves t 1 times min textit depth t 2 textit leaves t 2 and space o t 1 times t 2 compared with o t 1 times t 2 t

the first integral method to study the burgers korteweg de vries equation in this paper applying the theory of commutative algebra we propose a new approach which we currently call the first integral method to study the burgers korteweg de vries equation

exact solutions of some nonlinear systems of partial differential equations by using the first integral method abstract in recent years many approaches have been utilized for finding the exact solutions of nonlinear systems of partial differential equations in this paper the first integral method introduced by feng is adopted for solving some important nonlinear systems of partial differential equations including kdv kaup boussinesq and wu zhang systems analytically by means of this method some exact solutions for these systems of equations are formally obtained the results obtained confirm that the proposed method is an efficient technique for analytic treatment of a wide variety of nonlinear systems of partial differential equations

image categorization graph edit distance edge direction histogram this paper presents a novel algorithm for computing graph edit distance ged in image categorization this algorithm is purely structural i e it needs only connectivity structure of the graph and does not draw on node or edge attributes there are two major contributions 1 introducing edge direction histogram edh to characterize shape features of images it is shown that ged can be employed as distance of edhs this algorithm is completely independent on cost function which is difficult to be defined exactly 2 computing distance of edhs with earth mover distance emd which takes neighborhood bins into account so as to compute distance of edhs correctly a set of experiments demonstrate that the newly presented algorithm is available for classifying and clustering images and is immune to the planar rotation of images compared with ged from spectral seriation our algorithm can capture the structure change of graphs better and consume 12 79 time used by the former one the average classification rate is 5 and average clustering rate is 25 higher than the spectral seriation method

steganalysis and payload estimation of embedding in pixel differences using neural networks in this paper a steganalysis technique is proposed for pixel value differencing method this steganographic method which is immune against conventional attacks performs the embedding in the difference of the values of pixel pairs therefore the histogram of the differences of an embedded image is different as compared with a cover image a number of characteristics are identified in the difference histogram that show meaningful alterations when an image is embedded five distinct multilayer perceptrons neural networks are trained to detect different levels of embedding every image is fed to all networks and a voting system categorizes the image as stego or cover the implementation results indicate 88 6 success in correct categorization of the test images that contained more than 20 embedding furthermore using a neural network an estimator is presented which gives an estimate of the amount of the mpvd embedding in an image implementation of the estimator showed an average accuracy of 88 3 in the estimation of the amount of embedding

mesh independent modelling of cracks by using higher order shape functions a mesh independent crack modelling approach based on displacement approximation with higher order shape functions is proposed the heaviside step function based local enrichment method known as extended finite element method is modified by replacing the step function with a higher order shape functions approximation polynomial b spline approximation functions are used in the present paper an advantage of the proposed method is that its implementation only involves integration of the products of original shape functions and their derivatives and does not require modification of the integration domains a volume integral based expression is proposed to calculate the effective surface area of the crack modelled by using an approximate step function it is shown to give the actual crack surface area in the limit of the approximate step function approaching the heaviside function the convergence and accuracy of the method is illustrated in examples of transverse and oblique with respect to loading direction crack problems in rectangular plates uniaxial tension of a unidirectional composite with an open hole is considered hoop stress relaxation due to longitudinal splitting is successfully modelled by the method proposed and compared to direct modelling by using ansys software published in 2002 by john wiley sons ltd

the tanh method for traveling wave solutions of nonlinear equations in this work we employ the tanh method for traveling wave solutions of nonlinear equations the study is extended to equations that do not have tanh polynomial solutions the efficiency of the method is demonstrated by applying it for a variety of selected equations