some explicit examples of hamiltonian minimal lagrangian submanifolds in complex space forms abstract in this paper we find some new explicit examples of hamiltonian minimal lagrangian submanifolds among the lagrangian isometric immersions of a real space form in a complex space form

reductions of minimal lagrangian submanifolds with symmetries let m be a fano manifold equipped with a kahler form omega in 2 pi c 1 m and k a connected compact lie group acting on m as holomorphic isometries in this paper we show the minimality of a k invariant lagrangian submanifold l in m with respect to a globally conformal kahler metric is equivalent to the minimality of the reduced lagrangian submanifold l 0 l k in a kahler quotient m 0 with respect to the hsiang lawson metric furthermore we give some examples of kahler reductions by using a circle action obtained from a cohomogenenity one action on a kahler einstein manifold of positive ricci curvature applying these results we obtain several examples of minimal lagrangian submanifolds via reductions

on the distribution of saliency detecting salient structures is a basic task in perceptual organization saliency algorithms typically mark edge points with some saliency measure which grows with the length and smoothness of the curve on which these edge points lie here we propose a modified saliency estimation mechanism that is based on probabilistically specified grouping cues and on curve length distributions in this framework the shashua and ullman saliency mechanism may be interpreted as a process for detecting the curve with maximal expected length generalized types of saliency naturally follow we propose several specific generalizations e g gray level based saliency and rigorously derive the limitations on generalized saliency types we then carry out a probabilistic analysis of expected length saliencies using ergodicity and asymptotic analysis we derive the saliency distributions associated with the main curves and with the rest of the image we then extend this analysis to finite length curves using the derived distributions we derive the optimal threshold on the saliency for discriminating between figure and background and bound the saliency based figure from ground performance

learning overcomplete representations in an overcomplete basis the number of basis vectors is greater than the dimensionality of the input and the representation of an input is not a unique combination of basis vectors overcomplete representations have been advocated because they have greater robustness in the presence of noise can be sparser and can have greater flexibility in matching structure in the data overcomplete codes have also been proposed as a model of some of the response properties of neurons in primary visual cortex previous work has focused on finding the best representation of a signal using a fixed overcomplete basis or dictionary we present an algorithm for learning an overcomplete basis by viewing it as probabilistic model of the observed data we show that overcomplete bases can yield a better approximation of the underlying statistical distribution of the data and can thus lead to greater coding efficiency this can be viewed as a generalization of the technique of independent component analysis and provides a method for bayesian reconstruction of signals in the presence of noise and for blind source separation when there are more sources than mixtures

feature adaptive co segmentation by complexity awareness in this paper we propose a novel feature adaptive co segmentation method that can learn adaptive features of different image groups for accurate common objects segmentation we also propose image complexity awareness for adaptive feature learning in the proposed method the original images are first ranked according to the image complexities that are measured by superpixel changing cue and object detection cue then the unsupervised segments of the simple images are used to learn the adaptive features which are achieved using an expectation minimization algorithm combining l 1 regularized least squares optimization with the consideration of the confidence of the simple image segmentation accuracies and the fitness of the learned model the error rate of the final co segmentation is tested by the experiments on different image groups and verified to be lower than the existing state of the art co segmentation methods

computing with words via turing machines a formal approach computing with words cw as a methodology means computing and reasoning by the use of words in place of numbers or symbols which may conform more to humans perception when describing real world problems in this paper as a continuation of a previous paper we aim to develop and deepen a formal aspect of cw according to the previous paper the basic point of departure is that cw treats certain formal modes of computation with strings of fuzzy subsets instead of symbols as their inputs specifically 1 we elaborate on cw via turing machine tm models showing the time complexity is at least exponential if the inputs are strings of words 2 a negative result of 6 not holding is verified which indicates that the extension principle for cw via tms needs to be re examined 3 we discuss cw via context free grammars and regular grammars and the extension principles for cw via these formal grammars are set up 4 some equivalences between fuzzy pushdown automata respectively fuzzy finite state automata fuzzy context free grammars respectively fuzzy regular grammars are demonstrated in the sense that the inputs are instead strings of words 5 some instances are described in detail summarily formal aspect of cw is more systematically established more deeply dealt with while some new problems also emerge

