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

第六届全国计算机数学学术会议

作者： Xue Jiang Shugong Zhang Institute of Mathematics Key Lab.of Symbolic Computation and Knowledge EngineeringJilin UniversityChangchun130012China

We demonstrate the equivalence of two classes of D-invariant poly-nomial subspaces introduced in [8] and [9],i.e.,these two classes of subspaces are different representations of the breadth-one D-invariant ***-over,we solve the discrete approximation problem in ideal interpolation for the breadth-one D-invariant ***,we find the points,such that the limiting space of the evaluation functionals at these points is the functional s-pace induced by the given D-invariant subspace,as the evaluation points all coalesce at one point.

关键词：

来源：评论

学校读者我要写书评

暂无评论

On the "normal" error formula for bivariate ideal interpolation

On the "normal" error formula for bivariate ideal interpolat...

引用

第六届全国计算机数学学术会议

作者： Yihe Gong Xue Jiang Shugong Zhang Institute of Mathematics Key Lab.of Symbolic Computation and Knowledge EngineeringJilin UniversityChangchun130012China

In this paper we investigate an error formula for bivariate ideal *** shall call it the "normal" error formula which derives from the "good" error formula raised by Carl de *** prov...

In this paper we investigate an error formula for bivariate ideal *** shall call it the "normal" error formula which derives from the "good" error formula raised by Carl de *** prove that a lexicographic order reduced Gr?bner basis admits such an error *** 2010,Boris Shekhtman proves the ideal projector P* defined by kerP* =(x2-y,xy,y2)does not have a "good" error *** an example,we will show such a P* has a "normal" error formula.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A hybrid discrete particle swarm algorithm for open-shop problems

引用

6th International Conference Simulated Evolution and Learning, SEAL 2006

作者： Qingyun, Yang Jigui, Sun Juyang, Zhang Chunjie, Wang College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory for Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China Open Laboratory for Intelligence Information Processing Fudan University Shanghai 200433 China Basic Sciences of ChangChun University of Technology ChangChun University of Technology Changchun 130012 China

ISBN: (纸本)3540473319

A hybrid discrete particle swarm algorithm is presented in this paper to solve open-shop problems. The operations are redefined in the discrete particle swarm algorithm. To improve the performance the simulated annealing algorithm is combined with discrete particle swarm. We use SA to enhance the results of local best positions instead of current positions. The experimental results show that our hybrid discrete particle swarm algorithm is effective and efficient to solve open-shop problems. © Springer-Verlag Berlin Heidelberg 2006.

关键词： open systems

来源：评论

学校读者我要写书评

暂无评论

Web-based teamwork: Distributed software development course under Covid-19 15

Web-based teamwork: Distributed software development course ...

引用

15th International Conference on Computer Science and Education, ICCSE 2020

作者： Zhang, Rui Mestre, Pedro Serodio, Carlos Prada, Marilia Gao, Wenjuan Jilin University Key Lab of Symbolic Computation and Knowledge Engineering Chinese Ministry of Education College of Computer Science and Technology Changchun130012 China University of Minho Centro Algoritmi Guimaraes4800-058 Portugal Department of Social and Organizational Psychology Lisboa Portugal Library of Changchun University Changchun130022 China

ISBN: (纸本)9781728172675

In a increasingly globalized world, it is very important to help students to acquire the hard and soft skills needed to cope with the challenges they will face when working in such environments. However, even though students find this subject interesting and volunteer for it, it is hard, even impossible to teach college students such a distributed fashion of teamwork. In this paper, a case study is provided to illustrate the methodology and experiences of a joint course, distributed software development, of multiple universities from Asia, Europe, North and South Americas. The results show that student can get the spirit, effective communication for such web-based teamwork environment and achieve software project development. The recent developments because of the Covid-19 pandemic are the facts that now students have to cooperate remotely with each other not only across continents but also inside their own city or country. It has increased the awareness of the need for this kind of training and effectively improved the interactions between team elements in different countries and improved the students' feeling of belonging to their team. © 2020 IEEE.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Discover the Binding Domain of Transmembrane Proteins Based on Structural Universality

