全文获取类型
收费全文 | 11785篇 |
免费 | 886篇 |
国内免费 | 706篇 |
专业分类
电工技术 | 485篇 |
综合类 | 1059篇 |
化学工业 | 303篇 |
金属工艺 | 174篇 |
机械仪表 | 614篇 |
建筑科学 | 348篇 |
矿业工程 | 77篇 |
能源动力 | 178篇 |
轻工业 | 201篇 |
水利工程 | 92篇 |
石油天然气 | 83篇 |
武器工业 | 67篇 |
无线电 | 1136篇 |
一般工业技术 | 1000篇 |
冶金工业 | 123篇 |
原子能技术 | 43篇 |
自动化技术 | 7394篇 |
出版年
2024年 | 47篇 |
2023年 | 87篇 |
2022年 | 136篇 |
2021年 | 141篇 |
2020年 | 217篇 |
2019年 | 218篇 |
2018年 | 175篇 |
2017年 | 291篇 |
2016年 | 317篇 |
2015年 | 409篇 |
2014年 | 562篇 |
2013年 | 833篇 |
2012年 | 697篇 |
2011年 | 824篇 |
2010年 | 516篇 |
2009年 | 796篇 |
2008年 | 835篇 |
2007年 | 857篇 |
2006年 | 784篇 |
2005年 | 632篇 |
2004年 | 565篇 |
2003年 | 537篇 |
2002年 | 456篇 |
2001年 | 386篇 |
2000年 | 312篇 |
1999年 | 239篇 |
1998年 | 237篇 |
1997年 | 229篇 |
1996年 | 154篇 |
1995年 | 127篇 |
1994年 | 117篇 |
1993年 | 83篇 |
1992年 | 82篇 |
1991年 | 50篇 |
1990年 | 42篇 |
1989年 | 47篇 |
1988年 | 47篇 |
1987年 | 27篇 |
1986年 | 25篇 |
1985年 | 39篇 |
1984年 | 48篇 |
1983年 | 33篇 |
1982年 | 21篇 |
1981年 | 21篇 |
1980年 | 23篇 |
1979年 | 15篇 |
1978年 | 9篇 |
1977年 | 12篇 |
1976年 | 9篇 |
1975年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
51.
Chien-Feng Huang 《Applied Soft Computing》2012,12(2):807-818
In the areas of investment research and applications, feasible quantitative models include methodologies stemming from soft computing for prediction of financial time series, multi-objective optimization of investment return and risk reduction, as well as selection of investment instruments for portfolio management based on asset ranking using a variety of input variables and historical data, etc. Among all these, stock selection has long been identified as a challenging and important task. This line of research is highly contingent upon reliable stock ranking for successful portfolio construction. Recent advances in machine learning and data mining are leading to significant opportunities to solve these problems more effectively. In this study, we aim at developing a methodology for effective stock selection using support vector regression (SVR) as well as genetic algorithms (GAs). We first employ the SVR method to generate surrogates for actual stock returns that in turn serve to provide reliable rankings of stocks. Top-ranked stocks can thus be selected to form a portfolio. On top of this model, the GA is employed for the optimization of model parameters, and feature selection to acquire optimal subsets of input variables to the SVR model. We will show that the investment returns provided by our proposed methodology significantly outperform the benchmark. Based upon these promising results, we expect this hybrid GA-SVR methodology to advance the research in soft computing for finance and provide an effective solution to stock selection in practice. 相似文献
52.
LetR be a unidirectional asynchronous ring ofn identical processors each with a single input bit. Letf be any cyclic nonconstant function ofn boolean variables. Moran and Warmuth (1986) prove that anydeterministic algorithm that evaluatesf onR has communication complexity (n logn) bits. They also construct a family of cyclic nonconstant boolean functions that can be evaluated inO(n logn) bits by a deterministic algorithm.This contrasts with the following new results:
相似文献
1. | There exists a family of cyclic nonconstant boolean functions which can be evaluated with expected complexity bits by arandomized algorithm forR. |
2. | Anynondeterministic algorithm forR which evaluates any cyclic nonconstant function has communication complexity bits. |
53.
Given a planar setS ofn points,maxdominance problems consist of computing, for everyp S, some function of the maxima of the subset ofS that is dominated byp. A number of geometric and graph-theoretic problems can be formulated as maxdominance problems, including the problem of computing a minimum independent dominating set in a permutation graph, the related problem of finding the shortest maximal increasing subsequence, the problem of enumerating restricted empty rectangles, and the related problem of computing the largest empty rectangle. We give an algorithm for optimally solving a class of maxdominance problems. A straightforward application of our algorithm yields improved time bounds for the above-mentioned problems. The techniques used in the algorithm are of independent interest, and include a linear-time tree computation that is likely to arise in other contexts.The research of this author was supported by the Office of Naval Research under Grants N00014-84-K-0502 and N00014-86-K-0689, and the National Science Foundation under Grant DCR-8451393, with matching funds from AT&T.This author's research was supported by the National Science Foundation under Grant DCR-8506361. 相似文献
54.
Distributed match-making 总被引:1,自引:0,他引:1
In many distributed computing environments, processes are concurrently executed by nodes in a store- and-forward communication network. Distributed control issues as diverse as name server, mutual exclusion, and replicated data management involve making matches between such processes. We propose a formal problem called distributed match-making as the generic paradigm. Algorithms for distributed match-making are developed and the complexity is investigated in terms of messages and in terms of storage needed. Lower bounds on the complexity of distributed match-making are established. Optimal algorithms, or nearly optimal algorithms, are given for particular network topologies.The work of the second author was supported in part by the Office of Naval Research under Contract N00014-85-K-0168, by the Office of Army Research under Contract DAAG29-84-K-0058, by the National Science Foundation under Grant DCR-83-02391, and by the Defence Advanced Research Projects Agency (DARPA) under Contract N00014-83-K-0125. Current address of both authors: CWI, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands. 相似文献
55.
Given an array ofn input numbers, therange-maxima problem is that of preprocessing the data so that queries of the type what is the maximum value in subarray [i..j] can be answered quickly using one processor. We present a randomized preprocessing algorithm that runs inO(log*
n) time with high probability, using an optimal number of processors on a CRCW PRAM; each query can be processed in constant time by one processor. We also present a randomized algorithm for a parallel comparison model. Using an optimal number of processors, the preprocessing algorithm runs inO( (n)) time with high probability; each query can be processed inO ( (n)) time by one processor. (As is standard, (n) is the inverse of Ackermann function.) A constant time query can be achieved by some slowdown in the performance of the preprocessing stage. 相似文献
56.
Rex A. Dwyer 《Algorithmica》1987,2(1):137-151
An easily implemented modification to the divide-and-conquer algorithm for computing the Delaunay triangulation ofn sites in the plane is presented. The change reduces its (n logn) expected running time toO(n log logn) for a large class of distributions that includes the uniform distribution in the unit square. Experimental evidence presented demonstrates that the modified algorithm performs very well forn216, the range of the experiments. It is conjectured that the average number of edges it creates—a good measure of its efficiency—is no more than twice optimal forn less than seven trillion. The improvement is shown to extend to the computation of the Delaunay triangulation in theL
p
metric for 1<p.This research was supported by National Science Foundation Grants DCR-8352081 and DCR-8416190. 相似文献
57.
Given two processes, each having a total-ordered set ofn elements, we present a distributed algorithm for finding median of these 2n elements using no more than logn +O(logn) messages, but if the elements are distinct, only logn +O(1) messages will be required. The communication complexity of our algorithm is better than the previously known result which takes 2 logn messages. 相似文献
58.
The two basic performance parameters that capture the complexity of any VLSI chip are the area of the chip,A, and the computation time,T. A systematic approach for establishing lower bounds onA is presented. This approach relatesA to the bisection flow, . A theory of problem transformation based on , which captures bothAT
2 andA complexity, is developed. A fundamental problem, namely, element uniqueness, is chosen as a computational prototype. It is shown under general input/output protocol assumptions that any chip that decides ifn elements (each with (1+)lognbits) are unique must have =(nlogn), and thus, AT2=(n
2log2
n), andA= (nlogn). A theory of VLSI transformability reveals the inherentAT
2 andA complexity of a large class of related problems.This work was supported in part by the Semiconductor Research Corporation under contract RSCH 84-06-049-6. 相似文献
59.
60.
乐光学 《组合机床与自动化加工技术》2003,(11):18-21
研究了企业产品制造的调度问题 ,并建立了调度的最小模型。引入效率函数 ,运用遗传退火进化算法实现了调度决策的优化 ;提出了将遗传退火算法和分派规则相结合的调度策略和动态编码的方法 ,放宽了约束条件 ,提高了搜索效率和速度 ,保证其全局收敛性。 相似文献