全文获取类型
收费全文 | 13743篇 |
免费 | 1376篇 |
国内免费 | 753篇 |
专业分类
电工技术 | 314篇 |
综合类 | 821篇 |
化学工业 | 2315篇 |
金属工艺 | 1027篇 |
机械仪表 | 373篇 |
建筑科学 | 591篇 |
矿业工程 | 334篇 |
能源动力 | 333篇 |
轻工业 | 4136篇 |
水利工程 | 209篇 |
石油天然气 | 798篇 |
武器工业 | 207篇 |
无线电 | 755篇 |
一般工业技术 | 1041篇 |
冶金工业 | 993篇 |
原子能技术 | 154篇 |
自动化技术 | 1471篇 |
出版年
2024年 | 91篇 |
2023年 | 241篇 |
2022年 | 422篇 |
2021年 | 464篇 |
2020年 | 530篇 |
2019年 | 464篇 |
2018年 | 436篇 |
2017年 | 550篇 |
2016年 | 513篇 |
2015年 | 535篇 |
2014年 | 752篇 |
2013年 | 833篇 |
2012年 | 920篇 |
2011年 | 1049篇 |
2010年 | 798篇 |
2009年 | 792篇 |
2008年 | 682篇 |
2007年 | 868篇 |
2006年 | 737篇 |
2005年 | 622篇 |
2004年 | 524篇 |
2003年 | 408篇 |
2002年 | 391篇 |
2001年 | 335篇 |
2000年 | 301篇 |
1999年 | 262篇 |
1998年 | 196篇 |
1997年 | 186篇 |
1996年 | 181篇 |
1995年 | 145篇 |
1994年 | 140篇 |
1993年 | 89篇 |
1992年 | 88篇 |
1991年 | 69篇 |
1990年 | 53篇 |
1989年 | 43篇 |
1988年 | 33篇 |
1987年 | 26篇 |
1986年 | 24篇 |
1985年 | 21篇 |
1984年 | 16篇 |
1983年 | 8篇 |
1982年 | 9篇 |
1981年 | 4篇 |
1980年 | 2篇 |
1979年 | 4篇 |
1977年 | 3篇 |
1975年 | 2篇 |
1961年 | 2篇 |
1959年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
151.
柳清 《数码设计:surface》2010,(5):168-169
目前我国的艺术院校的色彩构成教学有明显的几个弊端:一是注重对色彩理论的试验分析,偏重已有理论成果的再现,不注重对色彩运用的感性分析;二是缺乏主题性设计的引入,缺乏色彩研究的创新思路,不注重研究民族传统色彩。因此,针对色彩构成教学几十年来几乎一成不变的教学体系与模式,需要进行改革和深化。为了实现这一目标,首先要对现有色彩构成的概念进行反思和追溯。 相似文献
152.
153.
154.
155.
This work studies a nonlinear optimization problem subject to fuzzy relational equations with max-t-norm composition. Since the feasible domain of fuzzy relational equations with more than one minimal solution is non-convex, traditional nonlinear programming methods usually cannot solve them efficiently. This work proposes a genetic algorithm to solve this problem. This algorithm first locates the feasible domain through the maximum solution and the minimal solutions of the fuzzy relational equations, to significantly reduce the search space. The algorithm then executes all genetic operations inside this feasible domain, and thus avoids the need to check the feasibility of each solution generated. Moreover, it uses a local search operation to fine-tune each mutated solution. Experimental results indicate that the proposed algorithm can accelerate the searching speed and find the optimal solution. 相似文献
156.
157.
Bih-Sheue Shieh 《Information Sciences》2011,181(4):832-841
The work examines the feasibility of minimizing a linear objective function subject to a max-t fuzzy relation equation constraint, where t is a continuous/Archimedean t-norm. Conventional methods for solving this problem are significantly improved by, first separating the problem into two sub-problems according to the availability of positive coefficients. This decomposition is thus more easily handled than in previous literature. Next, based on use of the maximum solution of the constraint equation, the sub-problem with non-positive coefficients is solved and the size of the sub-problem with positive coefficients reduced as well. This step is unique among conventional methods, owing to its ability to determine as many optimal variables as possible. Additionally, several rules are developed for simplifying the remaining problem. Finally, those undecided optimal variables are obtained using the covering problem rather than the branch-and-bound methods. Three illustrative examples demonstrate that the proposed approach outperforms conventional schemes. Its potential applications are discussed as well. 相似文献
158.
Yuan-sheng Luo Yong Qi Di HouLin-feng Shen Ying ChenXiao Zhong 《Computer Communications》2011,34(9):1137-1144
Many works have been carried out to find the efficient algorithms for QoS-aware service composition in recent years. Nevertheless, on one hand, some of these works only consider the local QoS attributes in Web services composition; on the other hand, some ideas derived from QoS selection algorithms for network routing are directly applied in service composition without any adaption. A service composition model with end-to-end QoS constraints has been presented in this paper. An improved heuristics HCE based on the observation of characteristic of end-to-end service composition is proposed as a novel solution. Simulation results reveal the better performance of proposed heuristic compared to the other two heuristics, HMCOP and generic CE algorithm. 相似文献
159.
Kais KlaiAuthor Vitae Samir TataAuthor VitaeJörg DeselAuthor Vitae 《Data & Knowledge Engineering》2011,70(5):467-482
The design of complex inter-enterprise business processes (IEBP) is generally performed in a modular way. Each process is designed separately and then the whole IEBP is obtained by composition. Even if such a modular approach is intuitive and facilitates the design problem, it poses the problem that correct behavior of each business process of the IEBP taken alone does not guarantee a correct behavior of the composed IEBP (i.e. properties are not preserved by composition). Proving correctness of the (unknown) composed process is strongly related to the model checking problem of a system model. Among others, the symbolic observation graph based approach has proven to be very helpful for efficient model checking in general. Since it is heavily based on abstraction techniques and thus hides detailed information about system components that are not relevant for the correctness decision, it is promising to transfer this concept to the problem raised in this paper: How can the symbolic observation graph technique be adapted and employed for process composition? Answering this question is the aim of this paper. 相似文献
160.
针对传统基于语义服务动态合成的低效率和授权管理的有效性不高,提出了基于行为能力约束的服务动态授权管理方法。该方法借助数学优化模型,对服务合成的路径进行了描述,根据成份服务间的约束关系,提出了协同应用服务动态合成算法。基于行为能力约束,将服务合成的语义推理进行预先处理,探索构成协同应用服务的最小行为能力,根据服务请求用户所拥有的行为能力与协同应用服务所需的最小行为能力的关系进行判断授权,避免了用户提出服务请求时的大规模空间搜索和服务语义间的推理计算问题。实验结果分析表明,该方法提高了服务授权管理的自动化程度和有效性,并且具有较高的动态适应能力。 相似文献