×
验证码:
换一张
忘记密码?
记住我
CORC
首页
科研机构
检索
知识图谱
申请加入
托管服务
登录
注册
在结果中检索
科研机构
西安交通大学 [4]
长春光学精密机械与物... [4]
兰州理工大学 [2]
武汉大学 [1]
内容类型
会议论文 [6]
期刊论文 [5]
发表日期
2020 [1]
2019 [1]
2017 [1]
2016 [1]
2014 [1]
2012 [1]
更多...
×
知识图谱
CORC
开始提交
已提交作品
待认领作品
已认领作品
未提交全文
收藏管理
QQ客服
官方微博
反馈留言
浏览/检索结果:
共11条,第1-10条
帮助
已选(
0
)
清除
条数/页:
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
排序方式:
请选择
作者升序
作者降序
题名升序
题名降序
发表日期升序
发表日期降序
提交时间升序
提交时间降序
A jigsaw puzzle inspired algorithm for solving large-scale no-wait flow shop scheduling problems
期刊论文
Applied Intelligence, 2020, 卷号: 50, 期号: 1, 页码: 87-100
作者:
Zhao, Fuqing
;
He, Xuan
;
Zhang, Yi
;
Lei, Wenchang
;
Ma, Weimin
收藏
  |  
浏览/下载:74/0
  |  
提交时间:2020/11/14
Benchmarking
Heuristic algorithms
Machine shop practice
NP-hard
Scheduling
Algorithm for solving
Jigsaw puzzles
Makespan
Matching matrix
Minimizing makespan
No-wait flow-shop scheduling
Optimal scheduling
State of the art
High order numerical algorithms based on biquadratic spline collocation for two-dimensional parabolic partial differential equations
期刊论文
International Journal of Computer Mathematics, 2019, 卷号: 96, 页码: 500-536
作者:
Liu, Jun
;
Guo, Hui
;
Jiang, Yao-Lin
;
Wang, Yan
收藏
  |  
浏览/下载:22/0
  |  
提交时间:2019/11/19
Acceleration strategies
Algorithm for solving
Block-tridiagonal linear systems
convergence
Deferred correction
Parabolic partial differential equations
Space discretizations
Spline collocation
Stationary clearance link algorithm for solving the counter-force in the clearance revolute joint of crank slider system
期刊论文
Beijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology, 2017, 卷号: 37, 页码: 15-18
作者:
Chen, Wei
;
Yu, Ru-Fei
;
Li, Pei
收藏
  |  
浏览/下载:4/0
  |  
提交时间:2019/11/26
Algorithm for solving
Clearance joints
Clearance link
Counter-force
Crank slider mechanisms
High-efficiency
Reaction forces
Simplified algorithms
A feasible direction algorithm for solving 3D sensor network localization
期刊论文
Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications, 2016, 卷号: 39, 期号: 2, 页码: 98-102
作者:
Chang, Xiao-Kai
;
Zhu, Wan-Jie
;
Li, De-Kui
收藏
  |  
浏览/下载:2/0
  |  
提交时间:2020/11/14
Computational efficiency
Nonlinear programming
Sensor nodes
3D sensor networks
Algorithm for solving
Change of variables
Feasible directions
Higher-dimensional
Interior point algorithm
Semi-definite programming
Sensor network localization
Adaptive galerkin method with relevant basis functions for pdes with boundary conditions
会议论文
作者:
Li, Bing
;
Han, Luofeng
;
Quan, Shuanglu
收藏
  |  
浏览/下载:3/0
  |  
提交时间:2019/12/02
Algorithm for solving
Basis functions
Construction method
Known conditions
Optimal basis
Optimality
A new algorithm for solving the best-fit sphere of optical aspherical surface (EI CONFERENCE)
会议论文
2nd International Conference on Advances in Materials and Manufacturing, ICAMMP 2011, December 16, 2011 - December 18, 2011, Guilin, China
Lin J.
;
Yang J.
;
Lu M.
收藏
  |  
浏览/下载:32/0
  |  
提交时间:2013/03/25
To solve the best-fit sphere (BFS) accurately is one of the technological keys for the generating and testing of optical aspherical surfaces. This paper presents a new algorithm for solving the BFS of aspherical surfaces to suppress some deficiencies in the existing BFS algorithms. In the proposed approach
it is not only suitable for the conic surface
a BFS is constructed
but also for higher order aspheres. The obtained asphericity and material removal function is more suitable for the machining and test. (2012) Trans Tech Publications
which passes through both sides of endpoints in the section o -?xy of the aspherical surfaces
Switzerland.
the center of the BFS is shifted along the x-axis
and its radius of curvature is automatically computed. The variable step size method is proposed to speed up the convergence of the iteration. Through numerically solving the BFS of conic and cubic surface
the advantages of the proposed approach are verified. The results show that the proposed approach is of rapid convergence
and high accuracy
Energy-saving scheduling strategy for elevator group control system based on ant colony optimization (EI CONFERENCE)
会议论文
2010 IEEE Youth Conference on Information, Computing and Telecommunications, YC-ICT 2010, November 28, 2010 - November 30, 2010, Beijing, China
Zhang J.-L.
;
Tang J.
;
Zong Q.
;
Li J.-F.
收藏
  |  
