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

8th International Conference on Learning Representations, ICLR 2020

作者： Pei, Hongbin Wei, Bingzhe Chang, Kevin Chen-Chuan Lei, Yu Yang, Bo College of Computer Science and Technology Jilin University China Department of Electrical and Computer Engineering University of Illinois Urbana-Champaign United States Department of Computer Science University of Illinois Urbana-Champaign United States Department of Computing Hong Kong Polytechnic University Hong Kong Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education China

Message-passing neural networks (MPNNs) have been successfully applied to representation learning on graphs in a variety of real-world applications. However, two fundamental weaknesses of MPNNs' aggregators limit their ability to represent graph-structured data: losing the structural information of nodes in neighborhoods and lacking the ability to capture long-range dependencies in disassortative graphs. Few studies have noticed the weaknesses from different perspectives. From the observations on classical neural network and network geometry, we propose a novel geometric aggregation scheme for graph neural networks to overcome the two weaknesses. The behind basic idea is the aggregation on a graph can benefit from a continuous space underlying the graph. The proposed aggregation scheme is permutation-invariant and consists of three modules, node embedding, structural neighborhood, and bi-level aggregation. We also present an implementation of the scheme in graph convolutional networks, termed Geom-GCN, to perform transductive learning on graphs. Experimental results show the proposed Geom-GCN achieved state-of-the-art performance on a wide range of open datasets of graphs. © 2020 8th International Conference on Learning Representations, ICLR 2020. All rights reserved.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Efficient Self-Learning Evolutionary Neural Architecture Search

SSRN

引用

SSRN 2023年

作者： Qiu, Zhengzhong Bi, Wei Xu, Dong Guo, Hua Ge, Hongwei Liang, Yanchun Lee, Heow Pueh Wu, Chunguo Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Jilin Changchun130012 China YGSOFT INC Guangdong Zhuhai519085 China Department of Electrical Engineering and Computer Science Informatics Institute Christopher S. Bond Life Sciences Center University of Missouri ColumbiaMO65211 United States College of Computer Science and Technology Dalian University of Technology Liaoning Dalian116081 China School of Computer Science Zhuhai College of Science and Technology Guangdong Zhuhai519041 China Department of Mechanical Engineering National University of Singapore 9 Engineering Drive 1 117575 Singapore

The evolutionary algorithm has become a major method for neural architecture search recently. However, the fixed probability distribution adopted by the traditional evolutionary algorithm makes the algorithm unable to control the increase or decrease of the individual architecture size and thus cannot guarantee the lightweight and inference efficiency of the candidate architecture. In addition, the existing approaches cannot learn the optimal sampling probability distribution relevant to the specific problem from the empirical information accumulated through the search process. What’s more, the algorithm needs to evaluate the performance of all the individual architectures, which requires huge computing resources and time overhead. To overcome these problems and challenges, an Efficient Self-learning Evolutionary Neural Architecture Search method, called ESE-NAS, is presented in this paper. Firstly, we propose a Model Size Control module, which generates the probability distribution for sampling the type of mutation operators according to the current model size, so as to control both the node number of network architecture and the sparsity of links, therefore ensuring that neural architectures can remain compact and efficient as they evolve. Thereafter, a Mutation Candidate Credit Assignment method is proposed, which enables the algorithm to dynamically adjust the probability distribution for available types of node operations and directed links according to the empirical information from individuals’ performance evaluation, which can guide the evolutionary direction of neural architecture and shorten the first hitting time of the optimal architecture. Finally, a neural architecture performance predictor is formulated, and the accuracy of each individual architecture is predicted by using the simplified input features, to further improve the efficiency of neural architecture search. Experiments show that the ESE-NAS method proposed in this paper can learn a highly i

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

knowledge Compilation Methods Based on the Clausal Relevance and Extension Rule

引用

Chinese Journal of Electronics 2018年第5期27卷 1037-1042页

作者： NIU Dangdang LIU Lei LYU Shuai College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering (Jilin University) Ministry of Education

We introduce the concepts of Relevancematrix(RM) and Relevance-set(RS). And we construct the association between RM and the knowledge compilation(KC) methods based on Extension rule(ER). Based on the basic parameters of RS and the relationship between RM and the KC methods based on ER, we design two efficient heuristics, called M2S(maximum sum of elements in RS and sum of literals in RS) and MNE(minimum number of maximum terms not extended by RS). Both of above heuristics intend to find the minimum set of maximum terms which cannot be extended by RS. Furthermore,we apply M2S and MNE on KCER. M2S KCER(KCER with M2S) and MNE KCER(KCER with MNE) are designed and implemented based on M2S and MNE, respectively. Experimentally, for the SAT instances with random lengths of clauses, M2S KCER and MNE KCER can improve the efficiency and quality of KCER sharply, and they are two best KC algorithms of EPCCL(each pair contains complementary literal) theory in all KC algorithms based on KCER.

关键词： Extension rule knowledge compilation Clausal relevance Heuristic strategy

来源：评论

学校读者我要写书评

