Dynamic prediction models and optimization of polyacrylonitrile (PAN) stabilization processes for production of carbon fiber

Thermal stabilization process of polyacrylonitrile (PAN) is the slowest and the most energy-consuming step in carbon fiber production. As such, in industrial production of carbonfiber, this step is considered as amajor bottleneck in the whole process. Stabilization process parameters are usually many in number and highly constrained, leading to high uncertainty. The goal of this paper is to study and analyze the carbon fiber thermal stabilization process through presenting several effective dynamic models for the prediction of the process. The key point with using dynamic models is that using an evolutionary search technique, the heat of reaction can be optimized. The employed components of the study are Levenberg–Marquardt algorithm (LMA)-neural network (LMA-NN), Gauss–Newton (GN)-curve fitting, Taylor polynomial method, and a genetic algorithm. The results show that the procedure can effectively optimize a given PAN fiber heat of reaction based on determining the proper values of heating rampand temperature

Data mining via minimal spanning tree clustering for prolonging lifetime of wireless sensor networks

Clustering is applied in wireless sensor networks for increasing energy efficiency. Clustering methods in wireless sensor networks are different from those in traditional data mining systems. This paper proposes a novel clustering algorithm based on Minimal Spanning Tree (MST) and Maximum Energy resource on sensors named MSTME. Also, specified constrains of clustering in wireless sensor networks and several evaluation metrics are given. MSTME performs better than already known clustering methods of Low Energy Adaptive Clustering Hierarchy (LEACH) and Base Station Controlled Dynamic Clustering Protocol (BCDCP) in wireless sensor networks when they are evaluated by these evaluation metrics. Simulation results show MSTME increases energy efficiency and network lifetime compared with LEACH and BCDCP in two-hop and multi-hop networks, respectively. © World Scientific Publishing Company.

Delay tolerant networks

The delay-tolerant networks (DTNs) are emerging research topics that have attracted keen research efforts from both academia and industry. Different from the traditional communication networks, DTNs consider an extreme network condition where a complete end-to-end path between the data source and destination may not exist, and the network is subject to dynamic node connections and unstable topologies. With the above features, DTNs find broad applications in the situations where legacynetworks cannot work effectively, such as data communications in rural areas, where stable communications infrastructure is not available or costly, and crucial areas, e.g., disaster rescue and battlefield communications. To summarize, the DTNs, as an important technology complementary to traditional networkings, can be widely applied to national welfare and the people’s livelihood.

Trajectory Privacy Preservation in Mobile Wireless Sensor Networks

In recent years, there has been an enormous growth of location-aware devices, such as GPS embedded cell phones, mobile sensors and radio-frequency identification tags. The age of combining sensing, processing and communication in one device, gives rise to a vast number of applications leading to endless possibilities and a realization of mobile Wireless Sensor Network (mWSN) applications. As computing, sensing and communication become more ubiquitous, trajectory privacy becomes a critical piece of information and an important factor for commercial success. While on the move, sensor nodes continuously transmit data streams of sensed values and spatiotemporal information, known as ``trajectory information". If adversaries can intercept this information, they can monitor the trajectory path and capture the location of the source node. This research stems from the recognition that the wide applicability of mWSNs will remain elusive unless a trajectory privacy preservation mechanism is developed. The outcome seeks to lay a firm foundation in the field of trajectory privacy preservation in mWSNs against external and internal trajectory privacy attacks. First, to prevent external attacks, we particularly investigated a context-based trajectory privacy-aware routing protocol to prevent the eavesdropping attack. Traditional shortest-path oriented routing algorithms give adversaries the possibility to locate the target node in a certain area. We designed the novel privacy-aware routing phase and utilized the trajectory dissimilarity between mobile nodes to mislead adversaries about the location where the message started its journey. Second, to detect internal attacks, we developed a software-based attestation solution to detect compromised nodes. We created the dynamic attestation node chain among neighboring nodes to examine the memory checksum of suspicious nodes. The computation time for memory traversal had been improved compared to the previous work. Finally, we revisited the trust issue in trajectory privacy preservation mechanism designs. We used Bayesian game theory to model and analyze cooperative, selfish and malicious nodes' behaviors in trajectory privacy preservation activities.

Flexible Power Control of Photovoltaic Plants Connected to Distribution Networks

This paper presents a system to control the power injected by a photovoltaic (PV) plant on the receiving network. This control is intended to mitigate some of the negative impacts that these units may produce on such networks, while increasing the installed power of the plant. The controlled parameters are the maximum allowed value of injected active power and the corresponding power factor, whose setpoints values may be fixed or dynamic. The developed system allows a local and a remote control. The injected power and the corresponding power factor may be set by following a predetermined profile or by real time adjustments to fulfill specific operation constraints on the receiving network. The system acts by adjusting the control parameters on the PV inverters. The main goal of the system is, in the end, to control the PV plant, ensuring the accomplishment of technical constraints and, at the same time, maximizing the installed power of the PV plant, which may be an important issue concerning the economic performance of such plants

Processing and additive manufacturing of bones for the teaching of human anatomy

Traditionally, the teaching of human anatomy in health sciences has been based on the use of cadaveric material and bone parts for practical study. The bone materials get deteriorated and hardly mark the points of insertion of muscles. However, the advent of new technologies for 3D printing and creation of 3D anatomical models applied to teaching, has enabled to overcome these problems making teaching more dynamic, realistic and attractive. This paper presents some examples of the construction of three-dimensional models of bone samples, designed using 3D scanners for posterior printing with addition printers or polymer injection printers.

