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

27th AAAI Conference on Artificial Intelligence, AAAI 2013

作者： Li, Hongbo Liang, Yanchun Guo, Jinsong Li, Zhanshan Key Laboratory for Symbol Computation and Knowledge Engineering of National Education Ministry College of Computer Science and Technology Jilin University Changchun 130012 China

ISBN: (纸本)9781577356158

Simple Tabular Reduction algorithms (STR) work well to establish Generalized Arc Consistency (GAC) on positive table constraints. However, the existing STR algorithms are useless for negative table constraints. In this work, we propose a novel STR algorithm and its improvement, which work on negative table constraints. Our preliminary experiments are performed on some random instances and a certain benchmark instances. The results show that the new algorithms outperform GAC-valid and the MDD-based GAC algorithm. Copyright © 2013, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Identification of transcription factor binding sites using GA and PSO

Identification of transcription factor binding sites using G...

引用

6th International Conference on Intelligent Systems Design and Applications (ISDA 2006)

作者： Chang, Xiao-Yu Zhou, Chun-Guang Li, Yan-Wen Hu, Ping Key Laboratory of Symbol Computation and J Knowledge Engineering Jilin University Ministry of Education China Department of Computer Science Northeast Normal University Changchun 130012 China

ISBN: (纸本)0769525288

Identification of transcription factor binding sites from the upstream regions of genes is a highly important and unsolved problem. In this paper, we propose a novel framework for using evolutionary algorithm to solve this challenging issue. Under this framework, we use two prevalent evolutionary algorithms: Genetic, Algorithm (GA) and Particle Swarm Optimization (PSO) to find unknown sites in a collection of relatively long intergenic sequences that are suspected of being bound by the same factor. This paper represents binding sites motif to position weight matrix (PWM) and introduces how to code PWM to genome for GA and how to code it to particle for PSO. We apply these two algorithms to 5 different yeast Saccharomyces Cerevisiae transcription factor binding sites and CRP binding sites. The results on Saccharomyces Cerevisiae show that it can find the correct binding sites motifs, and the result on CRP shows that these two algorithms can achieve more accuracy than MEME and Gibbs Sampler.

关键词： Binding sites

来源：评论

学校读者我要写书评

暂无评论

A Fuzzy neural network system based on generalized class cover and particle swarm optimization

A Fuzzy neural network system based on generalized class cov...

引用

International Conference on Intelligent Computing, ICIC 2005

作者： Huang, Yanxin Wang, Yan Zhou, Wengang Yu, Zhezhou Zhou, Chunguang College of Computer Science and Technology Jilin University Key Laboratory for Symbol Computation and Knowledge Engineering of the National Education Ministry Changchun 130012 China

A voting-mechanism-based fuzzy neural network system is proposed in this paper. When constructing the network structure, a generalized class cover problem is presented and its two solving algorithm, an improved greedy algorithm and a binary particle swarm optimization algorithm, are proposed to get the class covers with relatively even radii, which are used to partition fuzzy input space and extract fewer robust fuzzy IF-THEN rules. Meanwhile, a weighted Mamdani inference mechanism is adopted to improve the efficiency of the system output and a real-valued particle swarm optimization-based algorithm is used to refine the system parameters. Experimental results show that the system is feasible and effective. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

Warburg Effects in Cancer and Normal Proliferating Cells:Two Tales of the Same Name

引用

Genomics, Proteomics & Bioinformatics 2019年第3期17卷 273-286页

作者： Huiyan Sun Liang Chen Sha Cao Yanchun Liang Ying Xu The China-Japan Union Hospital Jilin UniversityChangchun 130033China MOE Key Laboratory of Symbolic Computation and Knowledge Engineering College of Computer Science and TechnologyJilin UniversityChangchun 130012China Computational Systems Biology Lab Department of Biochemistry and Molecular Biology and Institute of BioinformaticsUniversity of GeorgiaAthensGA 30602USA Faculty of Health Sciences University of MacaoTaipaMacao SAR 999078China Department of Biostatistics School of MedicineIndiana UniversityIndianapolisIN 46202USA Zhuhai Laboratory of MOE Key Laboratory of Symbolic Computation and Knowledge Engineering Zhuhai College of Jilin UniversityZhuhai 519041China

