全文获取类型
收费全文 | 13029篇 |
免费 | 801篇 |
国内免费 | 482篇 |
专业分类
化学 | 2514篇 |
晶体学 | 36篇 |
力学 | 1672篇 |
综合类 | 148篇 |
数学 | 7650篇 |
物理学 | 2292篇 |
出版年
2024年 | 19篇 |
2023年 | 187篇 |
2022年 | 282篇 |
2021年 | 373篇 |
2020年 | 287篇 |
2019年 | 270篇 |
2018年 | 282篇 |
2017年 | 426篇 |
2016年 | 414篇 |
2015年 | 308篇 |
2014年 | 643篇 |
2013年 | 797篇 |
2012年 | 772篇 |
2011年 | 679篇 |
2010年 | 600篇 |
2009年 | 820篇 |
2008年 | 819篇 |
2007年 | 844篇 |
2006年 | 659篇 |
2005年 | 582篇 |
2004年 | 469篇 |
2003年 | 427篇 |
2002年 | 393篇 |
2001年 | 335篇 |
2000年 | 339篇 |
1999年 | 251篇 |
1998年 | 258篇 |
1997年 | 234篇 |
1996年 | 166篇 |
1995年 | 191篇 |
1994年 | 167篇 |
1993年 | 130篇 |
1992年 | 126篇 |
1991年 | 101篇 |
1990年 | 81篇 |
1989年 | 74篇 |
1988年 | 66篇 |
1987年 | 47篇 |
1986年 | 48篇 |
1985年 | 63篇 |
1984年 | 59篇 |
1983年 | 19篇 |
1982年 | 30篇 |
1981年 | 24篇 |
1980年 | 22篇 |
1979年 | 38篇 |
1978年 | 22篇 |
1977年 | 30篇 |
1976年 | 19篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
21.
This paper gives some global and uniform convergence estimates for a class of subspace correction (based on space decomposition) iterative methods applied to some unconstrained convex optimization problems. Some multigrid and domain decomposition methods are also discussed as special examples for solving some nonlinear elliptic boundary value problems.
22.
Optimization technologies and environmental applications 总被引:1,自引:0,他引:1
23.
ON HYPERBOLIC TIME DISCOUNTING IN EXHAUSTIBLE RESOURCE MODELS: AN APPLICATION TO WORLD OIL RESOURCES
JOHN ROWSE 《Natural Resource Modeling》2006,19(2):243-277
ABSTRACT. Recent research on discounting in long term economic models involves hyperbolic discounting, in which the marginal discount rate shrinks as time passes. To investigate hyperbolic discounting and exhaustible resource allocation, this work develops a discrete‐time world oil model and model solution procedure, then uses the model to examine the consequences of adopting conventional (constant annual) discounting when hyperbolic discounting is appropriate, of adopting one hyperbolic discount rate path when a different hyperbolic path is appropriate, and of adopting hyperbolic discounting when conventional discounting is appropriate. Five conventional and two hyperbolic discount rate paths are considered. One hyperbolic path is that used by Nordhaus and Boyer [2000]; the other is that recommended by Weitzman [2001]. The generality of the findings is also assessed. 相似文献
24.
25.
26.
27.
We consider the problem of minimizing an SC1 function subject to inequality constraints. We propose a local algorithm whose distinguishing features are that: (a) a fast convergence rate is achieved under reasonable assumptions that do not include strict complementarity at the solution; (b) the solution of only linear systems is required at each iteration; (c) all the points generated are feasible. After analyzing a basic Newton algorithm, we propose some variants aimed at reducing the computational costs and, in particular, we consider a quasi-Newton version of the algorithm. 相似文献
28.
On effectiveness of wiretap programs in mapping social networks 总被引:1,自引:0,他引:1
Maksim Tsvetovat Kathleen M. Carley 《Computational & Mathematical Organization Theory》2007,13(1):63-87
Snowball sampling methods are known to be a biased toward highly connected actors and consequently produce core-periphery networks when these may not necessarily be present. This leads to a biased perception of the underlying network which can have negative policy consequences, as in the identification of terrorist networks. When snowball sampling is used, the potential overload of the information collection system is a distinct problem due to the exponential growth of the number of suspects to be monitored. In this paper, we focus on evaluating the effectiveness of a wiretapping program in terms of its ability to map the rapidly evolving networks within a covert organization. By running a series of simulation-based experiments, we are able to evaluate a broad spectrum of information gathering regimes based on a consistent set of criteria. We conclude by proposing a set of information gathering programs that achieve higher effectiveness then snowball sampling, and at a lower cost.
Maksim Tsvetovat is an Assistant Professor at the Center for Social Complexity and department of Public and International Affairs at George Mason University, Fairfax, VA. He received his Ph.D. from the Computation, Organizations and Society program in the School of Computer Science, Carnegie Mellon University. His dissertation was centered on use of artificial intelligence techniques such as planning and semantic reasoning as a means of studying behavior and evolution of complex social networks, such as these of terrorist organizations. He received a Master of Science degree from University of Minnesota with a specialization in Artificial Intelligence and design of Multi-Agent Systems, and has also extensively studied organization theory and social science research methods. His research is centered on building high-fidelity simulations of social and organizational systems using concepts from distributed artificial intelligence and multi-agent systems. Other projects focus on social network analysis for mapping of internal corporate networks or study of covert and terrorist orgnaizations. Maksim’s vita and publications can be found on
Kathleen M. Carley is a professor in the School of Computer Science at Carnegie Mellon University and the director of the center for Compuational Analysis of Social and Organizational Systems (CASOS) which has over 25 members, both students and research staff. Her research combines cognitive science, social networks and computer science to address complex social and organizational problems. Her specific research areas are dynamic network analysis, computational social and organization theory, adaptation and evolution, text mining, and the impact of telecommunication technologies and policy on communication, information diffusion, disease contagion and response within and among groups particularly in disaster or crisis situations. She and her lab have developed infrastructure tools for analyzing large scale dynamic networks and various multi-agent simulation systems. The infrastructure tools include ORA, a statistical toolkit for analyzing and visualizing multi-dimensional networks. ORA results are organized into reports that meet various needs such as the management report, the mental model report, and the intelligence report. Another tool is AutoMap, a text-mining systems for extracting semantic networks from texts and then cross-classifying them using an organizational ontology into the underlying social, knowledge, resource and task networks. Her simulation models meld multi-agent technology with network dynamics and empirical data. Three of the large-scale multi-agent network models she and the CASOS group have developed in the counter-terrorism area are: BioWar a city-scale dynamic-network agent-based model for understanding the spread of disease and illness due to natural epidemics, chemical spills, and weaponized biological attacks; DyNet a model of the change in covert networks, naturally and in response to attacks, under varying levels of information uncertainty; and RTE a model for examining state failure and the escalation of conflict at the city, state, nation, and international as changes occur within and among red, blue, and green forces. She is the founding co-editor with Al. Wallace of the journal Computational Organization Theory and has co-edited several books and written over 100 articles in the computational organizations and dynamic network area. Her publications can be found at: http://www.casos.cs.cmu.edu/bios/carley/publications.php 相似文献
29.
基于MATLAB的异步电动机线性化控制系统的仿真 总被引:1,自引:0,他引:1
从异步电动机在同步旋转坐标系下的状态方程出发,在一定的条件下,对其系数矩阵简化.推出异步电动机的线性化控制模型.并基于该模型得出异步电动机的线性化控制系统.以给定电机为例,对该模型的有效性、响应用MATLAB进行仿真分析.验证的结果说明上述模型具有实用价值. 相似文献
30.
本对于全局优化问题提出一个改进的进化规划算法,该算法以概率p接收基于电磁理论求出合力方向作为随机搜索方向,以概率1-p接收按正态分布产生的随机搜索方向。改进算法不仅克服了传统进化规划算法随机搜索的盲目性,而且保留了传统进化规划算法全局搜索性。本算法应用于几个典型例题,数值结果表明本算法是可行的,有效的。 相似文献