全文获取类型
收费全文 | 1994篇 |
免费 | 150篇 |
国内免费 | 1篇 |
专业分类
电工技术 | 14篇 |
综合类 | 1篇 |
化学工业 | 466篇 |
金属工艺 | 21篇 |
机械仪表 | 32篇 |
建筑科学 | 69篇 |
矿业工程 | 2篇 |
能源动力 | 87篇 |
轻工业 | 345篇 |
水利工程 | 15篇 |
石油天然气 | 8篇 |
无线电 | 170篇 |
一般工业技术 | 368篇 |
冶金工业 | 61篇 |
原子能技术 | 10篇 |
自动化技术 | 476篇 |
出版年
2024年 | 6篇 |
2023年 | 31篇 |
2022年 | 111篇 |
2021年 | 99篇 |
2020年 | 56篇 |
2019年 | 92篇 |
2018年 | 111篇 |
2017年 | 85篇 |
2016年 | 94篇 |
2015年 | 72篇 |
2014年 | 116篇 |
2013年 | 159篇 |
2012年 | 149篇 |
2011年 | 184篇 |
2010年 | 116篇 |
2009年 | 98篇 |
2008年 | 97篇 |
2007年 | 83篇 |
2006年 | 79篇 |
2005年 | 55篇 |
2004年 | 54篇 |
2003年 | 39篇 |
2002年 | 32篇 |
2001年 | 13篇 |
2000年 | 13篇 |
1999年 | 16篇 |
1998年 | 19篇 |
1997年 | 16篇 |
1996年 | 4篇 |
1995年 | 10篇 |
1994年 | 10篇 |
1993年 | 4篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1975年 | 1篇 |
1974年 | 1篇 |
1971年 | 1篇 |
1970年 | 1篇 |
排序方式: 共有2145条查询结果,搜索用时 15 毫秒
21.
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. 相似文献
22.
Jonathan Pietarila Graham Darryl D. Holm Pablo Mininni Annick Pouquet 《Journal of scientific computing》2011,49(1):21-34
The subfilter-scale (SFS) physics of regularization models are investigated to understand the regularizations’ performance
as SFS models. Suppression of spectrally local SFS interactions and conservation of small-scale circulation in the Lagrangian-averaged
Navier-Stokes α-model (LANS-α) is found to lead to the formation of rigid bodies. These contaminate the superfilter-scale energy spectrum with a scaling
that approaches k
+1 as the SFS spectra is resolved. The Clark-α and Leray-α models, truncations of LANS-α, do not conserve small-scale circulation and do not develop rigid bodies. LANS-α, however, is closest to Navier-Stokes in intermittency properties. All three models are found to be stable at high Reynolds
number. Differences between L
2 and H
1 norm models are clarified. For magnetohydrodynamics (MHD), the presence of the Lorentz force as a source (or sink) for circulation
and as a facilitator of both spectrally nonlocal large to small scale interactions as well as local SFS interactions prevents
the formation of rigid bodies in Lagrangian-averaged MHD (LAMHD-α). LAMHD-α performs well as a predictor of superfilter-scale energy spectra and of intermittent current sheets at high Reynolds numbers.
It may prove generally applicable as a MHD-LES. 相似文献
23.
Pablo Irarrazaval Carlos Lizama Vicente Parot Carlos Sing-Long Cristian Tejos 《Computers & Mathematics with Applications》2011,62(3):1576-1590
The fractional Fourier transform (FrFT) is revisited in the framework of strongly continuous periodic semigroups to restate known results and to explore new properties of the FrFT. We then show how the FrFT can be used to reconstruct Magnetic Resonance (MR) images acquired under the presence of quadratic field inhomogeneity. Particularly, we prove that the order of the FrFT is a measure of the distortion in the reconstructed signal. Moreover, we give a dynamic interpretation to the order as time evolution of a function. We also introduce the notion of ρ-α space as an extension of the Fourier or k-space in MR, and we use it to study the distortions introduced in two common MR acquisition strategies. We formulate the reconstruction problem in the context of the FrFT and show how the semigroup theory allows us to find new reconstruction formulas for discrete sampled signals. Finally, the results are supplemented with numerical examples that show how it performs in a standard 1D MR signal reconstruction. 相似文献
24.
BAIS: A Bayesian Artificial Immune System for the effective handling of building blocks 总被引:1,自引:0,他引:1
Significant progress has been made in theory and design of Artificial Immune Systems (AISs) for solving hard problems accurately. However, an aspect not yet widely addressed by the research reported in the literature is the lack of ability of the AISs to deal effectively with building blocks (partial high-quality solutions coded in the antibody). The available AISs present mechanisms for evolving the population that do not take into account the relationship among the variables of the problem, potentially causing the disruption of high-quality partial solutions. This paper proposes a novel AIS with abilities to identify and properly manipulate building blocks in optimization problems. Instead of using cloning and mutation to generate new individuals, our algorithm builds a probabilistic model representing the joint probability distribution of the promising solutions and, subsequently, uses this model for sampling new solutions. The probabilistic model used is a Bayesian network due to its capability of properly capturing the most relevant interactions among the variables. Therefore, our algorithm, called Bayesian Artificial Immune System (BAIS), represents a significant attempt to improve the performance of immune-inspired algorithms when dealing with building blocks, and hence to solve efficiently hard optimization problems with complex interactions among the variables. The performance of BAIS compares favorably with that produced by contenders such as state-of-the-art Estimation of Distribution Algorithms. 相似文献
25.
Javier Plaza Author Vitae Antonio Plaza Author VitaeAuthor Vitae Pablo Martinez Author Vitae 《Pattern recognition》2009,42(11):3032-3809
In this work, neural network-based models involved in hyperspectral image spectra separation are considered. Focus is on how to select the most highly informative samples for effectively training the neural architecture. This issue is addressed here by several new algorithms for intelligent selection of training samples: (1) a border-training algorithm (BTA) which selects training samples located in the vicinity of the hyperplanes that can optimally separate the classes; (2) a mixed-signature algorithm (MSA) which selects the most spectrally mixed pixels in the hyperspectral data as training samples; and (3) a morphological-erosion algorithm (MEA) which incorporates spatial information (via mathematical morphology concepts) to select spectrally mixed training samples located in spatially homogeneous regions. These algorithms, along with other standard techniques based on orthogonal projections and a simple Maximin-distance algorithm, are used to train a multi-layer perceptron (MLP), selected in this work as a representative neural architecture for spectral mixture analysis. Experimental results are provided using both a database of nonlinear mixed spectra with absolute ground truth and a set of real hyperspectral images, collected at different altitudes by the digital airborne imaging spectrometer (DAIS 7915) and reflective optics system imaging spectrometer (ROSIS) operating simultaneously at multiple spatial resolutions. 相似文献
26.
Integrating different information sources is a growing research area within different application domains. This is particularly true for the geographic information domain which is facing new challenges because newer and better technologies are capturing large amounts of information about the Earth. This trend can be combined with increases in the distribution of GIS (Geographic Information Systems) on the Web, which is leading to the proliferation of different geospatial information repositories and the subsequent need to integrate information across repositories to get consistent information. To overcome this situation, many proposals use ontologies in the integration process. In this paper we analyze and compare the most widely referred proposals of geographic information integration, focusing on those using ontologies as semantic tools to represent the sources, and to facilitate the integration process. 相似文献
27.
Jorge Navarro-Ortiz Pablo Ameigeiras Juan J. Ramos-Munoz Juan M. Lopez-Soler 《Computer Communications》2009,32(11):1281-1297
In this paper we present a solution for the IEEE 802.11e HCCA (Hybrid coordination function Controlled Channel Access) mechanism which aims both at supporting strict real-time traffic requirements and, simultaneously, at handling TCP applications efficiently. Our proposal combines a packet scheduler and a dynamic resource allocation algorithm. The scheduling discipline is based on the Monolithic Shaper-Scheduler, which is a modification of a General Processor Sharing (GPS) related scheduler. It supports minimum-bandwidth and delay guarantees and, at the same time, it achieves the optimal latency of all the GPS-related schedulers. In addition, our innovative resource allocation procedure, called the territory method, aims at prioritizing real time services and at improving the performance of TCP applications. For this purpose, it splits the wireless channel capacity (in terms of transmission opportunities) into different territories for the different types of traffic, taking into account the end-to-end network dynamics. In order to give support to the desired applications, we consider the following traffic classes: conversational, streaming, interactive and best-effort. The so called territories shrink or expand depending on the current quality experienced by the corresponding traffic class. We evaluated the performance of our solution through extensive simulations in a heterogeneous wired-cum-wireless scenario under different traffic conditions. Additionally, we compare our proposal to other HCCA scheduling algorithms, the HCCA reference scheduler and Fair Hybrid Coordination Function (FHCF). The results show that the combination of the MSS and the territory method obtains higher system capacity for VoIP traffic (up to 32 users) in the simulated scenario, compared to FHCF and the HCCA reference scheduler (13 users). In addition, the MSS with the territory method also improves the throughput of TCP sources (one FTP application achieves between 6.1 Mbps without VoIP traffic and 2.1 Mbps with 20 VoIP users) compared to the reference scheduler (at most 388 kbps) and FHCF (with a maximum FTP throughput of 4.8 Mbps). 相似文献
28.
The quality of shadow mapping is traditionally limited by texture resolution. We present a novel lossless compression scheme for high‐resolution shadow maps based on precomputed multiresolution hierarchies. Traditional multiresolution trees can compactly represent homogeneous regions of shadow maps at coarser levels, but require many nodes for fine details. By conservatively adapting the depth map, we can significantly reduce the tree complexity. Our proposed method offers high compression rates, avoids quantization errors, exploits coherency along all data dimensions, and is well‐suited for GPU architectures. Our approach can be applied for coherent shadow maps as well, enabling several applications, including high‐quality soft shadows and dynamic lights moving on fixed‐trajectories. 相似文献
29.
Amador Durán David Benavides Sergio Segura Pablo Trinidad Antonio Ruiz-Cortés 《Software and Systems Modeling》2017,16(4):1049-1082
In a literature review on the last 20 years of automated analysis of feature models, the formalization of analysis operations was identified as the most relevant challenge in the field. This formalization could provide very valuable assets for tool developers such as a precise definition of the analysis operations and, what is more, a reference implementation, i.e., a trustworthy, not necessarily efficient implementation to compare different tools outputs. In this article, we present the FLAME framework as the result of facing this challenge. FLAME is a formal framework that can be used to formally specify not only feature models, but other variability modeling languages (VML s) as well. This reusability is achieved by its two-layered architecture. The abstract foundation layer is the bottom layer in which all VML-independent analysis operations and concepts are specified. On top of the foundation layer, a family of characteristic model layers—one for each VML to be formally specified—can be developed by redefining some abstract types and relations. The verification and validation of FLAME has followed a process in which formal verification has been performed traditionally by manual theorem proving, but validation has been performed by integrating our experience on metamorphic testing of variability analysis tools, something that has shown to be much more effective than manually designed test cases. To follow this automated, test-based validation approach, the specification of FLAME, written in Z, was translated into Prolog and 20,000 random tests were automatically generated and executed. Tests results helped to discover some inconsistencies not only in the formal specification, but also in the previous informal definitions of the analysis operations and in current analysis tools. After this process, the Prolog implementation of FLAME is being used as a reference implementation for some tool developers, some analysis operations have been formally specified for the first time with more generic semantics, and more VML s are being formally specified using FLAME. 相似文献
30.
Interactive computation of global illumination is a major challenge in current computer graphics research. Global illumination heavily affects the visual quality of generated images. It is therefore a key attribute for the perception of photo‐realistic images. Path tracing is able to simulate the physical behaviour of light using Monte Carlo techniques. However, the computational burden of this technique prohibits interactive rendering times on standard commodity hardware in high‐quality. Trying to solve the Monte Carlo integration with fewer samples results in characteristic noisy images. Global illumination filtering methods take advantage of the fact that the integral for neighbouring pixels may be very similar. Averaging samples of similar characteristics in screen‐space may approximate the correct integral, but may result in visible outliers. In this paper, we present a novel path tracing pipeline based on an edge‐aware filtering method for the indirect illumination which produces visually more pleasing results without noticeable outliers. The key idea is not to filter the noisy path traced images but to use it as a guidance to filter a second image composed from characteristic scene attributes that do not contain noise by default. We show that our approach better approximates the Monte Carlo integral compared to previous methods. Since the computation is carried out completely in screen‐space it is therefore applicable to fully dynamic scenes, arbitrary lighting and allows for high‐quality path tracing at interactive frame rates on commodity hardware. 相似文献