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

arXiv 2023年

作者： Liu, Feifan Zhang, Shuang Xia, Haoxiang Institute of Systems Engineering Dalian University of Technology No.2 Linggong Road Liaoning Dalian116024 China Center for Big Data and Intelligent Decision-Making Dalian University of Technology Linggong Road Liaoning Dalian116024 China Institute for Advanced Intelligence Dalian University of Technology Linggong Road Liaoning Dalian116024 China Key Laboratory of Social Computing and Cognitive Intelligence Ministry of Education of China Linggong Road Liaoning Dalian116024 China

The selection of research topics by scientists can be viewed as an exploration process conducted by individuals with cognitive limitations traversing a complex cognitive landscape influenced by both individual and social factors. While existing theoretical investigations have provided valuable insights, the intricate and multifaceted nature of modern science hinders the implementation of empirical experiments. This study leverages advancements in deep learning techniques to investigate the patterns and dynamic mechanisms of topic-transition among scientists. By constructing the knowledge space across 6 large-scale disciplines, we depict the trajectories of scientists' topic transitions within this space, measuring the flow and distance of research regions across different sub-spaces. Our findings reveal a predominantly conservative pattern of topic transition at the individual level, with scientists primarily exploring local knowledge spaces. Furthermore, simulation modeling analysis identifies research intensity, driven by the concentration of scientists within a specific region, as the key facilitator of topic transition. Conversely, the knowledge distance between fields serves as a significant barrier to exploration. Notably, despite potential opportunities for breakthrough discoveries at the intersection of subfields, empirical evidence suggests that these opportunities do not exert a strong pull on scientists, leading them to favor familiar research areas. Our study provides valuable insights into the exploration dynamics of scientific knowledge production, highlighting the influence of individual cognition, social factors, and the intrinsic structure of the knowledge landscape itself. These findings offer a framework for understanding and potentially shaping the course of scientific progress. © 2023, CC BY-NC-ND.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

The Temporal Structural Pattern in Scientific Collaborative Behavior from the Perspective of Complex Network 23rd

The Temporal Structural Pattern in Scientific Collaborative...

引用

23rd International Symposium on Knowledge and Systems Sciences, KSS 2024

作者： Zholdoshbaeva, Elina Zhang, Shuang Liu, Feifan Xia, Haoxiang Institute of Systems Engineering Dalian University of Technology No. 2 Linggong Road Liaoning Dalian116024 China Center for Big Data and Intelligent Decision-Making Dalian University of Technology Linggong Road Liaoning Dalian116024 China School of Business East China University of Science and Technology 130 Meilong Road Xuhui District Shanghai200237 China Institute for Advanced Intelligence Dalian University of Technology Linggong Road Liaoning Dalian116024 China Key Laboratory of Social Computing and Cognitive Intelligence Ministry of Education of China Linggong Road Liaoning Dalian116024 China

ISBN: (纸本)9789819601776

The rapid advancement of science has underscored the importance of collaboration among scientists. While many studies have explored the structure of collaboration networks, there is a lack of comprehensive quantitative research on the temporal patterns of these collaborations. This study addresses this gap by analyzing temporal scientific collaboration networks in physics, spanning from 1960 to 2021, using complex network theories and methods. By constructing five-year temporal collaborative networks and employing metrics such as network diameter, shortest path, and clustering coefficient, this research reveals an increase in connectivity and small-world characteristics over time. Additionally, community detection highlights a shift towards specialized collaboration patterns and increased cross-community interactions. The study also uncovers growing centrality and social stratification within the research system, with the "rich club" phenomenon indicating strong and dynamic collaborations among highly connected scientists. Temporal analysis shows that while ultra-high connectivity scientists engage in fluctuating relationships, medium-high connectivity scientists maintain more stable collaborations. These findings provide insights into the evolution of collaborative behaviors and inform science policy. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Collaborative learning

来源：评论

学校读者我要写书评

暂无评论

K-Space-Aware Cross-Modality Score for Quality Assessment of Synthesized Neuroimages

arXiv

引用

arXiv 2023年

作者： Xie, Guoyang Wang, Jinbao Huang, Yawen Lyu, Jiayi Zheng, Feng Zheng, Yefeng Jin, Yaochu Southern University of Science and Technology Department of Computer Science Shenzhen518055 China CATL Department of Intelligent Manufacturing Ningde352000 China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen518060 China Tencent Youtu Lab Jarvis Research Center Shenzhen510310 China University of Chinese Academy of Sciences the School of Engineering Science Beijing100049 China Westlake University the School of Engineering Hangzhou310030 China

