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

Ancient Character Recognition: A Novel Image dataset of Shui Manuscript Characters and Classification Model

Chinese Journal of Electronics 2023年第1期32卷 64-75页

作者： TANG Minli XIE Shaomin LIU Xiangrong Department of Computer Science and Technology School of Informatics Xiamen University School of Big Data Engineering KaiLi University Key Laboratory of Digital Protection and Intelligent Processing of Intangible Cultural Heritage of Fujian and Taiwan Ministry of Culture and Tourism Xiamen University

Shui manuscripts are part of the national intangible cultural heritage of China. Owing to the particularity of text reading, the level of informatization and intelligence in the protection of Shui manuscript culture is not adequate. To address this issue, this study created Shuishu＿C, the largest image dataset of Shui manuscript characters that has been reported. Furthermore, after extensive experimental validation, we proposed ShuiNet-A,a lightweight artificial neural network model based on the attention mechanism, which combines channel and spatial dimensions to extract key features and finally recognize Shui manuscript characters. The effectiveness and stability of ShuiNet-A were verified through multiple sets of experiments. Our results showed that, on the Shui manuscript dataset with 113 categories, the accuracy of ShuiN et-A was 99.8%, which is 1.5% higher than those of similar studies. The proposed model could contribute to the classification accuracy and protection of ancient Shui manuscript characters.

关键词： Training Speech recognition Artificial neural networks Feature extraction Stability analysis Character recognition Machine translation

来源：评论

学校读者我要写书评

暂无评论

Accumulative Time Based Ranking Method to Reputation Evaluation in Information Networks

引用

Journal of Computer science & Technology 2022年第4期37卷 960-974页

作者： Hao Liao Qi-Xin Liu Ze-Cheng Huang Ke-Zhong Lu Chi Ho Yeung Yi-Cheng Zhang National Engineering Laboratory on Big Data System Computing Technology College of Computer Science and SoftwareEngineeringShenzhen UniversityShenzhen 518060China Guangdong Province Key Laboratory of Popular High Performance Computers Shenzhen UniversityShenzhen 518060China Guangdong Province Engineering Center of China-Made High Performance Data Computing System College of ComputerScience and Software EngineeringShenzhen UniversityShenzhen 518060China Institute of Big Data Intelligent Management and Decision Shenzhen UniversityShenzhen 518060China Department of Science and Environmental Studies The Education University of Hong KongHong Kong 999077China Department of Physics University of FribourgFribourg 1700Switzerland

Due to over-abundant information on the Web, information filtering becomes a key task for online users to obtain relevant suggestions and how to extract the most related item is always a key topic for researchers in various fields. In this paper, we adopt tools used to analyze complex networks to evaluate user reputation and item quality. In our proposed Accumulative Time Based Ranking (ATR) algorithm, we take into account the growth record of the network to identify the evolution of the reputation of users and the quality of items, by incorporating two behavior weighting factors which can capture the hidden facts on reputation and quality dynamics for each user and item respectively. Our proposed ATR algorithm mainly combines the iterative approach to rank user reputation and item quality with temporal dependence compared with other reputation evaluation methods. We show that our algorithm outperforms other benchmark ranking algorithms in terms of precision and robustness on empirical datasets from various online retailers and the citation datasets among research publications. Therefore, our proposed method has the capability to effectively evaluate user reputation and item quality.

关键词： temporal network behavior dynamics reputation evaluation ranking algorithm

来源：评论

学校读者我要写书评

暂无评论

A Comprehensive Study of OOP-Related Bugs in C++ Compilers

引用

IEEE Transactions on Software Engineering 2025年 1-21页

作者： Wang, Bo Chen, Chong Chen, Junjie Xu, Bowen Ye, Chen Lin, Youfang Dong, Guoliang Sun, Jun Beijing Jiaotong University School of Computer Science and Technology Beijing100044 China Beijing Key Laboratory of Traffic Data Mining and Embodied Intelligence China Tianjin University College of Intelligence and Computing Tianjin300350 China North Carolina State University Department of Computer Science NC27695 United States Singapore Management University School of Computing and Information Systems Singapore178902 Singapore

