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

Error Formulas for Lagrange Projectors Determined by Cartesian Sets

Journal of Systems Science & Complexity 2018年第4期31卷 1090-1102页

作者： LI Zhe ZHANG Shugong DONG Tian GONG Yihe School of Science Changchun University of Science and Technology Changchun 130022 China Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Changchun 130012 China School of Mathematics Key Laboratory of Symbolic Computation and Knowledge Engineering (Ministry of Education) Jilin University Changchun 130012 China Northeast Electric Power University Jilin 132012 China School of Mathematics Jilin University Changchun 130012 China

This paper studies error formulas for Lagrange projectors determined by Cartesian sets. Cartesian sets are properly subgrids of tensor product grids. Given interpolated functions with all order continuous partial derivatives, the authors directly construct the good error formulas for Lagrange projectors determined by Cartesian sets. Owing to the special algebraic structure, such a good error formula is useful for error estimate.

关键词： Cartesian sets error formulas ideal interpolation multivariate polynomial interpolation

来源：评论

学校读者我要写书评

暂无评论

Job Placement Strategy with Opportunistic Resource Sharing for Distributed Deep Learning Clusters

Job Placement Strategy with Opportunistic Resource Sharing f...

引用

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Hongliang Li Ting Sun Xiang Li Haixiao Xu College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of the Ministry of Education Changchun China High Performance Computing Center of Jilin University Changchun China

ISBN: (纸本)9781728176505

Distributed deep learning frameworks train large deep leaning workload with multiple training jobs on shared distributed GPU servers. There are new challenges when scheduling resources for these systems. Modern deep learning training jobs tend to consume large amount of GPU memory. A training job has an iterative nature that causes the memory usage fluctuate overtime. Jobs sharing a host may suffer from significant performance degradation caused by memory overload in runtime. Moreover, even without memory overloads, deep learning training jobs still experience different levels of performance interference when sharing a GPU device. This paper studies these two issues. We introduced an opportunistic memory sharing model to allocate resources for training jobs with time-varying memory requirements. Based on this model, we introduced an opportunistic Job Placement Problem (OJPP) for shared GPU clusters that seeks job placement configurations using minimum number of GPU devices and guarantees user-defined performance requirements. We proposed a greedy algorithm and a heuristic algorithm with computational complexities of $O(n\log n)$ and $O(n^{2}\log n)$, respectively, to solve the problem. Extensive experiments are conducted using a GPU cluster to verify the correctness, effectiveness, and the scalability of our approaches. The proposed approach achieved over 80% percent of the standalone performance, in term of average job completion time, with less than 30% extra resources consumption.

关键词： Training Deep learning Performance evaluation Greedy algorithms High performance computing Heuristic algorithms computational modeling

来源：评论

学校读者我要写书评

暂无评论

Efficient zonal diagnosis with maximum satisfiability

引用

Science China(Information Sciences) 2018年第11期61卷 17-30页

作者： Meng LIU Dantong OUYANG Shaowei CAI Liming ZHANG College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of EducationJilin University State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences

Model-based diagnosis(MBD) has been widely acknowledged as an effective diagnosis ***, for large scale circuits, it is difficult to find all cardinality-minimal diagnoses within a reasonable time. This paper proposes a novel method that takes a significant step in this direction. The idea is to divide a circuit into zones and compute the cardinality-minimal diagnoses by finding subset-minimal diagnoses with cardinality-minimal via a maximum satisfiability(MaxSAT) solver on an abstracted circuit that is composed of these zones instead of all components. We also propose a new propagate-extend method for extending the seed-TLDs to obtain all cardinality-minimal diagnoses efficiently. We implement our method with a state-of-the-art core-guided MaxSAT solver, and present evidence that it significantly improves the diagnosis efficiency on ISCAS-85 circuits. Our method outperforms SATbD, which was recently shown to outperform most complete MBD approaches using satisfiability(SAT).

关键词： model-based diagnosis MaxS AT subset-minimal diagnoses cardinality-minimal diagnoses zone propagate-extend

来源：评论

学校读者我要写书评

暂无评论

Joint optimization QoS and security of wireless communication networks 7

Joint optimization QoS and security of wireless communicatio...

引用

7th International Conference on Information Technology: IoT and Smart City, ICIT 2019

