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

International Workshop on Quality of Service

作者： Weipeng Cao Xi Tao Yinghui Pan Ye Liu Zhong Ming Guangdong Laboratory of Artificial Intelligence and Digital Economy (Shenzhen) Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China College of Computer Science and Software Engineering Shenzhen University Shenzhen China

ISBN: (数字)9798350350128

ISBN: (纸本)9798350350135

The advantages of resource elasticity and proactive data backup in cloud databases have attracted a large number of users to consider deploying their IT systems in the cloud. Factors such as performance, reliability, security, and ease of use are the most important considerations for users when choosing to migrate to the cloud. This paper mainly discusses the necessity of Quality of Service (QoS) awareness for cloud applications in the current public cloud environment, as well as the technological trends and challenges associated with it.

关键词： Cloud computing databases Quality of service Elasticity Market research Real-time systems Security

来源：评论

学校读者我要写书评

暂无评论

DAMPER: A Dual-Stage Medical Report Generation Framework with Coarse-Grained MeSH Alignment and Fine-Grained Hypergraph Matching

arXiv

引用

arXiv 2024年

作者： Huang, Xiaofei Chen, Wenting Liu, Jie Lu, Qisheng Luo, Xiaoling Shen, Linlin Computer Vision Institute College of Computer Science and Software Engineering Shenzhen University Shenzhen China Department of Electrical Engineering City University of Hong Kong Kowloon Hong Kong National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China

Medical report generation is crucial for clinical diagnosis and patient management, summarizing diagnoses and recommendations based on medical imaging. However, existing work often overlook the clinical pipeline involved in report writing, where physicians typically conduct an initial quick review followed by a detailed examination. Moreover, current alignment methods may lead to misaligned relationships. To address these issues, we propose DAMPER, a dual-stage framework for medical report generation that mimics the clinical pipeline of report writing in two stages. In the first stage, a MeSH-Guided Coarse-Grained Alignment (MCG) stage that aligns chest X-ray (CXR) image features with medical subject headings (MeSH) features to generate a rough keyphrase representation of the overall impression. In the second stage, a Hypergraph-Enhanced Fine-Grained Alignment (HFG) stage that constructs hypergraphs for image patches and report annotations, modeling high-order relationships within each modality and performing hypergraph matching to capture semantic correlations between image regions and textual phrases. Finally,the coarse-grained visual features, generated MeSH representations, and visual hypergraph features are fed into a report decoder to produce the final medical report. Extensive experiments on public datasets demonstrate the effectiveness of DAMPER in generating comprehensive and accurate medical reports, outperforming state-of-the-art methods across various evaluation metrics. Copyright © 2024, The Authors. All rights reserved.

关键词： Coarse-grained modeling

来源：评论

学校读者我要写书评

暂无评论

Global Feature Enhancing and Fusion Framework for Strain Gauge Status Recognition 25

Global Feature Enhancing and Fusion Framework for Strain Gau...

引用

Companion Proceedings of the ACM on Web Conference 2025

作者： Xu Zhang Peng Wang Chen Wang Zhe Xu Xiaohua Nie Wei Wang Shanghai Key Laboratory of Data Science School of Computer Science and Technology Fudan University Shang Hai China Shanghai Key Laboratory of Data Science School of Computer Science and Technology Fudan University Shanghai China National Engineering Research Center for Big Data Software Tsinghua University Beijing China School of Software Tsinghua University Beijing China National Key Laboratory of Strength and Structural Integrity Aircraft Strength Research Institute of China Xi'an Shaanxi China

ISBN: (纸本)9798400713316

Strain Gauge Status (SGS) recognition is crucial in the field of intelligent manufacturing based on the Internet of Things, as accurate identification helps timely detection of failed mechanical components, avoiding accidents. The loading and unloading sequences generated by strain gauges can be identified through time series classification (TSC) algorithms. Recently, deep learning models, e.g., convolutional neural networks (CNNs) have shown remarkable success in the TSC task, as they can extract discriminative local features from the subsequences to identify the time series. However, we observe only the local features may not be sufficient for expressing the time series, especially when the local sub-sequences between different time series are very similar, e.g., SGS data of aircraft wings in static strength experiments. Nevertheless, CNNs suffer from the limitation in extracting global features due to the nature of convolution operations. For extracting global features to more comprehensively represent the SGS time series, we propose two insights: (i) Constructing global features through feature engineering. (ii) Learning high-order relationships between local features to capture global features. To realize and utilize them, we propose a hypergraph-based global feature learning and fusion framework, which learns and fuses global features for semantic consistency to enhance the representation of SGS time series, thereby improving recognition accuracy. Our method designs are validated on industrial SGS and public UCR datasets, showing better generalization for unseen data in SGS recognition.

