fuzzy non continuous mappings and fuzzy pre semi separation axioms the aim of the paper is mainly to introduce and study fuzzy pre semi open mapping fuzzy pre semi irresolute mapping fuzzy pre semi separation axioms and fuzzy pre semi connectedness in fuzzy topological spaces

paracompactness in l topological spaces in this paper a certain fuzzy paracompactness is presented by means of the concept of locally finite family of l fuzzy sets the concept of locally finite family can be used to characterize fuzzy countable compactness this fuzzy paracompactness is a natural generalization of lowen fuzzy compactness a fuzzy countably compact l set is fuzzy paracompact if and only if it is fuzzy compact a topological space x j is paracompact if and only if its induced space x j is fuzzy paracompact when ms l the fuzzy enhanced real line r l is fuzzy paracompact the product of a fuzzy compact set and a fuzzy paracompact set is fuzzy paracompact a fuzzy strongly t2 paracompact space is strongly s regular and strongly ws normal moreover a strongly s regular lindelof space is fuzzy paracompact

symmetry aware graph matching visual symmetry encodes middle to high level geometric information and plays an important role in many computer vision applications not much effort however has been devoted to utilize symmetry information for graph matching in this paper we propose a new framework for symmetry aware graph matching in the context of image matching in the framework we first define symmetry matrices to characterize the geometric symmetry relation among image features and then develop two methods to discover such symmetry after that we design general strategies to boost graph matching algorithms with symmetry constraints and apply these strategies to several state of the art algorithms for evaluation the proposed symmetry aware graph matching algorithms are first applied to two datasets involving clear symmetry patterns a recently proposed architecture image set and a dental panoramic radiograph collection the results clearly demonstrate the benefits of using symmetry information an experiment is also conducted on a dataset where symmetry is less obvious the results show that our strategies still achieve better of similar performance compared with state of the arts highlightsit is the first time symmetry constraints that are introduced into graph matching the symmetry aware graph matching improves the matching performance a new dataset with annotation for evaluating graph matching is constructed

a note on lo fuzzy nearly compact spaces in this note we define lo fuzzy nc fuzzy sets and introduce the finite intersection property for fuzzy sets in the sense of lowen lo fip for short we give some equivalent characterizations of lo fuzzy nc spaces and lo fuzzy nc fuzzy sets by using lo fip regular open and regular closed fuzzy sets finally we prove that lo fuzzy nearly compactness is preserved under fuzzy almost continuous and almost open mapping

ps convergence theory of fuzzy nets and its applications the convergence theory not only is an significantly basic theory of fuzzy topology and fuzzy analysis but also has wide applications in fuzzy inference and some other aspects in this paper we introduce the concept of psc remote neighborhood of fuzzy points and establish the moore smith ps convergence theory of fuzzy nets also we discuss the applications of ps convergence of fuzzy nets

a graduated assignment algorithm for graph matching a graduated assignment algorithm for graph matching is presented which is fast and accurate even in the presence of high noise by combining graduated nonconvexity two way assignment constraints and sparsity large improvements in accuracy and speed are achieved its low order computational complexity o lm where l and m are the number of links in the two graphs and robustness in the presence of noise offer advantages over traditional combinatorial approaches the algorithm not restricted to any special class of graph is applied to subgraph isomorphism weighted graph matching and attributed relational graph matching to illustrate the performance of the algorithm attributed relational graphs derived from objects are matched then results from twenty five thousand experiments conducted on 100 mode random graphs of varying types graphs with only zero one links weighted graphs and graphs with node attributes and multiple link types are reported no comparable results have been reported by any other graph matching algorithm before in the research literature twenty five hundred control experiments are conducted using a relaxation labeling algorithm and large improvements in accuracy are demonstrated

