首页 | 官方网站   微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   64787篇
  免费   12524篇
  国内免费   8882篇
工业技术   86193篇
  2024年   395篇
  2023年   1167篇
  2022年   2306篇
  2021年   2432篇
  2020年   2701篇
  2019年   2255篇
  2018年   2240篇
  2017年   2631篇
  2016年   3046篇
  2015年   3667篇
  2014年   4730篇
  2013年   4507篇
  2012年   5719篇
  2011年   5955篇
  2010年   4868篇
  2009年   4985篇
  2008年   5249篇
  2007年   5684篇
  2006年   4455篇
  2005年   3647篇
  2004年   2931篇
  2003年   2317篇
  2002年   1711篇
  2001年   1330篇
  2000年   1139篇
  1999年   887篇
  1998年   712篇
  1997年   566篇
  1996年   435篇
  1995年   296篇
  1994年   256篇
  1993年   194篇
  1992年   188篇
  1991年   89篇
  1990年   122篇
  1989年   80篇
  1988年   57篇
  1987年   21篇
  1986年   30篇
  1985年   30篇
  1984年   22篇
  1983年   22篇
  1982年   24篇
  1981年   13篇
  1980年   20篇
  1979年   9篇
  1978年   10篇
  1977年   8篇
  1975年   9篇
  1959年   9篇
