全文获取类型
收费全文 | 100668篇 |
免费 | 4218篇 |
国内免费 | 2986篇 |
专业分类
化学 | 40320篇 |
晶体学 | 1062篇 |
力学 | 8042篇 |
综合类 | 239篇 |
数学 | 34334篇 |
物理学 | 23875篇 |
出版年
2024年 | 78篇 |
2023年 | 504篇 |
2022年 | 818篇 |
2021年 | 847篇 |
2020年 | 984篇 |
2019年 | 905篇 |
2018年 | 10989篇 |
2017年 | 10794篇 |
2016年 | 7034篇 |
2015年 | 1854篇 |
2014年 | 1570篇 |
2013年 | 1964篇 |
2012年 | 5793篇 |
2011年 | 12409篇 |
2010年 | 6958篇 |
2009年 | 7299篇 |
2008年 | 8010篇 |
2007年 | 10029篇 |
2006年 | 1536篇 |
2005年 | 2352篇 |
2004年 | 2357篇 |
2003年 | 2659篇 |
2002年 | 1607篇 |
2001年 | 755篇 |
2000年 | 795篇 |
1999年 | 739篇 |
1998年 | 674篇 |
1997年 | 570篇 |
1996年 | 629篇 |
1995年 | 501篇 |
1994年 | 431篇 |
1993年 | 417篇 |
1992年 | 321篇 |
1991年 | 291篇 |
1990年 | 284篇 |
1989年 | 217篇 |
1988年 | 177篇 |
1987年 | 141篇 |
1986年 | 154篇 |
1985年 | 111篇 |
1984年 | 79篇 |
1983年 | 75篇 |
1982年 | 78篇 |
1981年 | 59篇 |
1980年 | 54篇 |
1979年 | 50篇 |
1914年 | 45篇 |
1912年 | 40篇 |
1909年 | 41篇 |
1908年 | 40篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
51.
It is widely accepted that next-generation networks will provide guaranteed services, in contrast to the “best effort” approach today. We study and analyze queueing policies for network switches that support the QoS (Quality of Service) feature. One realization of the QoS feature is that packets are not necessarily all equal, with some having higher priorities than the others. We model this situation by assigning an intrinsic value to each packet. In this paper we are concerned with three different queueing policies: the nonpreemptive model, the FIFO preemptive model, and the bounded delay model. We concentrate on the situation where the incoming traffic overloads the queue, resulting in packet loss. The objective is to maximize the total value of packets transmitted by the queueing policy. The difficulty lies in the unpredictable nature of the future packet arrivals. We analyze the performance of the online queueing policies via competitive analysis, providing upper and lower bounds for the competitive ratios. We develop practical yet sophisticated online algorithms (queueing policies) for the three queueing models. The algorithms in many cases have provably optimal worst-case bounds. For the nonpreemptive model, we devise an optimal online algorithm for the common 2-value model. We provide a tight logarithmic bound for the general nonpreemptive model. For the FIFO preemptive model, we improve the general lower bound to 1.414, while showing a tight bound of 1.434 for the special case of queue size 2. We prove that the bounded delay model with uniform delay 2 is equivalent to a modified FIFO preemptive model with queue size 2. We then give improved upper and lower bounds on the 2-uniform bounded delay model. We also show an improved lower bound of 1.618 for the 2-variable bounded delay model, matching the previously known upper bound. 相似文献
52.
M. Lashkarizadeh Bami 《Semigroup Forum》2004,69(2):219-229
In the present paper it is shown that if S1 and S2 are two
Clifford topological semigroups satisfying certain conditions
and T is an isometric isomorphism of LUC(S1*) onto LUC(S2*), then T
maps S1 topologically isomorphically onto S2. Furthermore, T
maps M
l
n(S1) (M(S1), respectively) isometrically
isomorphically onto M
l
n(S2) (M(S2), respectively). Indeed,
we have obtained a generalization of a well-known result of
Ghahramani, Lau and Losert for locally compact groups to a more
general setting of Clifford topological semigroups. 相似文献
53.
Andrew Barton 《The Journal of the Operational Research Society》1987,38(10):965-974
This paper describes some work carried out in the Scientific Research and Development Branch (SRDB) of the Home Office, intended to contribute to an overall aim of building up internal expertise in the field of expert systems. This was done by carrying out a number of pilot and demonstrator projects, two of which are described in some detail. The plan, which proved successful, was to build as far as possible on the relevant skills already possessed by an OR group in the branch. The lessons learned from these are summarized in the hope that they will be of use to other groups who wish to become involved in this important area. 相似文献
54.
55.
Xuding Zhu 《Journal of Graph Theory》2005,48(3):186-209
For 1 ≤ d ≤ k, let Kk/d be the graph with vertices 0, 1, …, k ? 1, in which i ~j if d ≤ |i ? j| ≤ k ? d. The circular chromatic number χc(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to Kk/d. The circular clique number ωc(G) of G is the maximum of those k/d for which Kk/d admits a homomorphism to G. A graph G is circular perfect if for every induced subgraph H of G, we have χc(H) = ωc(H). In this paper, we prove that if G is circular perfect then for every vertex x of G, NG[x] is a perfect graph. Conversely, we prove that if for every vertex x of G, NG[x] is a perfect graph and G ? N[x] is a bipartite graph with no induced P5 (the path with five vertices), then G is a circular perfect graph. In a companion paper, we apply the main result of this paper to prove an analog of Haj?os theorem for circular chromatic number for k/d ≥ 3. Namely, we shall design a few graph operations and prove that for any k/d ≥ 3, starting from the graph Kk/d, one can construct all graphs of circular chromatic number at least k/d by repeatedly applying these graph operations. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 186–209, 2005 相似文献
56.
57.
Chris Hope 《The Journal of the Operational Research Society》2003,54(11):1167-1176
What strategy should a football (soccer, in American parlance) club adopt when deciding whether to sack its manager? This paper introduces a simple model assuming that a club's objective is to maximize the number of league points that it scores per season. The club's strategy consists of three choices: the length of the honeymoon period during which it will not consider sacking a new manager, the level of the performance trapdoor below which the manager get the sack, and the weight that it will give to more recent games compared to earlier ones. Some data from the last six seasons of the English Premiership are used to calibrate the model. At this early stage of the research, the best strategy appears to have only a short honeymoon period of eight games (much less than the actual shortest period of 12 games), to set the trapdoor at 0.74 points per game, and to put 47% of the weight on the last five games. A club adopting this strategy would obtain on average 56.8 points per season, compared to a Premiership average of 51.8 points. 相似文献
58.
59.
Dominique Fourdrinier William E. Strawderman 《Annals of the Institute of Statistical Mathematics》2003,55(4):803-816
We consider estimation of loss for generalized Bayes or pseudo-Bayes estimators of a multivariate normal mean vector, θ. In
3 and higher dimensions, the MLEX is UMVUE and minimax but is inadmissible. It is dominated by the James-Stein estimator and by many others. Johnstone (1988,
On inadmissibility of some unbiased estimates of loss,Statistical Decision Theory and Related Topics, IV (eds. S. S. Gupta and J. O. Berger), Vol. 1, 361–379, Springer, New York) considered the estimation of loss for the usual
estimatorX and the James-Stein estimator. He found improvements over the Stein unbiased estimator of risk. In this paper, for a generalized
Bayes point estimator of θ, we compare generalized Bayes estimators to unbiased estimators of loss. We find, somewhat surprisingly,
that the unbiased estimator often dominates the corresponding generalized Bayes estimator of loss for priors which give minimax
estimators in the original point estimation problem. In particular, we give a class of priors for which the generalized Bayes
estimator of θ is admissible and minimax but for which the unbiased estimator of loss dominates the generalized Bayes estimator
of loss. We also give a general inadmissibility result for a generalized Bayes estimator of loss.
Research supported by NSF Grant DMS-97-04524. 相似文献
60.
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 相似文献