全文获取类型
收费全文 | 207篇 |
免费 | 3篇 |
国内免费 | 11篇 |
专业分类
化学 | 25篇 |
力学 | 1篇 |
综合类 | 1篇 |
数学 | 133篇 |
物理学 | 61篇 |
出版年
2023年 | 2篇 |
2022年 | 7篇 |
2021年 | 6篇 |
2020年 | 4篇 |
2019年 | 1篇 |
2018年 | 6篇 |
2017年 | 1篇 |
2016年 | 5篇 |
2015年 | 3篇 |
2014年 | 8篇 |
2013年 | 22篇 |
2012年 | 11篇 |
2011年 | 21篇 |
2010年 | 11篇 |
2009年 | 18篇 |
2008年 | 11篇 |
2007年 | 12篇 |
2006年 | 3篇 |
2005年 | 10篇 |
2004年 | 8篇 |
2003年 | 7篇 |
2002年 | 8篇 |
2001年 | 5篇 |
2000年 | 4篇 |
1999年 | 1篇 |
1998年 | 6篇 |
1997年 | 6篇 |
1996年 | 1篇 |
1995年 | 4篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1992年 | 1篇 |
1988年 | 1篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1981年 | 1篇 |
排序方式: 共有221条查询结果,搜索用时 15 毫秒
51.
52.
53.
Component based software development (CBSD) is well acknowledged as a methodology which establishes reusability of software and reduce development cost effectively. While developing enterprise application using component based software engineering (CBSE) methods, software component selection plays a very important role in the process of component retrieval, adaptation and assembly. However, most of current researches focus on technical aspects from domain engineering and application engineering to improve reusability and system efficiency rather than application of optimization methods in CBSD management, especially application in component selection. Moreover, few existing researches have concerned about the situation where a software developer or enterprise develops multi-applications at the same time. By introducing the concept of reusability and a new formulation of compatibility matrix, an optimization model is proposed to solve component selection problem considering reusability and compatibility simultaneously. The model can be used to assist software developers in selecting software components when multi-applications are undertaken concurrently. Four experiments are conducted with the purpose to provide some insights in management perspective. 相似文献
54.
Let (X,d) be a metric space endowed with a graph G such that the set V(G) of vertices of G coincides with X. We define the notion of G-Reich type maps and obtain a fixed point theorem for such mappings. This extends and subsumes many recent results which were obtained for other contractive type mappings on ordered metric spaces and for cyclic operators. 相似文献
55.
Given a graphG = (V, E), leta
S, S L, be the edge set incidence vectors of its nontrivial connected subgraphs.The extreme points of = {x R
E: asx |V(S)| - |S|, S L} are shown to be integer 0/± 1 and characterized. They are the alternating vectorsb
k, k K, ofG.
WhenG is a tree, the extreme points ofB 0,b
kx 1,k K} are shown to be the connected vectors ofG together with the origin. For the four LP's associated with andA, good algorithms are given and total dual integrality of andA proven.On leave from Swiss Federal Institute of Technology, Zurich. 相似文献
56.
57.
This paper reports on a study that introduces and applies the K5Connected Cognition Diagram as a lens to explore video data showing teachers’ interactions related to the partitioning of regions by axes in a three-dimensional geometric space. The study considers “semiotic bundles” ( Arzarello, 2006), introduces “semiotic connections,” and discusses the fundamental role each plays in developing individual understanding and communication with peers. While all teachers solved the problem posed, many failed to make or verbalize connections between the types of semiotic resources introduced during their discussions. 相似文献
58.
We are interested in (right) modules M satisfying the following weak divisibility condition: If R is the underlying ring, then for every r ∈ R either Mr = 0 or Mr = M. Over a commutative ring, this is equivalent to say that M is connected with regular generics. Over arbitrary rings, modules which are “minimal” in several model theoretic senses satisfy this condition. In this article, we investigate modules with this weak divisibility property over Dedekind-like rings and over other related classes of rings. 相似文献
59.
60.