全文获取类型
收费全文 | 248篇 |
免费 | 21篇 |
专业分类
电工技术 | 3篇 |
化学工业 | 42篇 |
金属工艺 | 6篇 |
机械仪表 | 3篇 |
建筑科学 | 11篇 |
能源动力 | 17篇 |
轻工业 | 11篇 |
无线电 | 12篇 |
一般工业技术 | 52篇 |
冶金工业 | 25篇 |
自动化技术 | 87篇 |
出版年
2023年 | 3篇 |
2022年 | 2篇 |
2021年 | 10篇 |
2020年 | 5篇 |
2019年 | 10篇 |
2018年 | 10篇 |
2017年 | 15篇 |
2016年 | 8篇 |
2015年 | 10篇 |
2014年 | 13篇 |
2013年 | 16篇 |
2012年 | 13篇 |
2011年 | 14篇 |
2010年 | 12篇 |
2009年 | 11篇 |
2008年 | 8篇 |
2007年 | 14篇 |
2006年 | 9篇 |
2005年 | 4篇 |
2004年 | 6篇 |
2003年 | 8篇 |
2002年 | 5篇 |
2001年 | 4篇 |
2000年 | 5篇 |
1999年 | 2篇 |
1998年 | 13篇 |
1997年 | 6篇 |
1996年 | 5篇 |
1995年 | 1篇 |
1994年 | 4篇 |
1993年 | 3篇 |
1992年 | 3篇 |
1990年 | 2篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1986年 | 4篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1981年 | 2篇 |
1979年 | 3篇 |
1974年 | 1篇 |
排序方式: 共有269条查询结果,搜索用时 31 毫秒
1.
In the present research, nanostructured Pd–Cd alloy electrocatalysts with different compositions were produced using the electrodeposition process. The morphology of the samples was studied by scanning electron microscopy analysis. Also, the elemental composition of the samples was determined by energy-dispersive X-ray spectroscopy and elemental mapping tests. Tafel polarization and electrochemical impedance spectroscopy methods were employed to determine the electrochemical corrosion properties of the synthesized samples in a solution containing 0.5 M sulfuric acid and 0.1 M formic acid. The linear sweep voltammetry, cyclic voltammetry, and chronoamperometry techniques were also employed to evaluate the electrocatalytic activity of prepared samples toward the oxidation of formic acid. In this respect, the influence of some factors such as formic acid and sulfuric acid concentrations and also potential scan rate was investigated. Compared to the pure Pd sample, the Pd–Cd samples were more reactive for the oxidation of formic acid. Besides, the sample with a lower amount of Pd (Pd1·3Cd) demonstrated much higher electrocatalytic activity than the Pd7·1Cd and Pd2·1Cd samples. The observed high mass activity of 15.06 A mg?1Pd for the Pd1·3Cd sample which is 21.1 times higher than Pd/C is an interesting result of this study. 相似文献
2.
Epoxy novolac/anhydride cure kinetics has been studied by differential scanning calorimetry under isothermal conditions. The system used in this study was an epoxy novolac resin (DEN431), with nadic methyl anhydride as hardener and benzyldimethylamine as accelerator. Kinetic parameters including the reaction order, activation energy and kinetic rate constants, were investigated. The cure reaction was described with the catalyst concentration, and a normalized kinetic model developed for it. It is shown that the cure reaction is dependent on the cure temperature and catalyst concentration, and that it proceeds through an autocatalytic kinetic mechanism. The curing kinetic constants and the cure activation energies were obtained using the Arrhenius kinetic model. A suggested kinetic model with a diffusion term was successfully used to describe and predict the cure kinetics of epoxy novolac resin compositions as a function of the catalyst content and temperature. Copyright © 2003 Society of Chemical Industry 相似文献
3.
We consider the problem of scheduling jobs on related machines owned by selfish agents. We provide a 5-approximation deterministic
truthful mechanism, the first deterministic truthful result for the problem. Previously, Archer and Tardos showed a 2-approximation
randomized mechanism which is truthful in expectation only (a weaker notion of truthfulness). In case the number of machines
is constant, we provide a deterministic Fully Polynomial-Time Approximation Scheme (FPTAS) and a suitable payment scheme that
yields a truthful mechanism for the problem. This result, which is based on converting FPTAS to monotone FPTAS, improves a
previous result of Auletta et al., who showed a (4 + ε)-approximation truthful mechanism. 相似文献
4.
Christian Azar 《Energy》1994,19(12):1255-1261
Haraden's model for estimating the economic cost of global warming is analysed. We change his method of discounting and some of his input parameters in a manner consistent with physical and economic theory as well as empirical data. We then find much higher costs than Haraden found. These costs are compared to the cost of reducing CO2 emissions and we find that deep cuts of the emissions of CO2 are preferable. A check of the sensitivity of our results with respect to some crucial parameter values does not alter that conclusion. 相似文献
5.
Given an array ofn input numbers, therange-maxima problem is that of preprocessing the data so that queries of the type what is the maximum value in subarray [i..j] can be answered quickly using one processor. We present a randomized preprocessing algorithm that runs inO(log*
n) time with high probability, using an optimal number of processors on a CRCW PRAM; each query can be processed in constant time by one processor. We also present a randomized algorithm for a parallel comparison model. Using an optimal number of processors, the preprocessing algorithm runs inO( (n)) time with high probability; each query can be processed inO ( (n)) time by one processor. (As is standard, (n) is the inverse of Ackermann function.) A constant time query can be achieved by some slowdown in the performance of the preprocessing stage. 相似文献
6.
Performance analysis of support vector machines classifiers in breast cancer mammography recognition
Support vector machine (SVM) is a supervised machine learning approach that was recognized as a statistical learning apotheosis for the small-sample database. SVM has shown its excellent learning and generalization ability and has been extensively employed in many areas. This paper presents a performance analysis of six types of SVMs for the diagnosis of the classical Wisconsin breast cancer problem from a statistical point of view. The classification performance of standard SVM (St-SVM) is analyzed and compared with those of the other modified classifiers such as proximal support vector machine (PSVM) classifiers, Lagrangian support vector machines (LSVM), finite Newton method for Lagrangian support vector machine (NSVM), Linear programming support vector machines (LPSVM), and smooth support vector machine (SSVM). The experimental results reveal that these SVM classifiers achieve very fast, simple, and efficient breast cancer diagnosis. The training results indicated that LSVM has the lowest accuracy of 95.6107 %, while St-SVM performed better than other methods for all performance indices (accuracy = 97.71 %) and is closely followed by LPSVM (accuracy = 97.3282). However, in the validation phase, the overall accuracies of LPSVM achieved 97.1429 %, which was superior to LSVM (95.4286 %), SSVM (96.5714 %), PSVM (96 %), NSVM (96.5714 %), and St-SVM (94.86 %). Value of ROC and MCC for LPSVM achieved 0.9938 and 0.9369, respectively, which outperformed other classifiers. The results strongly suggest that LPSVM can aid in the diagnosis of breast cancer. 相似文献
7.
Pattern Analysis and Applications - We present a method for determining which of a large set of pixels are inside or on the boundary of a polygon. The method works much quicker than the standard... 相似文献
8.
Hammam Al‐Bustami Guy Koplovitz Darinka Primc Shira Yochelis Eyal Capua Danny Porath Ron Naaman Yossi Paltiel 《Small (Weinheim an der Bergstrasse, Germany)》2018,14(30)
There is an increasing demand for the development of a simple Si‐based universal memory device at the nanoscale that operates at high frequencies. Spin‐electronics (spintronics) can, in principle, increase the efficiency of devices and allow them to operate at high frequencies. A primary challenge for reducing the dimensions of spintronic devices is the requirement for high spin currents. To overcome this problem, a new approach is presented that uses helical chiral molecules exhibiting spin‐selective electron transport, which is called the chiral‐induced spin selectivity (CISS) effect. Using the CISS effect, the active memory device is miniaturized for the first time from the micrometer scale to 30 nm in size, and this device presents memristor‐like nonlinear logic operation at low voltages under ambient conditions and room temperature. A single nanoparticle, along with Au contacts and chiral molecules, is sufficient to function as a memory device. A single ferromagnetic nanoplatelet is used as a fixed hard magnet combined with Au contacts in which the gold contacts act as soft magnets due to the adsorbed chiral molecules. 相似文献
9.
Yossi Azar Uriel Feige Iftah Gamzu Thomas Moscibroda Prasad Raghavendra 《Theory of Computing Systems》2011,49(4):738-756
We consider buffer management of unit packets with deadlines for a multi-port device with reconfiguration overhead. The goal
is to maximize the throughput of the device, i.e., the number of packets delivered by their deadline. For a single port or
with free reconfiguration, the problem reduces to the well-known packets scheduling problem, where the celebrated earliest-deadline-first
(EDF) strategy is optimal 1-competitive. However, EDF is not 1-competitive when there is a reconfiguration overhead. We design
an online algorithm that achieves a competitive ratio of 1−o(1) when the ratio between the minimum laxity of the packets and the number of ports tends to infinity. This is one of the
rare cases where one can design an almost 1-competitive algorithm. One ingredient of our analysis, which may be interesting
on its own right, is a perturbation theorem on EDF for the classical packets scheduling problem. Specifically, we show that
a small perturbation in the release and deadline times cannot significantly degrade the optimal throughput. This implies that
EDF is robust in the sense that its throughput is close to the optimum even when the deadlines are not precisely known. 相似文献
10.
We consider the on-line version of the maximum vertex disjoint path problem when the underlying network is a tree. In this
problem, a sequence of requests arrives in an on-line fashion, where every request is a path in the tree. The on-line algorithm
may accept a request only if it does not share a vertex with a previously accepted request. The goal is to maximize the number
of accepted requests. It is known that no on-line algorithm can have a competitive ratio better than Ω(log n) for this problem, even if the algorithm is randomized and the tree is simply a line. Obviously, it is desirable to beat
the logarithmic lower bound. Adler and Azar (Proc. of the 10th ACM-SIAM Symposium on Discrete Algorithm, pp. 1–10, 1999) showed that if preemption is allowed (namely, previously accepted requests may be discarded, but once a request is discarded
it can no longer be accepted), then there is a randomized on-line algorithm that achieves constant competitive ratio on the
line. In the current work we present a randomized on-line algorithm with preemption that has constant competitive ratio on
any tree. Our results carry over to the related problem of maximizing the number of accepted paths subject to a capacity constraint
on vertices (in the disjoint path problem this capacity is 1). Moreover, if the available capacity is at least 4, randomization
is not needed and our on-line algorithm becomes deterministic. 相似文献