全文获取类型
收费全文 | 3850篇 |
免费 | 555篇 |
国内免费 | 433篇 |
学科分类
工业技术 | 4838篇 |
出版年
2024年 | 43篇 |
2023年 | 116篇 |
2022年 | 108篇 |
2021年 | 153篇 |
2020年 | 177篇 |
2019年 | 171篇 |
2018年 | 153篇 |
2017年 | 197篇 |
2016年 | 204篇 |
2015年 | 196篇 |
2014年 | 257篇 |
2013年 | 327篇 |
2012年 | 245篇 |
2011年 | 253篇 |
2010年 | 203篇 |
2009年 | 214篇 |
2008年 | 229篇 |
2007年 | 215篇 |
2006年 | 209篇 |
2005年 | 187篇 |
2004年 | 155篇 |
2003年 | 146篇 |
2002年 | 132篇 |
2001年 | 96篇 |
2000年 | 77篇 |
1999年 | 62篇 |
1998年 | 54篇 |
1997年 | 48篇 |
1996年 | 23篇 |
1995年 | 39篇 |
1994年 | 22篇 |
1993年 | 18篇 |
1992年 | 14篇 |
1991年 | 18篇 |
1990年 | 16篇 |
1989年 | 11篇 |
1988年 | 6篇 |
1987年 | 3篇 |
1986年 | 5篇 |
1985年 | 5篇 |
1984年 | 8篇 |
1983年 | 2篇 |
1982年 | 4篇 |
1980年 | 4篇 |
1978年 | 2篇 |
1973年 | 1篇 |
1966年 | 1篇 |
1963年 | 2篇 |
1962年 | 2篇 |
1961年 | 2篇 |
排序方式: 共有4838条查询结果,搜索用时 15 毫秒
1.
讨论了输出终端带不等式约束情形的多输入多输出系统,说明了这些约束可以通过修改输入柔化系数而使其得以满足,在柔化系数的选择范围确定过程中,为了避免矩阵求逆,采用利用已知数据辨识参数的方法来确定柔化系数,从而使得问题简化。降低了计算量且加快了收敛速度。 相似文献
2.
Non-pinched, minimum energy solutions are important class of distillation designs that offer the potential advantage of a better trade-off between capital investment and operating costs. In this paper, two important tasks associated with non-pinched distillation designs are studied. Thus the novel contributions of this work to the literature are
- (1) A comprehensive methodology for finding non-pinched minimum energy designs.
- (2) Understanding of the reasons for the existence of non-pinched distillation designs.
3.
4.
试论就业形势与战略 总被引:5,自引:1,他引:4
刘庆唐 《重庆理工大学学报(自然科学版)》2005,19(1):7-10
论述了就业的特殊重要性、目前我国就业形势的极端严重性,以及所应当采取的战略和措施。 相似文献
5.
Key areas of robot agility include methods that increase capability and flexibility of industrial robots and facilitate robot re-tasking. Manual guidance can achieve robot agility effectively, provided that a safe and smooth interaction is guaranteed when the user exerts an external force on the end effector. We approach this by designing an adaptive admittance law that can adjust its parameters to modify the robot compliance in critical areas of the workspace, such as near and on configuration singularities, joint limits, and workspace limits, for a smooth and safe operation. Experimental validation was done with two tests: a constraint activation test and a 3D shape tracing task. In the first one, we validate the proper response to constraints and in the second one, we compare the proposed approach with different admittance parameter tuning strategies using a drawing task where the user is asked to guide the robot to trace a 3D profile with an accuracy or speed directive and evaluate performance considering path length error and execution time as metrics, and a questionnaire for user perception. Results show that appropriate response to individual and simultaneous activation of the aforementioned constraints for a safe and intuitive manual guidance interaction is achieved and that the proposed parameter tuning strategy has better performance in terms of accuracy, execution time, and subjective evaluation of users. 相似文献
6.
This paper proposes a new method for calculating a bound on the gain of a system comprising a linear time invariant part and a static nonlinear part, which is odd, bounded, zero at zero and has a restriction on its slope. The nonlinear part is also assumed to be sector bounded, with the sector bound being (possibly) different from that implied by the slope restriction. The computation of the gain bound is found by solving a set of linear matrix inequalities, which arise from an integral quadratic constraint formulation of a multiplier problem involving both Zames‐Falb and Popov multipliers. Examples illustrate the effectiveness of the results, and comparisons are made against the state‐of‐the‐art. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
7.
Xiuming Huang 《Machine Translation》1988,3(2):101-120
This paper concerns the resolution of lexical ambiguity in a machine translation environment. We describe the integration of principles of selection restrictions. Preference Semantics, and intelligent relaxation of constraints in handling lexical ambiguity. The approach differs from many previous MT systems in that it is more powerful than brute force systems, while more realistic than systems that assume a large degree of coded encyclopedia information for full understanding. 相似文献
8.
Cable-direct-driven-robots (CDDRs) provided with a passive serial support represent an interesting and rising evolution of planar cable robots. The paper is devoted to present and analyze a novel CDDR robot. The robot consists in a fully actuated CDDR supported against loading normal to the motion plane with a 3-link passive planar serial manipulator. This hybrid structure combines positive features of both parallel and serial architectures, and prevents out-of-plane movements without the necessity for the robot to be supported on the motion plane. The adoption of a 3-link serial manipulator ensures a greater workspace area compared with similar structures that adopt a smaller number of links, and improves specific characteristics of their dynamics. Nevertheless undesired oscillations may occur since the serial manipulator is underconstrained. For this reason damping elements are inserted in the structure. Simulation examples are presented to demonstrate the novel CDDR concept and its dynamics. In addition, a strategy to select proper values of damping coefficients is presented. 相似文献
9.
This paper is the first one of the two papers entitled “modeling and solving mixed-model assembly line balancing problem with setups”, which has the aim of developing the mathematical programming formulation of the problem and solving it with a hybrid meta-heuristic approach. In this current part, a mixed-integer linear mathematical programming (MILP) model for mixed-model assembly line balancing problem with setups is developed. The proposed MILP model considers some particular features of the real world problems such as parallel workstations, zoning constraints, and sequence dependent setup times between tasks, which is an actual framework in assembly line balancing problems. The main endeavor of Part-I is to formulate the sequence dependent setup times between tasks in type-I mixed-model assembly line balancing problem. The proposed model considers the setups between the tasks of the same model and the setups because of the model switches in any workstation. The capability of our MILP is tested through a set of computational experiments. Part-II tackles the problem with a multiple colony hybrid bees algorithm. A set of computational experiments is also carried out for the proposed approach in Part-II. 相似文献
10.