全文获取类型
收费全文 | 256篇 |
免费 | 1篇 |
国内免费 | 1篇 |
专业分类
化学 | 77篇 |
晶体学 | 1篇 |
力学 | 14篇 |
数学 | 139篇 |
物理学 | 27篇 |
出版年
2020年 | 2篇 |
2019年 | 4篇 |
2017年 | 3篇 |
2016年 | 7篇 |
2015年 | 4篇 |
2014年 | 4篇 |
2013年 | 10篇 |
2012年 | 2篇 |
2011年 | 8篇 |
2010年 | 5篇 |
2009年 | 13篇 |
2008年 | 11篇 |
2007年 | 14篇 |
2006年 | 9篇 |
2005年 | 4篇 |
2004年 | 9篇 |
2003年 | 12篇 |
2002年 | 9篇 |
2001年 | 5篇 |
1998年 | 2篇 |
1997年 | 2篇 |
1996年 | 6篇 |
1995年 | 7篇 |
1994年 | 2篇 |
1993年 | 2篇 |
1992年 | 4篇 |
1990年 | 2篇 |
1989年 | 6篇 |
1988年 | 3篇 |
1987年 | 5篇 |
1986年 | 4篇 |
1985年 | 2篇 |
1984年 | 7篇 |
1983年 | 8篇 |
1982年 | 8篇 |
1980年 | 3篇 |
1979年 | 2篇 |
1978年 | 5篇 |
1977年 | 9篇 |
1975年 | 2篇 |
1974年 | 4篇 |
1973年 | 4篇 |
1972年 | 2篇 |
1967年 | 2篇 |
1966年 | 2篇 |
1965年 | 2篇 |
1963年 | 1篇 |
1938年 | 1篇 |
1937年 | 1篇 |
1935年 | 3篇 |
排序方式: 共有258条查询结果,搜索用时 15 毫秒
81.
Steven Jackel Avi Meir Zvi Horvitz Inon Moshe Yehoshua Shimoni Yaakov Lumer Revital Feldman Izhak Hershko Yotam Pekin 《Optics & Laser Technology》2011,43(3):687-696
In this paper we investigate the source of failure in commercial, microchannel cooled CW diode bars placed in 12 bar horizontal arrays. The arrays were used to pump Nd:YAG rods in our 10 kW developmental laser. The laser was operated at low duty factor over a period of over 2 years. Experimental evidence indicated that the sudden, catastrophic failure was because of degraded cooling. We used optical microscopes, an X-ray microfocus imager, and a thermal neutron scattering camera to look inside the microcoolers. Our investigations revealed only one possible failure mechanism: cooling flow reduction because of delamination of the Au coating the walls of the microcoolers and the entrapment of Au flakes within the microchannel structures. We observed blisters in the microcoolers under working bars, and flake-like structures in the microcoolers under burnt-out bars (all taken from the laser). We observed no evidence of either massive blockages because of electrochemical deposits, or of corrosion/erosion in the microchannel walls. Integral operation times of the high flow-rate cooling system and of the diodes themselves were too short by one and two orders of magnitude, respectively, to explain the observed failures. Microchannel immersion times in the deionized water were, however, long enough to allow for corrosion of metals that may have been exposed through defects in the Au coatings. Three-dimensional heat flow simulations showed that blockage of multiple microchannels towards the edge of a bar can easily lead to catastrophic temperature increases. 相似文献
82.
83.
84.
OBJECTIVES: (1) To examine attitudes towards termination of pregnancy (TOP) among high-risk and non-high-risk (for cystic fibrosis) Arab-Muslims, and (2) to examine the effect of an intervention, which among other things related explicitly to TOP. METHODS: The study comprised three groups: (1) an intervention group at high risk for CF, which received community genetic counseling; (2) a control group at high risk for CF, and (3) a control group from the general population. The latter two groups were exposed to minimal intervention. Attitudes were measured two or three times during a 1-year period (for the control and intervention groups, respectively). RESULTS: Predictors of an affected fetus being considered a legitimate cause for TOP were religiosity, familiarity with an affected child, and benefits of the test. Predictors of individuals (hypothetically) choosing abortion in the case of an affected fetus were education and age. No change occurred in the attitudes of participants (either experimental or control groups) in the course of 1 year. CONCLUSIONS: Other possible intervention options are discussed, and specifically, the advantages of using opinion leaders such as clergy and medical staff. 相似文献
85.
We study the stopping times of gossip algorithms for network coding. We analyze algebraic gossip (i.e., random linear coding) and consider three gossip algorithms for information spreading: Pull, Push, and Exchange. The stopping time of algebraic gossip is known to be linear for the complete graph, but the question of determining a tight upper bound or lower bounds for general graphs is still open. We take a major step in solving this question, and prove that algebraic gossip on any graph of size n is O(Δn) where Δ is the maximum degree of the graph. This leads to a tight bound of for bounded degree graphs and an upper bound of O(n2) for general graphs. We show that the latter bound is tight by providing an example of a graph with a stopping time of . Our proofs use a novel method that relies on Jackson's queuing theorem to analyze the stopping time of network coding; this technique is likely to become useful for future research. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 45, 185–217, 2014 相似文献
86.
A new sensitive surface-enhanced Raman scattering (SERS) assay for detection of cholinesterase inhibitors such as organophosphorous pesticides using silver colloidal nanoparticles was developed and optimized. Acetylcholinesterase (AChE) mediated the hydrolysis of acetylthiocholine to produce thiocholine, which interacted with the silver nanoparticles to give a specific SERS spectrum. Variation in enzyme activity due to inhibition was measured from changes in intensity of a characteristic peak (772 cm−1) of the SERS spectrum that was directly correlated with the concentration of produced thiocholine. The method was demonstrated for the detection of paraoxon as reference AChE inhibitor. Limit of detection of paraoxon for 5 min incubation at 25 °C was 1.8 × 10−8 M. This assay can be utilized for the detection of trace amounts of any AChE inhibitor. 相似文献
87.
Carina Curto Elizabeth Gross Jack Jeffries Katherine Morrison Zvi Rosen Anne Shiu Nora Youngs 《Journal of Pure and Applied Algebra》2019,223(9):3919-3940
A convex code is a binary code generated by the pattern of intersections of a collection of open convex sets in some Euclidean space. Convex codes are relevant to neuroscience as they arise from the activity of neurons that have convex receptive fields. In this paper, we develop algebraic methods to determine if a code is convex. Specifically, we use the neural ideal of a code, which is a generalization of the Stanley–Reisner ideal. Using the neural ideal together with its standard generating set, the canonical form, we provide algebraic signatures of certain families of codes that are non-convex. We connect these signatures to the precise conditions on the arrangement of sets that prevent the codes from being convex. Finally, we also provide algebraic signatures for some families of codes that are convex, including the class of intersection-complete codes. These results allow us to detect convexity and non-convexity in a variety of situations, and point to some interesting open questions. 相似文献
88.
Zvi Drezner Haresh Gurnani Barry A. Pasternack 《The Journal of the Operational Research Society》1995,46(7):887-891
In this paper, we present an economic order quantity (EOQ) model when two products are required, and one can be substituted for the other, if necessary, at a given unit cost. We consider three cases: (i) when there is no substitution between the products, (ii) when there is full substitution between the products, and (iii) when there is partial substitution between the products. In a deterministic setting with proportional substitution costs, we would expect to find full substitution or no substitution being optimal, depending on the cost parameters. However, we observe that full substitution is never optimal; only partial substitution or no substitution may be optimal. This result can best be explained due to the non-linearity of the decision variables in the total cost expression. Finally, we present an algorithm to compute the optimal order quantities. 相似文献
89.
The asymptotic behavior of the Weber location problem is investigated. We consider problems wheren demand points are randomly generated in a unit disk by a uniform distribution and all weights are equal to one. The main result of the paper is that the probability that the optimal solution be on a demand point is approximately 1/n. Additional results for a largen: the optimal solution converges almost surely to the center of the disk; the difference between the optimal value of the objective function and the minimal value of the objective function on a demand point converges to 1/2. 相似文献
90.
Zvi Drezner 《Journal of Applied Mathematics and Decision Sciences》2002,6(3):143-153
We propose a new heuristic for the solution of the quadratic assignment problem. The heuristic combines ideas from tabu search and genetic algorithms. Run times are very short compared with other heuristic procedures. The heuristic performed very well on a set of test problems. 相似文献