全文获取类型
收费全文 | 283096篇 |
免费 | 31999篇 |
国内免费 | 18491篇 |
专业分类
电工技术 | 22117篇 |
技术理论 | 31篇 |
综合类 | 31436篇 |
化学工业 | 28302篇 |
金属工艺 | 10676篇 |
机械仪表 | 16571篇 |
建筑科学 | 31673篇 |
矿业工程 | 13446篇 |
能源动力 | 9460篇 |
轻工业 | 16472篇 |
水利工程 | 11670篇 |
石油天然气 | 12468篇 |
武器工业 | 4349篇 |
无线电 | 25605篇 |
一般工业技术 | 20291篇 |
冶金工业 | 11961篇 |
原子能技术 | 1929篇 |
自动化技术 | 65129篇 |
出版年
2024年 | 1303篇 |
2023年 | 3858篇 |
2022年 | 7538篇 |
2021年 | 9585篇 |
2020年 | 9420篇 |
2019年 | 7392篇 |
2018年 | 7044篇 |
2017年 | 8635篇 |
2016年 | 10587篇 |
2015年 | 11859篇 |
2014年 | 19611篇 |
2013年 | 17616篇 |
2012年 | 21427篇 |
2011年 | 23452篇 |
2010年 | 17718篇 |
2009年 | 18108篇 |
2008年 | 17234篇 |
2007年 | 20311篇 |
2006年 | 17738篇 |
2005年 | 15244篇 |
2004年 | 12592篇 |
2003年 | 10730篇 |
2002年 | 8580篇 |
2001年 | 6990篇 |
2000年 | 5999篇 |
1999年 | 4697篇 |
1998年 | 3434篇 |
1997年 | 2947篇 |
1996年 | 2360篇 |
1995年 | 1938篇 |
1994年 | 1666篇 |
1993年 | 1194篇 |
1992年 | 1000篇 |
1991年 | 669篇 |
1990年 | 621篇 |
1989年 | 551篇 |
1988年 | 325篇 |
1987年 | 228篇 |
1986年 | 193篇 |
1985年 | 228篇 |
1984年 | 159篇 |
1983年 | 138篇 |
1982年 | 85篇 |
1981年 | 93篇 |
1980年 | 105篇 |
1979年 | 48篇 |
1978年 | 34篇 |
1977年 | 31篇 |
1975年 | 26篇 |
1959年 | 40篇 |
排序方式: 共有10000条查询结果,搜索用时 281 毫秒
61.
We present an optimization-based unsupervised approach to automatic document summarization. In the proposed approach, text summarization is modeled as a Boolean programming problem. This model generally attempts to optimize three properties, namely, (1) relevance: summary should contain informative textual units that are relevant to the user; (2) redundancy: summaries should not contain multiple textual units that convey the same information; and (3) length: summary is bounded in length. The approach proposed in this paper is applicable to both tasks: single- and multi-document summarization. In both tasks, documents are split into sentences in preprocessing. We select some salient sentences from document(s) to generate a summary. Finally, the summary is generated by threading all the selected sentences in the order that they appear in the original document(s). We implemented our model on multi-document summarization task. When comparing our methods to several existing summarization methods on an open DUC2005 and DUC2007 data sets, we found that our method improves the summarization results significantly. This is because, first, when extracting summary sentences, this method not only focuses on the relevance scores of sentences to the whole sentence collection, but also the topic representative of sentences. Second, when generating a summary, this method also deals with the problem of repetition of information. The methods were evaluated using ROUGE-1, ROUGE-2 and ROUGE-SU4 metrics. In this paper, we also demonstrate that the summarization result depends on the similarity measure. Results of the experiment showed that combination of symmetric and asymmetric similarity measures yields better result than their use separately. 相似文献
62.
63.
Reliability based criteria are quite popular for optimal sensor network design. We present a modified definition of system reliability for sensor network design for two applications: reliable estimation of variables in a steady state linear flow process, and reliable fault detection and diagnosis for any process. Unlike the weakest-link based definition of system reliability in the literature, the proposed definition considers the entire system and is consistent with the reliability concept used in classical reliability literature. For each application, dual approaches for defining system reliability are proposed, and their analogy with the reliability problem in the classical reliability literature is established. Using examples and stochastic simulations, the advantage of using the proposed system reliability in contrast to the existing definition is illustrated. Part II of this series of articles presents methods for efficient generation of the system reliability function and its use in optimization-based approaches for designing optimal sensor networks. 相似文献
64.
Fault detection and isolation in water distribution networks is an active topic due to the nonlinearities of flow propagation and recent increases in data availability due to sensor deployment. Here, we propose an efficient two-step data driven alternative: first, we perform sensor placement taking the network topology into account; second, we use incoming sensor data to build a network model through online dictionary learning. Online learning is fast and allows tackling large networks as it processes small batches of signals at a time. This brings the benefit of continuous integration of new data into the existing network model, either in the beginning for training or in production when new data samples are gathered. The proposed algorithms show good performance in our simulations on both small and large-scale networks. 相似文献
65.
一种北斗联合低轨星座的导航增强方法研究 总被引:1,自引:0,他引:1
单纯依靠北斗导航系统提供定位导航授时服务,存在卫星信号落地功率低、易受遮蔽和阻断的不足。针对此问题,研究了一种北斗联合低轨星座实现导航增强的系统架构;提出了一种新的适应严重遮蔽或干扰条件下,基于到达时间(TOA)和到达频率(FOA)联合观测的定位解算算法;对高中低轨混合星座条件下的覆盖特性和精度衰减因子进行了仿真分析。分析结果表明,用户可见星数平均增加了64.2%,位置精度衰减因子(PDOP)平均改善了28.7%。研究结果可为下一代北斗的论证设计与研制建设提供参考借鉴。 相似文献
66.
Steganography is the science of hiding secret message in an appropriate digital multimedia in such a way that the existence of the embedded message should be invisible to anyone apart from the sender or the intended recipient. This paper presents an irreversible scheme for hiding a secret image in the cover image that is able to improve both the visual quality and the security of the stego-image while still providing a large embedding capacity. This is achieved by a hybrid steganography scheme incorporates Noise Visibility Function (NVF) and an optimal chaotic based encryption scheme. In the embedding process, first to reduce the image distortion and to increase the embedding capacity, the payload of each region of the cover image is determined dynamically according to NVF. NVF analyzes the local image properties to identify the complex areas where more secret bits should be embedded. This ensures to maintain a high visual quality of the stego-image as well as a large embedding capacity. Second, the security of the secret image is brought about by an optimal chaotic based encryption scheme to transform the secret image into an encrypted image. Third, the optimal chaotic based encryption scheme is achieved by using a hybrid optimization of Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) which is allowing us to find an optimal secret key. The optimal secret key is able to encrypt the secret image so as the rate of changes after embedding process be decreased which results in increasing the quality of the stego-image. In the extracting process, the secret image can be extracted from the stego-image losslessly without referring to the original cover image. The experimental results confirm that the proposed scheme not only has the ability to achieve a good trade-off between the payload and the stego-image quality, but also can resist against the statistics and image processing attacks. 相似文献
67.
文章通过对黑龙江省高效节水现状,存在问题的分析,结合黑龙江省高效节水发展的支撑能力,阐述黑龙江省节水增粮目标、任务及总体布局,为黑龙江省2012—2015年节水增粮实施提供依据。 相似文献
68.
Robert Brooke Manrico Fabretto Samuel Pering Eliza Switalska Lachlan Reeks Drew Evans Peter Murphy 《应用聚合物科学杂志》2015,132(26)
A study using three different pairs of electrochromic polymers (ECPs) synthesized onto plaques by means of a modified vapor phase polymerization (VPP) technique is presented. Restriction of the respective polymerization times, allowed both faster and slower polymerizing monomers to be controlled, and produced blended plaques with visually diffuse interfaces. The ECPs within the blended plaques retain their individual electrochromic behavior and when encapsulated into an electrochromic device, show outstanding optical switching performance with little degradation evident over 10,000 cycles, coupled with a switching time of the order of 1 second. Blends also allow multiple diffuse color changes within an electrochromic device, due to the difference in oxidation potentials of the individual ECPs, making them candidates for adaptive camouflage use. © 2015 Wiley Periodicals, Inc. J. Appl. Polym. Sci. 2015 , 132, 42158. 相似文献
69.
Data fitting with B-splines is a challenging problem in reverse engineering for CAD/CAM, virtual reality, data visualization, and many other fields. It is well-known that the fitting improves greatly if knots are considered as free variables. This leads, however, to a very difficult multimodal and multivariate continuous nonlinear optimization problem, the so-called knot adjustment problem. In this context, the present paper introduces an adapted elitist clonal selection algorithm for automatic knot adjustment of B-spline curves. Given a set of noisy data points, our method determines the number and location of knots automatically in order to obtain an extremely accurate fitting of data. In addition, our method minimizes the number of parameters required for this task. Our approach performs very well and in a fully automatic way even for the cases of underlying functions requiring identical multiple knots, such as functions with discontinuities and cusps. To evaluate its performance, it has been applied to three challenging test functions, and results have been compared with those from other alternative methods based on AIS and genetic algorithms. Our experimental results show that our proposal outperforms previous approaches in terms of accuracy and flexibility. Some other issues such as the parameter tuning, the complexity of the algorithm, and the CPU runtime are also discussed. 相似文献
70.