全文获取类型
收费全文 | 2706篇 |
免费 | 17篇 |
国内免费 | 3篇 |
专业分类
电工技术 | 12篇 |
化学工业 | 156篇 |
金属工艺 | 10篇 |
机械仪表 | 10篇 |
建筑科学 | 11篇 |
矿业工程 | 4篇 |
能源动力 | 25篇 |
轻工业 | 47篇 |
水利工程 | 4篇 |
无线电 | 59篇 |
一般工业技术 | 168篇 |
冶金工业 | 2163篇 |
原子能技术 | 8篇 |
自动化技术 | 49篇 |
出版年
2023年 | 7篇 |
2022年 | 17篇 |
2021年 | 25篇 |
2020年 | 18篇 |
2019年 | 13篇 |
2018年 | 26篇 |
2017年 | 12篇 |
2016年 | 25篇 |
2015年 | 8篇 |
2014年 | 24篇 |
2013年 | 46篇 |
2012年 | 24篇 |
2011年 | 43篇 |
2010年 | 42篇 |
2009年 | 33篇 |
2008年 | 26篇 |
2007年 | 29篇 |
2006年 | 19篇 |
2005年 | 11篇 |
2004年 | 13篇 |
2003年 | 10篇 |
2002年 | 7篇 |
2001年 | 7篇 |
1999年 | 75篇 |
1998年 | 696篇 |
1997年 | 387篇 |
1996年 | 256篇 |
1995年 | 155篇 |
1994年 | 120篇 |
1993年 | 137篇 |
1992年 | 16篇 |
1991年 | 23篇 |
1990年 | 26篇 |
1989年 | 29篇 |
1988年 | 39篇 |
1987年 | 33篇 |
1986年 | 12篇 |
1985年 | 18篇 |
1984年 | 3篇 |
1983年 | 7篇 |
1982年 | 11篇 |
1981年 | 12篇 |
1980年 | 15篇 |
1979年 | 4篇 |
1978年 | 7篇 |
1977年 | 42篇 |
1976年 | 102篇 |
1975年 | 7篇 |
1971年 | 3篇 |
1955年 | 2篇 |
排序方式: 共有2726条查询结果,搜索用时 15 毫秒
61.
Nanduri V. Sudarsan Samir K. Das Smita D. Naik 《Propellants, Explosives, Pyrotechnics》2016,41(5):844-849
Determination of propellant formulation by ballistic requirement is an important area of research in recent times. In this study, a theoretical method for the design of gun propellant formulation using primary data of ingredients and necessary thermochemical properties of the resultant propellant was established. The employed method is based on a mathematical model of thermochemical properties of the propellant by optimizing the heat of explosion of the propellant using the fmincon tool in MATLAB. A graphical user interface (GUI) based code was generated and developed for the formulation design of solid gun propellants. The designed code was verified by available data in the literature. Such code will be useful to the researchers working in the area of high energy materials for the design of unknown propellant compositions. Further, it can be extended to redesign the existing propellant formulation in order to enhance the ballistic performance. 相似文献
62.
63.
K. B. Naik 《电力部件与系统》2013,41(5-6):335-345
ABSTRACT This paper describes a method to estimate the value of a critical inductance for a dc separately excited motor fed by load dependent chopper to eliminate the discontinuous conduction of armature current. A trapezoid approximation has been used to estimate the value of the commutation time of the chopper. To verify the suitability of the method, the performance equations corresponding to different intervals of a chopping cycle are solved numerically on a digital computer. The value of critical inductance has also been obtained using the method developed for rectangular wave chopper. It is found that the proposed method predicts more accurate value of the critical inductance than that of a rectangular wave chopper. It is also seen that a much larger value of the inductance is needed to eliminate the discontinuous conduction in dc separately excited motor fed by load dependent chopper than using rectangular wave chopper. 相似文献
64.
65.
Gradient Boundary Detection for Time Series Snapshot Construction in Sensor Networks 总被引:1,自引:0,他引:1
Jie Lian Lei Chen Naik K. Yunhao Liu Agnew G.B. 《Parallel and Distributed Systems, IEEE Transactions on》2007,18(10):1462-1475
In many applications of sensor networks, the sink needs to keep track of the history of sensed data of a monitored region for scientific analysis or supporting historical queries. We call these historical data a time series of value distributions or snapshots. Obviously, to build the time series snapshots by requiring all of the sensors to transmit their data to the sink periodically is not energy efficient. In this paper, we introduce the idea of gradient boundary and propose the gradient boundary detection (GBD) algorithm to construct these time series snapshots of a monitored region. In GBD, a monitored region is partitioned into a set of subregions and all sensed data in one subregion are within a predefined value range, namely, the gradient interval. Sensors located on the boundaries of the subregions are required to transmit the data to the sink and, then, the sink recovers all subregions to construct snapshots of the monitored area. In this process, only the boundary sensors transmit their data and, therefore, energy consumption is greatly reduced. The simulation results show that GBD is able to build snapshots with a comparable accuracy and has up to 40 percent energy savings compared with the existing approaches for large gradient intervals. 相似文献
66.
Three groups of gamma-aminobutyric acid--containing neurons were found in the mammillary region of the posterior hypothalamus. The groups correspond to the tuberal, caudal, and postmammillary caudal magnocellular nuclei. Many cells in these nuclei were retrogradely labeled with fast blue after the injection of this fluorescent dye into the neocortex. Immunohistochemical experiments showed that these same neurons also contained the gamma-aminobutyric acid-synthesizing enzyme glutamate decarboxylase. These results provide morphological evidence for a gamma-aminobutyric acid pathway arising in magnocellular neurons of the posterior hypothalamus and innervating the neocortex. 相似文献
67.
We study three types of self‐reducibility that are motivated by the theory of program verification. A set A is random‐self‐reducible if one can determine whether an input x is in A by making random queries to an A‐oracle. The distribution of each query may depend only on the length of x. A set B is self‐correctable over a distribution if one can convert a program that is correct on most of the probability mass of to a probabilistic program that is correct everywhere. A set C is coherent if one can determine whether an input x is in C by asking questions to an oracle for C–{x}.?We first show that adaptive coherence is more powerful than nonadaptive coherence, even if the nonadaptive querier is nonuniform.
Blum et al.(1993) showed that every random‐self‐reducible function is self‐correctable. It is unknown, however, whether self‐correctability
implies random‐self‐reducibility. We show, assuming a reasonable complexity‐theoretic hypothesis, that certain hard, sparse,
tally sets exist, and that there is a self‐correctable function which is not random‐self‐reducible. For easily samplable distributions,
however, we show that constructing a self‐correctable function that is not random‐self‐reducible is as hard as proving that
P is different from PP.
Received: 14 June, 1996 相似文献
68.
Naik Anima Satapathy Suresh Chandra Ashour Amira S. Dey Nilanjan 《Neural computing & applications》2018,30(1):271-287
Neural Computing and Applications - Cost and physical constraints in the engineering applied problems obligate finding the best results that global optimization algorithms cannot realize. For... 相似文献
69.
Nayak Janmenjoy Meher Saroj K. Souri Alireza Naik Bighnaraj Vimal S. 《The Journal of supercomputing》2022,78(13):14866-14891
The Journal of Supercomputing - The Internet of Medical Things (IoMT) is a bionetwork of allied medical devices, sensors, wearable biosensor devices, etc. It is gradually reforming the healthcare... 相似文献
70.
Distinct multicolored region descriptors for object recognition 总被引:1,自引:0,他引:1
Naik SK Murthy CA 《IEEE transactions on pattern analysis and machine intelligence》2007,29(7):1291-1296