全文获取类型
收费全文 | 10342篇 |
免费 | 720篇 |
国内免费 | 566篇 |
学科分类
工业技术 | 11628篇 |
出版年
2024年 | 21篇 |
2023年 | 89篇 |
2022年 | 124篇 |
2021年 | 151篇 |
2020年 | 190篇 |
2019年 | 194篇 |
2018年 | 198篇 |
2017年 | 270篇 |
2016年 | 280篇 |
2015年 | 337篇 |
2014年 | 539篇 |
2013年 | 625篇 |
2012年 | 458篇 |
2011年 | 704篇 |
2010年 | 538篇 |
2009年 | 559篇 |
2008年 | 717篇 |
2007年 | 767篇 |
2006年 | 722篇 |
2005年 | 684篇 |
2004年 | 586篇 |
2003年 | 547篇 |
2002年 | 394篇 |
2001年 | 311篇 |
2000年 | 246篇 |
1999年 | 266篇 |
1998年 | 166篇 |
1997年 | 179篇 |
1996年 | 122篇 |
1995年 | 111篇 |
1994年 | 112篇 |
1993年 | 77篇 |
1992年 | 56篇 |
1991年 | 58篇 |
1990年 | 37篇 |
1989年 | 36篇 |
1988年 | 23篇 |
1987年 | 16篇 |
1986年 | 18篇 |
1985年 | 24篇 |
1984年 | 19篇 |
1983年 | 14篇 |
1982年 | 10篇 |
1981年 | 9篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 5篇 |
1977年 | 5篇 |
1966年 | 2篇 |
1961年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
51.
With the development of the globalization of economy and manufacturing industry, distributed manufacturing mode has become a hot topic in current production research. In the context of distributed manufacturing, one job has different process routes in different workshops because of heterogeneous manufacturing resources and manufacturing environments in each factory. Considering the heterogeneous process planning problems and shop scheduling problems simultaneously can take advantage of the characteristics of distributed factories to finish the processing task well. Thus, a novel network-based mixed-integer linear programming (MILP) model is established for distributed integrated process planning and scheduling problem (DIPPS). The paper designs a new encoding method based on the process network and its OR-nodes, and then proposes a discrete artificial bee colony algorithm (DABC) to solve the DIPPS problem. The proposed DABC can guarantee the feasibility of individuals via specially-designed mapping and switching operations, so that the process precedence constraints contained by the network graph can be satisfied in the entire procedure of the DABC algorithm. Finally, the proposed MILP model is verified and the proposed DABC is tested through some open benchmarks. By comparing with other powerful reported algorithms and obtaining new better solutions, the experiment results prove the effectiveness of the proposed model and DABC algorithm successfully. 相似文献
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.
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. 相似文献
54.
Summary Byzantine Agreement is important both in the theory and practice of distributed computing. However, protocols to reach Byzantine Agreement are usually expensive both in the time required as well as in the number of messages exchanged. In this paper, we present a self-adjusting approach to the problem. The Mostly Byzantine Agreement is proposed as a more restrictive agreement problem that requires that in the consecutive attempts to reach agreement, the number of disagreements (i.e., failures to reach Byzantine Agreement) is finite. Fort faulty processes, we give an algorithm that has at mostt disagreements for 4t or more processes. Another algorithm is given forn3t+1 processes with the number of disagreements belowt
2/2. Both algorithms useO(n
3) message bits for binary value agreement.
Yi Zhao is currently working on his Ph.D. degree in Computer Science at University of Houston. His research interests include fault tolerance, distributed computing, parallel computation and neural networks. He obtained his M.S. from University of Houston in 1988 and B.S. from Beijing University of Aeronautics and Astronautics in 1984, both in computer science.
Farokh B. Bastani received the B. Tech. degree in electrical engineering from the Indian Institute of Technology, Bombay, India, and the M.S. and Ph.D. degrees in electrical engineering and computer science from the University of California, Berkeley. He joined the University of Houston in 1980, where he is currently an Associate Professor of Computer Science. His research interests include software design and validation techniques, distributed systems, and fault-tolerant systems. He is a member of the ACM and the IEEE and is on the editorial board of theIEEE Transactions on Software Engineering. 相似文献
55.
绩效管理是人力资源管理的核心,对企业实现战略目标有举足轻重的作用,绩效测评是绩效管理中必不可少的组成部分。本文讲述了一种全面客观的360度绩效测评法,并介绍了一套按照360度绩效测评模型构建的B/S办公系统,重点介绍了使用这套系统进行绩效测评的过程,以便通过信息化手段,有效的运用这一先进测评方法,为企业管理提供有益的支持。 相似文献
56.
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. 相似文献
57.
《The Electricity Journal》2021,34(9):107029
This study addresses the question of how the electricity grid can best be priced, in the context of disruptive technologies, increasing decentralisation of the power sector and new business models. The emergence of business models can affect the design of tariffs, but at the same time, tariff design can trigger new business models as they can nudge adoption towards certain technologies. Network tariffs have traditionally been established using a cost accounting method. Due to its cost structure, network tariffs are second best constructs, as marginal cost pricing does not lead to cost recovery. Second best solutions, in all probability, will overcompensate some inputs which in turn will be overused (the Averch-Johnson effect). New distributed energy technologies that perform better in these overcompensated inputs will therefore see a higher penetration in the market. Penetration of some technologies over others in a previously monolithic vertically integrated power sector will open up new customer needs and therefore business opportunities. Each resulting business opportunity would make use of the grid differently from which it was originally conceived, and at one extreme, they can bypass it altogether. We provide a framework of analysis that leads to the pricing of the services provided by the electricity grid for each new business opportunity. 相似文献
58.
M. S. J. Simmonds W. M. Blaney F. Delle Monache G. B. Marini Bettolo 《Journal of chemical ecology》1990,16(2):365-380
The antifeedant activity of a series of 21 chalcones, flavanes, and flavanones isolated from the generaLonchocarpus andTephrosia (Leguminosae) was assessed by behavioral and electrophysiological bioassays against larvae ofSpodoptera littoralis andS. exempta. The antifeedant activity is related to the molecular structure of the compounds, and possible modes of interaction with the insect taste receptors are discussed. 相似文献
59.
This paper studies the robust distributed receding horizon control (DRHC) problem for large-scale continuous-time nonlinear systems subject to communication delays and external disturbances. A dual-mode robust DRHC strategy is designed to deal with the communication delays and the external disturbances simultaneously. The feasibility of the proposed DRHC and the stability of the closed-loop system are analyzed, and the sufficient conditions for ensuring the feasibility and stability are developed, respectively. We show that: (1) the feasibility is affected by the bounds of external disturbances, the sampling period and the bound of communication delays; (2) the stability is related to the bounds of external disturbances, the sampling period, the bound of communication delays and the minimum eigenvalues of the cooperation matrices; (3) the closed-loop system is stabilized into a robust invariant set under the proposed conditions. A simulation study is conducted to verify the theoretical results. 相似文献
60.
In this paper, a decentralized adaptive tracking control is developed for a second-order leader–follower system with unknown dynamics and relative position measurements. Linearly parameterized models are used to describe the unknown dynamics of a self-active leader and all followers. A new distributed system is obtained by using the relative position and velocity measurements as the state variables. By only using the relative position measurements, a dynamic output–feedback tracking control together with decentralized adaptive laws is designed for each follower. At the same time, the stability of the tracking error system and the parameter convergence are analyzed with the help of a common Lyapunov function method. Some simulation results are presented to validate the proposed adaptive tracking control. 相似文献