全文获取类型
收费全文 | 225篇 |
免费 | 3篇 |
专业分类
化学工业 | 25篇 |
机械仪表 | 2篇 |
建筑科学 | 6篇 |
矿业工程 | 1篇 |
能源动力 | 1篇 |
轻工业 | 10篇 |
水利工程 | 1篇 |
无线电 | 62篇 |
一般工业技术 | 30篇 |
冶金工业 | 52篇 |
原子能技术 | 3篇 |
自动化技术 | 35篇 |
出版年
2023年 | 1篇 |
2022年 | 7篇 |
2021年 | 5篇 |
2020年 | 2篇 |
2019年 | 3篇 |
2018年 | 2篇 |
2016年 | 10篇 |
2015年 | 12篇 |
2014年 | 6篇 |
2013年 | 8篇 |
2012年 | 2篇 |
2011年 | 5篇 |
2010年 | 8篇 |
2009年 | 15篇 |
2008年 | 10篇 |
2007年 | 8篇 |
2006年 | 8篇 |
2005年 | 3篇 |
2004年 | 10篇 |
2003年 | 4篇 |
2002年 | 4篇 |
2001年 | 5篇 |
2000年 | 1篇 |
1999年 | 4篇 |
1998年 | 11篇 |
1997年 | 12篇 |
1996年 | 5篇 |
1995年 | 3篇 |
1994年 | 6篇 |
1993年 | 9篇 |
1992年 | 5篇 |
1991年 | 2篇 |
1990年 | 5篇 |
1989年 | 4篇 |
1988年 | 2篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1981年 | 1篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1976年 | 5篇 |
1975年 | 3篇 |
1973年 | 1篇 |
1971年 | 1篇 |
1965年 | 1篇 |
1964年 | 1篇 |
1958年 | 2篇 |
排序方式: 共有228条查询结果,搜索用时 31 毫秒
71.
Ziv J. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》1990,36(4):861-863
It is demonstrated that for finite-alphabet, k th-order ergodic Markov sources (i.e. memory of k letters), a variable-to-fixed length code is better than the best fixed-to-variable length code (Huffman code). It is shown how to construct a variable-to-fixed length code for a k th order ergodic Markov source, which compresses more effectively than the best fixed-to-variable code 相似文献
72.
Plotnik E. Weinberger M.J. Ziv J. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》1992,38(1):66-72
An upper bound on the probability of a sequence drawn from a finite-state source is derived. The bound is given in terms of the number of phrases obtained by parsing the sequence according to the Lempel-Ziv (L-Z) incremental parsing rule, and is universal in the sense that it does not depend on the statistical parameters that characterize the source. This bound is used to derive an upper bound on the redundance of the L-Z universal data compression algorithm applied to finite-state sources, that depends on the length N of the sequence, on the number K of states of the source, and, eventually, on the source entropy. A variation of the L-Z algorithm is presented, and an upper bound on its redundancy is derived for finite-state sources. A method to derive tighter implicit upper bounds on the redundancy of both algorithms is also given, and it is shown that for the proposed variation this bound is smaller than for the original L-Z algorithm, or every value of N and K 相似文献
73.
Hershkovits Y. Ziv J. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》1998,44(1):66-78
Nonasymptotic coding and converse theorems are derived for universal data compression algorithms in cases where the training sequence (“history”) that is available to the encoder consists of the most recent segment of the input data string that has been processed, but is not large enough so as to yield the ultimate compression, namely, the entropy of the source 相似文献
74.
The channel capacity of a parallel bus structure was examined in relation to the ever increasing demand for signal input and output. The limitations on signal integrity caused by both far-end and near-end crosstalk noise were considered. Expressions for the signal waveforms were developed using a rudimentary model. The expressions were then used to evaluate the channel capacity for perfectly matched lines in the high-frequency regime where skin effect and dielectric loss dominate the loss due to the static resistance. The analysis showed that binary logic yields the maximum channel capacity. For the parameters assumed as an illustrative example, the input rise time needed to achieve the maximum channel capacity cannot be achieved with today's technology. For source rise times longer than this threshold or optimum rise time, the maximum channel capacity is achieved by using multilevel logic. In the case of short lines, insufficient coupling exists between lines to meet the channel capacity condition for two levels. Therefore, for short lines multiple logic also is necessary to achieve maximum channel capacity 相似文献
75.
76.
77.
78.
We report a case of giant ectopic pelvic spleen combined with an accessory spleen and confirmed by liver-spleen scan, angiography, magnetic resonance imaging, and surgical findings. In various reviews of the literature, no ectopic pelvic spleen larger than this one has been reported. 相似文献
79.
The formation of a growth cone at the tip of a severed axon is a key step in its successful regeneration. This process involves major structural and functional alterations in the formerly differentiated axonal segment. Here we examined the hypothesis that the large, localized, and transient elevation in the free intracellular calcium concentration ([Ca2+]i) that follows axotomy provides a signal sufficient to trigger the dedifferentiation of the axonal segment into a growth cone. Ratiometric fluorescence microscopy and electron microscopy were used to study the relations among spatiotemporal changes in [Ca2+]i, growth cone formation, and ultrastructural alterations in axotomized and intact Aplysia californica neurons in culture. We report that, in neurons primed to grow, a growth cone forms within 10 min of axotomy near the tip of the transected axon. The nascent growth cone extends initially from a region in which peak intracellular Ca2+ concentrations of 300-500 microM are recorded after axotomy. Similar [Ca2+]i transients, produced in intact axons by focal applications of ionomycin, induce the formation of ectopic growth cones and subsequent neuritogenesis. Electron microscopy analysis reveals that the ultrastructural alterations associated with axotomy and ionomycin-induced growth cone formation are practically identical. In both cases, growth cones extend from regions in which sharp transitions are observed between axoplasm with major ultrastructural alterations and axoplasm in which the ultrastructure is unaltered. These findings suggest that transient elevations of [Ca2+]i to 300-500 microM, such as those caused by mechanical injury, may be sufficient to induce the transformation of differentiated axonal segments into growth cones. 相似文献
80.
Y Ziv JM Church JR Oakley E McGannon TK Schroeder VF Fazio 《Canadian Metallurgical Quarterly》1996,83(11):1578-1580
Although the operation of choice for patients with familial adenomatous polyposis (FAP) is restorative proctocolectomy with ileal pouch-anal anastomosis (IPAA), its place in the management of patients with FAP and cancer has not been defined. The authors have reviewed their experience with these patients to determine the safety of IPAA and its efficacy as a cancer operation. The records of 55 patients with FAP who had undergone IPAA were examined. Follow-up studies included an annual questionnaire and physical examination. Eight patients had FAP with coexisting colorectal cancer. Median age at diagnosis was 25 (range 13-46) years, and at operation 33 (range 22-36) years. Of the eight patients (four men), four had colonic cancer and four had rectal cancer. Synchronous colorectal carcinoma was found in two patients. Staging according to the tumor node metastasis classification showed that five patients had stage 1 tumour, two had stage 2 and one had stage 3. Tumours were well, moderately or poorly differentiated in one, five and two patients respectively. During a median follow-up of 56 (range 14-98) months, metastasis developed in the liver of one patient 66 months after surgery. Two patients suffered complications: one had small bowel obstruction and the other mucosal prolapse. Tubular adenomas were found in the pouch of two patients and in the anal transitional zone of one. Pouch function is good to excellent in all surviving patients. Restorative proctocolectomy for patients with FAP and coexisting colorectal cancer can be undertaken with a favourable prognosis and function. It is compatible with curative intent. 相似文献