Object Detection Based on Multi-scale Contour Fragments

Xiaofeng Zhang,Qiaoyu Sun,Yue Lu 보안공학연구지원센터 2012 International Journal of Multimedia and Ubiquitous Vol.7 No.2

Hyperplane distance neighbor clustering based on local discriminant analysis for complex chemical processes monitoring

Chunhong Lu,Xiaofeng Gu,Shaoqing Xiao 한국화학공학회 2014 Korean Journal of Chemical Engineering Vol.31 No.11

The collected training data often include both normal and faulty samples for complex chemical processes. However, some monitoring methods, such as partial least squares (PLS), principal component analysis (PCA), indepen-dent component analysis (ICA) and Fisher discriminant analysis (FDA), require fault-free data to build the normal op-eration model. These techniques are applicable after the preliminary step of data clustering is applied. We here proposea novel hyperplane distance neighbor clustering (HDNC) based on the local discriminant analysis (LDA) for chemicalprocess monitoring. First, faulty samples are separated from normal ones using the HDNC method. Then, the optimalsubspace for fault detection and classification can be obtained using the LDA approach. The proposed method takesthe multimodality within the faulty data into account, and thus improves the capability of process monitoring signifi-cantly. The HDNC-LDA monitoring approach is applied to two simulation processes and then compared with the con-ventional FDA based on the K-nearest neighbor (KNN-FDA) method. The results obtained in two different scenariosdemonstrate the superiority of the HDNC-LDA approach in terms of fault detection and classification accuracy.

F-Crowds : An Anonymity Scheme for P2P File-Sharing

Tianbo Lu,Xinyuan Zhang,Xiaofeng Du,Yang Li 보안공학연구지원센터 2016 International Journal of Security and Its Applicat Vol.10 No.6

The traditional encryption methods pay more attention to the confidentiality of the message content, but ignore the protection of identity information to the communicating parties. By encrypting, the contents of the communication acquired by attackers became relatively difficult, but they can still found the identity information of the two sides to communicate easily because in the TCP / IP protocol, the sender and receiver of the message are exposed. The anonymity communication technology, is used to solve this problem. The first anonymity communication technology can date back to 1981, Chaum proposed MIX [1] which is a very important technology for reference by a number of researchers of anonymity communication. The rapid development of the Internet has made things convenience to people, but also led to more personal information exposed to the public. As a result, a growing number of areas that required anonymity communication technology to protect the user's privacy. P2P file-sharing is not exception. P2P is undoubtedly the most popular way for file-sharing, but popular P2P file-sharing protocols, such as BitTorrent, can’t provide users anonymity communication service. Many people choose to build upon existing anonymous communication tools, such as Tor, to achieve anonymous P2P file transfer, but Tor primarily provides anonymous service for web browsing, instant message or other low latency applications. A large number of P2P file traffic will seriously threaten the service of Tor. Therefore, the anonymity communication service specifically for P2P file sharing system is very important. In this paper, we presents an anonymity communication scheme specifically for P2P file-sharing networks called F-Crowds which based on Crowds [2] to provide an adjustable anonymity service for P2P file-sharing.

SCMA: Scalable and Collaborative Malware Analysis using System Call Sequences

Huabiao Lu,Xiaofeng Wang,Jinshu Su 보안공학연구지원센터(IJGDC) 2013 International Journal of Grid and Distributed Comp Vol.6 No.2

Towards a Comprehensive Analysis of Crowds Anonymity System

Tianbo Lu,Xinyuan Zhang,Xiaofeng Du,Yang Li 보안공학연구지원센터 2016 International Journal of Security and Its Applicat Vol.10 No.7

There is an increasing command for anonymity in network. Crowds[1] is an popular anonymity system proposed by Michael K. Reiter and Aviel D. Rubin which main idea behind it is hiding users’ identities by routing their packets randomly within a group of similar users. Crowds can provides sender anonymity and also has an advantage that the computation load of relay nodes is very small but it does not protect the identity of the receiver. This paper presents an overview on Crowds and introduces the development of Crowds from the following aspects: anonymity analysis, application especially the application in P2P and the performance. We summarize the work about anonymity analysis based on Crowds and divide them into receiver analysis, probabilistic behavior, attack and anonymity proof. Crowds is high efficient but it can’t resist the global attack, therefore, to meet the needs of the different levels of anonymity, there is a vast body of anonymity literature concerned with anonymity analysis, for example, Crowds can’t provide receiver anonymity but receiver anonymity is important in many cases, so many work extending the Crowds system from sender anonymity only to sender and receiver anonymity. In addition to the analysis, we also summarize the applications of Crowds. Undoubtedly, it is widely used in P2P. We also give an overlook of the performance of Crowds.