computation in finitary stochastic and quantum processes abstract we introduce stochastic and quantum finite state transducers as computation theoretic models of classical stochastic and quantum finitary processes formal process languages representing the distribution over a process behaviors are recognized and generated by suitable specializations we characterize and compare deterministic and nondeterministic versions summarizing their relative computational power in a hierarchy of finitary process languages quantum finite state transducers and generators are a first step toward a computation theoretic analysis of individual repeatedly measured quantum dynamical systems they are explored via several physical systems including an iterated beam splitter an atom in a magnetic field and atoms in an ion trap a special case of which implements the deutsch quantum algorithm we show that these systems behaviors and so their information processing capacity depends sensitively on the measurement protocol

second variation and stabilities of minimal lagrangian submanifolds in kahler manifolds first we derive a new second variation formula which holds for any minimal lagrangian submanifold in k ihler manifolds using this we prove that any minimal lagrangian submanifold in kfihler manifolds with nonpositive chern class is stable we also prove that in kfihler manifolds with positive chern class any stable minimal lagrangian submanifold l satisfies that h l 0 next we introduce the notion of hamiltonian stability either local or global of minimal lagrangian submanifolds in einstein kfihler manifolds using our second variation formula we find a general criterion for the local hamiltonian stability for minimal lagrangian submanifolds in einstein k ihler manifolds this criterion is satisfied for all real forms which are einstein of irreducible hermitian symmetric spaces e g the cannonical rp c cp it is also satisfied by the clifford torus t c cp

characterizations of quantum automata we define q quantum finite automata qqfas and q quantum regular grammars qqrgs and verify that they are exactly equivalent to those measure once quantum finite automata mo qfas in the literature in particular we define q quantum pushdown automata qqpdas and qpdas that are at least as powerful as those defined by moore and crutchfield and especially we focus on demonstrating the equivalence between qqpdas and qpdas also we discuss some of the properties of languages accepted by qqpdas for example every cut point language accepted by qqpda is independent of the cut point

quantum automata and quantum grammars abstract to study quantum computation it might be helpful to generalize structures from language and automata theory to the quantum case to that end we propose quantum versions of finite state and push down automata and regular and context free grammars we find analogs of several classical theorems including pumping lemmas closure properties rational and algebraic generating functions and greibach normal form we also show that there are quantum context free languages that are not context free so qcfl cfl

quantum finite automata we first outline main steps and achievements along bertoni s research path in quantum finite automata theory from the very basic definitions of the models of quantum finite automata throughout the investigation of their computational and descriptional power next we choose to focus on bertoni s studies on quantum finite automata descriptional complexity in particular we expand on a statistical framework for the synthesis of succinct quantum finite automata discussing its adaptation to the case of multiperiodic events and languages we then improve such a framework to obtain even more succinct quantum finite automata for some multiperiodic languages finally we introduce some promise problems for multiperiodic inputs showing that even on this class of problems the descriptional power of quantum finite automata greatly outperforms that of equivalent classical finite automata we build small size monte carlo quantum finite automata for multiperiodic languages we analyze the modular architecture of such monte carlo quantum finite automata we solve promise problems on multiperiodic inputs by small quantum finite automata

