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

arXiv 2025年

作者： Luo, Gongning Xu, Mingwang Chen, Hongyu Liang, Xinjie Tao, Xing Ni, Dong Jeong, Hyunsu Kim, Chulhong Stock, Raphael Baumgartner, Michael Kirchhoff, Yannick Rokuss, Maximilian Maier-Hein, Klaus Yang, Zhikai Fan, Tianyu Boutry, Nicolas Tereshchenko, Dmitry Moine, Arthur Charmetant, Maximilien Sauer, Jan Du, Hao Bai, Xiang-Hui Raikar, Vipul Pai Montoya-Del-Angel, Ricardo Martí, Robert Luna, Miguel Lee, Dongmin Qayyum, Abdul Mazher, Moona Guo, Qihui Wang, Changyan Awasthi, Navchetan Zhao, Qiaochu Wang, Wei Wang, Kuanquan Wang, Qiucheng Dong, Suyu School of Computer Science and Technology Harbin Institute of Technology Harbin150001 China Department of Mathematics Faculty of Science National University of Singapore Singapore National-Regional Key Technology Engineering Laboratory for Medical Ultrasound School of Biomedical Engineering Shenzhen University Medical School Shenzhen University Shenzhen China Laboratory Shenzhen University Shenzhen China School of Biomedical Engineering and Informatics Nanjing Medical University Nanjing China Pohang Korea Republic of Heidelberg Division of Medical Image Computing Heidelberg Germany Faculty of Mathematics and Computer Science Heidelberg University Germany Heidelberg Germany HIDSS4Health - Helmholtz Information and Data Science School for Health Karlsruhe Heidelberg Germany Pattern Analysis and Learning Group Department of Radiation Oncology Heidelberg University Hospital Germany Department of Biomedical Engineering and Health KTH Royal Institute of Technology Stockholm Sweden France FathomX Singapore Saw Swee Hock School of Public Health National University of Singapore Singapore Philips Research University of Girona Spain Department of Robotics and Mechatronics Engineering DGIST Korea Republic of Department of Interdisciplinary Studies of Artificial Intelligence DGIST Korea Republic of National Heart and Lung Institute Faculty of Medicine Imperial College London London United Kingdom Centre for Medical Image Computing Department of Computer Science University College London London United Kingdom Lab School of Communication and Information Engineering Shanghai University Shanghai China Faculty of Science Mathematics and Computer Science Informatics Institute University of Amsterdam Amsterdam1090 GH Netherlands Department of Biomedical Engineering and Physics Amsterdam UMC Amsterdam1081 HV Netherlands Xi’an Jiaotong-Liverpool University China Department of Ultrasound Harbin Medical University Cancer Hospital No. 150 Haping Road Nangang

Breast cancer is one of the most common causes of death among women worldwide. Early detection helps in reducing the number of deaths. Automated 3D Breast Ultrasound (ABUS) is a newer approach for breast screening, which has many advantages over handheld mammography such as safety, speed, and higher detection rate of breast cancer. Tumor detection, segmentation, and classification are key components in the analysis of medical images, especially challenging in the context of 3D ABUS due to the significant variability in tumor size and shape, unclear tumor boundaries, and a low signal-to-noise ratio. The lack of publicly accessible, well-labeled ABUS datasets further hinders the advancement of systems for breast tumor analysis. Addressing this gap, we have organized the inaugural Tumor Detection, Segmentation, and Classification Challenge on Automated 3D Breast Ultrasound 2023 (TDSC-ABUS2023). This initiative aims to spearhead research in this field and create a definitive benchmark for tasks associated with 3D ABUS image analysis. In this paper, we summarize the top-performing algorithms from the challenge and provide critical analysis for ABUS image examination. We offer the TDSC-ABUS challenge as an open-access platform at https://***/ to benchmark and inspire future developments in1algorithmic research. © 2025, CC BY.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

A Blockchain-based Revocable Certificateless Signature Scheme for IoT Device

引用

