全文获取类型
收费全文 | 27122篇 |
免费 | 2891篇 |
国内免费 | 2446篇 |
专业分类
电工技术 | 1506篇 |
技术理论 | 1篇 |
综合类 | 2371篇 |
化学工业 | 1536篇 |
金属工艺 | 329篇 |
机械仪表 | 802篇 |
建筑科学 | 598篇 |
矿业工程 | 201篇 |
能源动力 | 438篇 |
轻工业 | 216篇 |
水利工程 | 222篇 |
石油天然气 | 159篇 |
武器工业 | 113篇 |
无线电 | 6446篇 |
一般工业技术 | 1553篇 |
冶金工业 | 459篇 |
原子能技术 | 44篇 |
自动化技术 | 15465篇 |
出版年
2024年 | 144篇 |
2023年 | 488篇 |
2022年 | 580篇 |
2021年 | 649篇 |
2020年 | 802篇 |
2019年 | 704篇 |
2018年 | 663篇 |
2017年 | 863篇 |
2016年 | 993篇 |
2015年 | 1146篇 |
2014年 | 1579篇 |
2013年 | 1809篇 |
2012年 | 1779篇 |
2011年 | 2052篇 |
2010年 | 1634篇 |
2009年 | 1969篇 |
2008年 | 2070篇 |
2007年 | 2031篇 |
2006年 | 1617篇 |
2005年 | 1410篇 |
2004年 | 1165篇 |
2003年 | 985篇 |
2002年 | 890篇 |
2001年 | 758篇 |
2000年 | 684篇 |
1999年 | 560篇 |
1998年 | 491篇 |
1997年 | 426篇 |
1996年 | 347篇 |
1995年 | 269篇 |
1994年 | 208篇 |
1993年 | 173篇 |
1992年 | 120篇 |
1991年 | 69篇 |
1990年 | 53篇 |
1989年 | 37篇 |
1988年 | 30篇 |
1987年 | 21篇 |
1986年 | 16篇 |
1985年 | 43篇 |
1984年 | 37篇 |
1983年 | 35篇 |
1982年 | 40篇 |
1981年 | 2篇 |
1980年 | 2篇 |
1979年 | 6篇 |
1978年 | 3篇 |
1976年 | 2篇 |
1965年 | 2篇 |
1951年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
131.
132.
Energy minimization and design for testability 总被引:6,自引:0,他引:6
Srimat T. Chakradhar Vishwani D. Agrawal Michael L. Bushnell 《Journal of Electronic Testing》1994,5(1):57-66
The problem of fault detection in general combinational circuits is NP-complete. The only previous result on identifying easily testable circuits is due to Fujiwara who gave a polynomial time algorithm for detecting any single stuck fault inK-bounded circuits. Such circuits may only contain logic blocks with no more thanK input lines and the blocks are so connected that there is no reconvergent fanout among them. We introduce a new class of combinational circuits called the (k, K)-circuits and present a polynomial time algorithm to detect any single or multiple stuck fault in such circuits. We represent the circuit as an undirected graphG with a vertex for each gate and an edge between a pair of vertices whenever the corresponding gates have a connection. For a (k, K)-circuit,G is a subgraph of ak-tree, which, by definition, cannot have a clique of size greater thank+1. Basically, this is a restriction on gate interconnections rather than on the function of gates comprising the circuit. The (k, K)-circuits are a generalization of Fujiwara'sK-bounded circuits. Using the bidirectional neural network model of the circuit and the energy function minimization formulation of the fault detection problem, we present a test generation algorithm for single and multiple faults in (k, K)-circuits. This polynomial time aggorithm minimizes the energy function by recursively eliminating the variables. 相似文献
133.
134.
BP网络过拟合问题研究及应用 总被引:2,自引:0,他引:2
通过类比信息传递过程中的一般测不准关系式,研究BP网络出现过拟合现象时,代表网络学习能力的权值改变量与反映网络推广能力的未参与训练的检验样本的辨识误差之间的关系.在该关系式中引入一个过拟合参数P,通过对岷江流域紫坪埔站的流量预报,说明在判断网络是否出现过拟合现象时,计算过拟合参数P是一种有研究意义的参考. 相似文献
135.
Liljana Gavrilovska 《Wireless Personal Communications》2006,37(3-4):271-290
Wireless ad hoc networks are temporary formed, infrastructureless networks. Due to the unstable channel conditions and network connectivity, their characteristics impose serious challenges in front of network designers. The layering approach to network design does not fit the ad hoc environment well. Therefore, various cross-layering approaches, where protocol layers actively interact, exchange inherent layer information and fine tune their parameters according to the network status are becoming increasingly popular. This paper presents an in-depth analysis of the latest cross-layering approaches for wireless ad hoc networks supported by several examples. A special emphasis is put on the link and network layer related cross-layer designs. Several link adaptation and efficient service discovery schemes are elaborated through analytical and simulation studies. Their performance shows the potentials of the cross-layering for boosting system characteristics in wireless ad hoc networks.
Liljana Gavrilovska currently holds a position of full professor at Faculty of Electrical Engineering, University “St. Cyril and Metodij” – Skopje, Macedonia. She is chief of Telecommunications Laboratory and teaches undergraduate courses in telecommunication networks, data transmission and switching and traffic theory, and graduate courses in wireless, mobile and personal networks, teletraffic engineering and planning, and broadband multiservices networks. In 2000 she joined the Center for PersonKommunikation, Aalborg University, Denmark, as a visiting professor and during 2001--2002 she held a position of associate research professor at the same university. Currently she holds a part-time position of associated research professor with Center for Teleinfrastructur (CTIF). Prof. Gavrilovska was involved in several EU (ACTS ASAP, IST PACWOMAN, MAGNET, TEMPUS) and national/international projects. She published numerous conference and journal papers and participated in several workshops. At the moment she is working on the book “Ad Hoc Networking Towards Seamless Communications” together with prof. R. Prasad. Her research interests include wireless and personal area networks, ad hoc networking, networking protocols, traffic analysis, QoS, and optimization techniques. She is a senior member of IEEE and serves as a Chair of Macedonian Communication Chapter. 相似文献
136.
ZHANG Zu-fan DU Hui-ping JIANG Ze Chongqing University of Posts Telecommunications Chongqing China University of Electronic Science Technology of China Chengdu China 《中国邮电高校学报(英文版)》2006,13(4):29-33
1 Introduction The calling dwell time characteristic is critical for the user network planning and deployment, e.g., global system for mobile communications (GSM), as well as the next generation wireless multimedia networks, such as, the currently standar… 相似文献
137.
In this paper, we develop call admission control algorithms for SIR-based power-controlled DS-CDMA cellular networks. We consider networks that handle both voice and data services. When a new call (or a handoff call) arrives at a base station requesting for admission, our algorithms will calculate the desired power control setpoints for the new call and all existing calls. We will provide necessary and sufficient conditions under which the power control algorithm will have a feasible solution. These conditions are obtained through deriving the inverse of the matrix used in the calculation of power control setpoints. If there is no feasible solution to power control or if the desired power levels to be received at the base station for some calls are larger than the maximum allowable power limits, the admission request will be rejected. Otherwise, the admission request will be granted. When higher priority is desired for handoff calls, we will allow different thresholds (i.e., different maximum allowable power limits) for new calls and handoff calls. We will develop an adaptive algorithm that adjusts these thresholds in real-time as environment changes. The performance of our algorithms will be shown through computer simulation and compared with existing algorithms. 相似文献
138.
Sungmoon Jung Jamshid Ghaboussi Soon-Duck Kwon 《Canadian Metallurgical Quarterly》2004,130(11):1356-1364
A new method of estimating flutter derivatives using artificial neural networks is proposed. Unlike other computational fluid dynamics based numerical analyses, the proposed method estimates flutter derivatives utilizing previously measured experimental data. One of the advantages of the neural networks approach is that they can approximate a function of many dimensions. An efficient method has been developed to quantify the geometry of deck sections for neural network input. The output of the neural network is flutter derivatives. The flutter derivatives estimation network, which has been trained by the proposed methodology, is tested both for training sets and novel testing sets. The network shows reasonable performance for the novel sets, as well as outstanding performance for the training sets. Two variations of the proposed network are also presented, along with their estimation capability. The paper shows the potential of applying neural networks to wind force approximations. 相似文献
139.
Christine Di Massimo Paul A. Lant Aidan Saunders Gary A. Montague Ming T. Tham A. Julian Morris 《Journal of chemical technology and biotechnology (Oxford, Oxfordshire : 1986)》1992,53(3):265-277
The last decade has seen the development of a number of approaches for estimating those variables which are difficult to measure on-line in industrial process situations. Whilst a range of techniques is available, a common element is the use of process knowledge in the form of a system model. In the case of bioprocess systems, although a large range of models has been presented in the literature, their use in estimation schemes on an industrial scale has been limited. A number of reasons can be identified for their low level of utilisation. Of particular significance is the uncertainty which exists in quantifying system performance and the process-model mismatch which inevitably results. The level of ‘pre-defined model’ uncertainty, together with the knowledge gained during the course of the fermentation, serves to dictate estimator structure. The paper considers a range of estimation strategies and contrasts, through industrial applications, their performance characteristics and utility. 相似文献
140.
A routing framework for providing robustness to node failures in mobile ad hoc networks 总被引:2,自引:0,他引:2
Nodes in a mobile ad hoc network are often vulnerable to failures. The failures could be either due to fading effects, battery drainage, or as a result of compromised nodes that do not participate in network operations. Intermittent node failures can disrupt routing functionalities. As such, it is important to provide redundancy in terms of providing multiple node-disjoint paths from a source to a destination. In line with this objective, we first propose a modified version of the widely studied ad hoc on-demand distance vector routing protocol to facilitate the discovery of multiple node-disjoint paths from a source to a destination. We find that very few of such paths can be found. Furthermore, as distances between sources and destinations increase, bottlenecks inevitably occur and thus, the possibility of finding multiple paths is considerably reduced. We conclude that it is necessary to place what we call reliable nodes (in terms of both being robust to failure and being secure) in the network to support efficient routing operations. We propose a deployment strategy that determines the positions and the trajectories of these reliable nodes such that we can achieve a framework for reliably routing information. We define a notion of a reliable path which is made up of multiple segments, each of which either entirely consists of reliable nodes, or contains a preset number of multiple paths between the end points of the segment. We show that the probability of establishing a reliable path between a random source and destination pair increases tremendously even with a small number of reliable nodes when we use our algorithm to appropriately position these reliable nodes. 相似文献