globally consistent correspondence of multiple feature sets using proximal gauss seidel relaxation feature correspondence between two or more images is a fundamental problem towards many computer vision applications the case of correspondence between two images has been intensively studied however few works so far have been concerned with multi image correspondence in this paper we address the problem of establishing a globally consistent correspondence among multiple more than two feature sets given the pairwise feature affinity information our main contribution is to propose a novel optimization framework for solving this problem based on the so called proximal gauss seidel relaxation pgsr the proposed method is distinguished from previous works mainly in three aspects 1 it is more robust to noise and outliers 2 its solution is based on convex relaxation and the principled pgsr method which in general has convergence guarantee 3 the scale of the problem in our method is linear with respect to the number of feature sets making it computationally practical to be used in real world applications experimental results both synthetic and real image datasets have demonstrated the effectiveness and superiority of the proposed method highlightswe study finding globally consistent correspondence from multiple feature sets a novel method is proposed based on proximal gauss seidel relaxation pgsr pgsr is more robust to noise outliers and deformation than competitors the optimization has general convergence guarantee the scale of our formulation is linear w r t the number of feature sets

normalized cuts and image segmentation we propose a novel approach for solving the perceptual grouping problem in vision rather than focusing on local features and their consistencies in the image data our approach aims at extracting the global impression of an image we treat image segmentation as a graph partitioning problem and propose a novel global criterion the normalized cut for segmenting the graph the normalized cut criterion measures both the total dissimilarity between the different groups as well as the total similarity within the groups we show that an efficient computational technique based on a generalized eigenvalue problem can be used to optimize this criterion we applied this approach to segmenting static images as well as motion sequences and found the results to be very encouraging

quantum geometry and quantum algorithms motivated by algorithmic problems arising in quantum field theories whose dynamical variables are geometric in nature we provide a quantum algorithm that efficiently approximates the coloured jones polynomial the construction is based on the complete solution of the chern simons topological quantum field theory and its connection to wess zumino witten conformal field theory the coloured jones polynomial is expressed as the expectation value of the evolution of the q deformed spin network quantum automaton a quantum circuit is constructed capable of simulating the automaton and hence of computing such an expectation value the latter is efficiently approximated using a standard sampling procedure in quantum computation

on probabilistic and quantum reaction systems the notion of reaction systems was introduced by ehrenfeucht and rozenberg 2004 2007 5 6 in this article we discuss the general properties of probabilistic reaction systems and introduce their quantum extension

a multisize superpixel approach for salient object detection based on multivariate normal distribution estimation this paper presents a new method for salient object detection based on a sophisticated appearance comparison of multisize superpixels those superpixels are modeled by multivariate normal distributions in cie lab color space which are estimated from the pixels they comprise this fitting facilitates an efficient application of the wasserstein distance on the euclidean norm formula see text to measure perceptual similarity between elements saliency is computed in two ways on the one hand we compute global saliency by probabilistically grouping visually similar superpixels into clusters and rate their compactness on the other hand we use the same distance measure to determine local center surround contrasts between superpixels then an innovative locally constrained random walk technique that considers local similarity between elements balances the saliency ratings inside probable objects and background the results of our experiments show the robustness and efficiency of our approach against 11 recently published state of the art saliency detection methods on five widely used benchmark data sets

on the complexity of minimizing probabilistic and quantum automata several types of automata such as probabilistic and quantum automata require to work with real and complex numbers for such automata the acceptance of an input is quantified with a probability there are plenty of results in the literature addressing the complexity of checking the equivalence of these automata that is checking whether two automata accept all inputs with the same probability on the other hand the critical problem of finding the minimal automata equivalent to a given one has been left open c moore j p crutchfield quantum automata and quantum grammars theoret comput sci 237 2000 275 306 see p 304 problem 5 in this work we reduce the minimization problem of probabilistic and quantum automata to finding a solution of a system of algebraic polynomial in equations an expspace upper bound on the complexity of the minimization problem is derived by applying email protected s algorithm more specifically we show that the state minimization of probabilistic automata measure once quantum automata measure many quantum automata measure once generalized quantum automata and measure many generalized quantum automata is decidable and in expspace finally we also solve an open problem concerning minimal covering of stochastic sequential machines a paz introduction to probabilistic automata academic press new york 1971 p 43

