fingerprint orientation field reconstruction by weighted discrete cosine transform orientation field represents the topological structure of the interleaved ridge and valley flows in fingerprint images although a number of methods have been proposed for orientation estimation reliable computation of orientation field is still a challenging problem due to the poor quality of some fingerprints this paper proposes a method to reconstruct fingerprint orientation field by weighted discrete cosine transform dct first the dct functions are used to build the basis atoms for linear representation of orientation field then the dct basis atoms of low and high orders are combined with the weights determined by singularity measurements for orientation reconstruction the weighted dct model is further extended for partial fingerprints to gradually and iteratively reconstruct the orientations in noisy or missing parts of fingerprints the proposed method can perform well in smoothing out the noise while maintaining the orientation details in singular regions extensive experiments have been done to compare the proposed method with some existing methods on nist and fvc fingerprint databases in terms of the reconstruction accuracy of orientation field fingerprint indexing performance and fingerprint recognition accuracy experimental results illustrate the effectiveness of the proposed method in reconstructing orientation fields especially for poor quality and partial fingerprints

directional morphological filtering we show that a translation invariant implementation of min max filters along a line segment of slope in the form of an irreducible fraction dy dx can be achieved at the cost of 2 k min max comparisons per image pixel where k max dx dy therefore for a given slope the computation time is constant and independent of the length of the line segment we then present the notion of periodic moving histogram algorithm this allows for a similar performance to be achieved in the more general case of rank filters and rank based morphological filters applications to the filtering of thin nets and computation of both granulometries and orientation fields are detailed finally two extensions are developed the first deals with the decomposition of discrete disks and arbitrarily oriented discrete rectangles while the second concerns min max filters along gray tone periodic line segments

bifurcation in granular materials an attempt for a unified framework sudden collapse mechanisms strictly inside the mohr coulomb plastic limit condition have been observed in granular materials in the laboratory as well as in the field the purpose of this paper is to show that the theoretical framework of loss of sustainability is convenient to describe such mechanisms in this context the notions of both loading and response variables which characterize the loading path applied to the specimen considered and its response path are fundamental moreover by investigating the relation between loading and response parameters it is established that this framework also embeds the notions of loss of constitutive uniqueness and loss of controllability therefore a unified approach is attempted finally by highlighting the basic role played by the loading parameters the vanishing of the second order work is shown to be a proper criterion to detect the occurrence of a bifurcation from a quasi static regime to a dynamic regime leading to the collapse of the material

failure in geomaterials continuous and discrete analyses various modes of failure in geomaterials have been observed in practice different criteria have been proposed to analyse these failures in particular hill s condition of stability and diffuse modes of failure are considered in this paper in a dual framework continuum mechanics and discrete mechanics with the assumption of continuous media experiments have shown that q constant loading paths q characterizes the second stress invariant for axisymmetric conditions q is equal to q sigma 1 sigma 3 where sigma 1 is the axial stress and sigma 3 the lateral stress can exhibit non localized failure modes and are analyzed by the second order work criterion with the assumption of discrete media grain avalanches are considered and spatial and temporal correlations between bursts of kinetic energy and peaks of negative values of second order work are demonstrated from discrete computations it is concluded that the second order work criterion under its dual form continuous and discrete can be a proper tool to analyse diffuse modes of failure in geomaterials

an extreme form of superactivation for quantum zero error capacities the zero error capacity of a channel is the rate at which it can send information perfectly with zero probability of error and has long been studied in classical information theory we show that the zero error capacity of quantum channels exhibits an extreme form of nonadditivity one which is not possible for classical channels or even for the usual capacities of quantum channels by combining probabilistic arguments with algebraic geometry we prove that there exist channels and with no zero error classical capacity whatsoever but whose joint zero error quantum capacity is positive this striking effect is an extreme form of the superactivation phenomenon as it implies that both the classical and quantum zero error capacities of these channels can be superactivated simultaneously while being a strictly stronger property of capacities superactivation of the quantum zero error capacity was not previously known

