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

4th International Symposium on Emerging Technologies for Education, SETE 2019, was held in conjunction with the 18th International Conference on Web-based Learning, ICWL 2019

作者： Jiang, Jilu Wu, Baoxian Chang, Liang Liu, Kui Hao, Tianyong Audit Governance and Risk Control Research Center School of Accounting Guangdong University of Foreign Studies Guangzhou China Guangzhou Key Laboratory of Big Data and Intelligent Education School of Computer Science South China Normal University Guangzhou China Network and Modern Educational Technology Center Guangzhou University Guangzhou China

ISBN: (纸本)9783030387778

Online examination has been used more and more widely in the education and other fields due to its advantages of efficiency, convenience, and fairness. This paper proposes a new web-based online examination system, which utilizes PHP, Ajax and other technologies to implement online examination functions, including testing question collection, user management, online testing, real-time score calculation, answer checking, and result analysis. Particularly, an automated test paper generation module was designed and integrated. The system has been applied to a course involving more than 1000 students per semester at Guangzhou University of Foreign Studies. It has been proved to save efforts of teachers and students, demonstrating its effectiveness in assisting teaching and learning. © Springer Nature Switzerland AG 2020.

关键词： E-learning

来源：评论

学校读者我要写书评

暂无评论

A parameter adaptive differential evolution based on depth information

A parameter adaptive differential evolution based on depth i...

引用

作者： Meng, Zhenyu Yang, Cheng Meng, Fanjia Chen, Yuxin Lin, Fang Institute of Artificial Intelligence Fujian University of Technology Fuzhou China Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology Fuzhou China Intelligent Information Processing Research Center Fujian University of Technology Fuzhou China Guanzhuang Central Primary School of Zhangqiu District Jinan China

Differential Evolution (DE) was an easy-coding and efficient stochastic algorithm for global optimization, and the whole optimization process simulates biological evolution. Superior individuals of the population that were suitable for the environment were retained during the evolution, and consequently the tolerable solutions could be obtained in the end. Despite the excellent performance of DE algorithm, there were still some shortcomings. For example, the general performance of DE depended largely on mutation strategy and control parameters, how to design the appropriate control parameters and mutation strategy were difficult tasks. Here a novel DE variant was proposed to overcome these shortcomings. By incorporating the depth information of previous generations of populations, a better diversity of trial vector candidates could be secured during the evolution process. Moreover, the thought that successful parameters should be retained to guide the update of themselves during the evolution was also incorporated into the novel algorithm. The optimization performance of the new proposed DE variant was verified under CEC 2013 test suit containing 28 benchmarks, and the results showed its competitiveness with several state-of-the-art DE variants. © 2020 - IOS Press and the authors. All rights reserved.

关键词： Global optimization

来源：评论

学校读者我要写书评

暂无评论

Adversarial Learning with Cost-Sensitive Classes

arXiv

引用

arXiv 2021年

作者： Shen, Haojing Chen, Sihong Wang, Ran Wang, Xizhao Big Data Institute College of Computer Science and Software Engineering Guangdong Key Lab. of Intelligent Information Processing Shenzhen University Guangdong Shenzhen518060 China The College of Mathematics and Statistics Shenzhen University Shenzhen518060 China The Shenzhen Key Laboratory of Advanced Machine Learning and Applications Shenzhen University Shenzhen518060 China

It is necessary to improve the performance of some special classes or to particularly protect them from attacks in adversarial learning. This paper proposes a framework combining cost-sensitive classification and adversarial learning together to train a model that can distinguish between protected and unprotected classes, such that the protected classes are less vulnerable to adversarial examples. We find in this framework an interesting phenomenon during the training of deep neural networks, called Min-Max property, that is, the absolute values of most parameters in the convolutional layer approach zero while the absolute values of a few parameters are significantly larger becoming bigger. Based on this Min-Max property which is formulated and analyzed in a view of random distribution, we further build a new defense model against adversarial examples for adversarial robustness improvement. An advantage of the built model is that it performs better than the standard one and can combine with adversarial training to achieve an improved performance. It is experimentally confirmed that, regarding the average accuracy of all classes, our model is almost as same as the existing models when an attack does not occur and is better than the existing models when an attack occurs. Specifically, regarding the accuracy of protected classes, the proposed model is much better than the existing models when an attack occurs. © 2021, CC BY.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Industrial Region Planning and Urban Transportation Planning Based on Industry-City Integration

Industrial Region Planning and Urban Transportation Planning...

引用