International Journal of Network Security 2021年第6期23卷 1012-1027页

作者： Chen, Yushuang Zheng, Dong Guo, Rui Zhang, Yinghui Tao, Xiaoling School of Cyberspace Security Xi’an University of Posts and Telecommunications Xi’an710121 China State Key Laboratory of Integrated Services Networks Xidian University Xi’an710071 China National Engineering Laboratory for Wireless Security Xi’an University of Posts and Telecommunications Guilin University of Electronic Technology Guilin541004 China Guangxi Cooperative Innovation Center of Cloud Computing and Big Data Guilin University of Electronic Technology Guilin541004 China

With the rapid development of Internet of Things (IoT) technology, completing a transaction with intelligent devices has been an essential communication mode in our daily life. Generally, lightweight smart devices conduct transactions relying on the third-party payment platform, which takes several inherent challenges of mutual distrust, data authentication and low efficiency in the IoT environment. To mitigate these issues, in this paper, we design a paring-free revocable certificateless signature (CLS) scheme with high efficiency based on the blockchain technique. Our scheme is a viable approach to enhance the performance without bilinear parings operation in the IoT lightweight equipment. And there are two different address lists stored in the blockchain to record the secret and public transaction data, respectively. According to this method, not only can the key management of the user be implemented in an efficient solution, but also enables the public verification to be performed transparently between the two parties. Furthermore, with the help of cloud server, it generates a time key for the user to accomplish revocation with low computation cost. We also make an analysis on the security to demonstrate that our proposal is existential unforgeability against adaptive chosen message attacks (EUF-CMA) under the elliptic curve discrete logarithm (ECDL) problem. Finally, the performance comparison indicates that our protocol is better than other related schemes. © 2021. International Journal of Network Security. All Rights Reserved.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Improving Automated GUI Exploration of Android Apps via Static Dependency Analysis

Improving Automated GUI Exploration of Android Apps via Stat...

引用

International Conference on Software Maintenance (ICSM)

作者： Wunan Guo Liwei Shen Ting Su Xin Peng Weiyang Xie School of Computer Science Fudan University Shanghai China Shanghai Key Laboratory of Data Science Fudan University Shanghai China School of Software Engineering East China Normal University Shanghai China Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai China

ISBN: (数字)9781728156194

ISBN: (纸本)9781728156200

Exploring GUIs of Android apps plays a key role in many important scenarios such as functional testing (e.g., finding crash errors), security analysis (e.g., identifying malicious behav-iors) and competitive analysis (e.g., storyboarding app features). To automate GUI exploration, existing techniques often try to visit as many GUI pages as possible via specific strategies, e.g., random (like Monkey) or heuristic (like Stoat, A 3 E). However, their effectiveness is still unclear and much under-explored. To this end, we conducted the first study in this paper to understand and characterize their limitations by carefully analyzing the coverage reports from a set of real-world, open-source apps. Through this study, we identified three key limitations due to the lack of dependency knowledge during exploration, i.e., widget-page dependency, widget-widget dependency and system-event dependency. To overcome them, we introduce dependency-informed exploration, an automated approach that leverages static dependency analysis to effectively improve GUI exploration performance. Given an app, our approach first constructs a GUI page transition model that captures the dependencies between GUI widgets, and then guides GUI exploration during a depth-first traversal. We realized our approach as a tool named Gesda, and evaluated it on 70 open-source Android apps. The results show Gesda outperforms existing state-of-the-art GUI exploration techniques, i.e., Monkey and Stoat. Additionally, Gesda uncovers 4 previously unknown crashes in 4 apps as a by-product of GUI exploration due to the benefit of dependency knowledge, while Monkey and Stoat have not discovered them.

关键词： Software maintenance Tools Computer crashes Security Open source software Graphical user interfaces Testing

来源：评论

学校读者我要写书评

暂无评论

Hyper-Parameter-Free Latent Factor Analysis via Adaptive Moment Estimation-Incorporated Particle Swarm Optimization