Modern C++, a programming language characterized by its extensive use of object-oriented programming (OOP) features, is widely used for system programming. However, C++ compilers often struggle to correctly handle these sophisticated OOP features, resulting in numerous high-profile compiler bugs that can lead to crashes or miscompilation. Despite the significance of OOP-related bugs, existing studies largely overlook OOP features, hindering their ability to discover such bugs. To assist both compiler fuzzer designers and compiler developers, we conduct a comprehensive study of the compiler bugs caused by incorrectly handling C++ OOP-related features. First, we systematically extract 788 OOP-related C++ compiler bugs from GCC and LLVM. Second, derived from the core concepts of OOP and C++, we manually identified a two-level taxonomy of the OOP-related features leading to compiler bugs, which consists of 6 primary categories (e.g., Abstraction & Encapsulation, Inheritance, and Runtime Polymorphism), along with 17 secondary categories (e.g., Constructors & Destructors and Multiple Inheritance). Third, we systematically analyze the root causes, symptoms, fixes, options, and C++ standard versions of these bugs. Our analysis yields 13 key findings, highlighting that features related to the construction and destruction of objects lead to the highest number of bugs, crashes are the most frequent symptom, and while the average time from bug introduction to discovery is 1856 days, fixing the bug once discovered takes only 174 days on average. Additionally, more than half of the bugs can be triggered without any compiler options. These findings offer valuable insights not only for developing new compiler testing approaches but also for improving language design and compiler engineering. Inspired by these findings, we developed a proof-of-concept compiler fuzzer OOPFuzz, specifically targeting OOP-related bugs in C++ compilers. We applied it against the newest release versions

关键词： C++ (programming language)

来源：评论

学校读者我要写书评

暂无评论

Robust Latent Factor Analysis for Precise Representation of High-Dimensional and Sparse data

引用

IEEE/CAA Journal of Automatica Sinica 2021年第4期8卷 796-805页

作者： Di Wu Xin Luo the Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent TechnologyChinese Academy of SciencesChongqing 400714 the Chongqing School University of Chinese Academy of SciencesChongqing 400714China

High-dimensional and sparse(HiDS)matrices commonly arise in various industrial applications,e.g.,recommender systems(RSs),social networks,and wireless sensor *** they contain rich information,how to accurately represent them is of great significance.A latent factor(LF)model is one of the most popular and successful ways to address this *** LF models mostly adopt L2-norm-oriented Loss to represent an HiDS matrix,i.e.,they sum the errors between observed data and predicted ones with *** L2-norm is sensitive to outlier ***,outlier data usually exist in such *** example,an HiDS matrix from RSs commonly contains many outlier ratings due to some heedless/malicious *** address this issue,this work proposes a smooth L1-norm-oriented latent factor(SL-LF)*** main idea is to adopt smooth L1-norm rather than L2-norm to form its Loss,making it have both strong robustness and high accuracy in predicting the missing data of an HiDS *** results on eight HiDS matrices generated by industrial applications verify that the proposed SL-LF model not only is robust to the outlier data but also has significantly higher prediction accuracy than state-of-the-art models when they are used to predict the missing data of HiDS matrices.

关键词： High-dimensional and sparse matrix L1-norm L2 norm latent factor model recommender system smooth L1-norm

来源：评论

学校读者我要写书评

暂无评论

Loading uniform Ag_(3)PO_(4)nanoparticles on three-dimensional peony-like WO_(3)for good stability and excellent selectivity towards NH_(3)at room temperature

引用

Chinese Physics B 2023年第8期32卷 251-259页

作者：邵星炎贾福超刘婷婷刘健诚王小梅尹广超吕娜周通 Ramachandran Rajan 刘波 Laboratory of Functional Molecules and Materials School of Physics and Optoelectronic EngineeringShandong University of TechnologyZibo 255000China School of Material Science and Engineering Shandong University of TechnologyZibo 255000China Provincial Key Laboratory of Network Based Intelligent Computing University of JinanJinan 250022China Translational Medical Center Zibo Central HospitalZibo 255036China

