检索结果-内蒙古大学图书馆

IEEE Annual International Symposium Virtual Reality

作者： Junhua Liu Boxiang Zhu Fangxin Wang Yili Jin Wenyi Zhang Zihan Xu Shuguang Cui The Future Network of Intelligence Institute The Chinese University of Hong Kong Shenzhen School of Science and Engineering The Chinese University of Hong Kong Shenzhen The Guangdong Provincial Key Laboratory of Future Networks of Intelligence Peng Cheng Laboratory Shenzhen Research Institute of Big Data

Volumetric video (VV) recently emerges as a new form of video application providing a photorealistic immersive 3D viewing experience with 6 degree-of-freedom (DoF), which empowers many applications such as VR, AR, and Metaverse. A key problem therein is how to stream the enormous size VV through the network with limited bandwidth. Existing works mostly focused on predicting the viewport for a tiling-based adaptive VV streaming, which however only has quite a limited effect on resource saving. We argue that the content repeatability in the viewport can be further leveraged, and for the first time, propose a client-side cache-assisted strategy that aims to buffer the repeatedly appearing VV tiles in the near future so as to reduce the redundant VV content transmission. The key challenges exist in three aspects, including (1) feature extraction and mining in 6 DoF VV context, (2) accurate long-term viewing pattern estimation and (3) optimal caching scheduling with limited capacity. In this paper, we propose CaV3, an integrated cache-assisted viewport adaptive VV streaming framework to address the challenges. CaV3 employs a Long-short term Sequential prediction model (LSTSP) that achieves accurate short-term, mid-term and long-term viewing pattern prediction with a multi-modal fusion model by capturing the viewer's behavior inertia, current attention, and subjective intention. Besides, CaV3 also contains a contextual MAB-based caching adaptation algorithm (CCA) to fully utilize the viewing pattern and solve the optimal caching problem with a proved upper bound regret. Compared to existing VV datasets only containing single or co-located objects, we for the first time collect a comprehensive dataset with sufficient practical unbounded 360° scenes. The extensive evaluation of the dataset confirms the superiority of CaV3, which outperforms the SOTA algorithm by 15.6%-43% in viewport prediction and 13%-40% in system utility.

关键词： Adaptation models Solid modeling Three-dimensional displays Upper bound Virtual reality Streaming media Predictive models

来源：评论

学校读者我要写书评

暂无评论

Structure- and Logic-Aware Heterogeneous Graph Learning for Recommendation

Structure- and Logic-Aware Heterogeneous Graph Learning for ...

引用

International Conference on data engineering

作者： Anchen Li Bo Yang Huan Huo Farookh Khadeer Hussain Guandong Xu College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education China Aalto University Espoo Finland School of Computer Science University of Technology Sydney Sydney Australia Education University of Hong Kong Hong Kong China

ISBN: (数字)9798350317152

ISBN: (纸本)9798350317169

Recently, there has been a surge in recommendations based on heterogeneous information networks (HINs), attributed to their ability to integrate complex and rich semantics. Despite this advancement, most HIN-based recommenders overlook two critical aspects. First, they often fail to consider HIN's heterophily nature, hindering the capture of non-local structures in HINs. Second, most methods lack the capability for logical reasoning. In this paper, we propose a novel structure- and logic-aware heterogeneous graph learning framework for recommender systems (SLHRec). Our SLHRec contains a structure-aware module and a logic-aware module. The former uses network geometry to construct non-local neighborhoods for nodes in HINs, and then introduces a graph neural network to integrate constructed neighbors for modeling the heterophily of HINs. The logic-aware module uses the Markov logic network (MLN) to infuse logic rules into heterogeneous graph learning, thereby boosting logic reasoning in recommendations. Furthermore, we utilize contrastive learning to model cooperative signals between modules, enabling them to complement each other. In the prediction stage, both modules contribute to generating recommendations. Compared with several strong recommender baselines, our SLHRec achieves superior performance on four real-world datasets.

关键词： Geometry Semantics Contrastive learning data engineering Boosting Cognition Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Adaptive Spectral Broadening Filter-Based Phased Array Focused Ultrasound Imaging for High-Echo Target Detection

SSRN

引用

SSRN 2024年

作者： Lou, Cuijuan Zhou, Quan Li, Ranyang Liu, Wufeng Li, Yan Yuchi, Ming Ding, Mingyue Key Laboratory of Grain Information Processing and Control Henan University of Technology Henan Key Laboratory of Grain Photoelectric Detection and Control China School of Artificial Intelligence and Big Data Henan University of Technology Zhengzhou450001 China Department of Automation School of Automation Wuhan University of Technology Wuhan430070 China Department of Biomedical Engineering School of Life Science and Technology Key Laboratory of Molecular Biophysics of the Ministry of Education Medical Ultrasound Laboratory Huazhong University of Science and Technology Wuhan430074 China

