全文获取类型
收费全文 | 49261篇 |
免费 | 6903篇 |
国内免费 | 5048篇 |
专业分类
电工技术 | 5286篇 |
技术理论 | 1篇 |
综合类 | 7134篇 |
化学工业 | 3628篇 |
金属工艺 | 1972篇 |
机械仪表 | 4834篇 |
建筑科学 | 5685篇 |
矿业工程 | 1879篇 |
能源动力 | 1377篇 |
轻工业 | 1063篇 |
水利工程 | 1738篇 |
石油天然气 | 1445篇 |
武器工业 | 1038篇 |
无线电 | 4998篇 |
一般工业技术 | 4975篇 |
冶金工业 | 1180篇 |
原子能技术 | 288篇 |
自动化技术 | 12691篇 |
出版年
2024年 | 276篇 |
2023年 | 781篇 |
2022年 | 1443篇 |
2021年 | 1596篇 |
2020年 | 1735篇 |
2019年 | 1400篇 |
2018年 | 1407篇 |
2017年 | 1750篇 |
2016年 | 2066篇 |
2015年 | 2190篇 |
2014年 | 3119篇 |
2013年 | 3109篇 |
2012年 | 4032篇 |
2011年 | 3970篇 |
2010年 | 3095篇 |
2009年 | 3186篇 |
2008年 | 3137篇 |
2007年 | 3723篇 |
2006年 | 3198篇 |
2005年 | 2775篇 |
2004年 | 2192篇 |
2003年 | 1888篇 |
2002年 | 1550篇 |
2001年 | 1366篇 |
2000年 | 1250篇 |
1999年 | 940篇 |
1998年 | 729篇 |
1997年 | 640篇 |
1996年 | 515篇 |
1995年 | 445篇 |
1994年 | 386篇 |
1993年 | 276篇 |
1992年 | 219篇 |
1991年 | 173篇 |
1990年 | 144篇 |
1989年 | 140篇 |
1988年 | 101篇 |
1987年 | 49篇 |
1986年 | 27篇 |
1985年 | 28篇 |
1984年 | 38篇 |
1983年 | 22篇 |
1982年 | 20篇 |
1981年 | 11篇 |
1980年 | 20篇 |
1979年 | 19篇 |
1978年 | 4篇 |
1977年 | 5篇 |
1959年 | 5篇 |
1955年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
11.
以方竹笋中提取的膳食纤维为研究对象,采用动态高压微射流(dynamic high-pressure micro-fluidization, DHPM)在不同压力条件(0,50,100,150,200 MPa)下进行处理,探究其对竹笋膳食纤维(bamboo shoots dietary fiber, BSDF)理化和结构特性的影响。结果表明,随着处理压力的增大,BSDF粒径先增大后减小,当处理压力为150 MPa时,粒径最小,为(370±11) nm,此条件下BSDF的持水力、持油力和膨胀力达到最大,较对照组分别提高了47.74%,50.54%,61.27%,且差异显著(P<0.05)。红外光谱分析表明DHPM处理不会改变BSDF的官能团,但会使BSDF内部的部分氢键断裂和半纤维素、木质素等发生降解;X射线衍射和热重分析表明DHPM处理不会引起BSDF的晶体结构改变,但晶体有序度会下降,进而导致其热稳定性降低;微观结构分析显示DHPM处理会使BSDF颗粒尺寸减小、表面粗糙、组织松散,且当处理压力为200 MPa时,颗粒发生团聚。综上,DHPM可以有效改善BSDF的理化性质,在膳食纤维改性方面具有一定的应用价值。 相似文献
12.
筒形阀是一种新型的水轮机进水阀,它与球阀或蝴蝶阀相比较有防止机组飞逸事故扩大效果明显、减轻导叶全关时导水机构的快速破坏并减少漏水量,以及动水开启方便、所需时间短等优点,但对运行条件也有一定的要求。光照水电站是贵州省第1个拟采用筒形阀的电站,为此对装设筒形阀的可行性和必要性进行了认真的分析。 相似文献
13.
This study addresses the problem of choosing the most suitable probabilistic model selection criterion for unsupervised learning
of visual context of a dynamic scene using mixture models. A rectified Bayesian Information Criterion (BICr) and a Completed
Likelihood Akaike’s Information Criterion (CL-AIC) are formulated to estimate the optimal model order (complexity) for a given
visual scene. Both criteria are designed to overcome poor model selection by existing popular criteria when the data sample
size varies from small to large and the true mixture distribution kernel functions differ from the assumed ones. Extensive
experiments on learning visual context for dynamic scene modelling are carried out to demonstrate the effectiveness of BICr
and CL-AIC, compared to that of existing popular model selection criteria including BIC, AIC and Integrated Completed Likelihood
(ICL). Our study suggests that for learning visual context using a mixture model, BICr is the most appropriate criterion given
sparse data, while CL-AIC should be chosen given moderate or large data sample sizes. 相似文献
14.
With the proliferation of mobile computing technologies, location based services have been identified as one of the most promising
target application. We classify mobile information service domains based on feature characteristics of the information sources
and different patterns of mobile information access. By carefully examining the service requirements, we identify the dynamic
data management problem that must be addressed for effective location based services in mobile environments. We then devise
a general architecture and cost model for servicing both location independent and location dependent data. Based on the architecture
and cost model, we propose a set of dynamic data management strategies that employs judicious caching, proactive server pushing
and neighborhood replication to reduce service cost and improve response time under changing user mobility and access patterns.
Detail behavior analysis helps us in precisely capturing when and how to apply these strategies. Simulation results suggest
that different strategies are effective for different types of data in response to different patterns of movement and information
access.
Shiow-yang Wu is an associate professor of the Department of Computer Science and Information Engineering at National Dong Hwa University,
Hualien, Taiwan, R.O.C. He received the BS and MS degrees in computer engineering from National Chiao Tung University, Hsinchu,
Taiwan, ROC, and the PhD degree in computer science from the University of Texas at Austin in 1984, 1986, and 1995, respectively.
His research interests include data/knowledge bases, mobile computing, distributed processing, intelligence information systems,
and electronic commerce.
Kun-Ta Wu was born in Taipei, Taiwan, R.O.C., in 1976. He received the B.S. degree in computer science from Soochow University, Taipei,
Taiwan, R.O.C., in 1999 and the M.S. degree in computer science and information engineering from National Dong Hwa University,
Hualien, Taiwan, R.O.C., in 2001.
Currently, he is an Assistant Researcher in the Domestic Division at Science and Technology Information Center, National Science
Council, R.O.C., as a member of Information Gathering and Analysis Group of National Information and Communication Security
Taskforce. His research interests include mobile computing, wireless network and information security. 相似文献
15.
燃气管网动态仿真的研究及应用 总被引:2,自引:0,他引:2
研究和了解燃气在管道中的流动,是进行燃气管网系统优化和提高管网输运系统安全性的前提和基础。以流体力学三大守恒方程为基础,建立了等温和非等温条件下的燃气管网稳态和动态仿真理论模型。以有限差分法为基础,得到了上述模型的求解方法,并加入了耗散项,提高了求解方法的稳定性。通过增加初始点和延长出口点的方法,简化了模型的求解。通过在北京六环天然气管网中的初步应用,分别得到了与实际值综合相对误差为1.21%和2.62%的压力和流量仿真值,从而验证了模型及求解方法的可靠性。 相似文献
16.
17.
Uplink scheduling in wireless systems is gaining importance due to arising uplink intensive data services (ftp, image uploads
etc.), which could be hampered by the currently in-built asymmetry in favor of the downlink. In this work, we propose and
study algorithms for efficient uplink packet-data scheduling in a CDMA cell. The algorithms attempt to maximize system throughput
under transmit power limitations on the mobiles assuming instantaneous knowledge of user queues and channels. However no channel
statistics or traffic characterization is necessary. Apart from increasing throughput, the algorithms also improve fairness
of service among users, hence reducing chances of buffer overflows for poorly located users.
The major observation arising from our analysis is that it is advantageous on the uplink to schedule “strong” users one-at-a-time,
and “weak” users in larger groups. This contrasts with the downlink where one-at-a-time transmission for all users has shown
to be the preferred mode in much previous work. Based on the optimal schedules, we propose less complex and more practical
approximate methods, both of which offer significant performance improvement compared to one-at-a-time transmission, and the
widely acclaimed Proportional Fair (PF) algorithm, in simulations. When queue content cannot be fed back, we propose a simple modification of PF, Uplink PF (UPF), that offers similar improvement.
Hereafter, we refer to users with low recieved power at the base even when transmitting at peak transmit power as “weak” users,
and the strongly recieved users at the base as “strong” users.
Krishnan Kumaran is currently a member of the Complex Systems Modeling section in the Corporate Strategic Research of ExxonMobil Corp., Clinton,
NJ. Formerly, he was a Member of Technical Staff in the Mathematics of Networks and Systems Research Department at Bell Labs
in Murray Hill, NJ, where his research interests were in modeling, analysis and simulation of design, resource management
and scheduling issues in telecommunication networks.
Lijun Qian is an assistant professor in the Department of Electrical Engineering at Prairie View A&M University. He received his B.S.
from Tsinghua University in Beijing, M.S. from Technion-Israel Institute of Technology, and Ph.D. from WINLAB, Rutgers University,
all in electrical engineering. Before joining PVAMU, he was a researcher at Networks and Systems Research Department of Bell
Labs in Murray Hill, NJ. His major research interests are in wireless communications and networking technologies, especially
in radio resource management, protocol design, TCP/RLP optimization and MPLS traffic engineering. 相似文献
18.
Aqueous solutions of poly(vinyl pyrrolidone)-fullerene complexes (PVP-C70) have been studied using static and dynamic light scattering methods. Two diffusive processes were detected. The slow diffusion was interpreted as dynamics of large intermolecular PVP-C70 complexes while the fast diffusion was associated with the presence of individual PVP molecules in solution. It was also shown that the molecular weights and dimensions of PVP-C70 complexes are smaller than for PVP-C60 by a factor of 2.5-3. In aqueous solutions of PVP-C70 complex the depolarization and dissymmetry of scattered light were observed in contrast to PVP-C60 solutions. It reveals the existence of anisotropic structures in PVP-C70 solutions. Intermolecular interactions within PVP-C70 complexes are weak and a hydrodynamic field can destroy complexes. 相似文献
19.
20.
Communicating with sensors has long been limited either to wired connections or to proprietary wireless communication protocols. Using a ubiquitous and inexpensive wireless communication technology to create Sensor Area Networks (SANs) will accelerate the extensive deployment of sensor technology. Bluetooth, an emerging, worldwide standard for inexpensive, local wireless communication is a viable choice for SANs because of its inherent support for some of the important requirements – low power, small form factor, low cost and sufficient communication range. In this paper we outline an approach, centered on the Bluetooth technology, to support a sensor network composed of fixed wireless sensors for health monitoring of highways, bridges and other civil infrastructures. We present a topology formation scheme that not only takes into account the traffic generated by different sensors but also the associated link strengths, buffer capacities and energy availability. The algorithm makes no particular assumptions as to the placement of nodes, and not all nodes need to be in radio proximity of each other. The output is a tree shaped scatternet rooted at the sensor hub (data logger) that is balanced in terms of traffic carried on each of the links. We also analyze the scheduling, routing and healing aspects of the resulting sensor-net topology. 相似文献