全文获取类型
收费全文 | 33119篇 |
免费 | 2134篇 |
国内免费 | 31篇 |
专业分类
电工技术 | 241篇 |
综合类 | 18篇 |
化学工业 | 6507篇 |
金属工艺 | 627篇 |
机械仪表 | 696篇 |
建筑科学 | 960篇 |
矿业工程 | 132篇 |
能源动力 | 559篇 |
轻工业 | 5443篇 |
水利工程 | 312篇 |
石油天然气 | 125篇 |
武器工业 | 6篇 |
无线电 | 1296篇 |
一般工业技术 | 5669篇 |
冶金工业 | 8009篇 |
原子能技术 | 117篇 |
自动化技术 | 4567篇 |
出版年
2024年 | 59篇 |
2023年 | 288篇 |
2022年 | 301篇 |
2021年 | 751篇 |
2020年 | 668篇 |
2019年 | 745篇 |
2018年 | 1347篇 |
2017年 | 1307篇 |
2016年 | 1360篇 |
2015年 | 1048篇 |
2014年 | 1229篇 |
2013年 | 2623篇 |
2012年 | 1945篇 |
2011年 | 1741篇 |
2010年 | 1460篇 |
2009年 | 1308篇 |
2008年 | 1280篇 |
2007年 | 1194篇 |
2006年 | 812篇 |
2005年 | 704篇 |
2004年 | 654篇 |
2003年 | 588篇 |
2002年 | 578篇 |
2001年 | 418篇 |
2000年 | 394篇 |
1999年 | 441篇 |
1998年 | 2368篇 |
1997年 | 1617篇 |
1996年 | 1025篇 |
1995年 | 618篇 |
1994年 | 474篇 |
1993年 | 565篇 |
1992年 | 209篇 |
1991年 | 209篇 |
1990年 | 155篇 |
1989年 | 156篇 |
1988年 | 162篇 |
1987年 | 140篇 |
1986年 | 120篇 |
1985年 | 143篇 |
1984年 | 129篇 |
1983年 | 98篇 |
1982年 | 129篇 |
1981年 | 147篇 |
1980年 | 157篇 |
1979年 | 79篇 |
1978年 | 81篇 |
1977年 | 278篇 |
1976年 | 621篇 |
1973年 | 65篇 |
排序方式: 共有10000条查询结果,搜索用时 421 毫秒
881.
882.
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. 相似文献
883.
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. 相似文献
884.
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. 相似文献
885.
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. 相似文献
886.
Koop D Scheidegger CE Callahan SP Freire J Silva CT 《IEEE transactions on visualization and computer graphics》2008,14(6):1691-1698
Building visualization and analysis pipelines is a large hurdle in the adoption of visualization and workflow systems by domain scientists. In this paper, we propose techniques to help users construct pipelines by consensus--automatically suggesting completions based on a database of previously created pipelines. In particular, we compute correspondences between existing pipeline subgraphs from the database, and use these to predict sets of likely pipeline additions to a given partial pipeline. By presenting these predictions in a carefully designed interface, users can create visualizations and other data products more efficiently because they can augment their normal work patterns with the suggested completions. We present an implementation of our technique in a publicly-available, open-source scientific workflow system and demonstrate efficiency gains in real-world situations. 相似文献
887.
The vehicle routing problem with deliveries and pickups is a challenging extension to the vehicle routing problem that lately
attracted growing attention in the literature. This paper investigates the relationship between two versions of this problem,
called “mixed” and “simultaneous”. In particular, we wish to know whether a solution algorithm designed for the simultaneous
case can solve the mixed case. To this end, we implement a metaheuristic based on reactive tabu search. The results suggest
that this approach can yield good results. 相似文献
888.
Rónán Kennedy 《Information & Communications Technology Law》2008,17(2):95-106
The new industry of Massively Multi-Player Online Role-Playing Games (MMORPGs) brings together two sets of fictions: the interactive stories of shared computer games and the legal devices of intellectual property. In these virtual worlds, scarcity need not exist, but players tend to prefer the competition it creates. This leads to the development of property rights within the game world and players trading real money for virtual objects, ‘land’ and characters. This new phenomenon brings with it familiar legal problems such as theft, fraud and ownership disputes. Game creators also challenge the right of the players to claim ownership outside the game world. The volume and value of the items traded make real money trading an important area of current interest for intellectual property lawyers. Something is being traded, but does it fit neatly into existing conceptions of property rights and who owns it? Analysing the novel problems that result from various theoretical perspectives (utilitarianism, labour-desert theory and personality theory) leads to the conclusion that with time, we will see the development of property rights for players in online games. This connects with a growing understanding that the traditional conception of copyright law dealing with creative work generated by the solitary author is becoming less appropriate in the new creative spaces that information and communications technology brings, where individuals are both consumer and producer. In virtual worlds, new forms of intellectual property, and perhaps even new rights, are taking shape. 相似文献
889.
Predictive modelling of online dynamic user-interaction recordings and community identification from such data becomes more
and more important with the widespread use of online communication technologies. Despite of the time-dependent nature of the
problem, existing approaches of community identification are based on static or fully observed network connections. Here we
present a new, dynamic generative model for the inference of communities from a sequence of temporal events produced through
online computer- mediated interactions. The distinctive feature of our approach is that it tries to model the process in a
more realistic manner, including an account for possible random temporal delays between the intended connections. The inference
of these delays from the data then forms an integral part of our state-clustering methodology, so that the most likely communities
are found on the basis of the likely intended connections rather than just the observed ones. We derive a maximum likelihood
estimation algorithm for the identification of our model, which turns out to be computationally efficient for the analysis
of historical data and it scales linearly with the number of non-zero observed (L + 1)-grams, where L is the Markov memory length. In addition, we also derive an incremental version of the algorithm, which could be used for
real-time analysis. Results obtained on both synthetic and real-world data sets demonstrate the approach is flexible and able
to reveal novel and insightful structural aspects of online interactions. In particular, the analysis of a full day worth
synchronous Internet relay chat participation sequence, reveals the formation of an extremely clear community structure. 相似文献
890.
Štefan Černák 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2008,12(5):453-462
A convergence with a fixed regulator v in lattice ordered groups is applied to MV-algebras. For each Archimedean MV-algebra A there exists a v-Cauchy completion A
* and it is uniquely determined up to isomorphisms over A. The relation between the Dedekind completion A
∧ of A and A
* is established. There is solved a question of the existence of the greatest v-Cauchy complete ideal of A. 相似文献