It has been observed that both cancer tissue cells and normal proliferating cells(NPCs)have the Warburg *** goal here is to demonstrate that they do this for different *** accomplish this,we have analyzed the transcriptomic data of over 7000 cancer and control tissues of 14 cancer types in TCGA and data of five NPC types in *** analyses reveal that NPCs accumulate large quantities of ATPs produced by the respiration process before starting the Warburg effect,to raise the intracellular pH from 6.8 to 7.2 and to prepare for cell division *** cell cycle starts,the cells start to rely on glycolysis for ATP generation followed by ATP hydrolysis and lactic acid release,to maintain the elevated intracellular pH as needed by cell division since together the three processes are pH *** cells go back to the normal respirationbased ATP production once the cell division phase *** comparison,cancer cells have reached their intracellular pH at 7.4 from top down as multiple acid-loading transporters are up-regulated and most acid-extruding ones except for lactic acid exporters are *** cells use continuous glycolysis for ATP production as way to acidify the intracellular space since the lactic acid secretion is decoupled from glycolysis-based ATP generation and is pH balanced by increased expressions of acid-loading ***-expression analyses suggest that lactic acid secretion is regulated by external,non-pH related ***,our data strongly suggest that the two cell types have the Warburg effect for very different reasons.

关键词： Cancer Warburg effect Fenton reaction Cell proliferation pH homeostasis

来源：评论

学校读者我要写书评

暂无评论

Solving constrained traveling salesman problems by genetic algorithms

引用

自然科学进展(英文版) 2004年第7期14卷 631-637页

作者： WU Chunguo LIANG Yanchun LEE Heowpueh LU Chun LIN Wuzhong College of Computer Science and Technology Jilin University Key Laboratory for Symbol Computation and Knowledge Engineering Ministry of Education of China Changchun 130012 China Institute of High Performance Computing Singapore 117528 Singapore Institute of High Performance Computing Singapore 117528 Singapore

Three kinds of constrained traveling salesman problems (TSP) arising from application problems, namely the open route TSP, the end-fixed TSP, and the path-constrained TSP, are proposed. The corresponding approaches based on modified genetic algorithms (GA) for solving these constrained TSPs are presented. Numerical experiments demonstrate that the algorithm for the open route TSP shows its advantages when the open route is required, the algorithm for the end-fixed TSP can deal with route optimization with constraint of fixed ends effectively, and the algorithm for the path-constraint could benefit the traffic problems where some cities cannot be visited from each other.

关键词： constrained traveling salesman problem genetic algorithm Hamiltonian path open route fixed end

来源：评论

学校读者我要写书评

暂无评论

ESAE: Evolutionary Strategy-Based Architecture Evolution 14th

ESAE: Evolutionary Strategy-Based Architecture Evolution

引用

14th International Conference on Bio-inspired Computing: Theories and Applications, BIC-TA 2019

作者： Gu, Xue Meng, Ziyao Liang, Yanchun Xu, Dong Huang, Han Han, Xiaosong Wu, Chunguo Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun130012 China Zhuhai Laboratory of Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education School of Computer Zhuhai College of Jilin University Zhuhai519041 China Department of Electrical Engineering and Computer Science Informatics Institute and Christopher S. Bond Life Sciences Center University of Missouri ColumbiaMO65211 United States School of Software Engineering South China University of Technology GuangZhou510006 China

ISBN: (纸本)9789811534249

Although deep neural networks (DNNs) play important roles in many fields, the architecture design of DNNs can be challenging due to the difficulty of input data representation, the huge number of parameters and the complex layer relationships. To overcome the obstacles of architecture design, we developed a new method to generate the optimal structure of DNNs, named Evolutionary Strategy-based Architecture Evolution (ESAE), consisting of a bi-level representation and a probability distribution learning approach. The bi-level representation encodes architectures in the gene and parameter levels. The probability distribution learning approach ensures the efficient convergence of the architecture searching process. By using Fashion-MNIST and CIFAR-10, the effectiveness of the proposed ESAS is verified. The evolved DNNs, starting from a trivial initial architecture with one single convolutional layer, achieved the accuracies of 94.48% and 93.49% on Fashion-MNIST and CIFAR-10, respectively, and require remarkably less hardware costs in terms of GPUs and running time, compared with the existing state-of-the-art manual screwed architectures. © 2020, Springer Nature Singapore Pte Ltd.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Image registration based on pseudo-polar FFT and analytical fourier-mellin transform

Image registration based on pseudo-polar FFT and analytical ...

引用

International Conference on Intelligent Computing, ICIC 2005

作者： Guo, Xiaoxin Xu, Zhiwen Lu, Yinan Liu, Zhanhui Pang, Yunjie College of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University Qianjin Street 2699 Changchun 130012 China