International Conference on Transportation Information and Safety (ICTIS)

作者： Shuai Zheng Yugang Liu Jia Zhang Qing Wan Heyang Zhang Jinsong Ye Southwest Jiaotong University School of Transportation and Logistics Chengdu China National United Engineering Laboratory of Integrated Intelligent TransPortation Southwest Jiaotong University Chengdu China Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport China Academy of Transportation Sciences Beijing P. R. China

ISBN: (纸本)9781665497145

With urban expansion and economic development, traditional industrial parks with single function cannot adapt to the pace of urban development. As a new type of industrial park, the industry-city integration has gradually become the development direction. There is no tailor-made quantitative planning scheme at this stage. Aiming at filling the gap, this research does the following work to provide quantitative guidance strategy for industrial park planning. This paper first analyzes the Transit-oriented development (TOD) model requirements of new industrial parks, and makes a detailed analysis of the interaction between land use and transportation. Secondly, based on the relationship between land use and transportation, a combined feedback model of the land planning model and the public transportation utility allocation model is established. The process of modeling is to plan the smallest land unit according to the principle of land use function combination and land use type to meet the needs of residents. The other is to plan public transportation with optimal road load according to the principle of public transportation guiding travel and maximizing travel efficiency. Notedly, this paper uses the TOPSIS method to normalize the planning score through the feedback relationship between land use planning and public transportation planning. Based the analysis, the genetic algorithm is used to optimize the planning score and obtain the best plan which provides quantitative guidance strategies for the industrial park planning. Finally, this paper selects the “Blank Land” of Suzhou Industrial Parks for case analysis, and the best standardized score after planning is about 87 points. In order to further analyze the planning effect and the relationship between the planned area and the rest of the land, ArcGIS is used to carry out demand analysis and land use radiation range analysis of the planning scheme. The results show that the travel demand after planning matches with t

关键词： Analytical models Costs Roads Land use planning Transforms Planning Safety

来源：评论

学校读者我要写书评

暂无评论

Regional attention with architecture-rebuilt 3D network for RGB-D gesture recognition

arXiv

引用

arXiv 2021年

作者： Zhou, Benjia Li, Yunan Wan, Jun Macau University of Science and Technology China National Laboratory of Pattern Recognition Institute of Automation Chinese Academy of Sciences Beijing China School of Computer Science and Technology Xidian Univeristy China Xi'an Key Laboratory of Big Data and Intelligent Vision China School of Artificial Intelligence University of Chinese Academy of Sciences Beijing China

Human gesture recognition has drawn much attention in the area of computer vision. However, the performance of gesture recognition is always influenced by some gesture-irrelevant factors like the background and the clothes of performers. Therefore, focusing on the regions of hand/arm is important to the gesture recognition. Meanwhile, a more adaptive architecture-searched network structure can also perform better than the block-fixed ones like ResNet since it increases the diversity of features in different stages of the network better. In this paper, we propose a regional attention with architecture-rebuilt 3D network (RAAR3DNet) for gesture recognition. We replace the fixed Inception modules with the automatically rebuilt structure through the network via Neural Architecture Search (NAS), owing to the different shape and representation ability of features in the early, middle, and late stage of the network. It enables the network to capture different levels of feature representations at different layers more adaptively. Meanwhile, we also design a stackable regional attention module called Dynamic-Static Attention (DSA), which derives a Gaussian guidance heatmap and dynamic motion map to highlight the hand/arm regions and the motion information in the spatial and temporal domains, respectively. Extensive experiments on two recent large-scale RGB-D gesture datasets validate the effectiveness of the proposed method and show it outperforms state-of-the-art methods. The codes of our method are available at: https://***/zhoubenjia/RAAR3DNet. Copyright © 2021, The Authors. All rights reserved.

关键词： Large dataset

来源：评论

学校读者我要写书评

暂无评论

Community-based message forwarding in mobile social networks

Community-based message forwarding in mobile social networks

引用

2019 International Conference on Advances in Computer Technology, Information Science and Communications, CTISC 2019

作者： Chen, Zhiming Xiang, Yang School of Computer Nanjing University of Posts and Telecommunications Nanjing210023 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing210023 China

ISBN: (纸本)9789897583575

