全文获取类型
收费全文 | 2585篇 |
免费 | 211篇 |
国内免费 | 3篇 |
专业分类
电工技术 | 18篇 |
化学工业 | 739篇 |
金属工艺 | 44篇 |
机械仪表 | 69篇 |
建筑科学 | 100篇 |
矿业工程 | 11篇 |
能源动力 | 92篇 |
轻工业 | 421篇 |
水利工程 | 20篇 |
石油天然气 | 11篇 |
无线电 | 171篇 |
一般工业技术 | 390篇 |
冶金工业 | 118篇 |
原子能技术 | 26篇 |
自动化技术 | 569篇 |
出版年
2024年 | 8篇 |
2023年 | 43篇 |
2022年 | 105篇 |
2021年 | 143篇 |
2020年 | 86篇 |
2019年 | 101篇 |
2018年 | 113篇 |
2017年 | 99篇 |
2016年 | 136篇 |
2015年 | 88篇 |
2014年 | 146篇 |
2013年 | 230篇 |
2012年 | 192篇 |
2011年 | 193篇 |
2010年 | 143篇 |
2009年 | 135篇 |
2008年 | 124篇 |
2007年 | 119篇 |
2006年 | 76篇 |
2005年 | 64篇 |
2004年 | 71篇 |
2003年 | 46篇 |
2002年 | 56篇 |
2001年 | 32篇 |
2000年 | 25篇 |
1999年 | 20篇 |
1998年 | 24篇 |
1997年 | 27篇 |
1996年 | 13篇 |
1995年 | 23篇 |
1994年 | 16篇 |
1993年 | 11篇 |
1992年 | 9篇 |
1991年 | 9篇 |
1990年 | 10篇 |
1989年 | 10篇 |
1988年 | 8篇 |
1987年 | 8篇 |
1986年 | 7篇 |
1985年 | 7篇 |
1984年 | 4篇 |
1983年 | 3篇 |
1982年 | 3篇 |
1981年 | 4篇 |
1979年 | 2篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1972年 | 1篇 |
1971年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有2799条查询结果,搜索用时 31 毫秒
41.
42.
Rafael Oliveira 《Computational Complexity》2016,25(2):507-561
Kaltofen (Randomness in computation, vol 5, pp 375–412, 1989) proved the remarkable fact that multivariate polynomial factorization can be done efficiently, in randomized polynomial time. Still, more than twenty years after Kaltofen’s work, many questions remain unanswered regarding the complexity aspects of polynomial factorization, such as the question of whether factors of polynomials efficiently computed by arithmetic formulas also have small arithmetic formulas, asked in Kopparty et al. (2014), and the question of bounding the depth of the circuits computing the factors of a polynomial. We are able to answer these questions in the affirmative for the interesting class of polynomials of bounded individual degrees, which contains polynomials such as the determinant and the permanent. We show that if \({P(x_{1},\ldots,x_{n})}\) is a polynomial with individual degrees bounded by r that can be computed by a formula of size s and depth d, then any factor \({f(x_{1},\ldots, x_{n})}\) of \({P(x_{1},\ldots,x_{n})}\) can be computed by a formula of size \({\textsf{poly}((rn)^{r},s)}\) and depth d + 5. This partially answers the question above posed in Kopparty et al. (2014), who asked if this result holds without the dependence on r. Our work generalizes the main factorization theorem from Dvir et al. (SIAM J Comput 39(4):1279–1293, 2009), who proved it for the special case when the factors are of the form \({f(x_{1}, \ldots, x_{n}) \equiv x_{n} - g(x_{1}, \ldots, x_{n-1})}\). Along the way, we introduce several new technical ideas that could be of independent interest when studying arithmetic circuits (or formulas). 相似文献
43.
Fabio Calefato Filippo Lanubile Tayana Conte Rafael Prikladnicki 《Empirical Software Engineering》2016,21(3):1002-1034
Communication in global software development is hindered by language differences in countries with a lack of English speaking professionals. Machine translation is a technology that uses software to translate from one natural language to another. The progress of machine translation systems has been steady in the last decade. As for now, machine translation technology is particularly appealing because it might be used, in the form of cross-language chat services, in countries that are entering into global software projects. However, despite the recent progress of the technology, we still lack a thorough understanding of how real-time machine translation affects communication. In this paper, we present a set of empirical studies with the goal of assessing to what extent real-time machine translation can be used in distributed, multilingual requirements meetings instead of English. Results suggest that, despite far from 100 % accurate, real-time machine translation is not disruptive of the conversation flow and, therefore, is accepted with favor by participants. However, stronger effects can be expected to emerge when language barriers are more critical. Our findings add to the evidence about the recent advances of machine translation technology and provide some guidance to global software engineering practitioners in regarding the losses and gains of using English as a lingua franca in multilingual group communication, as in the case of computer-mediated requirements meetings. 相似文献
44.
André J. Torii Rafael H. Lopez Leandro F. F. Miguel 《Structural and Multidisciplinary Optimization》2016,54(2):289-299
Truss optimization based on the ground structure approach often leads to designs that are too complex for practical purposes. In this paper we present an approach for design complexity control in truss optimization. The approach is based on design complexity measures related to the number of bars (similar to Asadpoure et al. Struct Multidisc Optim 51(2):385–396 2015) and a novel complexity measure related to the number of nodes of the structure. Both complexity measures are continuously differentiable and thus can be used together with gradient based optimization algorithms. The numerical examples show that the proposed approach is able to reduce design complexity, leading to solutions that are more fit for engineering practice. Besides, the examples also indicate that in some cases it is possible to significantly reduce design complexity with little impact on structural performance. Since the complexity measures are non convex, a global gradient based optimization algorithm is employed. Finally, a detailed comparison to a classical approach is presented. 相似文献
45.
This paper investigates stability of nonlinear control systems under intermittent information. Following recent results in the literature, we replace the traditional periodic paradigm, where the up‐to‐date information is transmitted and control laws are executed in a periodic fashion, with the event‐triggered paradigm. Building on the small gain theorem, we develop input–output triggered control algorithms yielding stable closed‐loop systems. In other words, based on the currently available (but outdated) measurements of the outputs and external inputs of a plant, a mechanism triggering when to obtain new measurements and update the control inputs is provided. Depending on the noise in the environment, the developed algorithm yields stable, asymptotically stable, and ‐stable (with bias) closed‐loop systems. Control loops are modeled as interconnections of hybrid systems for which novel results on ‐stability are presented. The prediction of a triggering event is achieved by employing ‐gains over a finite horizon. By resorting to convex programming, a method to compute ‐gains over a finite horizon is devised. Finally, our approach is successfully applied to a trajectory tracking problem for unicycles. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
46.
47.
In this article, the authors compare offshore outsourcing and the internal offshoring of software development. Empirical evidence is presented from a case study conducted in five companies. Based on a detailed literature review, a framework was developed that guided the authors' analysis of the differences in the challenges faced by companies and the patterns of evolution in the practice of software development in each business model. 相似文献
48.
Esteban J. Palomo Enrique Domínguez Rafael M. Luque-Baena José Muñoz 《Neural Processing Letters》2013,37(1):69-87
Both image compression based on color quantization and image segmentation are two typical tasks in the field of image processing. Several techniques based on splitting algorithms or cluster analyses have been proposed in the literature. Self-organizing maps have been also applied to these problems, although with some limitations due to the fixed network architecture and the lack of representation in hierarchical relations among data. In this paper, both problems are addressed using growing hierarchical self-organizing models. An advantage of these models is due to the hierarchical architecture, which is more flexible in the adaptation process to input data, reflecting inherent hierarchical relations among data. Comparative results are provided for image compression and image segmentation. Experimental results show that the proposed approach is promising for image processing, and the powerful of the hierarchical information provided by the proposed model. 相似文献
49.
Algorithm based on simulated annealing for land-use allocation 总被引:1,自引:0,他引:1
Inés Santé-Riveira Marcos Boullón-Magán Rafael Crecente-Maseda David Miranda-Barrós 《Computers & Geosciences》2008,34(3):259-268
This article describes the use of simulated annealing for allocation of land units to a set of possible uses on, the basis of their suitability for those uses, and the compactness of the total areas allotted to the same use or kind of use, which are fixed a priori. The results obtained for the Terra Chá district of Galicia (N.W. Spain) using different objective weighting schemes are compared with each other and with those obtained for this district under the same area constraints, using hierarchical optimization, ideal point analysis, and multi-objective land allocation (MOLA) to maximize average use suitability. Inclusion of compactness in the simulated annealing objective function avoids the highly disperse allocations typical of optimizations that ignore this sub-objective. 相似文献
50.
This report describes the design of a modular, massive-parallel, neural-network (NN)-based vector quantizer for real-time video coding. The NN is a self-organizing map (SOM) that works only in the training phase for codebook generation, only at the recall phase for real-time image coding, or in both phases for adaptive applications. The neural net can be learned using batch or adaptive training and is controlled by an inside circuit, finite-state machine-based hard controller. The SOM is described in VHDL and implemented on electrically (FPGA) and mask (standard-cell) programmable devices. 相似文献