全文获取类型
收费全文 | 889篇 |
免费 | 67篇 |
国内免费 | 13篇 |
专业分类
电工技术 | 24篇 |
综合类 | 5篇 |
化学工业 | 216篇 |
金属工艺 | 14篇 |
机械仪表 | 15篇 |
建筑科学 | 24篇 |
矿业工程 | 5篇 |
能源动力 | 72篇 |
轻工业 | 56篇 |
水利工程 | 5篇 |
石油天然气 | 3篇 |
无线电 | 113篇 |
一般工业技术 | 221篇 |
冶金工业 | 31篇 |
原子能技术 | 7篇 |
自动化技术 | 158篇 |
出版年
2024年 | 4篇 |
2023年 | 21篇 |
2022年 | 47篇 |
2021年 | 63篇 |
2020年 | 42篇 |
2019年 | 37篇 |
2018年 | 58篇 |
2017年 | 43篇 |
2016年 | 51篇 |
2015年 | 32篇 |
2014年 | 58篇 |
2013年 | 81篇 |
2012年 | 49篇 |
2011年 | 62篇 |
2010年 | 45篇 |
2009年 | 35篇 |
2008年 | 37篇 |
2007年 | 42篇 |
2006年 | 25篇 |
2005年 | 21篇 |
2004年 | 18篇 |
2003年 | 20篇 |
2002年 | 12篇 |
2001年 | 8篇 |
2000年 | 6篇 |
1999年 | 6篇 |
1998年 | 5篇 |
1997年 | 3篇 |
1996年 | 6篇 |
1995年 | 4篇 |
1994年 | 2篇 |
1993年 | 5篇 |
1992年 | 3篇 |
1991年 | 3篇 |
1990年 | 2篇 |
1989年 | 1篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1984年 | 4篇 |
1983年 | 3篇 |
1982年 | 1篇 |
1978年 | 1篇 |
排序方式: 共有969条查询结果,搜索用时 15 毫秒
31.
Murugappan Elango Subramanian Nachiappan Manoj Kumar Tiwari 《Expert systems with applications》2011,38(6):6486-6491
This paper aims to solve the balanced multi-robot task allocation problem. Multi-robot systems are becoming more and more significant in industrial, commercial and scientific applications. Effectively allocating tasks to multi-robots i.e. utilizing all robots in a cost effective manner becomes a tedious process. The current attempts made by the researchers concentrate only on minimizing the distance between the robots and the tasks, and not much importance is given to the balancing of work loads among robots. It is also found from the literature that the multi-robot system is analogous to Multiple Travelling Salesman Problem (MTSP). This paper attempts to develop mechanism to address the above two issues with objective of minimizing the distance travelled by ‘m’ robots and balancing the work load between ‘m’ robots equally. The proposed approach has two fold, first develops a mathematical model for balanced multi-robot task allocation problem, and secondly proposes a methodology to solve the model in three stages. Stage I groups the ‘N’ tasks into ‘n’ clusters of tasks using K-means clustering technique with the objective of minimizing the distance between the tasks, stage II calculates the travel cost of robot and clusters combination, stage III allocates the robot to the clusters in order to utilise all robot in a cost effective manner. 相似文献
32.
Nonpolynomial quintic spline functions are used to develop a numerical algorithm for computing an approximation to the solution of a system of second order boundary value problems associated with heat transfer. We show that the approximate solutions obtained by our algorithm are better than those produced by other spline and domain decomposition methods. A comparison of our algorithm with nonpolynomial quadratic spline method is discussed with the help of two numerical examples. 相似文献
33.
Many mal-practices in stock market trading—e.g., circular trading and price manipulation—use the modus operandi of collusion. Informally, a set of traders is a candidate collusion set when they have “heavy trading” among themselves, as compared to their trading with others. We formalize the problem of detection of collusion sets, if any, in the given trading database. We show that naïve approaches are inefficient for real-life situations. We adapt and apply two well-known graph clustering algorithms for this problem. We also propose a new graph clustering algorithm, specifically tailored for detecting collusion sets. A novel feature of our approach is the use of Dempster–Schafer theory of evidence to combine the candidate collusion sets detected by individual algorithms. Treating individual experiments as evidence, this approach allows us to quantify the confidence (or belief) in the candidate collusion sets. We present detailed simulation experiments to demonstrate effectiveness of the proposed algorithms. 相似文献
34.
The sudden and accidental water pollution response system (SAWPRS) for Yangtze River in central China required to develop a hydrodynamic and transport model, which is readily available and capable of simulating a large river system within GIS environment. This study facilitates such effort by developing a parallel computing method based on digital elevation model (DEM) using overlapping domain decomposition approach (ODDA) and message passing interface (MPI) protocol. The hydrodynamic and transport model was redesigned using finite volume method for hydrodynamic and transport model dispersion, the SIMPLEC method for solving the flow field, and the pressure weighted interpolating method for the flow field modification. This modelling approach was verified in two experiments using different sets of computer clusters. The model output was evaluated against the measured data collected for the year 1998 for Wanzhou, an upstream river segment of Yangtze River. The relative error was found to be less than 10%. The performance of parallel computation was found excellent as evident from the cost efficiency values greater than 0.81 in both experiments and increased computation speed while increasing the number of computer clusters. Overall, the parallel computing modelling system developed here was found to meet all requirements of SAWPRS. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献
35.
Manoj Thulasidas Cuntai Guan Jiankang Wu 《IEEE transactions on neural systems and rehabilitation engineering》2006,14(1):24-29
We report the implementation of a text input application (speller) based on the P300 event related potential. We obtain high accuracies by using an SVM classifier and a novel feature. These techniques enable us to maintain fast performance without sacrificing the accuracy, thus making the speller usable in an online mode. In order to further improve the usability, we perform various studies on the data with a view to minimizing the training time required. We present data collected from nine healthy subjects, along with the high accuracies (of the order of 95% or more) measured online. We show that the training time can be further reduced by a factor of two from its current value of about 20 min. High accuracy, fast learning, and online performance make this P300 speller a potential communication tool for severely disabled individuals, who have lost all other means of communication and are otherwise cut off from the world, provided their disability does not interfere with the performance of the speller. 相似文献
36.
Knowledge representation using fuzzy Petri nets-revisited 总被引:1,自引:0,他引:1
Manoj T.V. Leena J. Soney R.B. 《Knowledge and Data Engineering, IEEE Transactions on》1998,10(4):666-667
In the paper by S. Chen et al. (see ibid., vol.2, no.3, p.311-19, 1990), the authors proposed an algorithm which determines whether there exists an antecedent-consequence relationship from a fuzzy proposition d s to proposition dj and if the degree of truth of proposition ds is given, then the degree of truth of proposition dj can be evaluated. The fuzzy reasoning algorithm proposed by S. Chen et al. (1990) was found not to be working with all types of data. We propose: (1) a modified form of the algorithm, and (2) a concept of hierarchical fuzzy Petri nets for data abstraction 相似文献
37.
38.
Singh Siddharth Rathore Vivek Singh Singh Rajiv Singh Manoj Kumar 《Multimedia Tools and Applications》2017,76(18):19113-19137
Multimedia Tools and Applications - Image watermarking in wavelet domain has been found useful for copyright protection and rightful ownership. Classical wavelet transforms, like discrete wavelet... 相似文献
39.
40.
The design of a complex embedded control system involves integration of large number of components. These components need to interact in a timely fashion to achieve the system level end-to-end requirements. In practice, the component level timing specification consists of design attributes like component task mapping, task period and schedule definition but often lack details on their real-time (functional) requirements. As we observe, there is no systematic methodology in place for decomposing the feature level timing requirements into component level timing requirements. This paper proposes an early stage time-budgeting methodology to bridge the above gap. A salient proposal of this methodology is to consider parameterized component timing-requirements. A key step in the methodology involves computing a set of constraints by relating component requirements with feature requirements. This enables the separation of timing constraints from functionality decomposition, and facilitates early optimization of the component time-budget for a complex component based embedded system. This paper formalizes the proposed methodology by using Parametric Temporal Logic. A case study involving two advanced features from the automotive domain, namely Adaptive Cruise Control and Collision Mitigation is given to demonstrate the methodology. 相似文献