全文获取类型
收费全文 | 2494篇 |
免费 | 169篇 |
国内免费 | 26篇 |
专业分类
电工技术 | 37篇 |
综合类 | 11篇 |
化学工业 | 638篇 |
金属工艺 | 68篇 |
机械仪表 | 114篇 |
建筑科学 | 118篇 |
矿业工程 | 3篇 |
能源动力 | 90篇 |
轻工业 | 235篇 |
水利工程 | 32篇 |
石油天然气 | 20篇 |
武器工业 | 3篇 |
无线电 | 307篇 |
一般工业技术 | 390篇 |
冶金工业 | 108篇 |
原子能技术 | 21篇 |
自动化技术 | 494篇 |
出版年
2023年 | 34篇 |
2022年 | 75篇 |
2021年 | 131篇 |
2020年 | 141篇 |
2019年 | 148篇 |
2018年 | 186篇 |
2017年 | 154篇 |
2016年 | 159篇 |
2015年 | 86篇 |
2014年 | 185篇 |
2013年 | 260篇 |
2012年 | 160篇 |
2011年 | 185篇 |
2010年 | 113篇 |
2009年 | 96篇 |
2008年 | 89篇 |
2007年 | 54篇 |
2006年 | 48篇 |
2005年 | 41篇 |
2004年 | 23篇 |
2003年 | 21篇 |
2002年 | 7篇 |
2001年 | 17篇 |
2000年 | 12篇 |
1999年 | 10篇 |
1998年 | 28篇 |
1997年 | 23篇 |
1996年 | 25篇 |
1995年 | 20篇 |
1994年 | 12篇 |
1993年 | 15篇 |
1992年 | 9篇 |
1991年 | 12篇 |
1990年 | 8篇 |
1989年 | 5篇 |
1988年 | 7篇 |
1987年 | 9篇 |
1986年 | 10篇 |
1985年 | 6篇 |
1984年 | 5篇 |
1983年 | 4篇 |
1982年 | 8篇 |
1981年 | 4篇 |
1980年 | 3篇 |
1979年 | 5篇 |
1975年 | 3篇 |
1973年 | 5篇 |
1971年 | 6篇 |
1970年 | 8篇 |
1969年 | 4篇 |
排序方式: 共有2689条查询结果,搜索用时 375 毫秒
41.
Automation of deburring and cleaning of castings is desirable for many reasons. The major reasons are dangerous working conditions, difficulties in finding workers for cleaning sections, and improved profitability. A suitable robot cell capable of using different tools, such as cup grinders, disc grinders and rotary files, is the solution. This robot should be completed with sensors in order to keep the quality of the cleaned surface at an acceptable level. Although using sensors simplifies both the programming and quality control there are still other problems that need to be solved. These involve selection of machining data, e.g. feeding rate and grinding force in a force controlled operation based on parameters such as tool type, disc grinder and geometry. In order to decrease the programming time, a process model for disc grinders has been developed. This article investigates this process model and pays attention to problems such as wavy or burned surfaces and the effect of a robot's repetition accuracy in the results obtained. Many aspects treated in this article are quite general, and can be applied in other types of grinding operations. 相似文献
42.
Harish Chintakunta Thanos Gentimis Rocio Gonzalez-Diaz Maria-Jose Jimenez Hamid Krim 《Pattern recognition》2015
In persistent homology, the persistence barcode encodes pairs of simplices meaning birth and death of homology classes. Persistence barcodes depend on the ordering of the simplices (called a filter) of the given simplicial complex. In this paper, we define the notion of “minimal” barcodes in terms of entropy. Starting from a given filtration of a simplicial complex K, an algorithm for computing a “proper” filter (a total ordering of the simplices preserving the partial ordering imposed by the filtration as well as achieving a persistence barcode with small entropy) is detailed, by way of computation, and subsequent modification, of maximum matchings on subgraphs of the Hasse diagram associated to K. Examples demonstrating the utility of computing such a proper ordering on the simplices are given. 相似文献
43.
Zara Hamid Faisal Bashir Hussain Jae-Young Pyun 《Multimedia Tools and Applications》2016,75(14):8195-8216
Wireless Multimedia Sensor Networks (WMSNs) consist of networks of interconnected devices involved in retrieving multimedia content, such as, video, audio, acoustic, and scalar data, from the environment. The goal of these networks is optimized delivery of multimedia content based on quality of service (QoS) parameters, such as delay, jitter and distortion. In multimedia communications each packet has strict playout deadlines, thus late arriving packets and lost packets are treated equally. It is a challenging task to guarantee soft delay deadlines along with energy minimization, in resource constrained, high data rate WMSNs. Conventional layered approach does not provide optimal solution for guaranteeing soft delay deadlines due to the large amount of overhead involved at each layer. Cross layer approach is fast gaining popularity, due to its ability to exploit the interdependence between different layers, to guarantee QoS constraints like latency, distortion, reliability, throughput and error rate. The paper presents a channel utilization and delay aware routing (CUDAR) protocol for WMSNs. This protocol is based on a cross-layer approach, which provides soft end-to-end delay guarantees along with efficient utilization of resources. Extensive simulation analysis of CUDAR shows that it provides better delay guarantees than existing protocols and consequently reduces jitter and distortion in WMSN communication. 相似文献
44.
M. Hariharan C.Y. Fook R. Sindhu Abdul Hamid Adom Sazali Yaacob 《Digital Signal Processing》2013,23(3):952-959
Dysfluency and stuttering are a break or interruption of normal speech such as repetition, prolongation, interjection of syllables, sounds, words or phrases and involuntary silent pauses or blocks in communication. Stuttering assessment through manual classification of speech dysfluencies is subjective, inconsistent, time consuming and prone to error. This paper proposes an objective evaluation of speech dysfluencies based on the wavelet packet transform with sample entropy features. Dysfluent speech signals are decomposed into six levels by using wavelet packet transform. Sample entropy (SampEn) features are extracted at every level of decomposition and they are used as features to characterize the speech dysfluencies (stuttered events). Three different classifiers such as k-nearest neighbor (kNN), linear discriminant analysis (LDA) based classifier and support vector machine (SVM) are used to investigate the performance of the sample entropy features for the classification of speech dysfluencies. 10-fold cross validation method is used for testing the reliability of the classifier results. The effect of different wavelet families on the classification performance is also performed. Experimental results demonstrate that the proposed features and classification algorithms give very promising classification accuracy of 96.67% with the standard deviation of 0.37 and also that the proposed method can be used to help speech language pathologist in classifying speech dysfluencies. 相似文献
45.
Mehdi Banitalebi Dehkordi Hamid Reza Abutalebi Mohammad Reza Taban 《Digital Signal Processing》2013,23(4):1239-1246
In this paper, we propose a source localization algorithm based on a sparse Fast Fourier Transform (FFT)-based feature extraction method and spatial sparsity. We represent the sound source positions as a sparse vector by discretely segmenting the space with a circular grid. The location vector is related to microphone measurements through a linear equation, which can be estimated at each microphone. For this linear dimensionality reduction, we have utilized a Compressive Sensing (CS) and two-level FFT-based feature extraction method which combines two sets of audio signal features and covers both short-time and long-time properties of the signal. The proposed feature extraction method leads to a sparse representation of audio signals. As a result, a significant reduction in the dimensionality of the signals is achieved. In comparison to the state-of-the-art methods, the proposed method improves the accuracy while the complexity is reduced in some cases. 相似文献
46.
Aminollah Mahabadi Hamid Sarbazi-Azad Ebrahim Khodaie Keivan Navi 《The Journal of supercomputing》2008,45(1):1-14
This paper proposes an efficient parallel algorithm for computing Lagrange interpolation on k-ary n-cube networks. This is done using the fact that a k-ary n-cube can be decomposed into n link-disjoint Hamiltonian cycles. Using these n link-disjoint cycles, we interpolate Lagrange polynomial using full bandwidth of the employed network. Communication in the
main phase of the algorithm is based on an all-to-all broadcast algorithm on the n link-disjoint Hamiltonian cycles exploiting all network channels, and thus, resulting in high-efficiency in using network
resources. A performance evaluation of the proposed algorithm reveals an optimum speedup for a typical range of system parameters
used in current state-of-the-art implementations.
相似文献
Hamid Sarbazi-AzadEmail: Email: |
47.
Hamid Noori Farhad Mehdipour Kazuaki Murakami Koji Inoue Morteza Saheb Zamani 《The Journal of supercomputing》2008,45(3):313-340
To improve the performance of embedded processors, an effective technique is collapsing critical computation subgraphs as
application-specific instruction set extensions and executing them on custom functional units. The problem with this approach
is the immense cost and the long times required to design a new processor for each application. As a solution to this issue,
we propose an adaptive extensible processor in which custom instructions (CIs) are generated and added after chip-fabrication.
To support this feature, custom functional units are replaced by a reconfigurable matrix of functional units (FUs). A systematic
quantitative approach is used for determining the appropriate structure of the reconfigurable functional unit (RFU). We also
introduce an integrated framework for generating mappable CIs on the RFU. Using this architecture, performance is improved
by up to 1.33, with an average improvement of 1.16, compared to a 4-issue in-order RISC processor. By partitioning the configuration
memory, detecting similar/subset CIs and merging small CIs, the size of the configuration memory is reduced by 40%. 相似文献
48.
About 20 years ago, Markus and Robey noted that most research on IT impacts had been guided by deterministic perspectives and had neglected to use an emergent perspective, which could account for contradictory findings. They further observed that most research in this area had been carried out using variance theories at the expense of process theories. Finally, they suggested that more emphasis on multilevel theory building would likely improve empirical reliability. In this paper, we reiterate the observations and suggestions made by Markus and Robey on the causal structure of IT impact theories and carry out an analysis of empirical research published in four major IS journals, Management Information Systems Quarterly (MISQ), Information Systems Research (ISR), the European Journal of Information Systems (EJIS), and Information and Organization (I&O), to assess compliance with those recommendations. Our final sample consisted of 161 theory-driven articles, accounting for approximately 21% of all the empirical articles published in these journals. Our results first reveal that 91% of the studies in MISQ, ISR, and EJIS focused on deterministic theories, while 63% of those in I&O adopted an emergent perspective. Furthermore, 91% of the articles in MISQ, ISR, and EJIS adopted a variance model; this compares with 71% from I&O that applied a process model. Lastly, mixed levels of analysis were found in 14% of all the surveyed articles. Implications of these findings for future research are discussed. 相似文献
49.
A Randomized Algorithm for Online Unit Clustering 总被引:1,自引:0,他引:1
In this paper, we consider the online version of the following problem: partition a set of input points into subsets, each enclosable by a unit ball, so as to minimize the number of subsets used. In the one-dimensional case, we show that surprisingly the naïve upper bound of 2 on the competitive ratio can be beaten: we present a new randomized 15/8-competitive online algorithm. We also provide some lower bounds and an extension to higher dimensions. 相似文献
50.
We study the problem of stabilizing a distributed linear system on a subregion of its geometrical domain. We are concerned with two methods: the first approach enables us to characterize a stabilizing control via the steady state Riccati equation, and the second one is based on decomposing the state space into two suitable subspaces and studying the projections of the initial system onto such subspaces. The obtained results are performed through various examples. 相似文献