global models for the orientation field of fingerprints an approach based on quadratic differentials quadratic differentials naturally define analytic orientation fields on planar surfaces we propose to model orientation fields of fingerprints by specifying quadratic differentials models for all fingerprint classes such as arches loops and whorls are laid out these models are parametrised by few geometrically interpretable parameters which are invariant under euclidean motions we demonstrate their ability in adapting to given observed orientation fields and we compare them to existing models using the fingerprint images of the nist special database 4 we also illustrate that these model allow for extrapolation into unobserved regions this goes beyond the scope of earlier models for the orientation field as those are restricted to the observed planar fingerprint region within the framework of quadratic differentials we are able to verify analytically penrose s formula for the singularities on a palm l s penrose dermatoglyphics scientific american vol 221 no 6 pp 73 84 1969 potential applications of these models are the use of their parameters as indices of large fingerprint databases as well as the definition of intrinsic coordinates for single fingerprint images

fingerprint pattern classification abstract this paper presents a new method for fingerprint classification in this method fingerprint images are divided into 32 32 subregions to obtain direction pattern next the relaxation smoothing process with singularity detection and convergency checking is performed starting from the singular regions found feature parameters of the fingerprint are obtained by extracting major flow line traces the result of the experiments shows that this approach is capable of classifying fingerprint patterns into more than ten categories

entanglement can increase asymptotic rates of zero error classical communication over classical channels it is known that the number of different classical messages which can be communicated with a single use of a classical channel with zero probability of decoding error can sometimes be increased by using entanglement shared between sender and receiver it has been an open question to determine whether entanglement can ever increase the zero error communication rates achievable in the limit of many channel uses in this paper we show by explicit examples that entanglement can indeed increase asymptotic zero error capacity even to the extent that it is equal to the normal capacity of the channel

fingerprint indexing based on minutia cylinder code this paper proposes a new hash based indexing method to speed up fingerprint identification in large databases a locality sensitive hashing lsh scheme has been designed relying on minutiae cylinder code mcc which proved to be very effective in mapping a minutiae based representation position angle only into a set of fixed length transformation invariant binary vectors a novel search algorithm has been designed thanks to the derivation of a numerical approximation for the similarity between mcc vectors extensive experimentations have been carried out to compare the proposed approach against 15 existing methods over all the benchmarks typically used for fingerprint indexing in spite of the smaller set of features used top performing methods usually combine more features the new approach outperforms existing ones in almost all of the cases

constant compositions in the sphere packing bound for classical quantum channels the sphere packing bound in the form given by shannon gallager and berlekamp was recently extended to classical quantum channels and it was shown that this creates a natural setting for combining probabilistic approaches with some combinatorial ones such as the lovasz theta function in this paper we extend the study to the case of constant composition codes we first extend the sphere packing bound for classical quantum channels to this case and we then show that the obtained result is related to a variation of the lovasz theta function studied by marton we then propose a further extension to the case of varying channels and codewords with a constant conditional composition given a particular sequence this extension is finally applied to auxiliary channels to deduce a bound which is useful in the low rate region and which can be interpreted as an extension of the elias bound

fingerprint classification by directional image partitioning in this work we introduce a new approach to automatic fingerprint classification the directional image is partitioned into homogeneous connected regions according to the fingerprint topology thus giving a synthetic representation which can be exploited as a basis for the classification a set of dynamic masks together with an optimization criterion are used to guide the partitioning the adaptation of the masks produces a numerical vector representing each fingerprint as a multidimensional point which can be conceived as a continuous classification different search strategies are discussed to efficiently retrieve fingerprints both with continuous and exclusive classification experimental results have been given for the most commonly used fingerprint databases and the new method has been compared with other approaches known in the literature as to fingerprint retrieval based on continuous classification our method gives the best performance and exhibits a very high robustness

separation between quantum lovasz number and entanglement assisted zero error classical capacity quantum lovasz number is a quantum generalization of the lovasz number in graph theory it is the best known efficiently computable upper bound of the entanglement assisted zero error classical capacity of a quantum channel however it remains an intriguing open problem whether quantum entanglement can always enhance the zero error capacity to achieve the quantum lovasz number in this paper by constructing a particular class of qutrit to qutrit channels we show that there exists a strict gap between the entanglement assisted zero error capacity and the quantum lovasz number interestingly for this class of quantum channels the quantum generalization of fractional packing number is strictly larger than the zero error capacity assisted with feedback or no signaling correlations which differs from the case of classical channels

