S-box:six-dimensional compound hyperchaotic map and artificial bee colony algorithm

Being as unique nonlinear components of block ciphers,substitution boxes（S-boxes） directly affect the security of the cryptographic systems.It is important and difficult to design cryptographically strong S-boxes that simultaneously meet with multiple cryptographic criteria such as bijection,non-linearity,strict avalanche criterion（SAC）,bits independence criterion（BIC）,differential probability（DP） and linear probability（LP）.To deal with this problem,a chaotic S-box based on the artificial bee colony algorithm（CSABC） is designed.It uses the S-boxes generated by the six-dimensional compound hyperchaotic map as the initial individuals and employs ABC to improve their performance.In addition,it considers the nonlinearity and differential uniformity as the fitness functions.A series of experiments have been conducted to compare multiple cryptographic criteria of this algorithm with other algorithms.Simulation results show that the new algorithm has cryptographically strong S-box while meeting multiple cryptographic criteria.

通用可组合符号化分析群组密钥协商协议(英文)

Canetti and Herzog have already proposed universally composable symbolic analysis(UCSA) to analyze mutual authentication and key exchange protocols. However,they do not analyze group key exchange protocol. Therefore,this paper explores an approach to analyze group key exchange protocols,which realize automation and guarantee the soundness of cryptography. Considered that there exist many kinds of group key exchange protocols and the participants’ number of each protocol is arbitrary. So this paper takes the case of Burmester-Desmedt(BD) protocol with three participants against passive adversary(3-BD-Passive) . In a nutshell,our works lay the root for analyzing group key exchange protocols automatically without sacrificing soundness of cryptography.

Tracking the events in the coverage of wireless sensor networks based on artificial neural-networks algorithms

Sensor deployment is an important problem in mobile wireless sensor networks.This paper presents a dis-tributed self-spreading deployment algorithm(SOMDA)for mobile sensors based on artificial neural-networks self-organizing maps algorithm.During the deployment,the nodes compete to track the event and cooperate to form an ordered topology.After going through the algorithm,the statistical distribution of the nodes approaches that of the events in the interest area.The performance of the algo-rithm is evaluated by the covered percentage of re-gion/events,the detecting ability and the energy equaliza-tion of the networks.The simulation results indicate that SOMDA outperforms uniform and random deployment with lossless coverage,enhancive detecting ability and signifi-cant energy equalization.

Biologically Inspired Node Generation Algorithm for Path Planning of Hyper-redundant Manipulators Using Probabilistic Roadmap

This article describes a biologically inspired node generator for the path planning of serially connected hyper-redundant manipulators using probabilistic roadmap planners. The generator searches the configuration space surrounding existing nodes in the roadmap and uses a combination of random and deterministic search methods that emulate the behaviour of octopus limbs. The strategy consists of randomly mutating the states of the links near the end-effector, and mutating the states of the links near the base of the robot toward the states of the goal configuration. When combined with the small tree probabilistic roadmap planner, the method was successfully used to solve the narrow passage motion planning problem of a 17 degree-of-freedom manipulator.

Hardware Acceleration for SLAM in Mobile Systems

The emerging mobile robot industry has spurred a flurry of interest in solving the simultaneous localization and mapping(SLAM)problem.However,existing SLAM platforms have difficulty in meeting the real-time and low-pow-er requirements imposed by mobile systems.Though specialized hardware is promising with regard to achieving high per-formance and lowering the power,designing an efficient accelerator for SLAM is severely hindered by a wide variety of SLAM algorithms.Based on our detailed analysis of representative SLAM algorithms,we observe that SLAM algorithms advance two challenges for designing efficient hardware accelerators:the large number of computational primitives and ir-regular control flows.To address these two challenges,we propose a hardware accelerator that features composable com-putation units classified as the matrix,vector,scalar,and control units.In addition,we design a hierarchical instruction set for coping with a broad range of SLAM algorithms with irregular control flows.Experimental results show that,com-pared against an Intel x86 processor,on average,our accelerator with the area of 7.41 mm^(2) achieves 10.52x and 112.62x better performance and energy savings,respectively,across different datasets.Compared against a more energy-efficient ARM Cortex processor,our accelerator still achieves 33.03x and 62.64x better performance and energy savings,respec-tively.

Coupled solid-fluid FE-analysis of an embankment dam

A coupled solid-fluid FE-model for partially saturated soils,characterized by modeling the soil as a three-phase material consisting of a deformable soil skeleton and the fluid phases water and air,is reviewed briefly.As a constitutive model for the soil skeleton,the well-known Barcelona Basic model(BBM)is employed,which is formulated in terms of net stress and matric suction.For the BBM,a computationally efficient return mapping algorithm is proposed,which only requires the solution of a scalar nonlinear equation at the integration point level.The coupled FE-model is applied to the coupled transient numerical simulation of the water flow and the deformations and stresses in an embankment dam.

A Multiscale Approach to Automatic Medical Image Segmentation Using Self-Organizing Map

In this paper, a new medical image classification scheme is proposed using selforganizing map (SOM) combined with multiscale technique. It addresses the problem of the handling of edge pixels in the traditional multiscale SOM classifiers. First, to solve the difficulty in manual selection of edge pixels, a multiscale edge detection algorithm based on wavelet transform is proposed. Edge pixels detected are then selected into the training set as a new class and a mu1tiscale SoM classifier is trained using this training set. In this new scheme, the SoM classifier can perform both the classification on the entire image and the edge detection simultaneously. On the other hand, the misclassification of the traditional multiscale SoM classifier in regions near edges is greatly reduced and the correct classification is improved at the same time.