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

International Conference on Computer Supported Cooperative Work in Design

作者： Hengwei Zhang Yuejia Wu Jian-Tao Zhou Inner Mongolia University College of Computer Science Hohhot China Ministry of Education National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Engineering Research Center of Ecological Big Data Hohhot China Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Hohhot China Inner Mongolia Key Laboratory of Social Computing and Data Processing Hohhot China Inner Mongolia Key Laboratory of Discipline Inspection and Supervision Big Data Hohhot China Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Hohhot China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

Named Entity Recognition (NER) is one of the contents of Knowledge Extraction (KE) that transforms data into knowledge representation. However, Chinese NER faces the problem of lacking clear word boundaries that limit the effectiveness of the KE. Although the flat lattice Transformer (FLAT) framework, which converts lattice structure into a flat structure including a set of spans, can effectively improve this problem and obtain advanced results, there still exist the problems of insensitivity to entity importance weights and insufficient feature learning. This paper proposes a weighted flat lattice Transformer architecture for Chinese NER, namely WFLAT. The WFLAT first adds a weight matrix into self-attention calculation, which can obtain finer-grained partitioning of entities to improve experimental performance, and then adopts a multi-layer Transformer encoder with each layer using a multi-head self-attention mechanism. Extensive experimental results on benchmarks demonstrate that our proposed KE model can obtain state-of-the-art performance for the Chinese NER task.

关键词： Representation learning Computational modeling Memory management Lattices Named entity recognition Transforms Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

Risk analysis of system security based on evidence theory

Risk analysis of system security based on evidence theory

引用

International Conference on Computer Design and Applications (ICCDA)

作者： Peida Xu Yong Deng Jianling Xu Xiaoyan Su Key Laboratory of Digital Agricultural Early-warning Technology Ministry of Agriculture of China Beijing China Key Laboratory of Intelligent Computing & Information Processing of Ministry of Education Xiangtan University China School of Electronics & Information Technology Shanghai Jiaotong University China School of Electronics & Information Technology Shanghai Jiaotong University Shanghai China Hangzhou Key Laboratory of E-Business and Information Security Hangzhou Normal University Shanghai Zhejiang China Grain Economics Institute Nanjing University of Finance and Economics Nanjing China

ISBN: (纸本)9781424471645;9781424471638

Risk evaluation is very important to the design and improvement of physical protection systems. In this paper, an evaluation method of multi-source information fusion is proposed based on the D-S evidence theory. In the proposed method, each individual component of the protection system in the simulated plane is modeled. Then, the threat report of each component according to the specific tactics is determined based on its real environment. Finally, the comprehensive threat distribution is obtained based on through the D-S evidence theory to combine multi-sources information. The proposed method can easily applied to the evaluation of the effectiveness of the protection system. We make the total threat of the protection system lowest through changes of the protection resources allocation. A numerical example is used to illustrate the efficiency of the proposed method.

关键词： Risk analysis Protection Information security Information technology Computer security Laboratories Environmental economics educational technology Agriculture Finance

来源：评论

学校读者我要写书评

暂无评论

On self-dual and LCD double circulant and double negacirculant codes over Fq+ uFq

arXiv

引用

arXiv 2018年

作者： Shi, Minjia Zhu, Hongwei Qian, Liqin Sok, Lin Sol, Patrick 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 Hefei Anhui230601 China National Mobile Communications Research Laboratory Southeast University China Department of Mathematics Royal University of Phnom Penh Phnom Penh12156 Cambodia CNRS LAGA University of Paris 8 Saint-Denis93526 France

Double circulant codes of length 2n over the semilocal ring R = Fq + uFq, u2 = u, are studied when q is an odd prime power, and-1 is a square in Fq. Double negacirculant codes of length 2n are studied over R when n is even and q is an odd prime power. Exact enumeration of self-dual and LCD such codes for given length 2n is given. Employing a duality-preserving Gray map, self-dual and LCD codes of length 4n over Fq are constructed. Using random coding and the Artin conjecture, the relative distance of these codes is bounded below. The parameters of examples of the modest length are computed. Several such codes are optimal. Copyright © 2018, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SpreadFGL: Edge-Client Collaborative Federated Graph Learning with Adaptive Neighbor Generation

arXiv

引用

arXiv 2024年

作者： Zhong, Luying Pi, Yueyang Chen, Zheyi Yu, Zhengxin Miao, Wang Chen, Xing Min, Geyong College of Computer and Data Science Fuzhou University China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University China Engineering Research Center of Big Data Intelligence Ministry of Education China School of Computing and Communications University of Lancaster United Kingdom School of Engineering Computing and Mathematics University of Plymouth United Kingdom Department of Computer Science University of Exeter United Kingdom

