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

arXiv 2021年

作者： Li, Yong Lao, Lingjie Cui, Zhen Shan, Shiguang Yang, Jian Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information Ministry of Education School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China Key Laboratory of Intelligent Information Processing of Chinese Academy of Sciences Institute of Computing Technology CAS Beijing100190 China University of Chinese Academy of Sciences Beijing100049 China CAS Center for Excellence in Brain Science and Intelligence Technology

Cartoon face recognition is challenging as they typically have smooth color regions and emphasized edges, the key to recognize cartoon faces is to precisely perceive their sparse and critical shape patterns. However, it is quite difficult to learn a shape-oriented representation for cartoon face recognition with convolutional neural networks (CNNs). To mitigate this issue, we propose the GraphJigsaw that constructs jigsaw puzzles at various stages in the classification network and solves the puzzles with the graph convolutional network (GCN) in a progressive manner. Solving the puzzles requires the model to spot the shape patterns of the cartoon faces as the texture information is quite limited. The key idea of GraphJigsaw is constructing a jigsaw puzzle by randomly shuffling the intermediate convolutional feature maps in the spatial dimension and exploiting the GCN to reason and recover the correct layout of the jigsaw fragments in a self-supervised manner. The proposed GraphJigsaw avoids training the classification model with the deconstructed images that would introduce noisy patterns and are harmful for the final classification. Specially, GraphJigsaw can be incorporated at various stages in a top-down manner within the classification model, which facilitates propagating the learned shape patterns gradually. GraphJigsaw does not rely on any extra manual annotation during the training process and incorporates no extra computation burden at inference time. Both quantitative and qualitative experimental results have verified the feasibility of our proposed GraphJigsaw, which consistently outperforms other face recognition or jigsaw-based methods on two popular cartoon face datasets with considerable improvements. © 2021, CC BY-NC-SA.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

An improved method of cache prefetching for small files in ceph system 5th

An improved method of cache prefetching for small files in c...

引用

5th Euro-China Conference on Intelligent Data Analysis and Applications, ECC 2018

作者： Fan, Ya Wang, Yong Ye, Miao Lu, Xiaoxia Huan, YiMing School of Computer Science and Information Security Guilin University of Electronic Technology GuilinGuangxi541004 China School of Information and Communication Guilin University of Electronic Technology GuilinGuangxi541004 China Guangxi Colleges and Universities Key Laboratory of Cloud Computing and Complex Systems Guilin University of Electronic Technology GuilinGuangxi541004 China

ISBN: (纸本)9783030037659

To improve the inefficiency of file access for massive small files in the distributed file system, prefetching the small files into the cache is the most conventional method to be adopted. As the number of cached files is proportional to time, there will be many redundant small files which occupy the cache space and haven’t been read for a long time, the hit ratio will be decreased in this situation. To solve this defect, we proposed an improved LRU-W algorithm based on the file read times and the time interval of file read and designed a L2 cache optimization mechanism which can search file in the linked list with higher priority firstly and remove the files with lighter weight factor from the linked list with lower priority dynamically. The experiments and its result show that when prefetching massive small files, the proposed method in this paper can increase the hit ratio of cached files and improve the overall performance of Ceph file system. © Springer Nature Switzerland AG 2019.

关键词： File organization

来源：评论

学校读者我要写书评

暂无评论

Individual particle persistence antagonizes global ordering in populations of nematically aligning self-propelled particles

引用

Physical Review E 2025年第2期111卷 025409-025409页

作者： J. M. Nava-Sedeño R. Klages H. Hatzikirou Francisco J. Sevilla A. Deutsch Departmento de Matemáticas Facultad de Ciencias Universidad Nacional Autónoma de México Circuito Exterior Ciudad Universitaria 04510 Ciudad de México México Centre for Complex Systems School of Mathematical Sciences Queen Mary University of London Mile End Road London E1 4NS United Kingdom London Mathematical Laboratory 8 Margravine Gardens London W6 8RH United Kingdom Technische Universität Dresden Center for Information Services and High Performance Computing Nöthnitzer Straße 46 01062 Dresden Germany Mathematics Department Khalifa University PO Box 127788 Abu Dhabi United Arab Emirates Instituto de Física Universidad Nacional Autónoma de México Apdo. Postal 20-364 01000 Ciudad de México México

