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

Constructions of optimal LCD codes over large finite fields

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Sok, Lin Shi, Minjia Solé, Patrick School of Mathematical Sciences Anhui University Hefei Anhui230601 Department of Mathematics Royal University of Phnom Penh Cambodia Key Laboratory of Intelligent Computing Signal Processing Ministry of Education Anhui University No.3 Feixi Road Hefei Anhui230039 China School of Mathematical Sciences Anhui University HefeiAnhui230601 China National Mobile Communications Research Laboratory Southeast University China CNRS/LAGA University of Paris 8 Saint-Denis93 526 France

In this paper, we prove existence of optimal complementary dual codes (LCD codes) over large finite fields. We also give methods to generate orthogonal matrices over finite fields and then apply them to construct LCD codes. Construction methods include random sampling in the orthogonal group, code extension, matrix product codes and projection over a self-dual basis. Copyright © 2017, The Authors. All rights reserved.

关键词： Matrix algebra

Optimal combination of conflicting evidence based on genetic algorithm

学校读者我要写书评

暂无评论

ICIC Express Letters 2011年第4 A期5卷 1145-1150页

作者： Jiang, Wen Peng, Jinye Deng, Yong School of Electronics and Information Northwestern Polytechnical University No. 127 Youyixi Road Xi'an 710072 China Hangzhou Key Lab of E-Business and Information Security Hangzhou Normal University No. 16 Xuelin Street Xiasha Higher Education Zone Hanzhou 310036 China Key Laboratory of Intelligent Computing and Information Processing Ministry of Education Xiangtan University Xiangtan 411105 China School of Computer and Information Sciences Southwest University No. 2 Tiansheng Road Beibei District Chongqing 400715 China School of Electronics and Information Technology Shanghai Jiao Tong University No. 800 Dongchuan Road Shanghai 200240 China

The Dempster-Shafer (D-S) evidence theory is widely used in many fields of information fusion. However, counter-intuitive results may be obtained by the classical Dempster combination rule when collected evidences are highly in conflict with each other. So an optimal weighted average information fusion method is proposed. Firstly, the global distance of the weighted evidence is presented based on the distance function. Secondly, the optimal weight of every evidence body was acquired by genetic algorithm, while the global distance is the minimum. Finally, the weighted average of the masses is combined by classical Dempster's rule. Compared with existing methods, the proposed optimal method can effectively handle conflicting evidence with better performance of convergence. Numerical examples are illustrated the effectiveness of the proposed method. ICIC International © 2011.

关键词： Genetic algorithms

Aggregation of interval numbers in group decision making

学校读者我要写书评

暂无评论

ICIC Express Letters 2011年第4 A期5卷 1057-1062页

作者： Deng, Yong Wu, Jiyi Sun, Xiaohong Xu, Peida Zhang, Yajuan College of Computer and Information Sciences Southwest University Tiansheng Road Beibei District Chongqing 400715 China Hangzhou Key Lab of E-Business and Information Security Hangzhou Normal University No. 16 Xuelin Street Xiasha Higher Education Zone Hanzhou 310036 China Key Laboratory of Intelligent Computing and Information Processing Ministry of Education Xiangtan University Xiangtan 411105 China College of Food Science and Technology Shanghai Ocean University Hu Cheng Loop-road Lingang New City Shanghai 201306 China School of Electronics and Information Technology Shanghai Jiao Tong University Dongchuan Rd. Shanghai 200240 China

A group of decision-makers may differ in their choice of alternatives while taking a decision. So, in any decision-making problem concerning decisions made by a group, the question arises how best we can aggregate individual choices into a general consensus choice. Due to the inherent uncertain property of the problems in the ambiguous decision domain, the decision makers may use interval numbers to represent their opinions in some situations. In this paper, a simple method is proposed to aggregate interval numbers. Some desirable properties of this method are also discussed. Finally, a numerical example is given to show the use of the proposed method. ICIC International © 2011.

关键词： Aggregates

A group key distribution system based on the generalized aryabhata remainder theorem for enterprise digital rights management

学校读者我要写书评

暂无评论

Journal of Information Hiding and Multimedia signal processing 2015年第1期6卷 140-153页

作者： Liu, Yanjun Chang, Chin-Chen Chang, Shih-Chang Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University No.111 Jiulong Rd Hefei230601 China Department of Computer Science and Information Engineering Asia University No.500 Lioufeng Rd Wufeng Taichung413 Taiwan Department of Information Engineering and Computer Science Feng Chia University No.100 Wenhwa Rd Seatwen Taichung407 Taiwan Department of Computer Science and Information Engineering National Chung Cheng University No.168 Sec.1 University Rd Min-Hsiung Township Chiayi621 Taiwan

