中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
首页
机构
成果
学者
登录
注册
登陆
×
验证码:
换一张
忘记密码?
记住我
×
校外用户登录
CAS IR Grid
机构
长春光学精密机械与物... [2]
自动化研究所 [1]
长春应用化学研究所 [1]
采集方式
OAI收割 [4]
内容类型
会议论文 [2]
期刊论文 [2]
发表日期
2013 [1]
2008 [1]
2007 [1]
2006 [1]
学科主题
筛选
浏览/检索结果:
共4条,第1-4条
帮助
条数/页:
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
排序方式:
请选择
题名升序
题名降序
提交时间升序
提交时间降序
作者升序
作者降序
发表日期升序
发表日期降序
Optimizing Scoring Function of Protein-Nucleic Acid Interactions with Both Affinity and Specificity
期刊论文
OAI收割
plos one, 2013, 卷号: 8, 期号: 9, 页码: 文献号: e74443
Yan ZQ
;
Wang J
收藏
  |  
浏览/下载:30/0
  |  
提交时间:2014/04/15
KNOWLEDGE-BASED POTENTIALS
COMPUTATIONAL REDESIGN
DOCKING BENCHMARK
MEAN FORCE
MOLECULAR RECOGNITION
BINDING-AFFINITY
DNA INTERACTIONS
ENERGY FUNCTION
LIGAND-BINDING
DATA-BANK
Algorithm research of flexible graphplan based on heuristic (EI CONFERENCE)
会议论文
OAI收割
9th International Conference for Young Computer Scientists, ICYCS 2008, November 18, 2008 - November 21, 2008, Zhang Jia Jie, Hunan, China
作者:
Xu S.
;
Wang X.
;
Wang X.
;
Wang X.
;
Sun Y.
收藏
  |  
浏览/下载:31/0
  |  
提交时间:2013/03/25
Classic Graphplan has too much restriction on capturing the full subtlety of many real problems. Flexible Graphplan is defined which supports the soft constraints often found in reality. Heuristic concept is introduced to the process of plan extraction in flexible graphplan in order to improve the efficiency of plan extraction and the quality of plan. A novel algorithm using the new heuristic function which is applied by improved sum mutex heuristic to deal with planning problems is proposed. Sum mutex heuristic which is in common use as heuristic function takes into account only static propositional mutexes
and ignores the mutexes of actions. The performance of the new algorithm on many benchmark problems is remarkably robust. It can solve many planning problems
which can't be solved by the heuristic state space search planning system using sum mutex heuristic. 2008 IEEE.
Data preprocessing of the exterior field of vision assembling photogrammetric camera (EI CONFERENCE)
会议论文
OAI收割
3rd International Symposium on Advanced Optical Manufacturing and Testing Technologies: Optical Test and Measurement Technology and Equipment, July 8, 2007 - July 12, 2007, Chengdu, China
作者:
Li J.
;
Li J.
;
Li J.
;
Liu J.
;
Liu J.
收藏
  |  
浏览/下载:87/0
  |  
提交时间:2013/03/25
Transmit array photogrammetric camera can obtain image which is high geometric fidelity and high photogrammetric quality. However
the single chip array CCD image sensor camera can't meet the need of measuring precision and photogrammetric covering area. In order to obtain large numbers of information and extensive photogrammetric covering area
we must increase field of vision angle and improve photogrammetric covering area. And all these objects can be realized by exterior field of vision assembling photogrammetric camera. Two side work must be done before images
which obtained by exterior field of vision assembling photogrammetric camera
be used in photogrammetry. First
all assembling camera focal plane need be converted to a benchmark coordinate focal plane to realize camera digital assembling. Second
images must be re-sampled and processing. Because of coordinate conversion
two images from different assembling cameras can be established function relation
which a pixel of image from a camera is corresponding to a pixel of another image from different camera. But through this conversion
some pixels maybe extrusion together and other pixels separate on an image area. So interpolation direction finding(IDF) is used to obtain these pixels and realize image re-sampling. In this paper
the structure of exterior field of vision assembling photogrammetric camera is analyzed
and the coordinate conversion method of exterior field of vision assembling photogrammetric camera and image gray re-sampling method also can be discussed. All the works are based to data pretreatment of exterior vision assembling photogrammetric camera.
A note on the extended Rosenbrock function
期刊论文
OAI收割
EVOLUTIONARY COMPUTATION, 2006, 卷号: 14, 期号: 1, 页码: 119-126
作者:
Shang, YW
;
Qiu, YH
收藏
  |  
浏览/下载:13/0
  |  
提交时间:2015/11/06
numerical optimization problems
benchmark function
multimodal function
local minimum