A heterojunction structure design is a very good method for improving the properties of semiconductors in many research *** method is employed in the present study to promote the gas-sensing performance of Ag_(3)PO_(4)nanocomposites at room temperature(25℃).A nanocomposite of Ag_(3)PO_(4)nanoparticles and three-dimensional peony-like WO_(3)(WO_(3)/Ag_(3)PO_(4))was successfully prepared by the precipitation *** crystalline phases were analyzed by xray diffraction and the microstructure was characterized by scanning electron microscopy and transmission electron *** chemical bonding states were analyzed by x-ray photoelectron *** gas-sensing performance of WO_(3)/Ag_(3)PO_(4)sensors was systematically explored at room *** composite sensors possessed a higher response and lower detection limit(1 ppm)to NH_(3)than those made of a single type of material;this is ascribed to the synergistic effect achieved by the heterojunction *** the different composite sensors tested,gas sensor A5W5(Ag_(3)PO_(4):WO3mass ratio of 5:5)displayed the highest response to NH_(3)at room ***,the A5W5 gas sensor exhibited relatively good stability and excellent selectivity to NH_(3).The A5W5 sensor also displayed a relatively good response under high *** gas-sensing mechanism of the WO_(3)/Ag_(3)PO_(4)sensors is explained in *** together,the as-prepared sensor is highly efficient at detecting NH_(3)and could be suitable for practical *** addition,this study also provides a new method for developing Ag_(3)PO_(4)-based sensors in the gas-sensing field.

关键词： Ag_(3)PO_(4) peony-like WO_(3) NH_(3) room temperature

来源：评论

学校读者我要写书评

暂无评论

Blockchain-Based Multi-Cloud data Storage System Disaster Recovery

Blockchain-Based Multi-Cloud Data Storage System Disaster Re...

引用

2023 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2023

作者： Wang, Feiyu Zhou, Jian-Tao College of Computer Science Inner Mongolia University Inner Mongolia Hohhot China Engineering Research Center of Ecological Big Data Ministry of Education Natl. Loc. Jt. Eng. Research Center of Intelligent Information Processing Technology for Mongolian 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 China

ISBN: (纸本)9798350337020

Cloud storage services have been used by most businesses and individual users. However, data loss, service interruptions and cyber attacks often lead to cloud storage services not being provided properly, and these incidents have caused financial losses to users. Second, traditional and single-cloud model disaster recovery services are no longer suitable for the current complex cloud storage systems. Therefore, a scheme to provide disaster recovery for cloud storage services in a multi-cloud storage environment is needed in real production. In this paper, we propose a disaster recovery scheme based on blockchain technology. The proposed scheme outlined in this study aims to address the issue of data availability within the cloud storage landscape. The proposed scheme achieves this goal by dividing data into hot and cold categories, verifying the integrity of copy data via blockchain technology, and utilizing blockchain networks to manage multi-cloud storage systems. Experimental findings demonstrate that the proposed scheme yields superior results in terms of computation and time overheads. © 2023 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

FreqBlender: Enhancing DeepFake Detection by Blending Frequency Knowledge 38

FreqBlender: Enhancing DeepFake Detection by Blending Freque...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Li, Hanzhe Zhou, Jiaran Li, Yuezun Wu, Baoyuan Li, Bin Dong, Junyu School of Computer Science and Technology Ocean University of China China School of Data Science The Chinese University of Hong Kong Shenzhen China Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen China

Generating synthetic fake faces, known as pseudo-fake faces, is an effective way to improve the generalization of DeepFake detection. Existing methods typically generate these faces by blending real or fake faces in spatial domain. While these methods have shown promise, they overlook the simulation of frequency distribution in pseudo-fake faces, limiting the learning of generic forgery traces in-depth. To address this, this paper introduces FreqBlender, a new method that can generate pseudo-fake faces by blending frequency knowledge. Concretely, we investigate the major frequency components and propose a Frequency Parsing Network to adaptively partition frequency components related to forgery traces. Then we blend this frequency knowledge from fake faces into real faces to generate pseudo-fake faces. Since there is no ground truth for frequency components, we describe a dedicated training strategy by leveraging the inner correlations among different frequency knowledge to instruct the learning process. Experimental results demonstrate the effectiveness of our method in enhancing DeepFake detection, making it a potential plug-and-play strategy for other methods. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A NEW GLOBAL OPTIMIZATION ALGORITHM FOR MIXED-INTEGER QUADRATICALLY CONSTRAINED QUADRATIC FRACTIONAL PROGRAMMING PROBLEM

引用

Journal of Computational Mathematics 2024年第3期42卷 784-813页

作者： Bo Zhang Yuelin Gao Xia Liu Xiaoli Huang School of Civil and Hydraulic Engineering School of Mathematics and StatisticsNingxia UniversityYinchuan 750021China School of Mathematics and Information Science North Minzu UniversityYinchuan 750021China Ningxia Province Key Laboratory of Intelligent Information and Data Processing Yinchuan 750021China School of Mathematics and Statistics Ningxia UniversityYinchuan 750021China

