全文获取类型
收费全文 | 5411篇 |
免费 | 358篇 |
国内免费 | 31篇 |
专业分类
电工技术 | 106篇 |
综合类 | 5篇 |
化学工业 | 1545篇 |
金属工艺 | 176篇 |
机械仪表 | 148篇 |
建筑科学 | 221篇 |
矿业工程 | 12篇 |
能源动力 | 282篇 |
轻工业 | 553篇 |
水利工程 | 40篇 |
石油天然气 | 91篇 |
无线电 | 531篇 |
一般工业技术 | 995篇 |
冶金工业 | 331篇 |
原子能技术 | 37篇 |
自动化技术 | 727篇 |
出版年
2023年 | 56篇 |
2022年 | 150篇 |
2021年 | 190篇 |
2020年 | 152篇 |
2019年 | 215篇 |
2018年 | 303篇 |
2017年 | 218篇 |
2016年 | 233篇 |
2015年 | 185篇 |
2014年 | 219篇 |
2013年 | 474篇 |
2012年 | 266篇 |
2011年 | 330篇 |
2010年 | 286篇 |
2009年 | 284篇 |
2008年 | 257篇 |
2007年 | 178篇 |
2006年 | 195篇 |
2005年 | 123篇 |
2004年 | 117篇 |
2003年 | 153篇 |
2002年 | 112篇 |
2001年 | 84篇 |
2000年 | 97篇 |
1999年 | 79篇 |
1998年 | 116篇 |
1997年 | 68篇 |
1996年 | 56篇 |
1995年 | 48篇 |
1994年 | 37篇 |
1993年 | 34篇 |
1992年 | 21篇 |
1991年 | 29篇 |
1990年 | 20篇 |
1989年 | 21篇 |
1988年 | 25篇 |
1987年 | 41篇 |
1986年 | 23篇 |
1985年 | 25篇 |
1984年 | 24篇 |
1983年 | 25篇 |
1982年 | 15篇 |
1981年 | 18篇 |
1980年 | 25篇 |
1979年 | 14篇 |
1978年 | 20篇 |
1977年 | 22篇 |
1976年 | 26篇 |
1975年 | 21篇 |
1973年 | 18篇 |
排序方式: 共有5800条查询结果,搜索用时 15 毫秒
91.
92.
Tzu-Chia Chen Ngakan Ketut Acwin Dwijendra Saurabh Singhal R. Sivaraman Amr Mamdouh 《计算机、材料和连续体(英文)》2023,75(2):3159-3169
A smart city incorporates infrastructure methods that are environmentally responsible, such as smart communications, smart grids, smart energy, and smart buildings. The city administration has prioritized the use of cutting-edge technology and informatics as the primary strategy for enhancing service quality, with energy resources taking precedence. To achieve optimal energy management in the multidimensional system of a city tribe, it is necessary not only to identify and study the vast majority of energy elements, but also to define their implicit interdependencies. This is because optimal energy management is required to reach this objective. The lighting index is an essential consideration when evaluating the comfort indicators. In order to realize the concept of a smart city, the primary objective of this research is to create a system for managing and monitoring the lighting index. It is possible to identify two distinct phases within the intelligent system. Once data collection concludes, the monitoring system will be activated. In the second step, the operation of the control system is analyzed and its effect on the performance of the numerical model is determined. This evaluation is based on the proposed methodology. The optimized results were deemed satisfactory because they maintained the brightness index value (79%) while consuming less energy. The intelligent implementation system generated satisfactory outcomes, which were observed 1.75 times on average. 相似文献
93.
Shiming He Meng Guo Bo Yang Osama Alfarraj Amr Tolba Pradip Kumar Sharma Xi’ai Yan 《计算机、材料和连续体(英文)》2023,75(3):5027-5047
Sensors produce a large amount of multivariate time series data to record the states of Internet of Things (IoT) systems. Multivariate time series timestamp anomaly detection (TSAD) can identify timestamps of attacks and malfunctions. However, it is necessary to determine which sensor or indicator is abnormal to facilitate a more detailed diagnosis, a process referred to as fine-grained anomaly detection (FGAD). Although further FGAD can be extended based on TSAD methods, existing works do not provide a quantitative evaluation, and the performance is unknown. Therefore, to tackle the FGAD problem, this paper first verifies that the TSAD methods achieve low performance when applied to the FGAD task directly because of the excessive fusion of features and the ignoring of the relationship’s dynamic changes between indicators. Accordingly, this paper proposes a multivariate time series fine-grained anomaly detection (MFGAD) framework. To avoid excessive fusion of features, MFGAD constructs two sub-models to independently identify the abnormal timestamp and abnormal indicator instead of a single model and then combines the two kinds of abnormal results to detect the fine-grained anomaly. Based on this framework, an algorithm based on Graph Attention Neural Network (GAT) and Attention Convolutional Long-Short Term Memory (A-ConvLSTM) is proposed, in which GAT learns temporal features of multiple indicators to detect abnormal timestamps and A-ConvLSTM captures the dynamic relationship between indicators to identify abnormal indicators. Extensive simulations on a real-world dataset demonstrate that the proposed algorithm can achieve a higher F1 score and hit rate than the extension of existing TSAD methods with the benefit of two independent sub-models for timestamp and indicator detection. 相似文献
94.
95.
Spectral Measurement of the Film-Substrate Index Difference in Proton-Exchanged LiNbO(3) Waveguides 总被引:1,自引:0,他引:1
El Hadi K Rastogi V Shenoy MR Thyagarajan K De Micheli M Ostrowsky DB 《Applied optics》1998,37(27):6463-6467
We report the spectral characterization of proton-exchanged lithium niobate (PE:LiNbO(3)) waveguides in terms of the variation of the refractive-index difference between the waveguiding layer and the substrate. The dispersion of the extraordinary refractive-index increase (deltan(e)) is measured from 405 to 1319 nm with several light sources. Two types of proton-exchanged waveguide, prepared under different conditions, are studied. These measurements should be of use in the optimization of PE:LiNbO(3) waveguides for nonlinear optical applications, particularly in second-harmonic generation in the blue-green wavelength region. 相似文献
96.
A growing number of patients are recognised to have chronic kidney disease (CKD). However, only a minority will progress to end-stage renal disease requiring dialysis or transplantation. Currently available diagnostic and staging tools frequently fail to identify those at higher risk of progression or death. Furthermore within specific disease entities there are shortcomings in the prediction of the need for therapeutic interventions or the response to different forms of therapy. Kidney and urine proteomic biomarkers are considered as promising diagnostic tools to predict CKD progression early in diabetic nephropathy, facilitating timely and selective intervention that may reduce the related health-care expenditures. However, independent groups have not validated these findings and the technique is not currently available for routine clinical care. Furthermore, there are gaps in our understanding of predictors of progression or need for therapy in non-diabetic CKD. Presumably, a combination of tissue and urine biomarkers will be more informative than individual markers. This review identifies clinical questions in need of an answer, summarises current information on proteomic biomarkers and CKD, and describes the European Kidney and Urine Proteomics initiative that has been launched to carry out a clinical study aimed at identifying urinary proteomic biomarkers distinguishing between fast and slow progressors among patients with biopsy-proven primary glomerulopathies. 相似文献
97.
A. El Hamidi Author Vitae M. Ménard Author Vitae M. Lugiez Author Vitae C. Ghannam Author Vitae 《Pattern recognition》2010,43(4):1564-163
In various information processing tasks obtaining regularized versions of a noisy or corrupted image data is often a prerequisite for successful use of classical image analysis algorithms. Image restoration and decomposition methods need to be robust if they are to be useful in practice. In particular, this property has to be verified in engineering and scientific applications. By robustness, we mean that the performance of an algorithm should not be affected significantly by small deviations from the assumed model. In image processing, total variation (TV) is a powerful tool to increase robustness. In this paper, we define several concepts that are useful in robust restoration and robust decomposition. We propose two extended total variation models, weighted total variation (WTV) and extended total variation (ETV). We state generic approaches. The idea is to replace the TV penalty term with more general terms. The motivation is to increase the robustness of ROF (Rudin, Osher, Fatemi) model and to prevent the staircasing effect due to this method. Moreover, rewriting the non-convex sublinear regularizing terms as WTV, we provide a new approach to perform minimization via the well-known Chambolle's algorithm. The implementation is then more straightforward than the half-quadratic algorithm. The behavior of image decomposition methods is also a challenging problem, which is closely related to anisotropic diffusion. ETV leads to an anisotropic decomposition close to edges improving the robustness. It allows to respect desired geometric properties during the restoration, and to control more precisely the regularization process. We also discuss why compression algorithms can be an objective method to evaluate the image decomposition quality. 相似文献
98.
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. 相似文献
99.
We describe a quasi-Monte Carlo method for the simulation of discrete time Markov chains with continuous multi-dimensional state space. The method simulates copies of the chain in parallel. At each step the copies are reordered according to their successive coordinates. We prove the convergence of the method when the number of copies increases. We illustrate the method with numerical examples where the simulation accuracy is improved by large factors compared with Monte Carlo simulation. 相似文献
100.