全文获取类型
收费全文 | 12266篇 |
免费 | 397篇 |
国内免费 | 149篇 |
专业分类
电工技术 | 373篇 |
综合类 | 193篇 |
化学工业 | 700篇 |
金属工艺 | 671篇 |
机械仪表 | 256篇 |
建筑科学 | 280篇 |
矿业工程 | 96篇 |
能源动力 | 110篇 |
轻工业 | 222篇 |
水利工程 | 96篇 |
石油天然气 | 206篇 |
武器工业 | 36篇 |
无线电 | 565篇 |
一般工业技术 | 437篇 |
冶金工业 | 218篇 |
原子能技术 | 146篇 |
自动化技术 | 8207篇 |
出版年
2024年 | 5篇 |
2023年 | 39篇 |
2022年 | 119篇 |
2021年 | 162篇 |
2020年 | 108篇 |
2019年 | 87篇 |
2018年 | 99篇 |
2017年 | 104篇 |
2016年 | 126篇 |
2015年 | 153篇 |
2014年 | 343篇 |
2013年 | 348篇 |
2012年 | 966篇 |
2011年 | 2493篇 |
2010年 | 1294篇 |
2009年 | 1137篇 |
2008年 | 894篇 |
2007年 | 754篇 |
2006年 | 631篇 |
2005年 | 709篇 |
2004年 | 633篇 |
2003年 | 649篇 |
2002年 | 357篇 |
2001年 | 94篇 |
2000年 | 77篇 |
1999年 | 97篇 |
1998年 | 82篇 |
1997年 | 51篇 |
1996年 | 32篇 |
1995年 | 43篇 |
1994年 | 34篇 |
1993年 | 24篇 |
1992年 | 16篇 |
1991年 | 12篇 |
1990年 | 6篇 |
1989年 | 9篇 |
1988年 | 7篇 |
1987年 | 6篇 |
1986年 | 5篇 |
1984年 | 1篇 |
1983年 | 2篇 |
1982年 | 1篇 |
1980年 | 2篇 |
1959年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 140 毫秒
941.
Harendra SinghAuthor VitaeGirraj Kumar VermaAuthor Vitae 《Journal of Systems and Software》2012,85(1):209-214
A proxy signature scheme, introduced by Mambo, Usuda and Okamoto, allows an entity to delegate its signing rights to another entity. Identity based public key cryptosystems are a good alternative for a certificate based public key setting, especially when efficient key management and moderate security are required. From inception several ID-based proxy signature schemes have been discussed, but no more attention has been given to proxy signature with message recovery. In this paper, we are proposing provably secure ID-based proxy signature scheme with message recovery and we have proved that our scheme is secure as existential forgery-adaptively chosen message and ID attack. As proposed scheme is efficient in terms of communication overhead and security, it can be a good alternative for certificate based proxy signatures, used in various applications such as wireless e-commerce, mobile agents, mobile communication and distributed shared object systems, etc. 相似文献
942.
João Gustavo PrudêncioAuthor Vitae Leonardo MurtaAuthor Vitae 《Journal of Systems and Software》2012,85(2):277-289
Mechanisms to control concurrent access over project artefacts are needed to execute the software development process in an organized way. These mechanisms are implemented by concurrency control policies in version control systems that may inhibit (i.e. ‘to lock’) or allow (i.e., ‘not to lock’) parallel development. This work presents a novel approach named Orion that analyzes the project's historical changes and suggests the most appropriate concurrency control policy for each software element. This suggestion aims at minimizing conflict situations and thus improving the productivity of the development team. In addition, it identifies critical elements that do not work well with any of these policies and are candidates to refactoring. We evaluated Orion through two experimental studies and the results, which indicated it was effective, led us to a prototype implementation. Apart from the Orion approach this paper also presents the planning, execution, and analysis stages of the evaluation, and details of prototype internals. 相似文献
943.
This paper presents a novel image encryption algorithm, which is flexible to encrypt digital images with different precisions. The algorithm is construct from three collision-based dynamical systems: Hardy-Pomeau-Pazzis (HPP) model, rotary element (RE) model and billiard-particle model. Both the HPP and RE model are efficient and can support parallel computing; the billiard-particle is an excellent model for round key expansion. These models are revised to best suits image encryption. Analyses and simulations demonstrate that the proposed algorithm has satisfactory properties of randomness and sensitivity. 相似文献
944.
Re-engineering the Engineering Change Management process for a drawing-less environment 总被引:1,自引:0,他引:1
Virgilio QuintanaAuthor Vitae Louis RivestAuthor VitaeRobert PellerinAuthor Vitae Fawzi KheddouciAuthor Vitae 《Computers in Industry》2012,63(1):79-90
Currently, 3D models and 2D drawings are the main basic elements that together form and carry the product definition throughout the product lifecycle. With the advent of the Digital Product Definition trend, industries have been interested in adopting a Model-based Definition (MBD) approach that enables the integration of drawing annotations directly onto a 3D model, thereby minimizing the need to generate engineering drawings. This drawing-less environment requires a way to adequately carry the product definition throughout a product's lifecycle while supporting all of the downstream users’ specific needs. The objective of this article is to present a solution to carry the Engineering Change Management (ECM) process in a drawing-less environment. Therefore, based on ECM process requirements from two Canadian aerospace companies, we propose an MBD dataset which consists of an MBD model and a distribution file. The proposed MBD dataset is evaluated and the MBD-driven ECM process is outlined. 相似文献
945.
Reducing congestion in bulk-service finite-buffer queueing system using batch-size-dependent service
In the design and analysis of any queueing system, one of the main objectives is to reduce congestion which can be achieved by controlling either arrival-rates or service-rates. This paper adopts the latter approach and analyzes a single-server finite-buffer queue where customers arrive according to the Poisson process and are served in batches of minimum size a with a maximum threshold limit b. The service times of the batches are arbitrarily distributed and depends on the size of the batches undergoing service. We obtain the joint distribution of the number of customers in the queue and the number with the server, and distributions of the number of customers in the queue, in the system, and the number with the server. Various performance measures such as the average number of customers in the queue (system) and with the server etc. are obtained. Several numerical results are presented in the form of tables and graphs and it is observed that batch-size-dependent service rule is more effective in reducing the congestion as compared to the one when service rates of the batches remain same irrespective of the size of the batch. This model has potential application in manufacturing, computer-communication network, telecommunication systems and group testing. 相似文献
946.
Nazanin SaadatAuthor Vitae Amir Masoud Rahmani Author Vitae 《Future Generation Computer Systems》2012,28(4):666-681
In recent years, grid technology has had such a fast growth that it has been used in many scientific experiments and research centers. A large number of storage elements and computational resources are combined to generate a grid which gives us shared access to extra computing power. In particular, data grid deals with data intensive applications and provides intensive resources across widely distributed communities. Data replication is an efficient way for distributing replicas among the data grids, making it possible to access similar data in different locations of the data grid. Replication reduces data access time and improves the performance of the system. In this paper, we propose a new dynamic data replication algorithm named PDDRA that optimizes the traditional algorithms. Our proposed algorithm is based on an assumption: members in a VO (Virtual Organization) have similar interests in files. Based on this assumption and also file access history, PDDRA predicts future needs of grid sites and pre-fetches a sequence of files to the requester grid site, so the next time that this site needs a file, it will be locally available. This will considerably reduce access latency, response time and bandwidth consumption. PDDRA consists of three phases: storing file access patterns, requesting a file and performing replication and pre-fetching and replacement. The algorithm was tested using a grid simulator, OptorSim developed by European Data Grid projects. The simulation results show that our proposed algorithm has better performance in comparison with other algorithms in terms of job execution time, effective network usage, total number of replications, hit ratio and percentage of storage filled. 相似文献
947.
K. VivekanandanAuthor Vitae D. RamyachitraAuthor Vitae 《Future Generation Computer Systems》2012,28(4):647-656
Scientific applications such as protein sequence analysis require a coordination of resources. This is due to hundreds and hundreds of protein sequences being deposited into data banks by the research community which results in an extensive database search when one wants to find a similar protein sequence. This search becomes easier and the time taken is reduced when it is conducted in a grid environment implemented using the Globus tool kit. This paper proposes the use of Bacteria Foraging Optimization (BFO) for finding similar protein sequences in the existing databases. Usage of BFO further reduces the time taken by a resource to execute the user’s requests. Also, the resources utilized in the proposed method are better balanced compared to the existing scheduling algorithms. Also, it is found that the number of tasks executed is more compared to the existing algorithms even though there is a fall in the execution of tasks as the number of resources increases which might be due to network failure etc. The proposed BFO has been compared with the existing First Come First Serve (FCFS) and Minimum Execution Time (MET) scheduling algorithms and it has been found that the proposed BFO performs well compared to the existing algorithms in terms of makespan, resource utilization and minimization in the case of non-execution of client requests. 相似文献
948.
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. 相似文献
949.
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. 相似文献
950.
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. 相似文献