全文获取类型
收费全文 | 4383篇 |
免费 | 196篇 |
国内免费 | 4篇 |
专业分类
电工技术 | 47篇 |
综合类 | 4篇 |
化学工业 | 542篇 |
金属工艺 | 67篇 |
机械仪表 | 86篇 |
建筑科学 | 332篇 |
矿业工程 | 128篇 |
能源动力 | 258篇 |
轻工业 | 682篇 |
水利工程 | 50篇 |
石油天然气 | 237篇 |
无线电 | 120篇 |
一般工业技术 | 626篇 |
冶金工业 | 83篇 |
原子能技术 | 39篇 |
自动化技术 | 1282篇 |
出版年
2024年 | 11篇 |
2023年 | 140篇 |
2022年 | 50篇 |
2021年 | 157篇 |
2020年 | 160篇 |
2019年 | 123篇 |
2018年 | 115篇 |
2017年 | 201篇 |
2016年 | 281篇 |
2015年 | 255篇 |
2014年 | 298篇 |
2013年 | 203篇 |
2012年 | 96篇 |
2011年 | 102篇 |
2010年 | 113篇 |
2009年 | 152篇 |
2008年 | 41篇 |
2007年 | 113篇 |
2006年 | 101篇 |
2005年 | 129篇 |
2004年 | 77篇 |
2003年 | 116篇 |
2002年 | 151篇 |
2001年 | 149篇 |
2000年 | 76篇 |
1999年 | 125篇 |
1998年 | 80篇 |
1997年 | 60篇 |
1996年 | 67篇 |
1995年 | 66篇 |
1994年 | 63篇 |
1993年 | 37篇 |
1992年 | 40篇 |
1991年 | 35篇 |
1990年 | 46篇 |
1989年 | 30篇 |
1988年 | 77篇 |
1987年 | 137篇 |
1986年 | 142篇 |
1985年 | 33篇 |
1984年 | 35篇 |
1983年 | 18篇 |
1982年 | 18篇 |
1981年 | 17篇 |
1980年 | 13篇 |
1979年 | 11篇 |
1978年 | 10篇 |
1977年 | 8篇 |
1976年 | 4篇 |
1970年 | 1篇 |
排序方式: 共有4583条查询结果,搜索用时 15 毫秒
61.
J. Cucurull R. Martí G. Navarro-Arribas S. Robles B. Overeinder J. Borrell 《Computer Communications》2009,32(4):712-729
Mobile agents are autonomous software entities driven by a set of goals and tasks. Reactivity, social ability, autonomy, the ability to move to different network locations, and the weak agent notion of proactiveness, allow for autonomous processing of distributed information according to their environment (context awareness).Although agent mobility has been devised for homogeneous environments, deployment of agent mobility in heterogeneous environments has been hindered by the absence of a common set of interoperation rules and ontologies for different agent middlewares.In this article, an agent migration model based on the communication standards of the IEEE-FIPA organisation is proposed. The approach described encompasses the definition of several specifications to achieve interoperability in the migration process in heterogeneous environments.The model provides a basic and extensible common migration process, which is flexible enough to support different kinds of migration methods and future upgrades. It is completely independent of any specific middleware implementation. 相似文献
62.
As soon as the Intrusion Detection System (IDS) detects any suspicious activity, it will generate several alarms referring to as security breaches. Unfortunately, the triggered alarms usually are accompanied with huge number of false positives. In this paper, we use root cause analysis to discover the root causes making the IDS triggers these false alarms; most of these root causes are not attacks. Removing the root causes enhances alarms quality in the future. The root cause instigates the IDS to trigger alarms that almost always have similar features. These similar alarms can be clustered together; consequently, we have designed a new clustering technique to group IDS alarms and to produce clusters. Then, each cluster is modeled by a generalized alarm. The generalized alarms related to root causes are converted (by the security analyst) to filters in order to reduce future alarms’ load. The suggested system is a semi-automated system helping the security analyst in specifying the root causes behind these false alarms and in writing accurate filtering rules. The proposed clustering method was verified with three different datasets, and the averaged reduction ratio was about 74% of the total alarms. Application of the new technique to alarms log greatly helps the security analyst in identifying the root causes; and then reduces the alarm load in the future. 相似文献
63.
Qinghai Xiao Yunzhou Li Ming Zhao Shidong Zhou Jing Wang 《Computer Communications》2009,32(18):1914-1922
In this work, we consider a cognitive radio system with multiple primary channels and one secondary user, and then we introduce a channel-usage pattern model and some basic concepts in this system. Based on this system model and the basic concepts, we propose two opportunistic channel selection algorithms to optimize the throughput of the secondary user: minimum collision rate channel selection algorithm and minimum handoff rate channel selection algorithm. According to the two algorithms, we, respectively, present the channel selection scheme based on minimum collision rate algorithm (CSS-MCRA) and the channel selection scheme based on minimum handoff rate algorithm (CSS-MHRA) under the constraint that the collision probability is bounded below collision tolerable level. Theoretical analysis and simulation results both show that, on one hand, both CSS-MCRA scheme and CSS-MHRA can follow the constraint of collision tolerable level; on the other hand, the performance of CSS-MCRA scheme is better than that of CSS-MHRA scheme if handoff latency is zero or very low, while the performance of CSS-MHRA scheme is better than that of CSS-MCRA scheme if handoff latency is long enough. 相似文献
64.
65.
Several Grids have been established and used for varying science applications during the last years. Most of these Grids, however, work in isolation and with different utilisation levels. Previous work has introduced an architecture and a mechanism to enable resource sharing amongst Grids. It has demonstrated that there can be benefits for a Grid to offload requests or provide spare resources to another Grid. In this work, we address the problem of resource provisioning to Grid applications in multiple-Grid environments. The provisioning is carried out based on availability information obtained from queueing-based resource management systems deployed at the provider sites which are the participants of the Grids. We evaluate the performance of different allocation policies. In contrast to existing work on load sharing across Grids, the policies described here take into account the local load of resource providers, imprecise availability information and the compensation of providers for the resources offered to the Grid. In addition, we evaluate these policies along with a mechanism that allows resource sharing amongst Grids. Experimental results obtained through simulation show that the mechanism and policies are effective in redirecting requests thus improving the applications’ average weighted response time. 相似文献
66.
Assessment of software COTS components is an essential part of component-based software development. Poorly chosen components may lead to solutions of low quality and that are difficult to maintain. The assessment may be based on incomplete knowledge about the COTS component itself and other aspects (e.g. vendor’s credentials, etc.), which may affect the decision of selecting COTS component(s). We argue in favor of assessment methods in which uncertainty is explicitly represented (‘uncertainty explicit’ methods) using probability distributions. We provide details of a Bayesian model, which can be used to capture the uncertainties in the simultaneous assessment of two attributes, thus, also capturing the dependencies that might exist between them. We also provide empirical data from the use of this method for the assessment of off-the-shelf database servers which illustrate the advantages of ‘uncertainty explicit’ methods over conventional methods of COTS component assessment which assume that at the end of the assessment the values of the attributes become known with certainty. 相似文献
67.
In this paper, we propose a new approach to automatic discovery of implicit rhetorical information from texts based on evolutionary computation methods. In order to guide the search for rhetorical connections from natural-language texts, the model uses previously obtained training information which involves semantic and structural criteria. The main features of the model and new designed operators and evaluation functions are discussed, and the different experiments assessing the robustness and accuracy of the approach are described. Experimental results show the promise of evolutionary methods for rhetorical role discovery. 相似文献
68.
In this paper, we have proposed a new feature selection method called kernel F-score feature selection (KFFS) used as pre-processing step in the classification of medical datasets. KFFS consists of two phases. In the first phase, input spaces (features) of medical datasets have been transformed to kernel space by means of Linear (Lin) or Radial Basis Function (RBF) kernel functions. By this way, the dimensions of medical datasets have increased to high dimension feature space. In the second phase, the F-score values of medical datasets with high dimensional feature space have been calculated using F-score formula. And then the mean value of calculated F-scores has been computed. If the F-score value of any feature in medical datasets is bigger than this mean value, that feature will be selected. Otherwise, that feature is removed from feature space. Thanks to KFFS method, the irrelevant or redundant features are removed from high dimensional input feature space. The cause of using kernel functions transforms from non-linearly separable medical dataset to a linearly separable feature space. In this study, we have used the heart disease dataset, SPECT (Single Photon Emission Computed Tomography) images dataset, and Escherichia coli Promoter Gene Sequence dataset taken from UCI (University California, Irvine) machine learning database to test the performance of KFFS method. As classification algorithms, Least Square Support Vector Machine (LS-SVM) and Levenberg–Marquardt Artificial Neural Network have been used. As shown in the obtained results, the proposed feature selection method called KFFS is produced very promising results compared to F-score feature selection. 相似文献
69.
In this research multi-stage supply chain system which is controlled by kanban system, is evaluated. In kanban system, decision making is based on determination of the number of kanbans as well as batch sizes. This paper attempts to model supply chain system with regard to costs under just-in-time (JIT) production philosophy. Since adopted model is of mixed integer non-linear programming (MINLP) type and solving it by exact algorithm such as branch and bound (B&B) takes a lot of time, a heuristic method via Memetic algorithm (MA) is presented. Some problems are solved by our proposed MA to illustrate its performance. 相似文献
70.
We report on 3D printing of artifacts with a structured, inhomogeneous interior. The interior is decomposed into cells defined by a 3D Voronoi diagram and their sites. When printing such objects, most slices the printer deposits are topologically the same and change only locally in the interior. The slicing algorithm capitalizes on this coherence and minimizes print head moves that do not deposit material. This approach has been implemented on a client/server architecture that computes the slices on the geometry side. The slices are printed by fused deposition, and are communicated upon demand. 相似文献