The problem of how to assess cross-modality medical image synthesis has been largely unexplored. The most used measures like PSNR and SSIM focus on analyzing the structural features but neglect the crucial lesion location and fundamental k-space speciality of medical images. To overcome this problem, we propose a new metric K-CROSS to spur progress on this challenging problem. Specifically, K-CROSS uses a pre-trained multi-modality segmentation network to predict the lesion location, together with a tumor encoder for representing features, such as texture details and brightness intensities. To further reflect the frequency-specific information from the magnetic resonance imaging principles, both k-space features and vision features are obtained and employed in our comprehensive encoders with a frequency reconstruction penalty. The structure-shared encoders are designed and constrained with a similarity loss to capture the intrinsic common structural information for both modalities. As a consequence, the features learned from lesion regions, k-space, and anatomical structures are all captured, which serve as our quality evaluators. We evaluate the performance by constructing a large-scale cross-modality neuroimaging perceptual similarity (NIRPS) dataset with 6,000 radiologist judgments. Extensive experiments demonstrate that the proposed method outperforms other metrics, especially in comparison with the radiologists on NIRPS. To forster reproducibility and accessibility, the source codeis uploaded to the website: https://***/M-3LAB/K-CROSS © 2023, CC BY.

关键词： Magnetic resonance imaging

来源：评论

学校读者我要写书评

暂无评论

Malicious Family Identify Combining Multi-channel Mapping Feature Image and Fine-Tuned CNN

Malicious Family Identify Combining Multi-channel Mapping Fe...

引用

IEEE International Conference on Trust, Security and Privacy in computing and Communications (TrustCom)

作者： Chenghua Tang Chen Zhou Min Hu Mengmeng Yang Baohua Qiang Guangxi Key Laboratory of Trusted Software Guilin University of Electronic Technology Guilin China Guangxi Key Laboratory of Cryptography and Information Security Guilin University of Electronic Technology Guilin China Strategic Centre for Research in Privacy-Preserving Technologies & Systems Nanyang Technological University Singapore Guangxi Cloud Computing and Big Data Collaborative Innovation Center Guilin University of Electronic Technology Guilin China

Using the features of malicious family to detect malicious code can improve the analysis efficiency and reduce the workload. Aiming at the problems of low efficiency and low accuracy of classifiers in analyzing and detecting malicious code using traditional machine learning, a new malicious family identification method 2MFI-FT is proposed. Firstly, the more comprehensive and essential features of malicious code are obtained by extracting local feature information, assembly instruction set information and visible string information. Secondly, in order to solve the problem of inconsistent images generated by feature sequences, different feature grayscale images are fused into a multi-channel mapping feature image (2MFI) based on the signature matrix. Thirdly, in view of the high cost of collecting and labeling enough data, a classification model with high recognition accuracy and strong generalization ability is realized, based on the fine-tuned Convolutional Neural Network (CNN). The regularization technique is also used to improve the robustness of the model. It is tested on Microsoft Malware Classification Challenge dataset. The experimental results show that the proposed 2MFI method for multi-channel feature image visualization has good identification effect and low time consumption when used as the input of the network model. At the same time, the 2MFI-FT method combined with fine-tuned CNN can accurately identify malicious families, and the accuracy on small training sets and large training sets can reach about 98.25% and 99.68% respectively, which provides a feasible solution for effective identification of malicious families.

关键词： Training Codes Instruction sets Semantics Feature extraction Malware Robustness

来源：评论

学校读者我要写书评

暂无评论

Comprehensive Characteristic Decomposition of Parametric Polynomial Systems 21

Comprehensive Characteristic Decomposition of Parametric Pol...

引用

46th International Symposium on Symbolic and Algebraic Computation, ISSAC 2021

作者： Dong, Rina Lu, Dong Mou, Chenqi Wang, Dongming Chongqing Key Laboratory of Automated Reasoning and Cognition Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing400714 China Beijing Advanced Innovation Center for Big Data and Brain Computing School of Mathematical Sciences Beihang University Beijing100191 China LMIB-School of Mathematical Sciences Beihang University Beijing100191 China Centre National de la Recherche Scientifique Paris cedex 1675794 France

ISBN: (纸本)9781450383820

This paper presents an algorithm that decomposes an arbitrary set F of multivariate polynomials involving parameters into finitely many sets Gi of (lexicographical) Gröbner bases G ij such that associated with each Gi there is a system Ai of parametric constraints, all the Ai's partition the parameter space, all the Gij's in each Gi remain Gröbner bases under specialization of the parameters satisfying the constraints in Ai, and for each i the Gröbner bases Gij together with their corresponding W-characteristic sets form a normal characteristic decomposition of F. The sets of Gröbner bases computed by the algorithm provide a comprehensive characteristic decomposition of F that is structure-invariant under the associated constraints and possesses many algebraic and geometric properties, including most of the notable properties on comprehensive Gröbner systems and comprehensive triangular decomposition. Some of these properties are highlighted in the paper and advantages of the proposed algorithm are discussed briefly from the aspects of methodological simplicity and computational performance using illustrative examples and preliminary experiments. © 2021 ACM.

