全文获取类型
收费全文 | 2201篇 |
免费 | 103篇 |
国内免费 | 179篇 |
专业分类
电工技术 | 38篇 |
综合类 | 66篇 |
化学工业 | 20篇 |
金属工艺 | 15篇 |
机械仪表 | 70篇 |
建筑科学 | 32篇 |
矿业工程 | 8篇 |
能源动力 | 16篇 |
轻工业 | 6篇 |
水利工程 | 6篇 |
石油天然气 | 1篇 |
无线电 | 206篇 |
一般工业技术 | 52篇 |
冶金工业 | 1篇 |
原子能技术 | 1篇 |
自动化技术 | 1945篇 |
出版年
2024年 | 11篇 |
2023年 | 69篇 |
2022年 | 102篇 |
2021年 | 118篇 |
2020年 | 50篇 |
2019年 | 26篇 |
2018年 | 36篇 |
2017年 | 52篇 |
2016年 | 47篇 |
2015年 | 65篇 |
2014年 | 126篇 |
2013年 | 100篇 |
2012年 | 105篇 |
2011年 | 183篇 |
2010年 | 106篇 |
2009年 | 147篇 |
2008年 | 157篇 |
2007年 | 129篇 |
2006年 | 142篇 |
2005年 | 93篇 |
2004年 | 97篇 |
2003年 | 71篇 |
2002年 | 74篇 |
2001年 | 38篇 |
2000年 | 39篇 |
1999年 | 42篇 |
1998年 | 29篇 |
1997年 | 34篇 |
1996年 | 30篇 |
1995年 | 27篇 |
1994年 | 21篇 |
1993年 | 16篇 |
1992年 | 13篇 |
1991年 | 11篇 |
1990年 | 16篇 |
1989年 | 3篇 |
1988年 | 10篇 |
1987年 | 6篇 |
1986年 | 2篇 |
1985年 | 4篇 |
1984年 | 5篇 |
1983年 | 3篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1980年 | 2篇 |
1979年 | 5篇 |
1978年 | 4篇 |
1976年 | 3篇 |
1975年 | 1篇 |
1974年 | 2篇 |
排序方式: 共有2483条查询结果,搜索用时 15 毫秒
1.
Action calculi, which generalise process calculi such as Petri nets, π-calculusand ambient calculus, have been presented
in terms of action graphs. We here offer linear action graphs as a primitive basis for action calculi. This paper presents the category of embeddings of undirected linear
action graphs without nesting, using a novel form of graphical reasoning which simplifies some otherwise complex manipulations
in regular algebra. The results are adapted in a few lines to directed graphs. This work is part of a long-term search for
a uniform behavioural theory for process calculi.
Received October 2000 / Accepted in revised form April 2001 相似文献
2.
Doratha E Drake 《Information Processing Letters》2003,85(4):211-213
We present a linear time approximation algorithm with a performance ratio of 1/2 for finding a maximum weight matching in an arbitrary graph. Such a result is already known and is due to Preis [STACS'99, Lecture Notes in Comput. Sci., Vol. 1563, 1999, pp. 259-269]. Our algorithm uses a new approach which is much simpler than the one given by Preis and needs no amortized analysis for its running time. 相似文献
3.
This paper deals with the problem of finding graph layerings restricted to a given maximal width. However, other than previous approaches for width-restricted layering, we take into account the space for dummy nodes, which are introduced by edges crossing a layer. The main result is that the problem of finding a width-restricted layering under consideration of dummy nodes is NP-complete even when all regular nodes have the same constant width and all dummy nodes have the same constant width. 相似文献
4.
5.
6.
This work discusses the issue of approximation in point set matching. In general, one may have two classes of approximations when tackling a matching problem: (1) an algorithmic approximation which consists in using suboptimal procedures to infer the assignment, and (2), a representational approximation which involves a simplified and suboptimal model for the original data. Matching techniques have typically relied on the first approach by retaining the complete model and using suboptimal techniques to solve it. In this paper, we show how a technique based on using exact inference in simple Graphical Models, an instance of the second class, can significantly outperform instances of techniques from the first class. We experimentally compare this method with well-known Spectral and Relaxation methods, which are exemplars of the first class. We have performed experiments with synthetic and real-world data sets which reveal significant performance improvement in a wide operating range. 相似文献
7.
Gloria Galan-Marin Enrique Merida-Casermeiro Domingo Lopez-Rodriguez 《Neural Processing Letters》2007,26(2):133-143
Detection of isomorphism among kinematic chains is essential in mechanical design, but difficult and computationally expensive.
It has been shown that both traditional methods and previously presented neural networks still have a lot to be desired in
aspects such as simplifying procedure of identification and adapting automatic computation. Therefore, a new algorithm based
on a competitive Hopfield network is developed for automatic computation in the kinematic chain isomorphism problem. The neural
approach provides directly interpretable solutions and does not demand tuning of parameters. We have tested the algorithm
by solving problems reported in the recent mechanical literature. Simulation results show the effectiveness of the network
that rapidly identifies isomorphic kinematic chains. 相似文献
8.
Robert Jenssen Author Vitae Deniz Erdogmus Author Vitae Author Vitae Jose C. Principe Author Vitae Author Vitae 《Pattern recognition》2007,40(3):796-806
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between probability density functions. We propose to optimize the Information Cut using a gradient descent-based approach. Our algorithm has several advantages compared to many other graph-based methods in terms of determining an appropriate affinity measure, computational complexity, memory requirements and coping with different data scales. We show that our method may produce clustering and image segmentation results comparable or better than the state-of-the art graph-based methods. 相似文献
9.
Chen-Tsung Kuo Author Vitae 《Pattern recognition》2007,40(2):742-755
Three dimensional models play an important role in many applications; the problem is how to select the appropriate models from a 3D database rapidly and accurately. In recent years, a variety of shape representations, statistical methods, and geometric algorithms have been proposed for matching 3D shapes or models. In this paper, we propose a 3D shape representation scheme based on a combination of principal plane analysis and dynamic programming. The proposed 3D shape representation scheme consists of three steps. First, a 3D model is transformed into a 2D image by projecting the vertices of the model onto its principal plane. Second, the convex hall of the 2D shape of the model is further segmented into multiple disjoint triangles using dynamic programming. Finally, for each triangle, a projection score histogram and moments are extracted as the feature vectors for similarity searching. Experimental results showed the robustness of the proposed scheme, which resists translation, rotation, scaling, noise, and destructive attacks. The proposed 3D model retrieval method performs fairly well in retrieving models having similar characteristics from a database of 3D models. 相似文献
10.
本文借助图论的理论,通过识别回路和不包含回路的由起始状态到终止状态的路径的方法,提出一种构造给定有穷自动机对应的正则表达式的新算法,并给出具体实例。 相似文献