暂无评论

2-Thumbs Typing: A Novel Bimanual Text Entry Method in Virtual Reality Environments

2-Thumbs Typing: A Novel Bimanual Text Entry Method in Virtu...

引用

Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW), IEEE Conference on

作者： Zigang Zhang Minghui Sun BoYu Gao Limin Wang College of Software Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China College of Computer Science and Technology Jilin University Changchun China College of Information Science and Technology/Cyber Security Jinan University Guangzhou China

We propose a new technique named 2-Thumbs Typing (2TT) enabling text entry with a touchpad in HTC VIVE controller using two thumbs. 2TT method works similarly with bimanual handwriting input but using new designed uni-stroke gestures considering only strokes' direction. We first design a set of gestures and improve them to finish the final design by a preliminary study through memory, performance efficiency and ease of use. The initial results show that the 2TT technique is easy and comfortable to use, no additional equipment required and supporting eyes-free entry. 2TT can reach 8.5 words per minute with extensive training.

关键词： Training Three-dimensional displays Conferences Memory management Thumb Virtual reality User interfaces

来源：评论

学校读者我要写书评

暂无评论

Discover the Binding Domain of Transmembrane Proteins Based on Structural Universality

Discover the Binding Domain of Transmembrane Proteins Based ...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

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

ISBN: (纸本)9781665429825

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.

关键词： Drugs Proteins Deep learning Industries Solid modeling Protein engineering Three-dimensional displays

来源：评论

学校读者我要写书评

暂无评论

CellMirror: Deciphering Cell Populations from Spatial Transcriptomics Data by Interpretable Contrastive Learning

CellMirror: Deciphering Cell Populations from Spatial Transc...

引用

Medical Artificial Intelligence (MedAI), IEEE International Conference on

作者： Junjie Xia Jiangnan Cui Zhenyu Huang Shuangquan Zhang Fang Yao Yijian Zhang Chunman Zuo Department of Applied Mathematics Institute of Artificial Intelligence Donghua University Shanghai China Institute of Artificial Institute Donghua University Shanghai China College of Computer Science and Technology Jilin University Changchun China School of Cyber Science and Engineering Nanjing University of Science and Technology Nanjing China Affiliated Shenzhen Maternity and Child Healthcare Hospital Institute of Maternal and Child Medicine Southern Medical University Shenzhen China Department of General Surgery Xinhua Hospital Affiliated to Shanghai Jiao Tong University of Medicine Shanghai China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

Spatial transcriptomics (ST) has enabled us elucidating tumor microenvironments, however, the technological limitations without single-cell resolution severely hinder its application. Here, we propose CellMirror, an interpretable contrastive learning model to decipher heterogeneous cell populations in ST data by single-cell RNA-sequencing (scRNA-seq) data. Specifically, CellMirror learns the disentangled shared (representing biological variations in both data) and salient features (specific to ST data) by two contrastive variational encoders, while constructing the relations between genes and features by a shared linear decoder. In various cancer samples, CellMirror outperforms other tools in learning common features for label transfer, and interpretation of features. Particularly, in breast cancer studies, CellMirror detects finer domains in ST data missed by other methods, and is robust to dissect cell populations in ST data using independent scRNA-seq data. These results demonstrate applications of CellMirror in interpreting the complex tumor structure in ST data by integrating scRNA-seq data.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A surrogate model based genetic algorithm for complex problem solving 6

A surrogate model based genetic algorithm for complex proble...

引用

6th Annual International Conference on Network and Information Systems for Computers, ICNISC 2020

作者： Pei, Ying Gao, Hao Han, Xiaosong College of Information Engineering Changchun University of Finance and Economics Changchun130122 China Key Laboratory for Symbol Computation Knowledge Engineering of National Education Ministry College of Computer Science and Technology College of Software Jilin University Changchun130012 China

It is well known that when the fitness function is relatively complex, the optimization time cost of the genetic algorithm will be extremely huge. To address this issue, the surrogate model was employed to predict the fitness value of the optimization problem, to reduce the number of actual calculated fitness values. In this paper, BP neural network, the least square method and support vector machine were fused in the genetic algorithm to evaluate partial individuals' fitness. Sufficient benchmark numerical experiments were conducted, and the results proved that the strategy could reduce the calculating counts of fitness function on similar accuracy basis compared with simple genetic algorithm. © 2020 Journal of Physics: Conference Series.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Simulation and Field Testing of Multiple Vehicles Collision Avoidance Algorithms

引用

IEEE/CAA Journal of Automatica Sinica 2020年第4期7卷 1045-1063页

作者： Chaoyue Zu Chao Yang Jian Wang Wenbin Gao Dongpu Cao Fei-Yue Wang the College of Computer Science and Technology Jilin UniversityChangchun 130012China Jiangsu XCMG Construction Machinery Research Institute Ltd. Xuzhou 221004China the College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of EducationJilin UniversityChangchun 130012 Chongqing Xibu Automobile Proving Ground Management Co.Ltd. Chongqing 404100China the State Grid JIBEI Electric Power Company Limited Management Training Center China the Advanced Vehicle Engineering Center Cranfield UniversityCranfield MK430ALUK the State Key Laboratory of Management and Control for Complex Systems Institute of AutomationChinese Academy of SciencesBeijing 100190China

