全文获取类型
收费全文 | 3681篇 |
免费 | 286篇 |
国内免费 | 11篇 |
专业分类
电工技术 | 50篇 |
综合类 | 18篇 |
化学工业 | 722篇 |
金属工艺 | 66篇 |
机械仪表 | 82篇 |
建筑科学 | 196篇 |
矿业工程 | 11篇 |
能源动力 | 97篇 |
轻工业 | 387篇 |
水利工程 | 33篇 |
石油天然气 | 30篇 |
无线电 | 377篇 |
一般工业技术 | 697篇 |
冶金工业 | 452篇 |
原子能技术 | 18篇 |
自动化技术 | 742篇 |
出版年
2023年 | 47篇 |
2022年 | 82篇 |
2021年 | 120篇 |
2020年 | 94篇 |
2019年 | 108篇 |
2018年 | 134篇 |
2017年 | 112篇 |
2016年 | 135篇 |
2015年 | 113篇 |
2014年 | 147篇 |
2013年 | 276篇 |
2012年 | 181篇 |
2011年 | 292篇 |
2010年 | 190篇 |
2009年 | 210篇 |
2008年 | 212篇 |
2007年 | 218篇 |
2006年 | 154篇 |
2005年 | 119篇 |
2004年 | 73篇 |
2003年 | 83篇 |
2002年 | 63篇 |
2001年 | 59篇 |
2000年 | 61篇 |
1999年 | 45篇 |
1998年 | 114篇 |
1997年 | 79篇 |
1996年 | 38篇 |
1995年 | 41篇 |
1994年 | 52篇 |
1993年 | 25篇 |
1992年 | 26篇 |
1991年 | 14篇 |
1990年 | 19篇 |
1989年 | 19篇 |
1988年 | 14篇 |
1987年 | 16篇 |
1986年 | 12篇 |
1985年 | 15篇 |
1984年 | 12篇 |
1983年 | 14篇 |
1982年 | 16篇 |
1981年 | 11篇 |
1980年 | 10篇 |
1979年 | 10篇 |
1977年 | 14篇 |
1976年 | 14篇 |
1975年 | 8篇 |
1974年 | 13篇 |
1969年 | 6篇 |
排序方式: 共有3978条查询结果,搜索用时 15 毫秒
91.
Farzad Aminravan Rehan Sadiq Mina Hoorfar Manuel J. Rodriguez Alex Francisque Homayoun Najjaran 《国际智能系统杂志》2011,26(8):731-758
This work investigates the problem of combining deficient evidence for the purpose of quality assessment. The main focus of the work is modeling vagueness, ambiguity, and local nonspecificity in information within a unified approach. We introduce an extended fuzzy Dempster–Shafer scheme based on the simultaneous use of fuzzy interval‐grade and interval‐valued belief degree (IGIB). The latter facilitates modeling of uncertainties in terms of local ignorance associated with expert knowledge, whereas the former allows for handling the lack of information on belief degree assignments. Also, generalized fuzzy sets can be readily transformed into the proposed fuzzy IGIB structure. The reasoning for quality assessment is performed by solving nonlinear optimization problems on fuzzy Dempster–Shafer paradigm for the fuzzy IGIB structure. The application of the proposed inference method is investigated by designing a reasoning scheme for water quality monitoring and validated through the experimental data available for different sampling points in a water distribution network. © 2011 Wiley Periodicals, Inc. 相似文献
92.
Gregory Chockler Seth Gilbert Vincent Gramoli Peter M. Musial Alex A. Shvartsman 《Journal of Parallel and Distributed Computing》2009
This paper presents a new algorithm for implementing a reconfigurable distributed shared memory in an asynchronous dynamic network. The algorithm guarantees atomic consistency (linearizability) in all executions in the presence of arbitrary crash failures of the processing nodes, message delays, and message loss. The algorithm incorporates a classic quorum-based algorithm for read/write operations, and an optimized consensus protocol, based on Fast Paxos for reconfiguration, and achieves the design goals of: (i) allowing read and write operations to complete rapidly and (ii) providing long-term fault-tolerance through reconfiguration, a process that evolves the quorum configurations used by the read and write operations. The resulting algorithm tolerates dynamism. We formally prove our algorithm to be correct, we present its performance and compare it to existing reconfigurable memories, and we evaluate experimentally the cost of its reconfiguration mechanism. 相似文献
93.
A new elegant and simple algorithm for mutual exclusion of N processes is proposed. It only requires shared variables in a memory model where shared variables need not be accessed atomically.
We prove mutual exclusion by reformulating the algorithm as a transition system (automaton), and applying simulation of automata.
The proof has been verified with the higher-order interactive theorem prover PVS. Under an additional atomicity assumption,
the algorithm is starvation free, and we conjecture that no competing process is passed by any other process more than once.
This conjecture was verified by model checking for systems with at most five processes. 相似文献
94.
Virtual execution environments, such as the Java virtual machine, promote platform‐independent software development. However, when it comes to analyzing algorithm complexity and performance bottlenecks, available tools focus on platform‐specific metrics, such as the CPU time consumption on a particular system. Other drawbacks of many prevailing profiling tools are high overhead, significant measurement perturbation, as well as reduced portability of profiling tools, which are often implemented in platform‐dependent native code. This article presents a novel profiling approach, which is entirely based on program transformation techniques, in order to build a profiling data structure that provides calling‐context‐sensitive program execution statistics. We explore the use of platform‐independent profiling metrics in order to make the instrumentation entirely portable and to generate reproducible profiles. We implemented these ideas within a Java‐based profiling tool called JP. A significant novelty is that this tool achieves complete bytecode coverage by statically instrumenting the core runtime libraries and dynamically instrumenting the rest of the code. JP provides a small and flexible API to write customized profiling agents in pure Java, which are periodically activated to process the collected profiling information. Performance measurements point out that, despite the presence of dynamic instrumentation, JP causes significantly less overhead than a prevailing tool for the profiling of Java code. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献
95.
This paper investigates the reliability assessment of structures exhibiting both stochastic and bounded uncertainties by using a probability and convex set mixed model. The safety measure of a structure is quantified by a reliability index defined by a nested minimization problem. An iterative procedure is developed for seeking the worst-case point and the most probable failure point in the standard uncertainty space. Numerical examples are given to demonstrate the applicability of the probability and convex set mixed model representation in the structural reliability assessment, as well as to illustrate the validity and effectiveness of the proposed numerical method. 相似文献
96.
This work proposes a method to decompose the kernel within-class eigenspace into two subspaces: a reliable subspace spanned
mainly by the facial variation and an unreliable subspace due to limited number of training samples. A weighting function
is proposed to circumvent undue scaling of eigenvectors corresponding to the unreliable small and zero eigenvalues. Eigenfeatures
are then extracted by the discriminant evaluation in the whole kernel space. These efforts facilitate a discriminative and
stable low-dimensional feature representation of the face image. Experimental results on FERET, ORL and GT databases show
that our approach consistently outperforms other kernel based face recognition methods.
相似文献
Alex KotEmail: |
97.
Alex K. Goins Ryan Carpenter Weng-Keen Wong Ravi Balasubramanian 《Autonomous Robots》2016,40(4):687-699
With the goal of advancing the state of automatic robotic grasping, we present a novel approach that combines machine learning techniques and physical validation on a robotic platform to develop a comprehensive grasp predictor. After collecting a large grasp sample set (522 grasps), we first conduct a statistical analysis of the predictive ability of grasp quality metrics that are commonly used in the robotics literature. We then apply principal component analysis and Gaussian process (GP) algorithms on the grasp metrics that are discriminative to build a classifier, validate its performance, and compare the results to existing grasp planners. The key findings are as follows: (i) several of the existing grasp metrics are weak predictors of grasp quality when implemented on a robotic platform; (ii) the GP-based classifier significantly improves grasp prediction by combining multiple grasp metrics to increase true positive classification at low false positive rates; (iii) The GP classifier can be used generate new grasps to improve bad grasp samples by performing a local search to find neighboring grasps which have improved contact points and higher success rate. 相似文献
98.
An action is a pair of sets, C and S, and a function \(f:C\times S \rightarrow C\). Rothschild and Yalcin gave a simple axiomatic characterization of those actions arising from set intersection, i.e. for which the elements of C and S can be identified with sets in such a way that elements of S act on elements of C by intersection. We introduce and axiomatically characterize two natural classes of actions which arise from set intersection and union. In the first class, the \(\uparrow \!\!\downarrow \)-actions, each element of S is identified with a pair of sets \((s^\downarrow ,s^\uparrow )\), which act on a set c by intersection with \(s^\downarrow \) and union with \(s^\uparrow \). In the second class, the \(\uparrow \!\!\downarrow \)-biactions, each element of S is labeled as an intersection or a union, and acts accordingly on C. We give intuitive examples of these actions, one involving conversations and another a university’s changing student body. The examples give some motivation for considering these actions, and also help give intuitive readings of the axioms. The class of \(\uparrow \!\!\downarrow \)-actions is closely related to a class of single-sorted algebras, which was previously treated by Margolis et al., albeit in another guise (hyperplane arrangements), and we note this connection. Along the way, we make some useful, though very general, observations about axiomatization and representation problems for classes of algebras. 相似文献
99.
A simple mutual exclusion algorithm is presented that only uses nonatomic shared variables of bounded size, and that satisfies
bounded overtaking. When the shared variables behave atomically, it has the first-come-first-served property (FCFS). Nonatomic
access makes information vulnerable. The effects of this can be mitigated by minimizing the information and by spreading it
over more variables. The design approach adopted here begins with such mitigating efforts. These resulted in an algorithm
with a proof of correctness, first for atomic variables. This proof is then used as a blueprint for the simultaneous development
of the algorithm for nonatomic variables and its proof. Mutual exclusion is proved by means of invariants. Bounded overtaking
and liveness under weak fairness are proved with invariants and variant functions. Liveness under weak fairness is formalized
and proved in a set-theoretic version of temporal logic. All these assertions are verified with the proof assistant PVS. We
heavily rely on the possibility offered by a proof assistant like PVS to reuse proofs developed for one context in a different
context. 相似文献
100.
Invariant ellipsoid method for minimization of unmatched disturbances effects in sliding mode control 总被引:1,自引:0,他引:1
A new sliding mode control design algorithm for a linear and a class of nonlinear quasi-Lipschitz disturbed system is presented. It is based on the appropriate selection of the sliding surface via invariant ellipsoid method. The designed control guarantees minimization of unmatched disturbances effects to system motions in a sliding mode. The obtained theoretical results are approved by numerical simulations. 相似文献