全文获取类型
收费全文 | 2690篇 |
免费 | 193篇 |
国内免费 | 27篇 |
专业分类
电工技术 | 52篇 |
综合类 | 12篇 |
化学工业 | 607篇 |
金属工艺 | 62篇 |
机械仪表 | 106篇 |
建筑科学 | 140篇 |
矿业工程 | 4篇 |
能源动力 | 182篇 |
轻工业 | 186篇 |
水利工程 | 44篇 |
石油天然气 | 27篇 |
无线电 | 252篇 |
一般工业技术 | 441篇 |
冶金工业 | 167篇 |
原子能技术 | 27篇 |
自动化技术 | 601篇 |
出版年
2024年 | 8篇 |
2023年 | 51篇 |
2022年 | 98篇 |
2021年 | 172篇 |
2020年 | 152篇 |
2019年 | 182篇 |
2018年 | 175篇 |
2017年 | 166篇 |
2016年 | 152篇 |
2015年 | 111篇 |
2014年 | 181篇 |
2013年 | 278篇 |
2012年 | 197篇 |
2011年 | 221篇 |
2010年 | 143篇 |
2009年 | 140篇 |
2008年 | 82篇 |
2007年 | 44篇 |
2006年 | 54篇 |
2005年 | 43篇 |
2004年 | 26篇 |
2003年 | 26篇 |
2002年 | 27篇 |
2001年 | 17篇 |
2000年 | 14篇 |
1999年 | 14篇 |
1998年 | 22篇 |
1997年 | 13篇 |
1996年 | 12篇 |
1995年 | 12篇 |
1994年 | 6篇 |
1993年 | 10篇 |
1991年 | 5篇 |
1990年 | 5篇 |
1987年 | 4篇 |
1986年 | 4篇 |
1985年 | 4篇 |
1984年 | 5篇 |
1983年 | 4篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1980年 | 2篇 |
1979年 | 2篇 |
1978年 | 4篇 |
1977年 | 5篇 |
1975年 | 6篇 |
1974年 | 1篇 |
1970年 | 1篇 |
1969年 | 1篇 |
1965年 | 1篇 |
排序方式: 共有2910条查询结果,搜索用时 15 毫秒
51.
Amir Yair Danilov Claudiu Dolev Danny Kirsch Jonathan Lane John Nita-Rotaru Cristina Olsen Josh Zage David 《Dependable and Secure Computing, IEEE Transactions on》2010,7(1):80-93
This paper presents the first hierarchical Byzantine fault-tolerant replication architecture suitable to systems that span multiple wide-area sites. The architecture confines the effects of any malicious replica to its local site, reduces message complexity of wide-area communication, and allows read-only queries to be performed locally within a site for the price of additional standard hardware. We present proofs that our algorithm provides safety and liveness properties. A prototype implementation is evaluated over several network topologies and is compared with a flat Byzantine fault-tolerant approach. The experimental results show considerable improvement over flat Byzantine replication algorithms, bringing the performance of Byzantine replication closer to existing benign fault-tolerant replication techniques over wide area networks. 相似文献
52.
53.
A resource investment problem with discounted cash flows (RIPDCF) is a project-scheduling problem in which (a) the availability levels of the resources are considered decision variables and (b) the goal is to find a schedule such that the net present value of the project cash flows optimizes. In this paper, the RIPDCF in which the activities are subject to generalized precedence relations is first modeled. Then, a genetic algorithm (GA) is proposed to solve this model. In addition, design of experiments and response surface methodology are employed to both tune the GA parameters and to evaluate the performance of the proposed method in 240 test problems. The results of the performance analysis show that the efficiency of the proposed GA method is relatively well. 相似文献
54.
Recommender systems are powerful tools that allow companies to present personalized offers to their customers and defined as a system which recommends an appropriate product or service after learning the customers’ preferences and desires. Extracting users’ preferences through their buying behavior and history of purchased products is the most important element of such systems. Due to users’ unlimited and unpredictable desires, identifying their preferences is very complicated process. In most researches, less attention has been paid to user’s preferences varieties in different product categories. This may decrease quality of recommended items. In this paper, we introduced a technique of recommendation in the context of online retail store which extracts user preferences in each product category separately and provides more personalized recommendations through employing product taxonomy, attributes of product categories, web usage mining and combination of two well-known filtering methods: collaborative and content-based filtering. Experimental results show that proposed technique improves quality, as compared to similar approaches. 相似文献
55.
Ghulam Muhammad Muhammad Hussain Muneer Al-Hammadi Hatim Aboalsamh Hassan Mathkour Amir Saeed Malik 《Behaviour & Information Technology》2016,35(11):958-967
ABSTRACTThe effect of 2D and 3D educational content learning on memory has been studied using electroencephalography (EEG) brain signal. A hypothesis is set that the 3D materials are better than the 2D materials for learning and memory recall. To test the hypothesis, we proposed a classification system that will predict true or false recall for short-term memory (STM) and long-term memory (LTM) after learning by either 2D or 3D educational contents. For this purpose, EEG brain signals are recorded during learning and testing; the signals are then analysed in the time domain using different types of features in various frequency bands. The features are then fed into a support vector machine (SVM)-based classifier. The experimental results indicate that the learning and memory recall using 2D and 3D contents do not have significant differences for both the STM and the LTM. 相似文献
56.
Alireza Shamsi Amir Shamloo Negar Mohammadaliha Hassan Hajghassem Jalil Fallah Mehrabadi Masoumeh Bazzaz 《Microsystem Technologies》2016,22(10):2447-2454
Since plasma is rich in many biomarkers used in clinical diagnostic experiments, microscale blood plasma separation is a primitive step in most of microfluidic analytical chips. In this paper, a passive microfluidic device for on-chip blood plasma separation based on Zweifach–Fung effect and plasma skimming was designed and fabricated by hot embossing of microchannels on a PMMA substrate and thermal bonding process. Human blood was diluted in various times and injected into the device. The main novelty of the proposed microfluidic device is the design of diffuser-shaped daughter channels. Our results demonstrated that this design exerted a considerable positive influence on the separation efficiency of the passive separator device, and the separation efficiency of 66.6 % was achieved. The optimum purity efficiency of 70 % was achieved for 1:100 dilution times. 相似文献
57.
This paper presents a new multi-stage genetic programming (MSGP) strategy for modeling nonlinear systems. The proposed strategy is based on incorporating the individual effect of predictor variables and the interactions among them to provide more accurate simulations. According to the MSGP strategy, an efficient formulation for a problem comprises different terms. In the first stage of the MSGP-based analysis, the output variable is formulated in terms of an influencing variable. Thereafter, the error between the actual and the predicted value is formulated in terms of a new variable. Finally, the interaction term is derived by formulating the difference between the actual values and the values predicted by the individually developed terms. The capabilities of MSGP are illustrated by applying it to the formulation of different complex engineering problems. The problems analyzed herein include the following: (i) simulation of pH neutralization process, (ii) prediction of surface roughness in end milling, and (iii) classification of soil liquefaction conditions. The validity of the proposed strategy is confirmed by applying the derived models to the parts of the experimental results that were not included in the analyses. Further, the external validation of the models is verified using several statistical criteria recommended by other researchers. The MSGP-based solutions are capable of effectively simulating the nonlinear behavior of the investigated systems. The results of MSGP are found to be more accurate than those of standard GP and artificial neural network-based models. 相似文献
58.
Policy-based Awareness Management (PAM): Case study of a wireless communication system at a hospital
Amir Talaei-KhoeiAuthor Vitae Terje SolvollAuthor VitaePradeep RayAuthor Vitae Nandan ParameshwaranAuthor Vitae 《Journal of Systems and Software》2011,84(10):1791-1805
The present paper evaluates the use of software agents to identify relevance of information, called awareness. This evaluation is based on existing policies and scenarios in the context of wireless communication of a hospital in Norway. The study is to address the lack of literature for experimental studies on a method to employ software agents for awareness identification. Research in computer supported cooperative work indicates the significant contributions of software agents to assist individuals. There are bodies of work that show awareness provides the means for software agents in which effective cooperation can take place. In addition, the role of the methods to identify awareness is emphasized in the literature of both computer supported cooperative work and software agents. This paper explains a step-wise process, called Policy-based Awareness Management, which allows agents to use policies as a source to identify awareness and thus change their behaviors accordingly. The contribution of this method is based on the concepts proposed by the logic of general awareness. The present study applies Directory Enabled Networks-next generation as the policy structure for the method. The paper evaluates the process via its application to identify the relevance of information in wireless communication scenarios in a hospital. The present study conducts observations, interviews and discussions on the wireless communication system of the hospital to identify the different scenarios happening in the system. The paper presents a set of simulations on these scenarios and concludes that the method is effective and cost-efficient. 相似文献
59.
Almost all subspace clustering algorithms proposed so far are designed for numeric datasets. In this paper, we present a k-means type clustering algorithm that finds clusters in data subspaces in mixed numeric and categorical datasets. In this method, we compute attributes contribution to different clusters. We propose a new cost function for a k-means type algorithm. One of the advantages of this algorithm is its complexity which is linear with respect to the number of the data points. This algorithm is also useful in describing the cluster formation in terms of attributes contribution to different clusters. The algorithm is tested on various synthetic and real datasets to show its effectiveness. The clustering results are explained by using attributes weights in the clusters. The clustering results are also compared with published results. 相似文献
60.
The biological function of proteins is dependent, to a large extent, on their native three dimensional conformation. Thus, it is important to know the structure of as many proteins as possible. Since experimental methods for structure determination are very tedious, there is a significant effort to calculate the structure of a protein from its linear sequence. Direct methods of calculating structure from sequence are not available yet. Thus, an indirect approach to predict the conformation of protein, called threading, is discussed. In this approach, known structures are used as constraints, to restrict the search for the native conformation. Threading requires finding good alignments between a sequence and a structure, which is a major computational challenge and a practical bottleneck in applying threading procedures. The Genetic Algorithm paradigm, an efficient search method that is based on evolutionary ideas, is used to perform sequence to structure alignments. A proper representation is discussed in which genetic operators can be effectively implemented. The algorithm performance is tested for a set of six sequence/structure pairs. The effects of changing operators and parameters are explored and analyzed. 相似文献