期刊文献+
共找到5篇文章
< 1 >
每页显示 20 50 100
A Novel Route to Prepare Nanocomposites in Larger Scale 被引量:2
1
作者 Wei WU lailong luo +3 位作者 Guangwen CHU Shengjun BAI Haikui ZOU Jianfeng CHEN 《Journal of Materials Science & Technology》 SCIE EI CAS CSCD 2007年第3期407-411,共5页
准备 nanocomposites 的一条新奇线路通过润滑油的 preparingoverbased 钙石油 sulfonate 被说明净化在旋转 packedbed ( RPB )代替常规反应 vessel.The 被用作反应堆的地方,结果证明 thecarbonation 效率被改进,原料消费被减少,并且... 准备 nanocomposites 的一条新奇线路通过润滑油的 preparingoverbased 钙石油 sulfonate 被说明净化在旋转 packedbed ( RPB )代替常规反应 vessel.The 被用作反应堆的地方,结果证明 thecarbonation 效率被改进,原料消费被减少,并且 thedispersibilities ,在 overbased 的 缩放nano 的 CaCO3 粒子的尺寸和形态学净化的 areenhanced.It 相当被推出这条线路能是广泛地 展开更多
关键词 纳米复合材料 大规模制造 工艺路线 旋转固定床
下载PDF
Boosting for Distributed Online Convex Optimization
2
作者 Yuhan Hu Yawei Zhao +1 位作者 lailong luo Deke Guo 《Tsinghua Science and Technology》 SCIE EI CAS CSCD 2023年第4期811-821,共11页
Decentralized Online Learning(DOL)extends online learning to the domain of distributed networks.However,limitations of local data in decentralized settings lead to a decrease in the accuracy of decisions or models com... Decentralized Online Learning(DOL)extends online learning to the domain of distributed networks.However,limitations of local data in decentralized settings lead to a decrease in the accuracy of decisions or models compared to centralized methods.Considering the increasing requirement to achieve a high-precision model or decision with distributed data resources in a network,applying ensemble methods is attempted to achieve a superior model or decision with only transferring gradients or models.A new boosting method,namely Boosting for Distributed Online Convex Optimization(BD-OCO),is designed to realize the application of boosting in distributed scenarios.BD-OCO achieves the regret upper bound O(M+N/MNT)where M measures the size of the distributed network and N is the number of Weak Learners(WLs)in each node.The core idea of BD-OCO is to apply the local model to train a strong global one.BD-OCO is evaluated on the basis of eight different real-world datasets.Numerical results show that BD-OCO achieves excellent performance in accuracy and convergence,and is robust to the size of the distributed network. 展开更多
关键词 distributed Online Convex Optimization(OCO) online boosting Online Gradient Boosting(OGB)
原文传递
Gauze:enabling communication-friendly block synchronization with cuckoo filter
3
作者 Xiaoqiang DING Liushun ZHAO +3 位作者 lailong luo Junjie XIE Deke GUO Jinxi LI 《Frontiers of Computer Science》 SCIE EI CSCD 2023年第3期113-123,共11页
Block synchronization is an essential component of blockchain systems.Traditionally,blockchain systems tend to send all the transactions from one node to another for synchronization.However,such a method may lead to a... Block synchronization is an essential component of blockchain systems.Traditionally,blockchain systems tend to send all the transactions from one node to another for synchronization.However,such a method may lead to an extremely high network bandwidth overhead and significant transmission latency.It is crucial to speed up such a block synchronization process and save bandwidth consumption.A feasible solution is to reduce the amount of data transmission in the block synchronization process between any pair of peers.However,existing methods based on the Bloom filter or its variants still suffer from multiple roundtrips of communications and significant synchronization delay.In this paper,we propose a novel protocol named Gauze for fast block synchronization.It utilizes the Cuckoo filter(CF)to discern the transactions in the receiver’s mempool and the block to verify,providing an efficient solution to the problem of set reconciliation in the P2P(Peer-to-Peer Network)network.By up to two rounds of exchanging and querying the CFs,the sending node can acknowledge whether the transactions in a block are contained by the receiver’s mempool or not.Based on this message,the sender only needs to transfer the missed transactions to the receiver,which speeds up the block synchronization and saves precious bandwidth resources.The evaluation results show that Gauze outperforms existing methods in terms of the average processing latency(about lower than Graphene)and the total synchronization space cost(about lower than Compact Blocks)in different scenarios. 展开更多
关键词 block synchronization cuckoo filter probabilistic data structure
原文传递
Design and optimization of VLC based small-world data centers 被引量:1
4
作者 Yudong QIN Deke GUO +2 位作者 lailong luo Geyao CHENG Zeliu DING 《Frontiers of Computer Science》 SCIE EI CSCD 2019年第5期1034-1047,共14页
The visible light communication (VLC) has the potential to provide dense and fast connectivity at low cost. In this paper, we propose a novel VLC enabled Wireless Small-World Data Center (WSWDC). It employs VLC links ... The visible light communication (VLC) has the potential to provide dense and fast connectivity at low cost. In this paper, we propose a novel VLC enabled Wireless Small-World Data Center (WSWDC). It employs VLC links to achieve a fully wireless data center network (DCN) across racks for the first time. The using of VLC links eliminates hierarchical switches and inter-rack cables, and thus reducing hardware investment, as well as maintenance cost. More precisely, to simplify the configuration and control operations, we propose three DCN design rationales:(1) fully-wireless, all inter-rack links are wireless;(2) easy-deployable, it is not necessary to change the existing infrastructure inside data center;(3) plug-and-play, no extra centralized control operations are required. Previous proposals, however, cannot achieve the three rationales simultaneously. To this end, we first use regular VLC links to interconnect racks as a regular grid DCN and optimize the rack placement to shorten the average path length and the network diameter. To further exploiting the benefits of VLC links, a few random VLC links are carefully introduced to update the wireless grid DCN as a wireless small-world DCN. To avoid the potential interference among VLC links, we deploy VLC transceivers at different heights on the top of each rack. In this way, VLC links would not interfere with others at each height level. Moreover, we design a greedy but efficient routing method for any pair of racks using their identifiers as inputs. Comprehensive evaluation results indicate that our WSWDC exhibits good topological properties and network performance. 展开更多
关键词 data CENTER network VISIBLE light communication SMALL-WORLD wireless LINKS TOPOLOGY design
原文传递
Compound graph based hybrid data center topologies 被引量:1
5
作者 lailong luo Deke GUO +3 位作者 Wenxin LI Tian ZHANG Junjie XIE Xiaolei ZHOU 《Frontiers of Computer Science》 SCIE EI CSCD 2015年第6期860-874,共15页
In large-scale data centers, many servers are in- terconnected via a dedicated networking structure, so as to satisfy specific design goals, such as the low equipment cost, the high network capacity, and the increment... In large-scale data centers, many servers are in- terconnected via a dedicated networking structure, so as to satisfy specific design goals, such as the low equipment cost, the high network capacity, and the incremental expansion. The topological properties of a networking structure are criti- cal factors that dominate the performance of the entire data center. The existing networking structures are either fully random or completely structured. Although such networking structures exhibit advantages on given aspects, they suffer ob- vious shortcomings in other essential fields. In this paper, we aim to design a hybrid topology, called R3, which is the com- pound graph of structured and random topology. It employs random regular graph as a unit duster and connects many such clusters by means of a structured topology, i.e., the gen- eralized hypercube. Consequently, the hybrid topology com- bines the advantages of structured as well as random topolo- gies seamlessly. Meanwhile, a coloring-based algorithm is proposed for R3 to enable fast and accurate routing. R3 pos- sesses many attractive characteristics, such as the modularity and expansibility at the cost of only increasing the degree of any node by one. Comprehensive evaluation results show that our hybrid topology possesses excellent topology properties and network performance. 展开更多
关键词 data center networking compound graph hy-brid topology routing design
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部