Short

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

本手册是SMIAS (Short Message Internet Access Solution)短信网关系统SP接入子系统通信接口 Java API的使用指南。它详细介绍了SP-SMIAS网关之间

本手册是SMIAS (Short Message Internet Access Solution)短信网关系统SP接入子系统通信接口 Java API的使用指南。它详细介绍了SP-SMIAS网关之间的通信流程,通信协议,以及通信接口Java API的数据结构,以及函数调用方法。

3个CPU调度算法的simulation. 分别是Short Job First,High Return Ration Next, Round Robin. 模拟得到R,U,S等重要指标。

3个CPU调度算法的simulation. 分别是Short Job First,High Return Ration Next, Round Robin. 模拟得到R,U,S等重要指标。

The target of the assignment is to familiarize the student with MIMO channel modeling. The work is

The target of the assignment is to familiarize the student with MIMO channel modeling. The work is based on L. Schumacher’s MIMO channel model implementation, with added capacity analysis. First the

The method to find out the short line by Floyd algorithm

The method to find out the short line by Floyd algorithm

OSERL (Open SMPP Erlang Library) is an erlang implementation of the Short Message Peer to Peer proto

OSERL (Open SMPP Erlang Library) is an erlang implementation of the Short Message Peer to Peer protocol, covering the entire specification (version 5.0). Forward and backward compatibilities guideline

CompactPCI TM Specification Short Form

CompactPCI TM Specification Short Form

All people curious about how Linux works and why it is so efficient will find answers here. After re

All people curious about how Linux works and why it is so efficient will find answers here. After reading the book, you will find your way through the many thousands of lines of code, distinguishing

编写一个程序

编写一个程序,输出基本数据类型char, short, int, long, float, double和指针类型void *, char *, short *, int *, long *, float *, double *的数据类型的长度。

a short description of GPS

a short description of GPS

ResOrg 图形化管理Vc项目的资源ID的工具的源代码。 ResOrg - Manage and Renumber Resource Symbol IDs Introduction The

ResOrg 图形化管理Vc项目的资源ID的工具的源代码。 ResOrg - Manage and Renumber Resource Symbol IDs Introduction The Resource ID Organiser (ResOrg for short) is an Add-in for Visual C++ designed to help overcome one o

本标准描述了PHS短消息中心(SMSC)和外部短消息实体(ESME)之间的通信协议。本协议简称CNPP(China Netcom Short Message Peer to Peer Protocol

本标准描述了PHS短消息中心(SMSC)和外部短消息实体(ESME)之间的通信协议。本协议简称CNPP(China Netcom Short Message Peer to Peer Protocol)。

遗传算法和“货郎担” 问题: "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

高效整数开平方 我能实现的最高效率的函数

高效整数开平方 我能实现的最高效率的函数,用于将一个unsigned int数开平方。如果被求的数不是完全平方数,求出它的平方根的整数部分。尽你所可能的优化它的效率,并用文字证明你优化策略有效。 函数的声明为: unsigned short work(unsigned int n) 用到了位运算

Huffman with Short dictionary压缩算法(VB.NET Source)

Huffman with Short dictionary压缩算法(VB.NET Source)

The smspdulib library is intended for more transparent interaction with SMS PDU. This thought over h

The smspdulib library is intended for more transparent interaction with SMS PDU. This thought over hierarchy of classes will allow you to create new classes for other types of short messages using the

linux network access short cut code.

linux network access short cut code.

Huffman codes 1.In telecommunication, how do we represent a set of messages, each with an access fr

Huffman codes 1.In telecommunication, how do we represent a set of messages, each with an access frequency, by a sequence of 0 s and 1 s? 2.To minimize the transmission and decoding costs, we may us

MAX17600数据资料

 The MAX17600–MAX17605 devices are high-speedMOSFET drivers capable of sinking /sourcing 4A peakcurrents. The devices have various inverting and noninvertingpart options that provide greate

Just what is a regular expression, anyway? Take the tutorial to get the long answer. The short answ

Just what is a regular expression, anyway? Take the tutorial to get the long answer. The short answer is that a regular expression is a compact way of describing complex patterns in texts. You can u

void III_hufman_decode(struct Granule *gr,int part2_start, int freqline[SBLIMIT][SSLIMIT]) {

void III_hufman_decode(struct Granule *gr,int part2_start, int freqline[SBLIMIT][SSLIMIT]) { unsigned int reg1, reg2,i unsigned int part3_length = part2_start + gr->part2_3_length