Search

Complex Logical Query Answering (CLQA) over incomplete knowledge graphs is a challenging task. Recently, Query Embedding (QE) methods are proposed to solve CLQA by performing multi-hop logical reasoning. However, most of them only consider historical query context information while ignoring future information, which leads to their failure to capture the complex dependencies behind the elements of a query. In recent years, the transformer architecture has shown a strong ability to model long-range dependencies between words. The bidirectional attention mechanism proposed by the transformer can solve the limitation of these QE methods regarding query context. Still, as a sequence model, it is difficult for the transformer to model complex logical queries with branch structure computation graphs directly. To this end, we propose a neural one-point embedding method called Pathformer based on the tree-like computation graph, i.e., query computation tree. Specifically, Pathformer decomposes the query computation tree into path query sequences by branches and then uses the transformer encoder to recursively encode these path query sequences to obtain the final query embedding. This allows Pathformer to fully utilize future context information to explicitly model the complex interactions between various parts of the path query. Experimental results show that Pathformer outperforms existing competitive neural QE methods, and we found that Pathformer has the potential to be applied to non-one-point embedding space., Comment: This work has been submitted to the IEEE

We search for an optimal filter design for the estimation of stellar metallicity, based on synthetic photometry from Gaia XP spectra convolved with a series of filter-transmission curves defined by different central wavelengths and bandwidths. Unlike previous designs based solely on maximizing metallicity sensitivity, we find that the optimal solution provides a balance between the sensitivity and uncertainty of the spectra. With this optimal filter design, the best precision of metallicity estimates for relatively bright ($G \sim 11.5$) stars is excellent, $\sigma_{\rm [Fe/H]} = 0.034$\,dex for FGK dwarf stars, superior to that obtained utilizing custom sensitivity-optimized filters (e.g., SkyMapper\,$v$). By selecting hundreds of high-probabability member stars of the open cluster M67, our analysis reveals that the intrinsic photometric-metallicity scatter of these cluster members is only 0.036\,dex, consistent with this level of precision. Our results clearly demonstrate that the internal precision of photometric-metallicity estimates can be extremely high, even providing the opportunity to perform chemical tagging for very large numbers of field stars in the Milky Way. This experiment shows that it is crucial to take into account uncertainty alongside the sensitivity when designing filters for measuring the stellar metallicity and other parameters., Comment: 9 pages, 5 figures; ApJL accepted, see main result in Figures 5

Deriving atmospheric parameters of a large sample of stars is of vital importance to understand the formation and evolution of the Milky Way. Photometric surveys, especially those with near-ultraviolet filters, can offer accurate measurements of stellar parameters, with the precision comparable to that from low/medium resolution spectroscopy. In this study, we explore the capability of measuring stellar atmospheric parameters from CSST broad-band photometry (particularly the near-ultraviolet bands), based on synthetic colors derived from model spectra. We find that colors from the optical and near-ultraviolet filter systems adopted by CSST show significant sensitivities to the stellar atmospheric parameters, especially the metallicity. According to our mock data tests, the precision of the photometric metallicity is quite high, with typical values of 0.17 dex and 0.20 dex for dwarf and giant stars, respectively. The precision of the effective temperature estimated from broad-band colors are within 50 K., Comment: 16 pages, 18 figures, accepted by Research in Astronomy and Astrophysics

Plant diseases serve as one of main threats to food security and crop production. It is thus valuable to exploit recent advances of artificial intelligence to assist plant disease diagnosis. One popular approach is to transform this problem as a leaf image classification task, which can be then addressed by the powerful convolutional neural networks (CNNs). However, the performance of CNN-based classification approach depends on a large amount of high-quality manually labeled training data, which are inevitably introduced noise on labels in practice, leading to model overfitting and performance degradation. To overcome this problem, we propose a novel framework that incorporates rectified meta-learning module into common CNN paradigm to train a noise-robust deep network without using extra supervision information. The proposed method enjoys the following merits: i) A rectified meta-learning is designed to pay more attention to unbiased samples, leading to accelerated convergence and improved classification accuracy. ii) Our method is free on assumption of label noise distribution, which works well on various kinds of noise. iii) Our method serves as a plug-and-play module, which can be embedded into any deep models optimized by gradient descent based method. Extensive experiments are conducted to demonstrate the superior performance of our algorithm over the state-of-the-arts.

Despite the numerous benefits brought by Device-to-Device (D2D) communications, the introduction of D2D into cellular networks poses many new challenges in the resource allocation design due to the co-channel interference caused by spectrum reuse and limited battery life of User Equipments (UEs). Most of the previous studies mainly focus on how to maximize the Spectral Efficiency (SE) and ignore the energy consumption of UEs. In this paper, we study how to maximize each UE's Energy Efficiency (EE) in an interference-limited environment subject to its specific Quality of Service (QoS) and maximum transmission power constraints. We model the resource allocation problem as a noncooperative game, in which each player is self-interested and wants to maximize its own EE. A distributed interference-aware energy-efficient resource allocation algorithm is proposed by exploiting the properties of the nonlinear fractional programming. We prove that the optimum solution obtained by the proposed algorithm is the Nash equilibrium of the noncooperative game. We also analyze the tradeoff between EE and SE and derive closed-form expressions for EE and SE gaps., Comment: submitted to IET Communications. arXiv admin note: substantial text overlap with arXiv:1405.1963, arXiv:1407.1556