关键词： deep learning models

来源：评论

学校读者我要写书评

暂无评论

Transient Session Key Derivation Protocol for Key Escrow Prevention in Public Key Infrastructure 1st

Transient Session Key Derivation Protocol for Key Escrow Pre...

引用

1st EAI International Conference on Internet of Everything, IoECon 2022

作者： Nyangaresi, Vincent Omollo Abduljabbar, Zaid Ameen Maolood, Ismail Yaqub Sibahee, Mustafa A. Al Ma, Junchao Aldarwish, Abdulla J. Y. Faculty of Biological and Physical Sciences Tom Mboya University Homabay40300 Kenya Department of Computer Science College of Education for Pure Sciences University of Basrah Basrah61004 Iraq Shenzhen Institute Huazhong University of Science and Technology Shenzhen518118 China – System Information Ministry of Higher Education and Scientific Research Erbil Iraq College of Big Data and Internet Shenzhen Technology University Shenzhen518118 China Computer Technology Engineering Department Iraq University College Basrah Iraq

ISBN: (纸本)9783031252211

The Internet of Things (IoT) devices have been deployed to realize smart environments such as smart cities, smart homes, smart health and smart grids. In these domains, the IoT devices collect and forward high volumes of sensitive and private data. It is therefore important that security schemes be developed to protect the exchanged data. In this regard, a myriad of authentication protocols have been developed over the recent past. However, these schemes deploy cryptographic primitives that result in extremely high communication, storage and computation complexities. In addition, some of these protocols still have numerous security and privacy issues that render them unsuitable for deployment in an IoT environment. For instance, untraceability, anonymity, key escrow problems and attack vectors such as de-synchronization and forgery attacks are frequently ignored. In this paper, a transient session key derivation protocol is developed to address some of these security and efficiency challenges. The security analysis executed shows that this protocol offers untraceability, device anonymity and perfect forward key secrecy. In addition, it is robust against de-synchronization, known secret key leakage, eavesdropping and forgery attacks. In terms of operational efficiency, this protocol incurs the lowest computation and communication complexities. © 2023, ICST institute for computer sciences, Social Informatics and Telecommunications engineering.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

RSP-gcForest: A Distributed Deep Forest via Random Sample Partition

RSP-gcForest: A Distributed Deep Forest via Random Sample Pa...

引用

IEEE International Conference on big data

作者： Mark Junjie Li Wenzhu Cai Yigang Lin Sunjie Huang Joshua Zhexue Huang Patrick Xiaogang Peng College of Computer Science and Software Engineering Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Shenzhen Academy of Inspection and Quarantine

Deep Forest, a powerful alternative to deep neural networks, has gained much attention due to its advantages, such as low complexity, minimal hyperparameter requirements, and strong application performance. In the current big data environment, where data volumes and model complexities are growing rapidly, distributed computing is needed to increase computational efficiency. Recently, a distributed deep forest approach, called BLB-gcForest (Bag of Little Bootstraps-gcForest), has been successful in reducing training instances within cascade forests, combining BLB and granularity segmentation, thus improving the computational efficiency and scalability of distributed deep forests. However, it still transmits the entire data set between layers and requires double sampling with BLB, limiting the amount of data and the scalability of resource utilization. This paper introduces a novel algorithm, RSP-gcForest, based on Random Sample Partition (RSP) to improve distributed deep forests computational efficiency and scalability. RSP-gcForest uses block-level samples that replace the full dataset, significantly reducing interlayer instance transmission and prediction within cascade forests. Additionally, RSP blocks are integrated with the segmentation granularity of cascade forests for ensemble learning, effectively addressing computational efficiency and resource constraints. We conducted experiments on four extensive datasets using Spark and evaluated performance across five key metrics. The results clearly show that RSP-gcForest, while maintaining high classification quality, surpasses state-of-the-art methods in terms of computational efficiency and resource utilization. Furthermore, it achieves superior load balancing, demonstrating its potential as a powerful tool in big data and distributed computing.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Parallel Harris Hawks Optimization Based WSN Node Localization Algorithm

Journal of Network Intelligence

引用

Journal of Network Intelligence 2021年第4期6卷 688-703页