determining the equivalence for one way quantum finite automata two quantum finite automata are equivalent if for any input string x the two automata accept x with equal probability in this paper we first focus on determining the equivalence for one way quantum finite automata with control language cl 1qfas defined by bertoni et al and then as an application we address the equivalence problem for measure many one way quantum finite automata mm 1qfas introduced by kondacs and watrous more specifically we obtain that i two cl 1qfas a 1 and a 2 with control languages regular languages l 1 and l 2 respectively are equivalent if and only if they are c 1n 1 2 c 2n 2 2 1 equivalent where n 1 and n 2 are the numbers of states in a 1 and a 2 respectively and c 1 and c 2 are the numbers of states in the minimal dfas that recognize l 1 and l 2 respectively furthermore if l 1 and l 2 are given in the form of dfas with m 1 and m 2 states respectively then there exists a polynomial time algorithm running in time o m 1n 1 2 m 2n 2 2 4 that takes as input a 1 and a 2 and determines whether they are equivalent ii as an application of item i two mm 1qfas a 1 and a 2 with n 1 and n 2 states respectively are equivalent if and only if they are 3n 1 2 3n 2 2 1 equivalent furthermore there is a polynomial time algorithm running in time o 3n 1 2 3n 2 2 4 that takes as input a 1 and a 2 and determines whether a 1 and a 2 are equivalent

analytic models and ambiguity of context free languages we establish that several classical context free languages are inherently ambiguous by proving that their counting generating functions when considered as analytic functions exhibit some characteristic form of transcendental behaviour to that purpose we survey some general results on elementary analytic properties and enumerative uses of algebraic functions in relation to formal languages in particular the paper contains a general density theorem for unambiguous context free languages

efficient graph based image segmentation this paper addresses the problem of segmenting an image into regions we define a predicate for measuring the evidence for a boundary between two regions using a graph based representation of the image we then develop an efficient segmentation algorithm based on this predicate and show that although this algorithm makes greedy decisions it produces segmentations that satisfy global properties we apply the algorithm to image segmentation using two different kinds of local neighborhoods in constructing the graph and illustrate the results with both real and synthetic images the algorithm runs in time nearly linear in the number of graph edges and is also fast in practice an important characteristic of the method is its ability to preserve detail in low variability image regions while ignoring detail in high variability regions

self adaptively weighted co saliency detection via rank constraint co saliency detection aims at discovering the common salient objects existing in multiple images most existing methods combine multiple saliency cues based on fixed weights and ignore the intrinsic relationship of these cues in this paper we provide a general saliency map fusion framework which exploits the relationship of multiple saliency cues and obtains the self adaptive weight to generate the final saliency co saliency map given a group of images with similar objects our method first utilizes several saliency detection algorithms to generate a group of saliency maps for all the images the feature representation of the co salient regions should be both similar and consistent therefore the matrix jointing these feature histograms appears low rank we formalize this general consistency criterion as the rank constraint and propose two consistency energy to describe it which are based on low rank matrix approximation and low rank matrix recovery respectively by calculating the self adaptive weight based on the consistency energy we highlight the common salient regions our method is valid for more than two input images and also works well for single image saliency detection experimental results on a variety of benchmark data sets demonstrate that the proposed method outperforms the state of the art methods

hamiltonian stationary tori in the complex projective plane hamiltonian stationary lagrangian surfaces are lagrangian surfaces in a four dimensional kahler manifold which are critical points of the area functional for hamiltonian infinitesimal deformations in this paper we analyze these surfaces in the complex projective plane in a previous work we showed that they correspond locally to solutions to an integrable system formulated as a zero curvature on a twisted loop group here we give an alternative formulation using non twisted loop groups and as an application we show in detail why hamiltonian stationary lagrangian tori are finite type solutions and eventually describe the simplest of them the homogeneous ones

