Event-triggered H_(∞) PI state estimation for delayed switched neural networks

On state estimation problems of switched neural networks,most existing results with an event-triggered scheme(ETS)not only ignore the estimator information,but also just employ a fixed triggering threshold,and the estimation error cannot be guaranteed to converge to zero.In addition,the state estimator of non-switched neural networks with integral and exponentially convergent terms cannot be used to improve the estimation performance of switched neural networks due to the difficulties caused by the nonsmoothness of the considered Lyapunov function at the switching instants.In this paper,we aim at overcoming such difficulties and filling in the gaps,by proposing a novel adaptive ETS(AETS)to design an event-based H_(∞)switched proportional-integral(PI)state estimator.A triggering-dependent exponential convergence term and an integral term are introduced into the switched PI state estimator.The relationship among the average dwell time,the AETS and the PI state estimator are established by the triggering-dependent exponential convergence term such that estimation error asymptotically converges to zero with H_(∞)performance level.It is shown that the convergence rate of the resultant error system can be adaptively adjusted according to triggering signals.Finally,the validity of the proposed theoretical results is verified through two illustrative examples.

A novel differentiated services supporting scheme for optical burst switched networks

In this letter, we analyze the drawback of tail-dropping contention resolution in optical burst switched networks. Once contention occurs, we adopt modified head-dropping policy to resolve contention. This policy drops the head of the contending burst only if the overlapping region of the two bursts is less than the whole contending burst size, otherwise drops the whole contending burst. In order to have a better support of differentiated service, a new burst assembly policy, namely, Priority-based proportional mixed burst assembly, is proposed. Simulation results show that the proposed scheme performs very well in terms of performance metrics such as the times of contention and packet loss probability.

Priority-Based Mixed Assembly Supporting Differentiated Service for Optical Burst Switched Networks

In order to have a better support of differentiated service, we propose Priority-based mixed burst assembly, in which packets of different priorities are assembled in a burst with an assigned proportion, and the priorities are lined in an ascending order in a burst from head to tail. Simulation results show that the proposed scheme performs very well in terms of latency and packet loss probability.

Performance Analysis of DEBT Routing Protocols for Pocket Switch Networks

Pocket Switched Networks(PSN)represent a particular remittent network for direct communication between the handheld mobile devices.Compared to traditional networks,there is no stable topology structure for PSN where the nodes observe the mobility model of human society.It is a kind of Delay Tolerant Networks(DTNs)that gives a description to circulate information among the network nodes by the way of taking the benefit of transferring nodes from one area to another.Considering its inception,there are several schemes for message routing in the infrastructure-less environment in which human mobility is only the best manner to exchange information.For routing messages,PSN uses different techniques such asDistributed Expectation-Based Spatio-Temporal(DEBT)Epidemic(DEBTE),DEBT Cluster(DEBTC),and DEBT Tree(DEBTT).Understanding on how the network environment is affected for these routing strategies are the main motivation of this research.In this paper,we have investigated the impact of network nodes,the message copies per transmission,and the overall carrying out of these routing protocols.ONE simulator was used to analyze those techniques on the basis of delivery,overhead,and latency.The result of this task demonstrates that for a particular simulation setting,DEBTE is the best PSN routing technique among all,against DEBTC and DEBTT.

Stability of multiple fans in mine ventilation networks

In large mines,single fan is usually not enough to ventilate all the working areas.Single mine-fan approach cannot be directly applied to multiple-fan networks because the present of multiple pressures and air quantities associated with each fan in the network.Accordingly,each fan in a multiple-fan system has its own mine characteristic curve,or a subsystem curve.Under some consideration,the conventional concept of a mine characteristic curve of a single-fan system can be directly extended to that of a particular fan within a multiple-fan system.In this paper the mutual effect of the fans on each other and their effect on the stability of the ventilation network were investigated by Hardy Cross algorithm combined with a switching-parameters technique.To show the validity and reliability of this algorithm,the stability of the ventilation system of Abu-Tartur Mine(one of the largest underground mine in Egypt)has been studied.

