全文获取类型
收费全文 | 6795篇 |
免费 | 461篇 |
国内免费 | 3篇 |
专业分类
电工技术 | 46篇 |
综合类 | 4篇 |
化学工业 | 1304篇 |
金属工艺 | 71篇 |
机械仪表 | 99篇 |
建筑科学 | 206篇 |
矿业工程 | 8篇 |
能源动力 | 169篇 |
轻工业 | 1426篇 |
水利工程 | 84篇 |
石油天然气 | 28篇 |
无线电 | 357篇 |
一般工业技术 | 1034篇 |
冶金工业 | 1270篇 |
原子能技术 | 20篇 |
自动化技术 | 1133篇 |
出版年
2024年 | 18篇 |
2023年 | 77篇 |
2022年 | 147篇 |
2021年 | 190篇 |
2020年 | 156篇 |
2019年 | 203篇 |
2018年 | 300篇 |
2017年 | 260篇 |
2016年 | 269篇 |
2015年 | 221篇 |
2014年 | 307篇 |
2013年 | 540篇 |
2012年 | 460篇 |
2011年 | 474篇 |
2010年 | 348篇 |
2009年 | 292篇 |
2008年 | 312篇 |
2007年 | 290篇 |
2006年 | 221篇 |
2005年 | 158篇 |
2004年 | 146篇 |
2003年 | 127篇 |
2002年 | 109篇 |
2001年 | 87篇 |
2000年 | 58篇 |
1999年 | 79篇 |
1998年 | 515篇 |
1997年 | 282篇 |
1996年 | 179篇 |
1995年 | 98篇 |
1994年 | 79篇 |
1993年 | 73篇 |
1992年 | 20篇 |
1991年 | 14篇 |
1990年 | 9篇 |
1989年 | 13篇 |
1988年 | 13篇 |
1987年 | 18篇 |
1986年 | 10篇 |
1985年 | 13篇 |
1984年 | 8篇 |
1983年 | 6篇 |
1981年 | 11篇 |
1980年 | 8篇 |
1979年 | 2篇 |
1978年 | 5篇 |
1977年 | 7篇 |
1976年 | 17篇 |
1975年 | 2篇 |
1973年 | 2篇 |
排序方式: 共有7259条查询结果,搜索用时 15 毫秒
101.
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. 相似文献
102.
Carlos?Alberto?Martínez-Angeles Haicheng?Wu Inês?DutraEmail author Vítor?Santos?Costa Jorge?Buenabad-Chávez 《International journal of parallel programming》2016,44(3):663-685
Relational learning algorithms mine complex databases for interesting patterns. Usually, the search space of patterns grows very quickly with the increase in data size, making it impractical to solve important problems. In this work we present the design of a relational learning system, that takes advantage of graphics processing units (GPUs) to perform the most time consuming function of the learner, rule coverage. To evaluate performance, we use four applications: a widely used relational learning benchmark for predicting carcinogenesis in rodents, an application in chemo-informatics, an application in opinion mining, and an application in mining health record data. We compare results using a single and multiple CPUs in a multicore host and using the GPU version. Results show that the GPU version of the learner is up to eight times faster than the best CPU version. 相似文献
103.
The intrinsic laminarity of microfluidic devices impedes the mixing of multiple fluids over short temporal or spatial scales. Despite the existence of several mixers capable of stirring and stretching the flows to promote mixing, most approaches sacrifice temporal or spatial control, portability, or flexibility in terms of operating flow rates. Here, we report a novel method for rapid micromixing based on the generation of cavitation bubbles. By using a portable battery-powered electric circuit, we induce a localized electric spark between two tip electrodes perpendicular to the flow channel that results in several cavitation events. As a result, a vigorous stirring mechanism is induced. We investigate the spatiotemporal dynamics of the spark-generated cavitation bubbles and quantify the created flow disturbance. We demonstrate rapid (in the millisecond timescale) and efficient micromixing (up to 98%) within a length scale of only 200 µm and over a flow rate ranging from 5 to 40 µL/min. 相似文献
104.
Eric Pedrol Javier Martínez Magdalena Aguiló Manuel Garcia-Algar Moritz Nazarenus Luca Guerrini Eduardo Garcia-Rico Francesc Díaz Jaume Massons 《Microfluidics and nanofluidics》2017,21(12):181
This paper presents an optofluidic device for cell discrimination with two independent interrogation regions. Pumping light is coupled to the device, and cell fluorescence is extracted from the two interrogation zones by using optical fibers embedded in the optofluidic chip. To test the reliability of this device, AU-565 cells—expressing EpCAM and HER2 receptors—and RAMOS cells were mixed in a controlled manner, confined inside a hydrodynamic focused flow in the microfluidic chip and detected individually so that they could be discriminated as positive (signal reception from fluorescently labeled antibodies from the AU-565 cells) or negative events (RAMOS cells). A correlation analysis of the two signals reduces the influence of noise on the overall data. 相似文献
105.
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. 相似文献
106.
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. 相似文献
107.
Juan M. Marín Pérez Jorge Bernal Bernabé Jose M. Alcaraz Calero Felix J. Garcia Clemente Gregorio Martínez Pérez Antonio F. Gómez Skarmeta 《Future Generation Computer Systems》2011,27(1):40-55
There are a few issues that still need to be covered regarding security in the Grid area. One of them is authorization where there exist good solutions to define, manage and enforce authorization policies in Grid scenarios. However, these solutions usually do not provide Grid administrators with semantic-aware components closer to the particular Grid domain and easing different administration tasks such as conflict detection or resolution. This paper defines a proposal based on Semantic Web to define, manage and enforce security policies in a Grid scenario. These policies are defined by means of semantic-aware rules which help the administrator to create higher-level definitions with more expressiveness. These rules also permit performing added-value tasks such as conflict detection and resolution, which can be of interest in medium and large scale scenarios where different administrators define the authorization rules that should be followed before accessing a resource in the Grid. The proposed solution has been also tested providing some reasonable response times in the authorization decision process. 相似文献
108.
Francisco Jes��s Mart��n-Mateos Jos�� Luis Ruiz-Reina Jos�� Antonio Alonso Mar��a Jos�� Hidalgo 《Journal of Automated Reasoning》2011,47(3):229-250
Higman??s lemma is an important result in infinitary combinatorics, which has been formalized in several theorem provers. In this paper we present a formalization and proof of Higman??s Lemma in the ACL2 theorem prover. Our formalization is based on a proof by Murthy and Russell, where the key termination argument is justified by the multiset relation induced by a well-founded relation. To our knowledge, this is the first mechanization of this proof. 相似文献
109.
Francisco García‐Sánchez Luís Álvarez Sabucedo Rodrigo Martínez‐Béjar Luís Anido Rifón Rafael Valencia‐García Juan Miguel Gómez 《Expert Systems》2011,28(5):416-436
The increasing volume of eGovernment‐related services is demanding new approaches for service integration and interoperability in this domain. Semantic web (SW) technologies and applications can leverage the potential of eGovernment service integration and discovery, thus tackling the problems of semantic heterogeneity characterizing eGovernment information sources and the different levels of interoperability. eGovernment services will therefore be semantically described in the foreseeable future. In an environment with semantically annotated services, software agents are essential as the entities responsible for exploiting the semantic content in order to automate some tasks, and so enhance the user's experience. In this paper, we present a framework that provides a seamless integration of semantic web services and intelligent agents technologies by making use of ontologies to facilitate their interoperation. The proposed framework can assist in the development of powerful and flexible distributed systems in complex, dynamic, heterogeneous, unpredictable and open environments. Our approach is backed up by a proof‐of‐concept implementation, where the breakthrough of integrating disparate eGovernment services has been tested. 相似文献
110.
Juan Francisco Gómez-Lopera José Martínez-Aroza Aureliano M. Robles-Pérez Ramón Román-Roldán 《Journal of Mathematical Imaging and Vision》2000,13(1):35-56
This work constitutes a theoretical study of the edge-detection method by means of the Jensen-Shannon divergence, as proposed by the authors. The overall aim is to establish formally the suitability of the procedure of edge detection in digital images, as a step prior to segmentation. In specific, an analysis is made not only of the properties of the divergence used, but also of the method's sensitivity to the spatial variation, as well as the detection-error risk associated with the operating conditions due to the randomness of the spatial configuration of the pixels. Although the paper deals with the procedure based on the Jensen-Shannon divergence, some problems are also related to other methods based on local detection with a sliding window, and part of the study is focused to noisy and textured images. 相似文献