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

International Conference on Information and Automation (ICIA)

作者： Bo Li Changsheng Zhang Ge Bai Erliang Zhang a. The computing center of Changchun Institute of Technology b. Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education c. Aviation university of air force Changchun China

The flowshop scheduling problem has been widely studied in the literature and many techniques have been applied to it, but few algorithms have been proposed to solve it using particle swarm optimization algorithm (PSO) based algorithm. In this paper, an improved PSO algorithm (IPSO) based on the ldquoall differentrdquo constraint is proposed to solve the flowshop scheduling problem with the objective of minimizing makespan. It combines the particle swarm optimization algorithm with genetic operators together effectively. When a particle is going to stagnates, the mutation operator is used to search its neighborhood. The proposed algorithm is tested on different scale benchmarks and compared with the recently proposed efficient algorithms. The results show that both the solution quality and the convergent speed of the IPSO algorithm precede the other two recently proposed algorithms. It can be used to solve large scale flowshop scheduling problem effectively.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Adaptive feature selection and extraction approaches for image retrieval based on region

引用

Journal of Multimedia 2010年第1期5卷 85-92页

作者： Song, Haiyu Li, Xiongfei Wang, Pengjie Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China Institute of Computer Graphics and Image Processing Dalian Nationalities University Dalian China State Key Laboratory of CAD and CG Zhejiang University Hangzhou China

Image retrieval based on region is one of the most promising and active research directions in recent year's CBIR, while region segmentation, feature selection and feature extraction of region are key issues. However, the existing approaches always adopt a uniform approach of segmentation and feature extraction for all images in the same system. In this paper, we propose adaptive image segmentation and feature extraction approach according to different category image for image retrieval system. To improve performance, we propose adaptive segmentation approach according to different category image. Textured image is segmented by Gaussian Mixture Models (GMM), while non-textured image is segmented by our proposed block-based normalized cut. To accurately describe feature of region, we propose weight assignment method for centroid pixel and its neighbor by convolution with normal distribution when image segmentation by GMM. To improve generalization, we propose adaptive number of Fourier descriptors of shape signature which depends on the energy distribution of Fourier descriptors, instead of fixed number by experience. To simply and efficiently describe the spatial relationships of multi-object or multi-region in same image, we apply simplified topological relationships. The experiments demonstrate that proposed approaches are superior to the traditional approaches. © 2010 ACADEMY PUBLISHER.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

2.5D ASF-UNet: Adjacent Slice Spatial Feature Fusion Model for WMH Segmentation from 3D MR Brain Image

2.5D ASF-UNet: Adjacent Slice Spatial Feature Fusion Model f...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Lan Huang Yinglu Sun Ziqi Zhao Chunjie Guo Yan Wang Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun China Department of Radiology the First Hospital of Jilin University Changchun China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

Segmenting brain white matter hyperintensities (WMH) from 3D Magnetic Resonance (MR) images is crucial for the diagnosis, treatment, and prognosis of Multiple Sclerosis (MS). Unlike common 2D images, this task is more challenging and time-consuming. Classical deep learning methods for 3D image segmentation face two main challenges: 1) Pure 3D networks have more parameters and are prone to overfitting. 2) When using 2D networks to segment slices of 3D images, the lack of 3D structural information results in suboptimal segmentation after reconstruction. To address these difficulties, we propose the 2.5D ASF-UNet, which employs the 2.5D workflow and uses adjacent slices as the input for 2D segmentation network ASF-UNet. In ASF-UNet, separate down-sampling paths are used for the adjacent slices, and the Local Spatial Attention Module (LSAM) is designed to more effectively integrate 3D spatial information into the 2D network. Additionally, the Conv_Spectral_Block (CSB) is designed to extract and integrate local and global features. It allows the model to capture global spatial structures while preserving detailed information. Experimental results on MICCAI MSSEG 2016 and Local MS datasets show that 2.5D ASF-UNet achieve better segmentation performance than other deep learning methods.

关键词： Deep learning Image segmentation Solid modeling Three-dimensional displays Multiple sclerosis Feature extraction Brain modeling White matter Prognostics and health management Overfitting

来源：评论