isogeometric numerical dispersion analysis for two dimensional elastic wave propagation abstract in this paper we carry out a numerical dispersion analysis for the linear two dimensional elastodynamics equations approximated by means of nurbs based isogeometric analysis in the framework of the galerkin method specifically we consider the analysis of harmonic plane waves in an isotropic and homogeneous elastic medium we compare and discuss the errors associated with the compressional and shear wave velocities and we provide the anisotropic curves for numerical approximations obtained by considering b spline and nurbs basis functions of different regularity namely globally c 0 and c p 1 continuous p being the polynomial degree we conclude our analysis by numerically simulating the seismic wave propagation in a sinusoidal shaped valley with discontinuous elastic parameters across an internal interface

fuzzy nets and their application fuzzy net theory is enriched by the introduction of the fuzzy net of fuzzy sets the limsup liminf and limit of a fuzzy net of fuzzy sets are defined and their various properties are discussed alternative characterizations based on the notion of a fuzzy net are provided for several fuzzy topological concepts including open and closed fuzzy sets fuzzy continuity maps with closed fuzzy graph open fuzzy mapping etc thus the net theoretic approach is shown to be a promising tool in fuzzy topology

fµ strongly semiopen sets fµ strong semicontinuity and fµ strongly semiretracts throughout the literature if x d is an f ts and y x the induced f topological subspace y d y is defined so that d y n g y n d macho stadler and de prada vicente fuzzy sets and systems 58 1993 365 introduced a new concept of f topological subspaces which coincides with the usual definition in the case that m g y also they introduced the concepts of f m open sets and f m continuity in this paper using the previous concepts we introduce weaker forms of f m open sets and f m continuity the notion of an f retract was introduced by rodabough j math anal appl 79 1981 273 here we introduce the notion of a f m retract and weaker forms of it the basic properties of these notions are given many results are obtained

on various weak fuzzy pairwise retracts the notion of a fuzzy retract was introduced by rodabaugh j math anal appl 79 1981 273 and this notion was extended to the fuzzy bitopological setting j fuzzy math 9 1 2001 207 in this paper we define the notions of fuzzy pairwise semiretracts fuzzy pairwise preretracts fuzzy pairwise strongly semiretracts fuzzy pairwise less strongly semiretracts and fuzzy pairwise semi preretracts we establish some properties of these concepts moreover the relations between these new concepts are discussed

grid dispersion and stability criteria of some common finite element methods for acoustic and elastic wave equations purely numerical methods based on finite element approximation of the acoustic or elastic wave equation are becoming increasingly popular for the generation of synthetic seismograms we present formulas for the grid dispersion and stability criteria for some popular finite element methods fem for wave propagation namely classical and spectral fem we develop an approach based on a generalized eigenvalue formulation to analyze the dispersive behavior of these fems for acoustic or elastic wave propagation that overcomes difficulties caused by irregular node spacing within the element and the use of high order polynomials as is the case for spectral fem analysis reveals that for spectral fem of order four or greater dispersion is less than 0 2 at four to five nodes per wavelength and dispersion is not angle dependent new results can be compared with grid dispersion results of some classical finite difference methods fdm used for acoustic or elastic wave propagation analysis reveals that fdm and classical fem require a larger sampling ratio than a spectral fem to obtain results with the same degree of accuracy the staggered grid fdm is an efficient scheme but the dispersion is angle dependent with larger values along the grid axes on the other hand spectral fem of order four or greater is isotropic with small dispersion making it attractive for simulations with long propagation times

a global solution to sparse correspondence problems we propose a new methodology for reliably solving the correspondence problem between sparse sets of points of two or more images this is a key step inmost problems of computer vision and so far no general method exists to solve it our methodology is able to handle most of the commonly used assumptions in a unique formulation independent of the domain of application and type of features it performs correspondence and outlier rejection in a single step and achieves global optimality with feasible computation feature selection and correspondence are first formulated as an integer optimization problem this is a blunt formulation which considers the whole combinatorial space of possible point selections and correspondences to find its global optimal solution we build a concave objective function and relax the search domain into its convex hull the special structure of this extended problem assures its equivalence to the original one but it can be optimally solved by efficient algorithms that avoid combinatorial search this methodology can use any criterion provided it can be translated into cost functions with continuous second derivatives

