pair

共 48 篇文章
pair 相关的电子技术资料,包括技术文档、应用笔记、电路设计、代码示例等,共 48 篇文章,持续更新中。

PCA9547 8 channel I2C bus mult

The PCA9547 is an octal bidirectional translating multiplexer controlled by the I2C-bus.<BR>The SCL/SDA upstream pair fans out to eight downstream pairs, or channels. Only one<BR>SCx/SDx channel can b

PCA9540B 2channel I2C bus mult

The PCA9540B is a 1-of-2 bidirectional translating multiplexer, controlled via the I2C-bus.<BR>The SCL/SDA upstream pair fans out to two SCx/SDx downstream pairs, or channels.<BR>Only one SCx/SDx chan

高功率PoE PD接口与集成反激式控制器

<p> &nbsp;</p> <div> To this day, Power over Ethernet (PoE) continues to gainpopularity in today&rsquo;s networking world. The 12.95Wdelivered to the Powered Device (PD) input supplied bythe Power S

pair tree 的算法java实现,十分清晰,可供初学者参考.请用winzip解压缩

pair tree 的算法java实现,十分清晰,可供初学者参考.请用winzip解压缩

The Linux Enterprise Cluster explains how to take a number of inexpensive computers with limited res

The Linux Enterprise Cluster explains how to take a number of inexpensive computers with limited resources, place them on a normal computer network, and install free software so that the computers act

双绞线和低通滤波器降低EMI_RFI

<div> Abstract: Alexander Graham Bell patented twisted pair wires in 1881. We still use them today because they work so well. In addition we have the advantage ofincredible computer power within our

In some graphs, the shortest path is given by optimizing two different metrics: the sum of weights o

In some graphs, the shortest path is given by optimizing two different metrics: the sum of weights of the edges and the number of edges. For example: if two paths with equal cost exist then, the path

java applet code for generating RSA key pair

java applet code for generating RSA key pair

In each step the LZSS algorithm sends either a character or a &lt;position, length&gt; pair. Among t

In each step the LZSS algorithm sends either a character or a &lt;position, length&gt; pair. Among these, perhaps character "e" appears more frequently than "x", and a &lt;position, length&gt; pair of

MAXX9257 MAX9258芯片可编程SerDes持续时间计算

<p> The MAX9257/MAX9258 programmable serializer/deserializer (SerDes) devices transfer both video data and control signals over the same twisted-pair cable. However, control data can only be transmit

将PSO和LBG结合在一步迭代过程中

将PSO和LBG结合在一步迭代过程中,并使用particle-pair(PP)搜索问题空间的算法

ITU-T Recommendation V.90 98年9月版本 A DIGITAL MODEM AND ANALOGUE MODEM PAIR FOR USE ON THE PUBLIC SWI

ITU-T Recommendation V.90 98年9月版本 A DIGITAL MODEM AND ANALOGUE MODEM PAIR FOR USE ON THE PUBLIC SWITCHED TELEPHONE NETWORK (PSTN) AT DATA SIGNALLING RATES OF UP TO 56 000 bit/s DOWNSTREAM AND UP TO 3

pair-based cryption library

pair-based cryption library

//颜色初始化 if(!has_colors() || start_color() == ERR){ endwin() printf("Terminal does not su

//颜色初始化 if(!has_colors() || start_color() == ERR){ endwin() printf("Terminal does not support color.\n") exit(1) } init_pair(1, COLOR_GREEN, COLOR_BLACK) init_pair(2, COL

The SP486 and SP487 are low–power quad differential line drivers meeting RS-485 and RS-422 standard

The SP486 and SP487 are low–power quad differential line drivers meeting RS-485 and RS-422 standards. The SP486 features a common driver enable control the SP487 provides independent driver enable c

PQP is a library for performing three types of proximity queries on a pair of geometric models compo

PQP is a library for performing three types of proximity queries on a pair of geometric models composed of triangles:

遗传算法和“货郎担” 问题: "The traveling salesman problem, or TSP for short, is this: given a finite number of

遗传算法和“货郎担” 问题: "The traveling salesman problem, or TSP for short, is this: given a finite number of cities along with the cost of travel between each pair of them, find the cheapest way of visiting a

PBC perl 接口程序, Pair-Based cryption

PBC perl 接口程序, Pair-Based cryption

c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlyin

c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. Given

An Efficient and Effective Detailed Placement Algorithm Global Swap &#61692 To identify a pair

An Efficient and Effective Detailed Placement Algorithm Global Swap &#61692 To identify a pair of cells that can be swapped to reduce wirelength (others are fixed). 2. Vertical Swap &#61692 S