全文获取类型
收费全文 | 4529篇 |
免费 | 265篇 |
国内免费 | 242篇 |
专业分类
化学 | 1257篇 |
晶体学 | 9篇 |
力学 | 628篇 |
综合类 | 25篇 |
数学 | 1769篇 |
物理学 | 1348篇 |
出版年
2024年 | 2篇 |
2023年 | 106篇 |
2022年 | 79篇 |
2021年 | 71篇 |
2020年 | 116篇 |
2019年 | 81篇 |
2018年 | 77篇 |
2017年 | 157篇 |
2016年 | 151篇 |
2015年 | 115篇 |
2014年 | 289篇 |
2013年 | 326篇 |
2012年 | 237篇 |
2011年 | 274篇 |
2010年 | 230篇 |
2009年 | 352篇 |
2008年 | 359篇 |
2007年 | 318篇 |
2006年 | 225篇 |
2005年 | 196篇 |
2004年 | 180篇 |
2003年 | 153篇 |
2002年 | 144篇 |
2001年 | 109篇 |
2000年 | 113篇 |
1999年 | 78篇 |
1998年 | 68篇 |
1997年 | 57篇 |
1996年 | 47篇 |
1995年 | 43篇 |
1994年 | 44篇 |
1993年 | 28篇 |
1992年 | 31篇 |
1991年 | 25篇 |
1990年 | 8篇 |
1989年 | 16篇 |
1988年 | 21篇 |
1987年 | 10篇 |
1986年 | 13篇 |
1985年 | 15篇 |
1984年 | 18篇 |
1983年 | 9篇 |
1982年 | 10篇 |
1981年 | 7篇 |
1980年 | 6篇 |
1979年 | 7篇 |
1978年 | 4篇 |
1977年 | 3篇 |
1976年 | 4篇 |
1971年 | 2篇 |
排序方式: 共有5036条查询结果,搜索用时 31 毫秒
1.
Dean A. Carlson 《Journal of Mathematical Analysis and Applications》2002,276(2):561-588
The method of equivalent variational methods, originally due to Carathéodory for free problems in the calculus of variations is extended to investigate feedback Nash equilibria for a class of n-person differential games. Both the finite-horizon and infinite-horizon cases are considered. Examples are given to illustrate the presented results. 相似文献
2.
Vivek F. Farias 《Operations Research Letters》2006,34(2):180-190
We consider a problem of allocating limited quantities of M types of resources among N independent activities that evolve over T epochs. In each epoch, we assign to each activity a task which consumes resources, generates utility, and determines the subsequent state of the activity. We study the complexity of, and approximation algorithms for, maximizing average utility. 相似文献
3.
The multilevel generalized assignment problem is a problem of assigning agents to tasks where the agents can perform tasks at more than one efficiency level. A profit is associated with each assignment and the objective of the problem is profit maximization. Two heuristic solution methods are presented for the problem. The heuristics are developed from solution methods for the generalized assignment problem. One method uses a regret minimization approach whilst the other method uses a repair approach on a relaxation of the problem. The heuristics are able to solve moderately large instances of the problem rapidly and effectively. Procedures for deriving an upper bound on the solution of the problem are also described. On larger and harder instances of the problem one heuristic is particularly effective. 相似文献
4.
An optical measurement of vortex shape at a free surface 总被引:1,自引:0,他引:1
We have proposed an optical method of vortex shape measurement based on Fourier transform profilometry (FTP) and verified it by experiment. The results of our experiment proposed in this paper show that FTP can efficiently reconstruct the vortex shape at a free surface and this method is suitable for wide use in studying such problems as liquid shear flow, wake of an object, flow behind a bluff body, and wetting angle. 相似文献
5.
Josep Maria Izquierdo 《TOP》2006,14(2):375-398
The paper introduces a refinement of the notion of population monotonic allocation scheme, called regular population monotonic
allocation scheme (regularpmas). This refinement is based on economic situations in which players may have to select new partners from a set of potential
players and in which there exist certain capacity constraints. A sufficient condition for the existence of a regularpmas is given. For the class of games with regularpmas, we prove that the core coincides with the Davis and Maschler and the Mas-Colell bargaining sets. 相似文献
6.
Optimization technologies and environmental applications 总被引:1,自引:0,他引:1
7.
8.
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 相似文献
9.
基于MATLAB的异步电动机线性化控制系统的仿真 总被引:1,自引:0,他引:1
从异步电动机在同步旋转坐标系下的状态方程出发,在一定的条件下,对其系数矩阵简化.推出异步电动机的线性化控制模型.并基于该模型得出异步电动机的线性化控制系统.以给定电机为例,对该模型的有效性、响应用MATLAB进行仿真分析.验证的结果说明上述模型具有实用价值. 相似文献
10.
Based on the Fourier transform method, a simple closed-form expression for the on-axis power spectrum of ultrashort Gaussian pulsed beams in diffraction at a circular aperture is derived, which permits us to study spectral changes both analytically and numerically. It is shown that for diffracted pulsed beams there exist spectral red and blue shifts, spectral narrowing, and spectral switches in the near field. The aperture diffraction plays an important role in spectral switching, but both the truncation parameter and bandwidth (or equally, Fourier transform limited pulse duration) affect the behavior of spectral switches. 相似文献