Noise suppression and resolution improvement are important issues in high-echo target ultrasound imaging detection. To address this problem, this paper proposes a phased array focused ultrasound imaging method based on an adaptive spectral broadening filter. The proposed method first standardizes the received signals after fixed-point transmission by subtracting the mean of the received aperture signals and dividing by the standard deviation of the received aperture signals. Then, spectralbroadening was achieved through covariance and temporal autocorrelation coefficient calculations. Finally, the variance factor proposed for the first time is calculated as a weight from standardized received data after fixed-point transmission focusing to obtain the final scanline data. To evaluate the performance of the proposed method in high-echo target ultrasound imaging detection, experimental phantom images and two views of the interventricular septum including the parasternal long-axisviews and the apical four-chamber views, are reconstructed. In three scenarios, some finer structures of the targets in the images by the proposed method can be more easily identified compared to delay and sum (DAS), square-neighborhood robust signal mean-to-standard-deviation factor (SN-RSMSF), and coherence factor beamforming (CF). For the experimental phantom data, the image resolution measured by -20dB mainlobe width of the proposed method can reach 14.2 percents of DAS, 18.3 percents of SN-RSMSF and 18.3 percents of CF. The proposed method also outperforms the other three methods in terms of noise suppression. The proposed method can be used to detect diseases that involve high-echo targets such as stones, heart valves, and calcifications. © 2024, The Authors. All rights reserved.

关键词： Ultrasonic imaging

来源：评论

学校读者我要写书评

暂无评论

Clustering by orthogonal NMF model and non-convex penalty optimization

Clustering by orthogonal NMF model and non-convex penalty op...

引用

作者： Wang, Shuai Chang, Tsung-Hui Cui, Ying Pang, Jong-Shi Shenzhen Research Institute of Big Data and School of Science and Engineering The Chinese University of Hong Kong Shenzhen518172 China Guangdong Provincial Key Laboratory of Big Data Computing and School of Science and Engineering The Chinese University of Hong Kong Shenzhen518172 China Department of Industrial and Systems Engineering University of Minnesota MinneapolisMN55455 United States Department of Industrial and Systems Engineering University of Southern California Los AngelesCA90089 United States

The non-negative matrix factorization (NMF) model with an additional orthogonality constraint on one of the factor matrices, called the orthogonal NMF (ONMF), has been found a promising clustering model and can outperform the classical K-means. However, solving the ONMF model is a challenging optimization problem because the coupling of the orthogonality and non-negativity constraints introduces a mixed combinatorial aspect into the problem due to the determination of the correct status of the variables (positive or zero). Most of the existing methods directly deal with the orthogonality constraint in its original form via various optimization techniques, but are not scalable for large-scale problems. In this paper, we propose a new ONMF based clustering formulation that equivalently transforms the orthogonality constraint into a set of norm-based non-convex equality constraints. We then apply a non-convex penalty (NCP) approach to add them to the objective as penalty terms, leading to a problem that is efficiently solvable. One smooth penalty formulation and one non-smooth penalty formulation are respectively studied. We build theoretical conditions for the penalized problems to provide feasible stationary solutions to the ONMF based clustering problem, as well as proposing efficient algorithms for solving the penalized problems of the two NCP methods. Experimental results based on both synthetic and real datasets are presented to show that the proposed NCP methods are computationally time efficient, and either match or outperform the existing K-means and ONMF based methods in terms of the clustering performance. © 1991-2012 IEEE.

关键词： Non-negative matrix factorization

来源：评论

学校读者我要写书评

暂无评论

A Framework based on Deep Neural Network for Ranking-oriented Software Defect Prediction

A Framework based on Deep Neural Network for Ranking-oriente...

引用

IEEE International Conference on Software Quality, Reliability and Security (QRS)

作者： Jiapeng Dai Xiaoxing Yang Bingding Huang Xiaofen Lu College of Big Data and Internet Shenzhen Technology University Shenzhen China Department of Computer Science and Engineering Guangdong Provincial Key Laboratory of Brain-Inspired Intelligent Computation Southern University of Science and Technology Shenzhen China

