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

Picture Coding Symposium, PCS

作者： Ling Yang Li Zhang Siwei Ma Debin Zhao Chinese Academy of Sciences Beijing China Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy and Sciences Beijing China Institute of Digital Media School of Electronic Engineering and Computer Science Peking University Beijing China Department of Computer Science and Engineering Harbin Institute of Technology Harbin China

This paper proposed a novel Region of Interest (ROI) based rate control algorithm for video communication systems, in which the subjective quality of ROI can be adjusted according to users' requirements. In the proposed scheme, in order to analyze the relationship between subjective quality and encoding parameters, a structural similarity index map - quantization parameter (SSIM-QP) model is established. Through this relation, the possible visual quality range of ROI is defined according to the range of ROI QP, which is predicted by rate control algorithm. Then, with interest levels being identified within the visual quality range, resources allocated to ROI is determined. Finally, considering both the quality of ROI and the entire frame, resource allocation is slightly adjusted. Experimental results demonstrate that the subjective visual quality of ROI in our proposed scheme can be adjustable improved compared to the existing rate control algorithms.

关键词： Bit rate Video coding Quadratic programming Humans computer science Quantization Resource management Videoconference PSNR Data mining

来源：评论

学校读者我要写书评

暂无评论

Residual-loading-capacity-based ant colony system for the vehicle routing problem with simultaneous delivery and pickup

引用

Kongzhi Lilun Yu Yingyong/Control Theory and Applications 2009年第5期26卷 546-549页

作者： Zhang, Tao Tian, Wen-Xin Zhang, Yue-Jie Liu, Shi-Xin School of Information Management and Engineering Shanghai University of Finance and Economics Shanghai 200433 China Informatization Office in Center of Modern Education Technology Shanghai Finance University Shanghai 201209 China Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University Shanghai 200433 China School of Information Science and Engineering Northeastern University Shenyang Liaoning 110004 China

The vehicle routing problem with simultaneous delivery and pickup (VRPSDP) is studied under capacity constraint and maximum distance constraint;and the mixed integer programming model is built. To deal with the fluctuation in vehicle load, we propose an ant colony system (ACS) approach by combining the pheromone updating strategy of rank-based version of the ant system (ASRank) with the MAX-MIN ant system (MMAS). A heuristic factor based on the residual loading capacity is also designed to improve the vehicle loading rate. Additionally, a local search strategy of node-exchange is used in the process of tour improvement to accelerate the searching. Finally, numerical results show that the algorithm provides the desirable solution with high convergence rate.

关键词： Pickups

来源：评论

学校读者我要写书评

暂无评论

Overview of PAKDD Competition 2007

引用

International Journal of Data Warehousing and Mining 2008年第2期4卷 1-8页

作者： Zhang, Junping Li, Guo-Zheng Shanghai Key Lab. of Intelligent Information Processing Department of Computer Sciences and Engineering Fudan University Shanghai China School of Computer Science and Engineering Shanghai University Shanghai China

The PAKDD Competition 2007 involved the problem of predicting customers' propensity to take up a home loan when a collection of data from credit card users are provided. It is rather difficult to address the problem because 1) the data set is extremely imbalanced;2) the features are mixture types;and 3) there are many missing values. This article gives an overview on the competition, mainly consisting of three parts: 1) The background of the database and some statistical results of participants are introduced;2) An analysis from the viewpoint of data preparation, resampling/reweighting and ensemble learning employed by different participants is given;and 3) Finally, some business insights are highlighted. Copyright © 2008, IGI Global.

关键词： Competition

来源：评论

学校读者我要写书评

暂无评论

Reinforcing mutual information-based strategy for feature selection for microarray data 8

Reinforcing mutual information-based strategy for feature se...

引用

8th International Workshop on Data Mining in Bioinformatics, BIOKDD 2008 - Held in conjunction with 14th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, KDD 2008

作者： Tang, Jian Zhou, Shuigeng Li, Feng Jiang, Kai Department of Computer Science Memorial University of Newfoundland St. John'sNL Canada School of Computer Science Shanghai Key Lab of Intelligent Information Processing Fudan University Shanghai200433 China

ISBN: (纸本)3642125182

