期刊文献+
共找到271篇文章
< 1 2 14 >
每页显示 20 50 100
EXAFS study of cation reordering in NaYF_4:Yb^(3+),Tb^(3+) up-conversion luminescence materials 被引量:1
1
作者 H.F.Brito J.Hls +5 位作者 T.Laamanen T.Laihinen M.Lastusaari L.Pihlgren L.C.V.Rodrigues T.Soukka 《Journal of Rare Earths》 SCIE EI CAS CSCD 2014年第3期226-229,共4页
The NaYF4:yb3+,Tb3+ (Xyb: 0.20, XTb: 0.04) materials were prepared using the co-precipitation method, lne as-preparea material was washed either with or without water in addition to ethanol and thereafter annea... The NaYF4:yb3+,Tb3+ (Xyb: 0.20, XTb: 0.04) materials were prepared using the co-precipitation method, lne as-preparea material was washed either with or without water in addition to ethanol and thereafter annealed for 5 h at 500℃. This resulted in materials with moderate or very high up-conversion luminescence intensity, respectively. The structural study carried out with X-ray powder diffraction revealed microstrains in the rare earth (R) sublattice that were relaxed for the material with very high up-conversion intensity thus decreasing energy losses. The local structural details were investigated with R LⅢ and Y K edge ex- tended X-ray absorption fine structure (EXAFS) using synchrotron radiation. Around 10 tool.% of the Yb3+ ions were found to occupy the Na site in the material with very high up-conversion intensity. These Yb species formed clusters with the Tb3+ ions occupying the regular Na/R sites. Such clustering enhanced the energy transfer between Yb3+ and Tb3+ thus intensifying the up-conversion emission. 展开更多
关键词 EXAFS UP-CONVERSION YTTERBIUM TERBIUM cation reordering
原文传递
Chaos Identification Based on Component Reordering and Visibility Graph 被引量:1
2
作者 朱胜利 甘露 《Chinese Physics Letters》 SCIE CAS CSCD 2017年第5期18-21,共4页
The identification between chaotic systems and stochastic processes is not easy since they have numerous similarities. In this study, we propose a novel approach to distinguish between chaotic systems and stochastic p... The identification between chaotic systems and stochastic processes is not easy since they have numerous similarities. In this study, we propose a novel approach to distinguish between chaotic systems and stochastic processes based on the component reordering procedure and the visibility graph algorithm. It is found that time series and their reordered components will show diverse characteristics in the 'visibility domain'. For chaotic series, there are huge differences between the degree distribution obtained from the original series and that obtained from the corresponding reordered component. For correlated stochastic series, there are only small differences between the two degree distributions. For uncorrelated stochastic series, there are slight differences between them. Based on this discovery, the well-known Kullback Leible divergence is used to quantify the difference between the two degree distributions and to distinguish between chaotic systems, correlated and uncorrelated stochastic processes. Moreover, one chaotic map, three chaotic systems and three different stochastic processes are utilized to illustrate the feasibility and effectiveness of the proposed method. Numerical results show that the proposed method is not only effective to distinguish between chaotic systems, correlated and uncorrelated stochastic processes, but also easy to operate. 展开更多
关键词 Chaos Identification Based on Component reordering and Visibility Graph
原文传递
Graph-based Lexicalized Reordering Models for Statistical Machine Translation
3
作者 SU Jinsong LIU Yang +1 位作者 LIU Qun DONG Huailin 《China Communications》 SCIE CSCD 2014年第5期71-82,共12页
Lexicalized reordering models are very important components of phrasebased translation systems.By examining the reordering relationships between adjacent phrases,conventional methods learn these models from the word a... Lexicalized reordering models are very important components of phrasebased translation systems.By examining the reordering relationships between adjacent phrases,conventional methods learn these models from the word aligned bilingual corpus,while ignoring the effect of the number of adjacent bilingual phrases.In this paper,we propose a method to take the number of adjacent phrases into account for better estimation of reordering models.Instead of just checking whether there is one phrase adjacent to a given phrase,our method firstly uses a compact structure named reordering graph to represent all phrase segmentations of a parallel sentence,then the effect of the adjacent phrase number can be quantified in a forward-backward fashion,and finally incorporated into the estimation of reordering models.Experimental results on the NIST Chinese-English and WMT French-Spanish data sets show that our approach significantly outperforms the baseline method. 展开更多
关键词 natural language processing statistical machine translation lexicalized reordering model reordering graph
在线阅读 下载PDF
基于K-means聚类算法的印刷返单追样色彩补偿计算研究
4
作者 付文亭 邓体俊 《包装工程》 北大核心 2026年第3期161-167,共7页
目的引入K-means聚类算法量化评估印张与客户样网点面积率差异,运用非线性拟合算法确定C/M/Y/K四色通道优化调整参数,实现印刷返单色彩精准补偿还原。方法调用扫描仪与机台印刷ICC配置文件,将扫描的RGB文件转换为与印前分色标准一致的C... 目的引入K-means聚类算法量化评估印张与客户样网点面积率差异,运用非线性拟合算法确定C/M/Y/K四色通道优化调整参数,实现印刷返单色彩精准补偿还原。方法调用扫描仪与机台印刷ICC配置文件,将扫描的RGB文件转换为与印前分色标准一致的CMYK文件;引入K-means聚类算法模型,对印张与客户样的C/M/Y/K分色文件进行高精度比对;用非线性拟合算法确定四色通道优化调整节点及参数;在Photoshop中对C/M/Y/K 4个颜色通道进行“曲线”调整。结果动态补偿机制有效校正印张偏蓝、偏深缺陷,同步优化四原色、二次叠印色和三色叠印灰平衡色,补偿修正后印张色差ΔE00稳定控制在2.5以内。结论该数据驱动补偿方法效率远超传统人工调整,具有完全可复制的标准化特性,为印刷生产数字化升级提供关键技术支撑。 展开更多
关键词 K-MEANS聚类算法 印刷返单追样 色彩补偿 色彩管理
在线阅读 下载PDF
万兆同轴宽带接入网HIMAC 3.0的拆帧重排序方法
5
作者 黄一明 潘伟涛 邱智亮 《电子科技》 2026年第1期25-31,共7页
高性能同轴电缆网络(High Performance Network Over Coax,HINOC)技术是一种光纤同轴混合接入技术,已发展至第3代。为了实现万兆以太网的接入速率,第3代HINOC引入了多信道绑定机制。但该机制在有效扩展HINOC网络信道带宽的同时易导致HIM... 高性能同轴电缆网络(High Performance Network Over Coax,HINOC)技术是一种光纤同轴混合接入技术,已发展至第3代。为了实现万兆以太网的接入速率,第3代HINOC引入了多信道绑定机制。但该机制在有效扩展HINOC网络信道带宽的同时易导致HIMAC(HINOC Medium Access Control)拆帧端接收的数据流失序。针对该问题,文中提出了一种拆帧重排序方法。通过重排序队列缓存管理、入队逻辑地址计算、超时判断及清空以及出队判断等关键技术的设计和实现来解决多信道绑定机制引起的拆帧乱序问题,并对其关键功能点进行仿真验证和板级验证。实验结果表明,所提方法能够有效处理多信道绑定导致的乱序问题,并且能够确保系统在遇到错误情况时稳定运行,具有较强的鲁棒性,满足万兆同轴宽带接入HIMAC 3.0的功能和性能要求。 展开更多
关键词 万兆同轴宽带接入 HIMAC 3.0 多信道绑定 数据帧乱序 拆帧 重排序 超时清空 队列缓存
在线阅读 下载PDF
Dynamic robust optimal reorder point with uncertain lead time and changeable demand distribution
6
作者 Masaki TAMURA Kazuko MORIZAWA Hiroyuki NAGASAWA 《Journal of Zhejiang University-Science A(Applied Physics & Engineering)》 SCIE EI CAS CSCD 2010年第12期938-945,共8页
In fixed order quantity systems,uncertainty in lead time is expressed as a set of scenarios with occurrence probabilities,and the mean and variance in demand distribution are supposed to be changeable according to a k... In fixed order quantity systems,uncertainty in lead time is expressed as a set of scenarios with occurrence probabilities,and the mean and variance in demand distribution are supposed to be changeable according to a known pattern.A new concept of "dynamic robust optimal reorder point" is proposed in this paper and its value is calculated as a "robust optimal reorder point function with respect to reorder time".Two approaches were employed in determining the dynamic optimal reorder point.The first is a shortage rate satisfaction approach and the second is a backorder cost minimization approach.The former aims at finding the minimum value of reorder point at each reorder time which satisfies the condition that the cumulative distribution function (CDF) of shortage rate under a given set of scenarios in lead time is greater than or equal to a basic CDF of shortage rate predetermined by a decision-maker.In the latter approach,the CDF of closeness of reorder point is defined at each reorder time to express how close to the optimal reorder points under the set of scenarios,and the dynamic optimal reorder point is defined according to stochastic ordering.Some numerical examples demonstrate the features of these dynamic robust optimal reorder points. 展开更多
关键词 reorder point Lead time Robust optimum UNCERTAINTY SCENARIO
原文传递
A reordered first fit algorithm based novel storage scheme for parallel turbo decoder
7
作者 张乐 贺翔 +1 位作者 徐友云 罗汉文 《Journal of Shanghai University(English Edition)》 CAS 2007年第4期380-384,共5页
In this paper we discuss a novel storage scheme for simultaneous memory access in parallel turbo decoder. The new scheme employs vertex coloring in graph theory. Compared to a similar method that also uses unnatural o... In this paper we discuss a novel storage scheme for simultaneous memory access in parallel turbo decoder. The new scheme employs vertex coloring in graph theory. Compared to a similar method that also uses unnatural order in storage, our scheme requires 25 more memory blocks but allows a simpler configuration for variable sizes of code lengths that can be implemented on-chip. Experiment shows that for a moderate to high decoding throughput (40-100 Mbps), the hardware cost is still affordable for 3GPP's (3rd generation partnership project) interleaver. 展开更多
关键词 turbo codes parallel turbo decoding INTERLEAVER vertex coloring reordered first fit algorithm (RFFA) fieldprogrammable gate array (FPGA).
在线阅读 下载PDF
Single-period Two-product Inventory Model with Reorder and Substitution
8
作者 LI Xiao-shen GAO Ke-quan 《Chinese Quarterly Journal of Mathematics》 CSCD 北大核心 2006年第1期148-158,共11页
In market, excess demands for many products can be met by reorder even during one period, and retailers usually adopt substitution strategy for more benefit. Under the retailer's substitution strategy and permission ... In market, excess demands for many products can be met by reorder even during one period, and retailers usually adopt substitution strategy for more benefit. Under the retailer's substitution strategy and permission of reorder, we develop the profits maximization model for the two-substitutable-product inventory problem with stochastic demands and proportional costs and revenues. We show that the objective function is concave and submodular, and therefore the optimal policy exists. We present the optimal conditions for order quantity and provide some properties of the optimal order quantities. Comparing our model with Netessine and Rudi's, we prove that reorder and adoption of the substitution strategy can raise the general profits and adjust down the general stock level. 展开更多
关键词 INVENTORY optimal order quantity SUBSTITUTION reorder
在线阅读 下载PDF
Reordered Love, Reordered Lives: Rethinking Vice and Virtue
9
作者 David K. Naugle 《Journal of Philosophy Study》 2013年第1期1-8,共8页
In this paper and presupposing a Christian Weltanschauung or biblical worldview, I will argue that vices are disordered loves and virtues are reordered loves. The Christian gospel makes the ~ansition from the former t... In this paper and presupposing a Christian Weltanschauung or biblical worldview, I will argue that vices are disordered loves and virtues are reordered loves. The Christian gospel makes the ~ansition from the former to the latter state possible. The seven deadly sins--pride, envy, anger, sloth, avarice, gluttony, and lust--are disordered loves; the seven cardinal virtues--faith, hope, love, courage, justice, temperance, and prudence--are reordered loves. Since love is central in human experience---rooted in the heart--it is also central in moral formation and deformation. Love (or the lack thereof) is the key to understanding the nature and action of both human vice and virtue. 展开更多
关键词 ordo amoris virtue(s) reordered DISORDERED LOVE Bible GOD moral formation
在线阅读 下载PDF
一种基于ViT的局部图像拷贝检测算法
10
作者 朱辰 陈于勋 +1 位作者 陈禹坤 王总辉 《信息安全学报》 2025年第6期86-96,共11页
近年来,随着图像编辑技术的不断发展,数字图像的知识产权保护形势日益严峻。为有效遏制图像内容的非法窃取、复制与篡改行为,切实保障用户的合法权益,图像拷贝检测作为内容审核体系的关键组成部分,其重要性不言而喻。其中,一种常见的规... 近年来,随着图像编辑技术的不断发展,数字图像的知识产权保护形势日益严峻。为有效遏制图像内容的非法窃取、复制与篡改行为,切实保障用户的合法权益,图像拷贝检测作为内容审核体系的关键组成部分,其重要性不言而喻。其中,一种常见的规避检测手段是攻击者将源图像的部分内容巧妙地植入目标图像中,形成“画中画”式的局部拷贝。针对这一挑战,本文提出了一种基于ViT的局部图像拷贝检测算法。该算法旨在利用ViT强大的局部特征提取能力,在原始全局特征的基础上提取出图像的局部特征,揭示图像间潜在的依赖关系,并通过重新排列相关图像的顺序,提高具有更高相似度的图像在检测结果中的排序,从而精准实现对图像局部信息的拷贝检测。本文与基于自监督描述符的图像拷贝检测算法(A Self-Supervised Descriptor for Image Copy Detection)相比,在DISC2021数据集上取得显著提升,局部拷贝图像识别准确率提高10%,μAP(Micro Average Precision)指标提高10%~15%。此外,本文还利用热力图进行了直观的定性分析,证实了ViT能够敏锐地捕捉到图像中存在局部拷贝的区域,进一步验证了算法的有效性。本文提出的基于ViT的局部图像拷贝检测重排序算法能对使用画中画图像增强方式的拷贝图像进行有效检测,并在DISC2021数据集上取得了优异成绩,拓展了数字图像取证领域研究的新思路。 展开更多
关键词 图像拷贝检测 VIT 图像增强 重排序 热力图
在线阅读 下载PDF
基于改进mRMR工控数据特征螺旋式重排序算法
11
作者 刘学君 王汝墨 +1 位作者 江逸楠 刘家 《计算机仿真》 2025年第11期430-437,共8页
工控系统的安全防护研究中面临数据特征矩阵分布相关性不确定、特征相关性难以判定等难题,导致深度学习模型异常检测准确性存在波动。通过对仿真油料储运系统数据的研究,提出了CNNreorder特征螺旋式重排序方法。将每个样本螺旋式生成满... 工控系统的安全防护研究中面临数据特征矩阵分布相关性不确定、特征相关性难以判定等难题,导致深度学习模型异常检测准确性存在波动。通过对仿真油料储运系统数据的研究,提出了CNNreorder特征螺旋式重排序方法。将每个样本螺旋式生成满足空间局部最大相关性的合成矩阵,并降低冗余序列。首先,构建特征列间相关系数矩阵、特征与标签列相关系数向量。其次,改进了mRMR排序约束框架,由矩阵中心开始环状螺旋式生成排序合成矩阵,使得模型在空间相邻区域能够提取最大相关特征。在2个公开和3个自建数据集的实验表明,排序后得到的数据特征热力图更趋合理,数据量减少为同类算法的1/4;对比4种经典分类算法精度提升平均25%。提高了异常检测的准确度和稳定性。 展开更多
关键词 工业控制系统 特征螺旋式重排序 深度学习 异常检测 样本升维
在线阅读 下载PDF
面向智算中心的细粒度流量控制技术综述 被引量:1
12
作者 许晶 王展 +3 位作者 元国军 马振龙 杨帆 孙凝晖 《计算机研究与发展》 北大核心 2025年第11期2806-2825,共20页
随着人工智能生成内容技术的迅猛发展和大语言模型(large language models,LLMs)广泛应用,智算中心的网络面临着严峻挑战,流量控制是优化网络性能的重要方法.综述细粒度流量控制领域的关键问题及解决方案,重点梳理了自适应负载均衡机制... 随着人工智能生成内容技术的迅猛发展和大语言模型(large language models,LLMs)广泛应用,智算中心的网络面临着严峻挑战,流量控制是优化网络性能的重要方法.综述细粒度流量控制领域的关键问题及解决方案,重点梳理了自适应负载均衡机制、主动式拥塞控制机制和乱序包重排机制3个方面的研究进展.自适应负载均衡能够有效规避网络内部的拥塞,主动式拥塞控制用于预防自适应负载均衡无法避免的最后一跳拥塞问题,而乱序包重排解决了自适应负载均衡过程中可能引发的数据包乱序问题,三者协同作用确保了网络在高负载、高延迟等复杂环境下的稳定性与高效性.在此基础上,阐述了当前主流智算中心采用的关键技术方案以及目前支持细粒度流量控制的网络设备,最后总结了该领域尚未解决的关键问题及可能的解决方案,并对未来发展趋势进行了展望. 展开更多
关键词 负载均衡 拥塞控制 包喷洒 乱序重排 智算中心
在线阅读 下载PDF
一种计算循环2m+1对角Toeplitz矩阵行列式的高效数值算法
13
作者 乔茜蔓 张杨 《哈尔滨师范大学自然科学学报》 2025年第4期1-8,共8页
循环对角Toeplitz矩阵作为带状矩阵的一种特殊类型,在各个领域中都经常出现并应用.提出了一种计算具有Toeplitz结构的n阶循环2m+1对角行列式的高效数值算法,通过矩阵重排和划分以及线性变换,能够快速可靠地计算循环2m+1对角Toeplitz矩... 循环对角Toeplitz矩阵作为带状矩阵的一种特殊类型,在各个领域中都经常出现并应用.提出了一种计算具有Toeplitz结构的n阶循环2m+1对角行列式的高效数值算法,通过矩阵重排和划分以及线性变换,能够快速可靠地计算循环2m+1对角Toeplitz矩阵的行列式.为验证算法的正确性和计算性能,分别针对低阶和高阶Toeplitz矩阵进行了数值实验,并与Matlab内置函数计算结果进行对比. 展开更多
关键词 循环2m+1对角矩阵 托普利兹矩阵 矩阵重排与分块 行列式
在线阅读 下载PDF
自适应笛卡尔网格的平衡排序隐式LU-SGS算法
14
作者 罗灿炎 毕林 +3 位作者 高鹤 陈科锦 袁先旭 唐志共 《计算力学学报》 北大核心 2025年第6期1065-1072,共8页
自适应笛卡尔网格通常采用叉树数据结构,其在网格拓扑、邻居关系以及数据访问上有别于传统的结构/非结构网格。因此,原有的LU-SGS隐式算法需要在自适应笛卡尔网格中进行扩展。本文发展了一种自适应笛卡尔网格框架下的LU-SGS算法,通过采... 自适应笛卡尔网格通常采用叉树数据结构,其在网格拓扑、邻居关系以及数据访问上有别于传统的结构/非结构网格。因此,原有的LU-SGS隐式算法需要在自适应笛卡尔网格中进行扩展。本文发展了一种自适应笛卡尔网格框架下的LU-SGS算法,通过采用递归Z曲线方式对计算网格进行重排序,实现网格的平衡编号。针对悬挂网格附近邻居关系复杂的情况,采用分类选取合适的插值方式来获取邻居信息。典型算例测试结果表明,对于定常问题,推进收敛效率较改进前提升了一个量级。三维无粘算例气动力快速评估中,残差下降了10个数量级,气动力系数在370步时达到收敛,较Runge-Kutta格式的1280步和Euler格式的4070步提升显著。 展开更多
关键词 自适应笛卡尔网格 LU-SGS算法 隐式重排序
在线阅读 下载PDF
Feasibility of utilizing a software-based fitting system for orthokeratology lens recordering without short-term discontinuation of lens wear
15
作者 Mingxin Lu Shengsong Xu +6 位作者 Jinyun Jiang Zhouyue Li Ling Jin Hongmei Tan Weiyin Chen Cong Li Xiao Yang 《Eye Science》 2025年第3期248-265,共18页
Objective:To evaluate the performance of orthokeratology(ortho-k)lens reordering using software-designed system,so as to determine the feasibility of ortho-k lens reordering without discontinuing lens wear.Methods:Thi... Objective:To evaluate the performance of orthokeratology(ortho-k)lens reordering using software-designed system,so as to determine the feasibility of ortho-k lens reordering without discontinuing lens wear.Methods:This study is a retrospective analysis of data of ortho-k lens wearers who had a history of short-term discontinuation of lens wear.A total of 94 individuals aged over 8 years with spherical equivalent refraction ranging from-0.50 to-6.50 diopters were included.The corneal topography data at baseline(before ortho-k)and after lens wear discontinuation(cessation of ortho-k treatment)were imported separately into the lens-design software,along with corresponding refraction data.Subsequently,corneal and lens parameters were generated and compared.Intraclass correlation coefficients(ICC)were calculated,and Bland and Altman analyses were conducted.Results:All 94 children were involved in the retrospective analysis.Compared with baseline data,there was a high level of consistency between Rwo(without discontinuation)and Rwith(with discontinuation),with an ICC of 0.96(P<0.001).Furthermore,the comparison of lens parameters generated by the Easyfit software between baseline and after short-term discontinuation showed a high degree of consistency,with all of the ICC values exceeding 0.90.Similar results were obtained using the WAVE software,as both ICC values and Bland-Altman plots demonstrated a high level of consistency in lens parameters between two conditions(nearly all data points fell within the 95%LoAs).Conclusions:It is feasible to directly reorder new ortho-k lenses using software fitting approaches.However,further investigations are necessary to validate their practicability in a clinical setting. 展开更多
关键词 lens wear discontinuation ORTHOKERATOLOGY corneal topography SOFTWARE lens reorder
暂未订购
A Summarization-Based Pattern-Aware Matrix Reordering Approach
16
作者 Zi-Han Zhou Jia-Cheng Pan +4 位作者 Xu-Meng Wang Dong-Ming Han Fang-Zhou Guo Min-Feng Zhu Wei Chen 《Journal of Computer Science & Technology》 2025年第5期1331-1346,共16页
Matrix-based graph visualization is effective in revealing relationships among entities in graphs.The visibility of structural patterns depends on the ordering of rows/columns in matrices.Most existing approaches main... Matrix-based graph visualization is effective in revealing relationships among entities in graphs.The visibility of structural patterns depends on the ordering of rows/columns in matrices.Most existing approaches mainly settle on an ideal ordering according to quality metrics,which emphasize certain types of patterns but ignore others.This paper proposes a summarization-based pattern-aware reordering approach to highlight multiple patterns simultaneously.First,the pattern-aware graph summarization utilizes the Minimum Description Length(MDL)technique to identify various types of patterns from the input graph.Second,we propose a coarse-to-fine reordering mechanism to generate matrixbased visualizations that maintain the structure of all identified patterns.Experimental results of two comparative studies and a user study on several datasets demonstrate that our approach simultaneously highlights more types of patterns than other approaches and performs well across multiple quality metrics. 展开更多
关键词 graph summarization graph visualization matrix-based visualization matrix reordering
原文传递
RDMA乱序数据包处理技术研究综述
17
作者 马建东 郭志川 《网络新媒体技术》 2025年第4期1-10,共10页
远程直接内存访问(RDMA)已经成为数据中心网络(DCN)跨节点高性能数据传输的关键技术。但是,现有的RDMA传输协议,如基于融合以太网的RDMA版本2(RDMA over Converged Ethernet version 2,RoCEv2),仅支持顺序数据包处理。为进一步提高数据... 远程直接内存访问(RDMA)已经成为数据中心网络(DCN)跨节点高性能数据传输的关键技术。但是,现有的RDMA传输协议,如基于融合以太网的RDMA版本2(RDMA over Converged Ethernet version 2,RoCEv2),仅支持顺序数据包处理。为进一步提高数据传输的灵活性,支持多路径传输与选择性重传,如何使RDMA网卡处理乱序数据包成为当下的研究热点。本文总结了RDMA乱序数据包的产生原因与处理方法,同时对涉及的相关技术如数据包排序、乱序数据包直写、位图管理、丢包检测、跨工作队列元素(WQE)的内存一致性、路径选择等进行了介绍。 展开更多
关键词 远程直接内存访问 RoCEv2 乱序数据包处理 数据包排序 乱序数据包直写
在线阅读 下载PDF
一种基于游标的多径流量分割算法 被引量:4
18
作者 吴春明 王保进 +2 位作者 陈均华 姜明 张栋 《电子学报》 EI CAS CSCD 北大核心 2010年第11期2550-2554,共5页
多径传输使用多条连接源节点和目的节点的路径进行传输,在提高资源利用率的同时会引起包乱序问题,并且存在路径之间的负载均衡问题.本文提出了一种基于游标的流量分割算法,游标是当前路径传输延迟与相邻包到达源节点的时间差之间的差值... 多径传输使用多条连接源节点和目的节点的路径进行传输,在提高资源利用率的同时会引起包乱序问题,并且存在路径之间的负载均衡问题.本文提出了一种基于游标的流量分割算法,游标是当前路径传输延迟与相邻包到达源节点的时间差之间的差值,它作为选取路径的延时基线来保证包到达的有序性,游标会随着路径不同或相邻包到达源节点的时间差不同而动态地滑动,通过动态滑动游标使得尽可能多的路径可用来传输当前包,从而很好地实现负载均衡.仿真结果表明,与已有的保证包有序的算法相比,本算法使负载更加均衡. 展开更多
关键词 多径 包有序 负载均衡 游标
在线阅读 下载PDF
星载大容量固态存储器EMI辐射测试与分析 被引量:10
19
作者 葛欣宏 宁飞 +1 位作者 贺庚贤 李晓林 《电子测量与仪器学报》 CSCD 北大核心 2015年第4期569-576,共8页
基于星载大容量固态存储器的EMI辐射测试结果,对其电磁不兼容状态进行了EMC分析与整改。依据GJB151A-1997,星载大容量固态存储器需要满足RE102电场辐射要求,为了使RE102超标严重的星载大容量固态存储器满足标准要求,首先,结合星载大容... 基于星载大容量固态存储器的EMI辐射测试结果,对其电磁不兼容状态进行了EMC分析与整改。依据GJB151A-1997,星载大容量固态存储器需要满足RE102电场辐射要求,为了使RE102超标严重的星载大容量固态存储器满足标准要求,首先,结合星载大容量固态存储器的工作原理,依据电磁屏蔽理论及电磁辐射理论,对RE102的测试结果进行了分析。其次,确定了辐射超标的主要原因为互连线缆的电磁辐射,并进一步分析了电磁辐射的激励源产生方式。最后,依据分析结果提出了相应的整改方案并进行了整改。结果表明,采用EMC屏蔽和滤波措施后,EMI发射衰减大于30dB,星载大容量固态存储器的EMI辐射测试结果满足RE102技术指标要求。 展开更多
关键词 固态存储器 RE102 电磁辐射 电磁兼容
在线阅读 下载PDF
有限元节点编号优化 被引量:4
20
作者 黄志超 包忠诩 周天瑞 《南昌大学学报(理科版)》 CAS 北大核心 2004年第3期281-284,共4页
从分析最简单最优的矩形单元节点编号着手,分析其特点,得出各个节点的相邻单元节点编号总和除以该节点相邻单元数所得的节点商以及相邻单元最小最大节点编号和都为升序排列,总结出一种新型的有限元节点重编号方法,并举例说明该算法能减... 从分析最简单最优的矩形单元节点编号着手,分析其特点,得出各个节点的相邻单元节点编号总和除以该节点相邻单元数所得的节点商以及相邻单元最小最大节点编号和都为升序排列,总结出一种新型的有限元节点重编号方法,并举例说明该算法能减少有限元的带宽。 展开更多
关键词 编号方法 矩形 举例 单元 最大 排列 优化 节点编号 算法 最优
在线阅读 下载PDF
上一页 1 2 14 下一页 到第
使用帮助 返回顶部