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

3rd International Conference on Cognitive Radio Oriented Wireless Networks and Communications (CrownCom 2008)

作者： Ping Zhu Jinglong Li Xufa Wang Department of Computer Science and Technology Anhui Province Key Laboratory of Software in Computing and Communication University of Science and Technology Hefei Anhui China Department of Computer Science and Technology University of Science and Technology of China Hefei Anhui China

ISBN: (纸本)9781424423019

The priority queue model divides CR (cognitive radio) system users into primary user and secondary user. The primary user has preemptive priority over secondary user, while the same priority level users are FIFO served. This paper models the CR system based on scheduling technology. The secondary users are further divided into different priority levels. A hybrid priority dynamic policy, which indicates primary user's preemptive priority and secondary user's nonpreemptive priority, is developed to reduce spectrum switch overhead during spectrum leasing process. Theoretical analyzing shows that hybrid priority reduces the spectrum switch overhead and the hybrid priority improvement is a non-negative mono-increasing function of priority level. Based on the proposed policy, CR scheduling model is built and CR scheduling rule is provided and proved. Experimental comparison between CR scheduling and priority queue shows that CR scheduling gets a smaller weighted staying time sum than priority queue and the improvement increases as system becomes more congested.

关键词： Cognitive radio Priority queue CR schedule

来源：评论

学校读者我要写书评

暂无评论

Cellular signal transduction network simulation based on microscopic agent model

引用

Xitong Fangzhen Xuebao / Journal of System Simulation 2008年第17期20卷 4703-4707页

作者： Shao, Chen-Xi Deng, Hong-Li Yang, Ming Wang, Zi-Cai Department of Computer Science and Technology University of Science and Technology of China Hefei 230027 China Control and Simulation Center Harbin Institute of Technology Harbin 150001 China Anhui Province Key Laboratory of Software in Computing and Communication Hefei 230027 China

A hierarchical MAS (multi-agent system) based on a multi-level discrete space and microscopic agent model for signal transduction network modeling and simulation was proposed. The space can effectively represent the heterogeneous cellular space, and is adaptable for systemic expansion. Moreover, the different deformations of one molecular species are packed in one mesoscopic molecule-agent, so that the global complexity is handled by the local state-space, reducing the external communications and computational complexity. The results from simulating two feedback models of MAPK (Mitogen-Activated Protein Kinase) pathway are similar to those of chemical kinetic model, showing the validity of this method.

关键词： Agent Cellular signal transduction Complex system Discrete space Microscopic level

来源：评论

学校读者我要写书评

暂无评论

ADOM: An Adaptive Objective Migration Strategy for Grid Platform

ADOM: An Adaptive Objective Migration Strategy for Grid Plat...

引用

第七届网格与协同计算国际会议(Seventh International Conference on Grid and Cooperative Computing GCC 2008)

作者： Chunfeng Si Wenzhong Li Qi Lv Tao Yan Sanglu Lu Daoxu Chen State Key Laboratory for Novel Software Technology Nanjing University Department of Computer Science Nanjing University Nanjing Jiangsu 210093 China

ISBN: (纸本)9781424432806

Object migration is the movement of objects from one machine to another during execution. It can be used to enhance the *** and the reliability of grid systems, such as to balance load distribution, to enable fault resilience, to improve system administration, and to minimize communication overhead. Most existing schemes apply .xed object migration strategies, which are unadaptable to changing requirements of applications. In this paper, we address the issue of object migration for large scale grid system with multiple object levels. First, we devise a probabilistic object tree model and formulate the object migration problem as an optimization problem. Then we proposed an adaptive object migration algorithm called ADOM to solve the problem. the ADOM algorithm applies the breadth .rst search scheme to traversal the object tree and migrates object adaptively according to their access probability. Finally we evaluate the performance of different object migration algorithms in our grid platform, which show that the ADOM algorithm outperforms other algorithms under large object tree size.

关键词： grid object migration adaptive distributed application

来源：评论

学校读者我要写书评

暂无评论

Error bounded algorithm for approximate B-spline surface skinning

引用

Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of computer-Aided Design and computer Graphics 2008年第11期20卷 1477-1482页