学校读者我要写书评

暂无评论

Toward Moiré-Free and Detail-Preserving Demosaicking

arXiv

引用

arXiv 2023年

作者： Li, Xuanchen Niu, Yan Zhao, Bo Shi, Haoyuan An, Zitong State Key Laboratory of Symbol Computation and Knowledge Engineering College of Computer Science and Technology Ministry of Education Jilin University Changchun China The College of Software Jilin University Changchun130012 China

3D convolutions are commonly employed by demosaicking neural models, in the same way as solving other image restoration problems. Counter-intuitively, we show that 3D convolutions implicitly impede the RGB color spectra from exchanging complementary information, resulting in spectral-inconsistent inference of the local spatial high frequency components. As a consequence, shallow 3D convolution networks suffer the Moiré artifacts, but deep 3D convolutions cause over-smoothness. We analyze the fundamental difference between demosaicking and other problems that predict lost pixels between available ones (e.g., super-resolution reconstruction), and present the underlying reasons for the confliction between Moiré-free and detail-preserving. From the new perspective, our work decouples the common standard convolution procedure to spectral and spatial feature aggregations, which allow strengthening global communication in the spectral dimension while respecting local contrast in the spatial dimension. We apply our demosaicking model to two tasks: Joint Demosaicking-Denoising and Independently Demosaicking. In both applications, our model substantially alleviates artifacts such as Moiré and over-smoothness at similar or lower computational cost to currently top-performing models, as validated by diverse evaluations. Source code will be released along with paper publication. Copyright © 2023, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Extracting Attributes from Deep Web Interface Using Instances

Extracting Attributes from Deep Web Interface Using Instance...

引用

Computer Science and Information engineering, CSIE, WRI World Congress on FLAGGED

作者： Hao Liang Fei Ren Wanli Zuo Fengling He Junhua Wang College of Computer Science and Technology Jilin University Changchun China Department of Information Changchun Taxation College Changchun China Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education Changchun China

There is myriad high quality information in the Deep Web and the feasible method to access the Deep Web is through the query interface of the Deep Web. Itpsilas necessary to extract abundant attributes and semantic relation description from the query interface. Automatic extracting attributes from the query interface and automatically translating a query is a solvable way for addressing the current limitations in accessing Deep Web data sources. We design a framework to automatically extract the attributes and instances from the query interface using the WordNet as a kind of ontology technique to enrich the semantic description of the attributes. Each attribute is extended into a candidate attribute set in the form of a hierarchy tree. At the same time, the hierarchy tree generated by ontology describes the semantic relation of the attributes in the same query interface. We carry out our experiments in the real-world domain. The results of the experiments showed the validation of query translation framework.

关键词： Data mining Ontologies Computer science Educational institutions Databases Programming profession HTML Laboratories Computer interfaces knowledge engineering

来源：评论

学校读者我要写书评

暂无评论

Shortcut Learning in In-Context Learning: A Survey

arXiv

引用

arXiv 2024年

作者： Song, Rui Li, Yingji Shi, Lida Giunchiglia, Fausto Xu, Hao College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University China Department of Information Engineering and Computer Science University of Trento Italy

Shortcut learning refers to the phenomenon where models employ simple, non-robust decision rules in practical tasks, which hinders their generalization and robustness. With the rapid development of Large Language Models (LLMs) in recent years, an increasing number of studies have shown the impact of shortcut learning on LLMs. This paper provides a novel perspective to review relevant research on shortcut learning in In-Context Learning (ICL). It conducts a detailed exploration of the types of shortcuts in ICL tasks, their causes, available benchmarks, and strategies for mitigating shortcuts. Based on the corresponding observations, we summarize the unresolved issues in existing research and attempts to outline the future research landscape of shortcut learning. © 2024, CC BY.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Research and Design of Drawings Retrieval System Based on Spatial Relationships and Shape

Research and Design of Drawings Retrieval System Based on Sp...

引用

ISECS International Colloquium on Computing, Communication, Control, and Management, CCCM

作者： Haiyu Song Pengjie Wang Xiongfei Li Houjie Li Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun Jilin China The Research Institute of Computer Graphics and Image Processing Dalian Nationalities of University Dalian Liaoning China

