全文获取类型
收费全文 | 2751篇 |
免费 | 41篇 |
国内免费 | 2篇 |
专业分类
电工技术 | 13篇 |
化学工业 | 252篇 |
金属工艺 | 28篇 |
机械仪表 | 24篇 |
建筑科学 | 80篇 |
矿业工程 | 14篇 |
能源动力 | 59篇 |
轻工业 | 138篇 |
水利工程 | 16篇 |
石油天然气 | 16篇 |
武器工业 | 3篇 |
无线电 | 253篇 |
一般工业技术 | 274篇 |
冶金工业 | 1314篇 |
原子能技术 | 26篇 |
自动化技术 | 284篇 |
出版年
2021年 | 18篇 |
2019年 | 14篇 |
2018年 | 24篇 |
2017年 | 15篇 |
2016年 | 26篇 |
2015年 | 21篇 |
2014年 | 26篇 |
2013年 | 105篇 |
2012年 | 43篇 |
2011年 | 74篇 |
2010年 | 39篇 |
2009年 | 43篇 |
2008年 | 68篇 |
2007年 | 57篇 |
2006年 | 60篇 |
2005年 | 50篇 |
2004年 | 36篇 |
2003年 | 46篇 |
2002年 | 44篇 |
2001年 | 31篇 |
2000年 | 39篇 |
1999年 | 75篇 |
1998年 | 372篇 |
1997年 | 224篇 |
1996年 | 162篇 |
1995年 | 86篇 |
1994年 | 108篇 |
1993年 | 94篇 |
1992年 | 42篇 |
1991年 | 35篇 |
1990年 | 49篇 |
1989年 | 51篇 |
1988年 | 41篇 |
1987年 | 30篇 |
1986年 | 26篇 |
1985年 | 32篇 |
1984年 | 33篇 |
1983年 | 30篇 |
1982年 | 19篇 |
1981年 | 23篇 |
1980年 | 38篇 |
1979年 | 19篇 |
1978年 | 24篇 |
1977年 | 56篇 |
1976年 | 109篇 |
1975年 | 18篇 |
1974年 | 11篇 |
1973年 | 21篇 |
1971年 | 14篇 |
1970年 | 10篇 |
排序方式: 共有2794条查询结果,搜索用时 234 毫秒
71.
Neural network modules based on page-oriented dynamic digital photorefractive memory are described. The modules can implement two different interconnection organizations, fan-out and fan-in, depending on their target network applications. Neural network learning is realized by the real-time memory update of dynamic digital photorefractive memory. Physical separation of subvolumes in the page-oriented photorefractive memory architecture contributes to the low cross talk and high diffraction efficiency of the stored interconnection weights. Digitally encoded interconnection weights ensure high accuracy, providing superior neural network system scalability. Module scalability and feedforward throughput have been investigated based on photorefractive memory geometry and the photodetector power requirements. The following four approaches to extend module scalability are discussed: partial optical summation, semiparallel feedforward operation, time partitioning, and interconnection matrix partitioning. Learning capabilities of the system are investigated in terms of required interconnection primitives for implementing learning processes and three memory-update schemes. The experimental results of Perceptron learning network implementation with 900 input neurons with digital 6-bit accuracy are reported. 相似文献
72.
We describe a fast, data-driven bandwidth selection procedure for kernel conditional density estimation (KCDE). Specifically, we give a Monte Carlo dual-tree algorithm for efficient, error-controlled approximation of a cross-validated likelihood objective. While exact evaluation of this objective has an unscalable O(n2) computational cost, our method is practical and shows speedup factors as high as 286,000 when applied to real multivariate datasets containing up to one million points. In absolute terms, computation times are reduced from months to minutes. This enables applications at much greater scale than previously possible. The core idea in our method is to first derive a standard deterministic dual-tree approximation, whose loose deterministic bounds we then replace with tight, probabilistic Monte Carlo bounds. The resulting Monte Carlo dual-tree algorithm exhibits strong error control and high speedup across a broad range of datasets several orders of magnitude greater in size than those reported in previous work. The cost of this high acceleration is the loss of the formal error guarantee of the deterministic dual-tree framework; however, our experiments show that error is still amply controlled by our Monte Carlo algorithm, and the many-order-of-magnitude speedups are worth this sacrifice in the large-data case, where cross-validated bandwidth selection for KCDE would otherwise be impractical. 相似文献
73.
We give an example of a monoid with finitely many left and right ideals, all of whose Schützenberger groups are presentable by finite complete rewriting systems, and so each have finite derivation type, but such that the monoid itself does not have finite derivation type, and therefore does not admit a presentation by a finite complete rewriting system. The example also serves as a counterexample to several other natural questions regarding complete rewriting systems and finite derivation type. Specifically it allows us to construct two finitely generated monoids M and N with isometric Cayley graphs, where N has finite derivation type (respectively, admits a presentation by a finite complete rewriting system) but M does not. This contrasts with the case of finitely generated groups for which finite derivation type is known to be a quasi-isometry invariant. The same example is also used to show that neither of these two properties is preserved under finite Green index extensions. 相似文献
74.
James Gray Yang-Hui He Anton Ilderton André Lukas 《Computer Physics Communications》2009,180(1):107-119
We give a simple tutorial introduction to the Mathematica package STRINGVACUA, which is designed to find vacua of string-derived or inspired four-dimensional N=1 supergravities. The package uses powerful algebro-geometric methods, as implemented in the free computer algebra system Singular, but requires no knowledge of the mathematics upon which it is based. A series of easy-to-use Mathematica modules are provided which can be used both in string theory and in more general applications requiring fast polynomial computations. The use of these modules is illustrated throughout with simple examples.
Program summary
Program title: STRINGVACUACatalogue identifier: AEBZ_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEBZ_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: GNU GPLNo. of lines in distributed program, including test data, etc.: 31 050No. of bytes in distributed program, including test data, etc.: 163 832Distribution format: tar.gzProgramming language: “Mathematica” syntaxComputer: Home and office spec desktop and laptop machines, networked or stand aloneOperating system: Windows XP (with Cygwin), Linux, Mac OS, running Mathematica V5 or aboveRAM: Varies greatly depending on calculation to be performedClassification: 11.1External routines: Linux: The program “Singular” is called from Mathematica. Windows: “Singular” is called within the Cygwin environment from Mathematica.Nature of problem: A central problem of string-phenomenology is to find stable vacua in the four-dimensional effective theories which result from compactification.Solution method: We present an algorithmic method, which uses techniques of algebraic geometry, to find all of the vacua of any given string-phenomenological system in a huge class.Running time: Varies greatly depending on calculation requested. 相似文献75.
An Architecture for Human‐Guided Autonomy: Team TROOPER at the DARPA Robotics Challenge Finals
下载免费PDF全文
![点击此处可从《野外机器人技术杂志》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Steven Gray Robert Chevalier David Kotfis Benjamin Caimano Kenneth Chaney II Aron Rubin Kingsley Fregene Todd Danko 《野外机器人技术杂志》2017,34(5):852-873
Recent robotics efforts have automated simple, repetitive tasks to increase execution speed and lessen an operator's cognitive load, allowing them to focus on higher‐level objectives. However, an autonomous system will eventually encounter something unexpected, and if this exceeds the tolerance of automated solutions, there must be a way to fall back to teleoperation. Our solution is a largely autonomous system with the ability to determine when it is necessary to ask a human operator for guidance. We call this approach human‐guided autonomy. Our design emphasizes human‐on‐the‐loop control where an operator expresses a desired high‐level goal for which the reasoning component assembles an appropriate chain of subtasks. We introduce our work in the context of the DARPA Robotics Challenge (DRC) Finals. We describe the software architecture Team TROOPER developed and used to control an Atlas humanoid robot. We employ perception, planning, and control automation for execution of subtasks. If subtasks fail, or if changing environmental conditions invalidate the planned subtasks, the system automatically generates a new task chain. The operator is able to intervene at any stage of execution, to provide input and adjustment to any control layer, enabling operator involvement to increase as confidence in automation decreases. We present our performance at the DRC Finals and a discussion about lessons learned. 相似文献
76.
A Faà di Bruno type Hopf algebra is developed for a group of integral operators known as Fliess operators, where operator composition is the group product. Such operators are normally written in terms of generating series over a noncommutative alphabet. Using a general series expansion for the antipode, an explicit formula for the generating series of the compositional inverse operator is derived. The result is applied to analytic nonlinear feedback systems to produce an explicit formula for the feedback product, that is, the generating series for the Fliess operator representation of the closed-loop system written in terms of the generating series of the Fliess operator component systems. This formula is employed to provide a proof that local convergence is preserved under feedback. 相似文献
77.
Gupta MR Gray RM Olshen RA 《IEEE transactions on pattern analysis and machine intelligence》2006,28(5):766-781
Nonparametric neighborhood methods for learning entail estimation of class conditional probabilities based on relative frequencies of samples that are "near-neighbors" of a test point. We propose and explore the behavior of a learning algorithm that uses linear interpolation and the principle of maximum entropy (LIME). We consider some theoretical properties of the LIME algorithm: LIME weights have exponential form; the estimates are consistent; and the estimates are robust to additive noise. In relation to bias reduction, we show that near-neighbors contain a test point in their convex hull asymptotically. The common linear interpolation solution used for regression on grids or look-up-tables is shown to solve a related maximum entropy problem. LIME simulation results support use of the method, and performance on a pipeline integrity classification problem demonstrates that the proposed algorithm has practical value. 相似文献
78.
Lee B Parr CS Plaisant C Bederson BB Veksler VD Gray WD Kotfila C 《IEEE transactions on visualization and computer graphics》2006,12(6):1414-1426
Despite extensive research, it is still difficult to produce effective interactive layouts for large graphs. Dense layout and occlusion make food Webs, ontologies and social networks difficult to understand and interact with. We propose a new interactive visual analytics component called TreePlus that is based on a tree-style layout. TreePlus reveals the missing graph structure with visualization and interaction while maintaining good readability. To support exploration of the local structure of the graph and gathering of information from the extensive reading of labels, we use a guiding metaphor of "plant a seed and watch it grow." It allows users to start with a node and expand the graph as needed, which complements the classic overview techniques that can be effective at (but often limited to) revealing clusters. We describe our design goals, describe the interface and report on a controlled user study with 28 participants comparing TreePlus with a traditional graph interface for six tasks. In general, the advantage of TreePlus over the traditional interface increased as the density of the displayed data increased. Participants also reported higher levels of confidence in their answers with TreePlus and most of them preferred TreePlus 相似文献
79.
Wang J.Z. Jia Li Gray R.M. Wiederhold G. 《IEEE transactions on pattern analysis and machine intelligence》2001,23(1):85-90
Unsupervised segmentation of images with low depth of field (DOF) is highly useful in various applications. This paper describes a novel multiresolution image segmentation algorithm for low DOF images. The algorithm is designed to separate a sharply focused object-of-interest from other foreground or background objects. The algorithm is fully automatic in that all parameters are image independent. A multi-scale approach based on high frequency wavelet coefficients and their statistics is used to perform context-dependent classification of individual blocks of the image. Unlike other edge-based approaches, our algorithm does not rely on the process of connecting object boundaries. The algorithm has achieved high accuracy when tested on more than 100 low DOF images, many with inhomogeneous foreground or background distractions. Compared with he state of the art algorithms, this new algorithm provides better accuracy at higher speed 相似文献
80.
J Degen E W?lke M Seiberling P Pintar G H?xter HB Steinhauer W Fischer 《Canadian Metallurgical Quarterly》1993,88(3):129-33, 171
The pharmacokinetics of the antidepressants amitriptyline oxide and trimipramine and their major metabolites amitriptyline, nor-triptyline and desmethyltrimipramine, were studied in twelve healthy male subjects (aged from 22 to 62 years) and twelve patients (aged from 25 to 73 years) with severe renal impairment (glomerular filtration rate < 10 ml/min). Oral single doses of 60 mg amitriptyline oxide and 50 mg trimipramine, separated by a washout period, were administered to all study participants. Blood and urine samples were collected up to 120 hours after administration. For trimipramine and desmethyltrimipramine, a new HPLC method was developed. The "Fischer Somatic and Undesired Effects Check List" was used for the assessment of adverse events. The mean plasma half-life and AUC of amitriptyline oxide and its metabolites were significantly higher in patients than in healthy adults. For trimipramine the AUC was significantly higher in patients. The plasma half-life of trimipramine was longer in patients, but statistically not significant. The maximum plasma concentrations for both drugs and metabolites were at an average distinctly higher in patients. Clearance rate of amitroptylinoxide and trimipramine also differed between the two groups. Correlating with these results a high incidence and a longer persistence (in most cases > 12 hours) and more pronounced adverse effects were noted in the patient group, whereas in volunteers adverse events were only observed up to approximately eight hours. 相似文献