首页 | 官方网站   微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   401篇
  国内免费   16篇
  完全免费   134篇
工业技术   551篇
  2018年   8篇
  2017年   5篇
  2016年   7篇
  2015年   19篇
  2014年   23篇
  2013年   18篇
  2012年   51篇
  2011年   46篇
  2010年   36篇
  2009年   33篇
  2008年   38篇
  2007年   46篇
  2006年   40篇
  2005年   39篇
  2004年   26篇
  2003年   30篇
  2002年   14篇
  2001年   14篇
  2000年   12篇
  1999年   6篇
  1998年   3篇
  1997年   5篇
  1996年   10篇
  1995年   9篇
  1994年   5篇
  1993年   5篇
  1992年   1篇
  1991年   1篇
  1988年   1篇
排序方式: 共有551条查询结果,搜索用时 31 毫秒
1.
划分有限状态机的低功耗实现模型   总被引:1,自引:0,他引:1  
通过引入映射状态,使得单状态机的状态分配算法可直接应用于被划分的有限状态机,提出了实现划分有限状态机的通用物理模型.对13个MCNC基准电路,采用文中模型进行测试,实验结果与已发表的结果相比,文中模型在功耗和面积的改进方面有一定的优势.  相似文献   
2.
有限状态机的VHDL设计及优化   总被引:6,自引:0,他引:6  
有限状态机是数字系统中的重要组成部分。本文讨论了有限状态机的分类,给出了状态机各部分的VHDL的描述方法,并介绍了一种新的状态转移的描述风格(arrive-edges),最后讨论了状态机速度优化和容错技术。  相似文献   
3.
无线局域网物理层协议仿真建模   总被引:1,自引:0,他引:1  
陈海明  舒炎泰  鲍彦如 《计算机仿真》2007,24(3):123-126,159
在仿真环境下评价和改进网络性能的主要工作是设计和实现网络协议的模型.由于现在的网络仿真器大都基于离散事件驱动模型和TCP/IP协议栈体系结构,所以物理层协议仿真模型的建立成为评价上层协议性能的前提.但是现有网络仿真器提供的物理层协议模型主要针对有线网络,所以没有考虑无线信道的特性.基于无线信号传播模型和有限状态自动机理论,提出了无线局域网物理层协议仿真模型的设计思路和在具体的网络仿真器中实现IEEE 802.11b协议的方法.建立的模型能够比较真实地模拟无线局域网物理层所具有的发送信号、接收信号和载波侦听的功能.  相似文献   
4.
集成电路RT-Level功耗估计方法概论   总被引:1,自引:0,他引:1  
随着便携式系统的出现,集成电路的功耗日渐成为人们普遍关心的一个问题。为了避免二次设计带来的损失,无论集成电路设计师还是芯片生产厂家都希望能够在较早的设计阶段对芯片的功耗进行准确地估计。集成电路的功耗估计方法主要分为两大类:静态估计和动态估计两种方法。本文对这两类方法进行了探讨,对每一类方法中现存典型的算法进行了介绍;并对如何计算Glitching Power进行了描述;对时序电路的功耗分析进行了探讨:最后对现存的问题进行了总结。  相似文献   
5.
The objective of testing is to determine whether an implementation under test conforms to its specification. In distributed test architectures involving multiple remote testers, this objective can be complicated by the fact that testers may encounter coordination problems relating to controllability (synchronization) and observability during the application of tests. Based on a finite state machine (FSM) specification of the externally observable behaviour of a distributed system and a distinguishing sequence, this paper proposes a method for constructing a checking sequence where there is no potential controllability or observability problems, and where the use of external coordination message exchanges among testers is minimized. The proposed method does not assume a reliable reset feature in the implementations of the given FSM to be tested by the resulting checking sequence. phone: 613-562-5800(Extn)6684 Received May 2004 Revised March 2005 Accepted April 2005 by J. Derrick, M. Harman and R. M. Herons  相似文献   
6.
The X-machine testing method has been developed as an application of the W-method to testing the control structure of an implementation, against a specification. The method was proven to demonstrate the equivalence of the behaviour of the two, subject to a number of conditions both a specification and an implementation are expected to satisfy, such as (1) determinism of the two and (2) that functions labelling arcs on a transition diagram of a specification control structure have been tested in advance. Since the original publication of the testing method, a number of extensions have been published, removing the restrictions mentioned above. This paper surveys the extensions of the X-machine testing method, for (1) testing of functions together with testing of a transition diagram, (2) equivalence testing of a non-deterministic implementation against a non-deterministic specification, (3) conformance testing of a deterministic implementation against a non-deterministic specification and (4) equivalence testing of a system of concurrently executing and communicating X-machines, against a specification. Received June 2004 Revised March 2005 Accepted March 2005 by J. Derrick, M. Harman and R. M. Herons  相似文献   
7.
Finite state machines have been used to model a number of classes of system and there has thus been much interest in the automatic generation of test sequences from finite state machines. Many finite state machine based test techniques utilize sequences that check the final states of transitions, the most general such sequence being a separating sequence: an input sequence that distinguishes between two states of an FSM. When using such techniques the test sequence length can be reduced by utilizing overlap. This paper investigates overlap for separating sequences and shows how this can be incorporated into test sequence generation.  相似文献   
8.
The systolic processing offers the possibility of solving a large number of standard problems on multicellular computing devices with autonomous cells (Processing Elements—PEs). The resulting systolic arrays exploit the underlying parallelism of many computationally intensive problems and offer a vital and effective way of handling them. Advances in technology and especially in VLSI and FPGA have an ongoing contribution to the evolution of systolic arrays. Herein, a FPGA-based Systolic array prototype implementing the Factorization stage of the Quadrant Interlocking Factorization—QIF (Butterfly) method is presented and the corresponding time-complexities achieved are discussed.  相似文献   
9.
A simple specification method is introduced and the results of its application to a series of projects in Philips are reported. The method is principally designed to ensure that that every unusual scenario is considered in a systematic way. In practice, this has led to high-quality specifications and accelerated product development. While the straightforward tabular notation used has proved readily understandable to non-technical personnel, it is also a formal method, producing a model of system behaviour as a finite state machine. In this respect, the notation is unusual in being designed to preserve as far as possible a view of the overall system state and how this changes. The notation also features a constraint table which may be described as a kind of spreadsheet for invariants to help define the states of the system.
Michael BreenEmail: URL: http://www.mbreen.com
  相似文献   