作者： Su, Xiaochun Liu, Yanheng Wan, Jian College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation Jilin University Changchun130012 China Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China

ISBN: (纸本)9781450376631

Currently, security and quality of service (QoS) are critical for any network. The main purpose of security mechanisms is to provide identity authentication, protect information, and ensure that the received information is not tampered with;the aim of QoS is to provide better network communication services. Security and QoS are not independent of each other. The security mechanism affects QoS and vice versa. Both QoS and security pose resource management problems and are conflicting when resources are limited. QoS requires security mechanisms to ensure proper allocation and service cost, and an inappropriate security mechanism will reduce the performance of the communication quality. Currently, numerous real-time, big data, and diverse applications and services have emerged. Moreover, the number of potential threats is expected to increase dramatically. Therefore, combining QoS and security is important. However, as they are difficult to model owing to their internal conflict, QoS and security are normally separated or optimized at a particular point using game theory. From the perspective of resource allocation, this study uses optimization method and considers security and QoS resource optimization by dividing resources into two categories: space (bandwidth) and time (delay). In order to harmonize the QoS and security, in this paper, the two conflicting terms "communication" and "security" are considered as two individual aspect. Furthermore, we construct a model wherein the joint utility is maximized by controlling the packet length. We formulate the utility functions of these two aspects with respect to the effective throughput. The results show that the presented optimization method enables a mobile node to adaptively select specific packet length based on the optimum curve. With the obtained packet length values, the joint utility reach to the maximum so that satisfactory communication quality can be realized without compromising the security, thereby improvin

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Copy-Move Forgery Detection Based on Interest Point and Local Search Algorithm

Copy-Move Forgery Detection Based on Interest Point and Loca...

引用

IEEE International Conference on Cloud Computing and Intelligence Systems (CCIS)

作者： Fang Mei Jing Lyu Yingda Lyu Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

ISBN: (数字)9781728138633

ISBN: (纸本)9781728138640

Copy-move forgery detection mainly includes block-based and interest point-based methods, but both of them have shortcomings, such as weak resistance to affine transformations, weak ability to locate the forged region. To solve these problems, a novel algorithm is proposed in this paper, which involves two-stage search algorithm. The first stage takes image blocks as the search unit, and in the second stage, the forger region is searched at the pixel level. Experimental results demonstrate that the proposed method performants better compared to recent state-of-the-art methods.

关键词： Rail to rail outputs

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Reinforcement Learning-based Non-Autoregressive Solver for Traveling Salesman Problems

arXiv

引用

arXiv 2023年

作者： Xiao, Yubin Wang, Di Li, Boyang Chen, Huanhuan Pang, Wei Wu, Xuan Li, Hao Xu, Dong Liang, Yanchun Zhou, You The Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education College of Computer Science and Technology Jilin University Changchun130012 China The Joint NTU-UBC Research Centre of Excellence in Active Living for the Elderly Nanyang Technological University 639798 Singapore The School of Computer Science and Engineering Nanyang Technological University 639798 Singapore The School of Computer Science University of Science & Technology of China Hefei230026 China The School of Mathematical and Computer Sciences Heriot-Watt University EdinburghEH14 4AS United Kingdom College of Computer National University of Defense Technology Hunan Changsha410073 China The Department of Electrical Engineering and Computer Science Bond Life Sciences Center University of Missouri Columbia United States The School of Computer Science Zhuhai College of Science and Technology Zhuhai519000 China

The Traveling Salesman Problem (TSP) is a well-known combinatorial optimization problem with broad real-world applications. Recently, neural networks have gained popularity in this research area because as shown in the literature, they provide strong heuristic solutions to TSPs. Compared to autoregressive neural approaches, non-autoregressive (NAR) networks exploit the inference parallelism to elevate inference speed but suffer from comparatively low solution quality. In this paper, we propose a novel NAR model named NAR4TSP, which incorporates a specially designed architecture and an enhanced reinforcement learning strategy. To the best of our knowledge, NAR4TSP is the first TSP solver that successfully combines RL and NAR networks. The key lies in the incorporation of NAR network output decoding into the training process. NAR4TSP efficiently represents TSP encoded information as rewards and seamlessly integrates it into reinforcement learning strategies, while maintaining consistent TSP sequence constraints during both training and testing phases. Experimental results on both synthetic and real-world TSPs demonstrate that NAR4TSP outperforms five state-of-the-art models in terms of solution quality, inference speed, and generalization to unseen scenarios. Copyright © 2023, The Authors. All rights reserved.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