Federated Graph Learning (FGL) has garnered widespread attention by enabling collaborative training on multiple clients for semi-supervised classification tasks. However, most existing FGL studies do not well consider the missing inter-client topology information in real-world scenarios, causing insufficient feature aggregation of multi-hop neighbor clients during model training. Moreover, the classic FGL commonly adopts the FedAvg but neglects the high training costs when the number of clients expands, resulting in the overload of a single edge server. To address these important challenges, we propose a novel FGL framework, named SpreadFGL, to promote the information flow in edge-client collaboration and extract more generalized potential relationships between clients. In SpreadFGL, an adaptive graph imputation generator incorporated with a versatile assessor is first designed to exploit the potential links between subgraphs, without sharing raw data. Next, a new negative sampling mechanism is developed to make SpreadFGL concentrate on more refined information in downstream tasks. To facilitate load balancing at the edge layer, SpreadFGL follows a distributed training manner that enables fast model convergence. Using real-world testbed and benchmark graph datasets, extensive experiments demonstrate the effectiveness of the proposed SpreadFGL. The results show that SpreadFGL achieves higher accuracy and faster convergence against state-of-the-art algorithms. Copyright © 2024, The Authors. All rights reserved.

关键词： Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

LCD codes from tridiagonal Toeplitz matrice

arXiv

引用

arXiv 2021年

作者： Shi, Minjia Özbudak, Ferruh Xu, Li Solé, Patrick Key Laboratory of Intelligent Computing Signal Processing Ministry of Education School of Mathematical Sciences Anhui University HefeiAnhui230601 China Department of Mathematics Institute of Applied Mathematics Middle East Technical University Ankara Turkey School of Mathematical Sciences Anhui University HefeiAnhui230601 China I2M Aix Marseille Univ. Centrale Marseille CNRS Marseille France

Double Toeplitz (DT) codes are codes with a generator matrix of the form (I, T) with T a Toeplitz matrix, that is to say constant on the diagonals parallel to the main. When T is tridiagonal and symmetric we determine its spectrum explicitly by using Dickson polynomials, and deduce from there conditions for the code to be LCD. Using a special concatenation process, we construct optimal or quasi-optimal examples of binary and ternary LCD codes from DT codes over extension *** Codes 94B05, 15B05, 12E10 Copyright © 2021, The Authors. All rights reserved.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

How many weights can a linear code have?

arXiv

引用

arXiv 2018年

作者： Shi, Minjia Zhu, Hongwei Solé, Patrick Cohen, Gérard D. Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University No. 3 Feixi Road Hefei Anhui Province230039 China School of Mathematical Sciences Anhui University Hefei230601 China CNRS/LAGA University of Paris 8 2 rue de la Liberté Saint-Denis93 526 France TelecomParisTech 46 rue Barrault Paris75 013 France

We study the combinatorial function L(k, q), the maximum number of nonzero weights a linear code of dimension k over Fq can have. We determine it completely for q = 2, and for k = 2, and provide upper and lower bounds in the general case when both k and q are ≥ 3. A refinement L(n, k, q), as well as nonlinear analogues N(M, q) and N(n, M, q), are also introduced and studied. Copyright © 2018, The Authors. All rights reserved.

关键词： Codes (symbols)

来源：评论

学校读者我要写书评

暂无评论

Quasi-cyclic perfect codes in Doob graphs and special partitions of Galois rings

arXiv

引用

arXiv 2023年

作者： Shi, Minjia Li, Xiaoxiao Krotov, Denis S. Özbudak, Ferruh Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education School of Mathematical Sciences Anhui University Hefei230601 China School of Mathematical Sciences Anhui University Hefei230601 China Sobolev Institute of Mathematics pr. Akademika Koptyuga 4 Novosibirsk630090 Russia Faculty of Engineering and Natural Sciences Sabancı University Middle East Technical University 34956 Istanbul Ankara06800 Turkey

