首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   11177篇
  免费   703篇
  国内免费   41篇
电工技术   147篇
综合类   25篇
化学工业   3090篇
金属工艺   167篇
机械仪表   271篇
建筑科学   382篇
矿业工程   21篇
能源动力   461篇
轻工业   1823篇
水利工程   72篇
石油天然气   63篇
无线电   809篇
一般工业技术   1783篇
冶金工业   435篇
原子能技术   85篇
自动化技术   2287篇
  2024年   26篇
  2023年   130篇
  2022年   395篇
  2021年   480篇
  2020年   321篇
  2019年   334篇
  2018年   412篇
  2017年   440篇
  2016年   525篇
  2015年   349篇
  2014年   551篇
  2013年   894篇
  2012年   754篇
  2011年   828篇
  2010年   693篇
  2009年   692篇
  2008年   635篇
  2007年   544篇
  2006年   439篇
  2005年   325篇
  2004年   292篇
  2003年   252篇
  2002年   270篇
  2001年   144篇
  2000年   111篇
  1999年   125篇
  1998年   147篇
  1997年   96篇
  1996年   80篇
  1995年   80篇
  1994年   63篇
  1993年   54篇
  1992年   39篇
  1991年   23篇
  1990年   27篇
  1989年   29篇
  1988年   21篇
  1987年   19篇
  1986年   23篇
  1985年   25篇
  1984年   35篇
  1983年   19篇
  1982年   26篇
  1981年   22篇
  1980年   24篇
  1979年   15篇
  1978年   18篇
  1977年   19篇
  1976年   10篇
  1975年   10篇
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
141.
142.
This paper presents a real-time framework that combines depth data and infrared laser speckle pattern (ILSP) images, captured from a Kinect device, for static hand gesture recognition to interact with CAVE applications. At the startup of the system, background removal and hand position detection are performed using only the depth map. After that, tracking is started using the hand positions of the previous frames in order to seek for the hand centroid of the current one. The obtained point is used as a seed for a region growing algorithm to perform hand segmentation in the depth map. The result is a mask that will be used for hand segmentation in the ILSP frame sequence. Next, we apply motion restrictions for gesture spotting in order to mark each image as a ‘Gesture’ or ‘Non-Gesture’. The ILSP counterparts of the frames labeled as “Gesture” are enhanced by using mask subtraction, contrast stretching, median filter, and histogram equalization. The result is used as the input for the feature extraction using a scale invariant feature transform algorithm (SIFT), bag-of-visual-words construction and classification through a multi-class support vector machine (SVM) classifier. Finally, we build a grammar based on the hand gesture classes to convert the classification results in control commands for the CAVE application. The performed tests and comparisons show that the implemented plugin is an efficient solution. We achieve state-of-the-art recognition accuracy as well as efficient object manipulation in a virtual scene visualized in the CAVE.  相似文献   
143.
High user interaction capability of mobile devices can help improve the accuracy of mobile visual search systems. At query time, it is possible to capture multiple views of an object from different viewing angles and at different scales with the mobile device camera to obtain richer information about the object compared to a single view and hence return more accurate results. Motivated by this, we propose a new multi-view visual query model on multi-view object image databases for mobile visual search. Multi-view images of objects acquired by the mobile clients are processed and local features are sent to a server, which combines the query image representations with early/late fusion methods and returns the query results. We performed a comprehensive analysis of early and late fusion approaches using various similarity functions, on an existing single view and a new multi-view object image database. The experimental results show that multi-view search provides significantly better retrieval accuracy compared to traditional single view search.  相似文献   
144.
Multimedia Tools and Applications - This paper describes a 63-participant user study that compares two widely known systems supporting end users in creating trigger-action rules for the Internet of...  相似文献   
145.
146.
147.
In a literature review on the last 20 years of automated analysis of feature models, the formalization of analysis operations was identified as the most relevant challenge in the field. This formalization could provide very valuable assets for tool developers such as a precise definition of the analysis operations and, what is more, a reference implementation, i.e., a trustworthy, not necessarily efficient implementation to compare different tools outputs. In this article, we present the FLAME framework as the result of facing this challenge. FLAME is a formal framework that can be used to formally specify not only feature models, but other variability modeling languages (VML s) as well. This reusability is achieved by its two-layered architecture. The abstract foundation layer is the bottom layer in which all VML-independent analysis operations and concepts are specified. On top of the foundation layer, a family of characteristic model layers—one for each VML to be formally specified—can be developed by redefining some abstract types and relations. The verification and validation of FLAME has followed a process in which formal verification has been performed traditionally by manual theorem proving, but validation has been performed by integrating our experience on metamorphic testing of variability analysis tools, something that has shown to be much more effective than manually designed test cases. To follow this automated, test-based validation approach, the specification of FLAME, written in Z, was translated into Prolog and 20,000 random tests were automatically generated and executed. Tests results helped to discover some inconsistencies not only in the formal specification, but also in the previous informal definitions of the analysis operations and in current analysis tools. After this process, the Prolog implementation of FLAME is being used as a reference implementation for some tool developers, some analysis operations have been formally specified for the first time with more generic semantics, and more VML s are being formally specified using FLAME.  相似文献   
148.
This paper presents a methodology to obtain a guaranteed‐reliability controller for constrained linear systems, which switch between different modes according to a Markov chain (Markov jump linear systems). Inside the classical maximal robust controllable set, there is 100% guarantee of never violating constraints at future time. However, outside such set, some sequences might make hitting constraints unavoidable for some disturbance realisations. A guaranteed‐reliability controller based on a greedy heuristic approach was proposed in an earlier work for disturbance‐free, robustly stabilisable Markov jump linear systems. Here, extensions are presented by, first, considering bounded disturbances and, second, presenting an iterative algorithm based on dynamic programming. In non‐stabilisable systems, reliability is zero; therefore, prior results cannot be applied; in this case, optimisation of a mean‐time‐to‐failure bound is proposed, via minor algorithm modifications. Optimality can be proved in the disturbance‐free, finitely generated case. Copyright © 2016 John Wiley & Sons, Ltd.  相似文献   
149.
This paper describes a nonlinear programming‐based robust design methodology for controllers and prefilters of a predefined structure for the linear time‐invariant systems involved in the quantitative feedback theory. This controller and prefilter synthesis problem is formulated as a single optimization problem with a given performance optimization objective and constraints enforcing stability and various specifications usually enforced in the quantitative feedback theory. The focus is set on providing constraints expression that can be used in standard nonlinear programming solvers. The nonlinear solver then computes in a single‐step controller and prefilter design parameters that satisfy the prescribed constraints and maximizes the performance optimization objective. The effectiveness of the proposed approach is demonstrated through a variety of difficult design cases like resonant plants, open‐loop unstable plants, and plants with variation in the time delay. Copyright © 2016 John Wiley & Sons, Ltd.  相似文献   
150.
Satellite imagery has proven to be a powerful tool for measuring chlorophyll a in surface waters. While this provides an estimate of total phytoplankton biomass, it does not distinguish between phytoplankton groups, many of which have functional differences and therefore affect biogeochemical cycles differently. Phytoplankton pigment analysis has been used to quantify a wide range of photosynthetic and accessory pigments, and chemotaxonomic analysis (e.g. CHEMTAX) has been used to successfully quantify functional taxonomic groups in nature based on pigment distributions. Here, we combine CHEMTAX analysis with satellite-derived distributions of specific phytoplankton pigments to describe the distributions of particular components of the phytoplankton community in the northeast coast of the United States from space. The spatial and seasonal variations in phytoplankton community structure elucidated through satellite remote sensing methods generally agreed with observations of abundance estimates of cell counts. Diatoms were generally the most abundant phytoplankton in this region, especially during Winter-Spring and in the inner shelf, but phytoplankton populations shifted to increasing abundance of other taxa during Summer, especially offshore. While still preliminary, satellite-derived taxa-specific information with proper regional controls holds promise for providing information on phytoplankton abundance to a taxonomic group level which would greatly improve our understanding of the impacts of human activity and climate change on ecosystems.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号