首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   541篇
  免费   67篇
  国内免费   78篇
电工技术   11篇
综合类   45篇
化学工业   2篇
金属工艺   5篇
机械仪表   30篇
建筑科学   5篇
矿业工程   1篇
能源动力   5篇
轻工业   1篇
水利工程   1篇
武器工业   3篇
无线电   69篇
一般工业技术   22篇
冶金工业   4篇
自动化技术   482篇
  2024年   2篇
  2023年   4篇
  2022年   6篇
  2021年   10篇
  2020年   10篇
  2019年   15篇
  2018年   18篇
  2017年   16篇
  2016年   18篇
  2015年   24篇
  2014年   29篇
  2013年   26篇
  2012年   34篇
  2011年   29篇
  2010年   24篇
  2009年   37篇
  2008年   31篇
  2007年   34篇
  2006年   22篇
  2005年   22篇
  2004年   23篇
  2003年   15篇
  2002年   14篇
  2001年   26篇
  2000年   32篇
  1999年   20篇
  1998年   18篇
  1997年   16篇
  1996年   17篇
  1995年   12篇
  1994年   24篇
  1993年   14篇
  1992年   11篇
  1991年   1篇
  1990年   1篇
  1989年   4篇
  1988年   8篇
  1987年   3篇
  1986年   4篇
  1984年   4篇
  1983年   3篇
  1980年   2篇
  1979年   2篇
  1962年   1篇
排序方式: 共有686条查询结果,搜索用时 9 毫秒
1.
激光干涉环圆心位置测定技术及应用   总被引:1,自引:0,他引:1  
本文利用在平面内绕定轴旋转的线阵CCD及微机系统自动测定激光干涉环圆心位置及应用于激光外径千分尺平行度检查仪平行度检查结果的自动数字化输出。  相似文献   
2.
Abstract

