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

Mapping integrity constraint ontology to relational databases

The Journal of China Universities of Posts and Telecommunications 2010年第6期17卷 113-121页

作者： OUYANG Dan-tong College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education Jilin University Changchun 130012 China

Integrity constraint is a formula that checks whether all necessary information has been explicitly provided. It can be added into ontology to guarantee the data-centric application. In this paper,a set of constraint axioms called IC-mapping axioms are stated. Based on these axioms,a special ontology with integrity constraint,which is adapted to map ontology knowledge to data in relational databases,is defined. It＇s generated through our checking and modification. Making use of the traditional mapping approaches,it can be mapped to relational databases as a normal ontology. Unlike what in the past,a novel mapping approach named IC-based mapping is proposed in accordance with such special ontology. The detailed algorithm is put forward and compared with other existing approaches used in Semantic Web applications. The result shows that our method is advanced to the traditional approaches.

关键词： Semantic Web integrity constraint ontology relational database

来源：评论

学校读者我要写书评

暂无评论

Solving SAT problem with a revised hitting set algorithm

Solving SAT problem with a revised hitting set algorithm

引用

2010 2nd International Conference on Future Computer and Communication, ICFCC 2010

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

ISBN: (纸本)9781424458226

The satisfiability(SAT) problem is a core problem of artificial intelligence. Research findings in SAT are widely used in many areas. The main methods solving SAT problem are resolution principle, tableau calculus and extension rule. Besides methods mentioned above, we find that the SAT problem can be solved with hitting set algorithms. If a set of clause is satisfiable, there must be a hitting set of the clause set which containing no complementary pairs of literals. Algorithm NEWHS-tree is an efficient hitting set algorithm proposed by Ouyang. RNHST proposed in this paper is a revised algorithm in respect of NEWHS-tree. It judges the satisfiability of a clause set by confirming the existence of the set's hitting set without complementary pairs of literals. The test result shows that RNHST is an efficient algorithm. ©2010 IEEE.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

A Morphology Focused Cell Detection Model for Histopathology Images

A Morphology Focused Cell Detection Model for Histopathology...

引用

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： Wang, Zhe Wei, Fangyue Guo, Shuyu Che, Xiaoting Bai, Tian Jilin University College of Computer Science and Technology Changchun China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun China

ISBN: (纸本)9798350337488

The accurate automatic recognition of cell locations is of great significance for downstream tasks in pathology. Due to the various size and distribution of different cell types, previous cell detection methods applied fixed circles as labels to localize cell position by default, which makes less precise and more difficult to adapt various cell morphology. In this paper, we integrate adaptive areas of interests based on morphology to address the limitation in detecting cells with irregular shapes in pathological images. Moreover, a EGSI module is proposed to extract global distribution of cells in slices, which enables model to acquire more rich semantic information. We exhibit favorable F1 score of our method on four public datasets. Experimental results demonstrate that the proposed method could detect cells more accurately in those images with different cell morphologies and dense cell distribution. © 2023 IEEE.

关键词： cell detection cellular morphology digital pathology medical image analysis

来源：评论

学校读者我要写书评

暂无评论

Singleton arc consistency based on failure-first principle

Singleton arc consistency based on failure-first principle

引用

International Conference on Machine Learning and Cybernetics

作者： Li, Zhan-Shan Xing, Shi-Mei Yang, Feng-Jie Du, Hui-Ying Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun 130012 China College of Computer Science and Technology Changchun 130012 China

ISBN: (纸本)9781424465262

Constraint satisfaction problems play a significant role in the field of Artificial Intelligence. Reducing the search space can improve the efficiency of solving the problems before the search of solutions. Applying in preprocessing step, arc consistency technique can remove some values which are arc inconsistent, so that it can reduce the search space. Using heuristic strategies can improve the efficiency of the algorithms. In this paper we propose a new singleton arc consistency algorithm based on failure-first principle, which improves the practical time efficiency through the earlier detection of variables which contain null values and removal of the values which are arc inconsistency during the preprocessing step. © 2010 IEEE.

关键词： Constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Quasi-periodic Solutions of the General Nonlinear Beam Equations

引用

Communications in Mathematical Research 2012年第1期28卷 51-64页

作者： GAO YI-XIAN College of Mathematics and Statistics Northeast Normal University Changchun 130024 Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012

In this paper, one-dimensional （1D） nonlinear beam equations of the form utt - uxx ＋ uxxxx ＋ mu = f （u） with Dirichlet boundary conditions are considered, where the nonlinearity f is an analytic, odd function and f（u） = O（u3）. It is proved that for all m ∈ （0, M＊]  R （M＊ is a fixed large number）, but a set of small Lebesgue measure, the above equations admit small-amplitude quasi-periodic solutions corresponding to finite dimensional invariant tori for an associated infinite dimensional dynamical system. The proof is based on an infinite dimensional KAM theory and a partial Birkhoff normal form technique.

关键词： beam equation KAM theorem quasi-periodic solution partial Birkhoffnormal form

来源：评论

学校读者我要写书评

暂无评论

Blind identification of image copy-paste tampering based on logarithm polar coordinate transformation

Blind identification of image copy-paste tampering based on ...

引用

2011 International Conference on Image Processing, Computer Vision, and Pattern Recognition, IPCV 2011

作者： Lv, A. Ying-Da Shen, B. Xuan-Jing Chen, C. Hai-Peng College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun China

ISBN: (纸本)9781601321916