Hyper-Parameter-Free Latent Factor Analysis via Adaptive Mom...

引用

Cyber-Physical Social Intelligence (ICCSI), International Conference on

作者： Jiufang Chen Ye Yuan Chunlin He School of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing China Chinese Academy of Sciences Chongqing Institute of Green and Intelligent Technology Chongqing China Chongqing School University of Chinese Academy of Sciences Chongqing China Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Engineering Research Center of Big Data Application for Smart Cities Chongqing China School of Computer Science China West Normal University Nanchong Sichuan China

ISBN: (纸本)9781665426220

A latent factor analysis (LFA) model can efficiently address a high-dimensional and sparse (HiDS) matrix with a stochastic gradient descent (SGD) algorithm. However, an SGD-based LFA model's performance depends heavily on its hyper-parameters. The popular method is based on grid-search, which fails because of expensive computation and time-consuming. Aiming at implementing a hyper-parameter-free LFA model, this study proposes an adaptive moment estimation-incorporated particle swarm optimization (Adam-PSO) algorithm that efficiently addresses the premature issues in a PSO algorithm. With achieved the hyper-parameter adaptation in an SGD-based LFA model, an Adam-PSO-based LFA (APL) model possessing hyper-parameter-free training is further implemented. Empirical studies on four HiDS matrices indicate that compared with state-of-the-art models with hyper-parameter adaptation settings, an APL model achieves the most efficient hyper-parameter-free training and highly competitive prediction accuracy for missing data of an HiDS matrix. Hence, it fits the need of real applications with high scalability and efficiency.

关键词： Training Adaptation models Computational modeling Stochastic processes Predictive models Prediction algorithms data models

来源：评论

学校读者我要写书评

暂无评论

Cross-domain object detection through coarse-to-fine feature adaptation

arXiv

引用

arXiv 2020年

作者： Zheng, Yangtao Huang, Di Liu, Songtao Wang, Yunhong Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University State Key Laboratory of Software Development Environment Beihang University School of Computer Science and Engineering Beihang University Beijing100191 China

Recent years have witnessed great progress in deep learning based object detection. However, due to the domain shift problem, applying off-the-shelf detectors to an unseen domain leads to significant performance drop. To address such an issue, this paper proposes a novel coarseto-fine feature adaptation approach to cross-domain object detection. At the coarse-grained stage, different from the rough image-level or instance-level feature alignment used in the literature, foreground regions are extracted by adopting the attention mechanism, and aligned according to their marginal distributions via multi-layer adversarial learning in the common feature space. At the fine-grained stage, we conduct conditional distribution alignment of foregrounds by minimizing the distance of global prototypes with the same category but from different domains. Thanks to this coarse-to-fine feature adaptation, domain knowledge in foreground regions can be effectively transferred. Extensive experiments are carried out in various cross-domain detection scenarios. The results are state-of-the-art, which demonstrate the broad applicability and effectiveness of the proposed approach. Copyright © 2020, The Authors. All rights reserved.

关键词： Object recognition

来源：评论

学校读者我要写书评

暂无评论

Weighted partial order oriented three-way decisions under score-based common voting rules

引用

International Journal of Approximate Reasoning 2020年 123卷 41-54页

作者： Li, Lei Wu, Xindong Chen, Huanhuan Zhou, Chuan Liu, Guanfeng Jiang, Yongkang Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education Hefei 230601 China Mininglamp Academy of Sciences Mininglamp Technologies Beijing 100084 China School of Computer Science and Technology University of Science and Technology of China Hefei 230026 China Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing 100190 China Computing Dept Macquarie University Sydney A1C 5S7 Australia