Software systems are getting larger and more complex than ever before. In order to improve software reliability, software defect prediction is applied to assist developers in bug discovery. The ranking-oriented software defect prediction aims to rank software modules according to the predicted defect counts. However, existing ranking-oriented defect prediction models are constructed based on traditional hand-crafted features, which might overlook the rich syntactic information buried inside the source codes. In this paper, we propose a universal deep learning-based framework called United Deep Network for ranking-oriented software defect prediction. This framework utilizes deep neural networks to automatically generate features from source code with the syntactic and structural information preserved, and it can combine extracted features with traditional hand-crafted features in order to take advantage of both kinds of features to construct prediction models. Experimental results over 29 sets of data show the good performance of the proposed framework for building ranking-oriented defect prediction models.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Continual Learning for Smart City: A Survey

arXiv

引用

arXiv 2024年

作者： Yang, Li Luo, Zhipeng Zhang, Shiming Teng, Fei Li, Tianrui School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu611756 China Engineering Research Center of Sustainable Urban Intelligent Transportation Ministry of Education National Engineering Laboratory of Integrated Transportation Big Data Application Technology Southwest Jiaotong University China Manufacturing Industry Chains Collaboration and Information Support Technology Key Laboratory of Sichuan Province Southwest Jiaotong University Sichuan Chengdu611756 China

With the digitization of modern cities, large data volumes and powerful computational resources facilitate the rapid update of intelligent models deployed in smart cities. Continual learning (CL) is a novel machine learning paradigm that constantly updates models to adapt to changing environments, where the learning tasks, data, and distributions can vary over time. Our survey provides a comprehensive review of continual learning methods that are widely used in smart city development. The content consists of three parts: 1) Methodology-wise. We categorize a large number of basic CL methods and advanced CL frameworks in combination with other learning paradigms including graph learning, spatial-temporal learning, multi-modal learning, and federated learning. 2) Application-wise. We present numerous CL applications covering transportation, environment, public health, safety, networks, and associated datasets related to urban computing. 3) Challenges. We discuss current problems and challenges and envision several promising research directions. We believe this survey can help relevant researchers quickly familiarize themselves with the current state of continual learning research used in smart city development and direct them to future research trends. Copyright © 2024, The Authors. All rights reserved.

关键词： Smart city

来源：评论

学校读者我要写书评

暂无评论

Incomplete Multi-View Clustering via Multi-Level Contrastive Learning

引用

IEEE Transactions on knowledge and data engineering 2025年

作者： Yin, Jun Wang, Pei Sun, Shiliang Zheng, Zhonglong Shanghai Maritime University College of Information Engineering Shanghai201306 China Shanghai Jiao Tong University Department of Automation Shanghai200240 China Ministry of Education Key Laboratory of Advanced Theory and Application in Statistics and Data Science Shanghai200062 China Zhejiang Normal University School of Computer Science Zhejiang Jinhua321004 China

Although significant progress has been made in multi-view learning over the past few decades, it remains challenging, especially in the context of incomplete multi-view clustering, where modeling complex correlations among different views and handling missing data are key difficulties. In this paper, we propose a novel incomplete multi-view clustering network to address the aforementioned issue, named Incomplete Multi-view Clustering via Multi-level Contrastive Learning (IMC-MCL). Specifically, the proposed model aims to minimize the conditional entropy between views to recover missing data by dual prediction strategy. Moreover, the approach learns multi-level features, including latent, high-level and semantic features, with the goal of satisfying both reconstruction and consistency objectives in distinct feature spaces. Specifically, latent features are utilized to accomplish the reconstruction objective, while high-level features and semantic labels are employed to achieve the two consistency goals through contrastive learning. This framework enables the exploration of shared semantics within high-level features and achieves clustering assignment using semantic features. Extensive experiments have shown that the proposed approach outperforms other state-of-the-art incomplete multi-view clustering methods on seven challenging datasets. © 1989-2012 IEEE.

关键词： Sorting

来源：评论

学校读者我要写书评

暂无评论

A modified active disturbance rejection control for a wastewater treatment process

引用

Chinese Journal of Chemical engineering 2020年第10期28卷 2607-2619页

作者： Wei Wei Pengfei Xia Zaiwen Liu Min Zuo Beijing Technology and Business University Beijing 100048China National Engineering Laboratory for Agri-product Quality TraceabilityBeijing Technology and Business UniversityBeijing 100048China Beijing Key Laboratory of Big Data Technology for Food SafetyBeijing 100048China

