Preventing Dropping Packets Attack in Sensor Networks： A Game Theory Approach

Focusing on dropping packets attacks in sensor networks, we propose a model of dropping packets attack-resistance as a repeated game based on such an assumption that sensor nodes are rational. The model prevents malicious nodes from attacking by establishing punishment mechanism, and impels sensor networks to reach a collaborative Nash equilibrium. Simulation results show that the devised model can effectively resist the dropping packets attacks（DPA） by choosing reasonable configuration parameters.     

BBACIMA： A Trustworthy Integrity Measurement Architecture through Behavior-Based TPM Access Control

Two limitations of current integrity measurement architectures are pointed out： （1） a reference value is required for every measured entity to verify the system states, as is impractical however; （2） malicious user can forge proof of inexistent system states. This paper proposes a trustworthy integrity measurement architecture, BBACIMA, through enforcing behavior-based access control for trusted platform module （TPM）. BBACIMA introduces a TPM reference monitor （TPMRM） to ensure the trustworthiness of integrity measurement. TPMRM enforces behavior-based access control for the TPM and is isolated from other entities which may be malicious. TPMRM is the only entity manipulating TPM directly and all PCR （platform configuration register） operation requests must pass through the security check of it so that only trusted processes can do measurement and produce the proof of system states. Through these mechanisms malicious user can not enforce attack which is feasible in current measurement architectures.     

Two-phase genetic algorithm applied in the optimization of multi-modal function

This paper presents a two-phase genetic algorithm (TPGA) based on the multi-parent genetic algorithm (MPGA). Through analysis we find MPGA will lead the population’s evolvement to diversity or convergence according to the population size and the crossover size, so we make it run in different forms during the global and local optimization phases and then forms TPGA. The experiment results show that TPGA is very efficient for the optimization of low-dimension multi-modal functions) usually we can obtain all the global optimal solutions. Foundation item: Supported by the National Natural Science Foundation of China (70071042, 60073043,60133010) Biography: Huang Yu-zhen ( 1977-), female, Master candidate, research direction; evolution computation.     

Mining Interesting Knowledge from Web-Log

Web-tog contains a lot of information related with user activities on the Internet. How to mine user browsing interest patterns effectively is an important and chattengeable research topic. On the analysis of the present algorithm‘s advantages and disadvantages, we propose a new concept: support-interest. Its key insight is that visitor will backtrack if they do not find the information where they expect. And the point from where they backtrack is tbe expected location for the page. We present User Access Matrix and the corresponding algorithm for discovering such expected locations that can handle page caching by the browser. Since the URL-URL matrix is a sparse matrix which can be represented by List of 3 tuples, we can mine user preferred sub-paths from the computation of this matrix. Accordinglyo all the sub-paths are merged, and user preferred paths are formed. Experiments showed that it was accurate and scalable. It‘s suitable for website based application, such as to optimize website‘s topologicat structure or to design personalized scrvices.     

An Improved Model of Attack Probability Prediction System

This paper presents a novel probability generation algorithm to predict attacks from an insider who exploits known system vulnerabilities through executing authorized operations. It is different from most intrusion detection systems （IDSs） because these IDSs are inefficient to resolve threat from authorized insiders. To deter cracker activities, this paper introduces an improved structure of augmented attack tree and a notion of ＂minimal attack tree＂, and proposes a new generation algorithm of minimal attack tree. We can provide a quantitative approach to help system administrators make sound decision.     

Static extracting method of software intended behavior based on API functions invoking

The method of extracting and describing the intended behavior of software precisely has become one of the key points in the fields of software behavior＇s dynamic and trusted authentication. In this paper, the author proposes a specified measure of extracting SIBDS （software intended behaviors describing sets） statically from the binary executable using the software＇s API functions invoking, and also introduces the definition of the structure used to store the SIBDS in detail. Experimental results demonstrate that the extracting method and the storage structure definition offers three strong properties： （i） it can describe the software＇s intended behavior accurately; （ii） it demands a small storage expense; （iii） it provides strong capability to defend against mimicry attack.     

一种基于残差分析过滤的安全定位算法

在无线传感网络节点定位中,恶意锚节点的出现会降低网络定位性能,为了解决这个问题,根据节点定位过程中的恶意锚节点攻击特性和定位计算中的残差问题,提出一种基于残差分析和过滤的无线传感网络安全定位算法.建立了基于距离的安全定位模型,对网络定位中的残差问题进行了分析,并且通过残差特性过滤掉网络中恶意锚节点,利用剩余锚节点信息和梯度下降法对未知节点实现高精度定位.仿真表明,此算法在多个性能指标下都能取得相对较高的定位精度,并且在高强度的恶意攻击下也能保持较高的定位性能.此算法不但能有效地抵御恶意攻击对节点定位的破坏,还显著地加强了网络的定位安全性.     

A feedback-based web search engine

Web search engines are very useful information service tools in the Internet. The current web search engines produce search results relating to the search terms and the actual information collected hy them. Since the selections of the search results cannot affect the future ones. they may not cover most people‘s interests. In this paper, feedback informarion produced by the users‘ accessing lists will be represented By the rough set and can reconstruct the query string and influence the search results. And thus the search engines can provide self-adaptability.     

Improved Authenticated Multi-Key Agreement Protocol

Zhou et al give an attack on Ham＇s modified authenticated multi-key agreement protocol, and give a protocol that can prevent the unknown key-share attack. The paper points out that the protocol is vulnerable to a concatenation attack. This paper proposes an improved authenticated multi-key agreement protocol which shows how to make Harn＇s protocol more secure by modifying the signature and verification. And this protocol can escape the concatenation attack.     

A fair off-line e-cash system with group signature

