全文获取类型
收费全文 | 5695篇 |
免费 | 297篇 |
国内免费 | 8篇 |
专业分类
电工技术 | 100篇 |
综合类 | 5篇 |
化学工业 | 1368篇 |
金属工艺 | 69篇 |
机械仪表 | 135篇 |
建筑科学 | 209篇 |
矿业工程 | 8篇 |
能源动力 | 160篇 |
轻工业 | 797篇 |
水利工程 | 54篇 |
石油天然气 | 14篇 |
无线电 | 474篇 |
一般工业技术 | 846篇 |
冶金工业 | 851篇 |
原子能技术 | 33篇 |
自动化技术 | 877篇 |
出版年
2024年 | 7篇 |
2023年 | 52篇 |
2022年 | 213篇 |
2021年 | 244篇 |
2020年 | 110篇 |
2019年 | 118篇 |
2018年 | 174篇 |
2017年 | 133篇 |
2016年 | 196篇 |
2015年 | 159篇 |
2014年 | 214篇 |
2013年 | 329篇 |
2012年 | 271篇 |
2011年 | 352篇 |
2010年 | 275篇 |
2009年 | 306篇 |
2008年 | 271篇 |
2007年 | 241篇 |
2006年 | 202篇 |
2005年 | 171篇 |
2004年 | 142篇 |
2003年 | 163篇 |
2002年 | 142篇 |
2001年 | 88篇 |
2000年 | 85篇 |
1999年 | 98篇 |
1998年 | 255篇 |
1997年 | 173篇 |
1996年 | 123篇 |
1995年 | 89篇 |
1994年 | 87篇 |
1993年 | 61篇 |
1992年 | 34篇 |
1991年 | 29篇 |
1990年 | 26篇 |
1989年 | 34篇 |
1988年 | 25篇 |
1987年 | 19篇 |
1986年 | 19篇 |
1985年 | 24篇 |
1984年 | 25篇 |
1983年 | 25篇 |
1982年 | 25篇 |
1981年 | 28篇 |
1980年 | 23篇 |
1979年 | 15篇 |
1978年 | 14篇 |
1977年 | 22篇 |
1976年 | 23篇 |
1975年 | 8篇 |
排序方式: 共有6000条查询结果,搜索用时 0 毫秒
71.
Noninvasive pacing is a valuable therapy in emergency cardiac care. The more experience clinicians have with the noninvasive pacing procedure, the greater their confidence and the easier the job becomes. Effective troubleshooting during pacing becomes less problematic with increased experience with the therapy. Noninvasive pacing allows rapid initiation of emergency pacing and "buys time" to stabilize the patient and plan further care. 相似文献
72.
Maurus Biedermann Konrad Grob Carlo Mariani Joachim P. Schmidt 《Zeitschrift für Lebensmitteluntersuchung und -Forschung A》1996,202(3):199-204
Adulteration of expensive edible oils, such as olive oil, often involves desterolized oils in order to render the adulteration undetectable. Sunflower oil contains characteristic 7-sterols, which are readily removed upon strong bleaching. It is shown that these 7-sterols do not primarily dehydrate (as do 5-sterols), but isomerize to 8(14)- and 14-sterols. These compounds can be analysed by LC on silica gel or GC on capillary columns with stationary phases of intermediate to high polarity. 相似文献
73.
Ugo Andreaus Michele Colloca Daniela Iacoviello Marcello Pignataro 《Structural and Multidisciplinary Optimization》2011,43(1):43-59
The objective of this paper was solving the optimization problem of lightweight stiffened structures modelled as a two-dimensional
domain in an efficient computational way. The underlying premise was that mass should be distributed in an efficient way,
so as to use a minimum amount of material to accomplish the mechanical function. This premise was expressed as a global, multi-objective
optimization problem in which stiffness and mass were conflicting objectives. Alternative local evolution rules were implemented
to update mass density or Young’s modulus at each step of the iterative procedure. The solution of the structural optimization
problem was accomplished by a novel automatic procedure consisting of two consecutive stages of control and optimization.
In the first stage of Proportional Integral Derivative (PID) control gains were manually selected whereas in the second stage
the finding of optimal values of control gains, target, and cost indices was allowed. In this study a bone-like material was
adopted and a thin slab was analysed as a sample problem. 相似文献
74.
Michele Barletta Silvio Ranise Luca Vigan�� 《Service Oriented Computing and Applications》2011,5(2):105-137
The specification of distributed service-oriented applications spans several levels of abstraction, e.g., the protocol for
exchanging messages, the set of interface functionalities, the types of the manipulated data, the workflow, the access policy,
etc. Many (even executable) specification languages are available to describe each level in separation. However, these levels
may interact in subtle ways (for example, the control flow may depend on the values of some data variables) so that a precise
abstraction of the application amounts to more than the sum of its per level components. This problem is even more acute in
the design phase when automated analysis techniques may greatly help the difficult task of building “correct” applications
faced by designers. To alleviate this kind of problems, this paper introduces a framework for the formal specification and
automated analysis of distributed service-oriented applications in two levels: one for the workflow and one for the authorization
policies. The former allows one to precisely describe the control and data parts of an application with their mutual dependencies.
The latter focuses on the specification of the criteria for granting or denying third-party applications the possibility to
access shared resources or to execute certain interface functionalities. These levels can be seen as abstractions of one or
of several levels of specification mentioned above. The novelty of our proposal is the possibility to unambiguously specify
the—often subtle—interplay between the workflow and policy levels uniformly in the same framework. Additionally, our framework
allows us to define and investigate verification problems for service-oriented applications (such as executability and invariant
checking) and give sufficient conditions for their decidability. These results are non-trivial because their scope of applicability
goes well beyond the case of finite state spaces allowing for applications manipulating variables ranging over infinite domains.
As proof of concept, we show the suitability and flexibility of our approach on two quite different examples inspired by industrial
case studies. 相似文献
75.
In this paper, we introduce and analyze a modification of the Hermitian and skew-Hermitian splitting iteration method for solving a broad class of complex symmetric linear systems. We show that the modified Hermitian and skew-Hermitian splitting (MHSS) iteration method is unconditionally convergent. Each iteration of this method requires the solution of two linear systems with real symmetric positive definite coefficient matrices. These two systems can be solved inexactly. We consider acceleration of the MHSS iteration by Krylov subspace methods. Numerical experiments on a few model problems are used to illustrate the performance of the new method. 相似文献
76.
77.
We investigate the convergence of the price of anarchy after a limited number of moves in the classical multicast communication game when the underlying communication network is directed. Namely, a subset of nodes of the network are interested in receiving the transmission from a given source node and can share the cost of the used links according to fixed cost sharing methods. At each step, a single receiver is allowed to modify its communication strategy, that is to select a communication path from the source, and assuming a selfish or rational behavior, it will make a best response move, that is it will select a solution yielding the minimum possible payment or shared cost. We determine lower and upper bounds on the price of anarchy, that is the highest possible ratio among the overall cost of the links used by the receivers and the minimum possible cost realizing the required communications, after a limited number of moves under the fundamental Shapley cost sharing method. In particular, assuming that the initial set of connecting paths can be arbitrary, we show an $O(r\sqrt{r})We investigate the convergence of the price of anarchy after a limited number of moves in the classical multicast communication
game when the underlying communication network is directed. Namely, a subset of nodes of the network are interested in receiving
the transmission from a given source node and can share the cost of the used links according to fixed cost sharing methods.
At each step, a single receiver is allowed to modify its communication strategy, that is to select a communication path from
the source, and assuming a selfish or rational behavior, it will make a best response move, that is it will select a solution
yielding the minimum possible payment or shared cost. We determine lower and upper bounds on the price of anarchy, that is
the highest possible ratio among the overall cost of the links used by the receivers and the minimum possible cost realizing
the required communications, after a limited number of moves under the fundamental Shapley cost sharing method. In particular,
assuming that the initial set of connecting paths can be arbitrary, we show an
O(r?r)O(r\sqrt{r})
upper bound on the price of anarchy after 2 rounds, during each of which all the receivers move exactly once, and a matching
lower bound, that we also extend to
W(rk?{r})\Omega(r\sqrt[k]{r})
for any number k≥2 rounds, where r is the number of receivers. Similarly, exactly matching upper and lower bounds equal to r are determined for any number of rounds when starting from the empty state in which no path has been selected. Analogous
results are obtained also with respect to other three natural cost sharing methods considered in the literature, that is the
egalitarian, path-proportional and egalitarian-path proportional ones. Most results are also extended to the undirected case
in which the communication links are bidirectional. 相似文献
78.
The metric reconstruction of a non-rigid object viewed by a generic camera poses new challenges since current approaches for Structure from Motion assume the rigidity constraint of a shape as an essential condition. In this work, we focus on the estimation of the 3-D Euclidean shape and motion of a non-rigid shape observed by a perspective camera. In such case deformation and perspective effects are difficult to decouple – the parametrization of the 3-D non-rigid body may mistakenly account for the perspective distortion. Our method relies on the fact that it is often a reasonable assumption that some of the points on the object’s surface are deforming throughout the sequence while others remain rigid. Thus, relying on the rigidity constraints of a subset of rigid points, we estimate the perspective to metric upgrade transformation. First, we use an automatic segmentation algorithm to identify the set of rigid points. These are then used to estimate the internal camera calibration parameters and the overall rigid motion. Finally, we formulate the problem of non-rigid shape and motion estimation as a non-linear optimization where the objective function to be minimized is the image reprojection error. The prior information that some of the points in the object are rigid can also be added as a constraint to the non-linear minimization scheme in order to avoid ambiguous configurations. We perform experiments on different synthetic and real data sets which show that even when using a minimal set of rigid points and when varying the intrinsic camera parameters it is possible to obtain reliable metric information. 相似文献
79.
Vincenza Carchiolo Michele Malgeri Giuseppe Mangioni Vincenzo Nicosia 《Journal of Parallel and Distributed Computing》2010
Nature is a great source of inspiration for scientists, because natural systems seem to be able to find the best way to solve a given problem by using simple and robust mechanisms. Studying complex natural systems, scientists usually find that simple local dynamics lead to sophisticated macroscopic structures and behaviour. It seems that some kind of local interaction rules naturally allow the system to auto-organize itself as an efficient and robust structure, which can easily solve different tasks. Examples of such complex systems are social networks, where a small set of basic interaction rules leads to a relatively robust and efficient communication structure. In this paper, we present PROSA, a semantic peer-to-peer (P2P) overlay network inspired by social dynamics. The way queries are forwarded and links among peers are established in PROSA resemble the way people ask other people for collaboration, help or information. Behaving as a social network of peers, PROSA naturally evolves to a small world, where all peers can be reached in a fast and efficient way. The underlying algorithm used for query forwarding, based only on local choices, is both reliable and effective: peers sharing similar resources are eventually connected with each other, allowing queries to be successfully answered in a really small amount of time. The resulting emergent structure can guarantee fast responses and good query recall. 相似文献
80.
Given a set of products each with positive discrete demand, and a set of markets selling products at given prices, the traveling purchaser problem (TPP) looks for a tour visiting a subset of markets such that products demand is satisfied at minimum purchasing and traveling costs. In this paper we analyze a dynamic variant of the problem, where quantities may decrease as time goes on. Complete information is assumed on current state of the world, i.e. decision maker knows quantities available for each product in each market at present time and is informed about any consumption event when it occurs. Nevertheless, planner does not have any information on future events. Two groups of heuristics are described and compared. The first group consists of simplified approaches deciding which market to visit next on the basis of some greedy criteria considering only one of the two objective costs. The second one includes heuristics based on a look-ahead approach taking into account both traveling and purchasing costs and inserting some future prediction. Heuristics behavior has been tested on a large set of randomly generated instances under different levels of dynamism. 相似文献