首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   10290篇
  免费   957篇
  国内免费   774篇
化学   5820篇
晶体学   45篇
力学   820篇
综合类   116篇
数学   3522篇
物理学   1698篇
  2024年   21篇
  2023年   72篇
  2022年   177篇
  2021年   231篇
  2020年   261篇
  2019年   291篇
  2018年   210篇
  2017年   329篇
  2016年   401篇
  2015年   328篇
  2014年   513篇
  2013年   847篇
  2012年   575篇
  2011年   613篇
  2010年   565篇
  2009年   623篇
  2008年   674篇
  2007年   733篇
  2006年   524篇
  2005年   503篇
  2004年   420篇
  2003年   379篇
  2002年   360篇
  2001年   325篇
  2000年   292篇
  1999年   250篇
  1998年   192篇
  1997年   205篇
  1996年   167篇
  1995年   172篇
  1994年   141篇
  1993年   104篇
  1992年   114篇
  1991年   94篇
  1990年   57篇
  1989年   51篇
  1988年   39篇
  1987年   20篇
  1986年   18篇
  1985年   26篇
  1984年   12篇
  1983年   14篇
  1982年   25篇
  1981年   7篇
  1980年   6篇
  1979年   9篇
  1978年   8篇
  1977年   5篇
  1973年   8篇
  1972年   2篇
