全文获取类型
收费全文 | 8924篇 |
免费 | 33篇 |
国内免费 | 46篇 |
学科分类
农业科学 | 189篇 |
地球科学 | 275篇 |
航空航天 | 9篇 |
生物科学 | 1856篇 |
文化教育 | 65篇 |
经济 | 63篇 |
环境安全 | 103篇 |
自然科学 | 13篇 |
社会科学 | 29篇 |
历史地理 | 5篇 |
工业技术 | 1018篇 |
语言文字 | 2篇 |
文学 | 2篇 |
数理化 | 662篇 |
医药卫生 | 4542篇 |
哲学宗教 | 67篇 |
政治法律 | 33篇 |
交通运输 | 70篇 |
出版年
2019年 | 89篇 |
2018年 | 250篇 |
2017年 | 242篇 |
2016年 | 269篇 |
2015年 | 122篇 |
2014年 | 135篇 |
2013年 | 207篇 |
2012年 | 523篇 |
2011年 | 4493篇 |
2010年 | 1101篇 |
2009年 | 759篇 |
2008年 | 171篇 |
2007年 | 61篇 |
2006年 | 22篇 |
2005年 | 13篇 |
2004年 | 14篇 |
2003年 | 19篇 |
2002年 | 19篇 |
2001年 | 6篇 |
1999年 | 12篇 |
1998年 | 53篇 |
1997年 | 31篇 |
1996年 | 48篇 |
1995年 | 46篇 |
1994年 | 45篇 |
1993年 | 23篇 |
1992年 | 14篇 |
1991年 | 6篇 |
1989年 | 4篇 |
1983年 | 6篇 |
1982年 | 6篇 |
1981年 | 6篇 |
1980年 | 10篇 |
1978年 | 5篇 |
1977年 | 6篇 |
1976年 | 4篇 |
1975年 | 16篇 |
1973年 | 10篇 |
1969年 | 6篇 |
1968年 | 4篇 |
1967年 | 4篇 |
1965年 | 7篇 |
1964年 | 12篇 |
1963年 | 5篇 |
1962年 | 7篇 |
1961年 | 14篇 |
1960年 | 5篇 |
1959年 | 8篇 |
1958年 | 6篇 |
1908年 | 3篇 |
排序方式: 共有9003条查询结果,搜索用时 46 毫秒
41.
S��ndor V��gv?lgyi 《Acta Informatica》2011,48(5-6):317-361
We present an additional feature to the Challenge Handshake Authentication Protocol. It makes the protocol resilient to offline brute-force/dictionary attacks. We base our contribution to the protocol on the concept of a rewrite complement for ground term rewrite systems (GTRSs). We also introduce and study the notion of a type-based complement which is a special case of a rewrite complement. We show the following decision results. Given GTRSs A, C, and a reduced GTRS B over some ranked alphabet ??, one can decide whether C is a type-based complement of A for B. Given a GTRS A and a reduced GTRS B over some ranked alphabet ??, one can decide whether there is a GTRS C such that C is a type-based complement of A for B. If the answer is yes, then we can construct such a GTRS C. 相似文献
42.
Francisco Jes��s Mart��n-Mateos Jos�� Luis Ruiz-Reina Jos�� Antonio Alonso Mar��a Jos�� Hidalgo 《Journal of Automated Reasoning》2011,47(3):229-250
Higman??s lemma is an important result in infinitary combinatorics, which has been formalized in several theorem provers. In this paper we present a formalization and proof of Higman??s Lemma in the ACL2 theorem prover. Our formalization is based on a proof by Murthy and Russell, where the key termination argument is justified by the multiset relation induced by a well-founded relation. To our knowledge, this is the first mechanization of this proof. 相似文献
43.
Simultaneous aligning and smoothing of surface triangulations 总被引:1,自引:0,他引:1
Jos�� M. Escobar Rafael Montenegro Eduardo Rodr��guez Gustavo Montero 《Engineering with Computers》2011,27(1):17-29
In this work we develop a procedure to deform a given surface triangulation to obtain its alignment with interior curves.
These curves are defined by splines in a parametric space and, subsequently, mapped to the surface triangulation. We have
restricted our study to orthogonal mapping, so we require the curves to be included in a patch of the surface that can be
orthogonally projected onto a plane (our parametric space). For example, the curves can represent interfaces between different
materials or boundary conditions, internal boundaries or feature lines. Another setting in which this procedure can be used
is the adaption of a reference mesh to changing curves in the course of an evolutionary process. Specifically, we propose
a new method that moves the nodes of the mesh, maintaining its topology, in order to achieve two objectives simultaneously:
the piecewise approximation of the curves by edges of the surface triangulation and the optimization of the resulting mesh.
We will designate this procedure as projecting/smoothing method and it is based on the smoothing technique that we have introduced for surface triangulations in previous works. The
mesh quality improvement is obtained by an iterative process where each free node is moved to a new position that minimizes a certain objective function. The minimization process is done on the parametric
plane attending to the surface piece-wise approximation and to an algebraic quality measure (mean ratio) of the set of triangles that are connected to the free node. So, the 3-D local projecting/smoothing problem is reduced to a 2-D optimization problem. Several applications of this method
are presented. 相似文献
44.
In the Horn theory based approach for cryptographic protocol analysis, cryptographic protocols and (Dolev?CYao) intruders are modeled by Horn theories and security analysis boils down to solving the derivation problem for Horn theories. This approach and the tools based on this approach, including ProVerif, have been very successful in the automatic analysis of cryptographic protocols. However, dealing with the algebraic properties of operators, such as the exclusive OR (XOR), which are frequently used in cryptographic protocols has been problematic. In particular, ProVerif cannot deal with XOR. In this paper, we show how to reduce the derivation problem for Horn theories with XOR to the XOR-free case. Our reduction works for an expressive class of Horn theories. A large class of intruder capabilities and protocols that employ the XOR operator can be modeled by these theories. Our reduction allows us to carry out protocol analysis using tools, such as ProVerif, that cannot deal with XOR, but are very efficient in the XOR-free case. We implemented our reduction and, in combination with ProVerif, used it for the fully automatic analysis of several protocols that employ the XOR operator. Among others, our analysis revealed a new attack on an IBM security module. 相似文献
45.
Henrique Moniz Nuno Ferreira Neves Miguel Correia Paulo Ver��ssimo 《Distributed Computing》2011,24(3-4):165-175
Wireless ad-hoc networks are being increasingly used in diverse contexts, ranging from casual meetings to disaster recovery operations. A promising approach is to model these networks as distributed systems prone to dynamic communication failures. This captures transitory disconnections in communication due to phenomena like interference and collisions, and permits an efficient use of the wireless broadcasting medium. This model, however, is bound by the impossibility result of Santoro and Widmayer, which states that, even with strong synchrony assumptions, there is no deterministic solution to any non-trivial form of agreement if n ? 1 or more messages can be lost per communication round in a system with n processes. In this paper we propose a novel way to circumvent this impossibility result by employing randomization. We present a consensus protocol that ensures safety in the presence of an unrestricted number of omission faults, and guarantees progress in rounds where such faults are bounded by ${f \,{\leq}\,\lceil \frac{n}{2} \rceil (n\,{-}\,k)\,{+}\,k\,{-}\,2}$ , where k is the number of processes required to decide, eventually assuring termination with probability 1. 相似文献
46.
47.
J��r?me Schmid Jos�� A. Iglesias?Guiti��n Enrico Gobbetti Nadia Magnenat-Thalmann 《The Visual computer》2011,27(2):85-95
Despite the ability of current GPU processors to treat heavy parallel computation tasks, its use for solving medical image
segmentation problems is still not fully exploited and remains challenging. A lot of difficulties may arise related to, for
example, the different image modalities, noise and artifacts of source images, or the shape and appearance variability of
the structures to segment. Motivated by practical problems of image segmentation in the medical field, we present in this
paper a GPU framework based on explicit discrete deformable models, implemented over the NVidia CUDA architecture, aimed for
the segmentation of volumetric images. The framework supports the segmentation in parallel of different volumetric structures
as well as interaction during the segmentation process and real-time visualization of the intermediate results. Promising
results in terms of accuracy and speed on a real segmentation experiment have demonstrated the usability of the system. 相似文献
48.
Mario A. S. Lizi��r Marcelo F. Siqueira Joel Daniels II Claudio T. Silva L. Gustavo Nonato 《The Visual computer》2011,27(10):887-903
This paper describes a novel template-based meshing approach for generating good quality quadrilateral meshes from 2D digital
images. This approach builds upon an existing image-based mesh generation technique called Imeshp, which enables us to create a segmented triangle mesh from an image without the need for an image segmentation step. Our
approach generates a quadrilateral mesh using an indirect scheme, which converts the segmented triangle mesh created by the
initial steps of the Imesh technique into a quadrilateral one. The triangle-to-quadrilateral conversion makes use of template meshes of triangles. To
ensure good element quality, the conversion step is followed by a smoothing step, which is based on a new optimization-based
procedure. We show several examples of meshes generated by our approach, and present a thorough experimental evaluation of
the quality of the meshes given as examples. 相似文献
49.
Zolt��n Kir��ly 《Algorithmica》2011,60(1):3-20
We first consider the problem of finding a maximum size stable matching if incomplete lists and ties are both allowed, but ties are on one side only. For this problem we give a simple, linear time 3/2-approximation algorithm, improving on the best known approximation factor 5/3 of Irving and Manlove (J. Comb. Optim., doi:10.1007/s10878-007-9133-x, 2007). Next, we show how this extends to the Hospitals/Residents problem with the same ratio if the residents have strict orders. We also give a simple linear time algorithm for the general problem with approximation factor 5/3, improving the best known 15/8-approximation algorithm of Iwama, Miyazaki and Yamauchi (SODA ??07: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.?288?C297, 2007). For the cases considered in this paper it is NP-hard to approximate within a factor of 21/19 by the result of Halldórsson et?al. (ACM Transactions on Algorithms 3(3):30, 2007). Our algorithms not only give better approximation ratios than the cited ones, but are much simpler and run significantly faster. Also we may drop a restriction used in (J. Comb. Optim., doi:10.1007/s10878-007-9133-x, 2007) and the analysis is substantially more moderate. Preliminary versions of this paper appeared in (Király, Egres Technical Report TR-2008-04, www.cs.elte.hu/egres/, 2008; Király in Proceedings of MATCH-UP 2008: Matching Under Preferences??Algorithms and Complexity, Satellite Workshop of ICALP, July 6, 2008, Reykjavík, Iceland, pp.?36?C45, 2008; Király in ESA 2008, Lecture Notes in Computer Science, vol.?5193, pp.?623?C634, 2008). For the related results obtained thenceforth see Sect.?5. 相似文献
50.
( , 1977; , 1977). , , , . . 相似文献