全文获取类型
收费全文 | 1162篇 |
免费 | 134篇 |
国内免费 | 136篇 |
专业分类
电工技术 | 13篇 |
综合类 | 54篇 |
化学工业 | 16篇 |
金属工艺 | 6篇 |
机械仪表 | 65篇 |
建筑科学 | 96篇 |
矿业工程 | 9篇 |
能源动力 | 20篇 |
轻工业 | 25篇 |
水利工程 | 4篇 |
石油天然气 | 5篇 |
武器工业 | 5篇 |
无线电 | 92篇 |
一般工业技术 | 34篇 |
冶金工业 | 4篇 |
原子能技术 | 5篇 |
自动化技术 | 979篇 |
出版年
2024年 | 9篇 |
2023年 | 6篇 |
2022年 | 24篇 |
2021年 | 18篇 |
2020年 | 32篇 |
2019年 | 20篇 |
2018年 | 26篇 |
2017年 | 31篇 |
2016年 | 35篇 |
2015年 | 34篇 |
2014年 | 56篇 |
2013年 | 72篇 |
2012年 | 89篇 |
2011年 | 108篇 |
2010年 | 74篇 |
2009年 | 94篇 |
2008年 | 83篇 |
2007年 | 98篇 |
2006年 | 99篇 |
2005年 | 83篇 |
2004年 | 57篇 |
2003年 | 66篇 |
2002年 | 46篇 |
2001年 | 31篇 |
2000年 | 14篇 |
1999年 | 21篇 |
1998年 | 14篇 |
1997年 | 13篇 |
1996年 | 7篇 |
1995年 | 10篇 |
1994年 | 5篇 |
1993年 | 5篇 |
1992年 | 6篇 |
1991年 | 2篇 |
1990年 | 6篇 |
1989年 | 5篇 |
1988年 | 3篇 |
1986年 | 3篇 |
1985年 | 2篇 |
1984年 | 6篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1981年 | 3篇 |
1980年 | 1篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1976年 | 3篇 |
1975年 | 1篇 |
1972年 | 1篇 |
排序方式: 共有1432条查询结果,搜索用时 15 毫秒
51.
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. 相似文献
52.
We introduce a class of tree bimorphisms that define exactly the translations performed by syntax-directed translation schemata. We also show that these “quasi-alphabetic” tree bimorphisms preserve recognizability, and that their class is closed under composition and inverses. 相似文献
53.
Physically Guided Animation of Trees 总被引:2,自引:0,他引:2
This paper presents a new method to animate the interaction of a tree with wind both realistically and in real time. The main idea is to combine statistical observations with physical properties in two major parts of tree animation. First, the interaction of a single branch with the forces applied to it is approximated by a novel efficient two step nonlinear deformation method, allowing arbitrary continuous deformations and circumventing the need to segment a branch to model its deformation behavior. Second, the interaction of wind with the dynamic system representing a tree is statistically modeled. By precomputing the response function of branches to turbulent wind in frequency space, the motion of a branch can be synthesized efficiently by sampling a 2D motion texture.
Using a hierarchical form of vertex displacement, both methods can be combined in a single vertex shader, fully leveraging the power of modern GPUs to realistically animate thousands of branches and ten thousands of leaves at practically no cost. 相似文献
Using a hierarchical form of vertex displacement, both methods can be combined in a single vertex shader, fully leveraging the power of modern GPUs to realistically animate thousands of branches and ten thousands of leaves at practically no cost. 相似文献
54.
55.
56.
57.
The Prize-collecting Steiner Tree Problem (PCSTP) is a well-known problem in graph theory and combinatorial optimization. It has been successfully applied to solve real problems such as fiber-optic and gas distribution networks design. In this work, we concentrate on its application in biology to perform a functional analysis of genes. It is common to analyze large networks in genomics to infer a hidden knowledge. Due to the NP-hard characteristics of the PCSTP, it is computationally costly, if possible, to achieve exact solutions for such huge instances. Therefore, there is a need for fast and efficient matheuristic algorithms to explore and understand the concealed information in huge biological graphs. In this study, we propose a matheuristic method based on clustering algorithm. The main target of the method is to scale up the applicability of the currently available exact methods to large graph instances, without loosing too much on solution quality. The proposed matheuristic method is composed of a preprocessing procedures, a heuristic clustering algorithm and an exact solver for the PCSTP, applied on sub-graphs. We examine the performance of the proposed method on real-world benchmark instances from biology, and compare its results with those of the exact solver alone, without the heuristic clustering. We obtain solutions in shorter execution time and with negligible optimality gaps. This enables analyzing very large biological networks with the currently available exact solvers. 相似文献
58.
59.
针对最小生成树问题,提出了一种小生境遗传禁忌算法。算法中使用Prfer数对生成树进行编码。在选择交叉之前使用小生境技术,使得被选中交叉的个体之间的适应值的距离大于一定的阈值,从而保证了个体的多样性。遗传变异算子使用禁忌搜索算法,提高了遗传算法的局部搜索能力,加快了算法的收敛速度。模拟实验结果证明该算法是有效的。 相似文献
60.
Risk management is becoming increasingly important for railway companies in order to safeguard their passengers and employees while improving safety and reducing maintenance costs. However, in many circumstances, the application of probabilistic risk analysis tools may not give satisfactory results because the risk data are incomplete or there is a high level of uncertainty involved in the risk data. This article presents the development of a risk management system for railway risk analysis using fuzzy reasoning approach and fuzzy analytical hierarchy decision making process. In the system, fuzzy reasoning approach (FRA) is employed to estimate the risk level of each hazardous event in terms of failure frequency, consequence severity and consequence probability. This allows imprecision or approximate information in the risk analysis process. Fuzzy analytical hierarchy process (fuzzy-AHP) technique is then incorporated into the risk model to use its advantage in determining the relative importance of the risk contributions so that the risk assessment can be progressed from hazardous event level to hazard group level and finally to railway system level. This risk assessment system can evaluate both qualitative and quantitative risk data and information associated with a railway system effectively and efficiently, which will provide railway risk analysts, managers and engineers with a method and tool to improve their safety management of railway systems and set safety standards. A case study on risk assessment of shunting at Hammersmith depot is used to illustrate the application of the proposed risk assessment system. 相似文献