全文获取类型
收费全文 | 6952篇 |
免费 | 940篇 |
国内免费 | 673篇 |
专业分类
电工技术 | 817篇 |
技术理论 | 1篇 |
综合类 | 767篇 |
化学工业 | 79篇 |
金属工艺 | 37篇 |
机械仪表 | 239篇 |
建筑科学 | 352篇 |
矿业工程 | 84篇 |
能源动力 | 193篇 |
轻工业 | 36篇 |
水利工程 | 661篇 |
石油天然气 | 107篇 |
武器工业 | 75篇 |
无线电 | 1804篇 |
一般工业技术 | 409篇 |
冶金工业 | 120篇 |
原子能技术 | 6篇 |
自动化技术 | 2778篇 |
出版年
2024年 | 64篇 |
2023年 | 141篇 |
2022年 | 217篇 |
2021年 | 278篇 |
2020年 | 283篇 |
2019年 | 267篇 |
2018年 | 241篇 |
2017年 | 313篇 |
2016年 | 345篇 |
2015年 | 402篇 |
2014年 | 557篇 |
2013年 | 573篇 |
2012年 | 610篇 |
2011年 | 610篇 |
2010年 | 429篇 |
2009年 | 434篇 |
2008年 | 445篇 |
2007年 | 460篇 |
2006年 | 344篇 |
2005年 | 291篇 |
2004年 | 239篇 |
2003年 | 222篇 |
2002年 | 149篇 |
2001年 | 113篇 |
2000年 | 91篇 |
1999年 | 67篇 |
1998年 | 71篇 |
1997年 | 51篇 |
1996年 | 38篇 |
1995年 | 35篇 |
1994年 | 31篇 |
1993年 | 31篇 |
1992年 | 14篇 |
1991年 | 10篇 |
1990年 | 11篇 |
1989年 | 13篇 |
1988年 | 7篇 |
1987年 | 5篇 |
1986年 | 6篇 |
1985年 | 11篇 |
1984年 | 5篇 |
1983年 | 6篇 |
1982年 | 5篇 |
1980年 | 5篇 |
1979年 | 4篇 |
1977年 | 2篇 |
1976年 | 4篇 |
1975年 | 2篇 |
1974年 | 3篇 |
1973年 | 3篇 |
排序方式: 共有8565条查询结果,搜索用时 265 毫秒
221.
222.
针对大规模救援物资调运的多目标中转运输网点定位问题,考虑运输费用、中转网点的作业变动费用和运输时间,建立一个救援物资中转运输网点的非线性多目标混合整数规划模型。为有效求解该模型,提出一种基于矩阵编码的遗传算法,利用费用矩阵标杆的寻优导向信息提高遗传变异算子的局部搜索能力,提高全局收敛速度。通过算例分析验证该模型和算法的有效性。 相似文献
223.
基于LDA模型的新闻话题的演化 总被引:1,自引:0,他引:1
新闻话题及演化的研究可以帮助人们快速了解和获取新闻内容。提出了一种挖掘新闻话题随时间变化的方法,通过话题抽取和话题关联实现话题的演化。首先应用LDA(Latent Dirichlet Allocation Model)对不同时间段的文集进行话题的自动抽取,话题数目在不同时间段是可变的;计算相邻时间段中任意两个话题的分布距离实现话题的关联。实验结果证明该方法不但可以描述同一个话题随时间的演化过程,还可以描述话题内容随时间的变化,反映了话题(或子话题)之间多对多的演化关系。 相似文献
224.
Saowanee Lertworasirikul Peerayuth Charnsethikul Shu-Cherng Fang 《Computers & Industrial Engineering》2011,61(4):1017-1023
This paper studies the inverse Data Envelopment Analysis (inverse DEA) for the case of variable returns to scale (inverse BCC). The developed inverse BCC model can preserve relative efficiency values of all decision making units (DMUs) in a new production possibility set composing of all current DMUs and a perturbed DMU with new input and output values. We consider the inverse BCC model for a resource allocation problem, where increases of some outputs and decreases of the other outputs of the considered DMU can be taken into account simultaneously. The inverse BCC problem is in the form of a multi-objective nonlinear programming model (MONLP), which is not easy to solve. We propose a linear programming model, which gives a Pareto-efficient solution to the inverse BCC problem. However, there exists at least an optimal solution to the proposed model if and only if the new output vector is in the set of current production possibility set. The proposed approach is illustrated via a case study of a motorcycle-part company. 相似文献
225.
Online algorithms for advance resource reservations 总被引:2,自引:0,他引:2
C. CastilloAuthor Vitae G.N. RouskasAuthor Vitae 《Journal of Parallel and Distributed Computing》2011,71(7):963-973
We consider the problem of providing QoS guarantees to Grid users through advance reservation of resources. Advance reservation mechanisms provide the ability to allocate resources to users based on agreed-upon QoS requirements and increase the predictability of a Grid system, yet incorporating such mechanisms into current Grid environments has proven to be a challenging task due to the resulting resource fragmentation. We use concepts from computational geometry to present a framework for tackling the resource fragmentation, and for formulating a suite of scheduling strategies. We also develop efficient implementations of the scheduling algorithms that scale to large Grids. We conduct a comprehensive performance evaluation study using simulation, and we present numerical results to demonstrate that our strategies perform well across several metrics that reflect both user- and system-specific goals. Our main contribution is a timely, practical, and efficient solution to the problem of scheduling resources in emerging on-demand computing environments. 相似文献
226.
In this paper, the validity evaluation method of free allocation is studied under the background of allocating the total permitted pollution discharge capacity (TPPDC). First, the free allocation method’s localization and players’ strategic behaviors are analyzed. Second, an incentive mechanism for allocating TPPDC is proposed based on the uniform price auction of divisible goods, and an evaluation model to evaluate the validity for the free allocation of TPPDC is established, and the feasibility and reasonableness of this evaluation model are proved. Third, the evaluation criterion and the evaluation process are given. Finally, this evaluation model is applied to the environmental planning of Han River basin, and the validity evaluation result of free allocation is obtained by analyzing the statistical data of chemical oxygen demand (COD) in 14 counties and cities of Hubei Province, China. The results of our study will provide the government environmental management departments with theoretical basis and scientific methods to effectively implement the pollutant gross control system and design the related environmental policies. 相似文献
227.
Ole-Christoffer Granmo B. John Oommen 《Engineering Applications of Artificial Intelligence》2011,24(7):1238-1251
We consider the problem of polling web pages as a strategy for monitoring the world wide web. The problem consists of repeatedly polling a selection of web pages so that changes that occur over time are detected. In particular, we consider the case where we are constrained to poll a maximum number of web pages per unit of time, and this constraint is typically dictated by the governing communication bandwidth, and by the speed limitations associated with the processing. Since only a fraction of the web pages can be polled within a given unit of time, the issue at stake is one of determining which web pages are to be polled, and we attempt to do it in a manner that maximizes the number of changes detected. We solve the problem by first modelling it as a stochastic nonlinear fractional knapsack problem. We then present an online learning automata (LA) system, namely, the hierarchy of twofold resource allocation automata (H-TRAA), whose primitive component is a twofold resource allocation automaton (TRAA). Both the TRAA and the H-TRAA have been proven to be asymptotically optimal. Finally, we demonstrate empirically that the H-TRAA provides orders of magnitude faster convergence compared to the learning automata knapsack game (LAKG) which represents the state-of-the-art for this problem. Further, in contrast to the LAKG, the H-TRAA scales sub-linearly. Based on these results, we believe that the H-TRAA has also tremendous potential to handle demanding real-world applications, particularly those which deal with the world wide web. 相似文献
228.
一种求解随机有限缓冲区流水线调度的混合差分进化算法 总被引:4,自引:0,他引:4
针对随机有限缓冲区流水线调度问题(Flow shop scheduling problem, FSSP), 提出混合差分进化(Differential evolution, DE)算法OHTDE, 用来最小化提前/拖后指标和最小化总体完成时间指标. OHTDE将DE和最优计算量分配(Optimal computing budget allocation, OCBA)技术以及假设检验(Hypothesis test, HT)有效结合. DE用于执行全局搜索和局部搜索; OCBA用于对有限计算量进行合理分配, 从而保证优质解得到较多仿真计算量, 提高了在噪声环境下获得优质解的置信度; HT用于在统计意义上比较解的性能, 从而一定程度上避免在解空间相近区域进行重复搜索. 进而, 对由OCBA和HT确定的优质解执行一种特殊的交叉操作, 加强DE的局部开发能力. 同时也采用有限马氏链理论对OHTDE的随机收敛性进行了分析. 仿真实验和算法比较验证了算法的有效性和鲁棒性. 相似文献
229.
In this paper, we consider the manpower allocation problem with time windows, job-teaming constraints and a limited number of teams (m-MAPTWTC). Given a set of teams and a set of tasks, the problem is to assign to each team a sequential order of tasks to maximize the total number of assigned tasks. Both teams and tasks may be restricted by time windows outside which operation is not possible. Some tasks require cooperation between teams, and all teams cooperating must initiate execution simultaneously. We present an integer programming model for the problem, which is decomposed using Dantzig–Wolfe decomposition. The problem is solved by column generation in a branch-and-price framework. Simultaneous execution of tasks is enforced by the branching scheme. To test the efficiency of the proposed algorithm, 12 realistic test instances are introduced. The algorithm is able to find the optimal solution in 11 of the test instances. The main contribution of this article is the addition of synchronization between teams in an exact optimization context. 相似文献
230.
Software reliability is one of the most important quality attributes of commercial software. During software testing, software reliability growth models (SRGMs) are commonly used to describe the phenomenon of failure occurrence and/or fault removal which consequently enhancements software reliability. Large software systems are developed by integrating a number of relatively small and independent modules, which are tested independently during module testing phase. The amount of testing resource available is limited which is desired to be consumed judiciously so as to optimize the testing process. In this paper we formulate a resource allocation problem of minimizing the cost of software testing under available amount of testing resource, given a reliability constraint. We use a flexible SRGM considering testing effort which, depending upon the values of parameters, can describe either exponential or S-shaped failure pattern of software modules. A systematic and sequential Algorithm is proposed to solve the optimization problem formulated. Numerical examples are given to illustrate the formulation and solution procedures. Sensitivity analysis is performed to examine the behavior of some parameters of SRGM with most significant influence. 相似文献