首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2028篇
  免费   111篇
  国内免费   1篇
电工技术   17篇
化学工业   478篇
金属工艺   38篇
机械仪表   33篇
建筑科学   72篇
矿业工程   2篇
能源动力   55篇
轻工业   158篇
水利工程   7篇
石油天然气   4篇
无线电   261篇
一般工业技术   406篇
冶金工业   164篇
原子能技术   23篇
自动化技术   422篇
  2023年   24篇
  2022年   49篇
  2021年   47篇
  2020年   56篇
  2019年   55篇
  2018年   56篇
  2017年   68篇
  2016年   70篇
  2015年   56篇
  2014年   70篇
  2013年   135篇
  2012年   123篇
  2011年   165篇
  2010年   110篇
  2009年   104篇
  2008年   123篇
  2007年   105篇
  2006年   96篇
  2005年   98篇
  2004年   61篇
  2003年   52篇
  2002年   42篇
  2001年   19篇
  2000年   22篇
  1999年   27篇
  1998年   41篇
  1997年   49篇
  1996年   30篇
  1995年   23篇
  1994年   23篇
  1993年   28篇
  1992年   13篇
  1991年   8篇
  1990年   11篇
  1989年   6篇
  1988年   7篇
  1987年   6篇
  1986年   6篇
  1985年   6篇
  1984年   6篇
  1983年   6篇
  1982年   5篇
  1981年   4篇
  1980年   2篇
  1977年   7篇
  1976年   5篇
  1975年   3篇
  1974年   2篇
  1973年   2篇
  1971年   3篇
排序方式: 共有2140条查询结果,搜索用时 0 毫秒
31.
Multicamera people tracking with a probabilistic occupancy map   总被引:1,自引:0,他引:1  
Given two to four synchronized video streams taken at eye level and from different angles, we show that we can effectively combine a generative model with dynamic programming to accurately follow up to six individuals across thousands of frames in spite of significant occlusions and lighting changes. In addition, we also derive metrically accurate trajectories for each one of them.Our contribution is twofold. First, we demonstrate that our generative model can effectively handle occlusions in each time frame independently, even when the only data available comes from the output of a simple background subtraction algorithm and when the number of individuals is unknown a priori. Second, we show that multi-person tracking can be reliably achieved by processing individual trajectories separately over long sequences, provided that a reasonable heuristic is used to rank these individuals and avoid confusing them with one another.  相似文献   
32.
Recent economic and international threats to western industries have encouraged companies to increase their performance in all ways possible. Many look to deal quickly with disturbances, reduce inventory, and exchange information promptly throughout the supply chain. In other words they want to become more agile. To reach this objective it is critical for planning systems to present planning strategies adapted to the different contexts, to attain better performances. Due to consolidation, the development of integrated supply chains and the use of inter-organizational information systems have increased business interdependencies and in turn the need for increased collaboration to deal with disturbance in a synchronized way. Thus, agility and synchronization in supply chains are critical to maintain overall performance. In order to develop tools to increase the agility of the supply chain and to promote the collaborative management of such disturbances, agent-based technology takes advantage of the ability of agents to make autonomous decisions in a distributed network through the use of advanced collaboration mechanisms. Moreover, because of the highly instable and dynamic environment of today's supply chains, planning agents must handle multiple problem solving approaches. This paper proposes a Multi-behavior planning agent model using different planning strategies when decisions are supported by a distributed planning system. The implementation of this solution is realized through the FOR@C experimental agent-based platform, dedicated to supply chain planning for the lumber industry.  相似文献   
33.
34.
VPSPACE and a Transfer Theorem over the Reals   总被引:1,自引:1,他引:0  
We introduce a new class VPSPACE of families of polynomials. Roughly speaking, a family of polynomials is in VPSPACE if its coefficients can be computed in polynomial space. Our main theorem is that if (uniform, constant-free) VPSPACE families can be evaluated efficiently then the class \sf PAR\mathbb R\sf {PAR}_{\mathbb {R}} of decision problems that can be solved in parallel polynomial time over the real numbers collapses to \sfP\mathbb R\sf{P}_{\mathbb {R}}. As a result, one must first be able to show that there are VPSPACE families which are hard to evaluate in order to separate \sfP\mathbb R\sf{P}_{\mathbb {R}} from \sfNP\mathbb R\sf{NP}_{\mathbb {R}}, or even from \sfPAR\mathbb R\sf{PAR}_{\mathbb {R}}.  相似文献   
35.
Wireless Personal Communications - The Invisible Internet Project (I2P) as a secure protocol uses robust mechanisms and strong algorithms to reinforce the security and the anonymity of the...  相似文献   
36.