浏览/下载:17/0
  |  
提交时间:2013/03/25
Elevator group control scheduling is to dispatch every elevator to serve call requests from different floors based on some certain goal. It's a kind of typical combinatorial optimization problems. Ant colony algorithm is good at solving the discrete combinatorial optimization
its well global optimization ability and quick convergence velocity are both necessary to a scheduling algorithm. Moreover
reducing passengers' waiting and traveling time is the main focus of current dispatching algorithms
neglecting the energy consumed by the elevator system. So it's necessary to research on energy-saving algorithms. For the purpose of elevator group's energy-conservation run
the objective function of energy is built
ant colony model for elevator group control system is created
its optimization mechanism is figured out
and convergence of the algorithm is studied in this paper. Simulation results show the effectiveness of the strategy. 2010 IEEE.
Design and image restoration research of a cubic-phase-plate system (EI CONFERENCE)
会议论文
5th International Symposium on Advanced Optical Manufacturing and Testing Technologies: Advanced Optical Manufacturing Technologies, April 26, 2010 - April 29, 2010, Dalian, China
Zhang X.
;
Zhang X.
;
Shi G.
;
Zhang J.
;
He F.
收藏
  |  
浏览/下载:18/0
  |  
提交时间:2013/03/25
Wave-front coding technology is a novel jointly optical and digital imaging technology which can greatly extend the depth of focus of optical systems. The image restoration process is an important part of wave-front coding technology. Using wave-front coding makes the modulation transfer function(MTF) values of the optical systems change little over a range of several times the depth of focus
which means the system MTF is quite insensitive to defocus
and there is no zero in the passband. So we can design a single filter for the restoration of images in different defocus positions. However
it's hard to avoid noise during image acquisition and transmission processes. These noises will be amplified in the image restoration
especially in the high frequency part when the MTF drop is relatively low. The restoration process significantly reduces the system signal to noise ratio this way. Aimed at the problem of noise amplification
a new algorithm was proposed which incorporated wavelet denoising into the iterative steps of Lucy-Richardson algorithm. Better restoration results were obtained through the new algorithm
effectively solving the noise amplification problem of original LR algorithm. Two sets of identical triplet imaging systems were designed
in one of which the cubic-phase-plate was added. Imaging experiments of the manufactured systems were carried
and the images of a traditional system and a wave-front coded system before and after decoding were compared. The results show that the designed wave-front coded system can extend the depth of focus by 40 times compared with the traditional system while maintaining the light flux and the image plane resolution. 2010 Copyright SPIE - The International Society for Optical Engineering.
Ethnic group evolution algorithm
期刊论文
Ruan Jian Xue Bao/Journal of Software, 2010, 卷号: 21, 期号: 5, 页码: 978-990
作者:
Chen, Hao
;
Cui, Du-Wu
收藏
  |  
浏览/下载:2/0
  |  
提交时间:2019/12/18
Algorithm for solving
Co-evolution process
Dual track
Ethnic groups
Evolution algorithms
Evolutionary process
Numerical optimizations
Pre-mature convergences
An improved discrete particle swarm optimization algorithm for TSP (EI CONFERENCE)
会议论文
2007 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT Workshops 2007, November 2, 2007 - November 5, 2007, Silicon Valley, CA, United states
Zhang C.
;
Sun J.
;
Wang Y.
;
Yang Q.
收藏
  |  
浏览/下载:15/0
  |  
提交时间:2013/03/25
An Improved discrete particle swarm optimization (DPSO)-based algorithm for the traveling salesman problem (TSP) is proposed. In order to overcome the problem of premature convergence
a novel depressor is proposed and a diversity measure to control the swarm is also introduced which can be used to switch between the attractor and depressor. The proposed algorithm has been applied to a set of benchmark problems and compared with the existing algorithms for solving TSP using swarm intelligence. The results show that it can prevent premature convergence to a high degree
but still keeps a rapid convergence like the basic DPSO. 2007 IEEE.
©版权所有 ©2017 CSpace - Powered by
CSpace