首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   709篇
  免费   24篇
  国内免费   87篇
化学   459篇
晶体学   2篇
力学   18篇
综合类   5篇
数学   211篇
物理学   125篇
  2023年   13篇
  2022年   9篇
  2021年   14篇
  2020年   11篇
  2019年   12篇
  2018年   8篇
  2017年   17篇
  2016年   18篇
  2015年   13篇
  2014年   41篇
  2013年   49篇
  2012年   40篇
  2011年   51篇
  2010年   35篇
  2009年   63篇
  2008年   58篇
  2007年   60篇
  2006年   38篇
  2005年   34篇
  2004年   39篇
  2003年   17篇
  2002年   20篇
  2001年   18篇
  2000年   17篇
  1999年   17篇
  1998年   13篇
  1997年   12篇
  1996年   16篇
  1995年   13篇
  1994年   12篇
  1993年   7篇
  1992年   4篇
  1991年   4篇
  1990年   1篇
  1989年   5篇
  1988年   3篇
  1987年   2篇
  1986年   3篇
  1985年   1篇
  1984年   1篇
  1983年   2篇
  1982年   3篇
  1981年   2篇
  1980年   1篇
  1979年   2篇
  1978年   1篇
排序方式: 共有820条查询结果,搜索用时 31 毫秒
1.
A combined experimental and computational approach was used to distinguish between different polymorphs of the pharmaceutical drug aspirin. This method involves the use of ab initio random structure searching (AIRSS), a density functional theory (DFT)-based crystal structure prediction method for the high-accuracy prediction of polymorphic structures, with DFT calculations of nuclear magnetic resonance (NMR) parameters and solid-state NMR experiments at natural abundance. AIRSS was used to predict the crystal structures of form-I and form-II of aspirin. The root-mean-square deviation between experimental and calculated 1H chemical shifts was used to identify form-I as the polymorph present in the experimental sample, the selection being successful despite the large similarities between the molecular environments in the crystals of the two polymorphs.  相似文献   
2.
We present a new data structure for a set of n convex simply-shaped fat objects in the plane, and use it to obtain efficient and rather simple solutions to several problems including (i) vertical ray shooting—preprocess a set of n non-intersecting convex simply-shaped flat objects in 3-space, whose xy-projections are fat, for efficient vertical ray shooting queries, (ii) point enclosure—preprocess a set C of n convex simply-shaped fat objects in the plane, so that the k objects containing a query point p can be reported efficiently, (iii) bounded-size range searching— preprocess a set C of n convex fat polygons, so that the k objects intersecting a “not-too-large” query polygon can be reported efficiently, and (iv) bounded-size segment shooting—preprocess a set C as in (iii), so that the first object (if exists) hit by a “not-too-long” oriented query segment can be found efficiently. For the first three problems we construct data structures of size O(λs(n)log3n), where s is the maximum number of intersections between the boundaries of the (xy-projections) of any pair of objects, and λs(n) is the maximum length of (n, s) Davenport-Schinzel sequences. The data structure for the fourth problem is of size O(λs(n)log2n). The query time in the first problem is O(log4n), the query time in the second and third problems is O(log3n + klog2n), and the query time in the fourth problem is O(log3n).

We also present a simple algorithm for computing a depth order for a set as in (i), that is based on the solution to the vertical ray shooting problem. (A depth order for , if exists, is a linear order of , such that, if K1, K2 and K1 lies vertically above K2, then K1 precedes K2.) Unlike the algorithm of Agarwal et al. (1995) that might output a false order when a depth order does not exist, the new algorithm is able to determine whether such an order exists, and it is often more efficient in practical situations than the former algorithm.  相似文献   