作者： He, Xiankang Chu, Shu-Chuan Liu, Shi-Jian Pan, Jeng-Shyang Yan, Lijun College of Computer Science and Mathematics Fujian University of Technology Fuzhou350118 China Shenzhen Institute of Information Technology Shenzhen518000 China College of Computer Science and Engineering Shandong University of Science and Technology Qingdao266590 China College of Science and Engineering Flinders University Adelaide Australia Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology Fuzhou350118 China

The localization of wireless sensor network (WSN) is an increasingly promi-nent problem. The goal of this problem is to use the anchor nodes in WSN to esti-mate the geographical location of the unknown nodes. This paper proposes a novel al-gorithm, named dynamic parallel Harris Hawks optimization (DPHHO). It contains the dynamic control strategy of the escaping energy and the parallel communication mecha-nism. DPHHO algorithm significantly improves the global search ability of the original Harris Hawks optimization (HHO) algorithm. Also, a novel localization algorithm based on hop distance correction and DPHHO is proposed. The proposed DPHHO algorithm was tested on the 23 classical test functions and the DPHHO-DV-Hop algorithm is applied to the localization of WSN. The experimental results show that, compared with HHO and other optimization algorithms, the proposed DPHHO algorithm is more effective and efficient. Compared with DV-Hop and other localization algorithms, the proposed DPHHO-DV-Hop is an effective algorithm for the localization of WSN. © 2021, Taiwan Ubiquitous Information CO LTD. All rights reserved.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

A Time-Efficient Distributed Constant Conditional Functional Dependency Discovery Algorithm for data Consistency

A Time-Efficient Distributed Constant Conditional Functional...

引用

IEEE Annual International computer software and Applications Conference (COMPSAC)

作者： Junchao Chen Jian-tao Zhou Xinyu Hao Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing Inner Mongolia Engineering Laboratory for Big Data Analysis Technology College of Computer Science Inner Mongolia University Engineering Research Center of Ecological Big Data Ministry of Education National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Hohhot China

ISBN: (数字)9798350376968

ISBN: (纸本)9798350376975

The accuracy of data analysis depends on data quality, and addressing data consistency issues is a key challenge to improve it. Constant Conditional Functional Dependency (CCFD) is an effective approach that ensures data consistency by enforcing bindings of semantically related values, thus providing quality assurance for data analysis and decision-making processes. However, with the growth of data scale, especially the increasing number of data tuples and attributes, existing single-machine CCFD discovery algorithms face issues of low computational efficiency and lengthy computation time. This paper proposes a time-efficient distributed CCFD discovery algorithm (DCCFD). Through the optimization of data preprocessing and index mapping, the data organization structure is enhanced, laying the foundation for the discovery of CCFDs under distributed conditions. The Spark parallel computing framework is used to partition the dataset, which accelerates the parallel loading and processing of data. Additionally, this algorithm ensures accuracy and processing speed when discovering dependencies by efficiently generating frequent itemsets and verifying CCFDs in parallel. Experiments on multiple real datasets show that, especially with the complex Airline dataset, the DCCFD algorithm not only accurately discovers CCFDs, but also reduces the average running time by 75.64% compared with the preCFDMiner algorithm.

关键词： Accuracy data preprocessing software algorithms Distributed databases Parallel processing software Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

MetaCity: data-driven sustainable development of complex cities

引用

The Innovation 2025年第2期6卷 88-103,87页

作者： Yunke Zhang Yuming Lin Guanjie Zheng Yu Liu Nicholas Sukiennik Fengli Xu Yongjun Xu Feng Lu Qi Wang Yuan Lai Li Tian Nan Li Dongping Fang Fei Wang Tao Zhou Yong Li Yu Zheng Zhiqiang Wu Huadong Guo Department of Electronic Engineering Beijing National Research Center for Information Science and Technology(BNRist)Tsinghua UniversityBeijing 100084China John Hopcroft Center for Computer Science Shanghai Jiao Tong UniversityShanghai 200240China University of Chinese Academy of Sciences Beijing 100049China Institute of Computing Technology Chinese Academy of SciencesBeijing 100190China Institute of Geographic Sciences and Natural Resources Research Chinese Academy of SciencesBeijing 100101China Department of Civil and Environmental Engineering Northeastern UniversityBostonMA 02115USA School of Architecture Tsinghua UniversityBeijing 100084China School of Civil Engineering Tsinghua UniversityBeijing 100084China Big Data Research Center University of Electronic Science and Technology of ChinaChengdu 611731China JD iCity JD Technology&JD Intelligent Cities ResearchBeijing 100176China College of Architecture and Urban Planning Tongji UniversityShanghai 200292China International Research Center of Big Data for Sustainable Development Goals Beijing 100094China Aerospace Information Research Institute Chinese Academy of SciencesBeijing 100094China These authors contributed equally