Recently, with the trisecting and acting models of human cognitive behaviors, three-way decisions are introduced to deal with uncertain decisions in many applications. To define and conduct the three-way decisions on the possible or necessary loser or co-loser and/or winner or co-winner, we first define the score-based common voting rules, where a score-based function is introduced to evaluate certain utility, including positional scoring rules, maximin, Bucklin, and so on. Then on one hand, it has been proved that under certain conditions three-way decisions on the possible loser or co-loser and/or winner or co-winner are NP-complete with positional scoring rules, maximin, and Bucklin, respectively. On the other hand, we have presented algorithms whose time complexity is polynomial to conduct three-way decisions on the necessary winner or co-winner and/or necessary loser or co-loser with positional scoring rules, maximin, and Bucklin in time O(nm²), O(nm³), and O(nm²), respectively, which has been validated experimentally. © 2020 Elsevier Inc.

关键词： Common voting rules Three-way decisions Weighted partial orders

来源：评论

学校读者我要写书评

暂无评论

Influence of dextran solution and corneal collagen crosslinking on Corneal Biomechanical Parameters Evaluated by Corvis ST

Research Square

引用

Research Square 2021年

作者： Qin, Xiao Tian, Lei Zhang, Hui Zhang, Di Guo, Li-Li Zhang, Hai-Xia Jie, Ying Li, Lin Beijing Key Laboratory of Fundamental Research on Biomechanics in Clinical Application Capital Medical University Beijing100069 China School of Biomedical Engineering Capital Medical University Beijing100069 China Beijing Institute of Ophthalmology Beijing Tongren Eye Center Beijing Tongren Hospital Capital Medical University Beijing Ophthalmology & Visual Sciences Key Laboratory Beijing100730 China Beijing Advanced Innovation Center for Big Data-Based Precision Medicine Beihang University Capital Medical University Beijing Tongren Hospital Beijing100730 China

Purpose: To analyze the influence of dextran solution and corneal collagen crosslinking (CXL) on corneal biomechanical parameters evaluated by Corneal visualization Scheimpflug Technology (Corvis ST). Materials and Methods: Forty porcine eyes were included in this study. Twenty porcine eyes were soaked in dextran solution for 30 minutes (10 eyes in 2% dextran solution and 10 eyes in 20% dextran solution). CXL treatment was performed in 10 porcine eyes, the other 10 porcine eyes were regarded as a control group. Each eye was fixed on an experimental inflation platform to carry out Corvis measurements at different IOPs. Corneal biomechanical parameters were calculated based on Corvis measurement. Statistical analysis was used to analyze the influence of dextran solution and CXL on corneal biomechanical parameters based on Corvis parameters. Results: Corneal energy absorbed area (Aabsorbed) decreased after being soaked in dextran solution under IOP of 15 mmHg;Corneal elastic modulus (E) decreased after being soaked in 2% dextran solution and increased after being soaked in 20% dextran solution;SP-A1 increased after CXL. Conclusion: Both dextran solution and CXL can change corneal biomechanical properties;SP-A1 may be used as an effective parameter for the evaluation of CXL. © 2021, CC BY.

关键词： visualization

来源：评论

学校读者我要写书评

暂无评论

Poisoning attack against estimating from pairwise comparisons

arXiv

引用

arXiv 2021年

作者： Ma, Ke Xu, Qianqian Zeng, Jinshan Cao, Xiaochun Huang, Qingming The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing100049 China The Artificial Intelligence Research Center Peng Cheng Laboratory Shenzhen518055 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China The School of Computer and Information Engineering Jiangxi Normal University Jiangxi Nanchang330022 China Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China The School of Cyber Security University of Chinese Academy of Sciences Beijing100049 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing100049 China The Key Laboratory of Big Data Mining and Knowledge Management The School of Economics and Management University of Chinese Academy of Sciences Beijing100049 China

