检索结果-南通市图书馆

Group sparse representation for image categorization and semantic video retrieval

在线全文

学校读者我要写书评

暂无评论

science china(Information sciences) 2011年第10期54卷 2051-2063页

作者： LIU YaNan 1,2 ,WU Fei 2 & ZHUANG YueTing 2 1 school of Information,Zhejiang university of Finance & Economics,Hangzhou,310018,china 2 College of computer science and technology,Zhejiang university,Hangzhou,310012,china school of Information Zhejiang University of Finance & Economics Hangzhou China College of computer science and technology Zhejiang University Hangzhou China

Multimedia content analysis and management are a promising and challenging *** this paper we develop a novel approach to image representation,which we call group sparse representation (GSR),for image classification and video *** basic idea is to represent a test image as a weighted combination of all the training *** particular,we introduce two sets of weight coefficients,one for each training image and the other for each ***,we formulate our concern as a group nonnegative garrote *** resulting representations are sparse,and they are appropriate for discriminant *** on Caltech101 and PASCAL VOC2008 image dataset and TRECVID2005 video corpus testify that our proposed approach is efficient and effective.

关键词： compressive sensing group sparse representation bag-of-SIFT-words nonnegative garrote l1-minimization apcluster

A quasi-physical algorithm for solving the linear separation problem in n-dimensional space

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Central South university of technology 2001年第4期8卷 272-277页

作者： HUANG Jia yuan (College of computer science, Huazhong university of science and technology, Wuhan 430074, china) College of computer science Huazhong University of Science and Technology Wuhan China

A quasi physical algorithm was proposed for solving the linear separation problem of point set in n dimensional *** original idea of the quasi physical algorithm is to find an equivalent physical world for the primitive mathematical problem and to observe the vivid images of the motion of matter in it so as to be inspired to obtain an algorithm for solving the mathematical problem. In this work, the electrostatics with two kinds of matter is found to be the equivalent physical world. As a result,the proposed algorithm is evidently more efficient and robust than the famous LMS algorithm and ETL algorithm. The efficiency of the quasi physical algorithm is about 10-50 times of the LMS algorithm’s for representative instances. A typical Boolean valued instance shows that it is hard for ETL algorithm but very easy for the quasi physical *** this instance, point set A and B is {000, 010, 011, 111} and {001,100}, respectively.

关键词： linear separation problem neural network algorithm quasi-physical method electrostatics

A Practice Guide of Software Aging Prediction in a Web Server Based on Machine Learning

在线全文

学校读者我要写书评

暂无评论

china Communications 2016年第6期13卷 225-235页

作者： Yongquan Yan Ping Guo school of computer science and technology Beijing Institute of TechnologyBeijing 100081China school of System science Beijing Normal UniversityBeijing 100875China

In the past two decades, software aging has been studied by both academic and industry communities. Many scholars focused on analytical methods or time series to model software aging process. While machine learning has been shown as a very promising technique in application to forecast software state: normal or aging. In this paper, we proposed a method which can give practice guide to forecast software aging using machine learning algorithm. Firstly, we collected data from a running commercial web server and preprocessed these data. Secondly, feature selection algorithm was applied to find a subset of model parameters set. Thirdly, time series model was used to predict values of selected parameters in advance. Fourthly, some machine learning algorithms were used to model software aging process and to predict software aging. Fifthly, we used sensitivity analysis to analyze how heavily outcomes changed following input variables change. In the last, we applied our method to an IIS web server. Through analysis of the experiment results, we find that our proposed method can predict software aging in the early stage of system development life cycle.

关键词： software aging software rejuvenation machine learning web server

Geometric double-entity model for recognizing far-near relations of clusters

在线全文

学校读者我要写书评

暂无评论

science china(Information sciences) 2011年第10期54卷 2040-2050页

作者： WANG KaiJun ,YAN XuanHui & CHEN LiFei school of Mathematics and computer science,Fujian normal university,Fuzhou 350108,china school of Mathematics and computer science Fujian Normal University Fuzhou China

When solving many practical problems,we not only need sample labels given by a clustering algorithm,but also rely on the recognition of far-near relations of *** the difficult condition of many clusters in a high-dimensional data set,the clustering visualization methods based on dimension reductions usually produce the phenomena,e.g.,some clusters are overlapping,interlacing,or pushed away;as a result,the far-near relations of some clusters are displayed wrongly or cannot be *** existing inter-cluster distance methods cannot determine whether two clusters are far away or *** geometric double-entity model method (GDEM) is proposed to describe far-near relations of clusters,and the methods such as the relative border distance,absolute border distance and region dense degree are designed to measure far-near degrees between *** pays attention to both the absolute distance between nearest sample sets and the dense degrees of border regions of two clusters,and it is able to uncover accurately far-near relations of clusters in a high-dimensional space,especially under the difficult condition mentioned *** experimental results on four real data sets show that the proposed method can effectively recognize far-near relations of clusters,while the conventional methods cannot.

关键词： geometric double-entity model far-near relations of clusters distance between clusters partitional clustering algorithms

An Improved Immune Genetic Algorithm for Solving the Optimization Problems of computer Communication Networks

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

The Journal of china Universities of Posts and Telecommunications 2003年第4期10卷 11-16页

作者： SUN Li-juan,LI Chao(Department of computer science and technology, nanjing university of Posts and Telecommunications, nanjing 210003, P.R. china) Department of computer science and technology Nanjing University of Posts and Telecommunications Nanjing 210003

