全文获取类型
收费全文 | 220篇 |
免费 | 13篇 |
国内免费 | 9篇 |
专业分类
化学 | 43篇 |
力学 | 37篇 |
综合类 | 5篇 |
数学 | 108篇 |
物理学 | 49篇 |
出版年
2024年 | 1篇 |
2023年 | 4篇 |
2022年 | 4篇 |
2021年 | 7篇 |
2020年 | 5篇 |
2019年 | 2篇 |
2018年 | 2篇 |
2017年 | 8篇 |
2016年 | 14篇 |
2015年 | 10篇 |
2014年 | 11篇 |
2013年 | 24篇 |
2012年 | 7篇 |
2011年 | 29篇 |
2010年 | 21篇 |
2009年 | 13篇 |
2008年 | 14篇 |
2007年 | 10篇 |
2006年 | 11篇 |
2005年 | 7篇 |
2004年 | 9篇 |
2003年 | 2篇 |
2002年 | 2篇 |
2001年 | 1篇 |
1999年 | 3篇 |
1998年 | 4篇 |
1997年 | 3篇 |
1996年 | 3篇 |
1993年 | 3篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1985年 | 3篇 |
1984年 | 1篇 |
1978年 | 1篇 |
排序方式: 共有242条查询结果,搜索用时 15 毫秒
1.
2.
3.
该文在M/M/c排队驱动系统中加入工作休假策略,研究了单重工作休假多服务台排队驱动的流体模型.利用拟生灭过程和矩阵几何解法得到驱动系统稳态队长分布.构建净输入率结构,导出流体模型的稳态联合分布函数满足的的矩阵微分方程组,进而利用Laplace-Stieltjes变换(LST)方法得到稳态下缓冲器库存量的空库概率及均值表达式.最后,给出模型在多信道无线Mesh网下的应用,通过数值例子展示参数变化对系统性能指标的影响. 相似文献
4.
本文站在提高学生科学素养、培养创新型人才和增强国家科技竞争力的高度,针对大学物理实验教学中普遍存在的设计性、研究性实验题目设置"难",以及由此带来的教学"难"问题,提出了明确的思路和较实用的解决方案,对于全面贯彻教学基本要求,提高实验教学层次和质量具有重要的现实指导意义。 相似文献
5.
A simple and efficient implementation of Adaptive Mesh Refinement (AMR) with distributed-memory approach is presented. Introducing
a lookup table including grid connectivity information and simplified algorithms for AMR, the procedures for reconstructing
adaptive grids are carried out in parallel, with local data to a large extent. A simple static load-balancing scheme is adopted,
and the grids are not repartitioned and no data redistribution is performed. A numerical example on two different parallel
computers shows that the proposed implementation of AMR is effective to reduce the computational time for unsteady flows with
shock waves.
Received 23 October 2000 / Accepted 30 March 2001 Published online 11 June 2002 相似文献
6.
本文研究如下一种场站设置问题:设S是欧空间E~m中由有限个点A_1,A_2,…,A_n组成的集合.d(A_i,A_j)表示点A_i和A_j之间的距离.令σ(S)=Σ_(1≤i相似文献
7.
Conventional DEA models have been introduced to deal with non-negative data. In the real world, in some occasions, we have outputs and/or inputs, which can take negative data. In DEA literature some approaches have been presented for evaluating performance of units, which operate with negative data. In this paper, firstly, we give a brief review of these works, then we present a new additive based approach in this framework. The proposed model is designed to provide a target with non-negative value associated with negative components for each observed unit, failed by other methods. An empirical application in banking is then used to show the applicability of the proposed method and make a comparison with the other approaches in the literature. 相似文献
8.
9.
The antibandwidth problem consists of placing the vertices of a graph on a line in consecutive integer points in such a way that the minimum difference of adjacent vertices is maximised. The problem was originally introduced in [J.Y.-T. Leung, O. Vornberger, J.D. Witthoff, On some variants of the bandwidth minimisation problem, SIAM Journal of Computing 13 (1984) 650-667] in connection with the multiprocessor scheduling problems and can also be understood as a dual problem to the well-known bandwidth problem, as a special radiocolouring problem or as a variant of obnoxious facility location problems. The antibandwidth problem is NP-hard, there are a few classes of graphs with polynomial time complexities. Exact results for nontrivial graphs are very rare. Miller and Pritikin [Z. Miller, D. Pritikin, On the separation number of a graph, Networks 19 (1989) 651-666] showed tight bounds for the two-dimensional meshes and hypercubes. We solve the antibandwidth problem precisely for two-dimensional meshes, tori and estimate the antibandwidth value for hypercubes up to the third-order term. The cyclic antibandwidth problem is to embed an n-vertex graph into the cycle Cn, such that the minimum distance (measured in the cycle) of adjacent vertices is maximised. This is a natural extension of the antibandwidth problem or a dual problem to the cyclic bandwidth problem. We start investigating this invariant for typical graphs and prove basic facts and exact results for the same product graphs as for the antibandwidth. 相似文献
10.
Scott C. Hagen D. Michael Parrish ? 《International Journal of Computational Fluid Dynamics》2013,27(7):585-595
This paper presents an a posteriori approach to unstructured mesh generation via a localized truncation error analysis and applies it to the Western North Atlantic Tidal (WNAT) model domain. The WNAT model domain encompasses the Gulf of Mexico, the Caribbean Sea, and the North Atlantic Ocean east to the 60°W Meridian. Herein, we pay particular attention to the area surrounding the Bahamas. A bathymetric data set with fine resolution is employed in seven separate linear, harmonic simulations of shallow water tidal flow for seven different tidal-forcing constituents. Each set of simulation results is used to perform a truncation error analysis of a linear, harmonic form of the depth-averaged momentum equations for each of the seven different tidal-forcing frequencies. Truncation error is then driven to a more uniform, domain-wide value by solving for local node spacing requirements. The process is built upon successful research aiming to produce unstructured grids for large-scale domains that can be used in the accurate and efficient modeling of shallow water flow. The methodology described herein can also be transferred to other modeling applications. 相似文献