regularly open sets in fuzzy topological spaces abstract this paper is devoted to the study of the role of fuzzy regularly open sets we prove some properties of fuzzy almost continuous mappings and define fuzzy almost open mappings we prove that under a fuzzy almost continuous and fuzzy almost open map the inverse image of a fuzzy regularly open set is fuzzy regularly open further we define a new type of fuzzy separation axioms fuzzy almost separation axioms it is interesting that there are some deviations in the behaviour of these axioms as compared to those in general topology for example in a fuzzy almost t1 space not every fuzzy singleton is closed also a fuzzy space which is fuzzy almost t 2 1 2 as well as fuzzy almost t0 is fuzzy almost regular while in general topology we have to take an almost t2 space in place of almost t0 space

object recognition as many to many feature matching object recognition can be formulated as matching image features to model features when recognition is exemplar based feature correspondence is one to one however segmentation errors articulation scale difference and within class deformation can yield image and model features which don t match one to one but rather many to many adopting a graph based representation of a set of features we present a matching algorithm that establishes many to many correspondences between the nodes of two noisy vertex labeled weighted graphs our approach reduces the problem of many to many matching of weighted graphs to that of many to many matching of weighted point sets in a normed vector space this is accomplished by embedding the initial weighted graphs into a normed vector space with low distortion using a novel embedding technique based on a spherical encoding of graph structure many to many vector correspondences established by the earth mover s distance framework are mapped back into many to many correspondences between graph nodes empirical evaluation of the algorithm on an extensive set of recognition trials including a comparison with two competing graph matching approaches demonstrates both the robustness and efficacy of the overall approach

isogeometric analysis of free vibration of simple shaped elastic samples the paper is devoted to numerical solution of free vibration problems for elastic bodies of canonical shapes by means of a spline based finite element method fem called isogeometric analysis iga it has an advantage that the geometry is described exactly and the approximation of unknown quantities is smooth due to higher order continuous shape functions iga exhibits very convenient convergence rates and small frequency errors for higher frequency spectrum in this paper the iga strategy is used in computation of eigen frequencies of a block and cylinder as benchmark tests results are compared with the standard fem the rayleigh ritz method and available experimental data the main attention is paid to the comparison of convergence rate accuracy and time consumption of iga against fem and also to show a spline order and parameterization effects in addition the potential of iga in resonant ultrasound spectroscopy measurements of elastic properties of general anisotropy solids is discussed

selective mass scaling for explicit finite element analyses due to their inherent lack of convergence problems explicit finite element techniques are widely used for analysing non linear mechanical processes in many such processes the energy content in the

semi open sets and semi continuity in fuzzy bitopological spaces abstract in this paper the concepts of fuzzy semi open sets and fuzzy semi continuous mappings due to azad 1981 have been generalized to fuzzy bitopological spaces and some of their properties are studied

using finite element method for the determination of elastic moduli by resonant ultrasound spectroscopy resonant ultrasound spectroscopy is a recent experimental numerical method for the determination of moduli of elastic materials generally all 21 elastic components of the elastic tensor can be determined by the numerical procedure based on the knowledge of a mechanical spectrum of a specimen this involves the solution of a demanding inverse problem presently levenberg marquardt s lm algorithm with the ritz method for the solution of eigenfrequencies is usually applied the lm method is based on the modified newton raphson procedure where all the eigenfrequencies and eigenvectors must be known for the computation of relevant gradients finite element method offers an analogous but more general optimization the tested specimen for instance can be made of a composite material consisting of several layers with different material properties the form of the specimen can be of a more complex shape etc in the present work the elastic moduli are optimized by the fixed point iteration method which r

semi interior and semi closure of a fuzzy set on definit le semi interieur et la semi fermeture d un ensemble flou d une facon semblable a celle utilisee dans les espaces topologiques ordinaires