small size quantum automata recognizing some regular languages given a class p i of stochastic events induced by m state 1 way quantum finite automata 1qfa on alphabet we investigate the size number of states of 1qfa s that approximate a convex linear combination of p i and we apply the results to the synthesis of small size 1qfa s we obtain an o md 3 log2 d 2 general size bound where d is the vapnik dimension of p w w for commutative n periodic events p on with h we prove an o h log n 2 size bound for inducing a approximation of p whenever f p 1 nh where f p is the discrete fourier transform of the vector p associated with p if the characteristic function l of an n periodic unary language l satisfies f l 1 n then l is recognized with isolated cut point by a 1qfa with o log n states vice versa if l is recognized with isolated cut point by a 1qfa with o log n state then f l 1 o n log n

interactive proofs with quantum finite automata abstract following an early work of dwork and stockmeyer on interactive proof systems whose verifiers are two way probabilistic finite automata the authors initiated in 2004 a study on the computational power of quantum interactive proof systems whose verifiers are particularly limited to quantum finite automata as a follow up to the authors early journal publication j comput system sci vol 75 pp 255 269 2009 we further investigate the quantum nature of interactions between provers and verifiers by studying how various restrictions on quantum interactive proof systems affect the language recognition power of the proof systems in particular we examine three intriguing restrictions that i provers always behave in a classical fashion ii verifiers always reveal to provers the information on their next moves and iii the number of interactions between provers and verifiers is bounded

the calculi of emergence computation dynamics and induction abstract defining structure and detecting the emergence of complexity in nature are inherently subjective though essential scientific activities despite the difficulties these problems can be analyzed in terms of how model building observers infer from measurements the computational capabilities embedded in nonlinear processes an observer s notion of what is ordered what is random and what is complex in its environment depends directly on its computational resources the amount of raw measurement data of memory and of time available for estimation and inference the discovery of structure in an environment depends more critically and subtlely though on how those resources are organized the descriptive power of the observer s chosen or implicit computational model class for example can be an overwhelming determinant in finding regularity in data this paper presents an overview of an inductive framework hierarchical machine reconstruction in which the emergence of complexity is associated with the innovation of new computational model classes complexity metrics for detecting structure and quantifying emergence along with an analysis of the constraints on the dynamics of innovation are outlined illustrative examples are drawn from the onset of unpredictability in nonlinear systems finitary nondeterministic processes and cellular automata pattern recognition they demonstrate how finite inference resources drive the innovation of new structures and so lead to the emergence of complexity

power of the interactive proof systems with verifiers modeled by semi quantum two way finite automata interactive proof systems ip are very powerful languages they can accept form exactly pspace they represent also one of the very fundamental concepts of theoretical computing and a model of computation by interactions one of the key players in ip is verifier in the original model of ip whose power is that of pspace the only restriction on verifiers is that they work in randomized polynomial time because of such key importance of ip it is of large interest to find out how powerful will ip be when verifiers are more restricted so far this was explored for the case that verifiers are two way probabilistic finite automata dwork and stockmeyer 1990 and one way quantum finite automata as well as two way quantum finite automata nishimura and yamakami 2009 ip in which verifiers use public randomization is called arthur merlin proof systems am am with verifiers modeled by turing machines augmented with a fixed size quantum register qam were studied also by yakaryilmaz 2012 he proved for example that an np complete language l knapsack representing the 0 1 knapsack problem can be recognized by a qam whose verifier is a two way finite automaton working on quantum mixed states using superoperators in this paper we explore the power of am for the case that verifiers are two way finite automata with quantum and classical states 2qcfa introduced by ambainis and watrous in 2002 and the communications are classical it is of interest to consider am with such semi quantum verifiers because they use only limited quantum resources our main result is that such quantum arthur merlin proof systems qam 2qcfa with polynomial expected running time are more powerful than the models in which the verifiers are two way probabilistic finite automata am 2pfa with polynomial expected running time moreover we prove that there is a language which can be recognized by an exponential expected running time qam 2qcfa but cannot be recognized by any am 2pfa and that the np complete language l knapsack can also be recognized by a qam 2qcfa working only on quantum pure states using unitary operators

