全文获取类型
收费全文 | 107372篇 |
免费 | 21487篇 |
国内免费 | 15176篇 |
专业分类
电工技术 | 9958篇 |
技术理论 | 1篇 |
综合类 | 13744篇 |
化学工业 | 2377篇 |
金属工艺 | 2072篇 |
机械仪表 | 8908篇 |
建筑科学 | 2373篇 |
矿业工程 | 1538篇 |
能源动力 | 1803篇 |
轻工业 | 1772篇 |
水利工程 | 1380篇 |
石油天然气 | 1538篇 |
武器工业 | 1804篇 |
无线电 | 23028篇 |
一般工业技术 | 7691篇 |
冶金工业 | 910篇 |
原子能技术 | 485篇 |
自动化技术 | 62653篇 |
出版年
2024年 | 561篇 |
2023年 | 2026篇 |
2022年 | 3843篇 |
2021年 | 4246篇 |
2020年 | 4426篇 |
2019年 | 3694篇 |
2018年 | 3542篇 |
2017年 | 4354篇 |
2016年 | 4923篇 |
2015年 | 5938篇 |
2014年 | 7724篇 |
2013年 | 7346篇 |
2012年 | 9448篇 |
2011年 | 9665篇 |
2010年 | 8180篇 |
2009年 | 8298篇 |
2008年 | 8697篇 |
2007年 | 9274篇 |
2006年 | 7452篇 |
2005年 | 6255篇 |
2004年 | 4966篇 |
2003年 | 3996篇 |
2002年 | 3010篇 |
2001年 | 2376篇 |
2000年 | 1944篇 |
1999年 | 1534篇 |
1998年 | 1242篇 |
1997年 | 1045篇 |
1996年 | 791篇 |
1995年 | 589篇 |
1994年 | 513篇 |
1993年 | 395篇 |
1992年 | 353篇 |
1991年 | 213篇 |
1990年 | 248篇 |
1989年 | 172篇 |
1988年 | 132篇 |
1987年 | 63篇 |
1986年 | 84篇 |
1985年 | 83篇 |
1984年 | 69篇 |
1983年 | 70篇 |
1982年 | 57篇 |
1981年 | 36篇 |
1980年 | 29篇 |
1979年 | 22篇 |
1978年 | 17篇 |
1977年 | 12篇 |
1976年 | 12篇 |
1959年 | 16篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
41.
42.
The grouping of pixels based on some similarity criteria is called image segmentation. In this paper the problem of color image segmentation is considered as a clustering problem and a fixed length genetic algorithm (GA) is used to handle it. The effectiveness of GA depends on the objective function (fitness function) and the initialization of the population. A new objective function is proposed to evaluate the quality of the segmentation and the fitness of a chromosome. In fixed length genetic algorithm the chromosomes have same length, which is normally set by the user. Here, a self organizing map (SOM) is used to determine the number of segments in order to set the length of a chromosome automatically. An opposition based strategy is adopted for the initialization of the population in order to diversify the search process. In some cases the proposed method makes the small regions of an image as separate segments, which leads to noisy segmentation. A simple ad hoc mechanism is devised to refine the noisy segmentation. The qualitative and quantitative results show that the proposed method performs better than the state-of-the-art methods. 相似文献
43.
Creating an intelligent system that can accurately predict stock price in a robust way has always been a subject of great interest for many investors and financial analysts. Predicting future trends of financial markets is more remarkable these days especially after the recent global financial crisis. So traders who access to a powerful engine for extracting helpful information throw raw data can meet the success. In this paper we propose a new intelligent model in a multi-agent framework called bat-neural network multi-agent system (BNNMAS) to predict stock price. The model performs in a four layer multi-agent framework to predict eight years of DAX stock price in quarterly periods. The capability of BNNMAS is evaluated by applying both on fundamental and technical DAX stock price data and comparing the outcomes with the results of other methods such as genetic algorithm neural network (GANN) and some standard models like generalized regression neural network (GRNN), etc. The model tested for predicting DAX stock price a period of time that global financial crisis was faced to economics. The results show that BNNMAS significantly performs accurate and reliable, so it can be considered as a suitable tool for predicting stock price specially in a long term periods. 相似文献
44.
In this paper, the Thyristor-Controlled Series-Compensated (TCSC) devices are located for congestion management in the power system by considering the non-smooth fuel cost function and penalty cost of emission. For this purpose, it is considered that the objective function of the proposed optimal power flow (OPF) problem is minimizing fuel and emission penalty cost of generators. A hybrid method that is the combination of the bacterial foraging (BF) algorithm with Nelder–Mead (NM) method (BF-NM) is employed to solve the OPF problems. The optimal location of the TCSC devices are then determined for congestion management. The size of the TCSC is obtained by using of the BF-NM algorithm to minimize the cost of generation, cost of emission, and cost of TCSC. The simulation results on IEEE 30-bus, modified IEEE 30-bus and IEEE 118-bus test system confirm the efficiency of the proposed method for finding the optimal location of the TCSC with non-smooth non-convex cost function and emission for congestion management in the power system. In addition, the results clearly show that a better solution can be achieved by using the proposed OPF problem in comparison with other intelligence methods. 相似文献
45.
Short-term generation scheduling is an important function in daily operational planning of power systems. It is defined as optimal scheduling of power generators over a scheduling period while respecting various generator constraints and system constraints. Objective of the problem includes costs associated with energy production, start-up cost and shut-down cost along with profits. The resulting problem is a large scale nonlinear mixed-integer optimization problem for which there is no exact solution technique available. The solution to the problem can be obtained only by complete enumeration, often at the cost of a prohibitively computation time requirement for realistic power systems. This paper presents a hybrid algorithm which combines Lagrangian Relaxation (LR) together with Evolutionary Algorithm (EA) to solve the problem in cooperative and competitive energy environments. Simulation studies were carried out on different systems containing various numbers of units. The outcomes from different algorithms are compared with that from the proposed hybrid algorithm and the advantages of the proposed algorithm are briefly discussed. 相似文献
46.
This research proposes ACARDS (Augmented-Context bAsed RecommenDation Service) framework that is able to utilize knowledge over the Linked Open Data (LOD) cloud to recommend context-based services to users. To improve the level of user satisfaction with the result of the recommendation, the ACARDS framework implements a novel recommendation algorithm that can utilize the knowledge over the LOD cloud. In addition, the noble algorithm is able to use new concepts like the enriched tags and the augmented tags that originate from the hashtags on the SNSs materials. These tags are utilized to recommend the most appropriate services in the user’s context, which can change dynamically. Last but not least, the ACARDS framework implements the context-based reshaping algorithm on the augmented tag cloud. In the reshaping process, the ACARDS framework can recommend the highly receptive services in the users’ context and their preferences. To evaluate the performance of the ACARDS framework, we conduct four kinds of experiments using the Instagram materials and the LOD cloud. As a result, we proved that the ACARDS framework contributes to increasing the query efficiency by reducing the search space and improving the user satisfaction on the recommended services. 相似文献
47.
目前网络上的服装图像数量增长迅猛,对于大量服装图像实现智能分类的需求日益增加。将基于区域的全卷积网络(Region-Based Fully Convolutional Networks,R-FCN)引入到服装图像识别中,针对服装图像分类中网络训练时间长、形变服装图像识别率低的问题,提出一种新颖的改进框架HSR-FCN。新框架将R-FCN中的区域建议网络和HyperNet网络相融合,改变图片特征学习方式,使得HSR-FCN可以在更短的训练时间内达到更高的准确率。在模型中引入了空间转换网络,对输入服装图像和特征图进行了空间变换及对齐,加强了对多角度服装和形变服装的特征学习。实验结果表明,改进后的HSR-FCN模型有效地加强了对形变服装图像的学习,且在训练时间更短的情况下,比原来的网络模型R-FCN平均准确率提高了大约3个百分点,达到96.69%。 相似文献
48.
为了充分利用RGB-D图像的深度图像信息,提出了基于张量分解的物体识别方法。首先将RGB-D图像构造成一个四阶张量,然后将该四阶张量分解为一个核心张量和四个因子矩阵,再利用相应的因子矩阵将原张量进行投影,获得融合后的RGB-D数据,最后输入到卷积神经网络中进行识别。RGB-D数据集中三组相似物体的识别结果表明,利用张量分解融合RGB-D图像的物体识别准确率高于未采用张量分解的物体识别准确率,并且单一错分实例的准确率最高可提升99%。 相似文献
49.
图像纹理增强过程中容易丢失平滑区域纹理细节,而分数阶微分增强虽然能够非线性保留平滑区域纹理细节,但对频率分辨率敏感。针对这个问题,提出一种基于小波变换的分数阶微分纹理增强算法,应用于平扫计算机断层扫描(CT)图像的肝脏肿瘤区域的纹理增强。首先,通过小波变换将图像感兴趣区分解成多个子带分量;其次,基于分数阶微分定义构造一个带补偿参数的分数阶微分掩膜;最后,使用该掩膜与每个高频子带分量进行卷积并利用小波逆变换重组图像感兴趣区。实验结果表明,该方法在使用较大分数阶次显著增强肿瘤区域的高频轮廓信息的同时,有效地保留了低频平滑的纹理细节:增强后的肝细胞癌区域与原区域相比,信息熵平均增加36.56%,平均梯度平均增加321.56%,平均绝对差值平均为9.287;增强后的肝血管瘤区域与原区域相比,信息熵平均增加48.77%,平均梯度平均增加511.26%,平均绝对差值平均为14.097。 相似文献
50.