排序方式: 共有10000条查询结果,搜索用时 46 毫秒
31.
为了解决被动雷达系统中的多发射源定位问题,提出了一种基于多重信号分类(MUSIC)算法和图像膨胀(IE)算法的直接定位方法。该方法结合了谱分析中的MUSIC思想,通过对接收量测协方差矩阵进行特征分析求解目标的位置。首先,在目标个数未知的前提下,利用Akaike信息准则(AIC)来确定模型阶数;然后,推导了基于MUSIC的定位代价函数;之后,利用图像膨胀算法处理得到的代价函数平面;最后,膨胀处理后的输出为目标个数及目标位置的估计值。提出的算法有效地解决了目标检测及提取的问题,能够确定多个目标的位置坐标,为后续的定位性能分析提供可能性,也保证了算法的完整性。进一步地分析了多个临近目标情况下影响目标提取性能的主要因素。  相似文献   
32.
针对谱聚类融合模糊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适合用于功能模块的挖掘。  相似文献   
33.
陈万志  徐东升  张静  唐雨 《计算机应用》2019,39(4):1089-1094
针对工业控制系统传统单一检测算法模型对不同攻击类型检测率和检测速度不佳的问题,提出一种优化支持向量机和K-means++算法结合的入侵检测模型。首先利用主成分分析法(PCA)对原始数据集进行预处理,消除其相关性;其次在粒子群优化(PSO)算法的基础上加入自适应变异过程避免在训练的过程中陷入局部最优解;然后利用自适应变异粒子群优化(AMPSO)算法优化支持向量机的核函数和惩罚参数;最后利用密度中心法改进K-means算法与优化后的支持向量机组合成入侵检测模型,从而实现工业控制系统的异常检测。实验结果表明,所提方法在检测速度和对各类攻击的检测率上得到明显提升。  相似文献   
34.
Optimization of tool path planning using metaheuristic algorithms such as ant colony systems (ACS) and particle swarm optimization (PSO) provides a feasible approach to reduce geometrical machining errors in 5-axis flank machining of ruled surfaces. The optimal solutions of these algorithms exhibit an unsatisfactory quality in a high-dimensional search space. In this study, various algorithms derived from the electromagnetism-like mechanism (EM) were applied. The test results of representative surfaces showed that all EM-based methods yield more effective optimal solutions than does PSO, despite a longer search time. A new EM-MSS (electromagnetism-like mechanism with move solution screening) algorithm produces the most favorable results by ensuring the continuous improvement of new searches. Incorporating an SPSA (simultaneous perturbation stochastic approximation) technique further improves the search results with effective initial solutions. This work enhances the practical values of tool path planning by providing a satisfactory machining quality.  相似文献   
35.
针对交通拥挤环境下日益增长的城市配送需求,通过分析时序依赖对成本和碳排放的影响,引入车辆在节点等待和离散调度策略,研究基于时序依赖的低碳城市配送车辆路径与离散调度问题。为求解该问题,设计基于遗传算法与局部搜索相结合的混合进化搜索算法对模型求解,用积极的局部搜索机制替代随机的变异操作,并通过可行解构造算法、变概率交叉和多种局部搜索策略来提高算法求解质量和求解效率。通过对比仿真实验对算法和模型的有效性进行了验证。  相似文献   
36.
Information‐Centric Networking (ICN) has been accepted to overcome some weaknesses of the current Internet architecture, showing that “what is being exchanged” is more important than “who are exchanging information.” Given the inadequate considerations on Quality of Service (QoS) and energy saving in ICN routing, we propose in this paper a routing algorithm to enhance the two aspects. At first, on one hand, Cauchy distribution is used as a fuzzy model to evaluate users' QoS requirements, such as bandwidth, delay, and error rate; on the other hand, we formulate energy saving problem to evaluate the green quality of routing algorithm. Then, we design a link selection approach by considering QoS and energy saving, which belongs to a multi‐objective decision problem resolved by intelligent drops algorithm. Finally, we implement the proposed algorithm and compare it with the famous adaptive forwarding mechanism in terms of some significant metrics, and the experimental results reveal that the proposed algorithm is more efficient.  相似文献   
37.
This study assesses the potential of energy flexibility of space heating and cooling for a typical household under different geographical conditions in Portugal. The proposed approach modifies the demand through the optimization of the thermostat settings using a genetic algorithm to reduce either operational costs or interaction with the grid. The results show that the used energy flexibility indicator expresses the available potential and that flexibility depends on several factors, namely: i) thermal inertia of the archetypical household; ii) the time of use electricity tariffs; iii) users’ comfort boundaries; and iv) the geographical location of the houses.  相似文献   
38.
This paper proposes a novel optimization algorithm inspired by the ions motion in nature. In fact, the proposed algorithm mimics the attraction and repulsion of anions and cations to perform optimization. The proposed algorithm is designed in such a way to have the least tuning parameters, low computational complexity, fast convergence, and high local optima avoidance. The performance of this algorithm is benchmarked on 10 standard test functions and compared to four well-known algorithms in the literature. The results demonstrate that the proposed algorithm is able to show very competitive results and has merits in solving challenging optimization problems.  相似文献   
39.
The paper focuses on the adaptive relational association rule mining problem. Relational association rules represent a particular type of association rules which describe frequent relations that occur between the features characterizing the instances within a data set. We aim at re-mining an object set, previously mined, when the feature set characterizing the objects increases. An adaptive relational association rule method, based on the discovery of interesting relational association rules, is proposed. This method, called ARARM (Adaptive Relational Association Rule Mining) adapts the set of rules that was established by mining the data before the feature set changed, preserving the completeness. We aim to reach the result more efficiently than running the mining algorithm again from scratch on the feature-extended object set. Experiments testing the method's performance on several case studies are also reported. The obtained results highlight the efficiency of the ARARM method and confirm the potential of our proposal.  相似文献   
40.
The optimization of energy consumption, with consequent cost reduction, is one of the main challenges for the present and future smart grid. Demand response (DR) program is expected to be vital in home energy management system (HEMS) which aims to schedule the operation of appliances to save energy costs by considering customer convenience as well as characteristics of electric appliances. The DR program is a challenging optimization problem especially when the formulations are non-convex or NP-hard problems. In order to solve this challenging optimization problem efficiently, an effective heuristic approach is proposed to achieve a near optimal solution with low computational costs. Different from previously proposed methods in literatures which are not suitable to be run in embedded devices such as a smart meter. The proposed algorithm can be implemented in an embedded device which has severe limitations on memory size and computational power, and can get an optimal value in real-time. Numerical studies were carried out with the data simulating practical scenarios are provided to demonstrate the effectiveness of the proposed method.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号