全文获取类型
收费全文 | 66042篇 |
免费 | 2465篇 |
国内免费 | 238篇 |
专业分类
电工技术 | 866篇 |
综合类 | 655篇 |
化学工业 | 10002篇 |
金属工艺 | 1497篇 |
机械仪表 | 2219篇 |
建筑科学 | 1260篇 |
矿业工程 | 396篇 |
能源动力 | 1341篇 |
轻工业 | 3998篇 |
水利工程 | 703篇 |
石油天然气 | 64篇 |
武器工业 | 6篇 |
无线电 | 5802篇 |
一般工业技术 | 8379篇 |
冶金工业 | 22978篇 |
原子能技术 | 515篇 |
自动化技术 | 8064篇 |
出版年
2024年 | 80篇 |
2023年 | 499篇 |
2022年 | 559篇 |
2021年 | 857篇 |
2020年 | 538篇 |
2019年 | 618篇 |
2018年 | 1221篇 |
2017年 | 1404篇 |
2016年 | 1884篇 |
2015年 | 1442篇 |
2014年 | 1447篇 |
2013年 | 1936篇 |
2012年 | 3686篇 |
2011年 | 4359篇 |
2010年 | 2059篇 |
2009年 | 2200篇 |
2008年 | 1914篇 |
2007年 | 1640篇 |
2006年 | 1456篇 |
2005年 | 4076篇 |
2004年 | 3182篇 |
2003年 | 2633篇 |
2002年 | 1467篇 |
2001年 | 1292篇 |
2000年 | 743篇 |
1999年 | 1068篇 |
1998年 | 6885篇 |
1997年 | 4240篇 |
1996年 | 2911篇 |
1995年 | 1723篇 |
1994年 | 1242篇 |
1993年 | 1260篇 |
1992年 | 363篇 |
1991年 | 412篇 |
1990年 | 383篇 |
1989年 | 370篇 |
1988年 | 368篇 |
1987年 | 283篇 |
1986年 | 251篇 |
1985年 | 212篇 |
1984年 | 105篇 |
1983年 | 110篇 |
1982年 | 159篇 |
1981年 | 202篇 |
1980年 | 220篇 |
1979年 | 72篇 |
1978年 | 101篇 |
1977年 | 632篇 |
1976年 | 1353篇 |
1975年 | 115篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
991.
Face recognition with lattice independent component analysis and extreme learning machines 总被引:1,自引:0,他引:1
Ion Marques Manuel Gra?a 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2012,16(9):1525-1537
We focus on two aspects of the face recognition, feature extraction and classification. We propose a two component system, introducing Lattice Independent Component Analysis (LICA) for feature extraction and Extreme Learning Machines (ELM) for classification. In previous works we have proposed LICA for a variety of image processing tasks. The first step of LICA is to identify strong lattice independent components from the data. In the second step, the set of strong lattice independent vector are used for linear unmixing of the data, obtaining a vector of abundance coefficients. The resulting abundance values are used as features for classification, specifically for face recognition. Extreme Learning Machines are accurate and fast-learning innovative classification methods based on the random generation of the input-to-hidden-units weights followed by the resolution of the linear equations to obtain the hidden-to-output weights. The LICA-ELM system has been tested against state-of-the-art feature extraction methods and classifiers, outperforming them when performing cross-validation on four large unbalanced face databases. 相似文献
992.
Jianwei Zhao Dong Sun Park Joonwhoan Lee Feilong Cao 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2012,16(9):1503-1514
Functional data learning is an extension of traditional data learning, that is, learning the data chosen from the Euclidean space ${\mathbb{R}^{n}}$ to a metric space. This paper focuses on the functional data learning with generalized single-hidden layer feedforward neural networks (GSLFNs) acting on some metric spaces. In addition, three learning algorithms, named Hilbert parallel overrelaxation backpropagation (H-PORBP) algorithm, ν-generalized support vector regression (ν-GSVR) and generalized extreme learning machine (G-ELM) are proposed to train the GSLFNs acting on some metric spaces. The experimental results on some metric spaces indicate that GELM with additive/RBF hidden-nodes has a faster learning speed, a better accuracy, and a better stability than HPORBP algorithm and ν-GSVR for training the functional data. The idea of GELM can be used to extend those improved extreme learning machines (ELMs) that act on the Euclidean space ${\mathbb{R}^{n}, }$ such as online sequential ELM, incremental ELM, pruning ELM and so on, to some metric spaces. 相似文献
993.
Tomá? Kroupa 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2012,16(11):1851-1861
We generalise belief functions to many-valued events which are represented by elements of Lindenbaum algebra of infinite-valued ?ukasiewicz propositional logic. Our approach is based on mass assignments used in the Dempster–Shafer theory of evidence. A generalised belief function is totally monotone and it has Choquet integral representation with respect to a unique belief measure on Boolean events. 相似文献
994.
A population protocol is one of distributed computing models for passively-mobile systems, where a number of agents change
their states by pairwise interactions between two agents. In this paper, we investigate the solvability of the self-stabilizing
leader election in population protocols without any kind of oracles. We identify the necessary and sufficient conditions to
solve the self-stabilizing leader election in population protocols from the aspects of local memory complexity and fairness
assumptions. This paper shows that under the assumption of global fairness, no protocol using only n−1 states can solve the self-stabilizing leader election in complete interaction graphs, where n is the number of agents in the system. To prove this impossibility, we introduce a novel proof technique, called closed-set
argument. In addition, we propose a self-stabilizing leader election protocol using n states that works even under the unfairness assumption. This protocol requires the exact knowledge about the number of agents
in the system. We also show that such knowledge is necessary to construct any self-stabilizing leader election protocol. 相似文献
995.
J?rg Brunsmann Wolfgang Wilkes Gunter Schlageter Matthias Hemmje 《International Journal on Digital Libraries》2012,12(1):27-39
Providing access to digital information for the indefinite future is the intention of long-term digital preservation systems. One application domain that certainly needs to implement such long-term digital preservation processes is the design and engineering industry. In this industry, products are designed, manufactured, and operated with the help of sophisticated software tools provided by product lifecycle management (PLM) systems. During all PLM phases, including geographically distributed cross-domain and cross-company collaboration, a huge amount of heterogeneous digital product data and metadata is created. Legal and economic requirements demand that this product data has to be archived and preserved for a long-time period. Unfortunately, the software that is able to interpret the data will become obsolete earlier than the data since the software and hardware lifecycle is relatively short-lived compared to a product lifecycle. Companies in the engineering industry begin to realize that their data is in danger of becoming unusable while the products are in operation for several decades. To address this issue, different academic and industrial initiatives have been initiated that try to solve this problem. This article provides an overview of these projects including their motivations, identified problems, and proposed solutions. The studied projects are also verified against a classification of important aspects regarding scope and functionality of digital preservation in the engineering industry. Finally, future research topics are identified. 相似文献
996.
We study the classical approximate string matching problem, that is, given strings P and Q and an error threshold k, find all ending positions of substrings of Q whose edit distance to P is at most k. Let P and Q have lengths m and n, respectively. On a standard unit-cost word RAM with word size w≥log n we present an algorithm using time
O(nk ·min(\fraclog2 mlogn,\fraclog2 mlogww) + n)O\biggl(nk \cdot \min\biggl(\frac{\log^2 m}{\log n},\frac{\log^2 m\log w}{w}\biggr) + n\biggr) 相似文献
997.
This paper addresses the problem of designing robust tracking control for a class of uncertain wheeled mobile robots actuated by brushed direct current motors. This class of electrically‐driven mechanical systems consists of the robot kinematics, the robot dynamics, and the wheel actuator dynamics. Via the backstepping technique, an intelligent robust tracking control scheme that integrates a kinematic controller and an adaptive neural network‐based (or fuzzy‐based) controller is developed such that all of the states and signals of the closed‐loop system are bounded and the tracking error can be made as small as possible. Two adaptive approximation systems are constructed to learn the behaviors of unknown mechanical and electrical dynamics. The effects of both the approximation errors and the unmodeled time‐varying perturbations in the input and virtual‐input weighting matrices are counteracted by suitably tuning the control gains. Consequently, the robust control scheme developed here can be employed to handle a broader class of electrically‐driven wheeled mobile robots in the presence of high‐degree time‐varying uncertainties. Finally, a simulation example is given to demonstrate the effectiveness of the developed control scheme. 相似文献
998.
Pouria Pirzadeh Junichi Tatemura Oliver Po Hakan Hac?gümü? 《Journal of Grid Computing》2012,10(1):109-132
Recently there has been a considerable increase in the number of different Key-Value stores, for supporting data storage and
applications on the cloud environment. While all these solutions try to offer highly available and scalable services on the
cloud, they are significantly different with each other in terms of the architecture and types of the applications, they try
to support. Considering three widely-used such systems: Cassandra, HBase and Voldemort; in this paper we compare them in terms
of their support for different types of query workloads. We are mainly focused on the range queries. Unlike HBase and Cassandra
that have built-in support for range queries, Voldemort does not support this type of queries via its available API. For this
matter, practical techniques are presented on top of Voldemort to support range queries. Our performance evaluation is based
on mixed query workloads, in the sense that they contain a combination of short and long range queries, beside other types
of typical queries on key-value stores such as lookup and update. We show that there are trade-offs in the performance of
the selected system and scheme, and the types of the query workloads that can be processed efficiently. 相似文献
999.
Entanglement mean field theory is an approximate method for dealing with many-body systems, especially for the prediction
of the onset of phase transitions. While previous studies have concentrated mainly on applications of the theory on short-range
interaction models, we show here that it can be efficiently applied also to systems with long-range interaction Hamiltonians.
We consider the (quantum) Lipkin–Meshkov–Glick spin model, and derive the entanglement mean field theory reduced Hamiltonian.
A similar recipe can be applied to obtain entanglement mean field theory reduced Hamiltonians corresponding to other long-range
interaction systems. We show, in particular, that the zero temperature quantum phase transition present in the Lipkin–Meshkov–Glick
model can be accurately predicted by the theory. 相似文献
1000.
Junhan Lee Chan Gook Park 《International Journal of Control, Automation and Systems》2012,10(3):506-516
This paper presents a new scheme for fault detection and isolation in a satellite system. The purpose of this paper is to develop detection, isolation and identification algorithms based on a cascade filter for both total and partial faults in a satellite attitude control system (ACS). The cascade filter consists of a decentralized Kalman filter (DKF) and a bank of interacting multiple model (IMM) filters. The cascade filter is utilized for detection and diagnosis of anticipated sensor and actuator faults in a satellite ACS. Other fault detection and isolation (FDI) schemes are compared with the proposed FDI scheme. The FDI procedure using a cascade filter was developed in three stages. In the first stage, two local filters and a master filter detect sensor faults. In the second stage, the FDI scheme checks sensor residuals to isolate sensor faults, and 11 Extended Kalman filters with actuator fault models detect wherever actuator faults occur. In the third stage of the FDI scheme, four filters identify the fault type, which is either a total or partial fault. An important feature of the proposed FDI scheme is that it can decrease fault isolation time and accomplish not only fault detection and isolation but also fault type identification using a scalar penalty in the conditional density function. 相似文献
|