A global planning algorithm for intelligent vehicles is designed based on the A* algorithm, which provides intelligent vehicles with a global path towards their destinations. A distributed real-time multiple vehicle collision avoidance(MVCA)algorithm is proposed by extending the reciprocal n-body collision avoidance method. MVCA enables the intelligent vehicles to choose their destinations and control inputs independently,without needing to negotiate with each other or with the coordinator. Compared to the centralized trajectory-planning algorithm, MVCA reduces computation costs and greatly improves the robustness of the system. Because the destination of each intelligent vehicle can be regarded as private, which can be protected by MVCA, at the same time MVCA can provide a real-time trajectory planning for intelligent vehicles. Therefore,MVCA can better improve the safety of intelligent vehicles. The simulation was conducted in MATLAB, including crossroads scene simulation and circular exchange position simulation. The results show that MVCA behaves safely and reliably. The effects of latency and packet loss on MVCA are also statistically investigated through theoretically formulating broadcasting process based on one-dimensional Markov chain. The results uncover that the tolerant delay should not exceed the half of deciding cycle of trajectory planning, and shortening the sending interval could alleviate the negative effects caused by the packet loss to an extent. The cases of short delay(< 100100 ms) and low packet loss(< 5%) can bring little influence to those trajectory planning algorithms that only depend on V2 V to sense the context, but the unpredictable collision may occur if the delay and packet loss are further worsened. The MVCA was also tested by a real intelligent vehicle, the test results prove the operability of MVCA.

关键词： Collision avoidance intelligent vehicles intervehicle communication simulation testing trajectory planning

来源：评论

学校读者我要写书评

暂无评论

Research on Opinion Spam Detection by Time Series Anomaly Detection 5th

Research on Opinion Spam Detection by Time Series Anomaly De...

引用

5th International Conference on Artificial Intelligence and Security, ICAIS 2019

作者： Wang, Ye Zuo, Wanli Wang, Ying College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China

ISBN: (纸本)9783030242732

With the continuous development of e-commerce, buying online product has become a more desirable shopping option for modern people, but the product reviews which people need to consult when they buy goods are easily become the root cause of misleading consumption. Black profit chains of online sales make a lot of spam opinion makers flood the network who guide consumer’s choice by writing deceptive and misleading spam opinions. In order to eliminate the impact of this black interest chain and safeguard the interests of the mass consumers, we propose a new model by using the time series anomaly detection, reducing the time complexity of spam opinion detection found by time series analysis, while improve the performance of spam detection. Based on time series anomaly detection, we analyze the content of reviews and the characteristics of reviewers and take experiments on real dataset that demonstrate advantages and effectiveness of the proposed approach. © 2019, Springer Nature Switzerland AG.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

UAV Swarm-enabled Collaborative Secure Relay Communications with Time-domain Colluding Eavesdropper

arXiv

引用

arXiv 2023年

作者： Zhang, Chuang Sun, Geng Wu, Qingqing Li, Jiahui Liang, Shuang Niyato, Dusit Leung, Victor C.M. The College of Computer Science and Technology Jilin University Changchun130012 China The Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China The Department of Electronic Engineering Shanghai Jiao Tong University Shanghai China Pillar of Engineering Systems and Design Singapore University of Technology and Design 487372 Singapore The School of Information Science and Technology Northeast Normal University Changchun130024 China The School of Computer Science and Engineering Nanyang Technological University 639798 Singapore The College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China The Department of Electrical and Computer Engineering University of British Columbia VancouverBCV6T 1Z4 Canada

Unmanned aerial vehicles (UAVs) as aerial relays are practically appealing for assisting Internet of Things (IoT) network. In this work, we aim to utilize the UAV swarm to assist the secure communication between the micro base station (MBS) equipped with the planar array antenna (PAA) and the IoT terminal devices by collaborative beamforming (CB), so as to counteract the effects of collusive eavesdropping attacks in time-domain. Specifically, we formulate a UAV swarm-enabled secure relay multi-objective optimization problem (US2RMOP) for simultaneously maximizing the achievable sum rate of associated IoT terminal devices, minimizing the achievable sum rate of the eavesdropper and minimizing the energy consumption of UAV swarm, by jointly optimizing the excitation current weights of both MBS and UAV swarm, the selection of the UAV receiver, the position of UAVs and user association order of IoT terminal devices. Furthermore, the formulated US2RMOP is proved to be a non-convex, NP-hard and large-scale optimization problem. Therefore, we propose an improved multi-objective grasshopper algorithm (IMOGOA) with some specific designs to address the problem. Simulation results exhibit the effectiveness of the proposed UAV swarm-enabled collaborative secure relay strategy and demonstrate the superiority of IMOGOA. Copyright © 2023, The Authors. All rights reserved.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：