全文获取类型
收费全文 | 89232篇 |
免费 | 1124篇 |
国内免费 | 429篇 |
专业分类
电工技术 | 842篇 |
综合类 | 2323篇 |
化学工业 | 12495篇 |
金属工艺 | 4964篇 |
机械仪表 | 3178篇 |
建筑科学 | 2279篇 |
矿业工程 | 569篇 |
能源动力 | 1537篇 |
轻工业 | 4087篇 |
水利工程 | 1328篇 |
石油天然气 | 428篇 |
武器工业 | 2篇 |
无线电 | 9848篇 |
一般工业技术 | 17402篇 |
冶金工业 | 3365篇 |
原子能技术 | 314篇 |
自动化技术 | 25824篇 |
出版年
2023年 | 102篇 |
2022年 | 203篇 |
2021年 | 236篇 |
2020年 | 214篇 |
2019年 | 192篇 |
2018年 | 14633篇 |
2017年 | 13520篇 |
2016年 | 10124篇 |
2015年 | 741篇 |
2014年 | 433篇 |
2013年 | 637篇 |
2012年 | 3352篇 |
2011年 | 9643篇 |
2010年 | 8455篇 |
2009年 | 5740篇 |
2008年 | 6968篇 |
2007年 | 7918篇 |
2006年 | 267篇 |
2005年 | 1299篇 |
2004年 | 1202篇 |
2003年 | 1250篇 |
2002年 | 605篇 |
2001年 | 149篇 |
2000年 | 247篇 |
1999年 | 139篇 |
1998年 | 267篇 |
1997年 | 172篇 |
1996年 | 170篇 |
1995年 | 104篇 |
1994年 | 92篇 |
1993年 | 91篇 |
1992年 | 73篇 |
1991年 | 82篇 |
1990年 | 49篇 |
1989年 | 60篇 |
1988年 | 55篇 |
1986年 | 52篇 |
1985年 | 66篇 |
1984年 | 48篇 |
1983年 | 55篇 |
1982年 | 57篇 |
1981年 | 56篇 |
1980年 | 50篇 |
1979年 | 44篇 |
1976年 | 46篇 |
1968年 | 43篇 |
1966年 | 45篇 |
1965年 | 45篇 |
1955年 | 63篇 |
1954年 | 68篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
Ting Wang Jochem Vonk Benedikt Kratz Paul Grefen 《Distributed and Parallel Databases》2008,23(3):235-270
Transactions have been around since the Seventies to provide reliable information processing in automated information systems.
Originally developed for simple ‘debit-credit’ style database operations in centralized systems, they have moved into much
more complex application domains including aspects like distribution, process-orientation and loose coupling. The amount of
published research work on transactions is huge and a number of overview papers and books already exist. A concise historic
analysis providing an overview of the various phases of development of transaction models and mechanisms in the context of
growing complexity of application domains is still missing, however. To fill this gap, this paper presents a historic overview
of transaction models organized in several ‘transaction management eras’, thereby investigating numerous transaction models
ranging from the classical flat transactions, via advanced and workflow transactions to the Web Services and Grid transaction
models. The key concepts and techniques with respect to transaction management are investigated. Placing well-known research
efforts in historical perspective reveals specific trends and developments in the area of transaction management. As such,
this paper provides a comprehensive, structured overview of developments in the area. 相似文献
992.
John Stachurski 《Computational Economics》2008,31(2):141-160
This paper studies fitted value iteration for continuous state numerical dynamic programming using nonexpansive function approximators.
A number of approximation schemes are discussed. The main contribution is to provide error bounds for approximate optimal
policies generated by the value iteration algorithm.
相似文献
993.
Multi-core CPUs,Clusters, and Grid Computing: A Tutorial 总被引:1,自引:0,他引:1
The nature of computing is changing and it poses both challenges and opportunities for economists. Instead of increasing clock
speed, future microprocessors will have “multi-cores” with separate execution units. “Threads” or other multi-processing techniques
that are rarely used today are required to take full advantage of them. Beyond one machine, it has become easy to harness
multiple computers to work in clusters. Besides dedicated clusters, they can be made up of unused lab computers or even your
colleagues’ machines. Finally, grids of computers spanning the Internet are now becoming a reality. 相似文献
994.
Differencing and merging of architectural views 总被引:1,自引:0,他引:1
Marwan Abi-Antoun Jonathan Aldrich Nagi Nahas Bradley Schmerl David Garlan 《Automated Software Engineering》2008,15(1):35-74
Differencing and merging architectural views is an important activity in software engineering. However, existing approaches
are still based on restrictive assumptions, such as requiring view elements to have unique identifiers or exactly matching
types, which is often not the case in many application domains.
We propose an approach based on structural information. We generalize a published polynomial-time tree-to-tree correction
algorithm that detects inserts, renames and deletes, into a novel algorithm that additionally detects restricted moves. Our
algorithm also supports forcing and preventing matches between view elements.
We incorporate the algorithm into tools to compare and merge Component-and-Connector (C&C) architectural views. We provide
an empirical evaluation of the algorithm. We illustrate the tools using extended examples, and use them to detect and reconcile
interesting differences between real architectural views.
This article is an expanded version of the following paper: Abi-Antoun, M., Aldrich, J., Nahas, N., Schmerl, B., and Garlan, D:
2006, ‘Differencing and Merging of Architectural Views’. In: Proceedings of the 21st IEEE International Conference on Automated Software Engineering, pp. 47–58. 相似文献
995.
Testing Forecast Accuracy of Foreign Exchange Rates: Predictions from Feed Forward and Various Recurrent Neural Network Architectures 总被引:3,自引:1,他引:2
In this research, we work with data of futures contracts on foreign exchange rates for British pound (BP), Canadian dollar
(CD), and Japanese yen (JY) that are traded at the Chicago Mercantile Exchange (CME) against US dollars. We model relationships
between exchange rates in these currencies using linear models, feed forward artificial neural networks (ANN), and three versions
of recurrent neural networks (RNN1, RNN2 and RNN3) for predicting exchange rates in these currencies against the US dollar.
Our results on forecast evaluations based on AGS test the tests of forecast equivalence between any two competing models among
the entire models employed for each of the series show that ANN and the three versions of RNN models offer superior forecasts
for predicting BP, CD and JY exchange rates although the forecast evaluations based on MGN test are in sharp contrast. On
the other hand forecast based on SIGN test shows that ANN and all the versions of RNN models offer superior forecasts for
BP and CD in exception of JY exchange rates. The results for forecast evaluation for all the models for each of the series
based on summary measures of forecast evaluations show that RNN3 model appears to offer the most accurate predictions of BP
and RNN1 for JP exchange rates. However, none of the RNN models appear to be statistically superior to the benchmark (i.e.,
linear model) for predicting CD exchange rates.
相似文献
996.
997.
A new approach to the design of a neural network (NN) based navigator is proposed in which the mobile robot travels to a pre-defined
goal position safely and efficiently without any prior map of the environment. This navigator can be optimized for any user-defined
objective function through the use of an evolutionary algorithm. The motivation of this research is to develop an efficient
methodology for general goal-directed navigation in generic indoor environments as opposed to learning specialized primitive
behaviors in a limited environment. To this end, a modular NN has been employed to achieve the necessary generalization capability
across a variety of indoor environments. Herein, each NN module takes charge of navigating in a specialized local environment,
which is the result of decomposing the whole path into a sequence of local paths through clustering of all the possible environments.
We verify the efficacy of the proposed algorithm over a variety of both simulated and real unstructured indoor environments
using our autonomous mobile robot platform. 相似文献
998.
An automatic road sign recognition system first locates road signs within images captured by an imaging sensor on-board of
a vehicle, and then identifies the detected road signs. This paper presents an automatic neural-network-based road sign recognition
system. First, a study of the existing road sign recognition research is presented. In this study, the issues associated with
automatic road sign recognition are described, the existing methods developed to tackle the road sign recognition problem
are reviewed, and a comparison of the features of these methods is given. Second, the developed road sign recognition system
is described. The system is capable of analysing live colour road scene images, detecting multiple road signs within each
image, and classifying the type of road signs detected. The system consists of two modules: detection and classification.
The detection module segments the input image in the hue-saturation-intensity colour space, and then detects road signs using
a Multi-layer Perceptron neural-network. The classification module determines the type of detected road signs using a series
of one to one architectural Multi-layer Perceptron neural networks. Two sets of classifiers are trained using the Resillient-Backpropagation
and Scaled-Conjugate-Gradient algorithms. The two modules of the system are evaluated individually first. Then the system
is tested as a whole. The experimental results demonstrate that the system is capable of achieving an average recognition
hit-rate of 95.96% using the scaled-conjugate-gradient trained classifiers. 相似文献
999.
Michael M. Li Brijesh Verma Xiaolong Fan Kevin Tickle 《Neural computing & applications》2008,17(4):391-397
This paper investigates a new method to solve the inverse problem of Rutherford backscattering (RBS) data. The inverse problem
is to determine the sample structure information from measured spectra, which can be defined as a function approximation problem.
We propose using radial basis function (RBF) neural networks to approximate an inverse function. Each RBS spectrum, which
may contain up to 128 data points, is compressed by the principal component analysis, so that the dimensionality of input
data and complexity of the network are reduced significantly. Our theoretical consideration is tested by numerical experiments
with the example of the SiGe thin film sample and corresponding backscattering spectra. A comparison of the RBF method with
multilayer perceptrons reveals that the former has better performance in extracting structural information from spectra. Furthermore,
the proposed method can handle redundancies properly, which are caused by the constraint of output variables. This study is
the first method based on RBF to deal with the inverse RBS data analysis problem. 相似文献
1000.
Specification of communicating processes: temporal logic versus refusals-based refinement 总被引:1,自引:1,他引:0
Gavin Lowe 《Formal Aspects of Computing》2008,20(3):277-294
In this paper we consider the relationship between refinement-oriented specification and specifications using a temporal logic.
We investigate the extent to which one can check whether a program in a process algebra, such as Communicating Sequential
Processes (CSP), satisfies a temporal logic specification using a refinement-based model checker, such as FDR. We consider
what atomic formulae are appropriate in a temporal logic for specifying communicating processes, in particular where one wants
to talk about the availability of events. We then show that, perhaps surprisingly, the standard stable failures model is not
adequate for capturing specifications in such a logic: instead the refusal traces model must be used. We formalise the logic
by giving it a semantics in this model. We show that the temporal operators eventually and until, and negation, cannot, in general, be tested for via simple refinement checks. For the remaining fragment of the logic, we
present a translation into simple refinement checks. Finally, we show that refusal traces equivalence is characterised by
a slightly augmented version of that fragment.
M. J. Butler 相似文献