全文获取类型
收费全文 | 4114篇 |
免费 | 237篇 |
国内免费 | 4篇 |
专业分类
电工技术 | 42篇 |
综合类 | 5篇 |
化学工业 | 1165篇 |
金属工艺 | 66篇 |
机械仪表 | 110篇 |
建筑科学 | 193篇 |
矿业工程 | 8篇 |
能源动力 | 164篇 |
轻工业 | 501篇 |
水利工程 | 24篇 |
石油天然气 | 13篇 |
无线电 | 274篇 |
一般工业技术 | 713篇 |
冶金工业 | 125篇 |
原子能技术 | 45篇 |
自动化技术 | 907篇 |
出版年
2024年 | 8篇 |
2023年 | 38篇 |
2022年 | 181篇 |
2021年 | 215篇 |
2020年 | 99篇 |
2019年 | 114篇 |
2018年 | 151篇 |
2017年 | 136篇 |
2016年 | 194篇 |
2015年 | 110篇 |
2014年 | 167篇 |
2013年 | 307篇 |
2012年 | 274篇 |
2011年 | 328篇 |
2010年 | 218篇 |
2009年 | 242篇 |
2008年 | 228篇 |
2007年 | 181篇 |
2006年 | 190篇 |
2005年 | 151篇 |
2004年 | 113篇 |
2003年 | 98篇 |
2002年 | 76篇 |
2001年 | 62篇 |
2000年 | 57篇 |
1999年 | 57篇 |
1998年 | 42篇 |
1997年 | 32篇 |
1996年 | 34篇 |
1995年 | 40篇 |
1994年 | 21篇 |
1993年 | 23篇 |
1992年 | 12篇 |
1991年 | 17篇 |
1990年 | 11篇 |
1989年 | 14篇 |
1988年 | 11篇 |
1987年 | 7篇 |
1986年 | 8篇 |
1985年 | 9篇 |
1984年 | 10篇 |
1983年 | 6篇 |
1982年 | 16篇 |
1981年 | 11篇 |
1980年 | 5篇 |
1979年 | 8篇 |
1978年 | 7篇 |
1977年 | 4篇 |
1976年 | 3篇 |
1973年 | 3篇 |
排序方式: 共有4355条查询结果,搜索用时 15 毫秒
71.
Roberto A. VázquezAuthor Vitae 《Neurocomputing》2011,74(17):2985-2997
Median associative memories (MED-AMs) are a special type of associative memory that substitutes the maximum and minimum operators of a morphological associative memory with the median operator. This associative model has been applied to restore grey scale images and provided a better performance than morphological associative memories when the patterns are altered with mixed noise. Despite their power, MED-AMs have not been adopted in problems related with true-colour patterns. In this paper, we describe how MED-AMs can be applied to problems involving true-colour patterns. Furthermore, a complete study of the behaviour of this associative model in the restoration of true-colour images is performed using a benchmark of 16,000 images altered by different noise types. 相似文献
72.
Jesús P. Mena-Chalco Ives Macêdo Luiz Velho Roberto M. Cesar Jr. 《The Visual computer》2009,25(10):899-909
In this paper, we present a 3D face photography system based on a facial expression training dataset, composed of both facial range images (3D geometry) and facial texture (2D photography). The proposed system allows one to obtain a 3D geometry representation of a given face provided as a 2D photography, which undergoes a series of transformations through the texture and geometry spaces estimated. In the training phase of the system, the facial landmarks are obtained by an active shape model (ASM) extracted from the 2D gray-level photography. Principal components analysis (PCA) is then used to represent the face dataset, thus defining an orthonormal basis of texture and another of geometry. In the reconstruction phase, an input is given by a face image to which the ASM is matched. The extracted facial landmarks and the face image are fed to the PCA basis transform, and a 3D version of the 2D input image is built. Experimental tests using a new dataset of 70 facial expressions belonging to ten subjects as training set show rapid reconstructed 3D faces which maintain spatial coherence similar to the human perception, thus corroborating the efficiency and the applicability of the proposed system. 相似文献
73.
Hub-and-spoke networks are widely studied in the area of location theory. They arise in several contexts, including passenger airlines, postal and parcel delivery, and computer and telecommunication networks. Hub location problems usually involve three simultaneous decisions to be made: the optimal number of hub nodes, their locations and the allocation of the non-hub nodes to the hubs. In the uncapacitated single allocation hub location problem (USAHLP) hub nodes have no capacity constraints and non-hub nodes must be assigned to only one hub. In this paper, we propose three variants of a simple and efficient multi-start tabu search heuristic as well as a two-stage integrated tabu search heuristic to solve this problem. With multi-start heuristics, several different initial solutions are constructed and then improved by tabu search, while in the two-stage integrated heuristic tabu search is applied to improve both the locational and allocational part of the problem. Computational experiments using typical benchmark problems (Civil Aeronautics Board (CAB) and Australian Post (AP) data sets) as well as new and modified instances show that our approaches consistently return the optimal or best-known results in very short CPU times, thus allowing the possibility of efficiently solving larger instances of the USAHLP than those found in the literature. We also report the integer optimal solutions for all 80 CAB data set instances and the 12 AP instances up to 100 nodes, as well as for the corresponding new generated AP instances with reduced fixed costs. 相似文献
74.
Paulo H. da Rocha Henrique C. Ferreira Michael C. Porsch Roberto M. Sales 《Control Engineering Practice》2009,17(10):1148-1156
Electromagnetic suspension systems are inherently nonlinear and often face hardware limitation when digitally controlled. The main contributions of this paper are: the design of a nonlinear H∞ controller, including dynamic weighting functions, applied to a large gap electromagnetic suspension system and the presentation of a procedure to implement this controller on a fixed-point DSP, through a methodology able to translate a floating-point algorithm into a fixed-point algorithm by using l∞ norm minimization due to conversion error. Experimental results are also presented, in which the performance of the nonlinear controller is evaluated specifically in the initial suspension phase. 相似文献
75.
Ignacio Peñarrocha Daniel Dolz Julio Ariel Romero Roberto Sanchis 《International journal of systems science》2016,47(2):283-299
This work presents a strategy to minimise the network usage and the energy consumption of wireless battery-powered sensors in the observer problem over networks. The sensor nodes implement a periodic send-on-delta approach, sending new measurements when a measure deviates considerably from the previous sent one. The estimator node implements a jump observer whose gains are computed offline and depend on the combination of available new measurements. We bound the estimator performance as a function of the sending policies and then state the design procedure of the observer under fixed sending thresholds as a semidefinite programming problem. We address this problem first in a deterministic way and, to reduce conservativeness, in a stochastic one after obtaining bounds on the probabilities of having new measurements and applying robust optimisation problem over the possible probabilities using sum of squares decomposition. We relate the network usage with the sending thresholds and propose an iterative procedure for the design of those thresholds, minimising the network usage while guaranteeing a prescribed estimation performance. Simulation results and experimental analysis show the validity of the proposal and the reduction of network resources that can be achieved with the stochastic approach. 相似文献
76.
Roberto Saia Ludovico Boratto Salvatore Carta 《Journal of Intelligent Information Systems》2016,47(1):111-134
Recommender systems usually suggest items by exploiting all the previous interactions of the users with a system (e.g., in order to decide the movies to recommend to a user, all the movies she previously purchased are considered). This canonical approach sometimes could lead to wrong results due to several factors, such as a change in user preferences over time, or the use of her account by third parties. This kind of incoherence in the user profiles defines a lower bound on the error the recommender systems may achieve when they generate suggestions for a user, an aspect known in literature as magic barrier. This paper proposes a novel dynamic coherence-based approach to define the user profile used in the recommendation process. The main aim is to identify and remove, from the previously evaluated items, those not semantically adherent to the others, in order to make a user profile as close as possible to the user’s real preferences, solving the aforementioned problems. Moreover, reshaping the user profile in such a way leads to great advantages in terms of computational complexity, since the number of items considered during the recommendation process is highly reduced. The performed experiments show the effectiveness of our approach to remove the incoherent items from a user profile, increasing the recommendation accuracy. 相似文献
77.
Riccardo Bernardini Roberto Rinaldo 《International Journal of Information Security》2017,16(3):249-261
The recent availability of reliable schemes for physically unclonable constants (PUC) opens interesting possibilities in the field of security. In this paper, we explore the possibility of using PUCs to embed in a chip random permutations to be used, for example, as building blocks in cryptographic constructions such as sponge functions, substitution–permutation networks, and so on. We show that the most difficult part is the generation of random integers using as the only randomness source the bit-string produced by the PUC. In order to solve the integer generation problem, we propose a partial rejection method that allows the designer to trade-off between entropy and efficiency. The results show that the proposed schemes can be implemented with reasonable complexity. 相似文献
78.
Roberto Grossi 《Theoretical computer science》2011,412(27):2964-2973
Suffix arrays are a key data structure for solving a run of problems on texts and sequences, from data compression and information retrieval to biological sequence analysis and pattern discovery. In their simplest version, they can just be seen as a permutation of the elements in {1,2,…,n}, encoding the sorted sequence of suffixes from a given text of length n, under the lexicographic order. Yet, they are on a par with ubiquitous and sophisticated suffix trees. Over the years, many interesting combinatorial properties have been devised for this special class of permutations: for instance, they can implicitly encode extra information, and they are a well characterized subset of the n! permutations. This paper gives a short tutorial on suffix arrays and their compressed version to explore and review some of their algorithmic features, discussing the space issues related to their usage in text indexing, combinatorial pattern matching, and data compression. 相似文献
79.
Bioisosteric replacements have been widely and successfully applied to develop bioisosteric series of biologically active compounds in medicinal chemistry. In this work, the concept of bioisosterism is revisited using a novel approach based on charting the "other side" of biologically relevant chemical space. This space is composed by the ensemble of binding sites of protein structures. Explorations into the "other side" of biologically relevant chemical space are exploited to gain insight into the principles that rules molecular recognition and bioisosteric relationships of molecular fragments. We focused, in particular, on the construction of the "other side" of chemical space covered by binding sites of small molecules containing carboxylic, sulfonic, and phosphonic acidic groups. The analysis of differences in the occupation of that space by distinct types of binding sites unveils how evolution has worked in assessing principles that rule the selectivity of molecular recognition, and improves our knowledge on the molecular basis of bioisosteric relationships among carboxylic, sulfonic, and phosphonic acidic groups. 相似文献
80.
This review essentially deals with positive ion/molecule reactions occurring in gas-phase organometallic systems, and encompasses a period of time of approximately 7 years, going from 1997 to early 2004. Following the example of the excellent review by Eller & Schwarz (1991; Chem Rev 91:1121-1177), in the first part, results of reaction of naked ions are presented by grouping them according to the neutral substrate, while in the second part, ligated ions are grouped according to the different ligands. Whenever possible, comparison among similar studies is attempted, and general trends of reactivities are evidenced. 相似文献