关键词： Polynomials

来源：评论

学校读者我要写书评

暂无评论

Reconstructing Missing Modalities in Multi-Modal Endoscopic Ultrasound Via Cross-Modal Feature Replacement Representation

SSRN

引用

SSRN 2024年

作者： Zheng, Cenyang Gong, Xun Fan, Lin Li, Jiao School of Computing and Artificial Intelligence Southwest Jiaotong University Sichuan 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 Department of Gastroenterology The Third People’s Hospital of Chendu Affiliated Hospital of Southwest Jiaotong University Chengdu610031 China

Endoscopic ultrasound (EUS) is the primary diagnostic imaging technique for gastrointestinal stromal tumors. However, accurately identifying these tumors through EUS imaging alone remains challenging, even for experienced clinicians. They often rely on additional data, such as white light endoscopy (WLE) and EUS text reports, to aid in the diagnosis. Unfortunately, in practice, these supplementary modalities are sometimes overlooked during patient evaluation. To address these issues, we propose the Cross-modal Feature Reconstruction Network (CFRN), which integrates multimodal data modeling for medical diagnostic processes and performs specific learning for different modalities with missing data. The network fuses the multi-modal features based on the clinical medical process, realizes the feature-level missing modality reconstruction, and learns the refined features of different modal true cases by decoding the mode-specific missing. We trained and tested the model on two publicly available datasets, Audiovision-MNIST, MM-IMDb, and data sets collected from real clinical scenarios at three hospitals. Our results show that CFRN outperforms state-of-the-art methods, achieving higher prediction accuracy than using EUS alone. By simultaneously incorporating multimodal or reconstructed modal data for disease diagnosis, our single-modal EUS model proves to be more suitable for clinical scenarios. © 2024, The Authors. All rights reserved.

关键词： Endoscopy

来源：评论

学校读者我要写书评

暂无评论

A Tent Lévy Flying Sparrow Search Algorithm for Feature Selection: A COVID-19 Case Study

arXiv

引用

arXiv 2022年

作者： Yang, Qinwen Gao, Yuelin Song, Yanjie School of Computer Science and Engineering North Minzu University Yinchuan750021 China School of Mathematics and Information Science North Minzu University Yinchuan750021 China Ningxia Key Laboratory of Intelligent Information and Big Data Processing Yinchuan750021 China Ningxia Province Cooperative Innovation Center of Scientific Computing and Intelligent in Formation Processing North Minzu University Yinchuan750021 China College of Systems Engineering National University of Defense Technology Changsha410073 China

The "Curse of Dimensionality" induced by the rapid development of information science, might have a negative impact when dealing with big datasets. In this paper, we propose a variant of the sparrow search algorithm (SSA), called Tent Lévy flying sparrow search algorithm (TFSSA), and use it to select the best subset of features in the packing pattern for classification purposes. SSA is a recently proposed algorithm that has not been systematically applied to feature selection problems. After verification by the CEC2020 benchmark function, TFSSA is used to select the best feature combination to maximize classification accuracy and minimize the number of selected features. The proposed TFSSA is compared with nine algorithms in the literature. Nine evaluation metrics are used to properly evaluate and compare the performance of these algorithms on twenty-one datasets from the UCI repository. Furthermore, the approach is applied to the coronavirus disease (COVID-19) dataset, yielding the best average classification accuracy and the average number of feature selections, respectively, of 93.47% and 2.1. Experimental results confirm the advantages of the proposed algorithm in improving classification accuracy and reducing the number of selected features compared to other wrapper-based algorithms. Copyright © 2022, The Authors. All rights reserved.

关键词： COVID-19

来源：评论

学校读者我要写书评

暂无评论

cloud-Assisted Privacy Protection for data Retrieval Against Keyword Guessing Attacks 3rd

Cloud-Assisted Privacy Protection for Data Retrieval Against...

引用

3rd International Conference on Machine Learning for Cyber Security, ML4CS 2020

作者： Chen, Zhenwei Zhang, Yinghui Han, Gang He, Jiangyong Guo, Rui Zheng, Dong School of Cyberspace Security Xi’an University of Posts and Telecommunications Xi’an710121 China National Engineering Laboratory for Wireless Security Xi’an University of Posts and Telecommunications Xi’an710121 China Westone Cryptologic Research Center Beijing100070 China Guangxi Cooperative Innovation Center of Cloud Computing and Big Data Guilin University of Electronic Technology Guilin541004 China

