全文获取类型
收费全文 | 1021篇 |
免费 | 51篇 |
国内免费 | 3篇 |
专业分类
电工技术 | 11篇 |
化学工业 | 200篇 |
金属工艺 | 13篇 |
机械仪表 | 41篇 |
建筑科学 | 40篇 |
矿业工程 | 1篇 |
能源动力 | 15篇 |
轻工业 | 58篇 |
水利工程 | 6篇 |
武器工业 | 2篇 |
无线电 | 317篇 |
一般工业技术 | 143篇 |
冶金工业 | 93篇 |
自动化技术 | 135篇 |
出版年
2023年 | 9篇 |
2022年 | 22篇 |
2021年 | 30篇 |
2020年 | 22篇 |
2019年 | 15篇 |
2018年 | 25篇 |
2017年 | 21篇 |
2016年 | 27篇 |
2015年 | 26篇 |
2014年 | 31篇 |
2013年 | 63篇 |
2012年 | 61篇 |
2011年 | 53篇 |
2010年 | 53篇 |
2009年 | 53篇 |
2008年 | 52篇 |
2007年 | 53篇 |
2006年 | 45篇 |
2005年 | 34篇 |
2004年 | 35篇 |
2003年 | 30篇 |
2002年 | 28篇 |
2001年 | 37篇 |
2000年 | 30篇 |
1999年 | 27篇 |
1998年 | 51篇 |
1997年 | 37篇 |
1996年 | 19篇 |
1995年 | 21篇 |
1994年 | 11篇 |
1993年 | 10篇 |
1992年 | 4篇 |
1991年 | 3篇 |
1990年 | 4篇 |
1989年 | 2篇 |
1988年 | 2篇 |
1986年 | 3篇 |
1985年 | 3篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1981年 | 4篇 |
1980年 | 5篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1976年 | 2篇 |
1973年 | 2篇 |
1969年 | 1篇 |
1968年 | 1篇 |
1967年 | 2篇 |
排序方式: 共有1075条查询结果,搜索用时 0 毫秒
11.
A model representing the wet-end section of a paper mill has been developed to characterize its dynamic behavior during the
grade change. The model is based on the mass balance relationships written for the simplified wetend white water network.
From the linearization of the dynamic model, higher-order Laplace transfer functions were obtained followed by the reduction
procedure to give simple lower-order models in the form of 1st-order or 2nd-order plus dead times. The dynamic response of the wet-end is influenced both by the white water volume and by the level
of wire retention. Effects of key manipulated variables such as the thick stock flow rate, the ash flow rate and the retention
aid flow rate on the major controlled variables were analyzed by numerical simulations. The simple dynamic model developed
in the present study can be effectively used in the operation and control.
This paper is dedicated to Professor Se Ki Moon on the occasion of his retirement from Hanyang University. 相似文献
12.
The High-Performance Computing (HPC) is an infrastructure to support various research fields. The research using HPC requires big storage for large-scale of raw data and the huge computing resources to analyze. The consolidated operations of the computing center for supporting various researches using HPC are a very effective organization. The consolidated operations are able to increase the utilization. The computing center has to be re-organized continuously in order to support the various fields of research effectively and flexibly. Re-organization to reuse the limited resources enforces the update of the information for verification of the computing resources after the re-allocation of computing resources and the re-distribution of trusted connection between computing resources. Consequently, to maintain effective research support we need automated resource re-organization environment. In this paper, we build an automated update of the trusted connection for re-organized computing resource using puppet which is automated system management platform. Finally, we provide a unified verification point and efficient environment for the re-allocation and re-organization of the integrated computing center. 相似文献
13.
Yeong-Koo Yeo Jong Ho Park See-Han Park Changman Sohn 《Korean Journal of Chemical Engineering》2005,22(3):339-344
In this work, the Model Algorithmic Control (MAC) method is applied to control the grade change operations in paper mills.
The neural network model for the grade change operations is identified first and the impulse model is extracted from the neural
network model. Results of simulations for MAC control of grade change operations are compared with plant operation data. The
major contribution of the present work is the application of MAC in the industrial plants based on the identification of neural
network models. We can confirm that the proposed MAC method exhibits faster responses and less oscillatory behavior compared
to the plant operation data in the grade change operations. 相似文献
14.
R. S. Yeo J. McBreen A. C. C. Tseung S. Srinivasan J. McElroy 《Journal of Applied Electrochemistry》1980,10(3):393-404
The electrochemical oxidation and reduction of hydrogen and chlorine in hydrochloric acid has been investigated on graphite, ruthenized titanium and platinum electrodes. Both steady state and potentiostatic pulse methods were used. Cell studies were also carried out in cells with flow-by and flow-through chlorine electrodes. Results indicate that the electrode kinetics are fast and the electrolysis and fuel cell reactions can be carried out in the same cell with electric-to-electric efficiencies in excess of 75% at current densities of 300 mA cm–2. Mass transfer limitations at the chlorine electrode during discharge can be eliminated by cell pressurization and the use of flow-through electrodes.This study was carried out under the auspices of the US Department of Energy.in the summers of 1976 and 1977 相似文献
15.
Part I of this two-part paper, which appeared in the June issue, covered the effects of deoxidation with silicon, boron, aluminum, or carbon (under vacuum) on the machinability and microstructure of low-carbon resulfurized steels containing nominally 0.1%C-1.0%Mn-0.25%S. Deoxidation reduced machinability and it was concluded that the removal of oxygen was directly responsible. Deoxidation was found to suppress the formation of large random sulfide inclusions so that sufficiently strong deoxidation, such as with aluminum, caused the steel to solidify with a characteristic eutectic structure in which the inter dendritic sulfide inclusions were comparatively small. Consequently, the inclusions in the rolled steel were small and machinability was reduced. 相似文献
16.
17.
18.
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph
equals the smallest number of edges of an interval supergraph. Since computing the profile of a graph is an NP-hard problem,
we consider parameterized versions of the problem. Namely, we study the problem of deciding whether the profile of a connected
graph of order n is at most n−1+k, considering k as the parameter; this is a parameterization above guaranteed value, since n−1 is a tight lower bound for the profile. We present two fixed-parameter algorithms for this problem. The first algorithm
is based on a forbidden subgraph characterization of interval graphs. The second algorithm is based on two simple kernelization
rules which allow us to produce a kernel with linear number of vertices and edges. For showing the correctness of the second
algorithm we need to establish structural properties of graphs with small profile which are of independent interest.
A preliminary version of the paper is published in Proc. IWPEC 2006, LNCS vol. 4169, 60–71. 相似文献
19.
Dong-Pyoung Sheen Tae-geun Son Dae-Kwang Myung Cheolho Ryu Sang Hun Lee Kunwoo Lee Tae Jung Yeo 《Computer aided design》2010,42(8):720-730
A simplified geometric model with lower dimensionality, such as a mid-surface model, is often preferred over a detailed solid model for the analysis process, if the analysis results are not seriously impacted. In order to derive a mid-surface model from a thin-walled solid model, in this paper, we propose a novel approach called the solid deflation method. In this method, a solid model is assumed to be created by using air to inflate a shell that comprises the surface of the solid model. First, the model is simplified by the removal of any detailed features whose absence would not alter its overall shape. Next, the solid model itself can be converted into a degenerate solid model with zero thickness. Finally, a surface model is generated by splitting large faces paired in the thinned solid model, selecting one face per pair for creating a sheet model, and sewing the selected faces. Using this method, a more practical and usable mid-surface model can be very efficiently generated from a solid model because it can circumvent not only the tedious trimming and extension processes of the medial axis transformation method but also the time-consuming patch joining process of the mid-surface abstraction approach. 相似文献
20.
Gregory Gutin Eun Jung Kim Matthias Mnich Anders Yeo 《Journal of Computer and System Sciences》2010,76(8):872-878
We study ordinal embedding relaxations in the realm of parameterized complexity. We prove the existence of a quadratic kernel for the Betweenness problem parameterized above its tight lower bound, which is stated as follows. For a set V of variables and set C of constraints “vi is between vj and vk”, decide whether there is a bijection from V to the set {1,…,|V|} satisfying at least |C|/3+κ of the constraints in C. Our result solves an open problem attributed to Benny Chor in Niedermeier's monograph “Invitation to Fixed-Parameter Algorithms”. The betweenness problem is of interest in molecular biology. An approach developed in this paper can be used to determine parameterized complexity of a number of other optimization problems on permutations parameterized above or below tight bounds. 相似文献