检索结果-南通市图书馆

Detecting malignant patients via modified boosted tree

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science china(Information sciences) 2010年第7期53卷 1369-1378页

作者： DONG CaiLing1, YIN YiLong1 & YANG XiuKun2 1school of computer science and technology, shandong university, jinan 250101, china 2College of Information and Communication, Harbin Engineering university, Harbin 150001, china school of computer science and technology Shandong University Jinan China College of Information and Communication Harbin Engineering University Harbin China

As one of the most effective measures to extract useful information from medical database and provide scientific decision-making for diagnosis and treatment of diseases, medical data mining has become an increasingly hot topic in the last few years. Some of the intrinsic characteristics of medical databases, such as the huge volume and imbalanced samples as well as stringent performance standards, make this mining process particularly challenging. By elaborating various challenges existing in Task 1 of KDD Cup 2008 competition, this paper analyzes some potential solutions to these problems and presents a modified boosted tree as the final classification model. This model ranked the fourth among all the solutions to Task 1. We hope that our analysis and solutions to these challenges would contribute to the development of medical data mining applications.

关键词： classification boosted tree multiple instances scoring Real AdaBoost breast cancer detection medical data mining

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

基于Agent的银行业务排队系统仿真研究

山东大学学报（工学版） 2011年第4期41卷 68-72,78页

作者：张琦琮杨公平山东省工会管理干部学院信息工程学院山东济南250100 山东大学计算机科学与技术学院山东济南250101

为解决目前办理银行业务顾客等候时间过长的问题,构建了基于Agent的排队系统仿真模型。通过将顾客、排队机、服务台和自动柜员机等抽象为不同的Agent以及不同Agent之间的交互仿真了银行业务排队系统的运行。模型中给出了一种服务队列动... 详细信息

为解决目前办理银行业务顾客等候时间过长的问题,构建了基于Agent的排队系统仿真模型。通过将顾客、排队机、服务台和自动柜员机等抽象为不同的Agent以及不同Agent之间的交互仿真了银行业务排队系统的运行。模型中给出了一种服务队列动态调整的算法,在netlogo平台上进行了模型建立和算法实现。实验数据和分析显示,此模型真实地模拟了银行排队系统运行,合理利用了现有资源,减少了顾客平均等待时间,提升了顾客满意度。

关键词：智能代理仿真银行排队系统调度算法

维普期刊数据库

A 14/11-approximation algorithm for sorting by short block-moves

在线全文

学校读者我要写书评

暂无评论

science china(Information sciences) 2011年第2期54卷 279-292页

作者： JIANG HaiTao & ZHU DaMing school of computer science and technology, shandong university, jinan 250101, china school of computer science and technology Shandong University Jinan China

Block-move is one of the popular operations for genome rearrangement. A short block-move is an operation on a permutation that moves an element at most two positions away from its original position. Heath and Vergara investigated the problem of finding a minimum-length sorting sequence of short block-moves for a given permutation and devised a 4/3-approximation algorithm. In this paper, we present a new 14/11-approximation algorithm for this problem. Firstly, we devise an exact polynomial time algorithm for sorting a special kind of sub permutations called umbrella; then we split the permutation into a series of related umbrellas and sort them greedily. We obtain a new lower bound of the short block-move distance by exploiting the properties of five kinds of sub-permutations. After some complicated analysis, we prove that the approximation ratio of the new algorithm is at most 14/11.

关键词： short block-move approximation algorithm

Anisotropic resizing and deformation preserving geometric textures

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science china(Information sciences) 2010年第12期53卷 2441-2451页

作者： CHEN Lin & MENG XiangXu school of computer science and technology, shandong university, jinan 250101, china school of computer science and technology Shandong University Jinan China

Model resizing is a useful technique for model reuse. Non-homogeneous model resizing introduced by Kraevoy et al. is able to preserve important geometric features during anisotropic scaling. However, many practical objects contain various geometric textures. Different from similar objects without geometric textures, such objects seem to be extremely difficult for resizing even if the underlying surfaces are relatively simple. In this paper, we present an automatic model resizing method based on geometric texture transfer. Geometric textures are separated from the underlying surfaces and reconstructed on the non-homogenously scaled surfaces using geometric texture synthesis. By utilizing the natural correspondence between the surfaces before and after resizing, surfaces with multiple geometric textures can be resized and geometric texture recovered automatically. Experimental results show that our method effectively and automatically preserves geometric textures during the model resizing process. Our method can also easily be used in general deformation process.

关键词： geometric texture anisotropic resizing texture transfer

Adaptive bidirectional diffusion for image restoration

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science china(Information sciences) 2010年第12期53卷 2452-2460页

作者： FU ShuJun 1,2 & ZHANG CaiMing 1 1 school of computer science and technology, shandong university, jinan 250101, china 2 school of Mathematics, shandong university, jinan 250100, china school of computer science and technology Shandong University Jinan China school of Mathematics Shandong University Jinan China

A large number of applications in image processing and computer vision depend on image quality. In this paper, combining the forward diffusion with the backward diffusion by different weights, we present an adaptive bidirectional diffusion method for image denoising and deblurring simultaneously. Further, we introduce a gradient factor into the data fidelity term, which forms a spatially varying constraint and allows a better restoration of image edges and fine details. In order to obtain a stable solution, we develop a numerically stable scheme and give its theoretical analysis. Finally, we show advantages of this method in deblurring edges, denoising and restoring fine details of image compared with other related methods in experiments.