semi continous and semi closed mappings and semi connectedness in fuzzy setting abstract the aim of the paper is mainly to study and to find different characterizations of semi continuous and semi closed mappings between fuzzy topological spaces the notion of fuzzy semi open sets is used to define fuzzy ti spaces i 0 1 2 and these spaces are investigated under fuzzy semi continuity finally fuzzy semi connectedness is introduced and studied to some extent

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

irresolute and lmost open functions between fuzzy topological spaces abstract the aim of this paper is to introduce and characterize the concept of fuzzy irresolute functions which is strictly stronger than the concept of fuzzy semi continuous functions and independent of the concept of fuzzy continuous functions the independence of the two definitions of fuzzy almost open functions as introduced in 5 and 3 and some of their characterizations are also established

grid dispersion analysis of plane square biquadratic serendipity finite elements in transient elastodynamics summary the spatial discretisation of a continuum by the fem introduces dispersion errors to the numerical solution of stress wave propagation errors of phase and group velocities and the scatter of wave propagation are induced when these propagating phenomena are modelled by the fem the speed of a single harmonic wave depends on its frequency parasitic effects do not exist in an ideal unbounded continuum with higher order finite elements there are optical modes in the spectrum resulting in spurious oscillations of stress and velocity distributions near the sharp wavefronts in principle the dispersion errors and the spurious oscillations cannot be removed from these solutions but can be suppressed to a certain extent for reliable numerical solutions by the fem the dispersion errors should be analysed and determined the dispersion properties of a plane square biquadratic serendipity finite element are examined and compared with a bilinear one dispersion analysis is carried out for the consistent and lumped mass matrices a dispersive improved lumped mass matrix for biquadratic serendipity elements is proposed the paper closes with the recommendation of a choice of permissible dimensionless wavelengths for bilinear and biquadratic serendipity finite element meshes copyright 2013 john wiley sons ltd

near ps compact l subsets in this paper the new concept of near ps compactness in l topological spaces is introduced it is defined for any l subset its characterizations and topological properties are systematically studied and the relationship is exposed between near ps compactness and ps compactness and also fuzzy compactness

fuzzy preopen sets and fuzzy preseparation axioms abstract in this paper the concept of preopen sets due to a s mashhour m e abd el monsef and s n el debb 7 has been generalised to the fuzzy setting further fuzzy separation axioms have been introduced and investigated with the help of fuzzy preopen sets

geometric latent dirichlet allocation on a matching graph for large scale image datasets given a large scale collection of images our aim is to efficiently associate images which contain the same entity for example a building or object and to discover the significant entities to achieve this we introduce the geometric latent dirichlet allocation glda model for unsupervised discovery of particular objects in unordered image collections this explicitly represents images as mixtures of particular objects or facades and builds rich latent topic models which incorporate the identity and locations of visual words specific to the topic in a geometrically consistent way applying standard inference techniques to this model enables images likely to contain the same object to be probabilistically grouped and ranked additionally to reduce the computational cost of applying the glda model to large datasets we propose a scalable method that first computes a matching graph over all the images in a dataset this matching graph connects images that contain the same object and rough image groups can be mined from this graph using standard clustering techniques the glda model can then be applied to generate a more nuanced representation of the data we also discuss how hub images images representative of an object or landmark can easily be extracted from our matching graph representation we evaluate our techniques on the publicly available oxford buildings dataset 5k images and show examples of automatically mined objects the methods are evaluated quantitatively on this dataset using a ground truth labeling for a number of oxford landmarks to demonstrate the scalability of the matching graph method we show qualitative results on two larger datasets of images taken of the statue of liberty 37k images and rome 1m images

accuracy of finite difference and finite element modeling of the scalar and elastic wave equations numerical solutions of the scalar and elastic wave equations have greatly aided geophysicists in both forward modeling and migration of seismic wave fields in complicated geologic media and they promise to be invaluable in solving the full inverse problem this paper quantitatively compares finite difference and finite element solutions of the scalar and elastic hyperbolic wave equations for the most popular implicit and explicit time domain and frequency domain techniques in addition to versatility and ease of implementation it is imperative that one choose the most cost effective solution technique for a fixed degree of accuracy to be of value a solution technique must be able to minimize 1 numerical attenuation or amplification 2 polarization errors 3 numerical anisotropy 4 errors in phase and group velocities 5 extraneous numerical parasitic modes 6 numerical diffraction and scattering and 7 errors and transmission coefficients this paper shows that in homogeneous media the

