Earthmoving trucks condition level prediction using neural networks

Purpose: The purpose of this paper is to present an artificial neural network (ANN) model that predicts earthmoving trucks condition level using simple predictors; the model’s performance is compared to the respective predictive accuracy of the statistical method of discriminant analysis (DA).

Design/methodology/approach: An ANN-based predictive model is developed. The condition level predictors selected are the capacity, age, kilometers travelled and maintenance level. The relevant data set was provided by two Greek construction companies and includes the characteristics of 126 earthmoving trucks.

Findings: Data processing identifies a particularly strong connection of kilometers travelled and maintenance level with the earthmoving trucks condition level. Moreover, the validation process reveals that the predictive efficiency of the proposed ANN model is very high. Similar findings emerge from the application of DA to the same data set using the same predictors.

Originality/value: Earthmoving trucks’ sound condition level prediction reduces downtime and its adverse impact on earthmoving duration and cost, while also enhancing the maintenance and replacement policies effectiveness. This research proves that a sound condition level prediction for earthmoving trucks is achievable through the utilization of easy to collect data and provides a comparative evaluation of the results of two widely applied predictive methods.

Towards Understanding Man-In-The-Middle Attacks on IEC 60870-5-104 SCADA Networks

This paper investigates cyber attacks on ICS which rely on IEC 60870-5-104 for telecontrol communications. The main focus of the paper is on man-in-the-middle attacks, covering modification and injection of commands, it also details capture and replay attacks. An initial set of attacks are preformed on a local software simulated laboratory. Final experiments and validation of a man-in-the-middle attack are performed in a comprehensive testbed environment in conjunction with an electricity distribution operator.

Connectivity and Physical Activity: Using Footpath Networks to Measure the Walkability of Built Environments

There is now a strong body of research that suggests that the form of the built environment can influence levels of physical activity, leading to an increasing interest in incorporating health objectives into spatial planning and regeneration policies and projects. There have been a number of strands to this research, one of which has sought to develop “objective” measurements of the built environment using Geographic Information Science (GIS) involving measures of connectivity and proximity to compare the relative “walkability” of different neighbourhoods. The development of the “walkability index” (e.g. Leslie et al 2007, Frank et al 2010) has become a popular indicator of spatial distribution of those features of the built environment that are considered to have the greatest positive influence on levels of physical activity. The success of this measure is built on its ability to succinctly capture built environment correlates of physical activity using routinely available spatial data, which includes using road centre lines as a basis of a proxy for connectivity.

This paper discusses two key aspects of the walkability index. First, it follows the suggestion of Chin et al (2008) that the use of a footpath network (where available), rather than road centre lines, may be far more effective in evaluating walkability. This may be particularly important for assessing changes in walkability arising from pedestrian-focused infrastructure projects, such as greenways. Second, the paper explores the implication of this for how connectivity can be measured. The paper takes six different measures of connectivity and first analyses the relationships between them and then tests their correlation with actual levels of physical activity of local residents in Belfast, Northern Ireland. The analysis finds that the best measurements appear to be intersection density and metric reach and uses this finding to discuss the implications of this for developing tools that may better support decision-making in spatial planning.

Probabilistic Inference in Credal Networks: New Complexity Results

Credal networks are graph-based statistical models whose parameters take values in a set, instead of being sharply specified as in traditional statistical models (e.g., Bayesian networks). The computational complexity of inferences on such models depends on the irrelevance/independence concept adopted. In this paper, we study inferential complexity under the concepts of epistemic irrelevance and strong independence. We show that inferences under strong independence are NP-hard even in trees with binary variables except for a single ternary one. We prove that under epistemic irrelevance the polynomial-time complexity of inferences in credal trees is not likely to extend to more general models (e.g., singly connected topologies). These results clearly distinguish networks that admit efficient inferences and those where inferences are most likely hard, and settle several open questions regarding their computational complexity. We show that these results remain valid even if we disallow the use of zero probabilities. We also show that the computation of bounds on the probability of the future state in a hidden Markov model is the same whether we assume epistemic irrelevance or strong independence, and we prove an analogous result for inference in Naive Bayes structures. These inferential equivalences are important for practitioners, as hidden Markov models and Naive Bayes networks are used in real applications of imprecise probability.

Efficient Structure Learning of Bayesian Networks using Constraints

This paper addresses the problem of learning Bayesian network structures from data based on score functions that are decomposable. It describes properties that strongly reduce the time and memory costs of many known methods without losing global optimality guarantees. These properties are derived for different score criteria such as Minimum Description Length (or Bayesian Information Criterion), Akaike Information Criterion and Bayesian Dirichlet Criterion. Then a branch-and-bound algorithm is presented that integrates structural constraints with data in a way to guarantee global optimality. As an example, structural constraints are used to map the problem of structure learning in Dynamic Bayesian networks into a corresponding augmented Bayesian network. Finally, we show empirically the benefits of using the properties with state-of-the-art methods and with the new algorithm, which is able to handle larger data sets than before.