The transition from individual to collective motion plays a significant role in many biological processes. While the implications of different types of particle-particle interactions for the emergence of particular modes of collective motion have been well studied, it is unclear how particular types of individual migration patterns influence collective motion. Here, motivated by swarming bacteria Myxococcus xanthus, we investigate the combined effects of the individual pattern of migration and particle-particle interactions on the emergence of collective migration. We analyze the effects of a feature of individual pattern migration, the persistence of motion, on the collective properties of the system that emerge from interactions among individuals, particularly when nematic velocity alignment interaction mediates collective dynamics. We find, through computer simulations and mathematical analysis, that an initially disordered migratory state can become globally ordered by increasing either the particle-particle alignment interaction strength or the persistence of individual migration. In contrast, we find that persistence prevents the emergence of global nematic order when both persistence and nematic alignment are comparatively high. We conclude that behavior at the population level not only depends on interactions between individuals but also on their own intrinsic behavior.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Modern computing: Vision and Challenges

arXiv

引用

arXiv 2024年

作者： Gill, Sukhpal Singh Wu, Huaming Patros, Panos Ottaviani, Carlo Arora, Priyansh Pujol, Victor Casamayor Haunschild, David Parlikad, Ajith Kumar Cetinkaya, Oktay Lutfiyya, Hanan Stankovski, Vlado Li, Ruidong Ding, Yuemin Qadir, Junaid Abraham, Ajith Ghosh, Soumya K. Song, Houbing Herbert Sakellariou, Rizos Rana, Omer Rodrigues, Joel J.P.C. Kanhere, Salil S. Dustdar, Schahram Uhlig, Steve Ramamohanarao, Kotagiri Buyya, Rajkumar School of Electronic Engineering and Computer Science Queen Mary University of London London United Kingdom Center for Applied Mathematics Tianjin University Tianjin China Raygun Performance Monitoring Wellington New Zealand Department of Computer Science York Centre for Quantum Technologies University of York York United Kingdom Microsoft Schiphol Netherlands Distributed Systems Group Vienna University of Technology Vienna Austria Detecon International GmbH Munich Germany Institute for Manufacturing Department of Engineering University of Cambridge Cambridge United Kingdom Department of Engineering Science University of Oxford Oxford United Kingdom Department of Computer Science University of Western Ontario London Canada Faculty of Computer and Information Science University of Ljubljana Ljubljana Slovenia Institute of Science and Engineering Kanazawa University Japan Tecnun School of Engineering University of Navarra Spain Department of Computer Science and Engineering College of Engineering Qatar University Doha Qatar Bennett University Greater Noida India Machine Intelligence Research Labs AuburnWA United States Department of Computer Science and Engineering Indian Institute of Technology Kharagpur India Baltimore United States Department of Computer Science University of Manchester Oxford Road Manchester United Kingdom School of Computer Science and Informatics Cardiff University Cardiff United Kingdom Department of Computer Science College of Computer and Information Sciences King Saud University Riyadh Saudi Arabia COPELABS Lusófona University Lisbon Portugal Sydney Australia The University of Melbourne Victoria Australia Laboratory School of Computing and Information Systems The University of Melbourne Australia

Over the past six decades, the computing systems field has experienced significant transformations, profoundly impacting society with transformational developments, such as the Internet and the commodification of computing. Underpinned by technological advancements, computer systems, far from being static, have been continuously evolving and adapting to cover multifaceted societal niches. This has led to new paradigms such as cloud, fog, edge computing, and the Internet of Things (IoT), which offer fresh economic and creative opportunities. Nevertheless, this rapid change poses complex research challenges, especially in maximizing potential and enhancing functionality. As such, to maintain an economical level of performance that meets ever-tighter requirements, one must understand the drivers of new model emergence and expansion, and how contemporary challenges differ from past ones. To that end, this article investigates and assesses the factors influencing the evolution of computing systems, covering established systems and architectures as well as newer developments, such as serverless computing, quantum computing, and on-device AI on edge devices. Trends emerge when one traces technological trajectory, which includes the rapid obsolescence of frameworks due to business and technical constraints, a move towards specialized systems and models, and varying approaches to centralized and decentralized control. This comprehensive review of modern computing systems looks ahead to the future of research in the field, highlighting key challenges and emerging trends, and underscoring their importance in cost-effectively driving technological progress. © 2024, CC BY.

