全文获取类型
收费全文 | 59072篇 |
免费 | 2578篇 |
国内免费 | 70篇 |
专业分类
电工技术 | 402篇 |
综合类 | 49篇 |
化学工业 | 12097篇 |
金属工艺 | 1082篇 |
机械仪表 | 1072篇 |
建筑科学 | 1868篇 |
矿业工程 | 106篇 |
能源动力 | 1535篇 |
轻工业 | 8734篇 |
水利工程 | 517篇 |
石油天然气 | 285篇 |
武器工业 | 6篇 |
无线电 | 3059篇 |
一般工业技术 | 9572篇 |
冶金工业 | 12917篇 |
原子能技术 | 340篇 |
自动化技术 | 8079篇 |
出版年
2023年 | 477篇 |
2022年 | 895篇 |
2021年 | 1499篇 |
2020年 | 1067篇 |
2019年 | 1114篇 |
2018年 | 1929篇 |
2017年 | 1923篇 |
2016年 | 2043篇 |
2015年 | 1534篇 |
2014年 | 2039篇 |
2013年 | 3879篇 |
2012年 | 3313篇 |
2011年 | 3525篇 |
2010年 | 2731篇 |
2009年 | 2560篇 |
2008年 | 2639篇 |
2007年 | 2293篇 |
2006年 | 1830篇 |
2005年 | 1552篇 |
2004年 | 1427篇 |
2003年 | 1281篇 |
2002年 | 1135篇 |
2001年 | 769篇 |
2000年 | 762篇 |
1999年 | 925篇 |
1998年 | 4246篇 |
1997年 | 2596篇 |
1996年 | 1765篇 |
1995年 | 1026篇 |
1994年 | 878篇 |
1993年 | 853篇 |
1992年 | 310篇 |
1991年 | 321篇 |
1990年 | 290篇 |
1989年 | 305篇 |
1988年 | 265篇 |
1987年 | 236篇 |
1986年 | 235篇 |
1985年 | 280篇 |
1984年 | 227篇 |
1983年 | 168篇 |
1982年 | 201篇 |
1981年 | 214篇 |
1980年 | 189篇 |
1979年 | 149篇 |
1978年 | 138篇 |
1977年 | 267篇 |
1976年 | 530篇 |
1975年 | 107篇 |
1973年 | 105篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
991.
Pérez-Ortiz Juan Antonio Calera-Rubio Jorge Forcada Mikel L. 《Neural Processing Letters》2001,14(2):127-140
Arithmetic coding is one of the most outstanding techniques for lossless data compression. It attains its good performance with the help of a probability model which indicates at each step the probability of occurrence of each possible input symbol given the current context. The better this model, the greater the compression ratio achieved. This work analyses the use of discrete-time recurrent neural networks and their capability for predicting the next symbol in a sequence in order to implement that model. The focus of this study is on online prediction, a task much harder than the classical offline grammatical inference with neural networks. The results obtained show that recurrent neural networks have no problem when the sequences come from the output of a finite-state machine, easily giving high compression ratios. When compressing real texts, however, the dynamics of the sequences seem to be too complex to be learned online correctly by the net. 相似文献
992.
Varsta Markus Heikkonen Jukka Lampinen Jouko Millán José Del R. 《Neural Processing Letters》2001,13(3):237-251
This paper compares two Self-Organizing Map (SOM) based models for temporal sequence processing (TSP) both analytically and experimentally. These models, Temporal Kohonen Map (TKM) and Recurrent Self-Organizing Map (RSOM), incorporate leaky integrator memory to preserve the temporal context of the input signals. The learning and the convergence properties of the TKM and RSOM are studied and we show analytically that the RSOM is a significant improvement over the TKM, because the RSOM allows simple derivation of a consistent learning rule. The results of the analysis are demonstrated with experiments. 相似文献
993.
Nikolaj S. Bjørner Anca Browne Michael A. Colón Bernd Finkbeiner Zohar Manna Henny B. Sipma Tomás E. Uribe 《Formal Methods in System Design》2000,16(3):227-270
We review a number of formal verification techniques supported by STeP, the Stanford Temporal Prover, describing how the tool can be used to verify properties of several versions of the Bakery Mutual exclusion algorithm for mutual exclusion. We verify the classic two-process algorithm and simple variants, as well as an atomic parameterized version. The methods used include deductive verification rules, verification diagrams, automatic invariant generation, and finite-state model checking and abstraction. 相似文献
994.
Recently the action systems formalism for parallel and distributed systems has been extended with the procedure mechanism.
This gives us a very general framework for describing different communication paradigms for action systems, e.g. remote procedure
calls. Action systems come with a design methodology based on the refinement calculus. Data refinement is a powerful technique
for refining action systems. In this paper we will develop a theory and proof rules for the refinement of action systems that
communicate via remote procedures based on the data refinement approach. The proof rules we develop are compositional so that
modular refinement of action systems is supported. As an example we will especially study the atomicity refinement of actions.
This is an important refinement strategy, as it potentially increases the degree of parallelism in an action system.
Received February 1999 / Accepted in revised form July 2000 相似文献
995.
Generation of Efficient Nested Loops from Polyhedra 总被引:1,自引:0,他引:1
Fabien Quilleré Sanjay Rajopadhye Doran Wilde 《International journal of parallel programming》2000,28(5):469-498
Automatic parallelization in the polyhedral model is based on affine transformations from an original computation domain (iteration space) to a target space-time domain, often with a different transformation for each variable. Code generation is an often ignored step in this process that has a significant impact on the quality of the final code. It involves making a trade-off between code size and control code simplification/optimization. Previous methods of doing code generation are based on loop splitting, however they have nonoptimal behavior when working on parameterized programs. We present a general parameterized method for code generation based on dual representation of polyhedra. Our algorithm uses a simple recursion on the dimensions of the domains, and enables fine control over the tradeoff between code size and control overhead. 相似文献
996.
Juan Francisco Gómez-Lopera José Martínez-Aroza Aureliano M. Robles-Pérez Ramón Román-Roldán 《Journal of Mathematical Imaging and Vision》2000,13(1):35-56
This work constitutes a theoretical study of the edge-detection method by means of the Jensen-Shannon divergence, as proposed by the authors. The overall aim is to establish formally the suitability of the procedure of edge detection in digital images, as a step prior to segmentation. In specific, an analysis is made not only of the properties of the divergence used, but also of the method's sensitivity to the spatial variation, as well as the detection-error risk associated with the operating conditions due to the randomness of the spatial configuration of the pixels. Although the paper deals with the procedure based on the Jensen-Shannon divergence, some problems are also related to other methods based on local detection with a sliding window, and part of the study is focused to noisy and textured images. 相似文献
997.
J.L. Díaz De León S. J.H. Sossa-Azuela 《Journal of Mathematical Imaging and Vision》2000,12(2):137-154
Mathematical Morphology (MM) is a general method for image processing based on set theory. The two basic morphological operators are dilation and erosion. From these, several non linear filters have been developed usually with polynomial complexity, and this because the two basic operators depend strongly on the definition of the structural element. Most efforts to improve the algorithm's speed for each operator are based on structural element decomposition and/or efficient codification.A new framework and a theoretical basis toward the construction of fast morphological operators (of zero complexity) for an infinite (countable) family of regular metric spaces are presented in work. The framework is completely defined by the three axioms of metric. The theoretical basis here developed points out properties of some metric spaces and relationships between metric spaces in the same family, just in terms of the properties of the four basic metrics stated in this work. Concepts such as bounds, neighborhoods and contours are also related by the same framework.The presented results, are general in the sense that they cover the most commonly used metrics such as the chamfer, the city block and the chess board metrics. Generalizations and new results related with distances and distance transforms, which in turn are used to develop the morphologic operations in constant time, in contrast with the polynomial time algorithms are also given. 相似文献
998.
An effective protection of our environment is largely dependent on the quality of the available information used to make an appropriate decision. Problems arise when the quantities of available information are huge and nonuniform (i.e., coming from many different disciplines or sources) and their quality could not be stated in advance. Another associated issue is the dynamical nature of the problem. Computers are central in contemporary environmental protection in tasks such as monitoring, data analysis, communication, information storage and retrieval, so it has been natural to try to integrate and enhance all these tasks with Artificial Intelligence knowledge-based techniques. This paper presents an overview of the impact of Artificial Intelligence techniques on the definition and development of Environmental Decision Support Systems (EDSS) during the last fifteen years. The review highlights the desirable features that an EDSS must show. The paper concludes with a selection of successful applications to a wide range of environmental problems. 相似文献
999.
Ann Monté Pieter Bauwens Stefaan Maeyaert Jan Doutreloigne 《Journal of the Society for Information Display》2008,16(11):1171-1180
Abstract— A new bistable‐display driver is presented. The innovation in the developed driver is the addition of a new logical block that calculates the most energy‐efficient driving waveforms. In this paper, the algorithms being applied to the row and column waveforms in order to reduce the power consumption are discussed. Some theoretical as well as experimental results are shown, proving a reduction in the power consumption by about 50%. The proposed algorithms are especially important for battery‐powered applications. 相似文献
1000.
Termeer M Oliván Bescós J Breeuwer M Vilanova A Gerritsen F Gröller ME Nagel E 《IEEE transactions on visualization and computer graphics》2008,14(6):1595-1602
Visually assessing the effect of the coronary artery anatomy on the perfusion of the heart muscle in patients with coronary artery disease remains a challenging task. We explore the feasibility of visualizing this effect on perfusion using a numerical approach. We perform a computational simulation of the way blood is perfused throughout the myocardium purely based on information from a three-dimensional anatomical tomographic scan. The results are subsequently visualized using both three-dimensional visualizations and bull's eye plots, partially inspired by approaches currently common in medical practice. Our approach results in a comprehensive visualization of the coronary anatomy that compares well to visualizations commonly used for other scanning technologies. We demonstrate techniques giving detailed insight in blood supply, coronary territories and feeding coronary arteries of a selected region. We demonstrate the advantages of our approach through visualizations that show information which commonly cannot be directly observed in scanning data, such as a separate visualization of the supply from each coronary artery. We thus show that the results of a computational simulation can be effectively visualized and facilitate visually correlating these results to for example perfusion data. 相似文献