全文获取类型
收费全文 | 2090篇 |
免费 | 252篇 |
国内免费 | 84篇 |
专业分类
化学 | 142篇 |
力学 | 20篇 |
综合类 | 24篇 |
数学 | 994篇 |
物理学 | 347篇 |
无线电 | 899篇 |
出版年
2024年 | 3篇 |
2023年 | 23篇 |
2022年 | 49篇 |
2021年 | 79篇 |
2020年 | 60篇 |
2019年 | 47篇 |
2018年 | 43篇 |
2017年 | 90篇 |
2016年 | 106篇 |
2015年 | 82篇 |
2014年 | 127篇 |
2013年 | 158篇 |
2012年 | 122篇 |
2011年 | 125篇 |
2010年 | 102篇 |
2009年 | 129篇 |
2008年 | 131篇 |
2007年 | 111篇 |
2006年 | 129篇 |
2005年 | 114篇 |
2004年 | 80篇 |
2003年 | 88篇 |
2002年 | 67篇 |
2001年 | 51篇 |
2000年 | 39篇 |
1999年 | 38篇 |
1998年 | 32篇 |
1997年 | 40篇 |
1996年 | 33篇 |
1995年 | 20篇 |
1994年 | 14篇 |
1993年 | 16篇 |
1992年 | 12篇 |
1991年 | 6篇 |
1990年 | 6篇 |
1989年 | 7篇 |
1988年 | 2篇 |
1987年 | 2篇 |
1986年 | 3篇 |
1985年 | 6篇 |
1984年 | 3篇 |
1983年 | 2篇 |
1982年 | 6篇 |
1981年 | 6篇 |
1980年 | 6篇 |
1979年 | 3篇 |
1978年 | 3篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1973年 | 2篇 |
排序方式: 共有2426条查询结果,搜索用时 16 毫秒
1.
A new matching cost computation method based on nonsubsampled contourlet transform (NSCT) for stereo image matching is proposed in this paper. Firstly, stereo image is decomposed into high frequency sub-band images at different scales and along different directions by NSCT. Secondly, by utilizing coefficients in high frequency domain and grayscales in RGB color space, the computation model of weighted matching cost between two pixels is designed based on the gestalt laws. Lastly, two types of experiments are carried out with standard stereopairs in the Middlebury benchmark. One of the experiments is to confirm optimum values of NSCT scale and direction parameters, and the other is to compare proposed matching cost with nine known matching costs. Experimental results show that the optimum values of scale and direction parameters are respectively 2 and 3, and the matching accuracy of the proposed matching cost is twice higher than that of traditional NCC cost. 相似文献
2.
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. 相似文献
3.
4.
5.
李宗亮 《电子产品可靠性与环境试验》2002,(2):39-42
介绍了可靠性设计过程涉及的质量控制成本的解决方法,通过对最有可能影响可靠性的电路设计、元器件选用等方面的分析,介绍了在降低可靠性设计成本的基础下更好地解决可靠性问题的一些方法。 相似文献
6.
7.
Mathematical economics has a long history and covers many interdisciplinary areas between mathematics and economics. At its center lies the theory of market equilibrium. The purpose of this expository article is to introduce mathematicians to price decentralization in general equilibrium theory. In particular, it concentrates on the role of positivity in the theory of convex economic analysis and the role of normal cones in the theory of non-convex economies. 相似文献
8.
Dalila B. M. M. Fontes Eleni Hadjiconstantinou Nicos Christofides 《Journal of Global Optimization》2006,34(1):97-125
In this paper we obtain Lower Bounds (LBs) to concave cost network flow problems. The LBs are derived from state space relaxations
of a dynamic programming formulation, which involve the use of non-injective mapping functions guaranteing a reduction on
the cardinality of the state space. The general state space relaxation procedure is extended to address problems involving
transitions that go across several stages, as is the case of network flow problems. Applications for these LBs include: estimation
of the quality of heuristic solutions; local search methods that use information of the LB solution structure to find initial
solutions to restart the search (Fontes et al., 2003, Networks, 41, 221–228); and branch-and-bound (BB) methods having as
a bounding procedure a modified version of the LB algorithm developed here, (see Fontes et al., 2005a). These LBs are iteratively
improved by penalizing, in a Lagrangian fashion, customers not exactly satisfied or by performing state space modifications.
Both the penalties and the state space are updated by using the subgradient method. Additional constraints are developed to
improve further the LBs by reducing the searchable space. The computational results provided show that very good bounds can
be obtained for concave cost network flow problems, particularly for fixed-charge problems. 相似文献
9.
介绍了PHS网呼入成功率和短消息流程,依据短消息模型和性能统计结果分析了群发短信对PHS网呼入成功率的影响,并建议选择合理的时间进行短消息群发以减少对网络负荷的影响。 相似文献
10.