应用技术型本科院校计算机学科教学团队建设研究

试图在新的背景和形式下借鉴团队的理念,从计算机学科的应用特性出发,尝试讨论在新时期应用技术型本科院校计算机学科教学团队建设的定义,重新整理了团队的"5P"组合,以期望能够以计算机学科教学团队的建设为点,从而促进本学科的快速、稳步转型。

An efficient reliability evaluation method for industrial wireless sensor networks

Aimed at the difficulties in accurately, comprehensively and systematically evaluating the reliability of industrial wireless sensor networks （WSNs）, a time-evolving state transition-Monte Carlo （TEST-MC） evaluation method and a novel network function value representation method are proposed to evaluate the reliability of the IWSNs. First, the adjacency matrix method is used to characterize three typical topologies of WSNs including the mesh network, tree network and ribbon network. Secondly, the network function value method is used to evaluate the network connectivity, and the TEST-MC evaluation method is used to evaluate network reliability and availability. Finally, the variations in the reliability, connectivity and availability of these three topologies are presented. Simulation results show that the proposed method can quickly analyze the reliability of the networks containing typical WSN topologies, which provides an effective method for the comprehensive and accurate evaluation of the reliability of WSNs.

Survivable Virtual Network Mapping Using Optimal Backup Topology in Virtualized SDN

Software-Defined Network architecture offers network virtualization through a hypervisor plane to share the same physical substrate among multiple virtual networks. However, for this hypervisor plane, how to map a virtual network to the physical substrate while guaranteeing the survivability in the event of failures, is extremely important. In this paper, we present an efficient virtual network mapping approach using optimal backup topology to survive a single link failure with less resource consumption. Firstly, according to whether the path splitting is supported by virtual networks, we propose the OBT-I and OBT-II algorithms respectively to generate an optimal backup topology which minimizes the total amount of bandwidth constraints. Secondly, we propose a Virtual Network Mapping algorithm with coordinated Primary and Backup Topology （VNM-PBT） to make the best of the substrate network resource. The simulation experiments show that our proposed approach can reduce the average resource consumption and execution time cost, while improving the request acceptance ratio of VNs.

Simultaneous Optimization of Synthesis and Scheduling of Cleaning in Flexible Heat Exchanger Networks

A novel methodology is presented for simultaneously optimizing synthesis and cleaning schedule of flexible heat exchanger network(HEN)by genetic/simulated annealing algorithms(GA/SA).Through taking into account the effect of fouling process on optimal network topology,a preliminary network structure possessing two-fold oversynthesis is obtained by means of pseudo-temperature enthalpy(T-H)diagram approach prior to simultaneous optimization.Thus,the computational complexity of this problem classified as NP(Non-deterministic Polynomial)-complete can be significantly reduced.The promising matches resulting from preliminary synthesis stage are further optimized in parallel with their heat exchange areas and cleaning schedule.In addition,a novel continu- ous time representation is introduced to subdivide the given time horizon into several variable-size intervals according to operating periods of heat exchangers,and then flexible HEN synthesis can be implemented in dynamic manner.A numerical example is provided to demonstrate that the presented strategy is feasible to decrease the total annual cost(TAC)and further improve network flexibility,but even more important,it may be applied to solve large-scale flexible HEN synthesis problems.

PTCP Incast in Data Center Networks

In recent years,dual-homed topologies have appeared in data centers in order to offer higher aggregate bandwidth by using multiple paths simultaneously.Multipath TCP(MPTCP) has been proposed as a replacement for TCP in those topologies as it can efficiently offer improved throughput and better fairness.However,we have found that MPTCP has a problem in terms of incast collapse where the receiver suffers a drastic goodput drop when it simultaneously requests data over multiple servers.In this paper,we investigate why the goodput collapses even if MPTCP is able to actively relieve hot spots.In order to address the problem,we propose an equally-weighted congestion control algorithm for MPTCP,namely EW-MPTCP,without need for centralized control,additional infrastructure and a hardware upgrade.In our scheme,in addition to the coupled congestion control performed on each subflow of an MPTCP connection,we allow each subflow to perform an additional congestion control operation by weighting the congestion window in reverse proportion to the number of servers.The goal is to mitigate incast collapse by allowing multiple MPTCP subflows to compete fairly with a single-TCP flow at the shared bottleneck.The simulation results show that our solution mitigates the incast problem and noticeably improves goodput in data centers.

