全文获取类型
收费全文 | 15791篇 |
免费 | 1139篇 |
国内免费 | 867篇 |
专业分类
电工技术 | 751篇 |
综合类 | 989篇 |
化学工业 | 413篇 |
金属工艺 | 317篇 |
机械仪表 | 1212篇 |
建筑科学 | 311篇 |
矿业工程 | 125篇 |
能源动力 | 323篇 |
轻工业 | 264篇 |
水利工程 | 131篇 |
石油天然气 | 129篇 |
武器工业 | 100篇 |
无线电 | 1292篇 |
一般工业技术 | 1087篇 |
冶金工业 | 131篇 |
原子能技术 | 67篇 |
自动化技术 | 10155篇 |
出版年
2024年 | 45篇 |
2023年 | 97篇 |
2022年 | 169篇 |
2021年 | 205篇 |
2020年 | 261篇 |
2019年 | 238篇 |
2018年 | 216篇 |
2017年 | 368篇 |
2016年 | 404篇 |
2015年 | 543篇 |
2014年 | 746篇 |
2013年 | 1016篇 |
2012年 | 941篇 |
2011年 | 1106篇 |
2010年 | 803篇 |
2009年 | 1141篇 |
2008年 | 1179篇 |
2007年 | 1241篇 |
2006年 | 1213篇 |
2005年 | 959篇 |
2004年 | 844篇 |
2003年 | 788篇 |
2002年 | 601篇 |
2001年 | 470篇 |
2000年 | 394篇 |
1999年 | 312篇 |
1998年 | 280篇 |
1997年 | 251篇 |
1996年 | 165篇 |
1995年 | 121篇 |
1994年 | 99篇 |
1993年 | 78篇 |
1992年 | 75篇 |
1991年 | 45篇 |
1990年 | 37篇 |
1989年 | 41篇 |
1988年 | 44篇 |
1987年 | 25篇 |
1986年 | 22篇 |
1985年 | 32篇 |
1984年 | 47篇 |
1983年 | 27篇 |
1982年 | 21篇 |
1981年 | 22篇 |
1980年 | 18篇 |
1979年 | 12篇 |
1978年 | 7篇 |
1977年 | 11篇 |
1976年 | 9篇 |
1975年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
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. 相似文献
102.
《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. 相似文献
103.
《Pattern recognition》2014,47(2):865-884
Genetic Algorithms (GA) have been previously applied to Error-Correcting Output Codes (ECOC) in state-of-the-art works in order to find a suitable coding matrix. Nevertheless, none of the presented techniques directly take into account the properties of the ECOC matrix. As a result the considered search space is unnecessarily large. In this paper, a novel Genetic strategy to optimize the ECOC coding step is presented. This novel strategy redefines the usual crossover and mutation operators in order to take into account the theoretical properties of the ECOC framework. Thus, it reduces the search space and lets the algorithm to converge faster. In addition, a novel operator that is able to enlarge the code in a smart way is introduced. The novel methodology is tested on several UCI datasets and four challenging computer vision problems. Furthermore, the analysis of the results done in terms of performance, code length and number of Support Vectors shows that the optimization process is able to find very efficient codes, in terms of the trade-off between classification performance and the number of classifiers. Finally, classification performance per dichotomizer results shows that the novel proposal is able to obtain similar or even better results while defining a more compact number of dichotomies and SVs compared to state-of-the-art approaches. 相似文献
104.
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. 相似文献
105.
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. 相似文献
106.
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. 相似文献
107.
《Advanced Engineering Informatics》2014,28(1):11-27
In this paper an evolutionary technique is proposed as a method for generating new design solutions with genotypes represented in the form of hierarchical hypergraphs. Such hypergraph-based evolutionary design requires the adaptation of traditional evolutionary operators like cross-over and mutation. This paper presents an attempt at defining modified cross-over and mutation operators that act on hierarchical hypergraphs. The application of the proposed transformations is illustrated on examples of designing floor layouts and furniture with the use of the evolutionary method. 相似文献
108.
《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. 相似文献
109.
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. 相似文献
110.
The mathematical optimisation of a batch cooling crystallization process is considered in this work. The objective is to minimize the standard deviation of the final crystal size distribution (CSD), which is an important feature in many industrial processes. The results with the problem written as a nonlinear programming and solved with the successive quadratic programming (SQP) coupled with the discretization of the control variable are compared with those obtained when SQP coupled with the parameterisation of the control variable is applied. Also it is proposed the implementation of the genetic algorithm (GA) coupled with parameterisation of the control variable. Extensive evaluations show that the SQP method is sensitive both to the parameterisation formulation and to the initial estimate. The solution with GA provided the control variable profile that leads to the minimum standard deviation of the final CSD. Nevertheless, it is a very time-consuming technique, which hampers its utilization in real time applications. However, its feature of global searching suggests its suitability in solving offline problems, in order to provide initial setup profiles. Bearing this in mind, it is proposed an algorithm which allows for the implementation of GA solution in a real time fashion, taking advantage of its robustness to find out the optimal solution. 相似文献