全文获取类型
收费全文 | 426篇 |
免费 | 27篇 |
国内免费 | 17篇 |
专业分类
化学 | 80篇 |
力学 | 1篇 |
综合类 | 2篇 |
数学 | 321篇 |
物理学 | 66篇 |
出版年
2024年 | 2篇 |
2023年 | 16篇 |
2022年 | 8篇 |
2021年 | 9篇 |
2020年 | 24篇 |
2019年 | 14篇 |
2018年 | 22篇 |
2017年 | 10篇 |
2016年 | 10篇 |
2015年 | 13篇 |
2014年 | 19篇 |
2013年 | 44篇 |
2012年 | 15篇 |
2011年 | 26篇 |
2010年 | 22篇 |
2009年 | 29篇 |
2008年 | 25篇 |
2007年 | 26篇 |
2006年 | 23篇 |
2005年 | 20篇 |
2004年 | 20篇 |
2003年 | 9篇 |
2002年 | 6篇 |
2001年 | 6篇 |
2000年 | 10篇 |
1999年 | 6篇 |
1998年 | 8篇 |
1997年 | 5篇 |
1996年 | 4篇 |
1995年 | 4篇 |
1994年 | 2篇 |
1993年 | 2篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 3篇 |
1989年 | 1篇 |
1986年 | 1篇 |
1984年 | 1篇 |
1977年 | 1篇 |
排序方式: 共有470条查询结果,搜索用时 31 毫秒
11.
In network problems, latency is associated with the metric used to evaluate the length of the path from a root vertex to each vertex in the network. In this work we are dealing with two applications or variations of the minimum latency problem known as the repairman problem and the deliveryman problem. We have developed two integer formulations for the minimum latency problem and compared them with other two formulations from the literature for the time-dependent traveling salesman problem. The present work highlights the similarities and differences between the different formulations. In addition, we discuss the convenience of including a set of constraints in order to reduce the computation time needed to reach the optimal solution. We have carried out extensive computational experimentation on asymmetrical instances, since they provide the characteristics of the deliveryman and repairman problems in a better way. 相似文献
12.
13.
András Gyárfás 《组合设计杂志》2015,23(8):321-327
A cross‐free set of size m in a Steiner triple system is three pairwise disjoint m‐element subsets such that no intersects all the three ‐s. We conjecture that for every admissible n there is an STS(n) with a cross‐free set of size which if true, is best possible. We prove this conjecture for the case , constructing an STS containing a cross‐free set of size 6k. We note that some of the 3‐bichromatic STSs, constructed by Colbourn, Dinitz, and Rosa, have cross‐free sets of size close to 6k (but cannot have size exactly 6k). The constructed STS shows that equality is possible for in the following result: in every 3‐coloring of the blocks of any Steiner triple system STS(n) there is a monochromatic connected component of size at least (we conjecture that equality holds for every admissible n). The analog problem can be asked for r‐colorings as well, if and is a prime power, we show that the answer is the same as in case of complete graphs: in every r‐coloring of the blocks of any STS(n), there is a monochromatic connected component with at least points, and this is sharp for infinitely many n. 相似文献
14.
Natural selection acts on genetic variation that comes from two principal sources: mutation and recombination. Because of the inherent differences between mutation and recombination, it is often assumed that they are qualitatively different ways to explore the genotype space. In this paper a new way of constructing recombination spaces is introduced and the topological features of the resulting hypergraphs are analyzed. It is shown that types which are neighbors in the point mutation space are also neighbors in the recombination space, i.e., mutation and recombination spaces are homomorphic. This implies that the shapes of the fitness functions explored by mutation and recombination are similar. However, the potential of one- and two-point recombination operators to explore the fitness landscape may differ dramatically from uniform recombination operators or mutation operators because of the limited number of recombinant types they can produce. © 1996 John Wiley & Sons, Inc. 相似文献
15.
Banás P Otyepka M Jerábek P Petrek M Damborský J 《Journal of computer-aided molecular design》2006,20(6):375-383
1,2,3-Trichloropropane (TCP) is a highly toxic, recalcitrant byproduct of epichlorohydrin manufacture. Haloalkane dehalogenase (DhaA) from Rhodococcus sp. hydrolyses the carbon–halogen bond in various halogenated compounds including TCP, but with low efficiency (k
cat/K
m = 36 s-1 M-1). A Cys176Tyr-DhaA mutant with a threefold higher catalytic efficiency for TCP dehalogenation has been previously obtained by error-prone PCR. We have used molecular simulations and quantum mechanical calculations to elucidate the molecular mechanisms involved in the improved catalysis of the mutant, and enantioselectivity of DhaA toward TCP. The Cys176Tyr mutation modifies the protein access and export routes. Substitution of the Cys residue by the bulkier Tyr narrows the upper tunnel, making the second tunnel “slot” the preferred route. TCP can adopt two major orientations in the DhaA enzyme, in one of which the halide-stabilizing residue Asn41 forms a hydrogen bond with the terminal halogen atom of the TCP molecule, while in the other it bonds with the central halogen atom. The differences in these binding patterns explain the preferential formation of the (R)- over the (S)-enantiomer of 2,3-dichloropropane-1-ol in the reaction catalyzed by the enzyme. 相似文献
16.
17.
Gábor Hetyei 《Graphs and Combinatorics》2002,18(3):533-564
18.
Partially dynamic maintenance of minimum weight hyperpaths 总被引:1,自引:0,他引:1
Giorgio Ausiello Paolo Giulio Franciosa Daniele Frigioni 《Journal of Discrete Algorithms》2005,3(1):27-46
We address the problem of dynamically maintaining minimum weight hyperpaths in a directed hypergraph in a decremental setting. For such a problem, we provide a new efficient algorithm that works for a wide class of hyperpath weight measures. This algorithm explicitly updates minimum weight hyperpaths in
worst case time under a sequence of L hyperarc weight increments and hyperarc deletions, where C is the maximum weight of minimum hyperpaths in
and
is the size of the representation of the hypergraph. Hyperpath weight measures are only required to belong to the class of strict weakly superior functions. 相似文献
Full-size image
19.
We solve a problem proposed by Jacobson, Kézdy, and Lehel [4] concerning the existence of forbidden induced subgraph characterizations of line graphs of linear k-uniform hypergraphs with sufficiently large minimal edge-degree. Actually, we prove that for each k3 there is a finite set Z(k) of graphs such that each graph G with minimum edge-degree at least 2k2–3k+1 is the line graph of a linear k-uniform hypergraph if and only if G is a Z(k)-free graph.Acknowledgments. We thank the anonymous referees, whose suggestions helped to improve the presentation of the paper.Winter 2002/2003 DIMACS Award is gratefully acknowledged2000 Mathematics Subject Classification: 05C65 (05C75, 05C85) 相似文献
20.
Maria Elena Valcher 《Linear algebra and its applications》2010,432(4):980-1006
The aim of this paper is that of investigating the asymptotic exponential cone of a single Metzler matrix, introduced in [23], and of defining and analysing the new concept of asymptotic exponential cone of a family of Metzler matrices (along a certain direction). These results will provide necessary and/or sufficient conditions for the solvability of an interesting algebraic problem that arises in the context of continuous-time positive switched systems and, specifically, in the investigation of the reachability property [21,22,25]. 相似文献