Digital Rights Management (DRM) is a type of access-control technology that is used by diverse content providers to restrict the use of digital content. Enterprise Digital Rights Management (E-DRM) is an application of DRM techniques for managing the control of access to sensitive documents in an enterprise. In this paper, we propose a group key distribution system for E-DRM based on the concept of a secret-sharing mechanism and the generalized Aryabhata remainder theorem (GART). To the best of our knowledge, no previous publications related to E-DRM technologies have presented the group key distribution system that we propose. In our system, different groups of enterprise members within the enterprise obtain different digital content in parallel without collision by using their group’s unique session key;all members within each group share a common session key to decrypt the same digital documents to acquire the correct content. We proved that our system achieves the goal of providing high security, which includes preventing inside and outside attacks and offering forward and backward secrecy. © 2015.

关键词： Copyrights

Direct quantification for coronary artery stenosis using multiview learning

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Zhang, Dong Yang, Guang Zhao, Shu Zhang, Yanping Zhang, Heye Li, Shuo Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei China School of Computer Science and Technology Anhui University Hefei China Cardiovascular Research Centre Royal Brompton Hospital LondonSW3 6NP United Kingdom National Heart & Lung Institute Imperial College London LondonSW7 2AZ United Kingdom School of Biomedical Engineering Sun Yat-Sen University Shenzhen China Western University LondonON Canada

The quantification of the coronary artery stenosis is of significant clinical importance in coronary artery diseases diagnosis and intervention treatment. It aims to quantify the morphological indices of the coronary artery lesions such as minimum lumen diameter, reference vessel diameter, lesion length and these indices are the reference of the interventional stent placement. In this study, we propose a direct multiview quantitative coronary angiography (DMQCA) model as an automatic clinical tool to quantify the coronary artery stenosis from X-ray coronary angiography images. The proposed DMQCA model consists of a multiview module with two attention mechanisms, a key-frame module and a regression module, to achieve direct accurate multiple-index estimation. The multi-view module comprehensively learns the spatio-temporal features of coronary arteries through a three-dimensional convolution. The attention mechanisms of each view focus on the subtle feature of the lesion region and capture the important context information. The keyframe module learns the subtle features of the stenosis through successive dilated residual blocks. The regression module finally generates the indice estimation from multiple features. We evaluate the proposed model over 2100 X-ray coronary angiography images collected from 105 subjects from two viewpoints. Compared to other direct quantification methods, our DMQCA model achieves more accurate quantification, enabling to provide a patient-specic assessment of coronary artery stenosis. Copyright © 2019, The Authors. All rights reserved.

关键词： Heart

Butson Hadamard matrices, bent sequences, and spherical codes

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Shi, Minjia Lu, Danni Armario, Andrés Egan, Ronan Ozbudak, Ferruh Solé, Patrick The Key Laboratory of Intelligent Computing Signal Processing Ministry of Education School of Mathematical Sciences Anhui University Hefei230601 China State Key Laboratory of Integrated Service Networks Xidian University Xi’an710071 China Departamento de Matemática Aplicada I Universidad de Sevilla Avda. Reina Mercedes s/n Seville41012 Spain School of Mathematical Sciences Dublin City University Ireland Faculty of Engineering and Natural Sciences Sabancı University Istanbul34956 Turkey I2M Aix Marseille Univ CNRS Centrale Marseille Marseilles France

We explore a notion of bent sequence attached to the data consisting of an Hadamard matrix of order n defined over the complex qth roots of unity, an eigenvalue of that matrix, and a Galois automorphism from the cyclotomic field of order q. In particular we construct self-dual bent sequences for various q ≤ 60 and lengths n ≤ 21. Computational construction methods comprise the resolution of polynomial systems by Groebner bases and eigenspace computations. Infinite families can be constructed from regular Hadamard matrices, Bush-type Hadamard matrices, and generalized Boolean bent functions. As an application, we estimate the covering radius of the code attached to that matrix over Zq. We derive a lower bound on that quantity for the Chinese Euclidean metric when bent sequences exist. We give the Euclidean distance spectrum, and bound above the covering radius of an attached spherical code, depending on its strength as a spherical design. © 2023, CC BY.

关键词： Spheres

Gradually Vanishing Gap in Prototypical Network for Unsupervised Domain Adaptation

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wang, Shanshan Zhou, Hao Yang, Xun He, Zhenwei Wang, Mengzhu Zhang, Xingyi Wang, Meng The Information Materials and Intelligent Sensing Laboratory of Anhui Province Institutes of Physical Science and Information Technology Anhui University Hefei230601 China The Department of Electronic Engineering and Information Science School of Information Science and Technology University of Science and Technology of China Hefei230026 China The College of Computer Science and Engineering Chongqing University of Technology Chongqing400054 China The School of Computer Science and Information Engineering Hefei University of Technology Hefei230009 China The School of Artificial Intelligence Hebei University of Technology Tianjin China The Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education The School of Computer Science and Technology Anhui University Hefei230601 China