salient object detection with spatiotemporal background priors for video saliency detection for images has been studied for many years for which a lot of methods have been designed in saliency detection background priors which are often regarded as pseudo background are effective clues to find salient objects in images although image boundary is commonly used as background priors it does not work well for images of complex scenes and videos in this paper we explore how to identify the background priors for a video and propose a saliency based method to detect the visual objects by using the background priors for a video we integrate multiple pairs of scale invariant feature transform flows from long range frames and a bidirectional consistency propagation is conducted to obtain the accurate and sufficient temporal background priors which are combined with spatial background priors to generate spatiotemporal background priors next a novel dual graph based structure using spatiotemporal background priors is put forward in the computation of saliency maps fully taking advantage of appearance and motion information in videos experimental results on different challenging data sets show that the proposed method robustly and accurately detects the video objects in both simple and complex scenes and achieves better performance compared with other the state of the art video saliency models

model checking temporal properties of reaction systems this paper defines a temporal logic for reaction systems rsctl the logic is interpreted over the models for the context restricted reaction systems that generalise standard reaction systems by controlling context sequences moreover a translation from the context restricted reaction systems into boolean functions is defined in order to be used for a symbolic model checking for rsctl over these systems the model checking for rsctl is proved to be pspace complete the proposed approach to model checking was implemented and experimentally evaluated using four benchmarks

qrt fifo automata breadth first grammars and their relations abstract some classes of queue automata deterministic and nondeterministic i e machines equipped with one or more fifo tapes and corresponding languages are considered for quasi real time qrt deterministic machines recognition power closure properties and counting capabilities are studied for such machines by showing that the language l j j j 1 l j l j ba n 1 b a n j ca n j b can be recognized with j queues but not with fewer an infinite hierarchy theorem which contradicts the known results for nondeterministic machines is proved restricted palindromes can be recognized with two queues we introduce a generative system for some queue languages the breadth first context free grammars bcf which are the same as context free grammars but for the ordering of terminals which is breadth first i e the least recently produced nonterminal symbol must be rewritten first bcf languages are recognized essentially by stateless queue automata they are semilinear closed with respect to permutation and homomorphism but not with respect to intersection with regular sets a periodicity property pumping lemma is proved for bcf languages whence comparisons with other families are obtained finally a homomorphic characterization of any queue language is presented l h r b where h is a homomorphism nonerasing if l is qrt r a regular set and b a bcf language the result can be extended to multiqueue automata

computing power of turing machines in the framework of unsharp quantum logic we present recursion theoretical characterizations of the computational power of turing machines in the framework of unsharp quantum logic for unsharp quantum logic let a lattice ordered quantum multiple valued qmv algebra be its truth value lattice when lattice ordered qmv algebras satisfy a locally finite condition that is every non zero element has a finite order and its meet operation is computable we prove that 1 0 1 0 l d t e or l w t e 2 0 where l d t e respectively l w t e denotes the class of languages accepted by these turing machines in the depth first method respectively the width first method for sharp quantum logic similar results are obtained for a general orthomodular truth value lattice

a co saliency model of image pairs in this paper we introduce a method to detect co saliency from an image pair that may have some objects in common the co saliency is modeled as a linear combination of the single image saliency map sism and the multi image saliency map mism the first term is designed to describe the local attention which is computed by using three saliency detection techniques available in literature to compute the mism a co multilayer graph is constructed by dividing the image pair into a spatial pyramid representation each node in the graph is described by two types of visual descriptors which are extracted from a representation of some aspects of local appearance e g color and texture properties in order to evaluate the similarity between two nodes we employ a normalized single pair simrank algorithm to compute the similarity score experimental evaluation on a number of image pairs demonstrates the good performance of the proposed method on the co saliency detection task

