基于最小电压法的超声换能器谐振频率自动跟踪*

首先分析了最大电流法跟踪超声换能器谐振频率的原理及应用范围。研究了基于由串联电感和并联电容匹配电路下,不同频率时换能器两端电压电流的变化规律。研究表明在串联电感和并联电容匹配电路下发生谐振时,换能器两端的电压最小而电流并非最大。由此形成了采用最小电压法跟踪谐振频率的自动跟踪策略,并给出了该方法的具体实施步骤。论文研究结果为换能器谐振频率的自动跟踪方法提供了新的选择。     

分段线性电路切换系统的复杂行为及非光滑分岔机理

分析了分段线性电路系统在周期切换下的复杂动力学行为及其产生的机理. 基于平衡点分析, 给出了两子系统Fold分岔和Hopf分岔条件. 考虑了在不同稳定态时两子系统周期切换的分岔特性, 产生了不同的周期振荡, 并揭示了其产生的机理. 在不同的周期振荡中, 切换点的数量随参数变化产生倍化, 导致切换系统由倍周期分岔进入混沌. 关键词： 分段线性电路 切换系统 非光滑分岔     

分数阶Chua's系统错位同步无感模块化电路实现及应用

基于分数阶混沌系统稳定性理论, 设计高效的非线性控制器, 实现初始值不同的两个分数阶Chua's系统错位投影同步. 根据分数阶复频域近似方法, 提出分数阶系统的等效电路, 实现分数阶Chua's系统错位投影同步的无感模块化电路. 最后,利用改进的混沌掩盖通信原理, 将以上同步方案应用于混沌保密通信中, 在发送端使用分数阶混沌序列对有用信号加密传送, 从接收端可以无失真地恢复出有用信号. 数值仿真与电路仿真证实了提出方案的可行性. 关键词： 分数阶Chua's系统 错位投影同步 无感模块化电路 保密通信     

含磁控和荷控两种忆阻器的混沌电路设计与仿真

利用惠普实验室荷控和磁控两种忆阻器模型设计了一个五阶混沌电路. 数值仿真结果表明该电路在参数变化情况下能产生Hopf分岔和反倍周期分岔两种分岔行为,并能产生双涡卷、单涡卷、周期态等不同相轨道. 为了验证电路的混沌行为,利用基本元器件设计了惠普实验室荷控和磁控忆阻器模拟器,并将其应用到对所设计电路中进行Pspice仿真,电路仿真结果验证了理论分析的正确性. 关键词： 混沌电路 HP忆阻器 模拟器 Pspice仿真     

最佳通用逻辑门ULG.2 的应用研究

本文在作者以前研究的基础上,进一步研究最佳通用逻辑门ULG.2的应用,提出了用ULG.2组成的一些脉冲电路。     

Polynomial algorithms for (integral) maximum two-flows in vertex edge-capacitated planar graphs

In this paper we study the maximum two-flow problem in vertex- and edge-capacitated undirected ST₂-planar graphs, that is, planar graphs where the vertices of each terminal pair are on the same face. For such graphs we provide an O(n) algorithm for finding a minimum two-cut and an O(n log n) algorithm for determining a maximum two-flow and show that the value of a maximum two-flow equals the value of a minimum two-cut. We further show that the flow obtained is half-integral and provide a characterization of edge and vertex capacitated ST₂-planar graphs that guarantees a maximum two-flow that is integral. By a simple variation of our maximum two-flow algorithm we then develop, for ST₂-planar graphs with vertex and edge capacities, an O(n log n) algorithm for determining an integral maximum two-flow of value not less than the value of a maximum two-flow minus one.     

A Mixed Heuristic for Circuit Partitioning

As general-purpose parallel computers are increasingly being used to speed up different VLSI applications, the development of parallel algorithms for circuit testing, logic minimization and simulation, HDL-based synthesis, etc. is currently a field of increasing research activity. This paper describes a circuit partitioning algorithm which mixes Simulated Annealing (SA) and Tabu Search (TS) heuristics. The goal of such an algorithm is to obtain a balanced distribution of the target circuit among the processors of the multicomputer allowing a parallel CAD application for Test Pattern Generation to provide good efficiency. The results obtained indicate that the proposed algorithm outperforms both a pure Simulated Annealing and a Tabu Search. Moreover, the usefulness of the algorithm in providing a balanced workload distribution is demonstrated by the efficiency results obtained by a topological partitioning parallel test-pattern generator in which the proposed algorithm has been included. An extented algorithm that works with general graphs to compare our approach with other state of the art algorithms has been also included.     

蔡氏对偶混沌电路分析

提出了一个新颖的蔡氏对偶混沌电路,并进行了深入的理论研究和计算机仿真分析.得出了几点结论:1)此混沌电路元器件少,且与蔡氏混沌电路结构完全对偶.2)在确定的元器件参数条件下,电路出现双涡卷奇怪吸引子和丰富的混沌动力学行为. 关键词： 蔡氏对偶电路 奇怪吸引子 混沌     

On hyperbolic once-punctured-torus bundles II: fractal tessellations of the plane

We describe fractal tessellations of the complex plane that arise naturally from Cannon–Thurston maps associated to complete, hyperbolic, once-punctured-torus bundles. We determine the symmetry groups of these tessellations. To our wives, Ardyth and Elena.     

Cubic planar hamiltonian graphs of various types

Let U be the set of cubic planar hamiltonian graphs, A the set of graphs G in U such that G-v is hamiltonian for any vertex v of G, B the set of graphs G in U such that G-e is hamiltonian for any edge e of G, and C the set of graphs G in U such that there is a hamiltonian path between any two different vertices of G. With the inclusion and/or exclusion of the sets A,B, and C, U is divided into eight subsets. In this paper, we prove that there is an infinite number of graphs in each of the eight subsets.