检索结果-南通市图书馆

维普期刊数据库

Improved taboo search algorithm for designing DNA sequences

在线全文

学校读者我要写书评

暂无评论

Progress in Natural science:Materials International 2008年第5期18卷 623-627页

作者： Kai Zhang a, Jin Xu a,b, Xiutang Geng a, Jianhua Xiao a, Linqiang Pana, a The Key Laboratory of Image Processing and Intelligent Control, Department of Control science and engineering, Huazhong university of science and Technology, Wuhan 430074, China b school of Electronic engineering and computer science, Peking university, Beijing 100871, China The Key Laboratory of Image Processing and Intelligent Control Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 China school of Electronic engineering and computer science Peking University Beijing 100871 China

The design of DNA sequences is one of the most practical and important research topics in DNA computing. We adopt taboo search algorithm and improve the method for the systematic design of equal-length DNA sequences, which can satisfy certain combinatorial and thermodynamic constraints. Using taboo search algorithm, our method can avoid trapping into local optimization and can nd a set of good DNA sequences satisfying required constraints.

关键词： DNA computing Taboo search algorithm DNA sequence design

A new algorithm for fast mining frequent itemsets using N-lists

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science China(Information sciences) 2012年第9期55卷 2008-2030页

作者： DENG ZhiHong ,WANG ZhongHui & JIANG JiaJian Key Laboratory of Machine Perception(Ministry of Education),school of Electronics engineering and computer science,Peking university,Beijing 100871,China 1. Key Laboratory of Machine Perception (Ministry of Education) School of Electronics Engineering and Computer Science Peking University Beijing 100871 China

Mining frequent itemsets has emerged as a fundamental problem in data mining and plays an essential role in many important data mining *** this paper,we propose a novel vertical data representation called N-list,which originates from an FP-tree-like coding prefix tree called PPC-tree that stores crucial information about frequent *** on the N-list data structure,we develop an efficient mining algorithm,PrePost,for mining all frequent *** of PrePost is achieved by the following three ***,N-list is compact since transactions with common prefixes share the same nodes of the ***,the counting of itemsets’ supports is transformed into the intersection of N-lists and the complexity of intersecting two N-lists can be reduced to O(m + n) by an efficient strategy,where m and n are the cardinalities of the two N-lists ***,PrePost can directly find frequent itemsets without generating candidate itemsets in some cases by making use of the single path property of *** have experimentally evaluated PrePost against four state-of-the-art algorithms for mining frequent itemsets on a variety of real and synthetic *** experimental results show that the PrePost algorithm is the fastest in most *** though the algorithm consumes more memory when the datasets are sparse,it is still the fastest one.

关键词： data mining frequent itemset mining data structure N-lists algorithm

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

CLOUD MOBILE MEDIA

China Communications 2016年第8期13卷 I0001-I0003页

作者： Han Hu Yonggang Wen Honggang Wang Ali Begen school of computer science and engineering, Nanyang Technological university school of computer science and engineering at Nanyang Technological university UMass Dartmouth Advanced Telecommunications engineering Laboratory at university of Nebraska-Lincoln Media Melon, Inc.

Recent years have witnessed the blooming of mobile devices and *** users not only expect a faster broadband connection to access Internet and interact with each other,but also demand ubiquitous enjoying of video contents and ***,this trend is seriously hindered by the fact that mobile devices have limited resources in terms of computation,storage,

关键词： SINR show Simulation CLOUD MOBILE MEDIA

维普期刊数据库

Tissue P systems with cell separation: attacking the partition problem

在线全文

学校读者我要写书评

暂无评论

science China(Information sciences) 2011年第2期54卷 293-304页

作者： ZHANG XingYi1, WANG Shuo2, NIU YunYun2 & PAN LinQiang2 1Key Lab of Intelligent Computing and Signal Processing of Ministry of Education, school of computer science and Technology, Anhui university, Hefei 230039, China 2Image Processing and Intelligent Control Key Laboratory of Education Ministry of China, Department of Control science and engineering, Huazhong university of science and Technology, Wuhan 430074, China 1. Key Lab of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei 230039 China2. Image Processing and Intelligent Control Key Laboratory of Education Ministry of China Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 China

