基于凌阳单片机的语音识别技术及应用

介绍了一种以凌阳SPCE061A单片机为基础的语音识别技术,分析了语音识别过程的基本原理,具体阐述了语音识别在该单片机上的实现过程。最后,在智能小车实验平台上对这种语音识别技术成功地进行了验证。     

一种新型工业语音报警器

针对目前工业语音报警器使用中存在的问题，以单片机8031为例，采用ISD1420语音芯片进行工业语音报警器的开发和设计，并给出了语音部分的电路及子程序。该语音报警器采用了直接模拟量存储技术DAST，完成语音的录入、存储及分段调出。     

多媒体技术在单片机系统中的应用

在计算机逐渐走向多媒体化的今天，如何把多媒体技术运用到价格低廉，设备简单的单片机系统中已成为人们关心的问题。正用多媒体技术完成语音制作的原理多媒体技术在单片机中的一种基本应用就是语音系统制作。在家用电器或小型仪表中运用了语音技术后，可以更大程度地方便用户，进而提高产品的竞争力。在多媒体计算机中声音的存储方式常见的有WAVE文件和MIDI文件两种。其中wave文件是将声卡录入的声音以数字形式存放于盘上的～种文件格式。按声音的清晰程度可分几种字节存放模式。而MIDI文件则是存放控制声卡的一条条指令，播放时声卡…     

基于凌阳SPCE061A单片机的语音控制系统

语音控制技术是目前广泛应用和研究的重要技术,对人机交互的智能系统具有重要价值,利用凌阳16位单片机的特性,根据语音识别的基本原理,设计了一种语音控制系统,经反复试验,证明语音识别准确率高,控制效果好。另有一优点:只有经过训练的特定训练人发出语音命令,系统才响应,因而保密性高。     

基于单片机的公交车自动报站系统设计与实现

提出了一种用单片机控制语音芯片进行公交车语音模拟报站的方法。系统硬件利用STC89C52作为CPU进行总体控制。通过ISD4004语音芯片建立语音信息库,对语音信息进行自由组合,形成变化多样的语音信息;利用LM386功能播出语音信息以及提示语音,同时运用LCD液晶显示器进行站数显示。该公交车报站器结构简单,使用灵活,功能稳定,音质自然、清晰,无论对于社会或者科研都有一定的研究价值。     

实用激光打靶机设计与实现

一种简单实用的激光打靶机系统。该系统是利用８０３１对单片语音芯片ＳＲ９Ｇ２６、显示器进行控制，以实现激光打靶机的语音报靶、显示功能。并叙述了激光打靶机的工作过程及软件设计。     

基于单片机控制的语音采集与回放系统设计研究

介绍了一种采用不同编码方式的语音信号采集与回放系统的设计方案,该系统以AT89C51单片机为控制核心,主要结构由语音前级处理通道、A/D转换模块、单片机控制兼数据处理模块、D/A转换模块、键盘模块和后级处理通道组成,实现了语音的采集与回放功能。系统采用32kB的62256芯片作为语音存储介质,在PCM、DPCM、IV三种编码模式下都能较好地实现语音回放功能。整个系统结构简练、友好,具备较高的性能指标,设计的整体实现具有一定的实用参考价值。     

扩展语音合成器外存信息量的方法

通过ＵＭ５１００语音合成器是汽车报站器上的应用，介绍了采用单片机，锁存器，译码器等硬件配以语音播放程序，并对服务用语实行分段式压缩存贮，从而大大扩展语音合成器外存信息量的方法。     

基于单片机平台语音识别技术的实现

语音识别是实现人机通信的一种重要技术手段.语音识别与语音合成技术的结合使人们能够摆脱人工输入的繁琐,通过语音命令实现控制功能.语音技术的应用已经成为一个具有竞争性的新兴高技术产业,语音识别产品在人机交互应用中已经占到越来越大的比例.本文阐述了基于单片机平台的语言识别技术的设计,为相关的设计研究工作提供了参考.     

基于语音的远程监控系统设计

介绍了一种使用语音为载体的远程监控系统的设计方法。实现实时语音提示、无人值守时的电话查询和故障时自动拨号报警。     

