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

2010 IEEE International Conference on Intelligent Computing and Intelligent Systems, ICIS 2010

作者： Huo, Linlin Ouyang, Jihong Liu, Dayou Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun China

ISBN: (纸本)9781424465835

To represent and reason with interval-value information of applications in description logic, based on interval-fuzzy set the classical des cription logic ALCN is extended to the fuzzy description logic IFALCN. Its' syntax, semantics and fuzzy tableau algorithm are presented in detail. Our work enhances the expressiveness and reasoning ability of ALCN. IFALCN is the generalization of fuzzy ALCN based on single value and more expressive than the latter and can conform to human cognition better. ©2010 IEEE.

关键词： Fuzzy sets

来源：评论

学校读者我要写书评

暂无评论

An Efficient Method for Calculating Qualitative Spatial Relations

引用

电子学报(英文版) 2009年第1期18卷 42-46页

作者： WANG Shengsheng LIU Dayou College of Computer Science and Technology Key Laboratory of Symbolic Computing and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China

Qualitative spatial relations are widely used in geospatial ontologies, geospatial (semantic) web services, spatial description logics etc. Methodology to obtain qualitative spatial relations (especially complex spatial relations) from Geographical information system (GIS) has not been studied in previous literatures. An efficient method for calculating complex qualitative spatial relations is discussed here. First, the multi-granularities approximate representation of spatial objects is proposed, it is designed for GIS object types (such as polygon), and requires less process time. Then some algorithms for calculating complex spatial relations based on the multi-granularities approximate representation are given. Finally, this method is implemented and used to obtain topology and direction relations from world map. The analysis and test results show that this method supports complex and integrated spatial relations and requires less process time than traditional method. This method is suitable for obtaining spatial relations for geospatial ontologies and other applications.

关键词：空间关系计算地理信息系统地理本体信息系统设计网络服务描述逻辑空间对象

来源：评论

学校读者我要写书评

暂无评论

Few-Shot Fine-Grained Classification of Histological Images 1

Few-Shot Fine-Grained Classification of Histological Images

引用

1st IEEE International Conference on Medical Artificial Intelligence, MedAI 2023

作者： Jiang, Yingdong Huang, Jing Jin, Zihe Shen, Leqi Zhang, Ziyi College of Software Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education ChangChun China College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education ChangChun China College of Computer Science and Technology Jilin University ChangChun China

ISBN: (纸本)9798350358780

Histological image classification plays a crucial role in cancer diagnosis. However, the acquisition of well-labeled histological images is prohibitively expensive, and obtaining rare abnormal samples is challenging. Therefore, applying few-shot learning methods to histological image classification tasks holds significant clinical value. Nevertheless, existing research predom-inantly relies on coarse-grained image classification approaches based on natural image datasets, which struggle to address the fine-grained challenges encountered in histological image classification, such as intra-class diversity and inter-class similarity. To tackle this issue, this study proposes a novel few-shot fine-grained classification method for histological images, named 'Category-Aware Feature Map Reconstruction Network.' This method employs channel weights to localize the differences between inter-class and intra-class regions, composed of intra-class channel weights and inter-class channel weights, collectively referred to as category-aware weights. Specifically, intra-class channel weights indicate the matching degree of salient regions within the support set of a particular class, while inter-class channel weights represent the degree of containing distinct information between classes. The category-aware weights are utilized to transform the support feature maps and query feature maps, generating feature maps that capture differentiating details between categories. Finally, the distance between the transformed query feature map and support feature map is calculated to achieve probabilistic predictions for the categories. On a histological few-shot dataset, this method achieves an accuracy of 90.23% using ResNet-12 as the feature extractor, surpassing the baseline model by 5.24% and outperforming other few-shot methods by at least 10% in the 5-way 10-shot experimental setting. The proposed method exhibits exceptional performance on histological image few-shot datasets, playing a

关键词： Computer aided diagnosis

来源：评论

学校读者我要写书评

暂无评论

Solving SAT problem with Boolean algebra