CAD drawings reuse is of great importance in promoting design efficiency and productivity. The ability to retrieve CAD drawings is the core of drawings reuse task. Most of the existing drawings retrieval systems rely only on text descriptions. Due to complexity of visual feature, a little system is based on content. A simplified topological relationship is proposed to describe visual features for dimension reduction. An effective topological relationship vector is constructed by graph spectra. A novel retrieval system based on visual contents, including topological relationships, shape, and directional relationships, is proposed. The experiments show that the proposed approach and system are superior to the text-based and traditional content-based retrieval systems.

关键词： Shape Feature extraction Topology Indexing Design automation Data mining Visualization

来源：评论

学校读者我要写书评

暂无评论

Medicine composition concentration analysis based on least square support vector machine

Medicine composition concentration analysis based on least s...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Xin-Chen Guo Zhou-Yi Chen Li-Rong Teng Chun-Guo Wu Tian-Bao Du Jia-Huilu Qing-Fan Meng Yan-Chun Liang College of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China College of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Changchun China College of Science Northeast China Institute of Electric Power Engineering Jilin China EAAF of PLA Institute of General Development and Evaluation of Equipment Beijing China College of Life Science Jilin University Changchun China

This paper presents a method of medicine composition concentration analysis based on least square support vector machines (LS-SVMs) and examines the importance of the hyperparameter choice in improvement of algorithm performance. Simulation results show that the proposed method obtains high quality precision in the generalization, compared with multiple linear regression, and that it is an efficient approach to regression estimation.

关键词： Least squares methods Support vector machines Educational institutions Performance analysis Algorithm design and analysis knowledge engineering Linear regression Spectral analysis Quadratic programming Lagrangian functions

来源：评论

学校读者我要写书评

暂无评论

The TPSO algorithm to solve geometric constraint problems

引用

Journal of computational Information Systems 2006年第4期2卷 1311-1316页

作者： Yuan, Hua Li, Wenhui Yi, Rongqin Zhao, Kong Key Laboratory of Symbol Computation and Knowledge Engineering College of Computer Science and Technology Jilin University Changchun 130012 China School of Computer Science and Engineering Changchun University of Technology Changchun 130012 China Suzhou Top Institute of Information Technology Suzhuo 215311 China

The constraint problem can be transformed to an optimization problem. Particle swarm optimization (PSO) is a new evolutionary computation technique. Even PSO has many attractive properties, but it lacks global search ability at the end of the run. This paper introduce a hybrid approach called the TPSO that simultaneously applies particle swarm optimization (PSO), and tabu search (TS) to create a generally well-performing search heuristics, and combat the problem of premature convergence. The new algorithm considers candidate solutions and their fitness as individuals, which are based on their recent search progress. The tabu search makes each particle to reset its record of its best position, to avoid making direction and velocity decisions on the basis of outdated information. The feasibility of the proposed method is demonstrated on Solving Geometric Constraint Problems.

关键词： Computer aided design

来源：评论

学校读者我要写书评

暂无评论

Genetic algorithm with affinity propagation

Genetic algorithm with affinity propagation

引用

International Conference on Information and Automation (ICIA)

作者： Chunguo Wu Hao Gao Lianjiang Yu Yanchun Liang Rongwu Xiang College of Computer Science and Technology Key Laboratory for Symbol Computation and Knowledge Engineering of National Education Ministry Jilin University Changchun China School of Basic Courses Shenyang Pharmaceutical University Shenyang China

ISBN: (纸本)9781424457014

Classical genetic algorithm suffers heavy pressure of fitness evaluation for time-consuming optimization problems, e.g., aerodynamic design optimization, qualitative model learning in bioinformatics. To address this problem, we present a combination between genetic algorithms and clustering methods. Specifically, the clustering method used in this paper is affinity propagation. The numerical experiments demonstrate that the proposed method performs promisingly for well-known benchmark problems in the term of optimization accuracy.

关键词： Genetic algorithms Clustering methods Evolutionary computation Design optimization Optimization methods Design automation Computer science Educational technology Pharmaceutical technology knowledge engineering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：