关键词： Obsolescence

来源：评论

学校读者我要写书评

暂无评论

Motif Graph Neural Network

arXiv

引用

arXiv 2021年

作者： Chen, Xuexin Cai, Ruichu Fang, Yuan Wu, Min Li, Zijian Hao, Zhifeng The School of Computer Science Guangdong University of Technology Guangzhou510006 China The School of Computer Science Guangdong University of Technology Guangdong Provincial Key Laboratory of Public Finance and Taxation with Big Data Application Guangzhou China Peng Cheng Laboratory Shenzhen518066 China The School of Computing and Information Systems Singapore Management University 178902 Singapore A*STAR 138632 Singapore The College of Science Shantou University Shantou515063 China

Graphs can model complicated interactions between entities, which naturally emerge in many important applications. These applications can often be cast into standard graph learning tasks, in which a crucial step is to learn low-dimensional graph representations. Graph neural networks (GNNs) are currently the most popular model in graph embedding approaches. However, standard GNNs in the neighborhood aggregation paradigm suffer from limited discriminative power in distinguishing high-order graph structures as opposed to low-order structures. To capture high-order structures, researchers have resorted to motifs and developed motif-based GNNs. However, existing motif-based GNNs still often suffer from less discriminative power on high-order structures. To overcome the above limitations, we propose Motif Graph Neural Network (MGNN), a novel framework to better capture high-order structures, hinging on our proposed motif redundancy minimization operator and injective motif combination. First, MGNN produces a set of node representations w.r.t. each motif. The next phase is our proposed redundancy minimization among motifs which compares the motifs with each other and distills the features unique to each motif. Finally, MGNN performs the updating of node representations by combining multiple representations from different motifs. In particular, to enhance the discriminative power, MGNN utilizes an injective function to combine the representations w.r.t. different motifs. We further show that our proposed architecture increases the expressive power of GNNs with a theoretical analysis. We demonstrate that MGNN outperforms state-of-the-art methods on seven public benchmarks on both node classification and graph classification tasks. Copyright © 2021, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Detection of COVID-19 by GoogLeNet-COD 16th

Detection of COVID-19 by GoogLeNet-COD

引用

16th International Conference on Intelligent computing, ICIC 2020

作者： Yu, Xiang Wang, Shui-Hua Zhang, Xin Zhang, Yu-Dong School of Informatics University of Leicester LeicesterLE1 7RH United Kingdom Guangxi Key Laboratory of Trusted Software Guilin University of Electronic Technology Guilin541004 China Department of Medical Imaging The Fourth People’s Hospital of Huai’an Huai’anJiangsu Province223002 China Department of Information Systems Faculty of Computing and Information Technology King Abdulaziz University Jeddah21589 Saudi Arabia

ISBN: (纸本)9783030607982

The outbreak of COVID-19 has been striking the world for months and caused hundreds of thousands of mortality. Early and accurate detection turns out to be one of the most effective ways to slow the spreading of the virus. To help radiologists interpret images, we developed an automatic CT image-based detection system, which achieved high accuracy on the detection of COVID-19. The proposed model in the detection system is codenamed GoogLeNet-COD, which utilizes one of the state-of-the-art deep convolutional neural networks GooLeNet as the backbone. As GoogLeNet was initially trained on ImageNet, we first replaced the last top two layers with four new layers, which include the dropout layer, two fully-connected layers and the output layer. The dropout technique is utilized to prevent overfitting in the system by inserting a dropout layer in the network. The newly added fully-connected layer serves as a transitional layer that prevents significant information loss while the last fully-connected layer is used to generate possibilities for the final output layer. The hold-out validation method is used to evaluate the performance of the proposed system. The experiment on a private COVID-19 dataset showed a high accuracy of our system. © 2020, Springer Nature Switzerland AG.

