全文获取类型
收费全文 | 9781篇 |
免费 | 1809篇 |
国内免费 | 1019篇 |
专业分类
化学 | 3938篇 |
晶体学 | 50篇 |
力学 | 872篇 |
综合类 | 291篇 |
数学 | 3135篇 |
物理学 | 4323篇 |
出版年
2024年 | 61篇 |
2023年 | 211篇 |
2022年 | 692篇 |
2021年 | 624篇 |
2020年 | 571篇 |
2019年 | 396篇 |
2018年 | 325篇 |
2017年 | 418篇 |
2016年 | 521篇 |
2015年 | 425篇 |
2014年 | 596篇 |
2013年 | 809篇 |
2012年 | 556篇 |
2011年 | 562篇 |
2010年 | 509篇 |
2009年 | 596篇 |
2008年 | 553篇 |
2007年 | 574篇 |
2006年 | 504篇 |
2005年 | 362篇 |
2004年 | 357篇 |
2003年 | 333篇 |
2002年 | 318篇 |
2001年 | 232篇 |
2000年 | 240篇 |
1999年 | 213篇 |
1998年 | 171篇 |
1997年 | 148篇 |
1996年 | 131篇 |
1995年 | 87篇 |
1994年 | 86篇 |
1993年 | 78篇 |
1992年 | 42篇 |
1991年 | 44篇 |
1990年 | 42篇 |
1989年 | 24篇 |
1988年 | 17篇 |
1987年 | 14篇 |
1986年 | 22篇 |
1985年 | 39篇 |
1984年 | 29篇 |
1983年 | 7篇 |
1982年 | 14篇 |
1981年 | 17篇 |
1980年 | 7篇 |
1979年 | 10篇 |
1978年 | 3篇 |
1977年 | 10篇 |
1975年 | 2篇 |
1959年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
1.
数据包络分析(DEA)是评价供应链系统(Supply chain system)间相对有效性的一种重要的工具,但是传统的DEA不考虑供应链的内部结构,对系统效率评价偏高;而本文所研究两阶段串联供应链系统,考虑把部分中间产品作为最终产品输出,增加额外中间投入的情形.基于所提出的供应链系统结构,本文建立相应的串联结构下的网络DEA模型,并针对所建立模型进行相关理论的研究,给出了串联结构下的生产可能集和规模收益情况判定方法.最后,进行数值实验,以验证我们提出的结论. 相似文献
2.
A Dirac picture perturbation theory is developed for the time evolution operator in classical dynamics in the spirit of the Schwinger–Feynman–Dyson perturbation expansion and detailed rules are derived for computations. Complexification formalisms are given for the time evolution operator suitable for phase space analyses, and then extended to a two-dimensional setting for a study of the geometrical Berry phase as an example. Finally a direct integration of Hamilton's equations is shown to lead naturally to a path integral expression, as a resolution of the identity, as applied to arbitrary functions of generalized coordinates and momenta. 相似文献
3.
Toward Fuzzy Optimization without Mathematical Ambiguity 总被引:15,自引:0,他引:15
Baoding Liu 《Fuzzy Optimization and Decision Making》2002,1(1):43-63
Fuzzy programming has been discussed widely in literature and applied in such various disciplines as operations research, economic management, business administration, and engineering. The main purpose of this paper is to present a brief review on fuzzy programming models, and classify them into three broad classes: expected value model, chance-constrained programming and dependent-chance programming. In order to solve general fuzzy programming models, a hybrid intelligent algorithm is also documented. Finally, some related topics are discussed. 相似文献
4.
Experimental analysis, modeling, and theoretical design of McMaster pore-filled nanofiltration membranes 总被引:1,自引:0,他引:1
A side-by-side comparison of the performance of McMaster pore-filled (MacPF) and commercial nanofiltration (NF) membranes is presented here. The single-salt and multi-component performance of these membranes is studied using experimental data and using a mathematical model. The pseudo two-dimensional model is based on the extended Nernst–Planck equation, a modified Poisson–Boltzmann equation, and hydrodynamic calculations. The model includes four structural properties of the membrane: pore radius, pure water permeability, surface charge density and the ratio of effective membrane thickness to water content. The analysis demonstrates that the rejection and transport mechanisms are the same in the commercial and MacPF membranes with different contributions from each type of mechanism (convection, diffusion and electromigration). Solute rejection in NF membranes is determined primarily by a combination of steric and electrostatic effects. The selectivity of MacPF membranes is primarily determined by electrostatic effects with a significantly smaller contribution of steric effects compared to commercial membranes. Hence, these membranes have the ability to reject ions while remaining highly permeable to low molecular weight organics. Additionally, a new theoretical membrane design approach is presented. This design procedure potentially offers the optimization of NF membrane performance by tailoring the membrane structure and operating variables to the specific process, simultaneously. The procedure is validated at the laboratory scale. 相似文献
5.
对求解非线性方程方法的探索 总被引:2,自引:0,他引:2
BaiCL在2001年提出了双曲函数法,并把解设成具体的双曲函数,即sinhw和coshw的线性组合.本文把解设成是由2个函数f(ξ)和g(ξ)组成的线性组合,它们可以有多种取法,从而使方程更直接、更有效.借助数学软件Maple,用改进后的方法和吴文俊消元法,求解Bai C L文中的一个例子,获得了包含Bai文结果在内的更为丰富、精确的行波解. 相似文献
6.
A new prediction technique is proposed for chaotic time series. The usefulness of the technique is thatit can kick off some false neighbor points which are not suitable for the local estimation of the dynamics systems. Atime-delayed embedding is used to reconstruct the underlying attractor, and the prediction model is based on the timeevolution of the topological neighboring in the phase space. We use a feedforward neural network to approximate thelocal dominant Lyapunov exponent, and choose the spatial neighbors by the Lyapunov exponent. The model is testedfor the Mackey-Glass equation and the convection amplitude of lorenz systems. The results indicate that this predictiontechnique can improve the prediction of chaotic time series. 相似文献
7.
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 相似文献
8.
网络股泡沫大小测度研究 总被引:1,自引:0,他引:1
网络股泡沫是最能反映网络泡沫本质的表现形式,本文利用理性预期理论,构建了网络股泡沫大小的测度模型,说明网络股泡沫的存在,在此基础上确定了网络股泡沫大小的测度指标,并以雅虎公司股票为例对泡沫的大小进行了测度,结果符合网络泡沫的实际情况。 相似文献
9.
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. 相似文献
10.