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

arXiv 2022年

作者： Fang, Huihui Li, Fei Wu, Junde Fu, Huazhu Sun, Xu Son, Jaemin Yu, Shuang Zhang, Menglu Yuan, Chenglang Bian, Cheng Lei, Baiying Zhao, Benjian Xu, Xinxing Li, Shaohua Fumero, Francisco Sigut, José Almubarak, Haidar Bazi, Yakoub Guo, Yuanhao Zhou, Yating Baid, Ujjwal Innani, Shubham Guo, Tianjiao Yang, Jie Orlando, José Ignacio Bogunović, Hrvoje Zhang, Xiulan Xu, Yanwu The REFUGE2 Challenge Australia State Key Laboratory of Ophthalmology Zhongshan Ophthalmic Center Sun Yat-Sen University Guangdong Provincial Key Laboratory of Ophthalmology and Visual Science Guangzhou China Intelligent Healthcare Unit Baidu Inc. Beijing China The Institute of High Performance Computing Agency for Science Technology and Research Singapore Yatiris Group PLADEMA Institute CONICET UNICEN Tandil Argentina Christian Doppler Lab for Artificial Intelligence in Retina Department of Ophthalmology and Optometry Medical University of Vienna Vienna Austria VUNO Inc Seoul Korea Republic of Tencent HealthCare Tencent Shenzhen China Computer Vision Institute College of Computer Science and Software Engineering of Shenzhen University Shenzhen China School of Biomedical Engineering Health Science Center Shenzhen University China Xiaohe Healthcare ByteDance Guangdong Guangzhou510000 China School of Biomedical Engineering Shenzhen University China College of Computer Science & Software Engineering Shenzhen University China Department of Computer Science and Systems Engineering Universidad de La Laguna Spain Saudi Electronic University Saudi Arabia King Saud University Saudi Arabia Institute of Automation Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China SGGS Institute of Engineering and Technology India Institute of Medical Robotics Shanghai Jiao Tong University China Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University China

With the rapid development of artificial intelligence (AI) in medical image processing, deep learning in color fundus photography (CFP) analysis is also evolving. Although there are some open-source, labeled datasets of CFPs in the ophthalmology community, large-scale datasets for screening only have labels of disease categories, and datasets with annotations of fundus structures are usually small in size. In addition, labeling standards are not uniform across datasets, and there is no clear information on the acquisition device. Here we release a multi-annotation, multi-quality, and multi-device color fundus image dataset for glaucoma analysis on an original challenge-Retinal Fundus Glaucoma Challenge 2nd Edition (REFUGE2). The REFUGE2 dataset contains 2000 color fundus images with annotations of glaucoma classification, optic disc/cup segmentation, as well as fovea localization. Meanwhile, the REFUGE2 challenge sets three sub-tasks of automatic glaucoma diagnosis and fundus structure analysis and provides an online evaluation framework. Based on the characteristics of multi-device and multi-quality data, some methods with strong generalizations are provided in the challenge to make the predictions more robust. This shows that REFUGE2 brings attention to the characteristics of real-world multi-domain data, bridging the gap between scientific research and clinical application. © 2022, CC BY-NC-ND.

关键词： Color

来源：评论

学校读者我要写书评

暂无评论

Microblog text clustering based on BK-means algorithm 8

Microblog text clustering based on BK-means algorithm

引用

2018 8th International Workshop on Computer Science and engineering, WCSE 2018

作者： Li, Qianru Mo, Xiuliang Wang, Chundong Tianjin Intelligent Computing and Software New Technology Key Laboratory School of Computer Science and Engineering Tianjin university of technology Tianjin300384 China

ISBN: (纸本)9789811178610

In recent years, the increasing popularity of social media such as WeChat and Weibo has facilitated the communication among people. However, due to the characteristics like large scale, fast propagation, low quality and diverse modalities of social short texts, the short text clustering faces the challenge of sparse features, high dimension and noise interference. The traditional clustering method based on vector space model is not good for short text data processing. With the improvement of K-means algorithm, this paper proposes a short-text clustering algorithm named BK-means which alleviates the effect of data sparseness. Firstly, we preprocess the wordset by means of word segmentation, stop-of-word and other operations, then extract the biterm using the BTM to model the document, and get the document-topic, the topic-word distribution matrix. Finally, we use the proposed BK-means algorithm to cluster short texts of documents represented by vectors. Experiments on the short text data of Sina Weibo have proved that the short text clustering algorithm based on BK-means is superior to the traditional one, and both the F-measure and the purity are improved. © Proceedings of 2018 the 8th International Workshop on Computer Science and engineering, WCSE 2018. All rights reserved.

关键词： K-means clustering

来源：评论

学校读者我要写书评

暂无评论