fuzzy weak semicontinuity abstract in this paper we introduce the fuzzy weakly semicontinuous mapping which is the weaker form of both fuzzy semicontinuous and fuzzy almost continuous mappings in fuzzy topological spaces however fuzzy weakly semicontinuous mapping and fuzzy weakly continuous mapping are independent notions then we discuss some characteristic properties of fuzzy semicontinuous fuzzy semiopen fuzzy semiclosed and fuzzy pre semi open mappings

on separation axioms and ti fuzzy continuity abstract we introduce and generalise concepts of t continuous functions in a fuzzy setting and study them in connection with the fuzzy continuity and fuzzy separation axioms some fuzzy topological properties are also investigated under such functions

dispersion corrected explicit integration of the wave equation a simple dispersion correction is introduced into the centered difference explicit time integration scheme for wave propagation problems the extra term introduces a change of the wave speed depending on local wave characteristics a rigorous theoretical analysis is provided for the scalar wave equation on a regular mesh and a notable improvement in the ability to conserve wave fronts is demonstrated by two numerical examples the correction is reinterpreted to apply to a typical finite element formulation in terms of mass and stiffness matrices resulting in a general dispersion correction of the explicit centered difference time integration algorithm for acoustic and elastic wave propagation problems

an extended path following algorithm for graph matching problem the path following algorithm was proposed recently to approximately solve the matching problems on undirected graph models and exhibited a state of the art performance on matching accuracy in this paper we extend the path following algorithm to the matching problems on directed graph models by proposing a concave relaxation for the problem based on the concave and convex relaxations a series of objective functions are constructed and the frank wolfe algorithm is then utilized to minimize them several experiments on synthetic and real data witness the validity of the extended path following algorithm

the effects of element shape on the critical time step in explicit time integrators for elasto dynamics summary in this paper the effects of element shape on the critical time step are investigated the common rule of thumb used in practice is that the critical time step is set by the shortest distance within an element divided by the dilatational compressive wave speed with a modest safety factor for regularly shaped elements many analytical solutions for the critical time step are available but this paper focusses on distorted element shapes the main purpose is to verify whether element distortion adversely affects the critical time step or not two types of element distortion will be considered namely aspect ratio distortion and angular distortion and two particular elements will be studied four noded bilinear quadrilaterals and three noded linear triangles the maximum eigenfrequencies of the distorted elements are determined and compared to those of the corresponding undistorted elements the critical time steps obtained from single element calculations are also compared to those from calculations based on finite element patches with multiple elements copyright 2014 john wiley sons ltd

some remarks on lo rs fuzzy compactness abstract in this paper we define lo rs fuzzy compact fuzzy sets we study some properties of lo rs fuzzy compact spaces and lo rs fuzzy compact fuzzy sets we give some characterizations of these notions by fuzzy regularly open sets and fuzzy regularly closed sets we prove that lo rs fuzzy compactness is preserved under a fuzzy almost continuous and fuzzy almost open mapping

an algorithm for finding the most similar given sized subgraphs in two weighted graphs we propose a weighted common subgraph wcs matching algorithm to find the most similar subgraphs in two labeled weighted graphs wcs matching as a natural generalization of equal sized graph matching and subgraph matching has found wide applications in many computer vision and machine learning tasks in this brief wcs matching is first formulated as a combinatorial optimization problem over the set of partial permutation matrices then it is approximately solved by a recently proposed combinatorial optimization framework graduated nonconvexity and concavity procedure experimental comparisons on both synthetic graphs and real world images validate its robustness against noise level problem size outlier number and edge density

