全文获取类型
收费全文 | 260726篇 |
免费 | 19451篇 |
国内免费 | 10002篇 |
专业分类
电工技术 | 13795篇 |
技术理论 | 28篇 |
综合类 | 15584篇 |
化学工业 | 44171篇 |
金属工艺 | 14558篇 |
机械仪表 | 16059篇 |
建筑科学 | 19094篇 |
矿业工程 | 8175篇 |
能源动力 | 7517篇 |
轻工业 | 15455篇 |
水利工程 | 4007篇 |
石油天然气 | 17447篇 |
武器工业 | 1772篇 |
无线电 | 30010篇 |
一般工业技术 | 31820篇 |
冶金工业 | 15373篇 |
原子能技术 | 2610篇 |
自动化技术 | 32704篇 |
出版年
2024年 | 1082篇 |
2023年 | 4151篇 |
2022年 | 7208篇 |
2021年 | 10086篇 |
2020年 | 7851篇 |
2019年 | 6662篇 |
2018年 | 7474篇 |
2017年 | 8309篇 |
2016年 | 7479篇 |
2015年 | 9771篇 |
2014年 | 12495篇 |
2013年 | 15208篇 |
2012年 | 15977篇 |
2011年 | 17519篇 |
2010年 | 15079篇 |
2009年 | 14394篇 |
2008年 | 14113篇 |
2007年 | 13443篇 |
2006年 | 13791篇 |
2005年 | 11907篇 |
2004年 | 8292篇 |
2003年 | 7344篇 |
2002年 | 6813篇 |
2001年 | 6028篇 |
2000年 | 6189篇 |
1999年 | 7094篇 |
1998年 | 6341篇 |
1997年 | 5090篇 |
1996年 | 4726篇 |
1995年 | 3933篇 |
1994年 | 3173篇 |
1993年 | 2285篇 |
1992年 | 1772篇 |
1991年 | 1435篇 |
1990年 | 1152篇 |
1989年 | 932篇 |
1988年 | 700篇 |
1987年 | 488篇 |
1986年 | 403篇 |
1985年 | 321篇 |
1984年 | 248篇 |
1983年 | 187篇 |
1982年 | 190篇 |
1981年 | 157篇 |
1980年 | 150篇 |
1979年 | 84篇 |
1978年 | 86篇 |
1977年 | 78篇 |
1976年 | 111篇 |
1975年 | 52篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
随着信息化和网络技术的不断发展,以计算机为工具来盗取用户信息的犯罪日益增加。尤其是通过网络窃取上网计算机涉密信息,已经成为国内外不法分子窃取我国秘密信息的重要手段。本文对国内外计算机窃密与反窃密技术的各种手段进行研究与分析,并通过理论与实际的相结合,提出安全与实用并重的防范措施。 相似文献
992.
Chun‐Wei Liu Chi‐Hung Lee Shih‐Chieh Lin 《Journal of the Society for Information Display》2012,20(12):646-652
This study proposes a roll‐to‐roll process‐based sub‐wavelength grating, which is attached on a light bar to turn the side‐lit red/green/blue (620, 520, and 450 nm) incident rays into a uniformly and normally output white light with high illuminance from the light bar's surface. On the basis of the rigorous coupling wave analysis, the relationship between the first‐order transmission/reflection efficiency and the pitch of the gratings with different shapes was analyzed. The optimal design can effectively reduce the coupling length and enhance the white color balance for display applications. 相似文献
993.
Gary Gibson Xia Sheng Dick Henze Si‐Ty Lam Patricia Beck Yoocharn Jeon Zhang‐Lin Zhou Brad Benson Qin Liu Gregg Combs Tim Koch Kent Biggs 《Journal of the Society for Information Display》2012,20(10):552-558
Reflective displays are advantageous in applications requiring low power or daylight readability. However, there are no low‐cost reflective technologies capable of displaying bright colors. By employing photoluminescence to more efficiently use ambient light, we created a prototype display that provides bright, full color in a simple, low‐cost architecture. This prototype includes a novel electrokinetic shutter, a layer that incorporates patterned luminescent red, green, and blue sub‐pixel elements, and a novel optical out‐coupling scheme. The luminescent elements convert otherwise‐wasted portions of the incident spectrum to light in the desired color band, resulting in improved color saturation and lightness. This prototype provides a color gamut that is superior to competing reflective display technologies that utilize color filters in single‐layer side‐by‐side sub‐pixel architectures. The current prototype is capable of switching in <0.5 s; future displays based on an alternative electro‐optic shutter technology should achieve video rate operation. A transflective version of this technology has also been prototyped. The transflective version utilizes its backlight with a power efficiency that is at least three times that of a conventional liquid crystal display. These photoluminescence‐based technologies enable a host of applications ranging from low‐power mobile products and retail pricing signage to daylight readable signage for outdoor advertising segments. 相似文献
994.
Wei-Der Chang 《Digital Signal Processing》2012,22(6):1056-1062
This paper focuses on the identification problem of nonlinear discrete-time systems using Volterra filter series model. Generally, to update the kernels of Volterra model, the most commonly used method is the gradient adaptive algorithm. However, this method probably traps at the local minimum for searching parameter solutions. In this study, a new intelligence swarm computation of the global search is considered. We utilize an improved particle swarm optimization (IPSO) algorithm to design the Volterra kernel parameters. It is somewhat different from the original algorithm due to modifying its velocity updating formula and this can promote the algorithm?s searching ability for solving the optimization problem. Using the IPSO algorithm to minimize the mean square error (MSE) between the actual output and model output, the identification problem for nonlinear discrete-time systems can be fulfilled. Finally, two different kinds of examples are provided to demonstrate the efficiency of the proposed method. Moreover, some examinations including the Volterra model memory size and algorithm initial condition are further considered. 相似文献
995.
We study on-line scheduling on parallel batch machines. Jobs arrive over time. A batch processing machine can handle up to
B jobs simultaneously. The jobs that are processed together form a batch and all jobs in a batch start and are completed at
the same time. The processing time of a batch is given by the processing time of the longest job in the batch. The objective
is to minimize the makespan. We deal with the unbounded model, where B is sufficiently large. We first show that no deterministic on-line algorithm can have a competitive ratio of less than
1+(?{m2+4}-m)/21+(\sqrt{m^{2}+4}-m)/2
, where m is the number of parallel batch machines. We then present an on-line algorithm which is the one best possible for any specific
values of m. 相似文献
996.
Y Liu B Prabhakaran X Guo 《IEEE transactions on visualization and computer graphics》2012,18(10):1693-1703
This paper proposes an algorithm to build a set of orthogonal Point-Based Manifold Harmonic Bases (PB-MHB) for spectral analysis over point-sampled manifold surfaces. To ensure that PB-MHB are orthogonal to each other, it is necessary to have symmetrizable discrete Laplace-Beltrami Operator (LBO) over the surfaces. Existing converging discrete LBO for point clouds, as proposed by Belkin et al. [CHECK END OF SENTENCE], is not guaranteed to be symmetrizable. We build a new point-wisely discrete LBO over the point-sampled surface that is guaranteed to be symmetrizable, and prove its convergence. By solving the eigen problem related to the new operator, we define a set of orthogonal bases over the point cloud. Experiments show that the new operator is converging better than other symmetrizable discrete Laplacian operators (such as graph Laplacian) defined on point-sampled surfaces, and can provide orthogonal bases for further spectral geometric analysis and processing tasks. 相似文献
997.
Han Y Liu G 《IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics》2012,42(3):827-837
Localized multiple kernel learning (LMKL) is an attractive strategy for combining multiple heterogeneous features in terms of their discriminative power for each individual sample. However, models excessively fitting to a specific sample would obstacle the extension to unseen data, while a more general form is often insufficient for diverse locality characterization. Hence, both learning sample-specific local models for each training datum and extending the learned models to unseen test data should be equally addressed in designing LMKL algorithm. In this paper, for an integrative solution, we propose a probability confidence kernel (PCK), which measures per-sample similarity with respect to probabilistic-prediction-based class attribute: The class attribute similarity complements the spatial-similarity-based base kernels for more reasonable locality characterization, and the predefined form of involved class probability density function facilitates the extension to the whole input space and ensures its statistical meaning. Incorporating PCK into support-vectormachine-based LMKL framework, we propose a new PCK-LMKL with arbitrary l(p)-norm constraint implied in the definition of PCKs, where both the parameters in PCK and the final classifier can be efficiently optimized in a joint manner. Evaluations of PCK-LMKL on both benchmark machine learning data sets (ten University of California Irvine (UCI) data sets) and challenging computer vision data sets (15-scene data set and Caltech-101 data set) have shown to achieve state-of-the-art performances. 相似文献
998.
Luo SJ Liu CL Chen BY Ma KL 《IEEE transactions on visualization and computer graphics》2012,18(5):810-821
Graph visualization has been widely used to understand and present both global structural and local adjacency information in relational data sets (e.g., transportation networks, citation networks, or social networks). Graphs with dense edges, however, are difficult to visualize because fast layout and good clarity are not always easily achieved. When the number of edges is large, edge bundling can be used to improve the clarity, but in many cases, the edges could be still too cluttered to permit correct interpretation of the relations between nodes. In this paper, we present an ambiguity-free edge-bundling method especially for improving local detailed view of a complex graph. Our method makes more efficient use of display space and supports detail-on-demand viewing through an interactive interface. We demonstrate the effectiveness of our method with public coauthorship network data. 相似文献
999.
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. 相似文献
1000.
Register allocation for write activity minimization on non-volatile main memory for embedded systems
Yazhi Huang Author VitaeTiantian Liu Author Vitae Chun Jason XueAuthor Vitae 《Journal of Systems Architecture》2012,58(1):13-23
Non-volatile memories are good candidates for DRAM replacement as main memory in embedded systems and they have many desirable characteristics. Nevertheless, the disadvantages of non-volatile memory co-exist with its advantages. First, the lifetime of some of the non-volatile memories is limited by the number of erase operations. Second, read and write operations have asymmetric speed or power consumption in non-volatile memory. This paper focuses on the embedded systems using non-volatile memory as main memory. We propose register allocation technique with re-computation to reduce the number of store instructions. When non-volatile memory is applied as the main memory, reducing store instructions will reduce write activities on non-volatile memory. To re-compute the spills effectively during register allocation, a novel potential spill selection strategy is proposed. During this process, live range splitting is utilized to split certain long live ranges such that they are more likely to be assigned into registers. In addition, techniques for re-computation overhead reduction is proposed on systems with multiple functional units. With the proposed approach, the lifetime of non-volatile memory is extended accordingly. The experimental results demonstrate that the proposed technique can efficiently reduce the number of store instructions on systems with non-volatile memory by 33% on average. 相似文献