Time cumulative complexity modeling and analysis for space-based networks

In this paper, the notion of the cumulative time varying graph (C-TVG) is proposed to model the high dynamics and relationships between ordered static graph sequences for space-based information networks (SBINs). In order to improve the performance of management and control of the SBIN, the complexity and social properties of the SBIN's high dynamic topology during a period of time is investigated based on the proposed C-TVG. Moreover, a cumulative topology generation algorithm is designed to establish the topology evolution of the SBIN, which supports the C-TVG based complexity analysis and reduces network congestions and collisions resulting from traditional link establishment mechanisms between satellites. Simulations test the social properties of the SBIN cumulative topology generated through the proposed C-TVG algorithm. Results indicate that through the C-TVG based analysis, more complexity properties of the SBIN can be revealed than the topology analysis without time cumulation. In addition, the application of attack on the SBIN is simulated, and results indicate the validity and effectiveness of the proposed C-TVG and C-TVG based complexity analysis for the SBIN.

Streaming analysis in wireless sensor networks

Two new incremental models for online anomaly detection in data streams at nodes in wireless sensor networks are discussed. These models are incremental versions of a model that uses ellipsoids to detect first, second, and higher-ordered anomalies in arrears. The incremental versions can also be used this way but have additional capabilities offered by processing data incrementally as they arrive in time. Specifically, they can detect anomalies 'on-the-fly' in near real time. They can also be used to track temporal changes in near real-time because of sensor drift, cyclic variation, or seasonal changes. One of the new models has a mechanism that enables graceful degradation of inputs in the distant past (fading memory). Three real datasets from single sensors in deployed environmental monitoring networks are used to illustrate various facets of the new models. Examples compare the incremental version with the previous batch and dynamic models and show that the incremental versions can detect various types of dynamic anomalies in near real time.

Network coding based converge-cast scheme in wireless sensor networks

The converge-cast in wireless sensor networks (WSNs) is widely applied in many fields such as medical applications and the environmental monitoring. WSNs expect not only providing routing with high throughput but also achieving efficient energy saving. Network coding is one of the most promising techniques to reduce the energy consumption. By maximizing the encoding number, the message capacity per package can be extended to the most efficient condition. Thus, many researchers have focused their work on this field. Nevertheless, the packages sent by the outer nodes need to be temporary stored and delayed in order to maximize the encoding number. To find out the balance between inserting the delay time and maximizing the encoding number, a Converge-cast Scheme based on data collection rate prediction (CSRP) is proposed in this paper. To avoid producing the outdated information, a prediction method based on Modifying Index Curve Model is presented to deal with the dynamic data collection rate of every sensor in WSNs. Furthermore, a novel coding conditions based on CDS is proposed to increase the coding opportunity and to solve the collision problems. The corresponding analysis and experimental results indicate that the feasibility and efficiency of the CSRP is better than normal conditions without the prediction.

Traffic matrix prediction and estimation based on deep learning in large-scale IP backbone networks

Network traffic analysis has been one of the most crucial techniques for preserving a large-scale IP backbone network. Despite its importance, large-scale network traffic monitoring techniques suffer from some technical and mercantile issues to obtain precise network traffic data. Though the network traffic estimation method has been the most prevalent technique for acquiring network traffic, it still has a great number of problems that need solving. With the development of the scale of our networks, the level of the ill-posed property of the network traffic estimation problem is more deteriorated. Besides, the statistical features of network traffic have changed greatly in terms of current network architectures and applications. Motivated by that, in this paper, we propose a network traffic prediction and estimation method respectively. We first use a deep learning architecture to explore the dynamic properties of network traffic, and then propose a novel network traffic prediction approach based on a deep belief network. We further propose a network traffic estimation method utilizing the deep belief network via link counts and routing information. We validate the effectiveness of our methodologies by real data sets from the Abilene and GÉANT backbone networks.

Integration of process planning and scheduling using mobile-agent based approach in a networked manufacturing environment

Effective and efficient implementation of intelligent and/or recently emerged networked manufacturing systems require an enterprise level integration. The networked manufacturing offers several advantages in the current competitive atmosphere by way to reduce, by shortening manufacturing cycle time and maintaining the production flexibility thereby achieving several feasible process plans. The first step in this direction is to integrate manufacturing functions such as process planning and scheduling for multi-jobs in a network based manufacturing system. It is difficult to determine a proper plan that meets conflicting objectives simultaneously. This paper describes a mobile-agent based negotiation approach to integrate manufacturing functions in a distributed manner; and its fundamental framework and functions are presented. Moreover, ontology has been constructed by using the Protégé software which possesses the flexibility to convert knowledge into Extensible Markup Language (XML) schema of Web Ontology Language (OWL) documents. The generated XML schemas have been used to transfer information throughout the manufacturing network for the intelligent interoperable integration of product data models and manufacturing resources. To validate the feasibility of the proposed approach, an illustrative example along with varied production environments that includes production demand fluctuations is presented and compared the proposed approach performance and its effectiveness with evolutionary algorithm based Hybrid Dynamic-DNA (HD-DNA) algorithm. The results show that the proposed scheme is very effective and reasonably acceptable for integration of manufacturing functions.