10.
Statistical approaches in speech technology, whether used for statistical language models, trees, hidden Markov models or neural networks, represent the driving forces for the creation of language resources (LR), e.g., text corpora, pronunciation and morphology lexicons, and speech databases. This paper presents a system architecture for the rapid construction of morphologic and phonetic lexicons, two of the most important written language resources for the development of ASR (automatic speech recognition) and TTS (text-to-speech) systems. The presented architecture is modular and is particularly suitable for the development of written language resources for inflectional languages. In this paper an implementation is presented for the Slovenian language. The integrated graphic user interface focuses on the morphological and phonetic aspects of language and allows experts to produce good performances during analysis. In multilingual TTS systems, many extensive external written language resources are used, especially in the text processing part. It is very important, therefore, that representation of these resources is time and space efficient. It is also very important that language resources for new languages can be easily incorporated into the system, without modifying the common algorithms developed for multiple languages. In this regard the use of large external language resources (e.g., morphology and phonetic lexicons) represent an important problem because of the required space and slow look-up time. This paper presents a method and its results for compiling large lexicons, using examples for compiling German phonetic and morphology lexicons (CISLEX), and Slovenian phonetic (SIflex) and morphology (SImlex) lexicons, into corresponding finite-state transducers (FSTs). The German lexicons consisted of about 300,000 words, SIflex consisted of about 60,000 and SImlex of about 600,000 words (where 40,000 words were used for representation using finite-state transducers). Representation of large lexicons using finite-state transducers is mainly motivated by considerations of space and time efficiency. A great reduction in size and optimal access time was achieved for all lexicons. The starting size for the German phonetic lexicon was 12.53 MB and 18.49 MB for the morphology lexicon. The starting size for the Slovenian phonetic lexicon was 1.8 MB and 1.4 MB for the morphology lexicon. The final size of the corresponding FSTs was 2.78 MB for the German phonetic lexicon, 6.33 MB for the German morphology lexicon, 253 KB for SIflex and 662 KB for the SImlex lexicon. The achieved look-up time is optimal, since it only depends on the length of the input word and not on the size of the lexicon. Integration of lexicons for new languages into the multilingual TTS system is easy when using such representations and does not require any changes in the algorithms used for such lexicons.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号