Network Resource Provisioning for IP over Multi-Granular Optical Networks

In the internet protocol（IP） over multi-granular optical switch network （IP/MG-OXC）, the network node is a typical multilayer switch comprising several layers, the IP packet switching （PXC） layer, wavelength switching （WXC） layer and fiber switching （FXC） layer. This network is capable of both IP layer grooming and wavelength grooming in a hierarchical manner. Resource provisioning in the multi-granular network paradigm is called hierarchical grooming problem. An integer linear programming （ILP） model is proposed to formulate the problem. An iterative heuristic approach is developed for solving the problem in large networks. Case study shows that IP/MG-OXC network is much more extendible and can significantly save the overall network cost as compared with IP over wavelength division multiplexing network.

Discontinuous event-trigger scheme for global stabilization of state-dependent switching neural networks with communication delay

This paper is concerned with the global stabilization of state-dependent switching neural networks(SDSNNs)viadiscontinuous event-triggered control with network-induced communication delay.Aiming at decreasing triggering times,a discontinuous event-trigger scheme is utilized to determine whether the sampling information is required to be sent outor not.Meanwhile,under the effect of communication delay,the trigger condition and SDSNNs are transformed into twotractable models by designing a fictitious delay function.Then,using the Lyapunov–Krasovskii stability theory,someinequality estimation techniques,and extended reciprocally convex combination method,two sufficient criteria are established for ensuring the global stabilization of the resulting closed-loop SDSNNs,respectively.A unified framework isderived that has the ability to handle the simultaneous existence of the communication delay,the properties of discontinuousevent-trigger scheme,as well as feedback controller design.Additionally,the developed results demonstrate a quantitativerelationship among the event trigger parameter,communication delay,and triggering times.Finally,two numerical examples are presented to illustrate the usefulness of the developed stabilization scheme.

A Service Ratio-Based Dynamic Fair Queueing Algorithm for Packet-Switching Networks

A new weighted fair queueing algorithm is proposed, which uses the novel flow-based service ratio parameters to schedule flows. This solves the main drawback of traditional weighted fair queneing algorithms- the packet-based calculation of the weight parameters. In addition, this paper proposes a novel service ratio calculation method and a queue mangement technology. The former adjusts the service ratio parameters adaptively based on the dynamics of the packet lengths and thee solves the unfairness problem induced by the variable packet length. The latter improves the utilization of the server＇s queue buffer and reduces the delay jitter through restricting the buffer length for each flow.

An Arrangement of Channels and Transceivers in Optical Packet Switching Networks

Based on a media access and control（MAC）protocol,an arrangement of channels and transceivers in optical packet switching dense wavelength division multiplexing（DWDM）networks is proposed in this paper.In order to reduce the cost of nodes,fixed transmitters and receivers are used instead of tunable transmitters and receivers.Two fixed transmitters and many fixed receivers are used in each node in the scheme.The average waiting delay of this scheme is analyzed through mathematics and computer simulation.The result shows that the property of the scheme is almost the same as using tunable transmitter and receiver.Furthermore,if the tuning time of tunable transmitters is taken into account,the performance of the tunable transmitter scheme is poor than this scheme at the average waiting delay and throughput of the network.

N×N Clos Digital Cross-Connect Switch Using Quantum Dot Cellular Automata(QCA)

Quantum dot cellular automata(QCA)technology is emerging as a future technology which designs the digital circuits at quantum levels.The tech-nology has gained popularity in terms of designing digital circuits,which occupy very less area and less power dissipation in comparison to the present comple-mentary metal oxide semiconductor(CMOS)technology.For designing the rou-ters at quantum levels with non-blocking capabilities various multi-stage networks have been proposed.This manuscript presents the design of the N×NClos switch matrix as a multistage interconnecting network using quantum-dot cellular automata technology.The design of the Clos switch matrix presented in the article uses three input majority gates(MG).To design the 4×4 Clos switch matrix,a basic 2×2 switch architecture has been proposed as a basic mod-ule.The 2×2 switching matrix(SM)design presented in the manuscript utilizes three input majority gates.Also,the 2×2 SM has been proposed usingfive input majority gates.Two different approaches(1&2)have been presented for designing 2×2 SM usingfive input majority gates.The 2×2 SM design based on three input majority gate utilizes four zone clocking scheme to allow signal transmis-sion.Although,the clocking scheme used in 2×2 SM using three input MG and in 2×2 SM approach 1 usingfive input MG is conventional.The 2×2 SM approach 2 design,utilizes the clocking scheme in which clocks can be applied by electricfield generators easily and in turn the switch element becomes physically realizable.The simulation results conclude that the 2×2 SM is suitable for designing a 4×4 Clos network.A higher order of input-output switching matrix,supporting more number of users can utilize the proposed designs.