Location-Awareness for Radios and Networks: Part I

The papers in this special issue focus on the topic of location awareness for radio and networks. Localization-awareness using radio signals stands to revolutionize the fields of navigation and communication engineering. It can be utilized to great effect in the next generation of cellular networks, mining applications, health-care monitoring, transportation and intelligent highways, multi-robot applications, first responders operations, military applications, factory automation, building and environmental controls, cognitive wireless networks, commercial and social network applications, and smart spaces. A multitude of technologies can be used in location-aware radios and networks, including GNSS, RFID, cellular, UWB, WLAN, Bluetooth, cooperative localization, indoor GPS, device-free localization, IR, Radar, and UHF. The performances of these technologies are measured by their accuracy, precision, complexity, robustness, scalability, and cost. Given the many application scenarios across different disciplines, there is a clear need for a broad, up-to-date and cogent treatment of radio-based location awareness. This special issue aims to provide a comprehensive overview of the state-of-the-art in technology, regulation, and theory. It also presents a holistic view of research challenges and opportunities in the emerging areas of localization.

A Survey of Security in Software Defined Networks

The proposition of increased innovation in network applications and reduced cost for network operators has won over the networking world to the vision of Software-Defined Networking (SDN). With the excitement of holistic visibility across the network and the ability to program network devices, developers have rushed to present a range of new SDN-compliant hardware, software and services. However, amidst this frenzy of activity, one key element has only recently entered the debate: Network Security. In this article, security in SDN is surveyed presenting both the research community and industry advances in this area. The challenges to securing the network from the persistent attacker are discussed and the holistic approach to the security architecture that is required for SDN is described. Future research directions that will be key to providing network security in SDN are identified.

Modeling of titanium alloys by using artificial neural networks

Titanium alloy exhibits an excellent combination of bio-compatibility, corrosion resistance, strength and toughness. The microstructure of an alloy influences the properties. The microstructures depend mainly on alloying elements, method of production, mechanical, and thermal treatments. The relationships between these variables and final properties of the alloy are complex, non-linear in nature, which is the biggest hurdle in developing proper correlations between them by conventional methods. So, we developed artificial neural networks (ANN) models for solving these complex phenomena in titanium alloys.

In the present work, ANN models were used for the analysis and prediction of the correlation between the process parameters, the alloying elements, microstructural features, beta transus temperature and mechanical properties in titanium alloys. Sensitivity analysis of trained neural network models were studied which resulted a better understanding of relationships between inputs and outputs. The model predictions and the analysis are well in agreement with the experimental results. The simulation results show that the average output-prediction error by models are less than 5% of the prediction range in more than 95% of the cases, which is quite acceptable for all metallurgical purposes.

Implementation of Selective Packet Destruction on Wireless Open-Access Research Platform

Interesting wireless networking scenarios exist wherein network services must be guaranteed in a dynamic fashion for some priority users. For example, in disaster recovery, members need to be able to quickly block other users in order to gain sole use of the radio channel. As it is not always feasible to physically switch off other users, we propose a new approach, termed selective packet destruction (SPD) to ensure service for priority users. A testbed for SPD has been created, based on the Rice University Wireless open-Access Research Platform and been used to examine the feasibility of our approach. Results from the testbed are presented to demonstrate the feasibility of SPD and show how a balance between performance and acknowledgement destruction rate can be achieved. A 90% reduction in TCP & UDP traffic is achieved for a 75% MAC ACK destruction rate.

Additionality of Incubator Support on Networks of University Spin-Out Firms

The formation rate of university spin-out firms has increased markedly over the past decade. While this is seen as an important channel for the commercialisation of academic research, concerns have centred around high failure rates and no-to-low growth among those which survive compared to other new technology based firms. Universities have responded to this by investing in incubators to assist spin-outs to overcome their liability of newness. Yet how effective are incubators in supporting these firms? Here we examine this in terms of the structural networks that spin-out firms form, the role of the incubator in this and the effect of this on the spin-out process.

Towards a general framework for social media research using big data

The increasing adoption of cloud computing, social networking, mobile and big data technologies provide challenges and opportunities for both research and practice. Researchers face a deluge of data generated by social network platforms which is further exacerbated by the co-mingling of social network platforms and the emerging Internet of Everything. While the topicality of big data and social media increases, there is a lack of conceptual tools in the literature to help researchers approach, structure and codify knowledge from social media big data in diverse subject matter domains, many of whom are from nontechnical disciplines. Researchers do not have a general-purpose scaffold to make sense of the data and the complex web of relationships between entities, social networks, social platforms and other third party databases, systems and objects. This is further complicated when spatio-temporal data is introduced. Based on practical experience of working with social media datasets and existing literature, we propose a general research framework for social media research using big data. Such a framework assists researchers in placing their contributions in an overall context, focusing their research efforts and building the body of knowledge in a given discipline area using social media data in a consistent and coherent manner.