全文获取类型
收费全文 | 3853篇 |
免费 | 52篇 |
国内免费 | 1篇 |
专业分类
电工技术 | 83篇 |
综合类 | 1篇 |
化学工业 | 421篇 |
金属工艺 | 20篇 |
机械仪表 | 37篇 |
建筑科学 | 45篇 |
矿业工程 | 2篇 |
能源动力 | 26篇 |
轻工业 | 108篇 |
水利工程 | 9篇 |
石油天然气 | 5篇 |
无线电 | 333篇 |
一般工业技术 | 391篇 |
冶金工业 | 1826篇 |
原子能技术 | 30篇 |
自动化技术 | 569篇 |
出版年
2021年 | 33篇 |
2020年 | 19篇 |
2019年 | 30篇 |
2018年 | 27篇 |
2017年 | 31篇 |
2016年 | 20篇 |
2015年 | 27篇 |
2014年 | 26篇 |
2013年 | 133篇 |
2012年 | 63篇 |
2011年 | 84篇 |
2010年 | 87篇 |
2009年 | 87篇 |
2008年 | 98篇 |
2007年 | 75篇 |
2006年 | 80篇 |
2005年 | 67篇 |
2004年 | 47篇 |
2003年 | 74篇 |
2002年 | 76篇 |
2001年 | 67篇 |
2000年 | 55篇 |
1999年 | 107篇 |
1998年 | 434篇 |
1997年 | 268篇 |
1996年 | 195篇 |
1995年 | 150篇 |
1994年 | 134篇 |
1993年 | 138篇 |
1992年 | 66篇 |
1991年 | 54篇 |
1990年 | 76篇 |
1989年 | 63篇 |
1988年 | 64篇 |
1987年 | 48篇 |
1986年 | 63篇 |
1985年 | 66篇 |
1984年 | 40篇 |
1983年 | 49篇 |
1982年 | 45篇 |
1981年 | 47篇 |
1980年 | 37篇 |
1979年 | 27篇 |
1978年 | 38篇 |
1977年 | 56篇 |
1976年 | 103篇 |
1975年 | 24篇 |
1974年 | 30篇 |
1972年 | 20篇 |
1970年 | 17篇 |
排序方式: 共有3906条查询结果,搜索用时 15 毫秒
71.
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The all-ports tree labeling ℒ
all
gives each node v of G a label containing the port numbers of all the tree edges incident to v. The upward tree labeling ℒ
up
labels each node v by the number of the port leading from v to its parent in the tree. Our measure of interest is the worst case and total length of the labels used by the scheme, denoted
M
up
(T) and S
up
(T) for ℒ
up
and M
all
(T) and S
all
(T) for ℒ
all
. The problem studied in this paper is the following: Given a graph G and a predefined port labeling for it, with the ports of each node v numbered by 0,…,deg (v)−1, select a rooted spanning tree for G minimizing (one of) these measures. We show that the problem is polynomial for M
up
(T), S
up
(T) and S
all
(T) but NP-hard for M
all
(T) (even for 3-regular planar graphs). We show that for every graph G and port labeling there exists a spanning tree T for which S
up
(T)=O(nlog log n). We give a tight bound of O(n) in the cases of complete graphs with arbitrary labeling and arbitrary graphs with symmetric port labeling. We conclude by
discussing some applications for our tree representation schemes.
A preliminary version of this paper has appeared in the proceedings of the 7th International Workshop on Distributed Computing
(IWDC), Kharagpur, India, December 27–30, 2005, as part of Cohen, R. et al.: Labeling schemes for tree representation. In:
Proceedings of 7th International Workshop on Distributed Computing (IWDC), Lecture Notes of Computer Science, vol. 3741, pp. 13–24
(2005).
R. Cohen supported by the Pacific Theaters Foundation.
P. Fraigniaud and D. Ilcinkas supported by the project “PairAPair” of the ACI Masses de Données, the project “Fragile” of
the ACI Sécurité et Informatique, and by the project “Grand Large” of INRIA.
A. Korman supported in part by an Aly Kaufman fellowship.
D. Peleg supported in part by a grant from the Israel Science Foundation. 相似文献
72.
Fethallah Benmansour Laurent D. Cohen 《Journal of Mathematical Imaging and Vision》2009,33(2):209-221
In this paper, we present a new method for segmenting closed contours and surfaces. Our work builds on a variant of the minimal
path approach. First, an initial point on the desired contour is chosen by the user. Next, new keypoints are detected automatically
using a front propagation approach. We assume that the desired object has a closed boundary. This a-priori knowledge on the
topology is used to devise a relevant criterion for stopping the keypoint detection and front propagation. The final domain
visited by the front will yield a band surrounding the object of interest. Linking pairs of neighboring keypoints with minimal
paths allows us to extract a closed contour from a 2D image. This approach can also be used for finding an open curve giving
extra information as stopping criteria. Detection of a variety of objects on real images is demonstrated. Using a similar
idea, we can extract networks of minimal paths from a 3D image called Geodesic Meshing. The proposed method is applied to
3D data with promising results.
相似文献
Laurent D. CohenEmail: |
73.
We consider a variant of the graph searching games that models the routing reconfiguration problem in WDM networks. In the digraph processing game, a team of agents aims at processing, or clearing, the vertices of a digraph D. We are interested in two different measures: (1) the total number of agents used, and (2) the total number of vertices occupied by an agent during the processing of D. These measures, respectively, correspond to the maximum number of simultaneous connections interrupted and to the total number of interruptions during a routing reconfiguration in a WDM network.Previous works have studied the problem of independently minimizing each of these parameters. In particular, the corresponding minimization problems are APX-hard, and the first one is known not to be in APX. In this paper, we give several complexity results and study tradeoffs between these conflicting objectives. In particular, we show that minimizing one of these parameters while the other is constrained is NP-complete. Then, we prove that there exist some digraphs for which minimizing one of these objectives arbitrarily impairs the quality of the solution for the other one. We show that such bad tradeoffs may happen even for a basic class of digraphs. On the other hand, we exhibit classes of graphs for which good tradeoffs can be achieved. We finally detail the relationship between this game and the routing reconfiguration problem. In particular, we prove that any instance of the processing game, i.e. any digraph, corresponds to an instance of the routing reconfiguration problem. 相似文献
74.
Multiple Comparisons in Induction Algorithms 总被引:1,自引:0,他引:1
A single mechanism is responsible for three pathologies of induction algorithms: attribute selection errors, overfitting, and oversearching. In each pathology, induction algorithms compare multiple items based on scores from an evaluation function and select the item with the maximum score. We call this a multiple comparison procedure (MCP). We analyze the statistical properties of MCPs and show how failure to adjust for these properties leads to the pathologies. We also discuss approaches that can control pathological behavior, including Bonferroni adjustment, randomization testing, and cross-validation. 相似文献
75.
Similarity-guided streamline placement with error evaluation 总被引:3,自引:0,他引:3
Chen Y Cohen J Krolik J 《IEEE transactions on visualization and computer graphics》2007,13(6):1448-1455
Most streamline generation algorithms either provide a particular density of streamlines across the domain or explicitly detect features, such as critical points, and follow customized rules to emphasize those features. However, the former generally includes many redundant streamlines, and the latter requires Boolean decisions on which points are features (and may thus suffer from robustness problems for real-world data). We take a new approach to adaptive streamline placement for steady vector fields in 2D and 3D. We define a metric for local similarity among streamlines and use this metric to grow streamlines from a dense set of candidate seed points. The metric considers not only Euclidean distance, but also a simple statistical measure of shape and directional similarity. Without explicit feature detection, our method produces streamlines that naturally accentuate regions of geometric interest. In conjunction with this method, we also propose a quantitative error metric for evaluating a streamline representation based on how well it preserves the information from the original vector field. This error metric reconstructs a vector field from points on the streamline representation and computes a difference of the reconstruction from the original vector field. 相似文献
76.
77.
Fred Cohen 《Network Security》2000,2000(9):16-17
Networks dominate today’s computing environment and commercial technical protection is lagging behind attack technology. As a result, protection programme success depends more on prudent management decisions than on the selection of technical safeguards. Managing Network Security takes a management view of protection and seeks to reconcile the need for security with the limitations of technology. 相似文献
78.
Fred Cohen 《Network Security》2000,2000(11):16-18
Networks dominate today's computing landscape and commercial technical protection is lagging behind attack technology. As a result, protection programme success depends more on prudent management decisions than on the selection of technical safeguards. Managing Network Security takes a management view of protection and seeks to reconcile the need for security with the limitations of technology. 相似文献
79.
We show that it is possible to collect data that are useful for collaborative filtering (CF) using an autonomous Web spider. In CF, entities are recommended to a new user based on the stated preferences of other, similar users. We describe a CF spider that collects from the Web lists of semantically related entities. These lists can then be used by existing CF algorithms by encoding them as ‘pseudo-users'. Importantly, the spider can collect useful data without pre-programmed knowledge about the format of particular pages or particular sites. Instead, the CF spider uses commercial Web-search engines to find pages likely to contain lists in the domain of interest, and then applies previously proposed heuristics to extract lists from these pages. We show that data collected by this spider are nearly as effective for CF as data collected from real users, and more effective than data collected by two plausible hand-programmed spiders. In some cases, autonomously spidered data can also be combined with actual user data to improve performance. 相似文献
80.