全文获取类型
收费全文 | 385篇 |
免费 | 9篇 |
国内免费 | 1篇 |
学科分类
工业技术 | 395篇 |
出版年
2023年 | 2篇 |
2022年 | 2篇 |
2021年 | 3篇 |
2020年 | 6篇 |
2019年 | 3篇 |
2018年 | 4篇 |
2017年 | 6篇 |
2016年 | 6篇 |
2015年 | 5篇 |
2014年 | 8篇 |
2013年 | 22篇 |
2012年 | 10篇 |
2011年 | 10篇 |
2010年 | 17篇 |
2009年 | 16篇 |
2008年 | 14篇 |
2007年 | 27篇 |
2006年 | 17篇 |
2005年 | 12篇 |
2004年 | 17篇 |
2003年 | 14篇 |
2002年 | 10篇 |
2001年 | 13篇 |
2000年 | 7篇 |
1999年 | 4篇 |
1998年 | 12篇 |
1997年 | 14篇 |
1996年 | 12篇 |
1995年 | 12篇 |
1994年 | 6篇 |
1993年 | 9篇 |
1992年 | 7篇 |
1991年 | 4篇 |
1990年 | 4篇 |
1989年 | 5篇 |
1988年 | 3篇 |
1987年 | 3篇 |
1986年 | 3篇 |
1985年 | 9篇 |
1984年 | 2篇 |
1983年 | 4篇 |
1982年 | 2篇 |
1981年 | 3篇 |
1980年 | 4篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1977年 | 4篇 |
1976年 | 5篇 |
1975年 | 2篇 |
1973年 | 2篇 |
排序方式: 共有395条查询结果,搜索用时 15 毫秒
1.
2.
Shmuel Yannai Ronald R. Marquardt 《Journal of the science of food and agriculture》1985,36(11):1161-1168
Rats were fed an adequate or a deficient diet and offered water or buthionine sulphoximine (BSO) solution for 2 weeks, and then the same diets with vicine for another week in experiment 1. BSO in combination with the deficient diet caused a marked decrease in blood glutathione (GSH) and growth retardation but failed to show any effects resulting from supplementation with vicine. In experiment 2 the rats were given an adequate diet and BSO as before, and injected intravenously with divicine (DV). Here again, BSO depressed rat growth, and so did DV. Each of the insults also caused haematological changes, especially a fall in GSH, but the most severe changes appeared in the group treated with both BSO and DV. A decrease in haematocrit and increases in adrenal and spleen weight were also noted. In experiment 3 the rats were injected with different doses of DV, without pretreatment with BSO. The main effect was a drop in blood GSH and haematocrit, and an increase in adrenal and spleen weights, all of which were dose-related. Administration of the higher doses of DV resulted in a severe cyanosis followed by death within a relatively short period of time. 相似文献
3.
Maria G Corradini Mark D Normand Micha Peleg 《Journal of the science of food and agriculture》2006,86(5):785-792
Currently, the sterility of heat‐processed food and pharmaceuticals is assessed in terms of an F0 value, based on the equivalence of the heat treatment to an isothermal process at a reference temperature. This F0 value, however, has a meaning if, and only if, the inactivation kinetics of the targeted spores (or cells) follow a first‐order relationship and the temperature dependence of the D value, the reciprocal of the rate constant, is log‐linear. There is growing evidence that these conditions are not satisfied by many spores, including those of Clostridium botulinum and vegetative cells. Consequently, a replacement for the F0 value is proposed in the form of a momentary equivalent time at the reference temperature based on the actual survival pattern of the spores, which need not be log‐linear. This equivalent time can be calculated together with the theoretical survival ratio in real time, thus enabling an operator to monitor the lethality of ongoing industrial heat processes. The concept is demonstrated with published survival data of C. botulinum, for which the Weibullian and log‐logistic models served as primary and secondary models, respectively. The safety factor according to the proposed method is in the number of added minutes of processing, beyond the theoretical time needed to reduce the survival ratio of the targeted spores or cells to a level that would produce practical (or commercial) sterility. Copyright © 2006 Society of Chemical Industry 相似文献
4.
M Peleg 《Critical reviews in food science and nutrition》1992,32(1):59-66
The validity of the WLF model with fixed "universal" coefficients was tested against that of the model original form with variable coefficients using published coefficients of polymers and amorphous sugars crystallization and viscosity data. The disagreement between the two versions of the model is particularly large at temperature ranges starting about 20 to 30 degrees K above the glass transition or reference temperature, excluding the former from being a model of general applicability. Because the WLF model mathematical structure entails the existence of an almost linear region near the reference temperature, establishment of its validity as a kinetic model and meaningful determination of its constants requires data spread over an extended temperature range, especially when the experimental results have a scatter. 相似文献
5.
6.
This paper presents an efficient scheme maintaining a separator decomposition representation in dynamic trees using asymptotically optimal labels. In order to maintain the short labels, the scheme uses relatively low
message complexity. In particular, if the initial dynamic tree contains only the root, then the scheme incurs an O(log4
n) amortized message complexity per topology change, where n is the current number of vertices in the tree. As a separator decomposition is a fundamental decomposition of trees used
extensively as a component in many static graph algorithms, our dynamic scheme for separator decomposition may be used for
constructing dynamic versions to these algorithms. The paper then shows how to use our dynamic separator decomposition to
construct efficient labeling schemes on dynamic trees, using the same message complexity as our dynamic separator scheme.
Specifically, we construct efficient routing schemes on dynamic trees, for both the designer and the adversary port models,
which maintain optimal labels, up to a multiplicative factor of O(log log n). In addition, it is shown how to use our dynamic separator decomposition scheme to construct dynamic labeling schemes supporting
the ancestry and NCA relations using asymptotically optimal labels, as well as to extend a known result on dynamic distance
labeling schemes.
Supported in part at the Technion by an Aly Kaufman fellowship.
Supported in part by a grant from the Israel Science Foundation. 相似文献
7.
Nguyen Dieu My T. Fard Golnar Gharooni Atkins Ashley Bontempo Paul Iuzzolino Michael L. Peleg Orit 《Artificial Life and Robotics》2023,28(1):1-7
Artificial Life and Robotics - Honey bees (Apis mellifera L.) are social insects that makes frequent use of volatile pheromone signals to collectively navigate unpredictable and unknown... 相似文献
8.
9.
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. 相似文献
10.
The Boyer and Moore (BM) pattern matching algorithm is considered as one of the best, but its performance is reduced on binary data. Yet, searching in binary texts has important applications, such as compressed matching. The paper shows how, by means of some pre-computed tables, one may implement the BM algorithm also for the binary case without referring to bits, and processing only entire blocks such as bytes or words, thereby significantly reducing the number of comparisons. Empirical comparisons show that the new variant performs better than regular binary BM and even than BDM. 相似文献