With the popularity of various smart devices and the application of sensor network technology, message transmission using mobile devices is becoming widespread. This paper focuses on the forwarding in mobile social network (MSN). The MSN is a special Delay Tolerant Network (DTN) consisting of mobile nodes. In MSN, nodes move and share information with each other through carried short-range wireless communication devices. Mobile nodes in the MSN typically access some building areas more frequently, such as schools, companies, or apartments, while visiting other areas, such as the roads between buildings, less frequently. The building areas that nodes frequently visit are called communities. To increase delivery ratio and reduce transmission time in MSN, this paper proposes a novel zero-knowledge multi-copy routing algorithm, Mixed Message Forwarding (MMF) which exploits and improves the metric, namely centrality. Centrality reflects the importance of a node in the network. MMF improves copy diffusion by using different directions of node movement as well. Special facilities called boundary boxes are added to the network scenario. Boundary boxes are special throw boxes. Throw boxes are relays with large storage space and fixed position. MMF is designed and evaluated, which utilizes the aforementioned boundary boxes to reduce transmission delay. The simulation results show that the MMF can improve the delivery ratio and reduce the transmission delay, compared with other algorithms. © 2019 by SCITEPRESS - Science and Technology Publications, Lda.

关键词： Delay tolerant networks

来源：评论

学校读者我要写书评

暂无评论

Simplifying graph contrastive learning with single feature fusion and column vector orthogonal noise

引用

Expert Systems with Applications 2025年 288卷

作者： Lan You Zhen Zhang Qingxi Peng Christophe Claramunt Xing Zeng Hong Jin School of Computer Science and Information Engineering Hubei University Wuhan430062 Key Laboratory of Intelligent Sensing System and Security (Hubei University) Ministry of Education Wuhan 430062 Hubei Key Laboratory of Big Data Intelligent Analysis and Application (Hubei University) Wuhan 430062 School of Information Engineering Wuhan College Wuhan 430212 China Computer Science Naval Academy Research Institute Lanveoc-Poulmic BP 600 Brest 29240 France Okinawa Institute of Science and Technology Japan

Graph Contrastive Learning (GCL) has shown promise in recommendation systems by improving representation quality through data augmentation and consistency objectives. However, conventional GCL frameworks rely on multi-channel augmentation, which introduces significant computational overhead and limits scalability. To address this, we propose Single Feature Fusion Graph Contrastive Learning (S-GCL), a non-parametric and lightweight framework that simplifies contrastive learning by applying single feature fusion to the final prediction embeddings within each mini-batch. To further enhance S-GCL, we introduce Column Vector Orthogonal Noise (CVON), a feature-level augmentation strategy that injects orthogonal noise into each dimensional feature within the embedding space. CVON enriches representations while preserving semantic integrity, and incurs minimal computational overhead. Its integration within the S-GCL framework yields the proposed SCGCL method. Extensive experiments conducted on six publicly available benchmark datasets validate the effectiveness and generalizability of SCGCL. Notably, integrating SCGCL into LightGCN leads to substantial gains in both training efficiency and recommendation accuracy. For example, on the large-scale Alibaba-iFashion dataset, our method improves Recall@20 by 29 % and NDCG@20 by 33 %, while reducing training time by an impressive 84 %.

关键词： Contrastive learning data augmentation Graph neural networks Recommendation systems

来源：评论

学校读者我要写书评

暂无评论

FuXi Weather: A data-to-forecast machine learning system for global weather

arXiv

引用

arXiv 2024年

作者： Sun, Xiuyu Zhong, Xiaohui Xu, Xiaoze Huang, Yuanqing Li, Hao Neelin, J. David Chen, Deliang Feng, Jie Han, Wei Wu, Libo Qi, Yuan Shanghai Academy of Artificial Intelligence for Science Shanghai200232 China Artificial Intelligence Innovation and Incubation Institute Fudan University Shanghai200433 China School of Atmospheric Physics Nanjing University of Information Science and Technology Nanjing210044 China Earth System Modeling and Prediction Centre China Meteorological Administration Beijing100081 China Department of Atmospheric and Oceanic Sciences University of California Los Angeles90095 United States Ministry of Education Key Laboratory for Earth System Modeling Department of Earth System Science Tsinghua University Beijing100084 China University of Gothenburg Gothenburg Sweden Department of Atmospheric and Oceanic Sciences Institute of Atmospheric Sciences Fudan University Shanghai200433 China School of Data Science Fudan University Shanghai200433 China Institute for Big Data Fudan University Shanghai200433 China MOE Laboratory for National Development and Intelligent Governance Fudan University Shanghai200433 China

