全文获取类型
收费全文 | 133886篇 |
免费 | 18298篇 |
国内免费 | 14185篇 |
专业分类
电工技术 | 11662篇 |
技术理论 | 8篇 |
综合类 | 17516篇 |
化学工业 | 11100篇 |
金属工艺 | 4288篇 |
机械仪表 | 9600篇 |
建筑科学 | 12836篇 |
矿业工程 | 4483篇 |
能源动力 | 6069篇 |
轻工业 | 4351篇 |
水利工程 | 8525篇 |
石油天然气 | 7197篇 |
武器工业 | 1991篇 |
无线电 | 11092篇 |
一般工业技术 | 11876篇 |
冶金工业 | 4709篇 |
原子能技术 | 1309篇 |
自动化技术 | 37757篇 |
出版年
2024年 | 748篇 |
2023年 | 2127篇 |
2022年 | 4096篇 |
2021年 | 4697篇 |
2020年 | 5050篇 |
2019年 | 4422篇 |
2018年 | 4226篇 |
2017年 | 5206篇 |
2016年 | 5984篇 |
2015年 | 6230篇 |
2014年 | 8273篇 |
2013年 | 8846篇 |
2012年 | 9822篇 |
2011年 | 10592篇 |
2010年 | 8386篇 |
2009年 | 8677篇 |
2008年 | 8725篇 |
2007年 | 9807篇 |
2006年 | 8440篇 |
2005年 | 7404篇 |
2004年 | 5952篇 |
2003年 | 5214篇 |
2002年 | 4094篇 |
2001年 | 3391篇 |
2000年 | 2942篇 |
1999年 | 2250篇 |
1998年 | 1903篇 |
1997年 | 1565篇 |
1996年 | 1464篇 |
1995年 | 1278篇 |
1994年 | 1044篇 |
1993年 | 740篇 |
1992年 | 612篇 |
1991年 | 481篇 |
1990年 | 383篇 |
1989年 | 323篇 |
1988年 | 199篇 |
1987年 | 129篇 |
1986年 | 99篇 |
1985年 | 98篇 |
1984年 | 103篇 |
1983年 | 47篇 |
1982年 | 66篇 |
1981年 | 35篇 |
1980年 | 48篇 |
1979年 | 47篇 |
1978年 | 16篇 |
1974年 | 9篇 |
1959年 | 17篇 |
1951年 | 10篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
991.
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. 相似文献
992.
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. 相似文献
993.
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. 相似文献
994.
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. 相似文献
995.
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. 相似文献
996.
997.
A scanning electron microscope (SEM) is a sophisticated equipment employed for fine imaging of a variety of surfaces. In this study, prediction models of SEM were constructed by using a generalized regression neural network (GRNN) and genetic algorithm (GA). The SEM components examined include condenser lens 1 and 2 and objective lens (coarse and fine) referred to as CL1, CL2, OL-Coarse, and OL-Fine. For a systematic modeling of SEM resolution (R), a face-centered Box–Wilson experiment was conducted. Two sets of data were collected with or without the adjustment of magnification. Root-mean-squared prediction error of optimized GRNN models are GA 0.481 and 1.96×10-12 for non-adjusted and adjusted data, respectively. The optimized models demonstrated a much improved prediction over statistical regression models. The optimized models were used to optimize parameters particularly under best tuned SEM environment. For the variations in CL2 and OL-Coarse, the highest R could be achieved at all conditions except a larger CL2 either at smaller or larger OL-Coarse. For the variations in CL1 and CL2, the highest R was obtained at all conditions but larger CL2 and smaller CL1. 相似文献
998.
This study is to discuss the impact of stock repurchase declaration and purpose of repurchase on the stock price in the backdrop of listed companies on Taiwan’s stock market. Event Study Method is employed to discuss stock price fluctuations while GARCH (Generalized Autoregressive Conditional Heteroscedasticity) is applied to estimate the Market Model regressive coefficients. The samples consisted of companies declaring first stock repurchase are selected from August 9, 2000 to December 31, 2005 with a precondition that all the companies shall be listed ones 150 days prior to declaration. The study results reveal that companies from other industries have considerably bigger average CAR than companies of the electrics industry before and after the declaration of stock repurchase. Companies with application purpose of “maintain stockholders’ equities and corporate credit” have considerably bigger average CAR than companies with application purpose of “transferring stocks to employees”. In industries other than electrics, companies with application purpose of “maintain stockholders’ equities and corporate credit” have bigger accumulated abnormal return response than companies with application purpose of “transferring stocks to employees”. In case of “maintain stockholders’ equities and corporate credit” as the application purpose of stock repurchase, companies from industries other than electrics have relatively higher average CAR response. The empirical study results can serve as a reference for the listed company management and to related academic studies. 相似文献
999.
该文在描述决策树分类算法的基础上,叙述了决策树分类算法用于网络入侵检测领域,给出了决策树分类模型的构造过程,并说明了应用基于决策树模型检测入侵的过程。最后用KDD CUP 99数据进行实验,验证了用本文描述的方法检测入侵行为的有效性。 相似文献
1000.
朱跃东 《数字社区&智能家居》2010,6(7):1573-1575
当前,B2C电子商务逐步受到人们的关注,由此信任问题也成为B2C电子商务接受的关键因素。而信息技术用户接受理论认为用户对信息技术能否有效地接受,决定了它真实的价值和影响。因此理解相关因素对预测和解释用户的B2C电子商务接受行为具有重要的现实和理论意义。该文提出了一个基于技术因素的信任接受模型;通过引入中介变量商业因素,感知易用性和有用性反映用户信任建立过程;最后还通过引入调控变量进一步阐述信任的形成。该文最后通过对当当网的定性分析来验证模型的准确性。 相似文献