全文获取类型
收费全文 | 16360篇 |
免费 | 1867篇 |
国内免费 | 1734篇 |
专业分类
电工技术 | 1534篇 |
技术理论 | 1篇 |
综合类 | 1637篇 |
化学工业 | 607篇 |
金属工艺 | 258篇 |
机械仪表 | 1329篇 |
建筑科学 | 1179篇 |
矿业工程 | 215篇 |
能源动力 | 379篇 |
轻工业 | 359篇 |
水利工程 | 569篇 |
石油天然气 | 158篇 |
武器工业 | 135篇 |
无线电 | 1786篇 |
一般工业技术 | 1552篇 |
冶金工业 | 541篇 |
原子能技术 | 38篇 |
自动化技术 | 7684篇 |
出版年
2024年 | 92篇 |
2023年 | 239篇 |
2022年 | 408篇 |
2021年 | 437篇 |
2020年 | 575篇 |
2019年 | 482篇 |
2018年 | 491篇 |
2017年 | 573篇 |
2016年 | 682篇 |
2015年 | 718篇 |
2014年 | 1121篇 |
2013年 | 1569篇 |
2012年 | 1232篇 |
2011年 | 1258篇 |
2010年 | 992篇 |
2009年 | 1120篇 |
2008年 | 1152篇 |
2007年 | 1181篇 |
2006年 | 1042篇 |
2005年 | 881篇 |
2004年 | 757篇 |
2003年 | 566篇 |
2002年 | 456篇 |
2001年 | 386篇 |
2000年 | 283篇 |
1999年 | 242篇 |
1998年 | 188篇 |
1997年 | 161篇 |
1996年 | 120篇 |
1995年 | 97篇 |
1994年 | 94篇 |
1993年 | 64篇 |
1992年 | 61篇 |
1991年 | 53篇 |
1990年 | 31篇 |
1989年 | 33篇 |
1988年 | 17篇 |
1987年 | 8篇 |
1986年 | 14篇 |
1985年 | 12篇 |
1984年 | 12篇 |
1983年 | 8篇 |
1981年 | 6篇 |
1980年 | 5篇 |
1978年 | 4篇 |
1976年 | 5篇 |
1975年 | 3篇 |
1971年 | 5篇 |
1957年 | 3篇 |
1955年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
41.
班级、教师、课程、教室、时间是课表的基本要素,通过把排课转化为求图的完全独立集,解决了时间冲突问题和合班课问题;根据教室资源限制,对独立集的个数和大小进行控制,解决了教室完全匹配问题和一门课程的不同教室安排问题.为实现排课软件提供了一个面向实际的算法. 相似文献
42.
Anna Bucalo 《Journal of Logic, Language and Information》1994,3(3):211-232
We present a semantic study of a family of modal intuitionistic linear systems, providing various logics with both an algebraic semantics and a relational semantics, to obtain completeness results. We call modality a unary operator on formulas which satisfies only one rale (regularity), and we consider any subsetW of a list of axioms which defines the exponential of course of linear logic. We define an algebraic semantics by interpreting the modality as a unary operation on an IL-algebra. Then we introduce a relational semantics based on pretopologies with an additional binary relationr between information states. The interpretation of is defined in a suitable way, which differs from the traditional one in classical modal logic. We prove that such models provide a complete semantics for our minimal modal system, as well as, by requiring the suitable conditions onr (in the spirit of correspondence theory), for any of its extensions axiomatized by any subsetW as above. We also prove an embedding theorem for modal IL-algebras into complete ones and, after introducing the notion of general frame, we apply it to obtain a duality between general frames and modal IL-algebras. 相似文献
43.
随着电动汽车的普及度越来越高,工业园区的电动汽车用户日益增多,其充放电行为对园区综合能源系统规划和运行带来极大挑战。本文提出了考虑电动汽车充放电意愿的园区综合能源系统双层优化调度。首先基于动态实时电价、电池荷电量、电池损耗补偿、额外参与激励等因素建立充放电意愿模型,在此基础上得到改进的电动汽车充放电模型;然后,以园区综合能源系统总成本最小和电动汽车充电费用最小为目标建立双层优化调度模型,通过KKT条件将内层模型转化为外层模型的约束条件,从而快速稳定的实现单层模型的求解;最后,进行仿真求解,设置3种不同场景,对比了所提模型与一般充放电意愿模型,验证了文中所提引入EV充放电意愿模型的园区综合能源系统双层优化调度的有效性和可行性,具有一定的经济效益。 相似文献
44.
In this paper, a modified teaching–learning-based optimisation (mTLBO) algorithm is proposed to solve the re-entrant hybrid flowshop scheduling problem (RHFSP) with the makespan and the total tardiness criteria. Based on the simple job-based representation, a novel decoding method named equivalent due date-based permutation schedule is proposed to transfer an individual to a feasible schedule. At each generation, a number of superior individuals are selected as the teachers by the Pareto-based ranking phase. To enhance the exploitation ability in the promising area, the insertion-based local search is embedded in the search framework as the training phase for the TLBO. Due to the characteristics of the permutation-based discrete optimisation, the linear order crossover operator and the swap operator are adopted to imitate the interactions among the individuals in both the teaching phase and the learning phase. To store the non-dominated solutions explored during the search process, an external archive is used and updated when necessary. The influence of the parameter setting on the mTLBO in solving the RHFSP is investigated, and numerical tests with some benchmarking instances are carried out. The comparative results show that the proposed mTLBO outperforms the existing algorithms significantly. 相似文献
45.
为了克服中小型机械企业建立网站的经费不足、功能不全和缺乏安全性等问题,提出了建立通用企业网站的方案。首先通过广泛调研企业的需求,总结和分析了企业信息、客户管理、产品管理、销售与市场管理、物资供应管理、人事管理和安全管理等模块的功能;其次,分析了主要的业务流程和业务重组。 相似文献
46.
Jean‐Paul M. Arnaout Marwan Maatouk 《International Transactions in Operational Research》2010,17(5):595-605
The agriculture sector still lacks the tools and models to enhance the utilization of different resources. This paper addresses the vineyard harvesting problem in developing countries, with the objective of optimizing the wine quality and minimizing the operational costs. Heuristics were introduced to better assign the harvesting days to the different grape blocks that exist in the vineyard's field. The quality of the grapes was a key target as it can transform production from a pinnacle wine to a bulk one. We solved several numerical examples for verification and demonstrative purposes and found that our proposed approach finds solutions that significantly reduce the harvesting costs in the vineyard and considerably outperform Branch and Bound algorithm especially for large problems. 相似文献
47.
Clients from Delay Tolerant Networks (DTNs) might encounter overtime exceptions when they aggregate autonomic commercial web service references to form an all-or-nothing transaction. Such exceptions may cause extra overhead—“compensation cost” when aborting transactions. Regarding the delay-related characteristics of DTNs, this paper models the expected compensation cost (ECC) for the schedulings of commit-requests, presents a calculability analysis for quantitative ECC prediction, and explores the limitation of ECC’s probabilistic prediction accordingly. The analysis is based on the timed-2PC plus compensation (t2PC+) protocol and the multi-step price tag pattern, which is verified conditionally by simulation tests through randomly-chosen severely-fluctuant samplings of compensation cost and delays. The ultimate target of this work is to demonstrate the high complexity, and in particular, the uncertainty of ECC predictions due to the randomicity of DTNs’ delays. 相似文献
48.
49.
50.