全文获取类型
收费全文 | 6893篇 |
免费 | 204篇 |
国内免费 | 27篇 |
专业分类
电工技术 | 104篇 |
综合类 | 2篇 |
化学工业 | 1415篇 |
金属工艺 | 284篇 |
机械仪表 | 184篇 |
建筑科学 | 105篇 |
矿业工程 | 8篇 |
能源动力 | 311篇 |
轻工业 | 268篇 |
水利工程 | 56篇 |
石油天然气 | 14篇 |
无线电 | 979篇 |
一般工业技术 | 1493篇 |
冶金工业 | 861篇 |
原子能技术 | 72篇 |
自动化技术 | 968篇 |
出版年
2023年 | 70篇 |
2022年 | 141篇 |
2021年 | 173篇 |
2020年 | 155篇 |
2019年 | 145篇 |
2018年 | 230篇 |
2017年 | 188篇 |
2016年 | 194篇 |
2015年 | 108篇 |
2014年 | 209篇 |
2013年 | 399篇 |
2012年 | 222篇 |
2011年 | 303篇 |
2010年 | 232篇 |
2009年 | 276篇 |
2008年 | 245篇 |
2007年 | 199篇 |
2006年 | 207篇 |
2005年 | 153篇 |
2004年 | 127篇 |
2003年 | 129篇 |
2002年 | 129篇 |
2001年 | 126篇 |
2000年 | 129篇 |
1999年 | 112篇 |
1998年 | 264篇 |
1997年 | 182篇 |
1996年 | 131篇 |
1995年 | 130篇 |
1994年 | 104篇 |
1993年 | 133篇 |
1992年 | 108篇 |
1991年 | 97篇 |
1990年 | 84篇 |
1989年 | 75篇 |
1988年 | 72篇 |
1987年 | 75篇 |
1986年 | 88篇 |
1985年 | 106篇 |
1984年 | 99篇 |
1983年 | 95篇 |
1982年 | 78篇 |
1981年 | 63篇 |
1980年 | 49篇 |
1979年 | 46篇 |
1978年 | 49篇 |
1977年 | 62篇 |
1976年 | 82篇 |
1975年 | 43篇 |
1973年 | 42篇 |
排序方式: 共有7124条查询结果,搜索用时 15 毫秒
101.
102.
Both unit and integration testing are incredibly crucial for almost any software application because each of them operates a distinct process to examine the product. Due to resource constraints, when software is subjected to modifications, the drastic increase in the count of test cases forces the testers to opt for a test optimization strategy. One such strategy is test case prioritization (TCP). Existing works have propounded various methodologies that re-order the system-level test cases intending to boost either the fault detection capabilities or the coverage efficacy at the earliest. Nonetheless, singularity in objective functions and the lack of dissimilitude among the re-ordered test sequences have degraded the cogency of their approaches. Considering such gaps and scenarios when the meteoric and continuous updations in the software make the intensive unit and integration testing process more fragile, this study has introduced a memetics-inspired methodology for TCP. The proposed structure is first embedded with diverse parameters, and then traditional steps of the shuffled-frog-leaping approach (SFLA) are followed to prioritize the test cases at unit and integration levels. On 5 standard test functions, a comparative analysis is conducted between the established algorithms and the proposed approach, where the latter enhances the coverage rate and fault detection of re-ordered test sets. Investigation results related to the mean average percentage of fault detection (APFD) confirmed that the proposed approach exceeds the memetic, basic multi-walk, PSO, and optimized multi-walk by 21.7%, 13.99%, 12.24%, and 11.51%, respectively. 相似文献
103.
PVC-Based 2,2,2-Cryptand Sensor for Zinc Ions 总被引:1,自引:0,他引:1
A PVC-based membrane of 2,2,2-cryptand exhibits a very good response for Zn(2+) in a wide concentration range (from 2.06 ppm to 6.54 × 10(3) ppm) with a slope of 22.0 mV/decade of Zn(2+) concentration. The response time of the sensor is <10 s, and the membrane can be used for more than 3 months without any observed divergence in potentials. The proposed sensor exhibits very good selectivity for Zn(2+) over other cations and can be used in a wide pH range (2.8-7.0). It has also been possible to use this assembly as an indicator electrode in potentiometric titrations involving zinc ions. 相似文献
104.
S. Gupta 《Theory of Computing Systems》1996,29(6):661-672
Paulet al. [12] proved that deterministic Turing machines can be speeded up by a factor of log*t (n) using four alternations; that is, DTIME(t(n) log*t(n))
σ4(t(n)). Balcázaret al. [1] noted that two alternations are sufficient to achieve this speed-up of deterministic Turing machines; that is, DTIME(t(n) log*t(n))
Σ2(t (n)). We supply a proof of this speed-up and using that show that for each time-constructible functiont(n), DTIME(t(n)) ⊂ Σ2(t(n)); that is, two alternations are strictly more powerful than deterministic time. An important corollary is that at least
one (or both) of the immediate generalizations of the result DTIME(n) ⊂ NTIME(n) [12] must be true: NTIME(n) ≠ co-NTIME(n) or, for each time-constructible functiont(n), DTIME(t (n)) ⊂ NTIME(t (n)).
This work was supported in part by NSF Grant CCR-8909071. The preliminary version of the work was done when the author was
a graduate student at The Ohio State University. 相似文献
105.
In this paper, we develop mathematical models for simultaneous consideration of suitability and optimality in asset allocation. We use a hybrid approach that combines behavior survey, cluster analysis, analytical hierarchy process and fuzzy mathematical programming. 相似文献
106.
107.
The 24-H Knowledge Factory facilitates collaboration between geographically and temporally distributed teams. The teams themselves
form a strategic partnership whose joint efforts contribute to the completion of a project. Project-related tasks are likewise
distributed, allowing tasks to be completed on a continuous basis, regardless of the constraints of any one team’s working
hours. However, distributing a single task between multiple teams necessitates a handoff process, where one team’s development
efforts and task planning are communicated from one team ending their shift to the next that will continue the effort. Data
management is, therefore, critical to the success of this business model. Efficiency in data management is achieved through
a strategic leveraging of key tools, models, and concepts. 相似文献
108.
Madhusudan Singh Smriti Srivastava M. Hanmandlu J.R.P. Gupta 《Applied Soft Computing》2011,11(1):138-153
Design and learning of networks best suited for a particular application is a never-ending process. But this process is restricted due to problems like stability, plasticity, computation and memory consumption. In this paper, we try to overcome these problems by proposing two interval networks (INs), based on a simple feed-forward neural network (NN) and Choquet integral (CI). They have simple structures that reduce the problems of computation and memory consumption. The use of Lyapunov stability (LS) in combination with fuzzy difference (FD) based learning algorithm evolve the converging and diverging process which in turn assures the stability. FD gives a range of variation of parameters having the lower and the upper bounds within which the system is stable thus defining the plasticity. Effectiveness and applicability of the NN and CI based network models are investigated on several benchmark problems dealing with both identification and control. 相似文献
109.
Leszek Lilien Author Vitae Ajay Gupta Author Vitae Author Vitae Zijiang Yang Author Vitae 《Computers & Electrical Engineering》2010,36(2):328-340
We present opportunistic resource utilization networks or oppnets, a novel paradigm of specialized ad hoc networks. We believe that applications can benefit from using specialized ad hoc networks that provide a natural basis for them, the basis more efficient and effective than what general-purpose ad hoc networks can offer. Oppnets constitute the subcategory of ad hoc networks where diverse systems, not employed originally as nodes of an oppnet, join it dynamically in order to perform certain tasks they have been called to participate in. Oppnets have a significant potential to improve a variety of applications, and to create new application niches. We categorize opportunistic networks currently known in the literature as class 1opportunistic networks that use opportunistically only communication resources, and class 2opportunistic networks or oppnets that use opportunistically all kinds of resources, including not only communication but also computation, sensing, actuation, storage, etc. After describing the oppnets and the basics of their operation, we discuss the Oppnet Virtual Machine (OVM)—a proposed standard implementation framework for oppnet applications. It is followed by a discussion of an example application scenario using the OVM primitives. Next, we discuss the design and operations of a small-scale oppnet, named MicroOppnet, originally developed as a proof of concept. MicroOppnet is now being extended to serve as a testbed for experimentation and pilot implementations of oppnet architectures and their components. We conclude with a summary and a list of some open issues for oppnets. 相似文献
110.
Sudip Misra Author Vitae Author Vitae Mohammad S. Obaidat Author Vitae Pushkar Gupta Author Vitae Author Vitae Prayag Narula Author Vitae 《Journal of Systems and Software》2010,83(11):2188-2199
Primitive routing protocols for ad-hoc networks are “power hungry” and can therefore consume considerable amount of the limited amount of battery power resident in the nodes. Thus, routing in ad-hoc networks is very much energy-constrained. Continuous drainage of energy degrades battery performance as well. If a battery is allowed to intermittently remain in an idle state, it recovers some of its lost charge due to the charge recovery effect, which, in turn, results in prolonged battery life.In this paper, we use the ideas of naturally occurring ants’ foraging behavior (Dorigo and Stuetzle, 2004) [1] and based on those ideas, we design an energy-aware routing protocol, which not only incorporates the effect of power consumption in routing a packet, but also exploits the multi-path transmission properties of ant swarms and, hence, increases the battery life of a node. The efficiency of the protocol with respect to some of the existing ones has been established through simulations. It has been observed that the energy consumed in the network, the energy per packet in the case of EAAR are 60% less compared to MMBCR and the packets lost is only around 12% of what we have in AODV, in mobility scenarios. 相似文献