Intrusion Detection for Wireless Mesh Networks using Finite State Machine

Wireless Mesh Networks is vulnerable to attacks due to the open medium, dynamically changing network topology, cooperative algorithms, Lack of centralized monitoring and management point. The traditional way of protecting networks with firewalls and encryption software is no longer suffi- cient and effective for those features. In this paper, we propose a distributed intrusion detection ap- proach based on timed automata. A cluster-based detection scheme is presented, where periodically a node is elected as the monitor node for a cluster. These monitor nodes can not only make local intrusion detection decisions, but also cooperatively take part in global intrusion detection. And then we con- struct the Finite State Machine （FSM） by the way of manually abstracting the correct behaviors of the node according to the routing protocol of Dynamic Source Routing （DSR）. The monitor nodes can verify every node＇s behavior by the Finite State Ma- chine （FSM）, and validly detect real-time attacks without signatures of intrusion or trained data.Compared with the architecture where each node is its own IDS agent, our approach is much more efficient while maintaining the same level of effectiveness. Finally, we evaluate the intrusion detection method through simulation experiments.

Coherence Resonance and Noise-Induced Synchronization in Hindmarsh-Rose Neural Network with Different Topologies

In this paper, we investigate coherence resonance （CR） and noise-induced synchronization in Hindmarsh- Rose （HR） neural network with three different types of topologies： regular, random, and small-world. It is found that the additive noise can induce CR in HR neural network with different topologies and its coherence is optimized by a proper noise level. It is also found that as coupling strength increases the plateau in the measure of coherence curve becomes broadened and the effects of network topology is more pronounced simultaneously. Moreover, we find that increasing the probability p of the network topology leads to an enhancement of noise-induced synchronization in HR neurons network.

A Topology-Cognitive Algorithm Framework for Virtual Network Embedding Problem

The virtual network embedding/mapping problem is an important issue in network virtualization in Software-Defined Networking(SDN).It is mainly concerned with mapping virtual network requests,which could be a set of SDN flows,onto a shared substrate network automatically and efficiently.Previous researches mainly focus on developing heuristic algorithms for general topology virtual network.In practice however,the virtual network is usually generated with specific topology for specific purpose.Thus,it is a challenge to optimize the heuristic algorithms with these topology information.In order to deal with this problem,we propose a topology-cognitive algorithm framework,which is composed of a guiding principle for topology algorithm developing and a compound algorithm.The compound algorithm is composed of several subalgorithms,which are optimized for specific topologies.We develop star,tree,and ring topology algorithms as examples,other subalgorithms can be easily achieved following the same framework.The simulation results show that the topology-cognitive algorithm framework is effective in developing new topology algorithms,and the developed compound algorithm greatly enhances the performance of the Revenue/Cost(R/C) ratio and the Runtime than traditional heuristic algorithms for multi-topology virtual network embedding problem.

Implementation and comparative testing of turn-based algorithm for logit network loading

In order to evaluate the practicality and effectiveness of the turn-based algorithm for logit loading （TALL）, the TALL is implemented using C＋＋, and it is compared with a combination of the network-expanding method and the Dial algorithm based on the analysis of algorithm procedures. The TALL uses the arc-labeling shortest path searching, bidirectional star and the deque structure to directly assign the traffic flow, while the Dial algorithm should be used in an expanded network. The test results over realistic networks of eight cities show the superior performance of the TALL algorithm over the combination of the network-expanding method and the Dial algorithm, and the average processing time is reduced by 55. 4%. Furthermore, it is found that the operational efficiency of the TALL relates to the original densities of the cities. The average processing time is reduced by 65. 1% when the original density is about 14%, but the advantage of the TALL is not obvious with the increase in the original density.

Reducing energy consumption optimization selection of path transmission routing algorithm in opportunistic networks

Opportunistic networks are random networks and do not communicate with each other among respective communication areas.This situation leads to great difficulty in message transfer.This paper proposes a reducing energy consumption optimal selection of path transmission(OSPT) routing algorithm in opportunistic networks.This algorithm designs a dynamic random network topology,creates a dynamic link,and realizes an optimized selected path.This algorithm solves a problem that nodes are unable to deliver messages for a long time in opportunistic networks.According to the simulation experiment,OSPT improves deliver ratio,and reduces energy consumption,cache time and transmission delay compared with the Epidemic Algorithm and Spray and Wait Algorithm in opportunistic networks.

