scholarly journals Simultaneous Feature Aggregating and Hashing for Compact Binary Code Learning

2019 ◽  
Vol 28 (10) ◽  
pp. 4954-4969 ◽  
Author(s):  
Thanh-Toan Do ◽  
Khoa Le ◽  
Tuan Hoang ◽  
Huu Le ◽  
Tam V. Nguyen ◽  
...  
Keyword(s):  
Binary Code ◽  
Compact Binary

scholarly journals Discrete Two-Step Cross-Modal Hashing through the Exploitation of Pairwise Relations

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Shaohua Wang ◽  
Xiao Kang ◽  
Fasheng Liu ◽  
Xiushan Nie ◽  
Xingbo Liu
Keyword(s):  
Learning Process ◽  
Binary Code ◽  
Similarity Matrix ◽  
Pairwise Similarity ◽  
Multimodal Data ◽  
Fine Grained ◽  
Compact Binary ◽  
Similarity Relations ◽  
Retrieval Efficiency ◽  
Out Of Sample

The cross-modal hashing method can map heterogeneous multimodal data into a compact binary code that preserves semantic similarity, which can significantly enhance the convenience of cross-modal retrieval. However, the currently available supervised cross-modal hashing methods generally only factorize the label matrix and do not fully exploit the supervised information. Furthermore, these methods often only use one-directional mapping, which results in an unstable hash learning process. To address these problems, we propose a new supervised cross-modal hash learning method called Discrete Two-step Cross-modal Hashing (DTCH) through the exploitation of pairwise relations. Specifically, this method fully exploits the pairwise similarity relations contained in the supervision information: for the label matrix, the hash learning process is stabilized by combining matrix factorization and label regression; for the pairwise similarity matrix, a semirelaxed and semidiscrete strategy is adopted to potentially reduce the cumulative quantization errors while improving the retrieval efficiency and accuracy. The approach further combines an exploration of fine-grained features in the objective function with a novel out-of-sample extension strategy to enable the implicit preservation of consistency between the different modal distributions of samples and the pairwise similarity relations. The superiority of our method was verified through extensive experiments using two widely used datasets.

A program understanding approach for stripped binary code

2009 ◽  
Vol 28 (10) ◽  
pp. 2608-2612
Author(s):  
Juan-ru LI ◽  
Da-wu GU ◽  
Hai-ning LU
Keyword(s):  
Binary Code ◽  
Program Understanding

Explicit symplectic-like integration with corrected map for inseparable Hamiltonian

2020 ◽  
Vol 501 (1) ◽  
pp. 1511-1519
Author(s):  
Junjie Luo ◽  
Weipeng Lin ◽  
Lili Yang
Keyword(s):  
Phase Space ◽  
Space Structure ◽  
Eighth Order ◽  
Time Step ◽  
Extended Phase ◽  
Energy Error ◽  
Phase Space Structure ◽  
Compact Binary ◽  
Three Body

ABSTRACT Symplectic algorithms are widely used for long-term integration of astrophysical problems. However, this technique can only be easily constructed for separable Hamiltonian, as preserving the phase-space structure. Recently, for inseparable Hamiltonian, the fourth-order extended phase-space explicit symplectic-like methods have been developed by using the Yoshida’s triple product with a mid-point map, where the algorithm is more effective, stable and also more accurate, compared with the sequent permutations of momenta and position coordinates, especially for some chaotic case. However, it has been found that, for the cases such as with chaotic orbits of spinning compact binary or circular restricted three-body system, it may cause secular drift in energy error and even more the computation break down. To solve this problem, we have made further improvement on the mid-point map with a momentum-scaling correction, which turns out to behave more stably in long-term evolution and have smaller energy error than previous methods. In particular, it could obtain a comparable phase-space distance as computing from the eighth-order Runge–Kutta method with the same time-step.

scholarly journals SIGMA: A Semantic Integrated Graph Matching Approach for identifying reused functions in binary code

2015 ◽  
Vol 12 ◽  
pp. S61-S71 ◽  
Author(s):  
Saed Alrabaee ◽  
Paria Shirani ◽  
Lingyu Wang ◽  
Mourad Debbabi
Keyword(s):  
Binary Code ◽  
Graph Matching

scholarly journals Spectral index-flux relation for investigating the origins of steep decay in γ-ray bursts

2021 ◽  
Vol 12 (1) ◽  
Author(s):  
Samuele Ronchini ◽  
Gor Oganesyan ◽  
Marica Branchesi ◽  
Stefano Ascenzi ◽  
Maria Grazia Bernardini ◽  
...  
Keyword(s):  
Spectral Index ◽  
Proton Synchrotron ◽  
Relativistic Jets ◽  
Time Resolved ◽  
X Ray ◽  
Compact Binary ◽  
Internal Dissipation ◽  
Adiabatic Cooling ◽  
Alternative Scenarios ◽  
Steep Decay

Abstractγ-ray bursts (GRBs) are short-lived transients releasing a large amount of energy (1051 − 1053 erg) in the keV-MeV energy range. GRBs are thought to originate from internal dissipation of the energy carried by ultra-relativistic jets launched by the remnant of a massive star’s death or a compact binary coalescence. While thousands of GRBs have been observed over the last thirty years, we still have an incomplete understanding of where and how the radiation is generated in the jet. Here we show a relation between the spectral index and the flux found by investigating the X-ray tails of bright GRB pulses via time-resolved spectral analysis. This relation is incompatible with the long standing scenario which invokes the delayed arrival of photons from high-latitude parts of the jet. While the alternative scenarios cannot be firmly excluded, the adiabatic cooling of the emitting particles is the most plausible explanation for the discovered relation, suggesting a proton-synchrotron origin of the GRB emission.

Sign in / Sign up

Export Citation Format

Share Document