Robust Feedback Set Stabilization of Logic Networks with State-Dependent Uncertain Switching and Control Constraints

This study investigates the robust feedback set stabilization of switched logic control networks(SLCNs)with state-dependent uncertain switching and control constraints.First,based on the properties of the semi-tensor product of matrices and the vector representation of logic,an SLCN with state-dependent uncertain switching and control constraints is expressed in algebraic form.Second,an input transformation and a switching model are constructed to transfer the original SLCN into one with a free control input and arbitrary switching.The equivalence between the set stabilizability of the original SLCN and that of the resulting SLCN is established.Based on such equivalence,the authors propose a necessary and sufficient condition for robust feedback set stabilizability.Finally,an example is presented to demonstrate the application of the results obtained.

Exponential H_∞ filtering analysis for discrete-time switched neural networks with random delays using sojourn probabilities

This paper is concerned with the exponential H_∞ filtering problem for a class of discrete-time switched neural networks with random time-varying delays based on the sojourn-probability-dependent method. Using the average dwell time approach together with the piecewise Lyapunov function technique, sufficient conditions are proposed to guarantee the exponential stability for the switched neural networks with random time-varying delays which are characterized by introducing a Bernoulli stochastic variable.Based on the derived H_∞ performance analysis results, the H_∞ filter design is formulated in terms of Linear Matrix Inequalities(LMIs). Finally, two numerical examples are presented to demonstrate the effectiveness of the proposed design procedure.

Synchronization of switched Boolean networks with impulsive effects

This paper studies the state/output synchronization of switched Boolean networks （SBNs） with impulsive effects via the algebraic state space representation （ASSR） approach. First, an algebraic form is established for SBNs with impulsive effects via ASSR. Second, based on the algebraic form, some necessary and sufficient conditions are presented for the state/output synchronization of SBNs with impulsive effects under arbitrary switching signals. Third, two special kinds of switching signals, that is, free switching signal and feedback switching signal, are considered for the state synchroniza-tion of SBNs with impulsive effects. Finally, two illustrative examples are worked out to show the effectiveness of the obtained results.

A Universal Hybrid Precoding Scheme for Massive MIMO Communications

Based on an analog radio frequency(RF)network,hybrid precoding(HPC)for massive MIMO can achieve very high spectral efficiencies with moderate hardware cost and power consumption.Despite the extensive research efforts in recent years,the practioners are still looking for HPCs that are efficient and easy-to-implement.In this paper,we present a new method termed as the universal hybrid precoding(UHP),which is nearly optimal,computationally efficient,and applicable to various types of RF network(thus,the name universal):the components of the network can be phase shifters(with finite or infinite resolutions),switches,or their combinations;the topology of the network can be fully-connected or partiallyconnected.Besides the standard UHP,we also propose a simplified version termed as sUHP to trade a negligible performance loss for much reduced computational complexity.The analysis shows that the computational complexity of the proposed UHP/sUHP is one to two orders of magnitude lower than the state-of-theart methods.Simulation results verify the(near-)optimality of the proposed UHP scheme for various forms of the analog networks.

An Interconnected Multi-Plane Multi-Stage Fault-Tolerant On-Board Switching Fabric