Modeling of Malicious Code Propagations in Internet of Things

Nowadays, the main communication object of Internet is human-human. But it is foreseeable that in the near future any object will have a unique identification and can be addressed and con- nected. The Internet will expand to the Internet of Things. IPv6 is the cornerstone of the Internet of Things. In this paper, we investigate a fast active worm, referred to as topological worm, which can propagate twice to more than three times faster tl^an a traditional scan-based worm. Topological worm spreads over AS-level network topology, making traditional epidemic models invalid for modeling the propagation of it. For this reason, we study topological worm propagation relying on simulations. First, we propose a new complex weighted network mod- el, which represents the real IPv6 AS-level network topology. And then, a new worm propagation model based on the weighted network model is constructed, which descries the topological worm propagation over AS-level network topology. The simulation results verify the topological worm model and demonstrate the effect of parameters on the propagation.

A Frameless Network Architecture for the Way Forward of C-RAN

The key technologies involved in the evolution of the Cloud-based Radio Access Network(C-RAN) are discussed in this paper. Taking the Frameless Network Architecture(FNA) as a starting point, a cell-lessbased network topology for a multi-tier Heterogeneous Network(Het Net) and ultra-dense network is proposed. The FNA network topology modeling is researched with centralized processing and distributed antenna deployments. The Antenna Element(AE) is released as a new dimensional radio resource that is included in the centralized Radio Resource Management(RRM) processes. This contributes to the on-demand user-centric serving-set associations with cell-edge effect elimination. The Control Plane(CP) and User Plane(UP) separation and adaptation are introduced for energy efficiency improvements. The centralized RRM and different optimization goals are discussed for fully exploring the merits from the centralized computing of C-RAN. Considering the complexity, near-optimal approaches for specific users' Quality-of-Service(Qo S) requirements are addressed. Finally, based on the research highlighted above, the way forward of C-RAN evolution is discussed.

Analysis on Refinery System as a Complex Task-resource Network

Refinery system, a typical example of process systems, is presented as complex network in this paper. The topology of this system is described by task-resource network and modeled as directed and weighted graph, in which nodes represent various tasks and edges denote the resources exchanged among tasks. Using the properties of node degree distribution, strength distribution and other weighted quantities, we demonstrate the heterogeneity of the network and point out the relation between structural characters of vertices and the functionality of correspond- ing tasks. The above phenomena indicate that the design requirements and principles of production process contrib- ute to the heterogeneous features of the network. Besides, betweenness centrality of nodes can be used as an impor- tance indicator to provide additional information for decision making. The correlations between structure and weighted properties are investigated to further address the influence brought by production schemes in system con- nectivity patterns. Cascading failures model is employed to analyze the robustness of the network when targeted at- tack happens. Two capacity assignment strategies are compared in order to improve the robustness of the network at certain cost. The refinery system displays more reliable behavior when the protecting strategy considers heteroge- neous properties. This phenomenon further implies the structure-activity relationship of the refinery system and provides insightful suggestions for process system design. The results also indicate that robustness analysis is a _promising applicat!on of methodologies from complex networks to process system engineering..

Optimal control of end-port glass tank furnace regenerator temperature based on artificial neural network

In the paper, an artificial neural network (ANN) method is put forward to optimize melting temperature control, which reveals the nonlinear relationships of tank melting temperature disturbances with secondary wind flow and fuel pressure, implements dynamic feed-forward complementation and dynamic correctional ratio between air and fuel in the main control system. The application to Anhui Fuyang Glass Factory improved the control character of the melting temperature greatly.

Alternate solutions for mine ventilation network to keep a preassigned fixed quantity in a working place

In underground constructions, a good ventilation design not only delivers fresh air to establish good working environment, but also provides a scientific and reliable basis to prevent disasters. In emergency cases, unexpected closure of the main airways may occur, providing the workers with alternative airways is substantial. This is important not only to sustain personnel lives, but also to prevent the mine ventilation system from damage. In this research, alternate solutions were introduced in case of failure in the underground construction to keep a pre-assigned fixed quantity in a working place for mine ventilation network. Eight different collapse scenarios were proposed to study their effect on the air quantity distribution among the branches in the ventilation circuit. From these scenarios, it is found that providing a sufficient air quantity in the working places could be achieved through modification of the network topology and adjusting the values of the regulators pressure. It is also indicated that the distance between the collapse and working places has a great effect on the amount of air delivered to it. A reduction in the power consumption could be done by re-arrange the installed regulators and decreasing the number of nodes and branches inside the network. A relationship representing the effect of changing the network topology on the total network power consumption was deduced through regression analysis. It is found that the total network power is quadratic dependent on the number of regulators and number of branches while it is directly dependent on the regulator power.

