焦永昌
个性化签名
- 姓名:焦永昌
- 目前身份:
- 担任导师情况:
- 学位:
-
学术头衔:
博士生导师, 国家杰出青年科学基金获得者
- 职称:-
-
学科领域:
微波技术
- 研究兴趣:
焦永昌,汉族,1964年生于山西,1990年在西安电子科技大学取得博士学位并留校任教,1996年被评为西安电子科技大学教授;1999年和2003年分别被遴选为西安电子科技大学电磁场与微波技术专业和智能信息处理专业博士生导师,目前指导多名硕士和博士研究生。科研方面,负责或参加了包括国家自然科学基金、教育部优秀青年教师资助计划项目、国防预研项目在内的十余个科研项目,获国家科技进步三等奖1项,原电子工业部科技进步二等奖2项,陕西省科技进步三等奖1项;在IEEE Trans. Antennas and Propagation,IEEE Trans. Microwave Theory and Techniques,Computational Optimization and Applications,Computers and Mathematics with Applications,电子学报等国内外刊物及国际会议上发表学术论文100余篇,其中40余篇被SCI检索,80余篇被EI检索,所发表的论文被SCI源期刊论文他引了50余次。
1996年被评为原电子工业部优秀科技青年;2000年获第三届陕西青年科技奖;2001年被授予陕西省优秀留学回国人员称号;2001年获得教育部优秀青年教师资助计划项目;2000年~2005年和2006年~2008年后分别被聘为西安电子科技大学学科带头人和校内特聘教授;2006年享受政府特殊津贴。1994年至今任中国电子学会高级会员、青年工作委员会委员;2004年至今任中国电子学会天线分委员会委员;1998年~2002年任陕西省第九届人大代表;2003年~2007年和2008年至今分别任陕西省第十届和第十一届人大代表、常委会委员、教科文卫委员会委员。
-
主页访问
5999
-
关注数
0
-
成果阅读
789
-
成果数
20
【期刊论文】CPW-fed broadband circularly polarised square slot antenna
焦永昌, Y.B. Chen, X.F. Liu, Y.C. Jiao, F.S. Zhang
ELECTRONICS LETTERS 14th September 2006, Vol. 42, No. 19,-0001,():
-1年11月30日
A novel CPW-fed broadband circularly polarised square slot antenna is proposed and fabricated. The proposed antenna is fed by a CPW with a widened L-type strip along the diagonal line of the square slot. Measured results show that the 3 dB axial-ratio bandwidth of the proposed antenna can reach 17%. The proposed antenna has simple coplanar geometry which can be easily fabricated on inexpensive substrate.
-
46浏览
-
0点赞
-
0收藏
-
0分享
-
205下载
-
0评论
-
引用
【期刊论文】Dual-band CPW-fed folded-slot monopole antenna for RFID application
焦永昌, M.-T. Zhang, Y.-C. Jiao and F.-S. Zhang
ELECTRONICS LETTERS 12th October 2006, Vol. 42, No. 21,-0001,():
-1年11月30日
A folded slot with open end is introduced to achieve a dual-band coplanar waveguide (CPW)-fed monopole antenna for radio frequency identification (RFID) applications. The designed antenna, which, including the substrate, is only 32 mm in height and 20 mm in width, can operate simultaneously at the 2.45 and 5.8 GHz bands with -1.8 and 2.3 dBi gains, respectively. Its properties make the antenna suitable for RFID tags.
-
24浏览
-
0点赞
-
0收藏
-
0分享
-
262下载
-
0评论
-
引用
【期刊论文】A NOVEL SMALL CPW-FED T-SHAPED ANTENNA FOR MIMO SYSTEM APPLICATIONS
焦永昌, Y. B. Chen, Y. C. Jiao, F. S. Zhang, H. W. Gao
J. of Electromagn. Waves and Appl., Vol. 20, No. 14, 2027-2036, 2006,-0001,():
-1年11月30日
A novel small CPW-fed T-shaped antenna for MIMO application is presented. The size of the antenna is only 35% of that of conventional CPW-fed T-shaped antenna, which has satisfied return loss bandwidth and omnidirectional radiation characteristics. A multifeed 8-element planar array is fabricated and measured. It shows that the features of small size, uniplanar structure, good radiation characteristics and small mutual coupling are promising for MIMO applications in compact portable devices.
-
26浏览
-
0点赞
-
0收藏
-
0分享
-
187下载
-
0评论
-
引用
焦永昌, Hong Li, , Yong-Chang Jiao, Yuping Wang
Y. Hao et al. (Eds.): CIS 2005, Part I, LNAI 3801, pp. 247-254, 2005.,-0001,():
-1年11月30日
In this paper, a hybrid genetic algorithm for solving constrained optimization problems is addressed. First, a real-coded genetic algorithm is presented. The simplified quadratic interpolation method is then integrated into the genetic algorithm to improve its local search ability and the accuracy of the minimum function value. Simulation results on 13 benchmark problems show that the proposed hybrid algorithm is able to avoid the premature convergence and find much better solutions with high speed compared to other existing algorithms.
-
23浏览
-
0点赞
-
0收藏
-
0分享
-
133下载
-
0评论
-
引用
【期刊论文】Synthesis of the Antenna Array Using a Modified Particle Swarm Optimization Algorithm
焦永昌, Tengbo Chen, Yong-Chang Jiao, Fushun Zhang
Y. Hao et al. (Eds.): CIS 2005, Part I, LNAI 3801, pp. 651-656, 2005,-0001,():
-1年11月30日
The particle swarm optimization algorithm presents a new way for finding an optimal solution of complex optimization problems, where each particle represents a solution to the problem. In this paper a modified particle swarm optimization algorithm is applied to the optimization of the antenna array. Adding an item of integral control and the contractive factor in the modified algorithm can improve its global search ability. Simulation results show that the optimal pattern of the antenna array is able to approach the desired pattern. The results also demonstrate that the modified algorithm is superior to the original algorithm and the nonlinear least-square method.
-
33浏览
-
0点赞
-
0收藏
-
0分享
-
239下载
-
0评论
-
引用
【期刊论文】An Aftertreatment Technique for Improving the Accuracy of Adornian’s Decomposition Method
焦永昌, Y. C. JIAO, Y. YAMAMOTO, C. DANG, Y. HAO
Computers and Mathematics with Applications 43 (2002) 783-798,-0001,():
-1年11月30日
Adomian’s decomposition method (ADM) is a nonnumerical method which can be adapted for solving nonlinear ordinary differential equations. In this paper, the principle of the decomposition method is described, and its advantages as well as drawbacks are discussed. Then an aftertreatment technique (AT) is proposed, which yields the analytic approximate solution with fast convergence rate and high accurscy through the application of Padé approximation to the series solution derived from ADM. Some concrete examples are also studied to show with numerical results how the AT works efficiently.
Adomian’s decomposition method, Aftertreatment technique, Ordinary differential equations, Padé approximant, Mathematics
-
23浏览
-
0点赞
-
0收藏
-
0分享
-
107下载
-
0评论
-
引用
【期刊论文】The Solution of the One-Dimensional Nonlinear Poisson’s Equations by the Decomposition Method
焦永昌, Yong-Chang, JIAO, Chuang-yin Dang, Yue Hao
,-0001,():
-1年11月30日
The decomposition method is a nonnumerical method of solving strongly nonlinear differential equations. In this paper, the method is adapted for the solution of the one-dimensional nonlinear Poisson’s equations governing the linearly graded p-n junctions in semiconductor devices, and the error analysis for the approximate analytic solutions obtained by the decomposition method is carried out. The simulation results show that the solutions obtained by the method are accurate and reliable, and that the quantitative analysis of the linearly graded p-n junctions can be conducted. This work indicates that the decomposition method has some advantages, which opens up a new way for the numerical analysis of semiconductor devices.
Decomposition method, One-dimensional nonlinear Poisson’s equation, Approximate analytic solutions, Linearly graded p-n junctions
-
34浏览
-
0点赞
-
0收藏
-
0分享
-
66下载
-
0评论
-
引用
【期刊论文】Variable Programming: A Generalized Minimax Problem. Part I: Models and Theory
焦永昌, YONG-CHANG JIAO, YEE LEUNG, ZONGBEN XU, JIANG-SHE ZHANG
Computational Optimization and Applications, 30, 229-261, 2005,-0001,():
-1年11月30日
In this two-part series of papers, a new generalized minimax optimization model, termed variable programming (VP), is developed to solve dynamically a class of multi-objective optimization problems with non-decomposable structure. It is demonstrated that such type of problems is more general than existing optimization models. In this part, the VP model is proposed first, and the relationship between variable programming and the general constrained nonlinear programming is established. To illustrate its practicality, problems on investment and the low-side-lobe conformal antenna array pattern synthesis to which VP can be appropriately applied are discussed for substantiation. Then, theoretical underpinnings of the VP problems are established. Difficulties in dealing with the VP problems are discussed. With some mild assumptions, the necessary conditions for the unconstrained VP problems with arbitrary and specific activated feasible sets are derived respectively. The necessary conditions for the corresponding constrained VP problems with the mild hypotheses are also examined. Whilst discussion in this part is concentrated on the formulation of the VP model and its theoretical underpinnings, construction of solution algorithms is discussed in Part II.
variable programming, minimax, multiobjective optimization, nonlinear programming, necessary condition
-
34浏览
-
0点赞
-
0收藏
-
0分享
-
74下载
-
0评论
-
引用
【期刊论文】Variable Programming: A Generalized Minimax Problem. Part II: Algorithms
焦永昌, YONG-CHANG JIAO, YEE LEUNG, ZONGBEN XU, JIANG-SHE ZHANG
Computational Optimization and Applications, 30, 263-295, 2005,-0001,():
-1年11月30日
In this part of the two-part series of papers, algorithms for solving some variable programming (VP) problems proposed in Part I are investigated. It is demonstrated that the non-differentiability and the discontinuity of the maximum objective function, as well as the summation objective function in the VP problems constitute difficulty in finding their solutions. Based on the principle of statistical mechanics, we derive smooth functions to approximate these non-smooth objective functions with specific activated feasible sets. By transforming the minimax problem and the corresponding variable programming problems into their smooth versions we can solve the resulting problems by some efficient algorithms for smooth functions. Relevant theoretical underpinnings about the smoothing techniques are established. The algorithms, in which the minimization of the smooth functions is carried out by the standard quasi-Newton method with BFGS formula, are tested on some standard minimax and variable programming problems. The numerical results show that the smoothing techniques yield accurate optimal solutions and that the algorithms proposed are feasible and efficient.
variable programming, minimax, statistical mechanics principle, smooth optimization
-
42浏览
-
0点赞
-
0收藏
-
0分享
-
49下载
-
0评论
-
引用
【期刊论文】A New Low-Side-Lobe Pattern Synthesis Technique for Conformal Arrays
焦永昌, Yong-Chang Jiao, Wen-Yuan WEI, Li-Wei, Huang, Hong-Shi Wu
IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, VOL. 41, NO. 6, JUNE 1993,-0001,():
-1年11月30日
The application of the new nonlinear optimization algorithms to arrays design is demonstrated by the low-side-lobe pattern synthesis of conformal arrays. By adopting the information of array element realized gain patterns (RGP’s), we formulate synthesis problems as nonlinearly constrained optimization problems, and propose a new direct method to solve them. The technique allows one to find a new direct method to solve them. The technique allows one to find a set of array coefficients that yield a pattern meeting a specified side-lobe level and achieving the maximum directivity, if such a set of array coefficients exists. If the side-lobe specifications cannot be met with the given array, the technique will result in a set of coefficients that yield a pattern meeting the best attainable side-lobe level and having directivity as high as possible. Also, simplified synthesis problems for an axial dipole array in an infinite, perfectly conducting cylinder are discussed, and numerical synthesis results are given. Our synthesis technique works for general array patterns.
-
25浏览
-
0点赞
-
0收藏
-
0分享
-
72下载
-
0评论
-
引用