The Galois ring GR(4∆) is the residue ring Z4[x]/(h(x)), where h(x) is a basic primitive polynomial of degree ∆ over Z4. For any odd ∆ larger than 1, we construct a partition of GR(4∆)\{0} into 6-subsets of type {a, b, −a−b, −a, −b, a+b} and 3-subsets of type {c, −c, 2c} such that the partition is invariant under the multiplication by a nonzero element of the Teichmuller set in GR(4∆) and, if ∆ is not a multiple of 3, under the action of the automorphism group of GR(4∆). As a corollary, this implies the existence of quasi-cyclic additive 1-perfect codes of index (2∆ − 1) in D((2∆ − 1)(2∆ − 2)/6, 2∆ − 1) where D(m, n) is the Doob metric scheme on Z2m+n .MSC Codes 94B99 Copyright © 2023, The Authors. All rights reserved.

关键词： Algebra

来源：评论

学校读者我要写书评

暂无评论

Erratum to: Multi-party quantum key agreement with Bell states and Bell measurements

引用

Quantum Information processing 2012年第2期12卷 933-933页

作者： Shi, Run-Hua Zhong, Hong Key Laboratory of Intelligent Computing & Signal Processing of Ministry of Education Anhui University Hefei China School of Computer Science and Technology Anhui University Hefei China

来源：评论

学校读者我要写书评

暂无评论

The Graph Structure of Chebyshev Permutation Polynomials over Ring pk

arXiv

引用

arXiv 2022年

作者： Li, Chengqing Lu, Xiaoxiong Tan, Kai Chen, Guanrong The School of Computer Science Xiangtan University Hunan Xiangtan411105 China The School of Mathematics and Computational Science Xiangtan University Xiangtan411105 China The Key Laboratory of Intelligent Computing & Information Processing Ministry of Education Xiangtan University Hunan Xiangtan411105 China The Department of Electrical Engineering City University of Hong Kong Hong Kong

Understanding the underlying graph structure of a nonlinear map over a particular domain is essential in evaluating its potential for real applications. In this paper, we investigate the structure of the associated functional graph of Chebyshev permutation polynomials over a ring pk, with p being a prime number greater than three, where every number in the ring is considered as a vertex and the existing mapping relation between two vertices is regarded as a directed edge. Based on some new properties of Chebyshev polynomials and their derivatives, we disclose how the basic structure of the functional graph evolves with respect to parameter k. First, we present a complete and explicit form of the length of a path starting from any given vertex. Then, we show that the strong patterns of the functional graph that the number of cycles of any given length always remains constant as k increases. Moreover, we rigorously prove the rules on the elegant structure of the functional graph and verify them experimentally. Our results could be useful for studying the emergence of the complexity of a nonlinear map in digital computers and security analysis of its cryptographic *** Codes 94A55 Copyright © 2022, The Authors. All rights reserved.

关键词： Chebyshev polynomials

来源：评论

学校读者我要写书评

暂无评论

CSCL-DTI: predicting drug-target interaction through cross-view and self-supervised contrastive learning

CSCL-DTI: predicting drug-target interaction through cross-v...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Xuan Lin Xi Zhang Zu-Guo Yu Yahui Long Xiangxiang Zeng Philip S. Yu College of Computer Science Xiangtan University China Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University China Singapore Immunology Network (SIgN) Agency for Science Technology and Research (A*STAR) Singapore College of Information Science and Engineering Hunan University China Department of Computer Science University of Illinois Chicago USA

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

Accurately predicting drug-target interactions (DTI) is a critical step in drug discovery. Existing methods of DTI prediction primarily employ Simplified Molecular-Input Line-Entry System (SMILES) sequences or molecular graphs to learn drug representations. However, the features learned by such single-view approach is prone to incomplete. While some multiview methods that consider the views of both SMILES sequences and molecular graphs have been developed, these methods often fall in short in capturing potential interactions between views. In this work, we propose a novel dual contrastive learning framework CSCL-DTI for DTI prediction. First, we design a contrastive-enhanced cross-view representation learning (CVRL) to learn representations for drugs. In this module, Transformer-based and graph convolutional network (GCN)-based encoders are separately adopted to learn view-specific representations, followed by contrastive learning to enrich the representations by accounting for the potential interplay between local chemical context and topological structure. Second, we combine Transformer with self-supervised contrastive learning (SSCL) to learn representations for targets by modelling protein amino acids sequences. The scheme allows to effectively preserve the intrinsic characteristics of the sequences. Finally, we introduce a bilinear attention network to obtain an integrated representation by adaptively incorporating drug and target representations. Benchmarking experiments on two datasets demonstrated that CSCL-DTI 1 outperforms six state-of-the-art methods.

关键词： Drugs Proteins Representation learning Protein engineering Adaptation models Contrastive learning Predictive models Transformers Amino acids Diffusion tensor imaging

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：