全文获取类型
收费全文 | 81篇 |
免费 | 0篇 |
专业分类
化学 | 29篇 |
数学 | 34篇 |
物理学 | 18篇 |
出版年
2021年 | 1篇 |
2019年 | 1篇 |
2018年 | 1篇 |
2017年 | 1篇 |
2015年 | 2篇 |
2014年 | 2篇 |
2013年 | 7篇 |
2012年 | 2篇 |
2010年 | 3篇 |
2009年 | 2篇 |
2008年 | 3篇 |
2007年 | 7篇 |
2006年 | 2篇 |
2005年 | 5篇 |
2003年 | 3篇 |
2002年 | 5篇 |
2001年 | 3篇 |
2000年 | 2篇 |
1999年 | 1篇 |
1998年 | 2篇 |
1996年 | 3篇 |
1994年 | 1篇 |
1992年 | 3篇 |
1991年 | 1篇 |
1990年 | 2篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1984年 | 4篇 |
1981年 | 3篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1970年 | 1篇 |
1963年 | 1篇 |
1954年 | 1篇 |
排序方式: 共有81条查询结果,搜索用时 31 毫秒
21.
Péter Bánhegyi Frigyes Wáczek Zsolt Székelyhidi Bálint Hegymegi-Barakonyi György Kéri 《合成通讯》2013,43(19):3270-3276
An unusual chemical method has been applied for the preparation of 1-benzothiophene-3-carboxamide derivatives from esters by reaction with lithium amide in tetrahydrofurane. 相似文献
22.
23.
It is shown that every homogeneous set of n points in d-dimensional Euclidean space determines at least
distinct distances for a constant c(d) > 0. In three-space the above general bound is slightly improved and it is shown that every homogeneous set of n points
determines at least
distinct distances. 相似文献
24.
Flip?KlijnEmail author Dries?Vermeulen Herbert?Hamers Tamás?Solymosi Stef?Tijs Joan Pere?Villar 《Mathematical Methods of Operations Research》2003,58(2):191-208
Neighbor games arise from certain matching or sequencing situations in which only some specific pairs of players can obtain a positive gain. As a consequence, the class of neighbor games is the intersection of the class of assignment games (Shapley and Shubik (1972)) and the class of component additive games (Curiel et al. (1994)). We first present some elementary features of neighbor games. After that we provide a polynomially bounded algorithm of order p
3 for calculating the leximax solution (cf. Arin and Iñarra (1997)) of neighbor games, where p is the number of players.
This authors work has been supported by CentER and the Department of Econometrics, Tilburg University and by the Foundation for the Hungarian Higher Education and Research (AMFK). 相似文献
25.
We show that the number of distinct distances in a set of n points in ℝ
d
is Ω(n
2/d − 2 / d(d + 2)), d ≥ 3. Erdős’ conjecture is Ω(n
2/d
). 相似文献
26.
It is shown that every set of n points in the plane has an element from which there are at least cn
6/7
other elements at distinct distances, where c>0 is a constant. This improves earlier results of Erdős, Moser, Beck, Chung, Szemerédi, Trotter, and Székely.
Received November 15, 2000, and in revised form December 13, 2000. Online publication April 6, 2001. 相似文献
27.
Frigyes Reis 《Applied Acoustics》2002,63(2):119-137
A significant part of the input data for planning the acoustical quality of building is the result of laboratory measurements. Detailed modelling of complex phenomena of sound transmission, like structure borne sound propagation can be solved based on on well planned laboratory experiences. However it seems the constructional details of the testing facilities have important effect on the measured results. The paper describes the process of planning the testing facilities of the Laboratory of Building Acoustics, TU Budapest, which operate as a standardised laboratory, a modelling “tool” for flanking transmission in research and development and which is utilised in teaching too. Some results and conclusions of recent experiments are also reported and discussed here related to the sound reduction index of a heavy brick wall without and with flanking transmission, to the impact sound insulation between the rest of a stair and an adjacent room and also to a possibility to determine the reduction of impact sound transmission of floor coverings. 相似文献
28.
The surface chemistry of isocyanic acid, HNCO, and its dissociation product, NCO, was studied on clean, O-dosed and Ar ion bombarded Au(111) surfaces. The techniques used are high resolution energy loss spectroscopy (HREELS) and temperature-programmed desorption (TPD). The structure of Ar ion etched surface is explored by scanning tunneling microscopy (STM). HNCO adsorbs molecularly on Au(111) surface at 100 K yielding strong losses at 1390, 2270 and 3230 cm? 1. The weakly adsorbed HNCO desorbs in two peaks characterized by Tp = 130 and 145 K. The dissociation of the chemisorbed HNCO occurs at 150 K to give NCO species characterized by a vibration at 2185 cm? 1. The dissociation process is facilitated by the presence of preadsorbed O and by defect sites on Au(111) produced by Ar ion bombardment. In the latter case the loss feature of NCO appeared at 2130 cm? 1. Isocyanate on Au(111) surface was found to be more stable than on the single crystal surfaces of Pt-group metals. Results are compared with those obtained on supported Au catalysts. 相似文献
29.
Mtys Milen Pter brnyi‐Balogh Rka Kangyal Andrs Dancs Dvid Frigyes Gyrgy Keglevich 《Heteroatom Chemistry》2014,25(4):245-255
Two series of bis(α‐aminophosphonates) were synthesized by one‐pot three‐component reactions using 4‐phenylenediamine, an aldehyde (2 equiv) and a phosphite (2 equiv), or terephtalaldehyde, an amine (2 equiv), and a phosphite (2 equiv) together with propylphosphonic anhydride (T3P®) in both series as a coupling reagent. The bis(α‐aminophosphonates) were obtained in moderate to excellent yields. The condensations take place under mild conditions and the isolation of the products is simple. 相似文献
30.
An algorithm for finding the nucleolus of assignment games 总被引:2,自引:0,他引:2
Tamás Solymosi Tirukkannamangai E. S. Raghavan 《International Journal of Game Theory》1994,23(2):119-143
Assignment games with side payments are models of certain two-sided markets. It is known that prices which competitively balance supply and demand correspond to elements in the core. The nucleolus, lying in the lexicographic center of the nonempty core, has the additional property that it satisfies each coalition as much as possible. The corresponding prices favor neither the sellers nor the buyers, hence provide some stability for the market. An algorithm is presented that determines the nucleolus of an assignment game. It generates a finite number of payoff vectors, monotone increasing on one side, and decreasing on the other. The decomposition of the payoff space and the lattice-type structure of the feasible set are utilized in associating a directed graph. Finding the next payoff is translated into determining the lengths of longest paths to the nodes, if the graph is acyclic, or otherwise, detecting the cycle(s). In an (m,n)-person assignment game withm = min(m,n) the nucleolus is found in at most 1/2·m(m + 3) steps, each one requiring at mostO(m·n) elementary operations. 相似文献