全文获取类型
收费全文 | 2431篇 |
免费 | 115篇 |
国内免费 | 7篇 |
专业分类
电工技术 | 31篇 |
综合类 | 3篇 |
化学工业 | 631篇 |
金属工艺 | 36篇 |
机械仪表 | 77篇 |
建筑科学 | 77篇 |
矿业工程 | 4篇 |
能源动力 | 117篇 |
轻工业 | 274篇 |
水利工程 | 17篇 |
石油天然气 | 9篇 |
无线电 | 194篇 |
一般工业技术 | 400篇 |
冶金工业 | 96篇 |
原子能技术 | 15篇 |
自动化技术 | 572篇 |
出版年
2024年 | 6篇 |
2023年 | 36篇 |
2022年 | 93篇 |
2021年 | 83篇 |
2020年 | 88篇 |
2019年 | 82篇 |
2018年 | 104篇 |
2017年 | 92篇 |
2016年 | 97篇 |
2015年 | 77篇 |
2014年 | 122篇 |
2013年 | 189篇 |
2012年 | 196篇 |
2011年 | 190篇 |
2010年 | 143篇 |
2009年 | 120篇 |
2008年 | 115篇 |
2007年 | 102篇 |
2006年 | 86篇 |
2005年 | 49篇 |
2004年 | 68篇 |
2003年 | 58篇 |
2002年 | 44篇 |
2001年 | 29篇 |
2000年 | 30篇 |
1999年 | 16篇 |
1998年 | 26篇 |
1997年 | 35篇 |
1996年 | 13篇 |
1995年 | 11篇 |
1994年 | 13篇 |
1993年 | 14篇 |
1992年 | 10篇 |
1990年 | 6篇 |
1989年 | 12篇 |
1988年 | 3篇 |
1987年 | 10篇 |
1986年 | 11篇 |
1985年 | 12篇 |
1984年 | 11篇 |
1983年 | 11篇 |
1982年 | 5篇 |
1981年 | 6篇 |
1980年 | 4篇 |
1979年 | 3篇 |
1978年 | 4篇 |
1977年 | 3篇 |
1976年 | 3篇 |
1974年 | 3篇 |
1967年 | 2篇 |
排序方式: 共有2553条查询结果,搜索用时 15 毫秒
11.
Francisco J. Gutierrez Sergio F. Ochoa Gustavo Zurita Nelson Baloian 《Information Systems Frontiers》2016,18(1):7-21
Participation is the cornerstone of any community. Promoting, understanding and properly managing it allows not only keeping the community sustainable, but also providing personalized services to its members and managers. This article presents a case study in which student participation in a course community was motivated using two different extrinsic mechanisms, and mediated by a software platform. The results were compared with a baseline community of the same course, in which participation was not motivated by external means. The analysis of these results indicates that managing a partially virtual course community requires the introduction of monitoring services, community managers and extrinsic mechanisms to motivate participation. These findings allow community managers to improve their capability for promoting participation and keeping the community sustainable. The findings also raise several implications that should be considered in the design of software supporting this kind of community, when managing the participation of its members. 相似文献
12.
Andrei Tchernykh Luz Lozano Uwe Schwiegelshohn Pascal Bouvry Johnatan E. Pecero Sergio Nesmachnow Alexander Yu. Drozdov 《Journal of Grid Computing》2016,14(1):5-22
This paper focuses on a bi-objective experimental evaluation of online scheduling in the Infrastructure as a Service model of Cloud computing regarding income and power consumption objectives. In this model, customers have the choice between different service levels. Each service level is associated with a price per unit of job execution time, and a slack factor that determines the maximal time span to deliver the requested amount of computing resources. The system, via the scheduling algorithms, is responsible to guarantee the corresponding quality of service for all accepted jobs. Since we do not consider any optimistic scheduling approach, a job cannot be accepted if its service guarantee will not be observed assuming that all accepted jobs receive the requested resources. In this article, we analyze several scheduling algorithms with different cloud configurations and workloads, considering the maximization of the provider income and minimization of the total power consumption of a schedule. We distinguish algorithms depending on the type and amount of information they require: knowledge free, energy-aware, and speed-aware. First, to provide effective guidance in choosing a good strategy, we present a joint analysis of two conflicting goals based on the degradation in performance. The study addresses the behavior of each strategy under each metric. We assess the performance of different scheduling algorithms by determining a set of non-dominated solutions that approximate the Pareto optimal set. We use a set coverage metric to compare the scheduling algorithms in terms of Pareto dominance. We claim that a rather simple scheduling approach can provide the best energy and income trade-offs. This scheduling algorithm performs well in different scenarios with a variety of workloads and cloud configurations. 相似文献
13.
Jose Garcia-Rodriguez Sergio Orts-Escolano Anastassia Angelopoulou Alexandra Psarrou Jorge Azorin-Lopez Juan Manuel Garcia-Chamizo 《Journal of Real-Time Image Processing》2016,11(4):731-749
This work describes a neural network based architecture that represents and estimates object motion in videos. This architecture addresses multiple computer vision tasks such as image segmentation, object representation or characterization, motion analysis and tracking. The use of a neural network architecture allows for the simultaneous estimation of global and local motion and the representation of deformable objects. This architecture also avoids the problem of finding corresponding features while tracking moving objects. Due to the parallel nature of neural networks, the architecture has been implemented on GPUs that allows the system to meet a set of requirements such as: time constraints management, robustness, high processing speed and re-configurability. Experiments are presented that demonstrate the validity of our architecture to solve problems of mobile agents tracking and motion analysis. 相似文献
14.
15.
16.
Pflieger D Gonnet F de la Fuente van Bentem S Hirt H de la Fuente A 《Mass spectrometry reviews》2011,30(2):268-297
Proteomes are intricate. Typically, thousands of proteins interact through physical association and post-translational modifications (PTMs) to give rise to the emergent functions of cells. Understanding these functions requires one to study proteomes as "systems" rather than collections of individual protein molecules. The abstraction of the interacting proteome to "protein networks" has recently gained much attention, as networks are effective representations, that lose specific molecular details, but provide the ability to see the proteome as a whole. Mostly two aspects of the proteome have been represented by network models: proteome-wide physical protein-protein-binding interactions organized into Protein Interaction Networks (PINs), and proteome-wide PTM relations organized into Protein Signaling Networks (PSNs). Mass spectrometry (MS) techniques have been shown to be essential to reveal both of these aspects on a proteome-wide scale. Techniques such as affinity purification followed by MS have been used to elucidate protein-protein interactions, and MS-based quantitative phosphoproteomics is critical to understand the structure and dynamics of signaling through the proteome. We here review the current state-of-the-art MS-based analytical pipelines for the purpose to characterize proteome-scale networks. 相似文献
17.
18.
Marialucia Gallorini Viviana di Giacomo Valentina Di Valerio Monica Rapino Domenico Bosco Andrea Travan Mara Di Giulio Roberta Di Pietro Sergio Paoletti Amelia Cataldi Silvia Sancilio 《Journal of materials science. Materials in medicine》2016,27(12):186
Silver-based products have been proven to be effective in retarding and preventing bacterial growth since ancient times. In the field of restorative dentistry, the use of silver ions/nanoparticles has been explored to counteract bacterial infections, as silver can destroy bacterial cell walls by reacting with membrane proteins. However, it is also cytotoxic towards eukaryotic cells, which are capable of internalizing nanoparticles. In this work, we investigated the biological effects of Chitlac-nAg, a colloidal system based on a modified chitosan (Chitlac), administered for 24–48?h to a co-culture of primary human gingival fibroblasts and Streptococcus mitis in the presence of saliva, developed to mimic the microenvironment of the oral cavity. We sought to determine its efficiency to combat oral hygiene-related diseases without affecting eukaryotic cells. Cytotoxicity, reactive oxygen species production, apoptosis induction, nanoparticles uptake, and lysosome and autophagosome metabolism were evaluated. In vitro results show that Chitlac-nAg does not exert cytotoxic effects on human gingival fibroblasts, which seem to survive through a homoeostasis mechanism involving autophagy. That suggests that the novel biomaterial Chitlac-nAg could be a promising tool in the field of dentistry. 相似文献
19.
Exploring the power of shared memory communication objects and models, and the limits of distributed computability are among the most exciting research areas of distributed computing. In that spirit, this paper focuses on a problem that has received considerable interest since its introduction in 1987, namely the renaming problem. It was the first non-trivial problem known to be solvable in an asynchronous distributed system despite process failures. Many algorithms for renaming and variants of renaming have been proposed, and sophisticated lower bounds have been proved, that have been a source of new ideas of general interest to distributed computing. It has consequently acquired a paradigm status in distributed fault-tolerant computing.In the renaming problem, processes start with unique initial names taken from a large name space, then deciding new names such that no two processes decide the same new name and the new names are from a name space that is as small as possible.This paper presents an introduction to the renaming problem in shared memory systems, for non-expert readers. It describes both algorithms and lower bounds. Also, it discusses strong connections relating renaming and other important distributed problems such as set agreement and symmetry breaking. 相似文献
20.
Sergio S��nchez Garc��a Ana G��mez Oliva Emilia P��rez Belleboni Iv��n Pau de la Cruz 《International Journal of Information Security》2011,10(6):351-372
At present, many countries allow citizens or entities to interact with the government outside the telematic environment through
a legal representative who is granted powers of representation. However, if the interaction takes place through the Internet,
only primitive mechanisms of representation are available, and these are mainly based on non-dynamic offline processes that
do not enable quick and easy identity delegation. This paper proposes a system of dynamic delegation of identity between two
generic entities that can solve the problem of delegated access to the telematic services provided by public authorities.
The solution herein is based on the generation of a delegation token created from a proxy certificate that allows the delegating
entity to delegate identity to another on the basis of a subset of its attributes as delegator, while also establishing in
the delegation token itself restrictions on the services accessible to the delegated entity and the validity period of delegation.
Further, the paper presents the mechanisms needed to either revoke a delegation token or to check whether a delegation token
has been revoked. Implications for theory and practice and suggestions for future research are discussed. 相似文献