全文获取类型
收费全文 | 5930篇 |
免费 | 347篇 |
国内免费 | 46篇 |
专业分类
电工技术 | 78篇 |
综合类 | 20篇 |
化学工业 | 1670篇 |
金属工艺 | 129篇 |
机械仪表 | 226篇 |
建筑科学 | 163篇 |
矿业工程 | 4篇 |
能源动力 | 387篇 |
轻工业 | 562篇 |
水利工程 | 90篇 |
石油天然气 | 41篇 |
无线电 | 564篇 |
一般工业技术 | 1097篇 |
冶金工业 | 279篇 |
原子能技术 | 83篇 |
自动化技术 | 930篇 |
出版年
2024年 | 23篇 |
2023年 | 121篇 |
2022年 | 337篇 |
2021年 | 412篇 |
2020年 | 311篇 |
2019年 | 335篇 |
2018年 | 373篇 |
2017年 | 301篇 |
2016年 | 331篇 |
2015年 | 196篇 |
2014年 | 329篇 |
2013年 | 544篇 |
2012年 | 315篇 |
2011年 | 325篇 |
2010年 | 281篇 |
2009年 | 248篇 |
2008年 | 168篇 |
2007年 | 146篇 |
2006年 | 132篇 |
2005年 | 96篇 |
2004年 | 73篇 |
2003年 | 72篇 |
2002年 | 57篇 |
2001年 | 45篇 |
2000年 | 36篇 |
1999年 | 39篇 |
1998年 | 70篇 |
1997年 | 61篇 |
1996年 | 45篇 |
1995年 | 57篇 |
1994年 | 24篇 |
1993年 | 37篇 |
1992年 | 31篇 |
1991年 | 25篇 |
1990年 | 26篇 |
1989年 | 23篇 |
1988年 | 16篇 |
1987年 | 30篇 |
1986年 | 30篇 |
1985年 | 22篇 |
1984年 | 30篇 |
1983年 | 26篇 |
1982年 | 16篇 |
1981年 | 8篇 |
1980年 | 14篇 |
1979年 | 13篇 |
1978年 | 12篇 |
1977年 | 11篇 |
1976年 | 14篇 |
1975年 | 8篇 |
排序方式: 共有6323条查询结果,搜索用时 15 毫秒
81.
Nadir Shah Ayaz Ahmad Babar Nazir Depei Qian 《Peer-to-Peer Networking and Applications》2016,9(2):356-371
Due to limited radio range and mobility of nodes in mobile ad hoc networks (MANETs), the network partitioning and merging could occur frequently. When structured peer-to-peer (P2P) overlays are running over MANETs, then network partition in the physical network can also cause network partition at the overlay layer. Existing approaches for structured P2P overlay over MANETs do not detect network partition at the overlay layer. This paper proposes a cross-layer approach to detect network partition at the overlay layer for structured P2P overlay over MANETs. Simulation results show that the proposed approach is highly effective and efficient in terms of routing overhead, success ratio and false-negative ratio. 相似文献
82.
Afandi Ahmad Abbes Amira Paul Nicholl Benjamin Krill 《Journal of Real-Time Image Processing》2013,8(3):327-340
This paper presents a combination of novel feature vectors construction approach for face recognition using discrete wavelet transform (DWT) and field programmable gate array (FPGA)-based intellectual property (IP) core implementation of transform block in face recognition systems. Initially, four experiments have been conducted including the DWT feature selection and filter choice, features optimisation by coefficient selections and feature threshold. To examine the most suitable method of feature extraction, different wavelet quadrant and scales have been evaluated, and it is followed with an evaluation of different wavelet filter choices and their impact on recognition accuracy. In this study, an approach for face recognition based on coefficient selection for DWT is presented, and the significant of DWT coefficient threshold selection is also analysed. For the hardware implementation, two architectures for two-dimensional (2-D) Haar wavelet transform (HWT) IP core with transpose-based computation and dynamic partial reconfiguration (DPR) have been synthesised using VHDL and implemented on Xilinx Virtex-5 FPGAs. Experimental results and comparisons between different configurations using partial and non-partial reconfiguration processes and a detailed performance analysis of the area, power consumption and maximum frequency are also discussed in this paper. 相似文献
83.
In this paper, we propose a new online identification approach for evolving Takagi–Sugeno (TS) fuzzy models. Here, for a TS model, a certain number of models as neighboring models are defined and then the TS model switches to one of them at each stage of evolving. We define neighboring models for an in-progress (current) TS model as its fairly evolved versions, which are different with it just in two fuzzy rules. To generate neighboring models for the current model, we apply specially designed split and merge operations. By each split operation, a fuzzy rule is replaced with two rules; while by each merge operation, two fuzzy rules combine to one rule. Among neighboring models, the one with the minimum sum of squared errors – on certain time intervals – replaces the current model.To reduce the computational load of the proposed evolving TS model, straightforward relations between outputs of neighboring models and that of current model are established. Also, to reduce the number of rules, we define and use first-order TS fuzzy models whose generated local linear models can be localized in flexible fuzzy subspaces. To demonstrate the improved performance of the proposed identification approach, the efficiency of the evolving TS model is studied in prediction of monthly sunspot number and forecast of daily electrical power consumption. The prediction and modeling results are compared with that of some important existing evolving fuzzy systems. 相似文献
84.
During the recent years, there has been a tremendous growth in the development and deployment of multimedia based networked applications such as video streaming, IP telephony, interactive games, among others. These applications, in contrast to elastic applications such as email and data sharing, are delay and delay jitter sensitive but can tolerate certain level of packet loss. A vital element of end-to-end delay and delay jitter is the random queueing delays in network switches and routers. Analysis of robust mechanisms for buffer management at network routers needs to be carried out in order to reduce end-to-end delay for traffic generated by multimedia applications. In this context, a threshold based buffer management scheme for accommodating multiple class multimedia traffic in network routers has been analysed. This technique effectively controls the allocation of buffer to various traffic classes according to their delay constraints. The forms of the joint state probabilities, as well as basic performance measures such as blocking probabilities are analytically established at equilibrium. Typical numerical experiments are included to illustrate the credibility of the proposed mechanism in the context of different quality of service (QoS) grades for various network traffic classes. This model, therefore, can be used as a powerful tool to provide a required grade of service to a particular class of multimedia based web traffic in any heterogeneous network. 相似文献
85.
By splitting a large broadcast message into segments and broadcasting the segments in a pipelined fashion, pipelined broadcast can achieve high performance in many systems. In this paper, we investigate techniques for efficient pipelined broadcast on clusters connected by multiple Ethernet switches. Specifically, we develop algorithms for computing various contention-free broadcast trees that are suitable for pipelined broadcast on Ethernet switched clusters, extend the parametrized LogP model for predicting appropriate segment sizes for pipelined broadcast, show that the segment sizes computed based on the model yield high performance, and evaluate various pipelined broadcast schemes through experimentation on Ethernet switched clusters with various topologies. The results demonstrate that our techniques are practical and efficient for contemporary fast Ethernet and Giga-bit Ethernet clusters. 相似文献
86.
Ahmad Faraj Pitch Patarasuk Xin Yuan 《International journal of parallel programming》2008,36(4):426-453
Clusters of workstations employ flexible topologies: regular, irregular, and hierarchical topologies have been used in such
systems. The flexibility poses challenges for developing efficient collective communication algorithms since the network topology
can potentially have a strong impact on the communication performance. In this paper, we consider the all-to-all broadcast
operation on clusters with cut-through and store-and-forward switches. We show that near-optimal all-to-all broadcast on a
cluster with any topology can be achieved by only using the links in a spanning tree of the topology when the message size
is sufficiently large. The result implies that increasing network connectivity beyond the minimum tree connectivity does not
improve the performance of the all-to-all broadcast operation when the most efficient topology specific algorithm is used.
All-to-all broadcast algorithms that achieve near-optimal performance are developed for clusters with cut-through and clusters
with store-and-forward switches. We evaluate the algorithms through experiments and simulations. The empirical results confirm
our theoretical finding. 相似文献
87.
A potentiometric biosensor based on bovine serum albumin (BSA) embedded surface modified polypyrrole has been developed for the quantitative estimation of urea in aqueous solution. The enzyme, urease (Urs), was covalently linked to free amino groups present over the BSA embedded modified surface of the conducting polypyrrole film electrochemically deposited onto an indium–tin-oxide (ITO) coated glass plate. The biosensor has been characterized by UV–visible, infrared spectroscopy and SEM. Potentiometric and spectrophotometric response of the enzyme electrode (Urs/BSA-PPy/ITO) were measured as a function of urea concentration in Tris–HCl buffer (pH 7.0). It has been found that the electrode responds to low urea concentration with wider range of detection. The electrode showed a linear response range of 6.6 × 10−6 to 7.5 × 10−4 M urea. The response time is about 70–90 s reaching to a 95% steady-state potential value and 75% of the enzyme activity is retained for about 2 months. These results indicate an efficient covalent linkage of enzyme to free amino groups of the BSA molecules over the surface of polypyrrole film, which leads to high enzyme loading, an increased lifetime stability of the electrode and an improved wide range of detection of low urea concentration in aqueous solution. 相似文献
88.
A Cooperative Game Theoretical Technique for Joint Optimization of Energy Consumption and Response Time in Computational Grids 总被引:2,自引:0,他引:2
Khan Samee U. Ahmad Ishfaq 《Parallel and Distributed Systems, IEEE Transactions on》2009,20(3):346-360
With the explosive growth in computers and the growing scarcity in electric supply, reduction of energy consumption in large-scale computing systems has become a research issue of paramount importance. In this paper, we study the problem of allocation of tasks onto a computational grid, with the aim to simultaneously minimize the energy consumption and the makespan subject to the constraints of deadlines and tasks' architectural requirements. We propose a solution from cooperative game theory based on the concept of Nash Bargaining Solution. In this cooperative game, machines collectively arrive at a decision that describes the task allocation that is collectively best for the system, ensuring that the allocations are both energy and makespan optimized. Through rigorous mathematical proofs we show that the proposed cooperative game in mere O(n mlog(m)) time (where n is the number of tasks and m is the number of machines in the system) produces a Nash Bargaining Solution that guarantees Pareto-optimally. The simulation results show that the proposed technique achieves superior performance compared to the Greedy and Linear Relaxation (LR) heuristics, and with competitive performance relative to the optimal solution implemented in LINDO for small-scale problems. 相似文献
89.
We consider a state-of-the-art system that uses layered source coding and forward error correction with Reed-Solomon codes to efficiently transmit 3-D meshes over lossy packet networks. Given a transmission bit budget, the performance of this system can be optimized by determining how many layers should be sent, how each layer should be packetized, and how many parity bits should be allocated to each layer such that the expected distortion at the receiver is minimum. The previous solution for this optimization problem uses exhaustive search, which is not feasible when the transmission bit budget is large. We propose instead an exact algorithm that solves this optimization problem in linear time and space. We illustrate the advantages of our approach by providing experimental results for the compressed progressive meshes (CPM) mesh compression technique. 相似文献
90.
The effect of molecular anisotropy on backscattered UV (BUV) radiances is computed by accounting for it in both Rayleigh optical thickness and the scattering-phase matrix. If the effect of molecular anisotropy is included only in the optical thickness and not in the phase matrix, then for high sun (θ(0) ~ 0°), the nadir radiance (I(0)) leaving the top of the atmosphere is approximately 1.8% higher than the radiance (I(op)) computed with the effect included in the phase matrix. For very low sun (θ(0) > 80°), I(0) is approximately 2.3% lower than I(op). For off-nadir radiances the relative increase (decrease) depends on both the local zenith angle as well as the azimuth angle. Also, an increase in the surface reflectivity decreases the effect of molecular anisotropy on the upwelling radiances. Exclusion of the anisotropy factor in the Rayleigh-phase matrix has very little effect (<1%) on ozone retrieval from the BUV-type instruments. This is because of the ratio technique used in the retrieval algorithm, which practically cancels out the anisotropy effect. 相似文献