关键词： COVID-19

来源：评论

学校读者我要写书评

暂无评论

A bi-level formulation for label noise learning with spectral cluster discovery 29

A bi-level formulation for label noise learning with spectra...

引用

29th International Joint Conference on Artificial Intelligence, IJCAI 2020

作者： Luo, Yijing Han, Bo Gong, Chen PCA Lab Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education School of Computer Science and Engineering Nanjing University of Science and Technology China Jiangsu Key Lab of Image Video Understanding for Social Security China Department of Computer Science Hong Kong Baptist University Hong Kong Department of Computing Hong Kong Polytechnic University Hong Kong

ISBN: (纸本)9780999241165

Practically, we often face the dilemma that some of the examples for training a classifier are incorrectly labeled due to various subjective and objective factors. Although intensive efforts have been put to design classifiers that are robust to label noise, most of the previous methods have not fully utilized data distribution information. To address this issue, this paper introduces a bi-level learning paradigm termed "Spectral Cluster Discovery" (SCD) for combating with noisy labels. Namely, we simultaneously learn a robust classifier (Learning stage) by discovering the low-rank approximation to the ground-truth label matrix and learn an ideal affinity graph (Clustering stage). Specifically, we use the learned classifier to assign the examples with similar label to a mutual cluster. Based on the cluster membership, we use the learned affinity graph to explore the noisy examples based on the cluster membership. Both stages will reinforce each other iteratively. Experimental results on typical benchmark and real-world datasets verify the superiority of SCD to other label noise learning methods. © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Pulsar candidate selection using ensemble networks for FAST drift-scan survey

引用

Science China(Physics,Mechanics & Astronomy) 2019年第5期62卷 61-70页

作者： HongFeng Wang WeiWei Zhu Ping Guo Di Li SiBo Feng Qian Yin ChenChen Miao ZhenZhao Tao ZhiChen Pan Pei Wang Xin Zheng XiaoDan Deng ZhiJie Liu XiaoYao Xie XuHong Yu ShanPing You Hui Zhang FAST Collaboration Image Processing and Pattern Recognition Laboratory College of Information Science and TechnologyBeijing Normal UniversityBeijing 100875China CAS Key Laboratory of FAST Chinese Academy of SciencesBeijing 100101China School of Information Management Dezhou UniversityDezhou 253023China Image Processing and Pattern Recognition Laboratory School of Systems ScienceBeijing Normal UniversityBeijing 100875China University of Chinese Academy of Sciences Beijing 100049China Key Laboratory of Information and Computing Science Guizhou Province Guizhou Normal UniversityGuiyang 550001China School of Physics and Electronic Science Guizhou Normal UniversityGuiyang 550001China 不详

The Commensal Radio Astronomy Five-hundred-meter Aperture Spherical radio Telescope(FAST) Survey(CRAFTS) utilizes the novel drift-scan commensal survey mode of FAST and can generate billions of pulsar candidate signals. The human experts are not likely to thoroughly examine these signals, and various machine sorting methods are used to aid the classification of the FAST candidates. In this study, we propose a new ensemble classification system for pulsar candidates. This system denotes the further development of the pulsar image-based classification system(PICS), which was used in the Arecibo Telescope pulsar survey, and has been retrained and customized for the FAST drift-scan survey. In this study, we designed a residual network model comprising 15 layers to replace the convolutional neural networks(CNNs) in PICS. The results of this study demonstrate that the new model can sort >96% of real pulsars to belong the top 1% of all candidates and classify >1.6 million candidates per day using a dual-GPU and 24-core computer. This increased speed and efficiency can help to facilitate real-time or quasi-real-time processing of the pulsar-search data stream obtained from CRAFTS. In addition, we have published the labeled FAST data used in this study online, which can aid in the development of new deep learning techniques for performing pulsar searches.

关键词： pulsars neural networks data analysis

