Temporal knowledge graph(TKG) reasoning, has seen widespread use for modeling real-world events, particularly in extrapolation settings. Nevertheless, most previous studies are embedded models, which require both enti...
详细信息
Temporal knowledge graph(TKG) reasoning, has seen widespread use for modeling real-world events, particularly in extrapolation settings. Nevertheless, most previous studies are embedded models, which require both entity and relation embedding to make predictions, ignoring the semantic correlations among different entities and relations within the same timestamp. This can lead to random and nonsensical predictions when unseen entities or relations occur. Furthermore, many existing models exhibit limitations in handling highly correlated historical facts with extensive temporal depth. They often either overlook such facts or overly accentuate the relationships between recurring past occurrences and their current counterparts. Due to the dynamic nature of TKG, effectively capturing the evolving semantics between different timestamps can be *** address these shortcomings, we propose the recurrent semantic evidenceaware graph neural network(RE-SEGNN), a novel graph neural network that can learn the semantics of entities and relations simultaneously. For the former challenge, our model can predict a possible answer to missing quadruples based on semantics when facing unseen entities or relations. For the latter problem, based on an obvious established force, both the recency and frequency of semantic history tend to confer a higher reference value for the current. We use the Hawkes process to compute the semantic trend, which allows the semantics of recent facts to gain more attention than those of distant facts. Experimental results show that RE-SEGNN outperforms all SOTA models in entity prediction on 6 widely used datasets, and 5 datasets in relation prediction. Furthermore, the case study shows how our model can deal with unseen entities and relations.
Depth estimation is an important task in computer *** data at scale for monocular depth estimation is challenging,as this task requires simultaneously capturing RGB images and depth ***,data augmentation is crucial fo...
详细信息
Depth estimation is an important task in computer *** data at scale for monocular depth estimation is challenging,as this task requires simultaneously capturing RGB images and depth ***,data augmentation is crucial for this *** data augmentationmethods often employ pixel-wise transformations,whichmay inadvertently disrupt edge *** this paper,we propose a data augmentationmethod formonocular depth estimation,which we refer to as the Perpendicular-Cutdepth *** method involves cutting realworld depth maps along perpendicular directions and pasting them onto input images,thereby diversifying the data without compromising edge *** validate the effectiveness of the algorithm,we compared it with existing convolutional neural network(CNN)against the current mainstream data augmentation ***,to verify the algorithm’s applicability to Transformer networks,we designed an encoder-decoder network structure based on Transformer to assess the generalization of our proposed *** results demonstrate that,in the field of monocular depth estimation,our proposed method,Perpendicular-Cutdepth,outperforms traditional data *** the indoor dataset NYU,our method increases accuracy from0.900 to 0.907 and reduces the error rate from0.357 to *** the outdoor dataset KITTI,our method improves accuracy from 0.9638 to 0.9642 and decreases the error rate from 0.060 to 0.0598.
Feature Selection(FS)is an important data management technique that aims to minimize redundant information in a *** work proposes DENGO,an improved version of the Northern Goshawk Optimization(NGO),to address the FS *...
详细信息
Feature Selection(FS)is an important data management technique that aims to minimize redundant information in a *** work proposes DENGO,an improved version of the Northern Goshawk Optimization(NGO),to address the FS *** NGO is an efficient swarm-based algorithm that takes its inspiration from the predatory actions of the northern *** order to overcome the disadvantages that NGO is prone to local optimum trap,slow convergence speed and low convergence accuracy,two strategies are introduced in the original NGO to boost the effectiveness of ***,a learning strategy is proposed where search members learn by learning from the information gaps of other members of the population to enhance the algorithm's global search ability while improving the population ***,a hybrid differential strategy is proposed to improve the capability of the algorithm to escape from the trap of the local optimum by perturbing the individuals to improve convergence accuracy and *** prove the effectiveness of the suggested DENGO,it is measured against eleven advanced algorithms on the CEC2015 and CEC2017 benchmark functions,and the obtained results demonstrate that the DENGO has a stronger global exploration capability with higher convergence performance and ***,the proposed DENGO is used for FS,and the 29 benchmark datasets from the UCL database prove that the DENGO-based FS method equipped with higher classification accuracy and stability compared with eight other popular FS methods,and therefore,DENGO is considered to be one of the most prospective FS ***'s code can be obtained at https://***/matlabcentral/fileexchange/158811-project1.
The parafoil system is nonlinear and complex with a large time delay. This makes it challenging for traditional control methods to control the parafoil system effectively. However, the Markov property of reinforcement...
详细信息
In this paper,the authors study a class of weighted version of probability density *** is shown that the weighted estimator contains some existing estimators of probability density,no matter they are recursive or *** ...
详细信息
In this paper,the authors study a class of weighted version of probability density *** is shown that the weighted estimator contains some existing estimators of probability density,no matter they are recursive or *** statistical results including weak consistency,strong consistency,rate of strong consistency,and asymptotic normality are established under some mild ***,the random weighted estimator is also *** numerical simulations and a real data analysis are presented to study the numerical performances of the estimators.
This paper considers the distributed online optimization(DOO) problem over time-varying unbalanced networks, where gradient information is explicitly unknown. To address this issue, a privacy-preserving distributed on...
详细信息
This paper considers the distributed online optimization(DOO) problem over time-varying unbalanced networks, where gradient information is explicitly unknown. To address this issue, a privacy-preserving distributed online one-point residual feedback(OPRF) optimization algorithm is proposed. This algorithm updates decision variables by leveraging one-point residual feedback to estimate the true gradient information. It can achieve the same performance as the two-point feedback scheme while only requiring a single function value query per iteration. Additionally, it effectively eliminates the effect of time-varying unbalanced graphs by dynamically constructing row stochastic matrices. Furthermore, compared to other distributed optimization algorithms that only consider explicitly unknown cost functions, this paper also addresses the issue of privacy information leakage of nodes. Theoretical analysis demonstrate that the method attains sublinear regret while protecting the privacy information of agents. Finally, numerical experiments on distributed collaborative localization problem and federated learning confirm the effectiveness of the algorithm.
Traditional blockchain key management schemes store private keys in the same location,which can easily lead to security issues such as a single point of ***,decentralized threshold key management schemes have become a...
详细信息
Traditional blockchain key management schemes store private keys in the same location,which can easily lead to security issues such as a single point of ***,decentralized threshold key management schemes have become a research focus for blockchain private key *** security of private keys for blockchain user wallet is highly related to user identity authentication and digital asset *** threshold blockchain private key management schemes based on verifiable secret sharing have made some progress,but these schemes do not consider participants’self-interested behavior,and require trusted nodes to keep private key fragments,resulting in a narrow application scope and low deployment efficiency,which cannot meet the needs of personal wallet private key escrow and recovery in public *** design a private key management scheme based on rational secret sharing that considers the self-interest of participants in secret sharing protocols,and constrains the behavior of rational participants through reasonable mechanism design,making it more suitable in distributed scenarios such as the public *** proposed scheme achieves the escrow and recovery of personal wallet private keys without the participation of trusted nodes,and simulate its implementation on smart *** to other existing threshold wallet solutions and keymanagement schemes based on password-protected secret sharing(PPSS),the proposed scheme has a wide range of applications,verifiable private key recovery,low communication overhead,higher computational efficiency when users perform one-time multi-key escrow,no need for trusted nodes,and personal rational constraints and anti-collusion attack capabilities.
The traditional kidney stone detection model has low accuracy and slow processing speed. In order to solve the above problems, we designed a new kidney stone detection model based on the original Yolov8, which we call...
详细信息
In this paper,{z_(n)}_(n=1)^(∞)acts as an interpolating sequence for Q_(p)∩H^(∞).An analytic function f is constructed,and f(z_(n))=∑_(j)λ_(j)f_(z_(j))(z_(n))=λ_(n),n=1,2,…for any{λ_(n)}∈l~∞,wheref and{λn}...
详细信息
In this paper,{z_(n)}_(n=1)^(∞)acts as an interpolating sequence for Q_(p)∩H^(∞).An analytic function f is constructed,and f(z_(n))=∑_(j)λ_(j)f_(z_(j))(z_(n))=λ_(n),n=1,2,…for any{λ_(n)}∈l~∞,wheref and{λn}∈l^(∞),where f and f_(zj)belong to Q_(p)∩H^(∞).As a result,the study achieves a comparable outcome for F(p,p-2,s)∩H^(∞).
Motivated by some well-known conjugate gradient methods, in this paper, we propose a new hybrid conjugate gradient method for unconstrained optimization. Without any dependence on line search, the new method generates...
详细信息
暂无评论