Lightweight image encryption using integer reversible discrete Dual-Hahn transform on embedded systems

引用

engineering Science and Technology, an International Journal 2025年 69卷

作者： Mohamed Yamni Achraf Daoui Chakir El-Kasri May Almousa Ali Abdullah S. AlQahtani Ahmed A. Abd El-Latif Engineering Sciences Laboratory Polydisciplinary Faculty Sidi Mohamed Ben Abdellah University Oujda Road 1223 Taza Morocco Industrial Systems Engineering and Energy Conversion (ISEEC) Faculty of Science and Technology Abdelmalek Essaadi University Tangier Morocco Information Technology Department College of Computer and Information Sciences Princess Nourah Bint Abdulrahman University Riyadh Saudi Arabia Software Engineering Department Prince Sultan University Riyadh 11586 Saudi Arabia EIAS Data Science Lab College of Computer and Information Sciences and Center of Excellence in Quantum and Intelligent Computing Prince Sultan University Riyadh 11586 Saudi Arabia Department of Mathematics and Computer Science Faculty of Science Menoufia University 32511 Egypt

The security and performance of a cryptographic algorithm can be reduced when implemented on an embedded system, such as a 32-bit microcontroller, due to the limitation of hardware resources, such as computational precision, processing power, and memory. This paper introduces the Integer Reversible Discrete Dual-Hahn Transform (IRDDHT), a novel integer-based transform designed for secure image encryption in resource-constrained embedded systems. The IRDDHT ensures lossless encryption by eliminating rounding errors common in floating-point transforms, maintaining image fidelity during encryption and decryption. We then propose a lightweight encryption algorithm based on IRDDHT, which introduces implicit diffusion and relies on parameter sensitivity to enhance security. When implemented on the ESP32 microcontroller, the proposed algorithm occupies less than 4 % of SRAM and 8.5 % of Flash memory, achieving a throughput of 170.67 kbps at the device’s maximum clock frequency. It is energy-efficient, capable of encrypting up to 129,025 grayscale images of size 256 × 256 pixels on a standard 3300 mAh battery. The algorithm ensures perfect decryption with no loss of image fidelity and demonstrates strong resistance to statistical attacks with near-ideal correlation values, as well as brute-force attacks with a large key space of 2 199 . These results indicate that the IRDDHT-based encryption method is an effective solution for secure image encryption in embedded systems.

关键词： Embedded systems Integer reversible discrete Dual-Hahn transform Lightweight algorithm Lossless image encryption Security

来源：评论

学校读者我要写书评

暂无评论

An auto code generator for stencil on SW26010 21

An auto code generator for stencil on SW26010

引用

21st IEEE International Conference on High Performance computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on Data Science and Systems, HPCC/SmartCity/DSS 2019

作者： Zhu, Xiaomin Zeng, Yunhui Wei, Yanjie Feng, Shengzhong Liu, Weiguo Balaji, Pavan Joint Engineering Research Center Health Big Data Intelligent Analysis Technology Center for High Performance Computing Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Shenzhen China Shandong Computer Science Center National SuperComputer Center in Jinan Jinan China Sclool of Software Shandong University Jinan China Argonne National Laboratory United States

ISBN: (纸本)9781728120584

Stencil is a basic building block widely used in many HPC areas and applications. It generally dominates the time cost and is critical to the overall performance. Given that heterogeneous many-core is frequently adopted to build super computers, porting and optimizing stencil codes on modern accelerator-based architectures is important. Porting is non-trivial, and optimization is more difficult as it requires better understanding of the underlying architecture. As a result, auto tuning targeting on accelerators such as GPU becomes a hot research topic. In this paper, we focus on tuning stencil automatically on SW26010, which is a heterogeneous many-core CPU equipped in Sunway TaihuLight SuperComputer, and mainly work on 2D stencil variants code in ROMS (Regional Ocean Modeling System). The code generator can generate codes running on slave cores for 50+ different FORTRAN stencil-alike loops in ROMS in seconds, and optimization methods are integrated into the generator as well. The performance is better than the directive based method (OpenACC) and the hand-drafted code by a junior programmer, and it is comparable compared with the code written by a senior programmer with several years of programming experience. © 2019 IEEE.

关键词： Supercomputers

来源：评论

学校读者我要写书评

暂无评论

SEBF: A single-chain based extension model of blockchain for fintech 29

SEBF: A single-chain based extension model of blockchain for...

引用

29th International Joint Conference on Artificial Intelligence, IJCAI 2020

