全文获取类型
收费全文 | 2511篇 |
免费 | 265篇 |
国内免费 | 196篇 |
专业分类
电工技术 | 417篇 |
综合类 | 241篇 |
化学工业 | 233篇 |
金属工艺 | 44篇 |
机械仪表 | 140篇 |
建筑科学 | 75篇 |
矿业工程 | 116篇 |
能源动力 | 57篇 |
轻工业 | 156篇 |
水利工程 | 90篇 |
石油天然气 | 116篇 |
武器工业 | 20篇 |
无线电 | 354篇 |
一般工业技术 | 161篇 |
冶金工业 | 95篇 |
原子能技术 | 19篇 |
自动化技术 | 638篇 |
出版年
2024年 | 10篇 |
2023年 | 32篇 |
2022年 | 47篇 |
2021年 | 74篇 |
2020年 | 69篇 |
2019年 | 76篇 |
2018年 | 55篇 |
2017年 | 94篇 |
2016年 | 89篇 |
2015年 | 108篇 |
2014年 | 139篇 |
2013年 | 146篇 |
2012年 | 198篇 |
2011年 | 188篇 |
2010年 | 151篇 |
2009年 | 159篇 |
2008年 | 141篇 |
2007年 | 171篇 |
2006年 | 166篇 |
2005年 | 131篇 |
2004年 | 113篇 |
2003年 | 89篇 |
2002年 | 76篇 |
2001年 | 75篇 |
2000年 | 53篇 |
1999年 | 51篇 |
1998年 | 34篇 |
1997年 | 43篇 |
1996年 | 28篇 |
1995年 | 24篇 |
1994年 | 20篇 |
1993年 | 19篇 |
1992年 | 17篇 |
1991年 | 9篇 |
1990年 | 15篇 |
1989年 | 8篇 |
1988年 | 10篇 |
1987年 | 7篇 |
1986年 | 3篇 |
1985年 | 5篇 |
1984年 | 5篇 |
1983年 | 8篇 |
1981年 | 2篇 |
1965年 | 1篇 |
1962年 | 1篇 |
1961年 | 2篇 |
1960年 | 1篇 |
1959年 | 1篇 |
1958年 | 1篇 |
1956年 | 1篇 |
排序方式: 共有2972条查询结果,搜索用时 15 毫秒
1.
Harmonic elimination pulse width modulation (HEPWM) method has been widely applied to multilevel voltage source inverter (MVSI) to remove low frequency harmonics from its output voltage. However, the computation of the HEPWM switching angles for MVSI is very challenging due to several constraints, namely angle sequencing, very tight angular spacing and the numerous possibilities of angles distribution ratio. Realizing the potential of Differential Evolution (DE) to handle complex problems, this work proposes its application to solve the HEPWM problem for cascaded MVSI. Its emphasis is on improving the availability of HEPWM for higher output voltage by extending the maximum range of modulation index (M). It also removes the discontinuities in the switching angles and reduces the number of distribution ratio required to obtain the required solution. Compared to the most advanced (similar) work, i.e., 7-level MVSI with seventeen switching angles, DE covers a wider range of M; the maximum achievable M is 2.80. Furthermore, it exhibits very low second order distortion factor (DF2): for the worst case, the value of DF2 is 0.0014%. To verify the viability of the proposed algorithm, simulation is carried out and hardware prototype is constructed. Both results show very good agreement with the theoretical prediction. 相似文献
2.
We present a new algorithm,
called MCS-M,
for computing minimal triangulations of graphs.
Lex-BFS, a seminal algorithm for recognizing chordal graphs,
was the genesis for two other classical algorithms:
LEX M and MCS.
LEX M extends the fundamental concept used in Lex-BFS,
resulting in an algorithm that not only recognizes chordality,
but also computes a minimal triangulation of an arbitrary graph.
MCS simplifies the fundamental concept used in Lex-BFS,
resulting in a simpler algorithm for recognizing chordal graphs.
The new algorithm MCS-M combines
the extension of LEX M with the simplification of MCS,
achieving all the results of LEX M in the same time complexity. 相似文献
3.
4.
We present a method based on extended linear real quantifier elimination for multiple object semilinear motion planning, i.e. finding collision-free trajectories for several robots in a time dependent environment. For practical applicability the method is limited to polygonal objects and linear trajectories. It can, however, deal with situations involving even non-convex objects. 相似文献
5.
本文提出了求解非线性问题的一种新方法——逐次迭代法,本方法先是给出一个初始近似解,然后将这个近似解进行校正迭代,使之接近于真实解,把一个非线性问题转化为一个线性问题来解决。 相似文献
6.
Single-assignment and functional languages have value semantics that do not permit side-effects. This lack of side-effects makes automatic detection of parallelism and optimization for data locality in programs much easier. However, the same property poses a challenge in implementing these languages efficiently. This paper describes an optimizing compiler system that solves the key problem of aggregate copy elimination. The methods developed rely exclusively on compile-time algorithms, including interprocedural analysis, that are applied to an intermediate data flow representation. By dividing the problem into update-in-place and build-in-place analysis, a small set of relatively simple techniques—edge substitution, graph pattern matching, substructure sharing and substructure targeting—was found to be very powerful. If combined properly and implemented carefully, the algorithms eliminate unnecessary copy operations to a very high degree. No run-time overhead is imposed on the compiled programs. 相似文献
7.
This paper presents an efficient method which provides the optimal generation mix and the optimal generation construction process. The approximation method in which the dynamic programming technique and gradient method are combined is applied to determine the optimal generation mix with hydropower generation technologies. The successive approximations dynamic programming (SADP) technique, which is very suitable for high-dimensional multistage decision process problems, is used for obtaining the optimal generation construction process. The effectiveness and feasibility of the developed technique are demonstrated on a practical power system model which has five types of generation technologies including a hydropower generation technology. 相似文献
8.
基于MATLAB仿真的无功补偿电容器投切控制研究 总被引:2,自引:0,他引:2
对目前常用的无功补偿电容器投切控制方案所存在的不足进行了详细的分析,给出了补偿电容器投切的优化控制方案,并在MATLAB电力仿真环境下进行了仿真试验。结果表明,所提出的优化方案达到较理想的效果。 相似文献
9.
10.
Obtaining shorter regular expressions from finite-state automata 总被引:1,自引:0,他引:1
We consider the use of state elimination to construct shorter regular expressions from finite-state automata (FAs). Although state elimination is an intuitive method for computing regular expressions from FAs, the resulting regular expressions are often very long and complicated. We examine the minimization of FAs to obtain shorter expressions first. Then, we introduce vertical chopping based on bridge states and horizontal chopping based on the structural properties of given FAs. We prove that we should not eliminate bridge states until we eliminate all non-bridge states to obtain shorter regular expressions. In addition, we suggest heuristics for state elimination that leads to shorter regular expressions based on vertical chopping and horizontal chopping. 相似文献