全文获取类型
收费全文 | 1088篇 |
免费 | 59篇 |
专业分类
电工技术 | 13篇 |
综合类 | 1篇 |
化学工业 | 269篇 |
金属工艺 | 3篇 |
机械仪表 | 12篇 |
建筑科学 | 34篇 |
矿业工程 | 2篇 |
能源动力 | 39篇 |
轻工业 | 81篇 |
水利工程 | 11篇 |
石油天然气 | 4篇 |
无线电 | 175篇 |
一般工业技术 | 133篇 |
冶金工业 | 28篇 |
原子能技术 | 4篇 |
自动化技术 | 338篇 |
出版年
2024年 | 2篇 |
2023年 | 14篇 |
2022年 | 36篇 |
2021年 | 48篇 |
2020年 | 41篇 |
2019年 | 41篇 |
2018年 | 36篇 |
2017年 | 45篇 |
2016年 | 40篇 |
2015年 | 33篇 |
2014年 | 56篇 |
2013年 | 91篇 |
2012年 | 68篇 |
2011年 | 81篇 |
2010年 | 54篇 |
2009年 | 79篇 |
2008年 | 67篇 |
2007年 | 70篇 |
2006年 | 35篇 |
2005年 | 23篇 |
2004年 | 26篇 |
2003年 | 18篇 |
2002年 | 17篇 |
2001年 | 6篇 |
2000年 | 6篇 |
1999年 | 5篇 |
1998年 | 9篇 |
1997年 | 7篇 |
1996年 | 5篇 |
1995年 | 3篇 |
1994年 | 9篇 |
1993年 | 5篇 |
1992年 | 5篇 |
1991年 | 4篇 |
1990年 | 3篇 |
1989年 | 7篇 |
1988年 | 7篇 |
1987年 | 7篇 |
1986年 | 4篇 |
1985年 | 8篇 |
1984年 | 5篇 |
1983年 | 4篇 |
1982年 | 3篇 |
1981年 | 4篇 |
1980年 | 3篇 |
1979年 | 3篇 |
1978年 | 1篇 |
1977年 | 2篇 |
1973年 | 1篇 |
排序方式: 共有1147条查询结果,搜索用时 15 毫秒
21.
We present a framework for the formulation and solution of continuous process scheduling problems. We focus on modeling transient operations such as startups, shutdowns, and transitions between steady states. First, we show how the concept of processing tasks can be generalized to represent continuous processes, including their transient operations. Second, we discuss how to systematically calculate the parameters describing material consumption/production and utility consumption during transient operations. Finally, we present new mixed-integer linear programming formulations for the scheduling of continuous chemical production. 相似文献
22.
John?Augustine Ioannis?CaragiannisEmail author Angelo?Fanelli Christos?Kalaitzis 《Algorithmica》2015,72(1):44-82
The efficient design of networks has been an important engineering task that involves challenging combinatorial optimization problems. Typically, a network designer has to select among several alternatives which links to establish so that the resulting network satisfies a given set of connectivity requirements and the cost of establishing the network links is as low as possible. The Minimum Spanning Tree problem, which is well-understood, is a nice example.In this paper, we consider the natural scenario in which the connectivity requirements are posed by selfish users who have agreed to share the cost of the network to be established according to a well-defined rule. The design proposed by the network designer should now be consistent not only with the connectivity requirements but also with the selfishness of the users. Essentially, the users are players in a so-called network design game and the network designer has to propose a design that is an equilibrium for this game. As it is usually the case when selfishness comes into play, such equilibria may be suboptimal. In this paper, we consider the following question: can the network designer enforce particular designs as equilibria or guarantee that efficient designs are consistent with users’ selfishness by appropriately subsidizing some of the network links? In an attempt to understand this question, we formulate corresponding optimization problems and present positive and negative results. 相似文献
23.
24.
Several researchers have recently investigated the connection between reinforcement learning and classification. We are motivated
by proposals of approximate policy iteration schemes without value functions, which focus on policy representation using classifiers
and address policy learning as a supervised learning problem. This paper proposes variants of an improved policy iteration
scheme which addresses the core sampling problem in evaluating a policy through simulation as a multi-armed bandit machine.
The resulting algorithm offers comparable performance to the previous algorithm achieved, however, with significantly less
computational effort. An order of magnitude improvement is demonstrated experimentally in two standard reinforcement learning
domains: inverted pendulum and mountain-car. 相似文献
25.
A steady-state interval operability methodology is introduced here for multivariable non-square systems with fewer inputs than output variables to be used in the design of model-based constrained controllers (MPC, DMC). For such systems, set-point control is not possible for all the outputs and interval control is needed. The proposed iterative approach enables the selection of the needed interval constraints systematically, so that the tightest possible control is achieved without rendering the control problem infeasible. The application of this methodology to high-dimensional industrial problems characterizing processes of Air Products and Chemicals and DuPont shows that very significant reduction of the constrained region can be achieved from the steady-state point of view. Ratios of the initial to the calculated volume of the constrained regions examined range between 104 and 108. 相似文献
26.
Lambrini Seremeti Christos Goumopoulos Achilles Kameas 《Pervasive and Mobile Computing》2009,5(5):574-591
As the computer disappears in the environments surrounding our activities, the objects therein become augmented with sensors, actuators, processors, memories, wireless communication modules and they can receive, store, process and transmit information. In addition to objects, spaces also undergo a change towards becoming smart and eventually Ambient Intelligence (AmI) spaces. In order to model the way everyday activities are carried out within an AmI environment, we introduce the notion of “activity sphere”. In this paper, we are interested in the ontology-based representation of activity spheres from two different perspectives (as creators and as observers), as well as the modeling and control of the dynamic nature of activity spheres. 相似文献
27.
We study aG/G/1 queueing system with a bursty arrival process. Based on a general model for such a bursty process, we derive infinitesimal perturbation analysis (IPA) derivative estimators of the mean system time with respect to various parameters of interest. The cases of both complete and partial state information are considered. To ensure unbiasedness and strong consistency of the estimators, different sample path representations are developed such that sample functions are continuous with respect to the particular parameter of interest. Some of these representations are applicable to a wider class of gradient estimation problems where sample path discontinuities arise. Simulation results are included to compare the convergence rates and variance properties of the different IPA estimators developed. 相似文献
28.
Christos Bouras Apostolos Gkamas Georgios Kioumourtzis 《Journal of Network and Systems Management》2011,19(2):143-177
In this paper, we present Adaptive Smooth Simulcast Protocol (ASSP) for simulcast transmission of multimedia data over best-effort
networks. ASSP is a new multiple-rate protocol that implements a single rate TCP-friendly protocol as the underlying congestion
control mechanism for each simulcast stream. The key attributes of ASSP are: (a) TCP-friendly behavior, (b) adaptive per-stream
transmission rates, (c) adaptive scalability to large sets of receivers and (d) smooth transmission rates that are suitable
for multimedia applications. We evaluate the performance of ASSP under an integrated simulation environment which combines
the measurements of both network and video performance metrics. We also compare ASSP against other proposed solutions and
the results demonstrate that the performance of ASSP is significantly better than the tested solutions. Finally, ASSP is a
practical solution with very low implementation complexity for video transmission over best-effort networks. 相似文献
29.
A repairable queueing model with a two-phase service in succession, provided by a single server, is investigated. Customers arrive in a single ordinary queue and after the completion of the first phase service, either proceed to the second phase or join a retrial box from where they retry, after a random amount of time and independently of the other customers in orbit, to find a position for service in the second phase. Moreover, the server is subject to breakdowns and repairs in both phases, while a start-up time is needed in order to start serving a retrial customer. When the server, upon a service or a repair completion finds no customers waiting to be served, he departs for a single vacation of an arbitrarily distributed length. The arrival process is assumed to be Poisson and all service and repair times are arbitrarily distributed. For such a system the stability conditions and steady state analysis are investigated. Numerical results are finally obtained and used to investigate system performance. 相似文献
30.
We consider Discrete Event Systems (DES) involving tasks with real-time constraints and seek to control processing times so
as to minimize a cost function subject to each task meeting its own constraint. It has been shown that the off-line version
of this problem can be efficiently solved by the Critical Task Decomposition Algorithm (CTDA) (Mao et al., IEEE Trans Mobile Comput 6(6):678–688, 2007). In the on-line version, random task characteristics (e.g., arrival times) are not known in advance. To bypass this difficulty,
worst-case analysis may be used. This, however, does not make use of probability distributions and results in an overly conservative
solution. In this paper, we develop a new approach which does not rely on worst-case analysis but provides a “best solution
in probability” efficiently obtained by estimating the probability distribution of sample-path-optimal solutions. We introduce
a condition termed “non-singularity” under which the best solution in probability leads to the on-line optimal control. Numerical
examples are included to illustrate our results and show substantial performance improvements over worst-case analysis. 相似文献