The mixed-integer quadratically constrained quadratic fractional programming(MIQCQFP)problem often appears in various fields such as engineering practice,management science and network ***,most of the solutions to such problems are often designed for their unique *** paper puts forward a new global optimization algorithm for solving the problem *** first convert the MIQCQFP into an equivalent generalized bilinear fractional programming(EIGBFP)problem with integer ***,we linearly underestimate and linearly overestimate the quadratic functions in the numerator and the denominator respectively,and then give a linear fractional relaxation technique for EIGBFP on the basis of non-negative *** that,combining rectangular adjustment-segmentation technique and midpointsampling strategy with the branch-and-bound procedure,an efficient algorithm for solving MIQCQFP globally is ***,a series of test problems are given to illustrate the effectiveness,feasibility and other performance of this algorithm.

关键词： Global optimization Branch and bound Quadratic fractional programming Mixed integer programming

来源：评论

学校读者我要写书评

暂无评论

Distributed Platooning Control of Automated Vehicles Subject to Replay Attacks Based on Proportional Integral Observers

引用

IEEE/CAA Journal of Automatica Sinica 2024年第9期11卷 1954-1966页

作者： Meiling Xie Derui Ding Xiaohua Ge Qing-Long Han Hongli Dong Yan Song Department of Control Science and Engineering University of Shanghai for Science and TechnologyShanghai 200093China School of Science Computing and Engineering TechnologiesSwinburne University of TechnologyMelbourne VIC 3122Australia Artificial Intelligence Energy Research Institute Northeast Petroleum UniversityDaqing 163318the Heilongjiang Provincial Key Laboratory of Networking and Intelligent ControlNortheast Petroleum UniversityDaqing 163318 Sanya Offshore Oil&Gas Research Institute Northeast Petroleum UniversitySanya 572024China

Secure platooning control plays an important role in enhancing the cooperative driving safety of automated vehicles subject to various security *** paper focuses on the distributed secure control issue of automated vehicles affected by replay attacks.A proportional-integral-observer(PIO)with predetermined forgetting parameters is first constructed to acquire the dynamical information of ***,a time-varying parameter and two positive scalars are employed to describe the temporal behavior of replay *** light of such a scheme and the common properties of Laplace matrices,the closed-loop system with PIO-based controllers is transformed into a switched and time-delayed ***,some sufficient conditions are derived to achieve the desired platooning performance by the view of the Lyapunov stability *** controller gains are analytically determined by resorting to the solution of certain matrix inequalities only dependent on maximum and minimum eigenvalues of communication ***,a simulation example is provided to illustrate the effectiveness of the proposed control strategy.

关键词： Automated vehicles platooning control proportional-integral-observers(PIOs) replay attacks time-delays

来源：评论

学校读者我要写书评

暂无评论

Novel camera self-calibration method with clustering prior and nonlinear optimization from an image sequence

引用

Multimedia Tools and Applications 2024年第42期83卷 90553-90572页

作者： Jiang, Xiaohui Zhu, Haijiang An, Ning Xie, Binjian Wei, Hao Tang, Fulin Wu, Yihong College of Information Science and Technology Beijing University of Chemical Technology Beijing100029 China State Key Laboratory of Multimodal Artificial Intelligence Institute of Automation Chinese Academy of Sciences Beijing100190 China State Key Laboratory of Intelligent Coal Mining and Strata Control Beijing100013 China Research Institute of Mine Big Data China Coal Research Institute Beijing100013 China

In many 3D reconstruction, Simultaneous Localization and Mapping (SLAM), AR, and VR systems, the camera focal length constantly changes slightly due to loose hardware, causing their performances to deteriorate. To address this problem, we propose a novel camera self-calibration method that incorporates clustering prior and nonlinear optimization. By leveraging the Kruppa equation, we roughly estimate multiple analytical solutions for the camera focal length from an image sequence. Then, robust clustering based on the Gaussian mixture model is introduced to obtain an initial camera focal length value. Finally, a nonlinear cost function is proposed to refine the initial camera focal length value. Extensive experimental results on simulation and real data demonstrate that the proposed method outperforms the state-of-the-art methods, exhibiting good robustness and high accuracy. Moreover, the proposed method can be used in real-time videos for SLAM systems. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：