Waste water treatment process(WWTP)control has been attracting more and more ***,various undesired factors,such as disturbance,uncertainties,and strong nonlinear couplings,propose big challenges to the control of a *** order to improve the control performance of the closed-loop system and guarantee the discharge requirements of the effluent quality,rather than take the model dependent control approaches,an active disturbance rejection control(ADRC)is *** on the control signal and system output,a phase optimized ADRC(POADRC)is designed to control the dissolved oxygen and nitrate concentration in a *** phase advantage of the phase optimized extended state observer(POESO),convergence of the POESO,and stability of the closed-loop system are analyzed from the theoretical point of ***,a commonly accepted benchmark simulation model no.1.(BSM1)is utilized to test the POESO and *** active disturbance rejection control(LADRC)and the suggested proportion-integration(PI)control are taken to make a comparative *** system responses and performance index values confirm the advantage of the POADRC over the LADRC and the suggested PI *** results show that,as a result of the leading phase of the total disturbance estimation,the POESO based POADRC is an effective and promising way to control the dissolved oxygen and nitrate concentration so as to ensure the effluent quality of a WWTP.

关键词： Wastewater treatment process BSM1 Dissolved oxygen Nitrate concentration Active disturbance rejection control Phase optimization extended state observer

来源：评论

学校读者我要写书评

暂无评论

USL-Net: Uncertainty Self-Learning Network for Unsupervised Skin Lesion Segmentation

arXiv

引用

arXiv 2023年

作者： Li, Xiaofan Peng, Bo Hu, Jie Ma, Changyou Yang, Daipeng Xie, Zhuyang School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu611756 China Engineering Research Center of Sustainable Urban Intelligent Transportation Ministry of Education Chengdu611756 China National Engineering Laboratory of Integrated Transportation Big Data Application Technology Southwest Jiaotong University Chengdu611756 China Manufacturing Industry Chains Collaboration and Information Support Technology Key Laboratory of Sichuan Province Southwest Jiaotong University Chengdu611756 China Data Recovery Key Laboratory of Sichuan Province Neijiang Normal University Sichuan Neijiang641100 China

Unsupervised skin lesion segmentation offers several benefits, such as conserving expert human resources, reducing discrepancies caused by subjective human labeling, and adapting to novel environments. However, segmenting dermoscopic images without manual labeling guidance is a challenging task due to image artifacts such as hair noise, blister noise, and subtle edge differences. In this paper, we introduce an innovative Uncertainty Self-Learning Network (USL-Net) to eliminate the need for manual labeling guidance for the segmentation. Initially, features are extracted using contrastive learning, followed by the generation of Class Activation Maps (CAMs) as saliency maps. High-saliency regions in the map serve as pseudo-labels for lesion regions while low-saliency regions represent the background. Besides, intermediate regions can be hard to classify, often due to their proximity to lesion edges or interference from hair or blisters. Rather than risking potential pseudo-labeling errors or learning confusion by forcefully classifying these regions, they are taken as uncertainty regions by exempted from pseudo-labeling and allowing the network to self-learning. Further, we employ connectivity detection and centrality detection to refine foreground pseudo-labels and reduce noise-induced errors. The performance is further enhanced by the iterated refinement process. The experimental validation on ISIC-2017, ISIC-2018, and PH2 datasets demonstrates that its performance is comparable to supervised methods, and exceeds that of other existing unsupervised methods. On the typical ISIC-2017 dataset, our method outperforms state-of-the-art unsupervised methods by 1.7% in accuracy, 6.6% in Dice coefficient, 4.0% in Jaccard index, and 10.6% in sensitivity. Copyright © 2023, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Analysis of bitcoin backbone protocol in the non-flat model

引用

Science China(Information Sciences) 2020年第3期63卷 64-79页

作者： Peifang NI Hongda LI Dongxue PAN State Key Laboratory of Information Security Institute of Information EngineeringChinese Academy of Sciences School of Cyber Security University of Chinese Academy of Sciences Data Assurance and Communication Security Research Center Chinese Academy of Sciences

Owing to the novel proof-of-work based consensus algorithm, bitcoin has been the most successful decentralized cryptocurrency so far. In bitcoin system, parties(miners) compete to create blocks by doing publicly verifiable proofs of sequential work(proof-of-work) and the probability that a party wins the competition is proportional to the amount of computational power that he has invested. Note that its security holds under honest majority assumption in terms of the amount of computational power. In this paper, we provide the formal analysis of bitcoin backbone protocol in the non-flat model. Precisely, we rethink and redefine the model of computing puzzles to capture the real-world protocol execution, where each party owns different amount of computational power and does sequential computations towards a puzzle independently. Fortunately, our work obtains the better results in analyzing the security of bitcoin backbone protocol, which can reflect the real-world protocol execution better, without any additional assumptions but the honest majority assumption. Finally, we show that a robust public transaction ledger can be built on top of bitcoin backbone protocol in our model securely.

关键词： bitcoin system proof-of-work computational power non-flat model transaction ledger

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：