来源：评论

学校读者我要写书评

暂无评论

Secure and Privacy-Preserving Automated Machine Learning Operations into End-to-End Integrated IoT-Edge-Artificial Intelligence-Blockchain Monitoring System for Diabetes Mellitus Prediction

arXiv

引用

arXiv 2022年

作者： Hennebelle, Alain Ismail, Leila Materwala, Huned Kaabi, Juma Al Ranjan, Priya Janardhanan, Rajiv School of Computing and Information Systems The University of Melbourne Australia Research Laboratory Department of Computer Science and Software Engineering College of Information Technology United Arab Emirates University United Arab Emirates National Water and Energy Center United Arab Emirates University United Arab Emirates College of Health Sciences Department of Internal Medicine United Arab Emirates University United Arab Emirates Mediclinic Al Ain Abu Dhabi United Arab Emirates Bhubaneswar Institute of Technology India Faculty of Medical & Health Sciences SRM Institute of Science & Technology India

Diabetes Mellitus, one of the leading causes of death worldwide, has no cure to date and can lead to severe health complications, such as retinopathy, limb amputation, cardiovascular diseases, and neuronal disease, if left untreated. Consequently, it becomes crucial to take precautionary measures to avoid/predict the occurrence of diabetes. Machine learning approaches have been proposed and evaluated in the literature for diabetes prediction. This paper proposes an IoT-edge-Artificial Intelligence (AI)-blockchain system for diabetes prediction based on risk factors. The proposed system is underpinned by the blockchain to obtain a cohesive view of the risk factors data from patients across different hospitals and to ensure security and privacy of the user’s data. Furthermore, we provide a comparative analysis of different medical sensors, devices, and methods to measure and collect the risk factors values in the system. Numerical experiments and comparative analysis were carried out between our proposed system, using the most accurate random forest (RF) model, and the two most used state-of-the-art machine learning approaches, Logistic Regression (LR) and Support Vector Machine (SVM), using three real-life diabetes datasets. The results show that the proposed system using RF predicts diabetes with 4.57% more accuracy on average compared to LR and SVM, with 2.87 times more execution time. Data balancing without feature selection does not show significant improvement. The performance is improved by 1.14% and 0.02% after feature selection for PIMA Indian and Sylhet datasets respectively, while it reduces by 0.89% for MIMIC III. © 2022, CC BY.

关键词： Logistic regression

来源：评论

学校读者我要写书评

暂无评论

StateConsisIV: A Privacy-preserving Integrity Verification Method for cloud Components Based on a Novel State Consistency Feature

StateConsisIV: A Privacy-preserving Integrity Verification M...

引用

IEEE International Conference on Data Science in Cyberspace (DSC)

作者： Peiru Fan Chonghua Wang Jun Li Bo Zhao Zhaoxu Ji China Industrial Control Systems Cyber Emergency Response Team Beijing China Key Laboratory of Aerospace Information Security and Trusted Computing School of Cyber Science and Engineering Wuhan University WuHan China

ISBN: (数字)9781728195582

ISBN: (纸本)9781728195599

Plain proofs (e.g., raw logs, report, etc.) are significant and effective for integrity verification. In our analysis and comparison of existing work, we found most of them did not employ any protection mechanisms on the proofs. However, these proofs contain sensitive information, which may cause privacy leakage risks when the third party verifier (TPV) is compromised. The situation is even worse when the verification objects are cloud components. Motivated by this, we present StateConsisIV, a privacy-preserving integrity verification method based on a novel state consistency feature to address the privacy leakage problem. The core idea of our work is to enable the integrity judgment through encrypted proofs, withholding plain proofs inside the cloud only to reduce attack surface and enhance privacy. In specific, we employ random transformation algorithm on cloud nodes to encrypt proofs on their birth places. Besides, we design a novel state consistency feature based on the deployment and operation pattern of structural cloud components and perform feature analysis on TPV to guarantee an accurate integrity judgment result. We evaluate our approach on one typical dataset. The experimental results show that our method is considered more worthy with a little bit of extra computation overhead.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：