全文获取类型
收费全文 | 235篇 |
免费 | 8篇 |
专业分类
化学工业 | 72篇 |
金属工艺 | 1篇 |
机械仪表 | 3篇 |
建筑科学 | 2篇 |
轻工业 | 2篇 |
无线电 | 26篇 |
一般工业技术 | 54篇 |
冶金工业 | 15篇 |
原子能技术 | 12篇 |
自动化技术 | 56篇 |
出版年
2024年 | 1篇 |
2023年 | 1篇 |
2022年 | 3篇 |
2021年 | 7篇 |
2020年 | 8篇 |
2019年 | 5篇 |
2018年 | 12篇 |
2017年 | 5篇 |
2016年 | 7篇 |
2015年 | 6篇 |
2014年 | 10篇 |
2013年 | 9篇 |
2012年 | 7篇 |
2011年 | 12篇 |
2010年 | 12篇 |
2009年 | 7篇 |
2008年 | 10篇 |
2007年 | 10篇 |
2006年 | 10篇 |
2005年 | 13篇 |
2004年 | 7篇 |
2003年 | 3篇 |
2002年 | 8篇 |
2001年 | 3篇 |
2000年 | 3篇 |
1999年 | 7篇 |
1998年 | 3篇 |
1997年 | 4篇 |
1996年 | 3篇 |
1995年 | 3篇 |
1994年 | 1篇 |
1993年 | 4篇 |
1991年 | 3篇 |
1990年 | 4篇 |
1988年 | 2篇 |
1987年 | 5篇 |
1986年 | 5篇 |
1985年 | 2篇 |
1984年 | 8篇 |
1983年 | 2篇 |
1982年 | 2篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1976年 | 1篇 |
1972年 | 1篇 |
排序方式: 共有243条查询结果,搜索用时 0 毫秒
1.
A remarkably good correlation between the rate of proton transfer from excited protonated 1-aminopyrene and the gas phase basicities of the organic component in water: organic solvent binary mixtures has been found. We suggest that use of anilinium acids minimizes the effect of anion solvation and Coulomb interactions and enables the influence of the organic cosolvent on the proton transfer to be clearly observed. The model proposed is one in which the proton is always transferred to a water molecule and a concerted proton transfer to a water molecule solvated by the organic cosolvent also occurs. The cosolvent influence is then on this latter species via hydrogen bond interactions. The correlation holds in pure water but not in pure organic solvents where, clearly, the proton must be transferred to the organic molecule. 相似文献
2.
Multiway dynamic mergers with constant delay are an essential component of a parallel logic programming language. Previous attempts to defined efficient mergers have required complex optimising compilers and run-time support. This paper proposes a simple technique to implement mergers efficiently. The technique requires an additional data type and the definition of an operation on it. The operation allows multiple processes to access a stream without incurring the cost of searching for the end of stream. It is specified in Concurrent Prolog and is used to define multiple assignment variables using a monitor. The technique forms the basis for stream merging in Logix, a practical programming environment written in Flat Concurrent Prolog. 相似文献
3.
This paper suggests a general method for compiling OR-parallelism into AND-parallelism. An interpreter for an AND/OR-parallel language written in the AND-parallel subset of the language induces a source-to-source transformation from the full language into the AND-parallel subset. This transformation can be identified and implemented as a special purpose compiler or applied using a general purpose partial evaluator. The method is demonstrated to compile a variant of Concurrent Prolog into an AND-parallel subset of the language called Flat Concurrent Prolog (FCP). It is also shown applicable to the compilation of OR-parallel Prolog to FCP. The transformation identified is simple and efficient. The performance of the method is discussed in the context of programming examples. These compare well with conventionally compiled Prolog programs. 相似文献
4.
5.
6.
Lerner R Rivlin E Rotstein HP 《IEEE transactions on pattern analysis and machine intelligence》2006,28(9):1404-1417
A novel algorithm for pose and motion estimation using corresponding features and a digital terrain map is proposed. Using a digital terrain (or digital elevation) map (DTM/DEM) as a global reference enables the elimination of the ambiguity present in vision-based algorithms for motion recovery. As a consequence, the absolute position and orientation of a camera can be recovered with respect to the external reference frame. In order to do this, the DTM is used to formulate a constraint between corresponding features in two consecutive frames. Explicit reconstruction of the 3D world is not required. When considering a number of feature points, the resulting constraints can be solved using nonlinear optimization in terms of position, orientation, and motion. Such a procedure requires an initial guess of these parameters, which can be obtained from dead-reckoning or any other source. The feasibility of the algorithm is established through extensive experimentation. Performance is compared with a state-of-the-art alternative algorithm, which intermediately reconstructs the 3D structure and then registers it to the DTM. A clear advantage for the novel algorithm is demonstrated in variety of scenarios. 相似文献
7.
The problem of allowing a dynamically changing set of processes fair access to a shared resource is considered, in the context of communication-stream based systems. It is argued that fair binary merge operators alone cannot solve this problem satisfactorily. Two solutions are proposed. One employs binary merge operators with a programmable bias; the other binary and ternary fair merge operators capable of self-balancing, using the concept of 2–3 trees. A Concurrent Prolog implementation of these operators is described. The implementation of the self-balancing merge operators illustrates the expressive power of incomplete messages, a programming technique that supports messages that contain communication channels as arguments. In the course of implementing the self-balancing merge operator, it was necessary to develop a distributed variant of the 2–3 tree deletion algorithm. 相似文献
8.
It is shown that the basic operations of object-oriented programming languages — creating an, object, sending and receiving messages, modifying an object’s state, and forming class-superclass hierarchies — can be implemented naturally in Concurrent Prolog. In addition, a new object-oriented programming paradigm, called incomplete messages, is presented. This paradigm subsumes stream communication, and greatly simplifies the complexity of programs defining communication networks and protocols for managing shared resources. Several interesting programs are presented, including a multiple-window manager. All programs have been developed and tested using the Concurrent Prolog interpreter described in.1) 相似文献
9.
10.