全文获取类型
收费全文 | 17338篇 |
免费 | 1401篇 |
国内免费 | 1083篇 |
专业分类
电工技术 | 1590篇 |
综合类 | 2134篇 |
化学工业 | 711篇 |
金属工艺 | 459篇 |
机械仪表 | 1196篇 |
建筑科学 | 480篇 |
矿业工程 | 278篇 |
能源动力 | 439篇 |
轻工业 | 161篇 |
水利工程 | 378篇 |
石油天然气 | 204篇 |
武器工业 | 134篇 |
无线电 | 1144篇 |
一般工业技术 | 1418篇 |
冶金工业 | 242篇 |
原子能技术 | 48篇 |
自动化技术 | 8806篇 |
出版年
2024年 | 52篇 |
2023年 | 149篇 |
2022年 | 237篇 |
2021年 | 287篇 |
2020年 | 378篇 |
2019年 | 428篇 |
2018年 | 346篇 |
2017年 | 512篇 |
2016年 | 547篇 |
2015年 | 625篇 |
2014年 | 924篇 |
2013年 | 1326篇 |
2012年 | 1000篇 |
2011年 | 1097篇 |
2010年 | 853篇 |
2009年 | 977篇 |
2008年 | 1051篇 |
2007年 | 1128篇 |
2006年 | 1004篇 |
2005年 | 861篇 |
2004年 | 741篇 |
2003年 | 671篇 |
2002年 | 610篇 |
2001年 | 513篇 |
2000年 | 453篇 |
1999年 | 405篇 |
1998年 | 325篇 |
1997年 | 338篇 |
1996年 | 286篇 |
1995年 | 247篇 |
1994年 | 252篇 |
1993年 | 185篇 |
1992年 | 174篇 |
1991年 | 141篇 |
1990年 | 106篇 |
1989年 | 98篇 |
1988年 | 89篇 |
1987年 | 52篇 |
1986年 | 52篇 |
1985年 | 36篇 |
1984年 | 51篇 |
1983年 | 30篇 |
1982年 | 36篇 |
1981年 | 23篇 |
1980年 | 23篇 |
1979年 | 29篇 |
1978年 | 11篇 |
1977年 | 21篇 |
1976年 | 14篇 |
1975年 | 12篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
51.
The paper proposes and describes several tools enabling their user to estimate the efficiency of Pascal or C-like programs. The approach consists of generating symbolic formulas expressing the efficiency of the programs being analyzed. The formulas are applicable to a variety of compiler-machine configurations. The actual numeric values of the variables in the symbolic formula are determined using linear programming techniques. The proposed approach reduces considerably the amount of benchmarking needed to analyze programs. Several examples are presented showing the applicability of the tools. The effort necessary to implement them is considerably reduced by the combined usage of Prolog and a symbolic formula manipulation package (Maple). 相似文献
52.
M. Stolpe K. Svanberg 《International journal for numerical methods in engineering》2003,57(5):723-739
This paper deals with topology optimization of discretized continuum structures. It is shown that a large class of non‐linear 0–1 topology optimization problems, including stress‐ and displacement‐constrained minimum weight problems, can equivalently be modelled as linear mixed 0–1 programs. The modelling approach is applied to some test problems which are solved to global optimality. Copyright © 2003 John Wiley & Sons, Ltd. 相似文献
53.
本文对多目标二次规划问题非劣解集的理论生成进行了探讨,在介绍二次规划单目标问题优化解求法的基础上,提出了在决策平面上互切点,共交点轨迹的概念.由此导出了非劣解集的一般解析式(对切点解问题)和另一类交点解问题时的非劣解集求法,然后介绍了在目标平面非劣解集的解析表达式.使多目标二次规划问题整个非劣解集的推求严格、明确和方便,有理论和实际意义。文中以一个综合利用水库参数的多目标优选作为例子阐述了应用,并求出了最终的最佳协调解. 相似文献
54.
Scheduling emergency medicine residents (EMRs) is a complex task, which considers a large number of rules (often conflicting) related to various aspects such as limits on the number of consecutive work hours, number of day and night shifts that should be worked by each resident, resident staffing requirements according to seniority levels for the day and night shifts, restrictions on the number of consecutive day and night shifts assigned, vacation periods, weekend off requests, and fair distribution of responsibilities among the residents. Emergency rooms (ERs) are stressful workplaces, and in addition shift work is well-known to be more demanding than regular daytime work. For this reason, preparing schedules that suit the working rules for EMRs is especially important for reducing the negative impact on shift workers physiologically, psychologically, and socially. In this paper, we present a goal programming (GP) model that accommodates both hard and soft constraints for a monthly planning horizon. The hard constraints should be adhered to strictly, whereas the soft constraints can be violated when necessary. The relative importance values of the soft constraints have been computed by the analytical hierarchy process (AHP), which are used as coefficients of the deviations from the soft constraints in the objective function. The model has been tested in the ER of a major local university hospital. The main conclusions of the study are that problems of realistic size can be solved quickly and the generated schedules have very high qualities compared to the manually prepared schedules, which require a lot of effort and time from the chief resident who is responsible for this duty. 相似文献
55.
价格不确定情况下炼厂生产计划的优化 总被引:4,自引:0,他引:4
生产计划的编制是炼油企业生产经营管理中的一个关键环节,然而由于市场变化的不确定性,使企业制度长远规划受到限制,笔者将多目标规划应用于炼厂价格不确定情况下生产计划的制定,使所得到的生产计划在一定程度上反映市场的变化并能使企业的生产效益最优,为企业管理决策者进行长远规划给予指导。通过实例验证了该方法的可行性。 相似文献
56.
Optimal Operation of Reservoir Systems using Simulated Annealing 总被引:5,自引:0,他引:5
A stochastic search technique, simulated annealing (SA), is used to optimize the operation of multiple reservoirs. Seminal application of annealing technique in general to multi-period, multiple-reservoir systems, along with problem representation and selection of different parameter values used in the annealing algorithm for specific cases is discussed. The search technique is improved with the help of heuristic rules, problem-specific information and concepts from the field of evolutionary algorithms. The technique is tested for application to a benchmark problem of four-reservoir system previously solved using a linear programming formulation and its ability to replicate the global optimum solution is examined. The technique is also applied to a system of four hydropower generating reservoirs in Manitoba, Canada, to derive optimal operating rules. A limited version of this problem is solved using a mixed integer nonlinear programming and results are compared with those obtained using SA. A better objective function value is obtained using simulated annealing than the value from a mixed integer non-linear programming model developed for the same problem. Results obtained from these applications suggest that simulated annealing can be used for obtaining near-optimal solutions for multi-period reservoir operation problems that are computationally intractable. 相似文献
57.
空间桁架结构拓扑优化设计的线性规划方法 总被引:1,自引:0,他引:1
本文以杆件内力为设计变量,构造了多工况作用下空间桁架结构拓扑优化的线性规划模型,考虑了应力和位移约束,能够避免奇异最优拓扑和不稳定结构的产生。 相似文献
58.
Yasuhiro Kobayashi Toshiyuki Sawa Toshiyuki Furukawa Shigeru Kawamoto 《Electrical Engineering in Japan》2002,138(2):49-58
This paper describes a load dispatch method which minimizes power cost—[fuel cost]/[electric output]—for a power system with thermal plants and energy storage facilities. The proposed method employs fractional programming to convert a minimization problem with fractional objective function to a series of quadratic minimization problems, and semidefinite programming to solve converted problems. The method provides the optimum time‐dependent power output/input and storage level of energy storage facilities as well as time‐dependent power output of thermal plants. The method has been applied to a power system with five thermal plants, two energy storage facilities of various performances, and five load demands. The optimum load scheme of four time mesh points is obtained for the thermal plants and energy storage facilities. The fractional programming successfully converges the optimal scheme through a few iterations. The semidefinite programming deals with a variable matrix of 164 dimensions, and 185 inequality constraints. © 2001 Scripta Technica, Electr Eng Jpn, 138(2): 49–58, 2002 相似文献
59.
Diane J. Cook 《Applied Intelligence》1991,1(2):133-144
Analogical planning provides a means of solving engineering problems where other machine learning methods fail. Unlike many machine learning paradigms, analogy does not require numerous previous examples or a rich domain theory. Instead, analogical planners adapt knowledge of solved problems in similar domains to the current problem. Unfortunately, the analogical planning task is an expensive one. While the process of forming correspondences between a known problem and a new problem is complex, the problem of selecting a base case for the analogy is virtually intractable.This paper addresses the issue of efficiently forming analogical plans. The Anagram planning system is described, which takes advantage of the massively parallel architecture of the Connection Machine to perform base selection and map formation. Anagram provides a tractable solution to analogical planning, with a complexity that is sublinear in the size of the plans.This paper describes the Anagram system and its parallel algorithms. The paper also presents theoretical analyses and empirical results of testing the system on a large database of plans from the domain of automatic programming. 相似文献
60.
Matthew Huntbach 《International journal of parallel programming》1991,20(4):299-314
The concurrent logic languages, of which Parlog is one, have been promoted as a new generation of software languages specifically designed for parallel programming. This paper investigates their application to a search problem commonly used as an illustration of artificial intelligence techniques, the 8-puzzle. It notes that programs written in the concurrent logic languages which do not pay attention to the parallelism can fall into two possible traps: either there is little real parallelism in them due to data dependencies, or there is too much parallelism and any practical architecture will be overwhelmed. A solution which controls the parallelism using user-defined priorities is proposed. This solution has the advantage of being architecture-independent. 相似文献