全文获取类型
收费全文 | 41644篇 |
免费 | 2412篇 |
国内免费 | 36篇 |
专业分类
电工技术 | 273篇 |
综合类 | 31篇 |
化学工业 | 7573篇 |
金属工艺 | 732篇 |
机械仪表 | 796篇 |
建筑科学 | 1318篇 |
矿业工程 | 75篇 |
能源动力 | 811篇 |
轻工业 | 5509篇 |
水利工程 | 378篇 |
石油天然气 | 173篇 |
武器工业 | 4篇 |
无线电 | 2332篇 |
一般工业技术 | 7447篇 |
冶金工业 | 10876篇 |
原子能技术 | 200篇 |
自动化技术 | 5564篇 |
出版年
2023年 | 363篇 |
2022年 | 359篇 |
2021年 | 916篇 |
2020年 | 762篇 |
2019年 | 700篇 |
2018年 | 1532篇 |
2017年 | 1530篇 |
2016年 | 1583篇 |
2015年 | 1128篇 |
2014年 | 1433篇 |
2013年 | 2797篇 |
2012年 | 2441篇 |
2011年 | 2291篇 |
2010年 | 1793篇 |
2009年 | 1596篇 |
2008年 | 1882篇 |
2007年 | 1639篇 |
2006年 | 1245篇 |
2005年 | 1042篇 |
2004年 | 978篇 |
2003年 | 861篇 |
2002年 | 774篇 |
2001年 | 492篇 |
2000年 | 492篇 |
1999年 | 627篇 |
1998年 | 3373篇 |
1997年 | 2017篇 |
1996年 | 1322篇 |
1995年 | 777篇 |
1994年 | 665篇 |
1993年 | 645篇 |
1992年 | 215篇 |
1991年 | 226篇 |
1990年 | 232篇 |
1989年 | 221篇 |
1988年 | 195篇 |
1987年 | 171篇 |
1986年 | 182篇 |
1985年 | 216篇 |
1984年 | 184篇 |
1983年 | 131篇 |
1982年 | 160篇 |
1981年 | 173篇 |
1980年 | 155篇 |
1979年 | 127篇 |
1978年 | 121篇 |
1977年 | 197篇 |
1976年 | 416篇 |
1975年 | 89篇 |
1973年 | 81篇 |
排序方式: 共有10000条查询结果,搜索用时 85 毫秒
971.
Understanding argumentation and its role in human reasoning has been a continuous subject of investigation for scholars from
the ancient Greek philosophers to current researchers in philosophy, logic and artificial intelligence. In recent years, argumentation
models have been used in different areas such as knowledge representation, explanation, proof elaboration, commonsense reasoning,
logic programming, legal reasoning, decision making, and negotiation. However, these models address quite specific needs and
there is need for a conceptual framework that would organize and compare existing argumentation-based models and methods.
Such a framework would be very useful especially for researchers and practitioners who want to select appropriate argumentation
models or techniques to be incorporated in new software systems with argumentation capabilities. In this paper, we propose
such a conceptual framework, based on taxonomy of the most important argumentation models, approaches and systems found in
the literature. This framework highlights the similarities and differences between these argumentation models. As an illustration
of the practical use of this framework, we present a case study which shows how we used this framework to select and enrich
an argumentation model in a knowledge acquisition project which aimed at representing argumentative knowledge contained in
texts critiquing military courses of action. 相似文献
972.
973.
Jorge E. Mendoza Bruno Castanier Christelle Guéret Andrés L. Medaglia Nubia Velasco 《Computers & Operations Research》2010,37(11):1886-1898
The multi-compartment vehicle routing problem (MC-VRP) consists of designing transportation routes to satisfy the demands of a set of customers for several products that, because of incompatibility constraints, must be loaded in independent vehicle compartments. Despite its wide practical applicability the MC-VRP has not received much attention in the literature, and the few existing methods assume perfect knowledge of the customer demands, regardless of their stochastic nature. This paper extends the MC-VRP by introducing uncertainty on what it is known as the MC-VRP with stochastic demands (MC-VRPSD). The MC-VRPSD is modeled as a stochastic program with recourse and solved by means of a memetic algorithm. The proposed memetic algorithm couples genetic operators and local search procedures proven to be effective on deterministic routing problems with a novel individual evaluation and reparation strategy that accounts for the stochastic nature of the problem. The algorithm was tested on instances of up to 484 customers, and its results were compared to those obtained by a savings-based heuristic and a memetic algorithm (MA/SCS) for the MC-VRP that uses a spare capacity strategy to handle demand fluctuations. In addition to effectively solve the MC-VRPSD, the proposed MA/SCS also improved 14 best known solutions in a 40-problem testbed for the MC-VRP. 相似文献
974.
Julio Vera Carlos González-Alcón Alberto Marín-Sanguino Néstor Torres 《Computers & Operations Research》2010,37(8):1427-1438
In this work we present a general (mono and multiobjective) optimization framework for the technological improvement of biochemical systems. The starting point of the method is a mathematical model in ordinary differential equations (ODEs) of the investigated system, based on qualitative biological knowledge and quantitative experimental data. In the method we take advantage of the special structural features of a family of ODEs called power-law models to reduce the computational complexity of the optimization program. In this way, the genetic manipulation of a biochemical system to meet a certain biotechnological goal can be expressed as an optimization program with some desired properties such as linearity or convexity.The general method of optimization is presented and discussed in its linear and geometric programming versions. We furthermore illustrate the use of the method by several real case studies. We conclude that the technological improvement of microorganisms can be afforded using the combination of mathematical modelling and optimization. The systematic nature of this approach facilitates the redesign of biochemical systems and makes this a predictive exercise rather than a trial-and-error procedure. 相似文献
975.
Arnaud Fréville Saïd Hanafi Frédéric Semet Nicolas Yanev 《Computers & Operations Research》2010,37(10):1688-1696
This article proposes a tabu search approach to solve a mathematical programming formulation of the linear classification problem, which consists of determining an hyperplane that separates two groups of points as well as possible in ?m. The tabu search approach proposed is based on a non-standard formulation using linear system infeasibility. The search space is the set of bases defined on the matrix that describes the linear system. The moves are performed by pivoting on a specified row and column. On real machine learning databases, our approach compares favorably with implementations based on parametric programming and irreducible infeasible constraint sets. Additional computational results for randomly generated instances confirm that our method provides a suitable alternative to the mixed integer programming formulation that is solved by a commercial code when the number of attributes m increases. 相似文献
976.
977.
Zaid M. Odibat Cyrille Bertelle M.A. Aziz-Alaoui Gérard H.E. Duchamp 《Computers & Mathematics with Applications》2010,59(4):1462-1472
The differential transform method (DTM) is an analytical and numerical method for solving a wide variety of differential equations and usually gets the solution in a series form. In this paper, we propose a reliable new algorithm of DTM, namely multi-step DTM, which will increase the interval of convergence for the series solution. The multi-step DTM is treated as an algorithm in a sequence of intervals for finding accurate approximate solutions for systems of differential equations. This new algorithm is applied to Lotka–Volterra, Chen and Lorenz systems. Then, a comparative study between the new algorithm, multi-step DTM, classical DTM and the classical Runge–Kutta method is presented. The results demonstrate reliability and efficiency of the algorithm developed. 相似文献
978.
979.
Fatos Xhafa Leonard Barolli Santi Caballé Raul Fernández 《The Journal of supercomputing》2010,53(1):45-65
With the fast development of IT technologies, virtual organizations are more and more present in the current collaborative
work and learning activity. For instance, many subjects in virtual distance learning are organized as online groups of students,
who use groupware tools to complete their learning tasks. In this paper, we address the efficient management of peer groups
in JXTA-based P2P systems as a key issue in many P2P applications that use peer group as a unit such as for remote execution
of tasks in parallel and distributed applications. From this perspective, we consider peer grouping as the basis in the development
of groupware tools in P2P systems. 相似文献
980.
Termination is one of the most interesting problems when dealing with context-sensitive rewrite systems. Although a good number of techniques for proving termination of context-sensitive rewriting (CSR) have been proposed so far, the adaptation to CSR of the dependency pair approach, one of the most powerful techniques for proving termination of rewriting, took some time and was possible only after introducing some new notions like collapsing dependency pairs, which are specific for CSR. In this paper, we develop the notion of context-sensitive dependency pair (CSDP) and show how to use CSDPs in proofs of termination of CSR. The implementation and practical use of the developed techniques yield a novel and powerful framework which improves the current state-of-the-art of methods for automatically proving termination of CSR. 相似文献