首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   274篇
  免费   1篇
  国内免费   1篇
化学   70篇
晶体学   1篇
力学   14篇
数学   162篇
物理学   29篇
  2020年   2篇
  2019年   4篇
  2018年   2篇
  2017年   3篇
  2016年   7篇
  2015年   5篇
  2014年   4篇
  2013年   11篇
  2012年   5篇
  2011年   11篇
  2010年   6篇
  2009年   14篇
  2008年   14篇
  2007年   15篇
  2006年   13篇
  2005年   4篇
  2004年   9篇
  2003年   14篇
  2002年   9篇
  2001年   5篇
  2000年   3篇
  1998年   2篇
  1997年   2篇
  1996年   6篇
  1995年   7篇
  1994年   2篇
  1993年   2篇
  1992年   4篇
  1990年   2篇
  1989年   6篇
  1988年   3篇
  1987年   3篇
  1986年   4篇
  1985年   3篇
  1984年   7篇
  1983年   8篇
  1982年   8篇
  1980年   3篇
  1979年   2篇
  1978年   7篇
  1977年   9篇
  1975年   2篇
  1974年   4篇
  1973年   4篇
  1972年   2篇
  1970年   1篇
  1967年   1篇
  1966年   2篇
  1965年   2篇
  1963年   1篇
排序方式: 共有276条查询结果,搜索用时 15 毫秒
81.
Optimal and Heuristic bounds are given for the optimal location to the Weber problem when the locations of demand points are not deterministic but may be within given circles. Rectilinear, Euclidean and square Euclidean types of distance measure are discussed. The exact shape of all possible optimal points is given in the rectilinear and square Euclidean cases. A heuristic method for the computation of the region of possible optimal points is developed in the case of Euclidean distance problem. The maximal distance between a possible optimal point and the deterministic solution is also computed heuristically.  相似文献   
82.
83.
We illustrate how a comparatively new technique, a Tabu search variable selection model [Drezner, Marcoulides and Salhi (1999)], can be applied efficiently within finance when the researcher must select a subset of variables from among the whole set of explanatory variables under consideration. Several types of problems in finance, including corporate and personal bankruptcy prediction, mortgage and credit scoring, and the selection of variables for the Arbitrage Pricing Model, require the researcher to select a subset of variables from a larger set. In order to demonstrate the usefulness of the Tabu search variable selection model, we: (1) illustrate its efficiency in comparison to the main alternative search procedures, such as stepwise regression and the Maximum R 2 procedure, and (2) show how a version of the Tabu search procedure may be implemented when attempting to predict corporate bankruptcy. We accomplish (2) by indicating that a Tabu Search procedure increases the predictability of corporate bankruptcy by up to 10 percentage points in comparison to Altman's (1968) Z-Score model.  相似文献   
84.
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.  相似文献   
85.
86.
87.
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.  相似文献   
88.
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 On) 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  相似文献   
89.
Surface-enhanced Raman scattering detection of cholinesterase inhibitors   总被引:1,自引:0,他引:1  
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.  相似文献   
90.
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.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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