混合关系中的函数依赖及其相关规则

在实际应用中有这样一类关系数据库,其中数据项在某个属性上的取值本身又是一个关系。讨论这种混合关系中的函数依赖及其相应的相关规则具有一定的理论意义和实际应用价值。给出这种混合关系的形式定义、混合关系中4种类型的函数依赖关系以及相应的4种类型的相关规则;并给出混合关系到一般关系的转换,通过这个转换说明了混合关系与普通关系的联系及其差别。给出一个实际应用中的例子,来说明混合关系中的函数依赖和相关规则的形式多样性。     

K(Knowledge)-net: building up and its dynamics

The essence of intelligence is to use certain abilities to obtain knowledge, to use that knowledge, and to operate with that knowledge. New knowledge learned by a human is often related to old existing knowledge, and sometimes we could have more conceptual knowledge based on old knowledge. So, the knowledge in the brain exists in a related structural form, and this structure is dynamic, and therefore is evolvable. Based on the understanding of the real process of learning by a human being, we discuss how to make a model to describe the dynamic structure of knowledge. This model is also a principle of artificial brain design. Most of the knowledge a child learns is from natural language and perception information, and we define this as semantic knowledge. The model to describe the process and structure of knowledge growing in a network form is called a K-net. It is a dynamic network with two main dynamics: one is new knowledge added, and the other is aggregating knowledge existing in the network with some probability. Under these very natural conditions, we found that the network is originally a simple random net, and then some characteristics of a complex network gradually appear when more new knowledge is added and aggregated. A more interesting phenomenon is the appearance of a random hierarchical structure. Does this mean emergence?     

Fault tolerant control for joint structure in PEMS high speed maglev train

The PEMS high speed maglev train, which features a permanent magnet inside an electromagnet, is a new kind of maglev train for long distance intercity transportation. The joint structure, which consists of two single levitation sub‐systems, is the fundamental levitation unit. Two kinds of faults are considered and corresponding fault tolerant control strategies are proposed. The first fault condition is when a gap sensor that is part of a single levitation system is faulty. For this kind of fault, a fault tolerant control strategy based on signal reconfiguration is proposed. The second fault condition is when the whole of a single levitation sub‐system is faulty. Under this condition, a faulty model is firstly established, then a fault tolerant control strategy is designed. When this kind of fault is detected, a switch from the normal controller to the fault tolerant controller can make the faulty system stable.     

REMARKS ON JOHN DISKS

Let D■R2 be a Jordan domain,D*=R2\D,the exterior of D.In this article,the authors obtained the following results:(1)If D is a John disk,then D is an outer linearly locally connected domain;(2)If D* is a John disk,then D is an inner linearly locally connected domain;(3)A homeomorphism f:R 2 →R 2 is a quasiconformal mapping if and only if f(D)is a John disk for any John disk D■R 2 ;and(4)If D is a bounded quasidisk,then D is a John disk,and there exists an unbounded quasidisk which is not a John disk.     

Generalized theory of uncertainty (GTU)—principal concepts and ideas

Uncertainty is an attribute of information. The path-breaking work of Shannon has led to a universal acceptance of the thesis that information is statistical in nature. Concomitantly, existing theories of uncertainty are based on probability theory. The generalized theory of uncertainty (GTU) departs from existing theories in essential ways. First, the thesis that information is statistical in nature is replaced by a much more general thesis that information is a generalized constraint, with statistical uncertainty being a special, albeit important case. Equating information to a generalized constraint is the fundamental thesis of GTU. Second, bivalence is abandoned throughout GTU, and the foundation of GTU is shifted from bivalent logic to fuzzy logic. As a consequence, in GTU everything is or is allowed to be a matter of degree or, equivalently, fuzzy. Concomitantly, all variables are, or are allowed to be granular, with a granule being a clump of values drawn together by a generalized constraint. And third, one of the principal objectives of GTU is achievement of NL-capability, that is, the capability to operate on information described in natural language. NL-capability has high importance because much of human knowledge, including knowledge about probabilities, is described in natural language. NL-capability is the focus of attention in the present paper. The centerpiece of GTU is the concept of a generalized constraint. The concept of a generalized constraint is motivated by the fact that most real-world constraints are elastic rather than rigid, and have a complex structure even when simple in appearance. The paper concludes with examples of computation with uncertain information described in natural language.     

