Search

ABSTRACT In order to study the fatigue performance of composite beam with steel-plate-concrete composite deck under fatigue load, both static test on two specimens and fatigue test with constant-amplitude fatigue [...]

Zero-trust security is a novel concept to cope with intricate access, which can not be handled by the conventional perimeter-based architecture anymore. The device-to-device continuous authentication protocol is one of the most crucial cornerstones, especially in the IoT scenario. In the zero-trust architecture, trust does not rely on any position, person or device. However, to the best of our knowledge, almost all existing device-to-device continuous authentication relies on a trust authority or a node to generate secret keys or secret values. This is betrayed by the principle of zero-trust architecture. In this paper, we employ the blockchain to eliminate the trusted node. One node is chosen to produce the public parameter and secret keys for two entities through the practical Byzantine fault tolerance consensus mechanism. Additionally, the devices are categorized into three folds: trusted device, suspected device and untrusted device. Only the first two can participate in authentication, and they have different lengths of security parameters and intervals to reach a better balance between security and efficiency. Then we prove the security of the initial authentication part in the eCK model and give an informal analysis of the continuous authentication part. Finally, we implement the proposed protocol on simulated devices. The result illustrates that our scheme is highly efficient, and the continuous authentication only costs around 0.1ms.

In this paper, a novel method combined the linear and nonlinear methods, named as Partial Transmit Sequence followed by Clipping (PTS-Clipping), is proposed to reduce the peak-to-average power ratio (PAPR) of Radio Over Fiber and Orthogonal frequency division multiplexing (ROF-OFDM) system. The main technique of this method is clipping the processed signal whose probability of the peak value has been reduced by PTS technique. Then the PAPR value will be further reduced. It will bring in slight change to the BER performance between with and without clipping. We know that both the ROF and OFDM techniques are key issues of the next generation network. Reduce the PAPR of OFDM is a necessary work. The simulation results show the feasibility of this method. Index Terms--ROF -OFDM, PAPR, PTS-Clipping

The radio-over-Sber(ROF) network has been proved to the best candidate for the wireless-access technology, and the orthogonal frequency division multiplexing (OFDM) tehnique has been accepted as the core transmitting technology, so the OFDM-ROF sytem is the hot topic in the international academia. An OFDM-ROF system simulation model basing on IEEE 802.16a physical layer protocol had been built up. Special attention had been paid on the high peak-to-average power ratio (PAPR) oft he OFDM signal which greatly constrained the performance of the OFDM-ROF system. A clipping and filtering technology had been investigated and simulated. Compared with the Naquist sampled, the two over sampled signal had a better performance in reducing PAPIR The bit error rate (BER) error flow research had been done with transmitting the clipped signal in nonlinear distorted ROF link. And the QAM had been testified for the preferred technique in OFDM-ROF link (1). Index Terms--OFDM-ROF, PAPR, dipping and filtering, BER.

In the bi-dimensional empirical mode decomposition, the determination of the stopping criterion is an important reason for obtaining a complete bi-dimensional intrinsic mode function. An excellent stopping criterion can adapt the image characteristics to stop the decomposition. This paper first analyzes the number and distribution of extreme points reflecting the physical state of the mean surface during the sieving process. Then, bi-dimensional empirical mode decomposition and the stopping criterion based on the number and change of extreme points is proposed. In order to verify the adaptability, effectiveness and reliability of the criterion, the relevant examples were subjected to bi-dimensional empirical mode decomposition experiments under the conditions of the traditional stopping criterion, the GRILL stopping criterion and the stopping criterion proposed in this paper. The results show that the intrinsic mode function obtained by the stop criterion proposed in this paper is more in line with the physical characteristics, more reflective of the original image feature information and with higher accuracy.

Artificial intelligence technology has revolutionized every industry and trade in recent years. However, its own development is encountering bottlenecks that it is unable to implement empathy with human emotions. So affective computing is getting more attention from researchers. In this paper, we propose an amygdala-inspired affective computing framework to realize the recognition of all kinds of human personalized emotions. Similar to the amygdala, the instantaneous emergency emotion is first computed more quickly in a low-redundancy convolutional neural network compressed by pruning and weight sharing with hashing trick. Then, the real-time process emotion is identified more accurately by the memory level neural networks, which is good at handling time-related signals. Finally, the intracranial emotion is recognized in personalized hidden Markov models. We demonstrate on Facial Expression of Emotion Dataset and the recognition accuracy of external emotions (including the emergency emotion and the process emotion) reached 85.72%. And the experimental results proved that the personalized affective model can generate desired intracranial emotions as expected.

In this paper, we conduct research on the dynamic demand response problem in smart grid to control the energy consumption. The objective of the energy consumption control is constructed based on differential game, as the dynamic of each users' energy state in smart gird can be described based on a differential equation. Concept of electricity sharing is introduced to achieve load shift of main users from the high price hours to the low price hours. Nash equilibrium is given based on the Hamilton equation and the effectiveness of the proposed model is verified based on the numerical simulation results.

In this paper, a Stackelberg differential game based approach is proposed to solve the bandwidth allocation problems in satellite communication network. All the satellites are divided into two groups, one has high download requirements, and the other one has low download requirements. Each satellites group has its own controller for bandwidth allocation, and can get payments from the satellites for the allocated resources. The relationships between the controllers and satellites are formed as a Stackelberg game. In our model, differential equation is introduced to describe the bandwidth dynamics for the whole satellite communication network. Combine the differential equation and Stackelberg game together, we can formulate the bandwidth allocation problems in satellite communication network as a Stackelber differential game. The solutions to the proposed game is solved based the Bellman dynamic equations. Numerical simulations are given to prove the effeteness and correctness of the proposed approach.