universal quantum computation with unlabelled qubits we show that an nth root of the walsh hadamard transform obtained from the hadamard gate and a cyclic permutation of the qubits together with two diagonal matrices namely a local qubit flip for a fixed but arbitrary qubit and a non local phase flip for a fixed but arbitrary coefficient can do universal quantum computation on n qubits a quantum computation making use of n qubits and based on these operations is then a word of variable length but whose letters are always taken from an alphabet of cardinality three therefore in contrast with other universal sets no choice of qubit lines is needed for the application of the operations described here a quantum algorithm based on this set can be interpreted as a discrete diffusion of a quantum particle on a de bruijn graph corrected on the fly by auxiliary modifications of the phases associated with the arcs

parallel quantum computation and quantum codes we study the class qnc of efficient parallel quantum circuits the quantum analog of nc we exhibit several useful gadgets and prove that various classes of circuits can be parallelized to logarithmic depth including circuits for encoding and decoding standard quantum error correcting codes or more generally any circuit consisting of controlled not gates controlled pi shifts and hadamard gates finally while we note the exact quantum fourier transform can be parallelized to linear depth we conjecture that neither it nor a simpler staircase circuit can be parallelized to less than this

hamiltonian minimal submanifolds in complex hyperbolic space with so n symmetry in this paper we construct complete hamiltonian minimal submanifolds in complex hyperbolic space with so n symmetry which are not minimal in the usual sense

hamiltonian stationary lagrangian surfaces of constant curvature e in complex space form m2 4e abstract a lagrangian surface in a kaehler manifold is called hamiltonian stationary if it is a critical point of the area functional restricted to compactly supported hamiltonian variations in the first part of this article we study the traveling wave solutions of an over determined pde system arising from a study of hamiltonian stationary lagrangian surfaces of constant curvature e in a complex space form m 2 4 e then by applying the traveling wave solutions we construct families of type ii hamiltonian stationary lagrangian surfaces of constant curvature e in complex space forms m 2 4 e via an effective method of b y chen f dillen l verstraelen and l vrancken lagrangian isometric immersions of a real space form m n c into a complex space form m n 4 c math proc cambridge philo soc 124 1998 107 125 in the second part we are able to completely solve the over determined pde system for the case e 0 and to determine their corresponding hamiltonian stationary lagrangian surfaces as an immediate by product some interesting new families of hamiltonian stationary lagrangian surfaces of constant curvature are obtained

unsupervised multi class co segmentation via joint cut over l_ 1 manifold hyper graph of discriminative image regions this paper systematically advocates a robust and efficient unsupervised multi class co segmentation approach by leveraging underlying subspace manifold propagation to exploit the cross image coherency it can combat certain image co segmentation difficulties due to viewpoint change partial occlusion complex background transient illumination and cluttering texture patterns our key idea is to construct a powerful hyper graph joint cut framework which incorporates mid level image regions based intra image feature representation and l 1 manifold graph based inter image coherency exploration for local image region generation we propose a bi harmonic distance distribution difference metric to govern the super pixel clustering in a bottom up way it not only affords drastic data reduction but also gives rise to discriminative and structure meaningful feature representation as for the inter image coherency we leverage multi type features involved l 1 graph to detect the underlying local manifold from cross image regions as a result the implicit supervising information could be encoded into the unsupervised hyper graph joint cut framework we conduct extensive experiments and make comprehensive evaluations with other state of the art methods over various benchmarks including icoseg msrc and oxford flower all the results demonstrate the superiorities of our method in terms of accuracy robustness efficiency and versatility

quantum automata for some multiperiodic languages we exhibit small size measure once one way quantum finite automata mo 1qfa s inducing multiperiodic stochastic events moreover for certain classes of multiperiodic languages we exhibit i isolated cut point mo 1qfa s whose size logarithmically depends on the periods ii monte carlo mo 1qfa s whose size logarithmically depends on the periods and polynomially on the inverse of the error probability

