全文获取类型
收费全文 | 7091篇 |
免费 | 384篇 |
国内免费 | 53篇 |
专业分类
电工技术 | 134篇 |
综合类 | 26篇 |
化学工业 | 1761篇 |
金属工艺 | 118篇 |
机械仪表 | 212篇 |
建筑科学 | 278篇 |
矿业工程 | 7篇 |
能源动力 | 464篇 |
轻工业 | 736篇 |
水利工程 | 76篇 |
石油天然气 | 116篇 |
无线电 | 661篇 |
一般工业技术 | 1162篇 |
冶金工业 | 345篇 |
原子能技术 | 83篇 |
自动化技术 | 1349篇 |
出版年
2024年 | 19篇 |
2023年 | 144篇 |
2022年 | 292篇 |
2021年 | 409篇 |
2020年 | 297篇 |
2019年 | 338篇 |
2018年 | 422篇 |
2017年 | 364篇 |
2016年 | 364篇 |
2015年 | 241篇 |
2014年 | 326篇 |
2013年 | 654篇 |
2012年 | 360篇 |
2011年 | 509篇 |
2010年 | 358篇 |
2009年 | 331篇 |
2008年 | 288篇 |
2007年 | 219篇 |
2006年 | 202篇 |
2005年 | 142篇 |
2004年 | 113篇 |
2003年 | 117篇 |
2002年 | 90篇 |
2001年 | 64篇 |
2000年 | 73篇 |
1999年 | 50篇 |
1998年 | 77篇 |
1997年 | 41篇 |
1996年 | 50篇 |
1995年 | 40篇 |
1994年 | 37篇 |
1993年 | 45篇 |
1992年 | 37篇 |
1991年 | 34篇 |
1990年 | 30篇 |
1989年 | 20篇 |
1988年 | 35篇 |
1987年 | 30篇 |
1986年 | 20篇 |
1985年 | 15篇 |
1984年 | 27篇 |
1983年 | 23篇 |
1982年 | 22篇 |
1981年 | 16篇 |
1980年 | 20篇 |
1979年 | 16篇 |
1978年 | 17篇 |
1976年 | 19篇 |
1975年 | 19篇 |
1974年 | 13篇 |
排序方式: 共有7528条查询结果,搜索用时 539 毫秒
191.
Mohamed Fahim Hassan Mohamed Zribi Hamed M. K. Alazemi 《International Journal of Control, Automation and Systems》2011,9(2):237-248
This paper proposes an optimal recursive estimator to estimate the states of a stochastic discrete time linear dynamic system
when the states of the system are constrained with inequality constraints. The case when the constraints are strictly satisfied
is treated independently from the case when some of the constraints are violated. For the first case, the well known Kalman
filter estimator is used. In the second case, an algorithm which uses a series of successive orthogonalizations on the measurement
subspaces is employed to obtain the optimal estimate. It is shown that the proposed estimator has several attractive properties
such that it is an unbiased estimator. More importantly, compared to other estimator found in the literature, the proposed
estimator needs less computational efforts, is numerically more stable and it leads to a smaller variance. To show the effectiveness
of the proposed estimator, several simulation results are presented and discussed. 相似文献
192.
Mohamed Aissa Adel Ben Mnaouer Rion Murray Habib Youssef Abdelfettah Belghith 《Personal and Ubiquitous Computing》2011,15(8):833-844
Quality of service (QoS) provisioning generally assumes more than one QoS measure that implies that QoS routing can be categorized
as an instance of routing subject to multiple constraints: delay jitter, bandwidth, cost, etc. We study the problem of constructing
multicast trees to meet the QoS requirements of real-time interactive applications where it is necessary to provide bounded
delays and bounded delay variation among the source and all destinations while keeping overall cost of the multicast tree
low. The main contribution of our work is a new strategy for constructing multiconstrained multicast trees. We first derive
mathematically a new delay-variation estimation scheme and prove its efficiency. Thereafter, we propose a simple and competitive
(in terms of running time) heuristic algorithm, for delay and delay variation constrained routing problem based on the proposed
delay-variation estimation scheme and using the Extended Prim-Dijkstra tradeoffs’ algorithm. Our contribution also extends
previous works in providing some properties and analyses of delay bounded paths satisfying delay variation constraints. Extensive
simulation results show that our algorithm outperforms DVDMR in terms of multicast delay variation with the same time complexity
as DVDMR. 相似文献
193.
194.
We present two new classifiers for two-class classification problems using a new Beta-SVM kernel transformation and an iterative
algorithm to concurrently select the support vectors for a support vector machine (SVM) and the hidden units for a single
hidden layer neural network to achieve a better generalization performance. To construct the classifiers, the contributing
data points are chosen on the basis of a thresholding scheme of the outputs of a single perceptron trained using all training
data samples. The chosen support vectors are used to construct a new SVM classifier that we call Beta-SVN. The number of chosen
support vectors is used to determine the structure of the hidden layer in a single hidden layer neural network that we call
Beta-NN. The Beta-SVN and Beta-NN structures produced by our method outperformed other commonly used classifiers when tested
on a 2-dimensional non-linearly separable data set. 相似文献
195.
Yacine Rebahi Mohamed Nassar Thomas Magedanz Olivier FestorAuthor vitae 《Information Security Technical Report》2011,16(1):12-19
The migration from circuit-switched networks to packet-switched networks necessitates the investigation of related issues such as service delivery, QoS, security, and service fraud and misuse. The latter can be seen as a combination of accounting and security aspects. In traditional telecommunication networks, fraud accounts for annual losses at an average of 3%–5% of the operators’ revenue and still increasing at a rate of more than 10% yearly. It is also expected that in VoIP networks, the situation will be worse due to the lack of strong built-in security mechanisms, and the use of open standards. This paper discusses the fraud problem in VoIP networks and evaluates the related available solutions. 相似文献
196.
Maher El��Arbi Mohamed Koubaa Maha Charfeddine Chokri Ben Amar 《Multimedia Tools and Applications》2011,55(3):579-600
In this paper, we propose a video watermarking algorithm which embeds different parts of a single watermark into different shots of a video under the wavelet domain. Based on a Motion Activity Analysis, different regions of the original video are separated into perceptually distinct categories according to motion information and region complexity. Thus, the localizations of the watermark are adjusted adaptively in accordance with the human visual system and signal characteristics, which makes them perceptually invisible and less vulnerable to automated removal. In addition, contrary to traditional methods where the watermark remains at a fixed position on the screen, the watermark moves along with moving objects and thus motion artefacts can be avoid. The multi-frame based extraction strategy ensures that the watermark can be correctly recovered from a very short segment of video. Individual frames extracted from the video also contain watermark information. Experimental results show that the inserted watermark is not only less perceptible but also robust against common video processing attacks. 相似文献
197.
In this paper, we present a new sufficient condition for absolute stability of Lure system with two additive time-varying delay components. This criterion is expressed as a set of linear matrix inequalities (LMIs), which can be readily tested by using standard numerical software. We use this new criterion to stabilize a class of nonlinear time-delay systems. Some numerical examples are given to illustrate the applicability of the results using standard numerical software. 相似文献
198.
In this paper, we present a new sufficient condition for absolute stability of Lure system with two additive time-varying
delay components. This criterion is expressed as a set of linear matrix inequalities (LMIs), which can be readily tested by
using standard numerical software. We use this new criterion to stabilize a class of nonlinear time-delay systems. Some numerical
examples are given to illustrate the applicability of the results using standard numerical software. 相似文献
199.
We address the verification problem of networks of communicating pushdown systems modeling communicating parallel programs with procedure calls. Processes in such networks can read the control state of the other processes according to a given communication structure (specifying the observability rights between processes). The reachability problem of such models is undecidable in general. First, we define a class of networks that effectively preserves recognizability (hence, its reachability problem is decidable). Then, we consider networks where the communication structure can change dynamically during the execution according to a phase graph. The reachability problem for these dynamic networks being undecidable in general, we define a subclass for which it becomes decidable. Then, we consider reachability when the switches in the communication structures are bounded. We show that this problem is undecidable even for one switch. We define a natural class of models for which this problem is decidable. This class can be used in the definition of an efficient semi-decision procedure for the analysis of the general model of dynamic networks. Our techniques allowed to find bugs in two versions of a Windows NT Bluetooth driver. 相似文献
200.
Abir Ben Hmida Mohamed Haouari Marie-José Huguet Pierre Lopez 《Computers & Operations Research》2010,37(12):2192-2201
The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop problem in which each operation must be processed on a given machine chosen among a finite subset of candidate machines. The aim is to find an allocation for each operation and to define the sequence of operations on each machine, so that the resulting schedule has a minimal completion time. We propose a variant of the climbing discrepancy search approach for solving this problem. We also present various neighborhood structures related to assignment and sequencing problems. We report the results of extensive computational experiments carried out on well-known benchmarks for flexible job shop scheduling. The results demonstrate that the proposed approach outperforms the best-known algorithms for the FJSP on some types of benchmarks and remains comparable with them on other ones. 相似文献