A new type of composite slab is introduced in this paper, which is composed of normal flat steel plates and concrete slabs, connected and interacted by perfobond shear connectors (PBL shear connectors). Experiments on six specimens of this type of composite slab, loaded at two symmetric two-points, were described in this paper to get mechanical behaviors under bending moments. During the experiments, the crack patterns, failure modes, failure mechanism and ultimate bending capacity of specimens with composite slab were investigated, and the strains of concrete and flat steel plates were also measured and recorded in order to obtain the moment action. From the experimental results, it was found that composite interaction between the steel plate and the concrete fully developed, and such composite slab was verified to have good mechanical performance with high bending capacity, substantial flexural rigidity and good ductility. Plane section assumption was also verified and moreover, a design approach including calculation methods of bending capacity and flexural rigidity was established and proposed based on the experimental results, and the calculation methods were also verified and revised on the basis of comparisons of the calculated results and experimental results. Results from this paper provide references for the application of this new type composite slab.

In this paper, we investigate the link resource management problem for optical networks, to achieve the resource cost during the information transmission. We use the differential game to formulate the cost control problem for the link resource management, to minimize the resource allocation cost functions, which dynamic behaviours are described by differential equations. Each link controls its transmission bandwidth based on the Nash equilibriums of the differential game. The effectiveness of the proposed model is given through numerical simulations.

Fog computing is a new paradigm providing network services such as computing, storage between the end users and cloud. The distributed and open structure are the characteristics of fog computing, which make it vulnerable and very weak to security threats. In this article, the interaction between vulnerable nodes and malicious nodes in the fog computing is investigated as a non-cooperative differential game. The complex decision making process is reviewed and analyzed. To solve the game, a fictitious play-based algorithm is which the vulnerable node and the malicious nodes reach a feedback Nash equilibrium. We attain optimal strategy of energy consumption with QoS guarantee for the system, which are conveniently operated and suitable for fog nodes. The system simulation identifies the propagation of malicious nodes. We also determine the effects of various parameters on the optimal strategy. The simulation results support a theoretical foundation to limit malicious nodes in fog computing, which can help fog service providers make the optimal dynamic strategies when different types of nodes dynamically change their strategies.

Fog Computing is a new platform that can serve mobile devices in the local area. In Fog Computing, the resources need to be shared or cached in the widely deployed Fog clusters. In this paper, we propose a Steiner tree based caching scheme, in which the Fog servers, when caching resources, first produce a Steiner tree to minimize the total path weight (or cost) such that the cost of resource caching using this tree could be minimized. Then we give a running illustration to show how the Fog Computing works and we compare the traditional shortest path scheme with the proposed one. The outcome shows that the Steiner tree based scheme could work more efficiently.

InterPlaNetary Internet (IPN) plays a very important role in the exploitation of space. However, the relays in IPN are suffered from high symbol error, limited storage space, and limited available energy. To analyze the performance of the relay in IPN, in this article, we build a differential game model, where the controller is transmitting rate, and the goal is to maximize the payoff according to the symbol error rate, the storage space and the available energy in the system. By such a design, the green relays can be achieved for IPNs, which could prolong the live of the relays. Since the model is not easy to discuss, we analyze it using the Bellman theorem and then get some formulas on the trace of the optimal transmitting rate. Finally, extensive simulation results are presented to demonstrate the performance of our proposed model, which shows that by using our derived optimal transmitting rate trace, the relay’s payoff can be maximized.

While Big Data gradually become a hot topic of research and business and has been everywhere used in many industries, Big Data security and privacy has been increasingly concerned. However, there is an obvious contradiction between Big Data security and privacy and the widespread use of Big Data. In this paper, we firstly reviewed the enormous benefits and challenges of security and privacy in Big Data. Then, we present some possible methods and techniques to ensure Big Data security and privacy.

As an important component of Atomic Force Microscopes (AFM), a piezo‐scanner exhibits some undesired nonlinear characteristics, among which the inherent hysteresis largely decreases positioning accuracy during scanning and nano‐manipulation process. To alleviate this problem, an image‐based approach is proposed in this paper to model and then compensate for the hysteresis behavior of the piezo‐scanner. Specifically, some scanning images over standard samples are utilized to identify the parameters of the classical Preisach model (CPM) of hysteresis. On the basis of the obtained model, an inversion‐based technique is adopted to design a compensator for the hysteresis of the piezo‐scanner. The proposed algorithm presents such advantages as low cost and little complexity since no nanoscale position sensor is required to collect identification data. Some scanning and nano‐imprinting results are included to demonstrate the performance of the proposed strategy. Copyright © 2009 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society

Edge computing is an emerging technology for revolutionarily tackling the network bottlenecks of cloud-device ecosystems. There are about 20 billion edge devices connected to the Internet, with 507.9 ZB data generated, which has reached the limits of central clouds and network bandwidth. It is vitally important for distributed and decentralized edge devices to perform necessary computations on-device rather than outsourcing it to the cloud. However, the openness, heterogeneity and limited computing and storage resources of edge devices have greatly increased the difficulty of security protection in edge computing. This SI targets to address challenges related to developing architectures, algorithms, and techniques to guarantee the security of edge computing. This Special Collection aims to address all these topics and invite contributions from worldwide leading researchers. These works have investigated a wide spread of topics with respect to security issues in emerging edge computing, which are summarized as follows in details.