|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | MapReduce rationality verification based on object Petri net显示文摘As a powerful distributed data processing mechanism,MapReduce supports abundant parallel applications that process massive data on computer clusters.To process the massive data efficiently and correctly,a rational design for the MapReduce procedure is desired.An irrational MapReduce procedure can cause great waste of computing resources and even paralyze the execution system.With the wide application of MapReduce,the unavoidable drawback of irrational MapReduce procedures becomes increasingly serious.To solve this problem,a method for verifying the rationality of a MapReduce procedure before executing it on a computer cluster is proposed.This method constructs the rationality criteria for MapReduce,and then studies an automatic approach for modelling MapReduce with an executable model object Petri net(OPN).Finally,the approaches for automatically identifying the rationality criteria by analyzing the consequence of model execution is developed.The results from extensive case studies demonstrate that the proposed method is feasible and effective. | DING Zeliu GUO Deke CHEN Xi CHEN Jin | 2019 | Journal of Systems Engineering and Electronics2019，30，5： | 5 |
| 2 | Few-shot text classification by leveraging bi-directional attention and cross-class knowledge显示文摘Few-shot text classification targets at the situation where a model is developed to classify newly incoming query instances after acquiring knowledge from a few support instances.In this paper,we investigate few-shot text classification under a metric-based meta-learning framework.While the representations of the query and support instances are the key to the classification,existing study handles them independently in the text encoding stage.To better describe the classification features,we propose to exploit their interaction with adapted bi-directional attention mechanism.Moreover,distinct from previous approaches that encode different classes individually,we leverage the underlying cross-class knowledge for classification.To this end,we conceive the learning target by incorporating the large margin loss,which is expected to shorten the intra-class distances while enlarging the inter-class distances.To validate the design,we conduct extensive experiments on three datasets,and the experimental results demonstrate that our solution outperforms its state-of-the-art competitors.Detailed analyses also reveal that the bi-directional attention and the cross-class knowledge both contribute to the overall performance. | Ning PANG Xiang ZHAO Wei WANG Weidong XIAO Deke GUO | 2021 | Science China(Information Sciences)2021，64，3： | 3 |
| 3 | From one to crowd: a survey on crowdsourcing-based wireless indoor localization显示文摘 | Xiaolei ZHOU Tao CHEN Deke GUO Xiaoqiang TENG Bo YUAN | 2018 | Frontiers of Computer Science2018，12，3： | 2 |
| 4 | TIO: A VLC-Enabled Hybrid Data Center Network Architecture显示文摘To satisfy the ever-increasing bandwidth demand of modern data centers, researchers have proposed hybrid Data Center Networks(DCNs), which employ high-bandwidth Optical Circuit Switches(OCSs) to compensate for Electrical Packet Switches(EPS). Existing designs, such as Helios and c-Through, mainly focus on reconfiguring optical devices to meet the estimated traffic requirements. However, these designs face two major challenges in their OCS-based networks, namely, the complex control mechanism and cabling problems. To solve these challenges, we propose TIO, a hybrid DCN that employs Visible Light Communication(VLC) instead of wired OCS design to connect racks. TIO integrates the wireless VLC-based Jellyfish and wired EPS-based Fat Tree seamlessly and combines the opposite and complementary characteristics, including wireless VLC direct connection and wired electrical packet switching, random graph, and Clos topology properties. To further exploit the merits of TIO, we design a hybrid routing scheme and congestion-aware flow scheduling method. Comprehensive evaluations indicate that TIO outperforms the Jellyfish and Fat Tree in both topology properties and network performance, and the flow scheduling method also evidently improves performance. | Yudong Qin Deke Guo Guoming Tang Bangbang Ren | 2019 | Tsinghua Science and Technology2019，24，4： | 2 |
| 5 | Design and optimization of VLC based small-world data centers显示文摘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. | Yudong QIN Deke GUO Lailong LUO Geyao CHENG Zeliu DING | 2019 | Frontiers of Computer Science2019，13，5： | 1 |
| 6 | Minimum-Cost Forest for Uncertain Multicast with Delay Constraints显示文摘The use of multicast transmission can efficiently reduce the consumption of network resources by jointly serving multiple destinations with a single source node. Currently, many multicast applications impose the constraint wherein multicast flows must be processed by a series of Virtual Network Functions(VNFs) before reaching their destinations. Given a multicast transmission, there are usually multiple server nodes, each of which is able to host all the required VNFs. Thus, the multicast flow should be initially steered to one or a few selected server nodes that act as pseudo sources, and the destinations will then retrieve new flow from any of these pseudo sources.In this paper, we model this kind of multicast as an uncertain multicast with multiple pseudo sources, whose routing structure is usually a forest consisting of multiple isolated trees. We then characterize and construct the Delay-guaranteed Minimum Cost Forest(D-MCF) such that each path from the source to the destination satisfies the end-to-end delay constraint. To tackle this NP-hard problem, we design two efficient methods, the Partition Algorithm(PA) and the Combination Algorithm(CA), to approximate the optimal solution. Theoretical analyses and evaluations indicate that these two methods can generate the desired routing forest for any multicast transfer.Moreover, the PA method achieves a better balance between performance and time consumption than the CA method. The evaluation results show that PA-(Ω+20) can reduce total cost by 49:02% while consuming 12:59% more time, thus significantly outperforming the CA-(Ω+20) method. | Bangbang Ren Geyao Cheng Deke Guo | 2019 | Tsinghua Science and Technology2019，24，2： | 1 |
| 7 | Expansible and cost-effective network structures for data centers using dual-portservers 显示文摘 | Guo Deke Chen Tao Li Dan | 2012 | IEEE Trans on Computers2012，62，7： | 1 |
| 8 | Design and Optimization of VLC Enabled Data Center Network显示文摘Visible-Light Communication(VLC) has the potential to provide dense and fast connectivity at low cost. In this paper we propose SFNet, a novel VLC-enabled hybrid data center network that extends the design of wireless Data Center Networks(DCNs) into three further dimensions:(1) fully wireless at the inter-rack level;(2) no need for a centralized control mechanism on wireless links;and(3) no need for any infrastructure-level alterations to data centers. Previous proposals typically cannot realize these three rationales simultaneously. To achieve this vision,the proposed SFNet augments fat-tree by organizing all racks into a wireless small-world network via VLC links. The use of VLC links eliminates hierarchical switches and cables in the wireless network, and thus reduces hardware investment and maintenance costs. To fully exploit the benefits of the topology of SFNet, we further propose its topology design and optimization method, routing scheme, and online flow scheduling algorithm. Comprehensive experiments indicate that SFNet exhibits good topological properties and network performance. | Yudong Qin Deke Guo Xu Lin Geyao Cheng | 2020 | Tsinghua Science and Technology2020，25，1： | 1 |
| 9 | The dynamicbloom filters 显示文摘 | Guo Deke Wu Jie Chen Honghui | 2010 | IEEE Trans on Knowledge and DataEngineering2010，22，1： | 1 |
| 10 | Discovering Association Rules with Graph Patterns in Temporal Networks显示文摘Discovering regularities between entities in temporal graphs is vital for many real-world applications(e.g.,social recommendation,emergency event detection,and cyberattack event detection).This paper proposes temporal graph association rules(TGARs)that extend traditional graph-pattern association rules in a static graph by incorporating the unique temporal information and constraints.We introduce quality measures(e.g.,support,confidence,and diversification)to characterize meaningful TGARs that are useful and diversified.In addition,the proposed support metric is an upper bound for alternative metrics,allowing us to guarantee a superset of patterns.We extend conventional confidence measures in terms of maximal occurrences of TGARs.The diversification score strikes a balance between interestingness and diversity.Although the problem is NP-hard,we develop an effective discovery algorithm for TGARs that integrates TGARs generation and TGARs selection and shows that mining TGARs is feasible over a temporal graph.We propose pruning strategies to filter TGARs that have low support or cannot make top-k as early as possible.Moreover,we design an auxiliary data structure to prune the TGARs that do not meet the constraints during the TGARs generation process to avoid conducting repeated subgraph matching for each extension in the search space.We experimentally verify the effectiveness,efficiency,and scalability of our algorithms in discovering diversified top-k TGARs from temporal graphs in real-life applications. | Chu Huang Qianzhen Zhang Deke Guo Xiang Zhao Xi Wang | 2023 | Tsinghua Science and Technology2023，28，2： | 1 |
| 11 | The dynamic bloom filters显示文摘 | GUO Deke WU Jie CHEN Honghui | | 0，，01： | 1 |
| 12 | Compound graph based hybrid data center topologies显示文摘 | Lailong LUO Deke GUO Wenxin LI Tian ZHANG Junjie XIE Xiaolei ZHOU | 2015 | Frontiers of Computer Science2015，9，6： | 1 |
| 13 | False nega- tive problem of counting Bloom filter显示文摘 | GUO Deke LIU Yunhao LI Xiangyang | 2010 | IEEE Transactions on Knowledge and Data Engineering2010，22，5： | 1 |
| 14 | KMcube: the compound of Kautz digraph and Moibius cube显示文摘 | Xianpeng HUANGFU Deke GUO Honghui CHEN Xueshan LUO | 2013 | Frontiers of Computer Science2013，7，2： | 0 |
| 15 | Boosting for Distributed Online Convex Optimization显示文摘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. | Yuhan Hu Yawei Zhao Lailong Luo Deke Guo | 2023 | Tsinghua Science and Technology2023，28，4： | 0 |
| 16 | Uncertain multicast under dynamic behaviors显示文摘Multicast transfer can efficiently save the bandwidth consumption and reduce the load on the source node than a series of independent unicast transfers.Nowadays,many applications employ the content replica strategy to improve the robustness and efficiency;hence each file and its replicas are usually distributed among multiple sources.In such scenarios,the traditional deterministic multicast develops into the Uncertain multicast,which has more flexibility in the source selection.In this paper,we focus on building and maintaining a minimal cost forest(MCF)for any uncertain multicast,whose group members(source nodes and destination nodes)may join or leave after constructing a MCF.We formulate this dynamic minimal cost forest(DMCF)problem as a mixed integer programming model.We then design three dedicated methods to approximate the optimal solution.Among them,our a-MCF aims to efficiently construct an MCF for any given uncertain multicast,without dynamic behaviors of multicast group members.The d-MCF method motivates to slightly update the existing MCF via local modifications once appearing a dynamic behavior.It can achieve the balance between the minimal cost and the minimal modifications to the existing forest.The last r-MCF is a supplement method to the d-MCF method,since many rounds of local modifications maymake the resultant forest far away from the optimal forest.Accordingly,our r-MCF method monitors the accumulated degradation and triggers the rearrangement process to reconstruct an new MCF when necessary.The comprehensive evaluation results demonstrate that our methods can well tackle the proposed DMCF problem. | Yudong QIN Deke GUO Zhiyao HU Bangbang REN | 2020 | Frontiers of Computer Science2020，14，1： | 0 |
| 17 | Gauze:enabling communication-friendly block synchronization with cuckoo filter显示文摘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. | Xiaoqiang DING Liushun ZHAO Lailong LUO Junjie XIE Deke GUO Jinxi LI | 2023 | Frontiers of Computer Science2023，17，3： | 0 |
| 18 | Advance in Structural Classification and Stability Study of Superamphiphobic Surfaces显示文摘Superamphiphobic surfaces have great potential applications in flame resistance,anti-icing,self-cleaning,anti-adhesion,micro-flow control and so on.However,the surface durability is poor owing to the limitation of design principles.In recent years,a lot of efforts have been carried out on the morphology,structure,and stability of superamphiphobic surfaces,resulting in significant improvement in their surface superwetting properties.In this review,we present a brief classification of the morphological types of superamphiphobic surfaces and summary of the recent progress of researches on the stability of superamphiphobic surfaces.Several testing methods of mechanical and chemical stability are listed in the article,together with the characteristic results,to provide a better and more detailed understanding of the current research status on superamphiphobic surface stability,which will be of considerable importance as a reference guide for our future researches.Of course,there are still some issues that need to be addressed for the application of superamphiphobic surfaces at large scale,and this is where our future researches will be directed.Finally,we discuss the challenges as well as the prospects in the study of superamphiphobic surfaces. | Haili Zhang Deke Li Jinxia Huang Zhiguang Guo Weiming Liu | 2023 | Journal of Bionic Engineering2023，20，1： | 0 |
| 19 | Guaranteeing the response deadline for general aggregation trees显示文摘It is essential to provide responses to queries within time deadlines,even if not exact and complete.To reduce the query latency,systems usually partition large-scale data computations as a series of tasks over many processes and aggregate them to reduce the response time by using aggregation trees.An obstacle is that the involved processes of a query usually differ in their speeds,thus not all processes can complete their tasks in time.This would directly degrade the response quality(the number of outputs received by the root of an aggregation tree).In this paper,we propose a general aggregation tree model,Tarot,to maximize the response quality by systematically addressing the following challenging issues:(1)fine-grained partition of the query deadline along the multi-level aggregation tree;(2)learning the distribution of durations at each level in the aggregation tree to optimize the wait durations at aggregators;(3)adaptively reassigning tasks over processes according to their status;(4)performing periodic aggregation of received outputs from the low level to avoid missing the deadline.The prior model does not consider the four aspects simultaneously.Extensive evaluations indicate that Tarot can adapt to multi-level trees and considerably improve the response quality compared to prior work while guaranteeing the query deadline. | Jiangfan LI Chendie YAO Junxu XIA Deke GUO | 2020 | Frontiers of Computer Science2020，14，6： | 0 |
| 20 | Enabling entity discovery in indoor commercial environments without pre-deployed infrastructure显示文摘Finding entities of interest in indoor commercial places, such as the merchandise in supermarkets and shopping malls, is an essential issue for customers, especially when they are unfamiliar with an ad hoc indoor environment. This type of location-based indoor service requires comprehensive knowledge of indoor entities, including locations as well as their semantic information. However, the existing indoor localization approaches fail to directly localize these general entities without dedicated devices. This paper first focuses on the problem of discovering large-scale general entities of interest in indoor commercial spaces without pre-deployed infrastructure. We present a unique entity localization approach that leverages the localization results from multiple independent users to accurately determine the location of corresponding entities. Our key idea is to exploit the short-distance estimation with dead reckoning to guarantee the accuracy of entity localization. We develop a prototype system based on the crowdsourcing method, iScan, and test it in one of the biggest supermarkets in Changsha, China, to validate the performance of our design. Extensive experimental results show that our approach can achieve meter-level accuracy in a single day with 70 participants. Moreover, in a monthly evaluation with 500 effective participants, iScan discovered more than 200 entities and localized approximately 75% of them within 2 m. | Bo YUAN Xiaolei ZHOU Xiaoqiang TENG Deke GUO | 2019 | Frontiers of Computer Science2019，13，3： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员