Weather forecasting traditionally relies on numerical weather prediction (NWP) systems that integrates global observational systems, data assimilation (DA), and forecasting models. Despite steady improvements in forecast accuracy over recent decades, further advances are increasingly constrained by high computational costs, the underutilization of vast observational datasets, and the challenges of obtaining finer resolution. These limitations, alongside the uneven distribution of observational networks, result in global disparities in forecast accuracy, leaving some regions vulnerable to extreme weather. Recent advances in machine learning present a promising alternative, providing more efficient and accurate forecasts using the same initial conditions as NWP. However, current machine learning models still depend on the initial conditions generated by NWP systems, which require extensive computational resources and expertise. Here we introduce FuXi Weather, a machine learning weather forecasting system that assimilates data from multiple satellites. Operating on a 6-hourly DA and forecast cycle, FuXi Weather generates reliable and accurate 10-day global weather forecasts at a spatial resolution of 0.25◦. FuXi Weather is the first system to achieve all-grid, all-surface, all-channel, and all-sky DA and forecasting, extending skillful forecast lead times beyond those of the European Centre for Medium-range Weather Forecasts (ECMWF) high-resolution forecasts (HRES) while using significantly fewer observations. FuXi Weather consistently outperforms ECMWF HRES in observation-sparse regions, such as central Africa, demonstrating its potential to improve forecasts where observational infrastructure is limited. © 2024, CC BY.

关键词： Weather forecasting

来源：评论

学校读者我要写书评

暂无评论

An improved Chinese text multi-label classification method based on CNN 13

An improved Chinese text multi-label classification method b...

引用

2020 13th International Conference on Computer and Electrical Engineering, ICCEE 2020

作者： Xin, Yuanxia Zhang, Zhi Collage of Computer Science and Technology Wuhan University of Science and Technology WuhanHubei430065 China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System WuhanHubei430065 China Big Data Science and Engineering Research Institute Wuhan University of Science and Technology WuhanHubei430065 China

Text multi-label classification technology can accurately and quickly classify text information into related categories or topics, and help people quickly locate the required content in massive information resources, which is of great significance in application. As the traditional classification algorithm is faced with the problems of low classification accuracy due to the low correlation of data labels, unbalanced label data and few short text feature words, this paper firstly performs hierarchical pre-processing on label data to transform multi-label classification into hierarchical text multi-classification. At the same time, an improved multi-label classification algorithm Multi-label Convolutional Neural Networks (ML-CNN) is proposed. Based on the TensorFlow framework, a CNN model is designed and different training models are constructed for each level of label classification. According to the number of classification levels, the output of the upper level label is stitched to the original input tail as the next level of input. Experiments on the description information of 500,000 Chinese products with labels, show that the improved algorithm will significantly improve the classification accuracy and the accuracy of each level can reach more than 88%, which proves the feasibility and effectiveness of the algorithm. © Published under licence by IOP Publishing Ltd.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Improving Chinese Character Representation with Formation Tree

SSRN

引用

SSRN 2024年

作者： Hong, Yang Li, Yinfei Qiao, Xiaojun Li, Rui Zhang, Junsong National Engineering Research Center for E-learning Central China Normal University No.152 Luoyu Road Hubei Wuhan430079 China Mind Art and Computation Group Department of Artificial Intelligence Xiamen University No. 4221 South Xiang’an Road Xiang’an District Fujian Xiamen361104 China National Engineering Research Center of Educational Big Data Central China Normal University No.152 Luoyu Road Hubei Wuhan430079 China Key Laboratory of Digital Protection and Intelligent Processing of Intangible Cultural Heritage of Fujian and Taiwan Xiamen University Ministry of Culture and Tourism Fujian Xiamen China

Learning effective representations for Chinese characters presents unique challenges, primarily due to the vast number of characters and their continuous growth, which requires models to handle an expanding category space. Additionally, the inherent sparsity of character usage complicates the generalization of learned representations. Prior research has explored radical-based sequences to overcome these issues, achieving progress in recognizing unseen characters. However, these approaches fail to fully exploit the inherent tree structure of such sequences. To address these limitations and leverage established data properties, we propose Formation Tree-CLIP (FT-CLIP). This model utilizes formation trees to represent characters and incorporates a dedicated tree encoder, significantly improving performance in both seen and unseen character recognition tasks. We further introduce masking for to both character images and tree nodes, enabling efficient and effective training. This approach accelerates training significantly (by a factor of 2 or more) while enhancing accuracy. Extensive experiments show that processing characters through formation trees aligns better with their inherent properties than direct sequential methods, significantly enhancing the generality and usability of the representations. © 2024, The Authors. All rights reserved.

关键词： Character recognition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：