关键词： image restoration bidirectional diffusion inverse diffusion anisotropic diffusion stabilizing scheme spatially varying constraint

Cubic surface fitting to image by combination

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science china(Information sciences) 2010年第7期53卷 1287-1295页

作者： LI XueMei1, ZHANG CaiMing1,2, YUE YiZhen1 & WANG KunPeng1 1school of computer science and technology, shandong university, jinan 250101, china 2school of computer science and technology, shandong Economics university, jinan 250014, china school of computer science and technology Shandong University Jinan China school of computer science and technology Shandong Economics University Jinan China

We present a new method for constructing a fitting surface to image data. The new method is based on a supposition that the given image data are sampled from an original scene that can be represented by a surface defined by piecewise quadratic polynomials. The surface representing the original scene is known as the original surface in this paper. Unlike existing methods, which generally construct the fitting surface to the original surface using image data as interpolation data, the new method constructs the fitting surface using the image data as constraints to reverse the sampling process, which improves the approximation precision of the fitting surface. Associated with each data point and its near region, the new method constructs a quadratic polynomial patch locally using the sampling formula as constraint. The quadratic patch approximates the original surface with a quadratic polynomial precision. The fitting surface which approximates the original surface is formed by the combination of all the quadratic polynomial patches. The experiments demonstrate that compared with Bi-cubic and Separable PCC methods, the new method produced resized images with high precision and good quality.

关键词： surface fitting quadratic polynomial image resizing reversing

A Hybrid of Theorems of Goldbach and Piatetski-Shapiro

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Annals of Mathematics,Series B 2006年第3期27卷 341-352页

作者： Xianmeng MENG Mingqiang WANG school of computer science and technology, shandong university, jinan 250100, china Department of Statistics and Mathematics, shandong Finance Institute, jinan 250014, china. school of computer science and technology, shandong university, jinan 250100, china Department of Mathematics, Qufu Normal university, Qufu 273165, shandong, china. school of computer science and technology Shandong University Jinan 250100 China Department of Statistics and Mathematics Shandong Finance Institute Jinan 250014 China Department of Mathematics Qufu Normal University Qufu 273165 Shandong China

It is proved that for almost all sufficiently large even integers n, the prime variable equation n = p1 ＋ p2, p1 ∈ Pγ is solvable, with 13/15 〈γ≤ 1, where Pγ = {p ｜p = [m^1/γ], for integer m and prime p} is t... 详细信息

关键词： Circle method Sieve method Goldbach problem

维普期刊数据库

Medical image segmentation using improved FCM

在线全文

学校读者我要写书评

暂无评论

science china(Information sciences) 2012年第5期55卷 1052-1061页

作者： ZHANG XiaoFeng 1,2,ZHANG CaiMing 1,3,4,TANG WenJing 1,2 & WEI ZhenWen 1 1 school of computer science and technology,shandong university,jinan 250101,china 2 school of Information and Electrical Engineering,Ludong university,Yantai 264025,china 3 school of computer science and technology,shandong university of Finance and Economics,jinan 250014,china 4 shandong Province Key Lab of Digital Media technology,jinan 250014,china school of computer science and technology Shandong University Jinan China school of Information and Electrical Engineering Ludong University Yantai China school of computer science and technology Shandong University of Finance and Economics Jinan China shandong Province Key Lab of Digital Media technology Jinan China

Image segmentation is one of the most important problems in medical image processing,and the existence of partial volume effect and other phenomena makes the problem much more *** C-means,as an effective tool to deal with PVE,however,is faced with great challenges in *** at this,this paper proposes one improved FCM algorithm based on the histogram of the given image,which will be denoted as HisFCM and divided into two *** first phase will retrieve several intervals on which to compute cluster centroids,and the second one will perform image segmentation based on improved FCM *** with FCM and other improved algorithms,HisFCM is of much higher efficiency with satisfying *** on medical images show that HisFCM can achieve good segmentation results in less than 0.1 second,and can satisfy real-time requirements of medical image processing.

关键词： FCM histogram image segmentation medical image processing

Reverse extraction of early-age hydration kinetic equation from observed data of Portland cement

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science china(Technological sciences) 2010年第6期53卷 1540-1553页

作者： WANG Lin1,YANG Bo2,ZHAO XiuYang1,2,CHEN YueHui2 & CHANG Jun3 1 school of computer science and technology,shandong university,jinan 250101,china 2 Provincial Key Laboratory for Network-based Intelligent Computing,university of jinan,jinan 250022,china 3 school of Material science and Engineering,university of jinan,jinan 250022,china school of computer science and technology Shandong University Jinan China Provincial Key Laboratory for Network-based Intelligent Computing University of Jinan Jinan China school of Material science and Engineering University of Jinan Jinan China

The early-age hydration of Portland cement paste has an important impact on the formation of microstructure and development of ***,manual derivation of hydration kinetic equation is very difficult because there are multi-phased,multi-sized and interrelated complex chemical and physical reactions during cement *** this paper,early-age hydration kinetic equation is reversely extracted automatically from the observed time series of hydration degree of Portland cement using evolutionary computation method that combines gene expression programming and particle swarm optimization *** order to reduce the computing time,GPUs are used for acceleration in *** have shown that according to the extracted kinetic equation,simulation curve of early-age hydration is in good accordance with the observed experimental ***,this equation still has a good generalization ability even changing chemical composition,particle size and curing conditions.

关键词： Portland cement hydration kinetic equation reverse extraction gene expression programming particle swarm optimization

维普期刊数据库