全文获取类型
收费全文 | 2905篇 |
免费 | 206篇 |
国内免费 | 1篇 |
专业分类
电工技术 | 61篇 |
综合类 | 1篇 |
化学工业 | 956篇 |
金属工艺 | 18篇 |
机械仪表 | 80篇 |
建筑科学 | 106篇 |
矿业工程 | 2篇 |
能源动力 | 87篇 |
轻工业 | 444篇 |
水利工程 | 27篇 |
石油天然气 | 5篇 |
无线电 | 234篇 |
一般工业技术 | 398篇 |
冶金工业 | 111篇 |
原子能技术 | 15篇 |
自动化技术 | 567篇 |
出版年
2023年 | 34篇 |
2022年 | 173篇 |
2021年 | 189篇 |
2020年 | 93篇 |
2019年 | 84篇 |
2018年 | 112篇 |
2017年 | 90篇 |
2016年 | 138篇 |
2015年 | 93篇 |
2014年 | 121篇 |
2013年 | 203篇 |
2012年 | 176篇 |
2011年 | 224篇 |
2010年 | 163篇 |
2009年 | 191篇 |
2008年 | 129篇 |
2007年 | 132篇 |
2006年 | 109篇 |
2005年 | 88篇 |
2004年 | 65篇 |
2003年 | 58篇 |
2002年 | 62篇 |
2001年 | 37篇 |
2000年 | 32篇 |
1999年 | 25篇 |
1998年 | 40篇 |
1997年 | 27篇 |
1996年 | 34篇 |
1995年 | 18篇 |
1994年 | 27篇 |
1993年 | 9篇 |
1992年 | 12篇 |
1991年 | 5篇 |
1990年 | 18篇 |
1989年 | 10篇 |
1988年 | 7篇 |
1987年 | 6篇 |
1986年 | 4篇 |
1985年 | 4篇 |
1984年 | 10篇 |
1983年 | 8篇 |
1982年 | 10篇 |
1981年 | 6篇 |
1980年 | 11篇 |
1977年 | 3篇 |
1976年 | 3篇 |
1975年 | 2篇 |
1971年 | 2篇 |
1965年 | 2篇 |
1909年 | 2篇 |
排序方式: 共有3112条查询结果,搜索用时 31 毫秒
71.
Claudia Archetti Luca Bertazzi Giuseppe Paletta M. Grazia Speranza 《Computers & Operations Research》2011
We consider a production-distribution system, where a facility produces one commodity which is distributed to a set of retailers by a fleet of vehicles. Each retailer defines a maximum level of the inventory. The production policy, the retailers replenishment policies and the transportation policy have to be determined so as to minimize the total system cost. The overall cost is composed by fixed and variable production costs at the facility, inventory costs at both facility and retailers and routing costs. We study two different types of replenishment policies. The well-known order-up to level (OU) policy, where the quantity shipped to each retailer is such that the level of its inventory reaches the maximum level, and the maximum level (ML) policy, where the quantity shipped to each retailer is such that the inventory is not greater than the maximum level. We first show that when the transportation is outsourced, the problem with OU policy is NP-hard, whereas there exists a class of instances where the problem with ML policy can be solved in polynomial time. We also show the worst-case performance of the OU policy with respect to the more flexible ML policy. Then, we focus on the ML policy and the design of a hybrid heuristic. We also present an exact algorithm for the solution of the problem with one vehicle. Results of computational experiments carried out on small size instances show that the heuristic can produce high quality solutions in a very short amount of time. Results obtained on a large set of randomly generated problem instances are also shown, aimed at comparing the two policies. 相似文献
72.
73.
Dynamic SLAs management in service oriented environments 总被引:1,自引:0,他引:1
Giuseppe Di Modica Author Vitae Author Vitae Lorenzo Vita Author Vitae 《Journal of Systems and Software》2009,82(5):759-771
The increasing adoption of service oriented architectures across different administrative domains, forces service providers to use effective mechanisms and strategies of resource management in order for them to be able to guarantee the quality levels their customers demands during service provisioning. Service level agreements (SLA) are the most common mechanism used to establish agreements on the quality of a service (QoS) between a service provider and a service consumer. The WS-Agreement specification, developed by the Open Grid Forum, is a Web Service protocol to establish agreements on the QoS level to be guaranteed in the provision of a service. The committed agreement cannot be modified during service provision and is effective until all activities pertaining to it are finished or until one of the signing party decides to terminate it. In B2B scenarios where several service providers are involved in the composition of a service, and each of them plays both the parts of provider and customer, several one-to-one SLAs need to be signed. In such a rigid context the global QoS of the final service can be strongly affected by any violation on each single SLA. In order to prevent such violations, SLAs need to adapt to any possible needs that might come up during service provision. In this work we focus on the WS-Agreement specification and propose to enhance the flexibility of its approach. We integrate new functionality to the protocol that enable the parties of a WS-Agreement to re-negotiate and modify its terms during the service provision, and show how a typical scenario of service composition can benefit from our proposal. 相似文献
74.
75.
The representer theorem for kernel methods states that the solution of the associated variational problem can be expressed
as the linear combination of a finite number of kernel functions. However, for non-smooth loss functions, the analytic characterization
of the coefficients poses nontrivial problems. Standard approaches resort to constrained optimization reformulations which,
in general, lack a closed-form solution. Herein, by a proper change of variable, it is shown that, for any convex loss function,
the coefficients satisfy a system of algebraic equations in a fixed-point form, which may be directly obtained from the primal
formulation. The algebraic characterization is specialized to regression and classification methods and the fixed-point equations
are explicitly characterized for many loss functions of practical interest. The consequences of the main result are then investigated
along two directions. First, the existence of an unconstrained smooth reformulation of the original non-smooth problem is
proven. Second, in the context of SURE (Stein’s Unbiased Risk Estimation), a general formula for the degrees of freedom of
kernel regression methods is derived. 相似文献
76.
Enhancing a dependable multiserver operating system with temporal protection via resource reservations 总被引:1,自引:0,他引:1
Antonio Mancina Dario Faggioli Giuseppe Lipari Jorrit N. Herder Ben Gras Andrew S. Tanenbaum 《Real-Time Systems》2009,43(2):177-210
Nowadays, microkernel-based systems are getting studied and adopted with a renewed interest in a wide number of IT scenarios. Their advantages over classical monolithic solutions mainly concern the dependability domain. By being capable of dynamically detect and solve non-expected behaviours within its core components, a microkernel-based OS would eventually run forever with no need to be restarted. Dependability in this context mainly aims at isolating components from a spatial point of view: a microkernel-based system may definitely not be adopted in the context of real-time environments, simply basing on this kind of protection only. One of the most active real-time research areas concerns adding temporal protection mechanisms to general purpose operating systems. By making use of such mechanisms, these systems become suitable for being adopted in the context of time-sensitive domains. Microkernel-based systems have always been thought of as a kind of platform not suited to real-time contexts, due to the high latencies introduced by the message passing technique as the only inter-process communication (IPC) facility within the system. With computer performances growing at a fairly high rate, this overhead becomes negligible with respect to the typical real-time processing times. In the last years, many algorithms belonging to the class of the so-called Resource Reservations (RRES) have been devised in order to provide the systems with the needed temporal isolation. By introducing a RRES-aware scheduler in the context of a microkernel-based system, we may enrich it with the temporal benefits it needs in order to be deployed within domains with real-time requirements. In this paper we propose a generic way to implement these mechanisms, dependent for a very small part on the underlying OS mechanisms. In order to show the generality of our RRES framework we implemented it in the context of Minix 3, a highly dependable microkernel-based OS with an impressive users base. 相似文献
77.
78.
Imon Banerjee Asan Agibetov Chiara Eva Catalano Giuseppe Patané Michela Spagnuolo 《The Visual computer》2016,32(10):1337-1349
In the digital era, patient-specific 3D models (3D-PSMs) are becoming increasingly relevant in computer-assisted diagnosis, surgery training on digital models, or implant design. While advanced imaging and reconstruction techniques can create accurate and detailed 3D models of patients’ anatomy, software tools that are able to fully exploit the potential of 3D-PSMs are still far from being satisfactory. In particular, there is still a lack of integrated approaches for extracting, coding, sharing and retrieving medically relevant information from 3D-PSMs and use it concretely as a support to diagnosis and treatment. In this article, we propose the SemAnatomy3D framework, which demonstrates how the ontology-driven annotation of 3D-PSMs and of their anatomically relevant features (parts of relevance) can assist clinicians to document more effectively pathologies and their evolution. We exemplify the idea in the context of the diagnosis of rheumatoid arthritis of the hand district, and show how feature extraction tools and semantic 3D annotation can provide a rich characterization of anatomical landmarks (e.g., articular facets, prominent features, ligament attachments) and pathological markers (erosions, bone loss). The core contributions are an ontology-driven part-based annotation method for the 3D-PSMs and a novel automatic localization of erosion and quantification of the OMERACT RAMRIS erosion score. Finally, our results have been compared against a medical ground truth. 相似文献
79.
We present a control framework for achieving encirclement of a target moving in 3D using a multi-robot system. Three variations of a basic control strategy are proposed for different versions of the encirclement problem, and their effectiveness is formally established. An extension ensuring maintenance of a safe inter-robot distance is also discussed. The proposed framework is fully decentralized and only requires local communication among robots; in particular, each robot locally estimates all the relevant global quantities. We validate the proposed strategy through simulations on kinematic point robots and quadrotor UAVs, as well as experiments on differential-drive wheeled mobile robots. 相似文献
80.
Command governor for constrained switched systems with scheduled model transition dwell times
下载免费PDF全文
![点击此处可从《国际强度与非线性控制杂志<br>》网站下载免费的PDF全文](/ch/ext_images/free.gif)
In this paper, a switched control architecture for constrained control systems is presented. The strategy is based on command governor ideas that are here specialized to ‘optimally’ schedule switching events on the plant dynamics for improving control performance at the expense of low computational burdens. The significance of the method mainly lies in its capability to avoid constraints violation and loss of stability regardless of any configuration change occurrence in the plant/constraint structure. To this end, the concept of model transition dwell time is used within the proposed control framework to formally define the minimum time necessary to enable a switching event under guaranteed conditions on the overall stability and constraint fulfilment. Simulation results on a simple linear system and on a Cessna 182 aircraft model show the effectiveness of the proposed strategy. Copyright © 2017 John Wiley & Sons, Ltd. 相似文献