全文获取类型
收费全文 | 1534篇 |
免费 | 187篇 |
国内免费 | 208篇 |
专业分类
电工技术 | 54篇 |
综合类 | 152篇 |
化学工业 | 72篇 |
金属工艺 | 34篇 |
机械仪表 | 104篇 |
建筑科学 | 103篇 |
矿业工程 | 34篇 |
能源动力 | 14篇 |
轻工业 | 7篇 |
水利工程 | 17篇 |
石油天然气 | 18篇 |
武器工业 | 14篇 |
无线电 | 109篇 |
一般工业技术 | 60篇 |
冶金工业 | 134篇 |
原子能技术 | 3篇 |
自动化技术 | 1000篇 |
出版年
2024年 | 16篇 |
2023年 | 42篇 |
2022年 | 104篇 |
2021年 | 121篇 |
2020年 | 69篇 |
2019年 | 46篇 |
2018年 | 49篇 |
2017年 | 41篇 |
2016年 | 47篇 |
2015年 | 44篇 |
2014年 | 68篇 |
2013年 | 66篇 |
2012年 | 81篇 |
2011年 | 119篇 |
2010年 | 65篇 |
2009年 | 92篇 |
2008年 | 112篇 |
2007年 | 98篇 |
2006年 | 114篇 |
2005年 | 108篇 |
2004年 | 59篇 |
2003年 | 79篇 |
2002年 | 51篇 |
2001年 | 32篇 |
2000年 | 28篇 |
1999年 | 26篇 |
1998年 | 16篇 |
1997年 | 19篇 |
1996年 | 15篇 |
1995年 | 12篇 |
1994年 | 26篇 |
1993年 | 12篇 |
1992年 | 11篇 |
1991年 | 8篇 |
1990年 | 8篇 |
1989年 | 3篇 |
1988年 | 5篇 |
1987年 | 2篇 |
1986年 | 4篇 |
1985年 | 1篇 |
1984年 | 4篇 |
1983年 | 2篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1975年 | 1篇 |
排序方式: 共有1929条查询结果,搜索用时 171 毫秒
1.
Combinatorial auction is a useful trade manner for transportation service procurements in e-marketplaces. To enhance the competition of combinatorial auction, a novel auction mechanism of two-round bidding with bundling optimization is proposed. As the recommended the auction mechanism, the shipper/auctioneer integrates the objects into several bundles based on the bidding results of first round auction. Then, carriers/bidders bid for the object bundles in second round. The bundling optimization is described as a multi-objective model with two criteria on price complementation and combination consistency. A Quantum Evolutionary Algorithm (QEA) with β-based rotation gate and the encoding scheme based on non-zero elements in complementary coefficient matrix is developed for the model solution. Comparing with a Contrast Genetic Algorithm, QEA can achieve better computational performances for small and middle size problems. 相似文献
2.
A new spreadsheet-cell-object-oriented algorithm for the first-order reliability method is proposed and illustrated for cases with correlated nonnormals and explicit and implicit performance functions. The new approach differs from the writers earlier algorithm by obviating the need for computations of equivalent normal means and equivalent normal standard deviations. It obtains the solution faster and is more efficient, robust, and succinct. Other advantages include ease of initialization prior to constrained optimization, ease of randomization of initial values for checking robustness, and fewer required optimization constraints during spreadsheet-automated search for the design point. Two cases with implicit performance functions, namely an asymmetrically loaded beam on Winkler medium and a strut with complex supports are analyzed using the new approach and discussed. Comparisons are also made between the proposed approach and that based on Rosenblatt transformation. 相似文献
3.
Shuenn-Yih Chang 《Canadian Metallurgical Quarterly》2007,133(5):555-565
It was found that the discontinuity at the end of an impulse will lead to numerical inaccuracy as this discontinuity will result in an extra impulse and thus an extra displacement in the time history analysis. In addition, this extra impulse is proportional to the discontinuity value at the end of the impulse and the size of integration time step. To overcome this difficulty, an effective approach is proposed to reduce the extra impulse and hence the extra displacement. In fact, the novel approach proposed in this paper is to perform a single small time step immediately upon the termination of applied impulse, whereas other time steps can be conducted by using the step size determined from accuracy consideration in period. The feasibility of this approach is analytically explored. Further, analytical results are confirmed by numerical examples. Numerical studies also show that this approach can be applied to other step-by-step integration methods. It seems that to slightly complicate the programming of dynamic analysis codes is the only disadvantage of this approach. 相似文献
4.
O—O数据模型中实体联系的表达方法 总被引:2,自引:0,他引:2
李天柱 《计算机研究与发展》1997,34(4):275-280
具有对实体和实体间联系的描述能力,是数据库的基本,吼是对数据库进逻辑设计的基本出发点。O-O数据模型不具备显式描术这实体联系的手段。且优于关系模型。 相似文献
5.
有限元法应用于微波和光波器件的问题和发展 总被引:6,自引:0,他引:6
本文就有限元法应用于微波和光波器件的原理、问题和最新进展作了综合评述。文中讨论了适用于不同问题的变分公式的意义;着重讨论了避免和消除虚模的方法和处理开放边界的技术;还对代表该领域发展趋势的三个方面,即边棱元法。非线性结构及有限元程序的前后处理问题进行了评论和展望。 相似文献
6.
7.
A procedure based on K?tter’s equation is developed for the evaluation of bearing capacity factor Nγ with Terzaghi’s mechanism. Application of K?tter’s equation makes the analysis statically determinate, in which the unique failure surface is identified using force equilibrium conditions. The computed Nγ values are found to be higher than Terzaghi’s value in the range 0.25–20%, with a diverging trend for higher values of angle of soil internal friction. A fairly good agreement is observed with other solutions which are based on finite difference coupled with associated flow rule, limit analysis, and limit equilibrium. Finally, the comparison with available experimental results vis-à-vis other solutions shows that, computed Nγ values are capable of making a reasonably good prediction. 相似文献
8.
Entity linking is a fundamental task in natural language processing. The task of entity linking with knowledge graphs aims at linking mentions in text to their correct entities in a knowledge graph like DBpedia or YAGO2. Most of existing methods rely on hand‐designed features to model the contexts of mentions and entities, which are sparse and hard to calibrate. In this paper, we present a neural model that first combines co‐attention mechanism with graph convolutional network for entity linking with knowledge graphs, which extracts features of mentions and entities from their contexts automatically. Specifically, given the context of a mention and one of its candidate entities' context, we introduce the co‐attention mechanism to learn the relatedness between the mention context and the candidate entity context, and build the mention representation in consideration of such relatedness. Moreover, we propose a context‐aware graph convolutional network for entity representation, which takes both the graph structure of the candidate entity and its relatedness with the mention context into consideration. Experimental results show that our model consistently outperforms the baseline methods on five widely used datasets. 相似文献
9.
Williams Ludwell Harrison III 《LISP and Symbolic Computation》1989,2(3-4):179-396
Lisp and its descendants are among the most important and widely used of programming languages. At the same time, parallelism in the architecture of computer systems is becoming commonplace. There is a pressing need to extend the technology of automatic parallelization that has become available to Fortran programmers of parallel machines, to the realm of Lisp programs and symbolic computing. In this paper we present a comprehensive approach to the compilation of Scheme programs for shared-memory multiprocessors. Our strategy has two principal components:interprocedural analysis andprogram restructuring. We introduceprocedure strings andstack configurations as a framework in which to reason about interprocedural side-effects and object lifetimes, and develop a system of interprocedural analysis, using abstract interpretation, that is used in the dependence analysis and memory management of Scheme programs. We introduce the transformations ofexit-loop translation andrecursion splitting to treat the control structures of iteration and recursion that arise commonly in Scheme programs. We propose an alternative representation for s-expressions that facilitates the parallel creation and access of lists. We have implemented these ideas in a parallelizing Scheme compiler and run-time system, and we complement the theory of our work with snapshots of programs during the restructuring process, and some preliminary performance results of the execution of object codes produced by the compiler.This work was supported in part by the National Science Foundation under Grant No. NSF MIP-8410110, the U.S. Department of Energy under Grant No. DE-FG02-85ER25001, the Office of Naval Research under Grant No. ONR N00014-88-K-0686, the U.S. Air Force Office of Scientific Research under Grant No. AFOSR-F49620-86-C-0136, and by a donation from the IBM Corportation. 相似文献
10.
电网故障处置预案是电网故障处置的重要参考,对电网故障处置预案文本中各类电力设备、名称编号等细粒度的关键实体信息进行抽取,是实现计算机学习理解预案内容并进一步支撑故障处置智能化的重要基础。文中提出一种基于深度学习的电网故障处置预案文本命名实体识别技术,首先采用字向量表征预案文本,然后将注意力机制以及双向长短期记忆网络相结合,有所侧重地提取实体词深层字符特征,最后采用条件随机场求解最优序列化的标注。算例表明:文中所提预案文本命名实体识别模型不依赖人工特征,能够自动高效地提取文本特征,准确识别预案文本中细粒度的实体词,满足预案文本中关键实体信息精确定位和识别的要求。 相似文献