全文获取类型
收费全文 | 6871篇 |
免费 | 191篇 |
国内免费 | 27篇 |
专业分类
电工技术 | 103篇 |
综合类 | 2篇 |
化学工业 | 1400篇 |
金属工艺 | 284篇 |
机械仪表 | 185篇 |
建筑科学 | 103篇 |
矿业工程 | 8篇 |
能源动力 | 309篇 |
轻工业 | 266篇 |
水利工程 | 56篇 |
石油天然气 | 14篇 |
无线电 | 977篇 |
一般工业技术 | 1487篇 |
冶金工业 | 860篇 |
原子能技术 | 72篇 |
自动化技术 | 963篇 |
出版年
2023年 | 69篇 |
2022年 | 141篇 |
2021年 | 173篇 |
2020年 | 151篇 |
2019年 | 145篇 |
2018年 | 227篇 |
2017年 | 186篇 |
2016年 | 193篇 |
2015年 | 104篇 |
2014年 | 202篇 |
2013年 | 398篇 |
2012年 | 220篇 |
2011年 | 300篇 |
2010年 | 231篇 |
2009年 | 274篇 |
2008年 | 243篇 |
2007年 | 198篇 |
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篇 |
排序方式: 共有7089条查询结果,搜索用时 15 毫秒
51.
Entrance pressure losses for the creeping flow of a power-law fluid are calculated for an abrupt contraction of ratio 2, 4, 8 and ∞ for both the axisymmetric and planar cases using P2P1 and PP1 finite elements. Contrary to some earlier findings in the literature, the entrance pressure loss obtained by using the two different types of finite elements, both of which satisfy the Babus?ka-Brezzi condition, are found to converge to the same results. The present results also confirm that the variational method of Duda and Vrentas gives excellent upper bounds for both the axisymmetric and planar cases with infinite contraction ratio. 相似文献
52.
When individuals encounter new information (data), that information is incorporated with their existing beliefs (prior) to form a new belief (posterior) in a process referred to as belief updating. While most studies on rational belief updating in visual data analysis elicit beliefs immediately after data is shown, we posit that there may be critical movement in an individual's beliefs when elicited immediately after data is shown v. after a temporal delay (e.g., due to forgetfulness or weak incorporation of the data). Our paper investigates the hypothesis that posterior beliefs elicited after a time interval will “decay” back towards the prior beliefs compared to the posterior beliefs elicited immediately after new data is presented. In this study, we recruit 101 participants to complete three tasks where beliefs are elicited immediately after seeing new data and again after a brief distractor task. We conduct (1) a quantitative analysis of the results to understand if there are any systematic differences in beliefs elicited immediately after seeing new data or after a distractor task and (2) a qualitative analysis of participants' reflections on the reasons for their belief update. While we find no statistically significant global trends across the participants beliefs elicited immediately v. after the delay, the qualitative analysis provides rich insight into the reasons for an individual's belief movement across 9 prototypical scenarios, which includes (i) decay of beliefs as a result of either forgetting the information shown or strongly held prior beliefs, (ii) strengthening of confidence in updated beliefs by positively integrating the new data and (iii) maintaining a consistently updated belief over time, among others. These results can guide subsequent experiments to disambiguate when and by what mechanism new data is truly incorporated into one's belief system. 相似文献
53.
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. 相似文献
54.
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. 相似文献
55.
56.
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. 相似文献
57.
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. 相似文献
58.
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. 相似文献
59.
Permanent Magnet Brushless DC (PMBLDC) machines are more popular due its simple structure and low cost. Improvements in permanent
magnetic materials and power electronic devices have resulted in reliable, cost effective PMBLDC drives, for many applications.
Advances in artificial intelligent applications like neural network, fuzzy logic, Genetic algorithm etc. have made tremendous
impact on electric motor drives. The brushless DC motor is a multivariable and non-linear system. In conventional PMBLDC drives
speed and position sensing of brushless DC motors require high degree of accuracy. Unfortunately, traditional methods of control
require detailed modelling of all the motor parameters to achieve this. The Intelligent control techniques like, fuzzy logic
control/Neural network control etc. uses heuristic input–output relations to deal with vague and complex situations. This
paper presents a literature survey on the intelligent control techniques for PMBLDC motor drives. Various AI techniques for
PMBLDC motor drives are described. Attempt is made to provide a guideline and quick reference for the researchers and practicing
engineers those are working in the area of PMBLDC motor drives. 相似文献
60.
Adaptation is a desirable requirement in a distributed system as it helps the system to perform efficiently under different environments. For many problems, more than one protocol exists, such that one protocol performs better in one environment while the other performs better in another. In such cases, adaptive distributed systems can be designed by dynamically switching between the protocols as the environment changes. Distributed protocol switching is also important for performance enhancement, or fault-tolerance of a distributed system. In this work, we illustrate distributed protocol switching by providing a distributed algorithm for adaptive broadcast that dynamically switches from a BFS tree to a DFS tree. The proposed switching algorithm can also handle arbitrary crash failures. It ensures that switching eventually terminates in spite of failures and the desired tree (DFS tree) results as the output. We also investigate the properties that can be guaranteed on the delivery of broadcast messages under specific failure conditions. We show that under no failure, each broadcast message is eventually correctly delivered to all the nodes in spite of switching. Under arbitrary crash fault, we ensure that switching eventually terminates with the desired tree as the broadcast topology. We also investigate the specific delivery guarantees that can be provided when a single crash fault happens, both during switching and when no switching is in progress. 相似文献