[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Next Issue
Volume 10, December
Previous Issue
Volume 10, October
You seem to have javascript disabled. Please note that many of the page functionalities won't work as expected without javascript enabled.
 
 

Information, Volume 10, Issue 11 (November 2019) – 33 articles

Cover Story (view full-size image): We here present the technologies related to and the theoretical background of an intelligent interconnected infrastructure for public security and safety. The framework’s innovation lies in the intelligent combination of devices and human information oriented towards human and situational awareness in order to provide a protected and secure environment for citizens. The framework is currently being used to support visitors in public spaces and events by creating the appropriate infrastructure to address a set of urgent situations that may arise, including health-related problems and missing children in overcrowded environments. It works to support smart links between humans and entities in order to achieve goals and to adapt device operation to comply with human objectives, profiles, and privacy. View this paper.
  • Issues are regarded as officially published after their release is announced to the table of contents alert mailing list.
  • You may sign up for e-mail alerts to receive table of contents of newly released issues.
  • PDF is the official format for papers published in both, html and pdf forms. To view the papers in pdf format, click on the "PDF Full-text" link, and use the free Adobe Reader to open them.
Order results
Result details
Section
Select all
Export citation of selected articles as:
18 pages, 3049 KiB  
Article
Rolling-Bearing Fault-Diagnosis Method Based on Multimeasurement Hybrid-Feature Evaluation
by Jianghua Ge, Guibin Yin, Yaping Wang, Di Xu and Fen Wei
Information 2019, 10(11), 359; https://doi.org/10.3390/info10110359 - 19 Nov 2019
Cited by 7 | Viewed by 2919
Abstract
To improve the accuracy of rolling-bearing fault diagnosis and solve the problem of incomplete information about the feature-evaluation method of the single-measurement model, this paper combines the advantages of various measurement models and proposes a fault-diagnosis method based on multi-measurement hybrid-feature evaluation. In [...] Read more.
To improve the accuracy of rolling-bearing fault diagnosis and solve the problem of incomplete information about the feature-evaluation method of the single-measurement model, this paper combines the advantages of various measurement models and proposes a fault-diagnosis method based on multi-measurement hybrid-feature evaluation. In this study, an original feature set was first obtained through analyzing a collected vibration signal. The feature set included time- and frequency-domain features, and also, based on the empirical-mode decomposition (EMD)-obtained time-frequency domain, energy and Lempel–Ziv complexity features. Second, a feature-evaluation framework of multiplicative hybrid models was constructed based on correlation, distance, information, and other measures. The framework was used to rank features and obtain rank weights. Then the weights were multiplied by the features to obtain a new feature set. Finally, the fault-feature set was used as the input of the category-divergence fault-diagnosis model based on kernel principal component analysis (KPCA), and the fault-diagnosis model was based on a support vector machine (SVM). The clustering effect of different fault categories was more obvious and classification accuracy was improved. Full article
(This article belongs to the Section Information Applications)
Show Figures

Figure 1

Figure 1
<p>Flowchart of proposed feature-weighting scheme.</p>
Full article ">Figure 2
<p>Flowchart of diagnosis based on multi-measurement hybrid-feature evaluation.</p>
Full article ">Figure 3
<p>Schematic diagram of rolling-element-bearing fault-simulation experiment (Case I).</p>
Full article ">Figure 4
<p>Schematic diagram of gearbox-fault experiment (Case II).</p>
Full article ">Figure 5
<p>Experiment data for Case I of six kinds of KPCA result feature matrix: (<b>a</b>) <math display="inline"><semantics> <mrow> <mi>W</mi> <msub> <mi>W</mi> <mn>1</mn> </msub> <msup> <mrow/> <mi>H</mi> </msup> </mrow> </semantics></math>; (<b>b</b>) <math display="inline"><semantics> <mrow> <mi>W</mi> <msub> <mi>P</mi> <mn>1</mn> </msub> </mrow> </semantics></math>; (<b>c</b>) <math display="inline"><semantics> <mrow> <mi>W</mi> <msub> <mi>D</mi> <mn>1</mn> </msub> </mrow> </semantics></math>; (<b>d</b>) <math display="inline"><semantics> <mrow> <mi>W</mi> <msub> <mi>I</mi> <mn>1</mn> </msub> </mrow> </semantics></math>; (<b>e</b>) <math display="inline"><semantics> <mrow> <mi>W</mi> <msub> <mi>L</mi> <mn>1</mn> </msub> </mrow> </semantics></math>; (<b>f</b>) <math display="inline"><semantics> <mrow> <msub> <mi>C</mi> <mn>1</mn> </msub> </mrow> </semantics></math>.</p>
Full article ">Figure 6
<p>Experiment data for Case II of six kinds of different KPCA result feature matrix: (<b>a</b>) <math display="inline"><semantics> <mrow> <mi>W</mi> <msub> <mi>W</mi> <mn>2</mn> </msub> <msup> <mrow/> <mi>H</mi> </msup> </mrow> </semantics></math>; (<b>b</b>) <math display="inline"><semantics> <mrow> <mi>W</mi> <msub> <mi>P</mi> <mn>2</mn> </msub> </mrow> </semantics></math>; (<b>c</b>) <math display="inline"><semantics> <mrow> <mi>W</mi> <msub> <mi>D</mi> <mn>2</mn> </msub> </mrow> </semantics></math>; (<b>d</b>) <math display="inline"><semantics> <mrow> <mi>W</mi> <msub> <mi>I</mi> <mn>2</mn> </msub> </mrow> </semantics></math>; (<b>e</b>) <math display="inline"><semantics> <mrow> <mi>W</mi> <msub> <mi>L</mi> <mn>2</mn> </msub> </mrow> </semantics></math>; (<b>f</b>) <math display="inline"><semantics> <mrow> <msub> <mi>C</mi> <mn>2</mn> </msub> </mrow> </semantics></math>.</p>
Full article ">Figure 6 Cont.
<p>Experiment data for Case II of six kinds of different KPCA result feature matrix: (<b>a</b>) <math display="inline"><semantics> <mrow> <mi>W</mi> <msub> <mi>W</mi> <mn>2</mn> </msub> <msup> <mrow/> <mi>H</mi> </msup> </mrow> </semantics></math>; (<b>b</b>) <math display="inline"><semantics> <mrow> <mi>W</mi> <msub> <mi>P</mi> <mn>2</mn> </msub> </mrow> </semantics></math>; (<b>c</b>) <math display="inline"><semantics> <mrow> <mi>W</mi> <msub> <mi>D</mi> <mn>2</mn> </msub> </mrow> </semantics></math>; (<b>d</b>) <math display="inline"><semantics> <mrow> <mi>W</mi> <msub> <mi>I</mi> <mn>2</mn> </msub> </mrow> </semantics></math>; (<b>e</b>) <math display="inline"><semantics> <mrow> <mi>W</mi> <msub> <mi>L</mi> <mn>2</mn> </msub> </mrow> </semantics></math>; (<b>f</b>) <math display="inline"><semantics> <mrow> <msub> <mi>C</mi> <mn>2</mn> </msub> </mrow> </semantics></math>.</p>
Full article ">Figure 7
<p>Divergence-calculation results of six different fault-feature sets in experiment data 2. (<b>a</b>) Within-class scatter values corresponding to different measurement methods; (<b>b</b>) between-class scatter values corresponding to different measure methods; and (<b>c</b>) within-class–between-class scatter values corresponding to different measure methods.</p>
Full article ">Figure 8
<p>Support vector machine (SVM) test-classification results of six different feature sets in experiment data 1.</p>
Full article ">
10 pages, 249 KiB  
Article
Information Gain in Event Space Reflects Chance and Necessity Components of an Event
by Georg F. Weber
Information 2019, 10(11), 358; https://doi.org/10.3390/info10110358 - 19 Nov 2019
Cited by 2 | Viewed by 2167
Abstract
Information flow for occurrences in phase space can be assessed through the application of the Lyapunov characteristic exponent (multiplicative ergodic theorem), which is positive for non-linear systems that act as information sources and is negative for events that constitute information sinks. Attempts to [...] Read more.
Information flow for occurrences in phase space can be assessed through the application of the Lyapunov characteristic exponent (multiplicative ergodic theorem), which is positive for non-linear systems that act as information sources and is negative for events that constitute information sinks. Attempts to unify the reversible descriptions of dynamics with the irreversible descriptions of thermodynamics have replaced phase space models with event space models. The introduction of operators for time and entropy in lieu of traditional trajectories has consequently limited—to eigenvectors and eigenvalues—the extent of knowable details about systems governed by such depictions. In this setting, a modified Lyapunov characteristic exponent for vector spaces can be used as a descriptor for the evolution of information, which is reflective of the associated extent of undetermined features. This novel application of the multiplicative ergodic theorem leads directly to the formulation of a dimension that is a measure for the information gain attributable to the occurrence. Thus, it provides a readout for the magnitudes of chance and necessity that contribute to an event. Related algorithms express a unification of information content, degree of randomness, and complexity (fractal dimension) in event space. Full article
21 pages, 1490 KiB  
Article
A New Methodology for Automatic Cluster-Based Kriging Using K-Nearest Neighbor and Genetic Algorithms
by Carlos Yasojima, João Protázio, Bianchi Meiguins, Nelson Neto and Jefferson Morais
Information 2019, 10(11), 357; https://doi.org/10.3390/info10110357 - 18 Nov 2019
Cited by 7 | Viewed by 4262
Abstract
Kriging is a geostatistical interpolation technique that performs the prediction of observations in unknown locations through previously collected data. The modelling of the variogram is an essential step of the kriging process because it drives the accuracy of the interpolation model. The conventional [...] Read more.
Kriging is a geostatistical interpolation technique that performs the prediction of observations in unknown locations through previously collected data. The modelling of the variogram is an essential step of the kriging process because it drives the accuracy of the interpolation model. The conventional method of variogram modelling consists of using specialized knowledge and in-depth study to determine which parameters are suitable for the theoretical variogram. However, this situation is not always possible, and, in this case, it becomes interesting to use an automatic process. Thus, this work aims to propose a new methodology to automate the estimation of theoretical variogram parameters of the kriging process. The proposed methodology is based on preprocessing techniques, data clustering, genetic algorithms, and the K-Nearest Neighbor classifier (KNN). The performance of the methodology was evaluated using two databases, and it was compared to other optimization techniques widely used in the literature. The impacts of the clustering step on the stationary hypothesis were also investigated with and without trend removal techniques. The results showed that, in this automated proposal, the clustering process increases the accuracy of the kriging prediction. However, it generates groups that might not be stationary. Genetic algorithms are easily configurable with the proposed heuristic when setting the variable ranges in comparison to other optimization techniques, and the KNN method is satisfactory in solving some problems caused by the clustering task and allocating unknown points into previously determined clusters. Full article
(This article belongs to the Section Artificial Intelligence)
Show Figures

Figure 1

Figure 1
<p>Example of a final variogram model.</p>
Full article ">Figure 2
<p>Example of anisotropy.</p>
Full article ">Figure 3
<p>The general scheme of data preprocessing, data clustering, and model fitting stages for each cluster separately.</p>
Full article ">Figure 4
<p>Application example of the KNN algorithm in order to minimize the data overlap. (<b>a</b>) Before Normalization + KNN; (<b>b</b>) After Normalization + KNN.</p>
Full article ">Figure 5
<p>The chromosome’s scheme used in the genetic algorithm configuration.</p>
Full article ">Figure 6
<p>Tests with different upper bounds values for the sill parameter in the GA optimization. The <span class="html-italic">y</span>-axis represents normalized mean square error (NMSE), and the <span class="html-italic">x</span>-axis represents four upper bound values: the target variable variance multiplied by 1, 5, 10, and 15.</p>
Full article ">Figure 7
<p>Experimental variograms of the Meuse and Wolfcamp databases before and after the detrending process.</p>
Full article ">Figure 8
<p>Meuse database. Zinc values on <span class="html-italic">x</span> and <span class="html-italic">y</span> coordinates. (<b>a</b>) before the detrending process and (<b>b</b>) after the detrending process.</p>
Full article ">Figure 9
<p>Wolfcamp database. Piezometric level values on <span class="html-italic">x</span> and <span class="html-italic">y</span> coordinates. (<b>a</b>) before the detrending process and (<b>b</b>) after the detrending process.</p>
Full article ">Figure 10
<p>Treemap representation of the NMSE index in the various settings tested throughout the experiments using the Meuse and Wolfcamp databases.</p>
Full article ">Figure 11
<p>Kriging maps (prediction and variance) of the Meuse database.</p>
Full article ">Figure 12
<p>Kriging maps (prediction and variance) of the Wolfcamp database.</p>
Full article ">
17 pages, 5011 KiB  
Article
An Intrusion Detection System Based on a Simplified Residual Network
by Yuelei Xiao and Xing Xiao
Information 2019, 10(11), 356; https://doi.org/10.3390/info10110356 - 18 Nov 2019
Cited by 44 | Viewed by 4306
Abstract
Residual networks (ResNets) are prone to over-fitting for low-dimensional and small-scale datasets. And the existing intrusion detection systems (IDSs) fail to provide better performance, especially for remote-to-local (R2L) and user-to-root (U2R) attacks. To overcome these problems, a simplified residual network (S-ResNet) is proposed [...] Read more.
Residual networks (ResNets) are prone to over-fitting for low-dimensional and small-scale datasets. And the existing intrusion detection systems (IDSs) fail to provide better performance, especially for remote-to-local (R2L) and user-to-root (U2R) attacks. To overcome these problems, a simplified residual network (S-ResNet) is proposed in this paper, which consists of several cascaded, simplified residual blocks. Compared with the original residual block, the simplified residual block deletes a weight layer and two batch normalization (BN) layers, adds a pooling layer, and replaces the rectified linear unit (ReLU) function with the parametric rectified linear unit (PReLU) function. Based on the S-ResNet, a novel IDS was proposed in this paper, which includes a data preprocessing module, a random oversampling module, a S-Resnet layer, a full connection layer and a Softmax layer. The experimental results on the NSL-KDD dataset show that the IDS based on the S-ResNet has a higher accuracy, recall and F1-score than the equal scale ResNet-based IDS, especially for R2L and U2R attacks. And the former has faster convergence velocity than the latter. It proves that the S-ResNet reduces the complexity of the network and effectively prevents over-fitting; thus, it is more suitable for low-dimensional and small-scale datasets than ResNet. Furthermore, the experimental results on the NSL-KDD datasets also show that the IDS based on the S-ResNet achieves better performance in terms of accuracy and recall compared to the existing IDSs, especially for R2L and U2R attacks. Full article
(This article belongs to the Section Artificial Intelligence)
Show Figures

Figure 1

Figure 1
<p>The structure of residual block.</p>
Full article ">Figure 2
<p>Some variants of the residual block.</p>
Full article ">Figure 3
<p>Simplified residual block.</p>
Full article ">Figure 4
<p>The intrusion detection system (IDS) based on the simplified residual network (S-ResNet).</p>
Full article ">Figure 5
<p>The application scenario of the above IDS.</p>
Full article ">Figure 6
<p>The S-ResNet layer.</p>
Full article ">Figure 7
<p>The number of samples of each category in the experimental dataset.</p>
Full article ">Figure 8
<p>The S-ResNet used in the experiment.</p>
Full article ">Figure 9
<p>The confusion matrix of the IDS based on the S-ResNet.</p>
Full article ">Figure 10
<p>The confusion matrix of the equal scale ResNet-based IDS.</p>
Full article ">Figure 11
<p>The recall results of the two IDSs for each category.</p>
Full article ">Figure 12
<p>The F1-score results of the two IDSs for each category.</p>
Full article ">Figure 13
<p>The change of the accuracy of the two IDSs when training models.</p>
Full article ">Figure 14
<p>The change of the accuracy of the two IDSs when testing models.</p>
Full article ">Figure 15
<p>The change of the loss of the two IDSs when training models.</p>
Full article ">Figure 16
<p>The change of the loss of the two IDSs when testing models.</p>
Full article ">
15 pages, 3633 KiB  
Article
Serious Game iDO: Towards Better Education in Dementia Care
by Rytis Maskeliūnas, Robertas Damaševičius, Connie Lethin, Andrius Paulauskas, Anna Esposito, Mauro Catena and Vincenzo Aschettino
Information 2019, 10(11), 355; https://doi.org/10.3390/info10110355 - 18 Nov 2019
Cited by 23 | Viewed by 7214
Abstract
We describe the iDO serious game developed during implementation of the Innovative Digital Training Opportunities on Dementia for Direct Care Workers (IDO) project. The project targets formal and informal caregivers of persons with dementia in order to improve caregiver knowledge and competences skills [...] Read more.
We describe the iDO serious game developed during implementation of the Innovative Digital Training Opportunities on Dementia for Direct Care Workers (IDO) project. The project targets formal and informal caregivers of persons with dementia in order to improve caregiver knowledge and competences skills with a non-traditional source of training. This paper describes the steps faced to define the iDO caregiver behavior improvement model, design of game mechanics, development of game art and game characters, and implementation of gameplay. Furthermore, it aimed to assess the direct impact of the game on caregivers (n = 48) and seniors with early signs of dementia (n = 14) in Lithuania measured with the Geriatric Depression Scale (GDS) and Dementia Attitudes Scale (DAS). The caregivers’ GDS scores showed a decrease in negative answers from 13.4% (pre-game survey) to 5.2% (post-game survey). The seniors’ GDS scores showed a decrease in negative answers from 24.9% (pre-game survey) to 10.9% (post-game survey). The overall DAS scores increased from 6.07 in the pre-game survey to 6.41 in the post-game survey, statistically significant for both caregivers and seniors (p < 0.001), respectively. We conclude that the game aroused positive moods and attitudes for future caregivers of persons with dementia, indicating a more relaxed status and a decreased fear in accomplishing the caring process. Full article
(This article belongs to the Special Issue Advances in Mobile Gaming and Games-based Leaning)
Show Figures

Figure 1

Figure 1
<p>Educational model for the iDO gameplay. MOOC - massive open online course. QOL – Quality of Life.</p>
Full article ">Figure 2
<p>Basic activity loop of the game character. The game character is, most of the time, strolling idly, acting only when the player queues or when the character must act in solving a need that reaches critical thresholds.</p>
Full article ">Figure 3
<p>Model of the person with dementia’s needs and actions.</p>
Full article ">Figure 4
<p>Game model of the avatar’s (person with dementia) reaction to care processes.</p>
Full article ">Figure 5
<p>(<b>a</b>) Initial character concepts. (<b>b</b>) Final character concepts.</p>
Full article ">Figure 6
<p>(<b>a</b>) Initial user experience (UX) concept. (<b>b</b>) Final UX design.</p>
Full article ">Figure 7
<p>The game’s main actors and the relationships among them.</p>
Full article ">Figure 8
<p>Average scores of individual responses to System Usability Scale (SUS) statements.</p>
Full article ">Figure 9
<p>Perception of balance between game and education in the game.</p>
Full article ">
18 pages, 1802 KiB  
Article
Dense Model for Automatic Image Description Generation with Game Theoretic Optimization
by Sreela S R and Sumam Mary Idicula
Information 2019, 10(11), 354; https://doi.org/10.3390/info10110354 - 15 Nov 2019
Cited by 8 | Viewed by 4191
Abstract
Due to the rapid growth of deep learning technologies, automatic image description generation is an interesting problem in computer vision and natural language generation. It helps to improve access to photo collections on social media and gives guidance for visually impaired people. Currently, [...] Read more.
Due to the rapid growth of deep learning technologies, automatic image description generation is an interesting problem in computer vision and natural language generation. It helps to improve access to photo collections on social media and gives guidance for visually impaired people. Currently, deep neural networks play a vital role in computer vision and natural language processing tasks. The main objective of the work is to generate the grammatically correct description of the image using the semantics of the trained captions. An encoder-decoder framework using the deep neural system is used to implement an image description generation task. The encoder is an image parsing module, and the decoder is a surface realization module. The framework uses Densely connected convolutional neural networks (Densenet) for image encoding and Bidirectional Long Short Term Memory (BLSTM) for language modeling, and the outputs are given to bidirectional LSTM in the caption generator, which is trained to optimize the log-likelihood of the target description of the image. Most of the existing image captioning works use RNN and LSTM for language modeling. RNNs are computationally expensive with limited memory. LSTM checks the inputs in one direction. BLSTM is used in practice, which avoids the problem of RNN and LSTM. In this work, the selection of the best combination of words in caption generation is made using beam search and game theoretic search. The results show the game theoretic search outperforms beam search. The model was evaluated with the standard benchmark dataset Flickr8k. The Bilingual Evaluation Understudy (BLEU) score is taken as the evaluation measure of the system. A new evaluation measure called GCorrectwas used to check the grammatical correctness of the description. The performance of the proposed model achieves greater improvements over previous methods on the Flickr8k dataset. The proposed model produces grammatically correct sentences for images with a GCorrect of 0.040625 and a BLEU score of 69.96% Full article
(This article belongs to the Section Artificial Intelligence)
Show Figures

Figure 1

Figure 1
<p>Architecture of the proposed model.</p>
Full article ">Figure 2
<p>Architecture of the image model.</p>
Full article ">Figure 3
<p>Architecture of Densenet.</p>
Full article ">Figure 4
<p>Architecture of the language model.</p>
Full article ">Figure 5
<p>Comparison of the accuracies of different models.</p>
Full article ">Figure 6
<p>Comparison of the losses of different models.</p>
Full article ">Figure 7
<p>Comparison of the BLEU scores under different beam sizes.</p>
Full article ">
29 pages, 4338 KiB  
Article
Methods and Challenges Using Multispectral and Hyperspectral Images for Practical Change Detection Applications
by Chiman Kwan
Information 2019, 10(11), 353; https://doi.org/10.3390/info10110353 - 15 Nov 2019
Cited by 43 | Viewed by 5703
Abstract
Multispectral (MS) and hyperspectral (HS) images have been successfully and widely used in remote sensing applications such as target detection, change detection, and anomaly detection. In this paper, we aim at reviewing recent change detection papers and raising some challenges and opportunities in [...] Read more.
Multispectral (MS) and hyperspectral (HS) images have been successfully and widely used in remote sensing applications such as target detection, change detection, and anomaly detection. In this paper, we aim at reviewing recent change detection papers and raising some challenges and opportunities in the field from a practitioner’s viewpoint using MS and HS images. For example, can we perform change detection using synthetic hyperspectral images? Can we use temporally-fused images to perform change detection? Some of these areas are ongoing and will require more research attention in the coming years. Moreover, in order to understand the context of our paper, some recent and representative algorithms in change detection using MS and HS images are included, and their advantages and disadvantages will be highlighted. Full article
Show Figures

Figure 1

Figure 1
<p>Change detection between two images.</p>
Full article ">Figure 2
<p>Local prediction idea.</p>
Full article ">Figure 3
<p>Residuals of global CC, segmented CC, and local CC. First row: Aug. and Oct. image pair; Second row: Sept. and Oct. image pair; Third row: Oct. and Oct. image pair; Fourth row: Nov. and Oct. image pair. Blue pixels mean small errors.</p>
Full article ">Figure 4
<p>Signal flow in MRCD.</p>
Full article ">Figure 5
<p>Block diagram of BandRatio/CC/Local RX.</p>
Full article ">Figure 6
<p>Architecture of a deep auto-encoder.</p>
Full article ">Figure 7
<p>Approach 4: A parallel pansharpening step first, followed by a sequential fusion step for enhancing WV-3 images.</p>
Full article ">Figure 8
<p>RGB and SWIR images before and after pansharpening.</p>
Full article ">Figure 9
<p>Performance of using color images for soil detection.</p>
Full article ">Figure 10
<p>Soil detection results using synthetic bands.</p>
Full article ">Figure 11
<p>Fusion of Landsat and MODIS images to create a high spatial and high temporal resolution image sequence.</p>
Full article ">
14 pages, 884 KiB  
Article
The Influence of Age, Gender, and Cognitive Ability on the Susceptibility to Persuasive Strategies
by Aisha Muhammad Abdullahi, Kiemute Oyibo, Rita Orji and Abdullahi Abubakar Kawu
Information 2019, 10(11), 352; https://doi.org/10.3390/info10110352 - 15 Nov 2019
Cited by 17 | Viewed by 6462
Abstract
The fact that individuals may react differently toward persuasive strategies gave birth to a shift in persuasive technology (PT) design from the one-size-fits-all traditional approach to the individualized approach which conforms to individuals’ preferences. Given that learners’ gender, age, and cognitive level can [...] Read more.
The fact that individuals may react differently toward persuasive strategies gave birth to a shift in persuasive technology (PT) design from the one-size-fits-all traditional approach to the individualized approach which conforms to individuals’ preferences. Given that learners’ gender, age, and cognitive level can affect their response to different learning instructions, it is given primacy of place in persuasive educational technology (PET) design. However, the effect of gender, age, and cognitive ability on learners’ susceptibility to persuasive strategies did not receive the right attention in the extant literature. To close this gap, we carried out an empirical study among 461 participants to investigate whether learners’ gender, age, and cognitive ability significantly affect learners’ susceptibility to three key persuasive strategies (social learning, reward, and trustworthiness) in PETs. The results of a repeated measure analysis of variance (RM-ANOVA) revealed that people with high cognitive level are more likely to be susceptible to social learning, while people with low cognitive level are more likely to be susceptible to trustworthiness. Comparatively, our results revealed that males are more likely to be susceptible to social learning, while females are more likely to be susceptible to reward and trustworthiness. Furthermore, our results revealed that younger adults are more likely to be susceptible to social learning and reward, while older adults are more likely to be susceptible to trustworthiness. Our findings reveal potential persuasive strategies which designers can employ to personalize PTs to individual users in higher learning based on their susceptibility profile determined by age, gender, and cognitive level. Full article
(This article belongs to the Special Issue Personalizing Persuasive Technologies)
Show Figures

Figure 1

Figure 1
<p>Overall mean rating of the persuasive strategies (SLEARN = social learning, TRUST = trustworthiness, REWD = reward; horizontal bar indicates the neutral of five on the 1–9 Likert scale).</p>
Full article ">Figure 2
<p>The effect of gender on susceptibility to persuasive strategies (SLEARN = social learning, TRUST = trustworthiness, REWD = reward; horizontal bar indicates the neutral of five on the 1–9 Likert scale).</p>
Full article ">Figure 3
<p>The effect of age on susceptibility to persuasive strategies (SLEARN = social learning, TRUST = trustworthiness, REWD = reward; horizontal bar indicates the neutral of five on the 1–9 Likert scale).</p>
Full article ">Figure 4
<p>The effect of cognitive level on susceptibility to persuasive strategies (SLEARN = social learning, TRUST = trustworthiness, REWD = reward; horizontal bar indicates the neutral of five on the 1–9 Likert scale; HCL = high cognitive leaners, LCL = low cognitive leaners).</p>
Full article ">
11 pages, 231 KiB  
Article
Evaluating Museum Virtual Tours: The Case Study of Italy
by Katerina Kabassi, Alessia Amelio, Vasileios Komianos and Konstantinos Oikonomou
Information 2019, 10(11), 351; https://doi.org/10.3390/info10110351 - 14 Nov 2019
Cited by 41 | Viewed by 6766
Abstract
Virtual tours in museums are an ideal solution for those that are not able to visit a museum or those who want to have a small taste of what is presented in the museum before their visit. However, these tours often encounter severe [...] Read more.
Virtual tours in museums are an ideal solution for those that are not able to visit a museum or those who want to have a small taste of what is presented in the museum before their visit. However, these tours often encounter severe problems while users interact with them. In order to check the status of virtual tours of museums, we present the implementation of an evaluation experiment that uses a combination of two multi-criteria decision making theories, namely the analytic hierarchy process (AHP) and the fuzzy technique for order of preference by similarity to ideal solution (TOPSIS). AHP has been used for the estimation of the weights of the heuristics and fuzzy TOPSIS has been used for the evaluation of virtual tours of museums. This paper presents the exact steps that have to be followed in order to implement such an experiment and run an example experiment for virtual tours of Italian museums. Full article
16 pages, 2145 KiB  
Article
A Novel Approach to Working Memory Training Based on Robotics and AI
by Vladimir Araujo, Diego Mendez and Alejandra Gonzalez
Information 2019, 10(11), 350; https://doi.org/10.3390/info10110350 - 12 Nov 2019
Cited by 6 | Viewed by 3750
Abstract
Working memory is an important function for human cognition since several day-to-day activities are related to it, such as remembering a direction or developing a mental calculation. Unfortunately, working memory deficiencies affect performance in work or education related activities, mainly due to lack [...] Read more.
Working memory is an important function for human cognition since several day-to-day activities are related to it, such as remembering a direction or developing a mental calculation. Unfortunately, working memory deficiencies affect performance in work or education related activities, mainly due to lack of concentration, and, with the goal to improve this, many software applications have been developed. However, sometimes the user ends up bored with these games and drops out easily. To cope with this, our work explores the use of intelligent robotics and dynamic difficulty adjustment mechanisms to develop a novel working memory training system. The proposed system, based on the Nao robotic platform, is composed of three main components: First, the N-back task allows stimulating the working memory by remembering visual sequences. Second, a BDI model implements an intelligent agent for decision-making during the progress of the game. Third, a fuzzy controller, as a dynamic difficulty adjustment system, generates customized levels according to the user. The experimental results of our system, when compared to a computer-based implementation of the N-back game, show a significant improvement on the performance of the user in the game, which might relate to an improvement in their working memory. Additionally, by providing a friendly and interactive interface, the participants have reported a more immersive and better game experience when using the robotic-based system. Full article
(This article belongs to the Section Information Applications)
Show Figures

Figure 1

Figure 1
<p>Graphical representation of the interaction among the user, the robot and the smart objects. As an example, the first iteration of the two-back case is shown.</p>
Full article ">Figure 2
<p>General modular diagram of the system.</p>
Full article ">Figure 3
<p>Dominant goal evaluation process, based on the BDI goal hierarchy pyramid proposed in [<a href="#B28-information-10-00350" class="html-bibr">28</a>].</p>
Full article ">Figure 4
<p>Robot Nao showing stimulus.</p>
Full article ">Figure 5
<p>Box-plot showing the performance of both approaches (computer- and robotic-based) for the N-back level reached in each session.</p>
Full article ">Figure 6
<p>Mean WM performance across three weeks.</p>
Full article ">
26 pages, 2290 KiB  
Review
A Review on UAV-Based Applications for Precision Agriculture
by Dimosthenis C. Tsouros, Stamatia Bibi and Panagiotis G. Sarigiannidis
Information 2019, 10(11), 349; https://doi.org/10.3390/info10110349 - 11 Nov 2019
Cited by 711 | Viewed by 45003
Abstract
Emerging technologies such as Internet of Things (IoT) can provide significant potential in Smart Farming and Precision Agriculture applications, enabling the acquisition of real-time environmental data. IoT devices such as Unmanned Aerial Vehicles (UAVs) can be exploited in a variety of applications related [...] Read more.
Emerging technologies such as Internet of Things (IoT) can provide significant potential in Smart Farming and Precision Agriculture applications, enabling the acquisition of real-time environmental data. IoT devices such as Unmanned Aerial Vehicles (UAVs) can be exploited in a variety of applications related to crops management, by capturing high spatial and temporal resolution images. These technologies are expected to revolutionize agriculture, enabling decision-making in days instead of weeks, promising significant reduction in cost and increase in the yield. Such decisions enable the effective application of farm inputs, supporting the four pillars of precision agriculture, i.e., apply the right practice, at the right place, at the right time and with the right quantity. However, the actual proliferation and exploitation of UAVs in Smart Farming has not been as robust as expected mainly due to the challenges confronted when selecting and deploying the relevant technologies, including the data acquisition and image processing methods. The main problem is that still there is no standardized workflow for the use of UAVs in such applications, as it is a relatively new area. In this article, we review the most recent applications of UAVs for Precision Agriculture. We discuss the most common applications, the types of UAVs exploited and then we focus on the data acquisition methods and technologies, appointing the benefits and drawbacks of each one. We also point out the most popular processing methods of aerial imagery and discuss the outcomes of each method and the potential applications of each one in the farming operations. Full article
(This article belongs to the Special Issue IoT Applications and Industry 4.0)
Show Figures

Figure 1

Figure 1
<p>(<b>a</b>) Fixed-wing (eBee™) [<a href="#B23-information-10-00349" class="html-bibr">23</a>]; (<b>b</b>) helicopter (Hornet Maxi) [<a href="#B122-information-10-00349" class="html-bibr">122</a>]; (<b>c</b>) octocopter [<a href="#B25-information-10-00349" class="html-bibr">25</a>]; (<b>d</b>) blimp [<a href="#B123-information-10-00349" class="html-bibr">123</a>]; (<b>e</b>) flapping-wing (SmartBird) [<a href="#B122-information-10-00349" class="html-bibr">122</a>]; and (<b>f</b>) parafoil-wing (Tetracam) [<a href="#B90-information-10-00349" class="html-bibr">90</a>].</p>
Full article ">Figure 2
<p>Examples of sensors used by UAVs for PA: (<b>a</b>) thermal sensor [<a href="#B103-information-10-00349" class="html-bibr">103</a>]; (<b>b</b>) RGB sensor [<a href="#B59-information-10-00349" class="html-bibr">59</a>]; (<b>c</b>) multispectral sensor [<a href="#B26-information-10-00349" class="html-bibr">26</a>]; and (<b>d</b>) hyperspectral sensor [<a href="#B88-information-10-00349" class="html-bibr">88</a>].</p>
Full article ">Figure 3
<p>(<b>a</b>) A Digital Terrain Model [<a href="#B79-information-10-00349" class="html-bibr">79</a>]; and (<b>b</b>) a Digital Surface Model [<a href="#B109-information-10-00349" class="html-bibr">109</a>].</p>
Full article ">Figure 4
<p>Vegetation indices maps of crops in different growth stages [<a href="#B29-information-10-00349" class="html-bibr">29</a>]: (<b>a</b>) NDVI maps; and (<b>b</b>) NDRE maps</p>
Full article ">Figure 5
<p>The use of sensors and processing techniques in the different UAVs applications.</p>
Full article ">
25 pages, 3395 KiB  
Article
Precision Agriculture: A Remote Sensing Monitoring System Architecture
by Anna Triantafyllou, Panagiotis Sarigiannidis and Stamatia Bibi
Information 2019, 10(11), 348; https://doi.org/10.3390/info10110348 - 9 Nov 2019
Cited by 98 | Viewed by 19474
Abstract
Smart Farming is a development that emphasizes on the use of modern technologies in the cyber-physical field management cycle. Technologies such as the Internet of Things (IoT) and Cloud Computing have accelerated the digital transformation of the conventional agricultural practices promising increased production [...] Read more.
Smart Farming is a development that emphasizes on the use of modern technologies in the cyber-physical field management cycle. Technologies such as the Internet of Things (IoT) and Cloud Computing have accelerated the digital transformation of the conventional agricultural practices promising increased production rate and product quality. The adoption of smart farming though is hampered because of the lack of models providing guidance to practitioners regarding the necessary components that constitute IoT-based monitoring systems. To guide the process of designing and implementing Smart farming monitoring systems, in this paper we propose a generic reference architecture model, taking also into consideration a very important non-functional requirement, the energy consumption restriction. Moreover, we present and discuss the technologies that incorporate the seven layers of the architecture model that are the Sensor Layer, the Link Layer, the Encapsulation Layer, the Middleware Layer, the Configuration Layer, the Management Layer and the Application Layer. Furthermore, the proposed Reference Architecture model is exemplified in a real-world application for surveying Saffron agriculture in Kozani, Greece. Full article
(This article belongs to the Special Issue IoT Applications and Industry 4.0)
Show Figures

Figure 1

Figure 1
<p>Remote Sensing System Architecture.</p>
Full article ">Figure 2
<p>Saffron harvesting.</p>
Full article ">Figure 3
<p>Saffron cultivation yearly stages.</p>
Full article ">Figure 4
<p>The DIAS architecture.</p>
Full article ">
16 pages, 1526 KiB  
Article
Can Message-Tailoring Based on Regulatory Fit Theory Improve the Efficacy of Persuasive Physical Activity Systems?
by Leila Sadat Rezai, Jessie Chin, Reicelis Casares-Li, Fan He, Rebecca Bassett-Gunter and Catherine Burns
Information 2019, 10(11), 347; https://doi.org/10.3390/info10110347 - 8 Nov 2019
Cited by 2 | Viewed by 3272
Abstract
Background: Many behaviour-change technologies have been designed to help people with a sedentary lifestyle to become more physically active. However, challenges exist in designing systems that work effectively. One of the key challenges is that many of those technologies do not account for [...] Read more.
Background: Many behaviour-change technologies have been designed to help people with a sedentary lifestyle to become more physically active. However, challenges exist in designing systems that work effectively. One of the key challenges is that many of those technologies do not account for differences in individuals’ psychological characteristics. To address that problem, tailoring the communication between a system and its users has been proposed and examined. Although in the research related to public health education, message tailoring has been studied extensively as a technique to communicate health information and to educate people, its use in the design of behaviour-change technologies has not been adequately investigated. Objective: The goal of this study was to explore the impact of message tailoring, when tailoring was grounded in Higgins’ Regulatory Fit Theory, and messages were constructed to promote physical activity. Method: An email intervention was designed and developed that sent participants daily health messages for 14 consecutive days. There were three categories of messages: reminders, promotion-, and prevention-messages. The effect of the messages on behaviour was compared between those who received messages that fitted their self-regulatory orientation, versus those who received non-fitted messages. Results: Participants who received promotion- or prevention-messages walked for longer periods of time, compared to those who received reminders in the control group. When comparing the first two groups, promotion-message-recipients on average walked more than those who received prevention-messages. In other words, promotion messages acted more persuasively than prevention-messages and reminders. Contrary to our hypothesis, those individuals who received messages that fitted their self-regulatory orientation did not walk more than those who received non-fitted messages. Conclusions: The efficacy of Higgins’ Regulatory Fit Theory in the design of tailored health messages was examined. This study did not find support for the use of that theory in guiding the design of persuasive health messages that promote physical activity. Therefore, more research is necessary to investigate the effectiveness of tailoring strategies. Full article
(This article belongs to the Special Issue Personalizing Persuasive Technologies)
Show Figures

Figure 1

Figure 1
<p>Study procedure.</p>
Full article ">Figure 2
<p>Number of participants who answered the study questionnaires during the intervention period.</p>
Full article ">Figure 3
<p>Average time participants of each message condition spent walking per day at different periods of the study.</p>
Full article ">Figure 4
<p>Average time promotion-message-recipients spent walking.</p>
Full article ">Figure 5
<p>Average time prevention-message-recipients spent walking.</p>
Full article ">
11 pages, 2006 KiB  
Article
Combining Visual Contrast Information with Sound Can Produce Faster Decisions
by Birgitta Dresp-Langley and Marie Monfouga
Information 2019, 10(11), 346; https://doi.org/10.3390/info10110346 - 7 Nov 2019
Cited by 6 | Viewed by 3371
Abstract
Pieron’s and Chocholle’s seminal psychophysical work predicts that human response time to information relative to visual contrast and/or sound frequency decreases when contrast intensity or sound frequency increases. The goal of this study is to bring to the forefront the ability of individuals [...] Read more.
Pieron’s and Chocholle’s seminal psychophysical work predicts that human response time to information relative to visual contrast and/or sound frequency decreases when contrast intensity or sound frequency increases. The goal of this study is to bring to the forefront the ability of individuals to use visual contrast intensity and sound frequency in combination for faster perceptual decisions of relative depth (“nearer”) in planar (2D) object configurations based on physical variations in luminance contrast. Computer controlled images with two abstract patterns of varying contrast intensity, one on the left and one on the right, preceded or not by a pure tone of varying frequency, were shown to healthy young humans in controlled experimental sequences. Their task (two-alternative, forced-choice) was to decide as quickly as possible which of two patterns, the left or the right one, in a given image appeared to “stand out as if it were nearer” in terms of apparent (subjective) visual depth. The results showed that the combinations of varying relative visual contrast with sounds of varying frequency exploited here produced an additive effect on choice response times in terms of facilitation, where a stronger visual contrast combined with a higher sound frequency produced shorter forced-choice response times. This new effect is predicted by audio-visual probability summation. Full article
(This article belongs to the Special Issue Information-Centred Approaches to Visual Perception)
Show Figures

Figure 1

Figure 1
<p>Forty-eight paired image configurations with variable contrast intensities used as stimuli in the experiments. Twenty-four pairs had positive (<b>a</b>) and 24 pairs had negative (<b>b</b>) contrast polarity. Each pair was preceded by a 70 dB pure tone sound signal (200, 1000, or 2000 Hz) in test conditions with sound.</p>
Full article ">Figure 2
<p>Illustration of a 200 Hz and a 1000 Hz sound wave of identical amplitude (Db). Within the audible frequency range (20 to 20,000 Hz) for humans, higher-frequency (higher pitch) sounds of a given amplitude are perceived as “sharper” than lower-frequency sounds of identical amplitude.</p>
Full article ">Figure 3
<p>Graphic representation of the effects of relative visual contrast between patterns in a pair (<span class="html-italic">dC</span>), contrast sign, number of contrast elements, and sound on perceptual decision times from this study. Mean response times and their standard errors are plotted to show effect sizes and interactions.</p>
Full article ">
18 pages, 17734 KiB  
Article
A Smart Energy Harvesting Platform for Wireless Sensor Network Applications
by Gabriel Filios, Ioannis Katsidimas, Sotiris Nikoletseas and Ioannis Tsenempis
Information 2019, 10(11), 345; https://doi.org/10.3390/info10110345 - 6 Nov 2019
Cited by 3 | Viewed by 4187
Abstract
Advances in micro-electro-mechanical systems (MEMS) as well as the solutions for power scavenging can now provide feasible alternatives in a variety of applications. Wireless sensor networks (WSN), which operate on rechargeable batteries, could be based on a fresh basis which aims both at [...] Read more.
Advances in micro-electro-mechanical systems (MEMS) as well as the solutions for power scavenging can now provide feasible alternatives in a variety of applications. Wireless sensor networks (WSN), which operate on rechargeable batteries, could be based on a fresh basis which aims both at environmental power collection and wireless charging in various shapes and scales. Consequently, a potential illimitable energy supply can override the hypothesis of the limited energy budget (which can also impact the system’s efficiency). The presented platform is able to efficiently power a low power IoT system with processing, sensing and wireless transmission potentials. It incorporates a cutting-edge energy management IC that enables exceptional energy harvesting, applicable on low power and downsized energy generators. In contrast to other schemes, it supports not only a range of power supply alternatives, but also a compound energy depository system. The objective of this paper is to describe the design of the system, the integrated intelligence and the power autonomy performance. Full article
(This article belongs to the Special Issue IoT Applications and Industry 4.0)
Show Figures

Figure 1

Figure 1
<p>High level schematic of a mote including sensors, MCU and communication modules. The connection with the energy part is also depicted.</p>
Full article ">Figure 2
<p>Abstract schematic of the mote’s energy module. Power management submodule has dual input (harvesters and batteries) single output and accepts parameters for its operation.</p>
Full article ">Figure 3
<p>Typical application of the LTC3331 ([<a href="#B20-information-10-00345" class="html-bibr">20</a>]) using a solar panel and a piezo energy harvester to provide 1.8 to 5 V to the output and charge a single cell Li-Ion battery.</p>
Full article ">Figure 4
<p>LTC3331 combined with LTC4071 to allow more charging current to the rechargeable batteries.</p>
Full article ">Figure 5
<p>Priority is given to harvested energy and rechargeable over non-rechargeable batteries utilizing the PGVOUT signal of each LTC3331.</p>
Full article ">Figure 6
<p>Flowchart that depicts the hierarchy scheme of the harvested energy over batteries and the corresponding priority of the rechargeable batteries over non-rechargeable.</p>
Full article ">Figure 7
<p>High level schematic of our proposed energy management module. It contains the two LTC3331 with the LTC4071 as the external charger, the LTC3335 and the prioritizer we implemented.</p>
Full article ">Figure 8
<p>Schematic from the simulation of the combination of LTC3331 with the LTC4071 to increase the charging current for the rechargeable batteries.</p>
Full article ">Figure 9
<p>Transient analysis of LTC3331 combined with LTC4071 for 500 ms duration. (<b>a</b>) Harvester, battery, output voltage and <span class="html-italic">EH_ON</span> signal. (<b>b</b>) Battery voltage and current flowing through <span class="html-italic">AC</span>1 and <span class="html-italic">BAT_IN</span> pins. (<b>c</b>) Harvester and output voltage and current flowing through <span class="html-italic">BAT_IN</span> pin.</p>
Full article ">Figure 10
<p>Lab setup for experiments. Energy management board, sensor mote, solar cells, rechargeable batteries and non-rechargeable batteries.</p>
Full article ">Figure 11
<p>A 3D model of the PCB we designed for our proposed circuit.</p>
Full article ">Figure 12
<p>Results from a seven day evaluation of our energy management board. (<b>a</b>) Solar cells voltage according to the applied luminosity. (<b>b</b>) Average messages received per second from the mote. (<b>c</b>) Rechargeable and non-rechargeable battery voltage.</p>
Full article ">Figure 13
<p>Results from a short evaluation of our board to demonstrate the robust switch from harvesters to non-rechargeable batteries and vice versa.</p>
Full article ">Figure 14
<p>(<b>a</b>) The energy management board encapsulated in resin along with the harvesters and batteries for use on road infrastructure; (<b>b</b>) IoT device with sensors and communication modules, mounted on the road surface with suitable encapsulation. The energy part is the one closer to the side of the road.</p>
Full article ">Figure 15
<p>Results from an evaluation of the energy management board encapsulated in resin for the duration of 15 days. (<b>a</b>) Solar panels voltage. Solar 1: 2 panels, Solar 2: 6 panels. (<b>b</b>) Output voltage. (<b>c</b>) Rechargeable and non-rechargeable battery voltage.</p>
Full article ">Figure 16
<p>Detailed schematic of the proposed energy management prototype.</p>
Full article ">
21 pages, 1320 KiB  
Article
Investigation of the Moderating Effect of Culture on Users’ Susceptibility to Persuasive Features in Fitness Applications
by Kiemute Oyibo and Julita Vassileva
Information 2019, 10(11), 344; https://doi.org/10.3390/info10110344 - 6 Nov 2019
Cited by 15 | Viewed by 3803
Abstract
Persuasive technologies have been identified as a potential motivational tool to tackle the rising problem of physical inactivity worldwide, with research showing they are more likely to be successful if tailored to the target audience. However, in the physical activity domain, there is [...] Read more.
Persuasive technologies have been identified as a potential motivational tool to tackle the rising problem of physical inactivity worldwide, with research showing they are more likely to be successful if tailored to the target audience. However, in the physical activity domain, there is limited research on how culture moderates users’ susceptibility to the various persuasive features employed in mobile health applications aimed to motivate behavior change. To bridge this gap, we conducted an empirical study among 256 participants from collectivist (n = 67) and individualist (n = 189) cultures to determine their culture-specific persuasion profiles with respect to six persuasive features commonly employed in fitness applications on the market. The persuasive features include two personal features (goal-setting/self-monitoring and reward) and four social features (competition, cooperation, social learning and social comparison). We based our study on the rating of storyboards (on which each of the six persuasive features is illustrated) and the ranking of the six persuasive features in terms of perceived persuasiveness. The results of our analysis showed that users from individualist and collectivist cultures significantly differ in their persuasion profiles. Based on our rating measure, collectivist users are more likely to be susceptible to all six persuasive features (personal and social) than individualist users, who are only likely to be susceptible to personal features. However, based on our ranking measure, individualist users are more likely to be susceptible to personal features (goal-setting/self-monitoring and reward) than collectivist users. In contrast, collectivist users are more likely to be susceptible to social features (cooperation and social learning) than individualist users. Based on these findings, we provide culture-specific persuasive technology design guidelines. Our study is the first to uncover the moderating effect of culture on users’ susceptibility to commonly employed persuasive features in fitness applications. Full article
(This article belongs to the Special Issue Personalizing Persuasive Technologies)
Show Figures

Figure 1

Figure 1
<p>Storyboard illustrating a social learning persuasive feature [<a href="#B17-information-10-00344" class="html-bibr">17</a>].</p>
Full article ">Figure 2
<p>Overall mean rating (left) and ranking (right) of persuasive features. Crossbar indicates the neutral value on the 1–7 Likert scale and the mean value on the 1–6 ranking scale; REWD = Reward, GOAL/SMT = Goal-Setting/Self-Monitoring, CMPT = Competition, SCOMP = Social Comparison, SLEARN = Social Learning, COOP = Cooperation.</p>
Full article ">Figure 3
<p>Culture-based mean rating (left) and ranking (right) of persuasive features. Crossbar indicates the neutral value on the 1–7 Likert scale and the mean value on the 1–6 ranking scale; REWD = Reward, GOAL/SMT = Goal-Setting/Self-Monitoring, CMPT = Competition, SCOMP = Social Comparison, SLEARN = Social Learning, COOP = Cooperation; COL = Collectivist culture, IND = Individualist culture.</p>
Full article ">
15 pages, 3317 KiB  
Article
Design of IoT-based Cyber–Physical Systems: A Driverless Bulldozer Prototype
by Nelson H. Carreras Guzman and Adam Gergo Mezovari
Information 2019, 10(11), 343; https://doi.org/10.3390/info10110343 - 5 Nov 2019
Cited by 11 | Viewed by 4812
Abstract
From autonomous vehicles to robotics and machinery, organizations are developing autonomous transportation systems in various domains. Strategic incentives point towards a fourth industrial revolution of cyber–physical systems with higher levels of automation and connectivity throughout the Internet of Things (IoT) that interact with [...] Read more.
From autonomous vehicles to robotics and machinery, organizations are developing autonomous transportation systems in various domains. Strategic incentives point towards a fourth industrial revolution of cyber–physical systems with higher levels of automation and connectivity throughout the Internet of Things (IoT) that interact with the physical world. In the construction and mining sectors, these developments are still at their infancy, and practitioners are interested in autonomous solutions to enhance efficiency and reliability. This paper illustrates the enhanced design of a driverless bulldozer prototype using IoT-based solutions for the remote control and navigation tracking of the mobile machinery. We illustrate the integration of a cloud application, communication protocols and a wireless communication network to control a small-scale bulldozer from a remote workstation. Furthermore, we explain a new tracking functionality of work completion using maps and georeferenced indicators available via a user interface. Finally, we provide a preliminary safety and security risk assessment of the system prototype and propose guidance for application in real-scale machinery. Full article
(This article belongs to the Special Issue IoT Applications and Industry 4.0)
Show Figures

Figure 1

Figure 1
<p>Cyber–physical systems (CPS) master diagram as multi-layered system representation [<a href="#B1-information-10-00343" class="html-bibr">1</a>].</p>
Full article ">Figure 2
<p>System representation as multi-layered CPS and environments.</p>
Full article ">Figure 3
<p>Prototype main views and parts explained (<b>a</b>) Front view; (<b>b</b>) left side view; (<b>c</b>) bottom view.</p>
Full article ">Figure 4
<p>Developed user interface with Global Position System (GPS) tracking designed in cloud platform.</p>
Full article ">Figure 5
<p>Flow diagram for route assignment in cloud platform.</p>
Full article ">Figure 6
<p>Flow diagram for GPS tracking in cloud platform.</p>
Full article ">Figure 7
<p>Mapping of threat actors and cyber–physical attack surfaces in CPS master diagram.</p>
Full article ">
31 pages, 2001 KiB  
Article
Role-Engineering Optimization with Cardinality Constraints and User-Oriented Mutually Exclusive Constraints
by Wei Sun, Hui Su and Hongbing Liu
Information 2019, 10(11), 342; https://doi.org/10.3390/info10110342 - 4 Nov 2019
Cited by 7 | Viewed by 3395
Abstract
Role-based access control (RBAC) is one of the most popular access-control mechanisms because of its convenience for management and various security policies, such as cardinality constraints, mutually exclusive constraints, and user-capability constraints. Role-engineering technology is an effective method to construct RBAC systems. However, [...] Read more.
Role-based access control (RBAC) is one of the most popular access-control mechanisms because of its convenience for management and various security policies, such as cardinality constraints, mutually exclusive constraints, and user-capability constraints. Role-engineering technology is an effective method to construct RBAC systems. However, mining scales are very large, and there are redundancies in the mining results. Furthermore, conventional role-engineering methods not only do not consider more than one cardinality constraint, but also cannot ensure authorization security. To address these issues, this paper proposes a novel method called role-engineering optimization with cardinality constraints and user-oriented mutually exclusive constraints (REO_CCUMEC). First, we convert the basic role mining into a clustering problem, based on the similarities between users and use-partitioning and compression technologies, in order to eliminate redundancies, while maintaining its usability for mining roles. Second, we present three role-optimization problems and the corresponding algorithms for satisfying single or double cardinality constraints. Third, in order to evaluate the performance of authorizations in a role-engineering system, the maximal role assignments are implemented, while satisfying multiple security constraints. The theoretical analyses and experiments demonstrate the accuracy, effectiveness, and efficiency of the proposed method. Full article
(This article belongs to the Section Information Systems)
Show Figures

Figure 1

Figure 1
<p>Comparison of <span class="html-italic">sim<sub>P</sub></span>(<span class="html-italic">PA<sub>compressed</sub></span>,<span class="html-italic">PA<sub>initial</sub></span>).</p>
Full article ">Figure 2
<p>Comparison of <span class="html-italic">sim<sub>U</sub></span>(<span class="html-italic">UA<sub>compressed</sub></span>,<span class="html-italic">UA<sub>initial</sub></span>).</p>
Full article ">Figure 3
<p>Performance comparison under the UCC in Domino.</p>
Full article ">Figure 4
<p>Performance comparison under the UCC in Healthcare.</p>
Full article ">Figure 5
<p>Performance comparison under the PCC in Domino.</p>
Full article ">Figure 6
<p>Performance comparison under the PCC in Healthcare.</p>
Full article ">Figure 7
<p>Performance of our method with a different <span class="html-italic">MRC<sub>user</sub></span> and <span class="html-italic">C</span>.</p>
Full article ">Figure 8
<p>Performance of our method with different <span class="html-italic">δ</span> values.</p>
Full article ">
22 pages, 7817 KiB  
Article
Fuzzy Reinforcement Learning and Curriculum Transfer Learning for Micromanagement in Multi-Robot Confrontation
by Chunyang Hu and Meng Xu
Information 2019, 10(11), 341; https://doi.org/10.3390/info10110341 - 2 Nov 2019
Cited by 6 | Viewed by 3940
Abstract
Multi-Robot Confrontation on physics-based simulators is a complex and time-consuming task, but simulators are required to evaluate the performance of the advanced algorithms. Recently, a few advanced algorithms have been able to produce considerably complex levels in the context of the robot confrontation [...] Read more.
Multi-Robot Confrontation on physics-based simulators is a complex and time-consuming task, but simulators are required to evaluate the performance of the advanced algorithms. Recently, a few advanced algorithms have been able to produce considerably complex levels in the context of the robot confrontation system when the agents are facing multiple opponents. Meanwhile, the current confrontation decision-making system suffers from difficulties in optimization and generalization. In this paper, a fuzzy reinforcement learning (RL) and the curriculum transfer learning are applied to the micromanagement for robot confrontation system. Firstly, an improved Q-learning in the semi-Markov decision-making process is designed to train the agent and an efficient RL model is defined to avoid the curse of dimensionality. Secondly, a multi-agent RL algorithm with parameter sharing is proposed to train the agents. We use a neural network with adaptive momentum acceleration as a function approximator to estimate the state-action function. Then, a method of fuzzy logic is used to regulate the learning rate of RL. Thirdly, a curriculum transfer learning method is used to extend the RL model to more difficult scenarios, which ensures the generalization of the decision-making system. The experimental results show that the proposed method is effective. Full article
Show Figures

Figure 1

Figure 1
<p>Reinforcement learning architecture.</p>
Full article ">Figure 2
<p>Curves for the Membership functions. (<b>a</b>) Reward/Input membership function. (<b>b</b>) Learning rate/Output membership function.</p>
Full article ">Figure 3
<p>The learning model of agent architecture. The decision-making neural network is used as the approximator for the state-action function.</p>
Full article ">Figure 4
<p>Decision-making neural network architecture.</p>
Full article ">Figure 5
<p>Curriculum transfer learning with an intermediate task and decay function.</p>
Full article ">Figure 6
<p>Framework for the proposed method for micromanagement.</p>
Full article ">Figure 7
<p>Robot confrontation platform. (<b>a</b>) a platform for the tank battle system, (<b>b</b>) diagram of absolute and relative angles.</p>
Full article ">Figure 8
<p>The experiment for robot migration.</p>
Full article ">Figure 9
<p>The comparison curve of Q value: (<b>a</b>) The change curve of <math display="inline"><semantics> <mrow> <msub> <mi>Q</mi> <mn>3</mn> </msub> </mrow> </semantics></math>; (<b>b</b>) The change curve of <math display="inline"><semantics> <mrow> <msub> <mi>Q</mi> <mn>7</mn> </msub> </mrow> </semantics></math>; (<b>c</b>) The change curve of <math display="inline"><semantics> <mrow> <msub> <mi>Q</mi> <mrow> <mn>15</mn> </mrow> </msub> </mrow> </semantics></math>.</p>
Full article ">Figure 10
<p>The comparison curve of the total score ratio.</p>
Full article ">Figure 11
<p>The curve of the fluctuation value of the total score ratio.</p>
Full article ">Figure 12
<p>The curve of the Defensive score. (<b>a</b>) The defensive score of neural network (NN) without adaptive momentum (AWM); (<b>b</b>) The defensive score of NN with AWM.</p>
Full article ">Figure 13
<p>Results of the fuzzy method.</p>
Full article ">Figure 14
<p>Comparison of learning results for different learning rates.</p>
Full article ">Figure 15
<p>Simulation experiments for the TF method.</p>
Full article ">Figure 16
<p>Comparisons of learning models in score ratio. One model uses transfer learning, the other does not use transfer learning.</p>
Full article ">Figure 17
<p>Comparisons of learning models in the defensive score. (<b>a</b>) The defensive score for LM with TF and TD_team; (<b>b</b>) Defensive score for LM without TF and TD_team.</p>
Full article ">Figure 18
<p>Comparisons of learning models in score ratio.</p>
Full article ">
15 pages, 974 KiB  
Article
Approximate Completed Trace Equivalence of ILAHSs Based on SAS Solving
by Honghui He, Jinzhao Wu and Juxia Xiong
Information 2019, 10(11), 340; https://doi.org/10.3390/info10110340 - 1 Nov 2019
Cited by 1 | Viewed by 2361
Abstract
The ILAHS (inhomogeneous linear algebraic hybrid system) is a kind of classic hybrid system. For the purpose of optimizing the design of ILAHS, one important strategy is to introduce equivalence to reduce the states. Recent advances in the hybrid system indicate that approximate [...] Read more.
The ILAHS (inhomogeneous linear algebraic hybrid system) is a kind of classic hybrid system. For the purpose of optimizing the design of ILAHS, one important strategy is to introduce equivalence to reduce the states. Recent advances in the hybrid system indicate that approximate trace equivalence can further simplify the design of ILAHS. To address this issue, the paper first introduces the trajectory metric d t r j for measuring the deviation of two hybrid systems’ behaviors. Given a deviation ε 0 , the original ILAHS of H 1 can be transformed to the approximate ILAHS of H 2 , then in trace equivalence semantics, H 2 is further reduced to H 3 with the same functions, and hence H 1 is ε -approximate trace equivalent to H 3 . In particular, ε = 0 is a traditional trace equivalence. We implement an approach based on RealRootClassification to determine the approximation between the ILAHSs. The paper also shows that the existing approaches are only special cases of our method. Finally, we illustrate the effectiveness and practicality of our method on an example. Full article
Show Figures

Figure 1

Figure 1
<p>Automaton of a thermostat.</p>
Full article ">Figure 2
<p>Inhomogeneous linear algebraic hybrid system (ILAHS) of a thermostat.</p>
Full article ">Figure 3
<p>An ILAHS trajectory.</p>
Full article ">Figure 4
<p>A trace equivalence example.</p>
Full article ">Figure 5
<p>A completed trace equivalence example.</p>
Full article ">Figure 6
<p>An approximate completed trace equivalence example.</p>
Full article ">Figure 7
<p>Automaton of feed-water control system.</p>
Full article ">Figure 8
<p>ILAHS of feed-water control system.</p>
Full article ">Figure 9
<p>Approximate ILAHS.</p>
Full article ">Figure 10
<p>Reduced automaton.</p>
Full article ">
19 pages, 569 KiB  
Article
A Novel Multi-Attribute Decision Making Method Based on The Double Hierarchy Hesitant Fuzzy Linguistic Generalized Power Aggregation Operator
by Zhengmin Liu, Xiaolan Zhao, Lin Li, Xinya Wang and Di Wang
Information 2019, 10(11), 339; https://doi.org/10.3390/info10110339 - 30 Oct 2019
Cited by 19 | Viewed by 2972
Abstract
A double hierarchy hesitant fuzzy linguistic term set (DHHFLT) is deemed as an effective and powerful linguistic expression which models complex linguistic decision information more accurately by using two different hierarchy linguistic term sets. The purpose of this paper is to propose a [...] Read more.
A double hierarchy hesitant fuzzy linguistic term set (DHHFLT) is deemed as an effective and powerful linguistic expression which models complex linguistic decision information more accurately by using two different hierarchy linguistic term sets. The purpose of this paper is to propose a multi-attribute decision making method to tackle complex decision issues in which attribute values are represented as double hierarchy hesitant fuzzy linguistic numbers, and there are some extreme or unreasonable data in the attribute values. To do this, firstly, four double hierarchy hesitant fuzzy linguistic generalized power aggregation operators are introduced, including the double hierarchy hesitant fuzzy linguistic generalized power average (DHHFLGPA) operator, the double hierarchy hesitant fuzzy linguistic generalized power geometric (DHHFLGPG) operator, and their weighted forms. Thereafter, several favorable properties, as well as representative cases of the proposed operators, are investigated in detail. Moreover, by virtue of the proposed operators, a novel approach is developed for coping with multi-attribute decision making cases in the double hierarchy hesitant fuzzy linguistic context. Finally, an illustrated example is given to demonstrate the practical application of the presented approach, an availability verification is given to show its validity, and a comparative analysis is also conducted to highlight the advantages of the proposed approach. Full article
(This article belongs to the Section Information Theory and Methodology)
Show Figures

Figure 1

Figure 1
<p>The allocations of four different forms of SHLTS.</p>
Full article ">
16 pages, 4649 KiB  
Article
Automatic Wireless Signal Classification: A Neural-Induced Support Vector Machine-Based Approach
by Arfan Haider Wahla, Lan Chen, Yali Wang and Rong Chen
Information 2019, 10(11), 338; https://doi.org/10.3390/info10110338 - 30 Oct 2019
Cited by 2 | Viewed by 2993
Abstract
Automatic Classification of Wireless Signals (ACWS), which is an intermediate step between signal detection and demodulation, is investigated in this paper. ACWS plays a crucial role in several military and non-military applications, by identifying interference sources and adversary attacks, to achieve efficient radio [...] Read more.
Automatic Classification of Wireless Signals (ACWS), which is an intermediate step between signal detection and demodulation, is investigated in this paper. ACWS plays a crucial role in several military and non-military applications, by identifying interference sources and adversary attacks, to achieve efficient radio spectrum management. The performance of traditional feature-based (FB) classification approaches is limited due to their specific input feature set, which in turn results in poor generalization under unknown conditions. Therefore, in this paper, a novel feature-based classifier Neural-Induced Support Vector Machine (NSVM) is proposed, in which the features are learned automatically from raw input signals using Convolutional Neural Networks (CNN). The output of NSVM is given by a Gaussian Support Vector Machine (SVM), which takes the features learned by CNN as its input. The proposed scheme NSVM is trained as a single architecture, and in this way, it learns to minimize a margin-based loss instead of cross-entropy loss. The proposed scheme NSVM outperforms the traditional softmax-based CNN modulation classifier by managing faster convergence of accuracy and loss curves during training. Furthermore, the robustness of the NSVM classifier is verified by extensive simulation experiments under the presence of several non-ideal real-world channel impairments over a range of signal-to-noise ratio (SNR) values. The performance of NSVM is remarkable in classifying wireless signals, such as at low signal-to-noise ratio (SNR), the overall averaged classification accuracy is > 97% at SNR = −2 dB and at higher SNR it achieves overall classification accuracy at > 99%, when SNR = 10 dB. In addition to that, the analytical comparison with other studies shows the performance of NSVM is superior over a range of settings. Full article
Show Figures

Figure 1

Figure 1
<p>A simple block-wise architecture of a Feature-Based (FB) classifier.</p>
Full article ">Figure 2
<p>Convolutional Neural Networks (CNN).</p>
Full article ">Figure 3
<p>Support Vector Machine (SVM) separating the hyperplane for Binary Classification.</p>
Full article ">Figure 4
<p>Neural-Induced Support Vector Machine (NSVM) Architecture.</p>
Full article ">Figure 5
<p>Training and validation curves of accuracy and loss of NSVM classifier. The <span class="html-italic">x</span>-axis denotes the training epochs.</p>
Full article ">Figure 6
<p>Training and validation curves of accuracy and loss of the CNN model with the softmax classifier. The <span class="html-italic">x</span>-axis denotes the training epochs.</p>
Full article ">Figure 7
<p>The performance of NSVM for different individual modulation schemes.</p>
Full article ">Figure 8
<p>Performance of NSVM with different sampling points.</p>
Full article ">Figure 9
<p>Performance of NSVM for QAM16 and QAM64 with <span class="html-italic">N</span> = 1024, 2048 sampling points.</p>
Full article ">Figure 10
<p>Performance of NSVM with Different Carrier Frequency Offset in received signal.</p>
Full article ">Figure 11
<p>Performance of NSVM with different Phase Offsets.</p>
Full article ">Figure 12
<p>The Performance of NSVM with Different Timing Offsets.</p>
Full article ">Figure 13
<p>The Performance of NSVM with different Doppler Shifts relative to Velocity.</p>
Full article ">
27 pages, 3667 KiB  
Review
A Botnets Circumspection: The Current Threat Landscape, and What We Know So Far
by Emmanuel C. Ogu, Olusegun A. Ojesanmi, Oludele Awodele and ‘Shade Kuyoro
Information 2019, 10(11), 337; https://doi.org/10.3390/info10110337 - 30 Oct 2019
Cited by 19 | Viewed by 14259
Abstract
Botnets have carved a niche in contemporary networking and cybersecurity due to the impact of their operations. The botnet threat continues to evolve and adapt to countermeasures as the security landscape continues to shift. As research efforts attempt to seek a deeper and [...] Read more.
Botnets have carved a niche in contemporary networking and cybersecurity due to the impact of their operations. The botnet threat continues to evolve and adapt to countermeasures as the security landscape continues to shift. As research efforts attempt to seek a deeper and robust understanding of the nature of the threat for more effective solutions, it becomes necessary to again traverse the threat landscape, and consolidate what is known so far about botnets, that future research directions could be more easily visualised. This research uses the general exploratory approach of the qualitative methodology to survey the current botnet threat landscape: Covering the typology of botnets and their owners, the structure and lifecycle of botnets, botnet attack modes and control architectures, existing countermeasure solutions and limitations, as well as the prospects of a botnet threat. The product is a consolidation of knowledge pertaining the nature of the botnet threat; which also informs future research directions into aspects of the threat landscape where work still needs to be done. Full article
(This article belongs to the Special Issue Botnets)
Show Figures

Figure 1

Figure 1
<p>Generic Structure of a Botnet.</p>
Full article ">Figure 2
<p>Internet Crime Complaint Centre (IC3) Cybercrime Statistics (2000–2018).</p>
Full article ">Figure 3
<p>Known Botnet command and control (C&amp;C) Architectures.</p>
Full article ">Figure 4
<p>Generic Botnet Lifecycle.</p>
Full article ">Figure 5
<p>A basic deployment of Honeypots.</p>
Full article ">Figure 6
<p>A basic deployment of a Darknet.</p>
Full article ">Figure 7
<p>The Current Threat Landscape—What We Know So Far about Botnets.</p>
Full article ">
20 pages, 2691 KiB  
Article
Resource Allocation Combining Heuristic Matching and Particle Swarm Optimization Approaches: The Case of Downlink Non-Orthogonal Multiple Access
by Dimitrios Pliatsios and Panagiotis Sarigiannidis
Information 2019, 10(11), 336; https://doi.org/10.3390/info10110336 - 30 Oct 2019
Cited by 22 | Viewed by 3838
Abstract
The ever-increasing requirement of massive connectivity, due to the rapid deployment of internet of things (IoT) devices, in the emerging 5th generation (5G) mobile networks commands for even higher utilization of the available spectrum. Non-orthogonal multiple access (NOMA) is a promising solution that [...] Read more.
The ever-increasing requirement of massive connectivity, due to the rapid deployment of internet of things (IoT) devices, in the emerging 5th generation (5G) mobile networks commands for even higher utilization of the available spectrum. Non-orthogonal multiple access (NOMA) is a promising solution that can effectively accommodate a higher number of users, resulting in increased spectrum utilization. In this work, we aim to maximize the total throughput of a NOMA system, while maintaining a good level of fairness among the users. We propose a three-step method where the first step matches the users to the channels using a heuristic matching algorithm, while the second step utilizes the particle swarm optimization algorithm to allocate the power to each channel. In the third step, the power allocated to each channel is further distributed to the multiplexed users based on their respective channel gains. Based on extensive performance simulations, the proposed method offers notable improvement, e.g., 15% in terms of system throughput and 55% in terms of user fairness. Full article
(This article belongs to the Special Issue IoT Applications and Industry 4.0)
Show Figures

Figure 1

Figure 1
<p>Conceptual comparison between (<b>a</b>) orthogonal multiple access (OMA) and (<b>b</b>) non-orthogonal multiple access (NOMA).</p>
Full article ">Figure 2
<p>Conceptual example of the proposed approach.</p>
Full article ">Figure 3
<p>Achieved system throughput for <math display="inline"><semantics> <mrow> <mi>K</mi> <mo>=</mo> <mn>10</mn> </mrow> </semantics></math> users, when the number of channel ranges from 8 to 128.</p>
Full article ">Figure 4
<p>Achieved system throughput for <math display="inline"><semantics> <mrow> <mi>S</mi> <mo>=</mo> <mn>128</mn> </mrow> </semantics></math> channels, when the number of users ranges from 6 to 20.</p>
Full article ">Figure 5
<p>Gini fairness index for <math display="inline"><semantics> <mrow> <mi>K</mi> <mo>=</mo> <mn>10</mn> </mrow> </semantics></math> users, when the number of channel ranges from 8 to 128.</p>
Full article ">Figure 6
<p>Gini fairness index for <math display="inline"><semantics> <mrow> <mi>S</mi> <mo>=</mo> <mn>128</mn> </mrow> </semantics></math> channels, when the number of users ranges from 6 to 20.</p>
Full article ">Figure 7
<p>Average number of unconnected users for <math display="inline"><semantics> <mrow> <mi>K</mi> <mo>=</mo> <mn>10</mn> </mrow> </semantics></math> users, when the number of channel ranges from 8 to 128.</p>
Full article ">Figure 8
<p>Average number of unconnected users for <math display="inline"><semantics> <mrow> <mi>S</mi> <mo>=</mo> <mn>128</mn> </mrow> </semantics></math> channels, when the number of users ranges from 6 to 20.</p>
Full article ">Figure 9
<p>Average user throughput for <math display="inline"><semantics> <mrow> <mi>S</mi> <mo>=</mo> <mn>128</mn> </mrow> </semantics></math> channels, when the number of users ranges from 6 to 20.</p>
Full article ">Figure 10
<p>Percentage of users that achieve lower performance than the quality of service (QoS) threshold, for <math display="inline"><semantics> <mrow> <mi>S</mi> <mo>=</mo> <mn>64</mn> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mi>N</mi> <mo>=</mo> <mn>10</mn> </mrow> </semantics></math>.</p>
Full article ">
18 pages, 902 KiB  
Article
Studying Transaction Fees in the Bitcoin Blockchain with Probabilistic Logic Programming
by Damiano Azzolini, Fabrizio Riguzzi and Evelina Lamma
Information 2019, 10(11), 335; https://doi.org/10.3390/info10110335 - 30 Oct 2019
Cited by 20 | Viewed by 6726
Abstract
In Bitcoin, if a miner is able to solve a computationally hard problem called proof of work, it will receive an amount of bitcoin as a reward which is the sum of the fees for the transactions included in a block plus an [...] Read more.
In Bitcoin, if a miner is able to solve a computationally hard problem called proof of work, it will receive an amount of bitcoin as a reward which is the sum of the fees for the transactions included in a block plus an amount inversely proportional to the number of blocks discovered so far. At the moment of writing, the block reward is several orders of magnitude greater than the sum of transaction fees. Usually, miners try to collect the largest reward by including transactions associated with high fees. The main purpose of transaction fees is to prevent network spamming. However, they are also used to prioritize transactions. In order to use the minimum amount of fees, users usually have to find a compromise between fees and urgency of a transaction. In this paper, we develop a probabilistic logic model to experimentally analyze how fees affect confirmation time and miner’s revenue and to predict if an increase of average fees will generate a situation when the miner gets more reward by not following the protocol. Full article
(This article belongs to the Special Issue Blockchain and Smart Contract Technologies)
Show Figures

Figure 1

Figure 1
<p>The graph relates the average Bitcoin fee rate and the miner profit. Data are computed by setting the parameters for the Gaussian distribution for block size as <math display="inline"><semantics> <mrow> <mi>μ</mi> <mo>=</mo> <mn>700</mn> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <msup> <mi>σ</mi> <mn>2</mn> </msup> <mo>=</mo> <mn>25</mn> </mrow> </semantics></math> and for rewards as <math display="inline"><semantics> <mrow> <msup> <mi>σ</mi> <mn>2</mn> </msup> <mo>=</mo> <mn>5</mn> </mrow> </semantics></math> and <math display="inline"><semantics> <mi>μ</mi> </semantics></math> according to the legend. The dashed lines represent the values computed with <tt>mc_expectation/3</tt> (without observations).</p>
Full article ">Figure 2
<p>The graph shows how an increasing size of a block influences the average profit obtained from fees. The parameters for the distribution for block size are <math display="inline"><semantics> <mrow> <msup> <mi>σ</mi> <mn>2</mn> </msup> <mo>=</mo> <mn>25</mn> </mrow> </semantics></math> and <math display="inline"><semantics> <mi>μ</mi> </semantics></math> variable and for the reward <math display="inline"><semantics> <mrow> <mi>μ</mi> <mo>=</mo> <mn>17</mn> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <msup> <mi>σ</mi> <mn>2</mn> </msup> <mo>=</mo> <mn>2</mn> </mrow> </semantics></math>. Dashed lines represent the values computed without observations.</p>
Full article ">Figure 3
<p>The graph shows how transaction fees influence the probability of confirmation in <span class="html-italic">N</span> blocks. We selected a value of fee rate (<math display="inline"><semantics> <mi>ϕ</mi> </semantics></math>) for the transaction under consideration and then computed how probability changes according observed fee rate.</p>
Full article ">Figure 4
<p>Results for threshold experiment. The first two graphs are obtained by considering that a successful attack was due to the fact that the attacker was able to create a chain with a length equal to the main chain. The last two (bottom) consider a successful attack a private chain one block longer than the main chain. Graphs on the left have <math display="inline"><semantics> <mrow> <mi>σ</mi> <mo>=</mo> <mn>1</mn> </mrow> </semantics></math>, for the graphs on the right, <math display="inline"><semantics> <mrow> <mi>σ</mi> <mo>=</mo> <mn>2</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 5
<p>Results for value test. Values on the left are computed with <math display="inline"><semantics> <mrow> <mi>β</mi> <mo>=</mo> <mn>0.15</mn> </mrow> </semantics></math> while graphs on the right have <math display="inline"><semantics> <mrow> <mi>β</mi> <mo>=</mo> <mn>0.25</mn> </mrow> </semantics></math>. As before, graphs at the top contain values computed considering a successful attack, the creation of a private chain with length equal to the main chain. At the bottom, the attacker succeeds only if its private chain is one block longer than the honest one.</p>
Full article ">Figure 6
<p>The graphs show that positive expected values can be obtained only with significant values of <math display="inline"><semantics> <mi>σ</mi> </semantics></math> and <math display="inline"><semantics> <mi>β</mi> </semantics></math>.</p>
Full article ">
12 pages, 757 KiB  
Article
Relative Reduction of Neighborhood-Covering Pessimistic Multigranulation Rough Set Based on Evidence Theory
by Xiaoying You, Jinjin Li and Hongkun Wang
Information 2019, 10(11), 334; https://doi.org/10.3390/info10110334 - 29 Oct 2019
Cited by 14 | Viewed by 2522
Abstract
Relative reduction of multiple neighborhood-covering with multigranulation rough set has been one of the hot research topics in knowledge reduction theory. In this paper, we explore the relative reduction of covering information system by combining the neighborhood-covering pessimistic multigranulation rough set with evidence [...] Read more.
Relative reduction of multiple neighborhood-covering with multigranulation rough set has been one of the hot research topics in knowledge reduction theory. In this paper, we explore the relative reduction of covering information system by combining the neighborhood-covering pessimistic multigranulation rough set with evidence theory. First, the lower and upper approximations of multigranulation rough set in neighborhood-covering information systems are introduced based on the concept of neighborhood of objects. Second, the belief and plausibility functions from evidence theory are employed to characterize the approximations of neighborhood-covering multigranulation rough set. Then the relative reduction of neighborhood-covering information system is investigated by using the belief and plausibility functions. Finally, an algorithm for computing a relative reduction of neighborhood-covering pessimistic multigranulation rough set is proposed according to the significance of coverings defined by the belief function, and its validity is examined by a practical example. Full article
(This article belongs to the Section Information Theory and Methodology)
20 pages, 720 KiB  
Article
Internet of Things Infrastructure for Security and Safety in Public Places
by Angelos Chatzimichail, Christos Chatzigeorgiou, Athina Tsanousa, Dimos Ntioudis, Georgios Meditskos, Fotis Andritsopoulos, Christina Karaberi, Panagiotis Kasnesis, Dimitrios G. Kogias, Georgios Gorgogetas, Stefanos Vrochidis, Charalampos Patrikakis and Ioannis Kompatsiaris
Information 2019, 10(11), 333; https://doi.org/10.3390/info10110333 - 28 Oct 2019
Cited by 7 | Viewed by 4230
Abstract
We present the technologies and the theoretical background of an intelligent interconnected infrastructure for public security and safety. The innovation of the framework lies in the intelligent combination of devices and human information towards human and situational awareness, so as to provide a [...] Read more.
We present the technologies and the theoretical background of an intelligent interconnected infrastructure for public security and safety. The innovation of the framework lies in the intelligent combination of devices and human information towards human and situational awareness, so as to provide a protection and security environment for citizens. The framework is currently being used to support visitors in public spaces and events, by creating the appropriate infrastructure to address a set of urgent situations, such as health-related problems and missing children in overcrowded environments, supporting smart links between humans and entities on the basis of goals, and adapting device operation to comply with human objectives, profiles, and privacy. State-of-the-art technologies in the domain of IoT data collection and analytics are combined with localization techniques, ontologies, reasoning mechanisms, and data aggregation in order to acquire a better understanding of the ongoing situation and inform the necessary people and devices to act accordingly. Finally, we present the first results of people localization and the platforms’ ontology and representation framework. Full article
(This article belongs to the Special Issue IoT Applications and Industry 4.0)
Show Figures

Figure 1

Figure 1
<p>DESMOS system architecture.</p>
Full article ">Figure 2
<p>Map of the place of measurements.0.x:0 for the ground floor and x is the number of the office.</p>
Full article ">Figure 3
<p>(<b>a</b>) Scatter Plots of band 2 in the hall. (<b>b</b>) Scatter Plots of band 3 in the hall. (<b>c</b>) Scatter Plots of band 2 in outdoors. (<b>d</b>) Scatter Plots of band 3 in outdoors.</p>
Full article ">Figure 4
<p>Filtered RSSI recordings using Band 2 in the office.</p>
Full article ">Figure 5
<p>Filtered RSSI recordings using Band 2 in the hall.</p>
Full article ">Figure 6
<p>Filtered RSSI recordings using Band 2 in the outdoor space.</p>
Full article ">Figure 7
<p>Primary ontologies in DESMOS.</p>
Full article ">Figure 8
<p>Entities in Desmos ontology.</p>
Full article ">Figure 9
<p>Action entity.</p>
Full article ">Figure 10
<p>Event entity.</p>
Full article ">Figure 11
<p>Data Entity.</p>
Full article ">Figure 12
<p>Sensor entity.</p>
Full article ">Figure 13
<p>Agent entity.</p>
Full article ">Figure 14
<p>The Unified Modeling Language (UML) diagram of the MylosKidFinder use case.</p>
Full article ">
22 pages, 1788 KiB  
Article
The Construction of the Past: Towards a Theory for Knowing the Past
by Kenneth Thibodeau
Information 2019, 10(11), 332; https://doi.org/10.3390/info10110332 - 28 Oct 2019
Cited by 11 | Viewed by 4485
Abstract
This paper presents Constructed Past Theory, an epistemological theory about how we come to know things that happened or existed in the past. The theory is expounded both in text and in a formal model comprising UML class diagrams. The ideas presented here [...] Read more.
This paper presents Constructed Past Theory, an epistemological theory about how we come to know things that happened or existed in the past. The theory is expounded both in text and in a formal model comprising UML class diagrams. The ideas presented here have been developed in a half century of experience as a practitioner in the management of information and automated systems in the US government and as a researcher in several collaborations, notably the four international and multidisciplinary InterPARES projects. This work is part of a broader initiative, providing a conceptual framework for reformulating the concepts and theories of archival science in order to enable a new discipline whose assertions are empirically and, wherever possible, quantitatively testable. The new discipline, called archival engineering, is intended to provide an appropriate, coherent foundation for the development of systems and applications for managing, preserving and providing access to digital information, development which is necessitated by the exponential growth and explosive diversification of data recorded in digital form and the use of digital data in an ever increasing variety of domains. Both the text and model are an initial exposition of the theory that both requires and invites further development. Full article
(This article belongs to the Special Issue Big Data Research, Development, and Applications––Big Data 2018)
Show Figures

Figure 1

Figure 1
<p>Framework for Construction of the Past. The construction of the past centers on the Target Past, which comprises both an Intentional Domain that specifies what is being attempted and why and an In-Progress Construction, which is the state of construction during the process. The final output is a Constructed Past.</p>
Full article ">Figure 2
<p>Sphere of Interest. The Sphere of Interest specifies what Entities, Events and States of Affairs are thought to be relevant in a Target Past. It may also include Processes, which are sets of related Events.</p>
Full article ">Figure 3
<p>Entity Involvement in Event. Every Event must involve at least one Entity. An Entity may be involved in different ways, such as actively participating, observing, being impacted or being used.</p>
Full article ">Figure 4
<p>Event and Process. An Event may be part of a Process, which is a set of related Events. When it is, it is called a Step. A Process may follow a Process Pattern. When it does, the Steps in the actual Process may correspond to Pattern Steps in the Process Pattern; however, there may be actual steps in addition to those indicated in the Process Pattern.</p>
Full article ">Figure 5
<p>Human Action. When a Human Agent has an Active Role in an Event, the Event is specifically an instance of the subclass, Action. When the Action is part of a set of related Actions, the set is termed an Activity. Activity is a subclass of Process. Different kinds of Human Agent may be involved in an Action, as described in the text.</p>
Full article ">Figure 6
<p>State of Affairs Internal Composition. A State of Affairs is determined by one or more Persistent Properties or Persistent Relationships. The relevant properties or relationships belong to one or more classes that exist within the Target Past.</p>
Full article ">Figure 7
<p>Construction Material in Context. Construction Material comprises information objects that are deemed relevant and potentially useful in constructing the past. Thus, they must relate to the Sphere of Interest and should satisfy the Intent of Construction. Relevant Construction Material is used in In-Progress Construction.</p>
Full article ">Figure 8
<p>Construction Materials. The two main types of materials used in construction of the past are Vestiges and Reflections, shown as classes in the diagram. A Vestige is an object that existed in and survives from the time frame of the Sphere of Interest, while a Reflection is an information object created in the process of construction.</p>
Full article ">
14 pages, 4248 KiB  
Article
Wideband Spectrum Sensing Method Based on Channels Clustering and Hidden Markov Model Prediction
by Huan Wang, Bin Wu, Yuancheng Yao and Mingwei Qin
Information 2019, 10(11), 331; https://doi.org/10.3390/info10110331 - 25 Oct 2019
Cited by 5 | Viewed by 2699
Abstract
Spectrum sensing is the necessary premise for implementing cognitive radio technology. The conventional wideband spectrum sensing methods mainly work with sweeping frequency and still face major challenges in performance and efficiency. This paper introduces a new wideband spectrum sensing method based on channels [...] Read more.
Spectrum sensing is the necessary premise for implementing cognitive radio technology. The conventional wideband spectrum sensing methods mainly work with sweeping frequency and still face major challenges in performance and efficiency. This paper introduces a new wideband spectrum sensing method based on channels clustering and prediction. This method counts on the division of the wideband spectrum into uniform sub-channels, and employs a density-based clustering algorithm called Ordering Points to Identify Clustering Structure (OPTICS) to cluster the channels in view of the correlation between the channels. The detection channel (DC) is selected and detected for each cluster, and states of other channels (estimated channels, ECs) in the cluster are then predicted with Hidden Markov Model (HMM), so that all channels states of the wideband spectrum are finally obtained. The simulation results show that the proposed method could effectively improve the wideband spectrum sensing performance. Full article
(This article belongs to the Section Information and Communications Technology)
Show Figures

Figure 1

Figure 1
<p>Conventional method for wideband spectrum sensing.</p>
Full article ">Figure 2
<p>Wideband spectrum sensing method based on clustering and prediction.</p>
Full article ">Figure 3
<p>Channel occupancy and channel correlation distribution. (<b>a</b>) NE GSM1800 DL channel occupancy distribution. (<b>b</b>) NE GSM1800 DL channel correlation distribution. (<b>c</b>) NE TV channel occupancy distribution. (<b>d</b>) NE TV channel correlation distribution.</p>
Full article ">Figure 4
<p>HMM-based channel prediction model.</p>
Full article ">Figure 5
<p>OPTICS algorithm clustering NE TV band channels. (<b>a</b>) Reachability-distance curve (ε = 0.11, MinPts = 10). (<b>b</b>) channels clustering result (ε = 0.11, MinPts = 10). (<b>c</b>) Reachability-distance curve (ε = 0.21, MinPts = 10). (<b>d</b>) channels clustering result (ε = 0.21, MinPts = 10). (<b>e</b>) Reachability-distance curve (ε = 0.21, MinPts = 20). (<b>f</b>) channels clustering result (ε = 0.21, MinPts = 20).</p>
Full article ">Figure 5 Cont.
<p>OPTICS algorithm clustering NE TV band channels. (<b>a</b>) Reachability-distance curve (ε = 0.11, MinPts = 10). (<b>b</b>) channels clustering result (ε = 0.11, MinPts = 10). (<b>c</b>) Reachability-distance curve (ε = 0.21, MinPts = 10). (<b>d</b>) channels clustering result (ε = 0.21, MinPts = 10). (<b>e</b>) Reachability-distance curve (ε = 0.21, MinPts = 20). (<b>f</b>) channels clustering result (ε = 0.21, MinPts = 20).</p>
Full article ">Figure 6
<p><math display="inline"><semantics> <mrow> <msub> <mi>P</mi> <mi>m</mi> </msub> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <msub> <mi>P</mi> <mi>f</mi> </msub> </mrow> </semantics></math> predicted by HMM for NE GSM1800 DL band. (<b>a</b>) The relational graph between <math display="inline"><semantics> <mrow> <msub> <mi>P</mi> <mi>m</mi> </msub> </mrow> </semantics></math> and CCF with different ε and MinPts. (<b>b</b>) The relational graph between <math display="inline"><semantics> <mrow> <msub> <mi>P</mi> <mi>f</mi> </msub> </mrow> </semantics></math> and CCF with different ε and MinPts.</p>
Full article ">Figure 7
<p><math display="inline"><semantics> <mrow> <msub> <mi>P</mi> <mi>m</mi> </msub> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <msub> <mi>P</mi> <mi>f</mi> </msub> </mrow> </semantics></math> predicted by HMM for NE TV (614-698MHz) frequency band. (<b>a</b>) The relational graph between <math display="inline"><semantics> <mrow> <msub> <mi>P</mi> <mi>m</mi> </msub> </mrow> </semantics></math> and CCF with different ε and MinPts. (<b>b</b>) The relational graph between <math display="inline"><semantics> <mrow> <msub> <mi>P</mi> <mi>f</mi> </msub> </mrow> </semantics></math> and CCF with different ε and MinPts.</p>
Full article ">Figure 8
<p><math display="inline"><semantics> <mrow> <msub> <mi>P</mi> <mi>m</mi> </msub> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <msub> <mi>P</mi> <mi>f</mi> </msub> </mrow> </semantics></math> with different EGs. (<b>a</b>) <math display="inline"><semantics> <mrow> <msub> <mi>P</mi> <mi>m</mi> </msub> </mrow> </semantics></math> V.S. EG. (<b>b</b>) <math display="inline"><semantics> <mrow> <msub> <mi>P</mi> <mi>f</mi> </msub> </mrow> </semantics></math> V.S. EG.</p>
Full article ">
19 pages, 3191 KiB  
Article
Analysis of Data Persistence in Collaborative Content Creation Systems: The Wikipedia Case
by Lorenzo Bracciale, Pierpaolo Loreti, Andrea Detti and Nicola Blefari Melazzi
Information 2019, 10(11), 330; https://doi.org/10.3390/info10110330 - 25 Oct 2019
Cited by 1 | Viewed by 3264
Abstract
A very common problem in designing caching/prefetching systems, distribution networks, search engines, and web-crawlers is determining how long a given content lasts before being updated, i.e., its update frequency. Indeed, while some content is not frequently updated (e.g., videos), in other cases revisions [...] Read more.
A very common problem in designing caching/prefetching systems, distribution networks, search engines, and web-crawlers is determining how long a given content lasts before being updated, i.e., its update frequency. Indeed, while some content is not frequently updated (e.g., videos), in other cases revisions periodically invalidate contents. In this work, we present an analysis of Wikipedia, currently the 5th most visited website in the world, evaluating the statistics of updates of its pages and their relationship with page view statistics. We discovered that the number of updates of a page follows a lognormal distribution. We provide fitting parameters as well as a goodness of fit analysis, showing the statistical significance of the model to describe the empirical data. We perform an analysis of the views–updates relationship, showing that in a time period of a month, there is a lack of evident correlation between the most updated pages and the most viewed pages. However, observing specific pages, we show that there is a strong correlation between the peaks of views and updates, and we find that in more than 50% of cases, the time difference between the two peaks is less than a week. This reflects the underlying process whereby an event causes both an update and a visit peak that occurs with different time delays. This behavior can pave the way for predictive traffic analysis applications based on content update statistics. Finally, we show how the model can be used to evaluate the performance of an in-network caching scenario. Full article
(This article belongs to the Special Issue Knowledge Discovery on the Web)
Show Figures

Figure 1

Figure 1
<p>Complementary cumulative distribution function (CCDF) of page views computed for the 1000 most popular Wikipedia pages in July 2016.</p>
Full article ">Figure 2
<p>Estimation of the Pareto-shaped parameter <math display="inline"><semantics> <mover accent="true"> <mi>α</mi> <mo stretchy="false">^</mo> </mover> </semantics></math> and the related <span class="html-italic">p</span>-value of the 1000 most popular Wikipedia pages in 2016.</p>
Full article ">Figure 3
<p>Rank-frequency distribution for views of the 1000 most popular Wikipedia pages in July 2016.</p>
Full article ">Figure 4
<p>Revisions of the 1000 most popular Wikipedia pages in February 2016.</p>
Full article ">Figure 5
<p>Estimation of lognormal parameters <math display="inline"><semantics> <mover accent="true"> <mi>σ</mi> <mo stretchy="false">^</mo> </mover> </semantics></math>, <math display="inline"><semantics> <mover accent="true"> <mi>μ</mi> <mo stretchy="false">^</mo> </mover> </semantics></math>, and the related <span class="html-italic">p</span>-value for the update frequency of the 1000 most popular Wikipedia pages in 2016.</p>
Full article ">Figure 6
<p>Rank-frequency plot of the 1000 most popular Wikipedia pages in February 2016.</p>
Full article ">Figure 7
<p>Revisions of the 1000 most popular Wikipedia pages in February 2016, sorted by view rank.</p>
Full article ">Figure 8
<p>Correlation between updates and views of the 1000 most popular Wikipedia (2016) pages.</p>
Full article ">Figure 9
<p>Views and updates of a popular science page (“Gravitational wave”) in February 2016, from 1 February to 1 March.</p>
Full article ">Figure 10
<p>Views and updates of a popular movie page (“Deadpool”) in February 2016, from 1 February to 1 March.</p>
Full article ">Figure 11
<p>Views and updates of a popular public person page (“Donald Trump”) in February 2016, from 1 February to 1 March.</p>
Full article ">Figure 12
<p>Views and updates of a popular music album page (“The Life of Pablo”) in February 2016, from 1 February to 1 March.</p>
Full article ">Figure 13
<p>Boxplot for the time difference between revision and view peaks.</p>
Full article ">Figure 14
<p>Network reference scenario for caching simulations.</p>
Full article ">Figure 15
<p>Cache hit probability for the 200 most popular items for a cache close to the server.</p>
Full article ">Figure 16
<p>Cache hit probability for the 200 most popular items for a cache on the network edge.</p>
Full article ">
Previous Issue
Next Issue
Back to TopTop