Local adaptive transmit power assignment strategy for wireless sensor networks

A distributed local adaptive transmit power assignment (LA-TPA) strategy was proposed to construct a topology with better performance according to the environment and application scenario and prolong the network lifetime.It takes the path loss exponent and the energy control coefficient into consideration with the aim to accentuate the minimum covering district of each node more accurately and precisely according to various network application scenarios.Besides,a self-healing scheme that enhances the robustness of the network was provided.It makes the topology tolerate more dead nodes than existing algorithms.Simulation was done under OMNeT++ platform and the results show that the LA-TPA strategy is more effective in constructing a well-performance network topology based on various application scenarios and can prolong the network lifetime significantly.

SAFE:a Scalable Filter-Based Packet Filtering Scheme

Recently, attacks have become Denial-of-Service （DOS） the mainstream threat to the internet service availability. The filter-based packet filtering is a key technology to defend against such attacks. Relying on the filtering location, the proposed schemes can be grouped into Victim-end Filtering and Source-end Filtering. The first scheme uses a single filtering router to block the attack flows near the victim, but does not take the factor that the filters are scarce resource into account, which causes the huge loss of legitimate flows; considering each router could contribute a few filters, the other extreme scheme pushes the filtering location back into each attack source so as to obtain ample filters, but this may incur the severe network transmission delay due to the abused filtering routers. Therefore, in this paper, we propose a scalable filter-based packet filtering scheme to balance the number of filtering routers and the available filters. Through emulating DoS scenarios based on the synthetic and real-world Intemet topologies and further implementing the various filter-based packet filtering schemes on them, the results show that our scheme just uses fewer filtering routers to cut off all attack flows while minimizing the loss of legitimate flows.

Fuzzy adaptive learning control network with sigmoid membership function

To get simpler operation in modified fuzzy adaptive learning control network （FALCON） in some engineering application, sigmoid nonlinear function is employed as a substitute of traditional Gaussian membership function. For making the modified FALCON learning more efficient and stable, a simulated annealing （SA） learning coefficient is introduced into learning algorithm. At first, the basic concepts and main advantages of FALCON were briefly reviewed. Subsequently, the topological structure and nodes operation were illustrated; the gradient-descent learning algorithm with SA learning coefficient was derived; and the distinctions between the archetype and the modification were analyzed. Eventually, the significance and worthiness of the modified FALCON were validated by its application to probability prediction of anode effect in aluminium electrolysis cells.

A Router Based Packet Filtering Scheme for Defending Against DoS Attacks

The filter-based reactive packet filtering is a key technology in attack traffic filtering for defending against the Denial-of- Service （DOS） attacks. Two kinds of relevant schemes have been proposed as victim- end filtering and source-end filtering. The first scheme prevents attack traffic from reaching the victim, but causes the huge loss of legitimate flows due to the scarce filters （termed as collateral damages）; the other extreme scheme can obtain the sufficient filters, but severely degrades the network transmission performance due to the abused filtering routers. In this paper, we propose a router based packet filtering scheme, which provides relatively more filters while reducing the quantity of filtering touters. We implement this scheme on the emulated DoS scenarios based on the synthetic and real-world Internet topologies. Our evaluation results show that compared to the previous work, our scheme just uses 20% of its filtering routers, but only increasing less than 15 percent of its collateral damage.

Synchronization Stability in Weighted Complex Networks with Coupling Delays

Realistic networks display not only a complex topological structure, but also a heterogeneous distribution of weights in connection strengths. In addition, the information spreading through a complex network is often associated with time delays due to the finite speed of signal transmission over a distance. Hence, the weighted complex network with coupling delays have meaningful implications in real world, and resultantly gains increasing attention in various fields of science and engineering. Based on the theory of asymptotic stability of linear time-delay systems, synchronization stability of the weighted complex dynamical network with coupling delays is investigated, and simple criteria are obtained for both delay-independent and delay-dependent stabilities of synchronization states. The obtained criteria in this paper encompass the established results in the literature as special cases. Some examples are given to illustrate the theoretical results.