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

arXiv 2017年

作者： Zhou, Zhiguo Zhou, Zhi-Jie Hao, Hongxia Li, Shulong Chen, Xi Zhang, You Folkert, Michael Wang, Jing Department of Radiation Oncology UT Southwestern Medical Center DallasTX United States High-Tech Institute of Xi'an Xi'an China Department of Information and Control Engineering Xi'an University of Technology Xi'an China School of Computer Science and Technology Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education Xidian University Xi'an China School of Biomedical Engineering Southern Medical Unversity Guangzhou China Institute of Image Processing and Pattern Recognition Xi'an Jiaotong Unversity Xi'an China

Radiomics aims to extract and analyze large numbers of quantitative features from medical images and is highly promising in staging, diagnosing, and predicting outcomes of cancer treatments. Nevertheless, several challenges need to be addressed to construct an optimal radiomics predictive model. First, the predictive performance of the model may be reduced when features extracted from an individual imaging modality (e.g. PET, CT, MRI) are blindly combined into a single predictive model. Second, because many different types of classifiers are available to construct a predictive model, selecting an "optimal" classifier for a particular application is still challenging. In this work, we developed multi-modality and multi-classifier radiomics predictive models that address the aforementioned issues in currently available models. Specifically, a new reliable classifier fusion strategy was proposed to optimally combine output from different modalities and classifiers. In this strategy, modality-specific classifiers were first trained, and an analytic evidential reasoning (ER) rule was developed to fuse the output score from each modality to construct an optimal predictive model. One public datasets and two clinical case studies were performed to validate model performance. The experimental results indicated that the proposed ER rule based radiomics models outperformed the traditional models that rely on a single classifier or simply use combined features from different modalities. Copyright © 2017, The Authors. All rights reserved.

关键词： Diagnosis

来源：评论

学校读者我要写书评

暂无评论

Matrix flat splicing systems 11th

Matrix flat splicing systems

引用

11th International Conference on Bio-inspired Computing – Theories and Applications, BIC-TA 2016

作者： Ceterchi, Rodica Pan, Linqiang Song, Bosheng Subramanian, K.G. Faculty of Mathematics and Computer Science University of Bucharest 14 Academiei Street Bucharest010014 Romania School of Electric and Information Engineering Zhengzhou University of Light Industry ZhengzhouHenan450002 China Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China School of Automation Huazhong University of Science and Technology WuhanHubei430074 China Department of Mathematics Madras Christian College Chennai600059 India

ISBN: (纸本)9789811036101

In dealing with the problem of modelling DNA recombination, the operation of splicing on linear and circular strings of symbols was introduced. Inspired by splicing on circular strings, the operation of flat splicing on a pair of strings (u, v) was considered. This operation involves "cutting" u at a specified position and "inserting" v into it, with v having a pre-specified prefix as well as suffix defined by a flat splicing rule. In this work, we consider a well-known technique in formal language theory, known as "matrix of rules", and introduce matrix of flat splicing rules and thus define matrix flat splicing system (MFSS). Some results on the language generative power of MFSS are provided. An application of MFSS in the generation of chain code pictures is also pointed out. © Springer Nature Singapore Pte Ltd. 2016.

关键词： Formal languages

来源：评论

学校读者我要写书评

暂无评论

A multi-objective optimization algorithm based on tissue P system for VRPTW 11th

A multi-objective optimization algorithm based on tissue P s...

引用

11th International Conference on Bio-inspired Computing – Theories and Applications, BIC-TA 2016

作者： Dong, Wenbo Zhou, Kang Qi, Huaqing He, Cheng Zhang, Jun Song, Bosheng School of Math and Computer Wuhan Polytechnic University WuhanHubei430023 China Department of Economics and Management Wuhan Polytechnic University WuhanHubei430023 China Key Laboratory of Image Information Processing and Intelligent Control Huazhong University of Science and Technology WuhanHubei430074 China School of Automation Huazhong University of Science and Technology WuhanHubei430074 China

ISBN: (纸本)9789811036132

Vehicle routing problem with time windows has an important practical significance, but it is NP-Hard problem. In order to solve the problem, an optimization algorithm based on P system is proposed. The encoding of glowworm’s location is considered as evolutionary object and discrete glowworm evolution mechanism and variable neighborhood evolution mechanism are used as sub-algorithms. In this paper, the motion equations and related motion rules of glowworm algorithm are improved to optimize the performance of the algorithm. Meanwhile, in order to enlarge the search area of solution space and improve the precision, the variable neighborhood evolution mechanism is redesigned. Cell communication rules are used to exchange information between cells. Moreover, this paper introduced the concept of Pareto dominance to evaluate the advantages and disadvantages of the object, as a result, this method returns not a single non-dominated solution but a set of no-dominated solutions. At last, by solving the different Solomon numerical examples and simulation results show that the algorithm is easier to jump out of local optimal both achieves very good results in the number of vehicles and distance cost, besides, generates a lot of new solutions which are different from the database. This algorithm has the features of faster convergence rate and accurate precision, and it is competitive with other heuristic or metaheuristic algorithms in the literature. © Springer Nature Singapore Pte Ltd. 2016.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Fusion approach for real-time mapping street atmospheric pollution concentration

