|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Identifying heavy hitters in high-speed network monitoring显示文摘Identifying heavy hitters in a network traffic stream is important for a variety of network applications ranging from traffic engineering to anomaly detection such as detection of denial-of-service attacks. Existing methods generally examine newly arriving items in the stream, perform a small number of operations using a small amount of memory, and still provide guarantees on the identifying accuracy. In high-speed network monitoring, the update speed per item is extremely critical. However, so far as we know, there are no identifying algorithms which can provide constant update time (O(1)) in a weighted data stream. In this paper, we present an algorithm named Weighted Lossy Counting (WLC) which is able to identify heavy hitters in a high-speed weighted data stream with constant update time. WLC employs a novel efficient partially ordered data structure which is able to provide a fast per-item update speed while keeping the memory cost relatively low. We compare WLC with state-of-the-art algorithms for finding heavy hitters in real traffic traces. The experimental results show that WLC performs well in accuracy (recall, precision and average relative error) as other algorithms; moreover it has a much higher update speed at the cost of relatively larger memory space used. A theoretical worst-case memory bound of WLC is also derived in this paper; however, experiments with long real traffic traces show that WLC requires much less space than the theoretical bound in practice. | ZHANG Yu FANG BinXing ZHANG YongZheng | 2010 | Science China(Information Sciences)2010，53，3： | 8 |
| 2 | Biocompatibility evaluation of electrospun aligned poly(propylene carbonate) nanofibrous scaffolds with peripheral nerve tissues and cells in vitro显示文摘越过大差距的背景外部神经新生是临床上挑战性的。支架设计在神经织物工程起一个枢轴的作用。最近, nanofibrous 脚手架由于他们的物理性质的类似为房间附件和增长证明了合适的环境到自然细胞外的矩阵。(丙烯碳酸盐)(PPC ) Poly, nanofibrous 脚手架为脉管的织物工程被调查了。然而,没有报告为神经织物工程 PPC nanofibrous 脚手架存在。这研究试图评估潜在的角色排列并且是的随机的 PPC nanofibrous 脚手架为在神经织物工程的外部神经织物和房间的底层。排列的方法和随机的 PPC nanofibrous 脚手架被 electrospinning 制作,他们的化学描述用扫描电子显微镜学(SEM ) 被执行。从 Sprague-Dawley 老鼠的背面的根 ganglia (DRG ) 在 nanofibrous 底层上是有教养的 7 天了。从 DRG 的神经突长出和 Schwann 房间移植被观察并且确定了使用 immunocytochemistry 和 SEM。从老鼠导出的 Schwann 细胞臀部的神经在为 24 的 electrospun PPC 支架摘录液体是有教养的, 48, 72 个小时和 7 天。Schwann 房间的生存能力被 3- 评估[4,5-dimethyl (thiazol-2-yl )-2,5-diphenyl] tetrazolium 溴化物(MTT ) 试金。结果直径排列,随机的纤维在 800 nm 和 1200 nm 之间变化了,并且这些电影的厚度是近似 10-20 m。排列纤维电影的 Quantification 沿着纵的轴揭示了所有纤维的约 90% 排列。与随机的纤维电影,然而,纤维的排列通过所有角度箱是随机的。老鼠 DRG 将生物的活组织移植于培养基中培养在 PPC nanofiber 电影上被种多达 1 个星期。在排列纤维电影上,从 DRG 的神经突长出和 Schwann 房间移植的多数单向性地延长了,平行到排列 fibers.However 在随机的纤维电影上,神经突长出和 Schwann 房间移植随机被散布。从有教养的 DRG 的累积神经突长度的比较显示神经突在排列 PPC 电影上变得更快((缝的 2537.6ng 系统。 13 个盒子使用了 Hem-o-lok 夹钳缝术而不是传统的绑扎,并且肾的温暖的局部缺血的吝啬的时间是( 16.5 汳?睴?慤獹?汁?湡浩污?湵敤睲湥?虧湋T摲潩牧灡票愠摮栠敡潭祤慮業獣洠慥畳敲敭瑮??牡楤捡攠灸敲獳潩?景猠浥??慷?敤整浲湩摥戠?敲污琠浩?潰祬敭慲敳挠慨湩爠慥瑣潩?刨???愠摮圠獥整湲戠潬瑴湩?湡污獹獩?浉畭潮楨瑳'覕珮I慣?湡污獹獩眠獡甠敳?潴搠瑥牥業敮琠敨挠汥?潳牵散漠?敳慭愳椠?桴?敨牡?敒?瑬?獉灯潲整敲潮?湩畤散??搠祡?湡??搠祡???慲獴搠獩汰祡摥氠晥?敶瑮楲畣慬?楤慬楴湯? | WANG Yu ZHAO Zhe ZHAO Binx ZHAO Bin QI Hong-xu PENG Jiang ZHANG Li XU Wen-jing HU Ping LU Shi-bi | 2011 | Chinese Medical Journal2011，，15： | 8 |
| 3 | Geometric Name Routing for ICN in Dynamic World显示文摘A new paradigm of scalable routing for ICN is to combine a geometric routing scheme with a Distributed Hash Table. However, for most routing schemes in this paradigm, when a node joins or leaves, large numbers of nodes, even the whole topology, need to be re-embedded, and a great number of contents need to be re-registered. In this paper, we propose D-Griffin, a geometric routing scheme on flat names for dynamic topologies. D-Griffin provides two advantages. First, it avoids re-embedding the topology by using an online greedy embedding scheme and a void handling greedy forwarding scheme. Second, it decreases the number of re-registrations by using a name mapping scheme with a tradeoff between topology independence and load balancing. Theoretical and experimental analyses show that D-Griffin provides guaranteed content lookup, low description complexity, low path stretch, scalable routing update, and acceptable load balancing. | SUN Yanbin ZHANG Yu SU Shen ZHANG Hongli FANG Binxing | 2015 | China Communications2015，12，7： | 3 |
| 4 | Prison Term Prediction on Criminal Case Description with Deep Learning显示文摘The task of prison term prediction is to predict the term of penalty based on textual fact description for a certain type of criminal case.Recent advances in deep learning frameworks inspire us to propose a two-step method to address this problem.To obtain a better understanding and more specific representation of the legal texts,we summarize a judgment model according to relevant law articles and then apply it in the extraction of case feature from judgment documents.By formalizing prison term prediction as a regression problem,we adopt the linear regression model and the neural network model to train the prison term predictor.In experiments,we construct a real-world dataset of theft case judgment documents.Experimental results demonstrate that our method can effectively extract judgment-specific case features from textual fact descriptions.The best performance of the proposed predictor is obtained with a mean absolute error of 3.2087 months,and the accuracy of 72.54%and 90.01%at the error upper bounds of three and six months,respectively. | Shang Li Hongli Zhang Lin Ye Shen Su Xiaoding Guo Haining Yu Binxing Fang | 2020 | Computers, Materials & Continua2020，，3： | 2 |
| 5 | Treatment of discarded oil in supercritical carbon dioxide for preparation of carbon microspheres显示文摘 | YU Binxing KONG Xiangkai WEI Lingzhi | 2011 | J Mater Cycles Waste Manag2011，13，4： | 1 |
| 6 | Ripple+:An Improved Scheme of Ripple Consensus Protocol in Deployability,Liveness and Timing Assumption显示文摘Ripple acts as a real-time settlement and payment system to connect banks and payment providers.As the consensus support of the Ripple network to ensure network consistency,Ripple consensus protocol has been widely concerned in recent years.Compared with those Byzantine fault tolerant protocols,Ripple has a significant difference that the system can reach an agreement under decentralized trust model.However,Ripple has many problems both in theory and practice,which arementioned in the previous researches.This paper presents Ripple+,an improved scheme of Ripple consensus protocol,which improves Ripple fromthree aspects:(1)Ripple+employs a specific trustmodel and a corresponding guideline for Unique Node List selection,which makes it easy to deploy in practice to meet the safety and liveness condition;(2)the primary and viewchangemechanismare joined to solve the problem discussed by the previous research that Ripple may lose liveness in some extreme scenarios;(3)we remove the strong synchrony clock and timeout during consensus periods to make it suitable for weak synchrony assumption.We implemented a prototype of Ripple+and conducted experiments to show that Ripple+can achieve the throughput of tens of thousands of transactions per second with no more than half a minute latency,and the view change mechanism hardly incurs additional cost. | Chuanwang Ma Yu Zhang Binxing Fang Hongli Zhang Yidong Jin Dasheng Zhou | 2022 | Computer Modeling in Engineering & Sciences2022，，1： | 1 |
| 7 | An ICN-Oriented Name-Based Routing Scheme显示文摘Information-Centric Networking (ICN) treat contents as the first class citizens and adopt content names for routing. However, ICN faces challenges of big data. The massive content names and location-independent naming bring scalability and efficiency challenges for content addressing. A scalable and efficient name-based routing scheme is a critical component for ICN. This paper proposes a novel Scalable Name-based Geometric Routing scheme, SNGR. To resolve the location-independent names to locations, SNGR utilizes a bi-level sloppy grouping design. To provide scalable location-dependent routing for name resolution, SNGR proposess a universal geometric routing framework. Our theoretical analyses guarantee the performance of SNGR. The experiments by simulation show that SNGR outperformances other similar routing schemes in terms of the scalability of routing table, the reliability to failures, as well as path stretch and latency in name resolution. | Sun Yanbin Zhang Yu Zhang Hongli Fang Binxing Shi Jiantao | 2015 | 国际计算机前沿大会会议论文集2015，，1： | 0 |
| 8 | Self-Certificating Root:A Root Zone Security Enhancement Mechanism for DNS显示文摘As a critical Internet infrastructure,domain name system(DNS)protects the authenticity and integrity of domain resource records with the introduction of security extensions(DNSSEC).DNSSEC builds a single-center and hierarchical resource authentication architecture,which brings management convenience but places the DNS at risk from a single point of failure.When the root key suffers a leak or misconfiguration,top level domain(TLD)authority cannot independently protect the authenticity of TLD data in the root zone.In this paper,we propose self-certificating root,a lightweight security enhancement mechanism of root zone compatible with DNS/DNSSEC protocol.By adding the TLD public key and signature of the glue records to the root zone,this mechanism enables the TLD authority to certify the self-submitted data in the root zone and protects the TLD authority from the risk of root key failure.This mechanism is implemented on an open-source software,namely,Berkeley Internet Name Domain(BIND),and evaluated in terms of performance,compatibility,and effectiveness.Evaluation results show that the proposed mechanism enables the resolver that only supports DNS/DNSSEC to authenticate the root zone TLD data effectively with minimal performance difference. | Wenfeng Liu Yu Zhang Wenjia Zhang Lu Liu Hongli Zhang Binxing Fang | 2020 | Computers, Materials & Continua2020，，4： | 0 |
| 9 | Worm attack detection and response显示文摘There appear many Internet-scale worm incidents in recent years,which have caused severe damage to the society.It is clear that a simple self-propagation worm can quickly spread across the Internet.Therefore,it is necessary to implement automatic mitigation which can detect worm and drop its packet.In this paper,the worm’s framework was first analyzed and its two characteristics were detected.Based on the two characteristics,a defending algorithm was presented to protect network.Experimental results verify that our algorithm is very effective to constrain the worm propagation and meanwhile it almost does not interfere in normal activity. | CHEN Bo YU Xiangzhan FANG Binxing YUN Xiaochun | 2007 | Frontiers of Electrical and Electronic Engineering in China2007，2，4： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员