ISBN: (纸本)9783030622220

Machine learning is more closely linked to data privacy and has obtained rapid development in recent years. As for data privacy, searchable encryption (SE) is widely used as a ciphertext search technology, protecting the privacy of users. However, existing schemes usually support single keyword search, so the remote cloud server (CS) may return some irrelevant results. To address this problem, we propose a server-aided public key encryption scheme with multi-keyword search (SA-PEMKS) scheme. The scheme allows a data user to conduct multiple keyword search in a single search query. Security and performance analysis show that the SA-PEMKS scheme is secure and efficient. © 2020, Springer Nature Switzerland AG.

关键词： data privacy

来源：评论

学校读者我要写书评

暂无评论

Driving Behavior Safety Assessment in Edge computing Using Multitask Discriminative TS Fuzzy Model

引用

IEEE Transactions on Consumer Electronics 2024年

作者： Gu, Yi Chen, Zhiyu Wang, Lu Shen, Jinsong Bashir, Ali Kashif Wang, Wei Jiangnan University School of Artificial Intelligence and Computer Science Wuxi214122 China Jiangnan University Engineering Research Center of Intelligent Technology for Healthcare Ministry of Education Wuxi214122 China Chongqing University School of Big Data and Software Engineering Chongqing400044 China Jiangsu Keli Internet Information Technology Co. Ltd Jingjiang214500 China Manchester Metropolitan University Department of Computing and Mathematics United Kingdom Woxsen University Woxsen School of Business Hyderabad502 345 India Lebanese American University Department of Computer Science and Mathematics Beirut Lebanon Shenzhen MSU-BIT University Artificial Intelligence Research Institute Shenzhen518172 China

Driving behavior safety analysis in edge computing involves the real-time collection and processing of vehicle driving data. Fuzzy models have advantages in analyzing driving behavior due to their excellent ability to handle uncertain information. This study develops a multitask discriminative Takagi-Sugeno fuzzy model (MD-TS-FM) for driving behavior safety assessment. To comprehensively analyze the correlation and differences in multitask driving behaviors, the designed consequent part consists of two parts: task-shared part reflects the shared intrinsic structure information that are consistent across different driving tasks, and task-specific part reflects distinct characteristics and variations specific to each task, allowing the model to address the unique aspects of different driving behaviors. Accordingly, the task-shared consequent part is characterized by low-rank property, which mines global structural information within the fuzzy space;whereas the task-specific consequent part exhibits sparsity, which removes non-discriminative and irrelevant information. This sparsity ensures that the model focuses on the most critical features for each specific task. Furthermore, a discriminative diversity term is introduced to enhance the diversity between tasks, which explores the consistent information of task-shared consequents while reducing the overlap of task-specific consequents. Experimental results indicate that the MD-TS-FM model can be effectively applied to driving behavior safety assessment. © 1975-2011 IEEE.

关键词： driving behavior safety assessment edge computing fuzzy model multitask learning

来源：评论

学校读者我要写书评

暂无评论

Predicting Large-scale Protein-protein Interactions by Extracting Coevolutionary Patterns with MapReduce Paradigm

Predicting Large-scale Protein-protein Interactions by Extra...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Lun Hu Bo-Wei Zhao Shicheng Yang Xin Luo MengChu Zhou Xinjiang Technical Institute of Physics and Chemistry Chinese Academy of Sciences Urumqi China School of Computer Science and Technology Wuhan University of Technology Wuhan China Chongqing Engineering Research Center of Big Data Application for Smart Cities and Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing China Hengrui (Chongqing) Artificial Intelligence Research Center Cloudwalk China New Jersey Institute of Technology Newark NJ USA

ISBN: (纸本)9781665442084

Protein-protein interactions are of great significance for us to understand the functional mechanisms of proteins. With the rapid development of high-throughput genomic technology, the amount of protein-protein interaction data has become so big that most of existing prediction algorithms are no longer applicable. To address this problem, we develop a distributed framework by reimplementing one of state-of-the-art algorithms, i.e., CoFex, by using MapReduce. In particular, we adopt a novel tree-based data structure to reduce the heavy memory consumption cased by the huge sequence information of proteins. After that, the procedure of CoFex is modified by following the paradigm of MapReduce such that the prediction task can be completed in a distributed manner, thus fulfilling the demanding requirements of large-scale protein-protein interaction prediction. A series of experiments have been conducted to evaluate the performance of the proposed distributed framework in terms of both efficiency and effectiveness. Experimental results demonstrate that the proposed framework can considerably improve the efficiency of CoFex by achieving more than two-orders-of-magnitude improvement in computational efficiency while retaining a comparable level of accuracy.

关键词： Proteins Memory management Genomics Predictive models Prediction algorithms data structures Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：