symmetry preserving algorithm for large displacement frictionless contact by the pre discretization penalty method a three dimensional contact algorithm based on the pre discretization penalty method is presented using the pre discretization formulation gives rise to contact searching performed at the surface gaussian integration points it is shown that the proposed method is consistent with the continuum formulation of the problem and allows an easy incorporation of higher order elements with midside nodes to the analysis moreover a symmetric treatment of mutually contacting surfaces is preserved even under large displacement increments the proposed algorithm utilizes the bfgs method modified for constrained non linear systems the effectiveness of quadratic isoparametric elements in contact analysis is tested in terms of numerical examples verified by analytical solutions and experimental measurements the symmetry of the algorithm is clearly manifested in the problem of impact of two elastic cylinders copyright 2004 john wiley sons ltd

fuzzy subcontinuity inverse fuzzy subcontinuity and a new category of fuzzy topological spaces the notions of subcontinuity and inverse subcontinuity are extended to the fuzzy setting adopting fuzzy net theoretic approach various properties of fuzzy subcontinuous and inversely fuzzy subcontinuous mappings are studied a category of fuzzy topological spaces is constructed canonical example is constructed by using fuzzy translation of fuzzy numbers introduced by rodabaugh to show that fuzzy subcontinuity does not imply kfuzzy continuity in the process n compactness is characterized and fuzzy unit interval is shown to be n compact also a direct proof is provided showing that fuzzy addition of fuzzy numbers is fuzzy continuous

the influence of the mass matrix on the dispersive nature of the semi discrete second order wave equation abstract the application of discrete solution methods to the second order wave equation can yield a dispersive representation of the non dispersive wave propagation problem resulting in a phase speed that depends not only upon the wavelength of the signal being propagated but also upon the direction of propagation in this work the dependence of the dispersive errors on the wave propagation direction mesh aspect ratio and wave number is investigated with the goal of understanding and hopefully reducing the phase and group errors associated with the two dimensional bilinear finite element an analysis of the dispersive effects associated with the consistent row sum lumped and higher order mass matrices has led to a reduced coupling penta diagonal mass matrix that yields improved phase and group errors with respect to wavelength and propagation direction the influence of row sum lumping the finite element mass matrix is demonstrated to always introduce lagging phase and group error while a linear combination of the lumped and consistent mass matrices i e a higher order mass matrix is shown to improve the dispersion characteristics of both the reduced and full integration element using a 2 5 phase error metric the higher order mass matrix can reduce the mesh resolution requirements relative to the lumped mass matrix by nearly a factor of two in one dimension a factor of 4 in two dimensions similarly the reduced coupling mass matrix can reduce the grid requirements by a factor of approximately four relative to the lumped mass matrix a factor of 16 in two dimensions although the reduced coupling mass matrix requires additional storage relative to the lumped mass the factor of 16 reduction in grid requirements promises tremendous overall savings for computing a fixed wavelength spectrum or alternatively for resolving shorter wavelengths with a fixed grid resolution

finite element modeling of linear elastodynamics problems with explicit time integration methods and linear elements with the reduced dispersion error abstract we have developed two finite element techniques with reduced dispersion for linear elastodynamics that are used with explicit time integration methods these techniques are based on the modified integration rule for the mass and stiffness matrices and on the averaged mass matrix approaches that lead to the numerical dispersion reduction for linear finite elements the analytical study of numerical dispersion for the new techniques is carried out in the 1 d 2 d and 3 d cases the numerical study of the efficiency of the dispersion reduction techniques includes the two stage time integration approach with the filtering stage developed in our previous papers that quantifies and removes spurious high frequency oscillations from numerical results we have found that in contrast to the standard linear elements with explicit time integration methods and the lumped mass matrix the finite element techniques with reduced dispersion yield more accurate results at small time increments smaller than the stability limit in the 2 d and 3 d cases the recommendations for the selection of the size of time increments are suggested the new approaches with reduced dispersion can be easily implemented into existing finite element codes and lead to significant reduction in computation time at the same accuracy compared with the standard finite element formulations

