全文获取类型
收费全文 | 9320篇 |
免费 | 838篇 |
国内免费 | 89篇 |
专业分类
电工技术 | 180篇 |
综合类 | 41篇 |
化学工业 | 2583篇 |
金属工艺 | 212篇 |
机械仪表 | 394篇 |
建筑科学 | 354篇 |
矿业工程 | 20篇 |
能源动力 | 615篇 |
轻工业 | 909篇 |
水利工程 | 187篇 |
石油天然气 | 140篇 |
武器工业 | 5篇 |
无线电 | 975篇 |
一般工业技术 | 1608篇 |
冶金工业 | 210篇 |
原子能技术 | 67篇 |
自动化技术 | 1747篇 |
出版年
2024年 | 35篇 |
2023年 | 186篇 |
2022年 | 319篇 |
2021年 | 607篇 |
2020年 | 550篇 |
2019年 | 680篇 |
2018年 | 774篇 |
2017年 | 732篇 |
2016年 | 722篇 |
2015年 | 429篇 |
2014年 | 711篇 |
2013年 | 1037篇 |
2012年 | 651篇 |
2011年 | 731篇 |
2010年 | 471篇 |
2009年 | 404篇 |
2008年 | 244篇 |
2007年 | 181篇 |
2006年 | 148篇 |
2005年 | 101篇 |
2004年 | 101篇 |
2003年 | 58篇 |
2002年 | 57篇 |
2001年 | 28篇 |
2000年 | 23篇 |
1999年 | 25篇 |
1998年 | 22篇 |
1997年 | 18篇 |
1996年 | 23篇 |
1995年 | 19篇 |
1994年 | 10篇 |
1993年 | 15篇 |
1992年 | 10篇 |
1991年 | 17篇 |
1990年 | 16篇 |
1989年 | 12篇 |
1988年 | 7篇 |
1987年 | 7篇 |
1986年 | 8篇 |
1985年 | 8篇 |
1984年 | 14篇 |
1983年 | 12篇 |
1982年 | 4篇 |
1981年 | 3篇 |
1980年 | 2篇 |
1979年 | 6篇 |
1978年 | 3篇 |
1977年 | 2篇 |
1973年 | 2篇 |
1967年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
141.
Adrian N. Bishop Mohammad Deghat Brian D. O. Anderson Yiguang Hong 《国际强度与非线性控制杂志
》2015,25(17):3210-3230
》2015,25(17):3210-3230
Heterogeneous formation shape control with interagent bearing and distance constraints involves the design of a distributed control law that ensures the formation moves such that these interagent constraints are achieved and maintained. This paper looks at the design of a distributed control scheme to solve different formation shape control problems in an ambient two‐dimensional space with bearing, distance and mixed bearing and distance constraints. The proposed control law allows the agents in the formation to move in any direction on a half‐plane and guarantees that despite this freedom, the proposed shape control algorithm ensures convergence to a formation shape meeting the prescribed constraints. This work provides an interesting and novel contrast to much of the existing work in formation control where distance‐only constraints are typically maintained and where each agent's motion is typically restricted to follow a very particular path. A stability analysis is sketched, and a number of illustrative examples are also given. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
142.
The mobile nature of the nodes in a wireless mobile ad-hoc network (MANET) and the error prone link connectivity between nodes pose many challenges. These include frequent route changes, high packet loss, etc. Such problems increase the end-toend delay and decrease the throughput. This paper proposes two adaptive priority packet scheduling algorithms for MANET based on Mamdani and Sugeno fuzzy inference system. The fuzzy systems consist of three input variables: data rate, signal-to-noise ratio (SNR) and queue size. The fuzzy decision system has been optimised to improve its efficiency. Both fuzzy systems were verified using the Matlab fuzzy toolbox and the performance of both algorithms were evaluated using the riverbed modeler (formally known as OPNET modeler). The results were compared to an existing fuzzy scheduler under various network loads, for constant-bit-rate (CBR) and variable-bit-rate (VBR) traffic. The measuring metrics which form the basis for performance evaluation are end-to-end delay, throughput and packet delivery ratio. The proposed Mamdani and Sugeno scheduler perform better than the existing scheduler for CBR traffic. The end-to-end delay for Mamdani and Sugeno scheduler was reduced by an average of 52% and 54%, respectively. The performance of the throughput and packet delivery ratio for CBR traffic are very similar to the existing scheduler because of the characteristic of the traffic. The network was also at full capacity. The proposed schedulers also showed a better performance for VBR traffic. The end-to-end delay was reduced by an average of 38% and 52%, respectively. Both the throughput and packet delivery ratio (PDR) increased by an average of 53% and 47%, respectively. The Mamdani scheduler is more computationally complex than the Sugeno scheduler, even though they both showed similar network performance. Thus, the Sugeno scheduler is more suitable for real-time applications. 相似文献
143.
ANN‐based modeling of compact impedance‐varying transmission lines with applications to ultra‐wideband Wilkinson power dividers
下载免费PDF全文
![点击此处可从《国际射频与微波计算机辅助工程杂志》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Khair A. Alshamaileh Mohammad J. Almalkawi Ruthwik R. Junuthula Vijay K. Devabhaktuni Peter H. Aaen 《国际射频与微波计算机辅助工程杂志》2015,25(7):563-572
The modeling of the physical and electrical characteristics of microstrip non‐uniform transmission lines (NTLs) utilizing artificial neural networks (ANNs) is investigated. The fundamental equations and constraints for designing variable impedance transmission lines are first presented. Then, a proof‐of‐concept example of a compact non‐uniform matching transformer and the counterpart modeled version is elaborated for source and load impedances Zs and Zl, respectively, at 0.5 GHz. For comparison purposes, weights and biases of the proposed ANN are established with three different training techniques; namely: backpropagation (BP), Quasi‐Newton (QN), and conjugate gradient (CG); at which the ABCD matrix, impedance variations, input port matching (S11), and transmission parameter (S21) are set as benchmarks to examine the validity of the trained model. The concept is then extended to model a NTL ultrawideband (UWB) Wilkinson power divider (WPD) with three resistors for improved isolation. S‐parameters derived from the trained ANN outputs are close to those obtained by the traditional time‐consuming optimization procedure, and show input and output ports matching and isolation of below ?10 dB, and acceptable values of transmission parameters over the 3.1 GHz to 10.6 GHz band. The resulting models outperform traditional optimizations in terms of simulation time and reserved resources with comparable accuracy. © 2015 Wiley Periodicals, Inc. Int J RF and Microwave CAE 25:563–572, 2015. 相似文献
144.
145.
146.
In this paper, we consider the problem of flocking and shape‐orientation control of multi‐agent systems with inter‐agent and obstacle collision avoidance. We first consider the problem of forcing a set of autonomous agents to form a desired formation shape and orientation while avoiding inter‐agent collision and collision with convex obstacles, and following a trajectory known to only one of the agents, namely the leader of the formation. Then we build upon the solution given to this problem and solve the problem of guaranteeing obstacle collision avoidance by changing the size and the orientation of the formation. Changing the size and the orientation of the formation is helpful when the agents want to go through a narrow passage while the existing size or orientation of the formation does not allow this. We also propose collision avoidance algorithms that temporarily change the shape of the formation to avoid collision with stationary or moving nonconvex obstacles. Simulation results are presented to show the performance of the proposed control laws. 相似文献
147.
Short‐Time Linear Quadratic Form Technique for Estimating Fast‐Varying Parameters in Feedback Loops
下载免费PDF全文
![点击此处可从《Asian journal of control》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Mohammad Reza Homaeinezhad Iman Tahbaz‐zadeh Moghaddam Zahra Khakpour Hosein Naseri 《Asian journal of control》2015,17(6):2289-2302
The precision of a closed‐loop controller system designed for an uncertain plant depends strongly upon the maximum extent to which it is possible to track the trend of time‐varying parameters of the plant. The aim of this study is to describe a new parameter estimation algorithm that is able to follow fast‐varying parameters in closed‐loop systems. The short‐time linear quadratic form (STLQF) estimation algorithm introduced in this paper is a technique for tracking time‐varying parameters based on short‐time analysis of the regressing variables in order to minimize locally a linear quadratic form cost function. The established cost function produces a linear combination of errors with several delays. To meet this objective, mathematical development of the STLQF estimation algorithm is described. To implement the STLQF algorithm, the algorithm is applied to a planar mobile robot with fast‐varying parameters of inertia and viscous and coulomb frictions. Next, performance of the proposed algorithm is assessed against noise effects and variation in the type of parameters. 相似文献
148.
Mehdi Banitalebi Dehkordi Hamid Reza Abutalebi Mohammad Reza Taban 《Digital Signal Processing》2013,23(4):1239-1246
In this paper, we propose a source localization algorithm based on a sparse Fast Fourier Transform (FFT)-based feature extraction method and spatial sparsity. We represent the sound source positions as a sparse vector by discretely segmenting the space with a circular grid. The location vector is related to microphone measurements through a linear equation, which can be estimated at each microphone. For this linear dimensionality reduction, we have utilized a Compressive Sensing (CS) and two-level FFT-based feature extraction method which combines two sets of audio signal features and covers both short-time and long-time properties of the signal. The proposed feature extraction method leads to a sparse representation of audio signals. As a result, a significant reduction in the dimensionality of the signals is achieved. In comparison to the state-of-the-art methods, the proposed method improves the accuracy while the complexity is reduced in some cases. 相似文献
149.
Genetic algorithm-based motion estimation schemes play a significant role in improving the results of H.264/AVC standardization efforts when addressing conversational and non-conversational video applications. In this paper, we present a robust motion estimation scheme that uses a noble genetic trail bounded approximation (GTBA) approach to speed up the encoding process of H.264/AVC video compression and to reduce the number of bits required to code frame. The proposed algorithm is utilized to enhance the fitness function strength by integrating trail information of motion vector and sum of absolute difference (SAD) information into a fitness function. Experimental results reveal that the proposed GTBA resolves conflict obstacles with respect to both the number of bits required to code frames and the execution time for estimation. 相似文献
150.
Masoom Alam Xinwen Zhang Mohammad Nauman Tamleek Ali Muhammad Ali Sajid Anwar Quratulain Alam 《Multimedia Tools and Applications》2013,66(2):283-302
Service Oriented Architecture with underlying technologies like web services and web service orchestration opens new vistas for integration among business processes operating in heterogeneous environments. However, such dynamic collaborations require a highly secure environment at each respective business partner site. Existing web services standards address the issue of security only on the service provider platform. The partner platforms to which sensitive information is released have till now been neglected. Remote Attestation is a relatively new field of research which enables an authorized party to verify that a trusted environment actually exists on a partner platform. To incorporate this novel concept in to the web services realm, a new mechanism called WS-Attestation has been proposed. This mechanism provides a structural paradigm upon which more fine-grained solutions can be built. In this paper, we present a novel framework, Behavioral Attestation for Web Services, in which XACML is built on top of WS-Attestation in order to enable more flexible remote attestation at the web services level. We propose a new type of XACML policy called XACML behavior policy, which defines the expected behavior of a partner platform. Existing web service standards are used to incorporate remote attestation at the web services level and a prototype is presented, which implements XACML behavior policy using low-level attestation techniques. 相似文献