Discover the Binding Domain of Transmembrane Proteins Based ...

引用

2021 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2021

作者： Bao, Yihang He, Fei Wang, Weixi Wang, Han Dong, Minglong Northeast Normal University Changchun School of Information Science and Technology China NE Norm. Univ. Key Lab. of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun School of Information Science and Technology China Nanyang Technological University Singapore School of Biological Sciences Singapore

ISBN: (纸本)9781665401265

Transmembrane proteins (TMPs) serve as drug targets for more than half of the drugs currently available in the market. However, it had not been clearly explained how they realize their drug effects through multiple complex molecules bindings actions. Research into TMPs bindings and corresponding structural basis will provide key information for drug research and new drug development. In this study, we defined the binding domain of TMPs according to the binding region investigation of multiple conjugate types. A 3D deep learning model was architected to discover the structural universality inside those domains. The experimental results proved such binding domains existing on the surface of TMPs, and they are structural specific distinguishing to the surface regions without any binding activities. This work provides a new theoretical basis for TMPs binding research and can greatly boost the development of the drug industry. © 2021 IEEE.

关键词： Proteins

来源：评论

学校读者我要写书评

暂无评论

Predicting user influence based on improved linear threshold model in social networks

引用

Journal of computational Information Systems 2014年第14期10卷 6151-6160页

作者： Tian, Zhongsheng Wang, Ying Zhao, Qiuyue Zuo, Wanli College of Software Jilin University Changchun China College of Computer Science and Technology Jilin University Changchun China Key Lab. of Symbolic Computation and Knowledge Engineering Attached to the Ministry of Education Changchun China

With the scale of social networks growing rapidly, the amount of user participating in it increases at astonishing speed. Predicting user influence in social networks is an interesting and useful research direction. There are lots of works on this area, mainly covering the following aspects: Maximize Influence, Influence Diffusion, Predicting Influential Users and Predicting social influence. The common issue of above aspects is that they can't calculate the precise user influence. In this work, we propose a novel method to give each user influence a precise value in social networks. The proposed method is based on Improved Linear Threshold Model (ILTM). To build ILTM, we take a series of measures to overcome the deficiencies brought by Linear Threshold Model, such as assigning random threshold to node, cold start. So we adopt user similarity instead of random threshold and utilize cluster algorithm and link analysis algorithm to surmount cold start. © 2014 by Binary Information Press

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Integrity constraint validation for ontology using modularization

引用

Journal of Information and computational Science 2014年第8期11卷 2705-2713页

作者： Cui, Xianji Ouyang, Dantong Ye, Yuxin Su, Jing College of Computer Science and Technology Jilin University Changchun 130012 China Key Lab. of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun 130012 China National Engineering Research Center of Geophysics Exploration Instruments Jilin University Changchun 130026 China

In the last years, integrity constraint validation over the ontology with expressive description logics is a prominent reasoning service in ontology engineering, as integrity constraints are added into the ontology to guarantee the legal states of ontology data. The integrity constraint validation can be converted into the conjunctive query answering, we thus check the satisfaction of integrity constraints in ontology knowledge base based on the tableau algorithm and further use the existing reasoning systems. With the increase of the ontology data set, however, these reasoning systems reveal the bad performance in real-life ontologies. In order to reduce the amount of information that must be taken into account, we apply the idea of modularization to break down the terminologies and assertions with respect to integrity constraints, and get smaller chunks for them. The empirical results are presented to demonstrate the high efficiency and an improvement of integrity constraint validation. Copyright © 2014 Binary Information Press.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Attention-based multi-level feature fusion for named entity recognition 29

Attention-based multi-level feature fusion for named entity ...

引用

29th International Joint Conference on Artificial Intelligence, IJCAI 2020

作者： Yang, Zhiwei Chen, Hechang Zhang, Jiawei Ma, Jing Chang, Yi College of Computer Science and Technology Jilin University Changchun China School of Artificial Intelligence Jilin University Changchun China IFM Lab Department of Computer Science Florida State University TallahasseeFL United States Department of Computer Science Hong Kong Baptist University Hong Kong Hong Kong Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education China International Center of Future Science Jilin University Changchun China