3.
本文首先将文[1]中的BLD映射推广为弱(L1,L2)-BLD映射,并证明了如下正则性结果:存在两个可积指数 P1=P1(n,L1,L2)<n<q1=q1(n,L1,L2),使得对任意弱(L1,L2)-BLD映射f∈(Ω,Rn),都有f∈(Ω,Rn),即f为(L1,L2)-BLD映射.  相似文献   
4.
5.
Nanostructured lanthanum–strontium manganites were synthesized using two different co-precipitation approaches, one in bulk solution, and the other in reverse micelles of CTAB/1-hexanol/water microemulsion. In both cases, precursor cations were precipitated by using oxalic acid. The properties of the materials synthesized by using these two methods were compared in order to reveal potential advantages of the microemulsion-assisted approach. The influence of the annealing conditions on the properties of synthesized manganites was investigated by using X-ray diffraction, transmission electron microscopy, differential thermal analysis, thermogravimetric analysis and magnetic measurements.  相似文献   
6.
7.
We give a competitive algorithm to identify all d defective edges in a hypergraph with d unknown. Damaschke did the d=1 case for 2-graphs, Triesch extended the d=1 case to r-graphs, and Johann did the general d case for 2-graphs. So ours is the first attempt to solve the searching for defective edges problem in its full generality. Further, all the above three papers assumed d known. We give a competitive algorithm where d is unknown.  相似文献   
8.
Nanoparticles of complex manganites (viz. LaMnO3, La0.67Sr0.33MnO3 and La0.67Ca{0.33}MnO3) have been synthesized using the reverse micellar route. These manganites are prepared at 800‡C and the monophasic nature of all the oxides has been established by powder X-ray diffraction studies. TEM studies show an average grain size of 68, 80 and 50 nm for LaMnO3, La0.67Sr0.33MnO3 and La0.67Ca{0.33}MnO3respectively. Ferromagnetic ordering is observed at around 250 K for LaMnO3, 350 K for La0.67Sr0.33MnO3 and 200 K for La0.67Ca{0.33}MnO3. These Curie temperatures correspond well with those reported for bulk materials with similar composition.  相似文献   
9.
We explore M/G/∞ systems ‘fed’ by Poissonian inflows with infinite arrival rates. Three processes – corresponding to the system's state, workload, and queue-size – are studied and analyzed. Closed form formulae characterizing the system's stationary structure and correlation structure are derived. And, the issues of queue finiteness, workload summability, and Long Range Dependence are investigated. We then turn to devise a ‘reverse engineering’ scheme for the design of the system's correlation structure. Namely: how to construct an M/G/∞ system with a pre-desired ‘target’ workload/queue auto-covariance function. The ‘reverse engineering’ scheme is applied to various examples, including ones with infinite queues and non-summable workloads. AMS Subject Classifications Primary: 60K25; Secondary: 60G55, 60G10  相似文献   
10.
The block copolymer of polystyrene-b-poly(butyl acrylate) (PSt-b-PBA) with a well-defined structure was synthesized by atom transfer radical polymerization (ATRP); its structure was characterized, and the living polymerization was also validated by gel permeation chromatography, Fourier transform infrared, and 1H NMR measurements. Then, the amphiphilic block copolymer of polystyrene-b-poly(acrylic acid) (PSt-b-PAA) has been prepared by hydrolysis of PSt-b-PBA, and copolymers of PSt-b-PAA with longer PSt blocks and shorter PAA blocks were obtained by controlling the conditions of ATRP polymerization. The reversed micelle solution of PSt-b-PAA in toluene was prepared by using the single-solvent dissolving method, and the reverse micellization behavior of PSt-b-PAA in toluene was mainly investigated in this paper. The fluorescent probe technique was used by using polar fluorescence compound N-(1-Naphthyl)ethylenediamine dihydrochloride (NEAH) as a polar fluorescent probe to study the reverse micellization behavior of PSt-b-PAA. It was found that the reverse micellization behaviors of PSt-b-PAA in toluene can be clearly revealed by using NEAH as a polar fluorescence probe, and the critical micelle concentrations (cmcs) can be well displayed. The experimental results showed that the self-assembling behavior of PSt-b-PAA in toluene depends apparently on the microstructure of the macromolecules and is also influenced by the temperature. For the copolymers of PSt-b-PAA with the same length of hydrophobic PSt blocks, the copolymer with a longer hydrophilic block PAA has lower cmc, and at higher temperature, the copolymer has lower cmc.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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