Efficient reinforcement learning in continuous state and action spaces with Dyna and policy approximation

引用

Frontiers of Computer Science 2019年第1期13卷 106-126页

作者： Shan ZHONG Quan LIU Zongzhang ZHANG Qiming FU School of Computer Science and Technology Soochow UniversitySuzhou 215000China School of Computer Science and Engineering Changshu Institute of TechnologyChangshu 215500China Jiangsu Province Key Laboratory of Intelligent Building Energy Efficiency Suzhou University of Science and TechnologySuzhou 215006China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012China Collaborative Innovation Center of Novel Software Technology and Industrialization Nanjing 210000China College of Electronic &Information Engineering Suzhou University of Science and TechnologySuzhou 215000China

Dyna is an effective reinforcement learning (RL) approach that combines value function evaluation with model ***,existing works on Dyna mostly discuss only its efficiency in RL problems with discrete action *** paper proposes a novel Dyna variant,called Dyna-LSTD-PA,aiming to handle problems with continuous action ***-LSTD-PA stands for Dyna based on least-squares temporal difference (LSTD)and policy ***-LSTD-PA consists of two simultaneous,interacting *** learning process determines the probability distribution over action spaces using the Gaussian distribution;estimates the underlying value function,policy,and model by linear representation;and updates their parameter vectors online by LSTD(,t).The planning process updates the parameter vector of the value function again by using ofttine LSTD(2).Dyna-LSTD-PA also uses the Sherman-Morrison formula to improve the efficiency of LSTD(,t),and weights the parameter vector of the value function to bring the two processes ***,the global error bound is derived by considering approximation,estimation,and model ***,Dyna-LSTD-PA outperforms two representative methods in terms of convergence rate,success rate,and stability performance on four benchmark RL problems.

关键词： problem solving control methods heuristic search methods dynamic programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Hypergraph-driven soft semantics flexible learning for visible–infrared person re-identification

引用

engineering Applications of Artificial Intelligence 2025年 158卷

作者： Zhu, Jiacheng Ge, Hongwei Liu, Yuxuan Wu, Chunguo Fan, Jiulin School of Computer Science and Technology Dalian University of Technology No. 2 Linggong Road Dalian Liaoning 116024 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University No. 2699 Qianjin Street Changchun Jilin 130012 China Huadian Coal Industry Group Co Ltd. No. 2 Xuanwumennei Street Beijing 100031 China

Visible–infrared person re-identification (VI-ReID) aims to match the images of the person across different modalities. The main challenge in the engineering application of VI-ReID lies in the considerable modality gap between visible and infrared images. Existing methods primarily focus on learning low-order hard semantics to reduce the modality gap, such as specific body parts (e.g., arms, legs, and hands), which are modality-specific and sensitive to cross-modality variations, leading to difficult modality alignment. However, high-order soft semantics contain more modality-invariant features that can be flexibly learned by the model to better align the cross-modality features and reduce the modality gap. To better learn soft semantics, we propose a novel, hypergraph-driven soft semantics flexible learning network (HSFLNet), which extracts hierarchical semantics and flexibly explores the relationships among the extracted soft semantics by using hypergraph neural networks (HGNNs). Specifically, first, we propose a soft semantics mining (SSM) module to capture and flexibly fuse hierarchical features, which integrates low- and high-level semantics across channel and spatial dimensions to align modalities. Second, a hypergraph-driven soft semantics flexible learning (HSFL) module is designed, which employs HGNNs to explore the relationships among soft semantics. These semantics are adaptively learned through gating mechanisms to capture modality-invariant features, thereby reducing the modality gap. We evaluate the performance of HSFLNet on SYSU-MM01, RegDB, and low-light cross-modality (LLCM) datasets, achieving a Rank-1/mean average precision of 75.09%/72.11%, 95.82%/92.42%, and 65.42%/68.55%, respectively. Experimental results demonstrate that HSFLNet outperforms state-of-the-art VI-ReID methods. Our code is available at https://***/Jiacheng813/HSFLNet. © 2025 Elsevier Ltd

关键词： Cross-modality retrieval Hypergraph neural networks Soft semantics Visible–infrared person re-identification

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：