全文获取类型
收费全文 | 1012篇 |
免费 | 25篇 |
国内免费 | 39篇 |
专业分类
电工技术 | 25篇 |
综合类 | 25篇 |
化学工业 | 66篇 |
金属工艺 | 19篇 |
机械仪表 | 45篇 |
建筑科学 | 63篇 |
矿业工程 | 6篇 |
能源动力 | 18篇 |
轻工业 | 8篇 |
水利工程 | 5篇 |
石油天然气 | 12篇 |
武器工业 | 3篇 |
无线电 | 76篇 |
一般工业技术 | 52篇 |
冶金工业 | 122篇 |
原子能技术 | 2篇 |
自动化技术 | 529篇 |
出版年
2024年 | 2篇 |
2023年 | 6篇 |
2022年 | 7篇 |
2021年 | 14篇 |
2020年 | 6篇 |
2019年 | 11篇 |
2018年 | 11篇 |
2017年 | 21篇 |
2016年 | 22篇 |
2015年 | 18篇 |
2014年 | 37篇 |
2013年 | 39篇 |
2012年 | 35篇 |
2011年 | 83篇 |
2010年 | 42篇 |
2009年 | 55篇 |
2008年 | 81篇 |
2007年 | 54篇 |
2006年 | 78篇 |
2005年 | 64篇 |
2004年 | 39篇 |
2003年 | 59篇 |
2002年 | 40篇 |
2001年 | 27篇 |
2000年 | 17篇 |
1999年 | 18篇 |
1998年 | 20篇 |
1997年 | 23篇 |
1996年 | 19篇 |
1995年 | 11篇 |
1994年 | 27篇 |
1993年 | 18篇 |
1992年 | 13篇 |
1991年 | 9篇 |
1990年 | 8篇 |
1989年 | 9篇 |
1988年 | 7篇 |
1987年 | 4篇 |
1986年 | 2篇 |
1985年 | 1篇 |
1984年 | 4篇 |
1983年 | 2篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1980年 | 3篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1971年 | 1篇 |
排序方式: 共有1076条查询结果,搜索用时 15 毫秒
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.
In this paper, symbolic code matrix ,constant matrix and count matrix are defined .The first twomatrices are used to describe the elemental expression of augmented matrix and the nede admittance equa-tion is thus obtained. The third matrix is used to obtain the incoming degree matrix, and according to thematrix all the 1- factors of the Coates graph are given. By using the data code, the determinant is expandedand the same items in the expansion are merged. Thus the symbolic network function in which no term can-cellation occurs is generated. 相似文献
3.
目前的电路仿真软件通常是在电路中所有元件值都是给定的情况下得到一些数值结果,而非解析结果。该文利用Matlab的符号运算功能编程,通过节点列表法,实现了任意线性电路的自动解析求解,为电路分析提供了一个有效的辅助工具。 相似文献
4.
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. 相似文献
5.
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. 相似文献
6.
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). 相似文献
7.
Enhanced C (EC) is a set-oriented, extensible, C-like language. EC uses data abstractions to define new types. These data abstractions, called clusters, are macro-like devices that perform substitution on the typed syntax tree. Debugging programs that use clusters raise problems that are not encountered in ordinary programming languages. At compile time there is a need to determine and report whether the macro expansion will result in a legal program before this expansion actually takes place. At run-time the problems are how to account for replaced statements and how to handle variables whose types have been established by the clusters, variables that disappear, or variables whose names have been changed. This article presents these problems and their solutions as implemented by the EC compiler and the EC symbolic debugger. Similar debugging problems appear in other languages: The need to handle variables at run time is common to all languages that support data abstraction even if the abstractions are procedure oriented; also, a mild form of the problem of the replaced statement appears in inline procedure substitution of Ada. The solutions developed for the EC debugger apply to these cases as well. 相似文献
8.
有限元法应用于微波和光波器件的问题和发展 总被引:6,自引:0,他引:6
本文就有限元法应用于微波和光波器件的原理、问题和最新进展作了综合评述。文中讨论了适用于不同问题的变分公式的意义;着重讨论了避免和消除虚模的方法和处理开放边界的技术;还对代表该领域发展趋势的三个方面,即边棱元法。非线性结构及有限元程序的前后处理问题进行了评论和展望。 相似文献
9.
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. 相似文献
10.
This paper introduces a novel methodology for clustering of symbolic objects by making use of Genetic Algorithms (GAs). GAs
are a family of computational models inspired by evolution. These algorithms encode potential solutions to specific problems
on simple chromosome-like data structures and apply recombination operators to these structures so as to preserve critical
information. A new type of representation for chromosome structure is presented here along with a new method for mutation.
The efficacy of the proposed method is examined by application to numeric data of known number of classes and also to assertion
type of symbolic objects drawn from the domain of fat oil, microcomputers, microprocessors and botany. The validity of the
clusters obtained is examined. 相似文献