This paper presents a method for parallelising nested loops with affine dependences. The data dependences of a program are represented exactly using a dependence matrix rather than an imprecise dependence abstraction. By a careful analysis of the eigenvectors and eigenvalues of the dependence matrix, we detect the parallelism inherent in the program, partition the iteration space of the program into sequential and parallel regions, and generate parallel code to execute these regions. For a class of programs considered in the paper, the proposed method can expose more coarse-grain and fine-grain parallelism than a hyperplane-based loop transformation.  相似文献   
3.
This paper extends the algorithms which were developed in Part I to cases in which there is no affine schedule, i.e. to problems whose parallel complexity is polynomial but not linear. The natural generalization is to multidimensional schedules with lexicographic ordering as temporal succession. Multidimensional affine schedules, are, in a sense, equivalent to polynomial schedules, and are much easier to handle automatically. Furthermore, there is a strong connection between multidimensional schedules and loop nests, which allows one to prove that a static control program always has a multidimensional schedule. Roughly, a larger dimension indicates less parallelism. In the algorithm which is presented here, this dimension is computed dynamically, and is just sufficient for scheduling the source program. The algorithm lends itself to a divide and conquer strategy. The paper gives some experimental evidence for the applicability, performances and limitations of the algorithm.  相似文献   
4.
A recently proposed pipelined multithreading (PMT) technique exhibits wide applicability in parallelizing general sequential programs on multi-core processors. However, significant inter-core communication overhead limits PMT performance and prevents its commercial utilization. A simple and effective clustered pipelined multithreading (CPMT) approach is presented to accelerate sequential programs on commodity multi-core processors. This CPMT technique adopts a clustered communication mechanism that can yield very low average communication overhead by eliminating false sharing as well as reducing communication operation and transit delays in the software-only approach. A single-producer/single-consumer concurrent lock-free clusteredQueue algorithm based on a two-level queue structure is also proposed. The accuracy of CPMT is theoretically demonstrated. The performances of the algorithm and CPMT are evaluated on a commodity AMD Phenom four-core processor. The number of enqueue and dequeue times of the algorithm are 20.8 and 23 cycles given an appropriate parameter, respectively. The speedup of CPMT ranges from 13.1% to 119.8% for typical loops extracted from the SPEC CPU 2000 benchmark suite.  相似文献   
5.
The manycore revolution can be characterized by increasing thread counts, decreasing memory per thread, and diversity of continually evolving manycore architectures. High performance computing (HPC) applications and libraries must exploit increasingly finer levels of parallelism within their codes to sustain scalability on these devices. A major obstacle to performance portability is the diverse and conflicting set of constraints on memory access patterns across devices. Contemporary portable programming models address manycore parallelism (e.g., OpenMP, OpenACC, OpenCL) but fail to address memory access patterns. The Kokkos C++ library enables applications and domain libraries to achieve performance portability on diverse manycore architectures by unifying abstractions for both fine-grain data parallelism and memory access patterns. In this paper we describe Kokkos’ abstractions, summarize its application programmer interface (API), present performance results for unit-test kernels and mini-applications, and outline an incremental strategy for migrating legacy C++ codes to Kokkos. The Kokkos library is under active research and development to incorporate capabilities from new generations of manycore architectures, and to address a growing list of applications and domain libraries.  相似文献   
6.
We studied the architecture of embedded computing systems from the viewpoint of power consumption in memory systems and used a selective-code-compression (SCC) approach to realize our design.Based on t...  相似文献   
7.
We describe a performance study of a multi-zone application benchmark implemented in several OpenMP approaches that exploit multi-level parallelism and deal with unbalanced workload. The multi-zone application was derived from the well-known NAS Parallel Benchmarks (NPB) suite that involves flow solvers on collections of loosely coupled discretization meshes. Parallel versions of this application have been developed using the Subteam concept and Workqueuing model as extensions to the current OpenMP. We examine the performance impact of these extensions to OpenMP and compare with hybrid and nested OpenMP approaches on several large parallel systems.  相似文献   
8.
基于并列选择遗传算法的多机器人协作探测   总被引:1,自引:0,他引:1  
多机器人系统在执行探测任务时,存在多个机器人同时选择相同探测区域而造成碰撞几率增加和探测效率降低的问题.在原有并列选择遗传算法的基础上,提出了一种改进的遗传算法.仿真和实验结果表明,将该算法应用于多机器人协作区域探测,可以减小机器人之间的碰撞几率,提高多机器人系统的探测效率.  相似文献   
9.
The body of mathematics of modified systems of algorithmic algebras (SAA-M) is used to formalize the Edmonds–Karp algorithm of finding the maximum flow in a network. With allowance made for the distributed system features that are usually used for solving complicated problems, optimization criteria are formulated and used to obtain parallel SAA-M-schemes. Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 146–152, March–April 2009.  相似文献   
10.
Prostate cancer accounts for one-third of noncutaneous cancers diagnosed in US men and is a leading cause of cancer-related death. Advances in Fourier transform infrared spectroscopic imaging now provide very large data sets describing both the structural and local chemical properties of cells within prostate tissue. Uniting spectroscopic imaging data and computer-aided diagnoses (CADx), our long term goal is to provide a new approach to pathology by automating the recognition of cancer in complex tissue. The first step toward the creation of such CADx tools requires mechanisms for automatically learning to classify tissue types—a key step on the diagnosis process. Here we demonstrate that genetics-based machine learning (GBML) can be used to approach such a problem. However, to efficiently analyze this problem there is a need to develop efficient and scalable GBML implementations that are able to process very large data sets. In this paper, we propose and validate an efficient GBML technique——based on an incremental genetics-based rule learner. exploits massive parallelisms via the message passing interface (MPI) and efficient rule-matching using hardware-implemented operations. Results demonstrate that is capable of performing prostate tissue classification efficiently, making a compelling case for using GBML implementations as efficient and powerful tools for biomedical image processing.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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