摘要：Most of the existing image encryption schemes with the substitutlon-chltuslon structure are not secure and efficient. In this letter, a chaos-based pseudo-random bit generator with good statistical properties is proposed, where a simple post-processing by compressing is employed. A new adaptive image encryption scheme with the substitution-diffusion architecture is designed using the new pseu- do-random bit generator. In the scheme, the session key for the pseudo-random bit generator is dependent on the content of the image which ensures that the scheme can effectively resist knownplaintext and chosen-plaintext attacks. Theoretical analysis and computer simulation indicate that the proposed algorithm is efficient and highly secure.

摘要：There are a lot of security issues in block cipher *** analysis and enhanced design of a dynamic block cipher was ***,the safety of ciphertext was enhanced based on confusion substitution of S-box,thus disordering the internal structure of data blocks by four steps of matrix ***,the diffusivity of ciphertext was obtained by cyclic displacement of bytes using column ambiguity *** dynamic key was finally generated by using LFSR,which improved the stochastic characters of secret key in each of round of *** safety performance of proposed algorithm was analyzed by simulation *** results showed the proposed algorithm has a little effect on the speed of encryption and decryption while enhancing the ***,the proposed algorithm has highly scalability,the dimension of S-box and the number of register can be dynamically extended according to the security requirement.

摘要：Standard support vector machines （SVMs） train- ing algorithms have O（l3） computational and O（l2） space complexities, where l is the training set size. It is thus com- /putationally infeasible on very large data *** alleviate the Computational burden in SVM training, we propose an algo- rithm to train SVMs on a bound vectors set that is extracted based on Fisher projection. For linear separate problems, we use linear Fisher discriminant to compute the projection line, while for non-linear separate problems, we use kernel Fisher discriminant to compute the projection line. For each case, we select a certain ratio samples whose projections are adja- cent to those of the other class as bound vectors. Theoretical analysis shows that the proposed algorithm is with low com- putational and space *** experiments on several classification benchmarks demonstrate the effective- ness of our approach.

摘要：Marginal Fisher analysis （MFA） is a repre- sentative margin-based learning algorithm for face recognition. A major problem in MFA is how to select appropriate parameters, k1 and k2, to construct the respective intrinsic and penalty graphs. In this paper, we propose a novel method called nearest-neighbor （NN） classifier motivated marginal discriminant projections （NN-MDP）. Motivated by the NN classifier, NN-MDP seeks a few projection vectors to prevent data samples from being wrongly categorized. Like MFA, NN-MDP can characterize the compactness and separability of samples simultaneously. Moreover, in contrast to MFA, NN-MDP can actively construct the intrinsic graph and penalty graph without unknown parameters. Experimental results on the 0RL, Yale, and FERET face databases show that NN-MDP not only avoids the intractability, and high expense of neighborhood parameter selection, but is also more applicable to face recognition with NN classifier than other methods.

摘要：Physical unclonable function （PUF） makes use of the uncontrollable process variations during the production of IC to generate a unique signature for each IC. It has a wide application in security such as FPGA intellectual property （IP） protection, key generation and digital rights management. Ring oscillator （RO） PUF and Arbiter PUF are the most popular PUFs, but they are not specially designed for FPGA. RO PUF incurs high resource overhead while obtaining less challenge-response pairs, and requires ＂hard macros＂ to implement on FPGAs. The arbiter PUF brings low resource overhead, but its structure has big bias when it is mapped on FPGAs. Anderson PUF can address these weaknesses of current Arbiter and RO PUFs implemented on FPGAs. However, it cannot be directly implemented on the new generation 28 nm FPGAs. In order to address these problems, this paper designs and implements a delay-based PUF that uses two LUTs in an SLICEM to implement two 16-bit shift registers of the PUF, 2-to-1 multiplexers in the carry chain to implement the multiplexers of the PUF, and any one of the 8 flip-flops to latch 1-bit PUF signatures. The proposed delay-based PUF is completely realized on 28 nm commercial FPGAs, and the experimental results show its high uniqueness, reliability and reconfigurability. Moreover, we test the impact of aging on it, and the results show that the effect of aging on the proposed PUF is insignificant, with only 6% bit-flips. Finally, the prospects of the proposed PUF in the FPGA binding and volatile key generation are discussed.