Solving SAT problem with Boolean algebra

引用

International Conference on Frontier of Computer Science and Technology

作者： Xu, Youjun Ouyang, Dantong Ye, Yuxin He, Jialiang College of Computer Science and Technology China Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education Jilin University Changchun China

ISBN: (纸本)9780769541396

The satisfiability(SAT) problem is an important problem of automated reasoning. In the past decades, many methods of SAT are proposed, such as method based on resolution, method based on tableau and method based on extension rule. Based on the study of extension rule, we And that the SAT problem can be solved with hitting set algorithms. If we can find a hitting set of a clause set, and if there is not any pair of complementary literals in the hitting set, the clause set is satisfiable. Algorithm BHS based on Boolean algebra proposed by Jiang is an efficient hitting set algorithm. SSBF proposed in this paper is a revised algorithm of BHS that can be used to judge the satisfiability of a clause set. The test result shows that SSBF is an efficient algorithm. © 2010 IEEE.

关键词： Boolean algebra

来源：评论

学校读者我要写书评

暂无评论

A new epistasis detecting algorithm based on ant colony optimization 14

A new epistasis detecting algorithm based on ant colony opti...

引用

6th International Conference on Internet Multimedia Computing and Service, ICIMCS 2014

作者： Zhou, Zhihui Liu, Guixia Su, Lingtao Han, Liang Yan, Lun College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China

ISBN: (纸本)9781450328104

The rapid developments of chip-based technology have greatly improved human genetics and made routine the access of thousands of single nucleotide polymorphisms (SNPs) contributing to an informatics challenge. The characterization and interpretation of genes and gene-gene interactions that affect the susceptibility of common, complex multifactorial diseases is a computational and statistical challenge in genome-wide association studies (GWAS). Various methods have been proposed, but they have dificulty to be directly applied to GWAS caused by excessive search space and intensive computational burden. In this paper, we propose an ant colony optimization (ACO) based algorithm by combining the pheromone updating rule with the heuristic information. We tested power performance of our algorithm by conducting suficient experiments including a wide range of simulated datasets experiments and a real genome-wide dataset experiment. Experimental results demonstrate that our algorithm is time efficient and gain good performance in the term of the power of prediction accuracy. Copyright 2014 ACM.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

Vertical Traffic Scheduling Control Method Based On Dual Fuzzy Neural Network

Vertical Traffic Scheduling Control Method Based On Dual Fuz...

引用

2023 International Annual Conference on Complex Systems and Intelligent Science, CSIS-IAC 2023

作者： Sun, Xinhao An, Siqi Gao, Xiaoting Cui, Enchang College of Light Industry Liaoning University Shenyang China Jilin University Key Laboratory of Symbolic Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China

ISBN: (纸本)9798350309003

With the complexity of the functions of modern buildings, the problem of vertical traffic in buildings is becoming more and more prominent. As the only vertical transportation, the elevator is a necessary prerequisite for the development of modern buildings to solve its group control distribution problem. In this paper, a vertical traffic scheduling control method is proposed based on dual fuzzy neural network, a recognition strategy is designed to identify the passenger flow models. The dual fuzzy neural network is used to first identify the traffic network model in which the elevator is located, and then combine the corresponding weights and the confidence of the group control allocation to complete the group control scheduling. Finally, the proposed method is verified through a semi-physical simulation platform, proving the correctness and effectivness for traffic pattern recognition and scheduling strategy optimization of group controllers. © 2023 IEEE.

关键词： Fuzzy neural networks

来源：评论

学校读者我要写书评

暂无评论

Research and implementation of improved real-time crawler modeling

Research and implementation of improved real-time crawler mo...

引用

International Conference on Electrical Information and Mechatronics, ICEIM 2012

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

ISBN: (纸本)9783037856901