Mutual information (MI) is a powerful concept for correlation-centric applications. Recently, it has been used for feature selection for microarray gene expression data. One of the merits of MI is, unlike many other heuristic methods, it is based on a mature theoretic foundation. When applied to microarray data, however, it faces a number of challenges. Firstly, due to large numbers of features (i.e., genes) present in microarrays, the true distributions for the expression values of some genes may be masked by noises. Secondly, evaluating inter-group mutual information requires estimating multi-variate distributions, which is difficult. To address the first problem, we use a scheme called Substantial relevance boosting, which requires a non-noisy feature to show substantially additional relevance with class labeling beyond the already selected features. To address the second problem, we use Increasing likelihood of feature interaction, which probabilistically compensates for feature interaction missing from simple aggregation-based simulation. We justify our strategies from both a theoretical perspective, and the experimental results on real life data sets, which show the improved effectiveness of our method over the existing schemes. © 2008 ACM

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Publisher's Note: “Influences of degree inhomogeneity on average path length and random walks in disassortative scale-free networks” [J. Math. Phys. 50, 033514 (2009)]

引用

Journal of Mathematical Physics 2009年第6期50卷

作者： Zhongzhi Zhang Yichao Zhang Shuigeng Zhou Ming Yin Jihong Guan 1School of Computer Science Fudan University Shanghai 200433 People's Republic of China 2Shanghai Key Laboratory of Intelligent Information Processing Fudan University Shanghai 200433 People's Republic of China 3Department of Computer Science and Technology Tongji University 4800 Cao'an Road Shanghai 201804 People's Republic of China

This article was originally published online on 30 March 2009 with an error in Sec. I and with an incorrect version of Eq. (30). In Sec. I, in the second senten

关键词：

来源：评论

学校读者我要写书评

暂无评论

Ensemble Non-negative Matrix Factorization for Clustering Biomedical Documents

Ensemble Non-negative Matrix Factorization for Clustering Bi...

引用

第二届最优化与系统生物学国际研讨会

作者： Shanfeng Zhu Wei Yuan Fei Wang School of Computer Science and Technology Fudan University Shanghai Key Lab of Intelligent Information Processing Fudan University

Searching and mining biomedical literature database, such as MEDLINE, is the main source of generating scientific hypothesis for biomedical researchers. Through grouping similar documents together, clustering techniques can facilitate user's need of effectively finding interested documents. Since non-negative matrix factorization (NMF) can effectively capture the latent semantic space with non-negative factorization in both the basis and the weight, it has been utilized to clustering general text documents. Considering the stochastic nature of NMF with respect to initialization, we propose to use ensemble NMF for biomedical document clustering. The performance of ensemble NMF was evaluated on clustering a large number of datasets generated from TREC Genomics track dataset. The experimental results show that our method outperforms classical clustering algorithms bisect k-means, k-means and hierarchical clustering significantly in most of the datasets.

关键词： MEDLINE NMF Ensemble Non-negative Matrix Factorization for Clustering Biomedical Documents Matrix

来源：评论

学校读者我要写书评

暂无评论

Towards more effective text summarization based on textual association networks

Towards more effective text summarization based on textual a...

引用

4th International Conference on Semantics, Knowledge, and Grid, SKG 2008

作者： Yuhui, Tao Shuigeng, Zhou Wai, Lam Jihong, Guan Department of Computer Science and Engineering Shanghai Key Lab of Intelligent Information Processing Fudan University Shanghai 200433 China Department of Systems Engineering and Engineering Management Chinese University of Hong Kong Shatin N.T. Hong Kong Department of Computer Science and Technology Tongji University Shanghai 200092 China

ISBN: (纸本)9780769534015

This paper proposes new text summarization approaches based on textual unit association networks. Textual units refer to words, phrases, sentences, or paragraphs. Intuitively, textual units containing much co-occurrence information are semantically more salient in a document. We construct two kinds of textual association networks, namely, word-based association network and sentence-based association network. For the former, we propose a new approach to computing the word weights and sentence weights. For the latter, we develop a new scheme to score each sentence based on its co-occurrence information. Extensive experiments on benchmark data show that our proposed approaches can achieve better summarization performance than the existing methods. Our approaches are unsupervised, independent of languages, and efficient for different text genre. © 2008 IEEE.

关键词： Text processing

来源：评论

学校读者我要写书评

暂无评论

DNA computing model based on lab-on-a-chip and its application on solving the timetabling problem

引用

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

