高稳定度低纹波的线性稳压电源设计

设计制作了一款基于LT1083／LT1033系列大功率低压差三端稳压芯片的高稳定度低纹波直流电源,介绍了降压、整流滤波、线性稳压、LC低通滤波等主要构成模块。测试结果表明,本电源具有输出电压稳定度高、输出电流大、低纹波、低功耗等特点。     

A characterization of span program size and improved lower bounds for monotone span programs

We give a characterization of span program size by a combinatorial-algebraic measure. The measure we consider is a generalization of a measure on covers which has been used to prove lower bounds on formula size and has also been studied with respect to communication complexity.?In the monotone case our new methods yield lower bounds for the monotone span program complexity of explicit Boolean functions in n variables over arbitrary fields, improving the previous lower bounds on monotone span program size. Our characterization of span program size implies that any matrix with superpolynomial separation between its rank and cover number can be used to obtain superpolynomial lower bounds on monotone span program size. We also identify a property of bipartite graphs that is suficient for constructing Boolean functions with large monotone span program complexity. Received: September 30, 2000.     

电缆接头温度监测系统

电缆温度监测是一些大中型企业经常面临的问题。详细介绍了利用计算机、单片机构成的电缆接头温度自动监测系统。通过该系统可及时获得电缆温度变化情况 ,为安全生产提供保障     

利用PC机控制多机分布式系统的设计与实现

本文设计了一种基于单 5V电源的,利用目PC机来实现对分布在不同地方的下位机进行统一管理的系统。本系统以动态编址的多机通信模块为实现目标,以实现系统规范性、实用性、可扩展性和模块化为设计宗旨,真正实现分散运行、集中管理的网络化管理。     

Entanglement of formation and concurrence for mixed states

We review some results on analytical computations of the measures for quantum entanglement: entanglement of formation and concurrence. We introduce some estimations of the lower bounds for the entanglement of formation in bipartite mixed states, and of lower bounds for the concurrence in bipartite and tripartite systems. The results on lower bounds for the concurrence are also generalized to arbitrary multipartite systems.     

Exponential lower bounds for the pigeonhole principle

In this paper we prove an exponential lower bound on the size of bounded-depth Frege proofs for the pigeonhole principle (PHP). We also obtain an (loglogn)-depth lower bound for any polynomial-sized Frege proof of the pigeonhole principle. Our theorem nearly completes the search for the exact complexity of the PHP, as S. Buss has constructed polynomial-size, logn-depth Frege proofs for the PHP. The main lemma in our proof can be viewed as a general Håstad-style Switching Lemma for restrictions that are partial matchings. Our lower bounds for the pigeonhole principle improve on previous superpolynomial lower bounds.     

Exponential lower bounds for depth three Boolean circuits

We consider the class of unbounded fan-in depth three Boolean circuits, for which the bottom fan-in is limited by k and the top gate is an OR. It is known that the smallest such circuit computing the parity function has gates (for k = O(n ^1/2)) for some , and this was the best lower bound known for explicit (P-time computable) functions. In this paper, for k = 2, we exhibit functions in uniform NC ¹ that require size depth 3 circuits. The main tool is a theorem that shows that any circuit on n variables that accepts a inputs and has size s must be constant on a projection (subset defined by equations of the form x _i = 0, x _i = 1, x _i = x _j or x _i = ) of dimension at least log(a/s)log n. Received: April 1, 1997.