The past decade has witnessed the rapid development of search engines, which has become an indispensable part of everyday life. However, people are no longer satisfied with accessing to ordinary information, and they may instead pay more attention to fresh information. This demand poses challenges to traditional search engines, which concern more about relevance and importance of web pages. A search engine compresses three modules: crawler, indexer and searcher. Changes are needed for all these three parts to improve search engine's freshness. This paper investigates the first part of search engine - crawler, we analyze the requirements for real-time crawler, and propose a novel real-time crawler based on more accurate estimation of refresh time. Experimental results demonstrate that the proposed real-time crawler can help search engine improve its freshness. © (2013) Trans Tech Publications, Switzerland.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

Computing PUR of Zero-Dimensional Ideals of Breadth at Most One

引用

Journal of Systems Science & Complexity 2021年第6期34卷 2396-2409页

作者： PAN Jian SHANG Baoxin LI Zhe ZHANG Shugong School of Mathematics Key Laboratory of Symbolic Computation and Knowledge Engineering(Ministry of Education)Jilin UniversityChangchun 130012China College of Science Northeast Electric Power UniversityJilin 132012China School of Science Changchun University of Science and TechnologyChangchun 130022China

In this paper,for a zero-dimensional polynomial ideal I,the authors prove that k[x_(1),x_(2),…,x_(n)]/I is cyclic if and only if the breadth of I is 0 or ***,the authors present a new algorithm to compute polynomial ... 详细信息

关键词： Cyclic basis Grobner basis polynomial univariate representation separating element

来源：评论

学校读者我要写书评

暂无评论

FlexPDA:A Flexible Programming Framework for Deep Learning Accelerators

引用

Journal of Computer Science & Technology 2022年第5期37卷 1200-1220页

作者： Lei Liu Xiu Ma Hua-xiao Liu Guang-li Li Lei Liu College of Computer Science and Technology Jilin UniversityChangchunChina Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin UniversityChangchunChina State Key Laboratory of Computer Architecture Institute of Computing TechnologyChinese Academy of SciencesBeijingChina University of Chinese Academy of Sciences BeijingChina

There are a wide variety of intelligence accelerators with promising performance and energy efficiency,deployed in a broad range of applications such as computer vision and speech ***,programming productivity hinders the deployment of deep learning *** low-level library invoked in the high-level deep learning framework which supports the end-to-end execution with a given model,is designed to reduce the programming burden on the intelligence ***,it is inflexible for developers to build a network model for every deep learning application,which probably brings unnecessary repetitive *** this paper,a flexible and efficient programming framework for deep learning accelerators,FlexPDA,is proposed,which provides more optimization opportunities than the low-level library and realizes quick transplantation of applications to intelligence accelerators for fast *** evaluate FlexPDA by using 10 representative operators selected from deep learning algorithms and an end-to-end *** experimental results validate the effectiveness of FlexPDA,which achieves an end-to-end performance improvement of 1.620x over the low-level library.

关键词： deep learning accelerator programming framework domain-specific language

来源：评论

学校读者我要写书评

暂无评论

RMADV-Hop: An improved DV-Hop localization algorithm

RMADV-Hop: An improved DV-Hop localization algorithm

引用

7th International Conference on Information Technology - New Generations, ITNG 2010

作者： Yi, Tingting Fang, Zhiyi Li, Ruixue College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun 130012 China

ISBN: (纸本)9780769539843

In recent years, with the development of the wireless sensor networks, the localization method receives the attention of many researchers. However, due to the network cost and characteristics of sensor nodes, most of the localization algorithms are not well suitable for the wireless sensor network, positioning error is relatively large. Based on the regular moving anchor node and RSSI ranging technique assisting positioning, in this paper, we proposed the RMADV-Hop (Regular Moving Anchor DV-Hop) localization algorithm to improve the DV-Hop algorithm. In the same network condition, we simulated these two localization algorithms using the omnet++ simulation software. Simulation results show that RMADV-Hop algorithm uses less anchor nodes than the DV-Hop algorithm, reduces the cost of network hardware, approximately achieves the evenly distribution of anchor nodes, and can get higher positioning accuracy than the DV-Hop algorithm in the randomly distributed network. © 2010 IEEE.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：