As pairwise ranking becomes broadly employed for elections, sports competitions, recommendation, information retrieval and so on, attackers have strong motivation and incentives to manipulate or disrupt the ranking list. They could inject malicious comparisons into the training data to fool the target ranking algorithm. Such a technique is called "poisoning attack" in regression and classification tasks. In this paper, to the best of our knowledge, we initiate the first systematic investigation of data poisoning attack on the pairwise ranking algorithms, which can be generally formalized as the dynamic and static games between the ranker and the attacker, and can be modeled as certain kinds of integer programming problems mathematically. To break the computational hurdle of the underlying integer programming problems, we reformulate them into the distributionally robust optimization (DRO) problems, which are computational tractable. Based on such DRO formulations, we propose two efficient poisoning attack algorithms and establish the associated theoretical guarantees including the existence of Nash equilibrium and the generalization ability bounds. The effectiveness of the suggested poisoning attack strategies is demonstrated by a series of toy simulations and several real data experiments. These experimental results show that the proposed methods can significantly reduce the performance of the ranker in the sense that the correlation between the true ranking list and the aggregated results with toxic data can be decreased dramatically. © 2021, CC BY-NC-ND.

关键词： Toys

来源：评论

学校读者我要写书评

暂无评论

Self-to-self transitions in open quantum systems:the origin and solutions

Self-to-self transitions in open quantum systems:the origin ...

引用

第三十九届中国控制会议

作者： Fang Gao Yaoxiong Wang Qing Gao Dewen Cao Feng Shuang College of Electrical Engineering Guangxi University Institute of Intelligent Machines Chinese Academy of Sciences School of Automation Science and Electrical Engineering Beihang University Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University University Key Laboratory of Intelligent Perception and Computing of Anhui Province Anqing Normal University

The information of quantum pathways can be extracted in the framework of the Hamiltonianencoding and Observable-decoding *** closed quantum systems,only off-diagonal elements of the Hamiltonian in the Hilbert space is required to be encoded to obtain the desired *** open quantum systems,environment-related terms will appear in the diagonal elements of the Hamiltonian in the Liouville *** diagonal encodings have to be performed to differentiate different pathways,which will lead to self-to-self transitions and inconsistency of pathway amplitudes with Dyson *** this work,a well-designed transformation is proposed to avoid the counterintuitive transitions and the inconsistency,with or without control *** simulations show that the method are consistent with Dyson expansion.

关键词： Self-to-self transitions in open quantum systems:the origin and solutions origin

来源：评论

学校读者我要写书评

暂无评论

Time-aware bike flow prediction framework with dynamic edge fusion and memory integration

引用

Knowledge-Based Systems 2025年 322卷

作者： M.Rajeh, Taha Li, Tianrui Luo, Zhpeng Javed, Muhammad Hafeez Alhaek, Fares 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 Stirling College Chengdu University Chengdu610106 China Computing Science Faculty of Natural Sciences University of Stirling StirlingFK9 4LA United Kingdom

Bike-Sharing Systems (BSSs) have become a popular solution to urban sustainability concerns, providing affordable and environmentally friendly transportation. However, modeling and predicting shared-bike flow patterns are essential for developing intelligent transportation systems and facilitating city management. Despite the existence of several inflow and outflow prediction models, certain unresolved issues remain, including the inability to differentiate and capture heterogeneous dynamic relationships within daily flows, and the suboptimal utilization of historical flow data for forecasting. To address these limitations, we propose MVRC (Multi-View Relational Framework based on Clustering), a novel deep-learning framework for precise inflow and outflow prediction. The MVRC framework models three types of heterogeneous dynamic flow relationships during different periods of the day. Initially, we introduce a novel clustering method to group nearby stations exhibiting similar patterns, followed by creating a dynamic memory module to store and update edge attributes based on the time of day. Furthermore, the dynamic edge fusion mechanism effectively integrates heterogeneous, time-evolving flow features, capturing their varying impacts. To further enhance the model's capabilities, an offline component that leverages historical data is incorporated, improving performance during testing. Extensive experiments conducted on real datasets from New York City and Washington, D.C., demonstrate the superior prediction efficiency and framework effectiveness of the MVRC framework compared to existing state-of-the-art techniques. These results highlight the practicality and efficacy of MVRC in terms of prediction accuracy and stability. © 2025

关键词： Urban transportation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：