an algorithm for weighted sub graph matching based on gradient flows an algorithm for matching the weighted sub graphs based on gradient flows is proposed in this paper first the smaller and larger graphs for matching are represented by means of their weighted adjacency matrices then an objective function is introduced to measure the differences between two weighted adjacency matrices because the permutation matrix for graph matching is usually relaxed to an orthogonal matrix with non negative elements an optimization based approach is adopted to navigate the solution toward an appropriate permutation matrix to accomplish this goal two gradient flows in the space of orthogonal matrices are defined in such a way that they minimize the objective functions one minimizes the objective function in the space of orthogonal matrices and the other minimizes the distance of an orthogonal matrix from the set of permutations in addition two cost functions are introduced to force satisfaction approximately of the constraint that a translation matrix must have integer entries of different values the experimental results show that the proposed sub graph matching is feasible

variationally consistent inertia templates for b spline and nurbs based fem inertia scaling and customization abstract in this contribution variationally consistent inertia templates for b spline and nurbs based finite elements are proposed as a unified concept for two different purposes customization of the template allows construction of masses and reciprocal masses with desired properties like higher order accuracy or improved dispersion behavior inertia scaling allows substantial speed up for explicit dynamics by increased critical time steps the derivation of the template is based on a three field parametrized functional as in previous works of the authors group but with modified primary variables namely displacement velocity and mass specific linear momentum the latter allows for mass preservation for non constant density throughout the domain and is therefore an enhancement to the formulation proposed in tkachuk and bischoff 2015 with the focus on b spline and nurbs based finite elements the proposed template provides alternatives to the row sum lumped mass matrix which is only 2nd order accurate independent of the polynomial order earlier proposed algebraically constructed higher order masses from the literature can be reconstructed in the variational setting described here as special instances furthermore higher order reciprocal masses can be constructed from the template they are especially attractive for explicit dynamics as there is no extra expense per time step compared with lumped mass for linear problems for non linear problems only small overhead is expected but this paper focuses on linear problems only and mainly undistorted meshes tuning the method towards inertia scaling a reduction of the maximum eigenfrequency by 25 40 is obtained in the examples herein whereas the accuracy is higher than for lumped or consistent mass

fuzzy s continuous functions and semilocally connected fuzzy topological spaces abstract the concept of s continuous functions kohli 1978 is translated in fuzzy setting into two concepts fuzzy s continuous functions and fuzzy os continuous functions the concepts of semiconnected functions kohli 1978 and semilocally connected spaces kohli 1978 do the same interactions between those concepts in fuzzy setting and fuzzy continuity chang 1968 are discussed also characterizations of semilocally connected and semilocally o connected fuzzy topological spaces in terms of fuzzy s continuous functions and fuzzy os continuous functions respectively are obtained

a path following algorithm for the graph matching problem we propose a convex concave programming approach for the labeled weighted graph matching problem the convex concave programming formulation is obtained by rewriting the weighted graph matching problem as a least square problem on the set of permutation matrices and relaxing it to two different optimization problems a quadratic convex and a quadratic concave optimization problem on the set of doubly stochastic matrices the concave relaxation has the same global minimum as the initial graph matching problem but the search for its global minimum is also a hard combinatorial problem we therefore construct an approximation of the concave problem solution by following a solution path of a convex concave problem obtained by linear interpolation of the convex and concave formulations starting from the convex relaxation this method allows to easily integrate the information on graph label similarities into the optimization problem and therefore perform labeled weighted graph matching the algorithm is compared with some of the best performing graph matching methods on four data sets simulated graphs qaplib retina vessel images and handwritten chinese characters in all cases the results are competitive with the state of the art

a probabilistic approach to spectral graph matching spectral matching sm is a computationally efficient approach to approximate the solution of pairwise matching problems that are np hard in this paper we present a probabilistic interpretation of spectral matching schemes and derive a novel probabilistic matching pm scheme that is shown to outperform previous approaches we show that spectral matching can be interpreted as a maximum likelihood ml estimate of the assignment probabilities and that the graduated assignment ga algorithm can be cast as a maximum a posteriori map estimator based on this analysis we derive a ranking scheme for spectral matchings based on their reliability and propose a novel iterative probabilistic matching algorithm that relaxes some of the implicit assumptions used in prior works we experimentally show our approaches to outperform previous schemes when applied to exhaustive synthetic tests as well as the analysis of real image sequences