To detect image copy-paste tampering, an improved blind identification was proposed in this study. Firstly, according to gray-level and gray-structure, every couple of doubtful blocks can be located. Secondly, for each located couple of doubtful blocks, use logarithm polar coordinate transformation to translate the rotation and scaling in Cartesian coordinate system into translation in logarithm polar coordinate system;and use phase correlation method to obtain rotation angle, scaling size and position offset;and then, the tampered regions would be located roughly. Finally, use geometry method to accurately calculate the rotation angle, scaling size and position offset between the copy-paste regions, and according to these values, the tampered region can be located accurately. Experimental results showed that our algorithm can detect the copy-paste tampering, even with rotation and scaling transformation, and it can resist some post-processing, such as blurring, adding noise, and so on.

关键词： Rotation

来源：评论

学校读者我要写书评

暂无评论

SMRI: A New Method for siRNA Design for COVID-19 Therapy

引用

Journal of Computer Science & Technology 2022年第4期37卷 991-1002页

作者： Meng-Xin Chen Xiao-Dong Zhu Hao Zhang Zhen Liu Yuan-Ning Liu College of Software Jilin UniversityChangchun 130012China Key Laboratory of Symbolic Computation and Knowledge Engineering of the Ministry of Education Jilin UniversityChangchun 130012China College of Computer Science and Technology Jilin UniversityChangchun 130012China Graduate School of Engineering Nagasaki Institute of Applied ScienceNagasaki 851-0193Japan

First discovered in Wuhan, China, SARS-CoV-2 is a highly pathogenic novel coronavirus, which rapidly spreads globally and becomes a pandemic with no vaccine and limited distinctive clinical drugs available till March 13th, 2020. Ribonucleic Acid interference (RNAi) technology, a gene-silencing technology that targets mRNA, can cause damage to RNA viruses effectively. Here, we report a new efficient small interfering RNA (siRNA) design method named Simple Multiple Rules Intelligent Method (SMRI) to propose a new solution of the treatment of COVID-19. To be specific, this study proposes a new model named Base Preference and Thermodynamic Characteristic model (BPTC model) indicating the siRNA silencing efficiency and a new index named siRNA Extended Rules index (SER index) based on the BPTC model to screen high-efficiency siRNAs and filter out the siRNAs that are difficult to take effect or synthesize as a part of the SMRI method, which is more robust and efficient than the traditional statistical indicators under the same circumstances. Besides, to silence the spike protein of SARS-CoV-2 to invade cells, this study further puts forward the SMRI method to search candidate high-efficiency siRNAs on SARS-CoV-2's S gene. This study is one of the early studies applying RNAi therapy to the COVID-19 treatment. According to the analysis, the average value of predicted interference efficiency of the candidate siRNAs designed by the SMRI method is comparable to that of the mainstream siRNA design algorithms. Moreover, the SMRI method ensures that the designed siRNAs have more than three base mismatches with human genes, thus avoiding silencing normal human genes. This is not considered by other mainstream methods, thereby the five candidate high-efficiency siRNAs which are easy to take effect or synthesize and much safer for human body are obtained by our SMRI method, which provide a new safer, small dosage and long efficacy solution for the treatment of COVID-19.

关键词： COVID-19 SARS-CoV-2 RibonucleicAcid interference

来源：评论

学校读者我要写书评

暂无评论

An improved particle swarm algorithms for global optimization

An improved particle swarm algorithms for global optimizatio...

引用

2010 International Conference on Machine Vision and Human-Machine Interface, MVHI 2010

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

ISBN: (纸本)9780769540092

Particle swarm optimization (PSO) algorithm is a robust and efficient approach for solving complex real-world problems. In this paper, a modified particle swarm algorithm (IMPSO) is introduced for unconstrained global optimization. The whole swarm is partitioned to three different sub-populations according to their fitness, and different velocity updating strategies are used to different sub-populations. Besides, we take advantage of crossover to maintain the diversity of the swarm and avoid getting into local optimum. IMPSO are extensively compared with other two modified PSO algorithms on three well-known benchmark functions with different dimensions. Experimental results show that IMPSO achieves not only better solutions but also faster convergence. © 2010 IEEE.

关键词： Global optimization

来源：评论

学校读者我要写书评

暂无评论

MAX-MIN ant system on GPU with CUDA

MAX-MIN ant system on GPU with CUDA

引用

2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009

作者： Bai, Hongtao Ouyang, Dantong Li, Ximing He, Lili Yu, Haihong College of Computer Science and Technology Jilin University 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University 130012 China

ISBN: (纸本)9780769538730

We propose a parallel MAX-MIN Ant System (MMAS) algorithm that is suitable for an implementation on graphics processing units (GPUs). Multi ant colonies with respective parameter settings are whole offloaded to the GPU in parallel. We have implemented this GPU-based MMAS on the GPU with compute unified device architecture (CUDA). Some performance optimization means for kernel program of GPU are introduced. Experimental results that are based on simulations for the traveling salesperson problem are presented to evaluate the proposed techniques. © 2009 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

An approach to accelerate diagnosis by isomorphic determining

An approach to accelerate diagnosis by isomorphic determinin...

引用

2009 International Conference on Information engineering and Computer Science, ICIECS 2009

作者： Wang, Xiaoyu Ouyang, Dantong Feng, Yuxuan Zhao, Jian College of Computer Science and Technology Jilin University Key Laboratory Symbolic Computation and Knowledge Engineering Ministry of Educaion Changchun China

ISBN: (纸本)9781424449941

When diagnosing dynamic system represented as discrete-event systems, it needs to find what happened to the systems from observations. The behavior of system could be represented by automaton model. The diagnostic task consists in determining the models compatible with the observations, but the global computation which is needed in synchronization costs exponential time. In this paper we propose a new method to simplify the automaton by isomorphic determining. The cost of computation will be significantly cut down by merging the automatons with the same structure, and the time-complexity of the diagnosis process could be reduced by the method. ©2009 IEEE.

关键词： Discrete event simulation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：