Bit stream oriented enumeration tree pruning algorithm

Packet analysis is very important in our digital life. But what protocol analyzers can do is limited because they can only process data in determined format. This paper puts forward a solution to decode raw data in an unknown format. It is certain that data can be cut into packets because there are usually characteristic bit sequences in packet headers. The key to solve the problem is how to find out those characteristic sequences. We present an efficient way of bit sequence enumeration. Both Aho-Corasick (AC) algorithm and data mining method are used to reduce the cost of the process.     

Computer forensic using Lazy Local bagging predictors

In this paper, we study the problem of employ ensemble learning for computer forensic. We propose a Lazy Local Learning based bagging (L3B) approach, where base learners are trained from a small instance subset surrounding each test instance. More specifically, given a test instance x, L3B first discovers x's k nearest neighbours, and then applies progressive sampling to the selected neighbours to train a set of base classifiers, by using a given very weak (VW) learner. At the last stage, x is labeled as the most frequently voted class of all base classifiers. Finally, we apply the proposed L3B to computer forensic.     

巧用六大招数拆解文明交通“三让”管理难

明交通“三让”即：车让车，车让人，人让车。明交通“三让”管理（以下简称“三让管理”）是创建以人为本，明有序的交通环境的重要举措，是深化、延伸无锡明交通水平、提升无锡城市明形象的有效手段和积极方法。在交通参与明交通素质还没有得到全面提高的今天，“三让管理”蕴涵着“以人为本”的特色和亮点，     

Parallel Key-insulated Signature： Framework and Construction

To deal with the key-exposure problem in signature systems, a new framework named parallel key-insulated signature （PKIS） was introduced, and a concrete PKIS scheme was proposed. Compared with traditional key-insulated signature （KIS） schemes, the proposed PKIS scheme allows a frequent updating for temporary secret keys without increasing the risk of helper key-exposure. Moreover, the proposed PKIS scheme does not collapse even if some （not all） of the helper keys and some of the temporary secret keys are simultaneously exposed. As a result, the security of the PKIS scheme is greatly enhanced, and the damage caused by key-exposure is successfully minimized.     

Watermarking data cubes

We propose a robust watermarking scheme and several extensions for digital right management of data cubes. The ownership information is hidden into a data cube by modifying a set of selected cell values. Its owner can use his private key to control all the watermarking parameters freely. Neither original data cube nor the watermark is required in watermark detection. Detailed analysis and extensive experiments are conducted for the proposed schemes in terms of watermark detectability, robustness and efficiency. Our results show that the scheme performs well in actual applications.