on zero error communication via quantum channels in the presence of noiseless feedback we initiate the study of zero error communication via quantum channels when the receiver and the sender have at their disposal a noiseless feedback channel of unlimited quantum capacity generalizing shannon s zero error communication theory with instantaneous feedback we first show that this capacity is only a function of the linear span of choi kraus operators of the channel which generalizes the bipartite equivocation graph of a classical channel and which we dub non commutative bipartite graph then we go on to show that the feedback assisted capacity is non zero allowing for a constant amount of activating noiseless communication if and only if the non commutative bipartite graph is non trivial and give a number of equivalent characterizations this result involves a far reaching extension of the conclusive exclusion of quantum states we then present an upper bound on the feedback assisted zero error capacity motivated by a conjecture originally made by shannon and proved later by ahlswede we demonstrate that this bound to have many good properties including being additive and given by a minimax formula we also prove a coding theorem showing that this quantity is the entanglement assisted capacity against an adversarially chosen channel from the set of all channels with the same choi kraus span which can also be interpreted as the feedback assisted unambiguous capacity the proof relies on a generalization of the postselection lemma de finetti reduction that allows to reflect additional constraints and which we believe to be of independent interest this capacity is a relaxation of the feedback assisted zero error capacity however we have to leave open the question of whether they coincide in general we illustrate our ideas with a number of examples including classical quantum channels and weyl diagonal channels and close with an extensive discussion of open questions

uniqueness studies in boundary value problems involving some second gradient models abstract enhanced models such as second gradient models have been mainly theoretically developed during the sixties and the seventies new attention has been paid to these models recently when it has been recognized that classical inelastic constitutive equations especially the ones not obeying a normality rule induce ill posed boundary value problems however little work has been done to study the well posedness properties of boundary value problems involving these enhanced models the aim of this paper is a partial study of this point only uniqueness of solution of numerical discretization of boundary value problems involving second gradient models is considered we extend to second gradient models a numerical search method to find non uniqueness already established for classical media in the case of loss of uniqueness for the underlying model our numerical results show clearly that in some cases uniqueness is lost for second gradient model as well it seems that second gradient extensions of classical models do not restore the uniqueness properties but only the objectivity of the numerical computation finally our numerical experiments show once more that post peak behavior is a structural effect they also suggest that some constitutive equations often used in geomaterials modeling may be questionable and may not be complete because even adding second gradient enhancement to these models yields non unique solutions

palmprint classification using principal lines this paper proposes a novel algorithm for the automatic classification of low resolution palmprints first the principal lines of the palm are defined using their position and thickness then a set of directional line detectors is devised after that we use these directional line detectors to extract the principal lines in terms of their characteristics and their definitions in two steps the potential beginnings line initials of the principal lines are extracted and then based on these line initials a recursive process is applied to extract the principal lines in their entirety finally palmprints are classified into six categories according to the number of the principal lines and the number of their intersections the proportions of these six categories 1 6 in our database containing 13 800 samples are 0 36 1 23 2 83 11 81 78 12 and 5 65 respectively the proposed algorithm has been shown to classify palmprints with an accuracy of 96 03

hydromechanical modeling of an initial boundary value problem studies of non uniqueness with a second gradient continuum a non uniqueness study for a hydromechanical boundary value problem is performed a fully saturated porous medium is considered using an elasto plastic constitutive equations to describe the mechanical behavior of the skeleton a real hydromechanical experiment which consists in a hollow cylinder test on a boom clay sample is modelled it is shown that the time step discretisation of the numerical problem has an effect on the initialisation of the newton raphson algorithm on a given time step different solutions for the same initial boundary value problem can consequently be found

on some classes of bipartite unitary operators we investigate unitary operators acting on a tensor product space with the property that the quantum channels they generate via the stinespring dilation theorem are of a particular type independently of the state of the ancilla system in the stinespring relation the types of quantum channels we consider are those of interest in quantum information theory unitary conjugations constant channels unital channels mixed unitary channels ppt channels and en tanglement breaking channels for some of the classes of bipartite unitary operators corresponding to the above types of channels we provide explicit characterizations necessary and or sufficient conditions for membership and we compute the dimension of the corresponding algebraic variety inclusions between these classes are considered and we show that for small dimensions many of these sets are identical

