全文获取类型
收费全文 | 313219篇 |
免费 | 29608篇 |
国内免费 | 18794篇 |
专业分类
电工技术 | 22735篇 |
技术理论 | 9篇 |
综合类 | 24527篇 |
化学工业 | 44382篇 |
金属工艺 | 20055篇 |
机械仪表 | 20641篇 |
建筑科学 | 20867篇 |
矿业工程 | 9702篇 |
能源动力 | 7483篇 |
轻工业 | 26940篇 |
水利工程 | 8528篇 |
石油天然气 | 13969篇 |
武器工业 | 2959篇 |
无线电 | 33338篇 |
一般工业技术 | 38470篇 |
冶金工业 | 16776篇 |
原子能技术 | 7736篇 |
自动化技术 | 42504篇 |
出版年
2024年 | 1633篇 |
2023年 | 4698篇 |
2022年 | 10386篇 |
2021年 | 13560篇 |
2020年 | 10092篇 |
2019年 | 7623篇 |
2018年 | 8949篇 |
2017年 | 10044篇 |
2016年 | 9107篇 |
2015年 | 12093篇 |
2014年 | 15578篇 |
2013年 | 18499篇 |
2012年 | 21548篇 |
2011年 | 22612篇 |
2010年 | 21143篇 |
2009年 | 20297篇 |
2008年 | 20753篇 |
2007年 | 20065篇 |
2006年 | 17485篇 |
2005年 | 14776篇 |
2004年 | 11000篇 |
2003年 | 8673篇 |
2002年 | 8447篇 |
2001年 | 7903篇 |
2000年 | 6595篇 |
1999年 | 4346篇 |
1998年 | 2917篇 |
1997年 | 2441篇 |
1996年 | 2150篇 |
1995年 | 1868篇 |
1994年 | 1556篇 |
1993年 | 1371篇 |
1992年 | 1303篇 |
1991年 | 1140篇 |
1990年 | 1147篇 |
1989年 | 1082篇 |
1988年 | 945篇 |
1987年 | 881篇 |
1986年 | 802篇 |
1985年 | 737篇 |
1984年 | 714篇 |
1981年 | 696篇 |
1979年 | 760篇 |
1978年 | 781篇 |
1977年 | 745篇 |
1976年 | 762篇 |
1975年 | 717篇 |
1974年 | 723篇 |
1973年 | 724篇 |
1972年 | 710篇 |
排序方式: 共有10000条查询结果,搜索用时 46 毫秒
991.
于春雪 《单片机与嵌入式系统应用》2012,12(5):56-59
为了有效地节省语音数据的传输带宽和存储系统的磁盘空间,需要在保证语音质量的前提下尽可能降低其编码比特率。本设计采用经过优化的G.729语音压缩编译码算法,以ARM处理器为载体,开发的嵌入式语音存储系统可实现语音信号的海量存储,而且处理速度快、可靠性好、扩展方便。通过严格的测试和评估,该系统能够实现对大量语音数据的压缩和记录,各项指标基本达到了预期的水平。 相似文献
992.
Yu. A. Zack 《Cybernetics and Systems Analysis》2012,48(1):51-66
The paper considers the properties of feasible and optimal scheduling of jobs on one machine under constraints on the terms
of the beginning and completion of jobs and on partial sequences of job performance. The established properties and the lower-bound
estimates of the length of the optimal schedule are used to develop methods for the exact and approximate solutions of the
formulated problem by sequential optimization algorithms. The proposed algorithms are illustrated by numerical examples and
can be successfully applied to solve these problems in the absence of constraints. 相似文献
993.
M. Yu. Khomyakov 《Pattern Recognition and Image Analysis》2012,22(2):291-302
A comparative evaluation of the most commonly used linear methods for edge detection in grayscale images are presented. Detectors based on the first and second derivatives of image brightness are considered. The method for automatic edge tracking in grayscale images is proposed. The model for assessing errors and artifacts caused by sampling during digitization of real input images is proposed. Investigation of edge detectors isotropy and errors caused by input images sampling is conducted. The advantage of the Isotropic operator for edge tracking is shown. The noise immunity of linear edge detection methods is assessed and the superiority of 3 × 3 gradient operators for noisy images is shown. Isotropic and Sobel operators are identified to be optimal on a basis of sampling errors, output noise level, and computational complexity. 相似文献
994.
S. N. Evdokimov S. I. Klimanov A. N. Korchagin E. A. Mikrin Yu. G. Sikharulidze 《Journal of Computer and Systems Sciences International》2012,51(6):802-817
Results concerning the terminal guidance algorithm at the reentry of the descent module into the Earth atmosphere are presented. This algorithm simultaneously eliminates predicted deviations in the downrange and crossrange directions. The restriction on the tolerable load factor n ?? 3 is taken into account. Three reentry angles are analyzed: the medium angle ?1.5°, the steep angle ?1.9°, and the flat angle ?1.2°. The motion of the descent module is considered in the disturbed Earth atmosphere represented by the TsNIIMash model. This model includes variations of the atmosphere density and the wind field. It is demonstrated that, depending on the reentry angle, the proposed algorithm guarantees the downrange maneuver zone in the range 1240?C1890 km and the crossrange maneuver zone of 210?C220 km on one side. The maximum guidance error at the altitude of 1 km does not exceed 0.8 km, and the average error is 0.1 km. The algorithm uses up to three bank angle reversals and uses the numerical prediction of the remaining part of the trajectory when choosing the guidance parameters. The concept of the automatic adjustment of the bank angle reference function depending on the entry angle and the prescribed distance to the target point in the maneuver zone is formulated. 相似文献
995.
In this paper, we present a robust and accurate algorithm for interactive image segmentation. The level set method is clearly advantageous for image objects with a complex topology and fragmented appearance. Our method integrates discriminative classification models and distance transforms with the level set method to avoid local minima and better snap to true object boundaries. The level set function approximates a transformed version of pixelwise posterior probabilities of being part of a target object. The evolution of its zero level set is driven by three force terms, region force, edge field force, and curvature force. These forces are based on a probabilistic classifier and an unsigned distance transform of salient edges. We further propose a technique that improves the performance of both the probabilistic classifier and the level set method over multiple passes. It makes the final object segmentation less sensitive to user interactions. Experiments and comparisons demonstrate the effectiveness of our method. 相似文献
996.
997.
Cloud computing has become a promising paradigm as next generation computing model, by providing computation, software, data access, and storage services that do not need to know the location of physical resources interconnected across the globe providing such services. In such an environment, important issues as information sharing and resource/service discovery arise. In order to overcome critical limitations in centralized approaches for information sharing and resource/service discovery, this paper proposes a framework of a scalable multi-attribute hybrid overlay featured with decentralized information sharing, flexible resource/service discovery, fault tolerance and load balancing. Additionally, the proposed hybrid overlay integrates a structured P2P system with an unstructured one to support complex queries. Mechanisms such as load balancing and fault tolerance implemented in our proposed system to improve the overall system performance are also discussed. Experimental results show that the performance of the proposed approach is feasible and stable, as the proposed hybrid overlay improves system performance by reducing the number of routing hops and balancing the load by migrating requests. 相似文献
998.
In this paper, we develop a framework of Question Answering Pages (referred to as QA pages) recommendation. Our proposed framework consists of the two modules: the off-line module to determine the importance of QA pages and the on-line module for on-line QA page recommendation. In the off-line module, we claim that the importance of QA pages could be discovered from user click streams. If the QA pages are of higher importance, many users will click and spend their time on these QA pages. Moreover, the relevant relationships among QA pages are captured by the browsing behavior on these QA pages. As such, we exploit user click streams to model the browsing behavior among QA pages as QA browsing graph structures. The importance of QA pages is derived from our proposed QA browsing graph structures. However, we observe that the QA browsing graph is sparse and that most of the QA pages do not link to other QA pages. This is referred to as a sparsity problem. To overcome this problem, we utilize the latent browsing relations among QA pages to build a QA Latent Browsing Graph. In light of QA latent browsing graph, the importance score of QA pages (referred to as Latent Browsing Rank) and the relevance score of QA pages (referred to as Latent Browsing Recommendation Rank) are proposed. These scores demonstrate the use of a QA latent browsing graph not only to determine the importance of QA pages but also to recommend QA pages. We conducted extensive empirical experiments on Yahoo! Asia Knowledge Plus to evaluate our proposed framework. 相似文献
999.
This paper studies optimal path problems integrated with the concept of second order stochastic dominance. These problems arise from applications where travelers are concerned with the trade off between the risks associated with random travel time and other travel costs. Risk-averse behavior is embedded by requiring the random travel times on the optimal paths to stochastically dominate that on a benchmark path in the second order. A general linear operating cost is introduced to combine link- and path-based costs. The latter, which is the focus of the paper, is employed to address schedule costs pertinent to late and early arrival. An equivalent integer program to the problem is constructed by transforming the stochastic dominance constraint into a finite number of linear constraints. The problem is solved using both off-the-shelf solvers and specialized algorithms based on dynamic programming (DP). Although neither approach ensures satisfactory performance for general large-scale problems, the numerical experiments indicate that the DP-based approach provides a computationally feasible option to solve medium-size instances (networks with several thousand links) when correlations among random link travel times can be ignored. 相似文献
1000.
In recent years, the proliferation of the world wide web has lead to an increase in a number of applications such as search, social networks and auctions, whose success depends critically upon the number of users of that service. Two examples of such applications are internet auctions and social networks. One of the characteristics of online auctions is that a successful implementation requires a high volume of buyers and sellers at its website. Consequently, auction sites which have a high volume of traffic have an advantage over those in which the volume is limited. This results in even greater polarization of buyers and sellers towards a particular site. The same is true for social networks in which greater use of a given social network increases the use from other participants on the network. This is often referred to as the “network effect” in a variety of interaction-centric applications in networks. While this effect has qualitatively been known to increase the value of the overall network, its effect has never been modeled or studied rigorously. In this paper, we construct a Markov model to analyze the network effect in the case of two important classes of web applications. These correspond to auctions and social networks. We show that the network effect is very powerful and can result in a situation in which an auction or a social networking site can quickly overwhelm its competing sites. Thus, the results of this paper show the tremendous power of the network effect for Web 2.0 applications. 相似文献