全文获取类型
收费全文 | 8326篇 |
免费 | 1605篇 |
国内免费 | 1720篇 |
专业分类
电工技术 | 589篇 |
综合类 | 1348篇 |
化学工业 | 128篇 |
金属工艺 | 92篇 |
机械仪表 | 581篇 |
建筑科学 | 136篇 |
矿业工程 | 114篇 |
能源动力 | 76篇 |
轻工业 | 96篇 |
水利工程 | 86篇 |
石油天然气 | 62篇 |
武器工业 | 72篇 |
无线电 | 831篇 |
一般工业技术 | 461篇 |
冶金工业 | 41篇 |
原子能技术 | 12篇 |
自动化技术 | 6926篇 |
出版年
2024年 | 133篇 |
2023年 | 358篇 |
2022年 | 511篇 |
2021年 | 487篇 |
2020年 | 368篇 |
2019年 | 308篇 |
2018年 | 294篇 |
2017年 | 339篇 |
2016年 | 361篇 |
2015年 | 414篇 |
2014年 | 478篇 |
2013年 | 607篇 |
2012年 | 654篇 |
2011年 | 637篇 |
2010年 | 512篇 |
2009年 | 562篇 |
2008年 | 576篇 |
2007年 | 529篇 |
2006年 | 510篇 |
2005年 | 430篇 |
2004年 | 348篇 |
2003年 | 312篇 |
2002年 | 237篇 |
2001年 | 237篇 |
2000年 | 204篇 |
1999年 | 208篇 |
1998年 | 155篇 |
1997年 | 153篇 |
1996年 | 116篇 |
1995年 | 111篇 |
1994年 | 94篇 |
1993年 | 70篇 |
1992年 | 59篇 |
1991年 | 48篇 |
1990年 | 44篇 |
1989年 | 37篇 |
1988年 | 35篇 |
1987年 | 10篇 |
1986年 | 12篇 |
1985年 | 11篇 |
1984年 | 16篇 |
1983年 | 7篇 |
1982年 | 11篇 |
1981年 | 7篇 |
1980年 | 7篇 |
1979年 | 6篇 |
1978年 | 4篇 |
1976年 | 8篇 |
1975年 | 4篇 |
1973年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
In this paper, we present LinkingPark, an automatic semantic annotation system for tabular data to knowledge graph matching. LinkingPark is designed as a modular framework which can handle Cell-Entity Annotation (CEA), Column-Type Annotation (CTA), and Columns-Property Annotation (CPA) altogether. It is built upon our previous SemTab 2020 system, which won the 2nd prize among 28 different teams after four rounds of evaluations. Moreover, the system is unsupervised, stand-alone, and flexible for multilingual support. Its backend offers an efficient RESTful API for programmatic access, as well as an Excel Add-in for ease of use. Users can interact with LinkingPark in near real-time, further demonstrating its efficiency. 相似文献
2.
《Ceramics International》2022,48(4):5066-5074
We studied the morphological nature of various thin films such as silicon carbide (SiC), diamond (C), germanium (Ge), and gallium nitride (GaN) on silicon substrate Si(100) using the pulsed laser deposition (PLD) method and Monte Carlo simulation. We, for the first time, systematically employed the visibility algorithm graph to meticulously study the morphological features of various PLD grown thin films. These thin-film morphologies are investigated using random distribution, Gaussian distribution, patterned heights, etc. The nature of the interfacial height of individual surfaces is examined by a horizontal visibility graph (HVG). It demonstrates that the continuous interfacial height of the silicon carbide, diamond, germanium, and gallium nitride films are attributed to random distribution and Gaussian distribution in thin films. However, discrete peaks are obtained in the brush and step-like morphology of germanium thin films. Further, we have experimentally verified the morphological nature of simulated silicon carbide, diamond, germanium, and gallium nitride thin films were grown on Si(100) substrate by pulsed laser deposition (PLD) at elevated temperature. Various characterization techniques have been used to study the morphological, and electrical properties which confirmed the different nature of the deposited films on the Silicon substrate. Decent hysteresis behavior has been confirmed by current-voltage (IV) measurement in all the four deposited films. The highest current has been measured for GaN at ~60 nA and the lowest current in SiC at ~30 nA level which is quite low comparing with the expected signal level (μA). The HVG technique is suitable to understand surface features of thin films which are substantially advantageous for the energy devices, detectors, optoelectronic devices operating at high temperatures. 相似文献
3.
Output feedback controller for polytopic systems exploiting the direct searching of the design space
This paper deals with the problem of designing a robust static output feedback controller for polytopic systems. The current research that tackled this problem is mainly based on LMI method, which is conservative by nature. In this paper, a novel approach is proposed, which considers the design space of the controller parameters and iteratively partitions the space to small simplexes. Then, by assessing the stability in each simplex, the solution space for design parameters is directly determined. It has been theoretically proved that, if there exists a feasible solution in the design space, the algorithm can find it. To validate the result of the proposed approach, comparative simulation examples are given to illustrate the performance of the design methodology as compared to those of previous approaches. 相似文献
4.
Distribution systems are most commonly operated in a radial configuration for a number of reasons. In order to impose radiality constraint in the optimal network reconfiguration problem, an efficient algorithm is introduced in this paper based on graph theory. The paper shows that the normally followed methods of imposing radiality constraint within a mixed-integer programming formulation of the reconfiguration problem may not be sufficient. The minimum-loss network reconfiguration problem is formulated using different ways to impose radiality constraint. It is shown, through simulations, that the formulated problem using the proposed method for representing radiality constraint can be solved more efficiently, as opposed to the previously proposed formulations. This results in up to 30% reduction in CPU time for the test systems used in this study. 相似文献
5.
针对谱聚类融合模糊C-means(FCM)聚类的蛋白质相互作用(PPI)网络功能模块挖掘方法准确率不高、执行效率较低和易受假阳性影响的问题,提出一种基于模糊谱聚类的不确定PPI网络功能模块挖掘(FSC-FM)方法。首先,构建一个不确定PPI网络模型,使用边聚集系数给每一条蛋白质交互作用赋予一个存在概率测度,克服假阳性对实验结果的影响;第二,利用基于边聚集系数流行距离(FEC)策略改进谱聚类中的相似度计算,解决谱聚类算法对尺度参数敏感的问题,进而利用谱聚类算法对不确定PPI网络数据进行预处理,降低数据的维数,提高聚类的准确率;第三,设计基于密度的概率中心选取策略(DPCS)解决模糊C-means算法对初始聚类中心和聚类数目敏感的问题,并对预处理后的PPI数据进行FCM聚类,提高聚类的执行效率以及灵敏度;最后,采用改进的边期望稠密度(EED)对挖掘出的蛋白质功能模块进行过滤。在酵母菌DIP数据集上运行各个算法可知,FSC-FM与基于不确定图模型的检测蛋白质复合物(DCU)算法相比,F-measure值提高了27.92%,执行效率提高了27.92%;与在动态蛋白质相互作用网络中识别复合物的方法(CDUN)、演化算法(EA)、医学基因或蛋白质预测算法(MGPPA)相比也有更高的F-measure值和执行效率。实验结果表明,在不确定PPI网络中,FSC-FM适合用于功能模块的挖掘。 相似文献
6.
Abd Essalam Badoud Farid Merahi Belkacem Ould Bouamama Saad Mekhilef 《International Journal of Hydrogen Energy》2021,46(47):24011-24027
This work presents a complete bond graph modeling of a hybrid photovoltaic-fuel cell-electrolyzer-battery system. These are multi-physics models that will take into account the influence of temperature on the electrochemical parameters. A bond graph modeling of the electrical dynamics of each source will be introduced. The bond graph models were developed to highlight the multi-physics aspect describing the interaction between hydraulic, thermal, electrochemical, thermodynamic, and electrical fields. This will involve using the most generic modeling approach possible for managing the energy flows of the system while taking into account the viability of the system. Another point treated in this work is to propose. In this work, a new strategy for the power flow management of the studied system has been proposed. This strategy aims to improve the overall efficiency of the studied system by optimizing the decisions made when starting and stopping the fuel cell and the electrolyzer. It was verified that the simulation results of the proposed system, when compared to simulation results presented in the literature, that the hydrogen demand is increased by an average of 8%. The developed management algorithm allows reducing the fuel cell degradation by 87% and the electrolyzer degradation by 65%. As for the operating time of the electrolyzer, an increment of 65% was achieved, thus improving the quality of the produced hydrogen. The Fuel Cell's running time has been decreased by 59%. With the ambition to validate the models proposed and the associated commands, the development of this study gave rise to the creation of an experimental platform. Using this high-performance experimental platform, experimental tests were carried out and the results obtained are compared with those obtained by simulation under the same metrological conditions. 相似文献
7.
如何在海量不确定数据集中提高频繁模式挖掘性能是目前研究的热点.传统算法大多是以期望、概率或者权重等单一指标为数据项集支持度,在大数据背景下,同时考虑概率和权重支持度的算法难以兼顾其执行效率.为此,本文提出一种基于Spark的不确定数据集频繁模式挖掘算法(UWEFP),首先,为了同时兼顾数据项的概率和权重,计算一项集的最大概率权重值并进行剪枝;然后,为了减少对数据集的多次扫描,结合Spark框架的优点,设计了一种具有FP-tree特征的新颖的UWEFP-tree结构进行模式树的构建及挖掘;最后在Spark环境下,以UCI数据集进行实验验证.实验结果表明本文的方法在保证挖掘结果的同时,提高了效率. 相似文献
8.
9.
The multihop optical network is the most appropriate solution to satisfy the increasing applications of Internet services. This paper extends the regular Kautz graph to one with multiple layers in order to produce more architectural variations. The connectivity between adjacent layers utilizes the systematic connection patterns of a regular Kautz graph. A routing algorithm based on its property is presented. Optical passive star (OPS) couplers are adopted to implement our new topologies. Three scheduling criteria that can solve the contention problem in the intermediate nodes are evaluated and compared in terms of their capability to improve the accessibility. 相似文献
10.
A. Kaveh V. Kalatjari 《International journal for numerical methods in engineering》2003,58(5):771-791
In this article size/topology optimization of trusses is performed using a genetic algorithm (GA), the force method and some concepts of graph theory. One of the main difficulties with optimization with a GA is that the parameters involved are not completely known and the number of operations needed is often quite high. Application of some concepts of the force method, together with theory of graphs, make the generation of a suitable initial population well‐matched with critical paths for the transformation of internal forces feasible. In the process of optimization generated topologically unstable trusses are identified without any matrix manipulation and highly penalized. Identifying a suitable range for the cross‐section of each member for the ground structure in the list of profiles, the length of the substrings representing the cross‐sectional design variables are reduced. Using a contraction algorithm, the length of the strings is further reduced and a GA is performed in a smaller domain of design space. The above process is accompanied by efficient methods for selection, and by using a suitable penalty function in order to reduce the number of numerical operations and to increase the speed of the optimization toward a global optimum. The efficiency of the present method is illustrated using some examples, and compared to those of previous studies. Copyright © 2003 John Wiley & Sons, Ltd. 相似文献