全文获取类型
收费全文 | 6670篇 |
免费 | 814篇 |
国内免费 | 789篇 |
专业分类
电工技术 | 245篇 |
综合类 | 412篇 |
化学工业 | 184篇 |
金属工艺 | 115篇 |
机械仪表 | 574篇 |
建筑科学 | 362篇 |
矿业工程 | 52篇 |
能源动力 | 113篇 |
轻工业 | 42篇 |
水利工程 | 51篇 |
石油天然气 | 37篇 |
武器工业 | 36篇 |
无线电 | 1001篇 |
一般工业技术 | 246篇 |
冶金工业 | 24篇 |
原子能技术 | 21篇 |
自动化技术 | 4758篇 |
出版年
2024年 | 12篇 |
2023年 | 44篇 |
2022年 | 103篇 |
2021年 | 155篇 |
2020年 | 114篇 |
2019年 | 101篇 |
2018年 | 146篇 |
2017年 | 153篇 |
2016年 | 202篇 |
2015年 | 270篇 |
2014年 | 402篇 |
2013年 | 472篇 |
2012年 | 572篇 |
2011年 | 666篇 |
2010年 | 494篇 |
2009年 | 456篇 |
2008年 | 509篇 |
2007年 | 550篇 |
2006年 | 535篇 |
2005年 | 389篇 |
2004年 | 372篇 |
2003年 | 337篇 |
2002年 | 243篇 |
2001年 | 146篇 |
2000年 | 124篇 |
1999年 | 118篇 |
1998年 | 100篇 |
1997年 | 83篇 |
1996年 | 77篇 |
1995年 | 62篇 |
1994年 | 44篇 |
1993年 | 44篇 |
1992年 | 35篇 |
1991年 | 23篇 |
1990年 | 13篇 |
1989年 | 21篇 |
1988年 | 13篇 |
1987年 | 2篇 |
1986年 | 5篇 |
1985年 | 8篇 |
1984年 | 5篇 |
1983年 | 5篇 |
1982年 | 6篇 |
1981年 | 9篇 |
1980年 | 6篇 |
1979年 | 3篇 |
1978年 | 7篇 |
1977年 | 8篇 |
1976年 | 5篇 |
1965年 | 1篇 |
排序方式: 共有8273条查询结果,搜索用时 15 毫秒
131.
Jeferson de Souza 《Computers & Geosciences》2011,37(2):241-249
A MATLAB® program based on the Hou algorithm for estimation of fractal dimension and multifractal spectrum of fractures is presented. The program performance was tested with many synthetical fractals and field data. Interpolation and sampling effects on the fractal dimension and multifractal spectrum estimation were also studied. Some common problems related to the fractal dimension and multifractal spectrum are also discussed. 相似文献
132.
Quality of service (QoS) provisioning in wireless mesh networks (WMNs) is an open issue to support emerging multimedia services. In this paper, we study the problem of QoS provisioning in terms of end-to-end bandwidth allocation in WMNs. It is challenging due to interferences in the networks. We consider widely used interference models and show that except a few special cases, the problem of finding a feasible path is NP-complete under the models. We propose a k-shortest path based algorithmic framework to solve this problem. We also consider the problem of optimizing network performance by on-line dynamic routing, and adapt commonly used conventional QoS routing metrics to be used in WMNs. We find the optimal solutions for these problems through formulating them as optimization models. A model is developed to check the existence of a feasible path and another to find the optimal path for a demand; moreover, an on-line optimal QoS routing algorithm is developed. Comparing the algorithms implemented by the proposed framework with the optimization models shows that our solution can find existing feasible paths with high probability, efficiently optimizes path lengths, and has a comparable performance to the optimal QoS routing algorithm. Furthermore, our results show that contrary to wireline networks, minimizing resource consumption should be preferred over load distribution even in lightly loaded WMNs. 相似文献
133.
Flash memory efficient LTL model checking 总被引:1,自引:0,他引:1
S. EdelkampD. Sulewski J. BarnatL. Brim P. Šime?ek 《Science of Computer Programming》2011,76(2):136-157
As the capacity and speed of flash memories in form of solid state disks grow, they are becoming a practical alternative for standard magnetic drives. Currently, most solid-state disks are based on NAND technology and much faster than magnetic disks in random reads, while in random writes they are generally not.So far, large-scale LTL model checking algorithms have been designed to employ external memory optimized for magnetic disks. We propose algorithms optimized for flash memory access. In contrast to approaches relying on the delayed detection of duplicate states, in this work, we design and exploit appropriate hash functions to re-invent immediate duplicate detection.For flash memory efficient on-the-fly LTL model checking, which aims at finding any counter-example to the specified LTL property, we study hash functions adapted to the two-level hierarchy of RAM and flash memory. For flash memory efficient off-line LTL model checking, which aims at generating a minimal counterexample and scans the entire state space at least once, we analyze the effect of outsourcing a memory-based perfect hash function from RAM to flash memory.Since the characteristics of flash memories are different to magnetic hard disks, the existing I/O complexity model is no longer sufficient. Therefore, we provide an extended model for the computation of the I/O complexity adapted to flash memories that has a better fit to the observed behavior of our algorithms. 相似文献
134.
Generalization is an important technique for protecting privacy in data dissemination. In the framework of generalization, ?-diversity is a strong notion of privacy. However, since existing ?-diversity measures are defined in terms of the most specific (rather than general) sensitive attribute (SA) values, algorithms based on these measures can have narrow eligible ranges for data that has a heavily skewed distribution of SA values and produce anonymous data that has a low utility. In this paper, we propose a new ?-diversity measure called the functional (τ, ?)-diversity, which extends ?-diversity by using a simple function to constrain frequencies of base SA values that are induced by general SA values. As a result, algorithms based on (τ, ?)-diversity may generalize SA values, thus are much less constrained by skew SA distributions. We show that (τ, ?)-diversity is more flexible and elaborate than existing ?-diversity measures. We present an efficient heuristic algorithm that uses a novel order of quasi-identifier (QI) values to achieve (τ, ?)-diversity. We compare our algorithm with two state-of-the-art algorithms that are based on existing ?-diversity measures. Our preliminary experimental results indicate that our algorithm not only provides a stronger privacy protection but also results in better utility of anonymous data. 相似文献
135.
Markus DurzinskyAnnegret Wagler Robert Weismantel 《Theoretical computer science》2011,412(26):2800-2815
Models of biological systems and phenomena are of high scientific interest and practical relevance, but not always easy to obtain due to their inherent complexity. To gain the required insight, experimental data are provided and need to be interpreted in terms of models that explain the observed phenomena. In systems biology the framework of Petri nets is often used to describe models for the regulatory mechanisms of biological systems. The aim of this paper is to provide, based on results in Marwan et al. (2008) [1] and Durzinsky et al. (2008) [2], an algorithmic framework for the challenging task of generating all possible Petri nets fitting the given experimental data. 相似文献
136.
We study the classical Bandwidth problem from the viewpoint of parametrised algorithms. Given a graph G=(V,E) and a positive integer k, the Bandwidth problem asks whether there exists a bijective function β:{1,…,∣V∣}→V such that for every edge uv∈E, ∣β−1(u)−β−1(v)∣≤k. It is known that under standard complexity assumptions, no algorithm for Bandwidth with running time of the form f(k)nO(1) exists, even when the input is restricted to trees. We initiate the search for classes of graphs where such algorithms do exist. We present an algorithm with running time n⋅2O(klogk) for Bandwidth on AT-free graphs, a well-studied graph class that contains interval, permutation, and cocomparability graphs. Our result is the first non-trivial algorithm that shows fixed-parameter tractability of Bandwidth on a graph class on which the problem remains NP-complete. 相似文献
137.
针对ITU-T J.83标准,结合有线数字广播的信道特征,提出一种适用于高阶QAM信号的载波同步与自适应均衡的联合设计方案。该方案在均衡部分采用常模数算法(CMA)和最小均方误差算法(LMS)的双模均衡算法。通过算法的切换达到快速收敛和降低均方误差(MSE)的目的;针对高阶QAM信号,载波同步环路首先选用极性判决算法,并采用带宽较大的环路滤波器系数,使环路能在短时间内进行大范围频偏捕获。然后调低环路滤波器系数,减小环路带宽,进而降低稳态抖动。环路最后切换到判决指示算法,使相位均方差降至最低。整个方案通过算法验证并在Altera Stratix Ⅱ系列EP2S130F1020C5型现场可编程门阵列(FPGA)上完成了布局布线。最高工作频率为90.47MHz。 相似文献
138.
139.
一、引言自然界以及我们社会生活中的各种事物都在运动、变化和发展着,将它们按时间顺序记录下来,我们就可以得到各种各样的“时间序列”数据。对时间序列进行分析,可以揭示事物运动、变化和发展的内在规律,对于人们正确认识事物并据此作出科学的决策具有重要的现实意义。 相似文献
140.
一种改进的无死锁试卷生成算法 总被引:2,自引:0,他引:2
1.引言作为计算机远程教育(网上教育)中一个必不可少的组成部分,教学评价系统(即考试系统)设计成败的关键在于网络环境下的题库管理系统的设计,这一设计主要应考虑以下几方面的问题: (1)多卷并发试卷的时间冲突。一方面,由于网络用户数目的事先不确定性和题库中试题总量有限,可能产生多份试卷争夺试题资源的现象,从而形成时间 相似文献