全文获取类型
收费全文 | 9484篇 |
免费 | 732篇 |
国内免费 | 89篇 |
专业分类
电工技术 | 180篇 |
综合类 | 41篇 |
化学工业 | 2615篇 |
金属工艺 | 213篇 |
机械仪表 | 398篇 |
建筑科学 | 354篇 |
矿业工程 | 20篇 |
能源动力 | 616篇 |
轻工业 | 910篇 |
水利工程 | 190篇 |
石油天然气 | 140篇 |
武器工业 | 5篇 |
无线电 | 976篇 |
一般工业技术 | 1616篇 |
冶金工业 | 210篇 |
原子能技术 | 67篇 |
自动化技术 | 1754篇 |
出版年
2024年 | 40篇 |
2023年 | 191篇 |
2022年 | 347篇 |
2021年 | 612篇 |
2020年 | 550篇 |
2019年 | 680篇 |
2018年 | 775篇 |
2017年 | 732篇 |
2016年 | 725篇 |
2015年 | 433篇 |
2014年 | 712篇 |
2013年 | 1041篇 |
2012年 | 652篇 |
2011年 | 732篇 |
2010年 | 471篇 |
2009年 | 404篇 |
2008年 | 244篇 |
2007年 | 181篇 |
2006年 | 148篇 |
2005年 | 101篇 |
2004年 | 101篇 |
2003年 | 58篇 |
2002年 | 57篇 |
2001年 | 28篇 |
2000年 | 23篇 |
1999年 | 25篇 |
1998年 | 22篇 |
1997年 | 18篇 |
1996年 | 23篇 |
1995年 | 19篇 |
1994年 | 10篇 |
1993年 | 15篇 |
1992年 | 10篇 |
1991年 | 17篇 |
1990年 | 16篇 |
1989年 | 12篇 |
1988年 | 7篇 |
1987年 | 7篇 |
1986年 | 8篇 |
1985年 | 8篇 |
1984年 | 14篇 |
1983年 | 12篇 |
1982年 | 4篇 |
1981年 | 3篇 |
1980年 | 2篇 |
1979年 | 6篇 |
1978年 | 3篇 |
1977年 | 2篇 |
1973年 | 2篇 |
1967年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
Research on the robustness of fuzzy logic systems (FLSs), an imperative factor in the design process, is very limited in the literature. Specifically, when a system is subjected to small deviations of the sampling points (operating points), it is of great interest to find the maximum tolerance of the system, which we refer to as the system’s robustness. In this paper, we present a methodology for the robustness analysis of interval type-2 FLSs (IT2 FLSs) that also holds for T1 FLSs, hence, making it more general. A procedure for the design of robust IT2 FLSs with a guaranteed performance better than or equal to their T1 counterparts is then proposed. Several examples are performed to demonstrate the effectiveness of the proposed methodologies. It was concluded that both T1 and IT2 FLSs can be designed to achieve robust behavior in various applications, and preference one or the other, in general, is application-dependant. IT2 FLSs, having a more flexible structure than T1 FLSs, exhibited relatively small approximation errors in the several examples investigated. The methodologies presented in this paper lay the foundation for the design of FLSs with robust properties that will be very useful in many practical modeling and control applications. 相似文献
92.
Sudip Misra Manikonda Pavan Kumar Mohammad S. Obaidat 《Computer Communications》2011,34(12):1484-1496
Efficient network coverage and connectivity are the requisites for most Wireless Sensor Network (WSN) deployments, particularly those concerned with area monitoring. Due to the resource constraints of the sensor nodes, redundancy of coverage area must be reduced for effective utilization of the available resources. If two nodes have the same coverage area in their active state, and if both the nodes are activated simultaneously, it leads to redundancy in network and wastage of precious sensor resources. In this paper, we address the problem of network coverage and connectivity and propose an efficient solution to maintain coverage, while preserving the connectivity of the network. The proposed solution aims to cover the area of interest (AOI), while minimizing the count of the active sensor nodes. The overlap region of two sensor nodes varies with the distance between the nodes. If the distance between two sensor nodes is maximized, the overall coverage area of these nodes will also be maximized. Also, to preserve the connectivity of the network, each sensor node must be in the communication range of at least one other node. Results of simulation of the proposed solution indicate up to 95% coverage of the area, while consuming very less energy of 9.44 J per unit time in the network, simulated in an area of 2500 m2. 相似文献
93.
Mohammad Al Hasan Saeed Salem Mohammed J. Zaki 《Knowledge and Information Systems》2011,28(3):665-685
Clustering algorithms generally accept a parameter k from the user, which determines the number of clusters sought. However, in many application domains, like document categorization,
social network clustering, and frequent pattern summarization, the proper value of k is difficult to guess. An alternative clustering formulation that does not require k is to impose a lower bound on the similarity between an object and its corresponding cluster representative. Such a formulation chooses exactly one representative for
every cluster and minimizes the representative count. It has many additional benefits. For instance, it supports overlapping
clusters in a natural way. Moreover, for every cluster, it selects a representative object, which can be effectively used
in summarization or semi-supervised classification task. In this work, we propose an algorithm, SimClus, for clustering with lower bound on similarity. It achieves a O(log n) approximation bound on the number of clusters, whereas for the best previous algorithm the bound can be as poor as O(n). Experiments on real and synthetic data sets show that our algorithm produces more than 40% fewer representative objects,
yet offers the same or better clustering quality. We also propose a dynamic variant of the algorithm, which can be effectively
used in an on-line setting. 相似文献
94.
This paper presents a symbolic formalism for modeling and retrieving video data via the moving objects contained in the video images. The model integrates the representations of individual moving objects in a scene with the time-varying relationships between them by incorporating both the notions of object tracks and temporal sequences of PIRs (projection interval relationships). The model is supported by a set of operations which form the basis of a moving object algebra. This algebra allows one to retrieve scenes and information from scenes by specifying both spatial and temporal properties of the objects involved. It also provides operations to create new scenes from existing ones. A prototype implementation is described which allows queries to be specified either via an animation sketch or using the moving object algebra. 相似文献
95.
A number of studies have focused on the design of continuous media, CM, (e.g., video and audio) servers to support the real-time delivery of CM objects. These systems have been deployed in local environments such as hotels, hospitals and cruise ships to support media-on-demand applications. They typically stream CM objects to the clients with the objective of minimizing the buffer space required at the client site. This objective can now be relaxed due to the availability of inexpensive storage devices at the client side. Therefore, we propose a Super-streaming paradigm that can utilize the client side resources in order to improve the utilization of the CM server. To support super-streaming, we propose a technique to enable the CM servers to deliver CM objects at a rate higher than their display bandwidth requirement. We also propose alternative admission control policies to downgrade super-streams in favor of regular streams when the resources are scarce. We demonstrate the superiority of our paradigm over streaming with both analytical and simulation models.Moreover, new distributed applications such as distant-learning, digital libraries, and home entertainment require the delivery of CM objects to geographically disbursed clients. For quality purposes, recently many studies proposed dedicated distributed architectures to support these types of applications. We extend our super-streaming paradigm to be applicable in such distributed architectures. We propose a sophisticated resource management policy to support super-streaming in the presence of multiple servers, network links and clients. Due to the complexity involved in modeling these architectures, we only evaluate the performance of super-streaming by a simulation study. 相似文献
96.
Using fluorescence in situ hybridization technique, expression of three oncogenes, C-myc, RARa, and cyclin-D was tested on a uterine leiomyoma. C-myc and RARa were amplified in approximately 30% and 90% of the cells, respectively. Numerous small signals of C-myc were indicative of the presence of double minutes. Amplification of RARa is being reported for the first time in a leiomyoma. Cyclin-D was normal in diploid cells while it was highly amplified in polyploid cells. Low levels of amplified C-myc and cyclin-D cells seem to be the reason for this tumor to be benign, while RARa could not be effective without the association of some other gene such as PML. Information presented here are significant toward developing new curative strategies such as gene-specific drugs and molecular manipulation to stop the activity of cancer gene. Further study may elucidate that how fibroids grow and maintain their rare benign nature. 相似文献
97.
Hamidreza Zoraghein Ali A. Alesheikh Abbas Alimohammadi Mohammad H. Vahidnia 《Computers, Environment and Urban Systems》2012
Indicator Kriging (IK) is a geostatistical method that uses observation points to quantify the probabilities at which a set of thresholds are exceeded at unmeasured points. To improve IK accuracy, the interpolation process should consider its uncertainty sources. By doing this, we also maintain its ability to provide the conditional cumulative distribution function (ccdf), which is a reliable measure of local uncertainty. This study modeled two IK uncertainty sources, i.e., measurement errors attached to observation points and subjective threshold choices. Soft Indicator Kriging (SIK), which uses a soft transformation for observation points, considers the measurement errors of these two sources. To select the thresholds objectively, a genetic algorithm (GA) was performed to obtain the optimum set of thresholds related to an objective function, which minimized the mean absolute error (MAE). 相似文献
98.
Ata Allah Taleizadeh Seyed Taghi Akhavan Niaki Seyed Mohammad Haji Seyedjavadi 《Journal of Manufacturing Systems》2012
In this paper, a multiproduct inventory control problem is considered in which the periods between two replenishments of the products are assumed independent random variables, and increasing and decreasing functions are assumed to model the dynamic demands of each product. Furthermore, the quantities of the orders are assumed integer-type, space and budget are constraints, the service-level is a chance-constraint, and that the partial back-ordering policy is taken into account for the shortages. The costs of the problem are holding, purchasing, and shortage. We show the model of this problem is an integer nonlinear programming type and to solve it, a harmony search approach is used. At the end, three numerical examples of different sizes are given to demonstrate the applicability of the proposed methodology in real world inventory control problems, to validate the results obtained, and to compare its performances with the ones of both a genetic and a particle swarm optimization algorithms. 相似文献
99.
We present an optimal solution procedure for minimizing total weighted resource tardiness penalty costs in the resource-constrained project scheduling problem. In this problem, we assume the constrained renewable resources are limited to very expensive equipments and machines that are used in other projects and are not available in all periods of time of a project. In other words, for each resource, there is a dictated ready date as well as a due date such that no resource can be available before its ready date but the resources are permitted to be used after their due dates by paying penalty cost depending on the resource type. We also assume that only one unit of each resource type is available and no activity needs more than it for execution. The objective is to determine a schedule with minimal total weighted resource tardiness penalty costs. For this purpose, we present a branch-and-bound algorithm in which the branching scheme starts from a graph representing a set of conjunctions (the classical finish-start precedence constraints) and disjunctions (introduced by the resource constraints). In the search tree, each node is branched to two child nodes based on the two opposite directions of each undirected arc of disjunctions. Selection sequence of undirected arcs in the search tree affects the performance of the algorithm. Hence, we developed different rules for this issue and compare the performance of the algorithm under these rules using a randomly generated benchmark problem set. 相似文献
100.
A new unsupervised feature selection method for text clustering based on genetic algorithms 总被引:1,自引:0,他引:1
Pirooz Shamsinejadbabki Mohammad Saraee 《Journal of Intelligent Information Systems》2012,38(3):669-684
Nowadays a vast amount of textual information is collected and stored in various databases around the world, including the Internet as the largest database of all. This rapidly increasing growth of published text means that even the most avid reader cannot hope to keep up with all the reading in a field and consequently the nuggets of insight or new knowledge are at risk of languishing undiscovered in the literature. Text mining offers a solution to this problem by replacing or supplementing the human reader with automatic systems undeterred by the text explosion. It involves analyzing a large collection of documents to discover previously unknown information. Text clustering is one of the most important areas in text mining, which includes text preprocessing, dimension reduction by selecting some terms (features) and finally clustering using selected terms. Feature selection appears to be the most important step in the process. Conventional unsupervised feature selection methods define a measure of the discriminating power of terms to select proper terms from corpus. However up to now the valuation of terms in groups has not been investigated in reported works. In this paper a new and robust unsupervised feature selection approach is proposed that evaluates terms in groups. In addition a new Modified Term Variance measuring method is proposed for evaluating groups of terms. Furthermore a genetic based algorithm is designed and implemented for finding the most valuable groups of terms based on the new measure. These terms then will be utilized to generate the final feature vector for the clustering process . In order to evaluate and justify our approach the proposed method and also a conventional term variance method are implemented and tested using corpus collection Reuters-21578. For a more accurate comparison, methods have been tested on three corpuses and for each corpus clustering task has been done ten times and results are averaged. Results of comparing these two methods are very promising and show that our method produces better average accuracy and F1-measure than the conventional term variance method. 相似文献