首页 > 最新文献

Journal of Zhejiang University. Science最新文献

英文 中文
Mathematical modeling of salt-gradient ion-exchange simulated moving bed chromatography for protein separations. 盐梯度离子交换的数学模型模拟了蛋白质分离的移动床色谱。
Pub Date : 2004-12-01 DOI: 10.1631/jzus.2004.1613
Jian-Gang Lu

The salt-gradient operation mode used in ion-exchange simulated moving bed chromatography (SMBC) can improve the efficiency of protein separations. A detailed model that takes into account any kind of adsorption/ion-exchange equilibrium, salt gradient, size exclusion, mass transfer resistance, and port periodic switching mechanism, was developed to simulate the complex dynamics. The model predictions were verified by the experimental data on upward and downward gradients for protein separations reported in the literature. All design and operating parameters (number, configuration, length and diameter of columns, particle size, switching period, flow rates of feed, raffinate, desorbent and extract, protein concentrations in feed, different salt concentrations in desorbent and feed) can be chosen correctly by numerical simulation. This model can facilitate the design, operation, optimization, control and scale-up of salt-gradient ion-exchange SMBC for protein separations.

离子交换模拟移动床色谱(SMBC)中采用的盐梯度操作模式可以提高蛋白质的分离效率。建立了一个详细的模型,考虑了各种吸附/离子交换平衡、盐梯度、尺寸排斥、传质阻力和端口周期开关机制,以模拟复杂的动力学。通过文献报道的蛋白质分离的向上和向下梯度实验数据验证了模型的预测。所有设计和操作参数(塔的数量、配置、长度和直径、粒度、切换周期、饲料、萃余液、脱吸剂和萃取物的流速、饲料中的蛋白质浓度、脱吸剂和饲料中的不同盐浓度)都可以通过数值模拟来正确选择。该模型可为盐梯度离子交换SMBC的设计、操作、优化、控制和放大提供参考。
{"title":"Mathematical modeling of salt-gradient ion-exchange simulated moving bed chromatography for protein separations.","authors":"Jian-Gang Lu","doi":"10.1631/jzus.2004.1613","DOIUrl":"https://doi.org/10.1631/jzus.2004.1613","url":null,"abstract":"<p><p>The salt-gradient operation mode used in ion-exchange simulated moving bed chromatography (SMBC) can improve the efficiency of protein separations. A detailed model that takes into account any kind of adsorption/ion-exchange equilibrium, salt gradient, size exclusion, mass transfer resistance, and port periodic switching mechanism, was developed to simulate the complex dynamics. The model predictions were verified by the experimental data on upward and downward gradients for protein separations reported in the literature. All design and operating parameters (number, configuration, length and diameter of columns, particle size, switching period, flow rates of feed, raffinate, desorbent and extract, protein concentrations in feed, different salt concentrations in desorbent and feed) can be chosen correctly by numerical simulation. This model can facilitate the design, operation, optimization, control and scale-up of salt-gradient ion-exchange SMBC for protein separations.</p>","PeriodicalId":85042,"journal":{"name":"Journal of Zhejiang University. Science","volume":"5 12","pages":"1613-20"},"PeriodicalIF":0.0,"publicationDate":"2004-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.2004.1613","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"24816007","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
An adaptive mechanism to guarantee the bandwidth fairness of TCP flows. 保证TCP流带宽公平性的自适应机制。
Pub Date : 2004-11-01 DOI: 10.1631/jzus.2004.1361
Shun-liang Zhang, Cheng-qing Ye

End-to-end TCP (transmission control protocol) congestion control can cause unfairness among multiple TCP connections with different RTT (Round Trip Time). The throughput of TCP connection is inversely proportional to its RTT. To resolve this problem, researchers have proposed many methods. The existing proposals for RTT-aware conditioner work well when congestion level is low. However, they over-protect long RTT flows and starve short RTT flows when congestion level is high. Due to this reason, an improved method based on adaptive thought is proposed. According to the congestion level of networks, the mechanism can adaptively adjust the degree of the protection to long RTT flows. Extensive simulation experiments showed that the proposed mechanism can guarantee the bandwidth fairness of TCP flows effectively and outperforms the existing methods.

端到端TCP(传输控制协议)拥塞控制可以导致多个TCP连接之间的不公平,这些TCP连接具有不同的往返时间(RTT)。TCP连接的吞吐量与其RTT成反比。为了解决这个问题,研究人员提出了许多方法。现有的rtt感知调理器在拥塞水平较低的情况下工作良好。然而,当拥塞水平高时,它们过度保护长RTT流并饿死短RTT流。为此,提出了一种基于自适应思想的改进方法。该机制可以根据网络拥塞程度自适应调整对长RTT流的保护程度。大量的仿真实验表明,该机制能够有效地保证TCP流的带宽公平性,并优于现有的算法。
{"title":"An adaptive mechanism to guarantee the bandwidth fairness of TCP flows.","authors":"Shun-liang Zhang,&nbsp;Cheng-qing Ye","doi":"10.1631/jzus.2004.1361","DOIUrl":"https://doi.org/10.1631/jzus.2004.1361","url":null,"abstract":"<p><p>End-to-end TCP (transmission control protocol) congestion control can cause unfairness among multiple TCP connections with different RTT (Round Trip Time). The throughput of TCP connection is inversely proportional to its RTT. To resolve this problem, researchers have proposed many methods. The existing proposals for RTT-aware conditioner work well when congestion level is low. However, they over-protect long RTT flows and starve short RTT flows when congestion level is high. Due to this reason, an improved method based on adaptive thought is proposed. According to the congestion level of networks, the mechanism can adaptively adjust the degree of the protection to long RTT flows. Extensive simulation experiments showed that the proposed mechanism can guarantee the bandwidth fairness of TCP flows effectively and outperforms the existing methods.</p>","PeriodicalId":85042,"journal":{"name":"Journal of Zhejiang University. Science","volume":"5 11","pages":"1361-6"},"PeriodicalIF":0.0,"publicationDate":"2004-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.2004.1361","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"24770443","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
TCP-Rab: a receiver advertisement based TCP protocol. TCP- rab:基于接收方通告的TCP协议。
Pub Date : 2004-11-01 DOI: 10.1631/jzus.2004.1352
Xu-hong Tang, Zheng-lan Liu, Miao-liang Zhu

With the evolution of network technologies, the deficiencies of TCP protocol are becoming more and more distinct. The new TCP implementation, called Receiver Advertisement Based TCP (TCP-Rab) proposed here to eliminate these deficiencies, adopts two basic mechanisms: (1) Bandwidth Estimation and (2) Immediate Recovery. Bandwidth estimation is carried out at the receiver, and the result is sent back to the sender via the acknowledgements. Immediate Recovery guarantees high performance even in lossy link. Rab can distinguish the reason for packet loss, and thus adopt appropriate recovery strategy. For loss by network congestion, it will back off its congestion window, and for loss by link errors, it will recover the congestion window immediately. Simulations indicated that Rab has superiority over other TCP implementations.

随着网络技术的发展,TCP协议的不足越来越明显。为了消除这些缺陷,本文提出了一种新的TCP实现,称为基于接收器通告的TCP (TCP- rab),它采用了两种基本机制:(1)带宽估计和(2)立即恢复。在接收端进行带宽估计,并将结果通过确认发送回发送方。即时恢复保证高性能,即使在有损链路。Rab可以区分丢包的原因,从而采取适当的恢复策略。对于网络拥塞造成的损失,它将退出拥塞窗口;对于链路错误造成的损失,它将立即恢复拥塞窗口。仿真结果表明,Rab与其他TCP实现相比具有优势。
{"title":"TCP-Rab: a receiver advertisement based TCP protocol.","authors":"Xu-hong Tang,&nbsp;Zheng-lan Liu,&nbsp;Miao-liang Zhu","doi":"10.1631/jzus.2004.1352","DOIUrl":"https://doi.org/10.1631/jzus.2004.1352","url":null,"abstract":"<p><p>With the evolution of network technologies, the deficiencies of TCP protocol are becoming more and more distinct. The new TCP implementation, called Receiver Advertisement Based TCP (TCP-Rab) proposed here to eliminate these deficiencies, adopts two basic mechanisms: (1) Bandwidth Estimation and (2) Immediate Recovery. Bandwidth estimation is carried out at the receiver, and the result is sent back to the sender via the acknowledgements. Immediate Recovery guarantees high performance even in lossy link. Rab can distinguish the reason for packet loss, and thus adopt appropriate recovery strategy. For loss by network congestion, it will back off its congestion window, and for loss by link errors, it will recover the congestion window immediately. Simulations indicated that Rab has superiority over other TCP implementations.</p>","PeriodicalId":85042,"journal":{"name":"Journal of Zhejiang University. Science","volume":"5 11","pages":"1352-60"},"PeriodicalIF":0.0,"publicationDate":"2004-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.2004.1352","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"24771062","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
A modified multitarget adaptive array algorithm for wireless CDMA system. 一种改进的无线CDMA系统多目标自适应阵列算法。
Pub Date : 2004-11-01 DOI: 10.1631/jzus.2004.1418
Yun-hui Liu, Yu-hang Yang

The paper presents a modified least squares despread respread multitarget constant modulus algorithm (LS-DRMTCMA). The cost function of the original algorithm was modified by the minimum bit error rate (MBER) criterion. The novel algorithm tries to optimize weight vectors by directly minimizing bit error rate (BER) of code division multiple access (CDMA) mobile communication system. In order to achieve adaptive update of weight vectors, a stochastic gradient adaptive algorithm was developed by a kernel density estimator of possibility density function based on samples. Simulation results showed that the modified algorithm remarkably improves the BER performance, capacity and near-far effect resistance of a given CDMA communication system.

提出了一种改进的最小二乘扩散扩散多目标常模算法(LS-DRMTCMA)。采用最小误码率(MBER)准则对原算法的代价函数进行了改进。该算法试图通过直接最小化码分多址(CDMA)移动通信系统的误码率(BER)来优化权向量。为了实现权向量的自适应更新,提出了一种基于样本的概率密度函数核密度估计的随机梯度自适应算法。仿真结果表明,改进后的算法显著提高了给定CDMA通信系统的误码率性能、容量和抗近远效应。
{"title":"A modified multitarget adaptive array algorithm for wireless CDMA system.","authors":"Yun-hui Liu,&nbsp;Yu-hang Yang","doi":"10.1631/jzus.2004.1418","DOIUrl":"https://doi.org/10.1631/jzus.2004.1418","url":null,"abstract":"<p><p>The paper presents a modified least squares despread respread multitarget constant modulus algorithm (LS-DRMTCMA). The cost function of the original algorithm was modified by the minimum bit error rate (MBER) criterion. The novel algorithm tries to optimize weight vectors by directly minimizing bit error rate (BER) of code division multiple access (CDMA) mobile communication system. In order to achieve adaptive update of weight vectors, a stochastic gradient adaptive algorithm was developed by a kernel density estimator of possibility density function based on samples. Simulation results showed that the modified algorithm remarkably improves the BER performance, capacity and near-far effect resistance of a given CDMA communication system.</p>","PeriodicalId":85042,"journal":{"name":"Journal of Zhejiang University. Science","volume":"5 11","pages":"1418-23"},"PeriodicalIF":0.0,"publicationDate":"2004-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.2004.1418","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"24771507","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
A scalable admission control scheme based on time label. 一种基于时间标签的可扩展准入控制方案。
Pub Date : 2004-11-01 DOI: 10.1631/jzus.2004.1424
Song-an Yang, Hua Yang, Yu-hang Yang

Resource reservation protocols allow communicating hosts to reserve resources such as bandwidth to offer guaranteed service. However, current resource reservation architectures do not scale well for a large number of flows. In this paper, we present a simple reservation protocol and a scalable admission control algorithm, which can provide QoS guarantees to individual flows without per-flow management in the network core. By mapping each flow to a definite time, this scheme addresses the problems that limit the effectiveness of current endpoint admission control schemes. The overall admission control process is described. Analysis is used to explain the reasonability of our scheme and simulation validates its performance.

资源预留协议允许通信主机预留带宽等资源,以提供有保证的服务。然而,当前的资源保留架构不能很好地扩展到大量的流。本文提出了一种简单的保留协议和一种可扩展的允许控制算法,该算法可以为网络核心中不需要逐流管理的单个流提供QoS保证。通过将每个流映射到一个确定的时间,该方案解决了限制当前端点准入控制方案有效性的问题。描述了整个录取控制过程。通过分析说明了方案的合理性,并通过仿真验证了方案的性能。
{"title":"A scalable admission control scheme based on time label.","authors":"Song-an Yang,&nbsp;Hua Yang,&nbsp;Yu-hang Yang","doi":"10.1631/jzus.2004.1424","DOIUrl":"https://doi.org/10.1631/jzus.2004.1424","url":null,"abstract":"<p><p>Resource reservation protocols allow communicating hosts to reserve resources such as bandwidth to offer guaranteed service. However, current resource reservation architectures do not scale well for a large number of flows. In this paper, we present a simple reservation protocol and a scalable admission control algorithm, which can provide QoS guarantees to individual flows without per-flow management in the network core. By mapping each flow to a definite time, this scheme addresses the problems that limit the effectiveness of current endpoint admission control schemes. The overall admission control process is described. Analysis is used to explain the reasonability of our scheme and simulation validates its performance.</p>","PeriodicalId":85042,"journal":{"name":"Journal of Zhejiang University. Science","volume":"5 11","pages":"1424-31"},"PeriodicalIF":0.0,"publicationDate":"2004-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.2004.1424","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"24771508","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Hierarchical planning for a surface mounting machine placement. 表面贴装机布局的分层规划。
Pub Date : 2004-11-01 DOI: 10.1631/jzus.2004.1449
You-jiao Zeng, Deng-ze Ma, Ye Jin, Jun-qi Yan

For a surface mounting machine (SMM) in printed circuit board (PCB) assembly line, there are four problems, e.g. CAD data conversion, nozzle selection, feeder assignment and placement sequence determination. A hierarchical planning for them to maximize the throughput rate of an SMM is presented here. To minimize set-up time, a CAD data conversion system was first applied that could automatically generate the data for machine placement from CAD design data files. Then an effective nozzle selection approach implemented to minimize the time of nozzle changing. And then, to minimize picking time, an algorithm for feeder assignment was used to make picking multiple components simultaneously as much as possible. Finally, in order to shorten pick-and-place time, a heuristic algorithm was used to determine optimal component placement sequence according to the decided feeder positions. Experiments were conducted on a four head SMM. The experimental results were used to analyse the assembly line performance.

对于印刷电路板(PCB)装配线中的表面贴装机(SMM),存在CAD数据转换、喷嘴选择、馈线分配和放置顺序确定四个问题。本文提出了一种分层规划,以使SMM的吞吐率最大化。为了最大限度地减少设置时间,首先应用了CAD数据转换系统,该系统可以从CAD设计数据文件自动生成机器放置数据。在此基础上,提出了一种有效的喷嘴选择方法,以减少喷嘴更换的时间。然后,为了最大限度地减少拣料时间,采用了一种送料机分配算法,使拣料过程中尽可能多地同时拣料。最后,根据确定的送料机位置,采用启发式算法确定零件的最优放置顺序,以缩短取放时间。实验是在四头SMM上进行的。利用实验结果对装配线的性能进行了分析。
{"title":"Hierarchical planning for a surface mounting machine placement.","authors":"You-jiao Zeng,&nbsp;Deng-ze Ma,&nbsp;Ye Jin,&nbsp;Jun-qi Yan","doi":"10.1631/jzus.2004.1449","DOIUrl":"https://doi.org/10.1631/jzus.2004.1449","url":null,"abstract":"<p><p>For a surface mounting machine (SMM) in printed circuit board (PCB) assembly line, there are four problems, e.g. CAD data conversion, nozzle selection, feeder assignment and placement sequence determination. A hierarchical planning for them to maximize the throughput rate of an SMM is presented here. To minimize set-up time, a CAD data conversion system was first applied that could automatically generate the data for machine placement from CAD design data files. Then an effective nozzle selection approach implemented to minimize the time of nozzle changing. And then, to minimize picking time, an algorithm for feeder assignment was used to make picking multiple components simultaneously as much as possible. Finally, in order to shorten pick-and-place time, a heuristic algorithm was used to determine optimal component placement sequence according to the decided feeder positions. Experiments were conducted on a four head SMM. The experimental results were used to analyse the assembly line performance.</p>","PeriodicalId":85042,"journal":{"name":"Journal of Zhejiang University. Science","volume":"5 11","pages":"1449-55"},"PeriodicalIF":0.0,"publicationDate":"2004-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.2004.1449","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"24771511","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Feature selection based on mutual information and redundancy-synergy coefficient. 基于互信息和冗余协同系数的特征选择。
Pub Date : 2004-11-01 DOI: 10.1631/jzus.2004.1382
Sheng Yang, Jun Gu

Mutual information is an important information measure for feature subset. In this paper, a hashing mechanism is proposed to calculate the mutual information on the feature subset. Redundancy-synergy coefficient, a novel redundancy and synergy measure of features to express the class feature, is defined by mutual information. The information maximization rule was applied to derive the heuristic feature subset selection method based on mutual information and redundancy-synergy coefficient. Our experiment results showed the good performance of the new feature selection method.

互信息是特征子集的重要信息度量。本文提出了一种计算特征子集互信息的哈希机制。冗余协同系数是一种新的特征的冗余协同度量,通过互信息来表达类特征。利用信息最大化原则,导出了基于互信息和冗余协同系数的启发式特征子集选择方法。实验结果表明,新的特征选择方法具有良好的性能。
{"title":"Feature selection based on mutual information and redundancy-synergy coefficient.","authors":"Sheng Yang,&nbsp;Jun Gu","doi":"10.1631/jzus.2004.1382","DOIUrl":"https://doi.org/10.1631/jzus.2004.1382","url":null,"abstract":"<p><p>Mutual information is an important information measure for feature subset. In this paper, a hashing mechanism is proposed to calculate the mutual information on the feature subset. Redundancy-synergy coefficient, a novel redundancy and synergy measure of features to express the class feature, is defined by mutual information. The information maximization rule was applied to derive the heuristic feature subset selection method based on mutual information and redundancy-synergy coefficient. Our experiment results showed the good performance of the new feature selection method.</p>","PeriodicalId":85042,"journal":{"name":"Journal of Zhejiang University. Science","volume":"5 11","pages":"1382-91"},"PeriodicalIF":0.0,"publicationDate":"2004-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.2004.1382","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"24770446","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
How to realize a negative refractive index material at the atomic level in an optical frequency range? 如何在光学频率范围内实现原子水平上的负折射率材料?
Pub Date : 2004-11-01 DOI: 10.1631/jzus.2004.1322
Jian-qi Shen, Zhi-chao Ruan, Sai-ling He

The theoretical mechanism for realizing a negative refractive index material in an optical frequency range with an atomic gas system of electromagnetically induced transparency (EIT) is studied. It is shown that under certain conditions such a dense gas can exhibit simultaneously negative permittivity and negative permeability, and negligibly small loss.

研究了电磁感应透明原子气体系统在光学频率范围内实现负折射率材料的理论机理。结果表明,在一定条件下,这种致密气体可以同时表现为负介电常数和负磁导率,损耗小得可以忽略不计。
{"title":"How to realize a negative refractive index material at the atomic level in an optical frequency range?","authors":"Jian-qi Shen,&nbsp;Zhi-chao Ruan,&nbsp;Sai-ling He","doi":"10.1631/jzus.2004.1322","DOIUrl":"https://doi.org/10.1631/jzus.2004.1322","url":null,"abstract":"<p><p>The theoretical mechanism for realizing a negative refractive index material in an optical frequency range with an atomic gas system of electromagnetically induced transparency (EIT) is studied. It is shown that under certain conditions such a dense gas can exhibit simultaneously negative permittivity and negative permeability, and negligibly small loss.</p>","PeriodicalId":85042,"journal":{"name":"Journal of Zhejiang University. Science","volume":"5 11","pages":"1322-6"},"PeriodicalIF":0.0,"publicationDate":"2004-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.2004.1322","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"24771058","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 47
A novel OFDM transmission scheme with length-adaptive Cyclic Prefix. 一种新的长度自适应循环前缀OFDM传输方案。
Pub Date : 2004-11-01 DOI: 10.1631/jzus.2004.1336
Li-feng Lai, Zhao-yang Zhang

Conventional OFDM transmission system uses a fixed-length Cyclic Prefix to counteract Inter-Symbol Interferences (ISI) caused by channel delay spreading under wireless mobile environment. This may cause considerable performance deterioration when the CP length is less than the channel RMS delay spread, or may decrease the system power and spectrum efficiency when it is much larger. A novel OFDM transmission scheme is proposed in this paper to adapt the CP length to the variation of channel delay spread. AOFDM-VCPL utilizes the preamble or pilot sub-carriers of each OFDM packet to estimate the channel RMS delay spread; and then uses a criterion to calculate the CP length , which finally affects the OFDM transmitter. As illustrated in the simulation section, by deploying this scheme in a typical wireless environment, the system can transmit at data rate 11.5 Mb/s higher than conventional non-adaptive system while gaining a 0.65 dB power saving at the same BER performance.

在无线移动环境下,传统的OFDM传输系统采用固定长度的循环前缀来抵消信道延迟扩散所引起的码间干扰。当CP长度小于信道RMS延迟扩展时,这可能会导致相当大的性能下降,或者当CP长度更大时,可能会降低系统功率和频谱效率。提出了一种新的OFDM传输方案,使CP长度适应信道延迟扩展的变化。AOFDM-VCPL利用每个OFDM包的前载波或导频子载波来估计信道的RMS延迟扩展;然后用一个准则计算CP长度,最终影响OFDM发射机。如仿真部分所示,通过在典型的无线环境中部署该方案,系统可以以比传统非自适应系统高11.5 Mb/s的数据速率传输,同时在相同的BER性能下节省0.65 dB的功耗。
{"title":"A novel OFDM transmission scheme with length-adaptive Cyclic Prefix.","authors":"Li-feng Lai,&nbsp;Zhao-yang Zhang","doi":"10.1631/jzus.2004.1336","DOIUrl":"https://doi.org/10.1631/jzus.2004.1336","url":null,"abstract":"<p><p>Conventional OFDM transmission system uses a fixed-length Cyclic Prefix to counteract Inter-Symbol Interferences (ISI) caused by channel delay spreading under wireless mobile environment. This may cause considerable performance deterioration when the CP length is less than the channel RMS delay spread, or may decrease the system power and spectrum efficiency when it is much larger. A novel OFDM transmission scheme is proposed in this paper to adapt the CP length to the variation of channel delay spread. AOFDM-VCPL utilizes the preamble or pilot sub-carriers of each OFDM packet to estimate the channel RMS delay spread; and then uses a criterion to calculate the CP length , which finally affects the OFDM transmitter. As illustrated in the simulation section, by deploying this scheme in a typical wireless environment, the system can transmit at data rate 11.5 Mb/s higher than conventional non-adaptive system while gaining a 0.65 dB power saving at the same BER performance.</p>","PeriodicalId":85042,"journal":{"name":"Journal of Zhejiang University. Science","volume":"5 11","pages":"1336-42"},"PeriodicalIF":0.0,"publicationDate":"2004-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"24771060","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Model-based testing with UML applied to a roaming algorithm for bluetooth devices. 基于模型的UML测试应用于蓝牙设备的漫游算法。
Pub Date : 2004-11-01 DOI: 10.1631/jzus.2004.1327
Zhen Ru Dai, Jens Grabowski, Helmut Neukirchen, Holger Pals

In late 2001, the Object Management Group issued a Request for Proposal to develop a testing profile for UML 2.0. In June 2003, the work on the UML 2.0 Testing Profile was finally adopted by the OMG. Since March 2004, it has become an official standard of the OMG. The UML 2.0 Testing Profile provides support for UML based model-driven testing. This paper introduces a methodology on how to use the testing profile in order to modify and extend an existing UML design model for test issues. The application of the methodology will be explained by applying it to an existing UML Model for a Bluetooth device.

在2001年末,对象管理小组发布了一个为UML 2.0开发测试概要文件的建议请求。在2003年6月,UML 2.0测试概要文件的工作最终被OMG采纳。自2004年3月以来,它已成为OMG的官方标准。UML 2.0测试概要文件为基于UML的模型驱动测试提供了支持。本文介绍了一种方法,关于如何使用测试概要文件来修改和扩展现有的UML设计模型来进行测试问题。该方法的应用将通过将其应用于蓝牙设备的现有UML模型来解释。
{"title":"Model-based testing with UML applied to a roaming algorithm for bluetooth devices.","authors":"Zhen Ru Dai,&nbsp;Jens Grabowski,&nbsp;Helmut Neukirchen,&nbsp;Holger Pals","doi":"10.1631/jzus.2004.1327","DOIUrl":"https://doi.org/10.1631/jzus.2004.1327","url":null,"abstract":"<p><p>In late 2001, the Object Management Group issued a Request for Proposal to develop a testing profile for UML 2.0. In June 2003, the work on the UML 2.0 Testing Profile was finally adopted by the OMG. Since March 2004, it has become an official standard of the OMG. The UML 2.0 Testing Profile provides support for UML based model-driven testing. This paper introduces a methodology on how to use the testing profile in order to modify and extend an existing UML design model for test issues. The application of the methodology will be explained by applying it to an existing UML Model for a Bluetooth device.</p>","PeriodicalId":85042,"journal":{"name":"Journal of Zhejiang University. Science","volume":"5 11","pages":"1327-35"},"PeriodicalIF":0.0,"publicationDate":"2004-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.2004.1327","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"24771059","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
期刊
Journal of Zhejiang University. Science
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1