作者： Wang, Wenke Zhang, Hui Wang, Bin School of Software Tsinghua University Beijing 100084 China Department of Computer Science and Technology Tsinghua University Beijing 100084 China Key Laboratory for Information System Security Beijing 100084 China Tsinghua National Laboratory for Information Science and Technology Beijing 100084 China

B-spline surface skinning is a commonly used tool in surface modeling. Huge amounts of control points will be introduced in the skinned surface by traditional skinning approach. This paper proposes an efficient approximating skinning algorithm for constructing B-spline surface based on Piegl's approach. By a more precise estimation of maximum value of a B-spline basis function and utilizing of the local support property of B-spline basis function, the control points of a set of compatible B-spline curves are reduced, which makes the skinning algorithm more effective. Under the same error bound, experimental results showed that our algorithm can reduce more control points than Piegl's.

关键词： Interpolation

来源：评论

学校读者我要写书评

暂无评论

Fuzzy biclustering for DNA microarray data analysis

Fuzzy biclustering for DNA microarray data analysis

引用

2008 IEEE International Conference on Fuzzy Systems, FUZZ 2008

作者： Lixin, Han Hong, Yan Department of Computer Science and Engineering Hohai University China State Key Laboratory of Novel Software Technology Nanjing University China Department of Electronic Engineering City University of Hong Kong Tat Chee Avenue Kowloon Hong Kong School of Electrical and Information Engineering University of Sydney NSW 2006 Australia

ISBN: (纸本)9781424418190

Fuzzy biclustering analysis Is a useful tool for identifying relevant subsets of microarray data. This paper proposes a fuzzy biclustering clustering method for microarray data analysis. The method employs a combination of the Nelder-Mead and min-max algorithm to construct hierarchically structured biclustering. The method can automatically identify the groups of genes that show similar expression patterns under a specific subset of the samples. © 2008 IEEE.

关键词： Gene expression

来源：评论

学校读者我要写书评

暂无评论

Mesh-guided optimized retexturing for image and video

Mesh-guided optimized retexturing for image and video

引用

作者： Guo, Yanwen Sun, Hanqiu Peng, Qunsheng Jiang, Zhongding IEEE National Laboratory for Novel Software Technology Nanjing University Nanjing 210093 China Department of Computer Science and Engineering Chinese University of Hong Kong Shatin N.T. Hong Kong State Key Lab. CAD and CG Zhejiang University Hangzhou 310058 China Software School Fudan University Shanghai 201203 China

This paper presents a novel approach for replacing textures of specified regions in the input image and video using stretch-based mesh optimization. The retexturing results have the similar distortion and shading effect conforming to the unknown underlying geometry and lighting conditions. For replacing textures in a single image, two important steps are developed: The stretch-based mesh parameterization incorporating the recovered normal information is deduced to imitate perspective distortion of the region of interest;the Poisson-based refinement process is exploited to account for texture distortion at fine scale. The luminance of the input image is preserved through color transfer in YCbCr color space. Our approach is independent of the replaced textures. Once the input image is processed, any new textures can be applied to efficiently generate the retexturing results. For video retexturing, we propose key-frame-based texture replacement extended and generalized from the image retexturing. Our approach repeatedly propagates the replacement results of key frames to the rest of the frames. We develop the local motion optimization scheme to deal with the inaccuracies and errors of robust optical flow when tracking moving objects. Visibility shifting and texture drifting are effectively alleviated using graphcut segmentation algorithm and the global optimization to smooth trajectories of the tracked points over temporal domain. Our experimental results showed that the proposed approach can generate visually pleasing results for retextured images and video. © 2008 IEEE.

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

A new Evolutionary Algorithm based on quantum statistical mechanics

A new Evolutionary Algorithm based on quantum statistical me...

引用

Congress on Evolutionary Computation

作者： Ming Wei Yuanxiang Li Dazhi Jiang Yangfan He Xingyan Huang Xing Xu State Key Laboratory of Software Engineering Wuhan University of China Wuhan China Department of Computer Science and Technology Jilin University Changchun China

A new evolutionary algorithm based on quantum statistical mechanics (QSEA) is raised in this paper. In the algorithm, the whole evolutionary system is treated as a quantum statistical system, where quantum coding is adopted to express chromosomes, and superposition of quantum bits is used to simulate the linear superposition state of the system. Quantum system entropy and statistical energy have been defined by analogy with corresponding concepts in quantum statistical mechanics. And the competition between quantum statistical energy and entropy of the system is used to simulate the conflict between dasiaselection pressurepsila and dasiadiversity of populationpsila, which helps the algorithm to keep a delicate balance between these two issues, and obtain optimal solution rapidly. Numerical experiments show that this new algorithm has high efficiency and strong ability to get global optimal solution.