摘要：In this paper,the MCI（multipath crossover interconnection）technique for octagon single and symmetrical spiral inductors has been presented to improve the quality *** metal wires of the single and symmetrical inductors formed by the top metal are divided into multiple segments according to the depth of the skin *** outermost path of the metal is crossover-interconnected to the innermost path by the underlayer metal and via The crossover technique makes the lengths of the total current paths between two ports approximately equal to each ***,the induced magnetic flux and resistance of each path can be balanced and the Q-factor of spiral inductors can be *** proposed MCI technique has been validated by the electromagnetic simulation with the 130-nm 1P6M SiGe BiCMOS *** the devices with occupying areas of 240 240 μm^2,results of electromagnetic simulation show that about 24%improvement in the Q-peak（3.3 GHz）of the MCI single inductor as compared to conventional single inductors（3.1 GHz）,and about 88.1%improvement in the Q-peak（3.2 GHz）of the MCI symmetrical inductor as compared to conventional symmetrical inductors（1.8 GHz）.

摘要：The design of an ultra-compact SOI-based 1×2 3 dB multimode interference(MMI) coupler is *** symmetric multimode interference structure and deeply-etched parabolically tapered multimode waveguide are used in the *** length of the device is reduced by about 87% compared with general multimode interference straight *** on effective index method(EIM) and two dimensional beam propagation method(2D-BPM),the structure parameters are optimized and the fabrication tolerances are *** results indicate that the performance of the coupler is deeply affected by the coupler's width,etching depth and photolithography alignment error in perpendicular direction.

摘要：A new cascade control program was proposed based on modified internal model control to handle stable,unstable and integrating processes with time *** program had totally four controllers of which the secondary loop had two controllers and the primary loop had two *** two secondary loop controllers were designed using IMC *** were decoupled completely and could be adjusted independently,which avoided the undesirable influence on performance of the primary *** main controller in the primary loop was devised as a PID using the method of minimum sensitivity,which could guarantee not only the nominal performance but also the robust stability of the system.A setpoint filter was added in the primary loop to improve the tracking *** the controllers of the two closed-loops were designed analytically,and could be adjusted and optimized by single parameter *** were carried out on three various processes with time delay,and the results show that the proposed method can provide a better performance of both set-point tracking and disturbance rejection and robustness against parameters perturbation.

摘要：Traditional honeypot is in fact a "passive proactive" defense mechanism because it may lose the value entirely once the adversary has detected the existence of the static trap and bypassed *** work focuses on a Self-Election dynamic honeypot framework which aims to bewilder attackers by coordinating and switching roles periodically to form a huge dynamic *** this paper,we discuss the UDP Spokesman synchronization scheme and the Self-Election coordination method,perform the framework simulation of the dynamic array honeypot with NS2,carry out the prototype implementation by Java,and then validate the effectiveness and feasibility on the simulation and prototype *** promising results of applying this framework to mitigate the effects of attacks are shown and *** work demonstrates that the Self-Election dynamic array honeypot system is feasible and effective for proactive network confrontation.

摘要：This paper describes a novel model known as the shadow obstacle model to generate a realistic comer-tuming behavior in crowd simulation. The motivation for this model comes from the observation that people tend to choose a safer route rather than a shorter one when turning a comer. To calculate a safer route, an optimization method is proposed to generate the corner-turning rule that maximizes the viewing range for the agents. By combining psychological and physical forces together, a full crowd simulation framework is established to provide a more realistic crowd simulation. We demonstrate that our model produces a more realistic comer-turning behavior by comparison with real data obtained from the experiments. Finally, we per- form parameter analysis to show the believability of our model through a series of experiments.