全文获取类型
收费全文 | 164677篇 |
免费 | 10558篇 |
国内免费 | 5209篇 |
专业分类
电工技术 | 7213篇 |
技术理论 | 12篇 |
综合类 | 8361篇 |
化学工业 | 25627篇 |
金属工艺 | 7060篇 |
机械仪表 | 8376篇 |
建筑科学 | 10525篇 |
矿业工程 | 3649篇 |
能源动力 | 3951篇 |
轻工业 | 9658篇 |
水利工程 | 2768篇 |
石油天然气 | 6137篇 |
武器工业 | 786篇 |
无线电 | 16291篇 |
一般工业技术 | 18813篇 |
冶金工业 | 27779篇 |
原子能技术 | 1460篇 |
自动化技术 | 21978篇 |
出版年
2024年 | 529篇 |
2023年 | 2042篇 |
2022年 | 3388篇 |
2021年 | 4626篇 |
2020年 | 3428篇 |
2019年 | 3035篇 |
2018年 | 3721篇 |
2017年 | 4322篇 |
2016年 | 4437篇 |
2015年 | 5165篇 |
2014年 | 6248篇 |
2013年 | 7714篇 |
2012年 | 9716篇 |
2011年 | 10279篇 |
2010年 | 7802篇 |
2009年 | 7526篇 |
2008年 | 7068篇 |
2007年 | 6902篇 |
2006年 | 7041篇 |
2005年 | 9028篇 |
2004年 | 6556篇 |
2003年 | 5981篇 |
2002年 | 4970篇 |
2001年 | 4440篇 |
2000年 | 3600篇 |
1999年 | 4004篇 |
1998年 | 9053篇 |
1997年 | 6112篇 |
1996年 | 4590篇 |
1995年 | 3219篇 |
1994年 | 2538篇 |
1993年 | 2143篇 |
1992年 | 1056篇 |
1991年 | 980篇 |
1990年 | 798篇 |
1989年 | 716篇 |
1988年 | 666篇 |
1987年 | 428篇 |
1986年 | 391篇 |
1985年 | 299篇 |
1984年 | 177篇 |
1983年 | 149篇 |
1982年 | 202篇 |
1981年 | 238篇 |
1980年 | 251篇 |
1979年 | 100篇 |
1978年 | 115篇 |
1977年 | 647篇 |
1976年 | 1339篇 |
1975年 | 115篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
G. Diepen J. M. van?den Akker J. A. Hoogeveen J. W. Smeltink 《Journal of Scheduling》2012,15(6):703-715
In this paper we investigate the gate assignment problem as it appears at Amsterdam Airport Schiphol (AAS). Currently, the gate planners spend many hours on adjusting the automatically generated planning during the day of operation to make it proof against small deviations from the schedule. To alleviate this problem, we aim at finding a robust solution, given the planned arrivals and departures for the next day. We present a completely new integer linear programming formulation that is based on so-called gate plans. Each gate plan consists of a subset of the flights that can be assigned to a single gate of the corresponding type; gates with identical characteristics are aggregated in gate types. The gate assignment problem then boils down to selecting the best subset of gate plans such that each flight belongs to one selected gate plan, and such that the number of selected gate plans for a certain type of gate is equal to the number of gates of this type. In the first phase, we solve the LP-relaxation through column generation, and we describe specific features to find a very good solution to the ILP quickly. This solution is then handed to the planners at AAS in order to assign gate plans to physical gates. This consists of a number of relatively small problems that can be solved by hand and in which additional operational constraints can be incorporated. We also present the possibility of directly assigning flights to physical gates using the column generation formulation, where we then take into account other criteria as well. Computational results with real-life data provided by AAS are promising and indicate that the algorithm is able to solve real-life instances within rather small running times. 相似文献
992.
993.
Extreme learning machine for regression and multiclass classification 总被引:13,自引:0,他引:13
Huang GB Zhou H Ding X Zhang R 《IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics》2012,42(2):513-529
Due to the simplicity of their implementations, least square support vector machine (LS-SVM) and proximal support vector machine (PSVM) have been widely used in binary classification applications. The conventional LS-SVM and PSVM cannot be used in regression and multiclass classification applications directly, although variants of LS-SVM and PSVM have been proposed to handle such cases. This paper shows that both LS-SVM and PSVM can be simplified further and a unified learning framework of LS-SVM, PSVM, and other regularization algorithms referred to extreme learning machine (ELM) can be built. ELM works for the "generalized" single-hidden-layer feedforward networks (SLFNs), but the hidden layer (or called feature mapping) in ELM need not be tuned. Such SLFNs include but are not limited to SVM, polynomial network, and the conventional feedforward neural networks. This paper shows the following: 1) ELM provides a unified learning platform with a widespread type of feature mappings and can be applied in regression and multiclass classification applications directly; 2) from the optimization method point of view, ELM has milder optimization constraints compared to LS-SVM and PSVM; 3) in theory, compared to ELM, LS-SVM and PSVM achieve suboptimal solutions and require higher computational complexity; and 4) in theory, ELM can approximate any target continuous function and classify any disjoint regions. As verified by the simulation results, ELM tends to have better scalability and achieve similar (for regression and binary class cases) or much better (for multiclass cases) generalization performance at much faster learning speed (up to thousands times) than traditional SVM and LS-SVM. 相似文献
994.
?erif Bahtiyar Mehmet Ufuk Ça?layan 《Journal of Network and Computer Applications》2012,35(1):480-490
The issue of trust is a research problem in emerging open environments, such as ubiquitous networks. Such environments are highly dynamic and they contain diverse number of services and autonomous entities. Entities in open environments have different security needs from services. Trust computations related to the security systems of services necessitate information that meets needs of each entity. Obtaining such information is a challenging issue for entities. In this paper, we propose a model for extracting trust information from the security system of a service based on the needs of an entity. We formally represent security policies and security systems to extract trust information according to needs of an entity. The formal representation ensures an entity to extract trust information about a security property of a service and trust information about whole security system of the service. The proposed model is applied to Dental Clinic Patient Service as a case study with two scenarios. The scenarios are analyzed experimentally with simulations. The experimental evaluation shows that the proposed model provides trust information related to the security system of a service based on the needs of an entity and it is applicable in emerging open environments. 相似文献
995.
Register allocation for write activity minimization on non-volatile main memory for embedded systems
Yazhi Huang Author VitaeTiantian Liu Author Vitae Chun Jason XueAuthor Vitae 《Journal of Systems Architecture》2012,58(1):13-23
Non-volatile memories are good candidates for DRAM replacement as main memory in embedded systems and they have many desirable characteristics. Nevertheless, the disadvantages of non-volatile memory co-exist with its advantages. First, the lifetime of some of the non-volatile memories is limited by the number of erase operations. Second, read and write operations have asymmetric speed or power consumption in non-volatile memory. This paper focuses on the embedded systems using non-volatile memory as main memory. We propose register allocation technique with re-computation to reduce the number of store instructions. When non-volatile memory is applied as the main memory, reducing store instructions will reduce write activities on non-volatile memory. To re-compute the spills effectively during register allocation, a novel potential spill selection strategy is proposed. During this process, live range splitting is utilized to split certain long live ranges such that they are more likely to be assigned into registers. In addition, techniques for re-computation overhead reduction is proposed on systems with multiple functional units. With the proposed approach, the lifetime of non-volatile memory is extended accordingly. The experimental results demonstrate that the proposed technique can efficiently reduce the number of store instructions on systems with non-volatile memory by 33% on average. 相似文献
996.
Network regression with predictive clustering trees 总被引:1,自引:1,他引:0
Daniela Stojanova Michelangelo Ceci Annalisa Appice Sa?o D?eroski 《Data mining and knowledge discovery》2012,25(2):378-413
Network data describe entities represented by nodes, which may be connected with (related to) each other by edges. Many network datasets are characterized by a form of autocorrelation, where the value of a variable at a given node depends on the values of variables at the nodes it is connected with. This phenomenon is a direct violation of the assumption that data are independently and identically distributed. At the same time, it offers an unique opportunity to improve the performance of predictive models on network data, as inferences about one entity can be used to improve inferences about related entities. Regression inference in network data is a challenging task. While many approaches for network classification exist, there are very few approaches for network regression. In this paper, we propose a data mining algorithm, called NCLUS, that explicitly considers autocorrelation when building regression models from network data. The algorithm is based on the concept of predictive clustering trees (PCTs) that can be used for clustering, prediction and multi-target prediction, including multi-target regression and multi-target classification. We evaluate our approach on several real world problems of network regression, coming from the areas of social and spatial networks. Empirical results show that our algorithm performs better than PCTs learned by completely disregarding network information, as well as PCTs that are tailored for spatial data, but do not take autocorrelation into account, and a variety of other existing approaches. 相似文献
997.
A major task of a Web GIS (Geographic Information Systems) system is to transfer map data to client applications over the
Internet, which may be too costly. To improve this inefficient process, various solutions are available. Caching the responses
of the requests on the client side is the most commonly implemented solution. However, this method may not be adequate by
itself. Besides caching the responses, predicting the next possible requests from a client and updating the cache with responses
for those requests together provide a remarkable performance improvement. This procedure is called “prefetching” and makes
caching mechanisms more effective and efficient. This paper proposes an efficient prefetching algorithm called Retrospective
Adaptive Prefetch (RAP), which is constructed over a heuristic method that considers the former actions of a given user. The
algorithm reduces the user-perceived response time and improves user navigation efficiency. Additionally, it adjusts the cache
size automatically, based on the memory size of the client’s machine. RAP is compared with four other prefetching algorithms.
The experiments show that RAP provides better performance enhancements than the other methods. 相似文献
998.
Monique Jackson Ines Benkhemis Micka?l Begon Philippe Sardain Claude Vallée Patrick Lacouture 《Multibody System Dynamics》2012,28(3):225-237
Optimal synthesis of human movement or the prediction of the kinematics of a new movement require not only that the multi-body system be modeled but also that a performance criterion is specified. For sub-maximal movements the selection of a suitable performance criterion, able to generate realistic dynamic behavior is difficult. A two-dimensional simulation model of the take-off phase of a sub-maximal long jump was developed to study the effect of criterion choice on the realism of simulated movements. A parametric optimization technique was employed to obtain solutions to the constrained equations of motion. Seven different criteria were evaluated, by comparing simulated movements with an actual performance, to identify the criterion which most closely approximated that spontaneously minimized by the athlete. Synthesis of the take-off phase of a sub-maximal long jump was found to be sensitive to the chosen criterion, with a criterion based on minimizing joint intersegmental forces found to perform well. 相似文献
999.
1000.
Gennaro?Della?Vecchia Luigi?GalloEmail author Massimo?Esposito Antonio?Coronato 《Multimedia Tools and Applications》2012,59(1):341-362
In healthcare facilities most of the daily activities require strict coordination between clinicians, who often operate under
heavy workloads and minimal workforce conditions in environments filled with increasingly complex technology. Ubiquitous Computing
applications constitute a suitable solution for both reducing medical costs and improving patient safety by better supporting
clinical processes. In this study we introduce an intelligent infrastructure for smart hospitals which implements basic services
to optimize medical staff/patient interactions and grants ubiquitous and transparent access to clinical data stored in standard
clinical databases. This infrastructure relies on the integration of Radio Frequency IDentification (RFID) and photosensor
technologies to identify, locate and track clinicians and patients equipped with mobile devices and wearable RFID tags. 相似文献