首页 | 官方网站   微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   10237篇
  免费   32篇
  国内免费   138篇
工业技术   10407篇
  2023年   1篇
  2022年   8篇
  2021年   14篇
  2020年   6篇
  2019年   20篇
  2018年   21篇
  2017年   6篇
  2016年   11篇
  2015年   7篇
  2014年   219篇
  2013年   181篇
  2012年   771篇
  2011年   3067篇
  2010年   1129篇
  2009年   1002篇
  2008年   675篇
  2007年   580篇
  2006年   444篇
  2005年   573篇
  2004年   527篇
  2003年   580篇
  2002年   278篇
  2001年   5篇
  2000年   6篇
  1999年   20篇
  1998年   85篇
  1997年   23篇
  1996年   18篇
  1995年   5篇
  1994年   7篇
  1993年   3篇
  1992年   9篇
  1991年   7篇
  1990年   10篇
  1989年   7篇
  1988年   10篇
  1987年   6篇
  1986年   11篇
  1985年   6篇
  1984年   23篇
  1983年   11篇
  1982年   6篇
  1981年   6篇
  1980年   1篇
  1977年   1篇
  1973年   1篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
This paper describes the parallel simulation of sediment dynamics in shallow water. By using a Lagrangian model, the problem is transformed to one in which a large number of independent particles must be tracked. This results in a technique that can be parallelised with high efficiency. We have developed a sediment transport model using three different sediment suspension methods. The first method uses a modified mean for the Poisson distribution function to determine the expected number of the suspended particles in each particular grid cell of the domain over all available processors. The second method determines the number of particles to suspend with the aid of the Poisson distribution function only in those grid cells which are assigned to that processor. The third method is based on the technique of using a synchronised pseudo-random-number generator to generate identical numbers of suspended particles in all valid grid cells for each processor. Parallel simulation experiments are performed in order to investigate the efficiency of these three methods. Also the parallel performance of the implementations is analysed. We conclude that the second method is the best method on distributed computing systems (e.g., a Beowulf cluster), whereas the third maintains the best load distribution.  相似文献   
102.
Deep belief networks (DBN) are generative neural network models with many layers of hidden explanatory factors, recently introduced by Hinton, Osindero, and Teh (2006) along with a greedy layer-wise unsupervised learning algorithm. The building block of a DBN is a probabilistic model called a restricted Boltzmann machine (RBM), used to represent one layer of the model. Restricted Boltzmann machines are interesting because inference is easy in them and because they have been successfully used as building blocks for training deeper models. We first prove that adding hidden units yields strictly improved modeling power, while a second theorem shows that RBMs are universal approximators of discrete distributions. We then study the question of whether DBNs with more layers are strictly more powerful in terms of representational power. This suggests a new and less greedy criterion for training RBMs within DBNs.  相似文献   
103.
Standardisation initiatives (ISO and IEC) try to answer the problem of managing heterogeneous information, scattered within organizations, by formalising the knowledge related to products technical data. While the product is the centred object from which, along its lifecycle, all enterprise systems, either inside a single enterprise or between cooperating networked enterprises, have a specific view, we may consider it as active as far as it participates to the decisions making by providing knowledge about itself. This paper proposes a novel approach, postulating that the product, represented by its technical data, may be considered as interoperable per se with the many applications involved in manufacturing enterprises as far as it embeds knowledge about itself, as it stores all its technical data, provided that these are embedded on a common model. The matter of this approach is to formalise of all technical data and concepts contributing to the definition of a Product Ontology, embedded into the product itself and making it interoperable with applications, minimising loss of semantics.  相似文献   
104.
Redesigning Purdue's Online Writing Lab (OWL) presented the opportunity for collaboration among Writing Center and Professional Writing Program members. While the article briefly describes the OWL redesign process, the argument focuses on collaboration and presents a model for sustainable intraprogram collaboration. Following Hawhee, usability research is defined as “invention-in-the-middle,” which offers a model for understanding research process as part of the infrastructure of new media instruction as described by DeVoss, Cushman, and Grabill. This article offers four stakeholder perspectives on the process of participatory technology design: of writing center administrators, graduate students, technical writing practitioners, and writing program graduate faculty members. The model asserted by this article presents a dynamic understanding of expertise and of fluidity in the roles of participants. Collaborative usability research, seen as invention-in-the-middle, contributes both to long-term sustainability of technological artifacts as well as the discursive interactions among stakeholders whose work supports these artifacts.  相似文献   
105.
The traditional modes of knowledge production and circulation in academia are (slowly but surely) shifting from the hierarchical, top-down systems of print to the distributed, bottom-up systems of the Web. It is in the context of these shifts and the rapid development of Web 2.0 tools and methods that we argue for a concomitant shift in the predominant practices of graduate education in rhetoric—particularly for students of digital rhetoric. In this article, we describe the development of a research network that combines the power of digital networking with the collaborative facilitation offered by communities of practice and consider how research networks can be grown and sustained as part of the graduate education of technorhetoricians.  相似文献   
106.
This paper consists of two parts. In the first, more theoretic part, two Wiener systems driven by the same Gaussian noise excitation are considered. For each of these systems, the best linear approximation (BLA) of the output (in mean square sense) is calculated, and the residuals, defined as the difference between the actual output and the linearly simulated output is considered for both outputs. The paper is focused on the study of the linear relations that exist between these residuals. Explicit expressions are given as a function of the dynamic blocks of both systems, generalizing earlier results obtained by Brillinger [Brillinger, D. R. (1977). The identification of a particular nonlinear time series system. Biometrika, 64(3), 509-515] and Billings and Fakhouri [Billings, S. A., & Fakhouri, S. Y. (1982). Identification of systems containing linear dynamic and static nonlinear elements. Automatica, 18(1), 15-26]. Compared to these earlier results, a much wider class of static nonlinear blocks is allowed, and the efficiency of the estimate of the linear approximation between the residuals is considerably improved. In the second, more practical, part of the paper, this new theoretical result is used to generate initial estimates for the transfer function of the dynamic blocks of a Wiener-Hammerstein system. This method is illustrated on experimental data.  相似文献   
107.
For robustness analysis with integral quadratic constraints, we formulate a new positivity condition on the solution of the corresponding linear matrix inequality which is necessary and sufficient for nominal stability of the underlying system. The application of this technical result is illustrated by a complete solution of the L2-gain and robust H2-estimator design problems if the uncertainties are characterized by dynamic integral quadratic constraints.  相似文献   
108.
Graph matching is a fundamental problem that arises frequently in the areas of distributed control, computer vision, and facility allocation. In this paper, we consider the optimal graph matching problem for weighted graphs, which is computationally challenging due the combinatorial nature of the set of permutations. Contrary to optimization-based relaxations to this problem, in this paper we develop a novel relaxation by constructing dynamical systems on the manifold of orthogonal matrices. In particular, since permutation matrices are orthogonal matrices with nonnegative elements, we define two gradient flows in the space of orthogonal matrices. The first minimizes the cost of weighted graph matching over orthogonal matrices, whereas the second minimizes the distance of an orthogonal matrix from the finite set of all permutations. The combination of the two dynamical systems converges to a permutation matrix, which provides a suboptimal solution to the weighted graph matching problem. Finally, our approach is shown to be promising by illustrating it on nontrivial problems.  相似文献   
109.
A new theorem is provided to test the identifiability of discrete-time systems with polynomial nonlinearities. That extends to discrete-time systems the local state isomorphism approach for continuous-time systems. Two examples are provided to illustrate the approach.  相似文献   
110.
Model-based feedback control of vibration in flexible structures can be complicated by the possibility that interaction with an external body occurs. If not accounted for, instability or poor performance may result. In this paper, a method is proposed for achieving robust vibration control of flexible structures under contact. The method uses robust linear state feedback, coupled with a state estimation scheme utilizing contact force measurement. Uncertain contact characteristics are modelled by a sector-bounded non-linear function, such that state feedback gains can be synthesized using a matrix inequality formulation of the Popov stability criterion. A separation theorem is used to establish a robust H2 cost bound for the closed loop system. Experimental results from a multi-mode flexible structure testbed confirm that vibration attenuation and stability can be maintained over a broad range of contact characteristics, in terms of compliance and clearance.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号