The harsh space radiation environment compromises the reliability of an on-board switching fabric by leading to cross-point and switching element(SE)faults.Different from traditional faulttolerant switching fabrics only taking crosspoint faults into account,a novel Input and Output Parallel Clos network,referred to as the(p_1,p_2)-IOPClos,is proposed to tolerate both cross-point and SE faults.In the(p_1,p_2)-IOPClos,there are p_1 and p_2 expanded parallel switching planes in the input and output stages,respectively.The multiple input/output switching planes are interconnected through the middle stage to provide multiple paths in each stage by which the network throughput can be increased remarkably.Furthermore,the network reliability of the(p_1,p_2)-IOPClos under the above both kinds of faults is analyzed.The corresponding implementation cost is also presented along with the network size.Both theoretical analysis and numerical results indicate that the(p_1,p_2)-IOPClos outperforms traditional Clos-type networks at reliability,while has less implementation cost than the multi-plane Clos network.

Heralded linear optical quantum Fredkin gate based on one auxiliary qubit and one single photon detector

Linear optical quantum Fredkin gate can be applied to quantum computing and quantum multi-user communication networks. In the existing linear optical scheme, two single photon detectors （SPDs） are used to herald the success of the quantum Fredkin gate while they have no photon count. But analysis results show that for non-perfect SPD, the lower the detector efficiency, the higher the heralded success rate by this scheme is. We propose an improved linear optical quantum Fredkin gate by designing a new heralding scheme with an auxiliary qubit and only one SPD, in which the higher the detection efficiency of the heralding detector, the higher the success rate of the gate is. The new heralding scheme can also work efficiently under a non-ideal single photon source. Based on this quantum Fredkin gate, large-scale quantum switching networks can be built. As an example, a quantum Bene~ network is shown in which only one SPD is used.

Implementing an Artificial Neural Network Computer

Based on the implementation of NNSPC (Neural NetWork Synchronous Parallel Computer) developed by NJU, this paper discusses two schemes for implementing artificial neural network computer withdistributed memories: One is Switch Network Structure; the other is Ring Topology Structure. This papergives a comparison betWeen the two schemes and the principles of scheme selection.

Preventing Hardware Trojans in Switch Chip Based on Payload Decoupling

Hardware Trojans in integrated circuit chips have the characteristics of being covert,destructive,and difficult to protect,which have seriously endangered the security of the chips themselves and the information systems to which they belong.Existing solutions generally rely on passive detection techniques.In this paper,a hardware Trojans active defense mechanism is designed for network switching chips based on the principle of encryption algorithm.By encoding the data entering the chip,the argot hidden in the data cannot trigger the hardware Trojans that may exist in the chip,so that the chip can work normally even if it is implanted with a hardware Trojans.The proposed method is proved to be effective in preventing hardware Trojans with different trigger characteristics by simulation tests and practical tests on our secure switching chip.

Analysis of Call Drop Problem for Remote Access Server on Server Side

Call drop is one of the most common problems encountered by ISP with PSTN access. In this pacer several reasons on server side that cause modem disconnection are analyzed. In the last part of this paper, some solutions are Put forward to reduce call drop rate.

Optical SDMA for applying compressive sensing in WSN

In order to apply compressive sensing in wireless sensor network, inside the nodes cluster classified by the spatial correlation, we propose that a cluster head adopts free space optical communication with space division multiple access, and a sensor node uses a modulating retro-reflector for communication. Thus while a random sampling matrix is used to guide the establishment of links between head cluster and sensor nodes, the random linear projection is accomplished. To establish multiple links at the same time, an optical space division multiple access antenna is designed. It works in fixed beams switching mode and consists of optic lens with a large field of view（FOV）, fiber array on the focal plane which is used to realize virtual channels segmentation, direction of arrival sensor, optical matrix switch and controller. Based on the angles of nodes＇ laser beams, by dynamically changing the route, optical matrix switch actualizes the multi-beam full duplex tracking receiving and transmission. Due to the structure of fiber array, there will be several fade zones both in the focal plane and in lens＇ FOV. In order to lower the impact of fade zones and harmonize multibeam, a fiber array adjustment is designed. By theoretical, simulated and experimental study, the antenna＇s qualitative feasibility is validated.