988 resultados para Document Representation
Resumo:
Entanglement transformation of composite quantum systems is investigated in the context of group representation theory. Representation of the direct product group SL(2, C) circle times SL(2, C), composed of local operators acting on the binary composite system, is realized in the four-dimensional complex space in terms of a set of novel bases that are pseudo-orthonormalized. The two-to-one homomorphism is then established for the group SL(2, C) circle times SL(2, C) onto the SO(4, C). It is shown that the resulting representation theory leads to the complete characterization for the entanglement transformation of the binary composite system.
nbs: a new representation for point surfaces based on genetic clustering algorithm: cad and graphics
Resumo:
It is common that documents are represented by document icon in graphical user interfaces. The document icon facilitates user to retrieve documents, but it is difficult to distinguish the document from a collection of documents that user have accessed to. Our paper presents a document icon on which the users can add some subjective values and mark. Then we describe a system ex-explorer that users can browser and search the extent document icon. We found that it is easy to re-find the document on which users added some annotation or mark by themselves.
Resumo:
In most contemporary optics courses, Gaussian beams are demonstrated in the form of propagation along one coordinate axis. This is referred to as the conventional representation and is in fact a special form. In this paper, we derive the general representation of a Gaussian beam propagating obliquely to the coordinate axis, by performing a coordinate rotation transformation on the conventional representation. When doing so on the beam parameters, a restrictive condition has to be taken into account. Without this condition, the expressions for the beam parameters after the rotation are not consistent with the conventional ones.
Resumo:
ACM SIGIR; ACM SIGWEB
Resumo:
Subspace learning is the process of finding a proper feature subspace and then projecting high-dimensional data onto the learned low-dimensional subspace. The projection operation requires many floating-point multiplications and additions, which makes the projection process computationally expensive. To tackle this problem, this paper proposes two simple-but-effective fast subspace learning and image projection methods, fast Haar transform (FHT) based principal component analysis and FHT based spectral regression discriminant analysis. The advantages of these two methods result from employing both the FHT for subspace learning and the integral vector for feature extraction. Experimental results on three face databases demonstrated their effectiveness and efficiency.
Resumo:
In this article, graphical representations of DNA primary sequences were generated. Topological indices and molecular connectivity indices were calculated and used for the comparison of similarities among eight different DNA segments. The satisfactory results were achieved by this analysis.
Resumo:
In the framework of lattice fluid model, the Gibbs energy and equation of state are derived by introducing the energy (E-s) stored during flow for polymer blends under shear. From the calculation of the spinodal of poly(vinyl methyl ether) (PVME) and polystyrene (PS) mixtures, we have found the influence of E., an equation of state in pure component is inappreciable, but it is appreciable in the mixture. However, the effect of E, on phase separation behavior is extremely striking. In the calculation of spinodal for the PVME/PS system, a thin, long and banana miscibility gap generated by shear is seen beside the miscibility gap with lower critical solution temperature. Meanwhile, a binodal coalescence of upper and lower miscibility gaps is occurred. The three points of the three-phase equilibrium are forecasted. The shear rate dependence of cloud point temperature at a certain composition is discussed. The calculated results are acceptable compared with the experiment values obtained by Higgins et at. However, the maximum positive shift and the minimum negative shift of cloud point temperature guessed by Higgins are not obtained, Furthermore, the combining effects of pressure and shear on spinodal shift are predicted.
Resumo:
In this paper, the analytical representations of four wave source functions in high-frequency spectrum range are given on the basis of ocean wave theory and dimensional analysis, and the perturbation method is used to solve the governing equations of ocean wave high-frequency spectrum on the basis of the temporally stationary and locally homogeneous scale relations of microscale wave. The microscale ocean wavenumber spectrum correct to the second order has an explicit structure, its first order part represents the equilibrium between different source functions, and its second order part represents the contribution of microscale wave propagation.
Resumo:
We explore representation of 3D objects in which several distinct 2D views are stored for each object. We demonstrate the ability of a two-layer network of thresholded summation units to support such representations. Using unsupervised Hebbian relaxation, we trained the network to recognise ten objects from different viewpoints. The training process led to the emergence of compact representations of the specific input views. When tested on novel views of the same objects, the network exhibited a substantial generalisation capability. In simulated psychophysical experiments, the network's behavior was qualitatively similar to that of human subjects.
Resumo:
The interpretation and recognition of noisy contours, such as silhouettes, have proven to be difficult. One obstacle to the solution of these problems has been the lack of a robust representation for contours. The contour is represented by a set of pairwise tangent circular arcs. The advantage of such an approach is that mathematical properties such as orientation and curvature are explicityly represented. We introduce a smoothing criterion for the contour tht optimizes the tradeoff between the complexity of the contour and proximity of the data points. The complexity measure is the number of extrema of curvature present in the contour. The smoothing criterion leads us to a true scale-space for contours. We describe the computation of the contour representation as well as the computation of relevant properties of the contour. We consider the potential application of the representation, the smoothing paradigm, and the scale-space to contour interpretation and recognition.