ISBN: (纸本)9780999241165

Named entity recognition (NER) is a fundamental task in the natural language processing (NLP) area. Recently, representation learning methods (e.g., character embedding and word embedding) have achieved promising recognition results. However, existing models only consider partial features derived from words or characters while failing to integrate semantic and syntactic information (e.g., capitalization, inter-word relations, keywords, lexical phrases, etc.) from multi-level perspectives. Intuitively, multi-level features can be helpful when recognizing named entities from complex sentences. In this study, we propose a novel framework called attention-based multi-level feature fusion (AMFF), which is used to capture the multi-level features from different perspectives to improve NER. Our model consists of four components to respectively capture the local character-level, global character-level, local word-level, and global word-level features, which are then fed into a BiLSTM-CRF network for the final sequence labeling. Extensive experimental results on four benchmark datasets show that our proposed model outperforms a set of state-of-the-art baselines. © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Heuristic black-box adversarial attacks on video recognition models

arXiv

引用

arXiv 2019年

作者： Wei, Zhipeng Chen, Jingjing Wei, Xingxing Jiang, Linxi Chua, Tat-Seng Zhou, Fengfeng Jiang, Yu-Gang Jilin University Fudan University Beihang University National University of Singapore Health Informatics Lab College of Computer Science and Technology Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education Jilin University Changchun Jilin130012 China

We study the problem of attacking video recognition models in the black-box setting, where the model information is unknown and the adversary can only make queries to detect the predicted top-1 class and its probability. Compared with the black-box attack on images, attacking videos is more challenging as the computation cost for searching the adversarial perturbations on a video is much higher due to its high dimensionality. To overcome this challenge, we propose a heuristic black-box attack model that generates adversarial perturbations only on the selected frames and regions. More specifically, a heuristic-based algorithm is proposed to measure the importance of each frame in the video towards generating the adversarial examples. Based on the frames’ importance, the proposed algorithm heuristically searches a subset of frames where the generated adversarial example has strong adversarial attack ability while keeps the perturbations lower than the given bound. Besides, to further boost the attack efficiency, we propose to generate the perturbations only on the salient regions of the selected frames. In this way, the generated perturbations are sparse in both temporal and spatial domains. Experimental results of attacking two mainstream video recognition methods on the UCF-101 dataset and the HMDB-51 dataset demonstrate that the proposed heuristic black-box adversarial attack method can significantly reduce the computation cost and lead to more than 28% reduction in query numbers for the untargeted attack on both datasets. Copyright © 2019, The Authors. All rights reserved.

关键词： Heuristic methods

来源：评论

学校读者我要写书评

暂无评论

Modern deep learning in bioinformatics

引用

Journal of Molecular Cell Biology 2020年第11期12卷 823-827页

作者： Haoyang Li Shuye Tian Yu Li Qiming Fang Renbo Tan Yijie Pan Chao Huang Ying Xu Xin Gao Cancer Systems Biology Center The China-Japan Union HospitalJilin UniversityChangchun 130033China MOE Key Laboratory of Symbolic Computation and Knowledge Engineering College of Computer Science and TechnologyJilin UniversityChangchun 130012China Department of Biology Southern University of Science and TechnologyShenzhen 518055China Computational Bioscience Research Center(CBRC) Computer Electrical and Mathematical Sciences and Engineering(CEMSE)DivisionKing Abdullah University of Science and Technology(KAUST)Thuwal 23955Saudi Arabia School of Computer Science and Technology Hangzhou Dianzi UniversityHangzhou 310018China Ningbo Institute of Information Technology Application Chinese Academy of SciencesNingbo 315040China Computational Systems Biology Lab Department of Biochemistry and Molecular Biology and Institute of BioinformaticsUniversity of GeorgiaAthensGA 30602USA

Deep learning(DL)has shown explosive growth in its application to bioinformatics and has demonstrated thrillingly promising power to mine the complex relationship hidden in large-scale biological and biomedical data.A number of comprehensive reviews have been published on such applications,ranging from high-level reviews with future perspectives to those mainly serving as tutorials.

关键词： has such she

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：