zero error communication via quantum channels noncommutative graphs and a quantum lovasz number we study the quantum channel version of shannon s zero error capacity problem motivated by recent progress on this question we propose to consider a certain subspace of operators so called operator systems as the quantum generalization of the adjacency matrix in terms of which the zero error capacity of a quantum channel as well as the quantum and entanglement assisted zero error capacities can be formulated and for which we show some new basic properties most importantly we define a quantum version of lovasz famous function on general operator systems as the norm completion or stabilization of a naive generalization of we go on to show that this function upper bounds the number of entanglement assisted zero error messages that it is given by a semidefinite program whose dual we write down explicitly and that it is multiplicative with respect to the tensor product of operator systems corresponding to the tensor product of channels we explore various other properties of the new quantity which reduces to lovasz original in the classical case give several applications and propose to study the operator systems associated with channels as noncommutative graphs using the language of hilbert modules

zero error capacity under list decoding shannon s zero error channel capacities c sub of c sub o with and without noiseless feedback are generalized to list decoding the receiver lists l messages erring if the correct one is not listed the corresponding capacities c sub of l c sub o l are nondecreasing in l for an i letter input alphabet c sub of l attains its maximum at l i 1 a lower bound to c sub o l approaches that maximum as l increases

dynamic clustering of maps in autonomous agents the problem of organizing and exploiting spatial knowledge for navigation is an important issue in the field of autonomous mobile systems in particular partitioning the environment map into connected clusters allows for significant topological features to be captured and enables decomposition of path planning tasks through a divide and conquer policy clustering by discovery is a procedure for identifying clusters in a map being learned by exploration as the agent moves within the environment and yields a valid clustering of the available knowledge at each exploration step in this work we define a fitness measure for clustering and propose two incremental heuristic algorithms to maximize it both algorithms determine clusters dynamically according to a set of topological and metric criteria the first one is aimed at locally minimizing a measure of scattering of the entities belonging to clusters and partially rearranges the existing clusters at each exploration step the second estimates the positions and dimensions of clusters according to a global map of density the two algorithms are compared in terms of optimality efficiency robustness and stability

the operational meaning of min and max entropy in this paper we show that the conditional min entropy h min a b of a bipartite state rhoab is directly related to the maximum achievable overlap with a maximally entangled state if only local actions on the b part of rhoab are allowed in the special case where a is classical this overlap corresponds to the probability of guessing a given b in a similar vein we connect the conditional max entropy h max a b to the maximum fidelity of rhoab with a product state that is completely mixed on a in the case where a is classical this corresponds to the security of a when used as a secret key in the presence of an adversary holding b because min and max entropies are known to characterize information processing tasks such as randomness extraction and state merging our results establish a direct connection between these tasks and basic operational problems for example they imply that the logarithm of the probability of guessing a given b is a lower bound on the number of uniform secret bits that can be extracted from a relative to an adversary holding b

the quantum reverse shannon theorem based on one shot information theory the quantum reverse shannon theorem states that any quantum channel can be simulated by an unlimited amount of shared entanglement and an amount of classical communication equal to the channel s entanglement assisted classical capacity in this paper we provide a new proof of this theorem which has previously been proved by bennett devetak harrow shor and winter our proof has a clear structure being based on two recent information theoretic results one shot quantum state merging and the post selection technique for quantum channels

semidefinite programming strong converse bounds for classical capacity we investigate the classical communication over quantum channels when assisted by no signaling and positive partial transpose preserving ppt codes for which both the optimal success probability of a given transmission rate and the one shot epsilon error capacity are formalized as semidefinite programs sdps based on this we obtain improved sdp finite blocklength converse bounds of general quantum channels for entanglement assisted codes and unassisted codes furthermore we derive two sdp strong converse bounds for the classical capacity of general quantum channels for any code with a rate exceeding either of the two bounds of the channel the success probability vanishes exponentially fast as the number of channel uses increases in particular applying our efficiently computable bounds we derive an improved upper bound on the classical capacity of the amplitude damping channel we also establish the strong converse property for the classical and private capacities of a new class of quantum channels we finally study the zero error setting and provide efficiently computable upper bounds on the one shot zero error capacity of a general quantum channel