Unsupervised domain adaptation (UDA) is a critical problem for transfer learning, which aims to transfer the semantic information from labeled source domain to unlabeled target domain. Recent advancements in UDA models have demonstrated significant generalization capabilities on the target domain. However, the generalization boundary of UDA models remains unclear. When the domain discrepancy is too large, the model can not preserve the distribution structure, leading to distribution collapse during the alignment. To address this challenge, we propose an efficient UDA framework named Gradually Vanishing Gap in Prototypical Network (GVG-PN), which achieves transfer learning from both global and local perspectives. From the global alignment standpoint, our model generates a domain-biased intermediate domain that helps preserve the distribution structures. By entangling cross-domain features, our model progressively reduces the risk of distribution collapse. However, only relying on global alignment is insufficient to preserve the distribution structure. To further enhance the inner relationships of features, we introduce the local perspective. We utilize the graph convolutional network (GCN) as an intuitive method to explore the internal relationships between features, ensuring the preservation of manifold structures and generating domain-biased prototypes. Additionally, we consider the discriminability of the inner relationships between features. We propose a pro-contrastive loss to enhance the discriminability at the prototype level by separating hard negative pairs. By incorporating both GCN and the pro-contrastive loss, our model fully explores fine-grained semantic relationships. Experiments on several UDA benchmarks validated that the proposed GVG-PN can clearly outperform the SOTA models. Copyright © 2024, The Authors. All rights reserved.

关键词： Alignment

Co-training based prediction of multi-label protein–protein interactions

学校读者我要写书评

暂无评论

Computers in Biology and Medicine 2024年 177卷 108623-108623页

作者： Tang, Tao Zhang, Xiaocai Li, Weizhuo Wang, Qing Liu, Yuansheng Cao, Xiaofeng School of Modern Posts Nanjing University of Posts and Telecommunications 9 Wenyuan Rd Jiangsu Nanjing210023 China 1 Fusionopolis Way Singapore138632 Singapore School of Management Nanjing University of Posts and Telecommunications 9 Wenyuan Rd Jiangsu Nanjing210023 China College of Computer Science and Electronic Engineering Hunan University 2 Lushan Rd Hunan Changsha410086 China Key Laboratory of Intelligent Computing & Signal Processing of Ministry of Education Anhui University 111 Jiulong Road Anhui Hefei230601 China School of Artificial Intelligence Jilin University 2699 Qianjin St Changchun Jilin130012 China

Prediction of protein–protein interaction (PPI) types enhances the comprehension of the underlying structural characteristics and functions of proteins, which gives rise to a multi-label classification problem. The nominal features describe the physicochemical characteristics of proteins directly, establishing a more robust correlation with the interaction types between proteins than ordered features. Motivated by this, we propose a multi-label PPI prediction model referred to as CoMPPI (Co-training based Multi-label prediction of Protein–Protein Interaction). This approach aims to maximize the utility of both ordered and nominal features extracted from protein sequences. Specifically, CoMPPI incorporates graph convolutional network (GCN) and 1D convolution operation to process the complementary subsets of features individually, leveraging both local and contextualized information in a more efficient way. In addition, two multi-type PPI datasets were constructed to eliminate the duplication in previous datasets. We compare the performance of CoMPPI with three state-of-the-art methods on three datasets partitioned using distinct schemes (Breadth-first search, Depth-first search, and Random), CoMPPI consistently outperforms the other methods across all cases, demonstrating improvements ranging from 3.81% to 32.40% in Micro-F1. The subsequent ablation experiment confirms the efficacy of employing the co-training framework for multi-label PPI prediction, indicating promising avenues for future advancements in this domain. © 2024 Elsevier Ltd

关键词： Proteins

VANER: Leveraging Large Language Model for Versatile and Adaptive Biomedical Named Entity Recognition

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Bian, Junyi Zhai, Weiqi Huang, Xiaodi Zheng, Jiaxuan Zhu, Shanfeng School of Computer Science Fudan University Shanghai200433 China Institute of Science and Technology for Brain-Inspired Intelligence Fudan University China Ministry of Education Shanghai200433 China MOE Frontiers Center for Brain Science Fudan University Shanghai200433 China Zhangjiang Fudan International Innovation Center Shanghai200433 China Shanghai Key Lab of Intelligent Information Processing Fudan University Shanghai200433 China School of Computing and Mathematics Charles Sturt University AlburyNSW2640 Australia

Prevalent solution for BioNER involves using representation learning techniques coupled with sequence labeling. However, such methods are inherently task-specific, demonstrate poor generalizability, and often require dedicated model for each dataset. To leverage the versatile capabilities of recently remarkable large language models (LLMs), several endeavors have explored generative approaches to entity extraction. Yet, these approaches often fall short of the effectiveness of previouly sequence labeling approaches. In this paper, we utilize the open-sourced LLM LLaMA2 as the backbone model, and design specific instructions to distinguish between different types of entities and datasets. By combining the LLM’s understanding of instructions with sequence labeling techniques, we use mix of datasets to train a model capable of extracting various types of entities. Given that the backbone LLMs lacks specialized medical knowledge, we also integrate external entity knowledge bases and employ instruction tuning to compel the model to densely recognize carefully curated entities. Our model VANER, trained with a small partition of parameters, significantly outperforms previous LLMs-based models and, for the first time, as a model based on LLM, surpasses the majority of conventional state-of-the-art BioNER systems, achieving the highest F1 scores across three datasets. Copyright © 2024, The Authors. All rights reserved.

关键词： Computational linguistics