全文获取类型
收费全文 | 235篇 |
免费 | 15篇 |
国内免费 | 2篇 |
专业分类
电工技术 | 4篇 |
综合类 | 2篇 |
化学工业 | 44篇 |
金属工艺 | 2篇 |
机械仪表 | 1篇 |
建筑科学 | 21篇 |
矿业工程 | 5篇 |
能源动力 | 7篇 |
轻工业 | 13篇 |
水利工程 | 1篇 |
石油天然气 | 5篇 |
无线电 | 43篇 |
一般工业技术 | 37篇 |
冶金工业 | 27篇 |
原子能技术 | 1篇 |
自动化技术 | 39篇 |
出版年
2024年 | 2篇 |
2022年 | 10篇 |
2021年 | 7篇 |
2020年 | 7篇 |
2019年 | 7篇 |
2018年 | 5篇 |
2017年 | 7篇 |
2016年 | 8篇 |
2015年 | 12篇 |
2014年 | 5篇 |
2013年 | 13篇 |
2012年 | 13篇 |
2011年 | 8篇 |
2010年 | 10篇 |
2009年 | 8篇 |
2008年 | 6篇 |
2007年 | 7篇 |
2006年 | 6篇 |
2005年 | 7篇 |
2004年 | 8篇 |
2003年 | 3篇 |
2002年 | 9篇 |
2001年 | 4篇 |
2000年 | 3篇 |
1998年 | 11篇 |
1997年 | 7篇 |
1996年 | 4篇 |
1995年 | 2篇 |
1994年 | 2篇 |
1993年 | 6篇 |
1990年 | 2篇 |
1989年 | 2篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1983年 | 5篇 |
1982年 | 5篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1976年 | 1篇 |
1975年 | 2篇 |
1974年 | 3篇 |
1973年 | 2篇 |
1972年 | 5篇 |
1971年 | 1篇 |
1970年 | 4篇 |
1969年 | 2篇 |
1968年 | 1篇 |
1965年 | 1篇 |
排序方式: 共有252条查询结果,搜索用时 15 毫秒
71.
This paper extends Common2, the family of objects that implement and are wait-free implementable from 2 consensus objects, in two ways: First, the stack object is shown to be in the family, refuting a conjecture to the contrary [6]. Second, Common2 is investigated in the unbounded concurrency model, whereas until now it was considered only in an n-process model. We show that the fetch-and-add, test-and-set , and stack objects are in Common2 even with respect to this stronger notion of wait-free implementation. Our constructions rely on a wait-free implementation of immediate snapshots in the unbounded concurrency model, which was previously not known to be possible. The introduction of unbounded concurrency to the study of Common2 opens several directions of research: are there objects that have n-process implementations but are not unbounded concurrency implementable? We conjecture that swap is such an object. Additionally, the hope is that a queue impossibility proof, which eludes us in the n-process model, will be easier to establish in the unbounded concurrency model. 相似文献
72.
Drawing directed graphs using quadratic programming 总被引:1,自引:0,他引:1
Dwyer T Koren Y Marriott K 《IEEE transactions on visualization and computer graphics》2006,12(4):536-548
We describe a new method for visualization of directed graphs. The method combines constraint programming techniques with a high performance force-directed placement (FDP) algorithm. The resulting placements highlight hierarchy in directed graphs while retaining useful properties of FDP; such as emphasis of symmetries and preservation of proximity relations. Our algorithm automatically identifies those parts of the digraph that contain hierarchical information and draws them accordingly. Additionally, those parts that do not contain hierarchy are drawn at the same quality expected from a nonhierarchical, undirected layout algorithm. Our experiments show that this new approach is better able to convey the structure of large digraphs than the most widely used hierarchical graph-drawing method. An interesting application of our algorithm is directional multidimensional scaling (DMDS). DMDS deals with low-dimensional embedding of multivariate data where we want to emphasize the overall flow in the data (e.g., chronological progress) along one of the axes. 相似文献
73.
Mass transfer in an oscillatory electro-osmotic flow (EOF) is theoretically studied, for the case of a cylindrical tube with
a reactive wall. An expression for the dispersion coefficient, reflecting the time-averaged mass flux of an electrically neutral
solute, is derived analytically. Under the influence of a reversible solute-wall mass exchange, the dispersion coefficient
exhibits a complex dependence on the various parameters representing the effects of the electric double-layer thickness, oscillation
frequency, solution transport properties, solute partitioning, and reaction kinetics. Our results suggest that, in the presence
of a reversible mass exchange at the wall, an oscillatory EOF may be used for separation of species. It is found that optimal
conditions for separation are achieved for a thin double-layer, where an inert solute, or one with slow exchange kinetics,
experiences virtually no dispersion while the dispersion is maximized for the reactive solute exhibiting fast kinetics. 相似文献
74.
电气监控管理系统在发电生产中的应用研究 总被引:1,自引:0,他引:1
针对电气联网接入DCS存在的实际问题,提出发电厂电气监控管理系统的概念和技术改进措施,并根据电厂电气系统的特点和功能需求设计了电气监控管理系统的硬件系统,再根据硬件系统要求设计了由多个功能模块构成的软件平台.根据软件模块的功能,开发并组成一个完整的运行系统,从而可以提高发电厂电气自动化水平和运行管理水平.最后通过实际应用验证了该系统的科学性与可行性. 相似文献
75.
76.
A Statistical Theory for Quantitative Association Rules 总被引:7,自引:0,他引:7
Association rules are a key data-mining tool and as such have been well researched. So far, this research has focused predominantly on databases containing categorical data only. However, many real-world databases contain quantitative attributes and current solutions for this case are so far inadequate. In this paper we introduce a new definition of quantitative association rules based on statistical inference theory. Our definition reflects the intuition that the goal of association rules is to find extraordinary and therefore interesting phenomena in databases. We also introduce the concept of sub-rules which can be applied to any type of association rule. Rigorous experimental evaluation on real-world datasets is presented, demonstrating the usefulness and characteristics of rules mined according to our definition. 相似文献
77.
P. Jonathon Phillips Yehuda Vardi Stanley M. Dunn Monte S. Buchsbaum Jacqueline L. Spiegel-Cohen 《International journal of imaging systems and technology》1998,9(1):46-50
We present an algorithm to automatically register magnetic resonance (MR) and positron emission tomographic (PET) images of the human brain. Our algorithm takes an integrated approach: we simultaneously segment the brain in both modalities and register the slices. The algorithm does not attempt to remove the skull from the MR image, but rather uses “templates” constructed from PET images to locate the boundary between the brain and the surrounding tissue in the MR images. The PET templates are a sequence of estimates of the boundary of the brain in the PET images. For each of the templates, the registration algorithm aligns the MR and PET images by minimizing an energy function. The energy function is designed to implicitly model the relevant anatomical structure in the MR image. The template with the lowest energy after registration is the PET brain boundary. The alignment of this template in the MR image marks the MR brain boundary and gives the transformation between the two images. © 1998 John Wiley & Sons, Inc. Int J Imaging Syst Technol, 9, 46–50, 1998 相似文献
78.
79.
80.
Yehuda Lindell 《Journal of Cryptology》2006,19(3):359-377
In this paper we present a simpler construction of a public-key
encryption scheme that achieves adaptive chosen ciphertext
security (CCA2), assuming the existence of trapdoor permutations.
We build on previous works of Sahai and De Santis et al. and
construct a scheme that we believe is the easiest to understand to
date. In particular, it is only slightly more involved than the
Naor--Yung encryption scheme that is secure against passive
chosen-ciphertext attacks (CCA1). We stress that the focus of this
paper is on simplicity only. 相似文献