全文获取类型
收费全文 | 11515篇 |
免费 | 930篇 |
国内免费 | 754篇 |
专业分类
化学 | 3185篇 |
晶体学 | 62篇 |
力学 | 1147篇 |
综合类 | 199篇 |
数学 | 6869篇 |
物理学 | 1737篇 |
出版年
2024年 | 11篇 |
2023年 | 92篇 |
2022年 | 224篇 |
2021年 | 292篇 |
2020年 | 288篇 |
2019年 | 288篇 |
2018年 | 232篇 |
2017年 | 351篇 |
2016年 | 414篇 |
2015年 | 310篇 |
2014年 | 549篇 |
2013年 | 884篇 |
2012年 | 561篇 |
2011年 | 704篇 |
2010年 | 587篇 |
2009年 | 760篇 |
2008年 | 753篇 |
2007年 | 841篇 |
2006年 | 662篇 |
2005年 | 564篇 |
2004年 | 541篇 |
2003年 | 479篇 |
2002年 | 432篇 |
2001年 | 336篇 |
2000年 | 328篇 |
1999年 | 279篇 |
1998年 | 257篇 |
1997年 | 221篇 |
1996年 | 173篇 |
1995年 | 117篇 |
1994年 | 106篇 |
1993年 | 75篇 |
1992年 | 63篇 |
1991年 | 60篇 |
1990年 | 54篇 |
1989年 | 27篇 |
1988年 | 37篇 |
1987年 | 27篇 |
1986年 | 13篇 |
1985年 | 26篇 |
1984年 | 25篇 |
1983年 | 32篇 |
1982年 | 23篇 |
1981年 | 26篇 |
1980年 | 23篇 |
1979年 | 16篇 |
1978年 | 13篇 |
1977年 | 5篇 |
1974年 | 3篇 |
1957年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
31.
证明了当超越亚纯函数的级小于1时,其Norel例外值最多只有一个.由于存在任何级的整函数,因此一个例外值总可达到,故所得结果不能再改进。 相似文献
32.
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 相似文献
33.
The lattice profile analyzes the intrinsic structure of pseudorandom number sequences with applications in Monte Carlo methods and cryptology. In this paper, using the discrete Fourier transform for periodic sequences and the relation between the lattice profile and the linear complexity, we give general formulas for the expected value, variance, and counting function of the lattice profile of periodic sequences with fixed period. Moreover, we determine in a more explicit form the expected value, variance, and counting function of the lattice profile of periodic sequences for special values of the period. 相似文献
34.
35.
矩阵方程AXB=D的最小二乘Hermite解及其加权最佳逼近 总被引:1,自引:0,他引:1
本中,我们讨论了矩阵方程AXB=D的最小二乘Hermite解,通过运用广义奇异值分解(GSVD),获得了解的通式。此外,对于给定矩阵F,也得到了它的加权最佳逼近表达式。 相似文献
36.
带有回报计划的动态客户关系管理模型及实验应用分析 总被引:1,自引:0,他引:1
在客户最大化效用及公司最大化CLV的动态环境下。对所提的带有回报计划的动态客户关系管理模型用于某超市的客户数据库中,发现模型的结果对这类客户是适用的。并给出了不同的客户状态空间对应的有效营销组合策略。结果表明:合适的回报计划可以促进客户的购买、提高公司的利润及缓解价格竞争。回报极限应该比客户的平均购买水平偏高,回报率应该与回报极限的改变方向一致。计划的时间范围应定在一年左右比较合适。对于累积购买水平较高的客户一般不邮寄商品信息。在回报计划的初期与末期不用打折。中期对那些购买次数很少的客户可以实行相应的降价策略。 相似文献
37.
38.
一类含有P-Laplacian算子的奇异边值问题解的确切个数 总被引:2,自引:0,他引:2
讨论了一类p-L ap lac ian算子型的奇异边值问题正解的确切个数以及解的性质. 相似文献
39.
40.
We study initial boundary value problems for linear scalar evolutionpartial differential equations, with spatial derivatives ofarbitrary order, posed on the domain {t > 0, 0 < x <L}. We show that the solution can be expressed as an integralin the complex k-plane. This integral is defined in terms ofan x-transform of the initial condition and a t-transform ofthe boundary conditions. The derivation of this integral representationrelies on the analysis of the global relation, which is an algebraicrelation defined in the complex k-plane coupling all boundaryvalues of the solution. For particular cases, such as the case of periodic boundaryconditions, or the case of boundary value problems for even-orderPDEs, it is possible to obtain directly from the global relationan alternative representation for the solution, in the formof an infinite series. We stress, however, that there existinitial boundary value problems for which the only representationis an integral which cannot be written as an infinite series.An example of such a problem is provided by the linearized versionof the KdV equation. Similarly, in general the solution of odd-orderlinear initial boundary value problems on a finite intervalcannot be expressed in terms of an infinite series. 相似文献