全文获取类型
收费全文 | 204篇 |
免费 | 6篇 |
专业分类
电工技术 | 2篇 |
综合类 | 3篇 |
化学工业 | 52篇 |
金属工艺 | 2篇 |
机械仪表 | 3篇 |
建筑科学 | 19篇 |
能源动力 | 3篇 |
轻工业 | 9篇 |
水利工程 | 5篇 |
无线电 | 16篇 |
一般工业技术 | 45篇 |
冶金工业 | 30篇 |
自动化技术 | 21篇 |
出版年
2023年 | 1篇 |
2021年 | 2篇 |
2020年 | 5篇 |
2018年 | 1篇 |
2017年 | 3篇 |
2016年 | 5篇 |
2015年 | 2篇 |
2014年 | 5篇 |
2013年 | 13篇 |
2012年 | 3篇 |
2011年 | 11篇 |
2010年 | 10篇 |
2009年 | 7篇 |
2008年 | 18篇 |
2007年 | 9篇 |
2006年 | 16篇 |
2005年 | 3篇 |
2004年 | 3篇 |
2003年 | 4篇 |
2002年 | 1篇 |
2001年 | 1篇 |
2000年 | 4篇 |
1999年 | 6篇 |
1998年 | 10篇 |
1997年 | 5篇 |
1996年 | 3篇 |
1995年 | 3篇 |
1994年 | 1篇 |
1993年 | 5篇 |
1992年 | 3篇 |
1991年 | 2篇 |
1990年 | 2篇 |
1989年 | 6篇 |
1988年 | 2篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1985年 | 6篇 |
1984年 | 4篇 |
1983年 | 2篇 |
1982年 | 5篇 |
1980年 | 2篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1976年 | 4篇 |
1974年 | 3篇 |
1973年 | 1篇 |
1972年 | 1篇 |
1962年 | 1篇 |
排序方式: 共有210条查询结果,搜索用时 15 毫秒
1.
Manivannan D. Netzer R.H.B. Singhal M. 《Parallel and Distributed Systems, IEEE Transactions on》1997,8(6):623-627
Consistent global checkpoints have many uses in distributed computations. A central question in applications that use consistent global checkpoints is to determine whether a consistent global checkpoint that includes a given set of local checkpoints can exist. Netzer and Xu (1995) presented the necessary and sufficient conditions under which such a consistent global checkpoint can exist, but they did not explore what checkpoints could be constructed. In this paper, we prove exactly which local checkpoints can be used for constructing such consistent global checkpoints. We illustrate the use of our results with a simple and elegant algorithm to enumerate all such consistent global checkpoints 相似文献
2.
A common debugging strategy involves reexecuting a program (on a given input) over and over, each time gaining more information about bugs. Such techniques can fail on message-passing parallel programs. Because of nondeterminacy, different runs on the given input may produce different results. This nonrepeatability is a serious debugging problem, since an execution cannot always be reproduced to track down bugs. This paper presents a technique for tracing and replaying message-passing programs. By tracing the order in which messages are delivered, a reexecution can be forced to deliver messages in their original order, reproducing the original execution. To reduce the overhead of such a scheme, we show that the delivery'order of only messages involved inraces need be traced (and not every message). Our technique makes run-time decisions to detect and trace racing messages and is usuallyoptimal in the sense that the minimal number of racing messages is traced. Experiments indicate that only 1% of the messages are often traced, gaining a reduction of two orders of magnitude over traditional techniques that trace every message. These traces allow an execution to be reproduced any number of times for debugging. Our work is novel in that we adaptively decide what to trace, and trace only those messages that introduce nondeterminacy. With our strategy, large reductions in trace size allow long-running programs to be replayed that were previously unmanageable. In addition, the reduced tracing requirements alleviate tracing bottle-necks, allowing executions to be debugged with substantially lower execution time overhead.This work was supported in part by National Science Foundation grants CCR-8815928 and CCR-9100968, Office of Naval Research grant N00014-89-J-1222, and a grant from Sequent Computer Systems, Inc. 相似文献
3.
Recent progress in road and lane detection: a survey 总被引:2,自引:0,他引:2
The problem of road or lane perception is a crucial enabler for advanced driver assistance systems. As such, it has been an active field of research for the past two decades with considerable progress made in the past few years. The problem was confronted under various scenarios, with different task definitions, leading to usage of diverse sensing modalities and approaches. In this paper we survey the approaches and the algorithmic techniques devised for the various modalities over the last 5 years. We present a generic break down of the problem into its functional building blocks and elaborate the wide range of proposed methods within this scheme. For each functional block, we describe the possible implementations suggested and analyze their underlying assumptions. While impressive advancements were demonstrated at limited scenarios, inspection into the needs of next generation systems reveals significant gaps. We identify these gaps and suggest research directions that may bridge them. 相似文献
4.
Minimizing envy in distributed discrete resource or task allocation, is an unusual distributed optimization challenge, since the quality of the allocation for each of the agents is dependent, not only on its own allocation, but on the allocation of others as well. Thus, in order to perform distributed search for allocations with minimal envy there is a need to design innovative algorithms that can cope with the challenging constraint structure of an envy minimization problem. Distributed methods for minimizing envy among agents in indivisible resource allocation problems are presented. First, Distributed Envy Minimization Problems (DEMP) are formulated as Distributed Constraint Reasoning problems. When the DEMPs are large, and cannot be solved by a complete search an incomplete local search algorithm is presented. Each transfer of a good from one agent to another involves the change of state of more than one agent. Thus, a minimizing envy local search algorithm must build upon actions (transfers) that include multiple agents. Since DEMPs are particularly susceptible to local minima during local search, the paper proposes an algorithm that alternates between two different hill climbing search phases. The first phase uses one-transfer steps while the other exploits envy cycle elimination steps. An algorithm that minimizes envy while preserving efficiency, is proposed. The proposed algorithm finds a Pareto optimal allocation with low envy. In the context of resource allocation problems, a Pareto optimal solution is particularly desirable since it presents a stable solution. The proposed algorithm first finds a divisible Pareto optimal envy-free allocation using a Fisher market equilibrium. This allocation is transferred into an indivisible allocation of goods while maintaining the Pareto optimal characteristic of the allocation and a low envy level among agents. 相似文献
5.
We present an efficient method for learning part-based object class models from unsegmented images represented as sets of
salient features. A model includes parts’ appearance, as well as location and scale relations between parts. The object class
is generatively modeled using a simple Bayesian network with a central hidden node containing location and scale information,
and nodes describing object parts. The model’s parameters, however, are optimized to reduce a loss function of the training
error, as in discriminative methods. We show how boosting techniques can be extended to optimize the relational model proposed,
with complexity linear in the number of parts and the number of features per image. This efficiency allows our method to learn
relational models with many parts and features. The method has an advantage over purely generative and purely discriminative
approaches for learning from sets of salient features, since generative method often use a small number of parts and features,
while discriminative methods tend to ignore geometrical relations between parts. Experimental results are described, using
some bench-mark data sets and three sets of newly collected data, showing the relative merits of our method in recognition
and localization tasks. 相似文献
6.
微波辅助polyol法制备纳米金属镍及磁性研究 总被引:1,自引:1,他引:0
采用微波辅助polyol法成功地制备了直径范围在5~10nm、100~180nm的单分散Ni球,对其磁性进行了测量分析.用XRD和EDAX,接着用TEM和MFM分别对制备的样品进行测试,并用VSM和SQUID进一步讨论了铁磁/反铁磁的界面耦合效应.XRD显示该样品是面心立方结构,EDAX数据表明制备过程中镍球被轻微氧化,MFM和TEM观察结果显示样品金属镍是比较理想的球型,VSM测试结果表明Ni纳米球具有典型的铁磁性. 相似文献
7.
Netanel Aharon Shai Machnes Benni Reznik Jonathan Silman Lev Vaidman 《Natural computing》2013,12(1):5-8
We present a family of nonlocal games in which the inputs the players receive are continuous. We study three representative members of the family. For the first two a team sharing quantum correlations (entanglement) has an advantage over any team restricted to classical correlations. We conjecture that this is true for the third member of the family as well. 相似文献
8.
The interaction between molten gallium and the hydrocarbon medium induced by ultrasonic energy—can gallium carbide be formed?
下载免费PDF全文
![点击此处可从《Journal of the American Ceramic Society》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Vijay Bhooshan Kumar Manuel Monte Olivier Mathon Sakura Pascarelli Ze'ev Porat Aharon Gedanken 《Journal of the American Ceramic Society》2017,100(7):3305-3315
Ultrasonic irradiation of molten gallium in organic liquids (decane, dodecane, etc.) results in dispersion of the gallium into nanometric spheres. These were examined by several analytical methods XRD, DSC, Raman and IR spectroscopy) as well as electron microscopy (SEM, TEM) and found to be composed of Ga and C. The DSC analysis indicates that the Ga has possibly reacted with carbon, while the Raman spectrum of the product demonstrates a strong additional peak that could not be identified. This work explores the possibility that the product is gallium carbide or another gallium‐carbon complex. To investigate the nature of the product, we performed detailed extended X‐ray absorption fine structure (EXAFS) and X‐ray absorption near‐edge structure (XANES) analyses. On the basis of DSC, IR, and Raman it appear to be formation of GaC, whereas the analysis by EXAFS and XANES demonstrated that the gallium is found to be in a higher reduced state (almost metallic), supported by carbon. The question that remains open in addition to the one related to the formation of galium carbide is whether a complex structure, including oxygen contamination is involved in the layers surrounding the Ga as indicated by the EXAFS results. 相似文献
9.
Siguang Chen Rangari Vijaya Kumar Aharon Gedanken Arie Zaban 《Israel journal of chemistry》2001,41(1):51-54
A composite material made of zinc oxide and polyvinyl alcohol was prepared by a sonochemical method. Annealing of the composite under air removed the polymer, leaving porous spheres of ZnO. This change was accompanied by a change of the surface area from 2 m2/g to 34 m2/g. The porous ZnO particles were used as the electrode material for dye-sensitized solar cells (DSSCs). It was tested by forming a film of the doped porous ZnO on a conductive glass support. The performance of the solar cell is reported. 相似文献
10.
Poly(para-xylylene)(PPX)/carbon fiber towpregs were produced by two different in-situ polymerization processes: Electrochemcal polymerization (ECP) and vapor deposition polymerization (VDP). The monomer used for the ECP process was α, α′ -dibromo-para-xylylene and di-para-xylylene was the starting material for the VDP process. A series of tests, including FTIR, WAXD, DSC, TG, and SEM were carried out to identify and compare these two composite towpregs. It has been confirmed that the PPX samples obtained by the two different polymerization processes were basically chemically identical. However, the polymer coating on the fiber surface produced by the VDP process was much smoother than that produced by the ECP process, which produced a porous coating. 相似文献