This paper describes the research results and development of fair off-line e~eash systems so far, and points out that in these systems, the bank can compute the doublespender‘s account secret key, thus the bank can impersonate the double-spender to withdraw from the double-spender‘s account. This article utilizes anonymity control and group signature to address this shortcoming.     

Building Intrusion Tolerant Software System

In this paper, we describe and analyze the hypothesis about intrusion tolerance software system, so that it can provide an intended server capability and deal with the impacts caused by the intruder exploiting the inherent security vulnerabilities. We present some intrusion tolerance technology by exploiting N-version module threshold method in con-structing multilevel secure software architecture, by detecting with hash value, by placing an ““““““““antigen““““““““ word next to the return address on the stack that is similar to human immune system, and by adding ““““““““Honey code““““““““ nonfunctional code to disturb intruder, so that the security and the availability of the software system are ensured.     

A Fast Distributed Algorithm for Association Rule Mining Based on Binary Coding Mapping Relation

Association rule mining is an important issue in data mining. The paper proposed an binary system based method to generate candidate frequent itemsets and corresponding supporting counts efficiently, which needs only some operations such as ＂and＂, ＂or＂ and ＂xor＂. Applying this idea in the existed distributed association rule mining al gorithm FDM, the improved algorithm BFDM is proposed. The theoretical analysis and experiment testify that BFDM is effective and efficient.     

A New ID-Based Proxy Multi-Signature Scheme from Bilinear Pairings

ID-based public key cryptosystem can be a good alternative for certifieate-based public key setting. This paper provides an efficient ID-based proxy multi signature scheme from pairings. In the random oracle model, we prove that our new scheme is secure against existential delegation forgery with the assumption that Hess＇s scheme-1 is existential unforgeable, and that our new scheme is secure against existential proxy multi-signature forgery under the hardness assumption of the computational Diffie-Hellman problem.     

Determination of ciprofloxacin hydrochloride in pharmaceutical preparation and biological fluid by Rayleigh light scattering technique

A highly sensitive and simple Rayleigh light scattering (RLS) method for determination of ciprofloxacin hydrochloride has been developed. Ciprofloxacin hydrochloride (CPFH) reacted with tetraphenylboron sodium(TPB) to form an ion-association complex in pH 5.31 aqueous solution, which resulted in a significant enhancement of the RLS intensity, which was linear with the concentration of CPFH in the range of 12.7–419 ng·mL⁻¹. The limit of detection for CPFH was 6.99 ng·mL⁻¹. The method is simple, highly sensitive and selective within a wide linear range. Appliying this method to determination of ciprofloxacin hydrochloride in pharmaceutical preparations and biological fluids obtained satisfactory results. Foundation item: Supported by the National Natural Science Foundation of China(20675059) and Research Foundation of Leshan Teachers’ College, China (Z0625)     

Divisional and hierarchical innervations of G. gecko’s toes to motion and reception

As a member of robot families, climbing robots have become one of the research hot-spots in the robotic field recently and Gekko gecko （G. gecko） has been broadly seen as an ideal model for climbing robot development. But for gecko-mimic robots, one of the key problems is how to design the robot＇s foot. In this paper, （1） high-speed camera recording and electrophysiological method are used to observe motion patterns of G. gecko＇s foot when it climbs on different oriented surfaces; （2） nerve innervations of gecko＇s toes to motion and reception are studied. It is found that the five toes of the G. gecko can be divided into two motion and reception divisions, and also its motion and reception are modulated and controlled hierarchically. The results provide important information and exclusive ideas for the foot design and control algorithm of gecko-mimic robots.     

Solution of Cauchy’s problem for wave equations in higher space dimensions by means of D’Alembert’s formula

A simple method for solving Cauchy’s problem of wave equations in higher space dimensions with initial condition of separated variables, has been given by using D’Alembert’s formula and some examples have been shown. Foundation item: Supported by the Natural Science Foundation of Hubei Province (992P0307) and the National Natural Science Foundation of China (39970203) Biography: YAO Duan-zheng (1946-), female, Professor, Research direction: mathematical physics and nonlinear optics.     

An Asymptotic UTD Solution for the Scattering by an Impedance Wedge at Skew Incidence

Asymptotic expressions for the fields scattered by an isotropic impedance wedge at skew incidence are derived in the frame of the uniform geometrical theory of diffraction （UTD）. They are obtained by approximately solving the difference equations generated from impedance boundary con ditions （IBCs） in Maliuzhinets＇ approach. The method overcomes the discontinuity of the nonuniform evaluation given in the literature referred and can give out satisfactory numerical results.     

A Disk Scheduling Algorithm： SPFF

We put forward an optimal disk schedule with n disk requests and prove its optimality mathematically.Generalizing the idea of an optimal disk schedule, we remove the limit of n requests and, at the same time, consider the dynamically arrival model of disk requests to obtain an algorithm, shortest path first-fit first （SPFF）. This algorithm is based on the shortest path of disk head motion constructed by all the pendent requests. From view of the head moving distance, it has the stronger glohality than SSTF. From view of the head-moving direction, it has the better flexibility than SCAN. Therefore, SPFF keeps the advantage of SCAN and, at the same time, absorbs the strength of SSTF. The algorithm SPFF not only shows the more superiority than other scheduling polices, but also have higher adjustability to meet the computer system＇s different demands.     

Local Extrema of Periodic Function＇s Wavelet Transform

The theory of detecling ridges in the modulus of the continuous wavelet transform is presented as well as reconstructing signal by using information on ridges,To periodic signal we suppose Morlet wavelet as basic wavelet, and research the local extreme point and extrema of the wavelet transform on periodic function for the collection of signal＇ s instantaneous amplitude and period.