全文获取类型
收费全文 | 357122篇 |
免费 | 27898篇 |
国内免费 | 15707篇 |
专业分类
电工技术 | 20858篇 |
技术理论 | 45篇 |
综合类 | 25369篇 |
化学工业 | 59630篇 |
金属工艺 | 20782篇 |
机械仪表 | 22450篇 |
建筑科学 | 27611篇 |
矿业工程 | 11676篇 |
能源动力 | 9693篇 |
轻工业 | 23992篇 |
水利工程 | 6741篇 |
石油天然气 | 23420篇 |
武器工业 | 2795篇 |
无线电 | 38760篇 |
一般工业技术 | 39362篇 |
冶金工业 | 18522篇 |
原子能技术 | 3624篇 |
自动化技术 | 45397篇 |
出版年
2024年 | 1454篇 |
2023年 | 5558篇 |
2022年 | 9854篇 |
2021年 | 13849篇 |
2020年 | 10425篇 |
2019年 | 8534篇 |
2018年 | 9844篇 |
2017年 | 11055篇 |
2016年 | 10127篇 |
2015年 | 13858篇 |
2014年 | 17442篇 |
2013年 | 20891篇 |
2012年 | 22686篇 |
2011年 | 25167篇 |
2010年 | 22234篇 |
2009年 | 21057篇 |
2008年 | 20643篇 |
2007年 | 19690篇 |
2006年 | 20053篇 |
2005年 | 17653篇 |
2004年 | 11964篇 |
2003年 | 10689篇 |
2002年 | 9892篇 |
2001年 | 8807篇 |
2000年 | 8754篇 |
1999年 | 9386篇 |
1998年 | 7175篇 |
1997年 | 6134篇 |
1996年 | 5811篇 |
1995年 | 4785篇 |
1994年 | 3886篇 |
1993年 | 2622篇 |
1992年 | 2072篇 |
1991年 | 1569篇 |
1990年 | 1233篇 |
1989年 | 995篇 |
1988年 | 830篇 |
1987年 | 524篇 |
1986年 | 410篇 |
1985年 | 258篇 |
1984年 | 206篇 |
1983年 | 164篇 |
1982年 | 128篇 |
1981年 | 76篇 |
1980年 | 96篇 |
1979年 | 43篇 |
1978年 | 17篇 |
1977年 | 23篇 |
1976年 | 28篇 |
1973年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
从地震的发生频率上来看,我国是一个多发的国家。同时在地震中由于受到各种灾害而引起的损失也是最严重的。所以,对地震的信号进行实时性监测并完成信号数据的快速传输必须要应用先进的技术手段。文章主要介绍的就是目前应用十分广泛的3G技术在地震的网络系统中的安全应用。 相似文献
992.
993.
Wu Li Yann-Hang Lee Wei-Tek Tsai Jingjing Xu Young-Sung Son Jun-Hee Park Kyung-Duk Moon 《Service Oriented Computing and Applications》2012,6(1):65-79
A smart home usually has a variety of devices or home appliance, instead of designing software for a specific home, this paper
proposes a service-oriented framework with a set of ontology systems to support service and device publishing, discovery of
devices and their services, composition of control software using existing control services that wrap devices, deployment,
and execution of the composed service in an computing environment, monitoring the execution, and recovery from device failure.
The ontology systems specify semantic information about devices, services, and workflows used in various smart home, and users
can compose and recompose services for their specific needs. New devices, workflows, and services can be added into ontology.
Most of the steps in this process can be automated including code generation. For example, service composition will be carried
out in three steps: abstract workflow design, function construction, and device discovery, and different codes can be generated
for different computing platforms such as Java and Open Services Gateway initiative environments. In this way, a variety of
smart home can be constructed rapidly using the framework by discovery and composition using existing services and workflows.
This paper illustrates this framework using a media control example to illustrate the ontology, discovery, composition, deployment,
execution, monitoring, and recovery. 相似文献
994.
Reward only is not enough: Evaluating and improving the fairness policy of the P2P file sharing network eMule/eDonkey 总被引:1,自引:0,他引:1
Yunzhao Li Don Gruenbacher Caterina Scoglio 《Peer-to-Peer Networking and Applications》2012,5(1):40-57
Limiting the threat of free-riding behavior is an important design issue for peer-to-peer (P2P) file sharing networks. However,
the fairness policy that rewards contributors with credit in one of the most popular P2P file sharing networks, eMule/eDonkey,
hasn’t been thoroughly studied. In this paper, motivated by our experiments with the eMule/eDonkey network, we firstly theoretically
analyze the content exchange process with credit in eMule/eDonkey and then verify the mathematical model by an agent-based
simulation. Both the numerical and simulation-based results confirm our discovery in the experiments that eMule/eDonkey’s
local credit strategy can not provide enough fairness as it doesn’t explicitly punish free-riders. To overcome this drawback,
we propose a new free-riding control scheme, which can simply maintain the current credit local structure and take advantage
of the credit policy. Extensive numerical evaluation and simulation indicate that this scheme significantly improves system
fairness. 相似文献
995.
Ke-Yan Liu Yun-Hua Li Shanqing Li Liang Tang Lei Wang 《Journal of Real-Time Image Processing》2012,7(3):153-163
This paper proposed a multi-cue-based face-tracking algorithm with the supporting framework using parallel multi-core and one Graphic Processing Unit (GPU). Due to illumination and partial-occlusion problems, face tracking usually cannot stably work based on a single cue. Focusing on the above-mentioned problems, we first combined three different visual cues??color histogram, edge orientation histogram, and wavelet feature??under the framework of particle filters to considerably improve tracking performance. Furthermore, an online updating strategy made the algorithm adaptive to illumination changes and slight face rotations. Subsequently, attempting two parallel approaches resulted in real-time responses. However, the computational efficiency decreased considerably with the increase of particles and visual cues. In order to handle the large amount of computation costs resulting from the introduced multi-cue strategy, we explored two parallel computing techniques to speed up the tracking process, especially the most computation-intensive observational steps. One is a multi-core-based parallel algorithm with a MapReduce thread model, and the other is a GPU-based speedup approach. The GPU-based technique uses features-matching and particle weight computations, which have been put into the GPU kernel. The results demonstrate that the proposed face-tracking algorithm can work robustly with cluttered backgrounds and differing illuminations; the multi-core parallel scheme can increase the speed by 2?C6 times compared with that of the corresponding sequential algorithms. Furthermore, a GPU parallel scheme and co-processing scheme can achieve a greater increase in speed (8×?C12×) compared with the corresponding sequential algorithms. 相似文献
996.
In most priority scheduling algorithms, the number of priority levels is assumed to be unlimited. However, if a task set requires more priority levels than the system can support, several jobs must in practice be assigned the same priority level. To solve this problem, a novel group priority earliest deadline first (GPEDF) scheduling algorithm is presented. In this algorithm, a schedulability test is given to form a job group, in which the jobs can arbitrarily change their order without reducing the schedulability. We consider jobs in the group having the same priority level and use shortest job first (SJF) to schedule the jobs in the group to improve the performance of the system. Compared with earliest deadline first (EDF), best effort (BE), and group-EDF (gEDF), simulation results show that the new algorithm exhibits the least switching, the shortest average response time, and the fewest required priority levels. It also has a higher success ratio than both EDF and gEDF. 相似文献
997.
复杂场景实时目标检测方法 总被引:3,自引:0,他引:3
针对含有非平稳背景的复杂场景,提出一种基于空间混合高斯模型的实时目标检测方法.该方法以混合高斯模型作为颜色分布的统计框架,并在空间邻域中利用背景与前景隶属度之间的竞争确定像素的归属,提高了检测准确率;同时通过基于偏差均值的匹配判断和低权重模型的移除提升了混合高斯统计框架的性能,以实时地对运动目标进行准确的检测.实验结果表明,文中方法对非平稳背景有很好的适应能力,在检测准确率和运行效率上均优于其他检测方法. 相似文献
998.
立体书是一种独特的纸张艺术形式,有着精细的几何结构.针对一类特殊的V型立体纸雕进行了系统性的研究,给出了V型立体纸雕可实现性的充分条件,使其可以只借助2张支撑面的力量进行打开和关闭,同时在这个过程中所有的面片都保持刚性并且相互不产生自交.基于这些充分条件,文中分别实现了一个计算机辅助交互V型纸雕设计工具,以及一个基于体方法的自动生成算法. 相似文献
999.
遥感影像的精确配准和正射纠正是进行图像融合、变化检测、图像镶嵌、定量遥感建模、多时相和多传感器影像协同应用的基础和前提。以美国国家航空和航天管理局下设LEDAPS(Landsat Ecosystem Disturbance Adaptive Processing System)课题组开发的配准与正射纠正程序包AROP(Automated Registration and Orthorectification Package)为例,详细阐述了其配准的原理与程序设计流程,并对其配准的精度进行了分析和评价。试验表明:AROP程序包算法能够找出足够的控制点,且控制点分布较为均匀,配准误差小于0.5个像元。误差特征表现为:扫描误差明显大于航向误差,误差的结果与影像漂移、DEM、坡度存在一定的相关性,高程和坡度是影响配准精度的主要因素之一。该程序包目前能够用于对我国CBERS影像的正射校正以及波段不匹配处理,但是对HJ卫星CCD影像数据配准还有待于进一步研究。 相似文献
1000.
为了兼顾模拟集成电路设计优化的求解精度和计算效率,提出一种基于正项式模型修正技术的几何规划优化方法.首先将模拟集成电路的设计目标与约束简化为正项式模型,然后在采用几何规划方法迭代优化的过程中利用晶体管级SPICE仿真不断修正这一正项式模型.实例表明,与传统基于公式的优化方法和基于仿真的优化方法相比,该方法能够在尽量保证计算效率和全局最优解的前提下使优化精度满足晶体管级SPICE仿真的要求. 相似文献