全文获取类型
收费全文 | 75372篇 |
免费 | 10416篇 |
国内免费 | 6274篇 |
专业分类
电工技术 | 10836篇 |
技术理论 | 3篇 |
综合类 | 7970篇 |
化学工业 | 5266篇 |
金属工艺 | 2417篇 |
机械仪表 | 7536篇 |
建筑科学 | 4413篇 |
矿业工程 | 2603篇 |
能源动力 | 3439篇 |
轻工业 | 3843篇 |
水利工程 | 2045篇 |
石油天然气 | 2948篇 |
武器工业 | 1365篇 |
无线电 | 6809篇 |
一般工业技术 | 6939篇 |
冶金工业 | 2440篇 |
原子能技术 | 432篇 |
自动化技术 | 20758篇 |
出版年
2024年 | 660篇 |
2023年 | 1680篇 |
2022年 | 2845篇 |
2021年 | 3035篇 |
2020年 | 3408篇 |
2019年 | 2913篇 |
2018年 | 2609篇 |
2017年 | 3219篇 |
2016年 | 3544篇 |
2015年 | 3924篇 |
2014年 | 5629篇 |
2013年 | 5434篇 |
2012年 | 6156篇 |
2011年 | 6334篇 |
2010年 | 4402篇 |
2009年 | 4676篇 |
2008年 | 4203篇 |
2007年 | 4832篇 |
2006年 | 4053篇 |
2005年 | 3274篇 |
2004年 | 2717篇 |
2003年 | 2237篇 |
2002年 | 1841篇 |
2001年 | 1552篇 |
2000年 | 1343篇 |
1999年 | 920篇 |
1998年 | 829篇 |
1997年 | 703篇 |
1996年 | 567篇 |
1995年 | 499篇 |
1994年 | 420篇 |
1993年 | 290篇 |
1992年 | 264篇 |
1991年 | 189篇 |
1990年 | 184篇 |
1989年 | 141篇 |
1988年 | 114篇 |
1987年 | 66篇 |
1986年 | 44篇 |
1985年 | 33篇 |
1984年 | 35篇 |
1983年 | 38篇 |
1982年 | 24篇 |
1981年 | 17篇 |
1980年 | 18篇 |
1979年 | 19篇 |
1978年 | 10篇 |
1964年 | 11篇 |
1956年 | 9篇 |
1951年 | 12篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
101.
叙述了利用MS-EXCEL通用电子表格软件中的规划求解模块优化油品调合的方法,并以汽油调合为例,说明构造数学模型的方法,以及实施优化求解的具体过程。 相似文献
102.
卫星包装箱的随机隔振优化分析 总被引:1,自引:0,他引:1
用钢丝绳隔振器将卫星包装箱支承在运输车上,将卫星与车辆简化为二自由度体系,优化分析了在随机路面上行驶时使包装箱响应最小之隔振参数,对实测得到的钢丝绳减振器的非线性迟滞性能作了描述,提出了统计线性化分析的方法。 相似文献
103.
Motonobu Yoshikawa Hiroshi Nakajima Takeshi Inada Yasushi Harada Masahiko Amano Yuji Nakata 《Electrical Engineering in Japan》1995,115(7):29-39
A new practical method is proposed which gives a quasi-optimal solution of the dynamic load-dispatching problem formulated by a multiconstraint multiobjective optimization problem. Here, the multiple constraints are rate reserve constraints and power flow ones, and the multiple objectives are fuel cost and CO2 emission. The proposed method is an integration of the following three techniques: (1) “Group Dispatch Scheme,” which is developed by the authors, is used to satisfy a violated constraint easily. This scheme consists of three steps. The first step is to classify all generators into two groups. One is the group which should be more loaded to satisfy the violated constraint, and the other is the should-be less loaded group. The second step is to add some load to the former group, and to subtract the same load from the latter. The third step is to dispatch each group load to each groups generators, respectively; (2) the dynamic load-dispatching algorithm is used which provides, in practical time, quasi-optimal generation trajectories; (3) the conventional weighting parametric method is used to obtain a Pareto optimal solution of multiobjective problems. The effectiveness of the method is clarified by a computer simulation on the actual power system of Kansai Electric Power Company. 相似文献
104.
Intelligent scheduling with tabu search: An application to jobs with linear delay penalties and sequence-dependent setup costs and times 总被引:3,自引:0,他引:3
In this article we study thetabu search (TS) method in an application for solving an important class of scheduling problems. Tabu search is characterized by integrating artificial intelligence and optimization principles, with particular emphasis on exploiting flexible memory structures, to yield a highly effective solution procedure. We first discuss the problem of minimizing the sum of the setup costs and linear delay penalties when N jobs, arriving at time zero, are to be scheduled for sequential processing on a continuously available machine. A prototype TS method is developed for this problem using the common approach of exchanging the position of two jobs to transform one schedule into another. A more powerful method is then developed that employs insert moves in combination with swap moves to search the solution space. This method and the best parameters found for it during the preliminary experimentation with the prototype procedure are used to obtain solutions to a more complex problem that considers setup times in addition to setup costs. In this case, our procedure succeeded in finding optimal solutions to all problems for which these solutions are known and a better solution to a larger problem for which optimizing procedures exceeded a specified time limit (branch and bound) or reached a memory overflow (branch and bound/dynamic programming) before normal termination. These experiments confirm not only the effectiveness but also the robustness of the TS method, in terms of the solution quality obtained with a common set of parameter choices for two related but different problems. 相似文献
105.
A. I. Ivaneshkin 《Cybernetics and Systems Analysis》2007,43(4):542-548
A multiserver Poisson queuing system with losses, with a variable number of servers, and an additive quality functional is
investigated. All major characteristic of the system are obtained in an explicit form.
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 92–101, July–August 2007. 相似文献
106.
Gabriele Pannocchia Author Vitae Author Vitae Stephen J. Wright Author Vitae 《Automatica》2007,43(5):852-860
Partial enumeration (PE) is presented as a method for treating large, linear model predictive control applications that are out of reach with available MPC methods. PE uses both a table storage method and online optimization to achieve this goal. Versions of PE are shown to be closed-loop stable. PE is applied to an industrial example with more than 250 states, 32 inputs, and a 25-sample control horizon. The performance is less than 0.01% suboptimal, with average speedup factors in the range of 80-220, and worst-case speedups in the range of 4.9-39.2, compared to an existing MPC method. Small tables with only 25-200 entries were used to obtain this performance, while full enumeration is intractable for this example. 相似文献
107.
The concept of combinatorial objects is formalized. It allows strict definition of a combinatorial optimization problem (COP).
An efficient metaheuristic method to solve COPs (H-method) is considered. It includes stochastic local search algorithms as
a built-in procedure. A parallel implementation of the H-method is set forth and analyzed. The results from a numerical experiment
and solution of some well-known COPs on personal computers and on the SKIT cluster supercomputer are presented.
The study was supported by INTAS (Project 06-1000017-8909).
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 70–79, November–December 2007. 相似文献
108.
Alireza Karimi Author VitaeAuthor Vitae 《Automatica》2007,43(8):1395-1402
Robust control synthesis of linear time-invariant SISO polytopic systems is investigated using the polynomial approach. A convex set of all stabilizing controllers for a polytopic system is given over an infinite-dimensional space. A finite-dimensional approximation of this set is obtained using the orthonormal basis functions and represented by a set of LMIs thanks to the KYP lemma. Then, an LMI based convex optimization problem for robust pole placement with sensitivity function shaping in two- and infinity-norm is proposed. The simulation results show the effectiveness of the proposed method. 相似文献
109.
Robert Jenssen Author Vitae Deniz Erdogmus Author Vitae Author Vitae Jose C. Principe Author Vitae Author Vitae 《Pattern recognition》2007,40(3):796-806
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between probability density functions. We propose to optimize the Information Cut using a gradient descent-based approach. Our algorithm has several advantages compared to many other graph-based methods in terms of determining an appropriate affinity measure, computational complexity, memory requirements and coping with different data scales. We show that our method may produce clustering and image segmentation results comparable or better than the state-of-the art graph-based methods. 相似文献
110.
A. N. Golodnikov 《Cybernetics and Systems Analysis》2007,43(1):73-84
A fast exact algorithm of searching for the upper bound of Bayesian estimates for the parameter of the exponential distribution
under the condition that an a priori distribution belongs to the class of all distribution functions with two equal quantiles.
This problem arises in analyzing the sensitivity of Bayesian estimates to the choice of an a priori distribution in an exponential
failure model.
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 90–102, January–February 2007. 相似文献