首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   206篇
  免费   18篇
电工技术   2篇
综合类   1篇
化学工业   48篇
金属工艺   2篇
机械仪表   9篇
建筑科学   3篇
能源动力   3篇
轻工业   13篇
水利工程   2篇
无线电   22篇
一般工业技术   26篇
冶金工业   24篇
原子能技术   6篇
自动化技术   63篇
  2023年   2篇
  2022年   2篇
  2021年   6篇
  2020年   8篇
  2019年   5篇
  2018年   13篇
  2017年   9篇
  2016年   8篇
  2015年   8篇
  2014年   5篇
  2013年   11篇
  2012年   6篇
  2011年   17篇
  2010年   12篇
  2009年   6篇
  2008年   4篇
  2007年   6篇
  2006年   5篇
  2005年   5篇
  2004年   5篇
  2003年   7篇
  2002年   3篇
  2001年   3篇
  2000年   1篇
  1999年   6篇
  1998年   16篇
  1997年   5篇
  1996年   4篇
  1995年   4篇
  1994年   4篇
  1993年   3篇
  1992年   1篇
  1991年   2篇
  1989年   2篇
  1988年   1篇
  1987年   1篇
  1985年   2篇
  1984年   1篇
  1981年   2篇
  1980年   1篇
  1979年   2篇
  1978年   1篇
  1976年   5篇
  1974年   2篇
  1973年   1篇
  1967年   1篇
排序方式: 共有224条查询结果,搜索用时 31 毫秒
1.
The authors conducted an assessment study of newly developed motor performance items for the diagnosis of myopathy. 17 children who had had muscle biopsy for this diagnosis in the recent past were administered 14 items based on the measurement of static, dynamic and explosive muscle strength and muscle endurance. Individual items did not have perfect discriminative power, but the results were encouraging enough to warrant detailed study with combinations of the items, so that in future fewer children will have to undergo unnecessary muscle biopsies.  相似文献   
2.
3.
Flow maps are thematic maps that visualize the movement of objects, such as people or goods, between geographic regions. One or more sources are connected to several targets by lines whose thickness corresponds to the amount of flow between a source and a target. Good flow maps reduce visual clutter by merging (bundling) lines smoothly and by avoiding self-intersections. Most flow maps are still drawn by hand and only few automated methods exist. Some of the known algorithms do not support edge-bundling and those that do, cannot guarantee crossing-free flows. We present a new algorithmic method that uses edge-bundling and computes crossing-free flows of high visual quality. Our method is based on so-called spiral trees, a novel type of Steiner tree which uses logarithmic spirals. Spiral trees naturally induce a clustering on the targets and smoothly bundle lines. Our flows can also avoid obstacles, such as map features, region outlines, or even the targets. We demonstrate our approach with extensive experiments.  相似文献   
4.
The paper discusses the theoretical and empirical evidence on the subject and concludes that freight mode choice can be best understood as the outcome of interactions between shippers and carriers, and that mode choice depends to a large extent on the shipment size that results from shipper-carrier interactions. These conclusions are supported by economic experiments designed to test the hypothesis of cooperative behavior. This was accomplished by conducting two sets of experiments (ones with the shipper playing the lead role in selecting the shipment size; and others in which the shipment size decision was left to the carriers), and by comparing their results to the ones obtained numerically under the assumption of perfect cooperation. The comparison of results indicated that the experiments converged to the perfect cooperation case. This is in line with the conclusion from game theory that indicates that under typical market conditions the shipper and carrier would cooperate. These results also imply that it really does not matter who “makes” the decision about the shipment size and mode to be used at a given time period, as over time the shipper—that is the customer—ends up selecting the bids more consistent with its own interest. In other words, these results do not support the assumption that freight mode choice is solely made by the carriers.  相似文献   
5.
We consider a single machine scheduling problem with resource dependent release times that can be controlled by a non-increasing convex resource consumption function. The objective is to minimize the weighted total resource consumption and sum of job completion times with an initial release time greater than the total processing times. It is known that the problem is polynomially solvable in O(n4) with n the number of jobs.  相似文献   
6.
As the need for concepts such as cancellation and OR-joins occurs naturally in business scenarios, comprehensive support in a workflow language is desirable. However, there is a clear trade-off between the expressive power of a language (i.e., introducing complex constructs such as cancellation and OR-joins) and ease of verification. When a workflow contains a large number of tasks and involves complex control flow dependencies, verification can take too much time or it may even be impossible. There are a number of different approaches to deal with this complexity. Reducing the size of the workflow, while preserving its essential properties with respect to a particular analysis problem, is one such approach. In this paper, we present a set of reduction rules for workflows with cancellation regions and OR-joins and demonstrate how they can be used to improve the efficiency of verification. Our results are presented in the context of the YAWL workflow language.  相似文献   
7.
8.
Appearance-based methods, based on statistical models of the pixel values in an image (region) rather than geometrical object models, are increasingly popular in computer vision. In many applications, the number of degrees of freedom (DOF) in the image generating process is much lower than the number of pixels in the image. If there is a smooth function that maps the DOF to the pixel values, then the images are confined to a low-dimensional manifold embedded in the image space. We propose a method based on probabilistic mixtures of factor analyzers to 1) model the density of images sampled from such manifolds and 2) recover global parameterizations of the manifold. A globally nonlinear probabilistic two-way mapping between coordinates on the manifold and images is obtained by combining several, locally valid, linear mappings. We propose a parameter estimation scheme that improves upon an existing scheme and experimentally compare the presented approach to self-organizing maps, generative topographic mapping, and mixtures of factor analyzers. In addition, we show that the approach also applies to finding mappings between different embeddings of the same manifold.  相似文献   
9.
Three-dimensional skeletonization: principle and algorithm   总被引:4,自引:0,他引:4  
An algorithm is proposed for skeletonization of 3-D images. The criterion to preserve connectivity is given in two versions: global and local. The latter allows local decisions in the erosion process. A table of the decisions for all possible configurations is given in this paper. The algorithm using this table can be directly implemented both on general purpose computers and on dedicated machinery.  相似文献   
10.
A programme was designed in which instruction was given in the optimal adjustment of seat and desk height based on individually measured body dimensions. The programme was evaluated by means of measurement of seat and desk height before and after instruction to an experimental group in comparison with a control group to which no instruction was given. In the experimental group, prior to instruction, the mean deviation from the ideal sitting posture measured 71 mm for seat height and 70 mm for desk height. After instruction this deviation decreased by 11 mm for seat height and 18 mm for desk height. Although this is a statistically significant change, it is of limited practical importance since for seat height only 7% (3 of 41) and for desk height 13% (5 of 40) adjusted their furniture effectively as they were advised. The reasons for this meagre result are assumed to be the arbitrary concept of an ideal sitting posture, difficulties in obtaining extra adjustments in the form of footrests and desk elevation, the social acceptability of the advice given, and practical impediments that can occur while adopting an ideal sitting posture.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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