ISBN: (纸本)9783540282266

This paper proposes a novel registration algorithm based on Pseudo-Polar Fast Fourier Transform (FFT) and Analytical Fourier-Mellin Transform (AFMT) for the alignment of images differing in translation, rotation angle, and uniform scale factor. The proposed algorithm employs the AFMT of the Fourier magnitude to determine all the geometric transformation parameters with its property of the invariance to translation and rotation. Besides, the proposed algorithm adopt a fast high accuracy conversion from Cartesian to polar coordinates based on the pseudo-polar FFT and the conversion from the pseudo-polar to the polar grid, which involves only ID interpolations, and obtain a more significant improvement in accuracy than the conventional method using cross-correlation. Experiments show that the algorithm is accurate and robust regardless of white noise. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Image processing

来源：评论

学校读者我要写书评

暂无评论

An efficient method for very large scale out-of-core terrain visualization

An efficient method for very large scale out-of-core terrain...

引用

16th International Conference on Artificial Reality and Telexistence - Workshops, ICAT 2006

作者： Zhang, Huijie Sun, Jigui Yu, Haihong Qi, Changsong College of Computer Science and Technology Jilin University College of Computer Science Northeast Normal University Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education

ISBN: (纸本)076952754X

Large scale terrain visualization with high-resolution has an increasing demand in many research fields. To realize the efficient rendering of terrain, this paper presents an out-of-core terrain visualization method based on multi-resolution storage techniques. In external memory, the terrain data set is subdivided from top to bottom to build a multi-resolution hierarchical structure based on a quad-tree. The hierarchical structure can decimate the elevation data that must be loaded into internal memory. Thus it can improve the efficiency of I/O access greatly. Moreover, in order to implement rapid data retrieval of the real time terrain flyover, an efficient indexing algorithm is proposed, in which those nodes in the hierarchical structure will be divided into several clusters in terms of the similarities of static error and the closed space constraint. In addition, a method for crack-free is also proposed here. The comprehensive experiment conducted on the GTOP30 data set shows that this approach outperforms the Block and the Hierarchy algorithms in the both ways of efficiency and simplification ratio. © 2006 IEEE.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

A hybrid algorithm for combining forecasting based on AFTER-PSO

A hybrid algorithm for combining forecasting based on AFTER-...

引用

8th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2004: Trends in Artificial Intelligence

作者： Feng, Xiaoyue Liang, Yanchun Sun, Yanfeng Lee, Heow Pueh Zhou, Chunguang Wang, Yan Key Laboratory of Symbol Computation and Knowledge Engineering Juin University Ministry of Education Changchun 130012 China Institute of High Performance Computing Singapore 117528 Singapore

ISBN: (纸本)3540228179

A novel hybrid algorithm based on the AFTER (Aggregated forecast through exponential re-weighting) and the modified particle swarm optimization (PSO) is proposed. The combining weights in the hybrid algorithm are trained by the modified PSO. The linear constraints are added in the PSO to ensure that the sum of the combining weights is equal to one. Simulated results on the prediction of the stocks data show the effectiveness of the hybrid algorithm. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Algorithms

来源：评论

学校读者我要写书评

暂无评论

Community discovery algorithm and its technical improvement based on link structure–taking web community algorithm as an example

Community discovery algorithm and its technical improvement ...

引用

International Conference on Applications and Techniques in Cyber Intelligence, ATCI 2020

作者： Gao, Rui Yang, Wenzhe Shi, Xiaohu Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education College of Computer Science and Technology Jilin University 2699 Qianjin Street Changchun130012 China

ISBN: (纸本)9783030539795

Link analysis is an important way to discover potential web communities. This paper analyzes the characteristics of the Web link structure, and studies the traditional maximum flow algorithm and the maximum flow algorithm based on HITS algorithm for edge capacity allocation. The traditional maximum flow problem, but there are still shortcomings. Based on the analysis of existing link similarity definitions, this paper proposes a new definition of link similarity and topic dissimilarity to better describe the relationship between linked pages, and to measure based on link similarity and topic dissimilarity. The similarity of the pages gives a more reasonable and efficient maximum flow-side capacity allocation scheme. The community discovery of 6 topics shows that the maximum flow algorithm proposed in this paper using the link similarity and topic dissimilarity model to allocate edge capacity can better solve the problems of existing algorithms and significantly improve the quality of the Web community. This paper proposes new methods and ideas for page similarity measurement, and provides new strategies for improving the Web community discovery algorithm based on link analysis. © The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2021.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：