The joint estimation of the location vector and the shape matrix of a set of independent and identically Complex Elliptically Symmetric (CES) distributed observations is investigated from both the theoretical and computational viewpoints. This joint estimation problem is framed in the original context of semiparametric models allowing us to handle the (generally unknown) density generator as an infinite-dimensional nuisance parameter. In the first part of the paper, a computationally efficient and memory saving implementation of the robust and semiparmaetric efficient R-estimator for shape matrices is derived. Building upon this result, in the second part, a joint estimator, relying on the Tyler’s M-estimator of location and on the R-estimator of shape matrix, is proposed and its Mean Squared Error (MSE) performance compared with the Semiparametric Cramér-Rao Bound (SCRB).

  相似文献   
37.
Journal of Automated Reasoning - Algebraic datatypes, and among them lists and trees, have attracted a lot of interest in automated reasoning and Satisfiability Modulo Theories (SMT). Since its...  相似文献   
38.
Recent advances in design theory help clarify the logic, forms and conditions of generativity. In particular, the formal model of forcing predicts that high-level generativity (so-called generic generativity) can only be reached if the knowledge structure meets the ‘splitting condition’. We test this hypothesis for the case of Bauhaus (1919–1933), where we can expect strong generativity and where we have access to the structures of knowledge provided by teaching. We analyse teaching at Bauhaus by focusing on the courses of Itten and Klee. We show that these courses aimed to increase students’ creative design capabilities by providing the students with methods of building a knowledge base with two critical features: (1) a knowledge structure that is characterized by non-determinism and non-modularity and (2) a design process that helps students progressively ‘superimpose’ languages on the object. From the results of the study, we confirm the hypothesis deduced from design theory; we reveal unexpected conditions on the knowledge structure required for generativity and show that the structure is different from the knowledge structure and design process of engineering systematic design and show that the conditions required for generativity, which can appear as a limit on generativity, can also be positively interpreted. The example of Bauhaus shows that enabling a splitting condition is a powerful way to increase designers’ generativity.  相似文献   
39.
A high-accuracy cryogenic radiometer has been developed at the National Institute of Standards and Technology to serve as a primary standard for optical power measurements. This instrument is an electrical-substitution radiometer that can be operated at cryogenic temperatures to achieve a relative standard uncertainty of 0.021% at an optical power level of 0.8 mW. The construction and operation of the high-accuracy cryogenic radiometer and the uncertainties in optical power measurements are detailed.  相似文献   
40.
This paper proposes to decompose the nonlinear dynamic of a chaotic system with Chebyshev polynomials to improve performances of its estimator. More widely than synchronization of chaotic systems, this algorithm is compared to other nonlinear stochastic estimator such as Extended Kalman Filter (EKF) and Unscented Kalman Filter (UKF). Chebyshev polynomials orthogonality properties is used to fit a polynomial to a nonlinear function. This polynomial is then used in an Exact Polynomial Kalman Filter (ExPKF) to run real time state estimation. The ExPKF offers mean square error optimality because it can estimate exact statistics of transformed variables through the polynomial function. Analytical expressions of those statistics are derived so as to lower ExPKF algorithm computation complexity and allow real time applications. Simulations under the Additive White Gaussian Noise (AWGN) hypothesis, show relevant performances of this algorithm compared to classical nonlinear estimators.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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