全文获取类型
收费全文 | 119865篇 |
免费 | 19398篇 |
国内免费 | 13744篇 |
专业分类
电工技术 | 13794篇 |
技术理论 | 2篇 |
综合类 | 15707篇 |
化学工业 | 5269篇 |
金属工艺 | 3435篇 |
机械仪表 | 10377篇 |
建筑科学 | 6826篇 |
矿业工程 | 2878篇 |
能源动力 | 3021篇 |
轻工业 | 1655篇 |
水利工程 | 2969篇 |
石油天然气 | 2274篇 |
武器工业 | 2211篇 |
无线电 | 15972篇 |
一般工业技术 | 9787篇 |
冶金工业 | 1591篇 |
原子能技术 | 508篇 |
自动化技术 | 54731篇 |
出版年
2024年 | 600篇 |
2023年 | 1949篇 |
2022年 | 3663篇 |
2021年 | 4016篇 |
2020年 | 4439篇 |
2019年 | 3784篇 |
2018年 | 3691篇 |
2017年 | 4528篇 |
2016年 | 5263篇 |
2015年 | 5983篇 |
2014年 | 8040篇 |
2013年 | 8132篇 |
2012年 | 9895篇 |
2011年 | 10105篇 |
2010年 | 8185篇 |
2009年 | 8365篇 |
2008年 | 8633篇 |
2007年 | 9691篇 |
2006年 | 7936篇 |
2005年 | 6559篇 |
2004年 | 5296篇 |
2003年 | 4342篇 |
2002年 | 3450篇 |
2001年 | 2873篇 |
2000年 | 2539篇 |
1999年 | 2012篇 |
1998年 | 1627篇 |
1997年 | 1396篇 |
1996年 | 1135篇 |
1995年 | 904篇 |
1994年 | 781篇 |
1993年 | 603篇 |
1992年 | 533篇 |
1991年 | 369篇 |
1990年 | 335篇 |
1989年 | 296篇 |
1988年 | 214篇 |
1987年 | 108篇 |
1986年 | 97篇 |
1985年 | 88篇 |
1984年 | 103篇 |
1983年 | 68篇 |
1982年 | 76篇 |
1981年 | 41篇 |
1980年 | 60篇 |
1979年 | 54篇 |
1978年 | 23篇 |
1977年 | 31篇 |
1976年 | 18篇 |
1975年 | 21篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
51.
针对工业控制系统传统单一检测算法模型对不同攻击类型检测率和检测速度不佳的问题,提出一种优化支持向量机和K-means++算法结合的入侵检测模型。首先利用主成分分析法(PCA)对原始数据集进行预处理,消除其相关性;其次在粒子群优化(PSO)算法的基础上加入自适应变异过程避免在训练的过程中陷入局部最优解;然后利用自适应变异粒子群优化(AMPSO)算法优化支持向量机的核函数和惩罚参数;最后利用密度中心法改进K-means算法与优化后的支持向量机组合成入侵检测模型,从而实现工业控制系统的异常检测。实验结果表明,所提方法在检测速度和对各类攻击的检测率上得到明显提升。 相似文献
52.
Computer-Supported Collaborative Learning (CSCL) is concerned with how Information and Communication Technology (ICT) might facilitate learning in groups which can be co-located or distributed over a network of computers such as Internet. CSCL supports effective learning by means of communication of ideas and information among learners, collaborative access of essential documents, and feedback from instructors and peers on learning activities. As the cloud technologies are increasingly becoming popular and collaborative learning is evolving, new directions for development of collaborative learning tools deployed on cloud are proposed. Development of such learning tools requires access to substantial data stored in the cloud. Ensuring efficient access to such data is hindered by the high latencies of wide-area networks underlying the cloud infrastructures. To improve learners’ experience by accelerating data access, important files can be replicated so a group of learners can access data from nearby locations. Since a cloud environment is highly dynamic, resource availability, network latency, and learner requests may change. In this paper, we present the advantages of collaborative learning and focus on the importance of data replication in the design of such a dynamic cloud-based system that a collaborative learning portal uses. To this end, we introduce a highly distributed replication technique that determines optimal data locations to improve access performance by minimizing replication overhead (access and update). The problem is formulated using dynamic programming. Experimental results demonstrate the usefulness of the proposed collaborative learning system used by institutions in geographically distributed locations. 相似文献
53.
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. 相似文献
54.
Mingchang Lin Yufei Zhang Guosong Chen Ming Jiang 《Small (Weinheim an der Bergstrasse, Germany)》2015,11(45):6065-6070
Glyco‐mimicking nanoparticles (glyco‐NPs) with Förster resonance energy transfer (FRET) donor and acceptor groups formed via dynamic covalent bond of benzoboroxole and sugar from two complementary polymers are prepared. The glyco‐NPs are proved to be quite stable under physiological conditions but sensitive to pH. So the glyco‐NPs can be internalized by dendritic cells with integrity and nontoxicity and then dissociate within the acidic organelles. This particle dissociation is directly observed and visualized in vitro, for the first time via the FRET measurements and fluorescent microscopy. This feature makes controlled release of drug or protein by glyco‐NPs possible, i.e., when model antigen Ovalbumin is loaded in the glyco‐NPs, the released Ovalbumin in dendritic cells stimulates T cells more efficiently than the free Ovalbumin itself as a result of the enhanced antigen processing and presentation. Thus, the results enlighten a bright future of the glyco‐NPs in immunotherapy. 相似文献
55.
周林 《计算机工程与应用》2019,55(8):264-270
针对交通拥挤环境下日益增长的城市配送需求,通过分析时序依赖对成本和碳排放的影响,引入车辆在节点等待和离散调度策略,研究基于时序依赖的低碳城市配送车辆路径与离散调度问题。为求解该问题,设计基于遗传算法与局部搜索相结合的混合进化搜索算法对模型求解,用积极的局部搜索机制替代随机的变异操作,并通过可行解构造算法、变概率交叉和多种局部搜索策略来提高算法求解质量和求解效率。通过对比仿真实验对算法和模型的有效性进行了验证。 相似文献
56.
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. 相似文献
57.
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. 相似文献
58.
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. 相似文献
59.
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. 相似文献
60.
During restructuring processes, due to mergers and acquisitions, banks frequently face the problem of having redundant branches competing in the same market. In this work, we introduce a new Capacitated Branch Restructuring Model which extends the available literature in delocation models. It considers both closing down and long term operations׳ costs, and addresses the problem of resizing open branches in order to maintain a constant service level. We consider, as well, the presence of competitors and allow for ceding market share whenever the restructuring costs are prohibitively expensive.We test our model in a real life scenario, obtaining a reduction of about 40% of the network size, and annual savings over 45% in operation costs from the second year on. We finally perform a sensitivity analysis on critical parameters. This analysis shows that the final design of the network depends on certain strategic decisions concerning the redundancy of the branches, as well as their proximity to the demand nodes and to the competitor׳s branches. At the same time, this design is quite robust to changes in the parameters associated with the adjustments on service capacity and with the market reaction. 相似文献