关键词： Entropy Quantum mechanics Gallium Convergence Evolutionary computation Thermodynamics Encoding

来源：评论

学校读者我要写书评

暂无评论

The self-adaption strategy for parameter ε in ε-MOEA

The self-adaption strategy for parameter ε in ε-MOEA

引用

Congress on Evolutionary Computation

作者： Min Zhang Wenjian Luo Xingxin Pei Xufa Wang Nature Inspired Computing and Application Laboratory Department of Computer Science and Technology University of Science and Technology China Anhui Key Laboratory of software in Computing Communication University of Science and Technology China University of Science and Technology of China Hefei Anhui CN Nature Inspired Computing and Application Laboratory Department of Computer Science and Technology of China University of Science and Technology China

A novel self-adaption strategy for the parameter epsiv in epsiv-MOEA is proposed in this paper based on the analyses of the relationship between the value of epsiv and the maximum number of non-dominated solutions. Then this novel strategy is applied in epsiv-MOEA and tested on 10 common benchmark functions. The experimental results demonstrate that even if without the good initial value for the parameter s, epsiv-MOEA with this self-adaption strategy (named Algorithm 1) is able to approximately obtain the expected number of non-dominated solutions, which are very close to and uniformly distributed on the Pareto-optimal front. Furthermore, the genetic drift phenomenon in Algorithm 1 is discussed Two cases of genetic drift are pointed out, and one case can be fixed up by a simple approach proposed in this paper.

关键词： Evolutionary computation

来源：评论

学校读者我要写书评

暂无评论

A high-precision template localization algorithm using SIFT keypoints

A high-precision template localization algorithm using SIFT ...

引用

International International Symposium on computer and Information sciences (ISCIS)

作者： Yang Yang Yixu Song Muhammad Akram Shaikh Jiaxin Wang State Key Laboratory on Intelligent Technology and Systems Tsinghua National Laboratory for Information Science and TechnologyDepartment of Computer Science Tsinghua University Beijing China

High-precision localization is one of the important applications in the field of computer vision. In this paper a high-precision template localization algorithm based on SIFT (scale invariant feature transform) is presented. The proposed method is composed of three main steps. In the initial step the SIFT features are extracted. With these features the basic matching strategy and clustering method similar distance threshold (SDT) are investigated to match the keypoints between template and test images and eliminate the possibility of mismatch. Then iterative least square method (ILSM) is adopted to locate the template and improve the accuracy. Compared with the traditional template matching methods, the proposed method could enhance the robustness effectively, which ensures to give correct results, no matter the test image changes its scale, rotates itself or is covered partly. The localization accuracy reaches 0.1 pixels.

关键词： Testing Feature extraction Image matching Application software computer vision Robustness Bonding Laboratories Clustering algorithms Clustering methods

来源：评论

学校读者我要写书评

暂无评论

Caching Invalidation Strategies for Supporting 'Weak' Location Dependent Queries

Caching Invalidation Strategies for Supporting 'Weak' Locati...

引用

International Conference on Distributed Computing Systems Workshop

作者： Yilin Wang Edward Chan Wenzhong Li Sanglu Lu Department of Computer Science City University of Hong Kong Hong Kong China State Key Laboratory for Novel Software Technology Nanjing University China

ISBN: (纸本)9781424431755

Caching technique has been widely used to accelerate data access for Location Dependent Information Services (LDISs) in mobile environments. Many existing LDISs focuse primarily on finding the nearest object. However, for some applications, closest location information is not strictly necessary. In this paper, we study caching invalidation strategies for 'weak' location dependent queries which require only loosen location constraints. First, we introduce a weak location dependent caching scheme to handle such queries. Then, we propose an efficient strategy based on weak valid scope to facilitate cache invalidation. Finally, we evaluate our strategies by simulations. Experimental results show that better cache hit ratios and lower communication cost can be achieved using this scheme..

关键词： Location Dependent Information Service Weak Location Dependent Scheme Cache Invalidation Valid Scope

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：