作者： Ji, Yimu Gu, Weiheng Chen, Fei Xiao, Xiaoying Sun, Jing Liu, Shangdong He, Jing Li, Yunyao Zhang, Kaixiang Mei, Fen Wu, Fei School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Nanjing China Institue of High Performance Computing and Bigdata Nanjing University of Posts and Telecommunications Nanjing China Nanjing Center of HPC China Nanjing China Jiangsu HPC and Intelligent Processing Engineer Research Center Nanjing China Institute of Information Technology Nanjing University of Finance and Economics Nanjing China School of Software and Electrical Engineering Swinburne University of Technology Hawthorn Australia WeBank Co. Ltd. Shenzhen China College of Automation Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (纸本)9780999241165

The traditional blockchain has the shortcoming that a single-chain can only deal with one or a few specific data types. The research question of how to make blockchain be able to deal with various data types has not been well studied. In this paper, we propose a single-chain based extension model of blockchain for fintech (SEBF). In the financial environment, we design a four-layer architecture for this model. By employing the external trusted oracle group and a financial regulator agency, a variety types of data can be effectively stored in the blockchain, such that the data type extension based on a single-chain is realized. The experimental results indicate that the proposed model can improve the efficiency of simplified payment verification. © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

In-situ data scheduling optimization based on rainbow DQN for IIoT

引用

Future Generation Computer Systems 2026年 174卷

作者： Peiying Zhang Siyi Li Lizhuang Tan Neeraj Kumar Jian Wang Kai Liu Qingdao Institute of Software College of Computer Science and Technology China University of Petroleum (East China) Qingdao 266580 China Shandong Key Laboratory of Intelligent Oil & Gas Industrial Software Qingdao 266580 China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan 250014 China Department of Computer Science and Engineering Thapar Institute of Engineering and Technology Patiala 147004 India Department of Computer Science University of Economics and Human Sciences Warszawa 01-043 Poland Department of Networks and Communications College of Computer Science and Information Technology Imam Abdulrahman Bin Faisal University Dammam 31441 Saudi Arabia College of Science China University of Petroleum (East China) Qingdao 266580 China Beijing National Research Center for Information Science and Technology Tsinghua University Beijing 100084 China State Key Laboratory of Space Network and Communications Tsinghua University Beijing 100084 China

In industrial systems, in-situ computing refers to a mode of local or proximate data processing within the cloud–edge-terminal architecture. In the Industrial Internet of Things (IIoT) environment, servers are typically deployed near terminal devices to coordinate and manage the scheduling of in-situ data, forming a comprehensive in-situ server system. With the rapid growth of IIoT terminal devices, challenges such as high processing delays and severe demand congestion arise in the in-situ data scheduling process. To address this challenge, this paper proposes a scheduling optimization scheme based on Rainbow DQN. The scheme designs a scheduling buffer and classification strategy to distinguish in-situ data based on storage demand characteristics, thereby optimizing the scheduling process. At the same time, a multi-level storage structure is introduced to store in-situ data classified according to the scheduling strategy. Additionally, the Rainbow DQN algorithm is utilized to assist in the scheduling decision-making of in-situ data retrieval, effectively alleviating system congestion while ensuring certain throughput performance. Extensive simulation experiments show that the Rainbow DQN algorithm achieves a reduction of 60.82% in average waiting delay, 62.94% in average unprocessed demand, and a 58.27% reduction in average completion delay.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Kind of new parallax algorithm based on symmetric continuous optimization

引用

Journal of Physics: Conference Series 2021年第3期1748卷

作者： Kaiwen Jiang Degan Zhang Haixia Xu Key Laboratory of Computer Vision and System (Tianjin University of Technology) Ministry of Education 300384 China Tianjin Key Lab of Intelligent Computing & Novel software Technology Tianjin University of Technology Tianjin China School of Electronic and Information Engineering Tianjin Vocational Institute Tianjin 300410 China

With the fast development of 3D imaginations becomes more and more fascination, multi-view stereo based 3D reconstruction is a significant technique for those application. To facilitate the subsequent processing of 3D reconstruction and reduce the possibility of other algorithms falling into local optimal solutions, attempting to get better and faster performance, a new parallax calculation based on symmetric continuous optimization is proposed in this paper. The algorithm is proposed here will be tested respectively in the same data, in order to certificate the algorithm applied is better than traditional minimize El algorithm.

关键词：

来源：评论

学校读者我要写书评

暂无评论

ANDROIDOFF:Offloading android application based on cost estimation

引用

Journal of Systems and software 2019年 158卷 110418-000页

作者： Chen, Xing Chen, Jiaqing Liu, Bichun Ma, Yun Zhang, Ying Zhong, Hao College of Mathematics and Computer Science Fuzhou University Fuzhou350116 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350116 China School of Software Tsinghua University Beijing100084 China National Engineering Research Center of Software Engineering Peking University China Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai200240 China