Obtaining the average delay and selecting a route in a communication networkare multi-constrained nonlinear optimization problems . In this paper, based on the immune geneticalgorithm, a new fuzzy self-adaptive mutation operator and a new upside-down code operator areproposed. This improved IGA is further successfully applied to solve optimal problems of computercommunication nets.

关键词： immune genetic algorithm fuzzy self-adaptive mutation upside-down code optimal route selection communication network

A NOTE ON THE DIPERNA-LIONS FLOWS

在线全文

学校读者我要写书评

暂无评论

Acta Mathematica Scientia 2011年第5期31卷 1719-1724页

作者：刘昕黄文亮 school of computer science and technology Huazhong University of Science and Technology Department of Mathematics East China University of Science and Technology

In this note, we give a short proof for the DiPerna-Lions flows associated to ODEs following the method of Crippa and De Lellis [3]. More precisely, assume that [divb] ∈ Ll∞oc（Rd）, ｜b｜/（1 ＋｜x｜ log ｜x｜） ∈ L∞（Rd） and ｜ b｜ φ（｜ b｜） ∈ Ll1oc（Rd）, where φ（r） = log log（r ＋ c）, c 0. Then, there exists a unique regular Lagrangian flow associated with the ODE X˙（t, x） = b（X（t, x））, X（0, x） = x.

关键词： DiPerna-Lions flow Hardy-Littlewood maximal function

Development and application of ergodicity model with FRCM and FLAR for hydrological process

在线全文

学校读者我要写书评

暂无评论

science china(Technological sciences) 2009年第2期52卷 379-386页

作者： WANG HongRui1, FENG QiLei2, LIN Xin3 & ZENG WenYi4 1 College of Water science, Key Laboratory for Water and Sediment sciences of the Ministry of Education, Beijing normal university, Beijing 100875, china 2 school of science, Beijing Institute of Education, Beijing 100011, china 3 school of Mathematical sciences, Beijing normal university, Beijing 100875, china 4 College of Information science and technology, Beijing normal university, Beijing 100875, china College of Water science Key Laboratory for Water and Sediment Sciences of the Ministry of Education Beijing Normal University Beijing China school of science Beijing Institute of Education Beijing China school of Mathematical sciences Beijing Normal University Beijing China College of Information science and technology Beijing Normal University Beijing China

In this paper, a new ergodic property analysis model of hydrological process is proposed based on fuzzy-rough c-means clustering (FRCM), autocorrelogram, and fuzzy least absolute regression (FLAR). A precipitation time series (1951―2004) from Shanghai Hydrology Station is then analyzed with the model. The results show that the precipitation time series of April, May, June, and September has er-godic property. We conclude that in the long run, the precipitation of April, May, June, and September will not keep decreasing; it will converge to its mean value in some period.

关键词： hydrological process ergodic autocorrelogram fuzzy-rough c-means clustering fuzzy least absolute regression

Prediction for RNA planar pseudoknots

在线全文

学校读者我要写书评

暂无评论

Progress in Natural science:Materials International 2007年第6期17卷 717-724页

作者： Li Hengwu1,2, Zhu Daming1, Liu Zhendong1 and Li Hong2(1. school of computer science and technology, Shandong university, Jinan 250100, china 2. Department of computer, Shandong Economic university, Jinan 250014, china) school of computer science and technology Shandong University Jinan 250100 China Department of computer Shandong Economic University Jinan 250014 China

Based on m-stems and semi-extensible structure, a model is presented to represent RNA planar pseudoknots, and corresponding dynamic programming algorithm is designed and implemented to predict arbitrary planar pseudoknots and simple non-planar pseudoknots with O(n4) time and O(n3) space. The algorithm folds total 245 sequences in the Pseudobase database, and the test results indicate that the algorithm has good accuracy, sensitivity and specificity.

关键词： algorithm RNA secondary structure pseudoknot dynamic programming.

Immigrant schemes for evolutionary algorithms in dynamic environments: Adapting the replacement rate

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science china(Information sciences) 2011年第7期54卷 1352-1364页

作者： YU Xin 1,TANG Ke 1 & YAO Xin 1,2 1 Nature Inspired Computation and Applications Laboratory,school of computer science and technology,university of science and technology of china,Hefei 230027,china 2 Centre of Excellence for Research in Computational Intelligence and Applications,school of computer science,university of Birmingham,Edgbaston,Birmingham B15 2TT,U.K. Nature Inspired Computation and Applications Laboratory School of Computer Science and Technology University of Science and Technology of China Hefei China Centre of Excellence for Research in Computational Intelligence and Applications School of Computer Science University of Birmingham Edgbaston Birmingham UK

One approach for evolutionary algorithms (EAs) to address dynamic optimization problems (DOPs) is to maintain diversity of the population via introducing *** far all immigrant schemes developed for EAs have used fixed replacement *** paper examines the impact of the replacement rate on the performance of EAs with immigrant schemes in dynamic environments,and proposes a self-adaptive mechanism for EAs with immigrant schemes to address *** experimental study showed that the new approach could avoid the tedious work of fine-tuning the parameter and outperformed other immigrant schemes using a fixed replacement rate with traditionally suggested values in most cases.

关键词： evolutionary algorithm dynamic optimization problem immigrant scheme self-adaptive replace- ment rate