全文获取类型
收费全文 | 11620篇 |
免费 | 1760篇 |
国内免费 | 1298篇 |
专业分类
电工技术 | 1622篇 |
技术理论 | 3篇 |
综合类 | 1315篇 |
化学工业 | 331篇 |
金属工艺 | 214篇 |
机械仪表 | 1636篇 |
建筑科学 | 312篇 |
矿业工程 | 202篇 |
能源动力 | 196篇 |
轻工业 | 104篇 |
水利工程 | 150篇 |
石油天然气 | 212篇 |
武器工业 | 105篇 |
无线电 | 1538篇 |
一般工业技术 | 799篇 |
冶金工业 | 143篇 |
原子能技术 | 105篇 |
自动化技术 | 5691篇 |
出版年
2024年 | 55篇 |
2023年 | 141篇 |
2022年 | 243篇 |
2021年 | 319篇 |
2020年 | 342篇 |
2019年 | 299篇 |
2018年 | 315篇 |
2017年 | 427篇 |
2016年 | 503篇 |
2015年 | 590篇 |
2014年 | 740篇 |
2013年 | 754篇 |
2012年 | 953篇 |
2011年 | 934篇 |
2010年 | 684篇 |
2009年 | 724篇 |
2008年 | 745篇 |
2007年 | 874篇 |
2006年 | 710篇 |
2005年 | 675篇 |
2004年 | 615篇 |
2003年 | 495篇 |
2002年 | 398篇 |
2001年 | 344篇 |
2000年 | 309篇 |
1999年 | 226篇 |
1998年 | 185篇 |
1997年 | 194篇 |
1996年 | 146篇 |
1995年 | 144篇 |
1994年 | 119篇 |
1993年 | 92篇 |
1992年 | 98篇 |
1991年 | 44篇 |
1990年 | 40篇 |
1989年 | 41篇 |
1988年 | 35篇 |
1987年 | 24篇 |
1986年 | 16篇 |
1985年 | 20篇 |
1984年 | 17篇 |
1983年 | 11篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1980年 | 6篇 |
1979年 | 6篇 |
1977年 | 4篇 |
1976年 | 4篇 |
1975年 | 3篇 |
1973年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 20 毫秒
1.
In this paper, we study scheduling games under mixed coordination mechanisms on hierarchical machines. The two scheduling policies involved are ‐ and ‐, where ‐ (resp., ‐) policy sequences jobs in nondecreasing order of their hierarchies, and jobs of the same hierarchy in nonincreasing (resp., nondecreasing) order of their processing times. We first show the existence of a Nash equilibrium. Then we present the price of anarchy and the price of stability for the games with social costs of minimizing the makespan and maximizing the minimum machine load. All the bounds given in this paper are tight. 相似文献
2.
Steven Y. Susswein Thomas C. Henderson Joseph L. Zachary Chuck Hansen Paul Hinker Gary C. Marsden 《International journal of parallel programming》1991,20(6):453-473
Filtering algorithms are well accepted as a means of speeding up the solution of the consistent labeling problem (CLP). Despite the fact that path consistency does a better job of filtering than arc consistency, AC is still the preferred technique because it has a much lower time complexity. We are implementing parallel path consistency algorithms on multiprocessors and comparing their performance to the best sequential and parallel arc consistency algorithms.(1,2) (See also work by Kerethoet al.
(3) and Kasif(4)) Preliminary work has shown linear performance increases for parallelized path consistency and also shown that in many cases performance is significantly better than the theoretical worst case. These two results lead us to believe that parallel path consistency may be a superior filtering technique. Finally, we have implemented path consistency as an outer product computation and have obtained good results (e.g., linear speedup on a 64K-node Connection Machine 2). 相似文献
3.
4.
This study examined whether objects are attended in serial or in parallel during a demanding visual search task. A component of the event-related potential waveform, the N2pc wave, was used as a continuous measure of the allocation of attention to possible targets in the search arrays. Experiment 1 demonstrated that the relative allocation of attention shifts rapidly, favoring one item and then another. In Experiment 2, a paradigm was used that made it possible to track the absolute allocation of attention to individual items. This experiment showed that attention was allocated to one object for 100-150 ms before attention began to be allocated to the next object. These findings support models of attention that posit serial processing in demanding visual search tasks. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
5.
F. Pasquarelli 《Journal of scientific computing》1995,10(3):289-304
The multidomain technique for elliptic problems, that allows the fulfillment of the interface conditions by means of a suitable combination of the continuity of the solution and of its normal derivative, is considered. Some choices of this combination are investigated and, in particular, a choice that allows the solution of the multidomain problem through two solutions for each subproblem, is proposed. The scheme has been discretized with a collocation method and some numerical tests are reported. Moreover the method is compared with the more classical Dirichlet/Neumann one as well as with the capacitance matrix method.This research has been supported by a grant from M.P.I. (40%). 相似文献
6.
With the growing size and complexity of power systems, system analysis—such as transients calculation—takes much time. Hence, fast calculation methods are required. Although parallel processing is a hopeful method, there have been difficulties in the parallel solution of linear equations which appear in power-flow calculations by the Newton-Raphson method. This paper aims at the fast calculation of the power-flow problem by means of parallel processing. In order to improve the suitability to the parallel solution of the differential equation in transients calculation, we assume the use of a direct-mapping parallel processing machine to map directly the network of a power system onto a network of processors. Under this assumption, we propose a new parallel-processing-oriented method in which the linear equation is solved by linear iterations between nodes with Aitken acceleration. We simulate the method on three model power systems and compare this Parallel Iterative Method (PIN) with a Parallel Direct Method (PDM) which uses the banded matrix according to the number of operations required. As a result, we can expect that PIM may solve linear equations faster than PDM with m processors, although the PIM might be inferior to the PDM with m × m processors, where m denotes the half-band width of the banded matrix. 相似文献
7.
Objective: Guided by the extended parallel process model (EPPM), the objective was to assess control processes dominant in influenza behavior decisions. Design: Cross-sectional survey. Results: Response rate was 31% (n=968). Regarding influenza risk, 59% were in danger control. Those in fear control were more likely to report influenza infection (p=.000). In the nonvaccinated, those in fear control were more likely to indicate not knowing where to get the vaccine (p=.016) and that it was unavailable (p=.027), and those in danger control believed they did not need it (p=.023). Zero critical values were more likely to indicate that no health provider recommended the shot (p=.002). Conclusions: Most perceived efficacy to be stronger than threat related to influenza; according to the EPPM, they are aware of their risk but recognize their ability to avert it. For those in danger control, messages should focus on increasing perceptions of severity and susceptibility to positively affect behavior change. For those in fear control, messages should focus on efficacy only. With a critical value of zero, no threat is induced, and a high-threat/high-efficacy approach should be taken. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
8.
Andrzej Ciepielewski 《International journal of parallel programming》1991,20(6):421-451
Implementation of or-parallel Prolog systems offers a number of interesting scheduling problems. The main issues are the interaction between memory models and scheduling, ordering of multiple solutions, and scheduling of speculative work. The problems occur partly because of the design choices (e.g. the choice of a memory model), and partly because of the desire to maintain observational equivalence between parallel and sequential implementations of Prolog, while achieving high efficiency. In the first part of this paper a common framework for discussing scheduling in or-parallel systems is introduced, and also a collection of issues that must be addressed in such systems is presented. In the second part of the paper we survey a number of solutions to these problems comparing their efficiency whenever possible. We close the survey with a short discussion of open problems.Current association: Carlstedt Elektronik AB 相似文献
9.
Diane J. Cook 《Applied Intelligence》1991,1(2):133-144
Analogical planning provides a means of solving engineering problems where other machine learning methods fail. Unlike many machine learning paradigms, analogy does not require numerous previous examples or a rich domain theory. Instead, analogical planners adapt knowledge of solved problems in similar domains to the current problem. Unfortunately, the analogical planning task is an expensive one. While the process of forming correspondences between a known problem and a new problem is complex, the problem of selecting a base case for the analogy is virtually intractable.This paper addresses the issue of efficiently forming analogical plans. The Anagram planning system is described, which takes advantage of the massively parallel architecture of the Connection Machine to perform base selection and map formation. Anagram provides a tractable solution to analogical planning, with a complexity that is sublinear in the size of the plans.This paper describes the Anagram system and its parallel algorithms. The paper also presents theoretical analyses and empirical results of testing the system on a large database of plans from the domain of automatic programming. 相似文献
10.
A new evaluation model for SK combinator expressions is presented and used as a basis for the design of a novel processor. The resulting machine architecture resembles a dataflow ring, but executions are constrained to be fully lazy. An automatic dynamic load sharing mechanism for a distributed multiprocessor architecture is suggested, and initial simulation results are presented. 相似文献