全文获取类型
收费全文 | 45149篇 |
免费 | 6601篇 |
国内免费 | 4862篇 |
专业分类
电工技术 | 4887篇 |
技术理论 | 2篇 |
综合类 | 6076篇 |
化学工业 | 3472篇 |
金属工艺 | 1827篇 |
机械仪表 | 4418篇 |
建筑科学 | 5325篇 |
矿业工程 | 1777篇 |
能源动力 | 1366篇 |
轻工业 | 963篇 |
水利工程 | 1715篇 |
石油天然气 | 1387篇 |
武器工业 | 1045篇 |
无线电 | 4157篇 |
一般工业技术 | 5173篇 |
冶金工业 | 1171篇 |
原子能技术 | 211篇 |
自动化技术 | 11640篇 |
出版年
2024年 | 309篇 |
2023年 | 794篇 |
2022年 | 1379篇 |
2021年 | 1489篇 |
2020年 | 1665篇 |
2019年 | 1388篇 |
2018年 | 1413篇 |
2017年 | 1735篇 |
2016年 | 2038篇 |
2015年 | 2099篇 |
2014年 | 2880篇 |
2013年 | 2951篇 |
2012年 | 3720篇 |
2011年 | 3607篇 |
2010年 | 2865篇 |
2009年 | 2879篇 |
2008年 | 2839篇 |
2007年 | 3360篇 |
2006年 | 2907篇 |
2005年 | 2435篇 |
2004年 | 1916篇 |
2003年 | 1634篇 |
2002年 | 1312篇 |
2001年 | 1205篇 |
2000年 | 1065篇 |
1999年 | 831篇 |
1998年 | 687篇 |
1997年 | 595篇 |
1996年 | 485篇 |
1995年 | 422篇 |
1994年 | 372篇 |
1993年 | 271篇 |
1992年 | 210篇 |
1991年 | 176篇 |
1990年 | 159篇 |
1989年 | 144篇 |
1988年 | 93篇 |
1987年 | 50篇 |
1986年 | 27篇 |
1985年 | 29篇 |
1984年 | 38篇 |
1983年 | 26篇 |
1982年 | 25篇 |
1981年 | 12篇 |
1980年 | 21篇 |
1979年 | 19篇 |
1978年 | 4篇 |
1977年 | 4篇 |
1959年 | 6篇 |
1955年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
Mingchang Lin Yufei Zhang Guosong Chen Ming Jiang 《Small (Weinheim an der Bergstrasse, Germany)》2015,11(45):6065-6070
Glyco‐mimicking nanoparticles (glyco‐NPs) with Förster resonance energy transfer (FRET) donor and acceptor groups formed via dynamic covalent bond of benzoboroxole and sugar from two complementary polymers are prepared. The glyco‐NPs are proved to be quite stable under physiological conditions but sensitive to pH. So the glyco‐NPs can be internalized by dendritic cells with integrity and nontoxicity and then dissociate within the acidic organelles. This particle dissociation is directly observed and visualized in vitro, for the first time via the FRET measurements and fluorescent microscopy. This feature makes controlled release of drug or protein by glyco‐NPs possible, i.e., when model antigen Ovalbumin is loaded in the glyco‐NPs, the released Ovalbumin in dendritic cells stimulates T cells more efficiently than the free Ovalbumin itself as a result of the enhanced antigen processing and presentation. Thus, the results enlighten a bright future of the glyco‐NPs in immunotherapy. 相似文献
2.
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. 相似文献
3.
Frequency Insertion Strategy for Channel Assignment Problem 总被引:1,自引:0,他引:1
This paper presents a new heuristic method for quickly finding a good feasible solution to the channel assignment problem
(CAP). Like many other greedy-type heuristics for CAP, the proposed method also assigns a frequency to a call, one at a time.
Hence, the method requires computational time that increases only linear to the number of calls. However, what distinguishes
the method from others is that it starts with a narrow enough frequency band so as to provoke violations of constraints that
we need to comply with in order to avoid radio interference. Each violation is then resolved by inserting frequencies at the
most appropriate positions so that the band of frequencies expands minimally. An extensive computational experiment using
a set of randomly generated problems as well as the Philadelphia benchmark instances shows that the proposed method perform
statistically better than existing methods of its kind and even yields optimum solutions to most of Philadelphia benchmark
instances among which two cases are reported for the first time ever, in this paper.
Won-Young Shin was born in Busan, Korea in 1978. He received B.S. in industrial engineering from Pohang University of Science and Technology
(POSTECH) in 2001 and M.S in operation research and applied statistics from POSTECH in 2003. Since 2003 he has been a researcher
of Agency for Defense Development (ADD) in Korea. He is interested in optimization of communication system and applied statistics.
Soo Y. Chang is an associate professor in the Department of Industrial Engineering at Pohang University of Science and Technology (POSTECH),
Pohang, Korea. He teaches linear programming, discrete optimization, network flows and operations research courses. His research
interests include mathematical programming and scheduling. He has published in several journals including Discrete Applied
Mathematics, Computers and Mathematics with Application, IIE Transactions, International Journal of Production Research, and
so on. He is a member of Korean IIE, and ORMSS.
Jaewook Lee is an assistant professor in the Department of Industrial Engineering at Pohang University of Science and Technology (POSTECH),
Pohang, Korea. He received the B.S. degree in mathematics with honors from Seoul National University, and the Ph.D. degree
from Cornell University in applied mathematics in 1993 and 1999, respectively. He is currently an assistant professor in the
department of industrial engineering at the Pohang University of Science and Technology (POSTECH). His research interests
include nonlinear systems, neural networks, nonlinear optimization, and their applications to data mining and financial engineering.
Chi-Hyuck Jun was born in Seoul, Korea in 1954. He received B.S. in mineral and petroleum engineering from Seoul National University in
1977, M.S. in industrial engineering from Korea Advanced Institute of Science and Technology in 1979 and Ph.D. in operations
research from University of California, Berkeley, in 1986. Since 1987 he has been with the department of industrial engineering,
Pohang University of Science and Technology (POSTECH) and he is now a professor and the department head. He is interested
in performance analysis of communication and production systems. He has published in several journals including IIE Transactions,
IEEE Transactions, Queueing Systems and Chemometrics and Intelligent Laboratory Systems. He is a member of IEEE, INFORMS and
ASQ. 相似文献
4.
Ben-Jye Chang 《Telecommunication Systems》2006,33(4):333-352
3G Wideband CDMA systems adopt the Orthogonal Variable Spreading Factor code tree as the channelization codes management for
achieving high data rate transmission in personal multimedia communications. It assigns a single channelization code for each
accepted connection. Nevertheless, it wastes the system capacity when the required rate is not powers of two of the basic
rate. One good solution is to assign multiple codes for each accepted connection but it causes two inevitable drawbacks: long
handoff delay and new call setup delay due to high complexity of processing with multiple channelization codes, and high cost
of using more number of rake combiners. Especially, long handoff delay may result in more call dropping probability and higher
Grade of Service, which will degrade significantly the utilization and revenue of the 3G cellular systems. Therefore, we propose
herein an adaptive efficient codes determination algorithm based on the Markov Decision Process analysis approach to reduce
the waste rate and reassignments significantly while providing fast handoff. Numerical results demonstrate that the proposed
approach yields several advantages, including the lowest GOS, the least waste rate, and the least number of reassignments.
Meanwhile, the optimal number of rake combiners is also analyzed in this paper.
This research was supported in part by the National Science Council of Taiwan, ROC, under contract NSC-93-2213-E-324-018. 相似文献
5.
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. 相似文献
6.
燃气管网动态仿真的研究及应用 总被引:2,自引:0,他引:2
研究和了解燃气在管道中的流动,是进行燃气管网系统优化和提高管网输运系统安全性的前提和基础。以流体力学三大守恒方程为基础,建立了等温和非等温条件下的燃气管网稳态和动态仿真理论模型。以有限差分法为基础,得到了上述模型的求解方法,并加入了耗散项,提高了求解方法的稳定性。通过增加初始点和延长出口点的方法,简化了模型的求解。通过在北京六环天然气管网中的初步应用,分别得到了与实际值综合相对误差为1.21%和2.62%的压力和流量仿真值,从而验证了模型及求解方法的可靠性。 相似文献
7.
Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a
given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred
to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional
(resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional
(resp., unidirectional) topology is k-edge connected.
The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied
by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18],
which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19],
which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity.
In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity,
and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity
and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for
distributed implementation.
A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless
(Adhoc-Now 2003).
Research performed in part while visiting the Max-Plank-Institut fur Informatik.
Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting
researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University
of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms.
Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor
since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and
Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990.
His research interests include optical networks and wireless networks. 相似文献
8.
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. 相似文献
9.
10.