全文获取类型
收费全文 | 149134篇 |
免费 | 19497篇 |
国内免费 | 15115篇 |
专业分类
电工技术 | 11894篇 |
技术理论 | 8篇 |
综合类 | 18468篇 |
化学工业 | 13196篇 |
金属工艺 | 6873篇 |
机械仪表 | 10488篇 |
建筑科学 | 13996篇 |
矿业工程 | 5476篇 |
能源动力 | 6666篇 |
轻工业 | 4658篇 |
水利工程 | 8864篇 |
石油天然气 | 9835篇 |
武器工业 | 2185篇 |
无线电 | 11144篇 |
一般工业技术 | 15797篇 |
冶金工业 | 5448篇 |
原子能技术 | 1433篇 |
自动化技术 | 37317篇 |
出版年
2024年 | 788篇 |
2023年 | 2315篇 |
2022年 | 4469篇 |
2021年 | 5177篇 |
2020年 | 5525篇 |
2019年 | 4844篇 |
2018年 | 4644篇 |
2017年 | 5699篇 |
2016年 | 6497篇 |
2015年 | 6782篇 |
2014年 | 8929篇 |
2013年 | 9689篇 |
2012年 | 10663篇 |
2011年 | 11629篇 |
2010年 | 9090篇 |
2009年 | 9463篇 |
2008年 | 9431篇 |
2007年 | 10598篇 |
2006年 | 9291篇 |
2005年 | 8163篇 |
2004年 | 6585篇 |
2003年 | 5817篇 |
2002年 | 4672篇 |
2001年 | 3889篇 |
2000年 | 3374篇 |
1999年 | 2664篇 |
1998年 | 2254篇 |
1997年 | 1933篇 |
1996年 | 1746篇 |
1995年 | 1520篇 |
1994年 | 1236篇 |
1993年 | 888篇 |
1992年 | 752篇 |
1991年 | 608篇 |
1990年 | 533篇 |
1989年 | 422篇 |
1988年 | 247篇 |
1987年 | 153篇 |
1986年 | 126篇 |
1985年 | 116篇 |
1984年 | 123篇 |
1983年 | 66篇 |
1982年 | 84篇 |
1981年 | 37篇 |
1980年 | 57篇 |
1979年 | 53篇 |
1978年 | 16篇 |
1977年 | 11篇 |
1959年 | 18篇 |
1951年 | 10篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
991.
基于改进齐次多项式技术的离散时间2-D T-S模糊系统的收敛镇定条件 总被引:1,自引:0,他引:1
通过利用改进的齐次多项式技术来研究了Roesser型二维T-S模糊系统的镇定设计问题. 首先, 提出了一种用来镇定该二维T-S模糊系统的一种新型非二次控制率, 并且通过应用两种改进的齐次多项式技术得到了保守性更小的镇定条件. 随着所选用的齐次多项式参数依赖矩阵度数的增加, 所得结果的保守性会越来越小. 其次, 为了继续减少保守性, 提出了一种新的右侧松弛变量引入方法, 该方法适合于齐次多项式情形. 最后, 仿真实验验证了所提方法的有效性. 相似文献
992.
Active contours with selective local or global segmentation: A new formulation and level set method 总被引:4,自引:0,他引:4
A novel region-based active contour model (ACM) is proposed in this paper. It is implemented with a special processing named Selective Binary and Gaussian Filtering RegularizedLevel Set(SBGFRLS) method, which first selectively penalizes the level set function to be binary, and then uses a Gaussian smoothing kernel to regularize it. The advantages of our method are as follows. First, a new region-based signed pressure force (SPF) function is proposed, which can efficiently stop the contours at weak or blurred edges. Second, the exterior and interior boundaries can be automatically detected with the initial contour being anywhere in the image. Third, the proposed ACM with SBGFRLS has the property of selective local or global segmentation. It can segment not only the desired object but also the other objects. Fourth, the level set function can be easily initialized with a binary function, which is more efficient to construct than the widely used signed distance function (SDF). The computational cost for traditional re-initialization can also be reduced. Finally, the proposed algorithm can be efficiently implemented by the simple finite difference scheme. Experiments on synthetic and real images demonstrate the advantages of the proposed method over geodesic active contours (GAC) and Chan–Vese (C–V) active contours in terms of both efficiency and accuracy. 相似文献
993.
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. 相似文献
994.
We propose a biologically-motivated computational model for learning task-driven and object-based visual attention control in interactive environments. In this model, top-down attention is learned interactively and is used to search for a desired object in the scene through biasing the bottom-up attention in order to form a need-based and object-driven state representation of the environment. Our model consists of three layers. First, in the early visual processing layer, most salient location of a scene is derived using the biased saliency-based bottom-up model of visual attention. Then a cognitive component in the higher visual processing layer performs an application specific operation like object recognition at the focus of attention. From this information, a state is derived in the decision making and learning layer. Top-down attention is learned by the U-TREE algorithm which successively grows an object-based binary tree. Internal nodes in this tree check the existence of a specific object in the scene by biasing the early vision and the object recognition parts. Its leaves point to states in the action value table. Motor actions are associated with the leaves. After performing a motor action, the agent receives a reinforcement signal from the critic. This signal is alternately used for modifying the tree or updating the action selection policy. The proposed model is evaluated on visual navigation tasks, where obtained results lend support to the applicability and usefulness of the developed method for robotics. 相似文献
995.
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPFSP. Under this generalization, we assume that there are a total of F identical factories or shops, each one with m machines disposed in series. A set of n available jobs have to be distributed among the F factories and then a processing sequence has to be derived for the jobs assigned to each factory. The optimization criterion is the minimization of the maximum completion time or makespan among the factories. This production setting is necessary in today's decentralized and globalized economy where several production centers might be available for a firm. We characterize the DPFSP and propose six different alternative mixed integer linear programming (MILP) models that are carefully and statistically analyzed for performance. We also propose two simple factory assignment rules together with 14 heuristics based on dispatching rules, effective constructive heuristics and variable neighborhood descent methods. A comprehensive computational and statistical analysis is conducted in order to analyze the performance of the proposed methods. 相似文献
996.
A crucial step in the modeling of a system is to determine the values of the parameters to use in the model. In this paper we assume that we have a set of measurements collected from an operational system, and that an appropriate model of the system (e.g., based on queueing theory) has been developed. Not infrequently proper values for certain parameters of this model may be difficult to estimate from available data (because the corresponding parameters have unclear physical meaning or because they cannot be directly obtained from available measurements, etc.). Hence, we need a technique to determine the missing parameter values, i.e., to calibrate the model.As an alternative to unscalable “brute force” technique, we propose to view model calibration as a non-linear optimization problem with constraints. The resulting method is conceptually simple and easy to implement. Our contribution is twofold. First, we propose improved definitions of the “objective function” to quantify the “distance” between performance indices produced by the model and the values obtained from measurements. Second, we develop a customized derivative-free optimization (DFO) technique whose original feature is the ability to allow temporary constraint violations. This technique allows us to solve this optimization problem accurately, thereby providing the “right” parameter values. We illustrate our method using two simple real-life case studies. 相似文献
997.
Given an undirected network with positive edge costs and a positive integer , the minimum-degree constrained minimum spanning tree problem is the problem of finding a spanning tree with minimum total cost such that each non-leaf node in the tree has a degree of at least . This problem is new to the literature while the related problem with upper bound constraints on degrees is well studied. Mixed-integer programs proposed for either type of problem is composed, in general, of a tree-defining part and a degree-enforcing part. In our formulation of the minimum-degree constrained minimum spanning tree problem, the tree-defining part is based on the Miller–Tucker–Zemlin constraints while the only earlier paper available in the literature on this problem uses single and multi-commodity flow-based formulations that are well studied for the case of upper degree constraints. We propose a new set of constraints for the degree-enforcing part that lead to significantly better solution times than earlier approaches when used in conjunction with Miller–Tucker–Zemlin constraints. 相似文献
998.
Achieving stability at the site of femoral neck fracture is an important factor for callus formation in the post-operative period. However, measuring interfragmentary movement in vivo is not currently possible as telemetric screws have not been manufactured for surgical use. Understanding how the implantation of the screws can affect the stability of the fracture allows the surgeon to tailor the procedure to the patient and produce the best possible outcome. Two techniques have been developed that measure interfragmentary movement between fractured surfaces. The first was a FEA model of the proximal femur with screws represented by nodal links. Movement was quantified by the amount of relative motion occurring between paired nodes either side of the fracture. The second was a mechanical compression test of a composite femur that allowed the motion analysis of paired markers on the external surface of the femur. Movement was digitised with markers selected and displacements calculated by transforming the global coordinate system to a local system relative to the fracture plane. 相似文献
999.
Jerry L. Trahan Mingxian Jin Wittaya Chantamas Johnnie W. Baker 《Journal of Parallel and Distributed Computing》2010
The MASC (Multiple ASsociative Computing) model is a multi-SIMD model that uses control parallelism to coordinate the interaction of data parallel threads and supports associative SIMD computing on each of its threads. There have been a wide range of algorithms developed for this model. Research on using this model in real-time system applications and building a scalable MASC architecture is currently quite active. In this paper, we present simulations between MASC and reconfigurable bus-based models, e.g., various versions of the Reconfigurable Multiple Bus Machine (RMBM). Constant time simulations of the basic RMBM by MASC and vice versa are obtained. Simulations of the segmenting RMBM, fusing RMBM, and extended RMBM by MASC in non-constant time are also discussed. By taking advantage of previously established relationships between RMBM and two other popular parallel computational models, namely, the Reconfigurable Mesh (RM) and the Parallel Random Access Machine (PRAM), we extend our simulation results to further categorize the power of the MASC model in relation to RM and PRAM. 相似文献
1000.