全文获取类型
收费全文 | 42140篇 |
免费 | 2653篇 |
国内免费 | 38篇 |
专业分类
电工技术 | 364篇 |
综合类 | 33篇 |
化学工业 | 9164篇 |
金属工艺 | 812篇 |
机械仪表 | 903篇 |
建筑科学 | 1357篇 |
矿业工程 | 95篇 |
能源动力 | 963篇 |
轻工业 | 6632篇 |
水利工程 | 398篇 |
石油天然气 | 175篇 |
武器工业 | 5篇 |
无线电 | 1807篇 |
一般工业技术 | 7002篇 |
冶金工业 | 8616篇 |
原子能技术 | 199篇 |
自动化技术 | 6306篇 |
出版年
2024年 | 92篇 |
2023年 | 415篇 |
2022年 | 678篇 |
2021年 | 1161篇 |
2020年 | 903篇 |
2019年 | 1020篇 |
2018年 | 1630篇 |
2017年 | 1574篇 |
2016年 | 1671篇 |
2015年 | 1338篇 |
2014年 | 1601篇 |
2013年 | 3231篇 |
2012年 | 2453篇 |
2011年 | 2494篇 |
2010年 | 1992篇 |
2009年 | 1810篇 |
2008年 | 1713篇 |
2007年 | 1605篇 |
2006年 | 1201篇 |
2005年 | 986篇 |
2004年 | 895篇 |
2003年 | 810篇 |
2002年 | 780篇 |
2001年 | 580篇 |
2000年 | 528篇 |
1999年 | 571篇 |
1998年 | 2537篇 |
1997年 | 1752篇 |
1996年 | 1128篇 |
1995年 | 699篇 |
1994年 | 523篇 |
1993年 | 622篇 |
1992年 | 233篇 |
1991年 | 237篇 |
1990年 | 181篇 |
1989年 | 199篇 |
1988年 | 192篇 |
1987年 | 167篇 |
1986年 | 140篇 |
1985年 | 176篇 |
1984年 | 141篇 |
1983年 | 120篇 |
1982年 | 154篇 |
1981年 | 157篇 |
1980年 | 170篇 |
1979年 | 97篇 |
1978年 | 106篇 |
1977年 | 286篇 |
1976年 | 650篇 |
1973年 | 73篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
Luis V. Santana-Quintero Alfredo G. Hernández-Díaz Julián Molina Carlos A. Coello Coello Rafael Caballero 《Computers & Operations Research》2010,37(3):470-480
The aim of this paper is to show how the hybridization of a multi-objective evolutionary algorithm (MOEA) and a local search method based on the use of rough set theory is a viable alternative to obtain a robust algorithm able to solve difficult constrained multi-objective optimization problems at a moderate computational cost. This paper extends a previously published MOEA [Hernández-Díaz AG, Santana-Quintero LV, Coello Coello C, Caballero R, Molina J. A new proposal for multi-objective optimization using differential evolution and rough set theory. In: 2006 genetic and evolutionary computation conference (GECCO’2006). Seattle, Washington, USA: ACM Press; July 2006], which was limited to unconstrained multi-objective optimization problems. Here, the main idea is to use this sort of hybrid approach to approximate the Pareto front of a constrained multi-objective optimization problem while performing a relatively low number of fitness function evaluations. Since in real-world problems the cost of evaluating the objective functions is the most significant, our underlying assumption is that, by aiming to minimize the number of such evaluations, our MOEA can be considered efficient. As in its previous version, our hybrid approach operates in two stages: in the first one, a multi-objective version of differential evolution is used to generate an initial approximation of the Pareto front. Then, in the second stage, rough set theory is used to improve the spread and quality of this initial approximation. To assess the performance of our proposed approach, we adopt, on the one hand, a set of standard bi-objective constrained test problems and, on the other hand, a large real-world problem with eight objective functions and 160 decision variables. The first set of problems are solved performing 10,000 fitness function evaluations, which is a competitive value compared to the number of evaluations previously reported in the specialized literature for such problems. The real-world problem is solved performing 250,000 fitness function evaluations, mainly because of its high dimensionality. Our results are compared with respect to those generated by NSGA-II, which is a MOEA representative of the state-of-the-art in the area. 相似文献
992.
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. 相似文献
993.
Rupert Wegerif Bruce M. McLaren Marian Chamrada Oliver Scheuer Nasser Mansour Jan Mikšátko Mriga Williams 《Computers & Education》2010
This paper reports on an aspect of the EC funded Argunaut project which researched and developed awareness tools for moderators of online dialogues. In this study we report on an investigation into the nature of creative thinking in online dialogues and whether or not this creative thinking can be coded for and recognized automatically such that moderators can be alerted when creative thinking is occurring or when it has not occurred after a period of time. We outline a dialogic theory of creativity, as the emergence of new perspectives from the interplay of voices, and the testing of this theory using a range of methods including a coding scheme which combined coding for creative thinking with more established codes for critical thinking, artificial intelligence pattern-matching techniques to see if our codes could be read automatically from maps and ‘key event recall’ interviews to explore the experience of participants. Our findings are that: (1) the emergence of new perspectives in a graphical dialogue map can be recognized by our coding scheme supported by a machine pattern-matching algorithm in a way that can be used to provide awareness indicators for moderators; (2) that the trigger events leading to the emergence of new perspectives in the online dialogues studied were most commonly disagreements and (3) the spatial representation of messages in a graphically mediated synchronous dialogue environment such as Digalo may offer more affordance for creativity than the much more common scrolling text chat environments. All these findings support the usefulness of our new account of creativity in online dialogues based on dialogic theory and demonstrate that this account can be operationalised through machine coding in a way that can be turned into alerts for moderators. 相似文献
994.
Maciej Paszyński David Pardo Carlos Torres-Verdín Leszek Demkowicz Victor Calo 《Journal of Parallel and Distributed Computing》2010
In this paper we present a new parallel multi-frontal direct solver, dedicated for the hp Finite Element Method (hp-FEM). The self-adaptive hp-FEM generates in a fully automatic mode, a sequence of hp-meshes delivering exponential convergence of the error with respect to the number of degrees of freedom (d.o.f.) as well as the CPU time, by performing a sequence of hp refinements starting from an arbitrary initial mesh. The solver constructs an initial elimination tree for an arbitrary initial mesh, and expands the elimination tree each time the mesh is refined. This allows us to keep track of the order of elimination for the solver. The solver also minimizes the memory usage, by de-allocating partial LU factorizations computed during the elimination stage of the solver, and recomputes them for the backward substitution stage, by utilizing only about 10% of the computational time necessary for the original computations. The solver has been tested on 3D Direct Current (DC) borehole resistivity measurement simulations problems. We measure the execution time and memory usage of the solver over a large regular mesh with 1.5 million degrees of freedom as well as on the highly non-regular mesh, generated by the self-adaptive hp-FEM, with finite elements of various sizes and polynomial orders of approximation varying from p=1 to p=9. From the presented experiments it follows that the parallel solver scales well up to the maximum number of utilized processors. The limit for the solver scalability is the maximum sequential part of the algorithm: the computations of the partial LU factorizations over the longest path, coming from the root of the elimination tree down to the deepest leaf. 相似文献
995.
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. 相似文献
996.
Urban environments possess many regularities which can be efficiently exploited for 3D dense reconstruction from multiple
widely separated views. We present an approach utilizing properties of piecewise planarity and restricted number of plane
orientations to suppress reconstruction and matching ambiguities causing failures of standard dense stereo methods. We formulate
the problem of the 3D reconstruction in MRF framework built on an image pre-segmented into superpixels. Using this representation,
we propose novel photometric and superpixel boundary consistency terms explicitly derived from superpixels and show that they
overcome many difficulties of standard pixel-based formulations and handle favorably problematic scenarios containing many
repetitive structures and no or low textured regions. We demonstrate our approach on several wide-baseline scenes demonstrating
superior performance compared to previously proposed methods. 相似文献
997.
998.
New techniques for simulating high performance MPI applications on large storage networks 总被引:1,自引:0,他引:1
Alberto Núñez Javier Fernández Jose D. Garcia Félix Garcia Jesús Carretero 《The Journal of supercomputing》2010,51(1):40-57
In this work, we propose new techniques to analyze the behavior, the performance, and specially the scalability of High Performance
Computing (in short, HPC) applications on different computing architectures. Our final objective is to test applications using
a wide range of architectures (real or merely designed) and scaling it to any number of nodes or components. This paper presents
a new simulation framework, called SIMCAN, for HPC architectures. The main characteristic of the proposed simulation framework
is the ability to be configured for simulating a wide range of possible architectures that involve any number of components.
SIMCAN is developed to simulate complete HPC architectures, but putting special emphasis on the storage and network subsystems.
The SIMCAN framework can handle complete components (nodes, racks, switches, routers, etc.), but also key elements of the
storage and network subsystems (disks, caches, sockets, file systems, schedulers, etc.). We also propose several methods to
implement the behavior of HPC applications. Each method has its own advantages and drawbacks. In order to evaluate the possibilities
and the accuracy of the SIMCAN framework, we have tested it by executing a HPC application called BIPS3D on a hardware-based
computing cluster and on a modeled environment that represent the real cluster. We also checked the scalability of the application
using this kind of architecture by simulating the same application with an increased number of computing nodes. 相似文献
999.
An adaptive, real-time, traffic monitoring system 总被引:1,自引:0,他引:1
In this paper we describe a computer vision-based traffic monitoring system able to detect individual vehicles in real-time.
Our fully integrated system first obtains the main traffic variables: counting, speed and category; and then computes a complete
set of statistical variables. The objective is to investigate some of the difficulties impeding existing traffic systems to
achieve balanced accuracy in every condition; i.e. day and night transitions, shadows, heavy vehicles, occlusions, slow traffic
and congestions. The system we present is autonomous, works for long periods of time without human intervention and adapts
automatically to the changing environmental conditions. Several innovations, designed to deal with the above circumstances,
are proposed in the paper: an integrated calibration and image rectification step, differentiated methods for day and night,
an adaptive segmentation algorithm, a multistage shadow detection method and special considerations for heavy vehicle identification
and treatment of slow traffic. A specific methodology has been developed to benchmark the accuracy of the different methods
proposed. 相似文献
1000.
Pablo Quintía Roberto Iglesias Miguel A. Rodríguez Carlos V. Regueiro 《Robotics and Autonomous Systems》2010,58(12):1306-1315
One of the main problems of robots is the lack of adaptability and the need for adjustment every time the robot changes its working place. To solve this, we propose a learning approach for mobile robots using a reinforcement-based strategy and a dynamic sensor-state mapping. This strategy, practically parameterless, minimises the adjustments needed when the robot operates in a different environment or performs a different task.Our system will simultaneously learn the state space and the action to execute on each state. The learning algorithm will attempt to maximise the time before a robot failure in order to obtain a control policy suited to the desired behaviour, thus providing a more interpretable learning process. The state representation will be created dynamically, starting with an empty state space and adding new states as the robot finds new situations that has not seen before. A dynamic creation of the state representation will avoid the classic, error-prone and cyclic process of designing and testing an ad hoc representation. We performed an exhaustive study of our approach, comparing it with other classic strategies. Unexpectedly, learning both perception and action does not increase the learning time. 相似文献