invariant representation of orientation fields for fingerprint indexing orientation fields can be used to describe interleaved ridge and valley patterns of fingerprint image providing features useful for fingerprint recognition however for tasks such as fingerprint indexing additional image alignment is often required to avoid confounding effects caused by pose differences in this paper we propose to employ a set of polar complex moments pcms for extraction of rotation invariant fingerprint representation pcms are capable of describing fingerprint ridge flow structures including singular regions and are tolerant to spurious orientations in noisy fingerprints from the orientation fields a set of rotation moment invariants are derived to form a feature vector for comprehensive fingerprint structural description this feature vector gives a compact and rotation invariant representation that is important for pose robust fingerprint indexing a clustering based fingerprint indexing scheme is employed to facilitate efficient and effective retrieval of the most likely candidates from a fingerprint database our experimental results on nist and fvc fingerprint databases indicate that the proposed invariant representation improves the performance of fingerprint indexing as compared to state of the art methods

uniqueness and localization i associative and non associative elastoplasticity abstract localization of deformation into a planar band in the incremental response of elasto plastic material is studied in the case of small strains and rotations the critical hardening modulus for localization is given in an explicit form uncoupled from the band normal for an arbitrary rate independent non associative plasticity loss of uniqueness of the response is investigated in terms of positiveness of the second order work density criteria for loss of second order work positiveness and localization are compared for plane stress and plane strain in these cases for the associative flow rule the threshold for the second order work positiveness coincides with the threshold for shear band formation this coincidence may not however occur if localization into splitting mode is attained

detection of singular points in fingerprint images abstract this paper describes a technique for the detection of singular points in a fingerprint image the singular points namely the core and the delta points are used as points of registration in fingerprint matching this method makes use of structural information culled from the directional histograms of the directional image of a fingerprint the usage of the histogram allows for a fairly high degree of noise tolerance

entanglement assisted capacity of a quantum channel and the reverse shannon theorem the entanglement assisted classical capacity of a noisy quantum channel c sub e is the amount of information per channel use that can be sent over the channel in the limit of many uses of the channel assuming that the sender and receiver have access to the resource of shared quantum entanglement which may be used up by the communication protocol we show that the capacity c sub e is given by an expression parallel to that for the capacity of a purely classical channel i e the maximum over channel inputs spl rho of the entropy of the channel input plus the entropy of the channel output minus their joint entropy the latter being defined as the entropy of an entangled purification of spl rho after half of it has passed through the channel we calculate entanglement assisted capacities for two interesting quantum channels the qubit amplitude damping channel and the bosonic channel with amplification attenuation and gaussian noise we discuss how many independent parameters are required to completely characterize the asymptotic behavior of a general quantum channel alone or in the presence of ancillary resources such as prior entanglement in the classical analog of entanglement assisted communication communication over a discrete memoryless channel dmc between parties who share prior random information we show that one parameter is sufficient i e that in the presence of prior shared random information all dmcs of equal capacity can simulate one another with unit asymptotic efficiency

fingerprint reference point detection for image retrieval based on symmetry and variation reference point plays an important role in fingerprint identification systems the reference point is widely used for the fingerprint retrieval in large scale databases this paper proposes a novel algorithm for detecting a convex core point as a unique reference point consistently and accurately for all types of fingerprints in order to detect robust core point candidates a modified complex filter called semi radial symmetry filter is proposed to detect correctly rotational symmetries of core points moreover a vertical orientation variation feature called voriv feature is proposed to remove spurious core points and concave core points therefore the proposed technique computes the variation and symmetry combined energy vscome then the reference point is located by searching the global vscome maximum the experimental results on the public database fvc2004 db1 set a show that the proposed technique exhibits a very high robustness and gets the best performance in comparing with other approaches in literature

