全文获取类型
收费全文 | 4938篇 |
免费 | 813篇 |
国内免费 | 471篇 |
专业分类
6222篇 |
出版年
2024年 | 8篇 |
2023年 | 13篇 |
2022年 | 37篇 |
2021年 | 67篇 |
2020年 | 51篇 |
2019年 | 92篇 |
2018年 | 82篇 |
2017年 | 186篇 |
2016年 | 235篇 |
2015年 | 142篇 |
2014年 | 354篇 |
2013年 | 403篇 |
2012年 | 322篇 |
2011年 | 382篇 |
2010年 | 293篇 |
2009年 | 386篇 |
2008年 | 325篇 |
2007年 | 348篇 |
2006年 | 368篇 |
2005年 | 342篇 |
2004年 | 305篇 |
2003年 | 229篇 |
2002年 | 179篇 |
2001年 | 174篇 |
2000年 | 120篇 |
1999年 | 124篇 |
1998年 | 101篇 |
1997年 | 90篇 |
1996年 | 79篇 |
1995年 | 66篇 |
1994年 | 75篇 |
1993年 | 54篇 |
1992年 | 56篇 |
1991年 | 49篇 |
1990年 | 46篇 |
1989年 | 23篇 |
1988年 | 12篇 |
1987年 | 3篇 |
1975年 | 1篇 |
排序方式: 共有6222条查询结果,搜索用时 15 毫秒
241.
242.
243.
本文以应用心理学专业人才培养为切入点,分析应用心理学专业实践课程现存的问题,从专业知识体系、实践应用能力、专业实践素养、专业实践活动等四个方面探讨应用心理学专业实践课程体系立体式革新的途径及注意事项,以期革新应用型心理学人才培养模式,进而优化专业发展的生命力。 相似文献
244.
Adam D.M. Svendsen 《Defense & Security Analysis》2015,31(1):58-73
This article aims to encourage the fostering of more systems thinking, and its greater exploitation, within the domain of contemporary intelligence. With particular focus on “micro systems thinking” and with reference to key intelligence processes, such as intelligence analysis, the utility of many systems dynamics within the intelligence context seeks to be further revealed. Through their greater collective harnessing, including up to “System of Systems” (“SoS”) dynamics, and promoting all that they can offer, more sophisticated overarching operational-to-strategic/policy “ends,” notably that of “defence-in-depth,” can be viably further advanced in a sustainable manner into the future. Arguably, a much-needed transformative impact on contemporary intelligence can also be increasingly realised through comprehensively engaging in and with more systems and SoS thinking. Aiding civil protection tasks, crisis management, emergency planners, and civil contingency practitioners likewise gain. 相似文献
245.
We consider a loss system with a fixed budget for servers. The system owner's problem is choosing the price, and selecting the number and quality of the servers, in order to maximize profits, subject to a budget constraint. We solve the problem with identical and different service rates as well as with preemptive and nonpreemptive policies. In addition, when the policy is preemptive, we prove the following conservation law: the distribution of the total service time for a customer entering the slowest server is hyperexponential with expectation equal to the average service rate independent of the allocation of the capacity. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 81–97, 2015 相似文献
246.
Model parameter estimation and residual life prediction for a partially observable failing system 下载免费PDF全文
We consider a partially observable degrading system subject to condition monitoring and random failure. The system's condition is categorized into one of three states: a healthy state, a warning state, and a failure state. Only the failure state is observable. While the system is operational, vector data that is stochastically related to the system state is obtained through condition monitoring at regular sampling epochs. The state process evolution follows a hidden semi‐Markov model (HSMM) and Erlang distribution is used for modeling the system's sojourn time in each of its operational states. The Expectation‐maximization (EM) algorithm is applied to estimate the state and observation parameters of the HSMM. Explicit formulas for several important quantities for the system residual life estimation such as the conditional reliability function and the mean residual life are derived in terms of the posterior probability that the system is in the warning state. Numerical examples are presented to demonstrate the applicability of the estimation procedure and failure prediction method. A comparison results with hidden Markov modeling are provided to illustrate the effectiveness of the proposed model. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 190–205, 2015 相似文献
247.
We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time pj and a size sj. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015 相似文献
248.
249.
250.