全文获取类型
收费全文 | 3982篇 |
免费 | 206篇 |
国内免费 | 23篇 |
专业分类
电工技术 | 70篇 |
综合类 | 8篇 |
化学工业 | 929篇 |
金属工艺 | 87篇 |
机械仪表 | 96篇 |
建筑科学 | 130篇 |
矿业工程 | 3篇 |
能源动力 | 240篇 |
轻工业 | 356篇 |
水利工程 | 52篇 |
石油天然气 | 93篇 |
无线电 | 500篇 |
一般工业技术 | 760篇 |
冶金工业 | 130篇 |
原子能技术 | 13篇 |
自动化技术 | 744篇 |
出版年
2024年 | 16篇 |
2023年 | 141篇 |
2022年 | 266篇 |
2021年 | 323篇 |
2020年 | 218篇 |
2019年 | 222篇 |
2018年 | 266篇 |
2017年 | 196篇 |
2016年 | 202篇 |
2015年 | 130篇 |
2014年 | 162篇 |
2013年 | 319篇 |
2012年 | 214篇 |
2011年 | 239篇 |
2010年 | 170篇 |
2009年 | 159篇 |
2008年 | 116篇 |
2007年 | 78篇 |
2006年 | 80篇 |
2005年 | 75篇 |
2004年 | 55篇 |
2003年 | 40篇 |
2002年 | 44篇 |
2001年 | 40篇 |
2000年 | 27篇 |
1999年 | 31篇 |
1998年 | 40篇 |
1997年 | 25篇 |
1996年 | 31篇 |
1995年 | 18篇 |
1994年 | 20篇 |
1993年 | 27篇 |
1992年 | 21篇 |
1991年 | 9篇 |
1990年 | 9篇 |
1989年 | 17篇 |
1988年 | 20篇 |
1987年 | 10篇 |
1986年 | 12篇 |
1985年 | 12篇 |
1984年 | 16篇 |
1983年 | 11篇 |
1982年 | 8篇 |
1981年 | 11篇 |
1980年 | 11篇 |
1979年 | 6篇 |
1978年 | 10篇 |
1977年 | 8篇 |
1976年 | 11篇 |
1974年 | 6篇 |
排序方式: 共有4211条查询结果,搜索用时 0 毫秒
61.
62.
Khalida Inayat Noor Sarfraz Nawaz Malik 《Computers & Mathematics with Applications》2011,62(1):367-375
The aim of this paper is to generalize the conic domain defined by Kanas and Wisniowska, and define the class of functions which map the open unit disk E onto this generalized conic domain. A brief comparison between these conic domains is the main motivation of this paper. A correction is made in selecting the range interval of order of conic domain. 相似文献
63.
John Fitzpatrick Séan Murphy Mohammed Atiquzzaman John Murphy 《Computer Communications》2009,32(15):1600-1612
Network centric handover solutions for all IP wireless networks usually require modifications to network infrastructure which can stifle any potential rollout. This has led researchers to begin looking at alternative approaches. Endpoint centric handover solutions do not require network infrastructure modification, thereby alleviating a large barrier to deployment. Current endpoint centric solutions capable of meeting the delay requirements of Voice over Internet Protocol (VoIP) fail to consider the Quality of Service (QoS) that will be achieved after handoff. The main contribution of this paper is to demonstrate that QoS aware handover mechanisms which do not require network support are possible. This work proposes a Stream Control Transmission Protocol (SCTP) based handover solution for VoIP called Endpoint Centric Handover (ECHO). ECHO incorporates cross-layer metrics and the ITU-T E-Model for voice quality assessment to accurately estimate the QoS of candidate handover networks, thus facilitating a more intelligent handoff decision. An experimental testbed was developed to analyse the performance of the ECHO scheme. Results are presented showing both the accuracy of ECHO at estimating the QoS and that the addition of the QoS capabilities significantly improves the handover decisions that are made. 相似文献
64.
Xiaoming Peng Author Vitae Mohammed Bennamoun Author Vitae Author Vitae 《Pattern recognition》2011,44(3):544-558
Nose tip detection in range images is a specific facial feature detection problem that is highly important for 3D face recognition. In this paper, we propose a nose tip detection method that has the following three characteristics. First, it does not require training and does not rely on any particular model. Second, it can deal with both frontal and non-frontal poses. Finally, it is quite fast, requiring only seconds to process an image of 100-200 pixels (in both x and y dimensions) with a MATLAB implementation. A complexity analysis shows that most of the computations involved in the proposed algorithm are simple. Thus, if implemented in hardware (such as a GPU implementation), the proposed method should be able to work in real time. We tested the proposed method extensively on synthetic image data rendered by a 3D head model and real data using FRGC v2.0 data set. Experimental results show that the proposed method is robust to many scenarios that are encountered in common face recognition applications (e.g., surveillance). A high detection rate of 99.43% was obtained on FRGC v2.0 data set. Furthermore, the proposed method can be used to coarsely estimate the roll, yaw, and pitch angles of the face pose. 相似文献
65.
Mohammad Al Hasan Saeed Salem Mohammed J. Zaki 《Knowledge and Information Systems》2011,28(3):665-685
Clustering algorithms generally accept a parameter k from the user, which determines the number of clusters sought. However, in many application domains, like document categorization,
social network clustering, and frequent pattern summarization, the proper value of k is difficult to guess. An alternative clustering formulation that does not require k is to impose a lower bound on the similarity between an object and its corresponding cluster representative. Such a formulation chooses exactly one representative for
every cluster and minimizes the representative count. It has many additional benefits. For instance, it supports overlapping
clusters in a natural way. Moreover, for every cluster, it selects a representative object, which can be effectively used
in summarization or semi-supervised classification task. In this work, we propose an algorithm, SimClus, for clustering with lower bound on similarity. It achieves a O(log n) approximation bound on the number of clusters, whereas for the best previous algorithm the bound can be as poor as O(n). Experiments on real and synthetic data sets show that our algorithm produces more than 40% fewer representative objects,
yet offers the same or better clustering quality. We also propose a dynamic variant of the algorithm, which can be effectively
used in an on-line setting. 相似文献
66.
A generalized least absolute deviation method for parameter estimation of autoregressive signals 总被引:1,自引:0,他引:1
This paper proposes a generalized least absolute deviation (GLAD) method for parameter estimation of autoregressive (AR) signals under non-Gaussian noise environments. The proposed GLAD method can improve the accuracy of the estimation of the conventional least absolute deviation (LAD) method by minimizing a new cost function with parameter variables and noise error variables. Compared with second- and high-order statistical methods, the proposed GLAD method can obtain robustly an optimal AR parameter estimation without requiring the measurement noise to be Gaussian. Moreover, the proposed GLAD method can be implemented by a cooperative neural network (NN) which is shown to converge globally to the optimal AR parameter estimation within a finite time. Simulation results show that the proposed GLAD method can obtain more accurate estimates than several well-known estimation methods in the presence of different noise distributions. 相似文献
67.
Three-dimensional face recognition in the presence of facial expressions: an annotated deformable model approach 总被引:1,自引:0,他引:1
Kakadiaris IA Passalis G Toderici G Murtuza MN Lu Y Karampatziakis N Theoharis T 《IEEE transactions on pattern analysis and machine intelligence》2007,29(4):640-649
In this paper, we present the computational tools and a hardware prototype for 3D face recognition. Full automation is provided through the use of advanced multistage alignment algorithms, resilience to facial expressions by employing a deformable model framework, and invariance to 3D capture devices through suitable preprocessing steps. In addition, scalability in both time and space is achieved by converting 3D facial scans into compact metadata. We present our results on the largest known, and now publicly available, face recognition grand challenge 3D facial database consisting of several thousand scans. To the best of our knowledge, this is the highest performance reported on the FRGC v2 database for the 3D modality 相似文献
68.
This article proposes several two-timescale simulation-based actor-critic algorithms for solution of infinite horizon Markov
Decision Processes with finite state-space under the average cost criterion. Two of the algorithms are for the compact (non-discrete)
action setting while the rest are for finite-action spaces. On the slower timescale, all the algorithms perform a gradient
search over corresponding policy spaces using two different Simultaneous Perturbation Stochastic Approximation (SPSA) gradient
estimates. On the faster timescale, the differential cost function corresponding to a given stationary policy is updated and
an additional averaging is performed for enhanced performance. A proof of convergence to a locally optimal policy is presented.
Next, we discuss a memory efficient implementation that uses a feature-based representation of the state-space and performs
TD(0) learning along the faster timescale. The TD(0) algorithm does not follow an on-line sampling of states but is observed
to do well on our setting. Numerical experiments on a problem of rate based flow control are presented using the proposed
algorithms. We consider here the model of a single bottleneck node in the continuous time queueing framework. We show performance
comparisons of our algorithms with the two-timescale actor-critic algorithms of Konda and Borkar (1999) and Bhatnagar and Kumar (2004). Our algorithms exhibit more than an order of magnitude better performance over those of Konda and Borkar (1999).
相似文献
Shalabh Bhatnagar (Corresponding author)Email: |
69.
Zucker SW Leclerc YG Mohammed JL 《IEEE transactions on pattern analysis and machine intelligence》1981,(2):117-127
Relaxation labeling processes are a class of iterative algorithms for using contextual information to reduce local ambiguities. This paper introduces a new perspective toward relaxation-that of considering it as a process for reordering labels attached to nodes in a graph. This new perspective is used to establish the formal equivalence between relaxation and another widely used algorithm, local maxima selection. The equivalence specifies conditions under which a family of cooperative relaxation algorithms, which generalize the well-known ones, decompose into purely local ones. Since these conditions are also sufficient for guaranteeing the convergence of relaxation processes, they serve as stopping criteria. We feel that equivalences such as these are necessary for the proper application of relaxation and maxima selection in complex speech and vision understanding systems. 相似文献
70.
Hassen M. Yesuf Tena Alamirew Assefa M. Melesse Mohammed Assen 《Lakes & Reservoirs: Research and Management》2013,18(2):155-165
The generation of scientific information for improved understating of the physical dynamics of a lake is fundamental for guiding lake stakeholders and managers at the local level to implement best management practices and help design effective management strategies and policies at higher levels. Multitemporal bathymetric information on lakes is very important in hydrology and sediment studies to more clearly indicate environmental changes and to understand the effects of land processes on the hydrology of lakes. Accordingly, the purpose of this study was to map bathymetric charts of Lake Hayq 1 in Ethiopia and to derive morphometric parameters, including depth, volume, area, width and length, and to plot curves illustrating the relationships between these parameters. The bathymetric survey was carried out using a combination of a SonarLite Portable Echo Sounder and Global Positioning System (GPS) to generate three‐dimensional (XYZ) hydrographic data. Surfer 8.01 and ArcGIS 9.3 software program were used for surface, gridding and morphometric analyses. Comparison of the results of this study with a previous study conducted in 1941 indicated the lake has experienced changes in depth and surface area. To reduce the negative impacts of human‐induced activities on the ecohydrology of the lake, and to maintain its ecological integrity, appropriate and integrated lake management practices must be adopted. This will necessitate policy formulation, active lake basin stakeholder involvement and implementation of basin‐wide lake management to ensure sustainable use of the lake and its basin resources. 相似文献