全文获取类型
收费全文 | 10820篇 |
免费 | 35篇 |
国内免费 | 141篇 |
专业分类
电工技术 | 144篇 |
综合类 | 1篇 |
化学工业 | 379篇 |
金属工艺 | 435篇 |
机械仪表 | 58篇 |
建筑科学 | 76篇 |
矿业工程 | 1篇 |
能源动力 | 94篇 |
轻工业 | 23篇 |
水利工程 | 21篇 |
石油天然气 | 8篇 |
无线电 | 399篇 |
一般工业技术 | 304篇 |
冶金工业 | 168篇 |
原子能技术 | 90篇 |
自动化技术 | 8795篇 |
出版年
2023年 | 7篇 |
2022年 | 6篇 |
2021年 | 15篇 |
2020年 | 13篇 |
2019年 | 31篇 |
2018年 | 25篇 |
2017年 | 11篇 |
2016年 | 13篇 |
2015年 | 10篇 |
2014年 | 225篇 |
2013年 | 218篇 |
2012年 | 780篇 |
2011年 | 3079篇 |
2010年 | 1140篇 |
2009年 | 1014篇 |
2008年 | 685篇 |
2007年 | 600篇 |
2006年 | 457篇 |
2005年 | 580篇 |
2004年 | 527篇 |
2003年 | 587篇 |
2002年 | 286篇 |
2001年 | 16篇 |
2000年 | 15篇 |
1999年 | 38篇 |
1998年 | 119篇 |
1997年 | 56篇 |
1996年 | 39篇 |
1995年 | 19篇 |
1994年 | 15篇 |
1993年 | 21篇 |
1992年 | 22篇 |
1991年 | 19篇 |
1990年 | 20篇 |
1989年 | 16篇 |
1988年 | 13篇 |
1987年 | 24篇 |
1986年 | 31篇 |
1985年 | 20篇 |
1984年 | 39篇 |
1983年 | 26篇 |
1982年 | 21篇 |
1981年 | 26篇 |
1980年 | 10篇 |
1979年 | 13篇 |
1978年 | 8篇 |
1977年 | 8篇 |
1976年 | 10篇 |
1974年 | 7篇 |
1972年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
991.
Ralph VigneAuthor Vitae Juergen ManglerAuthor Vitae Erich Schikuta Author VitaeStefanie Rinderle-Ma Author Vitae 《Future Generation Computer Systems》2012,28(1):48-57
Creating simple marketplaces with common rules, that enable the dynamic selection and consumption of functionality, is the missing link to allow small businesses to enter the cloud, not only as consumers, but also as vendors. In this paper, we present the concepts behind a hybrid service and process repository that can act as the foundation for such a marketplace, as well as a prototype that allowed us to test various real-world scenarios. The advantage of a hybrid service and process repository is that, it not only holds a flat list of services, but also exposes a generic set of use cases, that it obtains information on how specific services can be used to implement the use cases as well as information to select services at run-time according to customer’s goal functions. 相似文献
992.
Michael MaurerAuthor Vitae Vincent C. EmeakarohaAuthor Vitae 《Future Generation Computer Systems》2012,28(1):39-47
Due to the large variety in computing resources and, consequently, the large number of different types of service level agreements (SLAs), computing resource markets face the problem of a low market liquidity. Restricting the number of different resource types to a small set of standardized computing resources seems to be the appropriate solution to counteract this problem. Standardized computing resources are defined through an SLA template. An SLA template defines the structure of an SLA, the service attributes, the names of the service attributes, and the service attribute values. However, since existing research results have only introduced static SLA templates so far, the SLA templates cannot reflect changes in user needs and market structures. To address this shortcoming, we present a novel approach of adaptive SLA matching. This approach adapts SLA templates based on SLA mappings of users. It allows Cloud users to define mappings between a public SLA template, which is available in the Cloud market, and their private SLA templates, which are used for various in-house business processes of the Cloud user. Besides showing how public SLA templates are adapted to the demand of Cloud users, we also analyze the costs and benefits of this approach. Costs are incurred every time a user has to define a new SLA mapping to a public SLA template due to its adaptation. In particular, we investigate how the costs differ with respect to the public SLA template adaptation method. The simulation results show that the use of heuristics within adaptation methods allows balancing the costs and benefits of the SLA mapping approach. 相似文献
993.
Ying LiuAuthor Vitae Hui ZhangAuthor VitaeChunping LiAuthor Vitae Roger Jianxin JiaoAuthor Vitae 《Decision Support Systems》2012,52(3):685-697
It is increasingly common to see computer-based simulation being used as a vehicle to model and analyze business processes in relation to process management and improvement. While there are a number of business process management (BPM) and business process simulation (BPS) methodologies, approaches and tools available, it is more desirable to have a systemic BPS approach for operational decision support, from constructing process models based on historical data to simulating processes for typical and common problems. In this paper, we have proposed a generic approach of BPS for operational decision support which includes business processes modeling and workflow simulation with the models generated. Processes are modeled with event graphs through process mining from workflow logs that have integrated comprehensive information about the control-flow, data and resource aspects of a business process. A case study of a credit card application is presented to illustrate the steps involved in constructing an event graph. The evaluation detail is also given in terms of precision, generalization and robustness. Based on the event graph model constructed, we simulate the process under different scenarios and analyze the simulation logs for three generic problems in the case study: 1) suitable resource allocation plan for different case arrival rates; 2) teamwork performance under different case arrival rates; and 3) evaluation and prediction for personal performances. Our experimental results show that the proposed approach is able to model business processes using event graphs and simulate the processes for common operational decision support which collectively play an important role in process management and improvement. 相似文献
994.
Fujun LaiAuthor Vitae Dahui LiAuthor Vitae Chang-Tseh HsiehAuthor Vitae 《Decision Support Systems》2012,52(2):353-363
The proliferation of the online business transaction has led to a large number of incidents of identity theft, which have incurred expensive costs to consumers and e-commerce industries. Fighting identity theft is important for both online business and consumers. Although the practical significance of fighting identity theft has been of great interest, empirical studies on identity theft are very limited. Drawing upon coping behavior theories, this study examines two types of coping behaviors to fight identity theft (i.e., conventional coping and technological coping). Following structural equation modeling approach, we test the model using data collected from 117 subjects through a survey. The results reveal that both conventional coping and technological coping are effective to defend against identity theft. Technological coping is determined by an individual's conventional coping, self-efficacy, perceived effectiveness of coping, and social influence. This study presents a timely empirical study on identity theft, and provides valuable insights for consumers, government agencies, and e-commerce industries. 相似文献
995.
A key process for post-secondary educational institutions is the definition of course timetables and classroom assignments. Manual scheduling methods require enormous amounts of time and resources to deliver results of questionable quality, and multiple course and classroom conflicts usually occur. This article presents a scheduling system implemented in a Web environment. This system generates optimal schedules via an integer-programming model. Among its functionalities, this system enables direct interaction with instructors in order to gather data on their time availability for teaching courses. The results demonstrate that significant improvements over the typical fully manual process were obtained. 相似文献
996.
A consistency and consensus based decision support model for group decision making with multiplicative preference relations 总被引:1,自引:0,他引:1
Zhibin Wu Author VitaeJiuping XuAuthor Vitae 《Decision Support Systems》2012,52(3):757-767
In group decision making (GDM) with multiplicative preference relations (also known as pairwise comparison matrices in the Analytical Hierarchy Process), to come to a meaningful and reliable solution, it is preferable to consider individual consistency and group consensus in the decision process. This paper provides a decision support model to aid the group consensus process while keeping an acceptable individual consistency for each decision maker. The concept of an individual consistency index and a group consensus index is introduced based on the Hadamard product of two matrices. Two algorithms are presented in the designed support model. The first algorithm is utilized to convert an unacceptable preference relation to an acceptable one. The second algorithm is designed to assist the group in achieving a predefined consensus level. The main characteristics of our model are that: (1) it is independent of the prioritization method used in the consensus process; (2) it ensures that each individual multiplicative preference relation is of acceptable consistency when the predefined consensus level is achieved. Finally, some numerical examples are given to verify the effectiveness of our model. 相似文献
997.
Cloud brokering mechanisms for optimized placement of virtual machines across multiple providers 总被引:1,自引:0,他引:1
Johan TordssonAuthor Vitae Rubén S. MonteroAuthor Vitae 《Future Generation Computer Systems》2012,28(2):358-367
In the past few years, we have witnessed the proliferation of a heterogeneous ecosystem of cloud providers, each one with a different infrastructure offer and pricing policy. We explore this heterogeneity in a novel cloud brokering approach that optimizes placement of virtual infrastructures across multiple clouds and also abstracts the deployment and management of infrastructure components in these clouds. The feasibility of our approach is evaluated in a high throughput computing cluster case study. Experimental results confirm that multi-cloud deployment provides better performance and lower costs compared to the usage of a single cloud only. 相似文献
998.
Distributed computing for carbon footprint reduction by exploiting low-footprint energy availability
Ward Van HeddeghemAuthor Vitae Willem VereeckenAuthor VitaeDidier ColleAuthor Vitae Mario PickavetAuthor VitaePiet DemeesterAuthor Vitae 《Future Generation Computer Systems》2012,28(2):405-414
Low carbon footprint energy sources such as solar and wind power typically suffer from unpredictable or limited availability. By globally distributing a number of these renewable sources, these effects can largely be compensated for. We look at the feasibility of this approach for powering already distributed data centers in order to operate at a reduced total carbon footprint. From our study we show that carbon footprint reductions are possible, but that these are highly dependent on the approach and parameters involved. Especially the manufacturing footprint and the geographical region are critical parameters to consider. Deploying additional data centers can help in reducing the total carbon footprint, but substantial reductions can be achieved when data centers with nominal capacity well below maximum capacity redistribute processing to sites based on renewable energy availability. 相似文献
999.
Steven S.W. LeeAuthor Vitae Po-Kai TsengAuthor VitaeAlice ChenAuthor Vitae 《Future Generation Computer Systems》2012,28(2):437-445
In order to lessen the greenhouse effects and diminish environmental pollution, reducing energy usage is important in designing next generation networks. Shutting down the network devices that carry light load and redirecting their traffic flows to other routes is the most common way to reduce network energy consumption. Since traffic demands among node pairs vary in different time periods, an energy efficient network has to dynamically determine the optimal active links to adapt itself to network traffic changes. However, in current IP networks, shutting down and/or turning on links would trigger link state routing protocols to reconverge to a new topology. Since the convergence time would take tens of seconds, routing table inconsistencies among routers would result in network disconnection and even worse, generating traffic loops during the convergence interval. Removing routing images inconsistent among routers to prevent loops is a critical issue in energy efficient network and this issue is still not considered in the green network design yet. The contribution of the paper is presented in two parts. First, we propose a comprehensive approach to determine a network topology and a link metric for each time period. Traffic engineering is considered in our design such that flows going on the energy-aware network are within a predetermined percentage of the link capacity such that no congestion occurs in a statistical manner. Second, to avoid transient loops during time period changes, we propose a Distributed Loop-free Routing Update (DLRU) scheme to determine the correct sequence for updating the routing table. A scrupulous proof was also presented to ensure the loop-free property of the DLRU. In this paper, we formulate an integer linear programming to determine this multi-topology and link weight assignment problem. Due to its NP-hard property, we propose an efficient algorithm, termed Lagrangian Relaxation and Harmonic Series (LR&HS) heuristic. Numerical results demonstrate that the proposed LRHS approach outperforms the other approaches on several benchmark networks and random networks by providing up to 35%-50% additional energy saving in our experimental cases. 相似文献
1000.
Xiaofei LiaoAuthor Vitae 《Future Generation Computer Systems》2012,28(2):469-477
Since power is one of the major limiting factors for a data center or for large cluster growth, the objective of this study is to minimize the power consumption of the cluster without violating the performance constraints of the applications. We propose a runtime virtual machine (VM) mapping framework in a cluster or data center to save energy. The new framework can make reconfiguration decisions on time with the consideration of a low influence on the performance. In the GreenMap framework, one probabilistic, heuristic algorithm is designed for the optimization problem: mapping VMs onto a set of physical machines (PMs) under the constraint of multi-dimensional resource consumptions. Experimental measurements show that the new method can reduce the power consumption by up to 69.2% over base, with few performance penalties. The effectiveness and performance insights are also analytically verified. 相似文献