automata theory based on quantum logic reversibilities and pushdown automata automata theory based on quantum logic called l valued finite automata l vfas may be viewed as a logical approach to quantum computing this work is mainly divided into two parts one part deals with reversibility of l vfas and the other establishes a basic framework of l valued pushdown automata l vpdas first we provide some preliminaries concerning quantum logic and l vfas and we prove a useful property of l valued successor and source operators then we clarify the relationships between various reversibilities closely related to quantum finite automata in the literature in particular we define a reversibility of l vfas which is termed as retrievability and we clarify the relationships between a number of different fashions regarding retrievability of l vfas we prove that some of them are equivalent but for the others to be equivalent the truth value set is required to satisfy a certain condition this is an essential difference from the classical situation afterwards we introduce l vpdas and show that the class of the languages accepted by l vpdas by empty stack coincides with that accepted by l vpdas by final state finally we provide some examples of l vfas and conclude with some remarks

stratified symplectic spaces and reduction let m w be a hamiltonian g space with proper momentum map j m g it is well known that if zero is a regular value of j and g acts freely on the level set j 0 then the reduced space mo j 0 g is a symplectic manifold we show that if the regularity assumptions are dropped the space mo is a union of symplectic manifolds i e it is a stratified symplectic space arms et al 2 proved that mo possesses a natural poisson bracket using their result we study hamiltonian dynamics on the reduced space in particular we show that hamiltonian flows are strata preserving and give a recipe for lifting a reduced hamiltonian flow to the level set j 0 finally we give a detailed description of the stratification of mo and prove the existence of a connected

quantum theory the church turing principle and the universal quantum computer it is argued that underlying the church turing hypothesis there is an implicit physical assertion here this assertion is presented explicitly as a physical principle every finitely realizable physical system can be perfectly simulated by a universal model computing machine operating by finite means classical physics and the universal turing machine because the former is continuous and the latter discrete do not obey the principle at least in the strong form above a class of model computing machines that is the quantum generalization of the class of turing machines is described and it is shown that quantum theory and the universal quantum computer are compatible with the principle computing machines resembling the universal quantum computer could in principle be built and would have many remarkable properties not reproducible by any turing machine these do not include the computation of non recursive functions but they do include quantum parallelism a method by which certain probabilistic tasks can be performed faster by a universal quantum computer than by any classical restriction of it the intuitive explanation of these properties places an intolerable strain on all interpretations of quantum theory other than everett s some of the numerous connections between the quantum theory of computation and the rest of physics are explored quantum complexity theory allows a physically more reasonable definition of the complexity or knowledge in a physical system than does classical complexity theory

hamiltonian minimal lagrangian submanifolds in kaehler manifolds with symmetries abstract by making use of the symplectic reduction and the cohomogeneity method we give a general method for constructing hamiltonian minimal lagrangian submanifolds in kaehler manifolds with symmetries as applications we construct infinitely many nontrivial complete hamiltonian minimal lagrangian submanifolds in c p n and c n

person re identification by saliency learning human eyes can recognize person identities based on small salient regions i e person saliency is distinctive and reliable in pedestrian matching across disjoint camera views however such valuable information is often hidden when computing similarities of pedestrian images with existing approaches inspired by our user study result of human perception on person saliency we propose a novel perspective for person re identification based on learning person saliency and matching saliency distribution the proposed saliency learning and matching framework consists of four steps 1 to handle misalignment caused by drastic viewpoint change and pose variations we apply adjacency constrained patch matching to build dense correspondence between image pairs 2 we propose two alternative methods i e k nearest neighbors and one class svm to estimate a saliency score for each image patch through which distinctive features stand out without using identity labels in the training procedure 3 saliency matching is proposed based on patch matching matching patches with inconsistent saliency brings penalty and images of the same identity are recognized by minimizing the saliency matching cost 4 furthermore saliency matching is tightly integrated with patch matching in a unified structural ranksvm learning framework the effectiveness of our approach is validated on the four public datasets our approach outperforms the state of the art person re identification methods on all these datasets