Monogamy and polygamy relations characterize the distributions of entanglement in multipartite *** provide a characterization of multiqubit entanglement constraints in terms of unified-(q,s)entropy.A class of tighter ...
详细信息
Monogamy and polygamy relations characterize the distributions of entanglement in multipartite *** provide a characterization of multiqubit entanglement constraints in terms of unified-(q,s)entropy.A class of tighter monogamy inequalities of multiqubit entanglement based on theα-th power of unified-(q,s)entanglement forα≥1 and a class of polygamy inequalities in terms of theβ-th power of unified-(q,s)entanglement of assistance are established in this *** results present a general class of the monogamy and polygamy relations for bipartite entanglement measures based on unified-(q,s)entropy,which are tighter than the existing *** is more,some usual monogamy and polygamy relations,such as monogamy and polygamy relations based on entanglement of formation,Renyi-q entanglement of assistance and Tsallis-q entanglement of assistance,can be obtained from these results by choosing appropriate parameters(q,s)in unified-(q,s)entropy *** examples are also presented for illustration.
In this paper,we propose a parameterization transfer algorithm for planar domains bounded by B-spline curves,where the shapes of the planar domains are *** domain geometries are considered to be similar if their simpl...
详细信息
In this paper,we propose a parameterization transfer algorithm for planar domains bounded by B-spline curves,where the shapes of the planar domains are *** domain geometries are considered to be similar if their simplified skeletons have the same *** domain we call source domain,and it is parameterized using multi-patch B-spline *** resulting parameterization is C1 continuous in the regular region and G1 continuous around singular points regardless of whether the parameterization of the source domain is C1/G1 continuous or *** this algorithm,boundary control points of the source domain are extracted from its parameterization as sequential points,and we establish a correspondence between sequential boundary control points of the source domain and the target boundary through discrete sampling and *** of the parametrization satisfies C1/G1 continuity under discrete harmonic mapping with continuous *** new algorithm has a lower calculation cost than a decomposition-based parameterization with a high-quality parameterization *** demonstrate that the result of the parameterization transfer in this paper can be applied in isogeometric ***,because of the consistency of the parameterization for the two models,this method can be applied in many other geometry processing algorithms,such as morphing and deformation.
The existing radio access network(RAN)is facing many challenges to meet the very strict speed and latency requirements by different mobile applications in addition to the increasing pressure to reduce operating *** an...
详细信息
The existing radio access network(RAN)is facing many challenges to meet the very strict speed and latency requirements by different mobile applications in addition to the increasing pressure to reduce operating *** and development in RAN have been accelerated to tackle these challenges and to define how next generation mobile networks should look *** role of machine learning(ML)and artificial intelligence(AI)driven innovations within the RAN domain is strengthening and attracting lots of attention to tackle many of the challenging *** this paper we surveyed RAN network base stations(BSs)clustering and its applications in the *** paper also demonstrates how to leverage community detection algorithms to understand underlying community structures within *** areas(TAs)novel framework was developed by adapting existing community detection algorithm to solve the problem of statically partitioning a set of BSs into TA according to mobility ***,live network dataset in dense urban part of Cairo is used to assess how the developed framework is used to partition this part of the network more efficiently compared to other clustering *** obtained showed that the new methodology saved up to 34.6%of inter TA signaling overhead and surpassing other conventional clustering algorithms.
Nuclearmagnetic resonance imaging of breasts often presents complex *** tumors exhibit varying sizes,uneven intensity,and indistinct *** characteristics can lead to challenges such as low accuracy and incorrect segmen...
详细信息
Nuclearmagnetic resonance imaging of breasts often presents complex *** tumors exhibit varying sizes,uneven intensity,and indistinct *** characteristics can lead to challenges such as low accuracy and incorrect segmentation during tumor ***,we propose a two-stage breast tumor segmentation method leveraging multi-scale features and boundary attention ***,the breast region of interest is extracted to isolate the breast area from surrounding tissues and ***,we devise a fusion network incorporatingmulti-scale features and boundary attentionmechanisms for breast tumor *** incorporate multi-scale parallel dilated convolution modules into the network,enhancing its capability to segment tumors of various sizes through multi-scale convolution and novel fusion ***,attention and boundary detection modules are included to augment the network’s capacity to locate tumors by capturing nonlocal dependencies in both spatial and channel ***,a hybrid loss function with boundary weight is employed to address sample class imbalance issues and enhance the network’s boundary maintenance capability through additional *** was evaluated using breast data from 207 patients at RuijinHospital,resulting in a 6.64%increase in Dice similarity coefficient compared to the *** results demonstrate the superiority of the method over other segmentation techniques,with fewer model parameters.
With the rapid growth of manuscript submissions,finding eligible reviewers for every submission has become a heavy *** systems are powerful tools developed in computerscience and information science to deal with this...
详细信息
With the rapid growth of manuscript submissions,finding eligible reviewers for every submission has become a heavy *** systems are powerful tools developed in computerscience and information science to deal with this ***,most existing approaches resort to text mining techniques to match manuscripts with potential reviewers,which require high-quality textual information to perform *** this paper,we propose a reviewer recommendation algorithm based on a network diffusion process on a scholar-paper multilayer network,with no requirement for textual *** network incorporates the relationship of scholar-paper pairs,the collaboration among scholars,and the bibliographic coupling among *** results show that our proposed algorithm outperforms other state-of-the-art recommendation methods that use graph random walk and matrix factorization and methods that use machine learning and natural language processing,with improvements of over 7.62%in recall,5.66%in hit rate,and 47.53%in ranking *** work sheds light on the effectiveness of multilayer network diffusion-based methods in the reviewer recommendation problem,which will help to facilitate the peer-review process and promote information retrieval research in other practical scenes.
In the domain of point cloud registration,the coarse-to-fine feature matching paradigm has received significant attention due to its impressive *** paradigm involves a two-step process:first,the extraction of multilev...
详细信息
In the domain of point cloud registration,the coarse-to-fine feature matching paradigm has received significant attention due to its impressive *** paradigm involves a two-step process:first,the extraction of multilevel features,and subsequently,the propagation of correspondences from coarse to fine ***,this approach faces two notable ***,the use of the Dual Softmax operation may promote one-to-one correspondences between superpoints,inadvertently excluding valuable ***,it is crucial to closely examine the overlapping areas between point clouds,as only correspondences within these regions decisively determine the actual *** these issues,we propose OAAFormer to enhance correspondence *** the one hand,we introduce a soft matching mechanism to facilitate the propagation of potentially valuable correspondences from coarse to fine *** the other hand,we integrate an overlapping region detection module to minimize mismatches to the greatest extent ***,we introduce a region-wise attention module with linear complexity during the fine-level matching phase,designed to enhance the discriminative capabilities of the extracted *** on the challenging 3DLoMatch benchmark demonstrate that our approach leads to a substantial increase of about 7%in the inlier ratio,as well as an enhancement of 2%-4%in registration ***,to accelerate the prediction process,we replace the Conventional Random Sample Consensus(RANSAC)algorithm with the selection of a limited yet representative set of high-confidence correspondences,resulting in a 100 times speedup while still maintaining comparable registration performance.
1 Introduction The minimum dominating tree(MDT)problem was first proposed by Zhang et al.[1]to produce a routing backbone of a *** et al.[2]proved that the MDT problem is NP-hard and introduced an approximation framew...
详细信息
1 Introduction The minimum dominating tree(MDT)problem was first proposed by Zhang et al.[1]to produce a routing backbone of a *** et al.[2]proved that the MDT problem is NP-hard and introduced an approximation framework for solving *** important MDT problem algorithms are the artificial bee colony(ABC_DT)algorithm and ant colony optimization(ACO_DT)algorithm proposed by Sundar and Singh[3],the evolutionary algorithm with guided mutation(EA/G-MP)proposed by Chaurasia and Singh[4],the variable neighborhood search algorithm proposed by Dražićet al.[5],one improved artificial bee colony(ABC_DTP)algorithm proposed by Singh and Sundar[6],and a hybrid algorithm combining genetic algorithm proposed by Hu et al.[7].In this paper,we develop a two-level meta-heuristic(TLMH)for solving the MDT problem,aiming to find a dominating tree with the minimum weight for a given graph.
The behavior of users on online life service platforms like Meituan and Yelp often occurs within specific finegrained spatiotemporal contexts(i.e., when and where). Recommender systems, designed to serve millions of u...
详细信息
The behavior of users on online life service platforms like Meituan and Yelp often occurs within specific finegrained spatiotemporal contexts(i.e., when and where). Recommender systems, designed to serve millions of users, typically operate in a fully server-based manner, requiring on-device users to upload their behavioral data, including fine-grained spatiotemporal contexts, to the server, which has sparked public concern regarding privacy. Consequently, user devices only upload coarse-grained spatiotemporal contexts for user privacy protection. However, previous research mostly focuses on modeling fine-grained spatiotemporal contexts using knowledge graph convolutional models, which are not applicable to coarse-grained spatiotemporal contexts in privacy-constrained recommender systems. In this paper, we investigate privacy-preserving recommendation by leveraging coarse-grained spatiotemporal contexts. We propose the coarse-grained spatiotemporal knowledge graph for privacy-preserving recommendation(CSKG), which explicitly models spatiotemporal co-occurrences using common-sense knowledge from coarse-grained contexts. Specifically, we begin by constructing a spatiotemporal knowledge graph tailored to coarse-grained spatiotemporal contexts. Then we employ a learnable metagraph network that integrates common-sense information to filter and extract co-occurrences. CSKG evaluates the impact of coarsegrained spatiotemporal contexts on user behavior through the use of a knowledge graph convolutional network. Finally, we introduce joint learning to effectively learn representations. By conducting experiments on two real large-scale datasets,we achieve an average improvement of about 11.0% on two ranking metrics. The results clearly demonstrate that CSKG outperforms state-of-the-art baselines.
By solving the existing expectation-signal-to-noise ratio(expectation-SNR) based inequality model of the closed-form instantaneous cross-correlation function type of Choi-Williams distribution(CICFCWD),the linear cano...
详细信息
By solving the existing expectation-signal-to-noise ratio(expectation-SNR) based inequality model of the closed-form instantaneous cross-correlation function type of Choi-Williams distribution(CICFCWD),the linear canonical transform(LCT) free parameters selection strategies obtained are usually *** the second-order moment variance outperforms the first-order moment expectation in accurately characterizing output SNRs, this paper uses the variance analysis technique to improve parameters selection strategies. The CICFCWD's average variance of deterministic signals embedded in additive zero-mean stationary circular Gaussian noise processes is first obtained. Then the so-called variance-SNRs are defined and applied to model a variance-SNR based inequality. A stronger inequalities system is also formulated by integrating expectation-SNR and variance-SNR based inequality models. Finally, a direct application of the system in noisy one-component and bi-component linear frequency-modulated(LFM) signals detection is studied. Analytical algebraic constraints on LCT free parameters newly derived seem more accurate than the existing ones, achieving better noise suppression effects. Our methods have potential applications in optical, radar, communication and medical signal processing.
Video deblurring is a fundamental problem in low-level vision, and many methods have employed designs based on CNNs and transformers. Traditional CNNs often require deeper architectures to achieve a larger receptive f...
详细信息
暂无评论