中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
首页
机构
成果
学者
登录
注册
登陆
×
验证码:
换一张
忘记密码?
记住我
×
校外用户登录
CAS IR Grid
机构
长春光学精密机械与物... [2]
武汉岩土力学研究所 [1]
近代物理研究所 [1]
采集方式
OAI收割 [4]
内容类型
会议论文 [2]
期刊论文 [2]
发表日期
2021 [1]
2017 [1]
2009 [1]
2004 [1]
学科主题
筛选
浏览/检索结果:
共4条,第1-4条
帮助
条数/页:
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
排序方式:
请选择
题名升序
题名降序
提交时间升序
提交时间降序
作者升序
作者降序
发表日期升序
发表日期降序
Interpretation of cone penetration test in clay with smoothed particle finite element method
期刊论文
OAI收割
ACTA GEOTECHNICA, 2021, 期号: -, 页码: 15
作者:
Zhang, Wei
;
Zou, Jia-qiang
;
Zhang, Xian-wei
;
Yuan, Wei-hai
;
Wu, Wei
  |  
收藏
  |  
浏览/下载:117/0
  |  
提交时间:2021/08/11
Cone penetration test
Cone factor
Large deformation
Modified Cam-Clay
Numerical modeling
Smoothed particle finite element method
Shape analysis applied in heavy ion reactions near Fermi energy
期刊论文
OAI收割
JOURNAL OF PHYSICS G-NUCLEAR AND PARTICLE PHYSICS, 2017, 卷号: 44, 页码: 10
作者:
Zhang, S.
;
Huang, M.
;
Wada, R.
;
Liu, X.
;
Lin, W.
  |  
收藏
  |  
浏览/下载:23/0
  |  
提交时间:2018/05/31
intermediate heavy ion reactions
shape analysis
test particle method
antisymmetrized molecular dynamics model
An efficient discrete particle swarm algorithm for task assignment problems (EI CONFERENCE)
会议论文
OAI收割
2009 IEEE International Conference on Granular Computing, GRC 2009, August 17, 2009 - August 19, 2009, Nanchang, China
作者:
Wang C.
收藏
  |  
浏览/下载:14/0
  |  
提交时间:2013/03/25
Task Assignment Problems (TAPs) in distributed computer system are general NP-hard and usually modeled as integer programming discrete problems. Many algorithms are proposed to resolve those problems. Discrete particle swarm algorithm (DPS) is a newly developed method to solve constraint satisfaction problem (CSP) which has advantage on search capacity and can find more solutions. We proposed an improved DPS to solve TAP in this paper. DPS has a special operator namely coefficient multiplying speed
which is designed for CSP but does not exist in other discrete problems. Thus we redefined a coefficient multiplying speed operator with probability selection. We analyzed the speed and position updating formula then we derived a refined position updating formula. Several experiments are carried out to test our DPS. Experimental results show that our algorithm has more efficient search capacity
higher success rate
less running time and more robust.
PSO based gabor wavelet feature extraction method (EI CONFERENCE)
会议论文
OAI收割
2004 International Conference on Information Acquisition, ICIA 2004, June 21, 2004 - June 25, 2004, Hefei, China
作者:
Sun H.
;
Zhang Y.
;
Sun H.
收藏
  |  
浏览/下载:20/0
  |  
提交时间:2013/03/25
In this paper
the time of feature extraction is faster. By test in low contrast image
2D continues Gabor wavelets are adopted to realize feature extraction. By optimize Gabor wavelet's parameters of translation
the feasibility and effectiveness of the algorithm are demonstrated by VC++ simulation platform in experiments. 2004 IEEE.
orientation
and scale to make it approximates a local image contour region. The method of Sobel edge detection is used to get the initial position and orientation value of optimization in order to improve the convergence speed. In the wavelet characteristic space
we adopt PSO (particle swarm optimization) Algorithm to identify points on the security border of the system. Comparing to the LM algorithm
it can ensure reliable convergence the target
which can improve convergent speed