Computation offloading is a promising way of improving the performance and reducing the battery power consumption, since it moves some time-consuming computation activities to nearby servers. Although various approaches have been proposed to support computation offloading, we argue that there is still sufficient space for improvements, since existing approaches cannot accurately estimate the execution costs. As a result, we find that their offloading plans are less optimized. To handle the problem, in this paper, given an Android application, we propose a novel approach, called ANDROIDOFF, that supports offloading at the granularity of objects. Supporting such capability is challenging due to the two reasons: (1) through dynamic execution, it is feasible to collect the execution costs of only partial methods, and (2) it is difficult to accurately estimate the execution costs of the remaining methods. To overcome the challenges, given an Android application, ANDROIDOFF first combines static and dynamic analysis to predict the execution costs of all its methods. After all the costs are estimated, ANDROIDOFF synthesizes an offloading plan, in which determines the offloading details. We evaluate ANDROIDOFF on a real-world application, with two mobile devices. Our results show that, compared with other approaches, ANDROIDOFF saves the response time by 8%–49% and reduces the energy consumption by 12%–49% on average for computation-intensive applications. © 2019 Elsevier Inc.

关键词： computation offloading

来源：评论

学校读者我要写书评

暂无评论

Fair and autonomous sharing of federate learning models in mobile Internet of Things

arXiv

引用

arXiv 2020年

作者： Hao, Xiaohan Ren, Wei Xiong, Ruoting Zheng, Xianghan Zhu, Tianqing Xiong, Neal N. School of Computer Science China University of Geoscience Wuhan China Guangxi Key Laboratory of Cryptography and Information Security Guilin541004 China Key Laboratory of Network Assessment Technology CAS Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China Mingbyte Technology QingDao China School of Software University of Technology Sydney UltimoNSW2007 Australia Dept. of Mathematics and Computer Science Northeastern State University United States

Federate learning can conduct machine learning as well as protect the privacy of self-owned training data on corresponding ends, instead of having to upload to a central trusted data aggregation server. In mobile scenarios, a centralized trusted server may not be existing, and even though it exists, the delay will not be manageable, e.g., smart driving cars. Thus, mobile federate learning at the edge with privacy-awareness is attracted more and more attentions. It then imposes a problem - after data are trained on a mobile terminal to obtain a learned model, how to share the model parameters among others to create more accurate and robust accumulative final model. This kind of model sharing confronts several challenges, e.g., the sharing must be conducted without a third trusted party (autonomously), and the sharing must be fair as model training (by training data)is valuable. To tackle the above challenges, we propose a smart contract and IPFS (Inter-Planetary File System) based model sharing protocol and algorithms to address the challenges. The proposed protocol does not rely on a trusted third party, where individual-learned models are shared/stored in corresponding ends. Conducted through extensive experiments, three main steps of the proposed protocol are evaluated. The average executive time of the three steps are 0.059s, 0.060s and 0.032s, demonstrating its efficiency. Copyright © 2020, The Authors. All rights reserved.

关键词： Smart contract

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Clustering Algorithm of Gaussian Curve Fitting the Histogram Based on K-Means

An Adaptive Clustering Algorithm of Gaussian Curve Fitting t...

引用

IEEE International Symposium on Parallel and Distributed Processing with Applications and IEEE International Conference on Ubiquitous computing and Communications (ISPA/IUCC)

作者： Guangkun Ma Jinzhu Yang Xiaoxu Song Hong Zhao School of Computer Science and Engineering Northeastern University Shenyang China School of Software Shenyang University of Technology Shenyang China Key Laboratory of Intelligent Computing in Medical Image Ministry of Education School of Computer Science and Engineering Northeastern University Shenyang China

ISBN: (纸本)9781728152103

The K-mean algorithm is simple and efficient in vascular segmentation. But in a K-means clustering algorithm, the number of clustering centers must be determined in advance and the random allocation of clustering centers seriously affects the efficiency of the algorithm. In order to solve this problem, an adaptive clustering algorithm based on K-means with the Gaussian curve fitting histogram is proposed, which is used to segment circular-like blood vessels. Firstly, the histogram outline is fitted into the Gaussian curve by the least square method and the maximum value of the curve is obtained. The number of maximal values is counted as the number of clustering centers and the maximum points are used as the central points of clustering. Also, the K-means algorithm is improved by combining the intensity and position information of pixels. The proposed method has been tested by 6 groups of medical images. The algorithm has the advantages of less iterations, fast convergence speed and getting more than 95% Dice Similarity Measure value. The algorithm can effectively solve the determination of multi-seed points and vascular segmentation in medical image segmentation.

关键词： blood vessels curve fitting Gaussian processes image segmentation medical image processing pattern clustering Gaussian distribution image segmentation Clustering algorithms Medical image processing Cluster Analysis Gaussian processes Curve fitting Blood Vessels histograms Least squares method

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：