全文获取类型
收费全文 | 3094篇 |
免费 | 355篇 |
国内免费 | 293篇 |
专业分类
电工技术 | 329篇 |
综合类 | 254篇 |
化学工业 | 100篇 |
金属工艺 | 40篇 |
机械仪表 | 199篇 |
建筑科学 | 82篇 |
矿业工程 | 19篇 |
能源动力 | 63篇 |
轻工业 | 9篇 |
水利工程 | 27篇 |
石油天然气 | 18篇 |
武器工业 | 21篇 |
无线电 | 178篇 |
一般工业技术 | 333篇 |
冶金工业 | 85篇 |
原子能技术 | 2篇 |
自动化技术 | 1983篇 |
出版年
2024年 | 32篇 |
2023年 | 86篇 |
2022年 | 74篇 |
2021年 | 97篇 |
2020年 | 129篇 |
2019年 | 118篇 |
2018年 | 94篇 |
2017年 | 117篇 |
2016年 | 141篇 |
2015年 | 132篇 |
2014年 | 195篇 |
2013年 | 249篇 |
2012年 | 188篇 |
2011年 | 200篇 |
2010年 | 163篇 |
2009年 | 181篇 |
2008年 | 193篇 |
2007年 | 171篇 |
2006年 | 186篇 |
2005年 | 164篇 |
2004年 | 129篇 |
2003年 | 129篇 |
2002年 | 117篇 |
2001年 | 80篇 |
2000年 | 62篇 |
1999年 | 53篇 |
1998年 | 49篇 |
1997年 | 40篇 |
1996年 | 20篇 |
1995年 | 34篇 |
1994年 | 18篇 |
1993年 | 16篇 |
1992年 | 12篇 |
1991年 | 16篇 |
1990年 | 12篇 |
1989年 | 10篇 |
1988年 | 6篇 |
1987年 | 1篇 |
1986年 | 3篇 |
1985年 | 5篇 |
1984年 | 8篇 |
1983年 | 2篇 |
1982年 | 3篇 |
1981年 | 1篇 |
1980年 | 3篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1966年 | 1篇 |
排序方式: 共有3742条查询结果,搜索用时 15 毫秒
81.
为了实现风力发电机风轮叶片外形的优化设计,以风场风速分布为基础提出了综合优化目标;以片条理论为基础提出了以展弦比为关键参数的修形约束条件的气动优化目标,建立了叶片外形优化设计的数学模型。采用枚举法和循环结构,选用Access数据库,应用Visual Basic编制程序实现叶片外形的优化设计。针对内蒙古某地区设计了1.5MW风力机叶片,与国外同功率某通用叶片进行了对比分析。结果表明,两种叶片外形基本吻合,而且文中设计的叶片在性能上有明显优势,同时也验证了文中提出数学模型的可靠性和程序的实用性。 相似文献
82.
介绍了粒子群优化(PSO)算法的一种改进算法:用于约束优化问题的启发式粒子群优化(HPSO)算法。针对HP-SO算法在桁架结构优化中速度较慢的问题,将HPSO算法的约束处理策略与另一种适用于粒子群算法的约束处理方法结合,并将改进后的算法应用到1个桁架结构截面优化设计算例中,同时与HPSO算法进行对比分析。对于此算例,改进算法和HPSO算法都运行了多次,从多次运行的统计分析中可以看出,改进算法的优化效果和稳定性好于HPSO算法,且结构分析的次数减少了一半左右,从而整个程序运行的速度比HPSO算法提高了将近一倍。 相似文献
83.
Max-SAT-CC is the following optimization problem: Given a formula in CNF and a bound k, find an assignment with at most k variables being set to true that maximizes the number of satisfied clauses among all such assignments. If each clause is restricted to have at most ? literals, we obtain the problem Max-?SAT-CC. Sviridenko [Algorithmica 30 (3) (2001) 398-405] designed a (1−e−1)-approximation algorithm for Max-SAT-CC. This result is tight unless P=NP [U. Feige, J. ACM 45 (4) (1998) 634-652]. Sviridenko asked if it is possible to achieve a better approximation ratio in the case of Max-?SAT-CC. We answer this question in the affirmative by presenting a randomized approximation algorithm whose approximation ratio is . To do this, we develop a general technique for adding a cardinality constraint to certain integer programs. Our algorithm can be derandomized using pairwise independent random variables with small probability space. 相似文献
84.
In this paper, a new adaptive neuro controller for trajectory tracking is developed for robot manipulators without velocity measurements, taking into account the actuator constraints. The controller is based on structural knowledge of the dynamics of the robot and measurements of joint positions only. The system uncertainty, which may include payload variation, unknown nonlinearities and torque disturbances is estimated by a Chebyshev neural network (CNN). The adaptive controller represents an amalgamation of a filtering technique to generate pseudo filtered tracking error signals (for the elimination of velocity measurements) and the theory of function approximation using CNN. The proposed controller ensures the local asymptotic stability and the convergence of the position error to zero. The proposed controller is robust not only to structured uncertainty such as payload variation but also to unstructured one such as disturbances. Moreover the computational complexity of the proposed controller is reduced as compared to the multilayered neural network controller. The validity of the control scheme is shown by simulation results of a two-link robot manipulator. Simulation results are also provided to compare the proposed controller with a controller where velocity is estimated by finite difference methods using position measurements only. 相似文献
85.
How to compose existing web services automatically and to guarantee the correctness of the design(e.g. freeness of deadlock and unspecified reception,and temporal constraints) is an important and challenging problem in web services. Most existing approaches require a detailed specification of the desired behaviors of a composite service beforehand and then perform certain formal verification to guarantee the correctness of the design,which makes the composition process both complex and time-consuming. In th... 相似文献
86.
87.
In map generalization various operators are applied to the features of a map in order to maintain and improve the legibility
of the map after the scale has been changed. These operators must be applied in the proper sequence and the quality of the
results must be continuously evaluated. Cartographic constraints can be used to define the conditions that have to be met
in order to make a map legible and compliant to the user needs. The combinatorial optimization approaches shown in this paper
use cartographic constraints to control and restrict the selection and application of a variety of different independent generalization
operators into an optimal sequence. Different optimization techniques including hill climbing, simulated annealing and genetic
deep search are presented and evaluated experimentally by the example of the generalization of buildings in blocks. All algorithms
used in this paper have been implemented in a web services framework. This allows the use of distributed and parallel processing
in order to speed up the search for optimized generalization operator sequences.
相似文献
Moritz NeunEmail: |
88.
A classification of methods for distributed system optimization based on formulation structure 总被引:2,自引:1,他引:1
S. Tosserams L. F. P. Etman J. E. Rooda 《Structural and Multidisciplinary Optimization》2009,39(5):503-517
Augmented Lagrangian coordination (ALC) is a provably convergent coordination method for multidisciplinary design optimization
(MDO) that is able to treat both linking variables and linking functions (i.e. system-wide objectives and constraints). Contrary
to quasi-separable problems with only linking variables, the presence of linking functions may hinder the parallel solution
of subproblems and the use of the efficient alternating directions method of multipliers. We show that this unfortunate situation
is not the case for MDO problems with block-separable linking constraints. We derive a centralized formulation of ALC for
block-separable constraints, which does allow parallel solution of subproblems. Similarly, we derive a distributed coordination
variant for which subproblems cannot be solved in parallel, but that still enables the use of the alternating direction method
of multipliers. The approach can also be used for other existing MDO coordination strategies such that they can include block-separable
linking constraints.
This work is funded by MicroNed, grant number 10005898. 相似文献
89.
In this paper, we present an analysis and synthesis approach for guaranteeing that the phase of a single-input, single-output closed-loop transfer function is contained in the interval [−α,α] for a given α>0 at all frequencies. Specifically, we first derive a sufficient condition involving a frequency domain inequality for guaranteeing a given phase constraint. Next, we use the Kalman–Yakubovich–Popov theorem to derive an equivalent time domain condition. In the case where , we show that frequency and time domain sufficient conditions specialize to the positivity theorem. Furthermore, using linear matrix inequalities, we develop a controller synthesis approach for guaranteeing a phase constraint on the closed-loop transfer function. Finally, we extend this synthesis approach to address mixed gain and phase constraints on the closed-loop transfer function. 相似文献
90.
D. Limon Author Vitae I. Alvarado Author VitaeAuthor Vitae E.F. Camacho Author Vitae 《Automatica》2008,44(9):2382-2387
In this paper, a novel model predictive control (MPC) for constrained (non-square) linear systems to track piecewise constant references is presented. This controller ensures constraint satisfaction and asymptotic evolution of the system to any target which is an admissible steady-state. Therefore, any sequence of piecewise admissible setpoints can be tracked without error. If the target steady state is not admissible, the controller steers the system to the closest admissible steady state.These objectives are achieved by: (i) adding an artificial steady state and input as decision variables, (ii) using a modified cost function to penalize the distance from the artificial to the target steady state (iii) considering an extended terminal constraint based on the notion of invariant set for tracking. The control law is derived from the solution of a single quadratic programming problem which is feasible for any target. Furthermore, the proposed controller provides a larger domain of attraction (for a given control horizon) than the standard MPC and can be explicitly computed by means of multiparametric programming tools. On the other hand, the extra degrees of freedom added to the MPC may cause a loss of optimality that can be arbitrarily reduced by an appropriate weighting of the offset cost term. 相似文献