Fusion approach for real-time mapping street atmospheric pol...

引用

Conference on Human system Interactions, HSI

作者： Wenjun Lv Yu Kang Zerui Li Yunbo Zhao Department of Automation University of Science and Technology of China Hefei China Key Laboratory of Technology in GeoSpatial Information Processing and Application System Chinese Academyof Sciences Beijing China College of Information Engineering Zhejiang University of Technology Hangzhou China

ISBN: (纸本)9781509017300

The real-time mapping of street atmospheric pollution concentration does play an important role because its knowledge is crucial for strategy-makers to make more effective control strategies to decrease urban atmospheric pollution and improving urban atmospheric environment. Combining the conventional methods (e.g. the dispersion model prediction and neural network prediction) and mobile measurement technology (e.g. the GMAP vehicle) which their characteristics are complementary, a linear model is proposed and then a fusion approach called weighting filter derived from the concept of Kalman filter. Moreover, a self-tuning regulator is introduced to adjust the parameters of filter for the changing noise statistical characteristics over time which mainly caused by season switch. The performances of asymptotic stability and asymptotic optimality are both mathematically proven. Finally a simulation test is conducted to verify this approach.

关键词： Atmospheric modeling Pollution Mathematical model Atmospheric measurements Vehicles Pollution measurement Kalman filters

来源：评论

学校读者我要写书评

暂无评论

Semantic Cache Replacement Strategy for XML Algebra-Based Query Optimization

引用

Wuhan University Journal of Natural Sciences 2015年第2期20卷 165-172页

作者： XU Fangfang LI Yaoyao GU Jinguang College of Computer Science and Technology Wuhan University of Science and Technology Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System

Aiming at the fact that traditional cache replacement strategy lacks pertinence to the semantic cache in the process of extensible markup language （XML） algebra query, a replacement strategy based on the semantic cache contribution value is proposed. First, pattern matching rules for XML algebra query and semantic caches are given. Second, the method of calculating the semantic cache contribution value is proposed. In XML documents with four different sizes, the experimental results of time efficiency show that this strategy supports environment of the XML algebra query and it has better time efficiency than both least frequency used （LFU） and least recently used （LRU）.

关键词： cache pattern matching XML algebra query replacement strategy

来源：评论

学校读者我要写书评

暂无评论

A Recommendation Mechanism for Web Publishing Based on Sentiment Analysis of Microblog

引用

Wuhan University Journal of Natural Sciences 2015年第2期20卷 146-152页

作者： TIAN Pingfang ZHU Zhonghua XIONG Li XU Fangfang College of Computer Science and Technology Wuhan University of Science and Technology Intelligent Information Processing and Real-time Industrial System Hubei Province Key Laboratory

Microblog is a social platform with huge user community and mass data. We propose a semantic recommendation mechanism based on sentiment analysis for microblog. Firstly, the keywords and sensibility words in this mechanism are extracted by natural language processing including segmentation, lexical analysis and strategy selection. Then, we query the background knowledge base based on linked open data （LOD） with the basic information of users. The experiment result shows that the accuracy of recommendation is within the range of 70% -89% with sentiment analysis and semantic query. Compared with traditional recommendation method, this method can satisfy users＇ requirement greatly.

关键词： sentiment analysis microblog keyword extraction linked open data background knowledge base

来源：评论

学校读者我要写书评

暂无评论

A sub-pixel SAR and optical image registration method 66

A sub-pixel SAR and optical image registration method

引用

66th International Astronautical Congress 2015: Space - The Gateway for Mankind's Future, IAC 2015

作者： Zhang, Hanmo Lu, Shan You, Hongjian Shanghai Key Laboratory of Aerospace Intelligent Control Technology Shanghai Aerospace Control Technology Institution China Key Laboratory of Geo-Spatial Information Processing and Application System Technology Institute of Electronics Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781510818934

