|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 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 | A survey of social network and information dissemination analysis显示文摘In recent years,with the rapid growth of social network services(SNS),social networks pervade nearly every aspect of our daily lives.Social networks are influencing today’s societal and cultural issues,and changing the way of people seeing themselves.To fully understand the running mechanisms of social networks,in this paper,we aim at series of high knitted and important elements of online social networks.We mainly focus on 3 important but also open research problems,they are(1)structural properties and evolving laws,(2)social crowds and their interaction behaviors and(3)information and its diffusion.In this paper,we review the related work on the 3 problems.Then,we briefly introduce some interesting research directions and our progress on these research problems. | Binxing Fang Yan Jia Yi Han Shasha Li Bin Zhou | 2014 | Chinese Science Bulletin2014，59，32： | 7 |
| 3 | Multisite co-allocation scheduling algorithms for parallel jobs in computing grid environments显示文摘Cooperation of multi-domain massively parallel processor systems in com- puting grid environment provides new opportunities for multisite job scheduling. At the same time, in the area of co-allocation, heterogeneity, network adaptability and scalability raise the challenge for the international design of multisite job scheduling models and algorithms. It presents multisite job scheduling schema through the introduction of mul- tisite job scheduling model and the performance model under the grid environment. It introduces two job multisite and cooperative scheduling models and algorithms with the core of the optimal and greedy-heuristic resource selection strategies. Meanwhile, com- pared with single and multisite cooperative scheduling models and algorithms introduced by Sabin, Yahyapour and other persons, the validity and advance of the scheduling model and the performance model herein are proved. | ZHANG Weizhe FANG Binxing HU Mingzeng LIU Xinran ZHANG Hongli GAO Lei | 2006 | Science in China(Series F)2006，49，6： | 4 |
| 4 | Understanding information interactions in diffusion: an evolutionary game-theoretic perspective显示文摘 | Yuan SU Xi ZHANG Lixin LIU Shouyou SONG Binxing FANG | 2016 | Frontiers of Computer Science2016，10，3： | 4 |
| 5 | Structure-independent disaster recovery:Concept,architecture and implementations显示文摘Disaster recovery(DR) techniques ensure the data safety and service continuity under different natural and human-made disasters by constructing a high reliable storage system. Traditional disaster recovery methods are structure-dependent. It is hard to share the DR resources between different DR systems,which made it expensive. We present a structure-independent disaster recovery theory and its implementation methods in this paper. By backup the whole system but not just the data,the goal of device and application-independent disaster recovery has been achieved. We further present a parallel recovery model and an on demand data retrieval method based on the theory. Some implementation details of prototype recovery system are also discussed. With the methods independent from specific devices or applications,the cost of disaster recovery infrastructure can be essentially reduced by resource sharing. Experiments show that the recovery time has also been greatly shortened with little service degradation. | ZHENG WeiMin FANG BinXing | 2009 | Science in China(Series F)2009，52，5： | 3 |
| 6 | 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 |
| 7 | Two-Phased Method for Detecting Evasive Network Attack Channels显示文摘With the rapid developments of information technology,various industries become much more dependent on networks.Driven by economic interests and the game between countries reflected by growing cyberspace confrontations,evasive network attacks on information infrastructures with high-tech,high concealment and longterm sustainability become severe threats to national security.In this paper,we propose a novel two-phased method for the detection of evasive network attacks which exploit or pretend to be common legal encryption services in order to escape security inspection.Malicious communications which camouflage themselves as legal encryption application are identified in the SSL'session structure verification phase firstly,and then by serverside X.509 certificate based anomaly detection,suspicious attack behaviors are further distinguished effectively.Experiment results show that our method is very useful for detecting the network activities of certain unknown threats or new malwares.Besides,the proposed method can be applied to other similar services easily. | CAO Zigang XIONG Gang ZHAO Yong GUO Li FANG Binxing | 2014 | China Communications2014，11，8： | 2 |
| 8 | The New Frontiers of Cybersecurity显示文摘 | Binxing Fang Kui Ren Yan Jia | 2018 | Engineering2018，4，1： | 2 |
| 9 | Lightweight Mutual Authentication Scheme for Protecting Identity in Insecure Environment显示文摘Many improved authentication solutions were put forward, on purpose of authenticating more quickly and securely.However, neither the overuse of hash function,or additional symmetric encryption, can truly increase the overall security. Instead,extra computation cost degraded the performance.They were still vulnerable to a variety of threats, such as smart card loss attack and impersonation attack, due to hidden loopholes and flaws. Even worse, user's identity can be parsed in insecure environment, even became traceable. Aiming to protect identity, a lightweight mutual authentication scheme is proposed. Redundant operations are removed,which make the verification process more explicit. It gains better performance with average cost compared to other similar schemes.Cryptanalysis shows the proposed scheme can resist common attacks and achieve user anonymity.Formal security is further verified by using the widely accepted Automated Validation of Internet Security Protocols and Applications(AVISPA) tool. | Xu Wu Jin Xu Binxing Fang | 2018 | China Communications2018，15，6： | 2 |
| 10 | 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 |
| 11 | A novel logic-based automatic approach to constructing compliant security policies显示文摘It is significant to automatically detect and resolve the incompliance in security policy.Most existing works in this field focus on compliance verification,and few of them provide approaches to automatically correct the incompliant security policies.This paper proposes a novel approach to automatically transform a given security policy into a compliant one.Given security policy Π and delegation policy M declared by logic programs,the approach automatically rewrites Π into a new one ΠM which is compliant with M and is readable by the humans.We prove that the algorithm is sound and complete under noninterference assumption.Formally,we show that the security policy query evaluation algorithm with conflict and unsettlement resolution still works very well on ΠM.The approach is automatic,so it doesn't require a administrator with excess abilities.In this sense,our proposal can help us to save much manpower resource in security management and improves the security assurance abilities. | BAO YiBao YIN LiHua FANG BinXing GUO Li | 2012 | Science China(Information Sciences)2012，55，1： | 2 |
| 12 | Threat-Based Declassification and Endorsement for Mobile Computing显示文摘Declassification and endorsement can efficiently improve the usability of mobile applications.However, both declassify and endorse operations in practice are often ad-hoc and nondeterministic, thus, being insecure. From a new perspective of threat assessments,we propose the Threat-based typed security π-calculus(πTBTS) to model declassification and endorsement in mobile computing. Intuitively, when relaxing confidentiality policies and/or integrity policies, we respectively assess threats brought by performing these two relaxes. If these threats are acceptable, the declassification and/or endorsement operations are permitted;Otherwise, they are denied. The proposed assessments have explicit security conditions, results and less open parameters,so our approach solves the problem of the ad-hoc and nondeterministic semantics and builds a bridge between threat assessments and declassification/endorsement. | YIN Lihua GUO Yunchuan ZHANG Huibing HUANG Wenting FANG Binxing | 2019 | Chinese Journal of Electronics2019，28，5： | 2 |
| 13 | Worms Containment Modeling And Analysis Under Active Worm Countermeasure显示文摘 | WANG Bailing FANG Binxing YUN Xiaochun | 2004 | Wseas transactions on information sciene and applications2004，1，4： | 1 |
| 14 | Covariance correlation matrix and the multi-scale community structure of networks显示文摘 | Shen Huawei Cheng Xueqi Fang Binxing | 2010 | Physi- cal Review E2010，82，01： | 1 |
| 15 | The Indicator System Based on BP Neural Network Model for Net - mediated Public Opinion on Unexpected Emergency 显示文摘 | Zhang Yiwen Qi Jiayin Fang Binxing Li Yuxiao | 2011 | China Communications2011，，3： | 1 |
| 16 | The Propagation Model and Analysis of Worms Together with AntiWorms显示文摘 | WANG Bailing FANG Binxing YUN Xiaochun | 2004 | WSEAS transactions on informationscience and applications2004，1，4： | 1 |
| 17 | Research on Merchant Fraud Problem in Electronic Commerce显示文摘 | Wu Zhigang Fang Binxing Sun Peng | | 0，，： | 1 |
| 18 | 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 |
| 19 | Theories of Social Media: Philosophical Foundations显示文摘 | Jiayin Qi Emmanuel Monod Binxing Fang Shichang Deng | 2018 | Engineering2018，4，1： | 1 |
| 20 | Framework for understanding intention-unbreakable malware显示文摘The anti-analysis technology of malware has always been the focus in the cyberspace security field.As malware analysis techniques evolve,malware writers continually employ sophisticated anti-reverse engineering techniques to defeat and evade state-of-the-art analyzers.Therefore,to prepare for unknown attacks,studying malware analysis techniques is insufficient.More importantly,we should study new antianalysis techniques for malware.This paper expands the concept of anti-analysis malware and defines a type of intention-unbreakable malware(IUM).To help defenders fully understand and establish a defense system against the new security threats,this paper systematically discusses IUM from the perspectives of threat discovery,threat modeling,attribute analysis,and threat assessment;in addition,this study also provides the Po C implementations of IUM and demonstrates how attackers can use this type of malware to evade advanced security analysis,that is,accurate identification of target(class)victims and intention concealment in reaching non-target(class)victims.Finally,this paper provides several mitigation directions for combating IUM. | Tiantian JI Binxing FANG Xiang CUI Zhongru WANG Peng LIAO Shouyou SONG | 2023 | Science China(Information Sciences)2023，66，4： | 1 |
您所在的机构暂未开通此部分的功能，请联系管理员