全文获取类型
收费全文 | 209篇 |
免费 | 8篇 |
国内免费 | 16篇 |
专业分类
化学 | 45篇 |
力学 | 37篇 |
数学 | 115篇 |
物理学 | 36篇 |
出版年
2023年 | 3篇 |
2022年 | 6篇 |
2021年 | 2篇 |
2020年 | 6篇 |
2019年 | 6篇 |
2018年 | 2篇 |
2017年 | 7篇 |
2016年 | 9篇 |
2015年 | 5篇 |
2014年 | 17篇 |
2013年 | 16篇 |
2012年 | 14篇 |
2011年 | 18篇 |
2010年 | 18篇 |
2009年 | 16篇 |
2008年 | 15篇 |
2007年 | 8篇 |
2006年 | 7篇 |
2005年 | 4篇 |
2004年 | 6篇 |
2003年 | 3篇 |
2002年 | 2篇 |
2001年 | 1篇 |
2000年 | 2篇 |
1999年 | 3篇 |
1998年 | 3篇 |
1997年 | 1篇 |
1996年 | 3篇 |
1995年 | 2篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1992年 | 2篇 |
1990年 | 6篇 |
1989年 | 2篇 |
1988年 | 3篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1984年 | 3篇 |
1983年 | 2篇 |
1981年 | 3篇 |
1979年 | 1篇 |
排序方式: 共有233条查询结果,搜索用时 15 毫秒
221.
222.
M. I. Jinnah 《代数通讯》2013,41(7):2400-2404
Let R be a commutative ring with non zero unity. Let Ω(R) be a graph with vertices as elements of R whose two distinct vertices x and y are adjacent if and only if Rx + Ry = R. A graph (V, E) is said to be a split graph if V is the disjoint union of two sets K and S where K induces a complete subgraph and S is an independent set. We investigate the properties of R when Ω(R) is split. 相似文献
223.
Jian-Hua Yin 《Discrete Mathematics》2011,(21):2485
For a given graph H, a non-increasing sequence π=(d1,d2,…,dn) of nonnegative integers is said to be potentially H-graphic if there exists a realization of π containing H as a subgraph. The split graph on r+s vertices is denoted by Sr,s. In this paper, we give a Rao-type characterization for π to be potentially Sr,s-graphic. A simplification of this characterization is also presented. 相似文献
224.
A pairing-friendly curve is a curve over a finite field whose Jacobian has small embedding degree with respect to a large prime-order subgroup. In this paper we construct pairing-friendly genus 2 curves over finite fields Fq whose Jacobians are ordinary and simple, but not absolutely simple. We show that constructing such curves is equivalent to constructing elliptic curves over Fq that become pairing-friendly over a finite extension of Fq. Our main proof technique is Weil restriction of elliptic curves. We describe adaptations of the Cocks-Pinch and Brezing-Weng methods that produce genus 2 curves with the desired properties. Our examples include a parametric family of genus 2 curves whose Jacobians have the smallest recorded ρ-value for simple, non-supersingular abelian surfaces. 相似文献
225.
Anderson et al. (2005) [1] show that for a polyhedral mixed integer set defined by a constraint system Ax≥b, along with integrality restrictions on some of the variables, any split cut is in fact a split cut for a basic relaxation, i.e., one defined by a subset of linearly independent constraints. This result implies that any split cut can be obtained as an intersection cut. Equivalence between split cuts obtained from simple disjunctions of the form xj≤0 or xj≥1 and intersection cuts was shown earlier for 0/1-mixed integer sets by Balas and Perregaard (2002) [4]. We give a short proof of the result of Anderson, Cornuéjols and Li using the equivalence between mixed integer rounding (MIR) cuts and split cuts. 相似文献
226.
The maximum a posteriori (MAP) model is widely used in image processing fields, such as denoising, deblurring, segmentation, reconstruction, and others. However, the existing methods usually employ a fixed prior item and regularization parameter for the whole image and ignore the local spatial adaptive properties. Though the non-local total variation model has shown great promise because of exploiting the correlation in the image, the computation cost and memory load are the issues. In this paper, a content-based local spatial adaptive denoising algorithm is proposed. To realize the local spatial adaptive process of the prior model and regularization parameter, first the degraded image is divided into several same-sized blocks and the Tchebichef moment is used to analyze the local spatial properties of each block. Different property prior items and regularization parameters are then applied adaptively to different properties’ blocks. To reduce the computational load in denoising process, the split Bregman iteration algorithm is employed to optimize the non-local total variation model and accelerate the speed of the image denoising. Finally, a set of experiments and performance evaluation using recent image quality assessment index are provided to assess the effectiveness of the proposed method. 相似文献
227.
Claudia Archetti Nicola Bianchessi M. Grazia Speranza 《European Journal of Operational Research》2014
In this paper we present two exact branch-and-cut algorithms for the Split Delivery Vehicle Routing Problem (SDVRP) based on two relaxed formulations that provide lower bounds to the optimum. Procedures to obtain feasible solutions to the SDVRP from a feasible solution to the relaxed formulations are presented. Computational results are presented for 4 classes of benchmark instances. The new approach is able to prove the optimality of 17 new instances. In particular, the branch-and-cut algorithm based on the first relaxed formulation is able to solve most of the instances with up to 50 customers and two instances with 75 and 100 customers. 相似文献
228.
利用已知级数,通过裂项构造出一批新的二项式系数倒数级数,它们的分母分别含有1到4个奇因子与二项式系数的乘积表达式.所给出二项式系数倒数级数的和式是封闭形的. 相似文献
229.
Baochang Zhang Yupeng Zheng Guochao Chu Xiangyu Deng Tongyue Wang Weiwei Shi Yongkang Zhou Prof. Shan Tang Prof. Ji-Shen Zheng Prof. Lei Liu 《Angewandte Chemie (International ed. in English)》2023,62(33):e202306270
Membrane-associated D-proteins are an important class of synthetic molecules needed for D-peptide drug discovery, but their chemical synthesis using canonical ligation methods such as native chemical ligation is often hampered by the poor solubility of their constituent peptide segments. Here, we describe a B ackbone- I nstalled S plit I ntein- A ssisted L igation (BISIAL) method for the synthesis of these proteins, wherein the native L-forms of the N- and C-intein fragments of the unique consensus-fast (Cfa) (i.e. L–CfaN and L–CfaC) are separately installed onto the two D-peptide segments to be ligated via a removable backbone modification. The ligation proceeds smoothly at micromolar (μM) concentrations under strongly chaotropic conditions (8.0 M urea), and the subsequent removal of the backbone modification groups affords the desired D-proteins without leaving any “ligation scar” on the products. The effectiveness and practicality of the BISIAL method are exemplified by the synthesis of the D-enantiomers of the extracellular domains of T cell immunoglobulin and ITIM domain (TIGIT) and tropomyosin receptor kinase C (TrkC). The BISIAL method further expands the chemical protein synthesis ligation toolkit and provides practical access to challenging D-protein targets. 相似文献
230.
In this paper, we consider a set of lines of with the properties that (1) every plane contains 0, 1 or q + 1 elements of , (2) every solid contains no more than q
2 + q + 1 and no less than q + 1 elements of , and (3) every point of is on q + 1 members of , and we show that, whenever (4) q ≠ 2 (respectively, q = 2) and the lines of through some point are contained in a solid (respectively, a plane), then is necessarily the set of lines of a regularly embedded split Cayley generalized hexagon in , with q even. We present examples of such sets not satisfying (4) based on a Singer cycle in , for all q.
相似文献