fingerprint indexing based on minutiae pairs and convex core point an efficient fingerprint indexing which uses ellipse properties is proposed a new fingerprint indexing is proposed using minutiae pairs and convex core point our fingerprint representation is very robust to distortions and noise the proposed fingerprint features are invariant to rotation and translation fingerprint identification is an important issue for identifying fingerprints and plays a key role in the fingerprint recognition systems however performing a fingerprint identification over a large database can be an inefficient task due to the lack of scalability and high computing times of fingerprint matching algorithms fingerprint indexing is a key strategy in automatic fingerprint identification systems afiss which allows us to reduce the number of candidates the search space and the occurrences of false acceptance in large databases in this paper an efficient indexing algorithm is proposed using minutiae pairs and convex core point which employs k means clustering and candidate list reduction criteria to improve the identification performance our proposal can effectively reduce the search space and number of candidates for fingerprint matching and thus achieves higher efficiency and significantly improves the system retrieval performance experimental results over some of the fingerprint verification competition fvc and the national institute of standards and technology nist databases prove the superiority of the proposed approach against some of the well known indexing algorithms

combining singular points and orientation image information for fingerprint classification fingerprint classification is crucial to reduce the processing time in a large scale database two popular features used are the singularities and orientation information and they are complementary therefore an algorithm based on the interactive validation of singular points and the constrained nonlinear orientation model is proposed the final features used for classification comprises the coefficients of the orientation model and the singularity information this resulted in very compact feature vector which is used as input to an svm classifier to perform the classification the experiments conducted on the nist database 4 show the effectiveness of the proposed method in producing good classification result

zero error channel capacity and simulation assisted by non local correlations the theory of zero error communication is re examined in the broader setting of using one classical channel to simulate another exactly in the presence of various classes of nonsignalling correlations between sender and receiver i e shared randomness shared entanglement and arbitrary nonsignalling correlations when the channel being simulated is noiseless this is zero error coding assisted by correlations when the resource channel is noiseless it is the reverse problem of simulating a noisy channel exactly by a noiseless one assisted by correlations in both cases separations between the power of the different classes of assisting correlations are exhibited for finite block lengths the most striking result here is that entanglement can assist in zero error communication in the large block length limit shared randomness is shown to be just as powerful as arbitrary nonsignalling correlations for exact simulation but not for asymptotic zero error coding for assistance by arbitrary nonsignalling correlations linear programming formulas for the asymptotic capacity and simulation rates are derived the former being equal for channels with nonzero unassisted capacity to the feedback assisted zero error capacity derived by shannon finally a kind of reversibility between nonsignalling assisted zero error capacity and exact simulation is observed mirroring the usual reverse shannon theorem

fingerprint classification using fast fourier transform and nonlinear discriminant analysis in this paper we present a new approach for fingerprint classification based on discrete fourier transform dft and nonlinear discriminant analysis utilizing the dft and directional filters a reliable and efficient directional image is constructed from each fingerprint image and then nonlinear discriminant analysis is applied to the constructed directional images reducing the dimension dramatically and extracting the discriminant features the proposed method explores the capability of dft and directional filtering in dealing with low quality images and the effectiveness of nonlinear feature extraction method in fingerprint classification experimental results demonstrates competitive performance compared with other published results

semidefinite programming converse bounds for quantum communication we derive several efficiently computable converse bounds for quantum communication over quantum channels in both the one shot and asymptotic regime first we derive one shot semidefinite programming sdp converse bounds on the amount of quantum information that can be transmitted over a single use of a quantum channel which improve the previous bound from tomamichel berta renes nat commun 7 2016 as applications we study quantum communication over depolarizing channels and amplitude damping channels with finite resources second we find an sdp strong converse bound for the quantum capacity of an arbitrary quantum channel which means the fidelity of any sequence of codes with a rate exceeding this bound will vanish exponentially fast as the number of channel uses increases furthermore we prove that the sdp strong converse bound improves the partial transposition bound introduced by holevo and werner third we prove that this sdp strong converse bound is equal to the so called max rains information which is an analog to the rains information introduced in tomamichel wilde winter ieee trans inf theory 63 715 2017 our sdp strong converse bound is weaker than the rains information but it is efficiently computable for general quantum channels