fuzzy strongly semiopen sets and fuzzy strong semicontinuity abstract in this paper we first introduce and study the fuzzy strongly semiopen and fuzzy strongly semiclosed sets in fuzzy space then we introduce the strong semi interior and strong semiclosure of a fuzzy set and kuratowski s 14 sets theorem of general topology is generalized finally we introduce the fuzzy strongly semicontinuous fuzzy strongly semiopen and fuzzy strongly semiclosed mappings on fuzzy topological spaces and also establish some of their characteristic properties and discuss relations between fuzzy continuous fuzzy semicontinuous and fuzzy strongly semicontinuous mappings

directed family of fuzzy sets and fuzzy perfect maps the present paper deals with the perfect functions in fuzzy setting fuzzy filter bases of fuzzy sets are also studied vis a vis such functions finally certain fuzzy topological properties are taken up for their study with regard to fuzzy perfect functions

on fuzzy compactness in this paper we characterize well known fuzzy compactness see 3 4 9 and 10 using the notion of fuzzy upper limit see 5 also we give and study new fuzzy compactness in fuzzy topological spaces

dispersion of elastic waves in the contact impact problem of a long cylinder numerical dispersion of two dimensional finite elements was studied the outcome of the dispersion study was verified by the numerical and analytical solutions to the longitudinal impact of two long cylindrical bars in accordance with the results of the dispersion analysis it was demonstrated that the quadratic elements showed better accuracy than the linear ones

graph matching by simplified convex concave relaxation procedure the convex and concave relaxation procedure ccrp was recently proposed and exhibited state of the art performance on the graph matching problem however ccrp involves explicitly both convex and concave relaxations which typically are difficult to find and thus greatly limit its practical applications in this paper we propose a simplified ccrp scheme which can be proved to realize exactly ccrp but with a much simpler formulation without needing the concave relaxation in an explicit way thus significantly simplifying the process of developing ccrp algorithms the simplified ccrp can be generally applied to any optimizations over the partial permutation matrix as long as the convex relaxation can be found based on two convex relaxations we obtain two graph matching algorithms defined on adjacency matrix and affinity matrix respectively extensive experimental results witness the simplicity as well as state of the art performance of the two simplified ccrp graph matching algorithms

learning a multiple kernel similarity metric for kinship verification abstract kinship verification kv has recently caught much attention in the computer vision community due to its potential applications ranging from missing children search to social media analysis most of the related work focuses either on developing hand crafted feature representations to describe the faces or on learning the mahalanobis distance metric to measure the similarity between facial images instead in this paper we propose a novel multiple kernel similarity metric mksm in which different from the mahalanobis metric the similarity computation is essentially based on an implicit nonlinear feature transformation the overall mksm is a weighted combination of basic similarities and therefore possesses the capacity for feature fusion the basic similarities are derived from base kernels and local features and the weights are obtained by solving a constrained linear programming lp problem that originates from a large margin lm criterion particularly the lm criterion not only guarantees the generalization on unseen samples when the training set is small but also leads to sparsity in the weight vector which in turn boosts the efficiency at the prediction stage extensive experiments on four publicly available datasets demonstrate the effectiveness of the proposed method

a compactness in bifuzzy topological spaces abstract compact fuzzy topological spaces were first introduced by chang 3 compact fuzzy topological spaces were introduced by gantner et al 4 abd el monsef et al 1 introduced the notion of almost compact fuzzy topological spaces mashbour et al 8 introduced the notion of bifuzzy topological spaces and defined the notion of compactness in those spaces in this paper we obtain some new results about compact bifuzzy topological spaces we introduce and study the notion of pairwise almost compact bifuzzy topological spaces