首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1674篇
  免费   31篇
  国内免费   2篇
化学   1099篇
晶体学   11篇
力学   24篇
数学   305篇
物理学   268篇
  2022年   18篇
  2021年   14篇
  2020年   17篇
  2019年   20篇
  2018年   19篇
  2017年   27篇
  2016年   22篇
  2015年   17篇
  2014年   36篇
  2013年   85篇
  2012年   84篇
  2011年   78篇
  2010年   51篇
  2009年   56篇
  2008年   112篇
  2007年   90篇
  2006年   81篇
  2005年   72篇
  2004年   68篇
  2003年   46篇
  2002年   55篇
  2001年   23篇
  2000年   18篇
  1999年   11篇
  1997年   12篇
  1996年   26篇
  1995年   17篇
  1994年   21篇
  1993年   16篇
  1992年   21篇
  1991年   13篇
  1990年   14篇
  1989年   19篇
  1988年   24篇
  1987年   19篇
  1986年   8篇
  1985年   30篇
  1984年   34篇
  1983年   22篇
  1982年   38篇
  1981年   29篇
  1980年   22篇
  1979年   19篇
  1978年   28篇
  1977年   18篇
  1976年   21篇
  1974年   15篇
  1973年   30篇
  1972年   13篇
  1971年   12篇
排序方式: 共有1707条查询结果,搜索用时 15 毫秒
141.
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large as possible. This game is in the spirit of recent papers on avoiding a giant component, but here we embrace it. We analyze this game in the offline and online setting, for arbitrary and random instances, which provides for interesting comparisons. For arbitrary instances, we find that the competitive ratio (the best possible solution value divided by best possible online solution value) is large. For “sparse” random instances the competitive ratio is also large, with high probability (whp); If the instance has ¼(1 + ε)n random edge pairs, with 0 < ε ≤ 0.003, then any online algorithm generates a component of size O((log n)3/2) whp , while the optimal offline solution contains a component of size Ω(n) whp . For “dense” random instances, the average‐case competitive ratio is much smaller. If the instance has ½(1 ? ε)n random edge pairs, with 0 < ε ≤ 0.015, we give an online algorithm which finds a component of size Ω(n) whp . © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2005  相似文献   
142.
This paper presents a new computer-based atomic level simulation of an ideal gas. The simulation is written in Java and is accessed by students through a Web browser. This software is used in conjunction with a written laboratory experiment developed within the framework of an inquiry instructional strategy. This molecular-level laboratory experiment is used in combination with a parallel macroscopic laboratory experiment. We hypothesize that students exposed to these kinds of parallel activities will be better able to link the macroscopic, microscopic, and symbolic understanding of chemical concepts.Presented at the ACS Division of Chemical Education sponsored symposium on web-assisted learning in chemistry at its 221st national meeting in San Diego, CA April 1–5, 2001.  相似文献   
143.
A gas chromatographic headspace analysis method was used to experimentally determine gas-to-liquid partition coefficients and infinite dilution activity dilution for 14 different aliphatic and cyclic hydrocarbons (alkanes, cycloalkanes, alkenes, alkynes), eight different aromatic compounds (benzene, alkylbenzenes, halobenzenes), five different chloroalkanes (dichloromethane, trichloromethane, 1-chlorobutane, 1,2-dichloropropane, isopropylbromide), tetrahydrofuran, butyl acetate, and acetonitrile dissolved in diethylene glycol at 298.15 K. Solubilities were also measured at 298.15 K for 31 crystalline nonelectrolyte organic solutes including several polycyclic aromatic hydrocarbons and substituted benzoic acid derivatives. The experimental results of the headspace chromatographic and spectroscopic solubility measurements were converted to gas-to-diethylene glycol and water-to-diethylene glycol partition coefficients, and molar solubility ratios using standard thermodynamic relationships. Expressions were derived for solute transfer into diethylene glycol from the calculated partition coefficients and solubility ratios. Mathematical correlations based on the Abraham model describe the observed partition coefficient and solubility data to within 0.14 log10 units (or less).  相似文献   
144.
Single crystals of the title compound are obtained from a melt of U3O8, MoO3, and excess Cs2CO3 (Pt crucible, 950 °C, 12 h, cooling rate 5 °C/h).  相似文献   
145.
146.
Single crystals of nickel malonate dihydrate were grown by the gel technique, employing the single diffusion method. Thermal dehydration of the crystal was investigated by thermogravimetric and differential thermal analyses. The title compound exhibits a steady thermal behaviour at higher temperature range of 350-800 °C. The dielectric properties of the prepared sample were analyzed as a function of frequency in the range of 1 kHz-1 MHz and at temperatures between 40 and 140 °C.  相似文献   
147.
In this paper, we propose a nonlinear fractional order model in order to explain and understand the outbreaks of influenza A(H1N1). In the fractional model, the next state depends not only upon its current state but also upon all of its historical states. Thus, the fractional model is more general than the classical epidemic models. In order to deal with the fractional derivatives of the model, we rely on the Caputo operator and on the Grünwald–Letnikov method to numerically approximate the fractional derivatives. We conclude that the nonlinear fractional order epidemic model is well suited to provide numerical results that agree very well with real data of influenza A(H1N1) at the level population. In addition, the proposed model can provide useful information for the understanding, prediction, and control of the transmission of different epidemics worldwide. Copyright © 2013 John Wiley & Sons, Ltd.  相似文献   
148.
In this paper, we address an optimization problem resulting from the combination of the well-known travelling salesman and knapsack problems. In particular, we target the orienteering problem, originated in the context of sport, which consists of maximizing the total score associated with the vertices visited in a path within the available time. The problem, also known as the selective travelling salesman problem, is NP-hard and can be formulated as an integer linear program. Since the 1980s, several solution methods for this problem have been developed and applied to a variety of fields, particularly in routing and tourism. We propose a heuristic method—based on the Greedy Randomized Adaptive Search Procedure (GRASP) and the Path Relinking methodologies—for finding approximate solutions to this optimization problem. We explore different constructive methods and combine two neighbourhoods in the local search of GRASP. Our experimentation with 196 previously reported instances shows that the proposed procedure obtains high-quality solutions employing short computing times.  相似文献   
149.
During the last three decades, the impact of visualization processes on the teaching and learning of mathematics has been extensively researched. However, considerably less work has been devoted to haptic processes. In this paper, we describe and analyze the role of haptic processes from data collected in mathematics lessons taught in a school for blind students. The analysis builds upon studies from perception and also from teaching experiences in order to examine the teacher’s and the students’ hand movements and metaphors when handling solids of revolution and communicating verbally with each other about their insights. We highlight the powerful combination of the visual and the haptic components of their interactions for the conceptualization of mathematical experiences, and we also note the critical role mathematical language plays in supporting the teaching–learning processes in this context. Finally, we consider important educational implications not only for blind people, but for all students and teachers of mathematics.  相似文献   
150.
This note proves a conjecture of Merris that the minimal value of entries of the doubly stochastic matrix of the degree antiregular graph En of order n ≥ 3 is equal to (l/2(n + l)).  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号