Recently a new technology for high voltage Power MOSFETshas been introduced – the CoolMOS™ . Based on thenew device concept of charge compensation the RDS(on) areaproduct for e.g. 600V transistors has been reduced by afactor of 5. The devices show no bipolar current contributionlike the well known tail current observed during the turn-offphase of IGBTs. CoolMOS™ virtually combines the lowswitching losses of a MOSFET with the on-state losses of anIGBT.
機(jī)電類比法是一種把機(jī)械量通過(guò)一定的計(jì)算等效類比為電量的方法，其在對(duì)電子機(jī)械系統(tǒng)的分析中應(yīng)用非常廣泛。它能夠把一個(gè)較復(fù)雜的機(jī)械系統(tǒng)類比為我們熟知的電路系統(tǒng)來(lái)進(jìn)行分析，從而使問(wèn)題的分析得到簡(jiǎn)化。本文通過(guò)對(duì)振弦式傳感器的分析介紹了機(jī)電類比法，并對(duì)使用電路進(jìn)行了相關(guān)的分析。 Summary：The electromechanical analogy is assort of analysis which is to analogize the mechanical system by using circuit system , it applied widely in the filed of analysis the electronic-mechanical system. The analysis can take a complex mechanical system analogous to a circuitry that we well-known, which can simplify the problems. In the paper, the electro-mechanical analogy method is briefly introduced by analysis the vibrating wire sensor，and have a correlation analysis about the circuit we used.關(guān)鍵詞： 機(jī)電類比法 振弦式傳感器 頻率 振蕩 反饋Keyword：electro-mechanical analogy method，vibrating wire sensor，frequency, oscillation, feedback
0 引言振弦式傳感器是屬于頻率式傳感器的一種。所謂頻率式傳感器就是能直接將被測(cè)量轉(zhuǎn)換為振動(dòng)頻率信號(hào)的傳感器，這類傳感器一般是通過(guò)測(cè)量振弦、振筒、振梁、振膜等彈性振體或石英晶體諧振器的固有諧振頻率來(lái)達(dá)到測(cè)量引起諧振頻率變化的被測(cè)非電量的目的，其也稱為諧振式傳感器[1]。在分析該類傳感器中，由于其涉及到頻率，就容易讓人聯(lián)想到在電子技術(shù)中接觸到的RLC振蕩電路。因此可以嘗試著用類比的方法使之對(duì)應(yīng)起來(lái)分析,即機(jī)電類比法分析。
Included are the files wav1.m, wav2.m, wavecoef.mat and readme.
wav2 function implements the tree structured wavelet transform of the input matrix, up to the given level of decomposition. Wav2 uses another function called wav1, which takes the well known wavelet transform of the given matrix. Daubechies wavelet coefficients are used for wavelet transform operation wahich is saved in wavcoeff.mat.
Linux 虛擬網(wǎng)絡(luò)接口 實(shí)例
In the Linux (or Unix) world, most network interfaces, such as eth0 and ppp0, are associated with a physical device that is in charge of transmitting and receiving data packets. However, some logical network interfaces don t feature any physical packet transmission. The most well-known examples of these "virtual" interfaces are the shaper and eql interfaces.
Basic Compression Library
by Marcus Geelnard
Release 1.2.0
2006-07-22
Introduction
The Basic Compression Library is a library of well known compression algorithms implemented in portable ANSI C code.
For more information about the Basic Compression Library, please read the manual (doc/manual.pdf) and, of course, the source code.
When working with mathematical simulations or engineering problems, it is not unusual to handle curves that contains thousands of points. Usually, displaying all the points is not useful, a number of them will be rendered on the same pixel since the screen precision is finite. Hence, you use a lot of resource for nothing!
This article presents a fast 2D-line approximation algorithm based on the Douglas-Peucker algorithm (see [1]), well-known in the cartography community. It computes a hull, scaled by a tolerance factor, around the curve by choosing a minimum of key points. This algorithm has several advantages:
這是一個(gè)基于Douglas-Peucker算法的二維估值算法。
//
// Histogram Sample
// This sample shows how to use the Sample Grabber filter for video image processing.
// Conceptual background:
// A histogram is just a frequency count of every pixel value in the image.
// There are various well-known mathematical operations that you can perform on an image
// using histograms, to enhance the image, etc.
// Histogram stretch (aka automatic gain control):
// Stretches the image histogram to fill the entire range of values. This is a "point operation,"
// meaning each pixel is scaled to a new value, without examining the neighboring pixels. The
// histogram stretch does not actually require you to calculate the full histogram. The scaling factor
// is calculated from the minimum and maximum values in the image.
This book manage to show you how you can methodically apply different techniques to your
own algorithms to make them more efficient. While this book mostly highlights general techniques,
some well-known algorithms are also looked at in depth.
Auctions are among the oldest economic institutions in place. They have been used since antiquity to sell a wide variety of goods, and their basic form has remained unchanged. In this dissertation, we explore the efficiency of common auctions when values are interdependent- the value to a particular bidder may depend on information available only to others-and asymmetric. In this setting, it is well known that sealed-bid auctions do not achieve efficient allocations in general since they do not allow the information held by different bidders to be shared.
Short description: GUI Ant-Miner is a tool for extracting classification rules from data. It is an updated version of a data mining algorithm called Ant-Miner (Ant Colony-based Data Miner), which was proposed in 2002 by Parpinelli, Lopes and Freitas. GUI Ant-Miner differs from the original algorithm as follows: It has a friendly graphical user interface, makes possible the use of ant populations within the Ant Colony Optimization (ACO) concept, data input file is standardized with the well-known Weka system, and runs on virtually any operating system since it is written in Java.