排序方式: 共有10000条查询结果,搜索用时 265 毫秒
991.
恰有t行含对称正元的布尔方阵的幂敛指数的估值   总被引:1,自引:0,他引:1  
设Dn,2(t)为恰有t行含对称正元的n阶布尔方阵的集合,2≤t≤n。本文证明了,对于任给A∈Dn,2(t),幂敛指数k(A)≤∫(n-t-1)^2+1,3n-t-2,当t≤n-[3+√8n-7/2]当t〉n-[3+√8n-7/2],这里[x]表示不小于x的最小整数。同时,我们还证明了这个界是可以达到的,并且对Dn,2(t)的极矩阵集合作了部分刻划。  相似文献   
992.
Supply chain management (SCM) has become an important management paradigm. As supply chain members are often separate and independent economic entities, a key issue in SCM is to develop mechanisms that can align their objectives and coordinate their activities so as to optimize system performance. In this paper, we provide a review of coordination mechanisms of supply chain systems in a framework that is based on supply chain decision structure and nature of demand. This framework highlights the behavioral aspects and information need in the coordination of a supply chain. The identification of these issues points out several directions of future research in this area.  相似文献   
993.
In considering the retailer–supplier supply chain, this paper analyzes how a retailer reasonably decides both the depth and frequency of the price discount promotion including or excluding a supplier’s inventory decision. Assuming that the promotion frequency used by the retailer is probabilistic, we model a promotion-inventory decision under an AR(1) demand with a Markov switching promotion regime. After obtaining the optimal promotion plan, our analysis also considers the behavior of the optimal promotion decision; the retailer’s price format selection, either an Every-Day-Low-Price policy (EDLP) or a Promotion policy (HiLo); and the impact of information sharing of promotion status on the system’s performance. Our results suggest that a retailer tends to overpromote if inventory cost is excluded in its promotion decision, that increasing the market share is a preferable action for both the retailer and the supplier, that total margin and price-elasticity play an important role in selecting the price format, and that the profitability for a supplier of sharing promotion information depends on the transition probabilities of the Markov switching regime.  相似文献   
994.
We examine returns policy in a Newsboy framework. Unlike the prior literature, however, we assume that both supplier and retailer have limited and stochastic salvage capacities. We first analyze the case of integrated supply chain in which the agents’ decisions are fully coordinated for the joint profits. The result prescribes a partial returns policy, in which the retailer returns a part of the leftovers to the supplier and liquidates the remainder through its clearance sale. In a decentralized system, the supplier should motivate the retailer to duplicate the outcome of the integrated system in choosing order and returns quantities. We propose three coordination contracts, of which each uses two benefit transfer schemes as an incentive to the retailer, instead of using a single benefit scheme as in the prior literature. All three effectively coordinate the supply chain. The supplier, as a Stakelberg leader, chooses the most profitable one since each contract yields the different shares of the agents’ profits.  相似文献   
995.
Using a supply chain network, we demonstrate the feasibility, viability, and robustness of applying machine learning and genetic algorithms to respectively model, understand, and optimize such data intensive environments. Deployment of these algorithms, which learn from and optimize data, can obviate the need to perform more complex, expensive, and time consuming design of experiments (DOE), which usually disrupt system operations. We apply and compare the behavior and performance of the proposed machine learning algorithms to that obtained via DOE in a simulated Vendor Managed Replenishment system, developed for an actual firm. The results show that the models resulting from the proposed algorithms had strong explanatory and predictive power, comparable to that of DOE. The optimal system settings and profit were also similar to that obtained from DOE. The virtues of using machine learning and evolutionary algorithms to model and optimize data rich environments thus seem promising because they are automatic, involving little human intervention and expertise. We believe and are exploring how they can be made adaptive to improve parameter estimates with increasing data, as well as seamlessly detecting system (and therefore model) changes, thus being capable of recursively updating and reoptimizing a modified or new model.  相似文献   
996.
We discuss the synthesis and characterization of polyacrylamide (PAM) homopolymers with carefully controlled molecular weights (MWs). PAM was synthesized via free‐radical solution polymerization under conditions that yield highly linear polymer with minimal levels of hydrolysis. The MW of the PAM homopolymers was controlled by the addition of sodium formate (NaOOCH) to the polymerization medium as a conventional chain‐transfer agent. MWs and polydispersity indices (PDIs) were determined via size exclusion chromatography/multi‐angle laser light scattering analysis; for polymerizations carried out to high conversion, PAM MWs ranged from 0.23 to 6.19 × 106 g/mol, with most samples having PDI ≈2.0. Zero‐shear intrinsic viscosities of the polymers were determined via low‐shear viscometry in 0.514 M NaCl at 25 °C. Data derived from the polymer characterization were used to determine the chain‐transfer constant to NaOOCH under the given polymerization conditions and to calculate Mark–Houwink–Sakurada K and a values for PAM in 0.514 M NaCl at 25 °C. © 2003 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 41: 560–568, 2003  相似文献   
997.
一类n维非球谐振子势的精确解   总被引:9,自引:4,他引:5       下载免费PDF全文
龙超云  陈明伦  蔡绍洪 《物理学报》2003,52(8):1858-1861
严格求解一类n维非球谐振子势的定态薛定谔方程,获得了归一化径向波函数和能谱的 精确解.在此基础上导出径向矩阵元r,Ln|rs|n′ 4,L′n>的通项公式. 关键词: n维非球谐振子 精确解 径向矩阵元 通项公式  相似文献   
998.
ICP-AES测定蔬菜中18种矿物元素的研究   总被引:15,自引:0,他引:15  
本文探讨了ICP-AES测定蔬菜中18种矿物元素的方法,选择了合理测试条件。用国家计量局批准的GBW08504甘蓝标准物质核对了其中十种元素,得到满意结果。并用该法进行了样品分析,方法简便、快速。  相似文献   
999.
The paper concerns the possibilities for mathematical modelling of safety related systems (equipment oriented on safety). Some mathematical models have been required by the present European Standards for the railway transport. We are interested in the possibility of using Markov's models to meet these Standards. In the text an example of using that method in the interlocking equipment life cycle is given. An efficient aggregation/disaggregation method for computing some characteristics of Markov chains is presented.  相似文献   
1000.
Let τ be some triangulation of a planar polygonal domain Ω. Given a smooth functionu, we construct piecewise polynomial functionsvC ρ(Ω) of degreen=3 ρ for ρ odd, andn=3ρ+1 for ρ even on a subtriangulation τ3 of τ. The latter is obtained by subdividing eachT∈ρ into three triangles, andv/T is a composite triangular finite element, generalizing the classicalC 1 cubic Hsieh-Clough-Tocher (HCT) triangular scheme. The functionv interpolates the derivatives ofu up to order ρ at the vertices of τ. Polynomial degrees obtained in this way are minimal in the family of interpolation schemes based on finite elements of this type.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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