Tissue P systems are distributed parallel and non-deterministic computing models in the framework of membrane computing, which are inspired by intercellular communication and cooperation between neurons. Recently, cell separation is introduced into tissue P systems, which enables systems to generate an exponential workspace in a polynomial time. In this work, the computational power of tissue P systems with cell separation is investigated. Specifically, a uniform family of tissue P systems with cell separation is constructed for effciently solving a well-known NP-complete problem, the partition problem.

关键词： membrane computing tissue P system cell separation partition problem

Electrochemical Characterization of Surface-modified LiMn_2O_4 Cathode Materials for Li-ion Batteries

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Wuhan university of Technology(Materials science) 2006年第4期21卷 56-59页

作者：禹筱元 College of science South China Agricultural University Guangzhou 510642ChinaSchool of Physics & Engineering Sun Yat-sen University Guangzhou 510275China

To improve the performance, the surface of 12Mn2O4 was coated with very fine MgO , Al2O3 and ZnO by solgel method, respectively. The structure and morphology of the coated materials were investigated by X-ray diffraction （ XRD ）, X-ray photoelectron spectroscopy （ XPS ） and scanning electron microscopy （SEM）. The charge and discharge performance of uncoated and surfnce modified 12Mn2O4 spinel at 25℃ and 55 ℃ were tested, using a voltage window of 3.0-4.35 V and a current deasity of 0. 1 C rate. There is a slight decrease in the initial discharge capacity relative to that of uncoated UMn2 O4, bat the cycle ability of 12 12Mn2O4 coated by metal-oxide has remarkably been improved. The EIS measuremeuts of uncoated and Al2O3 -coated 12Mn2O4 were carried out by a model 273 A potentiostatl galvanistat controUed by a computer using M270 software, and using a freqnency response analyzer （ Zsimpwin ） combined with a potentiostate （ PAR 273）. Coaseqnently, the reason for the improved cycle properties is that the surface modification reduces the dissolution of Mn , which results from the suppression of the electrolyte decomposition, and suppresses the formation of passivation film that acts as an electronic insulating layer. In conclusion, the use of surface modification is an effective way to improve the electrochemical performance of 12Mn2O4 cathode material for lithium batteries.

关键词： lithium-ion batteries surface modification metal-oxide coating: 12Mn2O4 cathode

维普期刊数据库

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 1. school of computer science and Technology Shandong University Jinan 250101 China2. School of Information and Electrical Engineering Ludong University Yantai 264025 China3. School of Computer Science and Technology Shandong University of Finance and Economics Jinan 250014 China4. Shandong Province Key Lab of Digital Media Technology Jinan 250014 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

Spray and forward:Efficient routing based on the Markov location prediction model for DTNs

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science China(Information sciences) 2012年第2期55卷 433-440页

作者： DANG Fei1,YANG XiaoLong1,2 & LONG KePing2 1 Research Center for Optical Internet and Mobile Information Networks(COIMIN),university of Electronic science and Technology of China,Chengdu 611731,China 2.school of computer and Communications engineering,university of science and Technology Beijing,Beijing 100083,China 1. Research Center for Optical Internet and Mobile Information Networks (COIMIN) University of Electronic Science and Technology of China Chengdu 611731 China2. School of Computer and Communications Engineering University of Science and Technology Beijing Beijing 100083 China

Typical delay tolerant networks(DTNs)often suffer from long and variable delays,frequent connectivity disruptions,and high bit error *** DTNs,the design of an efficient routing algorithm is one of the key *** existing methods improve the accessibility probability of the data transmission by transmitting many copies of the packet to the network,but they may cause a high network *** address the tradeoff between a successful delivery ratio and the network overhead,we propose a DTN routing algorithm based on the Markov location prediction model,called the spray and forward routing algorithm(SFR).Based on historical information of the nodes,the algorithm uses the second-order Markov forecasting mechanism to predict the location of the destination node,and then forwards the data by greedy routing,which reduces the copies of packets by spraying the packets in a particular *** contrast to a fixed mode where a successful-delivery ratio and routing overhead are contradictory,a hybrid strategy with multi-copy forwarding is able to reduce the copies of the packets efficiently and at the same time maintain an acceptable successful-delivery *** simulation results show that the proposed SFR is efficient enough to provide better network performance than the spray and wait routing algorithm,in scenarios with sparse node density and fast mobility of the nodes.

