首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   17516篇
  免费   662篇
  国内免费   71篇
系统科学   1120篇
丛书文集   30篇
教育与普及   21篇
理论与方法论   303篇
现状及发展   6585篇
研究方法   636篇
综合类   9425篇
自然研究   129篇
  2018年   743篇
  2017年   751篇
  2016年   457篇
  2012年   488篇
  2011年   1262篇
  2010年   896篇
  2009年   537篇
  2008年   736篇
  2007年   1023篇
  2006年   268篇
  2005年   289篇
  2004年   337篇
  2003年   355篇
  2002年   327篇
  2001年   448篇
  2000年   440篇
  1999年   292篇
  1992年   238篇
  1991年   198篇
  1990年   218篇
  1989年   194篇
  1988年   205篇
  1987年   221篇
  1986年   193篇
  1985年   257篇
  1984年   233篇
  1983年   172篇
  1982年   178篇
  1981年   183篇
  1980年   178篇
  1979年   414篇
  1978年   349篇
  1977年   258篇
  1976年   299篇
  1975年   268篇
  1974年   279篇
  1973年   237篇
  1972年   249篇
  1971年   323篇
  1970年   383篇
  1969年   266篇
  1968年   314篇
  1967年   304篇
  1966年   261篇
  1965年   185篇
  1964年   100篇
  1958年   165篇
  1957年   107篇
  1956年   96篇
  1955年   94篇
排序方式: 共有10000条查询结果,搜索用时 390 毫秒
51.
With time-based competition and rapid technology advancements, effective manufacturingscheduling and supply chain coordination are critical to quickly respond to changing marketconditions. These problems, however, are difficult in view of inherent complexity and variousuncertainties involved. Based on a series of results by the authors, decomposition and coordination byusing Lagrangian relaxation is identified in this paper as an effective way to control complexity anduncertainty.A manufacturing scheduling problem is first formulated within the job shop context withuncertain order arrivals, processing times, due dates, and part priorities as a separable optimizationproblem. A solution methodology that combines Lagrangian relaxation, stochastic dynamicprogramming, and heuristics is developed. Method improvements to effectively solve large problemsare also highlighted. To extend manufacturing scheduling within a factory to coordinate autonomicmembers across chains of suppliers, a decentralized supply chai  相似文献   
52.
We develop in this paper an efficient way to select the best subset threshold autoregressive model. The proposed method uses a stochastic search idea. Differing from most conventional approaches, our method does not require us to fix the delay or the threshold parameters in advance. By adopting the Markov chain Monte Carlo techniques, we can identify the best subset model from a very large of number of possible models, and at the same time estimate the unknown parameters. A simulation experiment shows that the method is very effective. In its application to the US unemployment rate, the stochastic search method successfully selects lag one as the time delay and five best models from more than 4000 choices. Copyright © 2003 John Wiley & Sons, Ltd.  相似文献   
53.
Shape skeletonization (i.e., medial axis extraction) is powerful in many visual computing applications, such as pattern recognition, object segmentation, registration, and animation. In this paper, the authors expand the use of diffusion equations combined with distance field information to approximate medial axes of arbitrary 3D differential properties. It offers an alternative solids represented by polygonal meshes based on their but natural way for medial axis extraction for commonly used 3D polygonal models. By solving the PDE along time axis, this system can not only quickly extract diffusion-based medial axes of input meshes, but also allow users to visualize the extraction process at each time step. In addition, the proposed model provides users a set of manipulation toolkits to sculpt extracted medial axes, then use diffusion-based techniques to recover corresponding deformed shapes according to the original input datasets. This skeleton-based shape manipulation offers a fast and easy way for animation and deformation of complicated mesh objects.  相似文献   
54.
This paper reflects on my experience as an insider researcher attempting to use critical systems ideas and practices to promote quality improvement in a university engineering department. Reflection is a key part of learning. This paper is intended to contribute to critically, self-reflective learning for the community of systems practitioners. These reflections on my questions about participation, ethics, politics of process, and the choices and actions resulting from them may help others to formulate their own. The complexity of systems practice places substantial demands on the researcher, particularly in the case of insider, practitioner research. Nevertheless, the exploration of critical systems approaches to critique boundaries and structure ‘problems’ in the core aspects of higher education in locally meaningful ways should continue. While demanding, it still can work to promote learning about authentic quality.  相似文献   
55.
56.
We consider the stability of a random Riccati equation with a Markovian binary jump coefficient. More specifically, we are concerned with the boundedness of the solution of a random Riccati difference equation arising from Kalman filtering with measurement losses. A sufficient condition for the peak covariance stability is obtained which has a simpler form and is shown to be less conservative in some cases than a very recent result in existing literature. Furthermore, we show that a known sufficient condition is also necessary when the observability index equals one.  相似文献   
57.
Summary The action of DDT on honey-bees depends to a high extent on the temperature (see graph). At 36°C (breeding temperature) DDT has a far weaker insecticidal action than at 20°C (laboratory temperature). This shows that the insecticidal properties of DDT diminish with the raise of temperature.This resistance to DDT at higher temperature is most propitious for bee-keeping and also explains the fact why in agricultural practice there has been no corroborated case of poisoning of bees, though in laboratory tests DDT avered itself to be toxic to bees.  相似文献   
58.
In the present paper, we focus on constructive spherical codes. By employing algebraic geometry codes, we give an explicit construction of spherical code sequences. By making use of the idea involved in the proof of the Gilbert-Varshamov bound in coding theory, we construct a spherical code sequence in exponential time which meets the best-known asymptotic bound by Shamsiev and Wyner.  相似文献   
59.
60.
1 Results Classic oxidants require rigorous control of the experimental conditions added with the problem of lack of selectivity. Catalysis by transition metals with environmentally safe oxidants provides synthetic routes to minimize pollution by giving environmental benign by-products. Fe (Ⅵ) is a powerful and a selective oxidant with Fe(Ⅲ) as a by-product, while hydrogen peroxide is clean with water as the only by-product. Separation of sodium or potassium ferrates requires tedious processes. Associat...  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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