全文获取类型
收费全文 | 213篇 |
免费 | 5篇 |
专业分类
电工技术 | 8篇 |
综合类 | 1篇 |
化学工业 | 24篇 |
金属工艺 | 1篇 |
机械仪表 | 2篇 |
建筑科学 | 9篇 |
能源动力 | 19篇 |
轻工业 | 8篇 |
水利工程 | 2篇 |
石油天然气 | 4篇 |
无线电 | 30篇 |
一般工业技术 | 44篇 |
冶金工业 | 25篇 |
原子能技术 | 4篇 |
自动化技术 | 37篇 |
出版年
2024年 | 1篇 |
2022年 | 3篇 |
2021年 | 12篇 |
2020年 | 2篇 |
2019年 | 5篇 |
2018年 | 9篇 |
2017年 | 9篇 |
2016年 | 5篇 |
2015年 | 4篇 |
2014年 | 7篇 |
2013年 | 18篇 |
2012年 | 9篇 |
2011年 | 11篇 |
2010年 | 7篇 |
2009年 | 7篇 |
2008年 | 14篇 |
2007年 | 10篇 |
2006年 | 7篇 |
2005年 | 5篇 |
2004年 | 4篇 |
2003年 | 1篇 |
2002年 | 3篇 |
2001年 | 3篇 |
2000年 | 1篇 |
1999年 | 3篇 |
1998年 | 6篇 |
1997年 | 2篇 |
1996年 | 6篇 |
1995年 | 8篇 |
1994年 | 5篇 |
1992年 | 4篇 |
1991年 | 4篇 |
1989年 | 1篇 |
1988年 | 3篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1983年 | 3篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1976年 | 3篇 |
1975年 | 1篇 |
1974年 | 1篇 |
排序方式: 共有218条查询结果,搜索用时 15 毫秒
1.
Three new circuit topologies for first-order all-pass filters, each with two variations, realising six new first-order voltage-mode all-pass sections are proposed. Each circuit employs two differential voltage current conveyors and three grounded passive components, ideal for IC implementation. All the circuits possess high input impedance, which is a desirable feature for voltage-mode circuits. As an application, a new quadrature oscillator circuit is realised using one of the proposed all-pass circuits. PSPICE simulations using 0.5 mum CMOS parameters confirm the validity and practical utility of the proposed circuits 相似文献
2.
A limited selection of samples of small and medium size air-conditioning equipment being marketed or manufactured in Kuwait was tested in an internationally reputed laboratory. The actual performance results obtained from laboratory tests were analyzed and compared with the commercially available information from the manufacturers for the same selected units. The analysis indicated the quality of air-conditioning equipment available to the Kuwaiti user. 相似文献
3.
In this paper we design a dynamic dictionary for
the priced information model initiated by Charikar et al. Assume that a set S consisting of n elements is given such that
each element has an associated price, a positive real number. The cost of performing an operation on elements of S is a function
of their prices. The cost of an algorithm is the sum of the costs of
all operations it performs. The objective is to design algorithms
which incur low cost. In this model we propose a dynamic dictionary, supporting
search, insert and delete, for keys drawn from a linearly ordered set.
As an application we show that the dictionary can be used in
computing the trapezoidal map of a set of line segments, a fundamental problem in
computational geometry. 相似文献
4.
5.
Artificial intelligence (AI) has been heralded by many as the next source of business value. Grounded on the resource-based theory of the firm and on recent work on AI at the organizational context, this study (1) identifies the AI-specific resources that jointly create an AI capability and provides a definition, (2) develops an instrument to capture the AI capability of the firms, and (3) examines the relationship between an AI capability and organizational creativity and performance. Findings empirically support the suggested theoretical framework and corresponding instrument and provide evidence that an AI capability results in increased organizational creativity and performance. 相似文献
6.
Maheshwari Rashmi Kumar Naveen Shadi Monal Tiwari Shailesh 《The Journal of supercomputing》2021,77(8):8653-8673
The Journal of Supercomputing - Data availability ensures efficient data accessibility by the readers anytime and from anywhere. It can be addressed by creating multiple copies of each data file... 相似文献
7.
Prosenjit Bose Paz Carmi Mirela Damian Robin Flatland Matthew J. Katz Anil Maheshwari 《Algorithmica》2014,69(2):397-409
For any angle α<2π, we show that any connected communication graph that is induced by a set P of n transceivers using omni-directional antennas of radius 1, can be replaced by a strongly connected communication graph, in which each transceiver in P is equipped with a directional antenna of angle α and radius r dir, for some constant r dir=r dir(α). Moreover, the new communication graph is a c-spanner of the original graph, for some constant c=c(α), with respect to number of hops. 相似文献
8.
9.
Subir Kumar Ghosh Anil Maheshwari Sudebkumar Prasant Pal C. E. Veni Madhavan 《The Visual computer》1994,10(8):443-451
A polygonP is said to be apalm polygon if there exists a pointxP such that the Euclidean shortest path fromx to any pointyP makes only left turns or only right turns. The set of all such pointsx is called thepalm kernel. In this paper we propose an O(E) time algorithm for recognizing a palm polygonP, whereE is the size of the visibility graph ofP. The algorithm recognizes the given polygonP as a palm polygon by computing the palm kernel ofP. If the palm kernel is not empty,P is a palm polygon.The extended abstract of this paper was reported at the Second Canadian Conference in Computational Geometry, pp. 246–251, 1990 相似文献
10.
Subir Kumar Ghosh Partha Pratim Goswami Anil Maheshwari Subhas Chandra Nandy Sudebkumar Prasant Pal Swami Sarvattomananda 《The Visual computer》2012,28(12):1229-1237
Let s be a point source of light inside a polygon P of n vertices. A polygonal path from s to some point t inside P is called a diffuse reflection path if the turning points of the path lie on edges of?P. A?diffuse reflection path is said to be optimal if it has the minimum number of reflections on the path. The problem of computing a diffuse reflection path from s to t inside P has not been considered explicitly in the past. We present three different algorithms for this problem which produce suboptimal paths. For constructing such a path, the first algorithm uses a greedy method, the second algorithm uses a transformation of a minimum link path, and the third algorithm uses the edge–edge visibility graph of?P. The first two algorithms are for polygons without holes, and they run in O(n+klogn) time, where k denotes the number of reflections in the constructed path. The third algorithm is for polygons with or without holes, and it runs in O(n 2) time. The number of reflections in the path produced by this third algorithm can be at most three times that of an optimal diffuse reflection path. Though the combinatorial approach used in the third algorithm gives a better bound on the number of reflections on the path, the first and the second algorithms stand on the merit of their elegant geometric approaches based on local geometric information. 相似文献