An Analysis of Active Attacks on Anonymity Systems

Tianbo Lu,Pan Gao,Xiaofeng Du,Yang Li 보안공학연구지원센터 2016 International Journal of Security and Its Applicat Vol.10 No.4

Network security in the traditional sense consists of the following four elements: secret, integrity, availability and authenticity. Recent studies have indicated that: anonymity, as an important indicator of information security. In recent years, the research shows that: anonymity is also gradually being the important indicator of information security. With the rapid development of communication technology and the Internet, people pay more and more attention to personal privacy. As a result, the research on anonymous communication system is gradually increasing. P2P network's openness and the unpredictability of malicious nodes make the network user's privacy information more vulnerable to illegal theft. The attacker can not only get the contents of the file, but also can get the identity and other related privacy information of the sender and receiver. Anonymous technology is the best way to solve the privacy protection. Therefore, it is of important theoretical significance and application value to study the anonymous technology in P2P network environment. However, with the development of anonymous technology, P2P network attack technology has become the focus of research. This paper mainly analyzes the typical active attack technology.

Towards an Analysis of Verifiable Mix Network Properties

Tianbo Lu,Jiaxi Lin,Xiaofeng Du,Yang Li 보안공학연구지원센터 2016 International Journal of Future Generation Communi Vol.9 No.7

With the development of mix-net, the basic properties of mix-net cannot satisfy all the requirements of people. The verifiable mix-net raised in response to the proper time and conditions. In this paper, we study the problem of simultaneously achieving several security properties, for mix-nets and verifiability mix-nets. More precisely, under different assumptions and requirements, verifiability mix-nets have more extra security properties than mix-nets. The basic properties of mix-nets contain correctness, privacy, robustness, availability and efficient. The extra properties of verifiability mix-nets contain universal verifiability, unconditional anonymous, receipt-freeness. This paper summarizes all of the security properties, and defines them explicitly and systematically.

Current Status and Future Trends of Cold Atmospheric Plasma as an Oncotherapy

Dai Xiaofeng,Wu Jiale,Lu Lianghui,Chen Yuyu 한국응용약물학회 2023 Biomolecules & Therapeutics(구 응용약물학회지) Vol.31 No.5

Cold atmospheric plasma (CAP), a redox modulation tool, is capable of inhibiting a wide spectrum of cancers and has thus been proposed as an emerging onco-therapy. However, with incremental successes consecutively reported on the anticancer efficacy of CAP, no consensus has been made on the types of tumours sensitive to CAP due to the different intrinsic characteristics of the cells and the heterogeneous design of CAP devices and their parameter configurations. These factors have substantially hindered the clinical use of CAP as an oncotherapy. It is thus imperative to clarify the tumour types responsive to CAP, the experimental models available for CAP-associated investigations, CAP administration strategies and the mechanisms by which CAP exerts its anticancer effects with the aim of identifying important yet less studied areas to accelerate the process of translating CAP into clinical use and fostering the field of plasma oncology.

Multiple Periods Minimal Cost Programming Optimization Model for Empty Containers Repositioning with Stock Level

Lihua Lu,Hengzhen Zhang,Xiaofeng Wang,Xiao-Zhi Gao 보안공학연구지원센터 2016 International Journal of Hybrid Information Techno Vol.9 No.8

The main problem of empty containers repositioning (ECR) is to dispatch the empty containers among the ports meanwhile cut the costs as possible as. According to the actual operations, the stock policy and various constrains are considered together in this paper firstly. Then we build a multiple periods minimal cost programming optimization model with stock to solve this problem. Furthermore, we adopt the heuristic rule to effectively operate the empty containers since there is a large amount of calculation. Finally, some simulate data are given to assess the model. The results show that our proposed model is feasible and efficient to minimize the operation cost as well as satisfy the demand of customers. Moreover by analyzing the data it can guide us to set the inventory of empty containers of ports in different supply and demand scenarios.

CCS: Collaborative Malware Clustering and Signature Generation using Malware Behavioral Analysis

Huabiao Lu,Xiaofeng Wang,Jinshu Su 보안공학연구지원센터 2012 International Journal of Hybrid Information Techno Vol.5 No.2