作者： Fengyue Zhang a,1, Bo Liu b,1, Wenbin Liu c, Qiang Zhang d a Department of Biomedical Engineering, school of Life science and technology, Beijing Institute of technology, Beijing 100081, China b Chinese Academy of Inspection and Quarantine, Beijing 100029, China c College of computer science and Engineering, Wenzhou University, Wenzhou, Zhejiang 325027, China d Liaoning key laboratory of intelligent information processing, Dalian University, Dalian, Liangning 116622, China Department of Biomedical Engineering School of Life Science and Technology Beijing Institute of Technology Beijing 100081 China Chinese Academy of Inspection and Quarantine Beijing 100029 China College of Computer Science and Engineering Wenzhou University Wenzhou Zhejiang 325027 China Liaoning Key Laboratory of Intelligent Information Processing Dalian University Dalian Liangning 116622 China

The essential characteristic of DNA computation is its massive parallelism in obtaining and managing information. With the develop- ment of molecular biology technique, the eld of DNA computation has made a great progress. By using an advanced biochip technique, laboratory-on-a-chip, a new DNA computing model is presented in the paper to solve a simple timetabling problem, which is a special ver- sion of the optimization problems. It also plays an important role in education and other industries. With a simulated biological experiment, the result suggested that DNA computation with lab-on-a-chip has the potential to solve a real complex timetabling problem.

关键词： DNA computing Timetabling problem lab-on-a-chip

来源：评论

学校读者我要写书评

暂无评论

SAR image despeckling based on edge detection and nonsubsampled second generation bandelets

引用

Journal of Systems Engineering and Electronics 2009年第3期000卷

作者： Zhang Wenge Liu Fang Jiao Licheng Gao Xinbo School of Computer Science and Technology Xidian Univ. Xi'an 710071 P. R. China Key Lab. of Intelligent Perception and Image Understanding of Ministry of Education of China Xi'an 710071 P. R. China Key Lab. of Intelligent Perception and Image Understanding of Ministry of Education of China Xi'an 710071 P. R. China Inst. of Intelligent Information Processing Xidian Univ. Xi'an 710071 P. R. China

To preserve the sharp features and details of the synthetic aperture radar (SAR) image effectively when despeckling, a despeckling algorithm with edge detection in nonsubsampled second generation bandelet transform (NSBT) domain is proposed. First, the Canny operator is utilized to detect and remove edges from the SAR image. Then the NSBT which has an optimal approximation to the edges of images and a hard thresholding rule are used to approximate the details while despeckling the edge-removed image. Finally, the removed edges are added to the reconstructed image. As the edges are detected and protected, and the NSBT is used, the proposed algorithm reaches the state-of-the-art effect which realizes both despeckling and preserving edges and details simultaneously. Experimental results show that both the subjective visual effect and the mainly objective performance indexes of the proposed algorithm outperform that of both Bayesian wavelet shrinkage with edge detection and Bayesian least square-Ganssian scale mixture (BLS-GSM).

关键词： computer image processing synthetic aperture radar speckle edge detection nonsubsampled secondgeneration bandelet transform Canny operator threshold shrinkage

来源：评论

学校读者我要写书评

暂无评论

Improved ant colony algorithm for the VRPSPD with maximum distance constraint

引用

Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice 2008年第1期28卷 132-140+169页

作者： Zhang, Tao Tian, Wen-Xin Zhang, Yue-Jie Liu, Shi-Xin School of Information Management and Engineering Shanghai University of Finance and Economics Shanghai 200433 China Informatization Office in Center of Modern Education Technology Shanghai Finance University Shanghai 201209 China Shanghai Key Laboratory of Intelligent Information Processing Department of Computer Science and Engineering Fudan University Shanghai 200433 China Key Laboratory of Integrated Automation of Process Industry School of Information Science and Engineering Northeastern University Shenyang 110004 China

This paper studies the reverse logistics vehicle routing problem of simultaneous distribution of commodities and collection of reusable ones the same size as the initial state with a single depot and a homogeneous fleet of vehicles with limited capacities and maximum distance, and constructs a mixed integer programming model. To solve this problem, an Ant Colony System (ACS) approach combining with the pheromone updating strategy of ASRank (Rank-based Version of Ant System) and MMAS (MAX-MIN Ant System) is proposed. A new heuristic factor is designed to improve the vehicle loading ability as well as the vehicle distance, and the initial vehicle load is designed to be a random value correlated to the delivery and pick-up demand of the rest customers on the path. The experimental study indicates that the approach could improve the vehicle load rate and get rid of the additional total distance caused by the fluctuating vehicle load and the limited capacity. It could obtain the satisfied solution with high convergence speed in the acceptable time.

关键词： Systems engineering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：