no signalling assisted zero error capacity of quantum channels and an information theoretic interpretation of the lovasz number we study the one shot zero error classical capacity of a quantum channel assisted by quantum no signalling correlations and the reverse problem of exact simulation of a prescribed channel by a noiseless classical one quantum no signalling correlations are viewed as two input and two output completely positive and trace preserving maps with linear constraints enforcing that the device cannot signal both problems lead to simple semidefinite programmes sdps that depend only on the choi kraus operator space of the channel in particular we show that the zero error classical simulation cost is precisely the conditional min entropy of the choi jamiolkowski matrix of the given channel the zero error classical capacity is given by a similar looking but different sdp the asymptotic zero error classical capacity is the regularization of this sdp and in general we do not know of any simple form interestingly however for the class of classical quantum channels we show that the asymptotic capacity is given by a much simpler sdp which coincides with a semidefinite generalization of the fractional packing number suggested earlier by aram harrow this finally results in an operational interpretation of the celebrated lovasz vartheta function of a graph as the zero error classical capacity of the graph assisted by quantum no signalling correlations the first information theoretic interpretation of the lovasz number

existence and uniqueness theorems for boundaryvalue problems involving incrementally non linear models abstract sufficient conditions for existence and uniqueness of rate boundary value probleminvolving an incrementally non linear constitutive equation useful for geomaterials are proved the models considered are incrementally non linear models not descending from a rate potentialand thus are not included into the hill theory framework results are given in the framework ofsmall strain assumption the main assumption is the positiveness of the second order work theexistence theorem is a generalisation of the lax milgram theorem whereas uniqueness theoremis based on the well known hill exclusion functional

geometric framework for fingerprint image classification given a digitized fingerprint image we would like to classify it into one of several types already established in the literature in this paper we consider five types for classification double loop whorl left loop right loop and arch we illustrate the use of a geometric framework for a systematic top down classification of the foregoing types from the double loop type down to the arch type in the order given above the framework employs both a geometric grouping and a global geometric shape analysis of fingerprint ridges to accomplish the required task these processes are based on the framework s underlying b spline representation and interpretation of the ridges

on converse bounds for classical communication over quantum channels we explore several new converse bounds for classical communication over quantum channels in both the one shot and asymptotic regimes first we show that the matthews wehner meta converse bound for entanglement assisted classical communication can be achieved by activated no signaling assisted codes suitably generalizing a result for classical channels second we derive a new efficiently computable meta converse on the amount of classical information unassisted codes can transmit over a single use of a quantum channel as applications we provide a finite resource analysis of classical communication over quantum erasure channels including the second order and moderate deviation asymptotics third we explore the asymptotic analogue of our new meta converse the upsilon information of the channel we show that its regularization is an upper bound on the classical capacity which is generally tighter than the entanglement assisted capacity and other known efficiently computable strong converse bounds for covariant channels we show that the upsilon information is a strong converse bound

extracting image orientation feature by using integration operator this paper presents an orientation operator to extract image local orientation features we show that a proper employment of image integration leads to an unbiased orientation estimate based on which an orientation operator is proposed the resulting discrete operator has flexibility in the scale selection as the scale change does not violate the bias minimization criteria an analytical formula is developed to compare orientation biases of various discrete operators the proposed operator shows lower bias than eight well known gradient operators experiments further demonstrate higher orientation accuracy of the proposed operator than these gradient operators

a novel algorithm for detecting singular points from fingerprint images fingerprint analysis is typically based on the location and pattern of detected singular points in the images these singular points cores and deltas not only represent the characteristics of local ridge patterns but also determine the topological structure i e fingerprint type and largely influence the orientation field in this paper we propose a novel algorithm for singular points detection after an initial detection using the conventional poincare index method a so called doric feature is used to remove spurious singular points then the optimal combination of singular points is selected to minimize the difference between the original orientation field and the model based orientation field reconstructed using the singular points a core delta relation is used as a global constraint for the final selection of singular points experimental results show that our algorithm is accurate and robust giving better results than competing approaches the proposed detection algorithm can also be used for more general 2d oriented patterns such as fluid flow motion and so forth