Automatic image registration method is important because data amount acquired and processed is increasingly heavy. For SAR and optical sensor images, it is important to align the same object shown in different images from multi sensors. Considering extracting and matching features in SAR and optical images, a template registration strategy is proposed in this paper. A particular similarity measurement which is robust in matching remote sensing images of general sceneries is hardly to construct. Being the invertible and essential tendency nowadays in the field of earth observation, high pixel-resolution images can offer much more information of the ground. Thus subpixel image registration methods have been researched, among which can successfully achieve 1/50 pixel level accuracy in matching homologous sensor image. This paper firstly investigated the performance of 2D Gaussian fitting for low correlated synthetic images and real satellite images acquired by Radat SAT-2, COSMO and TerraSAR-X satellites. Three algorithms for subpixel locating have been utilized with consideration of the low correlated coefficient peak and corrupted shape of neighbourhood around it. The results show 2D Gaussian fitting is the most efficient on noisy coefficient maps. Then a subpixel image registration method for SAR and optical images is proposed. Normalized gradient correlation (NGC) algorithm is used to solve the problem of different intensity property at first, and by combining 2D Gaussian fitting to relocate matched points at a subpixel level accuracy. Experiment results have shown that the proposed method has enough capabilities in handling differences between images from multi-sensors. The proposed approach has been found to be simple and efficient in implementation with a low computation load. And the most important performance is the results presented here have achieved matching accuracy within 1 pixel.

关键词： Image registration

来源：评论

学校读者我要写书评

暂无评论

Property analysis of composable web services

Telkomnika (Telecommunication Computing Electronics and Cont...

引用

Telkomnika (Telecommunication Computing Electronics and control) 2016年第2期14卷 734-740页

作者： Liu, Wei Wang, Lu Du, Yuyue Wang, Pin Yan, Chun State Key Laboratory of Mining Disaster Prevention and Control Shandong University of Science and Technology Qingdao China College of Information Science and Engineering Shandong University of Science Technology Qingdao China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

Web services are basic components constructing a flexible business process software. By composing multiple Web services, a complicated business process across organization and departments can be formed. This paper present a formal model of composable Web services: composed service process nets (CSPNs). Properties of Composable Web services are analyzed based on CSPNs. The relation between a CSPN and its corresponding Web service process subnets are discussed. The property analysis methods of CSPNs are come up with. A dynamic property of CSPNs can be determined based on static net structures by means of the proposed methods. © 2016 Universitas Ahmad Dahlan.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

A dynamic co-evolution compact genetic algorithm for E/T problem

引用

IFAC-PapersOnLine 2015年第28期48卷 1439-1443页

作者： Han, Zhonghua Zhu, Yihang Lin, Shuo Faculty of Information and Control Engineering Shenyang Jianzhu University Department of Digital Factory Shenyang Institute of Automation Key Laboratory of networked control system Shenyang China Faculty of Information and Control Engineering Shenyang Jianzhu University Shenyang China

In this paper, a dynamic co-evolution compact genetic algorithm (DCCGA) is proposed for flexible flow shop scheduling problem (FFSP) to minimize the total earliness and tardiness (E/T) penalties. In this new algorithm, a dynamic co-evolution mechanism containing two probabilistic models and a best individual inheritance strategy are integrated into the compact genetic algorithm (CGA). For improving the stability of the evolutionary trend in the evolution processes, the diversity of evolution trend and the convergence speed. Lastly, the experimental results show that, DCCGA outperforms CGA by 11.74% on the problem we study. © 2015

关键词： Genetic algorithms Machine shop practice Co evolution Compact genetic algorithm Earliness tardiness Flexible flow shop Probabilistic models

来源：评论

学校读者我要写书评

暂无评论

Optimization Spectrum Decision Parameters in CR using Autonomously Search Algorithm

Optimization Spectrum Decision Parameters in CR using Autono...

引用

2016 IEEE 13th International Conference on Signal processing（ICSP2016）

作者： Yongcheng Li Hai Shen Manxi Wang State Key Laboratory of Complex Electromagnetic Environment Effects on Electronics and Information System College of Physics Science and Technology Shenyang Normal University Control Theory and Control Engineering Postdoctoral Research Station Shenyang Institute of Automation

In order to solve the contradiction between wireless communication service demand and spectrum resource shortage and enhance the utilization rate of spectrum, Cognitive Radio technology is necessary. Firstly, this paper presents a cognitive engine framework structure, and then the concept of bio-inspired and its application in CR computing were emphatically introduced. Finally, in order to solve spectrum parameters problem, this paper proposed based on autonomously search algorithm. Based on population evolution,ASA algorithm employs the foraging, reproduction, selection and mutation operators, and was tested under the multicarrier simulation environment. The experiment results show that ASA algorithm can better adjust each subcarrier communication parameters according to the requirement of cognitive engine parameters optimization, which include transmitted power,modulation mode, and bit-error-rate and so on, and finally satisfy the channel condition and the dynamic changes of the user service.

关键词： Cognitive Engine Bio-inspired Computing Cognitive Radio Automously Search Algorithm multi-objective optimization problem

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：