47,385 research outputs found
Open-Category Classification by Adversarial Sample Generation
In real-world classification tasks, it is difficult to collect training
samples from all possible categories of the environment. Therefore, when an
instance of an unseen class appears in the prediction stage, a robust
classifier should be able to tell that it is from an unseen class, instead of
classifying it to be any known category. In this paper, adopting the idea of
adversarial learning, we propose the ASG framework for open-category
classification. ASG generates positive and negative samples of seen categories
in the unsupervised manner via an adversarial learning strategy. With the
generated samples, ASG then learns to tell seen from unseen in the supervised
manner. Experiments performed on several datasets show the effectiveness of
ASG.Comment: Published in IJCAI 201
Brane worlds in gravity with auxiliary fields
Recently, Pani, Sotiriou, and Vernieri explored a new theory of gravity by
adding nondynamical fields, i.e., gravity with auxiliary fields [Phys. Rev. D
88, 121502(R) (2013)]. In this gravity theory, higher-order derivatives of
matter fields generically appear in the field equations. In this paper we
extend this theory to any dimensions and discuss the thick braneworld model in
five dimensions. Domain wall solutions are obtained numerically. The stability
of the brane system under the tensor perturbation is analyzed. We find that the
system is stable under the tensor perturbation and the gravity zero mode is
localized on the brane. Therefore, the four-dimensional Newtonian potential can
be realized on the brane.Comment: 7 pages, 4 figure
Efficient method for aeroelastic tailoring of composite wing to minimize gust response
Aeroelastic tailoring of laminated composite structure demands relatively high computational time especially for dynamic problem. This paper presents an efficient method for aeroelastic dynamic response analysis with significantly reduced computational time. In this method, a relationship is established between the maximum aeroelastic response and quasi-steady deflection of a wing subject to a dynamic loading. Based on this relationship, the time consuming dynamic response can be approximated by a quasi-steady deflection analysis in a large proportion of the optimization process. This method has been applied to the aeroelastic tailoring of a composite wing of a tailless aircraft for minimum gust response. The results have shown that 20%–36% gust response reduction has been achieved for this case. The computational time of the optimization process has been reduced by 90% at the cost of accuracy reduction of 2~4% comparing with the traditional dynamic response analysis
Optimal transfer of an unknown state via a bipartite operation
A fundamental task in quantum information science is to transfer an unknown
state from particle to particle (often in remote space locations) by
using a bipartite quantum operation . We suggest the power of
for quantum state transfer (QST) to be the maximal average
probability of QST over the initial states of particle and the
identifications of the state vectors between and . We find the QST power
of a bipartite quantum operations satisfies four desired properties between two
-dimensional Hilbert spaces. When and are qubits, the analytical
expressions of the QST power is given. In particular, we obtain the exact
results of the QST power for a general two-qubit unitary transformation.Comment: 6 pages, 1 figur
Robust Non-Rigid Registration with Reweighted Position and Transformation Sparsity
Non-rigid registration is challenging because it is ill-posed with high
degrees of freedom and is thus sensitive to noise and outliers. We propose a
robust non-rigid registration method using reweighted sparsities on position
and transformation to estimate the deformations between 3-D shapes. We
formulate the energy function with position and transformation sparsity on both
the data term and the smoothness term, and define the smoothness constraint
using local rigidity. The double sparsity based non-rigid registration model is
enhanced with a reweighting scheme, and solved by transferring the model into
four alternately-optimized subproblems which have exact solutions and
guaranteed convergence. Experimental results on both public datasets and real
scanned datasets show that our method outperforms the state-of-the-art methods
and is more robust to noise and outliers than conventional non-rigid
registration methods.Comment: IEEE Transactions on Visualization and Computer Graphic
- …