Cities are complex systems that develop under complicated interactions among their human and environmental *** generates substantial outcomes and opportunities while raising challenges including congestion,air pollution,inequality,etc.,calling for efficient and reasonable solutions to sustainable ***,booming technologies generate large-scale data of complex cities,providing a chance to propose data-driven solutions for sustainable urban *** paper provides a comprehensive overview of data-driven urban sustainability *** this review article,we conceptualize MetaCity,a general framework for optimizing resource usage and allocation problems in complex cities with data-driven *** this framework,we decompose specific urban sustainable goals,e.g.,efficiency and resilience,review practical urban problems under these goals,and explore the probability of using data-driven technologies as potential solutions to the challenge of *** the basis of extensive urban data,we integrate urban problem discovery,operation of urban systems simulation,and complex decision-making problem solving into an entire cohesive framework to achieve sustainable development goals by optimizing resource allocation problems in complex cities.

关键词： resource usage sustainable development urbanization resilience data driven urban systems simulation complex cities complexity

来源：评论

学校读者我要写书评

暂无评论

Multi-scale Dynamic and Hierarchical Relationship Modeling for Facial Action Units Recognition

arXiv

引用

arXiv 2024年

作者： Wang, Zihan Song, Siyang Luo, Cheng Deng, Songhe Xie, Weicheng Shen, Linlin Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University China Shenzhen Institute of Artificial Intelligence and Robotics for Society China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China University of Leicester United Kingdom Monash University Australia

Human facial action units (AUs) are mutually related in a hierarchical manner, as not only they are associated with each other in both spatial and temporal domains but also AUs located in the same/close facial regions show stronger relationships than those of different facial regions. While none of existing approach thoroughly model such hierarchical inter-dependencies among AUs, this paper proposes to comprehensively model multi-scale AU-related dynamic and hierarchical spatio-temporal relationship among AUs for their occurrences recognition. Specifically, we first propose a novel multi-scale temporal differencing network with an adaptive weighting block to explicitly capture facial dynamics across frames at different spatial scales, which specifically considers the heterogeneity of range and magnitude in different AUs’ activation. Then, a two-stage strategy is introduced to hierarchically model the relationship among AUs based on their spatial distribution (i.e., local and cross-region AU relationship modelling). Experimental results achieved on BP4D and DISFA show that our approach is the new state-of-the-art in the field of AU occurrence recognition. Our code is publicly available at https://***/CVI-SZU/MDHR. © 2024, CC BY.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Generalized Undersampling of Center Points Based on Granular Ball 7

Generalized Undersampling of Center Points Based on Granular...

引用

7th International Conference on Cloud Computing and big data Analytics, ICCCBDA 2022

作者： Bai, Hao Wu, Yanmin Qi, Jinli Chen, Yanyi Chongqing University of Posts and Telecommunications Chongqing Key Laboratory of Computer Science and Technology ChongQing China ChongQing College of Electronic Engineering Department of Artificial Intelligence and Big Data ChongQing China ChongQing College of Electronic Engineering Department of General Education and International Studies ChongQing China Chongqing University of Posts and Telecommunications Department of Software Engineering ChongQing China

ISBN: (纸本)9781665487115

In this paper, we propose a new generic sampling classification method based on granular Ball sampling because of good robust noise immunity and possessing properties that can be classified as an undersampling method, called Granular Ball Center-based Common Under-sampling. The method uses adaptively generated Ball to cover the data space, and the sampled data are supported by the centroid properties of the Ball. Unlike the boundary sampling of granular ball sampling, this method mainly uses the center points to smooth out the noise, which not only can clearly represent the attributes, but also can reduce some computational effort, and in most of the time, it can obtain almost the same accuracy as the original model, or even can perform better. Compared with undersampling, it can be better adapted to the task of unbalanced classification as well as non-unbalanced classification. The above can show that the method is able to be generalized without the restriction of specific classifiers and also has a strong adaptability to the dataset. The method can also be effectively used as an undersampling method for unbalanced classification because it is supported by the centroid property, and the method has a speedup effect for most classifiers. These advantages form a strong advantage of the method in improving classifier performance. © 2022 IEEE.

关键词： Cloud computing Adaptation models Computational modeling big data Task analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：