全文获取类型
收费全文 | 12285篇 |
免费 | 937篇 |
国内免费 | 109篇 |
专业分类
电工技术 | 236篇 |
综合类 | 56篇 |
化学工业 | 3331篇 |
金属工艺 | 304篇 |
机械仪表 | 536篇 |
建筑科学 | 462篇 |
矿业工程 | 26篇 |
能源动力 | 764篇 |
轻工业 | 1122篇 |
水利工程 | 244篇 |
石油天然气 | 182篇 |
武器工业 | 6篇 |
无线电 | 1237篇 |
一般工业技术 | 2108篇 |
冶金工业 | 314篇 |
原子能技术 | 93篇 |
自动化技术 | 2310篇 |
出版年
2024年 | 48篇 |
2023年 | 235篇 |
2022年 | 405篇 |
2021年 | 751篇 |
2020年 | 699篇 |
2019年 | 851篇 |
2018年 | 1006篇 |
2017年 | 928篇 |
2016年 | 911篇 |
2015年 | 552篇 |
2014年 | 915篇 |
2013年 | 1389篇 |
2012年 | 905篇 |
2011年 | 965篇 |
2010年 | 617篇 |
2009年 | 550篇 |
2008年 | 325篇 |
2007年 | 255篇 |
2006年 | 193篇 |
2005年 | 129篇 |
2004年 | 124篇 |
2003年 | 72篇 |
2002年 | 73篇 |
2001年 | 40篇 |
2000年 | 36篇 |
1999年 | 43篇 |
1998年 | 26篇 |
1997年 | 24篇 |
1996年 | 29篇 |
1995年 | 29篇 |
1994年 | 13篇 |
1993年 | 21篇 |
1992年 | 14篇 |
1991年 | 21篇 |
1990年 | 20篇 |
1989年 | 16篇 |
1988年 | 9篇 |
1987年 | 7篇 |
1986年 | 10篇 |
1985年 | 8篇 |
1984年 | 20篇 |
1983年 | 12篇 |
1982年 | 9篇 |
1981年 | 4篇 |
1980年 | 3篇 |
1979年 | 7篇 |
1978年 | 4篇 |
1977年 | 2篇 |
1973年 | 2篇 |
1967年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 11 毫秒
101.
Asieh Khosravanian Mohammad Rahmanimanesh Parviz Keshavarzi Saeed Mozaffari 《International journal of imaging systems and technology》2023,33(1):323-339
Magnetic resonance imaging (MRI) brain tumor segmentation is a crucial task for clinical treatment. However, it is challenging owing to variations in type, size, and location of tumors. In addition, anatomical variation in individuals, intensity non-uniformity, and noises adversely affect brain tumor segmentation. To address these challenges, an automatic region-based brain tumor segmentation approach is presented in this paper which combines fuzzy shape prior term and deep learning. We define a new energy function in which an Adaptively Regularized Kernel-Based Fuzzy C-Means (ARKFCM) Clustering algorithm is utilized for inferring the shape of the tumor to be embedded into the level set method. In this way, some shortcomings of traditional level set methods such as contour leakage and shrinkage have been eliminated. Moreover, a fully automated method is achieved by using U-Net to obtain the initial contour, reducing sensitivity to initial contour selection. The proposed method is validated on the BraTS 2017 benchmark dataset for brain tumor segmentation. Average values of Dice, Jaccard, Sensitivity and specificity are 0.93 ± 0.03, 0.86 ± 0.06, 0.95 ± 0.04, and 0.99 ± 0.003, respectively. Experimental results indicate that the proposed method outperforms the other state-of-the-art methods in brain tumor segmentation. 相似文献
102.
We report a new technique for conducting immuno-diagnostics on a microfluidic platform. Rather than handling fluid reagents
against a stationary solid phase, the platform manipulates analyte-coated magnetic beads through stationary plugs of fluid
reagents to detect an antigenic analyte. These isolated but accessible plugs are pre-encapsulated in a microchannel by capillary
force. We call this platform microfluidic inverse phase enzyme-linked immunosorbent assay (μIPELISA). μIPELISA has distinctive
advantages in the family of microfluidic immunoassay. In particular, it avoids pumping and valving fluid reagents during assaying,
thus leading to a lab-on-a-chip format that is free of instrumentation for fluid actuation and control. We use μIPELISA to
detect digoxigenin-labeled DNA segments amplified from E. coli O157:H7 by polymerase chain reaction (PCR), and compare its detection capability with that of microplate ELISA. For 0.259 ng μl−1 of digoxigenin-labeled amplicon, μIPELISA is as responsive as the microplate ELISA. Also, we simultaneously conduct μIPELISA
in two parallel microchannels. 相似文献
103.
Nariman Mahdavi Mohammad Bagher Menhaj 《International Journal of Control, Automation and Systems》2011,9(1):104-111
In this paper, we consider a Hopfield like Chaotic Neural Networks which have both self-coupling and non-invertible activation
functions. We show that the interactions between neurons can be used as a means of chaos generation or suppression to neuron’s
outputs when more adaptability or stability is required. Furthermore, a new set of sufficient conditions based on coupling
weights is proposed so that the synchronization of all neuron’s outputs with each other is guaranteed, when all neuron’s have
identical activation functions. Finally, the effectiveness of the proposed approach is evaluated by performing simulations
on three illustrative examples. 相似文献
104.
Multi-level (ML) quantum logic can potentially reduce the number of inputs/outputs or quantum cells in a quantum circuit which
is a limitation in current quantum technology. In this paper we propose theorems about ML-quantum and reversible logic circuits.
New efficient implementations for some basic controlled ML-quantum logic gates, such as three-qudit controlled NOT, Cycle,
and Self Shift gates are proposed. We also propose lemmas about r-level quantum arrays and the number of required gates for an arbitrary n-qudit ML gate. An equivalent definition of quantum cost (QC) of binary quantum gates for ML-quantum gates is introduced and
QC of controlled quantum gates is calculated. 相似文献
105.
In this article, the design and realization of waveguide filter with improved stop‐band response is presented. By inserting transversal slots at the proper position of cavities, without disturbing the field distribution of the dominant mode, the second longitudinal resonant modes are radiated out. This caused the out‐of‐band frequency response of the filter to be improved. The validity of the proposed technique is confirmed by comparison between measurement values and simulation results from the finite element method through the commercial software (high frequency structure simulator). Also, to assure electromagnetic compatibility the slot surfaces are covered by absorbing material. © 2011 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2011. 相似文献
106.
Karun Rawat Fadhel M. Ghannouchi Meenakshi Rawat Mohammad S. Hashmi 《国际射频与微波计算机辅助工程杂志》2011,21(3):325-335
This article proposes an analytical design methodology for dual‐band hybrid couplers and baluns structures for any arbitrary frequency ratio using a stub‐loaded transmission line. An analysis of changing the impedance behavior of the stub, is carried out for the two bands of operation, which along with a dispersive analysis, emphasizes certain conditions where the existing methodology is not applicable. In addition, an extra degree of freedom has been included to increase the solutions for a given frequency ratio, thus providing greater flexibility and feasibility of the proposed structure. The design methodology is experimentally validated with the design and fabrication of dual‐band branch‐line and rat‐race couplers for various commercial frequency bands. © 2011 Wiley Periodicals, Inc. Int J RF and Microwave CAE , 2011. 相似文献
107.
Bus terminal assignment with the objective of maximizing public transportation service is known as bus terminal location problem (BTLP). We formulate the BTLP, a problem of concern in transportation industry, as a p-uncapacitated facility location problem (p-UFLP) with distance constraint. The p-UFLP being NP-hard (Krarup and Pruzan, 1990), we propose evolutionary algorithms for its solution. According to the No Free Lunch theorem and the good efficiency of the distinctive preserve recombination (DPX) operator, we design a new recombination operator for solving a BTLP by new evolutionary and memetic algorithms namely, genetic local search algorithms (GLS). We also define the potential objective function (POF) for the nodes and design a new mutation operator based on POF. To make the memetic algorithm faster, we estimate the variation of the objective function based on POF in the local search as part of an operator in memetic algorithms. Finally, we explore numerically the performance of nine proposed algorithms on over a thousand randomly generated problems and select the best two algorithms for further testing. The comparative studies show that our new hybrid algorithm composing the evolutionary algorithm with the GLS outperforms the multistart simulated annealing algorithm. 相似文献
108.
Sudip Misra Author Vitae Author Vitae Mohammad S. Obaidat Author Vitae Pushkar Gupta Author Vitae Author Vitae Prayag Narula Author Vitae 《Journal of Systems and Software》2010,83(11):2188-2199
Primitive routing protocols for ad-hoc networks are “power hungry” and can therefore consume considerable amount of the limited amount of battery power resident in the nodes. Thus, routing in ad-hoc networks is very much energy-constrained. Continuous drainage of energy degrades battery performance as well. If a battery is allowed to intermittently remain in an idle state, it recovers some of its lost charge due to the charge recovery effect, which, in turn, results in prolonged battery life.In this paper, we use the ideas of naturally occurring ants’ foraging behavior (Dorigo and Stuetzle, 2004) [1] and based on those ideas, we design an energy-aware routing protocol, which not only incorporates the effect of power consumption in routing a packet, but also exploits the multi-path transmission properties of ant swarms and, hence, increases the battery life of a node. The efficiency of the protocol with respect to some of the existing ones has been established through simulations. It has been observed that the energy consumed in the network, the energy per packet in the case of EAAR are 60% less compared to MMBCR and the packets lost is only around 12% of what we have in AODV, in mobility scenarios. 相似文献
109.
We address the problem of control and synchronization of a class of uncertain chaotic systems. Our approach follows techniques of sliding mode control and adaptive estimation law. The adaptive algorithm is constructed based on the sliding mode control to ensure perfect tracking and synchronization in presence of system uncertainty and external disturbance. Stability of the closed-loop system is proved using Lyapunov stability theory. Our theoretical findings are supported by simulation results. 相似文献
110.
Mohammad Shorfuzzaman Peter Graham Rasit Eskicioglu 《The Journal of supercomputing》2010,51(3):374-392
Data grids support access to widely distributed storage for large numbers of users accessing potentially many large files.
Efficient access is hindered by the high latency of the Internet. To improve access time, replication at nearby sites may
be used. Replication also provides high availability, decreased bandwidth use, enhanced fault tolerance, and improved scalability.
Resource availability, network latency, and user requests in a grid environment may vary with time. Any replica placement
strategy must be able to adapt to such dynamic behavior. In this paper, we describe a new dynamic replica placement algorithm,
Popularity Based Replica Placement (PBRP), for hierarchical data grids which is guided by file “popularity”. Our goal is to
place replicas close to clients to reduce data access time while still using network and storage resources efficiently. The
effectiveness of PBRP depends on the selection of a threshold value related to file popularity. We also present Adaptive-PBRP
(APBRP) that determines this threshold dynamically based on data request arrival rates. We evaluate both algorithms using
simulation. Results for a range of data access patterns show that our algorithms can shorten job execution time significantly
and reduce bandwidth consumption compared to other dynamic replication methods. 相似文献