全文获取类型
收费全文 | 10464篇 |
免费 | 730篇 |
国内免费 | 585篇 |
专业分类
电工技术 | 468篇 |
综合类 | 832篇 |
化学工业 | 173篇 |
金属工艺 | 140篇 |
机械仪表 | 538篇 |
建筑科学 | 184篇 |
矿业工程 | 66篇 |
能源动力 | 164篇 |
轻工业 | 71篇 |
水利工程 | 69篇 |
石油天然气 | 53篇 |
武器工业 | 50篇 |
无线电 | 942篇 |
一般工业技术 | 820篇 |
冶金工业 | 113篇 |
原子能技术 | 30篇 |
自动化技术 | 7066篇 |
出版年
2024年 | 50篇 |
2023年 | 123篇 |
2022年 | 159篇 |
2021年 | 164篇 |
2020年 | 206篇 |
2019年 | 162篇 |
2018年 | 136篇 |
2017年 | 230篇 |
2016年 | 238篇 |
2015年 | 318篇 |
2014年 | 449篇 |
2013年 | 671篇 |
2012年 | 587篇 |
2011年 | 676篇 |
2010年 | 448篇 |
2009年 | 690篇 |
2008年 | 753篇 |
2007年 | 791篇 |
2006年 | 716篇 |
2005年 | 565篇 |
2004年 | 520篇 |
2003年 | 485篇 |
2002年 | 419篇 |
2001年 | 328篇 |
2000年 | 296篇 |
1999年 | 213篇 |
1998年 | 215篇 |
1997年 | 202篇 |
1996年 | 137篇 |
1995年 | 119篇 |
1994年 | 108篇 |
1993年 | 83篇 |
1992年 | 78篇 |
1991年 | 51篇 |
1990年 | 40篇 |
1989年 | 40篇 |
1988年 | 48篇 |
1987年 | 27篇 |
1986年 | 22篇 |
1985年 | 34篇 |
1984年 | 48篇 |
1983年 | 28篇 |
1982年 | 21篇 |
1981年 | 20篇 |
1980年 | 18篇 |
1979年 | 12篇 |
1978年 | 7篇 |
1977年 | 11篇 |
1976年 | 9篇 |
1975年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
An essential problem in the design of holographic algorithms is to decide whether the required signatures can be realized under a suitable basis transformation (SRP). For holographic algorithms with matchgates on domain size 2, , , and have built a systematical theory. In this paper, we reduce SRP on domain size k≥3 to SRP on domain size 2 for holographic algorithms with matchgates on bases of rank 2. Furthermore, we generalize the collapse theorem of [3] to domain size k≥3. 相似文献
92.
《Information Processing Letters》2014,114(6):317-321
We propose an output-sensitive algorithm for the enumeration of all maximal bicliques in a bipartite graph, tailored to the case when the degree distribution in one partite set is very skewed. We accomplish a worst-case bound better than previously known general bounds if, e.g., the degree sequence follows a power law. 相似文献
93.
Boris Raymond Gaël Guennebaud Pascal Barla Romain Pacanowski Xavier Granier 《Computer Graphics Forum》2014,33(2):313-321
This paper introduces a system for the direct editing of highlights produced by anisotropic BRDFs, which we call anisotropic highlights. We first provide a comprehensive analysis of the link between the direction of anisotropy and the shape of highlight curves for arbitrary object surfaces. The gained insights provide the required ingredients to infer BRDF orientations from a prescribed highlight tangent field. This amounts to a non‐linear optimization problem, which is solved at interactive framerates during manipulation. Taking inspiration from sculpting software, we provide tools that give the impression of manipulating highlight curves while actually modifying their tangents. Our solver produces desired highlight shapes for a host of lighting environments and anisotropic BRDFs. 相似文献
94.
It has been recently shown in Ren et al. (2010) that by collecting noise-contaminated time series generated by a coupled-oscillator system at each node of a network, it is possible to robustly reconstruct its topology, i.e. determine the graph Laplacian. Restricting ourselves to linear consensus dynamics over undirected communication networks, in this paper we introduce a new dynamic average consensus least-squares algorithm to locally estimate these time series at each node, thus making the reconstruction process fully distributed and more easily applicable in the real world. We also propose a novel efficient method for separating the off-diagonal entries of the reconstructed Laplacian, and examine several concepts related to the trace of the dynamic correlation matrix of the coupled single integrators, which is a distinctive element of our network reconstruction method. The theory is illustrated with examples from computer, power and transportation systems. 相似文献
95.
Julius Parulek Daniel Jönsson Timo Ropinski Stefan Bruckner Anders Ynnerman Ivan Viola 《Computer Graphics Forum》2014,33(6):276-287
Molecular visualization is often challenged with rendering of large molecular structures in real time. We introduce a novel approach that enables us to show even large protein complexes. Our method is based on the level‐of‐detail concept, where we exploit three different abstractions combined in one visualization. Firstly, molecular surface abstraction exploits three different surfaces, solvent‐excluded surface (SES), Gaussian kernels and van der Waals spheres, combined as one surface by linear interpolation. Secondly, we introduce three shading abstraction levels and a method for creating seamless transitions between these representations. The SES representation with full shading and added contours stands in focus while on the other side a sphere representation of a cluster of atoms with constant shading and without contours provide the context. Thirdly, we propose a hierarchical abstraction based on a set of clusters formed on molecular atoms. All three abstraction models are driven by one importance function classifying the scene into the near‐, mid‐ and far‐field. Moreover, we introduce a methodology to render the entire molecule directly using the A‐buffer technique, which further improves the performance. The rendering performance is evaluated on series of molecules of varying atom counts. 相似文献
96.
《Electronic Commerce Research and Applications》2014,13(2):128-138
We consider the case of a digital product for share-averse bidders, where the product can be sold to multiple buyers who experience some disutility from other firms or consumers owning the same product. We model the problem of selling a digital product to share-averse bidders as an auction and apply a Bayesian optimal mechanism design. We also design constant-approximation algorithms in the prior-free setting including both average- and worst-case analyses. 相似文献
97.
针对心电图自动诊断困难这一问题,提出了一种新的聚类算法:基于均方差属性加权的遗传模拟退火K-means改进聚类算法,用于改进心电图(ECG)信号的自动识别技术。利用小波变换的多分辨率和抗干扰能力好的特点,检测QRS波、P波、T波,提高了特征检测的准确性;利用聚类分析具有较好的鲁棒性和适合于大数据量分析的特点,对心电信号进行波形分类。采用MIT-BIH标准心电数据库中的部分数据对识别结果进行判断,改进后的K-means聚类算法的准确率高于传统的K-means聚类算法,实验表明该算法对心电信号可以进行有效分类。 相似文献
98.
In this paper we propose an online stiffness estimation technique for robotic tasks based only on force data, therefore, not requiring contact position information. This allows estimations to be obtained in robotic tasks involving interactions with unstructured and unknown environments where geometrical data is unavailable or unreliable. Our technique – the Candidate Observer Based Algorithm (COBA) – uses two force observers, configured with different candidate stiffnesses, to estimate online the actual target object stiffness. COBA is embedded in a force control architecture with computed torque in the task space. The theoretical presentation of the algorithm, as well as simulation tests and experimental results with a lightweight robot arm are also presented. 相似文献
99.
针对软实时系统中的一类同时具有依赖性与周期性的任务,提出一种基于单行树矩阵(MST)的动态因子均衡调度算法SMD(schedule on matrix of the single tree and dynamic load factor)。该算法通过对MST矩阵的特性进行分析,将任务划分为若干并行集,再综合考虑已执行时间、任务间的依赖关系及任务最早截止时间几个要素,以动态因子的形式对任务进行实时调度。最后,还以证明的形式给出了可充分调动的任务集的充分条件,并以此为基础随机生成了测试任务集,进行了对比实验。实验表明,与文献中现有经典算法相比,新算法使处理器利用率提升近15%,任务丢失率降低2%。 相似文献
100.
龚雪慧 《数字社区&智能家居》2014,(5):3064-3066
图像分割算法是指从待割图像中提取出感兴趣的目标,以便进行图像分析与图像理解。Snake算法不同于传统的图像分割方法。文中详细介绍了Snake模型的数学机理及离散化方法,最后利用贪婪法实现了Snake算法,并应用与实际图像的分割。 相似文献