Dynamic anti-windup based control method for state constrained systems

Based on the dynamic anti-windup strategy, an alternative control methodology for state constrained systems is presented. The proposed method is an a posteriori approach for state constrained systems, which is differentiated from the usual a priori approach. That is, first a linear controller is designed to show a desirable nominal performance by ignoring state constraints. Then, an additional compensator is introduced to account for state constraints. By minimizing a reasonable performance index, a dynamic compensator is derived explicitly, which is expressed in plant and controller parameters. The proposed method not only provides a graceful performance degradation, but it also guarantees the total stability of the resulting systems. An illustrative example is given to show the effectiveness of the proposed method.     

Boundary feedback stabilization of a Schr$\＂{o}$dinger equation interconnected with a heat equation

In this paper, we study stabilization for a Schoedinger equation, which is interconnected with a heat equation via boundary coupling. A direct boundary feedback control is adopted. By a detailed spectral analysis, it is found that there are two branches of eigenvalues： one is along the negative real axis, and the other is approaching to a vertical line, which is parallel to the imagine axis. Moreover, it is shown that there is a set of generalized eigenfunctions, which forms a Riesz basis for the energy state space. Finally, the spectrum-determined growth condition is held and the exponential stability of the system is then concluded.     

Using genetic algorithm for lot sizing and scheduling problem with arbitrary job volumes and distinct job due date considerations

This paper considers an integrated lot sizing and scheduling problem for a production–distribution environment with arbitrary job volumes and distinct due dates considerations. In the problem, jobs are firstly batch processed on a batching machine at production stage and then delivered to a pre-specified customer at the subsequent delivery stage by a capacitated vehicle. Each job is associated with a distinct due date and a distinct volume, and has to be delivered to the customer before its due date, i.e. delay is not allowed. The processing time of a batch is a constant independent of the jobs it contains. In production, a constant set-up time as well as a constant set-up cost is required before the first job of this batch is processed. In delivery, a constant delivery time as well as a constant delivery cost is needed for each round-trip delivery between the factory and the customer. Moreover, it is supposed that a job that arrives at the customer before its due date will incur a customer inventory cost. The objective is to find a coordinated lot sizing and scheduling scheme such that the total cost is minimised while guaranteeing a certain customer service level. A mixed integer formulation is proposed for this problem, and then a genetic algorithm is developed to solve it. To evaluate the performance of the proposed genetic algorithm, a lower bound on the objective value is established. Computational experiments show that the proposed genetic algorithm performs well on randomly generated problem instances.     

二进神经网络中汉明球的逻辑意义及一般判别方法

剖析二进神经元的逻辑意义对二进神经网络的规则提取是十分重要的，在布尔空间中，汉明球是一种线性可分的空间结构，如何从汉明球中提取出具有清晰逻辑意义的规则是二进神经网络研究的一个问题，通过对MofN规则表达形式的扩展，分析了汉明球的逻辑意义，提出了表达汉明球逻辑意义的LEM规则和GEM规则方法，并且讨论了汉明球和汉明补球的等价性，另一个重要的结果是证明了二进神经元和汉明球等价的充要条件，从而建立了判别汉明球的一般方法。     

Distributed self-healing control in SONET

This paper proposes a distributed self-healing architecture which contains two self-healing techniques. In this proposal, a path restoration by Self-Healing Ring (SHR) and a path restoration by Dynamic Self-Healing (DSH) algorithm are jointly applied in a network. In the architecture, SHR is applied for a part of a path which is terminated by an Add-Drop Multiplexer (ADM), and DSH is applied for another part of a path which is terminated by two Digital Cross-Connect Systems (DCSs). Based on the architecture, DSH can be applied for a part of a path which is terminated by an ADM. Next, a network design algorithm is described in order to optimize the amount of spare capacity. As a result, spare capacity reduction is realized by using the algorithm for a network where the proposed architecture is applied.