关键词： delay tolerant networks spray and forward Markov position prediction routing algorithm

Gene association study with SVM,MLP and cross-validation for the diagnosis of diseases

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Progress in Natural science:Materials International 2008年第6期18卷 741-750页

作者： Junying Zhanga,*,Shenling Liu a,Yue Wang b aschool of computer science and engineering,Xidian university,161 Postbox,Xi’an 710071,China bDepartment of Electrical and computer engineering,Virginia Polytechnic Institute and State university,Alexandria,VA 22314,USA school of computer science and engineering Xidian University 161 Postbox Xi’an 710071 China Department of Electrical and computer engineering Virginia Polytechnic Institute and State University Alexandria VA 22314 USA

Gene association study is one of the major challenges of biochip technology both for gene diagnosis where only a gene subset is responsible for some diseases,and for the treatment of the curse of dimensionality which occurs especially in DNA microarray datasets where there are more than thousands of genes and only a few number of experiments(samples).This paper presents a gene selection method by training linear support vector machine(SVM)/nonlinear MLP(multilayer perceptron)classifiers and testing them with cross-validation for finding a gene subset which is optimal/suboptimal for the diagnosis of binary/multiple disease *** are selected with linear SVM classifier for the diagnosis of each binary disease types pair and tested by leave-one-out cross-validation;then,genes in the gene subset initialized by the union of them are deleted one by one by removing the gene which brings the greatest decrease of the generalization power,for samples,on the gene subset after removal,where generalization is measured by training MLPs with leave-one-out and leave-four-out *** proposed method was tested with experiments on real DNA microarray MIT data and NCI *** result shows that it outperforms conventional SNR method in the separability of the data with expression levels on selected *** real DNA microarray MIT/NCI data,which is composed of 7129/2308 eective genes with only 72/64 labeled sam-ples belonging to 2/4 disease classes,only 11/6 genes are selected to be diagnostic *** selected genes are tested by the classification of samples on these genes with SVM/MLP with leave-one-out/both leave-one-out and leave-four-out *** result of no misclassification indicates that the selected genes can be really considered as diagnostic genes for the diagnosis of the corresponding diseases.

关键词： DNA microarray data Curse of dimensionality Gene selection Diagnostic genes SVM MLP Cross-validation

Towards a degradation-based mechanism for adaptive overload control

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science China(Information sciences) 2012年第12期55卷 2708-2722页

作者： WANG ZiYou 1,2,ZHOU MingHui 1,2 & MEI Hong 1,2 1 Software Institute,school of Electronics engineering and computer science,Peking university,Beijing 100871,China 2 Key Laboratory of High Confidence Software Technologies(Peking university),Ministry of Education,Beijing 100871,China 1. Software Institute School of Electronics Engineering and Computer Science Peking University Beijing 100871 China 2. Ministry of Education Key Laboratory of High Confidence Software Technologies (Peking University) Beijing 100871 China

Uncontrolled overload is one of the major causes of the system's decline in reliability and performance for web *** also harms the construction of trustworthy *** paper presents a degradationbased mechanism to adaptively control overload in complex,dynamic web *** our mechanism,the bottlenecks in the application's performance are determined by internally monitoring the performance and resource utilization state of the application,which is decomposed into a set of *** locating the bottlenecks,two decision algorithms are proposed to dynamically and adaptively generate proper degradation plans without *** degrading the service which consumes critical resources and has a low priority from the perspective of business logic,the application can keep providing key services even when overload *** implement a prototype and conduct a case study on a wiki *** also evaluate our approach and demonstrate its effectiveness in simulated overload *** handling overload,we make a breakthrough in building trustworthy software in an open,dynamic and rapidly changing environment.

关键词： overload service degradation resource monitoring performance management